Data.Bifunctor.Linear.Internal.Bifunctor

Documentation

class Bifunctor p where

The Bifunctor class

Laws

If bimap is supplied, then bimap id id = id

• If first and second are supplied, then first id ≡ id second id ≡ id
• If all are supplied, then @bimap f g = first f . second g

Minimal complete definition

bimap | first, second

Methods

bimap :: (a %1 -> b) -> (c %1 -> d) -> (a `p` c) %1 -> b `p` d

first :: (a %1 -> b) -> (a `p` c) %1 -> b `p` c

second :: (b %1 -> c) -> (a `p` b) %1 -> a `p` c

Instances

Bifunctor Either

Defined in Data.Bifunctor.Linear.Internal.Bifunctor

Methods

bimap :: (a %1 -> b) -> (c %1 -> d) -> Either a c %1 -> Either b d

first :: (a %1 -> b) -> Either a c %1 -> Either b c

second :: (b %1 -> c) -> Either a b %1 -> Either a c

Bifunctor (,)

Defined in Data.Bifunctor.Linear.Internal.Bifunctor

Methods

bimap :: (a %1 -> b) -> (c %1 -> d) -> (a, c) %1 -> (b, d)

first :: (a %1 -> b) -> (a, c) %1 -> (b, c)

second :: (b %1 -> c) -> (a, b) %1 -> (a, c)