Generics.MultiRec.HFunctor

The definition of functorial map.

Generic map

class HFunctor phi f where

Methods

hmapA :: Applicative a => (forall ix. phi ix -> r ix -> a (r' ix)) -> phi ix -> f r ix -> a (f r' ix)

Instances

HFunctor phi U

Defined in Generics.MultiRec.HFunctor

Methods

hmapA :: Applicative a => (forall ix. phi ix -> r ix -> a (r' ix)) -> phi ix -> U r ix -> a (U r' ix)

HFunctor phi (K x)

Defined in Generics.MultiRec.HFunctor

Methods

hmapA :: Applicative a => (forall ix. phi ix -> r ix -> a (r' ix)) -> phi ix -> K x r ix -> a (K x r' ix)

El phi xi => HFunctor phi (I xi)

Defined in Generics.MultiRec.HFunctor

Methods

hmapA :: Applicative a => (forall ix. phi ix -> r ix -> a (r' ix)) -> phi ix -> I xi r ix -> a (I xi r' ix)

(Constructor c, HFunctor phi f) => HFunctor phi (C c f)

Defined in Generics.MultiRec.HFunctor

Methods

hmapA :: Applicative a => (forall ix. phi ix -> r ix -> a (r' ix)) -> phi ix -> C c f r ix -> a (C c f r' ix)

(Traversable f, HFunctor phi g) => HFunctor phi (f :.: g)

Defined in Generics.MultiRec.HFunctor

Methods

hmapA :: Applicative a => (forall ix. phi ix -> r ix -> a (r' ix)) -> phi ix -> (f :.: g) r ix -> a ((f :.: g) r' ix)

HFunctor phi f => HFunctor phi (f :>: ix)

Defined in Generics.MultiRec.HFunctor

Methods

hmapA :: Applicative a => (forall ix0. phi ix0 -> r ix0 -> a (r' ix0)) -> phi ix1 -> (f :>: ix) r ix1 -> a ((f :>: ix) r' ix1)

(HFunctor phi f, HFunctor phi g) => HFunctor phi (f :*: g)

Defined in Generics.MultiRec.HFunctor

Methods

hmapA :: Applicative a => (forall ix. phi ix -> r ix -> a (r' ix)) -> phi ix -> (f :*: g) r ix -> a ((f :*: g) r' ix)

(HFunctor phi f, HFunctor phi g) => HFunctor phi (f :+: g)

Defined in Generics.MultiRec.HFunctor

Methods

hmapA :: Applicative a => (forall ix. phi ix -> r ix -> a (r' ix)) -> phi ix -> (f :+: g) r ix -> a ((f :+: g) r' ix)

hmap :: HFunctor phi f => (forall ix. phi ix -> r ix -> r' ix) -> phi ix -> f r ix -> f r' ix

The function hmap takes a functor f. All the recursive instances in that functor are wrapped by an application of r. The argument to hmap takes a function that transformes r occurrences into r' occurrences, for every ix. In order to associate the index ix with the correct family phi, the argument to hmap is additionally parameterized by a witness of type phi ix.

hmapM :: (HFunctor phi f, Monad m) => (forall ix. phi ix -> r ix -> m (r' ix)) -> phi ix -> f r ix -> m (f r' ix)

Monadic version of hmap.