successors.remove(succ);
check();
}
- public void removeResult(ResultNode result) {
+ public void removePred(ResultNode result) {
predecessors.remove(result);
check();
}
public void addSucc(ResultNode succ) {
successors.add(succ);
}
- public void addResult(Forest f, Pos reduction, StateNode pred) {
+ public void addPred(Forest f, Pos reduction, StateNode pred) {
for(ResultNode r : predecessors)
if (r.predecessorsContains(pred)) {
r.merge(f);