intervaltree_quickstart_point_and_range_queries.py

1from intervaltree import Interval, IntervalTree
2
3# Create an empty interval tree
4tree = IntervalTree()
5
6# Add some intervals
7tree[1:2] = "Interval A"
8tree[4:7] = "Interval B"
9tree[5:9] = "Interval C"
10
11# Add intervals using the add() method
12tree.add(Interval(10, 15, "Interval D"))
13
14# Search for intervals overlapping a point
15print(tree[6])
16# Output: {Interval(4, 7, 'Interval B'), Interval(5, 9, 'Interval C')}
17
18# Search for intervals overlapping a range
19print(tree[2:5])
20# Output: {Interval(4, 7, 'Interval B')}
21
22# Remove an interval
23tree.remove(Interval(1, 2, "Interval A"))
24
25# Verify the length
26print(len(tree))
27# Output: 3