Merge pull request #14 from purescript-contrib/no-quickcheck

Remove quickcheck as a hard dependency

Author: garyb

bower.json

@@ -15,11 +15,14 @@
     "purescript-arrays": "^5.0.0",
     "purescript-globals": "^4.0.0",
     "purescript-integers": "^4.0.0",
-    "purescript-quickcheck": "^5.0.0",
-    "purescript-generics-rep": "^6.0.0",      
-    "purescript-strings": "^4.0.0"
+    "purescript-generics-rep": "^6.0.0",
+    "purescript-strings": "^4.0.0",
+    "purescript-gen": "^2.1.0",
+    "purescript-lists": "^5.4.0",
+    "purescript-exceptions": "^4.0.0"
   },
   "devDependencies": {
+    "purescript-quickcheck": "^5.0.0",
     "purescript-quickcheck-laws": "^4.0.0"
   }
 }

src/Data/HugeNum.purs

@@ -26,7 +26,7 @@ import Data.List as L
 import Data.Digit (Digit, toInt, fromInt, fromChar, toChar, _zero, _one)
 import Data.Foldable (foldl, all, foldMap)
 import Data.Generic.Rep (class Generic)
-import Data.Int (round, odd, toNumber) as Int
+import Data.Int (odd, round) as Int
 import Data.List (List(..), (:))
 import Data.Maybe (Maybe(..), fromJust)
 import Data.String (Pattern(..), contains)
@@ -37,8 +37,6 @@ import Data.Unfoldable (replicate)
 import Effect.Exception.Unsafe (unsafeThrow)
 import Global (readFloat)
 import Partial.Unsafe (unsafePartial)
-import Test.QuickCheck.Arbitrary (class Arbitrary)
-import Test.QuickCheck.Gen (chooseInt)
 
 -- | ##Type definitions
 -- | Well-formed HugeNums are such that the decimal is a positive number less
@@ -56,12 +54,6 @@ newtype HugeNum = HugeNum { digits :: List Digit, decimal :: Int, sign :: Sign }
 derive instance genericSign :: Generic Sign _
 derive instance genericHugeNum :: Generic HugeNum _
 
-instance arbHugeNum :: Arbitrary HugeNum where
-  arbitrary = do
-    i <- Int.toNumber <$> chooseInt 0 1000
-    d <- Int.toNumber <$> chooseInt 0 10
-    pure $ fromNumber (i + d / 10.0)
-
 instance eqSign :: Eq Sign where
   eq Plus Plus = true
   eq Minus Minus = true

src/Data/HugeNum/Gen.purs

@@ -0,0 +1,14 @@
+module Data.HugeNum.Gen where
+
+import Prelude
+
+import Control.Monad.Gen as Gen
+import Data.HugeNum (HugeNum)
+import Data.HugeNum as HugeNum
+import Data.Int as Int
+
+genHugeNum :: forall m. Gen.MonadGen m => m HugeNum
+genHugeNum = do
+  i <- Int.toNumber <$> Gen.chooseInt 0 1000
+  d <- Int.toNumber <$> Gen.chooseInt 0 10
+  pure $ HugeNum.fromNumber (i + d / 10.0)

test/Main.purs

@@ -1,16 +1,29 @@
 module Test.Main where
 
 import Prelude
-import Test.QuickCheck.Laws.Data.Eq (checkEq)
-import Test.QuickCheck.Laws.Data.Ord (checkOrd)
-import Test.QuickCheck.Laws.Data.Semiring (checkSemiring)
-import Test.QuickCheck.Laws.Data.Ring (checkRing)
+
 import Data.HugeNum (HugeNum)
+import Data.HugeNum.Gen (genHugeNum)
 import Effect (Effect)
 import Effect.Console (log)
+import Test.QuickCheck (class Arbitrary)
+import Test.QuickCheck.Laws.Data.Eq (checkEq)
+import Test.QuickCheck.Laws.Data.Ord (checkOrd)
+import Test.QuickCheck.Laws.Data.Ring (checkRing)
+import Test.QuickCheck.Laws.Data.Semiring (checkSemiring)
 import Type.Proxy (Proxy(..))
 
-prxHugeNum :: Proxy HugeNum
+newtype ArbHugeNum = ArbHugeNum HugeNum
+
+derive newtype instance eqArbHugeNum :: Eq ArbHugeNum
+derive newtype instance ordArbHugeNum :: Ord ArbHugeNum
+derive newtype instance semiringArbHugeNum :: Semiring ArbHugeNum
+derive newtype instance ringArbHugeNum :: Ring ArbHugeNum
+
+instance arbitraryArbHugeNum :: Arbitrary ArbHugeNum where
+  arbitrary = ArbHugeNum <$> genHugeNum
+
+prxHugeNum :: Proxy ArbHugeNum
 prxHugeNum = Proxy
 
 main :: Effect Unit