Struct grid_search::SearchContext
[−]
[src]
pub struct SearchContext<Cost: PartialOrd<Cost>> { /* fields omitted */ }
Methods
impl<Cost: PartialOrd<Cost> + Zero> SearchContext<Cost>[src]
fn new(width: u32, height: u32) -> Self[src]
fn width(&self) -> u32[src]
fn height(&self) -> u32[src]
impl<Cost: Copy + Add<Cost> + PartialOrd<Cost> + Zero + One> SearchContext<Cost>[src]
fn populate_dijkstra_map<G, V, D>(
&mut self,
grid: &G,
start: Coord,
directions: D,
dijkstra_map: &mut DijkstraMap<Cost>
) -> Result<SearchMetadata, Error> where
G: CostGrid<Cost = Cost>,
V: Into<Direction>,
D: Copy + IntoIterator<Item = V>, [src]
&mut self,
grid: &G,
start: Coord,
directions: D,
dijkstra_map: &mut DijkstraMap<Cost>
) -> Result<SearchMetadata, Error> where
G: CostGrid<Cost = Cost>,
V: Into<Direction>,
D: Copy + IntoIterator<Item = V>,
impl SearchContext<f64>[src]
fn jump_point_search_octile_distance_heuristic<G>(
&mut self,
grid: &G,
start: Coord,
goal: Coord,
path: &mut Vec<Direction>
) -> Result<SearchMetadata, Error> where
G: SolidGrid, [src]
&mut self,
grid: &G,
start: Coord,
goal: Coord,
path: &mut Vec<Direction>
) -> Result<SearchMetadata, Error> where
G: SolidGrid,
impl<Cost: Copy + Add<Cost> + PartialOrd<Cost> + NumCast + Zero + One> SearchContext<Cost>[src]
fn jump_point_search_cardinal_manhatten_distance_heuristic<G>(
&mut self,
grid: &G,
start: Coord,
goal: Coord,
path: &mut Vec<Direction>
) -> Result<SearchMetadata, Error> where
G: SolidGrid, [src]
&mut self,
grid: &G,
start: Coord,
goal: Coord,
path: &mut Vec<Direction>
) -> Result<SearchMetadata, Error> where
G: SolidGrid,
impl<Cost: Copy + Add<Cost> + PartialOrd<Cost> + NumCast + Zero> SearchContext<Cost>[src]
fn astar_cardinal_manhatten_distance_heuristic<G>(
&mut self,
grid: &G,
start: Coord,
goal: Coord,
path: &mut Vec<Direction>
) -> Result<SearchMetadata, Error> where
G: CostGrid<Cost = Cost>, [src]
&mut self,
grid: &G,
start: Coord,
goal: Coord,
path: &mut Vec<Direction>
) -> Result<SearchMetadata, Error> where
G: CostGrid<Cost = Cost>,
impl<Cost> SearchContext<Cost> where
Cost: Copy + Add<Cost, Output = Cost> + Mul<Cost, Output = Cost> + PartialOrd<Cost> + NumCast + Zero, [src]
Cost: Copy + Add<Cost, Output = Cost> + Mul<Cost, Output = Cost> + PartialOrd<Cost> + NumCast + Zero,
fn astar_diagonal_distance_heuristic<G>(
&mut self,
grid: &G,
start: Coord,
goal: Coord,
weights: HeuristicDirectionWeights<Cost>,
path: &mut Vec<Direction>
) -> Result<SearchMetadata, Error> where
G: CostGrid<Cost = Cost>, [src]
&mut self,
grid: &G,
start: Coord,
goal: Coord,
weights: HeuristicDirectionWeights<Cost>,
path: &mut Vec<Direction>
) -> Result<SearchMetadata, Error> where
G: CostGrid<Cost = Cost>,
impl<Cost: Copy + Add<Cost> + PartialOrd<Cost> + Zero> SearchContext<Cost>[src]
fn dijkstra<G, V, D>(
&mut self,
grid: &G,
start: Coord,
goal: Coord,
directions: D,
path: &mut Vec<Direction>
) -> Result<SearchMetadata, Error> where
G: CostGrid<Cost = Cost>,
V: Into<Direction>,
D: Copy + IntoIterator<Item = V>, [src]
&mut self,
grid: &G,
start: Coord,
goal: Coord,
directions: D,
path: &mut Vec<Direction>
) -> Result<SearchMetadata, Error> where
G: CostGrid<Cost = Cost>,
V: Into<Direction>,
D: Copy + IntoIterator<Item = V>,
Trait Implementations
impl<Cost: Debug + PartialOrd<Cost>> Debug for SearchContext<Cost>[src]
impl<Cost: Clone + PartialOrd<Cost>> Clone for SearchContext<Cost>[src]
fn clone(&self) -> SearchContext<Cost>[src]
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)1.0.0[src]
Performs copy-assignment from source. Read more