Impl

Instance Constructors

new Impl()

Type Members

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

Definition Classes
SingleNode
type PinAux[~ <: Sys[~]] = BiPin[~, E[~]]

Attributes
protected

Abstract Value Members

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

Definition Classes
BiPin
abstract def targets: Targets[S]

Attributes
protected
Definition Classes
Node
abstract def tpe: Type

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

Attributes
protected

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
final def add(key: LongObj[S], value: A)(implicit tx: S.Tx): Unit

Definition Classes
Impl → Modifiable
final def asInstanceOf[T0]: T0

Definition Classes
Any
final def at(time: Long)(implicit tx: S.Tx): Option[Entry[S, A]]

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.
time
the query time point
returns
an element for the given time point, if it exists, otherwise None

Definition Classes
Impl → BiPin
final def attr(implicit tx: S.Tx): AttrMap[S]

Definition Classes
Obj
final def ceil(time: Long)(implicit tx: S.Tx): Option[Entry[S, A]]

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.
time
the query time
returns
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

Definition Classes
Impl → BiPin
object changed extends Changed with Generator[S, Update[S, A]] with Caching

Definition Classes
Impl → SingleNode → 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( ... )
def debugList(implicit tx: S.Tx): List[(Long, A)]

Definition Classes
Impl → BiPin
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]

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.
time
the query time
returns
the time corresponding to the next entry, or None if there is no entry later than the given time

Definition Classes
Impl → BiPin
final def eventBefore(time: Long)(implicit tx: S.Tx): Option[Long]

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.
time
the query time
returns
the time corresponding to the next entry, or None if there is no entry earlier than the given time

Definition Classes
Impl → BiPin
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def floor(time: Long)(implicit tx: S.Tx): Option[Entry[S, A]]

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.
time
the query time
returns
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

Definition Classes
Impl → BiPin
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(time: Long)(implicit tx: S.Tx): Leaf[S, A]

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.
time
the query point
returns
the sequence of elements found along with their time expressions

Definition Classes
Impl → BiPin
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 → BiPin
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def newTree()(implicit tx: S.Tx): Tree[S, A]

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 → BiPin
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def readTree(in: DataInput, access: S.Acc)(implicit tx: S.Tx): Tree[S, A]

Attributes
protected
final def remove(key: LongObj[S], value: 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 valueAt(time: Long)(implicit tx: S.Tx): Option[A]

Definition Classes
Impl → BiPin
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

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

Instance Constructors

new Impl()

Type Members

type A = E[S]

trait Changed extends SingleEvent[S, A]

type PinAux[~ <: Sys[~]] = BiPin[~, E[~]]

Abstract Value Members

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

abstract def targets: Targets[S]

abstract def tpe: Type

abstract def tree: Tree[S, E[S]]

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def add(key: LongObj[S], value: A)(implicit tx: S.Tx): Unit

final def asInstanceOf[T0]: T0

final def at(time: Long)(implicit tx: S.Tx): Option[Entry[S, A]]

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

final def ceil(time: Long)(implicit tx: S.Tx): Option[Entry[S, A]]

object changed extends Changed with Generator[S, Update[S, A]] with Caching

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

def clone(): AnyRef

def debugList(implicit tx: S.Tx): List[(Long, A)]

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]

def finalize(): Unit

final def floor(time: Long)(implicit tx: S.Tx): Option[Entry[S, A]]

final def getClass(): Class[_]

def hashCode(): Int

final def id: S.ID

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

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

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def newTree()(implicit tx: S.Tx): Tree[S, A]

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

final def notify(): Unit

final def notifyAll(): Unit

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

final def remove(key: LongObj[S], value: A)(implicit tx: S.Tx): Boolean

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

def toString(): String

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

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]]]

Inherited from Node[S]

Inherited from Modifiable[S, E[S]]

Inherited from BiPin[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]]]

Inherited from Disposable[S.Tx]

Inherited from Writable

Inherited from AnyRef

Inherited from Any

Ungrouped