1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
|
module Tests.Function ( tests ) where
import Statistics.Function
import Test.Tasty
import Test.Tasty.QuickCheck
import Test.QuickCheck
import Tests.Helpers
import qualified Data.Vector.Unboxed as U
tests :: TestTree
tests = testGroup "S.Function"
[ testProperty "Sort is sort" p_sort
, testAssertion "nextHighestPowerOfTwo is OK" p_nextHighestPowerOfTwo
]
p_sort :: [Double] -> Property
p_sort xs =
not (null xs) ==> U.all (uncurry (<=)) (U.zip v $ U.tail v)
where
v = sort $ U.fromList xs
p_nextHighestPowerOfTwo :: Bool
p_nextHighestPowerOfTwo
= all (\(good, is) -> all ((==good) . nextHighestPowerOfTwo) is) lists
where
pows = [1 .. 17 :: Int]
lists = [ (2^m, [2^n+1 .. 2^m]) | (n,m) <- pows `zip` tail pows ]
|
