OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:nextNode
(Results
51 - 75
of
162
) sorted by null
1
2
3
4
5
6
7
/external/icu/icu4c/source/common/unicode/
ucharstriebuilder.h
154
UCTLinearMatchNode(const UChar *units, int32_t len, Node *
nextNode
);
163
Node *
nextNode
) const;
/external/antlr/antlr-3.4/runtime/C/include/
antlr3rewritestreams.h
146
pANTLR3_BASE_TREE (*
nextNode
) (struct ANTLR3_REWRITE_RULE_ELEMENT_STREAM_struct * stream);
/external/apache-xml/src/main/java/org/apache/xpath/axes/
ChildIterator.java
79
* to
nextNode
() returns the first node in the set.
84
public int
nextNode
()
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
...]
UnionPathIterator.java
37
* As each node is iterated via
nextNode
(), the node is also stored
82
iter.
nextNode
();
119
expr.
nextNode
();
128
* <code>
nextNode
</code> or<code>previousNode</code> will raise the
378
* to
nextNode
() returns the first node in the set.
382
public int
nextNode
()
413
m_iterators[i].
nextNode
();
430
m_iterators[iteratorUsed].
nextNode
();
FilterExprIteratorSimple.java
103
// and so we may not be in the context of LocPathIterator#
nextNode
,
143
* to
nextNode
() returns the first node in the set.
148
public int
nextNode
()
157
m_lastFetched = next = m_exprObj.
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
()))
FilterExprIterator.java
86
m_lastFetched = m_exprObj.
nextNode
();
/external/apache-xml/src/main/java/org/apache/xpath/functions/
FuncPosition.java
97
while(DTM.NULL != (n = cnl.
nextNode
()))
/external/chromium_org/third_party/WebKit/Source/core/dom/
NodeIterator.h
52
PassRefPtrWillBeRawPtr<Node>
nextNode
(ExceptionState&);
/external/apache-xml/src/main/java/org/apache/xpath/objects/
XNodeSet.java
176
int node =
nextNode
();
200
return (
nextNode
() != DTM.NULL);
317
// while (DTM.NULL != (node = nl.
nextNode
()))
499
while (DTM.NULL != (node1 = list1.
nextNode
()))
507
while (DTM.NULL != (node2 = list2.
nextNode
()))
570
while (DTM.NULL != (node = list1.
nextNode
()))
589
while (DTM.NULL != (node = list1.
nextNode
()))
615
while (DTM.NULL != (node = list1.
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/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
()
/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/chromium_org/third_party/WebKit/Source/devtools/front_end/layers/
LayerTreeOutline.js
121
var
nextNode
= node.nextSibling || node.parent;
125
node =
nextNode
;
/external/apache-xml/src/main/java/org/apache/xpath/
NodeSetDTM.java
41
*
nextNode
() is called, in order that nodes can be added
148
while (null != (node = iterator.
nextNode
()))
378
* to
nextNode
() returns the first node in the set.
385
public int
nextNode
()
432
* <code>
nextNode
</code> or<code>previousNode</code> will raise the
455
* the first
nextNode
() that is called will return the
458
* @return true if
nextNode
() would return the first node in the set,
656
while (DTM.NULL != (obj = iterator.
nextNode
()))
711
while (DTM.NULL != (node = iterator.
nextNode
()))
1101
/** If this node is being used as an iterator, the next index that
nextNode
()
[
all
...]
CachedXPathAPI.java
147
return nl.
nextNode
();
XPathAPI.java
92
return nl.
nextNode
();
/libcore/luni/src/main/java/java/util/concurrent/
ConcurrentLinkedDeque.java
[
all
...]
/external/apache-xml/src/main/java/org/apache/xml/serializer/dom3/
DOM3TreeWalker.java
274
Node
nextNode
= null;
276
nextNode
= pos.getFirstChild();
278
while (null ==
nextNode
) {
284
nextNode
= pos.getNextSibling();
286
if (null ==
nextNode
) {
293
nextNode
= null;
300
pos =
nextNode
;
347
Node
nextNode
= null;
349
nextNode
= pos.getFirstChild();
351
while (null ==
nextNode
) {
[
all
...]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/
AST.stg
448
ADAPTOR->addChild(ADAPTOR, root_<treeLevel>, stream_<label> == NULL ? NULL : stream_<label>->
nextNode
(stream_<label>));<\n>
453
ADAPTOR->addChild(ADAPTOR, root_<treeLevel>, stream_<label> == NULL ? NULL : stream_<label>->
nextNode
(stream_<label>));<\n>
494
root_<treeLevel> = (<ASTLabelType>)(ADAPTOR->becomeRoot(ADAPTOR, stream_<rule> == NULL ? NULL : stream_<rule>->
nextNode
(stream_<rule>), root_<treeLevel>));<\n>
517
root_<treeLevel> = (<ASTLabelType>)(ADAPTOR->becomeRoot(ADAPTOR, stream_<label> == NULL ? NULL : stream_<label>->
nextNode
(stream_<label>), root_<treeLevel>));<\n>
522
root_<treeLevel> = (<ASTLabelType>)(ADAPTOR->becomeRoot((<ASTLabelType>)(stream_<label> == NULL ? NULL : stream_<label>->
nextNode
(stream_<label>), root_<treeLevel>));<\n>
561
stream_<token> == NULL ? NULL : stream_<token>->
nextNode
(stream_<token>)
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/output1/
TreeRewriteParser.m
263
root_1 = (ANTLRCommonTree *)[treeAdaptor becomeRoot:(id<ANTLRTree>)[stream_subrule
nextNode
]
267
[treeAdaptor addChild:[stream_INT
nextNode
] toTree:root_1];
/external/apache-xml/src/main/java/org/apache/xalan/templates/
FuncKey.java
96
while (DTM.NULL != (pos = ni.
nextNode
()))
Completed in 400 milliseconds
1
2
3
4
5
6
7