public class LocalPathEdges extends Object
Constructor and Description |
---|
LocalPathEdges(boolean fastMerge) |
Modifier and Type | Method and Description |
---|---|
void |
addPathEdge(int i,
int n,
int j)
Record that in this procedure we've discovered a same-level realizable path from (s_p,d_i) to (n,d_j)
|
boolean |
contains(int i,
int n,
int j) |
IntSet |
getInverse(int n,
int d2)
N.B: If we're using the ZERO_PATH_SHORT_CIRCUIT, then we may have
|
IntSet |
getReachable(int n)
TODO: optimize this based on altPaths
|
IntSet |
getReachable(int n,
int d1) |
IntSet |
getReachedNodeNumbers()
TODO: optimize this
|
public LocalPathEdges(boolean fastMerge)
fastMerge
- if true, the representation uses extra space in order to support faster merge operationspublic void addPathEdge(int i, int n, int j)
i
- n
- local block number of the basic block nj
- public IntSet getInverse(int n, int d2)
n
- local block number of a basic block nd2
- public boolean contains(int i, int n, int j)
i
- n
- local block number of a basic block nj
- public IntSet getReachable(int n, int d1)
n
- public IntSet getReachable(int n)
n
- the local block number of a nodepublic IntSet getReachedNodeNumbers()