Lines Matching defs:Children
52 /// - If the node has a path 'p2' but no children, take the last path segment
69 if (Children.empty()) {
76 Children[Element].Path = Path;
80 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1);
94 /// - .. have children. In this case it is checked
98 /// - .. a child matching the next path segment. In this case, all children of
99 /// 'n' are an equally good match for 'p'. All children are of 'n' are found
109 if (Children.empty()) {
121 Children.find(Element);
122 if (MatchingChild != Children.end()) {
158 if (Children.empty()) {
163 It = Children.begin(), E = Children.end();
167 It->getValue().getAll(Results, Children.end());
172 // nodes where Children.empty().
175 // The children of this node stored in a map based on the next path segment.
176 llvm::StringMap<FileMatchTrieNode> Children;