struct ReachableProcess {
variable: VariableId,
fwd: FwdProcess,
}
Expand description
(internal) Computes the set of vertices reachable from states that can perform var_post
.
When reachable set is computed, it automatically starts the extended component process.
Fields§
§variable: VariableId
§fwd: FwdProcess
Implementations§
source§impl ReachableProcess
impl ReachableProcess
pub fn new( var: VariableId, graph: &SymbolicAsyncGraph, universe: GraphColoredVertices, ) -> ReachableProcess
Trait Implementations§
source§impl Process for ReachableProcess
impl Process for ReachableProcess
source§fn step(
&mut self,
scheduler: &mut Scheduler,
graph: &SymbolicAsyncGraph,
) -> bool
fn step( &mut self, scheduler: &mut Scheduler, graph: &SymbolicAsyncGraph, ) -> bool
Perform one step in the process. This can perform multiple symbolic operations,
but should be fairly simple (i.e. does not need interrupting). Read more
source§fn discard_states(&mut self, set: &GraphColoredVertices)
fn discard_states(&mut self, set: &GraphColoredVertices)
Mark the given set of states as eliminated - i.e. they can be disregarded by this process.
Auto Trait Implementations§
impl Freeze for ReachableProcess
impl RefUnwindSafe for ReachableProcess
impl Send for ReachableProcess
impl Sync for ReachableProcess
impl Unpin for ReachableProcess
impl UnwindSafe for ReachableProcess
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