Struct dinotree::DinoTreeRef

pub struct DinoTreeRef<'a, A: AxisTrait, T: HasAabb> { /* fields omitted */ }

Referance to a dinotree container.

Methods

impl<'a, A: AxisTrait, T: HasAabb> DinoTreeRef<'a, A, T>

pub fn as_ref(&self) -> DinoTreeRef<A, T>

pub fn axis(&self) -> A

pub fn into_vistr(self) -> Vistr<'a, T>

pub fn vistr(&self) -> Vistr<T>

Important traits for Iter<'a, T>

impl<'a, T> Iterator for Iter<'a, T> type Item = &'a T;

pub fn iter(&self) -> Iter<T>

Iterate over all the bots in the tree. The order in which they are iterated over is dfs pre order as they have been binned and sorted into the dinotree.

pub fn height(&self) -> usize

Return the height of the dinotree.

pub fn num_nodes(&self) -> usize

Return the number of nodes of the dinotree.

pub fn num_bots(&self) -> usize

Return the number of bots in the tree.

#[must_use] pub fn are_invariants_met(&self) -> bool

Returns Ok, then this tree's invariants are being met. Should always return true, unless the user corrupts the trees memory or if the contract of the HasAabb trait are not upheld.

Trait Implementations

impl<'a, A: AxisTrait, T: HasAabb> IntoIterator for DinoTreeRef<'a, A, T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.