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.

  1. forAllT :: forall (m :: Type -> Type) a . (Monad m, Show a, HasCallStack) => GenT m a -> PropertyT m a

    hedgehog Hedgehog.Internal.Property

    Generates a random input for the test by running the provided generator.

  2. forAllWith :: forall (m :: Type -> Type) a . (Monad m, HasCallStack) => (a -> String) -> Gen a -> PropertyT m a

    hedgehog Hedgehog.Internal.Property

    Generates a random input for the test by running the provided generator. This is a the same as forAll but allows the user to provide a custom rendering function. This is useful for values which don't have a Show instance.

  3. forAllWithT :: forall (m :: Type -> Type) a . (Monad m, HasCallStack) => (a -> String) -> GenT m a -> PropertyT m a

    hedgehog Hedgehog.Internal.Property

    Generates a random input for the test by running the provided generator. This is a the same as forAllT but allows the user to provide a custom rendering function. This is useful for values which don't have a Show instance.

  4. forOf :: LensLike f s t a b -> s -> (a -> f b) -> f t

    microlens Lens.Micro

    traverseOf with flipped arguments. Useful if the “loop body” is a lambda or a do block.

  5. forOf_ :: Functor f => Getting (Traversed r f) s a -> s -> (a -> f r) -> f ()

    microlens Lens.Micro

    traverseOf_ with flipped arguments. Useful if the “loop body” is a lambda or a do block, or in some other cases – for instance, you can avoid accidentally using for_ on a tuple or Either by switching to forOf_ each. Or you can write custom loops like these: 

    forOf_ both (a, b) $ \x ->
...
forOf_ each [1..10] $ \x ->
...
forOf_ (each . _Right) $ \x ->
...

  6. for1_ :: (Foldable1 t, Apply f) => t a -> (a -> f b) -> f ()

    semigroupoids Data.Semigroup.Foldable

    No documentation available.

  7. forkFinally :: IO a -> (Either SomeException a -> IO ()) -> IO ThreadId

    base-compat Control.Concurrent.Compat

    Fork a thread and call the supplied function when the thread is about to terminate, with an exception or a returned value. The function is called with asynchronous exceptions masked. 

    forkFinally action and_then =
mask $ \restore ->
forkIO $ try (restore action) >>= and_then
    This function is useful for informing the parent when a child terminates, for example.

  8. forkOSWithUnmask :: ((forall a . () => IO a -> IO a) -> IO ()) -> IO ThreadId

    base-compat Control.Concurrent.Compat

    Like forkIOWithUnmask, but the child thread is a bound thread, as with forkOS.

  9. forAccumM :: (Monad m, Traversable t) => s -> t a -> (s -> a -> m (s, b)) -> m (s, t b)

    base-compat Data.Traversable.Compat

    forAccumM is mapAccumM with the arguments rearranged.

  10. forcePair :: (a, b) -> (a, b)

    utility-ht Data.Tuple.HT

    No documentation available.

Page 20 of many | Previous | Next