RangedSeq
- Companion
- object
Value members
Methods
Finds an element that overlaps a given interval.
An overlap occurs if the intersection between query interval
and found interval is non-empty. In other words, found_start < query_stop && found_stop > query_start.
Of the candidates, returns the one with the lowest start point.
An overlap occurs if the intersection between query interval
and found interval is non-empty. In other words, found_start < query_stop && found_stop > query_start.
Of the candidates, returns the one with the lowest start point.
- Value Params
- interval
-
the query interval
- Returns
-
the element which overlaps the query interval, or
Noneif there is none.
Find an element that contains a given point.
A point is contained in if found_start <= point && found_stop > point.
Elements with empty intervals will thus not be detected (the
A point is contained in if found_start <= point && found_stop > point.
Elements with empty intervals will thus not be detected (the
interval version of this method can)- Value Params
- point
-
the query point
- Returns
-
the element containing the point, or
Noneif such an element does not exist.
Filters the tree to contain only those elements that overlap a given interval.
An overlap occurs if the intersection between query interval
and found interval is non-empty. In other words, found_start < query_stop && found_stop > query_start.
An overlap occurs if the intersection between query interval
and found interval is non-empty. In other words, found_start < query_stop && found_stop > query_start.
- Value Params
- interval
-
the query interval
- Returns
-
the filtered tree whose elements overlap the query interval
Filters the tree to contain only those elements that are completely contained within a given interval.
Containment means that found_start <= query_start &&
Containment means that found_start <= query_start &&
- Value Params
- interval
-
the query interval
- Returns
-
the filtered tree whose elements are contained within the query interval
Filters the tree to contain only those elements that contain a given point.
An element contains the point if its interval start is less than or equal to that point
and its interval stop is greater than that point.
An element contains the point if its interval start is less than or equal to that point
and its interval stop is greater than that point.
- Value Params
- point
-
the intersection point
- Returns
-
the filtered tree having only elements which contain the point