Home
last modified time | relevance | path

Searched refs:Children (Results 1 – 25 of 192) sorted by relevance

12345678

/external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
DBaseTree.cs73 public virtual IList<ITree> Children property in Antlr.Runtime.Tree.BaseTree
92 if ( Children == null )
95 return Children.Count;
174 if ( Children == null || i >= Children.Count ) in GetChild()
177 return Children[i]; in GetChild()
182 foreach ( ITree child in Children ) in GetFirstChildWithType()
211 … if ( childTree != null && this.Children != null && this.Children == childTree.Children ) in AddChild()
218 if ( this.Children != null || childTree == null ) in AddChild()
220 if ( this.Children == null ) in AddChild()
221 this.Children = CreateChildrenList(); in AddChild()
[all …]
DCommonTree.cs94 return Children[0].CharPositionInLine;
135 return Children[0].Line;
253 if ( Children == null ) in SetUnknownTokenBoundaries()
261 foreach (ITree childTree in Children) in SetUnknownTokenBoundaries()
273 if ( Children.Count > 0 ) in SetUnknownTokenBoundaries()
275 ITree firstChild = Children[0]; in SetUnknownTokenBoundaries()
276 ITree lastChild = Children[Children.Count - 1]; in SetUnknownTokenBoundaries()
DAntlrRuntime_BaseTreeDebugView.cs47 public ITree[] Children property in 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);
DParseTree.cs160 for ( int i = 0; Children != null && i < Children.Count; i++ ) in ToStringLeaves()
162 ParseTree t = (ParseTree)Children[i]; in ToStringLeaves()
/external/protobuf/csharp/src/Google.Protobuf/
DFieldMaskTree.cs65 public Dictionary<string, Node> Children { get; } = new Dictionary<string, Node>(); property in Google.Protobuf.FieldMaskTree.Node
117 && node.Children.Count == 0) in AddFieldPath()
124 if (!node.Children.TryGetValue(part, out childNode)) in AddFieldPath()
128 node.Children.Add(part, childNode); in AddFieldPath()
134 node.Children.Clear(); in AddFieldPath()
157 if (root.Children.Count != 0) in ToFieldMask()
172 if (node.Children.Count == 0) in GetFieldPaths()
178 foreach (var entry in node.Children) in GetFieldPaths()
190 if (root.Children.Count == 0) in IntersectFieldPath()
205 && node.Children.Count == 0) in IntersectFieldPath()
[all …]
/external/clang/lib/Rewrite/
DDeltaTree.cpp123 DeltaTreeNode *Children[2*WidthFactor]; member in __anon4c87cf320311::DeltaTreeInteriorNode
126 Children[i]->Destroy(); in ~DeltaTreeInteriorNode()
134 Children[0] = IR.LHS; in DeltaTreeInteriorNode()
135 Children[1] = IR.RHS; in DeltaTreeInteriorNode()
143 return Children[i]; in getChild()
147 return Children[i]; in getChild()
227 if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes)) in DoInsertion()
237 memmove(&IN->Children[i+2], &IN->Children[i+1], in DoInsertion()
238 (e-i)*sizeof(IN->Children[0])); in DoInsertion()
239 IN->Children[i] = InsertRes->LHS; in DoInsertion()
[all …]
DRewriteRope.cpp397 RopePieceBTreeNode *Children[2*WidthFactor]; member in __anon578d07100411::RopePieceBTreeInterior
403 Children[0] = LHS; in RopePieceBTreeInterior()
404 Children[1] = RHS; in RopePieceBTreeInterior()
411 Children[i]->Destroy(); in ~RopePieceBTreeInterior()
419 return Children[i]; in getChild()
423 return Children[i]; in getChild()
532 memmove(&Children[i+2], &Children[i+1], in HandleChildPiece()
533 (getNumChildren()-i-1)*sizeof(Children[0])); in HandleChildPiece()
534 Children[i+1] = RHS; in HandleChildPiece()
546 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece()
[all …]
/external/clang/lib/Tooling/
DFileMatchTrie.cpp64 if (Children.empty()) { in insert()
71 Children[Element].Path = Path; in insert()
75 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1); in insert()
103 if (Children.empty()) { in findEquivalent()
111 Children.find(Element); in findEquivalent()
112 if (MatchingChild != Children.end()) { in findEquivalent()
141 if (Children.empty()) { in getAll()
146 It = Children.begin(), E = Children.end(); in getAll()
150 It->getValue().getAll(Results, Children.end()); in getAll()
159 llvm::StringMap<FileMatchTrieNode> Children; member in clang::tooling::FileMatchTrieNode
/external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
DCommonTree.cs87 return Children[0].CharPositionInLine;
114 return Children[0].Line;
195 if (Children == null) { in SetUnknownTokenBoundaries()
201 for (int i = 0; i < Children.Count; i++) { in SetUnknownTokenBoundaries()
202 ((CommonTree)Children[i]).SetUnknownTokenBoundaries(); in SetUnknownTokenBoundaries()
206 if (Children.Count > 0) { in SetUnknownTokenBoundaries()
207 CommonTree firstChild = (CommonTree)Children[0]; in SetUnknownTokenBoundaries()
208 CommonTree lastChild = (CommonTree)Children[Children.Count - 1]; in SetUnknownTokenBoundaries()
DParseTree.cs135 for (int i = 0; Children != null && i < Children.Count; i++) { in ToStringLeaves()
136 ParseTree t = (ParseTree)Children[i]; in ToStringLeaves()
/external/clang/lib/Format/
DTokenAnnotator.h61 Current->Children.clear(); in AnnotatedLine()
62 for (const auto &Child : Node.Children) { in AnnotatedLine()
63 Children.push_back(new AnnotatedLine(Child)); in AnnotatedLine()
64 Current->Children.push_back(Children.back()); in AnnotatedLine()
72 for (unsigned i = 0, e = Children.size(); i != e; ++i) { in ~AnnotatedLine()
73 delete Children[i]; in ~AnnotatedLine() local
77 Current->Children.clear(); in ~AnnotatedLine()
109 SmallVector<AnnotatedLine *, 0> Children; variable
DAffectedRangeManager.cpp96 markAllAsAffected((*I)->Children.begin(), (*I)->Children.end()); in markAllAsAffected()
105 computeAffectedLines(Line->Children.begin(), Line->Children.end()); in nonPPLineAffected()
125 if (!Tok->Children.empty() && Tok->Children.front()->Affected) in nonPPLineAffected()
128 IncludeLeadingNewlines = Tok->Children.empty(); in nonPPLineAffected()
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/
DTestGraph.h171 NodeSubset Children; variable
175 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {} in ChildIterator()
180 Children(other.Children) {} in ChildIterator()
185 other.Children == this->Children;
195 if (Children.count(i)) {
197 Children.DeleteNode(i);
215 if (Children.count(i))
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp166 NodeSubset Children; member in llvm::Graph::ChildIterator
170 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {} in ChildIterator()
175 Children(other.Children) {} in ChildIterator()
180 other.Children == this->Children; in operator ==()
190 if (Children.count(i)) { in operator ++()
192 Children.DeleteNode(i); in operator ++()
210 if (Children.count(i)) in operator *()
/external/llvm/include/llvm/Support/
DGenericDomTree.h72 std::vector<DomTreeNodeBase<NodeT> *> Children; variable
83 iterator begin() { return Children.begin(); } in begin()
84 iterator end() { return Children.end(); } in end()
85 const_iterator begin() const { return Children.begin(); } in begin()
86 const_iterator end() const { return Children.end(); } in end()
91 return Children; in getChildren()
99 Children.push_back(C.get()); in addChild()
103 size_t getNumChildren() const { return Children.size(); } in getNumChildren()
105 void clearAllChildren() { Children.clear(); } in clearAllChildren()
129 std::find(IDom->Children.begin(), IDom->Children.end(), this); in setIDom()
[all …]
/external/oj-libjdwp/src/share/classes/com/sun/tools/jdi/
DThreadGroupReferenceImpl.java41 JDWP.ThreadGroupReference.Children kids = null;
108 private JDWP.ThreadGroupReference.Children kids() { in kids()
109 JDWP.ThreadGroupReference.Children kids = null; in kids()
117 kids = JDWP.ThreadGroupReference.Children in kids()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/
DGenericDomTree.h64 std::vector<DomTreeNodeBase *> Children;
76 iterator begin() { return Children.begin(); }
77 iterator end() { return Children.end(); }
78 const_iterator begin() const { return Children.begin(); }
79 const_iterator end() const { return Children.end(); }
85 const std::vector<DomTreeNodeBase *> &getChildren() const { return Children; }
89 Children.push_back(C.get());
93 size_t getNumChildren() const { return Children.size(); }
95 void clearAllChildren() { Children.clear(); }
121 auto I = find(IDom->Children, this);
[all …]
/external/llvm/lib/CodeGen/
DLexicalScopes.cpp223 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren(); in constructScopeNest() local
225 for (SmallVectorImpl<LexicalScope *>::const_iterator SI = Children.begin(), in constructScopeNest()
226 SE = Children.end(); in constructScopeNest()
326 if (!Children.empty()) in dump()
328 for (unsigned i = 0, e = Children.size(); i != e; ++i) in dump()
329 if (Children[i] != this) in dump()
330 Children[i]->dump(Indent + 2); in dump()
/external/llvm/include/llvm/CodeGen/
DDIE.h71 bool Children; variable
78 DIEAbbrev(dwarf::Tag T, bool C) : Tag(T), Children(C), Data() {} in DIEAbbrev()
83 bool hasChildren() const { return Children; } in hasChildren()
85 void setChildrenFlag(bool hasChild) { Children = hasChild; } in setChildrenFlag()
609 IntrusiveBackList<DIE> Children; variable
626 bool hasChildren() const { return !Children.empty(); } in hasChildren()
634 return llvm::make_range(Children.begin(), Children.end()); in children()
637 return llvm::make_range(Children.begin(), Children.end()); in children()
664 Children.push_back(*Child); in addChild()
665 return Children.back(); in addChild()
/external/llvm/lib/CodeGen/AsmPrinter/
DDwarfCompileUnit.cpp333 SmallVector<DIE *, 8> Children; in constructScopeDIE() local
344 createScopeChildrenDIE(Scope, Children); in constructScopeDIE()
354 createScopeChildrenDIE(Scope, Children, &ChildScopeCount); in constructScopeDIE()
360 Children.push_back( in constructScopeDIE()
366 if (Children.size() == ChildScopeCount) { in constructScopeDIE()
368 std::make_move_iterator(Children.begin()), in constructScopeDIE()
369 std::make_move_iterator(Children.end())); in constructScopeDIE()
377 for (auto &I : Children) in constructScopeDIE()
573 SmallVectorImpl<DIE *> &Children, in createScopeChildrenDIE() argument
578 Children.push_back(constructVariableDIE(*DV, *Scope, ObjectPointer)); in createScopeChildrenDIE()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Object/
DWindowsResource.h163 using Children = std::map<T, std::unique_ptr<TreeNode>>;
173 const Children<uint32_t> &getIDChildren() const { return IDChildren; } in getIDChildren()
174 const Children<std::string> &getStringChildren() const { in getStringChildren()
207 Children<uint32_t> IDChildren;
208 Children<std::string> StringChildren;
/external/swiftshader/third_party/subzero/src/
DIceTimerTree.cpp123 if (Nodes[Parent].Children.size() <= ID) in getChildIndex()
124 Nodes[Parent].Children.resize(ID + 1); in getChildIndex()
125 if (Nodes[Parent].Children[ID] == 0) { in getChildIndex()
127 Nodes[Parent].Children[ID] = Size; in getChildIndex()
132 return Nodes[Parent].Children[ID]; in getChildIndex()
171 assert(Nodes[Nodes[StackTop].Parent].Children[ID] == StackTop); in pop()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
DLexicalScopes.cpp240 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren(); in constructScopeNest() local
242 for (auto &ChildScope : Children) in constructScopeNest()
332 if (!Children.empty()) in dump()
334 for (unsigned i = 0, e = Children.size(); i != e; ++i) in dump()
335 if (Children[i] != this) in dump()
336 Children[i]->dump(Indent + 2); in dump()
/external/swiftshader/third_party/llvm-7.0/llvm/test/DebugInfo/NVPTX/
Ddebug-info.ll1591 ; CHECK: // .b8 0 // End Of Children Mark
1612 ; CHECK: // .b8 0 // End Of Children Mark
1652 ; CHECK: // .b8 0 // End Of Children Mark
1686 ; CHECK: // .b8 0 // End Of Children Mark
1709 ; CHECK: // .b8 0 // End Of Children Mark
1734 ; CHECK: / .b8 0 // End Of Children Mark
1757 ; CHECK: / .b8 0 // End Of Children Mark
1785 ; CHECK: // .b8 0 // End Of Children Mark
1810 ; CHECK: // .b8 0 // End Of Children Mark
1833 ; CHECK: // .b8 0 // End Of Children Mark
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/AsmPrinter/
DDwarfCompileUnit.cpp362 SmallVector<DIE *, 8> Children; in constructScopeDIE() local
373 createScopeChildrenDIE(Scope, Children); in constructScopeDIE()
383 createScopeChildrenDIE(Scope, Children, &HasNonScopeChildren); in constructScopeDIE()
389 std::make_move_iterator(Children.begin()), in constructScopeDIE()
390 std::make_move_iterator(Children.end())); in constructScopeDIE()
398 for (auto &I : Children) in constructScopeDIE()
676 SmallVectorImpl<DIE *> &Children, in createScopeChildrenDIE() argument
678 assert(Children.empty()); in createScopeChildrenDIE()
684 Children.push_back(constructVariableDIE(*DV.second, *Scope, ObjectPointer)); in createScopeChildrenDIE()
689 Children.push_back(constructVariableDIE(*DV, *Scope, ObjectPointer)); in createScopeChildrenDIE()
[all …]

12345678