Dominators (com.ibm.wala.util 1.5.8 API)

Nested Classes
Modifier and Type	Class and Description
`protected class`	`Dominators.DominatorInfo` LOOK-ASIDE TABLE FOR PER-NODE STATE AND ITS ACCESSORS

Fields
Modifier and Type	Field and Description
`protected Graph<T>`	`G` a convenient place to locate the graph to avoid passing it internally
`protected int`	`reachableNodeCount` the number of nodes reachable from the root
`protected T`	`root` the root node from which to build dominators

Constructors
Constructor and Description
`Dominators(Graph<T> G, T root)`

All Methods Static Methods Instance Methods Abstract Methods Concrete Methods
Modifier and Type	Method and Description
`protected void`	`analyze()` analyze dominators
`Iterator<T>`	`dominators(T node)` return an Iterator over all nodes that dominate node
`Graph<T>`	`dominatorTree()` return the dominator tree, which has an edge from n to n' if n dominates n'
`T`	`getIdom(T node)` return the immediate dominator of node
`protected abstract Dominators.DominatorInfo`	`getInfo(T node)`
`boolean`	`isDominatedBy(T node, T master)` is node dominated by master?
`static <T> Dominators<T>`	`make(Graph<T> G, T root)`
`String`	`toString()`

public static <T> Dominators<T> make(Graph<T> G,
                                     T root)

public boolean isDominatedBy(T node,
                             T master)

is node dominated by master?

dominators
```
public Iterator<T> dominators(T node)
```
return an Iterator over all nodes that dominate node

dominatorTree
```
public Graph<T> dominatorTree()
```
return the dominator tree, which has an edge from n to n' if n dominates n'

protected abstract Dominators.DominatorInfo getInfo(T node)

Class Dominators<T>