|
Synthesizer.Filter.TwoWay |
|
|
|
Synopsis |
|
|
|
Documentation |
|
|
A TwoWay.Signal stores values of the past and the future
| Constructors | | Instances | |
|
|
|
Take n values starting from time zero.
If you want clips from elsewhere,
call take after delay.
|
|
|
|
|
Take the value at time zero.
|
|
|
A signal that consists entirely of ones
|
|
|
shift signal in time,
keep all values but if required pad with zeros
|
|
|
|
|
shift signal in time,
zero values at either ends will be flushed
|
|
|
Delay by one sample.
|
|
|
|
|
|
|
General routine that supports delaying and prefetching
using a general one-sample delaying routine.
|
|
|
|
flipPair :: (a, b) -> (b, a) | Source |
|
for a Signal this means a reversion of the elements
|
|
|
|
|
Unmodulated non-recursive filter
|
|
|
Modulated non-recursive filter.
The number of values before time 0 (past) or
the filter mask lengths must be at most finite.
|
|
|
Interpolation allowing negative frequencies,
but requires storage of all past values.
|
|
|
|
|
|
|
|
|
|
|
Description of a basic filter that can be used in larger networks.
| Constructors | Mask [a] | A static filter described by its mask
| ModMask (Signal [a]) | A modulated filter described by a list of masks
| FracDelay (T t v) t | Delay the signal by a fractional amount of samples.
This is achieved by interpolation.
| ModFracDelay (T t v) (Signal t) | Delay with varying delay times.
| Delay Int | Delay the signal by given amount of samples.
| Past [v] | Replace the past by the given one.
This must be present in each recursive filter cycle
to let the magic work!
|
| Instances | |
|
|
Produced by Haddock version 2.4.2 |