trait Modifiable[T <: Txn[T], A] extends BiPin[T, A]
- Alphabetic
- By Inheritance
- Modifiable
- BiPin
- Obj
- Mutable
- Identified
- Elem
- Publisher
- Disposable
- Writable
- Form
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def add(key: LongObj[T], value: A)(implicit tx: T): Unit
- abstract def at(time: Long)(implicit tx: T): Option[Entry[T, 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
BiPinfor 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
- BiPin
- abstract def ceil(time: Long)(implicit tx: T): Option[Entry[T, 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
Noneif there is no entry at such time
- Definition Classes
- BiPin
- abstract def changed: EventLike[T, Update[T, A, Modifiable[T, A]]]
- Definition Classes
- Modifiable → Publisher
- abstract def clear()(implicit tx: T): Unit
- abstract def debugList(implicit tx: T): List[(Long, A)]
- Definition Classes
- BiPin
- abstract def dispose()(implicit tx: T): Unit
- Definition Classes
- Disposable
- abstract def eventAfter(time: Long)(implicit tx: T): 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
Noneif there is no entry later than the given time
- Definition Classes
- BiPin
- abstract def eventBefore(time: Long)(implicit tx: T): 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
Noneif there is no entry earlier than the given time
- Definition Classes
- BiPin
- abstract def floor(time: Long)(implicit tx: T): Option[Entry[T, 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
Noneif there is no entry at such time
- Definition Classes
- BiPin
- abstract def id: Ident[T]
- Definition Classes
- Identified
- abstract def intersect(time: Long)(implicit tx: T): Leaf[T, 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
- BiPin
- abstract def isEmpty(implicit tx: T): Boolean
Returns
trueif not a single element is contained in the collection.Returns
trueif not a single element is contained in the collection.- Definition Classes
- BiPin
- abstract def modifiableOption: Option[Modifiable[T, A]]
- Definition Classes
- BiPin
- abstract def nonEmpty(implicit tx: T): Boolean
Returns
trueif at least one element is contained in the collection.Returns
trueif at least one element is contained in the collection.- Definition Classes
- BiPin
- abstract def remove(key: LongObj[T], value: A)(implicit tx: T): Boolean
- abstract def tpe: Type
- abstract def valueAt(time: Long)(implicit tx: T): Option[A]
- Definition Classes
- BiPin
- abstract def write(out: DataOutput): Unit
- Definition Classes
- Writable
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 asInstanceOf[T0]: T0
- Definition Classes
- Any
- final def attr(implicit tx: T): AttrMap[T]
- Definition Classes
- Obj
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
- Definition Classes
- Identified → AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- Identified → 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
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- Obj → AnyRef → Any
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated