Home
last modified time | relevance | path

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

12345678910>>...17

/external/llvm-project/clang-tools-extra/unittests/clang-doc/
DMDGeneratorTest.cpp222 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
223 CommentInfo *BlankLine = Top.Children.back().get(); in TEST()
225 BlankLine->Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
226 BlankLine->Children.back()->Kind = "TextComment"; in TEST()
228 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
229 CommentInfo *Brief = Top.Children.back().get(); in TEST()
231 Brief->Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
232 Brief->Children.back()->Kind = "TextComment"; in TEST()
233 Brief->Children.back()->Name = "ParagraphComment"; in TEST()
234 Brief->Children.back()->Text = " Brief description."; in TEST()
[all …]
DBitcodeTest.cpp172 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
173 CommentInfo *BlankLine = Top.Children.back().get(); in TEST()
175 BlankLine->Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
176 BlankLine->Children.back()->Kind = "TextComment"; in TEST()
178 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
179 CommentInfo *Brief = Top.Children.back().get(); in TEST()
181 Brief->Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
182 Brief->Children.back()->Kind = "TextComment"; in TEST()
183 Brief->Children.back()->Name = "ParagraphComment"; in TEST()
184 Brief->Children.back()->Text = " Brief description."; in TEST()
[all …]
DYAMLGeneratorTest.cpp278 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
279 CommentInfo *BlankLine = Top.Children.back().get(); in TEST()
281 BlankLine->Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
282 BlankLine->Children.back()->Kind = "TextComment"; in TEST()
284 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
285 CommentInfo *Brief = Top.Children.back().get(); in TEST()
287 Brief->Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
288 Brief->Children.back()->Kind = "TextComment"; in TEST()
289 Brief->Children.back()->Name = "ParagraphComment"; in TEST()
290 Brief->Children.back()->Text = " Brief description."; in TEST()
[all …]
DGeneratorTest.cpp49 ExpectedIdx.Children.emplace_back(std::move(IndexA)); in TEST()
54 IndexB.Children.emplace_back(std::move(IndexC)); in TEST()
55 ExpectedIdx.Children.emplace_back(std::move(IndexB)); in TEST()
62 IndexE.Children.emplace_back(std::move(IndexF)); in TEST()
63 IndexD.Children.emplace_back(std::move(IndexE)); in TEST()
64 ExpectedIdx.Children.emplace_back(std::move(IndexD)); in TEST()
68 ExpectedIdx.Children.emplace_back(std::move(IndexG)); in TEST()
75 Idx.Children.emplace_back("b"); in TEST()
76 Idx.Children.emplace_back("aA"); in TEST()
77 Idx.Children.emplace_back("aa"); in TEST()
[all …]
/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);
/external/llvm-project/clang/unittests/Tooling/
DASTSelectionTest.cpp93 EXPECT_EQ(Node.Children.size(), NumChildren); in checkNodeImpl()
132 for (const SelectedASTNode &Child : Node.Children) { in childKindVerifier()
162 checkNode<FunctionDecl>(Node->Children[0], in TEST()
169 Node->Children[0].dump(OS); in TEST()
188 Node->Children[0], in TEST()
202 EXPECT_EQ(Node->Children.size(), 1u); in TEST()
204 Node->Children[0], SourceSelectionKind::ContainsSelection, in TEST()
206 checkNode<ParmVarDecl>(Fn.Children[0], in TEST()
209 Fn.Children[1], SourceSelectionKind::InsideSelection, in TEST()
212 Body.Children[0], SourceSelectionKind::InsideSelection, in TEST()
[all …]
/external/llvm-project/clang-tools-extra/clangd/unittests/
DFindSymbolsTests.cpp43 ::testing::Matcher<DocumentSymbol> Children(ChildMatchers... ChildrenM) { in Children() function
377 {AllOf(WithName("Foo"), WithKind(SymbolKind::Class), Children()), in TEST()
379 Children(AllOf(WithName("Foo"), in TEST()
380 WithKind(SymbolKind::Constructor), Children()), in TEST()
382 WithKind(SymbolKind::Constructor), Children()), in TEST()
384 Children()), in TEST()
386 WithKind(SymbolKind::Method), Children()), in TEST()
388 WithKind(SymbolKind::Constructor), Children()), in TEST()
390 Children(AllOf(WithName("f"), in TEST()
392 Children()))))), in TEST()
[all …]
/external/llvm-project/clang-tools-extra/clangd/index/dex/
DIterator.cpp28 : Iterator(Kind::And), Children(std::move(AllChildren)) { in AndIterator()
29 assert(!Children.empty() && "AND iterator should have at least one child."); in AndIterator()
31 for (const auto &Child : Children) in AndIterator()
41 llvm::sort(Children, [](const std::unique_ptr<Iterator> &LHS, in AndIterator()
52 Children.front()->advance(); in advance()
59 Children.front()->advanceTo(ID); in advanceTo()
63 DocID peek() const override { return Children.front()->peek(); } in peek()
68 for (const auto &Child : Children) in consume()
74 return Children.front()->estimateSize(); in estimateSize()
81 for (const auto &Child : Children) { in dump()
[all …]
DIterator.h126 void populateChildren(std::vector<std::unique_ptr<Iterator>> &Children, in populateChildren() argument
128 Children.push_back(move(Head)); in populateChildren()
129 populateChildren(Children, move(Tail)...); in populateChildren()
146 intersect(std::vector<std::unique_ptr<Iterator>> Children) const;
154 unionOf(std::vector<std::unique_ptr<Iterator>> Children) const;
180 std::vector<std::unique_ptr<Iterator>> Children; in intersect() local
181 detail::populateChildren(Children, std::forward<Args>(args)...); in intersect()
182 return intersect(move(Children)); in intersect()
188 std::vector<std::unique_ptr<Iterator>> Children; in unionOf() local
189 detail::populateChildren(Children, std::forward<Args>(args)...); in unionOf()
[all …]
/external/llvm-project/clang-tools-extra/clang-doc/
DHTMLGenerator.cpp87 Children.emplace_back(std::make_unique<TextNode>(Text.str())); in TagNode()
91 std::vector<std::unique_ptr<HTMLNode>> Children; // List of child nodes member
101 std::vector<std::unique_ptr<HTMLNode>> Children; // List of child nodes member
104 for (const auto &C : Children) { in Render()
186 for (const auto &C : Children) in Render()
203 for (const auto &C : Children) { in Render()
207 if (!InlineChildren && (C == Children.back() || in Render()
358 AppendVector(std::move(Nodes), DivBody->Children); in genEnumsBlock()
370 List->Children.emplace_back(std::make_unique<TagNode>(HTMLTag::TAG_LI, M)); in genEnumMembersBlock()
388 AppendVector(std::move(Nodes), DivBody->Children); in genFunctionsBlock()
[all …]
DGenerators.cpp68 auto It = std::find(I->Children.begin(), I->Children.end(), R.USR); in addInfoToIndex()
69 if (It != I->Children.end()) { in addInfoToIndex()
74 I->Children.emplace_back(R.USR, R.Name, R.RefType, R.Path); in addInfoToIndex()
76 I = &I->Children.back(); in addInfoToIndex()
82 auto It = std::find(I->Children.begin(), I->Children.end(), Info->USR); in addInfoToIndex()
83 if (It == I->Children.end()) { in addInfoToIndex()
85 I->Children.emplace_back(Info->USR, Info->extractName(), Info->IT, in addInfoToIndex()
DRepresentation.cpp49 int getChildIndexIfExists(std::vector<T> &Children, T &ChildToMerge) { in getChildIndexIfExists() argument
50 for (unsigned long I = 0; I < Children.size(); I++) { in getChildIndexIfExists()
51 if (ChildToMerge.USR == Children[I].USR) in getChildIndexIfExists()
57 void reduceChildren(std::vector<Reference> &Children, in reduceChildren() argument
60 int mergeIdx = getChildIndexIfExists(Children, ChildToMerge); in reduceChildren()
62 Children.push_back(std::move(ChildToMerge)); in reduceChildren()
65 Children[mergeIdx].merge(std::move(ChildToMerge)); in reduceChildren()
69 void reduceChildren(std::vector<FunctionInfo> &Children, in reduceChildren() argument
72 int mergeIdx = getChildIndexIfExists(Children, ChildToMerge); in reduceChildren()
74 Children.push_back(std::move(ChildToMerge)); in reduceChildren()
[all …]
/external/llvm-project/clang/lib/Tooling/Syntax/
DNodes.cpp112 std::vector<syntax::NameSpecifier *> Children; in getSpecifiers() local
114 Children.push_back(llvm::cast<syntax::NameSpecifier>(Element)); in getSpecifiers()
116 return Children; in getSpecifiers()
123 Children; in getSpecifiersAndDoubleColons() local
125 Children.push_back( in getSpecifiersAndDoubleColons()
129 return Children; in getSpecifiersAndDoubleColons()
134 std::vector<syntax::Expression *> Children; in getArguments() local
136 Children.push_back(llvm::cast<syntax::Expression>(ArgumentAsNode)); in getArguments()
138 return Children; in getArguments()
144 std::vector<syntax::List::ElementAndDelimiter<syntax::Expression>> Children; in getArgumentsAndCommas() local
[all …]
/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 __anon07c1678e0311::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 …]
/external/llvm-project/clang/lib/Rewrite/
DDeltaTree.cpp126 DeltaTreeNode *Children[2*WidthFactor]; member in __anon6aae3e7c0111::DeltaTreeInteriorNode
130 Children[i]->Destroy(); in ~DeltaTreeInteriorNode()
138 Children[0] = IR.LHS; in DeltaTreeInteriorNode()
139 Children[1] = IR.RHS; in DeltaTreeInteriorNode()
147 return Children[i]; in getChild()
152 return Children[i]; in getChild()
232 if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes)) in DoInsertion()
242 memmove(&IN->Children[i+2], &IN->Children[i+1], in DoInsertion()
243 (e-i)*sizeof(IN->Children[0])); in DoInsertion()
244 IN->Children[i] = InsertRes->LHS; in DoInsertion()
[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()
/external/llvm-project/clang/lib/Tooling/
DFileMatchTrie.cpp69 if (Children.empty()) { in insert()
76 Children[Element].Path = Path; in insert()
80 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1); in insert()
109 if (Children.empty()) { in findEquivalent()
121 Children.find(Element); in findEquivalent()
122 if (MatchingChild != Children.end()) { in findEquivalent()
158 if (Children.empty()) { in getAll()
163 It = Children.begin(), E = Children.end(); in getAll()
167 It->getValue().getAll(Results, Children.end()); in getAll()
176 llvm::StringMap<FileMatchTrieNode> Children; member in clang::tooling::FileMatchTrieNode
/external/llvm-project/clang-tools-extra/clangd/support/
DMarkup.cpp223 std::string renderBlocks(llvm::ArrayRef<std::unique_ptr<Block>> Children, in renderBlocks() argument
229 Children = Children.drop_while( in renderBlocks()
232 llvm::reverse(Children), in renderBlocks()
234 Children = Children.drop_back(Children.end() - Last.base()); in renderBlocks()
237 for (const auto &C : Children) { in renderBlocks()
461 Children.clear(); in operator =()
462 for (const auto &C : Other.Children) in operator =()
463 Children.push_back(C->clone()); in operator =()
468 std::move(Other.Children.begin(), Other.Children.end(), in append()
469 std::back_inserter(Children)); in append()
[all …]
/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
/external/llvm-project/clang/lib/Format/
DTokenAnnotator.h62 Current->Children.clear(); in AnnotatedLine()
63 for (const auto &Child : Node.Children) { in AnnotatedLine()
64 Children.push_back(new AnnotatedLine(Child)); in AnnotatedLine()
65 Current->Children.push_back(Children.back()); in AnnotatedLine()
73 for (unsigned i = 0, e = Children.size(); i != e; ++i) { in ~AnnotatedLine()
74 delete Children[i]; in ~AnnotatedLine() local
78 Current->Children.clear(); in ~AnnotatedLine()
125 SmallVector<AnnotatedLine *, 0> Children; variable
/external/llvm-project/clang/include/clang/AST/
DLexicallyOrderedRecursiveASTVisitor.h116 SmallVector<Stmt *, 8> Children(CE->children()); in getStmtChildren()
129 Swap = Children.size() != 2; in getStmtChildren()
135 if (Swap && Children.size() > 1) in getStmtChildren()
136 std::swap(Children[0], Children[1]); in getStmtChildren()
137 return Children; in getStmtChildren()

12345678910>>...17