Enum TreeRule 

pub enum TreeRule<'a> {
    Rule(Rule<'a>),
    Ruleset(TreeRuleset<'a>),
}

A tree node which expresses a recursive T over Ruleset<T>. Using this struct in place of Rule allows nested CSS selectors that can be later flattened.

Variants

Rule(Rule<'a>)

Ruleset(TreeRuleset<'a>)

Trait Implementations

impl<'a> Clone for TreeRule<'a>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for TreeRule<'a>

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

Formats the value using the given formatter.

impl<'a> Hash for TreeRule<'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> PartialEq for TreeRule<'a>

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

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

fn as_css_string(&self) -> String

Render self as a valid CSS String, minified (with non-interpretation-impacting whitespace removed).

impl<'a> Eq for TreeRule<'a>

impl<'a> StructuralPartialEq for TreeRule<'a>