Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. mapWithIndex :: (Indexed sh, Index sh ~ ix, Storable a, Storable b) => (ix -> a -> b) -> Array sh a -> Array sh b

   comfort-array	Data.Array.Comfort.Storable.Unchecked

   No documentation available.

2. 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

3. 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
   

4. 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]
   

5. 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]
   

6. 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
   

7. 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]
   

8. 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
   

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

   leancheck	Test.LeanCheck.Tiers

   Like mapMaybe but for tiers.

10. maps :: [[a]] -> [[b]] -> [[[(a, b)]]]

    leancheck	Test.LeanCheck.Tiers

    Takes as arguments tiers of source and target values; returns tiers of maps from the source to the target encoded as lists without repetition.

Page 175 of many | Previous | Next