Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. LoopingForever :: GifLooping

   diagrams-rasterific	Diagrams.Backend.Rasterific

   The animation will restart once the end is reached

2. awaitForever :: forall (m :: Type -> Type) i o r . Monad m => (i -> ConduitT i o m r) -> ConduitT i o m ()

   classy-prelude-conduit	ClassyPrelude.Conduit

   Wait for input forever, calling the given inner component for each piece of new input. This function is provided as a convenience for the common pattern of awaiting input, checking if it's Just and then looping. Since 0.5.0

3. peekForever :: forall (m :: Type -> Type) i o . Monad m => ConduitT i o m () -> ConduitT i o m ()

   classy-prelude-conduit	ClassyPrelude.Conduit

   Run a consuming conduit repeatedly, only stopping when there is no more data available from upstream.

4. peekForeverE :: forall (m :: Type -> Type) i o . (Monad m, MonoFoldable i) => ConduitT i o m () -> ConduitT i o m ()

   classy-prelude-conduit	ClassyPrelude.Conduit

   Run a consuming conduit repeatedly, only stopping when there is no more data available from upstream. In contrast to peekForever, this function will ignore empty chunks of data. So for example, if a stream of data contains an empty ByteString, it is still treated as empty, and the consuming function is not called.

5. awaitForever :: forall i o u (m :: Type -> Type) a . (i -> Pipe i o u m a) -> Pipe i o u m u

   conduino	Data.Conduino

   A useful utility function over repeated awaits. Will repeatedly await and then continue with the given pipe whenever the upstream pipe yields. Can be used to implement many pipe combinators:

   map f = awaitForever $ x -> yield (f x)
   

6. mrgForever :: (Applicative m, TryMerge m, Mergeable b, Mergeable a) => m a -> m b

   grisette	Grisette.Lib.Control.Monad

   forever with MergingStrategy knowledge propagation.

7. mrgForever :: (Applicative m, TryMerge m, Mergeable b, Mergeable a) => m a -> m b

   grisette	Grisette.Unified.Lib.Control.Monad

   forever with MergingStrategy knowledge propagation.

8. LoopingForever :: GifLooping

   massiv-io	Data.Massiv.Array.IO

   The animation will restart once the end is reached

9. playForever :: MonadIO m => Chunk -> m ()

   sdl2-mixer	SDL.Mixer

   Same as play, but keeps playing the Chunk forever.

10. awaitForever :: forall (m :: Type -> Type) i o r . Monad m => (i -> ConduitT i o m r) -> ConduitT i o m ()

    classy-prelude-yesod	ClassyPrelude.Yesod

    Wait for input forever, calling the given inner component for each piece of new input. This function is provided as a convenience for the common pattern of awaiting input, checking if it's Just and then looping. Since 0.5.0

Page 7 of many | Previous | Next