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. forestCursorSelection :: ForestCursor a b -> Int

   cursor	Cursor.Simple.Forest

   No documentation available.

2. forestCursorSwapNext :: ForestCursor a b -> Maybe (ForestCursor a b)

   cursor	Cursor.Simple.Forest

   Swaps the current node with the next node on the same level Example: Before:

   - a <--
   - b
   

   After:

   - b
   - a <--
   

3. forestCursorSwapPrev :: ForestCursor a b -> Maybe (ForestCursor a b)

   cursor	Cursor.Simple.Forest

   Swaps the current node with the previous node on the same level Example: Before:

   - a
   - b <--
   

   After:

   - b <--
   - a
   

4. forestCursorToggleCurrentForest :: ForestCursor a b -> Maybe (ForestCursor a b)

   cursor	Cursor.Simple.Forest

   No documentation available.

5. forestCursorToggleCurrentForestRecursively :: ForestCursor a b -> Maybe (ForestCursor a b)

   cursor	Cursor.Simple.Forest

   No documentation available.

6. for'_ :: forall t a f (es :: [Effect]) (ff :: (Type -> Type) -> Type -> Type) (c :: (Type -> Type) -> Constraint) . (Free c ff, f ~ Eff ff es, In (For t) es) => t (f a) -> f (t a)

   data-effects	Data.Effect.Concurrent.Parallel

   Executes in parallel the actions stored within a Traversable container t.

7. forToParallel :: forall (t :: Type -> Type) a (es :: [Effect]) (ff :: (Type -> Type) -> Type -> Type) (c :: (Type -> Type) -> Constraint) . (Parallel :> es, Traversable t, Applicative (Eff ff es), Free c ff) => For t (Eff ff es) a -> Eff ff es a

   data-effects	Data.Effect.Concurrent.Parallel

   Converts the Traversable container-based parallel computation effect For into the Applicative-based parallel computation effect Parallel.

8. forkBoundThread :: MonadDejaFu m => Maybe (m (BoundThread m a))

   dejafu	Test.DejaFu.Types

   Fork a new bound thread, if the monad supports them.

9. forkFinally :: forall (es :: [Effect]) a . (HasCallStack, Concurrent :> es) => Eff es a -> (Either SomeException a -> Eff es ()) -> Eff es ThreadId

   effectful	Effectful.Concurrent

   Lifted forkFinally.

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

    effectful	Effectful.Concurrent

    Lifted forkIO.

Page 111 of many | Previous | Next