Struct Array

#[repr(transparent)]
pub struct Array<'n, T>(Branded<'n, [T]>);

Array of length equal to the value tied to 'n.

Tuple Fields

0: Branded<'n, [T]>

Implementations

impl<'n, T> Array<'n, T>

pub fn from_ref<'a>(slice: &'a [T], size: Size<'n>) -> &'a Array<'n, T>

Returns a constrained array after checking that its length matches size.

pub fn from_mut<'a>(slice: &'a mut [T], size: Size<'n>) -> &'a mut Array<'n, T>

Returns a constrained array after checking that its length matches size.

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

Returns the unconstrained slice.

pub fn as_mut<'a>(&mut self) -> &'a mut [T]

Returns the unconstrained slice.

pub fn len(&self) -> Size<'n>

Returns the length of self.

Trait Implementations

impl<T> Debug for Array<'_, T>

where T: Debug,

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

Formats the value using the given formatter.

impl<'n, T> Index<Idx<'n, usize>> for Array<'n, T>

type Output = T

The returned type after indexing.

fn index( &self, idx: Idx<'n, usize>, ) -> &<Array<'n, T> as Index<Idx<'n, usize>>>::Output

Performs the indexing (container[index]) operation.

impl<'n, T> Index<Range<IdxInclusive<'n, usize>>> for Array<'n, T>

type Output = [T]

The returned type after indexing.

fn index( &self, idx: Range<IdxInclusive<'n, usize>>, ) -> &<Array<'n, T> as Index<Range<IdxInclusive<'n, usize>>>>::Output

Performs the indexing (container[index]) operation.

impl<'n, T> IndexMut<Idx<'n, usize>> for Array<'n, T>

fn index_mut( &mut self, idx: Idx<'n, usize>, ) -> &mut <Array<'n, T> as Index<Idx<'n, usize>>>::Output

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

impl<'n, T> IndexMut<Range<IdxInclusive<'n, usize>>> for Array<'n, T>

fn index_mut( &mut self, idx: Range<IdxInclusive<'n, usize>>, ) -> &mut <Array<'n, T> as Index<Range<IdxInclusive<'n, usize>>>>::Output

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

impl<'n, T> Ord for Array<'n, T>

where T: Ord,

fn cmp(&self, other: &Array<'n, T>) -> Ordering

This method returns an Ordering between self and other.

impl<'n, T> PartialEq for Array<'n, T>

where T: PartialEq,

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

where T: PartialOrd,

fn partial_cmp(&self, other: &Array<'n, T>) -> 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<'n, T> Eq for Array<'n, T>

where T: Eq,

impl<'n, T> StructuralPartialEq for Array<'n, T>