Enum SearchOutcome 

#[non_exhaustive]
pub enum SearchOutcome<P, S> {
    Found {
        path: P,
        stats: S,
    },
    NoPath {
        stats: S,
    },
}

Successful search computation, separate from request validation failures.

Found and NoPath both carry stats so callers can compare effort even when no route exists. Domain-specific input validation remains an outer Err in each owner crate.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Found

A route was found together with algorithm-defined work statistics.

Fields

path: P

Domain path value (grid path, free-space polyline, corridor path, …).

stats: S

Algorithm-defined work counters for this successful search.

NoPath

Exhaustive search found no route, but still produced work statistics.

Fields

stats: S

Algorithm-defined work counters for the exhaustive no-path search.

Implementations

impl<P, S> SearchOutcome<P, S>

pub const fn found(path: P, stats: S) -> SearchOutcome<P, S>

Successful route with work stats (not a validation error).

pub const fn no_path(stats: S) -> SearchOutcome<P, S>

Exhaustive search found no route; still carries work stats for comparison.

pub const fn is_found(&self) -> bool

Whether this outcome is Self::Found (validation failures are outer Err).

pub const fn path(&self) -> Option<&P>

Path when found; None for Self::NoPath.

pub const fn stats(&self) -> &S

Work stats from either branch (Found and NoPath both always carry stats).

impl<P, S> SearchOutcome<P, S>

where P: SearchPathCost,

pub fn cost(&self) -> Option<<P as SearchPathCost>::Cost>

Path cost when found; None for no-path outcomes.

impl<P, S> SearchOutcome<P, S>

where S: SearchVisitStats,

pub fn visited_nodes(&self) -> usize

Algorithm-defined visit count from either found or no-path stats.

Trait Implementations

impl<P, S> Clone for SearchOutcome<P, S>

where P: Clone, S: Clone,

fn clone(&self) -> SearchOutcome<P, S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<P, S> Debug for SearchOutcome<P, S>

where P: Debug, S: Debug,

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

Formats the value using the given formatter.

impl<P, S> Eq for SearchOutcome<P, S>

where P: Eq, S: Eq,

impl From<InterpolatedSearchOutcome> for SearchOutcome<InterpolatedPathOutcome, InterpolatedSearchStats>

fn from( outcome: InterpolatedSearchOutcome, ) -> SearchOutcome<InterpolatedPathOutcome, InterpolatedSearchStats>

Converts to this type from the input type.

impl From<SearchOutcome<InterpolatedPathOutcome, InterpolatedSearchStats>> for InterpolatedSearchOutcome

fn from( outcome: SearchOutcome<InterpolatedPathOutcome, InterpolatedSearchStats>, ) -> InterpolatedSearchOutcome

Converts to this type from the input type.

impl<P, S> PartialEq for SearchOutcome<P, S>

where P: PartialEq, S: PartialEq,

fn eq(&self, other: &SearchOutcome<P, S>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<P, S> StructuralPartialEq for SearchOutcome<P, S>

where P: PartialEq, S: PartialEq,