Struct h3ron_graph::graph::modifiers::ExcludeCells

source · [−]

pub struct ExcludeCells<'a, G, W> { /* private fields */ }

Expand description

wrapper to exclude cells from traversal during routing

Implementations

source

impl<'a, G, W> ExcludeCells<'a, G, W>where
G: GetCellNode + GetCellEdges<EdgeWeightType = W> + HasH3Resolution,

source

pub fn new(inner_graph: &'a G, cells_to_exclude: &'a H3Treemap<H3Cell>) -> Self

Trait Implementations

source

impl<'a, G, W> GetCellEdges for ExcludeCells<'a, G, W>where
G: GetCellEdges<EdgeWeightType = W>,

type EdgeWeightType = <G as GetCellEdges>::EdgeWeightType

source

fn get_edges_originating_from(
&self,
cell: &H3Cell
) -> Result<Vec<(H3DirectedEdge, EdgeWeight<'_, Self::EdgeWeightType>)>, Error>

get all edges and their values originating from cell cell

source

impl<'a, G, W> GetCellNode for ExcludeCells<'a, G, W>where
G: GetCellNode,

source

fn get_cell_node(&self, cell: &H3Cell) -> Option<NodeType>

source

impl<'a, G, W> HasH3Resolution for ExcludeCells<'a, G, W>where
G: HasH3Resolution,

source

fn h3_resolution(&self) -> u8

Gets the index resolution (0-15)

Auto Trait Implementations

impl<'a, G, W> RefUnwindSafe for ExcludeCells<'a, G, W>where
G: RefUnwindSafe,
W: RefUnwindSafe,

impl<'a, G, W> Send for ExcludeCells<'a, G, W>where
G: Sync,
W: Send,

impl<'a, G, W> Sync for ExcludeCells<'a, G, W>where
G: Sync,
W: Sync,

impl<'a, G, W> Unpin for ExcludeCells<'a, G, W>where
W: Unpin,

impl<'a, G, W> UnwindSafe for ExcludeCells<'a, G, W>where
G: RefUnwindSafe,
W: UnwindSafe,

Blanket Implementations

source

impl<T> Any for Twhere
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<G, W> DifferentialShortestPath<W> for Gwhere
W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Send + Ord + Zero + Sync,
G: GetCellEdges<EdgeWeightType = W> + GetCellNode + HasH3Resolution + NearestGraphNodes + Sync + ShortestPathManyToMany<W>,

source

fn differential_shortest_path_map<I, OPT, PM, O>(
 &self,
 origin_cells: I,
 destination_cells: I,
 exclude_cells: &H3Treemap<H3Cell>,
 options: &OPT,
 path_transform_fn: PM
) -> Result<HashMap<H3Cell, ExclusionDiff<O>, RandomState, Global>, Error>where
 I: IntoIterator,
 ::Item: Borrow<H3Cell>,
 OPT: ShortestPathOptions + Send + Sync,
 O: Send + Ord + Clone,
 PM: Fn(Path<W>) -> Result<O, Error> + Send + Sync,

source

fn differential_shortest_path<I, OPT>(
 &self,
 origin_cells: I,
 destination_cells: I,
 exclude_cells: &H3Treemap<H3Cell>,
 options: &OPT
) -> Result<HashMap<H3Cell, ExclusionDiff<Path<W>>>, Error>where
 I: IntoIterator,
 I::Item: Borrow<H3Cell>,
 OPT: ShortestPathOptions + Send + Sync,

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<G> GetEdge for Gwhere
G: GetCellEdges,

type EdgeWeightType = <G as GetCellEdges>::EdgeWeightType

source

fn get_edge(
&self,
edge: &H3DirectedEdge
) -> Result<Option<EdgeWeight<'_, <G as GetEdge>::EdgeWeightType>>, Error>

source

impl<T, U> Into for Twhere
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<G> NearestGraphNodes for Gwhere
G: GetCellNode,

source

fn nearest_graph_nodes(
 &self,
 cell: &H3Cell,
 max_distance_k: u32
) -> Result<NearestGraphNodesGetCellIter<'_, G>, Error>

get an iterator over the closest corresponding nodes in the graph to the given cell. The iterator will return all nodes with the same, smallest k <= max_distance_k which are part of the graph. Read more

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.

type Init = T

The type for initializers.

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more

source

impl<W, G> ShortestPath<W> for Gwhere
G: GetCellEdges<EdgeWeightType = W> + GetCellNode + HasH3Resolution + NearestGraphNodes,
W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Ord + Zero,

source

fn shortest_path<I, OPT>(
 &self,
 origin_cell: H3Cell,
 destination_cells: I,
 options: &OPT
) -> Result<Vec<Path<W>, Global>, Error>where
 I: IntoIterator,
 ::Item: Borrow<H3Cell>,
 OPT: ShortestPathOptions,

source

impl<W, G> ShortestPathManyToMany<W> for Gwhere
G: GetCellEdges<EdgeWeightType = W> + GetCellNode + HasH3Resolution + NearestGraphNodes + Sync,
W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Send + Ord + Zero + Sync,

source

fn shortest_path_many_to_many_map<I, OPT, PM, O>(
 &self,
 origin_cells: I,
 destination_cells: I,
 options: &OPT,
 path_transform_fn: PM
) -> Result<HashMap<H3Cell, Vec<O, Global>, RandomState, Global>, Error>where
 I: IntoIterator,
 ::Item: Borrow<H3Cell>,
 OPT: ShortestPathOptions + Send + Sync,
 PM: Fn(Path<W>) -> Result<O, Error> + Send + Sync,
 O: Send + Ord + Clone,

Returns found paths, transformed by the path_map_fn and keyed by the origin cell. Read more

source

fn shortest_path_many_to_many<I, OPT>(
 &self,
 origin_cells: I,
 destination_cells: I,
 options: &OPT
) -> Result<H3CellMap<Vec<Path<W>>>, Error>where
 I: IntoIterator,
 I::Item: Borrow<H3Cell>,
 OPT: ShortestPathOptions + Send + Sync,

Returns found paths keyed by the origin cell. Read more

source

impl<T, U> TryFrom for Twhere
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for Twhere
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

impl<G1, G2> Within<G2> for G1where
G2: Contains<G1>,

source

fn is_within(&self, b: &G2) -> bool

source

impl<W, G> WithinWeightThreshold<W> for Gwhere
G: GetCellEdges<EdgeWeightType = W>,
W: Zero + Ord + Copy + Add<W>,

source

fn cells_within_weight_threshold(
 &self,
 origin_cell: H3Cell,
 weight_threshold: W
) -> Result<HashMap<H3Cell, W, RandomState, Global>, Error>

Find all cells connected to the graph within a given weight_threshold around the given origin_cell Read more

source

impl<W, G> WithinWeightThresholdMany<W> for Gwhere
G: GetCellEdges<EdgeWeightType = W> + WithinWeightThreshold<W> + Sync,
W: Zero + Ord + Copy + Add<W> + Send + Sync,

source

fn cells_within_weight_threshold_many<I, AGG>(
 &self,
 origin_cells: I,
 weight_threshold: W,
 agg_fn: AGG
) -> Result<HashMap<H3Cell, W, RandomState, Global>, Error>where
 I: IntoParallelIterator,
 ::Item: Borrow<H3Cell>,
 AGG: Fn(&mut W, W) + Sync,

Find all cells connected to the graph within a given weight_threshold around the given origin_cells. Read more

Struct h3ron_graph::graph::modifiers::ExcludeCells

Implementations

impl<'a, G, W> ExcludeCells<'a, G, W>where G: GetCellNode + GetCellEdges<EdgeWeightType = W> + HasH3Resolution,

pub fn new(inner_graph: &'a G, cells_to_exclude: &'a H3Treemap<H3Cell>) -> Self

Trait Implementations

impl<'a, G, W> GetCellEdges for ExcludeCells<'a, G, W>where G: GetCellEdges<EdgeWeightType = W>,

type EdgeWeightType = <G as GetCellEdges>::EdgeWeightType

fn get_edges_originating_from( &self, cell: &H3Cell) -> Result<Vec<(H3DirectedEdge, EdgeWeight<'_, Self::EdgeWeightType>)>, Error>

impl<'a, G, W> GetCellNode for ExcludeCells<'a, G, W>where G: GetCellNode,

fn get_cell_node(&self, cell: &H3Cell) -> Option<NodeType>

impl<'a, G, W> HasH3Resolution for ExcludeCells<'a, G, W>where G: HasH3Resolution,

fn h3_resolution(&self) -> u8

Auto Trait Implementations

impl<'a, G, W> RefUnwindSafe for ExcludeCells<'a, G, W>where G: RefUnwindSafe, W: RefUnwindSafe,

impl<'a, G, W> Send for ExcludeCells<'a, G, W>where G: Sync, W: Send,

impl<'a, G, W> Sync for ExcludeCells<'a, G, W>where G: Sync, W: Sync,

impl<'a, G, W> Unpin for ExcludeCells<'a, G, W>where W: Unpin,

impl<'a, G, W> UnwindSafe for ExcludeCells<'a, G, W>where G: RefUnwindSafe, W: UnwindSafe,

Blanket Implementations

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<G, W> DifferentialShortestPath<W> for Gwhere W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Send + Ord + Zero + Sync, G: GetCellEdges<EdgeWeightType = W> + GetCellNode + HasH3Resolution + NearestGraphNodes + Sync + ShortestPathManyToMany<W>,

fn differential_shortest_path<I, OPT>( &self, origin_cells: I, destination_cells: I, exclude_cells: &H3Treemap<H3Cell>, options: &OPT) -> Result<HashMap<H3Cell, ExclusionDiff<Path<W>>>, Error>where I: IntoIterator, I::Item: Borrow<H3Cell>, OPT: ShortestPathOptions + Send + Sync,

impl<T> From<T> for T

fn from(t: T) -> T

impl<G> GetEdge for Gwhere G: GetCellEdges,

type EdgeWeightType = <G as GetCellEdges>::EdgeWeightType

fn get_edge( &self, edge: &H3DirectedEdge) -> Result<Option<EdgeWeight<'_, <G as GetEdge>::EdgeWeightType>>, Error>

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<G> NearestGraphNodes for Gwhere G: GetCellNode,

fn nearest_graph_nodes( &self, cell: &H3Cell, max_distance_k: u32) -> Result<NearestGraphNodesGetCellIter<'_, G>, Error>

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::<T>()

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

impl<W, G> ShortestPath<W> for Gwhere G: GetCellEdges<EdgeWeightType = W> + GetCellNode + HasH3Resolution + NearestGraphNodes, W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Ord + Zero,

fn shortest_path<I, OPT>( &self, origin_cell: H3Cell, destination_cells: I, options: &OPT) -> Result<Vec<Path<W>, Global>, Error>where I: IntoIterator, <I as IntoIterator>::Item: Borrow<H3Cell>, OPT: ShortestPathOptions,

impl<W, G> ShortestPathManyToMany<W> for Gwhere G: GetCellEdges<EdgeWeightType = W> + GetCellNode + HasH3Resolution + NearestGraphNodes + Sync, W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Send + Ord + Zero + Sync,

fn shortest_path_many_to_many<I, OPT>( &self, origin_cells: I, destination_cells: I, options: &OPT) -> Result<H3CellMap<Vec<Path<W>>>, Error>where I: IntoIterator, I::Item: Borrow<H3Cell>, OPT: ShortestPathOptions + Send + Sync,

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<G1, G2> Within<G2> for G1where G2: Contains<G1>,

fn is_within(&self, b: &G2) -> bool

impl<W, G> WithinWeightThreshold<W> for Gwhere G: GetCellEdges<EdgeWeightType = W>, W: Zero + Ord + Copy + Add<W>,

fn cells_within_weight_threshold( &self, origin_cell: H3Cell, weight_threshold: W) -> Result<HashMap<H3Cell, W, RandomState, Global>, Error>

impl<W, G> WithinWeightThresholdMany<W> for Gwhere G: GetCellEdges<EdgeWeightType = W> + WithinWeightThreshold<W> + Sync, W: Zero + Ord + Copy + Add<W> + Send + Sync,

fn cells_within_weight_threshold_many<I, AGG>( &self, origin_cells: I, weight_threshold: W, agg_fn: AGG) -> Result<HashMap<H3Cell, W, RandomState, Global>, Error>where I: IntoParallelIterator, <I as IntoParallelIterator>::Item: Borrow<H3Cell>, AGG: Fn(&mut W, W) + Sync,

impl<'a, G, W> ExcludeCells<'a, G, W>where
G: GetCellNode + GetCellEdges<EdgeWeightType = W> + HasH3Resolution,

impl<'a, G, W> GetCellEdges for ExcludeCells<'a, G, W>where
G: GetCellEdges<EdgeWeightType = W>,

fn get_edges_originating_from(
&self,
cell: &H3Cell
) -> Result<Vec<(H3DirectedEdge, EdgeWeight<'_, Self::EdgeWeightType>)>, Error>

impl<'a, G, W> GetCellNode for ExcludeCells<'a, G, W>where
G: GetCellNode,

impl<'a, G, W> HasH3Resolution for ExcludeCells<'a, G, W>where
G: HasH3Resolution,

impl<'a, G, W> RefUnwindSafe for ExcludeCells<'a, G, W>where
G: RefUnwindSafe,
W: RefUnwindSafe,

impl<'a, G, W> Send for ExcludeCells<'a, G, W>where
G: Sync,
W: Send,

impl<'a, G, W> Sync for ExcludeCells<'a, G, W>where
G: Sync,
W: Sync,

impl<'a, G, W> Unpin for ExcludeCells<'a, G, W>where
W: Unpin,

impl<'a, G, W> UnwindSafe for ExcludeCells<'a, G, W>where
G: RefUnwindSafe,
W: UnwindSafe,

impl<T> Any for Twhere
T: 'static + ?Sized,

impl<T> Borrow<T> for Twhere
T: ?Sized,

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

impl<G, W> DifferentialShortestPath<W> for Gwhere
W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Send + Ord + Zero + Sync,
G: GetCellEdges<EdgeWeightType = W> + GetCellNode + HasH3Resolution + NearestGraphNodes + Sync + ShortestPathManyToMany<W>,

fn differential_shortest_path<I, OPT>(
&self,
origin_cells: I,
destination_cells: I,
exclude_cells: &H3Treemap<H3Cell>,
options: &OPT
) -> Result<HashMap<H3Cell, ExclusionDiff<Path<W>>>, Error>where
I: IntoIterator,
I::Item: Borrow<H3Cell>,
OPT: ShortestPathOptions + Send + Sync,

impl<G> GetEdge for Gwhere
G: GetCellEdges,

fn get_edge(
&self,
edge: &H3DirectedEdge
) -> Result<Option<EdgeWeight<'_, <G as GetEdge>::EdgeWeightType>>, Error>

impl<T, U> Into<U> for Twhere
U: From<T>,

impl<G> NearestGraphNodes for Gwhere
G: GetCellNode,

fn nearest_graph_nodes(
&self,
cell: &H3Cell,
max_distance_k: u32
) -> Result<NearestGraphNodesGetCellIter<'_, G>, Error>

impl<W, G> ShortestPath<W> for Gwhere
G: GetCellEdges<EdgeWeightType = W> + GetCellNode + HasH3Resolution + NearestGraphNodes,
W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Ord + Zero,

fn shortest_path<I, OPT>(
&self,
origin_cell: H3Cell,
destination_cells: I,
options: &OPT
) -> Result<Vec<Path<W>, Global>, Error>where
I: IntoIterator,
<I as IntoIterator>::Item: Borrow<H3Cell>,
OPT: ShortestPathOptions,

impl<W, G> ShortestPathManyToMany<W> for Gwhere
G: GetCellEdges<EdgeWeightType = W> + GetCellNode + HasH3Resolution + NearestGraphNodes + Sync,
W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Send + Ord + Zero + Sync,

fn shortest_path_many_to_many<I, OPT>(
&self,
origin_cells: I,
destination_cells: I,
options: &OPT
) -> Result<H3CellMap<Vec<Path<W>>>, Error>where
I: IntoIterator,
I::Item: Borrow<H3Cell>,
OPT: ShortestPathOptions + Send + Sync,

impl<T, U> TryFrom<U> for Twhere
U: Into<T>,

impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,

impl<G1, G2> Within<G2> for G1where
G2: Contains<G1>,

impl<W, G> WithinWeightThreshold<W> for Gwhere
G: GetCellEdges<EdgeWeightType = W>,
W: Zero + Ord + Copy + Add<W>,

fn cells_within_weight_threshold(
&self,
origin_cell: H3Cell,
weight_threshold: W
) -> Result<HashMap<H3Cell, W, RandomState, Global>, Error>

impl<W, G> WithinWeightThresholdMany<W> for Gwhere
G: GetCellEdges<EdgeWeightType = W> + WithinWeightThreshold<W> + Sync,
W: Zero + Ord + Copy + Add<W> + Send + Sync,

fn cells_within_weight_threshold_many<I, AGG>(
&self,
origin_cells: I,
weight_threshold: W,
agg_fn: AGG
) -> Result<HashMap<H3Cell, W, RandomState, Global>, Error>where
I: IntoParallelIterator,
<I as IntoParallelIterator>::Item: Borrow<H3Cell>,
AGG: Fn(&mut W, W) + Sync,