pub struct CircularBTreeMap<T: Ord> { /* private fields */ }Implementations§
Source§impl<T: Ord + Display + Debug + Clone> CircularBTreeMap<T>
impl<T: Ord + Display + Debug + Clone> CircularBTreeMap<T>
pub fn new() -> Self
pub fn insert_node(&mut self, node_val: T) -> Result<(T, T), BTreeError>
pub fn delete_node(&mut self, key: &T) -> Result<(T, T), BTreeError>
pub fn nodes_count(&self) -> usize
pub fn search_node(&self, key: T) -> bool
pub fn val_in_node(&self, val: &T) -> Result<T, BTreeError>
pub fn get_min_key(&self) -> Option<T>
pub fn get_max_key(&self) -> Option<T>
pub fn print(&self)
Trait Implementations§
Auto Trait Implementations§
impl<T> Freeze for CircularBTreeMap<T>
impl<T> !RefUnwindSafe for CircularBTreeMap<T>
impl<T> !Send for CircularBTreeMap<T>
impl<T> !Sync for CircularBTreeMap<T>
impl<T> Unpin for CircularBTreeMap<T>
impl<T> !UnwindSafe for CircularBTreeMap<T>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more