{-# LANGUAGE CPP #-}
{-# LANGUAGE DerivingVia #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE StandaloneDeriving #-}
{-# LANGUAGE Trustworthy #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE UndecidableInstances #-}
module Grisette.Core.Data.Class.Evaluate
(
EvaluateSym (..),
evaluateSymToCon,
)
where
import Control.Monad.Except
import Control.Monad.Identity
import Control.Monad.Trans.Maybe
import qualified Control.Monad.Writer.Lazy as WriterLazy
import qualified Control.Monad.Writer.Strict as WriterStrict
import qualified Data.ByteString as B
import Data.Functor.Sum
import Data.Int
import Data.Maybe
import Data.Word
import Generics.Deriving
import Generics.Deriving.Instances ()
import Grisette.Core.Data.Class.ModelOps
import Grisette.Core.Data.Class.ToCon
import Grisette.IR.SymPrim.Data.Prim.Model
class EvaluateSym a where
evaluateSym :: Bool -> Model -> a -> a
instance (Generic a, EvaluateSym' (Rep a)) => EvaluateSym (Default a) where
evaluateSym :: Bool -> Model -> Default a -> Default a
evaluateSym Bool
fillDefault Model
model = a -> Default a
forall a. a -> Default a
Default (a -> Default a) -> (Default a -> a) -> Default a -> Default a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Rep a Any -> a
forall a x. Generic a => Rep a x -> a
to (Rep a Any -> a) -> (Default a -> Rep a Any) -> Default a -> a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Bool -> Model -> Rep a Any -> Rep a Any
forall (a :: * -> *) c.
EvaluateSym' a =>
Bool -> Model -> a c -> a c
evaluateSym' Bool
fillDefault Model
model (Rep a Any -> Rep a Any)
-> (Default a -> Rep a Any) -> Default a -> Rep a Any
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> Rep a Any
forall a x. Generic a => a -> Rep a x
from (a -> Rep a Any) -> (Default a -> a) -> Default a -> Rep a Any
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Default a -> a
forall a. Default a -> a
unDefault
class EvaluateSym' a where
evaluateSym' :: Bool -> Model -> a c -> a c
instance EvaluateSym' U1 where
evaluateSym' :: forall c. Bool -> Model -> U1 c -> U1 c
evaluateSym' Bool
_ Model
_ = U1 c -> U1 c
forall a. a -> a
id
instance EvaluateSym c => EvaluateSym' (K1 i c) where
evaluateSym' :: forall c. Bool -> Model -> K1 i c c -> K1 i c c
evaluateSym' Bool
fillDefault Model
model (K1 c
v) = c -> K1 i c c
forall k i c (p :: k). c -> K1 i c p
K1 (c -> K1 i c c) -> c -> K1 i c c
forall a b. (a -> b) -> a -> b
$ Bool -> Model -> c -> c
forall a. EvaluateSym a => Bool -> Model -> a -> a
evaluateSym Bool
fillDefault Model
model c
v
instance EvaluateSym' a => EvaluateSym' (M1 i c a) where
evaluateSym' :: forall c. Bool -> Model -> M1 i c a c -> M1 i c a c
evaluateSym' Bool
fillDefault Model
model (M1 a c
v) = a c -> M1 i c a c
forall k i (c :: Meta) (f :: k -> *) (p :: k). f p -> M1 i c f p
M1 (a c -> M1 i c a c) -> a c -> M1 i c a c
forall a b. (a -> b) -> a -> b
$ Bool -> Model -> a c -> a c
forall (a :: * -> *) c.
EvaluateSym' a =>
Bool -> Model -> a c -> a c
evaluateSym' Bool
fillDefault Model
model a c
v
instance (EvaluateSym' a, EvaluateSym' b) => EvaluateSym' (a :+: b) where
evaluateSym' :: forall c. Bool -> Model -> (:+:) a b c -> (:+:) a b c
evaluateSym' Bool
fillDefault Model
model (L1 a c
l) = a c -> (:+:) a b c
forall k (f :: k -> *) (g :: k -> *) (p :: k). f p -> (:+:) f g p
L1 (a c -> (:+:) a b c) -> a c -> (:+:) a b c
forall a b. (a -> b) -> a -> b
$ Bool -> Model -> a c -> a c
forall (a :: * -> *) c.
EvaluateSym' a =>
Bool -> Model -> a c -> a c
evaluateSym' Bool
fillDefault Model
model a c
l
evaluateSym' Bool
fillDefault Model
model (R1 b c
r) = b c -> (:+:) a b c
forall k (f :: k -> *) (g :: k -> *) (p :: k). g p -> (:+:) f g p
R1 (b c -> (:+:) a b c) -> b c -> (:+:) a b c
forall a b. (a -> b) -> a -> b
$ Bool -> Model -> b c -> b c
forall (a :: * -> *) c.
EvaluateSym' a =>
Bool -> Model -> a c -> a c
evaluateSym' Bool
fillDefault Model
model b c
r
instance (EvaluateSym' a, EvaluateSym' b) => EvaluateSym' (a :*: b) where
evaluateSym' :: forall c. Bool -> Model -> (:*:) a b c -> (:*:) a b c
evaluateSym' Bool
fillDefault Model
model (a c
a :*: b c
b) = Bool -> Model -> a c -> a c
forall (a :: * -> *) c.
EvaluateSym' a =>
Bool -> Model -> a c -> a c
evaluateSym' Bool
fillDefault Model
model a c
a a c -> b c -> (:*:) a b c
forall k (f :: k -> *) (g :: k -> *) (p :: k).
f p -> g p -> (:*:) f g p
:*: Bool -> Model -> b c -> b c
forall (a :: * -> *) c.
EvaluateSym' a =>
Bool -> Model -> a c -> a c
evaluateSym' Bool
fillDefault Model
model b c
b
evaluateSymToCon :: (ToCon a b, EvaluateSym a) => Model -> a -> b
evaluateSymToCon :: forall a b. (ToCon a b, EvaluateSym a) => Model -> a -> b
evaluateSymToCon Model
model a
a = Maybe b -> b
forall a. HasCallStack => Maybe a -> a
fromJust (Maybe b -> b) -> Maybe b -> b
forall a b. (a -> b) -> a -> b
$ a -> Maybe b
forall a b. ToCon a b => a -> Maybe b
toCon (a -> Maybe b) -> a -> Maybe b
forall a b. (a -> b) -> a -> b
$ Bool -> Model -> a -> a
forall a. EvaluateSym a => Bool -> Model -> a -> a
evaluateSym Bool
True Model
model a
a
#define CONCRETE_EVALUATESYM(type) \
instance EvaluateSym type where \
evaluateSym _ _ = id
#if 1
CONCRETE_EVALUATESYM(Bool)
CONCRETE_EVALUATESYM(Integer)
CONCRETE_EVALUATESYM(Char)
CONCRETE_EVALUATESYM(Int)
CONCRETE_EVALUATESYM(Int8)
CONCRETE_EVALUATESYM(Int16)
CONCRETE_EVALUATESYM(Int32)
CONCRETE_EVALUATESYM(Int64)
CONCRETE_EVALUATESYM(Word)
CONCRETE_EVALUATESYM(Word8)
CONCRETE_EVALUATESYM(Word16)
CONCRETE_EVALUATESYM(Word32)
CONCRETE_EVALUATESYM(Word64)
CONCRETE_EVALUATESYM(B.ByteString)
#endif
instance EvaluateSym () where
evaluateSym :: Bool -> Model -> () -> ()
evaluateSym Bool
_ Model
_ = () -> ()
forall a. a -> a
id
deriving via (Default (Either a b)) instance (EvaluateSym a, EvaluateSym b) => EvaluateSym (Either a b)
deriving via (Default (Maybe a)) instance (EvaluateSym a) => EvaluateSym (Maybe a)
deriving via (Default [a]) instance (EvaluateSym a) => EvaluateSym [a]
deriving via (Default (a, b)) instance (EvaluateSym a, EvaluateSym b) => EvaluateSym (a, b)
deriving via (Default (a, b, c)) instance (EvaluateSym a, EvaluateSym b, EvaluateSym c) => EvaluateSym (a, b, c)
deriving via
(Default (a, b, c, d))
instance
(EvaluateSym a, EvaluateSym b, EvaluateSym c, EvaluateSym d) => EvaluateSym (a, b, c, d)
deriving via
(Default (a, b, c, d, e))
instance
(EvaluateSym a, EvaluateSym b, EvaluateSym c, EvaluateSym d, EvaluateSym e) =>
EvaluateSym (a, b, c, d, e)
deriving via
(Default (a, b, c, d, e, f))
instance
(EvaluateSym a, EvaluateSym b, EvaluateSym c, EvaluateSym d, EvaluateSym e, EvaluateSym f) =>
EvaluateSym (a, b, c, d, e, f)
deriving via
(Default (a, b, c, d, e, f, g))
instance
( EvaluateSym a,
EvaluateSym b,
EvaluateSym c,
EvaluateSym d,
EvaluateSym e,
EvaluateSym f,
EvaluateSym g
) =>
EvaluateSym (a, b, c, d, e, f, g)
deriving via
(Default (a, b, c, d, e, f, g, h))
instance
( EvaluateSym a,
EvaluateSym b,
EvaluateSym c,
EvaluateSym d,
EvaluateSym e,
EvaluateSym f,
EvaluateSym g,
EvaluateSym h
) =>
EvaluateSym ((,,,,,,,) a b c d e f g h)
instance (EvaluateSym (m (Maybe a))) => EvaluateSym (MaybeT m a) where
evaluateSym :: Bool -> Model -> MaybeT m a -> MaybeT m a
evaluateSym Bool
fillDefault Model
model (MaybeT m (Maybe a)
v) = m (Maybe a) -> MaybeT m a
forall (m :: * -> *) a. m (Maybe a) -> MaybeT m a
MaybeT (m (Maybe a) -> MaybeT m a) -> m (Maybe a) -> MaybeT m a
forall a b. (a -> b) -> a -> b
$ Bool -> Model -> m (Maybe a) -> m (Maybe a)
forall a. EvaluateSym a => Bool -> Model -> a -> a
evaluateSym Bool
fillDefault Model
model m (Maybe a)
v
instance (EvaluateSym (m (Either e a))) => EvaluateSym (ExceptT e m a) where
evaluateSym :: Bool -> Model -> ExceptT e m a -> ExceptT e m a
evaluateSym Bool
fillDefault Model
model (ExceptT m (Either e a)
v) = m (Either e a) -> ExceptT e m a
forall e (m :: * -> *) a. m (Either e a) -> ExceptT e m a
ExceptT (m (Either e a) -> ExceptT e m a)
-> m (Either e a) -> ExceptT e m a
forall a b. (a -> b) -> a -> b
$ Bool -> Model -> m (Either e a) -> m (Either e a)
forall a. EvaluateSym a => Bool -> Model -> a -> a
evaluateSym Bool
fillDefault Model
model m (Either e a)
v
deriving via
(Default (Sum f g a))
instance
(EvaluateSym (f a), EvaluateSym (g a)) => EvaluateSym (Sum f g a)
instance EvaluateSym (m (a, s)) => EvaluateSym (WriterLazy.WriterT s m a) where
evaluateSym :: Bool -> Model -> WriterT s m a -> WriterT s m a
evaluateSym Bool
fillDefault Model
model (WriterLazy.WriterT m (a, s)
v) = m (a, s) -> WriterT s m a
forall w (m :: * -> *) a. m (a, w) -> WriterT w m a
WriterLazy.WriterT (m (a, s) -> WriterT s m a) -> m (a, s) -> WriterT s m a
forall a b. (a -> b) -> a -> b
$ Bool -> Model -> m (a, s) -> m (a, s)
forall a. EvaluateSym a => Bool -> Model -> a -> a
evaluateSym Bool
fillDefault Model
model m (a, s)
v
instance EvaluateSym (m (a, s)) => EvaluateSym (WriterStrict.WriterT s m a) where
evaluateSym :: Bool -> Model -> WriterT s m a -> WriterT s m a
evaluateSym Bool
fillDefault Model
model (WriterStrict.WriterT m (a, s)
v) = m (a, s) -> WriterT s m a
forall w (m :: * -> *) a. m (a, w) -> WriterT w m a
WriterStrict.WriterT (m (a, s) -> WriterT s m a) -> m (a, s) -> WriterT s m a
forall a b. (a -> b) -> a -> b
$ Bool -> Model -> m (a, s) -> m (a, s)
forall a. EvaluateSym a => Bool -> Model -> a -> a
evaluateSym Bool
fillDefault Model
model m (a, s)
v
instance EvaluateSym a => EvaluateSym (Identity a) where
evaluateSym :: Bool -> Model -> Identity a -> Identity a
evaluateSym Bool
fillDefault Model
model (Identity a
a) = a -> Identity a
forall a. a -> Identity a
Identity (a -> Identity a) -> a -> Identity a
forall a b. (a -> b) -> a -> b
$ Bool -> Model -> a -> a
forall a. EvaluateSym a => Bool -> Model -> a -> a
evaluateSym Bool
fillDefault Model
model a
a
instance EvaluateSym (m a) => EvaluateSym (IdentityT m a) where
evaluateSym :: Bool -> Model -> IdentityT m a -> IdentityT m a
evaluateSym Bool
fillDefault Model
model (IdentityT m a
a) = m a -> IdentityT m a
forall {k} (f :: k -> *) (a :: k). f a -> IdentityT f a
IdentityT (m a -> IdentityT m a) -> m a -> IdentityT m a
forall a b. (a -> b) -> a -> b
$ Bool -> Model -> m a -> m a
forall a. EvaluateSym a => Bool -> Model -> a -> a
evaluateSym Bool
fillDefault Model
model m a
a