| 423 | } |
| 424 | |
| 425 | ByteArray BTreeDatabase::IndexNode::split(IndexNode& right, size_t i) { |
| 426 | ElementList::iterator s = pointers.begin(); |
| 427 | std::advance(s, i - 1); |
| 428 | |
| 429 | right.beginPointer = s->pointer; |
| 430 | ByteArray midKey = s->key; |
| 431 | right.level = level; |
| 432 | ++s; |
| 433 | |
| 434 | right.pointers.insert(right.pointers.begin(), s, pointers.end()); |
| 435 | --s; |
| 436 | |
| 437 | pointers.erase(s, pointers.end()); |
| 438 | |
| 439 | return midKey; |
| 440 | } |
| 441 | |
| 442 | size_t BTreeDatabase::LeafNode::count() const { |
| 443 | return elements.size(); |