Enum NestedGroupRule 

pub enum NestedGroupRule<'a> {
    Container(ContainerRule<'a>),
    Layer(LayerRule<'a>),
    Media(MediaRule<'a>),
    Scope(ScopeRule),
    Supports(SupportsRule<'a>),
    UnknownAt(UnknownAtRule<'a>),
    Style(StyleRule<'a>),
    Unknown(UnknownQualifiedRule<'a>),
    BadDeclaration(BadDeclaration<'a>),
}

Variants

Container(ContainerRule<'a>)

Layer(LayerRule<'a>)

Media(MediaRule<'a>)

Scope(ScopeRule)

Supports(SupportsRule<'a>)

UnknownAt(UnknownAtRule<'a>)

Style(StyleRule<'a>)

Unknown(UnknownQualifiedRule<'a>)

BadDeclaration(BadDeclaration<'a>)

Trait Implementations

impl<'a> Clone for NestedGroupRule<'a>

fn clone(&self) -> NestedGroupRule<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for NestedGroupRule<'a>

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

Formats the value using the given formatter.

impl<'a> Hash for NestedGroupRule<'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> Ord for NestedGroupRule<'a>

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

fn parse<I>(p: &mut Parser<'a, I>) -> ParserResult<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<'a> PartialEq for NestedGroupRule<'a>

fn eq(&self, other: &NestedGroupRule<'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 for NestedGroupRule<'a>

fn partial_cmp(&self, other: &NestedGroupRule<'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> RuleVariants<'a> for NestedGroupRule<'a>

fn parse_at_rule<I>(p: &mut Parser<'a, I>, name: Cursor) -> ParserResult<Self>

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

Like crate::Parse::parse() but with the additional context of the name Cursor. This cursor is known to be an AtKeyword, therefore this should return a Self reflecting a AtRule. If the AtRule is not known, or otherwise fails then this should Err and RuleVariants::parse_unknown_at_rule() can be called.

fn parse_unknown_at_rule<I>( p: &mut Parser<'a, I>, _name: Cursor, ) -> ParserResult<Self>

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

Like crate::Parse::parse() but with the additional context of the name Cursor. This cursor is known to be an AtKeyword and that RuleVariants::parse_at_rule() failed. This should therefore return a Self that represents an Unknwon AtRule, or otherwise Err.

fn parse_qualified_rule<I>( p: &mut Parser<'a, I>, _name: Cursor, ) -> ParserResult<Self>

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

Like crate::Parse::parse() but with the additional context that the next cursor is not an AtKeyword, therefore this can attempt to parse a Qualified Rule. If the rule fails to parse, then RuleVariants::parse_unknown_qualified_rule() will be called.

fn parse_unknown_qualified_rule<I>( p: &mut Parser<'a, I>, _name: Cursor, ) -> ParserResult<Self>

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

Like crate::Parse::parse() but with the additional context that the next cursor is not an AtKeyword, and that RuleVariants::parse_qualified_rule() has failed. Therefore this should attempt to parse an Unknown Qualified Rule, or Err.

fn bad_declaration(b: BadDeclaration<'a>) -> Option<Self>

If all of the parse steps have failed, including parsing the Unknown Qualified Rule, we may want to consume a bad declaration (especially if the parser is in a nested context). This is done automatically on failing to parse an Unknown Qualified Rule, and this method is given the BadDeclaration.

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

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

impl<'a> ToCursors for NestedGroupRule<'a>

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

impl<'a> ToSpan for NestedGroupRule<'a>

fn to_span(&self) -> Span

impl<'a> Eq for NestedGroupRule<'a>

impl<'a> StructuralPartialEq for NestedGroupRule<'a>