Struct h3ron_graph::graph::prepared::PreparedH3EdgeGraph[−][src]

pub struct PreparedH3EdgeGraph<W: Send + Sync> { /* fields omitted */ }

Expand description

a prepared graph which can be used for routing

Implementations

[src]

impl<W: Sync + Send> PreparedH3EdgeGraph<W>

[src]

pub fn num_long_edges(&self) -> usize

Trait Implementations

[src]

impl<W: Clone + Send + Sync> Clone for PreparedH3EdgeGraph<W>

[src]

fn clone(&self) -> PreparedH3EdgeGraph<W>

Returns a copy of the value. Read more

1.0.0[src]

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

Performs copy-assignment from source. Read more

[src]

impl<W> CoveredArea for PreparedH3EdgeGraph<W> where
W: Send + Sync,

[src]

fn covered_area(
&self,
reduce_resolution_by: u8
) -> Result<MultiPolygon<f64>, Error>

calculates a MultiPolygon of the area covered by a graph Read more

[src]

impl<'de, W: Send + Sync> Deserialize<'de> for PreparedH3EdgeGraph<W> where
W: Deserialize<'de>,

[src]

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error> where
__D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more

[src]

impl<W> From<PreparedH3EdgeGraph<W>> for H3EdgeGraph<W> where
W: PartialOrd + PartialEq + Add + Copy + Send + Ord + Zero + Sync,

[src]

fn from(prepared_graph: PreparedH3EdgeGraph<W>) -> Self

Performs the conversion.

[src]

impl<W: Send + Sync + Copy> GetEdge for PreparedH3EdgeGraph<W>

fn h3_resolution(&self) -> u8

Gets the index resolution (0-15)

[src]

impl<W: Send + Sync> Serialize for PreparedH3EdgeGraph<W> where
W: Serialize,

[src]

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error> where
S: Serializer,

Serialize this value into the given Serde serializer. Read more

[src]

impl<W> TryFrom<H3EdgeGraph<W>> for PreparedH3EdgeGraph<W> where
W: PartialOrd + PartialEq + Add + Copy + Send + Ord + Zero + Sync,

type Error = Error

The type returned in the event of a conversion error.

[src]

fn try_from(graph: H3EdgeGraph<W>) -> Result<Self, Self::Error>

Performs the conversion.

[src]

impl<W: Sync + Send> Sync for PreparedH3EdgeGraph<W>

Auto Trait Implementations

impl<W> RefUnwindSafe for PreparedH3EdgeGraph<W> where
W: RefUnwindSafe,

impl<W> Send for PreparedH3EdgeGraph<W>

impl<W> Unpin for PreparedH3EdgeGraph<W> where
W: Unpin,

impl<W> UnwindSafe for PreparedH3EdgeGraph<W> where
W: UnwindSafe,

Blanket Implementations

[src]

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

[src]

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

[src]

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

[src]

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

[src]

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

[src]

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

Mutably borrows from an owned value. Read more

[src]

impl<G, W> DifferentialShortestPath<W> for G where
W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Send + Ord + Zero + Sync,
G: GetEdge<WeightType = W> + GetNodeType + HasH3Resolution + GetGapBridgedCellNodes + Sync + ShortestPathManyToMany<W>,

[src]

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

[src]

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,

[src]

impl<T> From<T> for T

[src]

pub fn from(t: T) -> T

Performs the conversion.

[src]

impl<G> GetGapBridgedCellNodes for G where
G: GetNodeType + Sync,

[src]

pub fn gap_bridged_corresponding_node_filtered<F>(
 &Self,
 &H3Cell,
 u32,
 F
) -> GapBridgedCellNode where
 F: Fn(&H3Cell, &NodeType) -> bool + Send + Sync + Copy,

[src]

fn gap_bridged_corresponding_node(
    &self,
    cell: &H3Cell,
    num_gap_cells_to_graph: u32
) -> GapBridgedCellNode

get the closest corresponding node in the graph to the given cell Read more

[src]

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

[src]

pub fn into(self) -> U

Performs the conversion.

impl<T> Pointable for T

pub const ALIGN: usize

The alignment of pointer.

type Init = T

The type for initializers.

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

Initializes a with the given initializer. Read more

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

Dereferences the given pointer. Read more

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

Mutably dereferences the given pointer. Read more

pub unsafe fn drop(ptr: usize)

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

[src]

impl<T> Same<T> for T

type Output = T

Should always be Self

[src]

impl<W, G> ShortestPath<W> for G where
G: GetEdge<WeightType = W> + GetNodeType + HasH3Resolution + GetGapBridgedCellNodes,
W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Send + Ord + Zero + Sync,

[src]

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

[src]

impl<W, G> ShortestPathManyToMany<W> for G where
G: GetEdge<WeightType = W> + GetNodeType + HasH3Resolution + GetGapBridgedCellNodes + Sync,
W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Send + Ord + Zero + Sync,

[src]

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

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

[src]

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

[src]

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

[src]

pub fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

[src]

pub fn clone_into(&self, target: &mut T)

🔬 This is a nightly-only experimental API. (toowned_clone_into)

recently added

Uses borrowed data to replace owned data, usually by cloning. Read more

[src]

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

type Error = Infallible

The type returned in the event of a conversion error.

[src]

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

Performs the conversion.

[src]

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

type Error = >::Error

The type returned in the event of a conversion error.

[src]

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

Performs the conversion.

[src]

Struct h3ron_graph::graph::prepared::PreparedH3EdgeGraph[−][src]

Implementations

impl<W: Sync + Send> PreparedH3EdgeGraph<W>

pub fn num_long_edges(&self) -> usize

Trait Implementations

impl<W: Clone + Send + Sync> Clone for PreparedH3EdgeGraph<W>

fn clone(&self) -> PreparedH3EdgeGraph<W>

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

impl<W> CoveredArea for PreparedH3EdgeGraph<W> where W: Send + Sync,

fn covered_area( &self, reduce_resolution_by: u8) -> Result<MultiPolygon<f64>, Error>

impl<'de, W: Send + Sync> Deserialize<'de> for PreparedH3EdgeGraph<W> where W: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where __D: Deserializer<'de>,

impl<W> From<PreparedH3EdgeGraph<W>> for H3EdgeGraph<W> where W: PartialOrd + PartialEq + Add + Copy + Send + Ord + Zero + Sync,

fn from(prepared_graph: PreparedH3EdgeGraph<W>) -> Self

impl<W: Send + Sync + Copy> GetEdge for PreparedH3EdgeGraph<W>

type WeightType = W

fn get_edge(&self, edge: &H3Edge) -> Option<EdgeValue<'_, Self::WeightType>>

impl<W: Send + Sync> GetNodeType for PreparedH3EdgeGraph<W>

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

impl<W> GetStats for PreparedH3EdgeGraph<W> where W: Send + Sync,

fn get_stats(&self) -> GraphStats

impl<W> HasH3Resolution for PreparedH3EdgeGraph<W> where W: Send + Sync,

fn h3_resolution(&self) -> u8

impl<W: Send + Sync> Serialize for PreparedH3EdgeGraph<W> where W: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where __S: Serializer,

impl<W> TryFrom<H3EdgeGraph<W>> for PreparedH3EdgeGraph<W> where W: PartialOrd + PartialEq + Add + Copy + Send + Ord + Zero + Sync,

type Error = Error

fn try_from(graph: H3EdgeGraph<W>) -> Result<Self, Self::Error>

impl<W: Sync + Send> Sync for PreparedH3EdgeGraph<W>

Auto Trait Implementations

impl<W> RefUnwindSafe for PreparedH3EdgeGraph<W> where W: RefUnwindSafe,

impl<W> Send for PreparedH3EdgeGraph<W>

impl<W> Unpin for PreparedH3EdgeGraph<W> where W: Unpin,

impl<W> UnwindSafe for PreparedH3EdgeGraph<W> where W: UnwindSafe,

Blanket Implementations

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

pub fn type_id(&self) -> TypeId

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

pub fn borrow(&self) -> &T

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

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

impl<G, W> DifferentialShortestPath<W> for G where W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Send + Ord + Zero + Sync, G: GetEdge<WeightType = W> + GetNodeType + HasH3Resolution + GetGapBridgedCellNodes + 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

pub fn from(t: T) -> T

impl<G> GetGapBridgedCellNodes for G where G: GetNodeType + Sync,

pub fn gap_bridged_corresponding_node_filtered<F>( &Self, &H3Cell, u32, F) -> GapBridgedCellNode where F: Fn(&H3Cell, &NodeType) -> bool + Send + Sync + Copy,

fn gap_bridged_corresponding_node( &self, cell: &H3Cell, num_gap_cells_to_graph: u32) -> GapBridgedCellNode

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

pub fn into(self) -> U

impl<T> Pointable for T

pub const ALIGN: usize

type Init = T

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

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

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

pub unsafe fn drop(ptr: usize)

impl<T> Same<T> for T

type Output = T

impl<W, G> ShortestPath<W> for G where G: GetEdge<WeightType = W> + GetNodeType + HasH3Resolution + GetGapBridgedCellNodes, W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Send + Ord + Zero + Sync,

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

impl<W, G> ShortestPathManyToMany<W> for G where G: GetEdge<WeightType = W> + GetNodeType + HasH3Resolution + GetGapBridgedCellNodes + 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> ToOwned for T where T: Clone,

type Owned = T

pub fn to_owned(&self) -> T

pub fn clone_into(&self, target: &mut T)

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

type Error = Infallible

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

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

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

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

impl<T> DeserializeOwned for T where T: for<'de> Deserialize<'de>,

impl<W> CoveredArea for PreparedH3EdgeGraph<W> where
W: Send + Sync,

fn covered_area(
&self,
reduce_resolution_by: u8
) -> Result<MultiPolygon<f64>, Error>

impl<'de, W: Send + Sync> Deserialize<'de> for PreparedH3EdgeGraph<W> where
W: Deserialize<'de>,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error> where
__D: Deserializer<'de>,

impl<W> From<PreparedH3EdgeGraph<W>> for H3EdgeGraph<W> where
W: PartialOrd + PartialEq + Add + Copy + Send + Ord + Zero + Sync,

impl<W> GetStats for PreparedH3EdgeGraph<W> where
W: Send + Sync,

impl<W> HasH3Resolution for PreparedH3EdgeGraph<W> where
W: Send + Sync,

impl<W: Send + Sync> Serialize for PreparedH3EdgeGraph<W> where
W: Serialize,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error> where
S: Serializer,

impl<W> TryFrom<H3EdgeGraph<W>> for PreparedH3EdgeGraph<W> where
W: PartialOrd + PartialEq + Add + Copy + Send + Ord + Zero + Sync,

impl<W> RefUnwindSafe for PreparedH3EdgeGraph<W> where
W: RefUnwindSafe,

impl<W> Unpin for PreparedH3EdgeGraph<W> where
W: Unpin,

impl<W> UnwindSafe for PreparedH3EdgeGraph<W> where
W: UnwindSafe,

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

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

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

impl<G, W> DifferentialShortestPath<W> for G where
W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Send + Ord + Zero + Sync,
G: GetEdge<WeightType = W> + GetNodeType + HasH3Resolution + GetGapBridgedCellNodes + 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> GetGapBridgedCellNodes for G where
G: GetNodeType + Sync,

pub fn gap_bridged_corresponding_node_filtered<F>(
&Self,
&H3Cell,
u32,
F
) -> GapBridgedCellNode where
F: Fn(&H3Cell, &NodeType) -> bool + Send + Sync + Copy,

fn gap_bridged_corresponding_node(
&self,
cell: &H3Cell,
num_gap_cells_to_graph: u32
) -> GapBridgedCellNode

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

impl<W, G> ShortestPath<W> for G where
G: GetEdge<WeightType = W> + GetNodeType + HasH3Resolution + GetGapBridgedCellNodes,
W: PartialOrd<W> + PartialEq<W> + Add<W> + Copy + Send + Ord + Zero + Sync,

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

impl<W, G> ShortestPathManyToMany<W> for G where
G: GetEdge<WeightType = W> + GetNodeType + HasH3Resolution + GetGapBridgedCellNodes + 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> ToOwned for T where
T: Clone,

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

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

impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,