+// 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.*;
-import edu.berkeley.sbp.bind.*;
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 Input.Region location;
- private final T head;
- private final Tree<T>[] children;
- private final boolean lift;
+ private final Input.Region location;
+ private final NodeType ihead;
+ private final Tree<NodeType>[] children;
- public T head() { return head; }
+ /** the number of children the tree has */
+ public int size() { return children.length; }
- private Tree<T> lifted() { return children[children.length-1]; }
+ /** the element at the head of the tree */
+ public NodeType head() { return ihead; }
+ public NodeType getHead() { return ihead; }
- public int numChildren() {
- return lift
- ? (children.length-1)+lifted().numChildren()
- : children.length;
- }
- public Iterable<Tree<T>> children() { return this; }
- public Iterator<Tree<T>> iterator() {
- return lift
- ? new ConcatenateIterator(new ArrayIterator(children, 0, children.length-1),
- children[children.length-1].iterator())
- : new ArrayIterator(children);
- }
+ /** the tree's children */
+ public Iterable<Tree<NodeType>> children() { return this; }
- public Tree<T> child(int i) {
- return lift && i >= children.length-1
- ? children[children.length-1].child(i-(children.length-1))
- : children[i];
- }
+ /** 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, 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) {
- this.location = loc;
- this.head = head;
- this.lift = lift && children != null && children.length > 0;
+ 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); }
- 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;
+ // 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 lift) {
+ this.location = loc;
+ this.ihead = head;
+ if (lift && children != null && children.length > 0) {
+ Tree<NodeType> last = children[children.length-1];
+ this.children = new Tree[(children.length-1)+last.children.length];
+ System.arraycopy(children, 0, this.children, 0, children.length-1);
+ if (last.children.length > 0)
+ System.arraycopy(last.children, 0, this.children, children.length-1, last.children.length);
+ } else {
+ this.children = ArrayUtil.clone(children, Tree.class);
+ }
}
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();
- //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 RawBindingFunctor<T> implements TreeFunctor<T,Object>, ToJava {
- private Binding _binding;
- private String _toString;
- public RawBindingFunctor(String toString, Binding binding) {
- this._binding = binding;
- this._toString = toString;
- }
- public String toString() {
- return _toString;
- }
- public void toJava(StringBuffer sb) {
- sb.append("new Tree.RawBindingFunctor(");
- sb.append("\"");
- sb.append(StringUtil.toJavaString(_toString));
- sb.append("\", ");
- _binding.toJava(sb);
- sb.append(")");
- }
- 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;
- private String _toString;
- public String toString() {
- return _toString;
- }
- public BindingFunctor(String toString, Binding binding) {
- this._binding = binding;
- this._toString = toString;
- }
- public void toJava(StringBuffer sb) {
- sb.append("new Tree.BindingFunctor(");
- sb.append("\"");
- sb.append(StringUtil.toJavaString(_toString));
- sb.append("\", ");
- _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);
- }
- }
-
}
projects / sbp.git / blobdiff