Struct StateSet 

pub struct StateSet<S>(/* private fields */);

Small sorted set of states used by nondeterministic runs.

The set keeps states deduplicated. It stores a few states inline, which is efficient for the common case where each node has only a small number of possible states.

Implementations

impl<S: Clone + Ord> StateSet<S>

pub fn new() -> Self

Create an empty state set.

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

Insert a state, preserving sorted and deduplicated order.

pub fn iter(&self) -> impl Iterator<Item = &S>

Iterate over states in sorted order.

pub fn as_slice(&self) -> &[S]

Return the states as a slice.

pub fn is_empty(&self) -> bool

Return whether this set contains no states.

pub fn len(&self) -> usize

Return the number of states in the set.

Trait Implementations

impl<S: Clone> Clone for StateSet<S>

fn clone(&self) -> StateSet<S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<S: Debug> Debug for StateSet<S>

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

Formats the value using the given formatter.

impl<S> Default for StateSet<S>

fn default() -> Self

Returns the “default value” for a type.

impl<S: Eq> Eq for StateSet<S>

impl<S: PartialEq> PartialEq for StateSet<S>

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