Struct CircStack 

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

Available on crate features collections and circ only.

Implementations

impl<T, const N: usize> CircStack<T, N>

pub const fn new(buffer: [T; N], tail: usize) -> CircStack<T, N>

pub const fn new_uninit() -> CircStack<MaybeUninit<T>, N>

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

pub const fn pop_with_replacement(&mut self, replacement: T) -> T

pub const fn as_array(&self) -> &[T; N]

pub const fn as_array_mut(&mut self) -> &mut [T; N]

pub fn forget_init(self) -> CircStack<MaybeUninit<T>, N>

pub const fn rotate(&mut self, offset: isize)

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

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

impl<T: Copy, const N: usize> CircStack<T, N>

pub const fn repeat_item(item: T) -> CircStack<T, N>

pub const fn pop_copy(&mut self) -> T

pub const fn last(&self) -> &T

impl<T: Default, const N: usize> CircStack<T, N>

pub fn pop_with_default(&mut self) -> T

impl<T, const N: usize> CircStack<MaybeUninit<T>, N>

pub const fn transpose(self) -> MaybeUninit<CircStack<T, N>>

pub const fn transpose_mut(&mut self) -> &mut MaybeUninit<CircStack<T, N>>

pub const fn transpose_ref(&self) -> &MaybeUninit<CircStack<T, N>>

pub const unsafe fn assume_init(self) -> CircStack<T, N>

pub const unsafe fn assume_init_mut(&mut self) -> &mut CircStack<T, N>

pub const unsafe fn assume_init_ref(&self) -> &CircStack<T, N>

impl<T, const N: usize> CircStack<Option<T>, N>

pub fn transpose(self) -> Option<CircStack<T, N>>

Trait Implementations

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

fn clone(&self) -> CircStack<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 CircStack<T, N>

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

Formats the value using the given formatter.

impl<T: Default, const N: usize> Default for CircStack<T, N>

fn default() -> CircStack<T, N>

Returns the “default value” for a type.

impl<T, const N: usize> From<[T; N]> for CircStack<T, N>

fn from(buffer: [T; N]) -> Self

Converts to this type from the input type.

impl<T: Hash, const N: usize> Hash for CircStack<T, N>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T, const N: usize> Index<usize> for CircStack<T, N>

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<T, const N: usize> IndexMut<usize> for CircStack<T, N>

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

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

impl<'a, T, const N: usize> IntoIterator for &'a CircStack<T, N>

type Item = &'a T

The type of the elements being iterated over.

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

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T, const N: usize> IntoIterator for &'a mut CircStack<T, N>

type Item = &'a mut T

The type of the elements being iterated over.

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

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, const N: usize> IntoIterator for CircStack<T, N>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T, N>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Ord, const N: usize> Ord for CircStack<T, N>

fn cmp(&self, other: &CircStack<T, N>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T: PartialEq, const N: usize> PartialEq for CircStack<T, N>

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

impl<T: PartialOrd, const N: usize> PartialOrd for CircStack<T, N>

fn partial_cmp(&self, other: &CircStack<T, N>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Copy, const N: usize> TryFrom<&[T]> for CircStack<T, N>

type Error = TryFromSliceError

The type returned in the event of a conversion error.

fn try_from(value: &[T]) -> Result<Self, Self::Error>

Performs the conversion.

impl<T: Eq, const N: usize> Eq for CircStack<T, N>

impl<T, const N: usize> StructuralPartialEq for CircStack<T, N>