Enum veloren_common::astar::PathResult

pub enum PathResult<T> {
    None(Path<T>),
    Exhausted(Path<T>),
    Path(Path<T>, f32),
    Pending,
}

Variants

None(Path<T>)

No reachable nodes were satisfactory.

Contains path to node with the lowest heuristic value (out of the explored nodes).

Exhausted(Path<T>)

Either max_iters or max_cost was reached.

Contains path to node with the lowest heuristic value (out of the explored nodes).

Path(Path<T>, f32)

Path succefully found.

Second field is cost.

Pending

Implementations

impl<T> PathResult<T>

pub fn into_path(self) -> Option<(Path<T>, f32)>

Returns Some((path, cost)) if a path reaching the target was successfully found.

pub fn map<U>(self, f: impl FnOnce(Path<T>) -> Path<U>) -> PathResult<U>