Searched refs:oldRoot (Results 1 - 25 of 64) sorted by relevance

123

/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
H A DANTLRTreeException.h32 id<ANTLRTree> oldRoot; variable
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
H A DANTLRTreeException.h32 id<ANTLRTree> oldRoot; variable
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
H A DANTLRTreeException.h32 id<ANTLRTree> oldRoot; variable
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRTreeException.h32 id<ANTLRBaseTree> oldRoot; variable
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DITreeAdaptor.cs114 * If oldRoot is a nil root, just copy or move the children to newRoot.
115 * If not a nil root, make oldRoot a child of newRoot.
128 * If oldRoot was null, it's ok, just return newRoot (even if isNil).
137 * Be advised that it's ok for newRoot to point at oldRoot's
143 object BecomeRoot(object newRoot, object oldRoot); argument
178 * Create a node for newRoot make it the root of oldRoot.
179 * If oldRoot is a nil root, just copy or move the children to newRoot.
180 * If not a nil root, make oldRoot a child of newRoot.
194 object BecomeRoot(IToken newRoot, object oldRoot); argument
H A DBaseTreeAdaptor.cs124 * If oldRoot is a nil root, just copy or move the children to newRoot.
125 * If not a nil root, make oldRoot a child of newRoot.
138 * If oldRoot was null, it's ok, just return newRoot (even if isNil).
147 * Be advised that it's ok for newRoot to point at oldRoot's
153 public virtual object BecomeRoot(object newRoot, object oldRoot) { argument
154 //System.out.println("becomeroot new "+newRoot.toString()+" old "+oldRoot);
156 ITree oldRootTree = (ITree)oldRoot;
157 if (oldRoot == null) {
170 // add oldRoot to newRoot; addChild takes care of case where oldRoot
194 BecomeRoot(IToken newRoot, object oldRoot) argument
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
H A DITreeAdaptor.cs170 * If oldRoot is a nil root, just copy or move the children to newRoot.
171 * If not a nil root, make oldRoot a child of newRoot.
184 * If oldRoot was null, it's ok, just return newRoot (even if isNil).
193 * Be advised that it's ok for newRoot to point at oldRoot's
199 object BecomeRoot( object newRoot, object oldRoot );
234 * Create a node for newRoot make it the root of oldRoot.
235 * If oldRoot is a nil root, just copy or move the children to newRoot.
236 * If not a nil root, make oldRoot a child of newRoot.
250 object BecomeRoot( IToken newRoot, object oldRoot );
H A DBaseTreeAdaptor.cs158 * If oldRoot is a nil root, just copy or move the children to newRoot.
159 * If not a nil root, make oldRoot a child of newRoot.
172 * If oldRoot was null, it's ok, just return newRoot (even if isNil).
181 * Be advised that it's ok for newRoot to point at oldRoot's
187 public virtual object BecomeRoot( object newRoot, object oldRoot )
189 //System.out.println("becomeroot new "+newRoot.toString()+" old "+oldRoot);
191 ITree oldRootTree = (ITree)oldRoot;
192 if ( oldRoot == null )
208 // add oldRoot to newRoot; addChild takes care of case where oldRoot
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/
H A DITreeFixture.cs177 CommonTree oldRoot = new CommonTree((IToken)null);
178 oldRoot.AddChild(new CommonTree(new CommonToken(101)));
179 oldRoot.AddChild(new CommonTree(new CommonToken(102)));
180 oldRoot.AddChild(new CommonTree(new CommonToken(103)));
183 adaptor.BecomeRoot(newRoot, oldRoot);
193 CommonTree oldRoot = new CommonTree(new CommonToken(101));
194 oldRoot.AddChild(new CommonTree(new CommonToken(102)));
195 oldRoot.AddChild(new CommonTree(new CommonToken(103)));
198 adaptor.BecomeRoot(newRoot, oldRoot);
209 CommonTree oldRoot
[all...]
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
H A DTestTrees.java171 CommonTree oldRoot = new CommonTree((Token)null);
172 oldRoot.addChild(new CommonTree(new CommonToken(101)));
173 oldRoot.addChild(new CommonTree(new CommonToken(102)));
174 oldRoot.addChild(new CommonTree(new CommonToken(103)));
177 adaptor.becomeRoot(newRoot, oldRoot);
185 CommonTree oldRoot = new CommonTree(new CommonToken(101));
186 oldRoot.addChild(new CommonTree(new CommonToken(102)));
187 oldRoot.addChild(new CommonTree(new CommonToken(103)));
190 adaptor.becomeRoot(newRoot, oldRoot);
199 CommonTree oldRoot
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/SlimParsing/Tree/
H A DITreeAdaptor`1.cs102 * If oldRoot is a nil root, just copy or move the children to newRoot.
103 * If not a nil root, make oldRoot a child of newRoot.
116 * If oldRoot was null, it's ok, just return newRoot (even if isNil).
125 * Be advised that it's ok for newRoot to point at oldRoot's
131 T BecomeRoot(T newRoot, T oldRoot); argument
166 * Create a node for newRoot make it the root of oldRoot.
167 * If oldRoot is a nil root, just copy or move the children to newRoot.
168 * If not a nil root, make oldRoot a child of newRoot.
182 T BecomeRoot(IToken newRoot, T oldRoot); argument
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DTreeAdaptor.java96 /** 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.
108 * If oldRoot was null, it's ok, just return newRoot (even if isNil).
117 * Be advised that it's ok for newRoot to point at oldRoot's
122 public Object becomeRoot(Object newRoot, Object oldRoot); argument
150 /** Create a node for newRoot make it the root of oldRoot.
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.
161 public Object becomeRoot(Token newRoot, Object oldRoot); argument
H A DBaseTreeAdaptor.java111 /** If oldRoot is a nil root, just copy or move the children to newRoot.
112 * If not a nil root, make oldRoot a child of newRoot.
123 * If oldRoot was null, it's ok, just return newRoot (even if isNil).
132 * Be advised that it's ok for newRoot to point at oldRoot's
137 public Object becomeRoot(Object newRoot, Object oldRoot) { argument
138 //System.out.println("becomeroot new "+newRoot.toString()+" old "+oldRoot);
140 Tree oldRootTree = (Tree)oldRoot;
141 if ( oldRoot==null ) {
153 // add oldRoot to newRoot; addChild takes care of case where oldRoot
178 becomeRoot(Token newRoot, Object oldRoot) argument
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/
H A DDebugTreeAdaptor.cs124 public virtual object BecomeRoot(object newRoot, object oldRoot) { argument
125 object n = adaptor.BecomeRoot(newRoot, oldRoot);
126 dbg.BecomeRoot(newRoot, oldRoot);
139 public virtual object BecomeRoot(IToken newRoot, object oldRoot) { argument
141 adaptor.BecomeRoot(n, oldRoot);
142 dbg.BecomeRoot(newRoot, oldRoot);
H A DDebugEventRepeater.cs149 public virtual void BecomeRoot(object newRoot, object oldRoot) { argument
150 _listener.BecomeRoot(newRoot, oldRoot);
H A DTraceDebugEventListener.cs102 public override void BecomeRoot(object newRoot, object oldRoot) { argument
104 adaptor.GetUniqueID(oldRoot));
H A DBlankDebugEventListener.cs120 public virtual void BecomeRoot(object newRoot, object oldRoot) { argument
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/
H A DDebugTreeAdaptor.cs160 public virtual object BecomeRoot( object newRoot, object oldRoot )
162 object n = adaptor.BecomeRoot( newRoot, oldRoot );
163 dbg.BecomeRoot( newRoot, oldRoot );
178 public virtual object BecomeRoot( IToken newRoot, object oldRoot )
181 adaptor.BecomeRoot( n, oldRoot );
182 dbg.BecomeRoot( newRoot, oldRoot );
H A DDebugEventRepeater.cs181 public virtual void BecomeRoot( object newRoot, object oldRoot )
183 _listener.BecomeRoot( newRoot, oldRoot );
H A DTraceDebugEventListener.cs115 public override void BecomeRoot( object newRoot, object oldRoot )
118 adaptor.GetUniqueID( oldRoot ) );
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/
H A DDebugTreeAdaptor.java120 public Object becomeRoot(Object newRoot, Object oldRoot) { argument
121 Object n = adaptor.becomeRoot(newRoot, oldRoot);
122 dbg.becomeRoot(newRoot, oldRoot);
135 public Object becomeRoot(Token newRoot, Object oldRoot) { argument
137 adaptor.becomeRoot(n, oldRoot);
138 dbg.becomeRoot(newRoot, oldRoot);
H A DDebugEventRepeater.java83 public void becomeRoot(Object newRoot, Object oldRoot) { listener.becomeRoot(newRoot, oldRoot); } argument
H A DTraceDebugEventListener.java81 public void becomeRoot(Object newRoot, Object oldRoot) { argument
83 adaptor.getUniqueID(oldRoot));
/external/chromium_org/third_party/WebKit/Source/core/dom/shadow/
H A DElementShadow.cpp175 while (RefPtrWillBeRawPtr<ShadowRoot> oldRoot = m_shadowRoots.head()) {
176 InspectorInstrumentation::willPopShadowRoot(shadowHost, oldRoot.get());
177 shadowHost->document().removeFocusedElementOfSubtree(oldRoot.get());
179 oldRoot->setParentOrShadowHostNode(0);
180 oldRoot->setParentTreeScope(shadowHost->document());
181 oldRoot->setPrev(0);
182 oldRoot->setNext(0);
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
H A DBaseTreeAdaptor.js69 /** If oldRoot is a nil root, just copy or move the children to newRoot.
70 * If not a nil root, make oldRoot a child of newRoot.
81 * If oldRoot was null, it's ok, just return newRoot (even if isNil).
90 * Be advised that it's ok for newRoot to point at oldRoot's
95 becomeRoot: function(newRoot, oldRoot) {
101 oldRootTree = oldRoot;
102 if ( !oldRoot ) {
115 // add oldRoot to newRoot; addChild takes care of case where oldRoot
116 // is a flat list (i.e., nil-rooted tree). All children of oldRoot
[all...]

Completed in 466 milliseconds

123