de.sciss.lucre.bitemp.impl.BiGroupImpl

Impl

abstract class Impl[S <: Sys[S], Elem, U] extends Modifiable[S, Elem, U]

Self Type
Impl[S, Elem, U]
Linear Supertypes
Modifiable[S, Elem, U], BiGroup[S, Elem, U], Publisher[S, Update[S, Elem, U]], Node[S], VirtualNode[S], Reactor[S], Mutable[S.ID, S.Tx], Disposable[S.Tx], Writable, Identifiable[S.ID], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Impl
  2. Modifiable
  3. BiGroup
  4. Publisher
  5. Node
  6. VirtualNode
  7. Reactor
  8. Mutable
  9. Disposable
  10. Writable
  11. Identifiable
  12. AnyRef
  13. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Impl()

Abstract Value Members

  1. implicit abstract def elemSerializer: Serializer[S.Tx, S.Acc, Elem]

  2. abstract def eventView(elem: Elem): EventLike[S, U]

  3. abstract def targets: Targets[S]

    Attributes
    protected
    Definition Classes
    Node
  4. abstract def tree: Tree[S, Elem, U]

    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. implicit object TimedSer extends NodeSerializer[S, TimedElemImpl[S, Elem, U]]

  5. final def add(span: Expr[S, SpanLike], elem: Elem)(implicit tx: S.Tx): TimedElem[S, Elem]

    Definition Classes
    ImplModifiable
  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. final def changed: Event[S, Update[S, Elem, U], Modifiable[S, Elem, U]]

    Definition Classes
    ImplModifiable → Publisher
  8. final def clear()(implicit tx: S.Tx): Unit

    Definition Classes
    ImplModifiable
  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. final def debugList(implicit tx: S.Tx): List[(SpanLike, Elem)]

    Definition Classes
    ImplBiGroup
  11. final def debugPrint(implicit tx: S.Tx): String

    Definition Classes
    ImplBiGroup
  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
    Reactor → AnyRef → Any
  16. final def eventsAt(time: Long)(implicit tx: S.Tx): (Iterator[S.Tx, Leaf[S, Elem]], Iterator[S.Tx, Leaf[S, Elem]])

    Queries all elements which produce an event (starting or stopping) at a given time.

    Queries all elements which produce an event (starting or stopping) at a given time.

    time

    the time instant for which to gather the events

    returns

    a tuple of two iterators. the first iterator (_1) contains the events which start at the query time, the second iterator (_2) contains the event which stop at the query time

    Definition Classes
    ImplBiGroup
  17. def finalize(): Unit

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

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

    Definition Classes
    Reactor → AnyRef → Any
  20. final def id: S.ID

    Definition Classes
    Node → Identifiable
  21. final def intersect(span: SpanLike)(implicit tx: S.Tx): Iterator[S.Tx, Leaf[S, Elem]]

    Queries all elements intersecting a given time span.

    Queries all elements intersecting a given time span. That is, returns an iterator of all elements whose span contains or partly overlaps the query span. (span start < query.stop && span.stop > query.start)

    This methods makes no guarantees about the ordering of the returned iterator.

    span

    the the span to search within (this may be a half-bounded interval or even Span.All)

    returns

    a (possibly empty) iterator of the intersecting elements

    Definition Classes
    ImplBiGroup
  22. final def intersect(time: Long)(implicit tx: S.Tx): Iterator[S.Tx, Leaf[S, Elem]]

    Queries all elements intersecting a given point in time.

    Queries all elements intersecting a given point in time. That is, returns an iterator of all elements whose span contains the time point (span start <= time && span.stop > time)

    This methods makes no guarantees about the ordering of the returned iterator.

    time

    the point in time to search at

    returns

    a (possibly empty) iterator of the intersecting elements

    Definition Classes
    ImplBiGroup
  23. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  24. final def isInvalid(implicit tx: S.Tx): Boolean

    Attributes
    protected
    Definition Classes
    Node
  25. final def iterator(implicit tx: S.Tx): Iterator[S.Tx, Leaf[S, Elem]]

    Definition Classes
    ImplBiGroup
  26. def modifiableOption: Option[Modifiable[S, Elem, U]]

    Definition Classes
    ImplBiGroup
  27. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  28. final def nearestEventAfter(time: Long)(implicit tx: S.Tx): Option[Long]

    Queries the closest event (an element's span starting or stopping) later than the given time

    Queries the closest event (an element's span starting or stopping) later than the given time

    time

    the query time

    returns

    a time, greater than the query time, at which the next event occurs, or None if there are no events after the query time

    Definition Classes
    ImplBiGroup
  29. final def nearestEventBefore(time: Long)(implicit tx: S.Tx): Option[Long]

    Queries the closest event (an element's span starting or stopping) earlier than the given time

    Queries the closest event (an element's span starting or stopping) earlier than the given time

    time

    the query time

    returns

    a time, smaller than the query time, at which the previous event occurs, or None if there are no events before the query time

    Definition Classes
    ImplBiGroup
  30. final def newTree()(implicit tx: S.Tx): Tree[S, Elem, U]

    Attributes
    protected
  31. final def notify(): Unit

    Definition Classes
    AnyRef
  32. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  33. implicit final def pointView: (Leaf[S, Elem], S.Tx) ⇒ LongPoint2DLike

  34. final def rangeSearch(start: SpanLike, stop: SpanLike)(implicit tx: S.Tx): Iterator[S.Tx, Leaf[S, Elem]]

    Performs a range query according to separate intervals for the allowed start and stop positions of the element spans.

    Performs a range query according to separate intervals for the allowed start and stop positions of the element spans. That is, returns an iterator of all elements whose span satisfies the constraints given for start and stop positions (start.contains( elem.span.start ) && stop.contains( elem.span.stop ))

    Both for the start and stop constraint, half-bounded or unbounded (Span.All) intervals can be used. Examples

    - to find all elements which start between 10 (inclusive) and 20 (exclusive), use start = Span( 10, 20 ), stop = Span.All. - to find all elements which start before (<) 10 and stop from (>=) 20, use start = Span.until( 10 ), stop = Span.from( 20 ).

    This methods makes no guarantees about the ordering of the returned iterator.

    start

    the constraint for the start position of the spans of the elements filtered.

    stop

    the constraint for the stop position of the spans of the elements filtered.

    returns

    a (possibly empty) iterator of the intersecting elements

    Definition Classes
    ImplBiGroup
  35. final def readTree(in: DataInput, access: S.Acc)(implicit tx: S.Tx): Tree[S, Elem, U]

    Attributes
    protected
  36. final def remove(span: Expr[S, SpanLike], elem: Elem)(implicit tx: S.Tx): Boolean

    Definition Classes
    ImplModifiable
  37. final def select(slot: Int): Event[S, Any, Any]

    Definition Classes
    Impl → Node → VirtualNode
  38. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  39. def toString(): String

    Definition Classes
    Impl → Node → AnyRef → Any
  40. final def treeHandle: Tree[S, Elem, U]

  41. final def validated()(implicit tx: S.Tx): Unit

    Attributes
    protected
    Definition Classes
    Node
  42. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  45. final def write(out: DataOutput): Unit

    Definition Classes
    Node → Writable
  46. final def writeData(out: DataOutput): Unit

    Attributes
    protected
    Definition Classes
    Impl → Node

Inherited from Modifiable[S, Elem, U]

Inherited from BiGroup[S, Elem, U]

Inherited from Publisher[S, Update[S, Elem, U]]

Inherited from Node[S]

Inherited from VirtualNode[S]

Inherited from Reactor[S]

Inherited from Mutable[S.ID, S.Tx]

Inherited from Disposable[S.Tx]

Inherited from Writable

Inherited from Identifiable[S.ID]

Inherited from AnyRef

Inherited from Any

Ungrouped