Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. mapMaybeWithKey :: GCompare k2 => (forall (v :: k1) . () => k2 v -> f v -> Maybe (g v)) -> DMap k2 f -> DMap k2 g

   dependent-map	Data.Dependent.Map

   O(n). Map keys/values and collect the Just results.

2. mapWithKey :: (forall (v :: k1) . () => k2 v -> f v -> g v) -> DMap k2 f -> DMap k2 g

   dependent-map	Data.Dependent.Map

   O(n). Map a function over all values in the map.

3. mapNTree' :: (a -> Maybe a) -> NTree a -> NTree a

   hxt	Data.Tree.NTree.Edit

   A space optimized map for NTrees Subtrees, that are not changed are reused in the resulting tree See also: editNTreeBottomUp

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

   leancheck	Test.LeanCheck

   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
   

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

   leancheck	Test.LeanCheck

   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]
   

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

   leancheck	Test.LeanCheck.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. mapCons :: (Listable a, Listable b) => ([(a, b)] -> c) -> [[c]]

   leancheck	Test.LeanCheck.Error

   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
   

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

   leancheck	Test.LeanCheck.Error

   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]
   

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

   leancheck	Test.LeanCheck.Tiers

   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
   

10. mapMaybeT :: (a -> Maybe b) -> [[a]] -> [[b]]

    leancheck	Test.LeanCheck.Tiers

    Like mapMaybe but for tiers.

Page 136 of many | Previous | Next