{-# LANGUAGE OverloadedLists #-}
{-# OPTIONS_GHC -Wno-orphans #-}

module Props.FinRel where

import Data.Type.Nat (Nat (..), Nat0, Nat1, Nat2, Nat3, SNatI, snat, snatToNat)
import Test.Falsify.Generator (Function (..), elem)
import Test.Tasty (TestTree, testGroup)
import Prelude hiding (elem, repeat)

import Proarrow.Category.Instance.FinRel (Bitstring, FINREL (..), FinRel (..))
import Proarrow.Category.Instance.Opposite (OPPOSITE (OP))
import Proarrow.Core (CAT, (\\), type (+->), type (~>))
import Proarrow.Profunctor.Corepresentable (coindex, cotabulate, withObCorep, type (%%))
import Proarrow.Profunctor.Instance.Identity (Id (..))
import Proarrow.Profunctor.Representable (index, tabulate, withObRep, type (%))
import Proarrow.Promonad.Reader (Reader)
import Proarrow.Promonad.Writer (Writer)

import Proarrow.Testing
  ( Some (..)
  , SomeProfunctorElt (..)
  , Testable (..)
  , TestableProfunctor (..)
  , TestableType (..)
  , TestingEqShow (..)
  , genNamed
  , genOb
  , genSomeDef
  , invmap
  , pattern GenNonEmpty
  )
import Proarrow.Testing.Laws
import Props.Hask ()
import Props.Mat ()

test :: TestTree
test =
  testGroup
    "FinRel"
    [ testCategory @FINREL
    , testDagger @FINREL
    , testTerminalObject @FINREL
    , testInitialObject @FINREL
    , testBinaryProducts_ @FINREL
    , testBinaryCoproducts_ @FINREL
    , testMonoidal_ @FINREL
    , testSymMonoidal_ @FINREL
    , testDistributive_ @FINREL
    , testClosed_ @FINREL
    , testStarAutonomous_ @FINREL
    , testCompactClosed_ @FINREL
    , testTraced_ @FINREL
    , -- the tensor-hom (currying) adjunction @(FR Nat2 '**' -) ⊣ (FR Nat2 '~~>' -)@
      testAdjunction_ @(Reader (OP (FR Nat2)) :: FINREL +-> FINREL)
    , testMonStrong_ @(Reader (OP (FR Nat2)) :: FINREL +-> FINREL)
    , testMonCostrong_ @FinRel
    , testGroup "Id -| Id" [testProadjunction @(Id :: CAT FINREL) @Id]
    , testGroup "Writer -| Reader" [testProadjunction @(Writer (FR Nat2) :: FINREL +-> FINREL) @(Reader (OP (FR Nat2)))]
    , testGroup "Id procomonad" [testProcomonad @(Id :: CAT FINREL)]
    , testGroup "Writer procomonad" [testProcomonad @(Writer (FR Nat2) :: FINREL +-> FINREL)]
    , testGroup "Reader procomonad" [testProcomonad @(Reader (OP (FR Nat2)) :: FINREL +-> FINREL)]
    , testHypergraph_ @FINREL
    , testCopyDiscard_ @FINREL
    , testCommutativeMonoid_ @(FR Nat0)
    , testCommutativeMonoid_ @(FR Nat1)
    , testCommutativeMonoid_ @(FR Nat2)
    , testCommutativeMonoid_ @(FR Nat3)
    , -- morphism addition on a homset: a commutative monoid that is not Frobenius
      testCommutativeMonoid @(Id (FR Nat2) (FR Nat2)) (\r -> r)
    , testComonoid_ @(FR Nat0)
    , testComonoid_ @(FR Nat1)
    , testComonoid_ @(FR Nat2)
    , testComonoid_ @(FR Nat3)
    ]

instance Testable FINREL where
  showOb @(FR a) = show $ snatToNat $ snat @a
  genSome = genSomeDef @'[FR Z, FR (S Z), FR (S (S Z)), FR (S (S (S Z)))]
  genSomeSmall = genSomeDef @'[FR Z, FR (S Z), FR (S (S Z))]

instance (TestOb a, TestOb b) => TestableType (FinRel a b) where
  gen = invmap FinRel unFinRel gen
instance (TestOb a, TestOb b) => TestingEqShow (FinRel a b) where
  eqP (FinRel l) (FinRel r) = pure $ l == r
  showP (FinRel m) = show m
instance TestableProfunctor FinRel

instance (SNatI r, TestOb a, TestOb b) => TestingEqShow (Reader (OP (FR r)) a b) where
  eqP l r = eqP (coindex l) (coindex r) \\ coindex l
  showP m = showP (coindex m) \\ coindex m

instance (SNatI r) => TestableProfunctor (Reader (OP (FR r)) :: FINREL +-> FINREL) where
  genProfunctorElt nm = do
    Some @a <- genOb
    Some @b <- genOb
    withObCorep @(Reader (OP (FR r))) @a do
      m <- genNamed @(Reader (OP (FR r)) %% a ~> b) nm
      pure (SomeP (cotabulate @(Reader (OP (FR r))) @a @b m))

instance (SNatI r, TestOb a, TestOb b) => TestingEqShow (Writer (FR r) a b) where
  eqP l r = eqP (index l) (index r) \\ index l
  showP m = showP (index m) \\ index m

instance (SNatI r) => TestableProfunctor (Writer (FR r) :: FINREL +-> FINREL) where
  genProfunctorElt nm = do
    Some @a <- genOb
    Some @b <- genOb
    withObRep @(Writer (FR r)) @b do
      m <- genNamed @(a ~> Writer (FR r) % b) nm
      pure (SomeP (tabulate @(Writer (FR r)) @b @a m))

instance TestableProfunctor (Id :: CAT FINREL)

-- | A hom @a '~>' b@ wrapped as the identity profunctor 'Id' is a value of kind 'Type'; in a
-- biproduct category it is a commutative monoid under morphism addition. It is testable whenever
-- the underlying hom is.
instance (TestableType (a ~> b)) => TestableType (Id a b) where
  gen = invmap Id unId gen

instance (TestingEqShow (a ~> b)) => TestingEqShow (Id a b) where
  eqP (Id l) (Id r) = eqP l r
  showP (Id f) = showP f
instance Function (Id a b) where
  function = error "Function (Id a b): unused"

instance (SNatI n) => TestingEqShow (Bitstring n)
instance (SNatI n) => TestableType (Bitstring n) where
  gen = GenNonEmpty $ elem [minBound .. maxBound]