Fourier

Disk-buffered (large) Fourier transform. Output windows will have a complex size of (size + padding).nextPowerOfTwo

in: input signal to transform. This must be complex (Re, Im interleaved)
size: the (complex) window size
padding: the (complex) zero-padding size for each window
dir: the direction is 1 for forward and -1 for backward transform. other numbers will do funny things.
mem: the amount of frames (chunk size) to buffer in memory. this should be a power of two.

Linear Supertypes

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

Instance Constructors

new Fourier(in: GE, size: GE, padding: GE = 0, dir: GE = 1.0, mem: GE = 131072)

in
input signal to transform. This must be complex (Re, Im interleaved)
size
the (complex) window size
padding
the (complex) zero-padding size for each window
dir
the direction is 1 for forward and -1 for backward transform. other numbers will do funny things.
mem
the amount of frames (chunk size) to buffer in memory. this should be a power of two.

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( ... )
val dir: GE

the direction is 1 for forward and -1 for backward transform.
the direction is 1 for forward and -1 for backward transform. other numbers will do funny things.
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
val in: GE

input signal to transform.
input signal to transform. This must be complex (Re, Im interleaved)
final def isInstanceOf[T0]: Boolean

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

Attributes
protected
Definition Classes
Fourier → 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
Fourier → Expander
val mem: GE

the amount of frames (chunk size) to buffer in memory.
the amount of frames (chunk size) to buffer in memory. this should be a power of two.
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
val padding: GE

the (complex) zero-padding size for each window
final def rewrap(args: IndexedSeq[UGenInLike], exp: Int)(implicit b: Builder): UGenInLike

Attributes
protected
Definition Classes
SomeOut → UGenSource
val size: GE

the (complex) window size
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
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 Fourier(in: GE, size: GE, padding: GE = 0, dir: GE = 1.0, mem: GE = 131072) extends SingleOut with Product with Serializable

Instance Constructors

new Fourier(in: GE, size: GE, padding: GE = 0, dir: GE = 1.0, mem: GE = 131072)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

val dir: GE

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

final def getClass(): Class[_]

val in: GE

final def isInstanceOf[T0]: Boolean

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

def makeUGens(implicit b: Builder): UGenInLike

val mem: GE

final def name: String

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val padding: GE

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

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