Struct NonEmpty 

pub struct NonEmpty<T>(pub T);

A non-empty collection wrapper.

Wraps any collection type that derefs to a slice (Deref<Target = [_]>) and validates at parse time that the collection contains at least one item.

Works with bumpalo::collections::Vec and any other slice-backed type.

Tuple Fields

0: T

Implementations

impl<T> NonEmpty<T>

pub fn inner(&self) -> &T

pub fn into_inner(self) -> T

Trait Implementations

impl<T: Clone> Clone for NonEmpty<T>

fn clone(&self) -> NonEmpty<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for NonEmpty<T>

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

Formats the value using the given formatter.

impl<T: Eq> Eq for NonEmpty<T>

impl<T: Hash> Hash for NonEmpty<T>

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: NodeWithMetadata<CssMetadata>> NodeWithMetadata<CssMetadata> for NonEmpty<T>

fn self_metadata(&self) -> CssMetadata

Returns the metadata contributed by this node itself, not including children. Most nodes don’t contribute metadata, so can simply return M::default(). Nodes like StyleRule or AtRules should return their own node kind flags here.

fn metadata(&self) -> CssMetadata

Returns the complete aggregated metadata for this node (self + children). Default implementation merges children’s metadata with self_metadata().

impl<T: Ord> Ord for NonEmpty<T>

fn cmp(&self, other: &NonEmpty<T>) -> 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<'a, T, Item> Parse<'a> for NonEmpty<T>

where T: Peek<'a> + Parse<'a> + Deref<Target = [Item]>,

fn parse<I>(p: &mut Parser<'a, I>) -> Result<Self>

where I: Iterator<Item = Cursor> + Clone,

fn try_parse<I>(p: &mut Parser<'a, I>) -> Result<Self, Diagnostic>

where I: Iterator<Item = Cursor> + Clone,

impl<T: PartialEq> PartialEq for NonEmpty<T>

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

fn partial_cmp(&self, other: &NonEmpty<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<'a, T> Peek<'a> for NonEmpty<T>

where T: Peek<'a>,

fn peek<I>(p: &Parser<'a, I>, c: Cursor) -> bool

where I: Iterator<Item = Cursor> + Clone,

const PEEK_KINDSET: KindSet = KindSet::ANY

impl<T> SemanticEq for NonEmpty<T>

where T: SemanticEq,

fn semantic_eq(&self, other: &Self) -> bool

Returns true if self and other are semantically equal.

impl<T> StructuralPartialEq for NonEmpty<T>

impl<T> ToCursors for NonEmpty<T>

where T: ToCursors,

fn to_cursors(&self, s: &mut impl CursorSink)

impl<T> ToSpan for NonEmpty<T>

where T: ToSpan,

fn to_span(&self) -> Span