Struct OptArrayVec 

pub struct OptArrayVec<T, const N: usize> { /* private fields */ }

A vector-like container that does not store its length directly, but rather retrieves them through inner options I highly discourage using this if size_of::<Yourtype> != size_of::<Option<Yourtype>>

Implementations

impl<T, const CAP: usize> OptArrayVec<T, CAP>

pub fn cap(&self) -> usize

pub fn len(&self) -> usize

Amount of elements in the vec

Complexity

Runtime is O(CAP) worst case

pub fn is_empty(&self) -> bool

pub const fn new() -> Self

Create a new empty vec CAP must be provided for how many elements can be stored

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

Pushes new element at the back of the vec

Complexity

Runtime is O(CAP) worst case

Panics

When the len == CAP

pub fn clear(&mut self)

Removes all elements from the vec

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

Removes last element from the vec and return it If the vec is empty None is returned instead

pub fn into_inner(self) -> [Option<T>; CAP]

Returns contents as they are stored internally

pub fn remaining_capacity(&self) -> usize

Returns capacity still remaining

impl<T, const CAP: usize> OptArrayVec<T, CAP>

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

Trait Implementations

impl<T: Clone, const N: usize> Clone for OptArrayVec<T, N>

fn clone(&self) -> OptArrayVec<T, N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug, const N: usize> Debug for OptArrayVec<T, N>

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

Formats the value using the given formatter.

impl<T, const CAP: usize> Default for OptArrayVec<T, CAP>

fn default() -> Self

Returns the “default value” for a type.

impl<T, const CAP: usize> Extend<T> for OptArrayVec<T, CAP>

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

Appends iterator to Self

Panics

When the iterator yields more elements than there is remaining space

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, const CAP: usize> FromIterator<T> for OptArrayVec<T, CAP>

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

Create a vec from an iterator.

Panics

When the iterator yields more elements than CAP

impl<T, const CAP: usize> Index<usize> for OptArrayVec<T, CAP>

type Output = T

The returned type after indexing.

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T, const CAP: usize> IndexMut<usize> for OptArrayVec<T, CAP>

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

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

impl<'a, T, const CAP: usize> IntoIterator for &'a OptArrayVec<T, CAP>

type IntoIter = Iter<'a, T>

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) -> Self::IntoIter

Creates an iterator from a value.

impl<T, const CAP: usize> IntoIterator for OptArrayVec<T, CAP>

type IntoIter = IntoIter<T, CAP>

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, CAP>

Creates an iterator from a value.

impl<T: Copy, const N: usize> Copy for OptArrayVec<T, N>