Struct ZeroCopyVec 

pub struct ZeroCopyVec<'a, L, T, const PAD: bool = true>
where
    L: ZeroCopyTraits,
    T: ZeroCopyTraits,
{ /* private fields */ }

ZeroCopyVec is a custom vector implementation which forbids post-initialization reallocations. The size is not known during compile time (that makes it different from arrays), but can be defined only once (that makes it different from Vec).

Implementations

impl<'a, L, T, const PAD: bool> ZeroCopyVec<'a, L, T, PAD>

where L: ZeroCopyTraits, T: ZeroCopyTraits, u64: From<L> + TryInto<L>,

pub fn new(capacity: L, bytes: &'a mut [u8]) -> Result<Self, ZeroCopyError>

pub fn new_at( capacity: L, bytes: &'a mut [u8], ) -> Result<(Self, &'a mut [u8]), ZeroCopyError>

pub fn from_bytes(bytes: &'a mut [u8]) -> Result<Self, ZeroCopyError>

pub fn from_bytes_at( bytes: &'a mut [u8], ) -> Result<(Self, &'a mut [u8]), ZeroCopyError>

pub fn push(&mut self, value: T) -> Result<(), ZeroCopyError>

pub fn clear(&mut self)

pub fn zero_out(&mut self)

pub fn metadata_size() -> usize

pub fn data_size(capacity: L) -> usize

pub fn required_size_for_capacity(capacity: L) -> usize

pub fn capacity(&self) -> usize

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

pub fn get_mut(&mut self, index: usize) -> 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 as_slice(&self) -> &[T]

pub fn as_mut_slice(&mut self) -> &mut [T]

pub fn extend_from_slice(&mut self, slice: &[T]) -> Result<(), ZeroCopyError>

impl<'a, L, T, const PAD: bool> ZeroCopyVec<'_, L, T, PAD>

where L: ZeroCopyTraits, T: ZeroCopyTraits, u64: From<L> + TryInto<L>,

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

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

Trait Implementations

impl<L, T, const PAD: bool> Debug for ZeroCopyVec<'_, L, T, PAD>

where L: ZeroCopyTraits, T: ZeroCopyTraits + Debug, u64: From<L> + TryInto<L>,

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

Formats the value using the given formatter.

impl<L, T, const PAD: bool> Index<usize> for ZeroCopyVec<'_, L, T, PAD>

where L: ZeroCopyTraits, T: ZeroCopyTraits, u64: From<L> + TryInto<L>,

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<L, T, const PAD: bool> IndexMut<usize> for ZeroCopyVec<'_, L, T, PAD>

where L: ZeroCopyTraits, T: ZeroCopyTraits, u64: From<L> + TryInto<L>,

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

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

impl<'a, L, T, const PAD: bool> IntoIterator for &'a ZeroCopyVec<'_, L, T, PAD>

where L: ZeroCopyTraits, T: ZeroCopyTraits, u64: From<L> + TryInto<L>,

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, L, T, const PAD: bool> IntoIterator for &'a mut ZeroCopyVec<'_, L, T, PAD>

where L: ZeroCopyTraits, T: ZeroCopyTraits, u64: From<L> + TryInto<L>,

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<L, T, const PAD: bool> PartialEq for ZeroCopyVec<'_, L, T, PAD>

where L: ZeroCopyTraits, T: ZeroCopyTraits + PartialEq, u64: From<L> + TryInto<L>,

fn eq(&self, other: &Self) -> 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.