X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FTree.java;fp=src%2Fedu%2Fberkeley%2Fsbp%2FTree.java;h=2f72029d28b7e7bee810f1b6e7f80c585e7ee558;hp=d2bfc4bbc46a6bf379bd79633fff7746bb1bc834;hb=9b7ce1d3e4ac84ecd2d0f5f461b42c40f38e4783;hpb=d86c2344f6f5b958d56e2aa55e84af2dc76ab487

diff --git a/src/edu/berkeley/sbp/Tree.java b/src/edu/berkeley/sbp/Tree.java
index d2bfc4b..2f72029 100644
--- a/src/edu/berkeley/sbp/Tree.java
+++ b/src/edu/berkeley/sbp/Tree.java
@@ -52,6 +52,8 @@ public class Tree<T>
 
     public Tree(Input.Region loc, T head)                     { this(loc, head, null); }
     public Tree(Input.Region loc, T head, Tree<T>[] children) { this(loc, head, children, false); }
+
+    /** package-private constructor, allows setting the "lift" bit */
     Tree(Input.Region loc, T head, Tree<T>[] children, boolean lift) {
         this.location = loc;
         this.head = head;
@@ -84,16 +86,11 @@ public class Tree<T>
         if (gv.hasNode(this)) return gv.createNode(this);
         GraphViz.Node n = gv.createNode(this);
         n.label = head()==null ? "" : head().toString();
-        //n.color = "red";
         for(Tree t : this) n.edge(t, null);
         return n;
     }
     public boolean isTransparent() { return false; }
     public boolean isHidden() { return false; }
 
-
-    // TreeFunctor /////////////////////////////////////////////////////////////////////////////
-
-    public static interface TreeFunctor<T,R> extends Functor<Iterable<Tree<T>>, R> { }
-    
+   
 }