Lucre-expr/de.sciss.lucre/BiPin/Modifiable

Modifiable

trait Modifiable[T <: Txn[T], A] extends BiPin[T, A]
Companion:
object
trait BiPin[T, A]
trait Obj[T]
trait Mutable[T]
trait Identified[T]
trait Elem[T]
trait Publisher[T, Update[T, A, BiPin[T, A]]]
trait Disposable[T]
trait Writable
trait Form[T]
class Object
trait Matchable
class Any
class Impl[T, E, Repr]

Value members

Abstract methods

def add(key: LongObj[T], value: A)(implicit tx: T): Unit
override def changed: EventLike[T, Update[T, A, Modifiable[T, A]]]
Definition Classes
Publisher
def clear()(implicit tx: T): Unit
def remove(key: LongObj[T], value: A)(implicit tx: T): Boolean

Inherited methods

def at(time: Long)(implicit tx: T): Option[Entry[T, A]]

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.

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.

Value parameters:
time

the query time point

Returns:

an element for the given time point, if it exists, otherwise None

Inherited from:
BiPin
final def attr(implicit tx: T): AttrMap[T]
Inherited from:
Obj
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.

Value parameters:
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

Inherited from:
BiPin
def debugList(implicit tx: T): List[(Long, A)]
Inherited from:
BiPin
def dispose()(implicit tx: T): Unit
Inherited from:
Disposable
override def equals(that: Any): Boolean
Definition Classes
Identified -> Any
Inherited from:
Identified
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.

Value parameters:
time

the query time

Returns:

the time corresponding to the next entry, or None if there is no entry later than the given time

Inherited from:
BiPin
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.

Value parameters:
time

the query time

Returns:

the time corresponding to the next entry, or None if there is no entry earlier than the given time

Inherited from:
BiPin
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.

Value parameters:
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

Inherited from:
BiPin
override def hashCode: Int
Definition Classes
Identified -> Any
Inherited from:
Identified
def id: Ident[T]
Inherited from:
Identified
def intersect(time: Long)(implicit tx: T): Leaf[T, A]

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.

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.

Value parameters:
time

the query point

Returns:

the sequence of elements found along with their time expressions

Inherited from:
BiPin
def isEmpty(implicit tx: T): Boolean

Returns true if not a single element is contained in the collection.

Returns true if not a single element is contained in the collection.

Inherited from:
BiPin
def modifiableOption: Option[Modifiable[T, A]]
Inherited from:
BiPin
def nonEmpty(implicit tx: T): Boolean

Returns true if at least one element is contained in the collection.

Returns true if at least one element is contained in the collection.

Inherited from:
BiPin
override def toString: String
Definition Classes
Obj -> Any
Inherited from:
Obj
override def tpe: Type
Definition Classes
Obj -> Elem
Inherited from:
Obj
def valueAt(time: Long)(implicit tx: T): Option[A]
Inherited from:
BiPin
def write(out: DataOutput): Unit
Inherited from:
Writable