X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FResultNode.java;h=e22bd45a41c07ea64b1f32e64c393481adec021e;hp=d61b06b7344a6e9e628dba0877283afcb18e6b01;hb=76ce41540f06ac1fbcb44332dd62f53e88c27cf1;hpb=053eb99c444844015cfdb486b03c55adb0a3cd7f diff --git a/src/edu/berkeley/sbp/ResultNode.java b/src/edu/berkeley/sbp/ResultNode.java index d61b06b..e22bd45 100644 --- a/src/edu/berkeley/sbp/ResultNode.java +++ b/src/edu/berkeley/sbp/ResultNode.java @@ -6,22 +6,16 @@ import edu.berkeley.sbp.Sequence.Pos; import edu.berkeley.sbp.Sequence.Pos; import java.util.*; -final class ResultNode extends Node { +final class ResultNode + extends Node { private Forest.Many f = new Forest.Many(); - //private HashSet predecessors = new HashSet(); - //private HashSet successors = new HashSet(); - private FastSet predecessors = new FastSet(); - private FastSet successors = new FastSet(); private boolean destroyed = false; private boolean primordeal; private int usedByNonDoomedNode = 0; private Pos reduction; private GSS.Phase predPhase; - public boolean predecessorsContains(StateNode n) { - return predecessors.contains(n); - } public Pos reduction() { return reduction; } public void merge(Forest newf) { this.f.merge(newf); @@ -33,11 +27,8 @@ final class ResultNode extends Node { */ } - public boolean noSuccessors() { return successors.size()==0; } - public GSS.Phase phase() { return predPhase; } public Forest getForest() { return f; } - public Iterable getPreds() { return predecessors; } public void addSucc(StateNode succ) { if (successors.contains(succ)) return; successors.add(succ); @@ -74,7 +65,7 @@ final class ResultNode extends Node { while(successors.size() > 0) for(StateNode succ : successors) { removeSucc(succ); - succ.removeResult(this); + succ.removePred(this); break; } successors = null;