| 587 | } |
| 588 | |
| 589 | size_t removeAll(SimpleBTree& db, List<int> keys) { |
| 590 | size_t totalRemoved = 0; |
| 591 | Set<int> removed; |
| 592 | for (int k : keys) { |
| 593 | if (db.remove(k)) { |
| 594 | EXPECT_FALSE(removed.contains(k)); |
| 595 | removed.add(k); |
| 596 | ++totalRemoved; |
| 597 | } |
| 598 | } |
| 599 | return totalRemoved; |
| 600 | } |
| 601 | |
| 602 | void testBTree(size_t maxIndexSize, size_t maxLeafSize) { |
| 603 | srand(time(0)); |