Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
forceT :: forall (m :: Type -> Type) e a . Monad m => ExceptionalT e m a -> ExceptionalT e m aexplicit-exception Control.Monad.Exception.Synchronous see force
forkMapM :: (a -> IO b) -> [a] -> IO [Either SomeException b]monad-loops Control.Monad.Loops Like mapM, but run all the actions in parallel threads, collecting up the results and returning them all. Does not return until all actions finish.
forkMapM_ :: (a -> IO b) -> [a] -> IO [Maybe SomeException]monad-loops Control.Monad.Loops like forkMapM but without bothering to keep the return values
forkMapM__ :: (a -> IO b) -> [a] -> IO ()monad-loops Control.Monad.Loops like forkMapM_ but not even bothering to track success or failure of the child threads. Still waits for them all though.
foreignKeyColumn :: ForeignKeyViolation -> Textpersistent-sqlite Database.Persist.Sqlite The column of the violated constraint
foreignKeyRowId :: ForeignKeyViolation -> Int64persistent-sqlite Database.Persist.Sqlite The ROWID of the row with the violated foreign key constraint
foreignKeyTable :: ForeignKeyViolation -> Textpersistent-sqlite Database.Persist.Sqlite The table of the violated constraint
forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b)rio RIO.Prelude forM is mapM with its arguments flipped. For a version that ignores the results see forM_.
forM_ :: (Foldable t, Monad m) => t a -> (a -> m b) -> m ()rio RIO.Prelude forM_ is mapM_ with its arguments flipped. For a version that doesn't ignore the results see forM. forM_ is just like for_, but specialised to monadic actions.
forMaybeA :: Applicative f => [a] -> (a -> f (Maybe b)) -> f [b]rio RIO.Prelude forMaybeA == flip mapMaybeA