Struct regex_automata::util::sparse_set::SparseSets

pub(crate) struct SparseSets {
    pub(crate) set1: SparseSet,
    pub(crate) set2: SparseSet,
}

A pairse of sparse sets.

This is useful when one needs to compute NFA epsilon closures from a previous set of states derived from an epsilon closure. One set can be the starting states where as the other set can be the destination states after following the transitions for a particular byte of input.

There is no significance to ‘set1’ or ‘set2’. They are both sparse sets of the same size.

The members of this struct are exposed so that callers may borrow ‘set1’ and ‘set2’ individually without being force to borrow both at the same time.

Fields

set1: SparseSet

set2: SparseSet

Implementations

impl SparseSets

pub(crate) fn new(capacity: usize) -> SparseSets

Create a new pair of sparse sets where each set has the given capacity.

This panics if the capacity given is bigger than StateID::LIMIT.

pub(crate) fn resize(&mut self, new_capacity: usize)

Resizes these sparse sets to have the new capacity given.

The sets are automatically cleared.

This panics if the capacity given is bigger than StateID::LIMIT.

pub(crate) fn clear(&mut self)

Clear both sparse sets.

pub(crate) fn swap(&mut self)

Swap set1 with set2.

pub(crate) fn memory_usage(&self) -> usize

Returns the memory usage, in bytes, used by this pair of sparse sets.

Trait Implementations

impl Clone for SparseSets

fn clone(&self) -> SparseSets

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SparseSets

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

Formats the value using the given formatter.