Struct btree_vec::vec::BTreeVec

pub struct BTreeVec<T, const B: usize> { /* private fields */ }

A growable array (vector) implemented as a B+ tree.

Provides O(log n) random accesses, insertions, and removals, and O(n) iteration.

B is the branching factor. It must be at least 4. The standard library uses a value of 6 for its B-tree structures. Larger values are better when T is smaller.

Implementations

impl<T, const B: usize> BTreeVec<T, B>

pub fn new() -> Self

Creates a new BTreeVec.

pub fn len(&self) -> usize

Gets the length of the vector.

pub fn is_empty(&self) -> bool

Checks whether the vector is empty.

pub fn get(&self, index: usize) -> Option<&T>

Gets the item at index, or None if no such item exists.

pub fn get_mut(&mut self, index: usize) -> Option<&mut T>

Gets a mutable reference to the item at index, or None if no such item exists.

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

Gets the first item in the vector, or None if the vector is empty.

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

Gets a mutable reference to the first item in the vector, or None if the vector is empty.

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

Gets the last item in the vector, or None if the vector is empty.

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

Gets a mutable reference to the last item in the vector, or None if the vector is empty.

pub fn insert(&mut self, index: usize, item: T)

Inserts item at index.

Panics

Panics if index is greater than self.len().

pub fn push(&mut self, item: T)

Inserts item at the end of the vector.

pub fn remove(&mut self, index: usize) -> T

Removes and returns the item at index.

Panics

Panics if index is not less than self.len().

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

Removes and returns the last item in the vector, or None if the vector is empty.

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

Gets an iterator that returns references to each item in the vector.

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

Gets an iterator that returns mutable references to each item in the vector.

Trait Implementations

impl<T, const B: usize> Default for BTreeVec<T, B>

fn default() -> Self

Returns the “default value” for a type.

impl<T, const B: usize> Drop for BTreeVec<T, B>

fn drop(&mut self)

Executes the destructor for this type.

impl<T, const B: usize> Index<usize> for BTreeVec<T, B>

type Output = T

The returned type after indexing.

fn index(&self, index: usize) -> &T

Performs the indexing (container[index]) operation.

impl<T, const B: usize> IndexMut<usize> for BTreeVec<T, B>

fn index_mut(&mut self, index: usize) -> &mut T

Performs the mutable indexing (container[index]) operation.

impl<'a, T, const B: usize> IntoIterator for &'a BTreeVec<T, B>

type Item = &'a T

The type of the elements being iterated over.

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

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T, const B: usize> IntoIterator for &'a mut BTreeVec<T, B>

type Item = &'a mut T

The type of the elements being iterated over.

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

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, const B: usize> IntoIterator for BTreeVec<T, B>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T, B>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Send, const B: usize> Send for BTreeVec<T, B>

impl<T: Sync, const B: usize> Sync for BTreeVec<T, B>