Enum SearchStatus 

pub enum SearchStatus {
    Optimal,
    TimeLimit,
    BudgetExhausted,
    ErrorBoundReached,
}

Why the search stopped.

Only Optimal means the tree is proven best for the given depth and support; the others mean the search ran out of something first.

Variants

Optimal

The search space was exhausted: no better tree exists.

TimeLimit

The time limit ran out first.

BudgetExhausted

The anytime search ran out of budget to widen with.

ErrorBoundReached

A tree within max_gap of the caller’s error bound was found, and the search stopped there rather than proving optimality.

Implementations

impl SearchStatus

pub fn is_optimal(self) -> bool

Whether the returned tree is proven optimal.

Trait Implementations

impl Clone for SearchStatus

fn clone(&self) -> SearchStatus

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for SearchStatus

impl Debug for SearchStatus

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SearchStatus

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for SearchStatus

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

Formats the value using the given formatter.

impl Eq for SearchStatus

impl PartialEq for SearchStatus

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for SearchStatus

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for SearchStatus