-/** a tree (or node in a tree); see jargon.txt for details */
-public class Tree<T>
- extends PrintableTree<Tree<T>>
- implements Iterable<Tree<T>>,
- GraphViz.ToGraphViz {
-
- final T head;
- Tree<T>[] children;
- Object[] labels;
- final Input.Location location;
-
- public T head() { return head; }
- public int numChildren() { return children.length; }
- public Iterable<Tree<T>> children() { return new ArrayIterator(children); }
- public Iterator<Tree<T>> iterator() { return new ArrayIterator(children); }
- public Tree<T> child(int i) { return children[i]; }
- public Object label(int i) { return labels[i]; }
-
- public Input.Location getLocation() { return location; }
-
- public Tree(Input.Location loc, T head) { this(loc, head, null); }
- public Tree(Input.Location loc, T head, Tree<T>[] children) { this(loc, head, children, null); }
- public Tree(Input.Location loc, T head, Tree<T>[] children, Object[] labels) {
+/** <font color=blue>a tree (or node in a tree); see jargon.txt for details</font> */
+public class Tree<NodeType>
+ extends PrintableTree<Tree<NodeType>>
+ implements Iterable<Tree<NodeType>> {
+
+ private final Input.Region location;
+ private final NodeType ihead;
+ private final Tree<NodeType>[] children;
+
+ /** the number of children the tree has */
+ public int size() { return children.length; }
+
+ /** the element at the head of the tree */
+ public NodeType head() { return ihead; }
+ public NodeType getHead() { return ihead; }
+
+ /** the tree's children */
+ public Iterable<Tree<NodeType>> children() { return this; }
+
+ /** the tree's children */
+ public Iterator<Tree<NodeType>> iterator() { return new ArrayIterator(children); }
+
+ /** get the <tt>i</t>th child */
+ public Tree<NodeType> child(int i) { return children[i]; }
+
+ /** get the input region that this tree was parsed from */
+ public Input.Region getRegion() { return location; }
+
+ public Tree(Input.Region loc, NodeType head) { this(loc, head, new Tree[0]); }
+ public Tree(Input.Region loc, NodeType head, Tree<NodeType>[] children) { this(loc, head, children, new boolean[children==null?0:children.length]); }
+
+ // FIXME: fairly inefficient because we keep copying arrays
+ /** package-private constructor, allows setting the "lift" bit */
+ Tree(Input.Region loc, NodeType head, Tree<NodeType>[] children, boolean[] lifts) {