{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE NoMonomorphismRestriction #-}
{-# LANGUAGE Rank2Types #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeOperators #-}
{-# OPTIONS_GHC -fno-warn-missing-signatures #-}
module Expr.List.Test where

import Test.Tasty
import Test.Tasty.HUnit

import qualified Control.Arrow as Arrow
import qualified Control.Monad as Monad
import Data.Proxy (Proxy(..))
import Data.Text (Text)
import Data.Type.Equality ((:~:)(Refl))
import Prelude hiding (mod, (==), return)

import Language.Symantic.Repr
import Language.Symantic.Expr
import Language.Symantic.Type

import AST.Test

-- * Expressions
t = bool True
f = bool False
e1 = list_filter (lam $ \x -> if_ (x `mod` int 2 == int 0) t f)
                 (list $ int Prelude.<$> [1..5])

-- * Tests
type Ex = Expr_Root
 (   Expr_Lambda
 .|. Expr_List
 .|. Expr_Int
 .|. Expr_Bool
 )
ex_from = root_expr_from (Proxy::Proxy Ex)

(==>) ast expected =
	testCase (show ast) $
	case ex_from ast of
	 Left err -> Left err @?= Prelude.snd `Arrow.left` expected
	 Right (Exists_Type_and_Repr ty (Forall_Repr r)) ->
		case expected of
		 Left (_, err) -> Right ("…"::String) @?= Left err
		 Right (ty_expected::Type_Root_of_Expr Ex h, _::h, _::Text) ->
			(Monad.>>= (@?= (\(_::Proxy h, err) -> err) `Arrow.left` expected)) $
			case ty `eq_type` ty_expected of
			 Nothing -> Monad.return $ Left $
				error_expr (Proxy::Proxy Ex) $
				Error_Expr_Type_mismatch ast
				 (Exists_Type ty)
				 (Exists_Type ty_expected)
			 Just Refl -> do
				let h = host_from_expr r
				Monad.return $
					Right
					 ( ty
					 , h
					 , text_from_expr r
					 -- , (text_from_expr :: Repr_Text h -> Text) r
					 )

tests :: TestTree
tests = testGroup "List"
 [ AST "list_reverse"
	 [ AST "list"
		 [ AST "Int" []
		 , AST "int" [AST "1" []]
		 , AST "int" [AST "2" []]
		 , AST "int" [AST "3" []]
		 ]
	 ] ==> Right
	 ( type_list type_int
	 , [3,2,1]
	 , "list_reverse [1, 2, 3]" )
 ]