Lines Matching refs:children
24 std::unordered_map<char, Node*> children;
35 Node* child = children[label];
37 children[label] = new Node(prefix);
38 return children[label];
51 split_child->children[child_prefix[0]] = child;
52 children[parent_prefix[0]] = split_child;
73 auto it = children.find(path[idx]);
74 if (it == children.end()) {
100 // A node can be a *end* node and have children
112 if (children.size() == 0) {
115 return children['\0'] != nullptr;