import java.lang.reflect.*;
/** <font color=blue>a tree (or node in a tree); see jargon.txt for details</font> */
-public class Tree<T>
- extends PrintableTree<Tree<T>>
- implements Iterable<Tree<T>>,
- GraphViz.ToGraphViz {
+public class Tree<NodeType>
+ extends PrintableTree<Tree<NodeType>>
+ implements Iterable<Tree<NodeType>> {
private final Input.Region location;
- private final T head;
- private final Tree<T>[] children;
+ private final NodeType head;
+ private final Tree<NodeType>[] children;
private final boolean lift;
/** the element at the head of the tree */
- public T head() { return head; }
+ public NodeType head() { return head; }
- private Tree<T> lifted() { return children[children.length-1]; }
+ private Tree<NodeType> lifted() { return children[children.length-1]; }
/** the number of children the tree has */
- public int numChildren() {
+ public int size() {
return lift
- ? (children.length-1)+lifted().numChildren()
+ ? (children.length-1)+lifted().size()
: children.length;
}
/** the tree's children */
- public Iterable<Tree<T>> children() { return this; }
+ public Iterable<Tree<NodeType>> children() { return this; }
/** the tree's children */
- public Iterator<Tree<T>> iterator() {
+ public Iterator<Tree<NodeType>> iterator() {
return lift
? new ConcatenateIterator(new ArrayIterator(children, 0, children.length-1),
children[children.length-1].iterator())
}
/** get the <tt>i</t>th child */
- public Tree<T> child(int i) {
+ public Tree<NodeType> 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<T>[] children) { this(loc, head, children, false); }
+ public Tree(Input.Region loc, NodeType head) { this(loc, head, null); }
+ public Tree(Input.Region loc, NodeType head, Tree<NodeType>[] 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) {
+ Tree(Input.Region loc, NodeType head, Tree<NodeType>[] children, boolean lift) {
this.location = loc;
this.head = head;
this.lift = lift && children != null && children.length > 0;
protected boolean ignoreSingleton() { return false; }
- // ToGraphViz /////////////////////////////////////////////////////////////////////////////
-
- public GraphViz.Node toGraphViz(GraphViz gv) {
- if (gv.hasNode(this)) return gv.createNode(this);
- GraphViz.Node n = gv.createNode(this);
- n.label = head()==null ? "" : head().toString();
- for(Tree t : this) n.edge(t, null);
- return n;
- }
- public boolean isTransparent() { return false; }
- public boolean isHidden() { return false; }
-
}