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.

Exact lookup

1. concatMapM :: Monad m => (a -> m [b]) -> [a] -> m [b]

   cabal-install	Distribution.Client.Utils

   From Control.Monad.Extra https://hackage.haskell.org/package/extra-1.7.9

2. concatMap :: Foldable t => (a -> [b]) -> t a -> [b]

   calligraphy	Calligraphy.Prelude

   Map a function over all the elements of a container and concatenate the resulting lists.

   Examples

   Basic usage:

   >>> concatMap (take 3) [[1..], [10..], [100..], [1000..]]
   [1,2,3,10,11,12,100,101,102,1000,1001,1002]
   

   >>> concatMap (take 3) (Just [1..])
   [1,2,3]
   

3. foldMap :: (Foldable t, Monoid m) => (a -> m) -> t a -> m

   calligraphy	Calligraphy.Prelude

   Map each element of the structure into a monoid, and combine the results with (<>). This fold is right-associative and lazy in the accumulator. For strict left-associative folds consider foldMap' instead.

   Examples

   Basic usage:

   >>> foldMap Sum [1, 3, 5]
   Sum {getSum = 9}
   

   >>> foldMap Product [1, 3, 5]
   Product {getProduct = 15}
   

   >>> foldMap (replicate 3) [1, 2, 3]
   [1,1,1,2,2,2,3,3,3]
   

   When a Monoid's (<>) is lazy in its second argument, foldMap can return a result even from an unbounded structure. For example, lazy accumulation enables Data.ByteString.Builder to efficiently serialise large data structures and produce the output incrementally:

   >>> import qualified Data.ByteString.Lazy as L
   
   >>> import qualified Data.ByteString.Builder as B
   
   >>> let bld :: Int -> B.Builder; bld i = B.intDec i <> B.word8 0x20
   
   >>> let lbs = B.toLazyByteString $ foldMap bld [0..]
   
   >>> L.take 64 lbs
   "0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24"
   

4. foldMap' :: (Foldable t, Monoid m) => (a -> m) -> t a -> m

   calligraphy	Calligraphy.Prelude

   A left-associative variant of foldMap that is strict in the accumulator. Use this method for strict reduction when partial results are merged via (<>).

   Examples

   Define a Monoid over finite bit strings under xor. Use it to strictly compute the xor of a list of Int values.

   >>> :set -XGeneralizedNewtypeDeriving
   
   >>> import Data.Bits (Bits, FiniteBits, xor, zeroBits)
   
   >>> import Data.Foldable (foldMap')
   
   >>> import Numeric (showHex)
   
   >>> 
   
   >>> newtype X a = X a deriving (Eq, Bounded, Enum, Bits, FiniteBits)
   
   >>> instance Bits a => Semigroup (X a) where X a <> X b = X (a `xor` b)
   
   >>> instance Bits a => Monoid    (X a) where mempty     = X zeroBits
   
   >>> 
   
   >>> let bits :: [Int]; bits = [0xcafe, 0xfeed, 0xdeaf, 0xbeef, 0x5411]
   
   >>> (\ (X a) -> showString "0x" . showHex a $ "") $ foldMap' X bits
   "0x42"
   

5. newtype CoinMap a

   cardano-coin-selection	Cardano.CoinSelection

   A mapping from unique keys to associated Coin values. A CoinMap can be used to represent:

   • a UTxO set, where each key within the map refers to an unspent output from a previous transaction.
   • a set of inputs to a CoinSelection, where each input is an entry selected from a UTxO set by a CoinSelectionAlgorithm.
   • a set of outputs for a CoinSelection, where each key within the map refers to the address of a payment recipient.
   A CoinMap can be constructed with the coinMapFromList function. The total value of a CoinMap is given by the coinMapValue function.

6. CoinMap :: Map a Coin -> CoinMap a

   cardano-coin-selection	Cardano.CoinSelection

   No documentation available.

7. data CoinMapEntry a

   cardano-coin-selection	Cardano.CoinSelection

   An entry for a CoinMap.

8. CoinMapEntry :: a -> Coin -> CoinMapEntry a

   cardano-coin-selection	Cardano.CoinSelection

   No documentation available.

9. coinMapFromList :: Ord a => [CoinMapEntry a] -> CoinMap a

   cardano-coin-selection	Cardano.CoinSelection

   Constructs a CoinMap from a list of entries. See CoinMapEntry.

10. coinMapToList :: CoinMap a -> [CoinMapEntry a]

    cardano-coin-selection	Cardano.CoinSelection

    Converts a CoinMap to a list of entries. See CoinMapEntry.

Page 1134 of many | Previous | Next