Trait/Object

de.sciss.synth.proc

Grapheme

Related Docs: object Grapheme | package proc

Permalink

trait Grapheme[S <: Sys[S]] extends BiPin[S, Obj[S]]

Linear Supertypes
BiPin[S, Obj[S]], Obj[S], Mutable[S.ID, S.Tx], Identifiable[S.ID], Elem[S], Publisher[S, Update[S, Obj[S]]], Disposable[S.Tx], Writable, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Grapheme
  2. BiPin
  3. Obj
  4. Mutable
  5. Identifiable
  6. Elem
  7. Publisher
  8. Disposable
  9. Writable
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def at(time: Long)(implicit tx: S.Tx): Option[Entry[S, Obj[S]]]

    Permalink

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

    Permalink

    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
    BiPin
  3. abstract def changed: EventLike[S, Update[S, Obj[S]]]

    Permalink
    Definition Classes
    Publisher
  4. abstract def debugList(implicit tx: S.Tx): List[(Long, Obj[S])]

    Permalink
    Definition Classes
    BiPin
  5. abstract def dispose()(implicit tx: S.Tx): Unit

    Permalink
    Definition Classes
    Disposable
  6. abstract def eventAfter(time: Long)(implicit tx: S.Tx): Option[Long]

    Permalink

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

    Permalink

    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
    BiPin
  8. abstract def firstEvent(implicit tx: S.Tx): Option[Long]

    Permalink
  9. abstract def floor(time: Long)(implicit tx: S.Tx): Option[Entry[S, Obj[S]]]

    Permalink

    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
    BiPin
  10. abstract def id: S.ID

    Permalink
    Definition Classes
    Identifiable
  11. abstract def intersect(time: Long)(implicit tx: S.Tx): Leaf[S, Obj[S]]

    Permalink

    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
  12. abstract def isEmpty(implicit tx: S.Tx): Boolean

    Permalink

    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
    BiPin
  13. abstract def modifiableOption: Option[Modifiable[S]]

    Permalink
    Definition Classes
    GraphemeBiPin
  14. abstract def nonEmpty(implicit tx: S.Tx): Boolean

    Permalink

    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
    BiPin
  15. abstract def tpe: Type

    Permalink
    Definition Classes
    ObjElem
  16. abstract def valueAt(time: Long)(implicit tx: S.Tx): Option[Obj[S]]

    Permalink
    Definition Classes
    BiPin
  17. abstract def write(out: DataOutput): Unit

    Permalink
    Definition Classes
    Writable

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. final def attr(implicit tx: S.Tx): AttrMap[S]

    Permalink
    Definition Classes
    Obj
  6. def clone(): AnyRef

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

    Permalink
    Definition Classes
    AnyRef
  8. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    Identifiable → AnyRef → Any
  9. def finalize(): Unit

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

    Permalink
    Definition Classes
    AnyRef → Any
  11. def hashCode(): Int

    Permalink
    Definition Classes
    Identifiable → AnyRef → Any
  12. final def isInstanceOf[T0]: Boolean

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

    Permalink
    Definition Classes
    AnyRef
  14. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  15. final def notifyAll(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  17. def toString(): String

    Permalink
    Definition Classes
    Obj → AnyRef → Any
  18. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  19. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  20. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

Inherited from Disposable[S.Tx]

Inherited from Writable

Inherited from AnyRef

Inherited from Any

Ungrouped