Lines Matching refs:OldRoot
134 /// If oldRoot is a nil root, just copy or move the children to newRoot.
135 /// If not a nil root, make oldRoot a child of newRoot.
148 /// If oldRoot was null, it's ok, just return newRoot (even if isNil).
157 /// Be advised that it's ok for newRoot to point at oldRoot's
162 function BecomeRoot(const NewRoot, OldRoot: IANTLRInterface): IANTLRInterface; overload;
203 /// Create a node for newRoot make it the root of oldRoot.
204 /// If oldRoot is a nil root, just copy or move the children to newRoot.
205 /// If not a nil root, make oldRoot a child of newRoot.
209 function BecomeRoot(const NewRoot: IToken; const OldRoot: IANTLRInterface): IANTLRInterface; overload;
1278 function BecomeRoot(const NewRoot, OldRoot: IANTLRInterface): IANTLRInterface; overload; virtual;
1281 function BecomeRoot(const NewRoot: IToken; const OldRoot: IANTLRInterface): IANTLRInterface; overload; virtual;
2685 OldRoot: IANTLRInterface): IANTLRInterface;
2691 OldRootTree := OldRoot as ITree;
2692 if (OldRoot = nil) then
2706 // add oldRoot to newRoot; AddChild takes care of case where oldRoot
2707 // is a flat list (i.e., nil-rooted tree). All children of oldRoot
2715 const OldRoot: IANTLRInterface): IANTLRInterface;
2717 Result := BecomeRoot(CreateNode(NewRoot), OldRoot);
