synthesizer-0.2: Audio signal processing coded in Haskell Source code Contents Index

Sound.Signal

Synopsis

class C s where singleton :: a -> s a unfoldR :: (acc -> Maybe (y, acc)) -> acc -> (acc, s y) reduceL :: (x -> acc -> Maybe acc) -> acc -> s x -> acc mapAccumL :: (x -> acc -> Maybe (y, acc)) -> acc -> s x -> (acc, s y) (++) :: s a -> s a -> s a zipWith :: (a -> b -> c) -> s a -> s b -> s c generate :: C s => (acc -> Maybe (y, acc)) -> acc -> s y fromList :: C s => [y] -> s y iterate :: C s => (a -> a) -> a -> s a repeat :: C s => a -> s a cycle :: C s => s a -> s a foldL' :: C s => (x -> acc -> acc) -> acc -> s x -> acc lengthSlow :: C s => s a -> Int recourse :: (acc -> Maybe acc) -> acc -> acc crochetL :: C s => (x -> acc -> Maybe (y, acc)) -> acc -> s x -> s y scanL :: C s => (x -> acc -> acc) -> acc -> s x -> s acc map :: C s => (a -> b) -> s a -> s b unzip :: C s => s (a, b) -> (s a, s b) delay1 :: C s => a -> s a -> s a take :: C s => Int -> s a -> s a takeWhile :: C s => (a -> Bool) -> s a -> s a replicate :: C s => Int -> a -> s a zipWith3 :: C s => (a -> b -> c -> d) -> s a -> s b -> s c -> s d zipWith4 :: C s => (a -> b -> c -> d -> e) -> s a -> s b -> s c -> s d -> s e

Documentation

class C s where Source

Methods singleton :: a -> s a Source unfoldR :: (acc -> Maybe (y, acc)) -> acc -> (acc, s y) Source reduceL :: (x -> acc -> Maybe acc) -> acc -> s x -> acc Source mapAccumL :: (x -> acc -> Maybe (y, acc)) -> acc -> s x -> (acc, s y) Source (++) :: s a -> s a -> s a Source zipWith :: (a -> b -> c) -> s a -> s b -> s c Source Instances C [] C T

generate :: C s => (acc -> Maybe (y, acc)) -> acc -> s y Source

fromList :: C s => [y] -> s y Source

iterate :: C s => (a -> a) -> a -> s a Source

repeat :: C s => a -> s a Source

cycle :: C s => s a -> s a Source

foldL' :: C s => (x -> acc -> acc) -> acc -> s x -> acc Source

lengthSlow :: C s => s a -> Int Source

can be used to check against native length implementation

recourse :: (acc -> Maybe acc) -> acc -> acc Source

crochetL :: C s => (x -> acc -> Maybe (y, acc)) -> acc -> s x -> s y Source

scanL :: C s => (x -> acc -> acc) -> acc -> s x -> s acc Source

map :: C s => (a -> b) -> s a -> s b Source

unzip :: C s => s (a, b) -> (s a, s b) Source

delay1 :: C s => a -> s a -> s a Source

This is a fusion friendly implementation of delay. However, in order to be a crochetL the output has the same length as the input, that is, the last element is removed - at least for finite input.

take :: C s => Int -> s a -> s a Source

takeWhile :: C s => (a -> Bool) -> s a -> s a Source

replicate :: C s => Int -> a -> s a Source

zipWith3 :: C s => (a -> b -> c -> d) -> s a -> s b -> s c -> s d Source

zipWith4 :: C s => (a -> b -> c -> d -> e) -> s a -> s b -> s c -> s d -> s e Source

Produced by Haddock version 2.4.2