Enum SolveStatus 

pub enum SolveStatus {
    Optimal,
    Feasible,
    Infeasible,
    Aborted(AbortReason),
}

What a solver run established about the problem.

Decoupled from whether an incumbent solution was found: Aborted can still carry no solution, while Feasible/Optimal always do (see SolveOutcome::solution).

Variants

Optimal

A feasible solution was found and proven optimal: no better score is reachable. Currently only BranchAndBoundSolver can establish this.

Feasible

A feasible solution was found, but the search ended before optimality could be proven — or the solver used (Backtracking, Local Search, LNS) cannot prove it at all.

Infeasible

The constraint network is provably unsatisfiable: the full search space was exhausted without finding any feasible assignment.

Aborted(AbortReason)

The search stopped (see the contained AbortReason) before finding a feasible assignment and before the search space was exhausted, so neither feasibility nor infeasibility could be established.

Trait Implementations

impl Clone for SolveStatus

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for SolveStatus

impl Debug for SolveStatus

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for SolveStatus

impl PartialEq for SolveStatus

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for SolveStatus