Synthesizer.Generic.Cut

This module allows abstraction of operations that operate on the time axis and do also work on signal types without sample values. The most distinctive instances are certainly Dirac signals and chunky time values.

Documentation

class Read sig where

Minimal complete definition

null, length

Methods

null :: sig -> Bool

length :: sig -> Int

Instances

Read LazySize

Methods

null :: LazySize -> Bool

length :: LazySize -> Int

Read [y]

Methods

null :: [y] -> Bool

length :: [y] -> Int

Integral a => Read (T a)

Methods

null :: T a -> Bool

length :: T a -> Int

(C a, C a) => Read (T a)

Methods

null :: T a -> Bool

length :: T a -> Int

Storable y => Read (Vector y)

Methods

null :: Vector y -> Bool

length :: Vector y -> Int

Storable y => Read (Vector y)

Methods

null :: Vector y -> Bool

length :: Vector y -> Int

Read (T y)

Methods

null :: T y -> Bool

length :: T y -> Int

Read (Chunk a)

Methods

null :: Chunk a -> Bool

length :: Chunk a -> Int

Integral t => Read (T t y)

Methods

null :: T t y -> Bool

length :: T t y -> Int

Integral t => Read (T t y)

We abuse event lists for efficient representation of piecewise constant signals.

Methods

null :: T t y -> Bool

length :: T t y -> Int

(Read a, Read b) => Read (T a b)

Methods

null :: T a b -> Bool

length :: T a b -> Int

class Read sig => NormalForm sig where

Minimal complete definition

evaluateHead

Methods

evaluateHead :: sig -> ()

Evaluating the first value of the signal is necessary for avoiding a space leaks if you repeatedly drop a prefix from the signal and do not consume something from it.

Instances

NFData y => NormalForm [y]

Methods

evaluateHead :: [y] -> ()

(Integral a, C a, NFData a) => NormalForm (T a)

Methods

evaluateHead :: T a -> ()

(C a, C a, NFData a) => NormalForm (T a)

Methods

evaluateHead :: T a -> ()

Storable y => NormalForm (Vector y)

Methods

evaluateHead :: Vector y -> ()

Storable y => NormalForm (Vector y)

Methods

evaluateHead :: Vector y -> ()

NFData y => NormalForm (T y)

Methods

evaluateHead :: T y -> ()

NormalForm (Chunk a)

Methods

evaluateHead :: Chunk a -> ()

(Integral t, NFData y) => NormalForm (T t y)

Methods

evaluateHead :: T t y -> ()

(NormalForm a, NormalForm b) => NormalForm (T a b)

Methods

evaluateHead :: T a b -> ()

class (Read sig, Monoid sig) => Transform sig where

Minimal complete definition

take, drop, dropMarginRem, splitAt, reverse

Methods

take :: Int -> sig -> sig

drop :: Int -> sig -> sig

dropMarginRem :: Int -> Int -> sig -> (Int, sig)

splitAt :: Int -> sig -> (sig, sig)

reverse :: sig -> sig

Instances

Transform LazySize

Methods

take :: Int -> LazySize -> LazySize

drop :: Int -> LazySize -> LazySize

dropMarginRem :: Int -> Int -> LazySize -> (Int, LazySize)

splitAt :: Int -> LazySize -> (LazySize, LazySize)

reverse :: LazySize -> LazySize

Transform [y]

Methods

take :: Int -> [y] -> [y]

drop :: Int -> [y] -> [y]

dropMarginRem :: Int -> Int -> [y] -> (Int, [y])

splitAt :: Int -> [y] -> ([y], [y])

reverse :: [y] -> [y]

(Integral a, C a) => Transform (T a)

Methods

take :: Int -> T a -> T a

drop :: Int -> T a -> T a

dropMarginRem :: Int -> Int -> T a -> (Int, T a)

splitAt :: Int -> T a -> (T a, T a)

reverse :: T a -> T a

(C a, C a) => Transform (T a)

Methods

take :: Int -> T a -> T a

drop :: Int -> T a -> T a

dropMarginRem :: Int -> Int -> T a -> (Int, T a)

splitAt :: Int -> T a -> (T a, T a)

reverse :: T a -> T a

Storable y => Transform (Vector y)

Methods

take :: Int -> Vector y -> Vector y

drop :: Int -> Vector y -> Vector y

dropMarginRem :: Int -> Int -> Vector y -> (Int, Vector y)

splitAt :: Int -> Vector y -> (Vector y, Vector y)

reverse :: Vector y -> Vector y

Storable y => Transform (Vector y)

Methods

take :: Int -> Vector y -> Vector y

drop :: Int -> Vector y -> Vector y

dropMarginRem :: Int -> Int -> Vector y -> (Int, Vector y)

splitAt :: Int -> Vector y -> (Vector y, Vector y)

reverse :: Vector y -> Vector y

Transform (T y)

Methods

take :: Int -> T y -> T y

drop :: Int -> T y -> T y

dropMarginRem :: Int -> Int -> T y -> (Int, T y)

splitAt :: Int -> T y -> (T y, T y)

reverse :: T y -> T y

Transform (Chunk a)

Methods

take :: Int -> Chunk a -> Chunk a

drop :: Int -> Chunk a -> Chunk a

dropMarginRem :: Int -> Int -> Chunk a -> (Int, Chunk a)

splitAt :: Int -> Chunk a -> (Chunk a, Chunk a)

reverse :: Chunk a -> Chunk a

(Integral t, C t) => Transform (T t y)

Methods

take :: Int -> T t y -> T t y

drop :: Int -> T t y -> T t y

dropMarginRem :: Int -> Int -> T t y -> (Int, T t y)

splitAt :: Int -> T t y -> (T t y, T t y)

reverse :: T t y -> T t y

(Integral t, C t) => Transform (T t y)

The function defined here are based on the interpretation of event lists as piecewise constant signals. They do not fit to the interpretation of atomic events. Because e.g. it makes no sense to split an atomic event into two instances by splitAt, and it is also not clear, whether dropping the first chunk shall leave a chunk of length zero or remove that chunk completely.

However, sometimes we also need lists of events. In this case the reverse method would be different. For an event-oriented instance of EventList.TimeTime see NoteOffList in synthesizer-alsa package.

Methods

take :: Int -> T t y -> T t y

drop :: Int -> T t y -> T t y

dropMarginRem :: Int -> Int -> T t y -> (Int, T t y)

splitAt :: Int -> T t y -> (T t y, T t y)

reverse :: T t y -> T t y

(Transform a, Transform b) => Transform (T a b)

Methods

take :: Int -> T a b -> T a b

drop :: Int -> T a b -> T a b

dropMarginRem :: Int -> Int -> T a b -> (Int, T a b)

splitAt :: Int -> T a b -> (T a b, T a b)

reverse :: T a b -> T a b

dropMarginRemChunky :: Transform sig => (sig -> [Int]) -> Int -> Int -> sig -> (Int, sig)

intToChunky :: (C a, C a) => String -> Int -> T a

intToChunky98 :: (Num a, C a) => String -> Int -> T a

empty :: Monoid sig => sig

cycle :: Monoid sig => sig -> sig

append :: Monoid sig => sig -> sig -> sig

concat :: Monoid sig => [sig] -> sig

lengthAtLeast :: Transform sig => Int -> sig -> Bool

Like lengthAtLeast n xs = length xs >= n, but is more efficient, because it is more lazy.

lengthAtMost :: Transform sig => Int -> sig -> Bool

sliceVertical :: Transform sig => Int -> sig -> T sig