introduce internal lib "examples" and move test to "test-examples"

Author: tbagrel1

examples/Simple/Quicksort.hs

@@ -2,7 +2,7 @@
 {-# LANGUAGE NoImplicitPrelude #-}
 
 -- | This module implements quicksort with mutable arrays from linear-base
-module Simple.Quicksort (quickSort) where
+module Simple.Quicksort where
 
 import Data.Array.Mutable.Linear (Array)
 import qualified Data.Array.Mutable.Linear as Array

examples/Test/Generic.hs

@@ -145,6 +145,23 @@ library
         vector >=0.12.2,
         primitive
 
+library examples
+    import: build-opts
+    hs-source-dirs: examples
+    exposed-modules:
+        Foreign.List
+        Foreign.Heap
+        Simple.FileIO
+        Simple.Pure
+        Simple.Quicksort
+        Simple.TopSort
+    build-depends:
+        base,
+        linear-base,
+        storable-tuple,
+        vector,
+        text
+
 test-suite test
     import: build-opts
     import: rts-opts-multithread
@@ -158,6 +175,7 @@ test-suite test
         Test.Data.Mutable.HashMap
         Test.Data.Mutable.Set
         Test.Data.Polarized
+        Test.Data.Functor.Linear
         Test.Data.V
         Test.Data.Replicator
     default-language: Haskell2010
@@ -171,38 +189,28 @@ test-suite test
         tasty,
         tasty-hedgehog >= 1.2,
         mmorph,
-        vector
+        vector,
+        linear-generics
 
-test-suite examples
+test-suite test-examples
     import: build-opts
     import: rts-opts-multithread
     type:             exitcode-stdio-1.0
     main-is:          Main.hs
-    hs-source-dirs:   examples
+    hs-source-dirs:   test-examples
     other-modules:
         Test.Foreign
-        Test.Quicksort
-        Test.Generic
-        Foreign.List
-        Foreign.Heap
-        Simple.FileIO
-        Simple.Pure
-        Simple.Quicksort
-        Simple.TopSort
-        Generic.Traverse
+        Test.Simple.Quicksort
     default-language: Haskell2010
     build-depends:
         base,
         linear-base,
         tasty,
         tasty-hedgehog,
         hedgehog,
-        storable-tuple,
-        vector,
-        text,
-        linear-generics
+        examples
 
-benchmark mutable-data
+benchmark bench
     import: build-opts
     import: rts-opts-monothread
     type:             exitcode-stdio-1.0
@@ -224,4 +232,5 @@ benchmark mutable-data
         random-shuffle,
         tasty-bench >= 0.3,
         unordered-containers,
-        MonadRandom
+        MonadRandom,
+        examples

linear-base.cabal

@@ -1,8 +1,7 @@
 module Main where
 
 import Test.Foreign (foreignGCTests)
-import Test.Generic (genericTests)
-import Test.Quicksort (quickSortTests)
+import Test.Simple.Quicksort (quickSortTests)
 import Test.Tasty
 
 main :: IO ()
@@ -13,6 +12,5 @@ allTests =
   testGroup
     "All tests"
     [ foreignGCTests,
-      quickSortTests,
-      genericTests
+      quickSortTests
     ]

examples/Main.hs renamed to test-examples/Main.hs

@@ -1,6 +1,6 @@
 {-# LANGUAGE OverloadedStrings #-}
 
-module Test.Quicksort (quickSortTests) where
+module Test.Simple.Quicksort (quickSortTests) where
 
 import Data.List (sort)
 import Hedgehog

examples/Test/Foreign.hs renamed to test-examples/Test/Foreign.hs

@@ -9,6 +9,7 @@ import Test.Data.Mutable.HashMap (mutHMTests)
 import Test.Data.Mutable.Set (mutSetTests)
 import Test.Data.Mutable.Vector (mutVecTests)
 import Test.Data.Polarized (polarizedArrayTests)
+import Test.Data.Functor.Linear (genericTests)
 import Test.Data.Replicator (replicatorInspectionTests)
 import Test.Data.V (vInspectionTests)
 import Test.Tasty
@@ -27,7 +28,8 @@ allTests =
           mutHMTests,
           mutSetTests,
           destArrayTests,
-          polarizedArrayTests
+          polarizedArrayTests,
+          genericTests
         ],
       testGroup
         "Inspection tests"

examples/Test/Quicksort.hs renamed to test-examples/Test/Simple/Quicksort.hs

@@ -10,7 +10,7 @@
 {-# LANGUAGE TypeFamilies #-}
 {-# LANGUAGE NoImplicitPrelude #-}
 
-module Generic.Traverse (genericTraverseTests) where
+module Test.Data.Functor.Linear (genericTests) where
 
 import Data.Functor.Linear (genericTraverse)
 import qualified Data.Functor.Linear as Data
@@ -32,6 +32,13 @@ instance Data.Functor Pair where
 instance Data.Traversable Pair where
   traverse = genericTraverse
 
+genericTests :: TestTree
+genericTests =
+  testGroup
+    "Generic tests"
+    [ genericTraverseTests
+    ]
+
 genericTraverseTests :: TestTree
 genericTraverseTests =
   testGroup
@@ -50,3 +57,4 @@ propertyPairTest =
         (MkPair 3 4 :: Pair Int)
     )
       === (Sum 2, (MkPair 6 8))
+