Struct KDTree 

pub struct KDTree<N: IndexableNum> { /* private fields */ }

An owned KDTree buffer.

Usually this will be created from scratch via KDTreeBuilder.

Implementations

impl<N: IndexableNum> KDTree<N>

pub fn into_inner(self) -> Vec<u8>

Consume this KDTree, returning the underlying buffer.

Trait Implementations

impl<N: IndexableNum> AsRef<[u8]> for KDTree<N>

fn as_ref(&self) -> &[u8]

Converts this type into a shared reference of the (usually inferred) input type.

impl<N: Clone + IndexableNum> Clone for KDTree<N>

fn clone(&self) -> KDTree<N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N: Debug + IndexableNum> Debug for KDTree<N>

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

Formats the value using the given formatter.

impl<N: IndexableNum> KDTreeIndex<N> for KDTree<N>

fn coords(&self) -> &[N]

The underlying raw coordinate buffer of this tree

fn indices(&self) -> Indices<'_>

The underlying raw indices buffer of this tree

fn metadata(&self) -> &KDTreeMetadata<N>

Access the metadata describing this KDTree

fn num_items(&self) -> u32

The number of items in this KDTree

fn node_size(&self) -> u16

The node size of this KDTree

fn range(&self, min_x: N, min_y: N, max_x: N, max_y: N) -> Vec<u32>

Search the index for items within a given bounding box.

fn range_rect(&self, rect: &impl RectTrait<T = N>) -> Vec<u32>

Search the index for items within a given bounding box.

fn within(&self, qx: N, qy: N, r: N) -> Vec<u32>

Search the index for items within a given radius.

fn within_coord(&self, coord: &impl CoordTrait<T = N>, r: N) -> Vec<u32>

Search the index for items within a given radius.

fn root(&self) -> Node<'_, N, Self>

Access the root node of the KDTree for manual traversal.

impl<N: PartialEq + IndexableNum> PartialEq for KDTree<N>

fn eq(&self, other: &KDTree<N>) -> 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<N: IndexableNum> StructuralPartialEq for KDTree<N>