HomeSort by relevance Sort by last modified time
    Searched refs:OldRoot (Results 1 - 3 of 3) sorted by null

  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/
Antlr.Runtime.Tree.Tests.pas 253 OldRoot, NewRoot: ICommonTree;
258 OldRoot := TCommonTree.Create(IToken(nil));
259 OldRoot.AddChild(TCommonTree.Create(TCommonToken.Create(101)));
260 OldRoot.AddChild(TCommonTree.Create(TCommonToken.Create(102)));
261 OldRoot.AddChild(TCommonTree.Create(TCommonToken.Create(103)));
263 Adaptor.BecomeRoot(NewRoot, OldRoot);
269 OldRoot, NewRoot: ICommonTree;
274 OldRoot := TCommonTree.Create(TCommonToken.Create(101));
275 OldRoot.AddChild(TCommonTree.Create(TCommonToken.Create(102)));
276 OldRoot.AddChild(TCommonTree.Create(TCommonToken.Create(103)))
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
LegalizeVectorOps.cpp 165 SDValue OldRoot = DAG.getRoot();
166 assert(LegalizedNodes.count(OldRoot) && "Root didn't get legalized?");
167 DAG.setRoot(LegalizedNodes[OldRoot]);
    [all...]
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.Tree.pas 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;
    [all...]

Completed in 501 milliseconds