Struct QualifiedRule 

pub struct QualifiedRule<'a, P, D, R>
where
    D: DeclarationValue<'a>,
{
    pub prelude: P,
    pub block: Block<'a, D, R>,
}

Fields

prelude: P

block: Block<'a, D, R>

Trait Implementations

impl<'a, P: Clone, D, R: Clone> Clone for QualifiedRule<'a, P, D, R>

where D: DeclarationValue<'a> + Clone,

fn clone(&self) -> QualifiedRule<'a, P, D, R>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, P: Debug, D, R: Debug> Debug for QualifiedRule<'a, P, D, R>

where D: DeclarationValue<'a> + Debug,

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

Formats the value using the given formatter.

impl<'a, P: Hash, D, R: Hash> Hash for QualifiedRule<'a, P, D, R>

where D: DeclarationValue<'a> + 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, P: Ord, D, R: Ord> Ord for QualifiedRule<'a, P, D, R>

where D: DeclarationValue<'a> + Ord,

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

where D: DeclarationValue<'a>, P: Parse<'a>, R: Parse<'a>,

A QualifiedRule represents a block with a prelude which may contain other rules. Examples of QualifiedRules are StyleRule, KeyframeRule (no s!).

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, P: PartialEq, D, R: PartialEq> PartialEq for QualifiedRule<'a, P, D, R>

where D: DeclarationValue<'a> + PartialEq,

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

where D: DeclarationValue<'a> + PartialOrd,

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

where P: Peek<'a>, D: DeclarationValue<'a>,

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

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

const PEEK_KINDSET: KindSet = KindSet::ANY

impl<'a, P, D, R> ToCursors for QualifiedRule<'a, P, D, R>

where D: DeclarationValue<'a> + ToCursors, P: ToCursors, R: ToCursors,

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

impl<'a, P, D, R> ToSpan for QualifiedRule<'a, P, D, R>

where D: DeclarationValue<'a> + ToSpan, P: ToSpan, R: ToSpan,

fn to_span(&self) -> Span

impl<'a, P: Eq, D, R: Eq> Eq for QualifiedRule<'a, P, D, R>

where D: DeclarationValue<'a> + Eq,

impl<'a, P, D, R> StructuralPartialEq for QualifiedRule<'a, P, D, R>

where D: DeclarationValue<'a>,