-
Notifications
You must be signed in to change notification settings - Fork 41
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #14 from purescript/simplify
Simplify: revert to pre-'machines' state.
- Loading branch information
Showing
10 changed files
with
363 additions
and
1,004 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,41 @@ | ||
| module.exports = function(grunt) { | ||
|
|
||
| "use strict"; | ||
|
|
||
| grunt.initConfig({ | ||
|
|
||
| libFiles: [ | ||
| "src/**/*.purs", | ||
| "bower_components/purescript-*/src/**/*.purs", | ||
| ], | ||
|
|
||
| clean: ["output"], | ||
|
|
||
| pscMake: ["<%=libFiles%>"], | ||
| dotPsci: ["<%=libFiles%>"], | ||
| docgen: { | ||
| readme: { | ||
| src: "src/**/*.purs", | ||
| dest: "README.md" | ||
| } | ||
| }, | ||
|
|
||
| psc: { | ||
| options: { | ||
| main: "Main", | ||
| modules: ["Main"] | ||
| }, | ||
| example: { | ||
| src: ["<%=libFiles%>", "examples/Prelude.purs"], | ||
| dest: "tmp/Prelude.js" | ||
| } | ||
| } | ||
| }); | ||
|
|
||
| grunt.loadNpmTasks("grunt-contrib-clean"); | ||
| grunt.loadNpmTasks("grunt-purescript"); | ||
|
|
||
| grunt.registerTask("make", ["pscMake", "dotPsci", "docgen"]); | ||
| grunt.registerTask("example", ["psc:example"]); | ||
| grunt.registerTask("default", ["make"]); | ||
| }; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,132 +1,30 @@ | ||
| module PreludeTests where | ||
| module Main where | ||
|
|
||
| import Control.Monad.Eff | ||
| import Data.Eq | ||
| import Debug.Trace | ||
| import Test.QuickCheck | ||
| import Test.QuickCheck.LCG | ||
| import Control.Monad.Trampoline | ||
| import Data.Monoid | ||
| import Data.Tuple | ||
| import Data.Maybe | ||
| import Data.Foldable | ||
| import qualified Data.Array as Array | ||
| import qualified Math as Math | ||
|
|
||
| between :: forall a. (Ord a) => a -> a -> a -> Boolean | ||
| between min max = \n -> n >= min && n <= max | ||
| testConst :: Number -> Number -> Number -> Boolean | ||
| testConst a b c = const a b == const a c | ||
|
|
||
| data Mega = Mega { | ||
| arrayOf :: [Number], | ||
| arrayOf1 :: [Number], | ||
| choose :: Number, | ||
| chooseInt :: Number, | ||
| collectAll :: [Number], | ||
| allInArray :: [Number], | ||
| allInRange :: [Number], | ||
| dropGen :: [Number], | ||
| takeGen :: [Number], | ||
| elements :: [String], | ||
| extend :: [String], | ||
| infinite :: [String], | ||
| perms :: [[String]] } | ||
|
|
||
| {- TODO: Remaining cases | ||
| , frequency | ||
| , oneOf | ||
| , perturbGen | ||
| , repeatable | ||
| , resize | ||
| , sample | ||
| , sample' | ||
| , showSample | ||
| , showSample' | ||
| , sized | ||
| , stateful | ||
| , suchThat | ||
| , suchThatMaybe | ||
| , unfoldGen | ||
| , uniform | ||
| , variant | ||
| , vectorOf | ||
| -} | ||
|
|
||
| data DetABC = DetABC String | ||
|
|
||
| runDetABC :: DetABC -> String | ||
| runDetABC (DetABC s) = s | ||
|
|
||
| instance arbDetABC :: Arbitrary DetABC where | ||
| arbitrary = DetABC <$> allInArray ["A", "B", "C"] | ||
|
|
||
| data OneToTen = OneToTen Number | ||
|
|
||
| runOneToTen :: OneToTen -> Number | ||
| runOneToTen (OneToTen n) = n | ||
|
|
||
| instance arbOneToTen :: Arbitrary OneToTen where | ||
| arbitrary = OneToTen <$> chooseInt 0 10 | ||
|
|
||
| instance arbMega :: Arbitrary Mega where | ||
| arbitrary = do | ||
| arrayOf' <- arrayOf (choose 0 10) | ||
| arrayOf1' <- arrayOf1 (choose 0 10) | ||
| choose' <- choose 0 10 | ||
| chooseInt' <- chooseInt 0 10 | ||
| collectAll' <- collectAll mempty (allInArray [0, 1, 2]) | ||
| allInArray' <- collectAll mempty (allInArray [0, 1, 2]) | ||
| allInRange' <- collectAll mempty (allInRange 0 10) | ||
| dropGen' <- collectAll mempty $ dropGen 2 (allInArray [2, 1, -1]) | ||
| takeGen' <- collectAll mempty $ takeGen 2 (allInArray [2, 1, -1]) | ||
| elements' <- arrayOf $ elements "foo" ["bar", "baz"] | ||
| extend' <- collectAll mempty $ extend 3 (pure "5") | ||
| infinite' <- collectAll mempty $ takeGen 4 (infinite $ pure "foo") | ||
| perms' <- collectAll mempty $ perms ["John", "D"] | ||
| return $ Mega { | ||
| arrayOf: arrayOf', | ||
| arrayOf1: (case arrayOf1' of Tuple a as -> a : as), | ||
| choose: choose', | ||
| chooseInt: chooseInt', | ||
| collectAll: collectAll', | ||
| allInArray: allInArray', | ||
| allInRange: allInRange', | ||
| dropGen: dropGen', | ||
| takeGen: takeGen', | ||
| elements: elements', | ||
| extend: extend', | ||
| infinite: infinite', | ||
| perms: perms' } | ||
|
|
||
| verify_gen :: Mega -> Result | ||
| verify_gen (Mega m) = fold [ | ||
| all (between 0 10) m.arrayOf <?> "arrayOf: " ++ show m.arrayOf, | ||
| Array.length m.arrayOf1 >= 1 <?> "arrayOf1: " ++ show m.arrayOf1, | ||
| between 0 10 m.choose <?> "choose: " ++ show m.choose, | ||
| between 0 10 m.chooseInt && | ||
| Math.floor(m.chooseInt) == m.chooseInt <?> "chooseInt: " ++ show m.chooseInt, | ||
| m.collectAll == [0, 1, 2] <?> "collectAll: " ++ show m.collectAll, | ||
| m.allInArray == [0, 1, 2] <?> "allInArray: " ++ show m.allInArray, | ||
| m.allInRange == [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10] <?> "allInRange: " ++ show m.allInRange, | ||
| m.dropGen == [-1] <?> "dropGen: " ++ show m.dropGen, | ||
| m.takeGen == [2, 1] <?> "takeGen: " ++ show m.takeGen, | ||
| all (flip elem ["foo", "bar", "baz"]) m.elements <?> "elements: " ++ show m.elements, | ||
| m.extend == ["5", "5", "5"] <?> "extend: " ++ show m.extend, | ||
| m.infinite == ["foo", "foo", "foo", "foo"] <?> "infinite: " ++ show m.infinite, | ||
| m.perms == ["John", "D"] : ["D", "John"] : [] <?> "perms: " ++ show m.perms] | ||
| mkMessage :: (Number -> Number) -> String | ||
| mkMessage f = "Test failed for function (" | ||
| ++ show (f 0) ++ ", " | ||
| ++ show (f 1) ++ ", " | ||
| ++ show (f 2) ++ ")" | ||
|
|
||
| main = do | ||
| trace "Gen combinators" | ||
| quickCheck $ verify_gen | ||
|
|
||
| trace "foldGen" | ||
| quickCheck $ (runTrampoline $ foldGen (\a b -> Just $ a + b) 1 mempty (allInArray [1, 2, 3])) == 7 | ||
| Debug.Trace.trace "testConst:" | ||
| quickCheck testConst | ||
|
|
||
| trace "smallCheck" | ||
| smallCheck $ runDetABC >>> (flip elem ["A", "B", "C"]) | ||
| Debug.Trace.trace "id is a left unit for <<<" | ||
| quickCheck $ \f a -> ((id <<< f) (a :: Number) == (f a) :: Number) <?> mkMessage f | ||
|
|
||
| trace "Fair distribution of booleans" | ||
| statCheck (1/2) $ (==) true | ||
| Debug.Trace.trace "Precedence of && and ||:" | ||
| quickCheck $ \a b c -> ((a :: Boolean && b) || c) == ((a || c) && (b || c)) | ||
|
|
||
| trace "Fair distribution of ints" | ||
| statCheck (1/11) $ runOneToTen >>> ((==) 1) | ||
| Debug.Trace.trace "Test Eq instance for Ref:" | ||
| quickCheck $ \a -> (Ref a :: Ref Number) == Ref a | ||
| quickCheck $ \a -> not $ (Ref a :: Ref Number /= Ref a) | ||
|
|
Oops, something went wrong.