- Companion:
- object
Value members
Abstract methods
Inherited methods
Queries the closest event (an element's span starting or stopping) later than the given time
Queries the closest event (an element's span starting or stopping) later than the given time
- Value parameters:
- time
the query time
- Returns:
a time, greater than the query time, at which the next event occurs, or
Noneif there are no events after the query time- Inherited from:
- BiGroup
Queries the closest event (an element's span starting or stopping) earlier than the given time
Queries the closest event (an element's span starting or stopping) earlier than the given time
- Value parameters:
- time
the query time
- Returns:
a time, smaller than the query time, at which the previous event occurs, or
Noneif there are no events before the query time- Inherited from:
- BiGroup
Queries all elements which produce an event (starting or stopping) at a given time.
Queries all elements which produce an event (starting or stopping) at a given time.
- Value parameters:
- time
the time instant for which to gather the events
- Returns:
a tuple of two iterators. the first iterator (
_1) contains the events which start at the query time, the second iterator (_2) contains the event which stop at the query time- Inherited from:
- BiGroup
Finds the first occurring event, if there is any. Ignores objects with Span.All.
Finds the first occurring event, if there is any. Ignores objects with Span.All.
- Inherited from:
- BiGroup
Finds the leaf for a given span value (if it exists).
Finds the leaf for a given span value (if it exists).
- Inherited from:
- BiGroup
Queries all elements intersecting a given time span.
That is, returns an iterator of all elements whose span contains or partly overlaps the query span.
(span start < query.stop && span.stop > query.start)
Queries all elements intersecting a given time span.
That is, returns an iterator of all elements whose span contains or partly overlaps the query span.
(span start < query.stop && span.stop > query.start)
This methods makes no guarantees about the ordering of the returned iterator.
- Value parameters:
- span
the the span to search within (this may be a half-bounded interval or even
Span.All)
- Returns:
a (possibly empty) iterator of the intersecting elements
- Inherited from:
- BiGroup
Queries all elements intersecting a given point in time.
That is, returns an iterator of all elements whose span contains the time point
(span start <= time && span.stop > time)
Queries all elements intersecting a given point in time.
That is, returns an iterator of all elements whose span contains the time point
(span start <= time && span.stop > time)
This methods makes no guarantees about the ordering of the returned iterator.
- Value parameters:
- time
the point in time to search at
- Returns:
a (possibly empty) iterator of the intersecting elements
- Inherited from:
- BiGroup
Returns true if not a single element is contained in the collection.
Returns true if not a single element is contained in the collection.
- Inherited from:
- BiGroup
Finds the last occurring event, if there is any. Ignores objects with Span.All.
Finds the last occurring event, if there is any. Ignores objects with Span.All.
- Inherited from:
- BiGroup
Returns true if at least one element is contained in the collection.
Returns true if at least one element is contained in the collection.
- Inherited from:
- BiGroup
Performs a range query according to separate intervals for the allowed start and stop positions
of the element spans. That is, returns an iterator of all elements whose span satisfies the
constraints given for start and stop positions
(start.contains( elem.span.start ) && stop.contains( elem.span.stop ))
Performs a range query according to separate intervals for the allowed start and stop positions
of the element spans. That is, returns an iterator of all elements whose span satisfies the
constraints given for start and stop positions
(start.contains( elem.span.start ) && stop.contains( elem.span.stop ))
Both for the start and stop constraint, half-bounded or unbounded (Span.All) intervals can be used.
Examples
- to find all elements which start between 10 (inclusive) and 20 (exclusive), use
start = Span( 10, 20 ), stop = Span.All. - to find all elements which start before (<) 10 and stop from (>=) 20, use
start = Span.until( 10 ), stop = Span.from( 20 ).
This methods makes no guarantees about the ordering of the returned iterator.
- Value parameters:
- start
the constraint for the start position of the spans of the elements filtered.
- stop
the constraint for the stop position of the spans of the elements filtered.
- Returns:
a (possibly empty) iterator of the intersecting elements
- Inherited from:
- BiGroup
Tries to recover the actual object of an element's position, given only an evaluated span. The result may for example be used in a subsequent removal of the element.
Tries to recover the actual object of an element's position, given only an evaluated span. The result may for example be used in a subsequent removal of the element.
- Inherited from:
- BiGroup