Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

  1. findFirstItemFd :: Fd -> SearchKey -> (SearchHeader -> Ptr i -> IO a) -> IO a

    btrfs System.Linux.Btrfs

    No documentation available.

  2. findFirstItem :: RawFilePath -> SearchKey -> (SearchHeader -> Ptr i -> IO a) -> IO a

    btrfs System.Linux.Btrfs.ByteString

    No documentation available.

  3. findFirstItemFd :: Fd -> SearchKey -> (SearchHeader -> Ptr i -> IO a) -> IO a

    btrfs System.Linux.Btrfs.ByteString

    No documentation available.

  4. fieldLineToFirstRow :: FieldLine (Position, [Comment Position]) -> Int

    cabal-gild CabalGild.Unstable.Action.ReflowText

    Extracts the first row number from a field line, which might belong to one of its comments.

  5. MonitorFirstRun :: MonitorChangedReason a

    cabal-install Distribution.Client.FileMonitor

    There was no saved monitor state, cached value etc. Ie the file for the FileMonitor does not exist.

  6. MonitorFirstRun :: MonitorChangedReason a

    cabal-install Distribution.Client.ProjectBuilding

    There was no saved monitor state, cached value etc. Ie the file for the FileMonitor does not exist.

  7. MonitorFirstRun :: MonitorChangedReason a

    cabal-install Distribution.Client.ProjectBuilding.Types

    There was no saved monitor state, cached value etc. Ie the file for the FileMonitor does not exist.

  8. findFirstFileMonitored :: (a -> FilePath) -> [a] -> Rebuild (Maybe a)

    cabal-install Distribution.Client.RebuildMonad

    Like findFirstFile, but in the Rebuild monad.

  9. module Cardano.CoinSelection.Algorithm.LargestFirst

    This module contains an implementation of the Largest-First coin selection algorithm.

  10. largestFirst :: forall i (m :: Type -> Type) o . (Ord i, Monad m) => CoinSelectionAlgorithm i o m

    cardano-coin-selection Cardano.CoinSelection.Algorithm.LargestFirst

    An implementation of the Largest-First coin selection algorithm. The Largest-First coin selection algorithm considers available inputs in descending order of value, from largest to smallest. When applied to a set of requested outputs, the algorithm repeatedly selects entries from the available inputs set until the total value of selected entries is greater than or equal to the total value of requested outputs.

    Change Values

    If the total value of selected inputs is greater than the total value of all requested outputs, the change set of the resulting selection will contain a single coin with the excess value. If the total value of selected inputs is exactly equal to the total value of all requested outputs, the change set of the resulting selection will be empty.

    Failure Modes

    The algorithm terminates with an error if:
    1. The total value of inputsAvailable (the amount of money available) is less than the total value of outputsRequested (the amount of money required).See: InputValueInsufficientError.
    2. It is not possible to cover the total value of outputsRequested without selecting a number of inputs from inputsAvailable that would exceed the maximum defined by limit.See: InputLimitExceededError.

Page 91 of many | Previous | Next