X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FTree.java;h=d2bfc4bbc46a6bf379bd79633fff7746bb1bc834;hp=1b9ddfa668f8bcee675892b4c216cc7408456fac;hb=d86c2344f6f5b958d56e2aa55e84af2dc76ab487;hpb=f1dba2b015c3da04fc2fab45604da2e6c9ae0a1d diff --git a/src/edu/berkeley/sbp/Tree.java b/src/edu/berkeley/sbp/Tree.java index 1b9ddfa..d2bfc4b 100644 --- a/src/edu/berkeley/sbp/Tree.java +++ b/src/edu/berkeley/sbp/Tree.java @@ -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,19 @@ 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) { + Tree(Input.Region loc, T head, Tree[] children, boolean lift) { this.location = loc; this.head = head; this.lift = lift && children != null && children.length > 0;