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

EmptyEntry