Struct binary_tree::count::CountNode

pub struct CountNode<T> {
    // some fields omitted
}

Node of a CountTree.

The only way of getting your hands on a CountNode is through CountTree::root() method which returns a shared reference to its root. Thus NodeMut methods are not accessible to users.

Trait Implementations

impl<T> Node for CountNode<T>

type Value = T

fn left(&self) -> Option<&Self>

fn right(&self) -> Option<&Self>

fn value(&self) -> &T

fn walk<'a, F>(&'a self, step_in: F) where F: FnMut(&'a Self) -> WalkAction

impl<T> NodeMut for CountNode<T>

type NodePtr = NodePtr<T>

fn detach_left(&mut self) -> Option<Self::NodePtr>

fn detach_right(&mut self) -> Option<Self::NodePtr>

fn insert_left(&mut self, tree: Option<Self::NodePtr>) -> Option<Self::NodePtr>

fn insert_right(&mut self, tree: Option<Self::NodePtr>) -> Option<Self::NodePtr>

fn value_mut(&mut self) -> &mut T

fn into_parts(self) -> (T, Option<Self::NodePtr>, Option<Self::NodePtr>)

fn left_mut(&mut self) -> Option<&mut Self>

fn right_mut(&mut self) -> Option<&mut Self>

fn rotate_left(&mut self) -> Result<(), ()>

fn rotate_right(&mut self) -> Result<(), ()>

fn walk_mut<'a, FI, FS>(&'a mut self, step_in: FI, stop: FS) where FI: FnMut(&Self) -> WalkAction, FS: FnOnce(&'a mut Self)

fn walk_reshape<FI, FS, FO>(&mut self, step_in: FI, stop: FS, step_out: FO) where FI: FnMut(&mut Self) -> WalkAction, FS: FnOnce(&mut Self), FO: FnMut(&mut Self, WalkAction)

fn insert_before<F>(&mut self, new_node: Self::NodePtr, step_out: F) where F: FnMut(&mut Self, WalkAction)

fn walk_extract<FI, FE, FO>(&mut self, step_in: FI, extract: FE, step_out: FO) -> Option<Self::NodePtr> where FI: FnMut(&mut Self) -> WalkAction, FE: FnOnce(&mut Self, &mut Option<Self::NodePtr>), FO: FnMut(&mut Self, WalkAction)

fn try_remove<F>(&mut self, step_out: F) -> Option<Self::NodePtr> where F: FnMut(&mut Self, WalkAction)

impl<T> Debug for CountNode<T> where T: Debug

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