Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. enumFromStepN :: (Vector v a, Num a) => a -> a -> Int -> v a

   rebase	Rebase.Data.Vector.Generic

   No documentation available.

2. enumFromStepN :: (Prim a, Num a) => a -> a -> Int -> Vector a

   rebase	Rebase.Data.Vector.Primitive

   No documentation available.

3. enumFromStepN :: (Storable a, Num a) => a -> a -> Int -> Vector a

   rebase	Rebase.Data.Vector.Storable

   No documentation available.

4. enumFromStepN :: (Unbox a, Num a) => a -> a -> Int -> Vector a

   rebase	Rebase.Data.Vector.Unboxed

   No documentation available.

5. module FRP.Rhine.Clock.FixedStep

   Implements pure clocks ticking at every multiple of a fixed number of steps, and a deterministic schedule for such clocks.

6. data FixedStep (n :: Nat)

   rhine	FRP.Rhine.Clock.FixedStep

   A pure (side effect free) clock with fixed step size, i.e. ticking at multiples of n. The tick rate is in the type signature, which prevents composition of signals at different rates.

7. FixedStep :: forall (n :: Nat) . KnownNat n => FixedStep n

   rhine	FRP.Rhine.Clock.FixedStep

   No documentation available.

8. downsampleFixedStep :: forall (n :: Nat) (m :: Type -> Type) (k :: Nat) a . (KnownNat n, Monad m) => ResamplingBuffer m (FixedStep k) (FixedStep (n * k)) a (Vector n a)

   rhine	FRP.Rhine.Clock.FixedStep

   Resample into a FixedStep clock that ticks n times slower, by collecting all values into a vector.

9. flipFlopHysteresisStep :: Ord a => (a, a) -> BinaryLevel -> a -> BinaryLevel

   synthesizer-core	Synthesizer.Plain.Analysis

   No documentation available.

10. cascadeDiverseStep :: (C a, C a v) => [Parameter a] -> v -> State [v] v

    synthesizer-core	Synthesizer.Plain.Filter.Recursive.Allpass

    No documentation available.

Page 53 of many | Previous | Next