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 HASkipList

  A transactional version of the deterministic k-(2k+1) top-down operated skip list as described in T.

  A transactional version of the deterministic k-(2k+1) top-down operated skip list as described in T. Papadakis, Skip Lists and Probabilistic Analysis of Algorithms. Ch. 4 (Deterministic Skip Lists), pp. 55--78. Waterloo (CA) 1993

  It uses the horizontal array technique with a parameter for k (minimum gap size). It uses a modified top-down removal algorithm that avoids the need for a second pass as in the original algorithm, and is careful about object creations, so that it will be able to persist the data structure without any unnecessary reads or writes to the store.

  Three implementation notes: (1) We treat the nodes as immutable at the moment, storing them directly in the S#Val child pointers of their parents. While this currently seems to have a performance advantage (?), we could try to avoid this by using S#Refs for the child pointers, making the nodes become mutable. We could avoid copying the arrays for each insertion or deletion, at the cost of more space, but maybe better performance.

  (2) The special treatment of isRight kind of sucks. Since now that information is also persisted, we might just have two types of branches and leaves, and avoid passing around this flag.

  (3) Since there is a bug with the top-down one-pass removal, we might end up removing the creation of instances of virtual branches altogether again when replacing the current algorithm by a two-pass one.

  TODO: nodes or at least leaves should be horizontally connected for a faster iterator and fast pair (interval) search

  Definition Classes

  data

• Branch
• HeadOrBranch
• Leaf
• Map
• Node
• Set

de.sciss.lucre.data.HASkipList

Leaf