Lines Matching refs:insert_position
939 void split(int insert_position, btree_node *dest, allocator_type *alloc);
1932 void btree_node<P>::split(const int insert_position, btree_node *dest,
1943 if (insert_position == start()) {
1945 } else if (insert_position == kNodeSlots) {
2610 int &insert_position = iter->position_;
2627 (1 + (static_cast<field_type>(insert_position) < kNodeSlots));
2630 if (static_cast<field_type>(insert_position) - to_move >=
2636 insert_position = static_cast<int>(
2637 static_cast<field_type>(insert_position) - to_move);
2638 if (insert_position < node->start()) {
2639 insert_position = insert_position + left->count() + 1;
2658 (1 + (insert_position > node->start()));
2661 if (static_cast<field_type>(insert_position) <=
2666 if (insert_position > node->finish()) {
2667 insert_position = insert_position - node->count() - 1;
2702 node->split(insert_position, split_node, mutable_allocator());
2706 node->split(insert_position, split_node, mutable_allocator());
2709 if (insert_position > node->finish()) {
2710 insert_position = insert_position - node->count() - 1;