Struct geom::FindClosest

source · [−]

pub struct FindClosest<K> {
    geometries: BTreeMap<K, LineString<f64>>,
    quadtree: QuadTree<K>,
}

Expand description

A quad-tree to quickly find the closest points to some polylines.

Fields

geometries: BTreeMap<K, LineString<f64>>quadtree: QuadTree<K>

Implementations

source

impl<K> FindClosest<K> where
K: Clone + Ord + Debug,

source

pub fn new(bounds: &Bounds) -> FindClosest<K>

Creates the quad-tree, limited to points contained in the boundary.

source

pub fn add(&mut self, key: K, pts: &[Pt2D ])

Add an object to the quadtree, remembering some key associated with the points. TODO This doesn’t properly handle single points, and will silently fail by never returning any matches.

source

pub fn all_close_pts(
 &self,
 query_pt: Pt2D,
 max_dist_away: Distance
) -> Vec<(K, Pt2D, Distance )>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,`

For every object within some distance of a query point, return the (object’s key, point on the object’s polyline, distance away).

source

pub fn closest_pt(
 &self,
 query_pt: Pt2D,
 max_dist_away: Distance
) -> Option<(K, Pt2D )>

Finds the closest point on the existing geometry to the query pt.

Auto Trait Implementations

impl<K> RefUnwindSafe for FindClosest<K> where
K: RefUnwindSafe,

impl<K> Send for FindClosest<K> where
K: Send,

impl<K> Sync for FindClosest<K> where
K: Sync,

impl<K> Unpin for FindClosest<K> where
K: Unpin,

impl<K> UnwindSafe for FindClosest<K> where
K: UnwindSafe + RefUnwindSafe,

Blanket Implementations

source

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

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

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

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
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.

impl<T> Same<T> for T

type Output = T

Should always be Self

source

impl<T, U> TryFrom for T where
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 T where
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.

Struct geom::FindClosest

Fields

Implementations

impl<K> FindClosest<K> where
K: Clone + Ord + Debug,

pub fn new(bounds: &Bounds) -> FindClosest<K>

pub fn add(&mut self, key: K, pts: &[Pt2D ])

pub fn all_close_pts(
    &self,
    query_pt: Pt2D,
    max_dist_away: Distance
) -> Vec<(K, Pt2D, Distance )>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where     A: Allocator,`

pub fn closest_pt(
    &self,
    query_pt: Pt2D,
    max_dist_away: Distance
) -> Option<(K, Pt2D )>

Auto Trait Implementations

impl<K> RefUnwindSafe for FindClosest<K> where
K: RefUnwindSafe,

impl<K> Send for FindClosest<K> where
K: Send,

impl<K> Sync for FindClosest<K> where
K: Sync,

impl<K> Unpin for FindClosest<K> where
K: Unpin,

impl<K> UnwindSafe for FindClosest<K> where
K: UnwindSafe + RefUnwindSafe,

Blanket Implementations

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

impl<T> Same<T> for T

type Output = T

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

type Error = Infallible

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

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

Struct geom::FindClosest

Fields

Implementations

impl<K> FindClosest<K> where K: Clone + Ord + Debug,

pub fn new(bounds: &Bounds) -> FindClosest<K>

pub fn add(&mut self, key: K, pts: &[Pt2D])

pub fn all_close_pts( &self, query_pt: Pt2D, max_dist_away: Distance) -> Vec<(K, Pt2D, Distance)>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where A: Allocator,

pub fn closest_pt( &self, query_pt: Pt2D, max_dist_away: Distance) -> Option<(K, Pt2D)>

Auto Trait Implementations

impl<K> RefUnwindSafe for FindClosest<K> where K: RefUnwindSafe,

impl<K> Send for FindClosest<K> where K: Send,

impl<K> Sync for FindClosest<K> where K: Sync,

impl<K> Unpin for FindClosest<K> where K: Unpin,

impl<K> UnwindSafe for FindClosest<K> where K: UnwindSafe + RefUnwindSafe,

Blanket Implementations

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

impl<T> Same<T> for T

type Output = T

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

type Error = Infallible

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

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

impl<K> FindClosest<K> where
K: Clone + Ord + Debug,

pub fn add(&mut self, key: K, pts: &[Pt2D ])

pub fn all_close_pts(
&self,
query_pt: Pt2D,
max_dist_away: Distance
) -> Vec<(K, Pt2D, Distance )>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,`

pub fn closest_pt(
&self,
query_pt: Pt2D,
max_dist_away: Distance
) -> Option<(K, Pt2D )>

impl<K> RefUnwindSafe for FindClosest<K> where
K: RefUnwindSafe,

impl<K> Send for FindClosest<K> where
K: Send,

impl<K> Sync for FindClosest<K> where
K: Sync,

impl<K> Unpin for FindClosest<K> where
K: Unpin,

impl<K> UnwindSafe for FindClosest<K> where
K: UnwindSafe + RefUnwindSafe,

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<T, U> Into<U> for T where
U: From<T>,

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

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