Struct AttrList

pub struct AttrList<A> {
    pub elems: Vec<AList<A>>,
}

A list of ALists, i.e. a list of list of attributes. This (strange) indirection is induced by the grammar. This structure corresponds to the attr_list non-terminal of the grammar.

Notice methods flatten and flatten_ref to remove the indirection.

Fields

elems: Vec<AList<A>>

The list of ALists.

Implementations

impl<A> AttrList<A>

pub fn flatten(self) -> AList<A>

Flatten the nested ALists: returns a single AList that contains all attributes contained in the AttrList.

pub fn flatten_ref(&self) -> AList<&A>

Flatten the nested ALists: returns a single AList that contains all attributes contained in the AttrList.

Trait Implementations

impl<A: Clone> Clone for AttrList<A>

fn clone(&self) -> AttrList<A>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Debug> Debug for AttrList<A>

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

Formats the value using the given formatter.

impl<'a, A> From<&'a AttrList<A>> for AList<&'a A>

fn from(attr: &'a AttrList<A>) -> Self

Converts to this type from the input type.

impl<A> From<AttrList<A>> for AList<A>

fn from(attr: AttrList<A>) -> Self

Converts to this type from the input type.

impl<A> FromIterator<AList<A>> for AttrList<A>

fn from_iter<T>(iter: T) -> Self

where T: IntoIterator<Item = AList<A>>,

Creates a value from an iterator.

impl<A: Hash> Hash for AttrList<A>

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<'a, A> IntoIterator for &'a AttrList<A>

type Item = &'a AList<A>

The type of the elements being iterated over.

type IntoIter = Iter<'a, AList<A>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<A> IntoIterator for AttrList<A>

type Item = AList<A>

The type of the elements being iterated over.

type IntoIter = IntoIter<<AttrList<A> as IntoIterator>::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<A: Ord> Ord for AttrList<A>

fn cmp(&self, other: &AttrList<A>) -> 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: PartialEq> PartialEq for AttrList<A>

fn eq(&self, other: &AttrList<A>) -> 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<A: PartialOrd> PartialOrd for AttrList<A>

fn partial_cmp(&self, other: &AttrList<A>) -> 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, A> TryFrom<Pair<'a, Rule>> for AttrList<A>

where AList<A>: TryFrom<Pair<'a, Rule>, Error = ParseError<'a>>,

type Error = ParseError<'a>

The type returned in the event of a conversion error.

fn try_from(p: Pair<'a, Rule>) -> Result<Self, ParseError<'a>>

Performs the conversion.

impl<A: Eq> Eq for AttrList<A>

impl<A> StructuralPartialEq for AttrList<A>