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).

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 Map

Definition Classes: TotalOrder

Entry

NoRelabelObserver

RelabelObserver

de.sciss.lucre.data.TotalOrder.Map

NoRelabelObserver

final class NoRelabelObserver[Tx, A] extends RelabelObserver[Tx, A]

Linear Supertypes

RelabelObserver[Tx, A], AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

NoRelabelObserver
RelabelObserver
AnyRef
Any

Hide All
Show All

Visibility

Public
All

Instance Constructors

new NoRelabelObserver()

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 afterRelabeling(clean: Iterator[A])(implicit tx: Tx): Unit
This method is invoked right after relabelling finishes.
This method is invoked right after relabelling finishes. That is, the items in the clean iterator have been relabelled and the tags carry their new values.

Definition Classes
NoRelabelObserver → RelabelObserver
final def asInstanceOf[T0]: T0

Definition Classes
Any
def beforeRelabeling(dirty: Iterator[A])(implicit tx: Tx): Unit
This method is invoked right before relabelling starts.
This method is invoked right before relabelling starts. That is, the items in the dirty iterator are about to be relabelled, but at the point of calling this method the tags still carry their previous values.

Definition Classes
NoRelabelObserver → RelabelObserver
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@native() @throws( ... )
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
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
AnyRef → Any
Annotations
@native()
final def isInstanceOf[T0]: Boolean

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

Definition Classes
AnyRef
final def notify(): Unit

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

Definition Classes
AnyRef
Annotations
@native()
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
NoRelabelObserver → AnyRef → Any
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( ... )

Packages

Welcome to the Mellite API documentation.

NoRelabelObserver

final class NoRelabelObserver[Tx, A] extends RelabelObserver[Tx, A]

Instance Constructors

Value Members

Inherited from RelabelObserver[Tx, A]

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

Welcome to the Mellite API documentation.

NoRelabelObserver 

final class NoRelabelObserver[Tx, A] extends RelabelObserver[Tx, A]

Instance Constructors

Value Members

Inherited from RelabelObserver[Tx, A]

Inherited from AnyRef

Inherited from Any

Ungrouped

NoRelabelObserver