Struct KindSet 

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

Match a token against one or more Kinds.

Each Kind represents the token “type”. KindSet is a bitmask of all possible Kinds. This is useful for efficiently comparing a token to see if it matches N token Kinds.

Example

use css_lexer::*;
let mut lexer = Lexer::new(&EmptyAtomSet::ATOMS, "width: 1px");
// The first token is either an AtKeyword, Ident or Function:
assert_eq!(lexer.advance(), KindSet::new(&[Kind::AtKeyword, Kind::Ident, Kind::Function]));

Implementations

impl KindSet

pub const NONE: KindSet

A KindSet that matches no Kinds.

pub const TRIVIA: KindSet

A KindSet that matches all trivia; Kind::Whitespace and Kind::Comment.

pub const WHITESPACE: KindSet

A KindSet that matches just Whitespace. This is the same as Kind::Whitespace but can be useful to apply to functions that expect a KindSet rather than Kind.

pub const COMMENTS: KindSet

A KindSet that matches just Whitespace. This is the same as Kind::Comment but can be useful to apply to functions that expect a KindSet rather than Kind.

pub const RIGHT_CURLY_OR_SEMICOLON: KindSet

A KindSet that matches either Kind::RightCurly or Kind::Semicolon. This is useful for matching stop-tokens, for example checking the end of a declaration.

pub const LEFT_CURLY_OR_SEMICOLON: KindSet

A KindSet that matches either Kind::LeftCurly or Kind::Semicolon. This is useful for matching stop-tokens, for example checking the end of an at-rule prelude.

pub const LEFT_CURLY_RIGHT_PAREN_OR_SEMICOLON: KindSet

A KindSet that matches either Kind::LeftCurly or Kind::RightParen or Kind::Semicolon. This is useful for matching stop-tokens, for example checking the end of a function.

pub const LEFT_CURLY_RIGHT_PAREN_COMMA_OR_SEMICOLON: KindSet

A KindSet that matches either Kind::LeftCurly or Kind::RightParen or Kind::Comma or Kind::Semicolon. This is useful for matching stop-tokens, for example checking the end of a function or Selector.

pub const IDENT_LIKE: KindSet

A KindSet that matches either Kind::Ident, Kind::AtKeyword, Kind::Function, Kind::Hash.

pub const DELIM_LIKE: KindSet

A KindSet that matches any single character token, such as Kind::Delim or Kind::Colon - Kind::RightCurly.

pub const ANY: KindSet

A KindSet that matches any token.

pub const fn new(kinds: &[Kind]) -> KindSet

Creates a new KindSet with the combination of all given Kinds.

This function is marked const to allow creation of const KindSets.

pub const fn add(&self, kind: Kind) -> KindSet

Returns a new KindSet with the addition of the supplied Kind.

This function is marked const to allow creation of const KindSets.

pub fn contains(&self, kind: Kind) -> bool

Check if a KindSet contains the subpplied Kind.

Trait Implementations

impl Clone for KindSet

fn clone(&self) -> KindSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for KindSet

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

Formats the value using the given formatter.

impl Default for KindSet

fn default() -> KindSet

Returns the “default value” for a type.

impl From<Cursor> for KindSet

fn from(cursor: Cursor) -> KindSet

Converts to this type from the input type.

impl From<SourceCursor<'_>> for KindSet

fn from(cursor: SourceCursor<'_>) -> KindSet

Converts to this type from the input type.

impl From<Token> for KindSet

fn from(token: Token) -> KindSet

Converts to this type from the input type.

impl Hash for KindSet

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

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 Ord for KindSet

fn cmp(&self, other: &KindSet) -> 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 PartialEq<KindSet> for &Cursor

fn eq(&self, other: &KindSet) -> 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 PartialEq<KindSet> for Cursor

fn eq(&self, other: &KindSet) -> 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 PartialEq<KindSet> for Kind

fn eq(&self, other: &KindSet) -> 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 PartialEq<KindSet> for SourceCursor<'_>

fn eq(&self, other: &KindSet) -> 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 PartialEq<KindSet> for Token

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

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

fn partial_cmp(&self, other: &KindSet) -> 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 Copy for KindSet

impl Eq for KindSet

impl StructuralPartialEq for KindSet