| 402 | */ |
| 403 | template <typename Key> |
| 404 | static Radix::Node<Key> *find(Radix::Node<Key> *node, Key key) |
| 405 | { |
| 406 | while (true) |
| 407 | { |
| 408 | if (node == nullptr) |
| 409 | return nullptr; |
| 410 | if (!node->inner) |
| 411 | return (node->key == key? node: nullptr); |
| 412 | unsigned idx = index(node, key); |
| 413 | node = node->child[idx]; |
| 414 | } |
| 415 | } |
| 416 | |
| 417 | /* |
| 418 | * Find any leaf node matching (key & leaf->key) == 0. |