Struct generic_octree::octree::Octree

pub struct Octree<L: Eq + Hash, D> {
    pub content: HashMap<L, OctreeNode<L, D>>,
    // some fields omitted
}

Fields

content: HashMap<L, OctreeNode<L, D>>

Methods

impl<L, D> Octree<L, D> where
    L: Eq + Hash, 

pub fn size(&self) -> usize

Get the size of an octree

impl<L, D> Octree<L, D> where
    L: Eq + Ord + Hash + Copy + Shr<Output = L> + Shl<Output = L> + BitOr<Output = L> + BitAnd<Output = L> + From<u8> + From<L>,
    D: Copy + PartialEq, 

pub fn new(max_depth: u32) -> Self

Create a new Octree

pub fn with_capacity(max_depth: u32, size: usize) -> Self

Create an Octree with given pre-allocated space.

pub fn depth(&self) -> u32

pub fn lookup(&self, loc_code: &L) -> Option<&OctreeNode<L, D>>

Return a tree node a node.

pub fn insert(&mut self, node: OctreeNode<L, D>) -> L

Insert a tree node.

pub fn remove_node(&mut self, loc_code: &L)

pub fn get_mut_root(
    &mut self,
    node: &OctreeNode<L, D>
) -> Option<&mut OctreeNode<L, D>>

Get a mutable root node.

pub fn get_root(&self, node: &OctreeNode<L, D>) -> Option<&OctreeNode<L, D>>

Get a immutable root node.

pub fn merge(&mut self, aabb: AABB, data: D)

Merge an AABB into the tree

pub fn transform<U: From<D>>(self) -> Octree<L, U>

Transform an Octree of data D into an Octree of data U, provided that U implement From

pub fn transform_fn<U, F: Fn(D) -> U>(self, function: F) -> Octree<L, U>

tree.transform_fn(Rgb::from_hex);

pub fn transform_nodes_fn<U, F: Fn(OctreeNode<L, D>) -> OctreeNode<L, U>>(
    self,
    function: F
) -> Octree<L, U>

tree.transform_fn(Rgb::from_hex);

Trait Implementations

impl<L: Debug + Eq + Hash, D: Debug> Debug for Octree<L, D>

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

Formats the value using the given formatter.