Struct smart_buffer::SmartBuffer

pub struct SmartBuffer<T, const N: usize> where
    T: Clone,  { /* fields omitted */ }

Implementations

impl<T, const N: usize> SmartBuffer<T, N> where
    T: Clone, 

pub fn clear(&mut self)

Clears all values to the given default value.

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

Safely push a value into the SmartBuffer

pub fn set_size(&mut self, size: usize)

Sets the size of the buffer (does not reduce capacity)

pub fn insert_slice(&mut self, slice: &[T])

Safely inserts a slice of data, starting at the size.

pub fn insert_slice_at(&mut self, slice: &[T], index: usize)

Safely inserts a slice of data at an index;

pub fn insert_arr<const M: usize>(&mut self, arr: &[T; M])

Safely inserts an array, starting at the size.

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

Safely insert a value into the SmartBuffer

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

Safely get a value at an index

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

Unsafely get a reference to a value at an index. An index too large will result in a fault

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

Unsafely get a mutable

pub fn as_mut_ptr(self) -> *mut Self

pub fn new(value: T, len: usize) -> Self where
    T: Copy + Clone, 

pub fn from_arr(buf: [T; N], len: usize) -> Self where
    T: Clone, 

Creates a SmartBuffer from an array

impl<T, const N: usize> SmartBuffer<T, N> where
    T: Clone + PartialEq, 

pub fn calc_size(&mut self)

Recalculates the size

Trait Implementations

impl<T, const N: usize> Drop for SmartBuffer<T, N> where
    T: Clone, 

pub fn drop(&mut self)

Executes the destructor for this type.

impl<T, const N: usize> Index<usize> for &SmartBuffer<T, N> where
    T: Clone, 

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<T, const N: usize> Index<usize> for SmartBuffer<T, N> where
    T: Clone, 

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<T, const N: usize> IndexMut<usize> for SmartBuffer<T, N> where
    T: Clone, 

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

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

impl<T, const N: usize> Into<Vec<T, Global>> for SmartBuffer<T, N> where
    T: Clone, 

pub fn into(self) -> Vec<T>

Performs the conversion.

impl<T, const N: usize> IntoIterator for SmartBuffer<T, N> where
    T: Clone, 

type Item = T

The type of the elements being iterated over.

type IntoIter = SmartBufferIter<T, N>

Which kind of iterator are we turning this into?

pub fn into_iter(self) -> Self::IntoIter

Creates a consuming Iterator

impl<'a, T, const N: usize> IntoIterator for &'a SmartBuffer<T, N> where
    T: Clone, 

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = SmartBufferIterRef<'a, T, N>

Which kind of iterator are we turning this into?

pub fn into_iter(self) -> Self::IntoIter

Creates a consuming Iterator

impl<'a, T, const N: usize> IntoIterator for &'a mut SmartBuffer<T, N> where
    T: Clone, 

type Item = &'a mut T

The type of the elements being iterated over.

type IntoIter = SmartBufferIterRefMut<'a, T, N>

Which kind of iterator are we turning this into?

pub fn into_iter(self) -> Self::IntoIter

Creates a consuming Iterator