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. genericInvmap :: (Generic1 f, Invariant (Rep1 f)) => (a -> b) -> (b -> a) -> f a -> f b

   invariant	Data.Functor.Invariant

   A generic implementation of invmap.

2. invmap :: Invariant f => (a -> b) -> (b -> a) -> f a -> f b

   invariant	Data.Functor.Invariant

   No documentation available.

3. invmap2 :: Invariant2 f => (a -> c) -> (c -> a) -> (b -> d) -> (d -> b) -> f a b -> f c d

   invariant	Data.Functor.Invariant

   No documentation available.

4. invmap2Bifunctor :: Bifunctor f => (a -> c) -> (c -> a) -> (b -> d) -> (d -> b) -> f a b -> f c d

   invariant	Data.Functor.Invariant

   Every Bifunctor is also an Invariant2 functor.

5. invmap2Profunctor :: Profunctor f => (a -> c) -> (c -> a) -> (b -> d) -> (d -> b) -> f a b -> f c d

   invariant	Data.Functor.Invariant

   Every Profunctor is also an Invariant2 functor.

6. invmapArrow :: Arrow arr => (a -> b) -> (b -> a) -> arr a a -> arr b b

   invariant	Data.Functor.Invariant

   An Arrow with the same input and output types can be seen as an Invariant functor.

7. invmapContravariant :: Contravariant f => (a -> b) -> (b -> a) -> f a -> f b

   invariant	Data.Functor.Invariant

   Every Contravariant functor is also an Invariant functor.

8. invmapFunctor :: Functor f => (a -> b) -> (b -> a) -> f a -> f b

   invariant	Data.Functor.Invariant

   Every Functor is also an Invariant functor.

9. invmapProfunctor :: Profunctor p => (a -> b) -> (b -> a) -> p a a -> p b b

   invariant	Data.Functor.Invariant

   A Profunctor with the same input and output types can be seen as an Invariant functor.

10. makeInvmap :: Name -> Q Exp

    invariant	Data.Functor.Invariant.TH

    Generates a lambda expression which behaves like invmap (without requiring an Invariant instance).

Page 526 of many | Previous | Next