Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

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

   leancheck	Test.LeanCheck.Tiers

   Like mapMaybe but for tiers.

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

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

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

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

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

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

   some	Data.Some

   Map over argument.

8. mapSome :: (forall (x :: k) . () => f x -> g x) -> Some f -> Some g

   some	Data.Some.Church

   Map over argument.

9. mapSome :: (forall (x :: k) . () => f x -> g x) -> Some f -> Some g

   some	Data.Some.GADT

   Map over argument.

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

    some	Data.Some.Newtype

    Map over argument.

Page 136 of many | Previous | Next