Struct BaseAppendList 

pub struct BaseAppendList<T, V> { /* private fields */ }

A list that can be appended to while elements are borrowed

Uses pointer tagging to track allocated chunks of a fixed size.

Indexing is O(1)

Implementations

impl<T, V> BaseAppendList<T, V>

pub fn new() -> Self

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

Get an item from the list, if it is in bounds

Returns None if the index is out-of-bounds. Note that you can also index with [], which will panic on out-of-bounds.

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

Get an iterator over the list

pub fn drain_all<'a>(&'a mut self) -> Drain<'a, T>

pub fn len(&self) -> usize

pub fn capacity(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn extend<I: IntoIterator<Item = T>>(&self, iter: I)

impl<T> BaseAppendList<T, PushMut>

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

Append an item to the end

Note that this does not require mut.

impl<T> BaseAppendList<T, Index>

pub fn push(&self, item: T) -> &T

Append an item to the end

Note that this does not require mut.

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

Get an item from the list, if it is in bounds

Returns None if the index is out-of-bounds. Note that you can also index with [], which will panic on out-of-bounds.

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

Get an iterator over the list

Trait Implementations

impl<T: Debug> Debug for BaseAppendList<T, Index>

fn fmt(&self, fmt: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T, V> Default for BaseAppendList<T, V>

fn default() -> Self

Returns the “default value” for a type.

impl<T, V> Extend<T> for BaseAppendList<T, V>

fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T, V> FromIterator<T> for BaseAppendList<T, V>

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.

impl<T> Index<usize> for BaseAppendList<T, Index>

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<'a, T> IntoIterator for &'a BaseAppendList<T, Index>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq> PartialEq for BaseAppendList<T, Index>

fn eq(&self, other: &BaseAppendList<T, Index>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.