Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. FinallyToken :: TokenPosn -> String -> [CommentAnnotation] -> Token

    language-javascript Language.JavaScript.Parser.Lexer

    No documentation available.

  2. Finally' :: Reserved

    yi-mode-javascript Yi.Lexer.JavaScript

    No documentation available.

  3. forkFinally :: IO a -> (Either SomeException a -> IO ()) -> IO ThreadId

    base Control.Concurrent

    Fork a thread and call the supplied function when the thread is about to terminate, with an exception or a returned value. The function is called with asynchronous exceptions masked.

    forkFinally action and_then =
    mask $ \restore ->
    forkIO $ try (restore action) >>= and_then
    
    This function is useful for informing the parent when a child terminates, for example.

  4. forkFinally :: MonadUnliftIO m => m a -> (Either SomeException a -> m ()) -> m ThreadId

    unliftio UnliftIO.Concurrent

    Unlifted version of forkFinally.

  5. forkFinally :: IO a -> (Either SomeException a -> IO ()) -> IO ThreadId

    base-compat Control.Concurrent.Compat

    Fork a thread and call the supplied function when the thread is about to terminate, with an exception or a returned value. The function is called with asynchronous exceptions masked.

    forkFinally action and_then =
    mask $ \restore ->
    forkIO $ try (restore action) >>= and_then
    
    This function is useful for informing the parent when a child terminates, for example.

  6. jTryCatchFinally :: (Ident -> JStgStat) -> (Ident -> JStgStat) -> (Ident -> JStgStat) -> JSM JStgStat

    ghc GHC.JS.Make

    As with "jForIn" but creating a "for each in" statement.

  7. forkFinally :: MonadBaseControl IO m => m a -> (Either SomeException a -> m ()) -> m ThreadId

    lifted-base Control.Concurrent.Lifted

    Generalized version of forkFinally. Note that in forkFinally action and_then, while the forked action and the and_then function have access to the captured state, all their side-effects in m are discarded. They're run only for their side-effects in IO.

  8. forkFinally :: IO a -> (Either SomeException a -> IO ()) -> IO ThreadId

    protolude Protolude

    Fork a thread and call the supplied function when the thread is about to terminate, with an exception or a returned value. The function is called with asynchronous exceptions masked.

    forkFinally action and_then =
    mask $ \restore ->
    forkIO $ try (restore action) >>= and_then
    
    This function is useful for informing the parent when a child terminates, for example.

  9. manyFinally :: PolyParse p => p a -> p z -> p [a]

    graphviz Data.GraphViz.Parsing

    manyFinally e t parses a possibly-empty sequence of e's, terminated by a t. The final t is discarded. Any parse failures could be due either to a badly-formed terminator or a badly-formed element, so it raises both possible errors.

  10. manyFinally' :: (PolyParse p, Show a) => p a -> p z -> p [a]

    graphviz Data.GraphViz.Parsing

    manyFinally' is like manyFinally, except when the terminator parser overlaps with the element parser. In manyFinally e t, the parser t is tried only when parser e fails, whereas in manyFinally' e t, the parser t is always tried first, then parser e only if the terminator is not found. For instance, manyFinally (accept "01") (accept "0") on input "0101010" returns ["01","01","01"], whereas manyFinally' with the same arguments and input returns [].

Page 6 of many | Previous | Next