Skip to main content

​
IntegerRangeSet Objects

class IntegerRangeSet()

​
intersection

def intersection(start: int, end: int) -> Optional[List[Tuple[int, int]]]
Returns a list of overlapping tuples or None. Complexity: O(log N + K) where K is the number of overlapping fragments.

​
remove

def remove(start: int, end: int) -> None
Removes a range, splitting or deleting existing ranges.