Trait Complexity 

pub trait Complexity {
    const CLASS: ComplexityClass;
    const DETAIL: &'static str = "";
}

Compile-time complexity-class declaration. Every public solver / sampler / analyser in this crate implements this trait, exposing its worst-case class as a const so callers can match on it at compile time.

fn pick_solver<S: Complexity>() {
    match S::CLASS {
        ComplexityClass::Logarithmic | ComplexityClass::SubLinear => {
            // use it — edge-safe
        }
        _ => {
            // fall back to something cheaper or refuse
        }
    }
}

Required Associated Constants

const CLASS: ComplexityClass

Worst-case complexity class on a single-query call. For iterative solvers this is the per-iter cost; the iteration count is bounded by other configuration (max_iterations, tolerance, ef_construction).

Provided Associated Constants

const DETAIL: &'static str = ""

Optional human-readable detail for documentation / MCP tool schemas. Defaults to the short label of CLASS. Override when there’s a non-obvious constant or k-bound.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementors

impl Complexity for ClosureIndicesOp

const CLASS: ComplexityClass = ComplexityClass::SubLinear

impl Complexity for ContrastiveSolveOnChangeOp

const CLASS: ComplexityClass

const DETAIL: &'static str = "Phase-2A: closure (SubLinear) + warm-start solve (Linear) + top-k-in-subset \ (SubLinear). Phase-2B replaces the inner solve with per-entry sublinear-Neumann \ queries scoped to the closure, dropping the orchestrator end-to-end to SubLinear."

impl Complexity for ContrastiveSolveOnChangeSublinearOp

const CLASS: ComplexityClass = ComplexityClass::SubLinear

const DETAIL: &'static str = "Phase-2B: closure (SubLinear) + per-entry sublinear-Neumann (SubLinear) + top-k-in-subset \ (SubLinear). End-to-end SubLinear in n for sparse DD matrices with bounded depth."

impl Complexity for FindAnomalousRowsOp

const CLASS: ComplexityClass

const DETAIL: &'static str = "O(n log k) full-scan baseline today; phase-2 lowers to O(k · log n) via the \ sublinear-Neumann single-entry primitive."

impl Complexity for SolveSingleEntryNeumannOp

const CLASS: ComplexityClass = ComplexityClass::SubLinear

const DETAIL: &'static str = "Single-entry Neumann: O(max_terms · |closure| · branching). Independent of n for \ sparse DD matrices with bounded degree + bounded max_terms. Widens to Linear when \ the closure spans the whole graph."

impl Complexity for IncrementalSolveOp

const CLASS: ComplexityClass

const DETAIL: &'static str = "O(k_warm · nnz(A)) per call where k_warm ≪ k_cold for small deltas on \ well-conditioned DD systems; falls back to full solve when \ nnz(delta) > full_solve_break_even (default 64)."

impl Complexity for SolveOnChangeSublinearOp

const CLASS: ComplexityClass = ComplexityClass::SubLinear

const DETAIL: &'static str = "Closure (SubLinear) + per-entry sublinear-Neumann at each closure index (SubLinear). \ Independent of n for sparse DD matrices with bounded closure_depth + max_terms."

impl Complexity for OptimizedConjugateGradientSolver

const CLASS: ComplexityClass = ComplexityClass::Linear

const DETAIL: &'static str = "O(k · nnz(A)) per iter; k ≈ √κ(A) on SPD inputs."

impl Complexity for NeumannSolver

const CLASS: ComplexityClass = ComplexityClass::Linear

const DETAIL: &'static str = "O(k · nnz(A)) per iter; k bounded by series_tolerance + max_terms (default 200)."

impl Complexity for EventStreamOp

const CLASS: ComplexityClass = ComplexityClass::SubLinear

const DETAIL: &'static str = "Per-event class is the auto-tuned SubLinear orchestrator's. The iterator wrapper \ adds O(1) gate probe + optional O(1) budget consume per event; aggregate cost is \ O(events · per_event_class)."

impl Complexity for JLEmbedding

const CLASS: ComplexityClass = ComplexityClass::Linear

const DETAIL: &'static str = "O(d · k) per project_vector; k = target_dim, capped at original_dim - 1."

impl Complexity for SublinearNeumannSolver

const CLASS: ComplexityClass

const DETAIL: &'static str = "O(log n) per single-entry query on diagonally-dominant systems via JL + recursive Neumann; \ O(n) base case at n ≤ base_case_threshold."

impl Complexity for VerifySparseSolutionOp

const CLASS: ComplexityClass = ComplexityClass::SubLinear

const DETAIL: &'static str = "Residual audit restricted to caller-supplied closure entries. \ O(|entries| · avg_row_nnz) — same class as the SubLinear orchestrator \ whose output it verifies. Independent of n for sparse DD matrices."