{-# LANGUAGE DeriveFoldable #-}
{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE DeriveTraversable #-}
{-# LANGUAGE DerivingStrategies #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE StandaloneDeriving #-}
{-# LANGUAGE StrictData #-}

module Data.Tuple.Strict.T11
  ( T11 (..),
  )
where

import Control.DeepSeq (NFData, rnf)
import Data.Bifoldable
import Data.Bifunctor
import Data.Bitraversable
import Data.Functor.Classes (Eq1 (liftEq), Eq2 (liftEq2))
import Data.Hashable (Hashable, hash, hashWithSalt)
import Data.Hashable.Lifted
  ( Hashable1,
    Hashable2,
    defaultLiftHashWithSalt,
    hashWithSalt1,
    liftHashWithSalt,
    liftHashWithSalt2,
  )
import Data.Semigroup
import GHC.Generics (Generic)

data T11 a b c d e f g h i j k
  = T11 a b c d e f g h i j k
  deriving stock (T11 a b c d e f g h i j k
forall a. a -> a -> Bounded a
forall a b c d e f g h i j k.
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f,
 Bounded g, Bounded h, Bounded i, Bounded j, Bounded k) =>
T11 a b c d e f g h i j k
maxBound :: T11 a b c d e f g h i j k
$cmaxBound :: forall a b c d e f g h i j k.
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f,
 Bounded g, Bounded h, Bounded i, Bounded j, Bounded k) =>
T11 a b c d e f g h i j k
minBound :: T11 a b c d e f g h i j k
$cminBound :: forall a b c d e f g h i j k.
(Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f,
 Bounded g, Bounded h, Bounded i, Bounded j, Bounded k) =>
T11 a b c d e f g h i j k
Bounded, T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
forall a b c d e f g h i j k.
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j,
 Eq k) =>
T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
/= :: T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
$c/= :: forall a b c d e f g h i j k.
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j,
 Eq k) =>
T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
== :: T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
$c== :: forall a b c d e f g h i j k.
(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j,
 Eq k) =>
T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
Eq, T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Ordering
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
forall {a} {b} {c} {d} {e} {f} {g} {h} {i} {j} {k}.
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i,
 Ord j, Ord k) =>
Eq (T11 a b c d e f g h i j k)
forall a b c d e f g h i j k.
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i,
 Ord j, Ord k) =>
T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
forall a b c d e f g h i j k.
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i,
 Ord j, Ord k) =>
T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Ordering
forall a b c d e f g h i j k.
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i,
 Ord j, Ord k) =>
T11 a b c d e f g h i j k
-> T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k
min :: T11 a b c d e f g h i j k
-> T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k
$cmin :: forall a b c d e f g h i j k.
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i,
 Ord j, Ord k) =>
T11 a b c d e f g h i j k
-> T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k
max :: T11 a b c d e f g h i j k
-> T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k
$cmax :: forall a b c d e f g h i j k.
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i,
 Ord j, Ord k) =>
T11 a b c d e f g h i j k
-> T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k
>= :: T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
$c>= :: forall a b c d e f g h i j k.
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i,
 Ord j, Ord k) =>
T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
> :: T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
$c> :: forall a b c d e f g h i j k.
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i,
 Ord j, Ord k) =>
T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
<= :: T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
$c<= :: forall a b c d e f g h i j k.
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i,
 Ord j, Ord k) =>
T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
< :: T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
$c< :: forall a b c d e f g h i j k.
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i,
 Ord j, Ord k) =>
T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Bool
compare :: T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Ordering
$ccompare :: forall a b c d e f g h i j k.
(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i,
 Ord j, Ord k) =>
T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k -> Ordering
Ord, ReadPrec [T11 a b c d e f g h i j k]
ReadPrec (T11 a b c d e f g h i j k)
ReadS [T11 a b c d e f g h i j k]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
forall a b c d e f g h i j k.
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h,
 Read i, Read j, Read k) =>
ReadPrec [T11 a b c d e f g h i j k]
forall a b c d e f g h i j k.
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h,
 Read i, Read j, Read k) =>
ReadPrec (T11 a b c d e f g h i j k)
forall a b c d e f g h i j k.
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h,
 Read i, Read j, Read k) =>
Int -> ReadS (T11 a b c d e f g h i j k)
forall a b c d e f g h i j k.
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h,
 Read i, Read j, Read k) =>
ReadS [T11 a b c d e f g h i j k]
readListPrec :: ReadPrec [T11 a b c d e f g h i j k]
$creadListPrec :: forall a b c d e f g h i j k.
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h,
 Read i, Read j, Read k) =>
ReadPrec [T11 a b c d e f g h i j k]
readPrec :: ReadPrec (T11 a b c d e f g h i j k)
$creadPrec :: forall a b c d e f g h i j k.
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h,
 Read i, Read j, Read k) =>
ReadPrec (T11 a b c d e f g h i j k)
readList :: ReadS [T11 a b c d e f g h i j k]
$creadList :: forall a b c d e f g h i j k.
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h,
 Read i, Read j, Read k) =>
ReadS [T11 a b c d e f g h i j k]
readsPrec :: Int -> ReadS (T11 a b c d e f g h i j k)
$creadsPrec :: forall a b c d e f g h i j k.
(Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h,
 Read i, Read j, Read k) =>
Int -> ReadS (T11 a b c d e f g h i j k)
Read, Int -> T11 a b c d e f g h i j k -> ShowS
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall a b c d e f g h i j k.
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h,
 Show i, Show j, Show k) =>
Int -> T11 a b c d e f g h i j k -> ShowS
forall a b c d e f g h i j k.
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h,
 Show i, Show j, Show k) =>
[T11 a b c d e f g h i j k] -> ShowS
forall a b c d e f g h i j k.
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h,
 Show i, Show j, Show k) =>
T11 a b c d e f g h i j k -> String
showList :: [T11 a b c d e f g h i j k] -> ShowS
$cshowList :: forall a b c d e f g h i j k.
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h,
 Show i, Show j, Show k) =>
[T11 a b c d e f g h i j k] -> ShowS
show :: T11 a b c d e f g h i j k -> String
$cshow :: forall a b c d e f g h i j k.
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h,
 Show i, Show j, Show k) =>
T11 a b c d e f g h i j k -> String
showsPrec :: Int -> T11 a b c d e f g h i j k -> ShowS
$cshowsPrec :: forall a b c d e f g h i j k.
(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h,
 Show i, Show j, Show k) =>
Int -> T11 a b c d e f g h i j k -> ShowS
Show, forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall a b c d e f g h i j k x.
Rep (T11 a b c d e f g h i j k) x -> T11 a b c d e f g h i j k
forall a b c d e f g h i j k x.
T11 a b c d e f g h i j k -> Rep (T11 a b c d e f g h i j k) x
$cto :: forall a b c d e f g h i j k x.
Rep (T11 a b c d e f g h i j k) x -> T11 a b c d e f g h i j k
$cfrom :: forall a b c d e f g h i j k x.
T11 a b c d e f g h i j k -> Rep (T11 a b c d e f g h i j k) x
Generic)

-- | @since 0.1.3
deriving stock instance Foldable (T11 a b c d e f g h i j)

-- | @since 0.1.3
deriving stock instance Functor (T11 a b c d e f g h i j)

-- | @since 0.1.3
deriving stock instance Traversable (T11 a b c d e f g h i j)

-- | @since 0.1.5
instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j) => Eq1 (T11 a b c d e f g h i j) where
  liftEq :: forall a b.
(a -> b -> Bool)
-> T11 a b c d e f g h i j a -> T11 a b c d e f g h i j b -> Bool
liftEq = forall (f :: * -> * -> *) a b c d.
Eq2 f =>
(a -> b -> Bool) -> (c -> d -> Bool) -> f a c -> f b d -> Bool
liftEq2 forall a. Eq a => a -> a -> Bool
(==)

-- | @since 0.1.5
instance (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i) => Eq2 (T11 a b c d e f g h i) where
  liftEq2 :: forall a b c d.
(a -> b -> Bool)
-> (c -> d -> Bool)
-> T11 a b c d e f g h i a c
-> T11 a b c d e f g h i b d
-> Bool
liftEq2 a -> b -> Bool
e1 c -> d -> Bool
e2 (T11 a
a b
b c
c d
d e
e f
f g
g h
h i
i a
j c
k) (T11 a
a' b
b' c
c' d
d' e
e' f
f' g
g' h
h' i
i' b
j' d
k') =
    a
a forall a. Eq a => a -> a -> Bool
== a
a' Bool -> Bool -> Bool
&& b
b forall a. Eq a => a -> a -> Bool
== b
b' Bool -> Bool -> Bool
&& c
c forall a. Eq a => a -> a -> Bool
== c
c' Bool -> Bool -> Bool
&& d
d forall a. Eq a => a -> a -> Bool
== d
d' Bool -> Bool -> Bool
&& e
e forall a. Eq a => a -> a -> Bool
== e
e' Bool -> Bool -> Bool
&& f
f forall a. Eq a => a -> a -> Bool
== f
f' Bool -> Bool -> Bool
&& g
g forall a. Eq a => a -> a -> Bool
== g
g' Bool -> Bool -> Bool
&& h
h forall a. Eq a => a -> a -> Bool
== h
h' Bool -> Bool -> Bool
&& i
i forall a. Eq a => a -> a -> Bool
== i
i' Bool -> Bool -> Bool
&& a -> b -> Bool
e1 a
j b
j' Bool -> Bool -> Bool
&& c -> d -> Bool
e2 c
k d
k'

-- | @since 0.1.3
instance (Monoid a, Monoid b, Monoid c, Monoid d, Monoid e, Monoid f, Monoid g, Monoid h, Monoid i, Monoid j) => Applicative (T11 a b c d e f g h i j) where
  pure :: forall a. a -> T11 a b c d e f g h i j a
pure a
k = forall a b c d e f g h i j k.
a
-> b
-> c
-> d
-> e
-> f
-> g
-> h
-> i
-> j
-> k
-> T11 a b c d e f g h i j k
T11 forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty a
k
  T11 a
a b
b c
c d
d e
e f
f g
g h
h i
i j
j a -> b
k <*> :: forall a b.
T11 a b c d e f g h i j (a -> b)
-> T11 a b c d e f g h i j a -> T11 a b c d e f g h i j b
<*> T11 a
a' b
b' c
c' d
d' e
e' f
f' g
g' h
h' i
i' j
j' a
k' =
    forall a b c d e f g h i j k.
a
-> b
-> c
-> d
-> e
-> f
-> g
-> h
-> i
-> j
-> k
-> T11 a b c d e f g h i j k
T11 (a
a forall a. Semigroup a => a -> a -> a
<> a
a') (b
b forall a. Semigroup a => a -> a -> a
<> b
b') (c
c forall a. Semigroup a => a -> a -> a
<> c
c') (d
d forall a. Semigroup a => a -> a -> a
<> d
d') (e
e forall a. Semigroup a => a -> a -> a
<> e
e') (f
f forall a. Semigroup a => a -> a -> a
<> f
f') (g
g forall a. Semigroup a => a -> a -> a
<> g
g') (h
h forall a. Semigroup a => a -> a -> a
<> h
h') (i
i forall a. Semigroup a => a -> a -> a
<> i
i') (j
j forall a. Semigroup a => a -> a -> a
<> j
j') (a -> b
k a
k')

-- | @since 0.1.3
instance (Monoid a, Monoid b, Monoid c, Monoid d, Monoid e, Monoid f, Monoid g, Monoid h, Monoid i, Monoid j) => Monad (T11 a b c d e f g h i j) where
  return :: forall a. a -> T11 a b c d e f g h i j a
return = forall (f :: * -> *) a. Applicative f => a -> f a
pure
  T11 a
a b
b c
c d
d e
e f
f g
g h
h i
i j
j a
k >>= :: forall a b.
T11 a b c d e f g h i j a
-> (a -> T11 a b c d e f g h i j b) -> T11 a b c d e f g h i j b
>>= a -> T11 a b c d e f g h i j b
l = case a -> T11 a b c d e f g h i j b
l a
k of
    T11 a
a' b
b' c
c' d
d' e
e' f
f' g
g' h
h' i
i' j
j' b
k' ->
      forall a b c d e f g h i j k.
a
-> b
-> c
-> d
-> e
-> f
-> g
-> h
-> i
-> j
-> k
-> T11 a b c d e f g h i j k
T11 (a
a forall a. Semigroup a => a -> a -> a
<> a
a') (b
b forall a. Semigroup a => a -> a -> a
<> b
b') (c
c forall a. Semigroup a => a -> a -> a
<> c
c') (d
d forall a. Semigroup a => a -> a -> a
<> d
d') (e
e forall a. Semigroup a => a -> a -> a
<> e
e') (f
f forall a. Semigroup a => a -> a -> a
<> f
f') (g
g forall a. Semigroup a => a -> a -> a
<> g
g') (h
h forall a. Semigroup a => a -> a -> a
<> h
h') (i
i forall a. Semigroup a => a -> a -> a
<> i
i') (j
j forall a. Semigroup a => a -> a -> a
<> j
j') b
k'

instance (Hashable a, Hashable b, Hashable c, Hashable d, Hashable e, Hashable f, Hashable g, Hashable h, Hashable i, Hashable j, Hashable k) => Hashable (T11 a b c d e f g h i j k) where
  hash :: T11 a b c d e f g h i j k -> Int
hash (T11 a
a b
b c
c d
d e
e f
f g
g h
h i
i j
j k
k) = forall a. Hashable a => a -> Int
hash a
a forall a. Hashable a => Int -> a -> Int
`hashWithSalt` b
b forall a. Hashable a => Int -> a -> Int
`hashWithSalt` c
c forall a. Hashable a => Int -> a -> Int
`hashWithSalt` d
d forall a. Hashable a => Int -> a -> Int
`hashWithSalt` e
e forall a. Hashable a => Int -> a -> Int
`hashWithSalt` f
f forall a. Hashable a => Int -> a -> Int
`hashWithSalt` g
g forall a. Hashable a => Int -> a -> Int
`hashWithSalt` h
h forall a. Hashable a => Int -> a -> Int
`hashWithSalt` i
i forall a. Hashable a => Int -> a -> Int
`hashWithSalt` j
j forall a. Hashable a => Int -> a -> Int
`hashWithSalt` k
k
  hashWithSalt :: Int -> T11 a b c d e f g h i j k -> Int
hashWithSalt = forall (f :: * -> *) a.
(Hashable1 f, Hashable a) =>
Int -> f a -> Int
hashWithSalt1

instance (Hashable a, Hashable b, Hashable c, Hashable d, Hashable e, Hashable f, Hashable g, Hashable h, Hashable i, Hashable j) => Hashable1 (T11 a b c d e f g h i j) where
  liftHashWithSalt :: forall a.
(Int -> a -> Int) -> Int -> T11 a b c d e f g h i j a -> Int
liftHashWithSalt = forall (f :: * -> * -> *) a b.
(Hashable2 f, Hashable a) =>
(Int -> b -> Int) -> Int -> f a b -> Int
defaultLiftHashWithSalt

instance (Hashable a, Hashable b, Hashable c, Hashable d, Hashable e, Hashable f, Hashable g, Hashable h, Hashable i) => Hashable2 (T11 a b c d e f g h i) where
  liftHashWithSalt2 :: forall a b.
(Int -> a -> Int)
-> (Int -> b -> Int) -> Int -> T11 a b c d e f g h i a b -> Int
liftHashWithSalt2 Int -> a -> Int
h1 Int -> b -> Int
h2 Int
slt (T11 a
a b
b c
c d
d e
e f
f g
g h
h i
i a
j b
k) =
    (Int
slt forall a. Hashable a => Int -> a -> Int
`hashWithSalt` a
a forall a. Hashable a => Int -> a -> Int
`hashWithSalt` b
b forall a. Hashable a => Int -> a -> Int
`hashWithSalt` c
c forall a. Hashable a => Int -> a -> Int
`hashWithSalt` d
d forall a. Hashable a => Int -> a -> Int
`hashWithSalt` e
e forall a. Hashable a => Int -> a -> Int
`hashWithSalt` f
f forall a. Hashable a => Int -> a -> Int
`hashWithSalt` g
g forall a. Hashable a => Int -> a -> Int
`hashWithSalt` h
h forall a. Hashable a => Int -> a -> Int
`hashWithSalt` i
i) Int -> a -> Int
`h1` a
j Int -> b -> Int
`h2` b
k

instance (Monoid a, Monoid b, Monoid c, Monoid d, Monoid e, Monoid f, Monoid g, Monoid h, Monoid i, Monoid j, Monoid k) => Monoid (T11 a b c d e f g h i j k) where
  mempty :: T11 a b c d e f g h i j k
mempty = forall a b c d e f g h i j k.
a
-> b
-> c
-> d
-> e
-> f
-> g
-> h
-> i
-> j
-> k
-> T11 a b c d e f g h i j k
T11 forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty forall a. Monoid a => a
mempty

-- | @since 0.1.4
instance (NFData a, NFData b, NFData c, NFData d, NFData e, NFData f, NFData g, NFData h, NFData i, NFData j, NFData k) => NFData (T11 a b c d e f g h i j k) where
  rnf :: T11 a b c d e f g h i j k -> ()
rnf (T11 a
a b
b c
c d
d e
e f
f g
g h
h i
i j
j k
k) = forall a. NFData a => a -> ()
rnf a
a seq :: forall a b. a -> b -> b
`seq` forall a. NFData a => a -> ()
rnf b
b seq :: forall a b. a -> b -> b
`seq` forall a. NFData a => a -> ()
rnf c
c seq :: forall a b. a -> b -> b
`seq` forall a. NFData a => a -> ()
rnf d
d seq :: forall a b. a -> b -> b
`seq` forall a. NFData a => a -> ()
rnf e
e seq :: forall a b. a -> b -> b
`seq` forall a. NFData a => a -> ()
rnf f
f seq :: forall a b. a -> b -> b
`seq` forall a. NFData a => a -> ()
rnf g
g seq :: forall a b. a -> b -> b
`seq` forall a. NFData a => a -> ()
rnf h
h seq :: forall a b. a -> b -> b
`seq` forall a. NFData a => a -> ()
rnf i
i seq :: forall a b. a -> b -> b
`seq` forall a. NFData a => a -> ()
rnf j
j seq :: forall a b. a -> b -> b
`seq` forall a. NFData a => a -> ()
rnf k
k

instance (Semigroup a, Semigroup b, Semigroup c, Semigroup d, Semigroup e, Semigroup f, Semigroup g, Semigroup h, Semigroup i, Semigroup j, Semigroup k) => Semigroup (T11 a b c d e f g h i j k) where
  T11 a
a1 b
b1 c
c1 d
d1 e
e1 f
f1 g
g1 h
h1 i
i1 j
j1 k
k1 <> :: T11 a b c d e f g h i j k
-> T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k
<> T11 a
a2 b
b2 c
c2 d
d2 e
e2 f
f2 g
g2 h
h2 i
i2 j
j2 k
k2 = forall a b c d e f g h i j k.
a
-> b
-> c
-> d
-> e
-> f
-> g
-> h
-> i
-> j
-> k
-> T11 a b c d e f g h i j k
T11 (a
a1 forall a. Semigroup a => a -> a -> a
<> a
a2) (b
b1 forall a. Semigroup a => a -> a -> a
<> b
b2) (c
c1 forall a. Semigroup a => a -> a -> a
<> c
c2) (d
d1 forall a. Semigroup a => a -> a -> a
<> d
d2) (e
e1 forall a. Semigroup a => a -> a -> a
<> e
e2) (f
f1 forall a. Semigroup a => a -> a -> a
<> f
f2) (g
g1 forall a. Semigroup a => a -> a -> a
<> g
g2) (h
h1 forall a. Semigroup a => a -> a -> a
<> h
h2) (i
i1 forall a. Semigroup a => a -> a -> a
<> i
i2) (j
j1 forall a. Semigroup a => a -> a -> a
<> j
j2) (k
k1 forall a. Semigroup a => a -> a -> a
<> k
k2)
  stimes :: forall b.
Integral b =>
b -> T11 a b c d e f g h i j k -> T11 a b c d e f g h i j k
stimes b
ii (T11 a
a b
b c
c d
d e
e f
f g
g h
h i
i j
j k
k) = forall a b c d e f g h i j k.
a
-> b
-> c
-> d
-> e
-> f
-> g
-> h
-> i
-> j
-> k
-> T11 a b c d e f g h i j k
T11 (forall a b. (Semigroup a, Integral b) => b -> a -> a
stimes b
ii a
a) (forall a b. (Semigroup a, Integral b) => b -> a -> a
stimes b
ii b
b) (forall a b. (Semigroup a, Integral b) => b -> a -> a
stimes b
ii c
c) (forall a b. (Semigroup a, Integral b) => b -> a -> a
stimes b
ii d
d) (forall a b. (Semigroup a, Integral b) => b -> a -> a
stimes b
ii e
e) (forall a b. (Semigroup a, Integral b) => b -> a -> a
stimes b
ii f
f) (forall a b. (Semigroup a, Integral b) => b -> a -> a
stimes b
ii g
g) (forall a b. (Semigroup a, Integral b) => b -> a -> a
stimes b
ii h
h) (forall a b. (Semigroup a, Integral b) => b -> a -> a
stimes b
ii i
i) (forall a b. (Semigroup a, Integral b) => b -> a -> a
stimes b
ii j
j) (forall a b. (Semigroup a, Integral b) => b -> a -> a
stimes b
ii k
k)

-- | @since 0.1.3
instance Bifunctor (T11 x y z w t u v p q) where
  bimap :: forall a b c d.
(a -> b)
-> (c -> d)
-> T11 x y z w t u v p q a c
-> T11 x y z w t u v p q b d
bimap a -> b
f c -> d
g (T11 x
x y
y z
z w
w t
t u
u v
v p
p q
q a
a c
b) = forall a b c d e f g h i j k.
a
-> b
-> c
-> d
-> e
-> f
-> g
-> h
-> i
-> j
-> k
-> T11 a b c d e f g h i j k
T11 x
x y
y z
z w
w t
t u
u v
v p
p q
q (a -> b
f a
a) (c -> d
g c
b)

-- | @since 0.1.3
instance Bifoldable (T11 x y z w t u v p q) where
  bifoldMap :: forall m a b.
Monoid m =>
(a -> m) -> (b -> m) -> T11 x y z w t u v p q a b -> m
bifoldMap a -> m
f b -> m
g (T11 x
_ y
_ z
_ w
_ t
_ u
_ v
_ p
_ q
_ a
a b
b) = a -> m
f a
a forall a. Semigroup a => a -> a -> a
<> b -> m
g b
b

-- | @since 0.1.3
instance Bitraversable (T11 x y z w t u v p q) where
  bitraverse :: forall (f :: * -> *) a c b d.
Applicative f =>
(a -> f c)
-> (b -> f d)
-> T11 x y z w t u v p q a b
-> f (T11 x y z w t u v p q c d)
bitraverse a -> f c
f b -> f d
g (T11 x
x y
y z
z w
w t
t u
u v
v p
p q
q a
a b
b) = forall a b c d e f g h i j k.
a
-> b
-> c
-> d
-> e
-> f
-> g
-> h
-> i
-> j
-> k
-> T11 a b c d e f g h i j k
T11 x
x y
y z
z w
w t
t u
u v
v p
p q
q forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> a -> f c
f a
a forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> b -> f d
g b
b