Struct Bounded 

pub struct Bounded<T, const N: usize>(/* private fields */);

An ordered collection of at most N items.

Implementations

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

pub const fn empty() -> Self

An empty collection under this ceiling.

pub fn new(items: Vec<T>) -> Result<Self, Overflow>

Admits one complete ordered offering under this ceiling.

Errors

Returns Overflow when more than N items are offered.

pub fn from_array<const M: usize>(items: [T; M]) -> Self

Admits a fixed-arity offering whose fit is settled at compile time.

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

The held items.

pub fn iter(&self) -> impl Iterator<Item = &T>

Reads the held items in order.

pub fn len(&self) -> usize

How many items are held.

pub fn is_empty(&self) -> bool

Whether nothing is held.

pub fn try_push(&mut self, item: T) -> Result<(), Overflow>

Appends one item where the resulting collection fits under this ceiling.

Errors

Returns Overflow without changing the list where the appended item would exceed N.

Trait Implementations

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

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

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

Formats the value using the given formatter.

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

impl<T: Hash, const N: usize> Hash for Bounded<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: PartialEq, const N: usize> PartialEq for Bounded<T, N>

fn eq(&self, other: &Bounded<T, N>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<T: PartialEq, const N: usize> StructuralPartialEq for Bounded<T, N>