interval-tree | Interval Tree This is an implementation of an interval tree

interval-tree is a Python library. interval-tree has no bugs, it has no vulnerabilities and it has low support. However interval-tree build file is not available. You can download it from GitHub.

Interval Tree This is an implementation of an interval tree in python. There's an excellent tutorial on Interval trees in the links mentioned at the end of this page. An excerpt from Wikipedia is included below. Usage: python interface.py sample_data.csv. An interval tree is a tree data structure to hold intervals. It allows one to efficiently find all intervals that overlap with any given interval or point. The trivial solution is to visit each interval and test whether it intersects the given point or interval, which requires O(n) time, where n is the number of intervals in the collection. Since a query may return all intervals, for example if the query is a large interval intersecting all intervals in the collection, this is asymptotically optimal; however, we can do better by considering output-sensitive algorithms, where the runtime is expressed in terms of m, the number of intervals produced by the query. Interval trees have a query time of O(log n + m) and an initial creation time of O(n log n), while limiting memory consumption to O(n).