Lucre-expr0/de.sciss.lucre.impl/BiGroupImpl/Impl

Impl

abstract
class Impl[T <: Txn[T], A, Repr <: Modifiable[T, A]] extends Modifiable[T, A] with SingleEventNode[T, Update[T, A, Repr]]
trait SingleEventNode[T, Update[T, A, Repr]]
trait Node[T]
trait Modifiable[T, A]
trait BiGroup[T, A]
trait Obj[T]
trait Mutable[T]
trait Identified[T]
trait Elem[T]
trait Publisher[T, Update[T, A, BiGroup[T, A]]]
trait Disposable[T]
trait Writable
trait Form[T]
class Object
trait Matchable
class Any

Type members

Classlikes

object changed extends Changed with GeneratorEvent[T, Update[T, A, Repr]] with Caching

Inherited classlikes

trait Changed
Inherited from
SingleEventNode

Value members

Abstract methods

protected
def group: Repr
protected
def mkEntry(tgt: Targets[T], span: SpanLikeObj[T], elem: A)(implicit tx: T): Entry[T, A]
protected
def tree: TreeImpl[T, A]

Concrete methods

final
def add(span: SpanLikeObj[T], elem: A)(implicit tx: T): Entry[T, A]
final
def clear()(implicit tx: T): Unit
final
def debugList(implicit tx: T): List[(SpanLike, A)]
final
def debugPrint(implicit tx: T): String
final protected
def disposeData()(implicit tx: T): Unit
final
def eventAfter(time: Long)(implicit tx: T): Option[Long]
final
def eventBefore(time: Long)(implicit tx: T): Option[Long]
final
def eventsAt(time: Long)(implicit tx: T): (Iterator[(T, A)], Iterator[(T, A)])
final
def firstEvent(implicit tx: T): Option[Long]
final
def get(spanVal: SpanLike)(implicit tx: T): IndexedSeq[Entry[T, A]]
final
def intersect(time: Long)(implicit tx: T): Iterator[(T, A)]
final
def intersect(span: SpanLike)(implicit tx: T): Iterator[(T, A)]
final
def isEmpty(implicit tx: T): Boolean
final
def iterator(implicit tx: T): Iterator[(T, A)]
final
def lastEvent(implicit tx: T): Option[Long]
final protected
def newTree()(implicit tx: T): TreeImpl[T, A]
final
def nonEmpty(implicit tx: T): Boolean
final
def rangeSearch(start: SpanLike, stop: SpanLike)(implicit tx: T): Iterator[(T, A)]
final protected
def readTree(in: DataInput)(implicit tx: T): TreeImpl[T, A]
final
def recoverSpan(spanVal: SpanLike, elem: A)(implicit tx: T): Option[SpanLikeObj[T]]
final
def remove(span: SpanLikeObj[T], elem: A)(implicit tx: T): Boolean
final
def treeHandle: TreeImpl[T, A]
final protected
def writeData(out: DataOutput): Unit

Inherited methods

final
def attr(implicit tx: T): AttrMap[T]
Inherited from
Obj
final
def dispose()(implicit tx: T): Unit
Inherited from
Node
override
def equals(that: Any): Boolean
Definition Classes
Identified -> Any
Inherited from
Identified
override
def hashCode: Int
Definition Classes
Identified -> Any
Inherited from
Identified
final
def id: Ident[T]
Inherited from
Node
def modifiableOption: Option[Modifiable[T, A]]
Inherited from
BiGroup
protected
def targets: Targets[T]
Inherited from
Node
override
def toString: String
Definition Classes
Node -> Any
Inherited from
Node
override
def tpe: Type
Definition Classes
Obj -> Elem
Inherited from
Obj
final
def write(out: DataOutput): Unit
Inherited from
Node

Implicits

Implicits

implicit protected
def entryFormat: TFormat[T, Entry[T, A]]
final implicit
def pointView: ((T, A), T) => LongPoint2DLike