// Copyright 2006-2007 all rights reserved; see LICENSE file for BSD-style license
package edu.berkeley.sbp;
import edu.berkeley.sbp.*;
import edu.berkeley.sbp.util.*;
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
extends PrintableTree>
implements Iterable> {
private static final Tree[] emptyTree = new Tree[0];
private final Input.Region location;
private final NodeType ihead;
private final Tree[] 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> children() { return this; }
/** the tree's children */
public Iterator> iterator() { return new ArrayIterator(children); }
/** get the ith child */
public Tree 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) {
location = loc;
ihead = head;
children = emptyTree;
}
public Tree(Input.Region loc, NodeType head, List> kids){
location = loc;
ihead = head;
if (kids.size() == 0)
children = emptyTree;
else {
children = new Tree[kids.size()];
kids.toArray(children);
}
}
public Tree(Input.Region loc, NodeType head, Tree[] kids) {
location = loc;
ihead = head;
children = (kids == null ? emptyTree : kids.clone());
}
// FIXME: fairly inefficient because we keep copying arrays
/** package-private constructor, allows setting the "lift" bit */
Tree(Input.Region loc, NodeType head, Tree[] children, boolean[] lifts) {
this.location = loc;
this.ihead = head;
int count = 0;
for(int i=0; i