Trait/Object

de.sciss.lucre.bitemp.BiGroup

Modifiable

Related Docs: object Modifiable | package BiGroup

Permalink

trait Modifiable[S <: Sys[S], A] extends BiGroup[S, A]

Linear Supertypes
BiGroup[S, A], Obj[S], Mutable[S.ID, S.Tx], Identifiable[S.ID], Elem[S], Publisher[S, Update[S, A]], Disposable[S.Tx], Writable, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Modifiable
  2. BiGroup
  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 add(span: SpanLikeObj[S], elem: A)(implicit tx: S.Tx): Entry[S, A]

    Permalink
  2. abstract def changed: EventLike[S, Update[S, A]]

    Permalink
    Definition Classes
    ModifiablePublisher
  3. abstract def clear()(implicit tx: S.Tx): Unit

    Permalink
  4. abstract def debugList(implicit tx: S.Tx): List[(SpanLike, A)]

    Permalink
    Definition Classes
    BiGroup
  5. abstract def debugPrint(implicit tx: S.Tx): String

    Permalink
    Definition Classes
    BiGroup
  6. abstract def dispose()(implicit tx: S.Tx): Unit

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

    Permalink

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

    Permalink

    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
    BiGroup
  9. abstract def eventsAt(time: Long)(implicit tx: S.Tx): (Iterator[Leaf[S, A]], Iterator[Leaf[S, A]])

    Permalink

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

    Permalink

    Finds the first occurring event, if there is any.

    Finds the first occurring event, if there is any. Ignores objects with Span.All.

    Definition Classes
    BiGroup
  11. abstract def id: S.ID

    Permalink
    Definition Classes
    Identifiable
  12. abstract def intersect(span: SpanLike)(implicit tx: S.Tx): Iterator[Leaf[S, A]]

    Permalink

    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
    BiGroup
  13. abstract def intersect(time: Long)(implicit tx: S.Tx): Iterator[Leaf[S, A]]

    Permalink

    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
    BiGroup
  14. 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
    BiGroup
  15. abstract def iterator(implicit tx: S.Tx): Iterator[Leaf[S, A]]

    Permalink
    Definition Classes
    BiGroup
  16. abstract def lastEvent(implicit tx: S.Tx): Option[Long]

    Permalink

    Finds the last occurring event, if there is any.

    Finds the last occurring event, if there is any. Ignores objects with Span.All.

    Definition Classes
    BiGroup
  17. abstract def modifiableOption: Option[Modifiable[S, A]]

    Permalink
    Definition Classes
    BiGroup
  18. 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
    BiGroup
  19. abstract def rangeSearch(start: SpanLike, stop: SpanLike)(implicit tx: S.Tx): Iterator[Leaf[S, A]]

    Permalink

    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
    BiGroup
  20. abstract def remove(span: SpanLikeObj[S], elem: A)(implicit tx: S.Tx): Boolean

    Permalink
  21. abstract def tpe: Type

    Permalink
    Definition Classes
    ObjElem
  22. 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 BiGroup[S, A]

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, A]]

Inherited from Disposable[S.Tx]

Inherited from Writable

Inherited from AnyRef

Inherited from Any

Ungrouped