100       auto It = std::find_if(N->Children.begin(), N->Children.end(),  in insert()
102       if (It == N->Children.end()) {  in insert()
103         It = N->Children.insert(It, std::make_unique<Node>(Label, N));  in insert()
190     auto CollectChildren = [&SiblingTracker, &AllNodes](const auto &Children) {  in dumpIndex()  argument
191       for (std::size_t Index = 0; Index < Children.size(); Index++) {  in dumpIndex()
192         const std::unique_ptr<Node> &Child = Children[Index];  in dumpIndex()
194         if (Index != Children.size() - 1)  in dumpIndex()
198     CollectChildren(Root->Children);  in dumpIndex()
226       const bool HasChildren = N->Children.size() != 0;  in dumpIndex()
241               ChildrenOffset{N->Children[0].get(), Bytes.size(), true});  in dumpIndex()
258               ChildrenOffset{N->Children[0].get(), Bytes.size() - 1, false});  in dumpIndex()
263       CollectChildren(N->Children);  in dumpIndex()
298     for (const std::unique_ptr<Node> &Child : N->Children) {  in collectKeys()
310     for (auto &&Child : N->Children) {  in compact()
313     if (N->Parent && N->Parent->Children.size() == 1 && !N->Parent->Value &&  in compact()
317       N->Parent->Children = std::move(N->Children);  in compact()
318       for (std::unique_ptr<Node> &c : N->Parent->Children) {  in compact()
327     std::vector<std::unique_ptr<Node>> Children;  member