trait Grapheme[S <: Sys[S]] extends BiPin[S, Obj[S]]
- Alphabetic
- By Inheritance
- Grapheme
- BiPin
- Obj
- Mutable
- Identifiable
- Elem
- Publisher
- Disposable
- Writable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
-
abstract
def
at(time: Long)(implicit tx: S.Tx): Option[Entry[S, Obj[S]]]
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: S.Tx): Option[Entry[S, Obj[S]]]
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[S, Update[S, Obj[S]]]
- Definition Classes
- Publisher
-
abstract
def
debugList(implicit tx: S.Tx): List[(Long, Obj[S])]
- Definition Classes
- BiPin
-
abstract
def
dispose()(implicit tx: S.Tx): Unit
- Definition Classes
- Disposable
-
abstract
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
Noneif there is no entry later than the given time
- Definition Classes
- BiPin
-
abstract
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
Noneif there is no entry earlier than the given time
- Definition Classes
- BiPin
- abstract def firstEvent(implicit tx: S.Tx): Option[Long]
-
abstract
def
floor(time: Long)(implicit tx: S.Tx): Option[Entry[S, Obj[S]]]
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: S.Id
- Definition Classes
- Identifiable
-
abstract
def
intersect(time: Long)(implicit tx: S.Tx): Leaf[S, Obj[S]]
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: S.Tx): 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 lastEvent(implicit tx: S.Tx): Option[Long]
- abstract def modifiableOption: Option[Modifiable[S]]
-
abstract
def
nonEmpty(implicit tx: S.Tx): 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 tpe: Type
-
abstract
def
valueAt(time: Long)(implicit tx: S.Tx): Option[Obj[S]]
- 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: S.Tx): AttrMap[S]
- Definition Classes
- Obj
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- Identifiable → 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
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- Identifiable → 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()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- Obj → 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
- @native() @throws( ... )