synthesizer-core-0.2.1: Audio signal processing coded in Haskell: Low level part Source code Contents Index

Synthesizer.Storable.Cut

Synopsis

arrange :: (Storable v, C v) => ChunkSize -> T Int (T v) -> T v arrangeAdaptive :: (Storable v, C v) => ChunkSize -> T Int (T v) -> T v arrangeList :: (Storable v, C v) => ChunkSize -> T Int (T v) -> T v addShiftedMany :: (Storable a, C a) => ChunkSize -> [Int] -> [T a] -> T a addShifted :: (Storable a, C a) => ChunkSize -> Int -> T a -> T a -> T a arrangeEquidist :: (Storable v, C v) => ChunkSize -> T Int (T v) -> T v addToBuffer :: (Storable a, C a) => Vector s a -> Int -> T a -> ST s (T a) addToBufferSwitchL :: (Storable a, C a) => Vector s a -> Int -> T a -> ST s (T a)

Documentation

arrange Source

:: (Storable v, C v) => ChunkSize -> T Int (T v) A list of pairs: (relative start time, signal part), The start time is relative to the start time of the previous event. -> T v The mixed signal.

arrangeAdaptive Source

:: (Storable v, C v) => ChunkSize -> T Int (T v) A list of pairs: (relative start time, signal part), The start time is relative to the start time of the previous event. -> T v The mixed signal. Chunk sizes are adapted to the time differences. Explicit ChunkSize parameter is only required for zero padding. Since no ST monad is needed, this can be generalized to Generic.Signal.Transform class.

arrangeList Source

:: (Storable v, C v) => ChunkSize -> T Int (T v) A list of pairs: (relative start time, signal part), The start time is relative to the start time of the previous event. -> T v The mixed signal.

addShiftedMany :: (Storable a, C a) => ChunkSize -> [Int] -> [T a] -> T a Source

addShifted :: (Storable a, C a) => ChunkSize -> Int -> T a -> T a -> T a Source

arrangeEquidist Source

:: (Storable v, C v) => ChunkSize -> T Int (T v) A list of pairs: (relative start time, signal part), The start time is relative to the start time of the previous event. -> T v The mixed signal. The result is a Lazy StorableVector with chunks of the given size. The output is always infinite. If the input is a finite list of finite length sounds, then the output is padded with zeros. Even if we try to terminate the output after the last sound, we would not finish immediately but only at chunk boundaries.

addToBuffer :: (Storable a, C a) => Vector s a -> Int -> T a -> ST s (T a) Source

addToBufferSwitchL :: (Storable a, C a) => Vector s a -> Int -> T a -> ST s (T a) Source

Produced by Haddock version 2.4.2