Impl

Instance Constructors

new Impl()

Type Members

type A = E[S]
trait Changed extends SingleEvent[S, A]

Definition Classes
SingleNode
type GroupAux[~ <: Sys[~]] = BiGroup[~, E[~]]

Attributes
protected

Abstract Value Members

abstract def modifiableOption: Option[Modifiable[S, E[S]]]

Definition Classes
BiGroup
abstract def targets: Targets[S]

Attributes
protected
Definition Classes
Node
abstract def tpe: Type

Definition Classes
Obj → Elem
abstract def tree: TreeImpl[S, E]

Attributes
protected

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: (Impl.this)#A)(implicit tx: S.Tx): Entry[S, (Impl.this)#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
object changed extends (Impl.this)#Changed with Generator[S, Update[S, (Impl.this)#A, Repr]] with Caching

Definition Classes
Impl → SingleNode → Modifiable → Publisher
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, (Impl.this)#A)]

Definition Classes
Impl → BiGroup
final def debugPrint(implicit tx: S.Tx): String

Definition Classes
Impl → BiGroup
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
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 None if there are no events after the query time

Definition Classes
Impl → BiGroup
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
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 None if there are no events before the query time

Definition Classes
Impl → BiGroup
final def eventsAt(time: Long)(implicit tx: S.Tx): (Iterator[Leaf[S, (Impl.this)#A]], Iterator[Leaf[S, (Impl.this)#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

Definition Classes
Impl → BiGroup
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.
Finds the first occurring event, if there is any. Ignores objects with Span.All.

Definition Classes
Impl → BiGroup
final def get(spanVal: SpanLike)(implicit tx: S.Tx): IndexedSeq[Entry[S, (Impl.this)#A]]

Finds the leaf for a given span value (if it exists).
Finds the leaf for a given span value (if it exists).

Definition Classes
Impl → BiGroup
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, (Impl.this)#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

Definition Classes
Impl → BiGroup
final def intersect(time: Long)(implicit tx: S.Tx): Iterator[Leaf[S, (Impl.this)#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

Definition Classes
Impl → BiGroup
final def isEmpty(implicit tx: S.Tx): Boolean

Returns true if not a single element is contained in the collection.
Returns true if not a single element is contained in the collection.

Definition Classes
Impl → BiGroup
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def iterator(implicit tx: S.Tx): Iterator[Leaf[S, (Impl.this)#A]]

Definition Classes
Impl → BiGroup
final def lastEvent(implicit tx: S.Tx): 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
Impl → BiGroup
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 true if at least one element is contained in the collection.
Returns true if at least one element is contained in the collection.

Definition Classes
Impl → BiGroup
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
implicit final def pointView: (Leaf[S, (Impl.this)#A], S.Tx) ⇒ LongPoint2DLike
final def rangeSearch(start: SpanLike, stop: SpanLike)(implicit tx: S.Tx): Iterator[Leaf[S, (Impl.this)#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, use start = 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
Impl → BiGroup
final def readTree(in: DataInput, access: S.Acc)(implicit tx: S.Tx): TreeImpl[S, E]

Attributes
protected
final def recoverSpan(spanVal: SpanLike, elem: (Impl.this)#A)(implicit tx: S.Tx): Option[SpanLikeObj[S]]

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
Impl → BiGroup
final def remove(span: SpanLikeObj[S], elem: (Impl.this)#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

Related Doc: package BiGroupImpl

abstract class Impl[S <: Sys[S], E[~ <: Sys[~]] <: Elem[~], Repr <: Modifiable[S, E[S]]] extends Modifiable[S, E[S]] with SingleNode[S, Update[S, E[S], Repr]]

Instance Constructors

new Impl()

Type Members

type A = E[S]

trait Changed extends SingleEvent[S, A]

type GroupAux[~ <: Sys[~]] = BiGroup[~, E[~]]

Abstract Value Members

abstract def modifiableOption: Option[Modifiable[S, E[S]]]

abstract def targets: Targets[S]

abstract def tpe: Type

abstract def tree: TreeImpl[S, E]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def add(span: SpanLikeObj[S], elem: (Impl.this)#A)(implicit tx: S.Tx): Entry[S, (Impl.this)#A]

final def asInstanceOf[T0]: T0

final def attr(implicit tx: S.Tx): AttrMap[S]

object changed extends (Impl.this)#Changed with Generator[S, Update[S, (Impl.this)#A, Repr]] with Caching

final def clear()(implicit tx: S.Tx): Unit

def clone(): AnyRef

final def debugList(implicit tx: S.Tx): List[(SpanLike, (Impl.this)#A)]

final def debugPrint(implicit tx: S.Tx): String

final def dispose()(implicit tx: S.Tx): Unit

final def disposeData()(implicit tx: S.Tx): Unit

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

final def eventAfter(time: Long)(implicit tx: S.Tx): Option[Long]

final def eventBefore(time: Long)(implicit tx: S.Tx): Option[Long]

final def eventsAt(time: Long)(implicit tx: S.Tx): (Iterator[Leaf[S, (Impl.this)#A]], Iterator[Leaf[S, (Impl.this)#A]])

def finalize(): Unit

final def firstEvent(implicit tx: S.Tx): Option[Long]

final def get(spanVal: SpanLike)(implicit tx: S.Tx): IndexedSeq[Entry[S, (Impl.this)#A]]

final def getClass(): Class[_]

def hashCode(): Int

final def id: S.Id

final def intersect(span: SpanLike)(implicit tx: S.Tx): Iterator[Leaf[S, (Impl.this)#A]]

final def intersect(time: Long)(implicit tx: S.Tx): Iterator[Leaf[S, (Impl.this)#A]]

final def isEmpty(implicit tx: S.Tx): Boolean

final def isInstanceOf[T0]: Boolean

final def iterator(implicit tx: S.Tx): Iterator[Leaf[S, (Impl.this)#A]]

final def lastEvent(implicit tx: S.Tx): Option[Long]

final def ne(arg0: AnyRef): Boolean

final def newTree()(implicit tx: S.Tx): TreeImpl[S, E]

final def nonEmpty(implicit tx: S.Tx): Boolean

final def notify(): Unit

final def notifyAll(): Unit

implicit final def pointView: (Leaf[S, (Impl.this)#A], S.Tx) ⇒ LongPoint2DLike

final def rangeSearch(start: SpanLike, stop: SpanLike)(implicit tx: S.Tx): Iterator[Leaf[S, (Impl.this)#A]]

final def readTree(in: DataInput, access: S.Acc)(implicit tx: S.Tx): TreeImpl[S, E]

final def recoverSpan(spanVal: SpanLike, elem: (Impl.this)#A)(implicit tx: S.Tx): Option[SpanLikeObj[S]]

final def remove(span: SpanLikeObj[S], elem: (Impl.this)#A)(implicit tx: S.Tx): Boolean

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def treeHandle: TreeImpl[S, E]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def write(out: DataOutput): Unit

final def writeData(out: DataOutput): Unit

Inherited from SingleNode[S, Update[S, E[S], Repr]]

Inherited from Node[S]

Inherited from Modifiable[S, E[S]]

Inherited from BiGroup[S, E[S]]

Inherited from Obj[S]

Inherited from Mutable[S.Id, S.Tx]

Inherited from Identifiable[S.Id]

Inherited from Elem[S]

Inherited from Publisher[S, Update[S, E[S], BiGroup[S, E[S]]]]

Inherited from Disposable[S.Tx]

Inherited from Writable

Inherited from AnyRef

Inherited from Any

Ungrouped