Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. volumeEuclidean :: C y => T y -> y

   synthesizer-core	Synthesizer.Plain.Analysis

   Volume based on Energy norm.

2. volumeEuclideanSqr :: C y => T y -> y

   synthesizer-core	Synthesizer.Plain.Analysis

   No documentation available.

3. volumeVectorEuclidean :: (C y, C y yv) => T yv -> y

   synthesizer-core	Synthesizer.Plain.Analysis

   Volume based on Energy norm.

4. volumeVectorEuclideanSqr :: (C y, Sqr y yv) => T yv -> y

   synthesizer-core	Synthesizer.Plain.Analysis

   No documentation available.

5. getRangeFromPyramid :: [T v] -> (Int, Int) -> [v]

   synthesizer-core	Synthesizer.Plain.Filter.NonRecursive

   No documentation available.

6. movingAverageModulatedPyramid :: (C a, C a v) => a -> Int -> Int -> T Int -> T v -> T v

   synthesizer-core	Synthesizer.Plain.Filter.NonRecursive

   The first argument is the amplification. The main reason to introduce it, was to have only a Module constraint instead of Field. This way we can also filter stereo signals. A control value n corresponds to filter window size 2*n+1.

7. pyramid :: C v => T v -> [T v]

   synthesizer-core	Synthesizer.Plain.Filter.NonRecursive

   No documentation available.

8. sumRangeFromPyramid :: C v => [T v] -> (Int, Int) -> v

   synthesizer-core	Synthesizer.Plain.Filter.NonRecursive

   This function should be much faster than sumRange but slower than the recursively implemented movingAverage. However in contrast to movingAverage it should not suffer from cancelation.

9. sumRangeFromPyramidFoldr :: C v => [T v] -> (Int, Int) -> v

   synthesizer-core	Synthesizer.Plain.Filter.NonRecursive

   No documentation available.

10. sumRangeFromPyramidRec :: C v => [T v] -> (Int, Int) -> v

    synthesizer-core	Synthesizer.Plain.Filter.NonRecursive

    No documentation available.

Page 1328 of many | Previous | Next