| 29 | |
| 30 | |
| 31 | def test_insert(): |
| 32 | tree = IntervalTree() |
| 33 | |
| 34 | tree[0:1] = "data" |
| 35 | assert len(tree) == 1 |
| 36 | assert tree.items() == set([Interval(0, 1, "data")]) |
| 37 | |
| 38 | tree.add(Interval(10, 20)) |
| 39 | assert len(tree) == 2 |
| 40 | assert tree.items() == set([Interval(0, 1, "data"), Interval(10, 20)]) |
| 41 | |
| 42 | tree.addi(19.9, 20) |
| 43 | assert len(tree) == 3 |
| 44 | assert tree.items() == set([ |
| 45 | Interval(0, 1, "data"), |
| 46 | Interval(19.9, 20), |
| 47 | Interval(10, 20), |
| 48 | ]) |
| 49 | |
| 50 | tree.update([Interval(19.9, 20.1), Interval(20.1, 30)]) |
| 51 | assert len(tree) == 5 |
| 52 | assert tree.items() == set([ |
| 53 | Interval(0, 1, "data"), |
| 54 | Interval(19.9, 20), |
| 55 | Interval(10, 20), |
| 56 | Interval(19.9, 20.1), |
| 57 | Interval(20.1, 30), |
| 58 | ]) |
| 59 | |
| 60 | |
| 61 | def test_duplicate_insert(): |