Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

  1. mapsize :: CacheSettings -> ECMMapSize

    expiring-cache-map Caching.ExpiringCacheMap.OrdECM

    No documentation available.

  2. mapsize :: CacheSettings -> ECMMapSize

    expiring-cache-map Caching.ExpiringCacheMap.Types

    No documentation available.

  3. mapCons :: (Listable a, Listable b) => ([(a, b)] -> c) -> [[c]]

    extrapolate Test.Extrapolate

    Given a constructor that takes a map of elements (encoded as a list), lists tiers of applications of this constructor So long as the underlying Listable enumerations have no repetitions, this will generate no repetitions. This allows defining an efficient implementation of tiers that does not repeat maps given by:

    tiers  =  mapCons fromList
    

  4. mapT :: (a -> b) -> [[a]] -> [[b]]

    extrapolate Test.Extrapolate

    map over tiers

    mapT f [[x], [y,z], [w,...], ...]  =  [[f x], [f y, f z], [f w, ...], ...]
    
    mapT f [xs, ys, zs, ...]  =  [map f xs, map f ys, map f zs]
    

  5. mapCons :: (Listable a, Listable b) => ([(a, b)] -> c) -> [[c]]

    extrapolate Test.Extrapolate.Core

    Given a constructor that takes a map of elements (encoded as a list), lists tiers of applications of this constructor So long as the underlying Listable enumerations have no repetitions, this will generate no repetitions. This allows defining an efficient implementation of tiers that does not repeat maps given by:

    tiers  =  mapCons fromList
    

  6. mapT :: (a -> b) -> [[a]] -> [[b]]

    extrapolate Test.Extrapolate.Core

    map over tiers

    mapT f [[x], [y,z], [w,...], ...]  =  [[f x], [f y, f z], [f w, ...], ...]
    
    mapT f [xs, ys, zs, ...]  =  [map f xs, map f ys, map f zs]
    

  7. mappend :: Monoid a => a -> a -> a

    faktory Faktory.Prelude

    An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

  8. mapM_ :: (HVector v, ArityC c (Elems v), Applicative f) => Proxy c -> (forall a . c a => a -> f ()) -> v -> f ()

    fixed-vector-hetero Data.Vector.HFixed

    Apply monadic action to every element in the vector

  9. mapNat :: HVectorF v => (forall a . () => f a -> g a) -> v f -> v g

    fixed-vector-hetero Data.Vector.HFixed

    Apply natural transformation to every element of the tuple.

    >>> mapNat (Just . runIdentity) (mk2F (pure 'c') (pure 1) :: HVecF '[Char, Int] Identity)
    [Just 'c',Just 1]
    

  10. mapOf :: Ord a => Reader a -> Reader b -> Reader (Map a b)

    flags-applicative Flags.Applicative

    Transforms a single-valued unary flag into one which accepts a comma-separated list of colon-delimited key-value pairs. The syntax is key:value[,key:value...]. Note that escapes are not supported, so neither keys not values should contain colons or commas.

Page 333 of many | Previous | Next