Struct RuleList 

pub struct RuleList<'a, R> {
    pub open_curly: LeftCurly,
    pub rules: Vec<'a, R>,
    pub close_curly: Option<RightCurly>,
}

A struct representing an AST node block that only accepts child “Rules”. This is defined as:

<rule-list>
 │├─ "{" ─╭─ <R> ─╮─╮─ "}" ─╭──┤│
          ╰───────╯ ╰───────╯

This is an implementation of <at-rule-list> or <qualified-rule-list>.

It simply parses the open { and iterates collecing <R>s until the closing }.

Every item in the list must implement the Parse, ToCursors and ToSpan traits.

Fields

open_curly: LeftCurly

rules: Vec<'a, R>

close_curly: Option<RightCurly>

Trait Implementations

impl<'a, R: Clone> Clone for RuleList<'a, R>

fn clone(&self) -> RuleList<'a, R>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, R: Debug> Debug for RuleList<'a, R>

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

Formats the value using the given formatter.

impl<'a, R: Hash> Hash for RuleList<'a, R>

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, R: Ord> Ord for RuleList<'a, R>

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

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

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

impl<'a, R: PartialEq> PartialEq for RuleList<'a, R>

fn eq(&self, other: &RuleList<'a, R>) -> 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, R: PartialOrd> PartialOrd for RuleList<'a, R>

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

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

const PEEK_KINDSET: KindSet = KindSet::ANY

impl<'a, R: ToCursors> ToCursors for RuleList<'a, R>

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

impl<'a, R: ToSpan> ToSpan for RuleList<'a, R>

fn to_span(&self) -> Span

impl<'a, R: Eq> Eq for RuleList<'a, R>

impl<'a, R> StructuralPartialEq for RuleList<'a, R>