Struct TreeBranch 

pub struct TreeBranch<const N: usize> { /* private fields */ }

A struct representing a branch in the tree.

Trait Implementations

impl<const N: usize> Branch<N> for TreeBranch<N>

fn new() -> Self

Creates a new Branch.

fn get_count(&self) -> u64

Gets the count of leaves beneath this node.

fn get_zero(&self) -> &Array<N>

Gets the location of the zero branch beneath this node.

fn get_one(&self) -> &Array<N>

Gets the location of the one branch beneath this node.

fn get_split_index(&self) -> usize

Gets the index on which to split keys when traversing this node.

fn get_key(&self) -> &Array<N>

Gets the associated key with this node.

fn set_count(&mut self, count: u64)

Sets the count of leaves below this node.

fn set_zero(&mut self, zero: Array<N>)

Sets the location of the zero branch beneath this node.

fn set_one(&mut self, one: Array<N>)

Sets the location of the one branch beneath this node..

fn set_split_index(&mut self, index: usize)

Sets the index on which to split keys when traversing this node.

fn set_key(&mut self, key: Array<N>)

Sets the associated key for this node.

fn decompose(self) -> (u64, Array<N>, Array<N>, usize, Array<N>)

Decomposes the Branch into its constituent parts.

impl<const N: usize> Clone for TreeBranch<N>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const N: usize> Debug for TreeBranch<N>

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

Formats the value using the given formatter.

impl<const N: usize> PartialEq for TreeBranch<N>

fn eq(&self, other: &TreeBranch<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<const N: usize> Copy for TreeBranch<N>

impl<const N: usize> Eq for TreeBranch<N>

impl<const N: usize> StructuralPartialEq for TreeBranch<N>