Struct EmptyRecursiveArray

pub struct EmptyRecursiveArray;

an empty recrusive array.

Trait Implementations

impl<T> AsMut<[T]> for EmptyRecursiveArray

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

Converts this type into a mutable reference of the (usually inferred) input type.

impl<T> AsRef<[T]> for EmptyRecursiveArray

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

Converts this type into a shared reference of the (usually inferred) input type.

impl Clone for EmptyRecursiveArray

fn clone(&self) -> EmptyRecursiveArray

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EmptyRecursiveArray

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

Formats the value using the given formatter.

impl Default for EmptyRecursiveArray

fn default() -> EmptyRecursiveArray

Returns the “default value” for a type.

impl Hash for EmptyRecursiveArray

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 PartialEq for EmptyRecursiveArray

fn eq(&self, other: &EmptyRecursiveArray) -> 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> RecursiveArray<T> for EmptyRecursiveArray

const LENGTH: usize = 0usize

the length of this array

const EMPTY: EmptyRecursiveArray = EmptyRecursiveArray

an empty recursive array.

fn empty() -> EmptyRecursiveArray

returns an empty recursive array.

fn len(&self) -> usize

returns the length of this recursive array.

fn from_array<const N: usize>(array: [T; N]) -> Self

converts the given array to a recursive array.

fn to_array<const N: usize>(self) -> [T; N]

converts this recrusive array to a regular array ([T; N]).

fn from_slice(slice: &[T]) -> &Self

converts the given slice to a recursive array reference. this is a zero cost operation, which just casts the slice.

fn from_mut_slice(slice: &mut [T]) -> &mut Self

converts the given mutable slice to a recursive array mutable reference. this is a zero cost operation, which just casts the slice.

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

returns the elements of this array as a slice.

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

returns the elements of this array as a mutable slice.

fn push_back( self, item: T, ) -> RecursiveArrayConcatenation<T, Self, RecursiveArraySingleItem<T>>

appends an element to the back of this array.

fn append_back<R: RecursiveArray<T>>( self, array: R, ) -> RecursiveArrayConcatenation<T, Self, R>

appends a recrusive array to the back of this array.

fn push_front( self, item: T, ) -> RecursiveArrayConcatenation<T, RecursiveArraySingleItem<T>, Self>

appends an element to the fron of this array.

fn append_front<R: RecursiveArray<T>>( self, array: R, ) -> RecursiveArrayConcatenation<T, R, Self>

appends a recrusive array to the front of this array.

impl Copy for EmptyRecursiveArray

impl Eq for EmptyRecursiveArray

impl StructuralPartialEq for EmptyRecursiveArray