Struct raw_btree::RawBTree

pub struct RawBTree<T, S: Storage<T> = BoxStorage> { /* private fields */ }

Implementations

impl<T, S: Storage<T>> RawBTree<T, S>

pub fn new() -> RawBTree<T, S>

Create a new empty B-tree.

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn address_of<Q: ?Sized>( &self, cmp: impl Fn(&T, &Q) -> Ordering, key: &Q ) -> Result<Address<S::Node>, Option<Address<S::Node>>>

pub fn first_item_address(&self) -> Option<Address<S::Node>>

pub unsafe fn get_at(&self, addr: Address<S::Node>) -> Option<&T>

Return the item at the given address.

Safety

The address’s node must not have been deallocated.

pub unsafe fn get_mut_at(&mut self, addr: Address<S::Node>) -> Option<&mut T>

Returns a mutable reference to the item at the given address.

Safety

The address’s node must not have been deallocated.

pub fn get<Q: ?Sized>( &self, cmp: impl Fn(&T, &Q) -> Ordering, key: &Q ) -> Option<&T>

pub fn get_mut<Q: ?Sized>( &mut self, cmp: impl Fn(&T, &Q) -> Ordering, key: &Q ) -> Option<&mut T>

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

pub fn first_mut(&mut self) -> Option<&mut T>

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

pub fn last_mut(&mut self) -> Option<&mut T>

pub fn iter(&self) -> Iter<'_, T, S>

pub fn iter_mut(&mut self) -> IterMut<'_, T, S>

pub fn insert(&mut self, cmp: impl Fn(&T, &T) -> Ordering, item: T) -> Option<T>

pub fn remove<Q: ?Sized>( &mut self, cmp: impl Fn(&T, &Q) -> Ordering, key: &Q ) -> Option<T>

Remove the next item and return it.

pub fn visit_from_leaves(&self, f: impl FnMut(S::Node))

pub fn visit_from_leaves_mut(&mut self, f: impl FnMut(S::Node, &mut Node<T, S>))

pub fn forget(&mut self)

pub fn clear(&mut self)

pub fn validate(&self, cmp: impl Fn(&T, &T) -> Ordering)

pub fn validate_node( &self, cmp: &impl Fn(&T, &T) -> Ordering, id: S::Node, parent: Option<S::Node>, min: Option<&T>, max: Option<&T> ) -> usize

Validate the given node and returns the depth of the node.

Trait Implementations

impl<T: Clone, S: Clone + Storage<T>> Clone for RawBTree<T, S>

where S::Node: Clone,

fn clone(&self) -> RawBTree<T, S>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T, S: Storage<T>> Default for RawBTree<T, S>

fn default() -> Self

Returns the “default value” for a type.

impl<T, S: Storage<T>> Drop for RawBTree<T, S>

fn drop(&mut self)

Executes the destructor for this type.

impl<'a, T, S: Storage<T>> IntoIterator for &'a RawBTree<T, S>

type IntoIter = Iter<'a, T, S>

Which kind of iterator are we turning this into?

type Item = &'a T

The type of the elements being iterated over.

fn into_iter(self) -> Iter<'a, T, S>

Creates an iterator from a value.

impl<'a, T, S: Storage<T>> IntoIterator for &'a mut RawBTree<T, S>

type IntoIter = IterMut<'a, T, S>

Which kind of iterator are we turning this into?

type Item = &'a mut T

The type of the elements being iterated over.

fn into_iter(self) -> IterMut<'a, T, S>

Creates an iterator from a value.

impl<T, S: Storage<T>> IntoIterator for RawBTree<T, S>

type IntoIter = IntoIter<T, S>

Which kind of iterator are we turning this into?

type Item = T

The type of the elements being iterated over.

fn into_iter(self) -> IntoIter<T, S>

Creates an iterator from a value.