|Portability||requires multi-parameter type classes
and local universal quantification|
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.
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.
|withParam :: (a -> T s u t b) -> T s u t (a -> b)||Source|
|toTimeScalar :: (C t, C u) => T u t -> T s u t t||Source|
|toTimeDimension :: (C t, C u) => t -> T s u t (T u t)||Source|
|:: Functor f|
|=> f (a -> a)||process chain that shall be looped
|-> f a|
|Create a loop (feedback) from one node to another one.
That is, compute the fix point of a process iteration.
|This corresponds to <*>
|Instead of mixMulti $:: map f xs
the caller should write mixMulti $: mapM f xs
in order to save the user from learning another infix operator.
|Our signal processors have types like f (a -> b -> c).
They could also have the type a -> b -> f c
or f a -> f b -> f c.
We did not choose the last variant for reduction of redundancy in type signatures,
and we did not choose the second variant for easy composition of processors.
However the forms are freely convertible,
and if you prefer the last one because you do not want to sprinkle '($:)' in your code,
then you may want to convert the processors using the following functions,
that can be defined purely in the Applicative class.
|liftP4 :: Applicative f => f (a -> b -> c -> d -> e) -> f a -> f b -> f c -> f d -> f e||Source|
|Produced by Haddock version 2.3.0|