Remove strongcheck dependency & generated tests

Author: garyb

README.md

@@ -34,10 +34,6 @@ import Text.Markdown.SlamDown.Pretty
 Module documentation is [published on
 Pursuit](http://pursuit.purescript.org/packages/purescript-markdown).
 
-### Tests
-
-The tests use [purescript-strongcheck](http://github.com/purescript-contrib/purescript-strongcheck) to verify that an arbitrary `SlamDown` document can be rendered as a `String` and then parsed to a `SlamDown` equal to the original.
-
 ## Features
 
 In general, SlamDown is a subset of [CommonMark](http://spec.commonmark.org/), supporting the following features:

bower.json

@@ -32,8 +32,10 @@
     "purescript-precise": "^3.0.1",
     "purescript-prelude": "^4.0.1",
     "purescript-strings": "^4.0.0",
-    "purescript-strongcheck": "^4.1.1",
     "purescript-unicode": "^4.0.1",
     "purescript-validation": "^4.0.0"
+  },
+  "devDependencies": {
+    "purescript-assert": "^4.0.0"
   }
 }

src/Text/Markdown/SlamDown/Syntax.purs

@@ -12,8 +12,6 @@ import Prelude
 import Data.Eq (class Eq1)
 import Data.List as L
 import Data.Ord (class Ord1)
-import Test.StrongCheck.Arbitrary as SCA
-import Test.StrongCheck.Gen as Gen
 import Text.Markdown.SlamDown.Syntax.Block (Block(..), CodeBlockType(..), ListType(..)) as SDB
 import Text.Markdown.SlamDown.Syntax.FormField (class Value, Expr(..), FormField, FormFieldP(..), TextBox(..), TimePrecision(..), getLiteral, getUnevaluated, renderValue, stringValue, transFormField, transTextBox, traverseFormField, traverseTextBox) as SDF
 import Text.Markdown.SlamDown.Syntax.Inline (Inline(..), LinkTarget(..)) as SDI
@@ -36,6 +34,3 @@ derive instance ord1SlamDownP ∷ Ord1 SlamDownP
 
 derive newtype instance semigroupSlamDownP ∷ Semigroup (SlamDownP a)
 derive newtype instance monoidSlamDownP ∷ Monoid (SlamDownP a)
-
-instance arbitrarySlamDownP ∷ (SCA.Arbitrary a, Eq a) ⇒ SCA.Arbitrary (SlamDownP a) where
-  arbitrary = SlamDown <<< L.fromFoldable <$> Gen.arrayOf SCA.arbitrary

src/Text/Markdown/SlamDown/Syntax/Block.purs

@@ -9,8 +9,6 @@ import Prelude
 import Data.Eq (class Eq1)
 import Data.List as L
 import Data.Ord (class Ord1)
-import Test.StrongCheck.Arbitrary as SCA
-import Test.StrongCheck.Gen as Gen
 import Text.Markdown.SlamDown.Syntax.Inline (Inline)
 
 data Block a
@@ -38,22 +36,6 @@ derive instance eq1Block ∷ Eq1 Block
 derive instance ordBlock ∷ Ord a ⇒ Ord (Block a)
 derive instance ord1Block ∷ Ord1 Block
 
--- | Nota bene: this does not generate any recursive structure
-instance arbitraryBlock ∷ (SCA.Arbitrary a, Eq a) ⇒ SCA.Arbitrary (Block a) where
-  arbitrary = do
-    k ← Gen.chooseInt 0 6
-    case k of
-      0 → Paragraph <$> listOf SCA.arbitrary
-      1 → Header <$> SCA.arbitrary <*> listOf SCA.arbitrary
-      2 → pure $ Blockquote L.Nil
-      3 → Lst <$> SCA.arbitrary <*> listOf (pure L.Nil)
-      4 → CodeBlock <$> SCA.arbitrary <*> listOf SCA.arbitrary
-      5 → LinkReference <$> SCA.arbitrary <*> SCA.arbitrary
-      _ → pure Rule
-
-listOf ∷ ∀ f a. (Monad f) ⇒ Gen.GenT f a → Gen.GenT f (L.List a)
-listOf = map L.fromFoldable <<< Gen.arrayOf
-
 data ListType
   = Bullet String
   | Ordered String
@@ -65,11 +47,6 @@ instance showListType ∷ Show ListType where
 derive instance eqListType ∷ Eq ListType
 derive instance ordListType ∷ Ord ListType
 
-instance arbitraryListType ∷ SCA.Arbitrary ListType where
-  arbitrary = do
-    b ← SCA.arbitrary
-    if b then Bullet <$> SCA.arbitrary else Ordered <$> SCA.arbitrary
-
 data CodeBlockType
   = Indented
   | Fenced Boolean String
@@ -80,8 +57,3 @@ instance showCodeBlockType ∷ Show CodeBlockType where
 
 derive instance eqCodeBlockType ∷ Eq CodeBlockType
 derive instance ordCodeBlockType ∷ Ord CodeBlockType
-
-instance arbitraryCodeBlockType ∷ SCA.Arbitrary CodeBlockType where
-  arbitrary = do
-    b ← SCA.arbitrary
-    if b then pure Indented else Fenced <$> SCA.arbitrary <*> SCA.arbitrary

src/Text/Markdown/SlamDown/Syntax/FormField.purs

@@ -14,7 +14,6 @@ module Text.Markdown.SlamDown.Syntax.FormField
 
 import Prelude
 
-import Data.Array as A
 import Data.Eq (class Eq1, eq1)
 import Data.Functor.Compose (Compose(..))
 import Data.Identity (Identity(..))
@@ -23,10 +22,6 @@ import Data.Maybe as M
 import Data.Newtype (unwrap)
 import Data.Ord (class Ord1, compare1)
 import Data.Traversable as TR
-import Data.Tuple (uncurry)
-import Partial.Unsafe (unsafePartial)
-import Test.StrongCheck.Arbitrary as SCA
-import Test.StrongCheck.Gen as Gen
 import Text.Markdown.SlamDown.Syntax.TextBox (TextBox(..), TimePrecision(..), transTextBox, traverseTextBox) as TB
 import Text.Markdown.SlamDown.Syntax.Value (class Value, renderValue, stringValue) as Value
 
@@ -123,15 +118,6 @@ instance functorArbIdentity ∷ Functor ArbIdentity where
   map f (ArbIdentity x) =
     ArbIdentity $ f x
 
-instance arbitraryArbIdentity ∷ (SCA.Arbitrary a) ⇒ SCA.Arbitrary (ArbIdentity a) where
-  arbitrary =
-    ArbIdentity <$>
-      SCA.arbitrary
-
-instance coarbitraryArbIdentity ∷ (SCA.Coarbitrary a) ⇒ SCA.Coarbitrary (ArbIdentity a) where
-  coarbitrary (ArbIdentity x) =
-    SCA.coarbitrary x
-
 newtype ArbCompose f g a = ArbCompose (f (g a))
 
 getArbCompose
@@ -146,141 +132,6 @@ instance functorArbCompose ∷ (Functor f, Functor g) ⇒ Functor (ArbCompose f
     ArbCompose $
       map (map f) x
 
-instance arbitraryArbCompose ∷ (SCA.Arbitrary (f (g a))) ⇒ SCA.Arbitrary (ArbCompose f g a) where
-  arbitrary =
-    ArbCompose <$>
-      SCA.arbitrary
-
-instance coarbitraryArbCompose ∷ (SCA.Coarbitrary (f (g a))) ⇒ SCA.Coarbitrary (ArbCompose f g a) where
-  coarbitrary (ArbCompose t) =
-    SCA.coarbitrary t
-
-unsafeElements ∷ ∀ a. L.List a → Gen.Gen a
-unsafeElements =
-  Gen.elements
-    <$> (unsafePartial M.fromJust <<< L.head)
-    <*> identity
-
-instance arbitraryFormField ∷ (SCA.Arbitrary a, Eq a) ⇒ SCA.Arbitrary (FormFieldP Expr a) where
-  arbitrary = do
-    k ← Gen.chooseInt 0 3
-    case k of
-      0 → TextBox <<< TB.transTextBox getArbCompose <$> SCA.arbitrary
-      1 → do
-        xse ← genExpr $ distinctListOf1 SCA.arbitrary
-        case xse of
-          Literal xs → do
-            x ← Literal <$> unsafeElements xs
-            pure $ RadioButtons x xse
-          Unevaluated e → do
-            x ← Unevaluated <$> genUnevaluated
-            pure $ RadioButtons x xse
-      2 → do
-        xse ← genExpr $ distinctListOf1 SCA.arbitrary
-        case xse of
-          Literal xs → do
-            ys ← Literal <$> distinctListOf (unsafeElements xs)
-            pure $ CheckBoxes ys xse
-          Unevaluated e → do
-            yse ← Unevaluated <$> genUnevaluated
-            pure $ CheckBoxes yse xse
-      _ → do
-        xse ← genExpr $ distinctListOf1 SCA.arbitrary
-        case xse of
-          Literal xs → do
-            mx ← genMaybe $ Literal <$> unsafeElements xs
-            pure $ DropDown mx xse
-          Unevaluated e → do
-            mx ← genMaybe $ Unevaluated <$> genUnevaluated
-            pure $ DropDown mx xse
-
-instance arbitraryFormFieldIdentity ∷ (SCA.Arbitrary a, Eq a) ⇒ SCA.Arbitrary (FormFieldP Identity a) where
-  arbitrary = do
-    k ← Gen.chooseInt 0 3
-    case k of
-      0 → TextBox <<< TB.transTextBox (\(ArbCompose x) → Compose $ map getArbIdentity x) <$> SCA.arbitrary
-      1 → do
-        xs ← distinctListOf1 $ getArbIdentity <$> SCA.arbitrary
-        x ← unsafeElements xs
-        pure $ RadioButtons x $ TR.sequence xs
-      2 → do
-        xs ← map TR.sequence <<< distinctListOf1 $ getArbIdentity <$> SCA.arbitrary
-        ys ← TR.traverse (distinctListOf <<< unsafeElements) xs
-        pure $ CheckBoxes ys xs
-      _ → do
-        xs ← distinctListOf1 $ getArbIdentity <$> SCA.arbitrary
-        mx ← genMaybe $ unsafeElements xs
-        pure $ DropDown mx $ TR.sequence xs
-
-
-genMaybe
-  ∷ ∀ a
-  . Gen.Gen a
-  → Gen.Gen (M.Maybe a)
-genMaybe gen = do
-  b ← SCA.arbitrary
-  if b then M.Just <$> gen else pure M.Nothing
-
-instance coarbitraryFormFieldIdentity ∷ (SCA.Coarbitrary a) ⇒ SCA.Coarbitrary (FormFieldP Identity a) where
-  coarbitrary field =
-    case field of
-      TextBox tb → SCA.coarbitrary $ TB.transTextBox (unwrap >>> map (unwrap >>> ArbIdentity) >>> ArbCompose) tb
-      RadioButtons x xs → \gen → do
-        _← SCA.coarbitrary (ArbIdentity $ unwrap x) gen
-        SCA.coarbitrary (ArbIdentity $ unwrap xs) gen
-      CheckBoxes sel xs → \gen → do
-        _← SCA.coarbitrary (ArbIdentity $ unwrap sel) gen
-        SCA.coarbitrary (ArbIdentity $ unwrap xs) gen
-      DropDown mx xs → \gen → do
-        _← SCA.coarbitrary (ArbIdentity <<< unwrap <$> mx) gen
-        SCA.coarbitrary (ArbIdentity $ unwrap xs) gen
-
-listOf1
-  ∷ ∀ f a
-  . Monad f
-  ⇒ Gen.GenT f a
-  → Gen.GenT f (L.List a)
-listOf1 =
-  map (L.fromFoldable <<< uncurry A.cons)
-    <<< Gen.arrayOf1
-
-listOf
-  ∷ ∀ f a
-  . (Monad f)
-  ⇒ Gen.GenT f a
-  → Gen.GenT f (L.List a)
-listOf =
-  map L.fromFoldable
-    <<< Gen.arrayOf
-
-listOfLength
-  ∷ ∀ f a
-  . (Monad f)
-  ⇒ Int
-  → Gen.GenT f a
-  → Gen.GenT f (L.List a)
-listOfLength i =
-  map L.fromFoldable
-    <<< Gen.vectorOf i
-
-distinctListOf1
-  ∷ ∀ f a
-  . Monad f
-  ⇒ Eq a
-  ⇒ Gen.GenT f a
-  → Gen.GenT f (L.List a)
-distinctListOf1 =
-  map (map L.nub) listOf1
-
-distinctListOf
-  ∷ ∀ f a
-  . Monad f
-  ⇒ Eq a
-  ⇒ Gen.GenT f a
-  → Gen.GenT f (L.List a)
-distinctListOf =
-  map (map L.nub) listOf
-
 data Expr a
   = Literal a
   | Unevaluated String
@@ -310,16 +161,3 @@ derive instance eq1 ∷ Eq1 Expr
 
 derive instance ord1Expr ∷ Ord1 Expr
 derive instance ordExpr ∷ Ord a ⇒ Ord (Expr a)
-
-genExpr ∷ ∀ a. Gen.Gen a → Gen.Gen (Expr a)
-genExpr g = do
-  b ← SCA.arbitrary
-  if b then Literal <$> g else Unevaluated <$> genUnevaluated
-
-genUnevaluated ∷ Gen.Gen String
-genUnevaluated = do
-  x ← SCA.arbitrary
-  pure $ " " <> x <> " "
-
-instance arbitraryExpr ∷ (SCA.Arbitrary a) ⇒ SCA.Arbitrary (Expr a) where
-  arbitrary = genExpr SCA.arbitrary

src/Text/Markdown/SlamDown/Syntax/Inline.purs

@@ -9,8 +9,6 @@ import Data.Eq (class Eq1)
 import Data.List as L
 import Data.Maybe as M
 import Data.Ord (class Ord1)
-import Test.StrongCheck.Arbitrary as SCA
-import Test.StrongCheck.Gen as Gen
 import Text.Markdown.SlamDown.Syntax.FormField (FormField)
 
 data Inline a
@@ -46,23 +44,6 @@ derive instance eq1Inline ∷ Eq1 Inline
 derive instance ordInline ∷ Ord a ⇒ Ord (Inline a)
 derive instance ord1Inline ∷ Ord1 Inline
 
--- | Nota bene: this does not generate any recursive structure
-instance arbitraryInline ∷ (SCA.Arbitrary a, Eq a) ⇒ SCA.Arbitrary (Inline a) where
-  arbitrary = do
-    k ← Gen.chooseInt 0 10
-    case k of
-      0 → Str <$> SCA.arbitrary
-      1 → Entity <$> SCA.arbitrary
-      2 → pure Space
-      3 → pure SoftBreak
-      4 → pure LineBreak
-      5 → Code <$> SCA.arbitrary <*> SCA.arbitrary
-      6 → FormField <$> SCA.arbitrary <*> SCA.arbitrary <*> SCA.arbitrary
-      7 → pure (Emph L.Nil)
-      8 → pure (Strong L.Nil)
-      9 → Link L.Nil <$> SCA.arbitrary
-      _ → Image L.Nil <$> SCA.arbitrary
-
 data LinkTarget
   = InlineLink String
   | ReferenceLink (M.Maybe String)
@@ -73,8 +54,3 @@ derive instance ordLinkTarget ∷ Ord LinkTarget
 instance showLinkTarget ∷ Show LinkTarget where
   show (InlineLink uri) = "(InlineLink " <> show uri <> ")"
   show (ReferenceLink tgt) = "(ReferenceLink " <> show tgt <> ")"
-
-instance arbitraryLinkTarget ∷ SCA.Arbitrary LinkTarget where
-  arbitrary = do
-    b ← SCA.arbitrary
-    if b then InlineLink <$> SCA.arbitrary else ReferenceLink <$> SCA.arbitrary

src/Text/Markdown/SlamDown/Syntax/TextBox.purs

@@ -14,10 +14,6 @@ import Data.Identity (Identity(..))
 import Data.Newtype (unwrap)
 import Data.Ord (class Ord1)
 
-import Test.StrongCheck.Arbitrary as SCA
-import Test.StrongCheck.Data.ArbDateTime as ADT
-import Test.StrongCheck.Gen as Gen
-
 data TimePrecision
   = Minutes
   | Seconds
@@ -29,16 +25,6 @@ instance showTimePrecision ∷ Show TimePrecision where
   show Minutes = "Minutes"
   show Seconds = "Seconds"
 
-instance arbitraryTimePrecision ∷ SCA.Arbitrary TimePrecision where
-  arbitrary =
-    Gen.chooseInt 0 1 <#> case _ of
-      0 → Minutes
-      _ → Seconds
-
-instance coarbitraryTimePrecision ∷ SCA.Coarbitrary TimePrecision where
-  coarbitrary Minutes = SCA.coarbitrary 1
-  coarbitrary Seconds = SCA.coarbitrary 2
-
 data TextBox f
   = PlainText (f String)
   | Numeric (f HN.HugeNum)
@@ -73,29 +59,5 @@ instance showTextBox ∷ (Show (f String), Show (f HN.HugeNum), Show (f DT.Time)
 derive instance eqTextBox ∷ Eq1 f ⇒ Eq (TextBox f)
 derive instance ordTextBox ∷ Ord1 f ⇒ Ord (TextBox f)
 
-instance arbitraryTextBox ∷ (Functor f, SCA.Arbitrary (f String), SCA.Arbitrary (f Number), SCA.Arbitrary (f ADT.ArbTime), SCA.Arbitrary (f ADT.ArbDate), SCA.Arbitrary (f ADT.ArbDateTime)) ⇒ SCA.Arbitrary (TextBox f) where
-  arbitrary = do
-    i ← Gen.chooseInt 0 5
-    case i of
-      0 → PlainText <$> SCA.arbitrary
-      1 → Numeric <<< map HN.fromNumber <$> SCA.arbitrary
-      2 → Date <<< map ADT.runArbDate <$> SCA.arbitrary
-      3 → Time <$> SCA.arbitrary <*> (map (eraseMillis <<< ADT.runArbTime) <$> SCA.arbitrary)
-      4 → DateTime <$> SCA.arbitrary <*> (map (DT.modifyTime eraseMillis <<< ADT.runArbDateTime) <$> SCA.arbitrary)
-      _ → PlainText <$> SCA.arbitrary
-
-instance coarbitraryTextBox ∷ (Functor f, SCA.Coarbitrary (f String), SCA.Coarbitrary (f Number), SCA.Coarbitrary (f ADT.ArbDate), SCA.Coarbitrary (f ADT.ArbTime), SCA.Coarbitrary (f ADT.ArbDateTime)) ⇒ SCA.Coarbitrary (TextBox f) where
-  coarbitrary =
-    case _ of
-      PlainText d -> SCA.coarbitrary d
-      Numeric d -> SCA.coarbitrary $ HN.toNumber <$> d
-      Date d -> SCA.coarbitrary (ADT.ArbDate <$> d)
-      Time prec d -> do
-        _ ← SCA.coarbitrary prec
-        SCA.coarbitrary (ADT.ArbTime <$> d)
-      DateTime prec d -> do
-        _ ← SCA.coarbitrary prec
-        SCA.coarbitrary (ADT.ArbDateTime <$> d)
-
 eraseMillis ∷ DT.Time → DT.Time
 eraseMillis (DT.Time h m s _) = DT.Time h m s bottom