Struct IncrementalParallelSolver 

pub struct IncrementalParallelSolver { /* private fields */ }

Multi-threaded incremental constraint solver.

Re-solves after constraint addition/removal without a full restart when possible:

• On constraint addition: if the current solution is already feasible for the new constraint, no work is needed. Otherwise, only project onto the new constraint (warm start) before running full alternating projections.
• On constraint removal: the solution remains feasible for remaining constraints, so no re-solve is needed; solution_valid is kept true.

Implementations

impl IncrementalParallelSolver

pub fn new(config: ParallelConfig) -> Self

Create a new solver with the given configuration.

pub fn add_constraint(&mut self, constraint: Box<dyn FastConstraint>)

Add a constraint. If a valid solution already exists and it satisfies the new constraint, solution_valid remains true — avoiding a full re-solve.

pub fn remove_constraint(&mut self, idx: usize) -> bool

Remove a constraint by index. Returns false if idx is out of range.

After removal the cached solution (if any) is still feasible for the remaining constraints, so solution_valid is preserved.

pub fn invalidate(&mut self)

Force a full re-solve on the next call to solve.

pub fn current_solution(&self) -> Option<&Array1<f32>>

Return a reference to the cached solution, if any.

pub fn num_constraints(&self) -> usize

Number of registered constraints.

pub fn solve(&mut self, init: Array1<f32>, max_iter: usize) -> SolverResult

Solve incrementally.

• If solution_valid, warm-starts from the cached solution (fewer iterations).
• Otherwise, starts from init.

Uses Dykstra’s alternating projections in parallel (via ParallelFeasibilityChecker).