Struct heapless::Vec

pub struct Vec<T, A> where
    A: Unsize<[T]>,  { /* fields omitted */ }

A Vec, vector, backed by a fixed size array

Methods

impl<T, A> Vec<T, A> where
    A: Unsize<[T]>, 

const fn new() -> Self

Constructs a new, empty Vec<T> backed by the array A

fn capacity(&self) -> usize

Returns the maximum number of elements the vector can hold

fn clear(&mut self)

Clears the vector, removing all values.

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

Removes the last element from a vector and return it, or None if it's empty

fn push(&mut self, item: T) -> Result<(), BufferFullError>

Appends an element to the back of the collection

Returns BufferFullError if the vector is full

fn truncate(&mut self, len: usize)

Shortens the vector, keeping the first len elements and dropping the rest.

Trait Implementations

impl<T, A> Drop for Vec<T, A> where
    A: Unsize<[T]>, 

fn drop(&mut self)

Executes the destructor for this type.

impl<'a, T, A> IntoIterator for &'a Vec<T, A> where
    A: Unsize<[T]>, 

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<'a, T, A> IntoIterator for &'a mut Vec<T, A> where
    A: Unsize<[T]>, 

type Item = &'a mut T

The type of the elements being iterated over.

type IntoIter = IterMut<'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, A> Deref for Vec<T, A> where
    A: Unsize<[T]>, 

type Target = [T]

The resulting type after dereferencing.

fn deref(&self) -> &[T]

Dereferences the value.

impl<T, A> DerefMut for Vec<T, A> where
    A: Unsize<[T]>, 

fn deref_mut(&mut self) -> &mut [T]

Mutably dereferences the value.