checkpoint

[sbp.git] / src / edu / berkeley / sbp / Tree.java

diff --git a/src/edu/berkeley/sbp/Tree.java b/src/edu/berkeley/sbp/Tree.java
index 8368673..f87c5dc 100644 (file)
--- a/src/edu/berkeley/sbp/Tree.java
+++ b/src/edu/berkeley/sbp/Tree.java
@@ -7,19 +7,19 @@ import java.util.*;
 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>> {
+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               size() {
@@ -29,10 +29,10 @@ public class Tree<T>
     }
 
     /** 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())
@@ -40,7 +40,7 @@ public class Tree<T>
     }
 
     /** 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];
@@ -49,11 +49,11 @@ public class Tree<T>
     /** 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;