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); }
+
+ /** package-private constructor, allows setting the "lift" bit */
Tree(Input.Region loc, T head, Tree<T>[] children, boolean lift) {
this.location = loc;
this.head = head;
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; }
-
- // TreeFunctor /////////////////////////////////////////////////////////////////////////////
-
- public static interface TreeFunctor<T,R> extends Functor<Iterable<Tree<T>>, R> { }
-
+
}