Hoogle Search

Within LTS Haskell 8.23 (ghc-8.0.2)

  1. retry :: STM a

    base GHC.Conc

    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 udpated. (GHC only)

  2. retry :: STM a

    base GHC.Conc.Sync

    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 udpated. (GHC only)

  3. retry :: STM a

    stm Control.Monad.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 udpated. (GHC only)

  4. 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"
    

  5. 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"
    

  6. 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.

  7. 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.

  8. retry :: TransIO ()

    transient Transient.Backtrack

    No documentation available.

  9. retry :: Functor b => Wizard b a -> Wizard b a

    wizards System.Console.Wizard

    Retry produces a wizard that will retry the entire conversation again if it fails. It is simply retry x = x <|> retry x.

  10. retry :: Monad m => View v m a -> View v m ()

    MFlow MFlow.Forms

    forces backtracking if the widget validates, because a previous page handle this widget response . This is useful for recurrent cached widgets or absLinks that are present in multiple pages. For example in the case of menus or common options. The active elements of this widget must be cached with no timeout.

Page 1 of many | Next