X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FTree.java;h=a6cbd3a01a76b73af94ca6f8d10e51a9457c5ba3;hb=d28917b3c84c429e8fd6587717df9e90a894b18f;hp=1b9ddfa668f8bcee675892b4c216cc7408456fac;hpb=c8d1c3a25e2bfa9645c4b91d3dde9c4857f636f2;p=sbp.git
diff --git a/src/edu/berkeley/sbp/Tree.java b/src/edu/berkeley/sbp/Tree.java
index 1b9ddfa..a6cbd3a 100644
--- a/src/edu/berkeley/sbp/Tree.java
+++ b/src/edu/berkeley/sbp/Tree.java
@@ -6,7 +6,7 @@ import java.io.*;
import java.util.*;
import java.lang.reflect.*;
-/** a tree (or node in a tree); see jargon.txt for details */
+/** a tree (or node in a tree); see jargon.txt for details */
public class Tree
extends PrintableTree>
implements Iterable>,
@@ -17,16 +17,22 @@ public class Tree
private final Tree[] children;
private final boolean lift;
+ /** the element at the head of the tree */
public T head() { return head; }
private Tree lifted() { return children[children.length-1]; }
+ /** the number of children the tree has */
public int numChildren() {
return lift
? (children.length-1)+lifted().numChildren()
: children.length;
}
+
+ /** the tree's children */
public Iterable> children() { return this; }
+
+ /** the tree's children */
public Iterator> iterator() {
return lift
? new ConcatenateIterator(new ArrayIterator(children, 0, children.length-1),
@@ -34,17 +40,21 @@ public class Tree
: new ArrayIterator(children);
}
+ /** get the ith child */
public Tree child(int i) {
return lift && i >= children.length-1
? children[children.length-1].child(i-(children.length-1))
: children[i];
}
+ /** get the input region that this tree was parsed from */
public Input.Region getRegion() { return location; }
public Tree(Input.Region loc, T head) { this(loc, head, null); }
public Tree(Input.Region loc, T head, Tree[] children) { this(loc, head, children, false); }
- public Tree(Input.Region loc, T head, Tree[] children, boolean lift) {
+
+ /** package-private constructor, allows setting the "lift" bit */
+ Tree(Input.Region loc, T head, Tree[] children, boolean lift) {
this.location = loc;
this.head = head;
this.lift = lift && children != null && children.length > 0;
@@ -76,16 +86,10 @@ public class Tree
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 extends Functor>, R> { }
-
}