OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:nextnode
(Results
51 - 75
of
188
) sorted by null
1
2
3
4
5
6
7
8
/external/apache-xml/src/main/java/org/apache/xpath/axes/
NodeSequence.java
308
* @see DTMIterator#
nextNode
()
310
public int
nextNode
()
335
int next = m_iter.
nextNode
();
494
while (DTM.NULL != (n =
nextNode
()));
511
while ((m_next < index) && DTM.NULL != (n =
nextNode
()));
530
int n =
nextNode
();
848
* If ns3.
nextNode
() is called 3 times the the
853
* If ns2.
nextNode
() is called 2 times it will return
856
* If ns1.
nextNode
() is called 6 times it will return
862
* Should ns2 or ns3 have
nextNode
() called they wil
[
all
...]
MatchPatternIterator.java
170
* <code>
nextNode
</code> or<code>previousNode</code> will raise the
199
* to
nextNode
() returns the first node in the set.
203
public int
nextNode
()
OneStepIterator.java
105
* <code>
nextNode
</code> or<code>previousNode</code> will raise the
217
while (DTM.NULL != (next = clone.
nextNode
()))
276
while (DTM.NULL != (next = clone.
nextNode
()))
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/
AST.stg
304
adaptor.addChild(root_<treeLevel>, stream_<label>.
nextNode
());<\n>
309
adaptor.addChild(root_<treeLevel>, stream_<label>.
nextNode
());<\n>
314
root_<treeLevel> = <ASTLabelType>(adaptor.becomeRoot(stream_<label>.
nextNode
(), root_<treeLevel>));<\n>
350
root_<treeLevel> = <ASTLabelType>(adaptor.becomeRoot(stream_<rule>.
nextNode
(), root_<treeLevel>));<\n>
373
root_<treeLevel> = <ASTLabelType>(adaptor.becomeRoot(stream_<label>.
nextNode
(), root_<treeLevel>));<\n>
378
root_<treeLevel> = <ASTLabelType>(adaptor.becomeRoot(stream_<label>.
nextNode
(), root_<treeLevel>));<\n>
401
stream_<token>.
nextNode
()
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/
AST.stg
332
adaptor.AddChild(root_<treeLevel>, stream_<label>.
NextNode
());<\n>
337
adaptor.AddChild(root_<treeLevel>, stream_<label>.
NextNode
());<\n>
342
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.
NextNode
(), root_<treeLevel>);<\n>
378
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<rule>.
NextNode
(), root_<treeLevel>);<\n>
401
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.
NextNode
(), root_<treeLevel>);<\n>
406
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.
NextNode
(), root_<treeLevel>);<\n>
429
stream_<token>.
NextNode
()
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/
AST.stg
330
adaptor.AddChild(root_<treeLevel>, stream_<label>.
NextNode
());<\n>
335
adaptor.AddChild(root_<treeLevel>, stream_<label>.
NextNode
());<\n>
340
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.
NextNode
(), root_<treeLevel>);<\n>
376
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<rule>.
NextNode
(), root_<treeLevel>);<\n>
399
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.
NextNode
(), root_<treeLevel>);<\n>
404
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.
NextNode
(), root_<treeLevel>);<\n>
427
stream_<token>.
NextNode
()
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/
AST.stg
349
Adaptor.AddChild(Root[<treeLevel>], (Locals['Stream_<label>'] as IRewriteRuleElementStream).
NextNode
());<\n>
354
Adaptor.AddChild(Root[<treeLevel>], (Locals['Stream_<label>'] as IRewriteRuleElementStream).
NextNode
);<\n>
359
Root[<treeLevel>] := Adaptor.BecomeRoot((Locals['Stream_<label>'] as IRewriteRuleElementStream).
NextNode
(), Root[<treeLevel>]) as I<ASTLabelType>;<\n>
395
Root[<treeLevel>] := Adaptor.BecomeRoot((Locals['Stream_<rule>'] as IRewriteRuleElementStream).
NextNode
, Root[<treeLevel>]) as I<ASTLabelType>;<\n>
418
Root[<treeLevel>] := Adaptor.BecomeRoot((Locals['Stream_<label>'] as IRewriteRuleElementStream).
NextNode
, Root[<treeLevel>]) as I<ASTLabelType>;<\n>
423
Root[<treeLevel>] := Adaptor.BecomeRoot((Locals['Stream_<label>'] as IRewriteRuleElementStream).
NextNode
, Root[<treeLevel>]) as I<ASTLabelType>;<\n>
442
(Locals['Stream_<token>'] as IRewriteRuleElementStream).
NextNode
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/
AST.stg
304
adaptor.addChild(root_<treeLevel>, stream_<label>.
nextNode
());<\n>
309
adaptor.addChild(root_<treeLevel>, stream_<label>.
nextNode
());<\n>
314
root_<treeLevel> = (<ASTLabelType>)adaptor.becomeRoot(stream_<label>.
nextNode
(), root_<treeLevel>);<\n>
350
root_<treeLevel> = (<ASTLabelType>)adaptor.becomeRoot(stream_<rule>.
nextNode
(), root_<treeLevel>);<\n>
373
root_<treeLevel> = (<ASTLabelType>)adaptor.becomeRoot(stream_<label>.
nextNode
(), root_<treeLevel>);<\n>
378
root_<treeLevel> = (<ASTLabelType>)adaptor.becomeRoot(stream_<label>.
nextNode
(), root_<treeLevel>);<\n>
402
stream_<token>.
nextNode
()
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/
AST.stg
303
this.adaptor.addChild(root_<treeLevel>, stream_<label>.
nextNode
());<\n>
308
this.adaptor.addChild(root_<treeLevel>, stream_<label>.
nextNode
());<\n>
313
root_<treeLevel> = this.adaptor.becomeRoot(stream_<label>.
nextNode
(), root_<treeLevel>);<\n>
349
root_<treeLevel> = this.adaptor.becomeRoot(stream_<rule>.
nextNode
(), root_<treeLevel>);<\n>
372
root_<treeLevel> = this.adaptor.becomeRoot(stream_<label>.
nextNode
(), root_<treeLevel>);<\n>
377
root_<treeLevel> = this.adaptor.becomeRoot(stream_<label>.
nextNode
(), root_<treeLevel>);<\n>
400
stream_<token>.
nextNode
()
ASTTreeParser.stg
236
* change nextToken to
nextNode
.
240
new <terminalOptions.node>(stream_<token>.
nextNode
())
242
stream_<token>.
nextNode
()
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ObjC/
AST.stg
460
[treeAdaptor addChild:[stream_<label>
nextNode
] toTree:root_<treeLevel>];<\n>
465
[treeAdaptor addChild:[stream_<label>
nextNode
] toTree:root_<treeLevel>];<\n>
470
root_<treeLevel> = (<ASTLabelType> *)[treeAdaptor becomeRoot:[stream_<label>
nextNode
] old:root_<treeLevel>];<\n>
506
root_<treeLevel> = (<ASTLabelType> *)[treeAdaptor becomeRoot:(id\<ANTLRTree>)[stream_<rule>
nextNode
] old:root_<treeLevel>];<\n>
529
root_<treeLevel> = (<ASTLabelType> *)[treeAdaptor becomeRoot:[stream_<label>
nextNode
] old:root_<treeLevel>];<\n>
534
root_<treeLevel> = (<ASTLabelType> *)[treeAdaptor becomeRoot:[stream_<label>
nextNode
] old:root_<treeLevel>];<\n>
560
[stream_<token>
nextNode
]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/
AST.stg
334
self._adaptor.addChild(root_<treeLevel>, stream_<label>.
nextNode
())<\n>
339
self._adaptor.addChild(root_<treeLevel>, stream_<label>.
nextNode
())<\n>
344
root_<treeLevel> = self._adaptor.becomeRoot(stream_<label>.
nextNode
(), root_<treeLevel>)<\n>
381
root_<treeLevel> = self._adaptor.becomeRoot(stream_<rule>.
nextNode
(), root_<treeLevel>)<\n>
404
root_<treeLevel> = self._adaptor.becomeRoot(stream_<label>.
nextNode
(), root_<treeLevel>)<\n>
409
root_<treeLevel> = self._adaptor.becomeRoot(stream_<label>.
nextNode
(), root_<treeLevel>)<\n>
449
stream_<token>.
nextNode
()
/external/icu4c/common/unicode/
stringtriebuilder.h
285
IntermediateValueNode(int32_t v, Node *
nextNode
)
286
: ValueNode(0x222222*37+hashCode(
nextNode
)), next(
nextNode
) { setValue(v); }
299
LinearMatchNode(int32_t len, Node *
nextNode
)
300
: ValueNode((0x333333*37+len)*37+hashCode(
nextNode
)),
301
length(len), next(
nextNode
) {}
387
Node *
nextNode
) const = 0;
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Perl5/
ASTTreeParser.stg
241
* change nextToken to
nextNode
.
245
new <terminalOptions.node>(stream_<token>.
nextNode
())
247
stream_<token>.
nextNode
()
/external/apache-xml/src/main/java/org/apache/xpath/
NodeSet.java
40
*
nextNode
() is called, in order that nodes can be added
234
* to
nextNode
() returns the first node in the set.
241
public Node
nextNode
() throws DOMException
288
* <code>
nextNode
</code> or<code>previousNode</code> will raise the
299
* the first
nextNode
() that is called will return the
302
* @return true if
nextNode
() would return the first node in the set,
498
while (null != (obj = iterator.
nextNode
()))
552
while (null != (node = iterator.
nextNode
()))
716
/** If this node is being used as an iterator, the next index that
nextNode
()
722
* the next
nextNode
() call will retrieve. i.e. i
[
all
...]
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
RewriteRuleTokenStream.as
39
public function
nextNode
():Object {
/external/antlr/antlr-3.4/runtime/C/src/
antlr3collections.c
[
all
...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
RewriteRuleNodeStream.cs
65
public object
NextNode
() {
RewriteRuleTokenStream.cs
73
public virtual object
NextNode
() {
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
RewriteRuleNodeStream.cs
64
public virtual object
NextNode
()
RewriteRuleTokenStream.cs
60
public virtual object
NextNode
()
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
RewriteRuleNodeStream.java
57
public Object
nextNode
() {
RewriteRuleTokenStream.java
57
public Object
nextNode
() {
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
ANTLRRewriteRuleSubtreeStream.h
49
- (id)
nextNode
;
ANTLRRewriteRuleTokenStream.h
57
- (id)
nextNode
;
Completed in 508 milliseconds
1
2
3
4
5
6
7
8