diff --git a/src/rust/coprocessor/physics.rs b/src/rust/coprocessor/physics.rs index b8b4fec9..512d34f5 100644 --- a/src/rust/coprocessor/physics.rs +++ b/src/rust/coprocessor/physics.rs @@ -97,9 +97,9 @@ fn dispatch_sync(op: CoprocessorOp) -> Result { /// 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, diff --git a/src/rust/corpus/embed.rs b/src/rust/corpus/embed.rs index 0d7de3e6..cb55f973 100644 --- a/src/rust/corpus/embed.rs +++ b/src/rust/corpus/embed.rs @@ -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)] diff --git a/src/rust/exchange/lambdapi.rs b/src/rust/exchange/lambdapi.rs index 2f59209a..1af936c8 100644 --- a/src/rust/exchange/lambdapi.rs +++ b/src/rust/exchange/lambdapi.rs @@ -3,7 +3,7 @@ //! Lambdapi proof exchange format. //! -//! Lambdapi (https://github.com/Deducteam/lambdapi) is Dedukti's +//! 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 diff --git a/src/rust/gnn/graph.rs b/src/rust/gnn/graph.rs index 213376a9..e632c259 100644 --- a/src/rust/gnn/graph.rs +++ b/src/rust/gnn/graph.rs @@ -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. diff --git a/src/rust/provers/cadical.rs b/src/rust/provers/cadical.rs index 4a192be4..a5be24c3 100644 --- a/src/rust/provers/cadical.rs +++ b/src/rust/provers/cadical.rs @@ -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 + /// Returns (num_vars, num_clauses, clauses) where each clause is a `Vec` /// of signed literals (positive = variable, negative = negation). fn parse_dimacs(content: &str) -> Result<(usize, usize, Vec>)> { let mut num_vars: usize = 0; @@ -171,7 +171,7 @@ impl CaDiCaLBackend { } } - /// Convert a clause (Vec) into a Term representation + /// Convert a clause (`Vec`) into a Term representation fn clause_to_term(clause: &[i64]) -> Term { if clause.len() == 1 { Term::Const(clause[0].to_string()) diff --git a/src/rust/provers/dreal.rs b/src/rust/provers/dreal.rs index 37c216f5..f4fba71e 100644 --- a/src/rust/provers/dreal.rs +++ b/src/rust/provers/dreal.rs @@ -229,7 +229,7 @@ impl DRealBackend { Ok(DRealResult::Output(trimmed.to_string())) } - /// Extract the delta value from dReal's "delta-sat with delta = " output + /// Extract the delta value from dReal's "delta-sat with delta = ``" output /// /// Falls back to the configured precision if parsing fails. fn extract_delta_value(&self, output: &str) -> f64 { diff --git a/src/rust/provers/kissat.rs b/src/rust/provers/kissat.rs index 4f263660..d5280fe1 100644 --- a/src/rust/provers/kissat.rs +++ b/src/rust/provers/kissat.rs @@ -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 + /// Returns (num_vars, num_clauses, clauses) where each clause is a `Vec` /// of signed literals (positive = variable, negative = negation). fn parse_dimacs(content: &str) -> Result<(usize, usize, Vec>)> { let mut num_vars: usize = 0; @@ -170,7 +170,7 @@ impl KissatBackend { } } - /// Convert a clause (Vec) into a Term representation + /// Convert a clause (`Vec`) into a Term representation fn clause_to_term(clause: &[i64]) -> Term { if clause.len() == 1 { Term::Const(clause[0].to_string()) diff --git a/src/rust/provers/minisat.rs b/src/rust/provers/minisat.rs index 29426bdc..115c36e9 100644 --- a/src/rust/provers/minisat.rs +++ b/src/rust/provers/minisat.rs @@ -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 + /// Returns (num_vars, num_clauses, clauses) where each clause is a `Vec` /// of signed literals (positive = variable, negative = negation). fn parse_dimacs(content: &str) -> Result<(usize, usize, Vec>)> { let mut num_vars: usize = 0; @@ -172,7 +172,7 @@ impl MiniSatBackend { } } - /// Convert a clause (Vec) into a Term representation + /// Convert a clause (`Vec`) into a Term representation fn clause_to_term(clause: &[i64]) -> Term { if clause.len() == 1 { Term::Const(clause[0].to_string())