Struct DeclarationRuleList 

pub struct DeclarationRuleList<'a, D, R, M>
where
    D: DeclarationValue<'a, M>,
    R: NodeWithMetadata<M>,
    M: NodeMetadata,
{
    pub open_curly: LeftCurly,
    pub declarations: Vec<'a, Declaration<'a, D, M>>,
    pub at_rules: Vec<'a, R>,
    pub close_curly: Option<RightCurly>,
    /* private fields */
}

A generic struct for AST nodes representing a rule’s block that is only capable of having child declarations or at-rules. Qualified Rules are not allowed. This is defined as:

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

<D> must implement the Declaration trait.

<R> should be an At-Rule. <R> is only parsed if an AtKeyword can be peeked.

It is an implementation of “declaration-rule-list”. It includes an error tolerance in that the ending } token can be omitted, if at the end of the file.

Fields

open_curly: LeftCurly

declarations: Vec<'a, Declaration<'a, D, M>>

at_rules: Vec<'a, R>

close_curly: Option<RightCurly>

Trait Implementations

impl<'a, D, R, M> Clone for DeclarationRuleList<'a, D, R, M>

where D: DeclarationValue<'a, M> + Clone, R: NodeWithMetadata<M> + Clone, M: NodeMetadata + Clone,

fn clone(&self) -> DeclarationRuleList<'a, D, R, M>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, D, R, M> Debug for DeclarationRuleList<'a, D, R, M>

where D: DeclarationValue<'a, M> + Debug, R: NodeWithMetadata<M> + Debug, M: NodeMetadata + Debug,

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

Formats the value using the given formatter.

impl<'a, D, R, M> Hash for DeclarationRuleList<'a, D, R, M>

where D: DeclarationValue<'a, M> + Hash, R: NodeWithMetadata<M> + Hash, M: NodeMetadata + Hash,

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, D, R, M> NodeWithMetadata<M> for DeclarationRuleList<'a, D, R, M>

where D: DeclarationValue<'a, M>, R: NodeWithMetadata<M>, M: NodeMetadata,

fn metadata(&self) -> M

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

fn self_metadata(&self) -> M

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.

impl<'a, D, R, M> Ord for DeclarationRuleList<'a, D, R, M>

where D: DeclarationValue<'a, M> + Ord, R: NodeWithMetadata<M> + Ord, M: NodeMetadata + Ord,

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

where D: DeclarationValue<'a, M>, R: NodeWithMetadata<M> + Parse<'a>, M: NodeMetadata, Declaration<'a, D, M>: Parse<'a>,

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

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

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

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

impl<'a, D, R, M> PartialEq for DeclarationRuleList<'a, D, R, M>

where D: DeclarationValue<'a, M> + PartialEq, R: NodeWithMetadata<M> + PartialEq, M: NodeMetadata + PartialEq,

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

where D: DeclarationValue<'a, M> + PartialOrd, R: NodeWithMetadata<M> + PartialOrd, M: NodeMetadata + PartialOrd,

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

where D: DeclarationValue<'a, M>, R: NodeWithMetadata<M>, M: NodeMetadata,

const PEEK_KINDSET: KindSet

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

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

impl<'a, D, R, M> ToCursors for DeclarationRuleList<'a, D, R, M>

where D: DeclarationValue<'a, M> + ToCursors, R: NodeWithMetadata<M> + ToCursors, M: NodeMetadata,

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

impl<'a, D, R, M> ToSpan for DeclarationRuleList<'a, D, R, M>

where D: DeclarationValue<'a, M> + ToSpan, R: NodeWithMetadata<M> + ToSpan, M: NodeMetadata,

fn to_span(&self) -> Span

impl<'a, D, R, M> Eq for DeclarationRuleList<'a, D, R, M>

where D: DeclarationValue<'a, M> + Eq, R: NodeWithMetadata<M> + Eq, M: NodeMetadata + Eq,

impl<'a, D, R, M> StructuralPartialEq for DeclarationRuleList<'a, D, R, M>

where D: DeclarationValue<'a, M>, R: NodeWithMetadata<M>, M: NodeMetadata,