Struct SymbolSet 

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

Compact sorted set of symbols, used by CondensedTa to group rules.

Internally a sorted, deduplicated inline vector. Lookup is O(log n) via binary search. Most label sets are tiny (1–4 symbols).

Implementations

impl SymbolSet

pub fn new() -> Self

Create an empty set.

pub fn insert(&mut self, s: Symbol)

Insert a symbol, maintaining sorted and deduplicated order.

pub fn contains(&self, s: Symbol) -> bool

Return whether the set contains s.

pub fn iter(&self) -> impl Iterator<Item = Symbol> + '_

Iterate over symbols in sorted order.

pub fn len(&self) -> usize

Return the number of symbols.

pub fn is_empty(&self) -> bool

Return whether the set is empty.

pub fn clear(&mut self)

Remove all symbols from the set.

Trait Implementations

impl Clone for SymbolSet

fn clone(&self) -> SymbolSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SymbolSet

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

Formats the value using the given formatter.

impl Default for SymbolSet

fn default() -> SymbolSet

Returns the “default value” for a type.

impl Eq for SymbolSet

impl FromIterator<Symbol> for SymbolSet

fn from_iter<I: IntoIterator<Item = Symbol>>(iter: I) -> Self

Creates a value from an iterator.

impl Hash for SymbolSet

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 PartialEq for SymbolSet

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