Hoogle Search

Within LTS Haskell 24.26 (ghc-9.10.3)

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

Exact lookup

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

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

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

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

   leancheck	Test.LeanCheck.Tiers

   Like mapMaybe but for tiers.

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

6. mapMaybeMProp :: (IsList c, IsList d, Eq d, Show d, Show b, Item c ~ a, Item d ~ b, Arbitrary c, Arbitrary b, Show c, Show a, CoArbitrary a, Function a) => Proxy a -> Proxy b -> (forall s . () => (a -> ST s (Maybe b)) -> c -> ST s d) -> Property

   quickcheck-classes-base	Test.QuickCheck.Classes.Base.IsList

   No documentation available.

7. mapMaybeProp :: (IsList c, Item c ~ a, Item d ~ b, Eq d, IsList d, Arbitrary b, Show d, Show b, Arbitrary c, Show c, Show a, Eq c, CoArbitrary a, Function a) => Proxy a -> Proxy b -> ((a -> Maybe b) -> c -> d) -> Property

   quickcheck-classes-base	Test.QuickCheck.Classes.Base.IsList

   Property for the mapMaybe function, which keeps elements for which the predicate holds true.

8. mapProp :: (IsList c, IsList d, Eq d, Show d, Show b, Item c ~ a, Item d ~ b, Arbitrary c, Arbitrary b, Show c, Show a, CoArbitrary a, Function a) => Proxy a -> Proxy b -> ((a -> b) -> c -> d) -> Property

   quickcheck-classes-base	Test.QuickCheck.Classes.Base.IsList

   No documentation available.

9. mapSigma :: forall a b (f :: a ~> b) (p :: a ~> Type) (q :: b ~> Type) . Sing f -> (forall (x :: a) . () => (p @@ x) -> q @@ (f @@ x)) -> Sigma a p -> Sigma b q

   singletons	Data.Singletons.Sigma

   Map across a Sigma value in a dependent fashion.

10. mapSome :: (forall (t :: k) . () => f t -> g t) -> Some f -> Some g

    some	Data.Some

    Map over argument.

Page 135 of many | Previous | Next