Elements implementing the Lazy trait may participate in the building of a
Graph body. They can be added to the current graph by calling
Graph.builder.addLazy. Then, when the graph is expanded, the
force method is called on those registered elements, allowing them
to either spawn new graph elements or actually expand to UGens which
can be added to the ugen graph builder argument.
In most cases, lazy elements will expanded to ugens, and thus the subtype
Lazy.Expander is the most convenient way to implement this trait, as it already
does most of the logic, and provides for GEs expand method.
- See also:
- Companion:
- object
trait Product
trait Equals
class Object
trait Matchable
class Any
trait Expander[U]
trait Lazy[A]
class GEBlock[A]
class ChannelProxy[A]
class ElseGE[A]
class Feed[A]
class Flatten[A]
class LeakDC
class MonoEqP
class PeakCentroid1D
class PitchAC
class Reduce[A]
class UnzipWindow[A]
trait ZeroOut
class DebugAnyPromise[A]
class DebugDoublePromise
class DebugIntPromise
class DebugSink[A]
class ImageFileOut
class ImageFileSeqOut
class Plot1D[A]
class Poll[A]
class Progress
class Sheet1D[A]
class SourceUnit
class UnitBlock
class ElseUnit
class Back[A]
trait IfThenLike[A]
class ElseIfThen[A]
class IfThen[A]
trait Then[A]
trait ElseOrElseIfThen[A]
trait ElseLike[A]
trait IfOrElseIfThen[A]