Hoogle Search
Within LTS Haskell 24.64 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
hWaitForInput :: MonadIO m => Handle -> Int -> m Boolunliftio UnliftIO.IO Lifted version of hWaitForInput
pooledForConcurrently :: (MonadUnliftIO m, Traversable t) => t a -> (a -> m b) -> m (t b)unliftio UnliftIO.Internals.Async Similar to pooledForConcurrentlyN but with number of threads set from getNumCapabilities. Usually this is useful for CPU bound tasks.
pooledForConcurrentlyN :: (MonadUnliftIO m, Traversable t) => Int -> t a -> (a -> m b) -> m (t b)unliftio UnliftIO.Internals.Async Similar to pooledMapConcurrentlyN but with flipped arguments.
pooledForConcurrentlyN_ :: (MonadUnliftIO m, Foldable t) => Int -> t a -> (a -> m b) -> m ()unliftio UnliftIO.Internals.Async Like pooledMapConcurrentlyN_ but with flipped arguments.
pooledForConcurrently_ :: (MonadUnliftIO m, Foldable f) => f a -> (a -> m b) -> m ()unliftio UnliftIO.Internals.Async Like pooledMapConcurrently_ but with flipped arguments.
showCommandForUser :: FilePath -> [String] -> Stringunliftio UnliftIO.Process Given a program p and arguments args, showCommandForUser p args returns a string suitable for pasting into /bin/sh (on Unix systems) or CMD.EXE (on Windows).
waitForProcess :: MonadIO m => ProcessHandle -> m ExitCodeunliftio UnliftIO.Process Lifted waitForProcess.
unfoldForest :: forall (m :: Type -> Type) a . Monad m => (a -> [a]) -> a -> [TreeT m a]hedgehog Hedgehog.Internal.Tree Create a forest from a value and an unfolding function.
transformMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m b) -> a -> m bmicrolens Lens.Micro Transform every element by recursively applying a given ASetter in a bottom-up manner with a monadic effect.
transformOf :: ASetter a b a b -> (b -> b) -> a -> bmicrolens Lens.Micro Transform every element by recursively applying a given ASetter in a bottom-up manner.