53 struct TrieNode; // Forward declaration.
56   TrieEdge(StringRef s, TrieNode *node) : _subString(s), _child(node) {}  in TrieEdge()
59   struct TrieNode   *_child;
78 struct TrieNode {  struct
81   TrieNode(StringRef s)  in TrieNode()  function
84   ~TrieNode() = default;
87                  std::vector<TrieNode *> &allNodes);
90                        std::vector<TrieNode *> &allNodes);
1259 void TrieNode::addSymbol(const Export& entry,  in addSymbol()
1261                          std::vector<TrieNode*> &allNodes) {  in addSymbol()
1276         auto *bNode = new (allocator) TrieNode(bNodeStr);  in addSymbol()
1278         TrieNode* cNode = edge._child;  in addSymbol()
1303   auto *newNode = new (allocator) TrieNode(entry.name.copy(allocator));  in addSymbol()
1319 void TrieNode::addOrderedNodes(const Export& entry,  in addOrderedNodes()
1320                                std::vector<TrieNode*> &orderedNodes) {  in addOrderedNodes()
1337 bool TrieNode::updateOffset(uint32_t& offset) {  in updateOffset()
1369 void TrieNode::appendToByteBuffer(ByteBuffer &out) {  in appendToByteBuffer()
1434   auto *rootNode = new (allocator) TrieNode(StringRef());  in buildExportTrie()
1435   std::vector<TrieNode*> allNodes;  in buildExportTrie()
1442   std::vector<TrieNode*> orderedNodes;  in buildExportTrie()
1454     for (TrieNode* node : orderedNodes) {  in buildExportTrie()
1461   for (TrieNode* node : orderedNodes) {  in buildExportTrie()