95       for (auto& node : *v) {  in SortByPeriod()
96         if (!node->children.empty()) {  in SortByPeriod()
97           queue.push(&node->children);  in SortByPeriod()
106     for (auto& node : nodes) {  in FindMatchingNode()
107       if (is_same_sample(node->chain.front(), sample)) {  in FindMatchingNode()
108         return node.get();  in FindMatchingNode()
114   size_t GetMatchingLengthInNode(NodeT* node, const std::vector<EntryT*>& chain, size_t chain_start,  in GetMatchingLengthInNode()
117     for (i = 0, j = chain_start; i < node->chain.size() && j < chain.size(); ++i, ++j) {  in GetMatchingLengthInNode()
118       if (!is_same_sample(node->chain[i], chain[j])) {  in GetMatchingLengthInNode()
138     std::unique_ptr<NodeT> node(new NodeT);  in AllocateNode()
140       node->chain.push_back(chain[i]);  in AllocateNode()
142     node->period = period;  in AllocateNode()
143     node->children_period = children_period;  in AllocateNode()
144     return node;  in AllocateNode()