trait Timeline[T <: Txn[T]] extends BiGroup[T, Obj[T]]
- Alphabetic
- By Inheritance
- Timeline
- BiGroup
- Obj
- Mutable
- Identified
- Elem
- Publisher
- Disposable
- Writable
- Form
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def changed: EventLike[T, Update[T, Obj[T], Timeline[T]]]
- abstract def debugList(implicit tx: T): List[(SpanLike, Obj[T])]
- Definition Classes
- BiGroup
- abstract def debugPrint(implicit tx: T): String
- Definition Classes
- BiGroup
- abstract def dispose()(implicit tx: T): Unit
- Definition Classes
- Disposable
- abstract def eventAfter(time: Long)(implicit tx: T): Option[Long]
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
- 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
- Definition Classes
- BiGroup
- abstract def eventBefore(time: Long)(implicit tx: T): Option[Long]
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
- 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
- Definition Classes
- BiGroup
- abstract def eventsAt(time: Long)(implicit tx: T): (Iterator[Leaf[T, Obj[T]]], Iterator[Leaf[T, Obj[T]]])
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.
- 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
- Definition Classes
- BiGroup
- abstract def firstEvent(implicit tx: T): Option[Long]
Finds the first occurring event, if there is any.
Finds the first occurring event, if there is any. Ignores objects with
Span.All.- Definition Classes
- BiGroup
- abstract def get(span: SpanLike)(implicit tx: T): IndexedSeq[Entry[T, Obj[T]]]
Finds the leaf for a given span value (if it exists).
Finds the leaf for a given span value (if it exists).
- Definition Classes
- BiGroup
- abstract def id: Ident[T]
- Definition Classes
- Identified
- abstract def intersect(span: SpanLike)(implicit tx: T): Iterator[Leaf[T, Obj[T]]]
Queries all elements intersecting a given time span.
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.
- 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
- Definition Classes
- BiGroup
- abstract def intersect(time: Long)(implicit tx: T): Iterator[Leaf[T, Obj[T]]]
Queries all elements intersecting a given point in 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.
- time
the point in time to search at
- returns
a (possibly empty) iterator of the intersecting elements
- Definition Classes
- BiGroup
- abstract def isEmpty(implicit tx: T): Boolean
Returns
trueif not a single element is contained in the collection.Returns
trueif not a single element is contained in the collection.- Definition Classes
- BiGroup
- abstract def iterator(implicit tx: T): Iterator[Leaf[T, Obj[T]]]
- Definition Classes
- BiGroup
- abstract def lastEvent(implicit tx: T): Option[Long]
Finds the last occurring event, if there is any.
Finds the last occurring event, if there is any. Ignores objects with
Span.All.- Definition Classes
- BiGroup
- abstract def modifiableOption: Option[Modifiable[T]]
- abstract def nonEmpty(implicit tx: T): Boolean
Returns
trueif at least one element is contained in the collection.Returns
trueif at least one element is contained in the collection.- Definition Classes
- BiGroup
- abstract def rangeSearch(start: SpanLike, stop: SpanLike)(implicit tx: T): Iterator[Leaf[T, Obj[T]]]
Performs a range query according to separate intervals for the allowed start and stop positions of the element spans.
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, usestart = Span.until( 10 ), stop = Span.from( 20 ).This methods makes no guarantees about the ordering of the returned iterator.
- 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
- Definition Classes
- BiGroup
- abstract def recoverSpan(span: SpanLike, elem: Obj[T])(implicit tx: T): Option[SpanLikeObj[T]]
Tries to recover the actual object of an element's position, given only an evaluated span.
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.
- Definition Classes
- BiGroup
- abstract def tpe: Type
- abstract def write(out: DataOutput): Unit
- Definition Classes
- Writable
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- final def attr(implicit tx: T): AttrMap[T]
- Definition Classes
- Obj
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
- Definition Classes
- Identified → AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- Identified → AnyRef → Any
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- Obj → AnyRef → Any
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated