Lines Matching defs:nil
62 /** Return a nil node (an empty but non-null node) that can hold
64 * use "t=adaptor.nil(); t.addChild(x); t.addChild(y);"
66 public Object nil();
84 /** Is tree considered a nil node used to make lists of child nodes? */
96 /** If oldRoot is a nil root, just copy or move the children to newRoot.
97 * If not a nil root, make oldRoot a child of newRoot.
99 * old=^(nil a b c), new=r yields ^(r a b c)
102 * If newRoot is a nil-rooted single child tree, use the single
105 * old=^(nil a b c), new=^(nil r) yields ^(r a b c)
106 * old=^(a b c), new=^(nil r) yields ^(r ^(a b c))
111 * old=null, new=^(nil r) yields ^(nil r)
114 * simple node or nil root with a single child node--it must be a root
115 * node. If newRoot is ^(nil x) return x as newRoot.
126 * behavior is to convert ^(nil singleSubtree) to singleSubtree
127 * as the setting of start/stop indexes relies on a single non-nil root
132 * are set in the nil node.
151 * If oldRoot is a nil root, just copy or move the children to newRoot.
152 * If not a nil root, make oldRoot a child of newRoot.
215 * still usually have a nil root node just to hold the children list.
232 /** Set ith child (0..n-1) to t; t must be non-null and non-nil node */
