Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. LEStep :: forall (n :: Nat) (m1 :: Nat) . LEProof n m1 -> LEProof n ('S m1)

   fin	Data.Type.Nat.LE.ReflStep

   No documentation available.

2. leStep :: forall (n :: Nat) (m :: Nat) . LEProof n m -> LEProof n ('S m)

   fin	Data.Type.Nat.LE.ReflStep

3. leStepL :: forall (n :: Nat) (m :: Nat) . LEProof ('S n) m -> LEProof n m

   fin	Data.Type.Nat.LE.ReflStep

4. enumFromStepN :: Num a => a -> a -> Int -> Vector a

   rebase	Rebase.Data.Vector

   No documentation available.

5. enumFromStepN :: forall a (m :: Type -> Type) . (Num a, Monad m) => a -> a -> Int -> Stream m a

   rebase	Rebase.Data.Vector.Fusion.Stream.Monadic

   Yield a Stream of the given length containing the values x, x+y, x+y+y etc.

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

   rebase	Rebase.Data.Vector.Generic

   No documentation available.

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

   rebase	Rebase.Data.Vector.Primitive

   No documentation available.

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

   rebase	Rebase.Data.Vector.Storable

   No documentation available.

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

   rebase	Rebase.Data.Vector.Unboxed

   No documentation available.

10. 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.

Page 51 of many | Previous | Next