Struct UnknownRuleBlock 

pub struct UnknownRuleBlock<'a, D = ComponentValues<'a>, M = ()> {
    pub values: ComponentValues<'a>,
    /* private fields */
}

Wrapper type for using ComponentValues as a rule type parameter in unknown rules. This implements RuleVariants to allow ComponentValues to be used as the block type for unknown qualified rules, where the rule structure is not recognized.

Fields

values: ComponentValues<'a>

Trait Implementations

impl<'a, D: Clone, M: Clone> Clone for UnknownRuleBlock<'a, D, M>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, D: Debug, M: Debug> Debug for UnknownRuleBlock<'a, D, M>

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

Formats the value using the given formatter.

impl<'a, D: Hash, M: Hash> Hash for UnknownRuleBlock<'a, D, M>

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, M: NodeMetadata> NodeWithMetadata<M> for UnknownRuleBlock<'a, D, M>

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: Ord, M: Ord> Ord for UnknownRuleBlock<'a, D, M>

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

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: PartialEq, M: PartialEq> PartialEq for UnknownRuleBlock<'a, D, M>

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

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

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

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

const PEEK_KINDSET: KindSet = KindSet::ANY

impl<'a, D, M> RuleVariants<'a> for UnknownRuleBlock<'a, D, M>

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

type DeclarationValue = D

The declaration value type used when converting declaration groups to rules.

type Metadata = M

The metadata type used when converting declaration groups to rules.

fn is_unknown(&self) -> bool

Determines if the parsed Self was parsed as an unknown rule (UnknownAtRule or UnknownQualifiedRule).

fn parse_at_rule<I>(p: &mut Parser<'a, I>, _name: Cursor) -> Result<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, ) -> Result<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 Unknown AtRule, or otherwise Err.

fn parse_qualified_rule<I>(p: &mut Parser<'a, I>, _name: Cursor) -> Result<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, ) -> Result<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(_: 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 from_declaration_group( _group: DeclarationGroup<'a, Self::DeclarationValue, Self::Metadata>, ) -> Option<Self>

Creates a rule variant from a group of declarations.

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

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

impl<'a, D, M> SemanticEq for UnknownRuleBlock<'a, D, M>

fn semantic_eq(&self, other: &Self) -> bool

Returns true if self and other are semantically equal.

impl<'a, D, M> Serialize for UnknownRuleBlock<'a, D, M>

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<'a, D, M> ToCursors for UnknownRuleBlock<'a, D, M>

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

impl<'a, D, M> ToSpan for UnknownRuleBlock<'a, D, M>

fn to_span(&self) -> Span

impl<'a, D: Eq, M: Eq> Eq for UnknownRuleBlock<'a, D, M>

impl<'a, D, M> StructuralPartialEq for UnknownRuleBlock<'a, D, M>