Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

  1. resumeRecoverAll :: MonadUnliftIO m => RetryStatus -> RetryPolicyM m -> (RetryStatus -> m a) -> m a

    retry UnliftIO.Retry

    A variant of recoverAll that allows specifying the initial RetryStatus so that a recovering operation may pick up where it left off in regards to its retry policy.

  2. resumeRecovering :: MonadUnliftIO m => RetryStatus -> RetryPolicyM m -> [RetryStatus -> Handler m Bool] -> (RetryStatus -> m a) -> m a

    retry UnliftIO.Retry

    A variant of recovering that allows specifying the initial RetryStatus so that a recovering operation may pick up where it left off in regards to its retry policy.

  3. resumeRecoveringDynamic :: MonadUnliftIO m => RetryStatus -> RetryPolicyM m -> [RetryStatus -> Handler m RetryAction] -> (RetryStatus -> m a) -> m a

    retry UnliftIO.Retry

    A variant of recoveringDynamic that allows specifying the initial RetryStatus so that a recovering operation may pick up where it left off in regards to its retry policy.

  4. resumeRetrying :: MonadIO m => RetryStatus -> RetryPolicyM m -> (RetryStatus -> b -> m Bool) -> (RetryStatus -> m b) -> m b

    retry UnliftIO.Retry

    A variant of retrying that allows specifying the initial RetryStatus so that the retrying operation may pick up where it left off in regards to its retry policy.

  5. resumeRetryingDynamic :: MonadIO m => RetryStatus -> RetryPolicyM m -> (RetryStatus -> b -> m RetryAction) -> (RetryStatus -> m b) -> m b

    retry UnliftIO.Retry

    A variant of retryingDynamic that allows specifying the initial RetryStatus so that a retrying operation may pick up where it left off in regards to its retry policy.

  6. DeepSubsumption :: KnownExtension

    Cabal-syntax Language.Haskell.Extension

    Enable deep subsumption, relaxing the simple subsumption rules, implicitly inserting eta-expansions when matching up function types with different quantification structures.

  7. UnboxedSums :: KnownExtension

    Cabal-syntax Language.Haskell.Extension

    Enable the use of unboxed sum syntax.

  8. class (Finite self a ~ af, Finite self b ~ bf) => FiniteSum self (a :: Type -> Type) (b :: Type -> Type) (af :: Bool) (bf :: Bool)

    generic-arbitrary Test.QuickCheck.Arbitrary.Generic

    No documentation available.

  9. class FiniteSumElem (self :: k) (a :: k1 -> Type)

    generic-arbitrary Test.QuickCheck.Arbitrary.Generic

    No documentation available.

  10. data KB2Sum

    math-functions Numeric.Sum

    Second-order Kahan-Babuška summation. This is more computationally costly than Kahan-Babuška-Neumaier summation, running at about a third the speed. Its advantage is that it can lose less precision (in admittedly obscure cases). This method compensates for error in both the sum and the first-order compensation term, hence the use of "second order" in the name.

Page 108 of many | Previous | Next