PriorityQueue

A sorting UGen that can be thought of as a bounded priority queue. It keeps all data in memory but limits the size to the top size items. By its nature, the UGen only starts outputting values once the input signal (keys) has finished.

keys: the sorting keys; higher values mean higher priority
values: the values corresponding with the keys and eventually output by the UGen. It is well possible to use the same signal both for keys and values.
size: the maximum size of the priority queue.

Linear Supertypes

Serializable, Serializable, SingleOut, SomeOut[StreamOut], GE.Lazy, GE, UGenSource[UGenInLike, StreamOut], Expander[UGenInLike], Lazy, Product, Equals, AnyRef, Any

Instance Constructors

new PriorityQueue(keys: GE, values: GE, size: GE)

keys
the sorting keys; higher values mean higher priority
values
the values corresponding with the keys and eventually output by the UGen. It is well possible to use the same signal both for keys and values.
size
the maximum size of the priority queue.

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
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

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

Definition Classes
AnyRef
def finalize(): Unit

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

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val keys: GE

the sorting keys; higher values mean higher priority
def makeUGen(args: IndexedSeq[UGenIn])(implicit b: Builder): UGenInLike

Attributes
protected
Definition Classes
PriorityQueue → UGenSource
def makeUGens(implicit b: Builder): UGenInLike

Abstract method which must be implemented by creating the actual UGens during expansion.
Abstract method which must be implemented by creating the actual UGens during expansion. This method is at most called once during graph expansion
returns
the expanded object (depending on the type parameter U)

Attributes
protected
Definition Classes
PriorityQueue → Expander
final def name: String

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def rewrap(args: IndexedSeq[UGenInLike], exp: Int)(implicit b: Builder): UGenInLike

Attributes
protected
Definition Classes
SomeOut → UGenSource
val size: GE

the maximum size of the priority queue.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
final def unwrap(args: IndexedSeq[UGenInLike])(implicit b: Builder): UGenInLike

Attributes
protected
Definition Classes
UGenSource
val values: GE

the values corresponding with the keys and eventually output by the UGen.
the values corresponding with the keys and eventually output by the UGen. It is well possible to use the same signal both for keys and values.
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
@throws( ... )

Related Doc: package graph

final case class PriorityQueue(keys: GE, values: GE, size: GE) extends SingleOut with Product with Serializable

Instance Constructors

new PriorityQueue(keys: GE, values: GE, size: GE)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

val keys: GE

def makeUGen(args: IndexedSeq[UGenIn])(implicit b: Builder): UGenInLike

def makeUGens(implicit b: Builder): UGenInLike

final def name: String

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def rewrap(args: IndexedSeq[UGenInLike], exp: Int)(implicit b: Builder): UGenInLike

val size: GE

final def synchronized[T0](arg0: ⇒ T0): T0

final def unwrap(args: IndexedSeq[UGenInLike])(implicit b: Builder): UGenInLike

val values: GE

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from SingleOut

Inherited from SomeOut[StreamOut]

Inherited from GE.Lazy

Inherited from GE

Inherited from UGenSource[UGenInLike, StreamOut]

Inherited from Expander[UGenInLike]

Inherited from Lazy

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped