Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. _adjustment :: CommandLineOptions -> BehaviorAdjustment

    cabal-debian Debian.Debianize.Optparse

    No documentation available.

  2. handleBehaviorAdjustment :: forall (m :: Type -> Type) . MonadIO m => BehaviorAdjustment -> CabalT m ()

    cabal-debian Debian.Debianize.Optparse

    No documentation available.

  3. catchJust_ :: HasCatch tag e m => Proxy# tag -> (e -> Maybe b) -> m a -> (b -> m a) -> m a

    capability Capability.Error

    For technical reasons, this method needs an extra proxy argument. You only need it if you are defining new instances of HasReader. Otherwise, you will want to use catchJust. See catchJust for more documentation.

  4. data FeeAdjustmentError i o

    cardano-coin-selection Cardano.CoinSelection.Fee

    Represents the set of possible failures that can occur when adjusting a CoinSelection with the adjustForFee function.

  5. adjustForFee :: forall i (m :: Type -> Type) o . (Ord i, MonadRandom m) => FeeOptions i o -> CoinMap i -> CoinSelection i o -> ExceptT (FeeAdjustmentError i o) m (CoinSelection i o)

    cardano-coin-selection Cardano.CoinSelection.Fee

    Adjusts the given CoinSelection in order to pay for a transaction fee, required in order to publish the selection as a transaction on a blockchain.

    Background

    Implementations of CoinSelectionAlgorithm generally produce coin selections that are exactly balanced, satisfying the following equality: 
    >>> sumInputs s = sumOutputs s + sumChange s
    In order to pay for a transaction fee, the above equality must be transformed into an inequality: 
    >>> sumInputs s > sumOutputs s + sumChange s
    The difference between these two sides represents value to be paid by the originator of the transaction, in the form of a fee: 
    >>> sumInputs s = sumOutputs s + sumChange s + fee

    The Adjustment Process

    In order to generate a fee that is acceptable to the network, this function adjusts the change and inputs of the given CoinSelection, consulting the FeeEstimator as a guide for how much the current selection would cost to publish as a transaction on the network.

    Methods of Adjustment

    There are two methods of adjustment possible:
    1. The change set can be reduced, either by:a. completely removing a change value from the set; or byb. reducing a change value to a lower value.
    2. The inputs set can be augmented, by selecting additional inputs from the specified CoinMap argument.

    Dealing with Dust Values

    If, at any point, a change value is generated that is less than or equal to the DustThreshold, this function will eliminate that change value from the change set, redistributing the eliminated value over the remaining change values, ensuring that the total value of all change is preserved. See coalesceDust for more details.

    Termination

    Since adjusting a selection can affect the fee estimate produced by estimateFee, the process of adjustment is an iterative process. The termination post-condition depends on the choice of FeeBalancingPolicy:
    • If RequireBalancedFee is specified, this function terminates only when it has generated a CoinSelection s that satisfies the following property:
      >>> sumInputs s = sumOutputs s + sumChange s +
estimateFee s
    • If RequireMinimalFee policy is specified, the above equality is relaxed to the following inequality:
      >>> sumInputs s ≥ sumOutputs s +
sumChange s + estimateFee s
    See FeeBalancingPolicy for more details.

  6. awaitJust :: forall (m :: Type -> Type) a b . Monad m => (a -> ConduitT a b m ()) -> ConduitT a b m ()

    conduit-algorithms Data.Conduit.Algorithms.Utils

    Act on the next input (do nothing if no input). awaitJust f is equivalent to 

    do
next <- C.await
case next of
Just val -> f val
Nothing -> return ()
    This is a simple utility adapted from http://neilmitchell.blogspot.de/2015/07/thoughts-on-conduits.html

  7. adjustConsistency :: Consistency -> RetrySettings -> RetrySettings

    cql-io Database.CQL.IO

    On retry, change the consistency to the given value.

  8. adjustResponseTimeout :: NominalDiffTime -> RetrySettings -> RetrySettings

    cql-io Database.CQL.IO

    On retry adjust the response timeout. See setResponseTimeout.

  9. adjustSendTimeout :: NominalDiffTime -> RetrySettings -> RetrySettings

    cql-io Database.CQL.IO

    On retry adjust the send timeout. See setSendTimeout.

  10. adjust :: Ord k => (a -> a) -> Interval k -> IntervalMap k a -> IntervalMap k a

    data-interval Data.IntervalMap.Lazy

    Update a value at a specific interval with the result of the provided function. When the interval does not overlatp with the map, the original map is returned.

Page 110 of many | Previous | Next