Struct SymbolBitSet 

pub struct SymbolBitSet { /* private fields */ }

A set of symbols in the form of a bit vector.

Implementations

impl SymbolBitSet

pub fn new() -> SymbolBitSet

Constructs an empty SymbolBitSet.

pub fn from_elem(grammar: &Cfg, elem: bool) -> SymbolBitSet

Constructs a SymbolBitSet.

pub fn reset(&mut self, symbol_source: &SymbolSource)

Resets the set to false repeated as many times as there are symbols in the given source.

In other words, none of the symbols are included, but we have space to mark them as included.

pub fn set_all(&mut self, symbol_source: &SymbolSource)

Resets the set to true repeated as many times as there are symbols in the given source.

In other words, all of the symbols are included in the set.

pub fn used(&mut self, grammar: &Cfg)

Makes this set include only symbols which appear anywhere in the grammar.

pub fn unused(&mut self, grammar: &Cfg)

Makes this set include only symbols which do not appear anywhere in the grammar.

pub fn negate(&mut self)

Included symbols will be excluded, and symbols that do not appear in the set will be included instead.

pub fn terminal(&mut self, grammar: &Cfg)

Gathers information about whether symbols are terminal or nonterminal. Constructs a set of terminal symbols.

Constructs a data structure in O(n) time.

pub fn nulling(&mut self, grammar: &Cfg)

Gathers information about whether symbols are nulling. Includes the set of nulling symbols.

Constructs a data structure in O(n) time.

pub fn productive(&mut self, grammar: &Cfg)

Gathers information about whether symbols are terminal or nonterminal. Includes the set of nonterminal symbols.

Constructs a data structure in O(n) time.

pub fn subtract_productive(&mut self, grammar: &Cfg)

Excludes all nonterminals from the given grammar from the set.

pub fn set(&mut self, index: Symbol, elem: bool)

Sets the membership for the given symbol.

pub fn bit_vec(&self) -> &BitVec

Allows access to the underlying BitVec.

pub fn into_bit_vec(self) -> BitVec

Converts into a bit vector.

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

Iterates over symbols in the set.

pub fn union(&mut self, other: &SymbolBitSet)

Includes all symbols that are included in the other set.

pub fn space(&self) -> usize

Returns the number of symbols we have space for.

pub fn all(&self) -> bool

Determines whether this set contains all symbols we have space for.

pub fn is_empty(&self) -> bool

Not to be confused with fn is_empty.

pub fn reserve(&mut self, len: usize)

Reserves space for additional symbols.

Trait Implementations

impl Clone for SymbolBitSet

fn clone(&self) -> SymbolBitSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SymbolBitSet

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

Formats the value using the given formatter.

impl Default for SymbolBitSet

fn default() -> SymbolBitSet

Returns the “default value” for a type.

impl Deserialize for SymbolBitSet

fn begin(__out: &mut Option<SymbolBitSet>) -> &mut dyn Visitor

The only correct implementation of this method is:

impl Index<Symbol> for SymbolBitSet

type Output = bool

The returned type after indexing.

fn index(&self, index: Symbol) -> &<SymbolBitSet as Index<Symbol>>::Output

Performs the indexing (container[index]) operation.

impl Serialize for SymbolBitSet

fn begin(&self) -> Fragment<'_>