intervaltree
intervaltree copied to clipboard
chaimleib
A mutable, self-balancing interval tree. Queries may be by point, by range overlap, or by range containment.
Hey could someone suggest what is the recommended approach to find if there are any overlapping ranges in a tree that has already been populated?
I love this library. I use it A LOT! One function I would love to have on an IntervalTree is `remove_overlaps`. This would remove anyway interval within the tree that...
a list of tuples: [(1234, 4)] def calc_aln_length( aln_intervals: list[tuple] ) -> int: itree = IntervalTree.from_tuples(aln_intervals) produces this error: ValueError: IntervalTree: Null Interval objects not allowed in IntervalTree: Interval(1234, 4)...
Reproduction ```python from intervaltree import IntervalTree intervals = [ [478019, 486075], [478041, 483497], [478215, 486619], [478416, 488227], [479107, 483366], [479112, 488300], [479867, 489663], [481266, 490406], [482870, 485066], [483050, 487543], [484692,...
It would be great if both the range value type and mapped value type could be annotated with type annotations, e.g.: ``` @dataclass class Foo: a: int b: str tree...
The chop datafunc has access to the old interval and whether it is a lower or upper chop, but it does not have access to the requested chop interval. This...
Greetings dear developers, I have been using intervaltree for my project which is about biology. But when I use merge_overlaps() method, it merges all intervals that overlap directly or indirectly....
The current merge_neighbors is distance-based, which makes it useful only for the narrow use case of dealing with "sliver" intervals, essentially by merging them into adjacent, longer intervals. A more...
Add support for points within the IntervalTree. These will be implemented as a new Point object.
