refactor predecessor/successor into Node class

[sbp.git] / src / edu / berkeley / sbp / ResultNode.java

diff --git a/src/edu/berkeley/sbp/ResultNode.java b/src/edu/berkeley/sbp/ResultNode.java
index d61b06b..9b14882 100644 (file)
--- a/src/edu/berkeley/sbp/ResultNode.java
+++ b/src/edu/berkeley/sbp/ResultNode.java
@@ -6,13 +6,10 @@ import edu.berkeley.sbp.Sequence.Pos;
 import edu.berkeley.sbp.Sequence.Pos;
 import java.util.*;
 
 import edu.berkeley.sbp.Sequence.Pos;
 import java.util.*;
 

-final class ResultNode extends Node {
+final class ResultNode
+    extends Node<StateNode> {

 
     private Forest.Many f = new Forest.Many();
 
     private Forest.Many f = new Forest.Many();

-    //private HashSet<StateNode> predecessors = new HashSet<StateNode>();
-    //private HashSet<StateNode> successors = new HashSet<StateNode>();
-    private FastSet<StateNode> predecessors = new FastSet<StateNode>();
-    private FastSet<StateNode> successors = new FastSet<StateNode>();

     private boolean destroyed = false;
     private boolean primordeal;
     private int usedByNonDoomedNode = 0;
     private boolean destroyed = false;
     private boolean primordeal;
     private int usedByNonDoomedNode = 0;