Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

  1. retry :: Int -> IO a -> IO a

    extra Control.Exception.Extra

    Retry an operation at most n times (n must be positive). If the operation fails the nth time it will throw that final exception. 

    retry 1 (print "x")  == print "x"
retry 3 (fail "die") == fail "die"

  2. retry :: Int -> IO a -> IO a

    extra Extra

    Retry an operation at most n times (n must be positive). If the operation fails the nth time it will throw that final exception. 

    retry 1 (print "x")  == print "x"
retry 3 (fail "die") == fail "die"

  3. package retry

    Retry combinators for monadic actions that may fail This package exposes combinators that can wrap arbitrary monadic actions. They run the action and potentially retry running it with some configurable delay for a configurable number of times. The purpose is to make it easier to work with IO and especially network IO actions that often experience temporary failure and warrant retrying of the original action. For example, a database query may time out for a while, in which case we should hang back for a bit and retry the query instead of simply raising an exception.

  4. retry :: forall m (es :: Set Type) . Monad m => Handle' m es -> Handle m es

    moffy Control.Moffy.Handle

    No documentation available.

  5. retry :: STM a

    rebase Rebase.Prelude

    Retry execution of the current memory transaction because it has seen values in TVars which mean that it should not continue (e.g. the TVars represent a shared buffer that is now empty). The implementation may block the thread until one of the TVars that it has read from has been updated. (GHC only)

  6. retry :: STM a

    base-prelude BasePrelude

    Retry execution of the current memory transaction because it has seen values in TVars which mean that it should not continue (e.g. the TVars represent a shared buffer that is now empty). The implementation may block the thread until one of the TVars that it has read from has been updated. (GHC only)

  7. retry :: STM a

    effectful Effectful.Concurrent.STM

    Retry execution of the current memory transaction because it has seen values in TVars which mean that it should not continue (e.g. the TVars represent a shared buffer that is now empty). The implementation may block the thread until one of the TVars that it has read from has been updated. (GHC only)

  8. retry :: RetryLog step fail1 done -> (fail1 -> RetryLog step fail2 done) -> RetryLog step fail2 done

    cabal-install-solver Distribution.Solver.Modular.RetryLog

    O(1). If the first log leads to failure, continue with the second.

  9. retry :: MonadSTM stm => stm a

    concurrency Control.Monad.STM.Class

    Retry execution of this transaction because it has seen values in TVars that it shouldn't have. This will result in the thread running the transaction being blocked until any TVars referenced in it have been mutated. This is just mzero.

  10. retry :: forall a (m :: Type -> Type) b . Parser a m b -> Parser a m b

    streamly-core Streamly.Internal.Data.Parser

    Keep trying a parser until it succeeds. When the parser fails the input consumed till now is dropped and the new instance is tried on the fresh input. Unimplemented

Page 1 of many | Next