Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions src/rust/coprocessor/physics.rs
Original file line number Diff line number Diff line change
Expand Up @@ -97,9 +97,9 @@ fn dispatch_sync(op: CoprocessorOp) -> Result<CoprocessorOutcome> {
/// Classical fourth-order Runge-Kutta step.
///
/// `f(x)` is a kernel selected by name with a parameter vector:
/// - `"harmonic-oscillator"` — params = [omega]; x = [position, momentum];
/// - `"harmonic-oscillator"` — params = `[omega]`; x = [position, momentum];
/// ẋ₀ = x₁, ẋ₁ = -ω²·x₀.
/// - `"exponential-decay"` — params = [lambda]; ẋᵢ = -λ·xᵢ.
/// - `"exponential-decay"` — params = `[lambda]`; ẋᵢ = -λ·xᵢ.
/// - `"linear"` — params = [a, b]; ẋᵢ = a·xᵢ + b.
fn rk4_step(
kernel: &str,
Expand Down
2 changes: 1 addition & 1 deletion src/rust/corpus/embed.rs
Original file line number Diff line number Diff line change
Expand Up @@ -103,7 +103,7 @@ impl Embedder for HashEmbedder {
///
/// Feature layout: every unigram, bigram and trigram of the canonical
/// atom stream is hashed into one of [`STRUCTURAL_EMBED_DIM`] buckets
/// and accumulated with [`NGRAM_WEIGHTS`]; the vector is L2-normalised
/// and accumulated with `NGRAM_WEIGHTS`; the vector is L2-normalised
/// so cosine similarity is meaningful. Deterministic, dependency-free
/// and identical on every platform.
#[derive(Debug, Clone, Default)]
Expand Down
2 changes: 1 addition & 1 deletion src/rust/exchange/lambdapi.rs
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@

//! Lambdapi proof exchange format.
//!
//! Lambdapi (https://github.com/Deducteam/lambdapi) is Dedukti's
//! Lambdapi (<https://github.com/Deducteam/lambdapi>) is Dedukti's
//! successor — a logical framework based on the lambda-Pi calculus
//! modulo rewriting, upward-compatible with Dedukti syntax but with
//! inferable types and a tactic language. This module ships an
Expand Down
2 changes: 1 addition & 1 deletion src/rust/gnn/graph.rs
Original file line number Diff line number Diff line change
Expand Up @@ -515,7 +515,7 @@ impl ProofGraphBuilder {
}
}

/// Add edges from a node to represent its [`TypeInfo`] annotations.
/// Add edges from a node to represent its [`TypeInfo`](crate::types::TypeInfo) annotations.
///
/// Creates labelled subterm nodes for multiplicity, effect, and modality
/// decorations and connects them with the appropriate edge kind.
Expand Down
4 changes: 2 additions & 2 deletions src/rust/provers/cadical.rs
Original file line number Diff line number Diff line change
Expand Up @@ -35,7 +35,7 @@ impl CaDiCaLBackend {

/// Parse DIMACS CNF content into clause sets.
///
/// Returns (num_vars, num_clauses, clauses) where each clause is a Vec<i64>
/// Returns (num_vars, num_clauses, clauses) where each clause is a `Vec<i64>`
/// of signed literals (positive = variable, negative = negation).
fn parse_dimacs(content: &str) -> Result<(usize, usize, Vec<Vec<i64>>)> {
let mut num_vars: usize = 0;
Expand Down Expand Up @@ -171,7 +171,7 @@ impl CaDiCaLBackend {
}
}

/// Convert a clause (Vec<i64>) into a Term representation
/// Convert a clause (`Vec<i64>`) into a Term representation
fn clause_to_term(clause: &[i64]) -> Term {
if clause.len() == 1 {
Term::Const(clause[0].to_string())
Expand Down
2 changes: 1 addition & 1 deletion src/rust/provers/dreal.rs
Original file line number Diff line number Diff line change
Expand Up @@ -229,7 +229,7 @@ impl DRealBackend {
Ok(DRealResult::Output(trimmed.to_string()))
}

/// Extract the delta value from dReal's "delta-sat with delta = <value>" output
/// Extract the delta value from dReal's "delta-sat with delta = `<value>`" output
///
/// Falls back to the configured precision if parsing fails.
fn extract_delta_value(&self, output: &str) -> f64 {
Expand Down
4 changes: 2 additions & 2 deletions src/rust/provers/kissat.rs
Original file line number Diff line number Diff line change
Expand Up @@ -35,7 +35,7 @@ impl KissatBackend {

/// Parse DIMACS CNF content into clause sets.
///
/// Returns (num_vars, num_clauses, clauses) where each clause is a Vec<i64>
/// Returns (num_vars, num_clauses, clauses) where each clause is a `Vec<i64>`
/// of signed literals (positive = variable, negative = negation).
fn parse_dimacs(content: &str) -> Result<(usize, usize, Vec<Vec<i64>>)> {
let mut num_vars: usize = 0;
Expand Down Expand Up @@ -170,7 +170,7 @@ impl KissatBackend {
}
}

/// Convert a clause (Vec<i64>) into a Term representation
/// Convert a clause (`Vec<i64>`) into a Term representation
fn clause_to_term(clause: &[i64]) -> Term {
if clause.len() == 1 {
Term::Const(clause[0].to_string())
Expand Down
4 changes: 2 additions & 2 deletions src/rust/provers/minisat.rs
Original file line number Diff line number Diff line change
Expand Up @@ -37,7 +37,7 @@ impl MiniSatBackend {

/// Parse DIMACS CNF content into clause sets.
///
/// Returns (num_vars, num_clauses, clauses) where each clause is a Vec<i64>
/// Returns (num_vars, num_clauses, clauses) where each clause is a `Vec<i64>`
/// of signed literals (positive = variable, negative = negation).
fn parse_dimacs(content: &str) -> Result<(usize, usize, Vec<Vec<i64>>)> {
let mut num_vars: usize = 0;
Expand Down Expand Up @@ -172,7 +172,7 @@ impl MiniSatBackend {
}
}

/// Convert a clause (Vec<i64>) into a Term representation
/// Convert a clause (`Vec<i64>`) into a Term representation
fn clause_to_term(clause: &[i64]) -> Term {
if clause.len() == 1 {
Term::Const(clause[0].to_string())
Expand Down
Loading