Struct FilterHeuristic 

pub struct FilterHeuristic<F>(pub F);

Chooses whether to enter a path or not.

Wrap a type with the bound F: FnMut(bool) -> bool + Clone and this will implement Heuristic. The function will be cloned internally so that from the function’s point of view it is being called in the order it descends in. It is passed the side that is being entered and returns whether or not it would like to enter.

This is useful when looking for items with a discrete distance.

Tuple Fields

0: F

Trait Implementations

impl<F: Clone> Clone for FilterHeuristic<F>

fn clone(&self) -> FilterHeuristic<F>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F> Heuristic for FilterHeuristic<F>

where F: FnMut(bool) -> bool + Clone,

type Iter = FilterHeuristicIter<F>

fn enter(&mut self, side: bool)

This is passed the side.

fn iter(&self) -> Self::Iter

Must return an iterator which returns values below 16, otherwise panics.