Mellite 2.33.0 API < Back

Packages

package root

Definition Classes
root
package de

Definition Classes
root
package sciss
The interfaces are grouped into the following packages:
Welcome to the Mellite API documentation.
The interfaces are grouped into the following packages:
- de.sciss.synth is the ScalaCollider base package, with things like computation Rate, AddAction, and DoneAction.
- de.sciss.synth.ugen contains the ScalaCollider UGen documentation
- de.sciss.lucre.synth is the base package for the transactional layer for ScalaCollider, with things like de.sciss.lucre.synth.Bus, Buffer, Node, and Server.
- de.sciss.synth.proc is the SoundProcesses base package, with things like Proc, Timeline, Folder, AuralSystem, Scheduler, Transport, and Workspace
- de.sciss.synth.proc.graph are UGen abstractions added by SoundProcesses, such as ScanIn and ScanOut.
- de.sciss.mellite.gui is the base package for the Mellite graphical user interface.
- de.sciss.fscape is the FScape base package
- de.sciss.fscape.graph contains the FScape UGen documentation
- de.sciss.fscape.lucre is the base package for the transactional layer for FScape, with things like FScape and additional UGens.
The Lucre transactional object model:
- de.sciss.lucre.stm is the base package for transactions, with things like Obj, Txn, Sys, and Cursor
- de.sciss.lucre.artifact is the base package for file system artifacts, with classes Artifact and ArtifactLocation
- de.sciss.lucre.expr is the base package for expression types such as IntObj, DoubleObj, etc.
Other useful packages:
- de.sciss.synth.io for reading and writing audio files
- de.sciss.osc for general Open Sound Control interfaces
Definition Classes
de
package lucre

Definition Classes
sciss
package data

Definition Classes
lucre
object TotalOrder
A transactional data structure to maintain an ordered sequence of elements such that two random elements can be compared in O(1).
A transactional data structure to maintain an ordered sequence of elements such that two random elements can be compared in O(1).
This uses an algorithm from the paper Bender, M. and Cole, R. and Demaine, E. and Farach-Colton, M. and Zito, J., Two simplified algorithms for maintaining order in a list, Algorithms—ESA 2002, pp. 219--223, 2002.
The relabel method is based on the Python implementation by David Eppstein, as published at http://www.ics.uci.edu/~eppstein/PADS/OrderedSequence.py however a bug resulting in a relabel size of 1 was fixed.
Original note: "Due to rebalancing on the integer tags used to maintain order, the amortized time per insertion in an n-item list is O(log n)."

Definition Classes
data
object Set

Definition Classes
TotalOrder
EmptyEntry
Entry
EntryOption

de.sciss.lucre.data.TotalOrder.Set

Entry

final class Entry[S <: Base[S]] extends EntryOption[S] with MutableImpl[S] with Ordered[Set.Entry.S.Tx, Entry[S]]

Linear Supertypes

Ordered[S.Tx, Entry[S]], MutableImpl[S], Mutable[S.Id, S.Tx], Disposable[S.Tx], Writable, Identifiable[S.Id], EntryOption[S], AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

Entry
Ordered
MutableImpl
Mutable
Disposable
Writable
Identifiable
EntryOption
AnyRef
Any

Hide All
Show All

Visibility

Public
All

Type Members

type E = Entry[S]

Attributes
protected
Definition Classes
EntryOption
type EOpt = EntryOption[S]

Attributes
protected
Definition Classes
EntryOption

Value Members

final def !=(arg0: Any): Boolean

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

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

Definition Classes
AnyRef → Any
def append()(implicit tx: S.Tx): E
def appendMax()(implicit tx: S.Tx): E
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@native() @throws( ... )
def compare(that: Entry[S])(implicit tx: S.Tx): Int

Definition Classes
Entry → Ordered
final def dispose()(implicit tx: S.Tx): Unit

Definition Classes
MutableImpl → Disposable
def disposeData()(implicit tx: S.Tx): Unit

Attributes
protected
Definition Classes
Entry → MutableImpl
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(that: Any): Boolean

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

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

Definition Classes
AnyRef → Any
Annotations
@native()
def hashCode(): Int

Definition Classes
Identifiable → AnyRef → Any
val id: S.Id

Definition Classes
Entry → Identifiable
def isDefined: Boolean

Definition Classes
Entry → EntryOption
def isEmpty: Boolean

Definition Classes
Entry → EntryOption
final def isInstanceOf[T0]: Boolean

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

Definition Classes
AnyRef
def next(implicit tx: S.Tx): EOpt
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@native()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@native()
def orNull: E

Definition Classes
Entry → EntryOption
def prepend()(implicit tx: S.Tx): E
def prev(implicit tx: S.Tx): EOpt
def remove()(implicit tx: S.Tx): Unit
def removeAndDispose()(implicit tx: S.Tx): Unit
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tag(implicit tx: S.Tx): Int
def toString(): String

Definition Classes
Entry → MutableImpl → AnyRef → Any
def validate(msg: ⇒ String)(implicit tx: S.Tx): Unit
final def wait(): Unit

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

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

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

Definition Classes
MutableImpl → Writable
def writeData(out: DataOutput): Unit

Attributes
protected
Definition Classes
Entry → MutableImpl

Packages

Welcome to the Mellite API documentation.

Entry

final class Entry[S <: Base[S]] extends EntryOption[S] with MutableImpl[S] with Ordered[Set.Entry.S.Tx, Entry[S]]

Type Members

Value Members

Inherited from Ordered[S.Tx, Entry[S]]

Inherited from MutableImpl[S]

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

Inherited from Disposable[S.Tx]

Inherited from Writable

Inherited from Identifiable[S.Id]

Inherited from EntryOption[S]

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

Welcome to the Mellite API documentation.

Entry 

final class Entry[S <: Base[S]] extends EntryOption[S] with MutableImpl[S] with Ordered[Set.Entry.S.Tx, Entry[S]]

Type Members

Value Members

Inherited from Ordered[S.Tx, Entry[S]]

Inherited from MutableImpl[S]

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

Inherited from Disposable[S.Tx]

Inherited from Writable

Inherited from Identifiable[S.Id]

Inherited from EntryOption[S]

Inherited from AnyRef

Inherited from Any

Ungrouped

Entry