X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FTree.java;h=558d23459bcee59296d9111ec7aa784c0bc8c698;hb=6ff6d681e214e91ca3fa5afdff60a0fb88227404;hp=c525ffad81d2229a9ed0162d16980191d9df3609;hpb=439a7ad1815292b659ebe50fba55aefd73f4a68f;p=sbp.git

diff --git a/src/edu/berkeley/sbp/Tree.java b/src/edu/berkeley/sbp/Tree.java
index c525ffa..558d234 100644
--- a/src/edu/berkeley/sbp/Tree.java
+++ b/src/edu/berkeley/sbp/Tree.java
@@ -1,3 +1,5 @@
+// Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
+
 package edu.berkeley.sbp;
 import edu.berkeley.sbp.*;
 import edu.berkeley.sbp.util.*;
@@ -6,53 +8,63 @@ import java.io.*;
 import java.util.*;
 import java.lang.reflect.*;
 
-/** 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 {
+/** <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 T            head;
-    private final Tree<T>[]    children;
     private final Input.Region location;
+    private final NodeType     head;
+    private final Tree<NodeType>[]    children;
     private final boolean      lift;
 
-    public T                 head()        { return head; }
+    /** the element at the head of the tree */
+    public NodeType                 head()        { return head; }
 
-    private Tree<T> lifted() { return children[children.length-1]; }
+    private Tree<NodeType> lifted() { return children[children.length-1]; }
 
-    public int               numChildren() {
-        if (lift && children.length > 0)
-            return (children.length-1)+lifted().numChildren();
-        return children.length;
+    /** the number of children the tree has */
+    public int               size() {
+        return lift
+            ? (children.length-1)+lifted().size()
+            : children.length;
     }
-    public Iterable<Tree<T>> children()    { return this; }
-    public Iterator<Tree<T>> iterator()    {
-        if (lift)
-            return new ConcatenateIterator(new ArrayIterator(children, 0, children.length-1),
-                                           children[children.length-1].iterator());
-        return new ArrayIterator(children);
+
+    /** the tree's children */
+    public Iterable<Tree<NodeType>> children()    { return this; }
+
+    /** the tree's children */
+    public Iterator<Tree<NodeType>> iterator()    {
+        return lift
+            ? new ConcatenateIterator(new ArrayIterator(children, 0, children.length-1),
+                                      children[children.length-1].iterator())
+            : new ArrayIterator(children);
     }
-    public Tree<T>           child(int i)  {
-        if (lift && i >= children.length-1)
-            return children[children.length-1].child(i-(children.length-1));
-        return children[i];
+
+    /** get the <tt>i</t>th child */
+    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, T head, Tree<T>[] children, boolean lift) {
+    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, NodeType head, Tree<NodeType>[] children, boolean lift) {
         this.location = loc;
         this.head = head;
-        this.lift = lift;
-
-        Tree<T>[] children2 = children==null ? new Tree[0] : new Tree[children.length];
-        if (children != null) System.arraycopy(children, 0, children2, 0, children.length);
-        this.children = children2;
+        this.lift = lift && children != null && children.length > 0;
+        this.children = ArrayUtil.clone(children, Tree.class);
     }
 
+
+    // PrintableTree /////////////////////////////////////////////////////////////////////////////
+
     protected String headToString() { return head()==null?null:head().toString(); }
     protected String headToJava()   {
       // FIXME
@@ -68,81 +80,5 @@ public class Tree<T>
     protected String right()  { return "}"; }
     protected boolean ignoreSingleton() { return false; }
 
-    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();
-        //n.color = "red";
-        for(Tree t : this) n.edge(t, null);
-        return n;
-    }
-    public boolean isTransparent() { return false; }
-    public boolean isHidden() { return false; }
-
-    public static interface TreeFunctor<T,R> extends Functor<Iterable<Tree<T>>, R> {
-    }
-
-    public static class ArrayBuildingTreeFunctor<T> implements TreeFunctor<T,T[]>, ToJava {
-
-        public void toJava(StringBuffer sb) { sb.append("new Tree.ArrayBuildingTreeFunctor()"); }
-        public String toString() { return ""; }
-        
-        public T[] invoke(Iterable<Tree<T>> t) {
-            ArrayList ret = new ArrayList();
-            for(Tree tc : t) {
-                if (tc.head() != null && tc.head() instanceof Functor)
-                    ret.add(((Functor<Iterable<Tree>,Object>)tc.head()).invoke(tc.children()));
-                else if (tc.numChildren() == 0)
-                    ret.add(tc.head());
-                else {
-                    System.err.println("FIXME: don't know what to do about " + tc);
-                    ret.add(null);
-                }
-            }
-            return (T[])ret.toArray(new Object[0]);
-        }
-    }
-
-    public static class RawBindingFunctor<T> implements TreeFunctor<T,Object>, ToJava {
-        private Binding _binding;
-        public void toJava(StringBuffer sb) {
-            sb.append("new Tree.RawBindingFunctor(");
-            _binding.toJava(sb);
-            sb.append(")");
-        }
-        public RawBindingFunctor(Binding binding) {
-            this._binding = binding;
-        }
-        public Object invoke(Iterable<Tree<T>> t) {
-            return _binding.invoke(new Object[] { t });           
-        }
-    }
-
-    public static class BindingFunctor<T> implements TreeFunctor<T,Object>, ToJava {
-        private Binding _binding;
-        public BindingFunctor(Binding binding) {
-            this._binding = binding;
-        }
-        public void toJava(StringBuffer sb) {
-            sb.append("new Tree.BindingFunctor(");
-            _binding.toJava(sb);
-            sb.append(")");
-        }
-        public Object invoke(Iterable<Tree<T>> t) {
-            ArrayList ret = new ArrayList();
-            for(Tree tc : t) {
-                if (tc.head() != null && tc.head() instanceof Functor)
-                    ret.add(((Tree.TreeFunctor<Object,Object>)tc.head()).invoke(tc.children()));
-                else if (tc.numChildren() == 0)
-                    ret.add(tc.head());
-                else {
-                    System.err.println("FIXME: don't know what to do about " + tc);
-                    ret.add(null);
-                }
-            }
-            Object[] o = (Object[])ret.toArray(new Object[0]);
-            return _binding.invoke(o);
-        }
-    }
 
 }