Packages

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]
Linear Supertypes
SingleNode[S, Update[S, E[S]]], Node[S], Modifiable[S, E[S]], BiPin[S, E[S]], Obj[S], Mutable[S.ID, S.Tx], Identifiable[S.ID], Elem[S], Publisher[S, Update[S, E[S]]], Disposable[S.Tx], Writable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Impl
  2. SingleNode
  3. Node
  4. Modifiable
  5. BiPin
  6. Obj
  7. Mutable
  8. Identifiable
  9. Elem
  10. Publisher
  11. Disposable
  12. Writable
  13. AnyRef
  14. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Impl()

Type Members

  1. type A = E[S]
  2. trait Changed extends SingleEvent[S, A]
    Definition Classes
    SingleNode
  3. type PinAux[~ <: Sys[~]] = BiPin[~, E[~]]
    Attributes
    protected

Abstract Value Members

  1. abstract def modifiableOption: Option[Modifiable[S, E[S]]]
    Definition Classes
    BiPin
  2. abstract def targets: Targets[S]
    Attributes
    protected
    Definition Classes
    Node
  3. abstract def tpe: Type
    Definition Classes
    Obj → Elem
  4. abstract def tree: Tree[S, E[S]]
    Attributes
    protected

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def add(key: LongObj[S], value: A)(implicit tx: S.Tx): Unit
    Definition Classes
    Impl → Modifiable
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. 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
  7. final def attr(implicit tx: S.Tx): AttrMap[S]
    Definition Classes
    Obj
  8. 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
  9. final def clear()(implicit tx: S.Tx): Unit
    Definition Classes
    Impl → Modifiable
  10. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. def debugList(implicit tx: S.Tx): List[(Long, A)]
    Definition Classes
    Impl → BiPin
  12. final def dispose()(implicit tx: S.Tx): Unit
    Definition Classes
    Node → Disposable
  13. final def disposeData()(implicit tx: S.Tx): Unit
    Attributes
    protected
    Definition Classes
    Impl → Node
  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(that: Any): Boolean
    Definition Classes
    Identifiable → AnyRef → Any
  16. 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
  17. 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
  18. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  19. 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
  20. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  21. def hashCode(): Int
    Definition Classes
    Identifiable → AnyRef → Any
  22. final def id: S.ID
    Definition Classes
    Node → Identifiable
  23. 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
  24. 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
  25. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  26. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  27. final def newTree()(implicit tx: S.Tx): Tree[S, A]
    Attributes
    protected
  28. 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
  29. final def notify(): Unit
    Definition Classes
    AnyRef
  30. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  31. final def readTree(in: DataInput, access: S.Acc)(implicit tx: S.Tx): Tree[S, A]
    Attributes
    protected
  32. final def remove(key: LongObj[S], value: A)(implicit tx: S.Tx): Boolean
    Definition Classes
    Impl → Modifiable
  33. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  34. def toString(): String
    Definition Classes
    Node → AnyRef → Any
  35. final def valueAt(time: Long)(implicit tx: S.Tx): Option[A]
    Definition Classes
    Impl → BiPin
  36. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  37. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def write(out: DataOutput): Unit
    Definition Classes
    Node → Writable
  40. final def writeData(out: DataOutput): Unit
    Attributes
    protected
    Definition Classes
    Impl → Node
  41. object changed extends Changed with Generator[S, Update[S, A]] with Caching
    Definition Classes
    Impl → SingleNode → Publisher

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