Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

Exact lookup

1. forstmt :: Maybe Expr -> Maybe Expr -> Maybe Expr -> [Stmt] -> Stmt

   language-c99-simple	Language.C99.Simple.Translate

   No documentation available.

2. fortuneDistributionWhere :: (FortuneFile -> Int -> IndexEntry -> IO Bool) -> [FortuneFile] -> IO (Categorical Float (FortuneFile, Categorical Float Int))

   misfortune	Data.Fortune

   Like defaultFortuneDistribution, but filtering the fortunes. In addition to the fortune file, the tuples in the distribution include a distribution over the matching fortune indices in that file, assigning equal weight to each.

3. fortuneFilePath :: FortuneFile -> FilePath

   misfortune	Data.Fortune

   Get the path of the text part of an open fortune database.

4. fortuneIndexPath :: FortuneFile -> FilePath

   misfortune	Data.Fortune

   Get the path of the index part of an open fortune database.

5. forkM :: forall (m :: Type -> Type) t . MonadPeelIO m => MState t m () -> MState t m ThreadId

   mstate	Control.Concurrent.MState

   Start a new stateful thread.

6. forkM_ :: forall (m :: Type -> Type) t . MonadPeelIO m => MState t m () -> MState t m ()

   mstate	Control.Concurrent.MState

   No documentation available.

7. fork :: ForkIO io => io () -> io ThreadId

   network-house	Net.Concurrent

   No documentation available.

8. formatter :: Config -> Formatter

   network-messagepack-rpc	Network.MessagePack.RPC.Client

   No documentation available.

9. fore :: Functor f => (a -> f a) -> NonEmptySeq a -> f (NonEmptySeq a)

   non-empty-sequence	Data.Sequence.NonEmpty

   van Laarhoven lens for the first element

10. forest :: forall (t :: Type -> Type) a . PosType t => TreePos t a -> Forest a

    rosezipper	Data.Tree.Zipper

    All trees at this location (i.e., the current tree---if any---and its siblings).

Page 242 of many | Previous | Next