Struct RbTree 

pub struct RbTree<Tag, T: Copy> {
    root: Option<T>,
    min: Option<T>,
    _tag: PhantomData<Tag>,
}

Fields

root: Option<T>

min: Option<T>

_tag: PhantomData<Tag>

Implementations

impl<Tag, T: Copy + PartialEq> RbTree<Tag, T>

pub const fn new() -> Self

pub fn insert<S: Get<T> + GetMut<T>>( &mut self, id: T, storage: &mut S, ) -> Result<(), Error>

where <S as Get<T>>::Output: Linkable<Tag, T> + Compare<Tag, T>,

Inserts id into the tree. If id already exists in the tree, it is first removed and then re-inserted. Errors if id does not exist in storage.

pub fn remove<S: Get<T> + GetMut<T>>( &mut self, id: T, storage: &mut S, ) -> Result<(), Error>

where <S as Get<T>>::Output: Linkable<Tag, T> + Compare<Tag, T>,

pub fn min(&self) -> Option<T>

fn insert_fixup<S: Get<T> + GetMut<T>>( &mut self, id: T, storage: &mut S, ) -> Result<(), Error>

where <S as Get<T>>::Output: Linkable<Tag, T> + Compare<Tag, T>,

fn delete_fixup<S: Get<T> + GetMut<T>>( &mut self, id: Option<T>, parent: Option<T>, storage: &mut S, ) -> Result<(), Error>

where <S as Get<T>>::Output: Linkable<Tag, T> + Compare<Tag, T>,

fn minimum<S: Get<T>>(&self, id: T, storage: &S) -> Result<T, Error>

where <S as Get<T>>::Output: Linkable<Tag, T> + Compare<Tag, T>,

fn transplant<S: Get<T> + GetMut<T>>( &mut self, u: T, v: Option<T>, storage: &mut S, ) -> Result<(), Error>

where <S as Get<T>>::Output: Linkable<Tag, T> + Compare<Tag, T>,

fn rotate_right<S: Get<T> + GetMut<T>>( &mut self, pivot: T, left: T, storage: &mut S, ) -> Result<(), Error>

where <S as Get<T>>::Output: Linkable<Tag, T> + Compare<Tag, T>,

fn rotate_left<S: Get<T> + GetMut<T>>( &mut self, pivot: T, right: T, storage: &mut S, ) -> Result<(), Error>

where <S as Get<T>>::Output: Linkable<Tag, T> + Compare<Tag, T>,