    {-# LANGUAGE CPP #-}
    {-# LANGUAGE Rank2Types #-}
    {-# LANGUAGE ScopedTypeVariables #-}
    {-# LANGUAGE TypeFamilies #-}
    {-# LANGUAGE PatternSynonyms #-}
    {-# LANGUAGE ViewPatterns #-}
    {-# LANGUAGE Trustworthy #-}

    #if __GLASGOW_HASKELL__ >= 806
    {-# LANGUAGE PolyKinds #-}
    #else
    {-# LANGUAGE TypeInType #-}
    #endif

    #include "lens-common.h"

    -----------------------------------------------------------------------------
    -- |
    -- Module      :  Control.Lens.Iso
    -- Copyright   :  (C) 2012-16 Edward Kmett
    -- License     :  BSD-style (see the file LICENSE)
    -- Maintainer  :  Edward Kmett <ekmett@gmail.com>
    -- Stability   :  provisional
    -- Portability :  Rank2Types, TypeFamilies, FunctionalDependencies
    --
    ----------------------------------------------------------------------------
    module Control.Lens.Iso
      (
      -- * Isomorphism Lenses
        Iso, Iso'
      , AnIso, AnIso'
      -- * Isomorphism Construction
      , iso
      -- * Consuming Isomorphisms
      , from
      , cloneIso
      , withIso
      -- * Working with isomorphisms
      , au
      , auf
      , xplat
      , xplatf
      , under
      , mapping
      -- ** Common Isomorphisms
      , simple
      , non, non'
      , anon
      , enum
      , curried, uncurried
      , flipped
      , swapped
      , pattern Swapped
      , strict, lazy
      , pattern Strict
      , pattern Lazy
      , Reversing(..)
      , reversed
      , pattern Reversed
      , involuted
      , pattern List
      -- ** Uncommon Isomorphisms
      , magma
      , imagma
      , Magma
      -- ** Contravariant functors
      , contramapping
      -- * Profunctors
      , Profunctor(dimap,rmap,lmap)
      , dimapping
      , lmapping
      , rmapping
      -- * Bifunctors
      , bimapping
      , firsting
      , seconding
      -- * Coercions
      , coerced
      ) where

    import Control.Lens.Equality (simple)
    import Control.Lens.Getter
    import Control.Lens.Fold
    import Control.Lens.Internal.Context
    import Control.Lens.Internal.Indexed
    import Control.Lens.Internal.Iso as Iso
    import Control.Lens.Internal.Magma
    import Control.Lens.Prism
    import Control.Lens.Review
    import Control.Lens.Type

    import Data.Bifunctor
    import Data.Bifunctor.Swap (Swap (..))
    import Data.Functor.Identity
    import Data.Strict.Classes (Strict (..))
    import Data.Maybe
    import Data.Profunctor
    import Data.Profunctor.Unsafe

    import Data.Coerce

    import qualified GHC.Exts as Exts
    import GHC.Exts (TYPE)

    -- $setup
    -- >>> :set -XNoOverloadedStrings
    -- >>> import Control.Lens
    -- >>> import qualified Data.Map as Map
    -- >>> import Data.Foldable
    -- >>> import Data.Monoid

    ----------------------------------------------------------------------------
    -- Isomorphisms
    -----------------------------------------------------------------------------

    -- | When you see this as an argument to a function, it expects an 'Iso'.
    type AnIso s t a b = Exchange a b a (Identity b) -> Exchange a b s (Identity t)

    -- | A 'Simple' 'AnIso'.
    type AnIso' s a = AnIso s s a a

    -- | Build a simple isomorphism from a pair of inverse functions.
    --
    -- @
    -- 'Control.Lens.Getter.view' ('iso' f g) ≡ f
    -- 'Control.Lens.Getter.view' ('Control.Lens.Iso.from' ('iso' f g)) ≡ g
    -- 'Control.Lens.Setter.over' ('iso' f g) h ≡ g '.' h '.' f
    -- 'Control.Lens.Setter.over' ('Control.Lens.Iso.from' ('iso' f g)) h ≡ f '.' h '.' g
    -- @
    iso :: (s -> a) -> (b -> t) -> Iso s t a b
    iso :: forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso s -> a
    sa b -> t
    bt = (s -> a) -> (f b -> f t) -> p a (f b) -> p s (f t)
    forall a b c d. (a -> b) -> (c -> d) -> p b c -> p a d
    forall (p :: * -> * -> *) a b c d.
    Profunctor p =>
    (a -> b) -> (c -> d) -> p b c -> p a d
    dimap s -> a
    sa ((b -> t) -> f b -> f t
    forall a b. (a -> b) -> f a -> f b
    forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
    fmap b -> t
    bt)
    {-# INLINE iso #-}

    ----------------------------------------------------------------------------
    -- Consuming Isomorphisms
    -----------------------------------------------------------------------------

    -- | Invert an isomorphism.
    --
    -- @
    -- 'from' ('from' l) ≡ l
    -- @
    from :: AnIso s t a b -> Iso b a t s
    from :: forall s t a b. AnIso s t a b -> Iso b a t s
    from AnIso s t a b
    l = AnIso s t a b
    -> ((s -> a) -> (b -> t) -> p t (f s) -> p b (f a))
    -> p t (f s)
    -> p b (f a)
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s t a b
    l (((s -> a) -> (b -> t) -> p t (f s) -> p b (f a))
     -> p t (f s) -> p b (f a))
    -> ((s -> a) -> (b -> t) -> p t (f s) -> p b (f a))
    -> p t (f s)
    -> p b (f a)
    forall a b. (a -> b) -> a -> b
    $ \s -> a
    sa b -> t
    bt -> (b -> t) -> (s -> a) -> Iso b a t s
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso b -> t
    bt s -> a
    sa
    {-# INLINE from #-}

    -- | Extract the two functions, one from @s -> a@ and
    -- one from @b -> t@ that characterize an 'Iso'.
    withIso :: forall s t a b rep (r :: TYPE rep).
                 AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso :: forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s t a b
    ai (s -> a) -> (b -> t) -> r
    k = case AnIso s t a b
    ai ((a -> a) -> (b -> Identity b) -> Exchange a b a (Identity b)
    forall a b s t. (s -> a) -> (b -> t) -> Exchange a b s t
    Exchange a -> a
    forall a. a -> a
    id b -> Identity b
    forall a. a -> Identity a
    Identity) of
      Exchange s -> a
    sa b -> Identity t
    bt -> (s -> a) -> (b -> t) -> r
    k s -> a
    sa (Identity t -> t
    forall a. Identity a -> a
    runIdentity (Identity t -> t) -> (b -> Identity t) -> b -> t
    forall a b c (q :: * -> * -> *).
    Coercible c b =>
    q b c -> (a -> b) -> a -> c
    forall (p :: * -> * -> *) a b c (q :: * -> * -> *).
    (Profunctor p, Coercible c b) =>
    q b c -> p a b -> p a c
    #. b -> Identity t
    bt)
    {-# INLINE withIso #-}

    -- | Convert from 'AnIso' back to any 'Iso'.
    --
    -- This is useful when you need to store an isomorphism as a data type inside a container
    -- and later reconstitute it as an overloaded function.
    --
    -- See 'Control.Lens.Lens.cloneLens' or 'Control.Lens.Traversal.cloneTraversal' for more information on why you might want to do this.
    cloneIso :: AnIso s t a b -> Iso s t a b
    cloneIso :: forall s t a b. AnIso s t a b -> Iso s t a b
    cloneIso AnIso s t a b
    k = AnIso s t a b
    -> ((s -> a) -> (b -> t) -> p a (f b) -> p s (f t))
    -> p a (f b)
    -> p s (f t)
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s t a b
    k (((s -> a) -> (b -> t) -> p a (f b) -> p s (f t))
     -> p a (f b) -> p s (f t))
    -> ((s -> a) -> (b -> t) -> p a (f b) -> p s (f t))
    -> p a (f b)
    -> p s (f t)
    forall a b. (a -> b) -> a -> b
    $ \s -> a
    sa b -> t
    bt -> (s -> a) -> (b -> t) -> Iso s t a b
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso s -> a
    sa b -> t
    bt
    {-# INLINE cloneIso #-}

    -----------------------------------------------------------------------------
    -- Isomorphisms families as Lenses
    -----------------------------------------------------------------------------

    -- | Based on 'Control.Lens.Wrapped.ala' from Conor McBride's work on Epigram.
    --
    -- This version is generalized to accept any 'Iso', not just a @newtype@.
    --
    -- >>> au (_Wrapping Sum) foldMap [1,2,3,4]
    -- 10
    --
    -- You may want to think of this combinator as having the following, simpler type:
    --
    -- @
    -- au :: AnIso s t a b -> ((b -> t) -> e -> s) -> e -> a
    -- @
    --
    -- @
    -- au = xplat . from
    -- @
    au :: Functor f => AnIso s t a b -> ((b -> t) -> f s) -> f a
    au :: forall (f :: * -> *) s t a b.
    Functor f =>
    AnIso s t a b -> ((b -> t) -> f s) -> f a
    au AnIso s t a b
    k = AnIso s t a b
    -> ((s -> a) -> (b -> t) -> ((b -> t) -> f s) -> f a)
    -> ((b -> t) -> f s)
    -> f a
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s t a b
    k (((s -> a) -> (b -> t) -> ((b -> t) -> f s) -> f a)
     -> ((b -> t) -> f s) -> f a)
    -> ((s -> a) -> (b -> t) -> ((b -> t) -> f s) -> f a)
    -> ((b -> t) -> f s)
    -> f a
    forall a b. (a -> b) -> a -> b
    $ \ s -> a
    sa b -> t
    bt (b -> t) -> f s
    f -> (s -> a) -> f s -> f a
    forall a b. (a -> b) -> f a -> f b
    forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
    fmap s -> a
    sa ((b -> t) -> f s
    f b -> t
    bt)
    {-# INLINE au #-}

    -- | Based on @ala'@ from Conor McBride's work on Epigram.
    --
    -- This version is generalized to accept any 'Iso', not just a @newtype@.
    --
    -- For a version you pass the name of the @newtype@ constructor to, see 'Control.Lens.Wrapped.alaf'.
    --
    -- >>> auf (_Wrapping Sum) (foldMapOf both) Prelude.length ("hello","world")
    -- 10
    --
    -- Mnemonically, the German /auf/ plays a similar role to /à la/, and the combinator
    -- is 'au' with an extra function argument:
    --
    -- @
    -- 'auf' :: 'Iso' s t a b -> ((r -> t) -> e -> s) -> (r -> b) -> e -> a
    -- @
    --
    -- but the signature is general.
    --
    -- Note: The direction of the 'Iso' required for this function changed in @lens@ 4.18 to match up
    -- with the behavior of 'au'. For the old behavior use 'xplatf' or for a version that is compatible
    -- across both old and new versions of @lens@ you can just use 'coerce'!
    auf :: (Functor f, Functor g) => AnIso s t a b -> (f t -> g s) -> f b -> g a
    auf :: forall (f :: * -> *) (g :: * -> *) s t a b.
    (Functor f, Functor g) =>
    AnIso s t a b -> (f t -> g s) -> f b -> g a
    auf AnIso s t a b
    k f t -> g s
    ftgs f b
    fb = AnIso s t a b -> ((s -> a) -> (b -> t) -> g a) -> g a
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s t a b
    k (((s -> a) -> (b -> t) -> g a) -> g a)
    -> ((s -> a) -> (b -> t) -> g a) -> g a
    forall a b. (a -> b) -> a -> b
    $ \s -> a
    sa b -> t
    bt -> s -> a
    sa (s -> a) -> g s -> g a
    forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
    <$> f t -> g s
    ftgs (b -> t
    bt (b -> t) -> f b -> f t
    forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
    <$> f b
    fb)
    {-# INLINE auf #-}

    -- | @'xplat' = 'au' . 'from'@ but with a nicer signature.
    xplat :: Optic (Costar ((->) s)) g s t a b -> ((s -> a) -> g b) -> g t
    xplat :: forall {k2} s (g :: k2 -> *) (t :: k2) a (b :: k2).
    Optic (Costar ((->) s)) g s t a b -> ((s -> a) -> g b) -> g t
    xplat Optic (Costar ((->) s)) g s t a b
    f (s -> a) -> g b
    g = Optic (Costar ((->) s)) g s t a b
    -> ((s -> a) -> g b) -> (s -> s) -> g t
    forall {k} {k2} (f :: k -> *) (g :: k2 -> *) (s :: k) (t :: k2)
           (a :: k) (b :: k2).
    Optic (Costar f) g s t a b -> (f a -> g b) -> f s -> g t
    xplatf Optic (Costar ((->) s)) g s t a b
    f (s -> a) -> g b
    g s -> s
    forall a. a -> a
    id

    -- | @'xplatf' = 'auf' . 'from'@ but with a nicer signature.
    --
    -- >>> xplatf (_Unwrapping Sum) (foldMapOf both) Prelude.length ("hello","world")
    -- 10
    --
    -- @
    -- 'xplatf' :: 'Iso' s t a b -> ((r -> a) -> e -> b) -> (r -> s) -> e -> t
    -- @
    xplatf :: Optic (Costar f) g s t a b -> (f a -> g b) -> f s -> g t
    xplatf :: forall {k} {k2} (f :: k -> *) (g :: k2 -> *) (s :: k) (t :: k2)
           (a :: k) (b :: k2).
    Optic (Costar f) g s t a b -> (f a -> g b) -> f s -> g t
    xplatf = Optic (Costar f) g s t a b -> (f a -> g b) -> f s -> g t
    forall a b. Coercible a b => a -> b
    coerce
    {-# INLINE xplat #-}

    -- | The opposite of working 'Control.Lens.Setter.over' a 'Setter' is working 'under' an isomorphism.
    --
    -- @
    -- 'under' ≡ 'Control.Lens.Setter.over' '.' 'from'
    -- @
    --
    -- @
    -- 'under' :: 'Iso' s t a b -> (t -> s) -> b -> a
    -- @
    under :: AnIso s t a b -> (t -> s) -> b -> a
    under :: forall s t a b. AnIso s t a b -> (t -> s) -> b -> a
    under AnIso s t a b
    k = AnIso s t a b
    -> ((s -> a) -> (b -> t) -> (t -> s) -> b -> a)
    -> (t -> s)
    -> b
    -> a
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s t a b
    k (((s -> a) -> (b -> t) -> (t -> s) -> b -> a)
     -> (t -> s) -> b -> a)
    -> ((s -> a) -> (b -> t) -> (t -> s) -> b -> a)
    -> (t -> s)
    -> b
    -> a
    forall a b. (a -> b) -> a -> b
    $ \ s -> a
    sa b -> t
    bt t -> s
    ts -> s -> a
    sa (s -> a) -> (b -> s) -> b -> a
    forall b c a. (b -> c) -> (a -> b) -> a -> c
    . t -> s
    ts (t -> s) -> (b -> t) -> b -> s
    forall b c a. (b -> c) -> (a -> b) -> a -> c
    . b -> t
    bt
    {-# INLINE under #-}

    -----------------------------------------------------------------------------
    -- Isomorphisms
    -----------------------------------------------------------------------------

    -- | This isomorphism can be used to convert to or from an instance of 'Enum'.
    --
    -- >>> LT^.from enum
    -- 0
    --
    -- >>> 97^.enum :: Char
    -- 'a'
    --
    -- Note: this is only an isomorphism from the numeric range actually used
    -- and it is a bit of a pleasant fiction, since there are questionable
    -- 'Enum' instances for 'Double', and 'Float' that exist solely for
    -- @[1.0 .. 4.0]@ sugar and the instances for those and 'Integer' don't
    -- cover all values in their range.
    enum :: Enum a => Iso' Int a
    enum :: forall a. Enum a => Iso' Int a
    enum = (Int -> a) -> (a -> Int) -> Iso Int Int a a
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso Int -> a
    forall a. Enum a => Int -> a
    toEnum a -> Int
    forall a. Enum a => a -> Int
    fromEnum
    {-# INLINE enum #-}

    -- | This can be used to lift any 'Iso' into an arbitrary 'Functor'.
    mapping :: (Functor f, Functor g) => AnIso s t a b -> Iso (f s) (g t) (f a) (g b)
    mapping :: forall (f :: * -> *) (g :: * -> *) s t a b.
    (Functor f, Functor g) =>
    AnIso s t a b -> Iso (f s) (g t) (f a) (g b)
    mapping AnIso s t a b
    k = AnIso s t a b
    -> ((s -> a) -> (b -> t) -> p (f a) (f (g b)) -> p (f s) (f (g t)))
    -> p (f a) (f (g b))
    -> p (f s) (f (g t))
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s t a b
    k (((s -> a) -> (b -> t) -> p (f a) (f (g b)) -> p (f s) (f (g t)))
     -> p (f a) (f (g b)) -> p (f s) (f (g t)))
    -> ((s -> a) -> (b -> t) -> p (f a) (f (g b)) -> p (f s) (f (g t)))
    -> p (f a) (f (g b))
    -> p (f s) (f (g t))
    forall a b. (a -> b) -> a -> b
    $ \ s -> a
    sa b -> t
    bt -> (f s -> f a) -> (g b -> g t) -> Iso (f s) (g t) (f a) (g b)
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso ((s -> a) -> f s -> f a
    forall a b. (a -> b) -> f a -> f b
    forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
    fmap s -> a
    sa) ((b -> t) -> g b -> g t
    forall a b. (a -> b) -> g a -> g b
    forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
    fmap b -> t
    bt)
    {-# INLINE mapping #-}

    -- | If @v@ is an element of a type @a@, and @a'@ is @a@ sans the element @v@, then @'non' v@ is an isomorphism from
    -- @'Maybe' a'@ to @a@.
    --
    -- @
    -- 'non' ≡ 'non'' '.' 'only'
    -- @
    --
    -- Keep in mind this is only a real isomorphism if you treat the domain as being @'Maybe' (a sans v)@.
    --
    -- This is practically quite useful when you want to have a 'Data.Map.Map' where all the entries should have non-zero values.
    --
    -- >>> Map.fromList [("hello",1)] & at "hello" . non 0 +~ 2
    -- fromList [("hello",3)]
    --
    -- >>> Map.fromList [("hello",1)] & at "hello" . non 0 -~ 1
    -- fromList []
    --
    -- >>> Map.fromList [("hello",1)] ^. at "hello" . non 0
    -- 1
    --
    -- >>> Map.fromList [] ^. at "hello" . non 0
    -- 0
    --
    -- This combinator is also particularly useful when working with nested maps.
    --
    -- /e.g./ When you want to create the nested 'Data.Map.Map' when it is missing:
    --
    -- >>> Map.empty & at "hello" . non Map.empty . at "world" ?~ "!!!"
    -- fromList [("hello",fromList [("world","!!!")])]
    --
    -- and when have deleting the last entry from the nested 'Data.Map.Map' mean that we
    -- should delete its entry from the surrounding one:
    --
    -- >>> Map.fromList [("hello",Map.fromList [("world","!!!")])] & at "hello" . non Map.empty . at "world" .~ Nothing
    -- fromList []
    --
    -- It can also be used in reverse to exclude a given value:
    --
    -- >>> non 0 # rem 10 4
    -- Just 2
    --
    -- >>> non 0 # rem 10 5
    -- Nothing
    non :: Eq a => a -> Iso' (Maybe a) a
    non :: forall a. Eq a => a -> Iso' (Maybe a) a
    non a
    a = APrism' a () -> Iso' (Maybe a) a
    forall a. APrism' a () -> Iso' (Maybe a) a
    non' (APrism' a () -> Iso' (Maybe a) a)
    -> APrism' a () -> Iso' (Maybe a) a
    forall a b. (a -> b) -> a -> b
    $ a -> Prism' a ()
    forall a. Eq a => a -> Prism' a ()
    only a
    a
    {-# INLINE non #-}

    -- | @'non'' p@ generalizes @'non' (p # ())@ to take any unit 'Prism'
    --
    -- This function generates an isomorphism between @'Maybe' (a | 'isn't' p a)@ and @a@.
    --
    -- >>> Map.singleton "hello" Map.empty & at "hello" . non' _Empty . at "world" ?~ "!!!"
    -- fromList [("hello",fromList [("world","!!!")])]
    --
    -- >>> Map.fromList [("hello",Map.fromList [("world","!!!")])] & at "hello" . non' _Empty . at "world" .~ Nothing
    -- fromList []
    non' :: APrism' a () -> Iso' (Maybe a) a
    non' :: forall a. APrism' a () -> Iso' (Maybe a) a
    non' APrism' a ()
    p = (Maybe a -> a) -> (a -> Maybe a) -> Iso (Maybe a) (Maybe a) a a
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso (a -> Maybe a -> a
    forall a. a -> Maybe a -> a
    fromMaybe a
    def) a -> Maybe a
    go where
      def :: a
    def                           = AReview a () -> () -> a
    forall b (m :: * -> *) t. MonadReader b m => AReview t b -> m t
    review (APrism' a () -> Prism a a () ()
    forall s t a b. APrism s t a b -> Prism s t a b
    clonePrism APrism' a ()
    p) ()
      go :: a -> Maybe a
    go a
    b | Getting Any a () -> a -> Bool
    forall s a. Getting Any s a -> s -> Bool
    has (APrism' a () -> Prism a a () ()
    forall s t a b. APrism s t a b -> Prism s t a b
    clonePrism APrism' a ()
    p) a
    b   = Maybe a
    forall a. Maybe a
    Nothing
           | Bool
    otherwise              = a -> Maybe a
    forall a. a -> Maybe a
    Just a
    b
    {-# INLINE non' #-}

    -- | @'anon' a p@ generalizes @'non' a@ to take any value and a predicate.
    --
    -- This function assumes that @p a@ holds @'True'@ and generates an isomorphism between @'Maybe' (a | 'not' (p a))@ and @a@.
    --
    -- >>> Map.empty & at "hello" . anon Map.empty Map.null . at "world" ?~ "!!!"
    -- fromList [("hello",fromList [("world","!!!")])]
    --
    -- >>> Map.fromList [("hello",Map.fromList [("world","!!!")])] & at "hello" . anon Map.empty Map.null . at "world" .~ Nothing
    -- fromList []
    anon :: a -> (a -> Bool) -> Iso' (Maybe a) a
    anon :: forall a. a -> (a -> Bool) -> Iso' (Maybe a) a
    anon a
    a a -> Bool
    p = (Maybe a -> a) -> (a -> Maybe a) -> Iso (Maybe a) (Maybe a) a a
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso (a -> Maybe a -> a
    forall a. a -> Maybe a -> a
    fromMaybe a
    a) a -> Maybe a
    go where
      go :: a -> Maybe a
    go a
    b | a -> Bool
    p a
    b       = Maybe a
    forall a. Maybe a
    Nothing
           | Bool
    otherwise = a -> Maybe a
    forall a. a -> Maybe a
    Just a
    b
    {-# INLINE anon #-}

    -- | The canonical isomorphism for currying and uncurrying a function.
    --
    -- @
    -- 'curried' = 'iso' 'curry' 'uncurry'
    -- @
    --
    -- >>> (fst^.curried) 3 4
    -- 3
    --
    -- >>> view curried fst 3 4
    -- 3
    curried :: Iso ((a,b) -> c) ((d,e) -> f) (a -> b -> c) (d -> e -> f)
    curried :: forall a b c d e f (p :: * -> * -> *) (f :: * -> *).
    (Profunctor p, Functor f) =>
    p (a -> b -> c) (f (d -> e -> f))
    -> p ((a, b) -> c) (f ((d, e) -> f))
    curried = (((a, b) -> c) -> a -> b -> c)
    -> ((d -> e -> f) -> (d, e) -> f)
    -> Iso ((a, b) -> c) ((d, e) -> f) (a -> b -> c) (d -> e -> f)
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso ((a, b) -> c) -> a -> b -> c
    forall a b c. ((a, b) -> c) -> a -> b -> c
    curry (d -> e -> f) -> (d, e) -> f
    forall a b c. (a -> b -> c) -> (a, b) -> c
    uncurry
    {-# INLINE curried #-}

    -- | The canonical isomorphism for uncurrying and currying a function.
    --
    -- @
    -- 'uncurried' = 'iso' 'uncurry' 'curry'
    -- @
    --
    -- @
    -- 'uncurried' = 'from' 'curried'
    -- @
    --
    -- >>> ((+)^.uncurried) (1,2)
    -- 3
    uncurried :: Iso (a -> b -> c) (d -> e -> f) ((a,b) -> c) ((d,e) -> f)
    uncurried :: forall a b c d e f (p :: * -> * -> *) (f :: * -> *).
    (Profunctor p, Functor f) =>
    p ((a, b) -> c) (f ((d, e) -> f))
    -> p (a -> b -> c) (f (d -> e -> f))
    uncurried = ((a -> b -> c) -> (a, b) -> c)
    -> (((d, e) -> f) -> d -> e -> f)
    -> Iso (a -> b -> c) (d -> e -> f) ((a, b) -> c) ((d, e) -> f)
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso (a -> b -> c) -> (a, b) -> c
    forall a b c. (a -> b -> c) -> (a, b) -> c
    uncurry ((d, e) -> f) -> d -> e -> f
    forall a b c. ((a, b) -> c) -> a -> b -> c
    curry
    {-# INLINE uncurried #-}

    -- | The isomorphism for flipping a function.
    --
    -- >>>((,)^.flipped) 1 2
    -- (2,1)
    flipped :: Iso (a -> b -> c) (a' -> b' -> c') (b -> a -> c) (b' -> a' -> c')
    flipped :: forall a b c a' b' c' (p :: * -> * -> *) (f :: * -> *).
    (Profunctor p, Functor f) =>
    p (b -> a -> c) (f (b' -> a' -> c'))
    -> p (a -> b -> c) (f (a' -> b' -> c'))
    flipped = ((a -> b -> c) -> b -> a -> c)
    -> ((b' -> a' -> c') -> a' -> b' -> c')
    -> Iso
         (a -> b -> c) (a' -> b' -> c') (b -> a -> c) (b' -> a' -> c')
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso (a -> b -> c) -> b -> a -> c
    forall a b c. (a -> b -> c) -> b -> a -> c
    flip (b' -> a' -> c') -> a' -> b' -> c'
    forall a b c. (a -> b -> c) -> b -> a -> c
    flip
    {-# INLINE flipped #-}

    -- |
    -- @
    -- 'swapped' '.' 'swapped' ≡ 'id'
    -- 'first' f '.' 'swapped' = 'swapped' '.' 'second' f
    -- 'second' g '.' 'swapped' = 'swapped' '.' 'first' g
    -- 'bimap' f g '.' 'swapped' = 'swapped' '.' 'bimap' g f
    -- @
    --
    -- >>> (1,2)^.swapped
    -- (2,1)
    swapped :: Swap p => Iso (p a b) (p c d) (p b a) (p d c)
    swapped :: forall (p :: * -> * -> *) a b c d.
    Swap p =>
    Iso (p a b) (p c d) (p b a) (p d c)
    swapped = (p a b -> p b a)
    -> (p d c -> p c d) -> Iso (p a b) (p c d) (p b a) (p d c)
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso p a b -> p b a
    forall a b. p a b -> p b a
    forall (p :: * -> * -> *) a b. Swap p => p a b -> p b a
    swap p d c -> p c d
    forall a b. p a b -> p b a
    forall (p :: * -> * -> *) a b. Swap p => p a b -> p b a
    swap
    {-# INLINE swapped #-}

    -- | An 'Iso' between the lazy variant of a structure and its strict
    -- counterpart.
    --
    -- @
    -- 'strict' = 'from' 'lazy'
    -- @
    strict :: Strict lazy strict => Iso' lazy strict
    strict :: forall lazy strict. Strict lazy strict => Iso' lazy strict
    strict = (lazy -> strict) -> (strict -> lazy) -> Iso lazy lazy strict strict
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso lazy -> strict
    forall lazy strict. Strict lazy strict => lazy -> strict
    toStrict strict -> lazy
    forall lazy strict. Strict lazy strict => strict -> lazy
    toLazy
    {-# INLINE strict #-}

    pattern Strict :: Strict s t => t -> s
    pattern $mStrict :: forall {r} {s} {t}.
    Strict s t =>
    s -> (t -> r) -> ((# #) -> r) -> r
    $bStrict :: forall lazy strict. Strict lazy strict => strict -> lazy
    Strict a <- (view strict -> a) where
      Strict t
    a = AReview s t -> t -> s
    forall b (m :: * -> *) t. MonadReader b m => AReview t b -> m t
    review AReview s t
    forall lazy strict. Strict lazy strict => Iso' lazy strict
    Iso' s t
    strict t
    a

    pattern Lazy :: Strict t s => t -> s
    pattern $mLazy :: forall {r} {t} {s}.
    Strict t s =>
    s -> (t -> r) -> ((# #) -> r) -> r
    $bLazy :: forall lazy strict. Strict lazy strict => lazy -> strict
    Lazy a <- (view lazy -> a) where
      Lazy t
    a = AReview s t -> t -> s
    forall b (m :: * -> *) t. MonadReader b m => AReview t b -> m t
    review AReview s t
    forall lazy strict. Strict lazy strict => Iso' strict lazy
    Iso' s t
    lazy t
    a

    pattern Swapped :: Swap p => p b a -> p a b
    pattern $mSwapped :: forall {r} {p :: * -> * -> *} {b} {a}.
    Swap p =>
    p a b -> (p b a -> r) -> ((# #) -> r) -> r
    $bSwapped :: forall (p :: * -> * -> *) b a. Swap p => p b a -> p a b
    Swapped a <- (view swapped -> a) where
      Swapped p b a
    a = AReview (p a b) (p b a) -> p b a -> p a b
    forall b (m :: * -> *) t. MonadReader b m => AReview t b -> m t
    review AReview (p a b) (p b a)
    forall (p :: * -> * -> *) a b c d.
    Swap p =>
    Iso (p a b) (p c d) (p b a) (p d c)
    Iso (p a b) (p a b) (p b a) (p b a)
    swapped p b a
    a

    pattern Reversed :: Reversing t => t -> t
    pattern $mReversed :: forall {r} {t}. Reversing t => t -> (t -> r) -> ((# #) -> r) -> r
    $bReversed :: forall t. Reversing t => t -> t
    Reversed a <- (view reversed -> a) where
      Reversed t
    a = AReview t t -> t -> t
    forall b (m :: * -> *) t. MonadReader b m => AReview t b -> m t
    review AReview t t
    forall a. Reversing a => Iso' a a
    Iso' t t
    reversed t
    a

    -- | An 'Iso' between the strict variant of a structure and its lazy
    -- counterpart.
    --
    -- @
    -- 'lazy' = 'from' 'strict'
    -- @
    --
    lazy :: Strict lazy strict => Iso' strict lazy
    lazy :: forall lazy strict. Strict lazy strict => Iso' strict lazy
    lazy = (strict -> lazy) -> (lazy -> strict) -> Iso strict strict lazy lazy
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso strict -> lazy
    forall lazy strict. Strict lazy strict => strict -> lazy
    toLazy lazy -> strict
    forall lazy strict. Strict lazy strict => lazy -> strict
    toStrict
    {-# INLINE lazy #-}

    -- | An 'Iso' between a list, 'ByteString', 'Text' fragment, etc. and its reversal.
    --
    -- >>> "live" ^. reversed
    -- "evil"
    --
    -- >>> "live" & reversed %~ ('d':)
    -- "lived"
    reversed :: Reversing a => Iso' a a
    reversed :: forall a. Reversing a => Iso' a a
    reversed = (a -> a) -> Iso' a a
    forall a. (a -> a) -> Iso' a a
    involuted a -> a
    forall t. Reversing t => t -> t
    Iso.reversing

    -- | Given a function that is its own inverse, this gives you an 'Iso' using it in both directions.
    --
    -- @
    -- 'involuted' ≡ 'Control.Monad.join' 'iso'
    -- @
    --
    -- >>> "live" ^. involuted reverse
    -- "evil"
    --
    -- >>> "live" & involuted reverse %~ ('d':)
    -- "lived"
    involuted :: (a -> a) -> Iso' a a
    involuted :: forall a. (a -> a) -> Iso' a a
    involuted a -> a
    a = (a -> a) -> (a -> a) -> Iso a a a a
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso a -> a
    a a -> a
    a
    {-# INLINE involuted #-}

    pattern List :: Exts.IsList l => [Exts.Item l] -> l
    pattern $mList :: forall {r} {l}.
    IsList l =>
    l -> ([Item l] -> r) -> ((# #) -> r) -> r
    $bList :: forall l. IsList l => [Item l] -> l
    List a <- (Exts.toList -> a) where
      List [Item l]
    a = [Item l] -> l
    forall l. IsList l => [Item l] -> l
    Exts.fromList [Item l]
    a

    ------------------------------------------------------------------------------
    -- Magma
    ------------------------------------------------------------------------------

    -- | This isomorphism can be used to inspect a 'Traversal' to see how it associates
    -- the structure and it can also be used to bake the 'Traversal' into a 'Magma' so
    -- that you can traverse over it multiple times.
    magma :: LensLike (Mafic a b) s t a b -> Iso s u (Magma Int t b a) (Magma j u c c)
    magma :: forall a b s t u j c.
    LensLike (Mafic a b) s t a b
    -> Iso s u (Magma Int t b a) (Magma j u c c)
    magma LensLike (Mafic a b) s t a b
    l = (s -> Magma Int t b a)
    -> (Magma j u c c -> u)
    -> Iso s u (Magma Int t b a) (Magma j u c c)
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso (Mafic a b t -> Magma Int t b a
    forall a b t. Mafic a b t -> Magma Int t b a
    runMafic (Mafic a b t -> Magma Int t b a)
    -> (s -> Mafic a b t) -> s -> Magma Int t b a
    forall b c a. (b -> c) -> (a -> b) -> a -> c
    forall (p :: * -> * -> *) b c a.
    Profunctor p =>
    (b -> c) -> p a b -> p a c
    `rmap` LensLike (Mafic a b) s t a b
    l a -> Mafic a b b
    forall a b. a -> Mafic a b b
    forall (p :: * -> * -> *) (w :: * -> * -> * -> *) a b.
    Sellable p w =>
    p a (w a b b)
    sell) Magma j u c c -> u
    forall i t a. Magma i t a a -> t
    runMagma
    {-# INLINE magma #-}

    -- | This isomorphism can be used to inspect an 'IndexedTraversal' to see how it associates
    -- the structure and it can also be used to bake the 'IndexedTraversal' into a 'Magma' so
    -- that you can traverse over it multiple times with access to the original indices.
    imagma :: Over (Indexed i) (Molten i a b) s t a b -> Iso s t' (Magma i t b a) (Magma j t' c c)
    imagma :: forall i a b s t t' j c.
    Over (Indexed i) (Molten i a b) s t a b
    -> Iso s t' (Magma i t b a) (Magma j t' c c)
    imagma Over (Indexed i) (Molten i a b) s t a b
    l = (s -> Magma i t b a)
    -> (Magma j t' c c -> t')
    -> Iso s t' (Magma i t b a) (Magma j t' c c)
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso (Molten i a b t -> Magma i t b a
    forall i a b t. Molten i a b t -> Magma i t b a
    runMolten (Molten i a b t -> Magma i t b a)
    -> (s -> Molten i a b t) -> s -> Magma i t b a
    forall a b c (q :: * -> * -> *).
    Coercible c b =>
    q b c -> (a -> b) -> a -> c
    forall (p :: * -> * -> *) a b c (q :: * -> * -> *).
    (Profunctor p, Coercible c b) =>
    q b c -> p a b -> p a c
    #. Over (Indexed i) (Molten i a b) s t a b
    l Indexed i a (Molten i a b b)
    forall a b. Indexed i a (Molten i a b b)
    forall (p :: * -> * -> *) (w :: * -> * -> * -> *) a b.
    Sellable p w =>
    p a (w a b b)
    sell) (Molten j c c t' -> t'
    forall a t. Molten j a a t -> t
    forall (w :: * -> * -> * -> *) a t.
    IndexedComonad w =>
    w a a t -> t
    iextract (Molten j c c t' -> t')
    -> (Magma j t' c c -> Molten j c c t') -> Magma j t' c c -> t'
    forall a b c (q :: * -> * -> *).
    Coercible b a =>
    (b -> c) -> q a b -> a -> c
    forall (p :: * -> * -> *) a b c (q :: * -> * -> *).
    (Profunctor p, Coercible b a) =>
    p b c -> q a b -> p a c
    .# Magma j t' c c -> Molten j c c t'
    forall i a b t. Magma i t b a -> Molten i a b t
    Molten)
    {-# INLINE imagma #-}

    ------------------------------------------------------------------------------
    -- Contravariant
    ------------------------------------------------------------------------------

    -- | Lift an 'Iso' into a 'Contravariant' functor.
    --
    -- @
    -- contramapping :: 'Contravariant' f => 'Iso' s t a b -> 'Iso' (f a) (f b) (f s) (f t)
    -- contramapping :: 'Contravariant' f => 'Iso'' s a -> 'Iso'' (f a) (f s)
    -- @
    contramapping :: Contravariant f => AnIso s t a b -> Iso (f a) (f b) (f s) (f t)
    contramapping :: forall (f :: * -> *) s t a b.
    Contravariant f =>
    AnIso s t a b -> Iso (f a) (f b) (f s) (f t)
    contramapping AnIso s t a b
    f = AnIso s t a b
    -> ((s -> a) -> (b -> t) -> p (f s) (f (f t)) -> p (f a) (f (f b)))
    -> p (f s) (f (f t))
    -> p (f a) (f (f b))
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s t a b
    f (((s -> a) -> (b -> t) -> p (f s) (f (f t)) -> p (f a) (f (f b)))
     -> p (f s) (f (f t)) -> p (f a) (f (f b)))
    -> ((s -> a) -> (b -> t) -> p (f s) (f (f t)) -> p (f a) (f (f b)))
    -> p (f s) (f (f t))
    -> p (f a) (f (f b))
    forall a b. (a -> b) -> a -> b
    $ \ s -> a
    sa b -> t
    bt -> (f a -> f s) -> (f t -> f b) -> Iso (f a) (f b) (f s) (f t)
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso ((s -> a) -> f a -> f s
    forall a' a. (a' -> a) -> f a -> f a'
    forall (f :: * -> *) a' a.
    Contravariant f =>
    (a' -> a) -> f a -> f a'
    contramap s -> a
    sa) ((b -> t) -> f t -> f b
    forall a' a. (a' -> a) -> f a -> f a'
    forall (f :: * -> *) a' a.
    Contravariant f =>
    (a' -> a) -> f a -> f a'
    contramap b -> t
    bt)
    {-# INLINE contramapping #-}

    ------------------------------------------------------------------------------
    -- Profunctor
    ------------------------------------------------------------------------------

    -- | Lift two 'Iso's into both arguments of a 'Profunctor' simultaneously.
    --
    -- @
    -- dimapping :: 'Profunctor' p => 'Iso' s t a b -> 'Iso' s' t' a' b' -> 'Iso' (p a s') (p b t') (p s a') (p t b')
    -- dimapping :: 'Profunctor' p => 'Iso'' s a -> 'Iso'' s' a' -> 'Iso'' (p a s') (p s a')
    -- @
    dimapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (p a s') (q b t') (p s a') (q t b')
    dimapping :: forall (p :: * -> * -> *) (q :: * -> * -> *) s t a b s' t' a' b'.
    (Profunctor p, Profunctor q) =>
    AnIso s t a b
    -> AnIso s' t' a' b' -> Iso (p a s') (q b t') (p s a') (q t b')
    dimapping AnIso s t a b
    f AnIso s' t' a' b'
    g = AnIso s t a b
    -> ((s -> a)
        -> (b -> t) -> p (p s a') (f (q t b')) -> p (p a s') (f (q b t')))
    -> p (p s a') (f (q t b'))
    -> p (p a s') (f (q b t'))
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s t a b
    f (((s -> a)
      -> (b -> t) -> p (p s a') (f (q t b')) -> p (p a s') (f (q b t')))
     -> p (p s a') (f (q t b')) -> p (p a s') (f (q b t')))
    -> ((s -> a)
        -> (b -> t) -> p (p s a') (f (q t b')) -> p (p a s') (f (q b t')))
    -> p (p s a') (f (q t b'))
    -> p (p a s') (f (q b t'))
    forall a b. (a -> b) -> a -> b
    $ \ s -> a
    sa b -> t
    bt -> AnIso s' t' a' b'
    -> ((s' -> a')
        -> (b' -> t')
        -> p (p s a') (f (q t b'))
        -> p (p a s') (f (q b t')))
    -> p (p s a') (f (q t b'))
    -> p (p a s') (f (q b t'))
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s' t' a' b'
    g (((s' -> a')
      -> (b' -> t')
      -> p (p s a') (f (q t b'))
      -> p (p a s') (f (q b t')))
     -> p (p s a') (f (q t b')) -> p (p a s') (f (q b t')))
    -> ((s' -> a')
        -> (b' -> t')
        -> p (p s a') (f (q t b'))
        -> p (p a s') (f (q b t')))
    -> p (p s a') (f (q t b'))
    -> p (p a s') (f (q b t'))
    forall a b. (a -> b) -> a -> b
    $ \ s' -> a'
    s'a' b' -> t'
    b't' ->
      (p a s' -> p s a')
    -> (q t b' -> q b t') -> Iso (p a s') (q b t') (p s a') (q t b')
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso ((s -> a) -> (s' -> a') -> p a s' -> p s a'
    forall a b c d. (a -> b) -> (c -> d) -> p b c -> p a d
    forall (p :: * -> * -> *) a b c d.
    Profunctor p =>
    (a -> b) -> (c -> d) -> p b c -> p a d
    dimap s -> a
    sa s' -> a'
    s'a') ((b -> t) -> (b' -> t') -> q t b' -> q b t'
    forall a b c d. (a -> b) -> (c -> d) -> q b c -> q a d
    forall (p :: * -> * -> *) a b c d.
    Profunctor p =>
    (a -> b) -> (c -> d) -> p b c -> p a d
    dimap b -> t
    bt b' -> t'
    b't')
    {-# INLINE dimapping #-}

    -- | Lift an 'Iso' contravariantly into the left argument of a 'Profunctor'.
    --
    -- @
    -- lmapping :: 'Profunctor' p => 'Iso' s t a b -> 'Iso' (p a x) (p b y) (p s x) (p t y)
    -- lmapping :: 'Profunctor' p => 'Iso'' s a -> 'Iso'' (p a x) (p s x)
    -- @
    lmapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p a x) (q b y) (p s x) (q t y)
    lmapping :: forall (p :: * -> * -> *) (q :: * -> * -> *) s t a b x y.
    (Profunctor p, Profunctor q) =>
    AnIso s t a b -> Iso (p a x) (q b y) (p s x) (q t y)
    lmapping AnIso s t a b
    f = AnIso s t a b
    -> ((s -> a)
        -> (b -> t) -> p (p s x) (f (q t y)) -> p (p a x) (f (q b y)))
    -> p (p s x) (f (q t y))
    -> p (p a x) (f (q b y))
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s t a b
    f (((s -> a)
      -> (b -> t) -> p (p s x) (f (q t y)) -> p (p a x) (f (q b y)))
     -> p (p s x) (f (q t y)) -> p (p a x) (f (q b y)))
    -> ((s -> a)
        -> (b -> t) -> p (p s x) (f (q t y)) -> p (p a x) (f (q b y)))
    -> p (p s x) (f (q t y))
    -> p (p a x) (f (q b y))
    forall a b. (a -> b) -> a -> b
    $ \ s -> a
    sa b -> t
    bt -> (p a x -> p s x)
    -> (q t y -> q b y) -> Iso (p a x) (q b y) (p s x) (q t y)
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso ((s -> a) -> p a x -> p s x
    forall a b c. (a -> b) -> p b c -> p a c
    forall (p :: * -> * -> *) a b c.
    Profunctor p =>
    (a -> b) -> p b c -> p a c
    lmap s -> a
    sa) ((b -> t) -> q t y -> q b y
    forall a b c. (a -> b) -> q b c -> q a c
    forall (p :: * -> * -> *) a b c.
    Profunctor p =>
    (a -> b) -> p b c -> p a c
    lmap b -> t
    bt)
    {-# INLINE lmapping #-}

    -- | Lift an 'Iso' covariantly into the right argument of a 'Profunctor'.
    --
    -- @
    -- rmapping :: 'Profunctor' p => 'Iso' s t a b -> 'Iso' (p x s) (p y t) (p x a) (p y b)
    -- rmapping :: 'Profunctor' p => 'Iso'' s a -> 'Iso'' (p x s) (p x a)
    -- @
    rmapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p x s) (q y t) (p x a) (q y b)
    rmapping :: forall (p :: * -> * -> *) (q :: * -> * -> *) s t a b x y.
    (Profunctor p, Profunctor q) =>
    AnIso s t a b -> Iso (p x s) (q y t) (p x a) (q y b)
    rmapping AnIso s t a b
    g = AnIso s t a b
    -> ((s -> a)
        -> (b -> t) -> p (p x a) (f (q y b)) -> p (p x s) (f (q y t)))
    -> p (p x a) (f (q y b))
    -> p (p x s) (f (q y t))
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s t a b
    g (((s -> a)
      -> (b -> t) -> p (p x a) (f (q y b)) -> p (p x s) (f (q y t)))
     -> p (p x a) (f (q y b)) -> p (p x s) (f (q y t)))
    -> ((s -> a)
        -> (b -> t) -> p (p x a) (f (q y b)) -> p (p x s) (f (q y t)))
    -> p (p x a) (f (q y b))
    -> p (p x s) (f (q y t))
    forall a b. (a -> b) -> a -> b
    $ \ s -> a
    sa b -> t
    bt -> (p x s -> p x a)
    -> (q y b -> q y t) -> Iso (p x s) (q y t) (p x a) (q y b)
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso ((s -> a) -> p x s -> p x a
    forall b c a. (b -> c) -> p a b -> p a c
    forall (p :: * -> * -> *) b c a.
    Profunctor p =>
    (b -> c) -> p a b -> p a c
    rmap s -> a
    sa) ((b -> t) -> q y b -> q y t
    forall b c a. (b -> c) -> q a b -> q a c
    forall (p :: * -> * -> *) b c a.
    Profunctor p =>
    (b -> c) -> p a b -> p a c
    rmap b -> t
    bt)
    {-# INLINE rmapping #-}

    ------------------------------------------------------------------------------
    -- Bifunctor
    ------------------------------------------------------------------------------

    -- | Lift two 'Iso's into both arguments of a 'Bifunctor'.
    --
    -- @
    -- bimapping :: 'Bifunctor' p => 'Iso' s t a b -> 'Iso' s' t' a' b' -> 'Iso' (p s s') (p t t') (p a a') (p b b')
    -- bimapping :: 'Bifunctor' p => 'Iso'' s a -> 'Iso'' s' a' -> 'Iso'' (p s s') (p a a')
    -- @
    bimapping :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (f s s') (g t t') (f a a') (g b b')
    bimapping :: forall (f :: * -> * -> *) (g :: * -> * -> *) s t a b s' t' a' b'.
    (Bifunctor f, Bifunctor g) =>
    AnIso s t a b
    -> AnIso s' t' a' b' -> Iso (f s s') (g t t') (f a a') (g b b')
    bimapping AnIso s t a b
    f AnIso s' t' a' b'
    g = AnIso s t a b
    -> ((s -> a)
        -> (b -> t) -> p (f a a') (f (g b b')) -> p (f s s') (f (g t t')))
    -> p (f a a') (f (g b b'))
    -> p (f s s') (f (g t t'))
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s t a b
    f (((s -> a)
      -> (b -> t) -> p (f a a') (f (g b b')) -> p (f s s') (f (g t t')))
     -> p (f a a') (f (g b b')) -> p (f s s') (f (g t t')))
    -> ((s -> a)
        -> (b -> t) -> p (f a a') (f (g b b')) -> p (f s s') (f (g t t')))
    -> p (f a a') (f (g b b'))
    -> p (f s s') (f (g t t'))
    forall a b. (a -> b) -> a -> b
    $ \ s -> a
    sa b -> t
    bt -> AnIso s' t' a' b'
    -> ((s' -> a')
        -> (b' -> t')
        -> p (f a a') (f (g b b'))
        -> p (f s s') (f (g t t')))
    -> p (f a a') (f (g b b'))
    -> p (f s s') (f (g t t'))
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s' t' a' b'
    g (((s' -> a')
      -> (b' -> t')
      -> p (f a a') (f (g b b'))
      -> p (f s s') (f (g t t')))
     -> p (f a a') (f (g b b')) -> p (f s s') (f (g t t')))
    -> ((s' -> a')
        -> (b' -> t')
        -> p (f a a') (f (g b b'))
        -> p (f s s') (f (g t t')))
    -> p (f a a') (f (g b b'))
    -> p (f s s') (f (g t t'))
    forall a b. (a -> b) -> a -> b
    $ \s' -> a'
    s'a' b' -> t'
    b't' ->
      (f s s' -> f a a')
    -> (g b b' -> g t t') -> Iso (f s s') (g t t') (f a a') (g b b')
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso ((s -> a) -> (s' -> a') -> f s s' -> f a a'
    forall a b c d. (a -> b) -> (c -> d) -> f a c -> f b d
    forall (p :: * -> * -> *) a b c d.
    Bifunctor p =>
    (a -> b) -> (c -> d) -> p a c -> p b d
    bimap s -> a
    sa s' -> a'
    s'a') ((b -> t) -> (b' -> t') -> g b b' -> g t t'
    forall a b c d. (a -> b) -> (c -> d) -> g a c -> g b d
    forall (p :: * -> * -> *) a b c d.
    Bifunctor p =>
    (a -> b) -> (c -> d) -> p a c -> p b d
    bimap b -> t
    bt b' -> t'
    b't')
    {-# INLINE bimapping #-}

    -- | Lift an 'Iso' into the first argument of a 'Bifunctor'.
    --
    -- @
    -- firsting :: 'Bifunctor' p => 'Iso' s t a b -> 'Iso' (p s x) (p t y) (p a x) (p b y)
    -- firsting :: 'Bifunctor' p => 'Iso'' s a -> 'Iso'' (p s x) (p a x)
    -- @
    firsting :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f s x) (g t y) (f a x) (g b y)
    firsting :: forall (f :: * -> * -> *) (g :: * -> * -> *) s t a b x y.
    (Bifunctor f, Bifunctor g) =>
    AnIso s t a b -> Iso (f s x) (g t y) (f a x) (g b y)
    firsting AnIso s t a b
    p = AnIso s t a b
    -> ((s -> a)
        -> (b -> t) -> p (f a x) (f (g b y)) -> p (f s x) (f (g t y)))
    -> p (f a x) (f (g b y))
    -> p (f s x) (f (g t y))
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s t a b
    p (((s -> a)
      -> (b -> t) -> p (f a x) (f (g b y)) -> p (f s x) (f (g t y)))
     -> p (f a x) (f (g b y)) -> p (f s x) (f (g t y)))
    -> ((s -> a)
        -> (b -> t) -> p (f a x) (f (g b y)) -> p (f s x) (f (g t y)))
    -> p (f a x) (f (g b y))
    -> p (f s x) (f (g t y))
    forall a b. (a -> b) -> a -> b
    $ \ s -> a
    sa b -> t
    bt -> (f s x -> f a x)
    -> (g b y -> g t y) -> Iso (f s x) (g t y) (f a x) (g b y)
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso ((s -> a) -> f s x -> f a x
    forall a b c. (a -> b) -> f a c -> f b c
    forall (p :: * -> * -> *) a b c.
    Bifunctor p =>
    (a -> b) -> p a c -> p b c
    first s -> a
    sa) ((b -> t) -> g b y -> g t y
    forall a b c. (a -> b) -> g a c -> g b c
    forall (p :: * -> * -> *) a b c.
    Bifunctor p =>
    (a -> b) -> p a c -> p b c
    first b -> t
    bt)
    {-# INLINE firsting #-}

    -- | Lift an 'Iso' into the second argument of a 'Bifunctor'. This is
    -- essentially the same as 'mapping', but it takes a 'Bifunctor p'
    -- constraint instead of a 'Functor (p a)' one.
    --
    -- @
    -- seconding :: 'Bifunctor' p => 'Iso' s t a b -> 'Iso' (p x s) (p y t) (p x a) (p y b)
    -- seconding :: 'Bifunctor' p => 'Iso'' s a -> 'Iso'' (p x s) (p x a)
    -- @
    seconding :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f x s) (g y t) (f x a) (g y b)
    seconding :: forall (f :: * -> * -> *) (g :: * -> * -> *) s t a b x y.
    (Bifunctor f, Bifunctor g) =>
    AnIso s t a b -> Iso (f x s) (g y t) (f x a) (g y b)
    seconding AnIso s t a b
    p = AnIso s t a b
    -> ((s -> a)
        -> (b -> t) -> p (f x a) (f (g y b)) -> p (f x s) (f (g y t)))
    -> p (f x a) (f (g y b))
    -> p (f x s) (f (g y t))
    forall s t a b r. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
    withIso AnIso s t a b
    p (((s -> a)
      -> (b -> t) -> p (f x a) (f (g y b)) -> p (f x s) (f (g y t)))
     -> p (f x a) (f (g y b)) -> p (f x s) (f (g y t)))
    -> ((s -> a)
        -> (b -> t) -> p (f x a) (f (g y b)) -> p (f x s) (f (g y t)))
    -> p (f x a) (f (g y b))
    -> p (f x s) (f (g y t))
    forall a b. (a -> b) -> a -> b
    $ \ s -> a
    sa b -> t
    bt -> (f x s -> f x a)
    -> (g y b -> g y t) -> Iso (f x s) (g y t) (f x a) (g y b)
    forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
    iso ((s -> a) -> f x s -> f x a
    forall b c a. (b -> c) -> f a b -> f a c
    forall (p :: * -> * -> *) b c a.
    Bifunctor p =>
    (b -> c) -> p a b -> p a c
    second s -> a
    sa) ((b -> t) -> g y b -> g y t
    forall b c a. (b -> c) -> g a b -> g a c
    forall (p :: * -> * -> *) b c a.
    Bifunctor p =>
    (b -> c) -> p a b -> p a c
    second b -> t
    bt)
    {-# INLINE seconding #-}

    -- | Data types that are representationally equal are isomorphic.
    --
    -- This is only available on GHC 7.8+
    --
    -- @since 4.13
    coerced :: forall s t a b. (Coercible s a, Coercible t b) => Iso s t a b
    coerced :: forall s t a b. (Coercible s a, Coercible t b) => Iso s t a b
    coerced p a (f b)
    l = (f b -> f t) -> p a (f b) -> p a (f t)
    forall b c a. (b -> c) -> p a b -> p a c
    forall (p :: * -> * -> *) b c a.
    Profunctor p =>
    (b -> c) -> p a b -> p a c
    rmap ((b -> t) -> f b -> f t
    forall a b. (a -> b) -> f a -> f b
    forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
    fmap b -> t
    forall a b. Coercible a b => a -> b
    coerce) p a (f b)
    l p a (f t) -> (s -> a) -> p s (f t)
    forall a b c (q :: * -> * -> *).
    Coercible b a =>
    p b c -> q a b -> p a c
    forall (p :: * -> * -> *) a b c (q :: * -> * -> *).
    (Profunctor p, Coercible b a) =>
    p b c -> q a b -> p a c
    .# s -> a
    forall a b. Coercible a b => a -> b
    coerce
    {-# INLINE coerced #-}