Data.Extensible.Union

Documentation

(<$?~) :: (forall b. f b -> (b -> x) -> a) -> (Match (Flux x) a :* fs) -> Match (Flux x) a :* (f : fs) infixr 1

Prepend a clause for Match (Flux x) as well as (<?!).

newtype Union fs a

A much more efficient representation for Union of Functors.

Constructors

Union

Fields

getLeague :: Flux a :| fs

Instances

Functor (Union fs)

fast fmap

Typeable ([* -> *] -> * -> *) Union

liftU :: f ∈ fs => f a -> Union fs a

O(log n) Embed a value.

data Flux a f where

Flipped Coyoneda

Constructors

Flux :: (a -> b) -> f a -> Flux b f

mapFlux :: (a -> b) -> Flux a f -> Flux b f

fmap for the content.