/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
H A D | AntlrRuntime_BaseTreeDebugView.cs | 47 public ITree[] Children property in class:Antlr.Runtime.Tree.AntlrRuntime_BaseTreeDebugView 51 if (_tree == null || _tree.Children == null) 54 ITree[] children = new ITree[_tree.Children.Count]; 55 _tree.Children.CopyTo(children, 0);
|
H A D | BaseTree.cs | 73 public virtual IList<ITree> Children property in class:Antlr.Runtime.Tree.BaseTree 92 if ( Children == null ) 95 return Children.Count; 174 if ( Children == null || i >= Children.Count ) 177 return Children[i]; 182 foreach ( ITree child in Children ) 211 if ( childTree != null && this.Children != null && this.Children == childTree.Children ) [all...] |
H A D | CommonTree.cs | 94 return Children[0].CharPositionInLine; 135 return Children[0].Line; 253 if ( Children == null ) 261 foreach (ITree childTree in Children) 273 if ( Children.Count > 0 ) 275 ITree firstChild = Children[0]; 276 ITree lastChild = Children[Children.Count - 1];
|
H A D | ParseTree.cs | 160 for ( int i = 0; Children != null && i < Children.Count; i++ ) 162 ParseTree t = (ParseTree)Children[i];
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | CommonTree.cs | 87 return Children[0].CharPositionInLine; 114 return Children[0].Line; 195 if (Children == null) { 201 for (int i = 0; i < Children.Count; i++) { 202 ((CommonTree)Children[i]).SetUnknownTokenBoundaries(); 206 if (Children.Count > 0) { 207 CommonTree firstChild = (CommonTree)Children[0]; 208 CommonTree lastChild = (CommonTree)Children[Children.Count - 1];
|
H A D | ParseTree.cs | 135 for (int i = 0; Children != null && i < Children.Count; i++) { 136 ParseTree t = (ParseTree)Children[i];
|
H A D | BaseTree.cs | 68 public virtual IList<ITree> Children { property in class:Antlr.Runtime.Tree.BaseTree 78 if (Children == null) 81 return Children.Count;
|
/external/clang/lib/Tooling/ |
H A D | FileMatchTrie.cpp | 64 if (Children.empty()) { 71 Children[Element].Path = Path; 75 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1); 103 if (Children.empty()) { 111 Children.find(Element); 112 if (MatchingChild != Children.end()) { 141 if (Children.empty()) { 146 It = Children.begin(), E = Children.end(); 150 It->getValue().getAll(Results, Children 159 llvm::StringMap<FileMatchTrieNode> Children; member in class:clang::tooling::FileMatchTrieNode [all...] |
/external/clang/lib/Rewrite/ |
H A D | DeltaTree.cpp | 123 DeltaTreeNode *Children[2*WidthFactor]; 126 Children[i]->Destroy(); 134 Children[0] = IR.LHS; 135 Children[1] = IR.RHS; 143 return Children[i]; 147 return Children[i]; 227 if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes)) 237 memmove(&IN->Children[i+2], &IN->Children[i+1], 238 (e-i)*sizeof(IN->Children[ [all...] |
H A D | RewriteRope.cpp | 393 /// Children array. 395 RopePieceBTreeNode *Children[2*WidthFactor]; 401 Children[0] = LHS; 402 Children[1] = RHS; 409 Children[i]->Destroy(); 417 return Children[i]; 421 return Children[i]; 530 memmove(&Children[i+2], &Children[i+1], 531 (getNumChildren()-i-1)*sizeof(Children[ [all...] |
/external/clang/lib/Format/ |
H A D | TokenAnnotator.h | 61 Current->Children.clear(); 62 for (const auto &Child : Node.Children) { 63 Children.push_back(new AnnotatedLine(Child)); 64 Current->Children.push_back(Children.back()); 72 for (unsigned i = 0, e = Children.size(); i != e; ++i) { 73 delete Children[i]; 77 Current->Children.clear(); 101 SmallVector<AnnotatedLine *, 0> Children; member in class:clang::format::AnnotatedLine
|
H A D | UnwrappedLineFormatter.cpp | 456 for (AnnotatedLine *Child : Tok->Children) 514 LBrace->BlockKind != BK_Block || Previous.Children.size() == 0) 521 Previous.Children[0]->Level * Style.IndentWidth; 524 BlockFormatter->format(Previous.Children, DryRun, AdditionalIndent, 529 if (Previous.Children[0]->First->MustBreakBefore) 533 if (Previous.Children.size() > 1) 541 if (Previous.Children[0]->Last->isTrailingComment()) 547 Previous.Children[0]->Last->TotalLength + State.Column + 2 > 553 *Previous.Children[0]->First, 557 Penalty += formatLine(*Previous.Children[ [all...] |
/external/llvm/tools/llvm-pdbdump/ |
H A D | CompilandDumper.h | 23 void start(const PDBSymbolCompiland &Symbol, bool Children);
|
H A D | CompilandDumper.cpp | 45 void CompilandDumper::start(const PDBSymbolCompiland &Symbol, bool Children) { argument 52 if (!Children)
|
H A D | ClassDefinitionDumper.cpp | 61 auto Children = Class.findAllChildren(); local 62 if (Children->getChildCount() == 0) { 79 while (auto Child = Children->getNext()) {
|
/external/llvm/unittests/ADT/ |
H A D | SCCIteratorTest.cpp | 164 /// Children - Set of nodes which are children of this one and that haven't 166 NodeSubset Children; 170 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {} 175 Children(other.Children) {} 180 other.Children == this->Children; 190 if (Children.count(i)) { 192 Children.DeleteNode(i); 210 if (Children [all...] |
/external/guice/lib/build/ |
H A D | safesax.jar | META-INF/MANIFEST.MF safesax/ safesax/BadXmlException.class BadXmlException.java package safesax safesax.BadXmlException ... |
/external/llvm/lib/CodeGen/ |
H A D | LexicalScopes.cpp | 224 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren(); local 226 for (SmallVectorImpl<LexicalScope *>::const_iterator SI = Children.begin(), 227 SE = Children.end(); 327 if (!Children.empty()) 328 err << std::string(Indent + 2, ' ') << "Children ...\n"; 329 for (unsigned i = 0, e = Children.size(); i != e; ++i) 330 if (Children[i] != this) 331 Children[i]->dump(Indent + 2);
|
/external/llvm/include/llvm/CodeGen/ |
H A D | DIE.h | 68 /// Children - Whether or not this node has children. 72 bool Children; member in class:llvm::DIEAbbrev 79 DIEAbbrev(dwarf::Tag T, bool C) : Tag(T), Children(C), Data() {} 84 bool hasChildren() const { return Children; } 86 void setChildrenFlag(bool hasChild) { Children = hasChild; } 627 /// Children DIEs. 628 IntrusiveBackList<DIE> Children; member in class:llvm::DIE 645 bool hasChildren() const { return !Children.empty(); } 653 return llvm::make_range(Children.begin(), Children [all...] |
H A D | LexicalScopes.h | 64 SmallVectorImpl<LexicalScope *> &getChildren() { return Children; } 68 void addChild(LexicalScope *S) { Children.push_back(S); } 126 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope. member in class:llvm::LexicalScope
|
/external/llvm/include/llvm/Support/ |
H A D | GenericDomTree.h | 72 std::vector<DomTreeNodeBase<NodeT> *> Children; member in class:llvm::DomTreeNodeBase 83 iterator begin() { return Children.begin(); } 84 iterator end() { return Children.end(); } 85 const_iterator begin() const { return Children.begin(); } 86 const_iterator end() const { return Children.end(); } 91 return Children; 99 Children.push_back(C.get()); 103 size_t getNumChildren() const { return Children.size(); } 105 void clearAllChildren() { Children.clear(); } 129 std::find(IDom->Children [all...] |
/external/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DwarfCompileUnit.cpp | 320 SmallVector<DIE *, 8> Children; local 331 createScopeChildrenDIE(Scope, Children); 341 createScopeChildrenDIE(Scope, Children, &ChildScopeCount); 347 Children.push_back( 353 if (Children.size() == ChildScopeCount) { 355 std::make_move_iterator(Children.begin()), 356 std::make_move_iterator(Children.end())); 364 for (auto &I : Children) 548 SmallVectorImpl<DIE *> &Children, 553 Children 547 createScopeChildrenDIE(LexicalScope *Scope, SmallVectorImpl<DIE *> &Children, unsigned *ChildScopeCount) argument 597 SmallVector<DIE *, 8> Children; local [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.jdt.debug_3.6.1.v20100715_r361/ |
H A D | plugin.properties | 19 descriptionSWTComposite=Children
|
/external/webrtc/webrtc/modules/rtp_rtcp/source/ |
H A D | vp8_partition_aggregator.h | 64 enum Children { enum in class:webrtc::PartitionTreeNode
|
/external/llvm/lib/Target/Mips/ |
H A D | MipsOptimizePICCall.cpp | 201 const std::vector<MachineDomTreeNode *> &Children = Node->getChildren(); local 202 WorkList.append(Children.begin(), Children.end());
|