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.

Exact lookup

1. forkIOWithUnmask :: forall (es :: [Effect]) . (HasCallStack, Concurrent :> es) => ((forall a . () => Eff es a -> Eff es a) -> Eff es ()) -> Eff es ThreadId

   effectful	Effectful.Concurrent

   Lifted forkIOWithUnmask.

2. forkOS :: forall (es :: [Effect]) . (HasCallStack, Concurrent :> es) => Eff es () -> Eff es ThreadId

   effectful	Effectful.Concurrent

   Lifted forkOS.

3. forkOSWithUnmask :: forall (es :: [Effect]) . (HasCallStack, Concurrent :> es) => ((forall a . () => Eff es a -> Eff es a) -> Eff es ()) -> Eff es ThreadId

   effectful	Effectful.Concurrent

   Lifted forkOSWithUnmask.

4. forkOn :: forall (es :: [Effect]) . (HasCallStack, Concurrent :> es) => Int -> Eff es () -> Eff es ThreadId

   effectful	Effectful.Concurrent

   Lifted forkOn.

5. forkOnWithUnmask :: forall (es :: [Effect]) . (HasCallStack, Concurrent :> es) => Int -> ((forall a . () => Eff es a -> Eff es a) -> Eff es ()) -> Eff es ThreadId

   effectful	Effectful.Concurrent

   Lifted forkOnWithUnmask.

6. forConcurrently :: forall f (es :: [Effect]) a b . (HasCallStack, Traversable f, Concurrent :> es) => f a -> (a -> Eff es b) -> Eff es (f b)

   effectful	Effectful.Concurrent.Async

   Lifted forConcurrently.

7. forConcurrently_ :: forall f (es :: [Effect]) a b . (HasCallStack, Foldable f, Concurrent :> es) => f a -> (a -> Eff es b) -> Eff es ()

   effectful	Effectful.Concurrent.Async

   Lifted forConcurrently_.

8. forest :: Topology a -> Forest a

   elynx-tree	ELynx.Topology.Rooted

   No documentation available.

9. forest :: Tree e a -> Forest e a

   elynx-tree	ELynx.Tree.Rooted

   No documentation available.

10. forI :: (PrimMonad m, MVector v a) => v (PrimState m) a -> (Int -> m ()) -> m ()

    fixed-vector	Data.Vector.Fixed.Mutable

    Loop which calls function for each index

Page 112 of many | Previous | Next