abstract class Impl[S <: Sys[S], E[~ <: Sys[~]] <: Elem[~]] extends Modifiable[S, E[S]] with SingleNode[S, Update[S, E[S]]]
- Self Type
- Impl[S, E]
- Alphabetic
- By Inheritance
- Impl
- SingleNode
- Node
- Modifiable
- BiGroup
- Obj
- Mutable
- Identifiable
- Elem
- Publisher
- Disposable
- Writable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new Impl()
Type Members
Abstract Value Members
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
add(span: SpanLikeObj[S], elem: A)(implicit tx: S.Tx): Entry[S, A]
- Definition Classes
- Impl → Modifiable
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
final
def
attr(implicit tx: S.Tx): AttrMap[S]
- Definition Classes
- Obj
-
final
def
clear()(implicit tx: S.Tx): Unit
- Definition Classes
- Impl → Modifiable
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- final def debugList(implicit tx: S.Tx): List[(SpanLike, A)]
- final def debugPrint(implicit tx: S.Tx): String
-
final
def
dispose()(implicit tx: S.Tx): Unit
- Definition Classes
- Node → Disposable
-
final
def
disposeData()(implicit tx: S.Tx): Unit
- Attributes
- protected
- Definition Classes
- Impl → Node
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- Identifiable → AnyRef → Any
-
final
def
eventAfter(time: Long)(implicit tx: S.Tx): Option[Long]
Queries the closest event (an element's span starting or stopping) later than the given time
-
final
def
eventBefore(time: Long)(implicit tx: S.Tx): Option[Long]
Queries the closest event (an element's span starting or stopping) earlier than the given time
-
final
def
eventsAt(time: Long)(implicit tx: S.Tx): (Iterator[Leaf[S, A]], Iterator[Leaf[S, A]])
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
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
firstEvent(implicit tx: S.Tx): Option[Long]
Finds the first occurring event, if there is any.
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- Identifiable → AnyRef → Any
-
final
def
id: S.ID
- Definition Classes
- Node → Identifiable
-
final
def
intersect(span: SpanLike)(implicit tx: S.Tx): Iterator[Leaf[S, A]]
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
-
final
def
intersect(time: Long)(implicit tx: S.Tx): Iterator[Leaf[S, A]]
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
-
final
def
isEmpty(implicit tx: S.Tx): Boolean
Returns
trueif not a single element is contained in the collection. -
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def iterator(implicit tx: S.Tx): Iterator[Leaf[S, A]]
-
final
def
lastEvent(implicit tx: S.Tx): Option[Long]
Finds the last occurring event, if there is any.
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
newTree()(implicit tx: S.Tx): TreeImpl[S, E]
- Attributes
- protected
-
final
def
nonEmpty(implicit tx: S.Tx): Boolean
Returns
trueif at least one element is contained in the collection. -
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- implicit final def pointView: (Leaf[S, A], S.Tx) ⇒ LongPoint2DLike
-
final
def
rangeSearch(start: SpanLike, stop: SpanLike)(implicit tx: S.Tx): Iterator[Leaf[S, A]]
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
-
final
def
readTree(in: DataInput, access: S.Acc)(implicit tx: S.Tx): TreeImpl[S, E]
- Attributes
- protected
-
final
def
remove(span: SpanLikeObj[S], elem: A)(implicit tx: S.Tx): Boolean
- Definition Classes
- Impl → Modifiable
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- Node → AnyRef → Any
- final def treeHandle: TreeImpl[S, E]
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
write(out: DataOutput): Unit
- Definition Classes
- Node → Writable
-
final
def
writeData(out: DataOutput): Unit
- Attributes
- protected
- Definition Classes
- Impl → Node
-
object
changed
extends Changed with Generator[S, Update[S, A]] with Caching
- Definition Classes
- Impl → SingleNode → Modifiable → Publisher