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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
{-# LANGUAGE RankNTypes #-}
module Math.NumberTheory.RecurrencesBench
( benchSuite
) where
import Test.Tasty.Bench
import Data.Euclidean (GcdDomain)
import Data.List.Infinite (Infinite(..))
import qualified Data.List.Infinite as Inf
import Math.NumberTheory.Recurrences
benchTriangle :: String -> (forall a. (GcdDomain a, Integral a) => Infinite [a]) -> Word -> Benchmark
benchTriangle name triangle n = bgroup name
[ benchAt (10 * n) (1 * fromIntegral n)
, benchAt (10 * n) (2 * fromIntegral n)
, benchAt (10 * n) (5 * fromIntegral n)
, benchAt (10 * n) (9 * fromIntegral n)
]
where
benchAt i j = bench ("!! " ++ show i ++ " !! " ++ show j)
$ nf (\(x, y) -> triangle Inf.!! x !! y :: Integer) (i, j)
benchPartition :: Word -> Benchmark
benchPartition n = bgroup "partition"
[ benchAt n
, benchAt (n * 10)
, benchAt (n * 100)
]
where
benchAt m = bench ("!!" ++ show m) $ nf (\k -> partition Inf.!! k :: Integer) m
benchSuite :: Benchmark
benchSuite = bgroup "Recurrences"
[ bgroup "Bilinear"
[ benchTriangle "binomial" binomial 100
, benchTriangle "stirling1" stirling1 100
, benchTriangle "stirling2" stirling2 100
, benchTriangle "eulerian1" eulerian1 100
, benchTriangle "eulerian2" eulerian2 100
]
, benchPartition 1000
, bgroup "factorialFactors"
[ bench "10000" $ nf factorialFactors 10000
, bench "20000" $ nf factorialFactors 20000
, bench "40000" $ nf factorialFactors 40000
]
]
|
