Struct veloren_common::astar::Astar

pub struct Astar<S, Hasher> {
    iter: usize,
    max_iters: usize,
    max_cost: f32,
    potential_nodes: BinaryHeap<PathEntry<S>>,
    visited_nodes: HashMap<S, NodeEntry<S>, Hasher>,
    closest_node: Option<(S, f32)>,
}

Fields

iter: usize

max_iters: usize

max_cost: f32

potential_nodes: BinaryHeap<PathEntry<S>>

visited_nodes: HashMap<S, NodeEntry<S>, Hasher>

closest_node: Option<(S, f32)>

Node with the lowest heuristic value so far.

(node, heuristic value)

Implementations

impl<S: Clone + Eq + Hash, H: BuildHasher + Clone> Astar<S, H>

pub fn new(max_iters: usize, start: S, hasher: H) -> Self

pub fn with_max_cost(self, max_cost: f32) -> Self

pub fn poll<I>( &mut self, iters: usize, heuristic: impl FnMut(&S, &S) -> f32, neighbors: impl FnMut(&S) -> I, satisfied: impl FnMut(&S) -> bool ) -> PathResult<S>

where I: Iterator<Item = (S, f32)>,

fn reconstruct_path_to(&mut self, end: S) -> Path<S>

Trait Implementations

impl<S: Clone, Hasher: Clone> Clone for Astar<S, Hasher>

fn clone(&self) -> Astar<S, Hasher>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S: Clone + Eq + Hash + Debug, H: BuildHasher> Debug for Astar<S, H>

NOTE: Must manually derive since Hasher doesn’t implement it.

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

Formats the value using the given formatter.