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.

  1. forkOnWithUnmaskN :: MonadConc m => String -> Int -> ((forall a . () => m a -> m a) -> m ()) -> m (ThreadId m)

    concurrency Control.Monad.Conc.Class

    Like forkWithUnmaskN, but the child thread is pinned to the given CPU, as with forkOn. 

    forkOnWithUnmaskN _ = forkOnWithUnmask

  2. forkWithUnmask :: MonadConc m => ((forall a . () => m a -> m a) -> m ()) -> m (ThreadId m)

    concurrency Control.Monad.Conc.Class

    Like fork, but the child thread is passed a function that can be used to unmask asynchronous exceptions. This function should not be used within a mask or uninterruptibleMask. 

    forkWithUnmask = forkWithUnmaskN ""

  3. forkWithUnmaskN :: MonadConc m => String -> ((forall a . () => m a -> m a) -> m ()) -> m (ThreadId m)

    concurrency Control.Monad.Conc.Class

    Like forkWithUnmask, but the thread is given a name which may be used to present more useful debugging information. 

    forkWithUnmaskN _ = forkWithUnmask

  4. formatExternal :: Externalize ξ => ξ -> Rope

    core-data Core.Encoding.External

    Convert a value into an authoritative, stable textual representation for use externally.

  5. forevery :: Searchable a => (a -> Bool) -> Bool

    countable Data.Searchable

    No documentation available.

  6. forsome :: Searchable a => (a -> Bool) -> Bool

    countable Data.Searchable

    No documentation available.

  7. format :: TimeFormat -> Minute -> Hour -> String

    cron System.Cron.Internal.Describe.Time

    No documentation available.

  8. forkJob :: Job -> IO ThreadId

    cron System.Cron.Schedule

    Start a job-runner thread that runs a job at appropriate intervals. Each time it is run, a new thread is forked for it, meaning that a single exception does not take down the scheduler.

  9. forMany :: forall c r (xs :: [Type]) . Collect c r xs => c r xs -> Many xs -> Collector c xs r

    data-diverse Data.Diverse.Many

    Folds any Many, even with indistinct types. Given distinct handlers for the fields in Many, create AFoldable of the results of running the handlers over the fields in Many. 

    let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ (6 :: Int) ./ Just 'A' ./ nil
y = show @Int ./ show @Char ./ show @(Maybe Char) ./ show @Bool ./ nil
afoldr (:) [] (forMany (cases y) x) `shouldBe`
["5", "False", "'X'", "Just 'O'", "6", "Just 'A'"]

  10. forManyN :: forall c r (n :: Nat) (xs :: [Type]) . CollectN c r n xs => c r n xs -> Many xs -> CollectorN c n xs r

    data-diverse Data.Diverse.Many

    Folds any Many, even with indistinct types. Given index handlers for the fields in Many, create AFoldable of the results of running the handlers over the fields in Many. 

    let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ (6 :: Int) ./ Just 'A' ./ nil
y = show @Int ./ show @Bool ./ show @Char ./ show @(Maybe Char) ./ show @Int ./ show @(Maybe Char) ./ nil
afoldr (:) [] (forManyN (casesN y) x) `shouldBe`
["5", "False", "'X'", "Just 'O'", "6", "Just 'A'"]

Page 136 of many | Previous | Next