Copyright	(c) Henning Thielemann 2008-2011
License	GPL
Maintainer	synthesizer@henning-thielemann.de
Stability	provisional
Portability	requires multi-parameter type classes
Safe Haskell	Safe-Inferred
Language	Haskell2010

Synthesizer.Plain.Filter.Recursive.FirstOrder

Description

First order low pass and high pass filter.

Synopsis

newtype Parameter a = Parameter {
- getParameter :: a
}
parameter :: C a => a -> Parameter a
lowpassStep :: (C a, C a v) => Parameter a -> v -> State v v
lowpassModifierInit :: (C a, C a v) => Initialized v v (Parameter a) v v
lowpassModifier :: (C a, C a v) => Simple v (Parameter a) v v
lowpassCausal :: (C a, C a v) => T (Parameter a, v) v
lowpassInit :: (C a, C a v) => v -> T (Parameter a) -> T v -> T v
lowpass :: (C a, C a v) => T (Parameter a) -> T v -> T v
highpassStep :: (C a, C a v) => Parameter a -> v -> State v v
highpassModifierInit :: (C a, C a v) => Initialized v v (Parameter a) v v
highpassModifier :: (C a, C a v) => Simple v (Parameter a) v v
highpassInit :: (C a, C a v) => v -> T (Parameter a) -> T v -> T v
highpassInitAlt :: (C a, C a v) => v -> T (Parameter a) -> T v -> T v
highpass :: (C a, C a v) => T (Parameter a) -> T v -> T v
data Result a = Result {
- highpass_, lowpass_ :: !a
}
step :: C a v => Parameter a -> v -> State v (Result v)
modifierInit :: C a v => Initialized v v (Parameter a) v (Result v)
modifier :: C a v => Simple v (Parameter a) v (Result v)
causal :: C a v => T (Parameter a, v) (Result v)
causalInit :: C a v => v -> T (Parameter a, v) (Result v)

Documentation

newtype Parameter a Source #

Constructors

Parameter
Fields getParameter :: a

Instances

Instances details

Foldable Parameter Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods fold :: Monoid m => Parameter m -> m # foldMap :: Monoid m => (a -> m) -> Parameter a -> m # foldMap' :: Monoid m => (a -> m) -> Parameter a -> m # foldr :: (a -> b -> b) -> b -> Parameter a -> b # foldr' :: (a -> b -> b) -> b -> Parameter a -> b # foldl :: (b -> a -> b) -> b -> Parameter a -> b # foldl' :: (b -> a -> b) -> b -> Parameter a -> b # foldr1 :: (a -> a -> a) -> Parameter a -> a # foldl1 :: (a -> a -> a) -> Parameter a -> a # toList :: Parameter a -> [a] # null :: Parameter a -> Bool # length :: Parameter a -> Int # elem :: Eq a => a -> Parameter a -> Bool # maximum :: Ord a => Parameter a -> a # minimum :: Ord a => Parameter a -> a # sum :: Num a => Parameter a -> a # product :: Num a => Parameter a -> a #
Traversable Parameter Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods traverse :: Applicative f => (a -> f b) -> Parameter a -> f (Parameter b) # sequenceA :: Applicative f => Parameter (f a) -> f (Parameter a) # mapM :: Monad m => (a -> m b) -> Parameter a -> m (Parameter b) # sequence :: Monad m => Parameter (m a) -> m (Parameter a) #
Applicative Parameter Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods pure :: a -> Parameter a # (<>) :: Parameter (a -> b) -> Parameter a -> Parameter b # liftA2 :: (a -> b -> c) -> Parameter a -> Parameter b -> Parameter c # (>) :: Parameter a -> Parameter b -> Parameter b # (<*) :: Parameter a -> Parameter b -> Parameter a #
Functor Parameter Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods fmap :: (a -> b) -> Parameter a -> Parameter b # (<$) :: a -> Parameter b -> Parameter a #
C a v => C a (Parameter v) Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods scaleAndAccumulate :: (a, Parameter v) -> (Parameter v, Parameter v -> Parameter v) Source #
Arbitrary a => Arbitrary (Parameter a) Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods arbitrary :: Gen (Parameter a) # shrink :: Parameter a -> [Parameter a] #
Storable a => Storable (Parameter a) Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods sizeOf :: Parameter a -> Int # alignment :: Parameter a -> Int # peekElemOff :: Ptr (Parameter a) -> Int -> IO (Parameter a) # pokeElemOff :: Ptr (Parameter a) -> Int -> Parameter a -> IO () # peekByteOff :: Ptr b -> Int -> IO (Parameter a) # pokeByteOff :: Ptr b -> Int -> Parameter a -> IO () # peek :: Ptr (Parameter a) -> IO (Parameter a) # poke :: Ptr (Parameter a) -> Parameter a -> IO () #
Show a => Show (Parameter a) Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods showsPrec :: Int -> Parameter a -> ShowS # show :: Parameter a -> String # showList :: [Parameter a] -> ShowS #
Eq a => Eq (Parameter a) Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods (==) :: Parameter a -> Parameter a -> Bool # (/=) :: Parameter a -> Parameter a -> Bool #

parameter :: C a => a -> Parameter a Source #

Convert cut-off frequency to feedback factor.

lowpassStep :: (C a, C a v) => Parameter a -> v -> State v v Source #

lowpassModifierInit :: (C a, C a v) => Initialized v v (Parameter a) v v Source #

lowpassModifier :: (C a, C a v) => Simple v (Parameter a) v v Source #

lowpassCausal :: (C a, C a v) => T (Parameter a, v) v Source #

lowpassInit :: (C a, C a v) => v -> T (Parameter a) -> T v -> T v Source #

lowpass :: (C a, C a v) => T (Parameter a) -> T v -> T v Source #

highpassStep :: (C a, C a v) => Parameter a -> v -> State v v Source #

highpassModifierInit :: (C a, C a v) => Initialized v v (Parameter a) v v Source #

highpassModifier :: (C a, C a v) => Simple v (Parameter a) v v Source #

highpassInit :: (C a, C a v) => v -> T (Parameter a) -> T v -> T v Source #

highpassInitAlt :: (C a, C a v) => v -> T (Parameter a) -> T v -> T v Source #

highpass :: (C a, C a v) => T (Parameter a) -> T v -> T v Source #

data Result a Source #

Constructors

Result
Fields highpass_, lowpass_ :: !a

Instances

Instances details

Foldable Result Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods fold :: Monoid m => Result m -> m # foldMap :: Monoid m => (a -> m) -> Result a -> m # foldMap' :: Monoid m => (a -> m) -> Result a -> m # foldr :: (a -> b -> b) -> b -> Result a -> b # foldr' :: (a -> b -> b) -> b -> Result a -> b # foldl :: (b -> a -> b) -> b -> Result a -> b # foldl' :: (b -> a -> b) -> b -> Result a -> b # foldr1 :: (a -> a -> a) -> Result a -> a # foldl1 :: (a -> a -> a) -> Result a -> a # toList :: Result a -> [a] # null :: Result a -> Bool # length :: Result a -> Int # elem :: Eq a => a -> Result a -> Bool # maximum :: Ord a => Result a -> a # minimum :: Ord a => Result a -> a # sum :: Num a => Result a -> a # product :: Num a => Result a -> a #
Traversable Result Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods traverse :: Applicative f => (a -> f b) -> Result a -> f (Result b) # sequenceA :: Applicative f => Result (f a) -> f (Result a) # mapM :: Monad m => (a -> m b) -> Result a -> m (Result b) # sequence :: Monad m => Result (m a) -> m (Result a) #
Applicative Result Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods pure :: a -> Result a # (<>) :: Result (a -> b) -> Result a -> Result b # liftA2 :: (a -> b -> c) -> Result a -> Result b -> Result c # (>) :: Result a -> Result b -> Result b # (<*) :: Result a -> Result b -> Result a #
Functor Result Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods fmap :: (a -> b) -> Result a -> Result b # (<$) :: a -> Result b -> Result a #
C a v => C a (Result v) Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods (*>) :: a -> Result v -> Result v #
Arbitrary a => Arbitrary (Result a) Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods arbitrary :: Gen (Result a) # shrink :: Result a -> [Result a] #
Storable a => Storable (Result a) Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods sizeOf :: Result a -> Int # alignment :: Result a -> Int # peekElemOff :: Ptr (Result a) -> Int -> IO (Result a) # pokeElemOff :: Ptr (Result a) -> Int -> Result a -> IO () # peekByteOff :: Ptr b -> Int -> IO (Result a) # pokeByteOff :: Ptr b -> Int -> Result a -> IO () # peek :: Ptr (Result a) -> IO (Result a) # poke :: Ptr (Result a) -> Result a -> IO () #
Eq a => Eq (Result a) Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods (==) :: Result a -> Result a -> Bool # (/=) :: Result a -> Result a -> Bool #
C v => C (Result v) Source #
Instance details Defined in Synthesizer.Plain.Filter.Recursive.FirstOrder Methods zero :: Result v # (+) :: Result v -> Result v -> Result v # (-) :: Result v -> Result v -> Result v # negate :: Result v -> Result v #

step :: C a v => Parameter a -> v -> State v (Result v) Source #

modifierInit :: C a v => Initialized v v (Parameter a) v (Result v) Source #

modifier :: C a v => Simple v (Parameter a) v (Result v) Source #

causal :: C a v => T (Parameter a, v) (Result v) Source #

causalInit :: C a v => v -> T (Parameter a, v) (Result v) Source #