pub struct NonDetRun<S> {
pub states: Vec<StateSet<S>>,
pub root_states: StateSet<S>,
}Expand description
Side table produced by run_nondet.
Each node can have zero or more possible states. An empty set means the subtree rooted at that node is rejected.
Fields§
§states: Vec<StateSet<S>>State set assigned to each node, indexed by Tree::index.
root_states: StateSet<S>State set assigned to the root.
Trait Implementations§
impl<S: Eq> Eq for NonDetRun<S>
Source§impl<S: PartialEq> PartialEq for NonDetRun<S>
impl<S: PartialEq> PartialEq for NonDetRun<S>
impl<S: PartialEq> StructuralPartialEq for NonDetRun<S>
Auto Trait Implementations§
impl<S> Freeze for NonDetRun<S>where
S: Freeze,
impl<S> RefUnwindSafe for NonDetRun<S>where
S: RefUnwindSafe,
impl<S> Send for NonDetRun<S>where
S: Send,
impl<S> Sync for NonDetRun<S>where
S: Sync,
impl<S> Unpin for NonDetRun<S>where
S: Unpin,
impl<S> UnsafeUnpin for NonDetRun<S>where
S: UnsafeUnpin,
impl<S> UnwindSafe for NonDetRun<S>where
S: RefUnwindSafe + UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.