97       for (auto& node : *v) {  in SortByPeriod()
98         if (!node->children.empty()) {  in SortByPeriod()
99           queue.push(&node->children);  in SortByPeriod()
109     for (auto& node : nodes) {  in FindMatchingNode()
110       if (is_same_sample(node->chain.front(), sample)) {  in FindMatchingNode()
111         return node.get();  in FindMatchingNode()
118       NodeT* node, const std::vector<EntryT*>& chain, size_t chain_start,  in GetMatchingLengthInNode()
121     for (i = 0, j = chain_start; i < node->chain.size() && j < chain.size();  in GetMatchingLengthInNode()
123       if (!is_same_sample(node->chain[i], chain[j])) {  in GetMatchingLengthInNode()
144     std::unique_ptr<NodeT> node(new NodeT);  in AllocateNode()
146       node->chain.push_back(chain[i]);  in AllocateNode()
148     node->period = period;  in AllocateNode()
149     node->children_period = children_period;  in AllocateNode()
150     return node;  in AllocateNode()