Lines Matching defs:node
65 find_child = false; // No need to find matching node in p->children.
94 for (auto& node : *v) {
95 if (!node->children.empty()) {
96 queue.push(&node->children);
106 for (auto& node : nodes) {
107 if (is_same_sample(node->chain.front(), sample)) {
108 return node.get();
115 NodeT* node, const std::vector<EntryT*>& chain, size_t chain_start,
118 for (i = 0, j = chain_start; i < node->chain.size() && j < chain.size();
120 if (!is_same_sample(node->chain[i], chain[j])) {
141 std::unique_ptr<NodeT> node(new NodeT);
143 node->chain.push_back(chain[i]);
145 node->period = period;
146 node->children_period = children_period;
147 return node;