Node allocation/deletion routines.
| 682 | |
| 683 | // Node allocation/deletion routines. |
| 684 | static btree_node *init_leaf(btree_node *n, btree_node *parent, |
| 685 | int max_count) { |
| 686 | n->set_parent(parent); |
| 687 | n->set_position(0); |
| 688 | n->set_count(0); |
| 689 | n->set_max_count(max_count); |
| 690 | return n; |
| 691 | } |
| 692 | static btree_node *init_internal(btree_node *n, btree_node *parent) { |
| 693 | init_leaf(n, parent, kNodeValues); |
| 694 | // Set `max_count` to a sentinel value to indicate that this node is |
nothing calls this directly
no test coverage detected