Struct acacia::pure_tree::PureTree

pub struct PureTree<P, O> { /* fields omitted */ }

A pure N-dimensional tree

Methods

impl<P, O> PureTree<P, O> where
    O: Position,
    P: Partition<<O as Position>::Point>, 

fn new<I: Iterator<Item = O>>(
    iter: I,
    partition: P
) -> Result<PureTree<P, O>, ConstructionError>

Construct a tree without checking the geometry of the input data

Trait Implementations

impl<P: Clone, O> Node for PureTree<P, O>

type Partition = P

Type of spatial partitioning scheme

type Object = O

The type of object stored

type Container = Vec<PureTree<P, O>>

Type of container used to store subnodes

fn state(&self) -> NodeState<&O, &Vec<PureTree<P, O>>>

The state of the node

fn partition(&self) -> P

The partitioning scheme

impl<'a, P: Clone + 'a, O: 'a> IntoIterator for &'a PureTree<P, O>

type Item = &'a O

The type of the elements being iterated over.

type IntoIter = Iter<'a, PureTree<P, O>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Iter<'a, PureTree<P, O>>

Creates an iterator from a value.