Struct BinarySearchTreeGroup 

pub struct BinarySearchTreeGroup {
    pub root: Option<Box<TreeNode>>,
}

Fields

root: Option<Box<TreeNode>>

Implementations

impl BinarySearchTreeGroup

pub fn new() -> Self

pub fn new_with_keys(keys: &[Key]) -> Self

pub fn len(&self) -> usize

pub fn insert(&mut self, key: Key)

pub fn contains(&self, key: Key) -> bool

pub fn set_infix_store(&mut self, key: Key, infix_store: InfixStore)

pub fn get_infix_store(&self, key: Key) -> Option<Arc<RwLock<InfixStore>>>

pub fn predecessor_infix_store( &self, key: Key, ) -> Option<Arc<RwLock<InfixStore>>>

pub fn predecessor(&self, key: Key) -> Option<Key>

pub fn successor(&self, key: Key) -> Option<Key>

pub fn successor_infix_store(&self, key: Key) -> Option<Arc<RwLock<InfixStore>>>

pub fn pretty_print(&self)

Trait Implementations

impl Debug for BinarySearchTreeGroup

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

Formats the value using the given formatter.

impl Default for BinarySearchTreeGroup

fn default() -> BinarySearchTreeGroup

Returns the “default value” for a type.

impl Display for BinarySearchTreeGroup

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

Formats the value using the given formatter.