N - The type of nodes in the interprocedural control-flow graph. Typically Unit.D - The type of data-flow facts to be computed by the tabulation problem.public class PathEdge<N,D> extends Object
InterproceduralCFG.
Hence, we don't store it.| Modifier and Type | Field and Description |
|---|---|
protected D |
dSource |
protected D |
dTarget |
protected int |
hashCode |
protected N |
target |
| Constructor and Description |
|---|
PathEdge(D dSource,
N target,
D dTarget) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
equals(Object obj) |
D |
factAtSource() |
D |
factAtTarget() |
N |
getTarget() |
int |
hashCode() |
String |
toString() |
Copyright © 2021 Secure Software Engineering Group - University of Paderborn. All rights reserved.