Struct h3ron_graph::graph::longedge::LongEdge

pub struct LongEdge {
    pub in_edge: H3DirectedEdge,
    pub out_edge: H3DirectedEdge,
    /* private fields */
}

A LongEdge is an artificial construct to combine a continuous path of H3DirectedEdge values into a single edge.

This intended to be used to compress longer paths into a single edge to reduce the number of nodes to visit during routing.

Fields

in_edge: H3DirectedEdge

out_edge: H3DirectedEdge

Implementations

impl LongEdge

pub fn destination_cell(&self) -> Result<H3Cell, Error>

pub fn origin_cell(&self) -> Result<H3Cell, Error>

pub fn is_disjoint(&self, celltreemap: &H3Treemap<H3Cell>) -> bool

pub const fn h3edges_len(&self) -> usize

length of self as the number of contained h3edges

pub fn h3edge_path(
    &self
) -> Result<OwningDecompressedIter<'_, H3DirectedEdge>, Error>

the path of the longedge described by multiple, successive H3DirectedEdge values

Trait Implementations

impl Clone for LongEdge

fn clone(&self) -> LongEdge

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'de> Deserialize<'de> for LongEdge

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

Deserialize this value from the given Serde deserializer.

impl Serialize for LongEdge

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

Serialize this value into the given Serde serializer.

impl ToLineString for LongEdge

type Error = Error

fn to_linestring(&self) -> Result<LineString<f64>, Self::Error>

impl TryFrom<Vec<H3DirectedEdge, Global>> for LongEdge

construct an longedge from a vec of H3DirectedEdge.

The H3DirectedEdge must be sorted according to the path they describe

type Error = Error

The type returned in the event of a conversion error.

fn try_from(h3edges: Vec<H3DirectedEdge>) -> Result<Self, Self::Error>

Performs the conversion.