{-# OPTIONS_GHC -fno-warn-orphans #-}

module Pandora.Paradigm.Inventory.Store where

import Pandora.Core (type (:.), type (:=), type (<:=), type (~>))
import Pandora.Pattern.Semigroupoid ((.))
import Pandora.Pattern.Category (identity, ($))
import Pandora.Pattern.Functor.Covariant (Covariant ((<$>)), (<$$>))
import Pandora.Pattern.Functor.Semimonoidal (Semimonoidal (mult))
import Pandora.Pattern.Functor.Monoidal (Monoidal (unit))
import Pandora.Pattern.Functor.Invariant (Invariant ((<$<)))
import Pandora.Pattern.Functor.Extendable (Extendable ((<<=)))
import Pandora.Pattern.Functor.Comonad (Comonad)
import Pandora.Pattern.Functor.Bivariant ((<->))
import Pandora.Pattern.Functor.Divariant ((>->))
import Pandora.Pattern.Functor.Adjoint ((-|))
import Pandora.Paradigm.Primary.Algebraic.Exponential (type (<--), (%), (!.), (-.#..-))
import Pandora.Paradigm.Primary.Algebraic.Product ((:*:) ((:*:)), attached)
import Pandora.Paradigm.Primary.Algebraic (extract)
import Pandora.Pattern.Morphism.Flip (Flip (Flip))
import Pandora.Paradigm.Controlflow.Effect.Adaptable (Adaptable (adapt))
import Pandora.Paradigm.Controlflow.Effect.Interpreted (Interpreted (Primary, run, unite, (||=)), Schematic)
import Pandora.Paradigm.Controlflow.Effect.Transformer.Comonadic (Comonadic (bring), (:<) (TC))
import Pandora.Paradigm.Schemes.TUT (TUT (TUT), type (<:<.>:>))

-- | Context based computation on value
newtype Store s a = Store ((:*:) s :. (->) s := a)

-- TODO: Try to generalize (->) here
instance Covariant (->) (->) (Store s) where
	<$> :: (a -> b) -> Store s a -> Store s b
(<$>) a -> b
f = (Primary (Store s) a -> Primary (Store s) b)
-> Store s a -> Store s b
forall (m :: * -> * -> *) (t :: * -> *) (u :: * -> *) a b.
(Interpreted m t, Semigroupoid m, Interpreted m u) =>
m (Primary t a) (Primary u b) -> m (t a) (u b)
(||=) ((a -> b) -> (s :*: (s -> a)) -> s :*: (s -> b)
forall (source :: * -> * -> *) (between :: * -> * -> *)
       (target :: * -> * -> *) (t :: * -> *) (u :: * -> *) a b.
(Covariant source between u, Covariant between target t) =>
source a b -> target (t (u a)) (t (u b))
(<$$>) @(->) @(->) a -> b
f)

instance Semimonoidal (<--) (:*:) (:*:) (Store s) where
	mult :: (Store s a :*: Store s b) <-- Store s (a :*: b)
mult = (Store s (a :*: b) -> Store s a :*: Store s b)
-> (Store s a :*: Store s b) <-- Store s (a :*: b)
forall (v :: * -> * -> *) a e. v e a -> Flip v a e
Flip ((Store s (a :*: b) -> Store s a :*: Store s b)
 -> (Store s a :*: Store s b) <-- Store s (a :*: b))
-> (Store s (a :*: b) -> Store s a :*: Store s b)
-> (Store s a :*: Store s b) <-- Store s (a :*: b)
forall (m :: * -> * -> *) a b. Category m => m (m a b) (m a b)
$ \(Store (s
s :*: s -> a :*: b
f)) ->
		let (a
x :*: b
y) = s -> a :*: b
f s
s in
		(((:*:) s :. (->) s) := a) -> Store s a
forall s a. (((:*:) s :. (->) s) := a) -> Store s a
Store (s
s s -> (s -> a) -> ((:*:) s :. (->) s) := a
forall s a. s -> a -> s :*: a
:*: (a
x a -> s -> a
forall a b. a -> b -> a
!.)) Store s a -> Store s b -> Store s a :*: Store s b
forall s a. s -> a -> s :*: a
:*: (((:*:) s :. (->) s) := b) -> Store s b
forall s a. (((:*:) s :. (->) s) := a) -> Store s a
Store (s
s s -> (s -> b) -> ((:*:) s :. (->) s) := b
forall s a. s -> a -> s :*: a
:*: (b
y b -> s -> b
forall a b. a -> b -> a
!.))

instance Monoidal (<--) (->) (:*:) (:*:) (Store s) where
	unit :: Proxy (:*:) -> (Unit (:*:) -> a) <-- Store s a
unit Proxy (:*:)
_ = (Store s a -> One -> a) -> Flip (->) (One -> a) (Store s a)
forall (v :: * -> * -> *) a e. v e a -> Flip v a e
Flip ((Store s a -> One -> a) -> Flip (->) (One -> a) (Store s a))
-> (Store s a -> One -> a) -> Flip (->) (One -> a) (Store s a)
forall (m :: * -> * -> *) a b. Category m => m (m a b) (m a b)
$ \(Store (s
s :*: s -> a
f)) -> (\One
_ -> s -> a
f s
s)

-- TODO: Try to generalize (->) here
instance Extendable (->) (Store s) where
	Store s a -> b
f <<= :: (Store s a -> b) -> Store s a -> Store s b
<<= Store ((:*:) s :. (->) s) := a
x = (((:*:) s :. (->) s) := b) -> Store s b
forall s a. (((:*:) s :. (->) s) := a) -> Store s a
Store ((((:*:) s :. (->) s) := b) -> Store s b)
-> (((:*:) s :. (->) s) := b) -> Store s b
forall (m :: * -> * -> *) a b. Category m => m (m a b) (m a b)
$ (Store s a -> b)
-> (s :*: (s -> Store s a)) -> ((:*:) s :. (->) s) := b
forall (source :: * -> * -> *) (between :: * -> * -> *)
       (target :: * -> * -> *) (t :: * -> *) (u :: * -> *) a b.
(Covariant source between u, Covariant between target t) =>
source a b -> target (t (u a)) (t (u b))
(<$$>) @(->) @(->) Store s a -> b
f ((((:*:) s :. (->) s) := a) -> Store s a
forall s a. (((:*:) s :. (->) s) := a) -> Store s a
Store ((((:*:) s :. (->) s) := a) -> Store s a)
-> ((s -> a) -> s -> ((:*:) s :. (->) s) := a)
-> (s -> a)
-> s
-> Store s a
forall (target :: * -> * -> *) (v :: * -> * -> *) a c d b.
(Covariant (->) target (v a), Semigroupoid v) =>
v c d -> target (v a (v b c)) (v a (v b d))
-.#..- (forall a. Category (->) => a -> a
forall (m :: * -> * -> *) a. Category m => m a a
identity @(->) ((((:*:) s :. (->) s) := a) -> ((:*:) s :. (->) s) := a)
-> (s -> a) -> s -> ((:*:) s :. (->) s) := a
forall (source :: * -> * -> *) (target :: * -> * -> *)
       (t :: * -> *) (u :: * -> *) a b.
Adjoint source target t u =>
source (t a) b -> target a (u b)
-|) ((s -> a) -> s -> Store s a)
-> (((:*:) s :. (->) s) := a) -> s :*: (s -> Store s a)
forall (source :: * -> * -> *) (target :: * -> * -> *)
       (t :: * -> *) a b.
Covariant source target t =>
source a b -> target (t a) (t b)
<$> ((:*:) s :. (->) s) := a
x)

instance Comonad (->) (Store s) where

instance Invariant (Flip Store r) where
	a -> b
f <$< :: (a -> b) -> (b -> a) -> Flip Store r a -> Flip Store r b
<$< b -> a
g = \(Flip Store a r
x) -> Store b r -> Flip Store r b
forall (v :: * -> * -> *) a e. v e a -> Flip v a e
Flip (Store b r -> Flip Store r b) -> Store b r -> Flip Store r b
forall (m :: * -> * -> *) a b. Category m => m (m a b) (m a b)
$ (a -> b)
-> ((a -> r) -> b -> r) -> (a :*: (a -> r)) -> b :*: (b -> r)
forall (left :: * -> * -> *) (right :: * -> * -> *)
       (target :: * -> * -> *) (v :: * -> * -> *) a b c d.
Bivariant left right target v =>
left a b -> right c d -> target (v a c) (v b d)
(<->) @_ @(->) a -> b
f (b -> a
g (b -> a) -> (r -> r) -> (a -> r) -> b -> r
forall (left :: * -> * -> *) (right :: * -> * -> *)
       (target :: * -> * -> *) (v :: * -> * -> *) a b c d.
Divariant left right target v =>
left a b -> right c d -> target (v b c) (v a d)
>-> forall a. Category (->) => a -> a
forall (m :: * -> * -> *) a. Category m => m a a
identity @(->)) (Primary (Store a) r -> Primary (Store b) r)
-> Store a r -> Store b r
forall (m :: * -> * -> *) (t :: * -> *) (u :: * -> *) a b.
(Interpreted m t, Semigroupoid m, Interpreted m u) =>
m (Primary t a) (Primary u b) -> m (t a) (u b)
||= Store a r
x

instance Interpreted (->) (Store s) where
	type Primary (Store s) a = (:*:) s :. (->) s := a
	run :: Store s a -> Primary (Store s) a
run ~(Store ((:*:) s :. (->) s) := a
x) = Primary (Store s) a
((:*:) s :. (->) s) := a
x
	unite :: Primary (Store s) a -> Store s a
unite = Primary (Store s) a -> Store s a
forall s a. (((:*:) s :. (->) s) := a) -> Store s a
Store

type instance Schematic Comonad (Store s) = (:*:) s <:<.>:> (->) s

instance Comonadic (Store s) where
	bring :: (Store s :< u) ~> Store s
bring (TC (TUT (s :*: f))) = (((:*:) s :. (->) s) := a) -> Store s a
forall s a. (((:*:) s :. (->) s) := a) -> Store s a
Store ((((:*:) s :. (->) s) := a) -> Store s a)
-> (((:*:) s :. (->) s) := a) -> Store s a
forall (m :: * -> * -> *) a b. Category m => m (m a b) (m a b)
$ s
s s -> (s -> a) -> ((:*:) s :. (->) s) := a
forall s a. s -> a -> s :*: a
:*: u (s -> a) -> s -> a
forall (t :: * -> *) a. Extractable t => t a -> a
extract u (s -> a)
f

type Storable s x = Adaptable x (Store s)

-- | Get current index
position :: Storable s t => t a -> s
position :: t a -> s
position = (s :*: (s -> a)) -> s
forall a b. (a :*: b) -> a
attached ((s :*: (s -> a)) -> s) -> (t a -> s :*: (s -> a)) -> t a -> s
forall (m :: * -> * -> *) b c a.
Semigroupoid m =>
m b c -> m a b -> m a c
. forall a.
Interpreted (->) (Store s) =>
Store s a -> Primary (Store s) a
forall (m :: * -> * -> *) (t :: * -> *) a.
Interpreted m t =>
m (t a) (Primary t a)
run @(->) @(Store _) (Store s a -> s :*: (s -> a))
-> (t a -> Store s a) -> t a -> s :*: (s -> a)
forall (m :: * -> * -> *) b c a.
Semigroupoid m =>
m b c -> m a b -> m a c
. t a -> Store s a
forall k (t :: k -> *) (u :: k -> *). Adaptable t u => t ~> u
adapt

-- | Given an index return value
look :: Storable s t => s -> a <:= t
look :: s -> a <:= t
look s
s = ((s :*: (s -> a)) -> s -> a
forall (t :: * -> *) a. Extractable t => t a -> a
extract ((s :*: (s -> a)) -> s -> a) -> s -> (s :*: (s -> a)) -> a
forall a b c. (a -> b -> c) -> b -> a -> c
% s
s) ((s :*: (s -> a)) -> a) -> (t a -> s :*: (s -> a)) -> a <:= t
forall (m :: * -> * -> *) b c a.
Semigroupoid m =>
m b c -> m a b -> m a c
. forall a.
Interpreted (->) (Store s) =>
Store s a -> Primary (Store s) a
forall (m :: * -> * -> *) (t :: * -> *) a.
Interpreted m t =>
m (t a) (Primary t a)
run @(->) @(Store _) (Store s a -> s :*: (s -> a))
-> (t a -> Store s a) -> t a -> s :*: (s -> a)
forall (m :: * -> * -> *) b c a.
Semigroupoid m =>
m b c -> m a b -> m a c
. t a -> Store s a
forall k (t :: k -> *) (u :: k -> *). Adaptable t u => t ~> u
adapt

-- | Change index with function
retrofit :: (s -> s) -> Store s ~> Store s
retrofit :: (s -> s) -> Store s ~> Store s
retrofit s -> s
g (Store (s
s :*: s -> a
f)) = (s :*: (s -> a)) -> Store s a
forall s a. (((:*:) s :. (->) s) := a) -> Store s a
Store ((s :*: (s -> a)) -> Store s a) -> (s :*: (s -> a)) -> Store s a
forall (m :: * -> * -> *) a b. Category m => m (m a b) (m a b)
$ s -> s
g s
s s -> (s -> a) -> s :*: (s -> a)
forall s a. s -> a -> s :*: a
:*: s -> a
f