Insert keys one by one checking invariants and membership as we go.
(t, keys)
| 271 | |
| 272 | |
| 273 | def test_tree(t, keys): |
| 274 | "Insert keys one by one checking invariants and membership as we go." |
| 275 | assert t.check_invariants() |
| 276 | for i, key in enumerate(keys): |
| 277 | for key2 in keys[:i]: |
| 278 | assert t.nil != t.search(key2) |
| 279 | for key2 in keys[i:]: |
| 280 | assert (t.nil == t.search(key2)) ^ (key2 in keys[:i]) |
| 281 | t.insert_key(key) |
| 282 | assert t.check_invariants() |
| 283 | |
| 284 | |
| 285 | if '__main__' == __name__: |
no test coverage detected