Copyright	(c) 2008--2010 Universiteit Utrecht
License	BSD3
Maintainer	generics@haskell.org
Stability	experimental
Portability	non-portable
Safe Haskell	Safe
Language	Haskell2010

Generics.MultiRec.HFunctor

Contents

Generic map

Description

The definition of functorial map.

Synopsis

Generic map

class HFunctor phi f where Source #

Minimal complete definition

hmapA

Methods

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

Instances

HFunctor phi U Source #
Methods hmapA :: Applicative a => (forall ix. phi ix -> r ix -> a (r' ix)) -> phi ix -> U r ix -> a (U r' ix) Source #
HFunctor phi (K x) Source #
Methods hmapA :: Applicative a => (forall ix. phi ix -> r ix -> a (r' ix)) -> phi ix -> K x r ix -> a (K x r' ix) Source #
El phi xi => HFunctor phi (I xi) Source #
Methods hmapA :: Applicative a => (forall ix. phi ix -> r ix -> a (r' ix)) -> phi ix -> I xi r ix -> a (I xi r' ix) Source #
(Constructor c, HFunctor phi f) => HFunctor phi (C c f) Source #
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) Source #
(Traversable f, HFunctor phi g) => HFunctor phi ((:.:) f g) Source #
Methods hmapA :: Applicative a => (forall ix. phi ix -> r ix -> a (r' ix)) -> phi ix -> (f :.: g) r ix -> a ((f :.: g) r' ix) Source #
HFunctor phi f => HFunctor phi ((:>:) f ix) Source #
Methods hmapA :: Applicative a => (forall ix0. phi ix0 -> r ix0 -> a (r' ix0)) -> phi ix -> (f :>: ix) r ix -> a ((f :>: ix) r' ix) Source #
(HFunctor phi f, HFunctor phi g) => HFunctor phi ((:*:) f g) Source #
Methods hmapA :: Applicative a => (forall ix. phi ix -> r ix -> a (r' ix)) -> phi ix -> (f :: g) r ix -> a ((f :: g) r' ix) Source #
(HFunctor phi f, HFunctor phi g) => HFunctor phi ((:+:) f g) Source #
Methods hmapA :: Applicative a => (forall ix. phi ix -> r ix -> a (r' ix)) -> phi ix -> (f :+: g) r ix -> a ((f :+: g) r' ix) Source #

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

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) Source #

Monadic version of hmap.