Struct Cons

pub struct Cons<T, L>(pub T, pub L);

The type used for a non-empty array. Analogous to a cons cell in a linked list.

Tuple Fields

0: T

1: L

Trait Implementations

impl<T, L: Array<T>> Array<T> for Cons<T, L>

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

Access the element at idx, or None if out of bounds.

fn len() -> usize

Get the compile-time length of the array.

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

Since the in-memory representation should be the same as a traditional array, it should be safe to read the pointer as one. However, since the rust specification makes memory layout undefined, it is held behind unsafe.

fn size(&self) -> usize

A conveinence wrapper around len that takes a refernce to facilitate using the right type.

impl<T: Clone, L: Clone> Clone for Cons<T, L>

fn clone(&self) -> Cons<T, L>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug, L: Debug> Debug for Cons<T, L>

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

Formats the value using the given formatter.

impl<T, S, L: Map<T, S>> Map<T, S> for Cons<T, L>

type Output = Cons<S, <L as Map<T, S>>::Output>

The resulting Array from performing the map.

fn map<F: Fn(T) -> S>(self, f: F) -> Self::Output

Transform the elements of the array using the provided function.

impl<T: Ord, L: Ord> Ord for Cons<T, L>

fn cmp(&self, other: &Cons<T, L>) -> 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, L: PartialEq> PartialEq for Cons<T, L>

fn eq(&self, other: &Cons<T, L>) -> 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, L: PartialOrd> PartialOrd for Cons<T, L>

fn partial_cmp(&self, other: &Cons<T, L>) -> 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, L: Copy> Copy for Cons<T, L>

impl<T: Eq, L: Eq> Eq for Cons<T, L>

impl<T, L> StructuralPartialEq for Cons<T, L>