4930de2 · reflex · git.iko.soy

git.iko.soy/reflex

on develop help sign in

Add cross-impl test suite to cabal file

4930de2Ryan Trinkle11 years ago

reflex.cabal+14

compare with develop

unifiedsplit

@@ -44,6 +44,20 @@ library

44 ghc-prof-options: -fprof-auto

45 ghc-options: -Wall -fwarn-tabs -funbox-strict-fields -O2

47+test-suite cross-impl

48+ type: exitcode-stdio-1.0

49+ main-is: Reflex/Test/CrossImpl.hs

50+ ghc-options: -O2 -main-is Reflex.Test.CrossImpl.test

51+ hs-source-dirs: test

52+ build-depends:

53+ base,

54+ reflex,

55+ ref-tf,

56+ mtl,

57+ containers,

58+ dependent-map,

59+ MemoTrie == 0.6.*

60+

47benchmark spider-bench

61benchmark spider-bench

48 type: exitcode-stdio-1.0

62 type: exitcode-stdio-1.0

49 hs-source-dirs: bench

63 hs-source-dirs: bench

test/Reflex/Pure.hs+1−1

@@ -1,6 +1,6 @@

1{- | This module provides a pure implementation of Reflex, which is intended to serve as a reference for the semantics of the Reflex class. All implementations of Reflex should produce the same results as this implementation, although performance and laziness/strictness may differ.

2-}

3−{-# LANGUAGE TypeFamilies, MultiParamTypeClasses #-}

3+{-# LANGUAGE TypeFamilies, MultiParamTypeClasses, EmptyDataDecls #-}

4module Reflex.Pure where

6import Reflex.Class

test/Reflex/Test/CrossImpl.hs+14−7

@@ -21,6 +21,7 @@ import Control.Monad.State.Strict hiding (mapM, mapM_, forM, forM_, sequence, se

21import Control.Monad.Writer hiding (mapM, mapM_, forM, forM_, sequence, sequence_)

22import Data.Dependent.Map (DSum (..))

23import System.Mem

24+import System.Exit

25import System.IO.Unsafe

26import System.IO.Unsafe

@@ -85,16 +86,20 @@ testSpider builder (bMap, eMap) = unsafePerformIO $ S.runSpiderHost $ do

85tracePerf :: Show a => a -> b -> b

86tracePerf :: Show a => a -> b -> b

86tracePerf = flip const

87tracePerf = flip const

88−testAgreement :: (Eq c, Eq d, Show c, Show d) => (forall m t. TestCaseConstraint t m => (Behavior t a, Event t b) -> m (Behavior t c, Event t d)) -> (Map Int a, Map Int b) -> IO ()

89+testAgreement :: (Eq c, Eq d, Show c, Show d) => (forall m t. TestCaseConstraint t m => (Behavior t a, Event t b) -> m (Behavior t c, Event t d)) -> (Map Int a, Map Int b) -> IO Bool

89testAgreement builder inputs = do

90testAgreement builder inputs = do

90 let identityResult = testPure builder inputs

91 let identityResult = testPure builder inputs

91 tracePerf "---------" $ return ()

92 tracePerf "---------" $ return ()

92 let spiderResult = testSpider builder inputs

93 let spiderResult = testSpider builder inputs

93 tracePerf "---------" $ return ()

94 tracePerf "---------" $ return ()

95+ let resultsAgree = identityResult == spiderResult

96+ if resultsAgree

97+ then do putStrLn "Success:"

94− if identityResult == spiderResult then putStrLn "Success:" >> print identityResult else do

98+ print identityResult

95− putStrLn "Failure:"

99+ else do putStrLn "Failure:"

96− putStrLn $ "Pure result: " <> show identityResult

100+ putStrLn $ "Pure result: " <> show identityResult

97− putStrLn $ "Spider result: " <> show spiderResult

101+ putStrLn $ "Spider result: " <> show spiderResult

102+ return resultsAgree

103

99type TestCaseConstraint t m = (Reflex t, MonadSample t m, MonadHold t m, MonadFix m, MonadFix (PushM t))

104type TestCaseConstraint t m = (Reflex t, MonadSample t m, MonadHold t m, MonadFix m, MonadFix (PushM t))

100

105

@@ -215,7 +220,9 @@ testCases =

215

220

216test :: IO ()

221test :: IO ()

217test = do

222test = do

218− forM_ testCases $ \(name, TestCase inputs builder) -> do

223+ results <- forM testCases $ \(name, TestCase inputs builder) -> do

219 putStrLn $ "Test: " <> name

224 putStrLn $ "Test: " <> name

220 testAgreement builder inputs

225 testAgreement builder inputs

221− return ()

226+ exitWith $ if and results

227+ then ExitSuccess

228+ else ExitFailure 1