OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:NextNode
(Results
1 - 12
of
12
) sorted by null
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
RewriteRuleNodeStream.cs
65
public object
NextNode
() {
RewriteRuleSubtreeStream.cs
69
public virtual object
NextNode
() {
70
//System.Console.WriteLine("
nextNode
: elements={0}, singleElement={1}", elements, ((ITree)singleElement).ToStringTree());
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
()
RewriteRuleSubtreeStream.cs
74
public virtual object
NextNode
()
76
//System.Console.WriteLine("
nextNode
: elements={0}, singleElement={1}", elements, ((ITree)singleElement).ToStringTree());
RewriteRuleTokenStream.cs
60
public virtual object
NextNode
()
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.Tree.pas
[
all
...]
/external/llvm/include/llvm/ADT/
ilist.h
438
NodeTy *
NextNode
= this->getNext(Node);
442
this->setNext(PrevNode,
NextNode
);
444
Head =
NextNode
;
445
this->setPrev(
NextNode
, PrevNode);
446
IT =
NextNode
;
/external/clang/include/clang/ASTMatchers/
ASTMatchersInternal.h
[
all
...]
ASTMatchers.h
[
all
...]
/external/clang/lib/AST/
ASTDiagnostic.cpp
456
///
NextNode
- The index of the next sibling node or 0.
457
unsigned
NextNode
;
501
: Kind(Invalid),
NextNode
(0), ChildNode(0), ParentNode(ParentNode),
611
for (i = Node.ChildNode; FlatTree[i].
NextNode
!= 0;
612
i = FlatTree[i].
NextNode
) {
614
FlatTree[i].
NextNode
= NextFreeNode;
693
if (FlatTree[ReadNode].
NextNode
== 0)
696
ReadNode = FlatTree[ReadNode].
NextNode
;
702
return FlatTree[ReadNode].
NextNode
!= 0;
[
all
...]
/external/clang/lib/StaticAnalyzer/Core/
BugReporter.cpp
563
const ExplodedNode *
NextNode
= N->pred_empty()
568
while (
NextNode
) {
569
N =
NextNode
;
571
NextNode
= N->getFirstPred();
866
if (
NextNode
) {
870
if (PathDiagnosticPiece *p = V->VisitNode(N,
NextNode
, PDB, *R)) {
[
all
...]
Completed in 464 milliseconds