Synthesizer.Dimensional.Process

Light-weight sample parameter inference which will fit most needs. We only do "poor man's inference", only for sample rates. The sample rate will be provided as an argument of a special type T. This argument will almost never be passed explicitly but should be handled by operators analogous to '($)' and '(.)'.

In contrast to the run-time inference approach, we have the static guarantee that the sample rate is fixed before passing a signal to the outside world. However we still need to make it safe that signals that are rendered for one sample rate are not processed with another sample rate.

Documentation

newtype T s u t a

This wraps a function which computes a sample rate dependent result. Sample rate tells how many values per unit are stored for representation of a signal.

The process is labeled with a type variable s which is part the signals. This way we can ensure that signals are only used with the sample rate they are created for.

Constructors

Cons

Fields

process :: T (Recip u) t -> a

Instances

Monad (T s u t)

Functor (T s u t)

MonadFix (T s u t)

Applicative (T s u t)

run :: C u => T (Recip u) t -> (forall s. T s u t a) -> a

Get results from the Process monad. You can obtain only signals (or other values) that do not implicitly depend on the sample rate, that is value without the s type parameter.

withParam :: (a -> T s u t b) -> T s u t (a -> b)

getSampleRate :: C u => T s u t (T (Recip u) t)

toTimeScalar :: (C t, C u) => T u t -> T s u t t

toFrequencyScalar :: (C t, C u) => T (Recip u) t -> T s u t t

toTimeDimension :: (C t, C u) => t -> T s u t (T u t)

toFrequencyDimension :: (C t, C u) => t -> T s u t (T (Recip u) t)

intFromTime :: (C t, C u) => String -> T u t -> T s u t Int

intFromTime98 :: (C t, RealFrac t, C u) => String -> T u t -> T s u t Int

type DimensionGradient u v = Mul (Recip u) v

toGradientScalar :: (C q, C u, C v) => T v q -> T (DimensionGradient u v) q -> T s u q q

loop :: Functor f => f (a -> a) -> f a

pure :: a -> T s u t a

($:) :: Applicative f => f (a -> b) -> f a -> f b

($::) :: (Applicative f, Traversable t) => f (t a -> b) -> t (f a) -> f b

($^) :: Functor f => (a -> b) -> f a -> f b

($#) :: Functor f => f (a -> b) -> a -> f b

(.:) :: (Applicative f, Arrow arrow) => f (arrow b c) -> f (arrow a b) -> f (arrow a c)

(.^) :: (Functor f, Arrow arrow) => arrow b c -> f (arrow a b) -> f (arrow a c)

liftP :: Applicative f => f (a -> b) -> f a -> f b

liftP2 :: Applicative f => f (a -> b -> c) -> f a -> f b -> f c

liftP3 :: Applicative f => f (a -> b -> c -> d) -> f a -> f b -> f c -> f d

liftP4 :: Applicative f => f (a -> b -> c -> d -> e) -> f a -> f b -> f c -> f d -> f e