Lines Matching defs:Child

399     TreeNode *Child;
406 Child = &Node.addNameChild(NameString, StringTable);
409 Child = &Node.addIDChild(Entry.Identifier.ID);
415 addChildren(*Child, RSR, NextTable, Origin, Context, Duplicates);
429 TreeNode *Child;
433 Origin, Data.size(), Child);
442 Context, InputFilenames[Child->Origin], InputFilenames.back()));
524 auto Child = IDChildren.find(ID);
525 if (Child == IDChildren.end()) {
531 return *(Child->second);
539 auto Child = StringChildren.find(NameString);
540 if (Child == StringChildren.end()) {
547 return *(Child->second);
553 for (auto const &Child : StringChildren) {
554 Child.second->print(Writer, Child.first);
556 for (auto const &Child : IDChildren) {
557 Child.second->print(Writer, to_string(Child.first));
578 for (auto const &Child : StringChildren) {
579 Size += Child.second->getTreeSize();
581 for (auto const &Child : IDChildren) {
582 Size += Child.second->getTreeSize();
593 for (auto &Child : IDChildren)
594 Child.second->shiftDataIndexDown(Index);
595 for (auto &Child : StringChildren)
596 Child.second->shiftDataIndexDown(Index);
899 for (auto const &Child : StringChildren) {
903 StringTableOffsets[Child.second->getStringIndex()]);
904 if (Child.second->checkIsDataNode()) {
907 DataEntriesTreeOrder.push_back(Child.second.get());
911 (Child.second->getStringChildren().size() +
912 Child.second->getIDChildren().size()) *
914 Queue.push(Child.second.get());
919 for (auto const &Child : IDChildren) {
922 Entry->Identifier.ID = Child.first;
923 if (Child.second->checkIsDataNode()) {
926 DataEntriesTreeOrder.push_back(Child.second.get());
930 (Child.second->getStringChildren().size() +
931 Child.second->getIDChildren().size()) *
933 Queue.push(Child.second.get());