()
| 20 | |
| 21 | |
| 22 | def test_replace(): |
| 23 | N = 8 |
| 24 | b = BTreeDict() |
| 25 | add_keys(b, N) |
| 26 | b[0] = False |
| 27 | b[5] = False |
| 28 | b[7] = False |
| 29 | for key in range(N): |
| 30 | if key in {0, 5, 7}: |
| 31 | assert b[key] == False |
| 32 | else: |
| 33 | assert b[key] == True |
| 34 | |
| 35 | |
| 36 | def test_min_max(): |