|
|||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Stack | |
---|---|
org.jikesrvm.compilers.opt.controlflow | |
org.jikesrvm.compilers.opt.util |
Uses of Stack in org.jikesrvm.compilers.opt.controlflow |
---|
Subclasses of Stack in org.jikesrvm.compilers.opt.controlflow | |
---|---|
class |
LTDominators
Calculate dominators using Langauer and Tarjan's fastest algorithm. |
Uses of Stack in org.jikesrvm.compilers.opt.util |
---|
Subclasses of Stack in org.jikesrvm.compilers.opt.util | |
---|---|
class |
DFSenumerateByFinish
This class implements depth-first search over a Graph, return an enumeration of the nodes of the graph in order of increasing finishing time. |
class |
FilteredDFSenumerateByFinish
|
class |
ReverseDFSenumerateByFinish
This class generates an enumeration of nodes of a graph, in order of increasing finishing time in a reverse Depth First Search, i.e. a search traversing nodes from target to source. |
(package private) class |
ReverseFilteredDFSenumerateByFinish
|
class |
TopSort
Depth First Spanning Tree, builds topological sort of a graph consisting of SortedGraphNode. |
Fields in org.jikesrvm.compilers.opt.util declared as Stack | |
---|---|
private Stack<GraphNode> |
DepthFirstEnumerator.stack
|
Methods in org.jikesrvm.compilers.opt.util that return Stack | |
---|---|
Stack<T> |
Stack.copy()
|
Stack<T> |
Stack.shallowCopy()
|
Methods in org.jikesrvm.compilers.opt.util with parameters of type Stack | |
---|---|
boolean |
Stack.compare(Stack<T> s2)
|
|
|||||||||||
PREV NEXT | FRAMES NO FRAMES |