Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. unsafeLastM :: (Storable a, Monad m) => Vector a -> m a

   rebase	Rebase.Data.Vector.Storable

   No documentation available.

2. unsafeLast :: Unbox a => Vector a -> a

   rebase	Rebase.Data.Vector.Unboxed

   No documentation available.

3. unsafeLastM :: (Unbox a, Monad m) => Vector a -> m a

   rebase	Rebase.Data.Vector.Unboxed

   No documentation available.

4. sinceLastS :: forall (m :: Type -> Type) cl a . Monad m => ClSF m cl a (Diff (Time cl))

   rhine	FRP.Rhine.ClSF.Util

   Continuously return the time difference since the last tick.

5. sinceLast :: TimeInfo cl -> Diff (Time cl)

   rhine	FRP.Rhine.Clock

   Time passed since the last tick

6. module FRP.Rhine.ResamplingBuffer.KeepLast

   A buffer keeping the last value, or zero-order hold.

7. keepLast :: forall (m :: Type -> Type) a cl1 cl2 . Monad m => a -> ResamplingBuffer m cl1 cl2 a a

   rhine	FRP.Rhine.ResamplingBuffer.KeepLast

   Always keeps the last input value, or in case of no input an initialisation value. If cl2 approximates continuity, this behaves like a zero-order hold.

8. LeafLastTime :: forall cl . Time cl -> LastTime cl

   rhine	FRP.Rhine.Schedule

   No documentation available.

9. ParallelLastTime :: forall cl1 cl2 . LastTime cl1 -> LastTime cl2 -> LastTime (ParallelClock cl1 cl2)

   rhine	FRP.Rhine.Schedule

   No documentation available.

10. SequentialLastTime :: forall cl1 cl2 . LastTime cl1 -> LastTime cl2 -> LastTime (SequentialClock cl1 cl2)

    rhine	FRP.Rhine.Schedule

    No documentation available.

Page 94 of many | Previous | Next