| Class | Description |
|---|---|
| FixedNodeProbabilityCache |
Compute probabilities for fixed nodes on the fly and cache them at
AbstractBeginNodes. |
| InferStamps | |
| MergeableState<T> | |
| PostOrderNodeIterator<T extends MergeableState<T>> |
A PostOrderNodeIterator iterates the fixed nodes of the graph in post order starting from a
specified fixed node.
|
| ReentrantBlockIterator | |
| ReentrantBlockIterator.BlockIteratorClosure<StateT> | |
| ReentrantBlockIterator.LoopInfo<StateT> | |
| ReentrantNodeIterator | |
| ReentrantNodeIterator.LoopInfo<StateT> | |
| ReentrantNodeIterator.NodeIteratorClosure<StateT> | |
| ScheduledNodeIterator |
Iterates over a list of nodes, which usually comes from
SchedulePhase.getBlockToNodesMap(). |
| ScopedPostOrderNodeIterator | |
| SinglePassNodeIterator<T extends MergeableState<T>> |
A SinglePassNodeIterator iterates the fixed nodes of the graph in post order starting from its
start node.
|
| SinglePassNodeIterator.PathStart<U> |
An item queued in
SinglePassNodeIterator.nodeQueue can be used to continue with the single-pass visit after
the previous path can't be followed anymore. |
| StatelessPostOrderNodeIterator |
This iterator implements a reverse post order iteration over the fixed nodes in the graph,
starting at the given fixed node.
|