HORIZON HASKELLDocslts/ghc-9.10.x248f8f02026-10-05Search names, modules, packages, or :: a typeCtrl K

GHC 9.10.3 · lts/ghc-9.10.x · 248f8f0 · 2026-10-05

Modulehedgehog-1.7Haskell2010

Hedgehog.Internal.Barbie

For compatibility across different versions of the barbie package.

  • 1 type
  • 2 classes
  • Packagehedgehog-1.7
  • Exports3
  • LanguageHaskell2010
  • LicenceBSD-3-Clause
  • SourceBarbie.hs
classclass FunctorB (b :: (k -> Type) -> Type) where
#

Barbie-types that can be mapped over. Instances of FunctorB should satisfy the following laws:

bmap id = id
bmap f . bmap g = bmap (f . g)

There is a default bmap implementation for Generic types, so instances can derived automatically.

Methods

  • bmap :: (forall (a :: k). f a -> g a) -> b f -> b g
Instances11FunctorB, …
classclass FunctorB b => TraversableB (b :: (k -> Type) -> Type) where
#

Barbie-types that can be traversed from left to right. Instances should satisfy the following laws:

 t . btraverse f   = btraverse (t . f)  -- naturality
btraverse Data.Functor.Identity = Data.Functor.Identity           -- identity
btraverse (Compose . fmap g . f) = Compose . fmap (btraverse g) . btraverse f -- composition

There is a default btraverse implementation for Generic types, so instances can derived automatically.

Methods

Instances11TraversableB, …
newtypenewtype Rec p a (x :: k)
#

Constructors

Instances45GTraversable, GApplicative, GFunctor, GDistributive, GBare, GConstraints, …