Queries the element valid for the given point in time.
Queries the element valid for the given point in time.
Unlike, intersect
, if there are multiple elements sharing
the same point in time, this returns the most recently added element.
We propose that this should be the unambiguous way to evaluate
the BiPin
for a given moment in time.
the query time point
an element for the given time point, if it exists, otherwise None
Finds the entry at the given time, or the closest entry after the given time.
Finds the entry at the given time, or the closest entry after the given time.
the query time
the entry nearest in time to the query time, but not earlier than the
query time, or None
if there is no entry at such time
Finds the entry with the smallest time which is greater than the query time.
Finds the entry with the smallest time which is greater than the query time.
the query time
the time corresponding to the next entry, or None
if there is no entry
later than the given time
Finds the entry with the greatest time which is less than the query time.
Finds the entry with the greatest time which is less than the query time.
the query time
the time corresponding to the next entry, or None
if there is no entry
earlier than the given time
Finds the entry at the given time, or the closest entry before the given time.
Finds the entry at the given time, or the closest entry before the given time.
the query time
the entry nearest in time to the query time, but not later than the
query time, or None
if there is no entry at such time
Queries all elements which are found at a given point in time.
Queries all elements which are found at a given point in time. There may be multiple time expressions which are not equal but evaluate to the same moment in time. It is thus possible that for a given point, multiple elements are found.
the query point
the sequence of elements found along with their time expressions
Returns true
if not a single element is contained in the collection.
Returns true
if at least one element is contained in the collection.