Struct acacia::pure_tree::PureTree
[−]
[src]
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>,
[src]
O: Position,
P: Partition<<O as Position>::Point>,
fn new<I: Iterator<Item = O>>(
iter: I,
partition: P
) -> Result<PureTree<P, O>, ConstructionError>
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>
[src]
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