Refactor tests: try to improve dev compile time

[NicolasDP]

Testing has been a bit long so far:

Before:

stack test 128.66s user 5.99s system 94% cpu 2:21.96 total

After:

stack test 85.86s user 5.30s system 97% cpu 1:33.84 total

Also, contributors will find that, when working on a specific test, it will be a bit faster as well to generate the test.

I have also added a couple of test of the Number type class, mainly to validate the property specified in the documentation (associativity of the Additive...)

[NicolasDP]

The added tests are:

  Additive
    a + azero == a:                                       OK
      +++ OK, passed 100 tests.
    azero + a == a:                                       OK
      +++ OK, passed 100 tests.
    a + b == b + a:                                       OK
      +++ OK, passed 100 tests.
  Multiplicative
    a * midentity == a:                                   OK
      +++ OK, passed 100 tests.
    midentity * a == a:                                   OK
      +++ OK, passed 100 tests.
  Divisible
    (x `div` y) * y + (x `mod` y) == x:                   OK
      +++ OK, passed 100 tests.

[adinapoli]

Just throwing some brain dump here: what would also be useful is a QC property on a collection which would ensure that forall arbitrary $ \(lst :: [ty) -> lst == toList (fromList lst) 😉

[NicolasDP]

@adinapoli you mean like this one:

  Bitmap
    ...
    IsList
      fromList . toList == id:                                OK
        +++ OK, passed 100 tests.

I have also re-order few tests

[adinapoli]

Yes, exactly like that! (Sorry, I missed that property while reading the
source) ;)

On 3 Sep 2016 11:20 p.m., "Nicolas DI PRIMA" [email protected]
wrote:

Merged #107 #107.

—
You are receiving this because you were mentioned.
Reply to this email directly, view it on GitHub
#107 (comment),
or mute the thread
https://github.com/notifications/unsubscribe-auth/AAa-s8SvUDY-2kHhb3oS-4mLxLs5MfiYks5qmeS4gaJpZM4J0TqK
.