BiPin

Type Members

final type Elem = BiExpr[S, A]

Attributes
protected

Abstract Value Members

abstract def at(time: Long)(implicit tx: S.Tx): Option[Elem]

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
abstract def ceil(time: Long)(implicit tx: S.Tx): Option[Elem]

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
abstract def changed: EventLike[S, Update[S, A]]
abstract def debugList()(implicit tx: S.Tx): List[(Long, A)]
abstract def dispose()(implicit tx: S.Tx): Unit

Definition Classes
Disposable
abstract def floor(time: Long)(implicit tx: S.Tx): Option[Elem]

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
abstract 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
abstract def modifiableOption: Option[Modifiable[S, A]]
abstract def nearestEventAfter(time: Long)(implicit tx: S.Tx): Option[Long]

Finds the entry with the smallest time which is greater than _or equal_ to the query time.
Finds the entry with the smallest time which is greater than _or equal_ to the query time.
time
the query time
returns
the time corresponding to the next entry, or None if there is no entry at or later than the given time
abstract def valueAt(time: Long)(implicit tx: S.Tx): Option[A]
abstract def write(out: DataOutput): Unit

Definition Classes
Writable

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 asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
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
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
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( ... )

sealed trait BiPin[S <: Sys[S], A] extends Writable with Disposable[bitemp.BiPin.S.Tx]

Type Members

final type Elem = BiExpr[S, A]

Abstract Value Members

abstract def at(time: Long)(implicit tx: S.Tx): Option[Elem]

abstract def ceil(time: Long)(implicit tx: S.Tx): Option[Elem]

abstract def changed: EventLike[S, Update[S, A]]

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

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

abstract def floor(time: Long)(implicit tx: S.Tx): Option[Elem]

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

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

abstract def nearestEventAfter(time: Long)(implicit tx: S.Tx): Option[Long]

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

abstract def write(out: DataOutput): Unit

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 asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Disposable[S.Tx]

Inherited from Writable

Inherited from AnyRef

Inherited from Any

Ungrouped