Enum SearchStrategy 

pub enum SearchStrategy {
    Dfs,
    Bfs,
    Fair,
}

Order in which the resolver explores pending goal states.

Variants

Dfs

Depth-first search: explore the most recent state first (the default).

Bfs

Breadth-first search: explore the oldest pending state first.

Fair

Fair search: round-robin over pending states to avoid starvation.

Implementations

impl SearchStrategy

pub fn from_symbol(symbol: &Symbol) -> Option<Self>

Parses a strategy from its surface symbol (dfs, bfs, or fair).

Returns None for any other symbol name.

pub fn as_symbol(self) -> Symbol

Returns the surface symbol for this strategy (the inverse of SearchStrategy::from_symbol).

Trait Implementations

impl Clone for SearchStrategy

fn clone(&self) -> SearchStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for SearchStrategy

impl Debug for SearchStrategy

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

Formats the value using the given formatter.

impl Default for SearchStrategy

fn default() -> SearchStrategy

Returns the “default value” for a type.

impl Eq for SearchStrategy

impl PartialEq for SearchStrategy

fn eq(&self, other: &SearchStrategy) -> 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 StructuralPartialEq for SearchStrategy