Type.Class.HFunctor

Higher order functors, foldables, and traversables, along with their indexed variants. (oh, and bifunctors tacked on for good measure.)

Documentation

class HFunctor t where

Methods

map' :: (forall a. f a -> g a) -> t f b -> t g b

Take a natural transformation to a lifted natural transformation.

Instances

HFunctor k k (IT k)

HFunctor k k ((:&:) k f)

HFunctor k k ((:+:) k f)

HFunctor k k (CT k k r)

HFunctor k k (RR k k g)

HFunctor k (Maybe k) (Option k)

We can take a natural transformation of (forall x. f x -> g x) to a natural transformation of (forall mx. Option f mx -> Option g mx).

HFunctor k [k] (Sum k)

HFunctor k [k] (Prod k)

HFunctor k ((,) k k) ((:*:) k k f)

HFunctor k (Either k k) ((:|:) k k f)

HFunctor k (k -> k) (LL k k a)

class HIxFunctor i t | t -> i where

Methods

imap' :: (forall a. i b a -> f a -> g a) -> t f b -> t g b

Instances

HIxFunctor [k] k (Index k) (Sum k)

HIxFunctor [k] k (Index k) (Prod k)

class HFoldable t where

Methods

foldMap' :: Monoid m => (forall a. f a -> m) -> t f b -> m

Instances

HFoldable k k (IT k)

HFoldable k k ((:&:) k f)

HFoldable k k ((:+:) k f)

HFoldable k k (CT k k r)

HFoldable k k (RR k k g)

HFoldable k (Maybe k) (Option k)

HFoldable k [k] (Sum k)

HFoldable k [k] (Prod k)

HFoldable k ((,) k k) ((:*:) k k f)

HFoldable k (Either k k) ((:|:) k k f)

HFoldable k (k -> k) (LL k k a)

class HIxFoldable i t | t -> i where

Methods

ifoldMap' :: Monoid m => (forall a. i b a -> f a -> m) -> t f b -> m

Instances

HIxFoldable [k] k (Index k) (Sum k)

HIxFoldable [k] k (Index k) (Prod k)

class (HFunctor t, HFoldable t) => HTraversable t where

Methods

traverse' :: Applicative h => (forall a. f a -> h (g a)) -> t f b -> h (t g b)

Instances

HTraversable k k (IT k)

HTraversable k k ((:&:) k f)

HTraversable k k ((:+:) k f)

HTraversable k k (CT k k r)

HTraversable k k (RR k k g)

HTraversable k (Maybe k) (Option k)

HTraversable k [k] (Sum k)

HTraversable k [k] (Prod k)

HTraversable k ((,) k k) ((:*:) k k f)

HTraversable k (Either k k) ((:|:) k k f)

HTraversable k (k -> k) (LL k k a)

class (HIxFunctor i t, HIxFoldable i t) => HIxTraversable i t | t -> i where

Methods

itraverse' :: Applicative h => (forall a. i b a -> f a -> h (g a)) -> t f b -> h (t g b)

Instances

HIxTraversable [k] k (Index k) (Sum k)

class HBifunctor t where

Methods

bimap' :: (forall a. f a -> h a) -> (forall a. g a -> i a) -> t f g b -> t h i b

Instances

HBifunctor k k k ((:&:) k)

HBifunctor k k k ((:+:) k)

HBifunctor k k ((,) k k) ((:*:) k k)

HBifunctor k k (Either k k) ((:|:) k k)