Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. mapShape :: (C sh0, C sh1) => (sh0 -> sh1) -> Array sh0 a -> Array sh1 a

   comfort-array	Data.Array.Comfort.Storable

   No documentation available.

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

   No documentation available.

3. mapShape :: (sh0 -> sh1) -> Array sh0 a -> Array sh1 a

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

   No documentation available.

4. mapShape :: (sh0 -> sh1) -> Array sh0 a -> Array sh1 a

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

   No documentation available.

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

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

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

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

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

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

Page 134 of many | Previous | Next