Struct vebtrees::VEBTree

pub struct VEBTree { /* fields omitted */ }

An implementation of Van Emde Boas Trees in Rust

Fields

• children: Vec - the child VEBTrees of this tree
• aux: Vec - a single element Vec that holds to aux tree uses a Vec wrapper to allocate it on the heap without hardcore mutable reference nonsense.
• max: Option - The maximum of the currently stored elements, none if there are no stored elements, equal to min if there is only one element
• min: Option - The minimum of the currently stored elements, none if there are no stored elements, equal to max if there is only one element

Methods

impl VEBTree

pub fn new(max_size: usize) -> Self

Creates a new VEBTree with given max capacity.

Arguments

• max_size: the maximum capacity with which to initialize the tree

Returns

• A tree initialized to the maximum capacity specified

impl VEBTree

pub fn contains(&self, value: usize) -> bool

Returns whether or not the given element is in the tree

Arguments

• self: the instance of the VEBTree
• value: the value for which to check membership

Returns

• Whether or not the value is contained in the tree

pub fn search(&self, value: usize) -> Option<usize>

Searches the tree for the given value and returns the value if it is in the tree, None if not.

Arguments

• self: the instance of the VEBTree to operate on
• value: the value to search for in the tree

Returns

• The value being searched for or None if the value is not in the tree.

pub fn insert(&mut self, value: usize)

Insert a value into the array, does nothing if the value is already present.

Arguments

• self: the instance of the VEBTree to operate on
• value: the value to insert into the tree

pub fn delete(&mut self, value: usize)

Deletes an element from the VEBTree

Arguments

• self: the instance of the VEBTree to operate on
• value: the value to delete from the tree

pub fn minimum(&self) -> Option<usize>

Gets the minimum of the currently stored elements

Arguments

• self: the instance of VEBTree to operate on

Returns

• The minimum element currently stored in the tree

pub fn maximum(&self) -> Option<usize>

Gets the maximum of the currently stored elements

Arguments

• self: &Self - the instance of VEBTree to operate on.

Returns

• The maximum element currently stored in the tree

pub fn findnext(&self, value: usize) -> Option<usize>

Finds the next consecutive element currently in the tree

Arguments

• self: the instance of VEBTree to operate on.
• value: the value to find the successor of.

Returns

• The successor of 'value' or None if not found

pub fn findprev(&self, value: usize) -> Option<usize>

Finds the immediate previous element currently in the array

Arguments

• self: the instance of VEBTree to operate on
• value: the value to find the predecessor of

Returns

• The predecessor of 'value' or None if not found

Trait Implementations

impl Eq for VEBTree

impl Clone for VEBTree

fn clone(&self) -> VEBTree

Returns a copy of the value.

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

Performs copy-assignment from source.

impl PartialEq<VEBTree> for VEBTree

fn eq(&self, other: &VEBTree) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &VEBTree) -> bool

This method tests for !=.

impl Debug for VEBTree

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

Formats the value using the given formatter.