()
| 661 | |
| 662 | |
| 663 | def test_exact_delete(): |
| 664 | N = 8 |
| 665 | b = BTreeDict() |
| 666 | add_keys(b, N) |
| 667 | for key in [5, 0, 7]: |
| 668 | elt = b.get_element(key) |
| 669 | assert elt is not None |
| 670 | bogus_elt = btree.KV(key, False) |
| 671 | with pytest.raises(ValueError): |
| 672 | b.delete_exact(bogus_elt) |
| 673 | b.delete_exact(elt) |
| 674 | with pytest.raises(ValueError): |
| 675 | b.delete_exact(elt) |
| 676 | |
| 677 | |
| 678 | def test_find_nonexistent_node(): |
nothing calls this directly
no test coverage detected
searching dependent graphs…