Hoogle Search

Within LTS Haskell 24.48 (ghc-9.10.3)

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

  1. forkBackgroundLogger :: Capacity -> LogAction IO msg -> IO () -> IO (BackgroundWorker msg)

    co-log-concurrent Colog.Concurrent

    Creates background logger with given Capacity, takes a LogAction that should describe how to write logs. capacity - parameter tells how many in-flight messages are allowed, if that value is reached then user's thread that emits logs is blocked until any message is written. Usually, if the value is chosen reasonably high and if this value is reached it means that the application environment experiences severe problems. N.B. The LogAction is run in the background thread so that logger should not add any thread-specific context to the message. N.B. On exit, even in case of exception thread will dump all values that are in the queue. But it will stop doing that in case if another exception will happen.

    • Exception handing*. forkBackoundLogger forks a private that and does not expect that someone sends it an asynchronous exception. It means that any asynchronous exception is treated as a command to stop the worker. Logger is not aware of synchronous exceptions as well, so handing of the application specific exceptions should be a concern of the logging action.

  2. forM :: forall s t (k :: Type -> Type -> Type) m a b l . (Traversable s t k l, Monoidal m k l, Function l, Object k b, Object k (t b), ObjectPair k b (t b), Object l a, Object l (s a), ObjectPair l (m b) (m (t b)), TraversalObject k t b) => s a -> l a (m b) -> m (t b)

    constrained-categories Control.Category.Constrained.Prelude

    Flipped version of traverse / mapM.

  3. forM_ :: forall t k (l :: Type -> Type -> Type) f a b uk ul . (Foldable t k l, Monoidal f l l, Monoidal f k k, Function l, Arrow k (->), Arrow l (->), ul ~ UnitObject l, uk ~ UnitObject k, uk ~ ul, ObjectPair l ul ul, ObjectPair l (f ul) (f ul), ObjectPair l (f ul) (t a), ObjectPair l ul (t a), ObjectPair l (t a) ul, ObjectPair l (f ul) a, ObjectPair k b (f b), ObjectPair k b ul, ObjectPair k uk uk, ObjectPair k (f uk) a, ObjectPair k (f uk) (f uk)) => t a -> k a (f b) -> f uk

    constrained-categories Control.Category.Constrained.Prelude

    No documentation available.

  4. forM :: forall s t (k :: Type -> Type -> Type) m a b l . (Traversable s t k l, Monoidal m k l, Function l, Object k b, Object k (t b), ObjectPair k b (t b), Object l a, Object l (s a), ObjectPair l (m b) (m (t b)), TraversalObject k t b) => s a -> l a (m b) -> m (t b)

    constrained-categories Control.Monad.Constrained

    Flipped version of traverse / mapM.

  5. forM_ :: forall t k (l :: Type -> Type -> Type) f a b uk ul . (Foldable t k l, Monoidal f l l, Monoidal f k k, Function l, Arrow k (->), Arrow l (->), ul ~ UnitObject l, uk ~ UnitObject k, uk ~ ul, ObjectPair l ul ul, ObjectPair l (f ul) (f ul), ObjectPair l (f ul) (t a), ObjectPair l ul (t a), ObjectPair l (t a) ul, ObjectPair l (f ul) a, ObjectPair k b (f b), ObjectPair k b ul, ObjectPair k uk uk, ObjectPair k (f uk) a, ObjectPair k (f uk) (f uk)) => t a -> k a (f b) -> f uk

    constrained-categories Control.Monad.Constrained

    No documentation available.

  6. forever :: (Monad m k, Function k, Arrow k (->), Object k a, Object k b, Object k (m a), Object k (m (m a)), ObjectPoint k (m b), Object k (m (m b))) => k (m a) (m b)

    constrained-categories Control.Monad.Constrained

    No documentation available.

  7. forM_ :: forall t k (l :: Type -> Type -> Type) f a b uk ul . (Foldable t k l, Monoidal f l l, Monoidal f k k, Function l, Arrow k (->), Arrow l (->), ul ~ UnitObject l, uk ~ UnitObject k, uk ~ ul, ObjectPair l ul ul, ObjectPair l (f ul) (f ul), ObjectPair l (f ul) (t a), ObjectPair l ul (t a), ObjectPair l (t a) ul, ObjectPair l (f ul) a, ObjectPair k b (f b), ObjectPair k b ul, ObjectPair k uk uk, ObjectPair k (f uk) a, ObjectPair k (f uk) (f uk)) => t a -> k a (f b) -> f uk

    constrained-categories Data.Foldable.Constrained

    No documentation available.

  8. forM :: forall s t (k :: Type -> Type -> Type) m a b l . (Traversable s t k l, Monoidal m k l, Function l, Object k b, Object k (t b), ObjectPair k b (t b), Object l a, Object l (s a), ObjectPair l (m b) (m (t b)), TraversalObject k t b) => s a -> l a (m b) -> m (t b)

    constrained-categories Data.Traversable.Constrained

    Flipped version of traverse / mapM.

  9. forAll :: Stream Bool -> Prop Universal

    copilot-language Copilot.Language

    Universal quantification of boolean streams over time.

  10. forAll :: Stream Bool -> Prop Universal

    copilot-language Copilot.Language.Spec

    Universal quantification of boolean streams over time.

Page 205 of many | Previous | Next