Struct CounterName 

pub struct CounterName(/* private fields */);

https://drafts.csswg.org/css-lists-3/#typedef-counter-name

<counter-name> = <custom-ident>

Trait Implementations

impl Clone for CounterName

fn clone(&self) -> CounterName

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for CounterName

impl Debug for CounterName

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

Formats the value using the given formatter.

impl Eq for CounterName

impl From<CounterName> for Cursor

fn from(value: CounterName) -> Cursor

Converts to this type from the input type.

impl From<CounterName> for Token

fn from(value: CounterName) -> Token

Converts to this type from the input type.

impl Hash for CounterName

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 NodeWithMetadata<CssMetadata> for CounterName

fn self_metadata(&self) -> CssMetadata

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.

fn metadata(&self) -> CssMetadata

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

impl Ord for CounterName

fn cmp(&self, other: &CounterName) -> 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 CounterName

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

fn eq(&self, other: &CounterName) -> 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 PartialOrd for CounterName

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

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

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

const PEEK_KINDSET: KindSet = KindSet::ANY

impl SemanticEq for CounterName

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

Returns true if self and other are semantically equal.

impl StructuralPartialEq for CounterName

impl ToCursors for CounterName

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

impl ToSpan for CounterName

fn to_span(&self) -> Span