Struct ds_ext::Tree

pub struct Tree { /* private fields */ }

A binary search tree which maps cardinal values to ordinal values

Implementations

impl Tree

pub fn new() -> Self

Construct a new Tree.

pub fn with_capacity(capacity: usize) -> Self

Construct a new Tree with the given capacity.

pub fn clear(&mut self)

Remove all nodes from this Tree.

pub fn is_empty(&self) -> bool

Return true if this Tree has zero nodes.

pub fn size(&self) -> usize

Check the cardinal size of this Tree.

pub fn insert(&mut self, ordinal: usize) -> bool

Insert an ordinal into this Tree and return false if it was already present.

Panics:

• if ordinal >= self.max_size()

pub fn ordinal(&self, cardinal: usize) -> usize

Find the ordinal of the given cardinal.

Panics:

• if cardinal >= self.size()

pub fn remove(&mut self, ordinal: usize) -> bool

Remove the given ordinal from this Tree and return true if it was present.

Panics:

• if ordinal >= self.max_size()

Trait Implementations

impl Clone for Tree

fn clone(&self) -> Tree

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Tree

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

Formats the value using the given formatter.

impl GetSize for Tree

fn get_heap_size(&self) -> usize

Determines how many bytes this object occupies inside the heap.

fn get_stack_size() -> usize

Determines how may bytes this object occupies inside the stack.

fn get_size(&self) -> usize

Determines the total size of the object.