Lines Matching full:children

49 int getChildIndexIfExists(std::vector<T> &Children, T &ChildToMerge) {
50   for (unsigned long I = 0; I < Children.size(); I++) {
51     if (ChildToMerge.USR == Children[I].USR)
58 void reduceChildren(std::vector<T> &Children,
61     int MergeIdx = getChildIndexIfExists(Children, ChildToMerge);
63       Children.push_back(std::move(ChildToMerge));
66     Children[MergeIdx].merge(std::move(ChildToMerge));
104   if (FirstCI != SecondCI || Children.size() != Other.Children.size())
107   return std::equal(Children.begin(), Children.end(), Other.Children.begin(),
124         Children.begin(), Children.end(), Other.Children.begin(),
125         Other.Children.end(), llvm::deref<std::less<>>());
228   // Reduce children if necessary.
229   reduceChildren(Children.Namespaces, std::move(Other.Children.Namespaces));
230   reduceChildren(Children.Records, std::move(Other.Children.Records));
231   reduceChildren(Children.Functions, std::move(Other.Children.Functions));
232   reduceChildren(Children.Enums, std::move(Other.Children.Enums));
233   reduceChildren(Children.Typedefs, std::move(Other.Children.Typedefs));
253   // Reduce children if necessary.
254   reduceChildren(Children.Records, std::move(Other.Children.Records));
255   reduceChildren(Children.Functions, std::move(Other.Children.Functions));
256   reduceChildren(Children.Enums, std::move(Other.Children.Enums));
257   reduceChildren(Children.Typedefs, std::move(Other.Children.Typedefs));
362   llvm::sort(Children);
363   for (auto &C : Children)