Struct InterPointLookup 

pub struct InterPointLookup<P: FullXY> {
    pub lookup: BTreeMap<Point, IntersectionPointRef<P>>,
}

Intersection Lookup for chunks

Fields

lookup: BTreeMap<Point, IntersectionPointRef<P>>

The lookup

Implementations

impl<P: FullXY> InterPointLookup<P>

pub fn get(&mut self, point: Point) -> IntersectionPointRef<P>

Get the intersection point

pub fn link_ints( &mut self, poly_index: usize, ring_index: usize, from: Point, to: Point, mid: Vec<P>, from_angle: Option<f64>, to_angle: Option<f64>, ) -> RingChunkRef<P>

Link two points to eachother

Trait Implementations

impl<P: Clone + FullXY> Clone for InterPointLookup<P>

fn clone(&self) -> InterPointLookup<P>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<P: Debug + FullXY> Debug for InterPointLookup<P>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<P: FullXY> Default for InterPointLookup<P>

fn default() -> Self

Returns the “default value” for a type.

impl<P: PartialEq + FullXY> PartialEq for InterPointLookup<P>

fn eq(&self, other: &InterPointLookup<P>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<P: FullXY> StructuralPartialEq for InterPointLookup<P>