@@ -2,9 +2,9 @@ module Benchmark.Main (main) where
2
2
3
3
import Prelude
4
4
5
- import Benchmark.Free326759a as Free326759a
5
+ import Benchmark.Freef686f5f as Freef686f5f
6
6
import Benchmark.Trampoline0df59c5 as Trampoline0df59c5
7
- import Benchmark.Trampoline326759a as Trampoline326759a
7
+ import Benchmark.Trampolinef686f5f as Trampolinef686f5f
8
8
import Benchotron.Core (Benchmark , benchFn , mkBenchmark )
9
9
import Benchotron.UI.Console (runSuite )
10
10
import Data.Foldable (foldl )
@@ -30,19 +30,19 @@ leftBindSmallBenchmark =
30
30
, inputsPerSize: inputsPerSize
31
31
, gen: \n -> vectorOf n (pure 0.0 )
32
32
, functions:
33
- [ benchFn " Free v5.2.0" (Trampoline326759a .runTrampoline <<< binds)
33
+ [ benchFn " Free v5.2.0" (Trampolinef686f5f .runTrampoline <<< binds)
34
34
, benchFn " Free v0.6.1" (Trampoline0df59c5 .runTrampoline <<< bindsT)
35
35
]
36
36
}
37
37
where
38
38
inputsPerSize :: Int
39
39
inputsPerSize = 100
40
40
41
- binds :: Array Number -> Trampoline326759a .Trampoline Number
41
+ binds :: Array Number -> Trampolinef686f5f .Trampoline Number
42
42
binds as = foldl (\b a -> b >>= const (gen a)) (gen 0.0 ) as
43
43
44
- gen :: forall a . a -> Trampoline326759a .Trampoline a
45
- gen = Free326759a .suspendF <<< Trampoline326759a .done
44
+ gen :: forall a . a -> Trampolinef686f5f .Trampoline a
45
+ gen = Freef686f5f .suspendF <<< Trampolinef686f5f .done
46
46
47
47
bindsT :: Array Number -> Trampoline0df59c5.Trampoline Number
48
48
bindsT as = foldl (\b a -> b >>= const (genT a)) (genT 0.0 ) as
@@ -60,19 +60,19 @@ rightBindSmallBenchmark =
60
60
, inputsPerSize: inputsPerSize
61
61
, gen: \n -> vectorOf n (pure 0.0 )
62
62
, functions:
63
- [ benchFn " Free v5.2.0" (Trampoline326759a .runTrampoline <<< binds)
63
+ [ benchFn " Free v5.2.0" (Trampolinef686f5f .runTrampoline <<< binds)
64
64
, benchFn " Free v0.6.1" (Trampoline0df59c5 .runTrampoline <<< bindsT)
65
65
]
66
66
}
67
67
where
68
68
inputsPerSize :: Int
69
69
inputsPerSize = 100
70
70
71
- binds :: Array Number -> Trampoline326759a .Trampoline Number
71
+ binds :: Array Number -> Trampolinef686f5f .Trampoline Number
72
72
binds as = foldl (\b a -> gen a >>= const b) (gen 0.0 ) as
73
73
74
- gen :: forall a . a -> Trampoline326759a .Trampoline a
75
- gen = Free326759a .suspendF <<< Trampoline326759a .done
74
+ gen :: forall a . a -> Trampolinef686f5f .Trampoline a
75
+ gen = Freef686f5f .suspendF <<< Trampolinef686f5f .done
76
76
77
77
bindsT :: Array Number -> Trampoline0df59c5.Trampoline Number
78
78
bindsT as = foldl (\b a -> genT a >>= const b) (genT 0.0 ) as
@@ -90,7 +90,7 @@ leftBindLargeBenchmark =
90
90
, inputsPerSize: inputsPerSize
91
91
, gen: \n -> vectorOf n (pure 0.0 )
92
92
, functions:
93
- [ benchFn " Free v5.2.0" (Trampoline326759a .runTrampoline <<< binds)
93
+ [ benchFn " Free v5.2.0" (Trampolinef686f5f .runTrampoline <<< binds)
94
94
-- Disabled due to stack overflow
95
95
-- , benchFn "Free v0.6.1" (Trampoline0df59c5.runTrampoline <<< bindsT)
96
96
]
@@ -99,11 +99,11 @@ leftBindLargeBenchmark =
99
99
inputsPerSize :: Int
100
100
inputsPerSize = 1
101
101
102
- binds :: Array Number -> Trampoline326759a .Trampoline Number
102
+ binds :: Array Number -> Trampolinef686f5f .Trampoline Number
103
103
binds as = foldl (\b a -> b >>= const (gen a)) (gen 0.0 ) as
104
104
105
- gen :: forall a . a -> Trampoline326759a .Trampoline a
106
- gen = Free326759a .suspendF <<< Trampoline326759a .done
105
+ gen :: forall a . a -> Trampolinef686f5f .Trampoline a
106
+ gen = Freef686f5f .suspendF <<< Trampolinef686f5f .done
107
107
108
108
bindsT :: Array Number -> Trampoline0df59c5.Trampoline Number
109
109
bindsT as = foldl (\b a -> b >>= const (genT a)) (genT 0.0 ) as
@@ -121,19 +121,19 @@ rightBindLargeBenchmark =
121
121
, inputsPerSize: inputsPerSize
122
122
, gen: \n -> vectorOf n (pure 0.0 )
123
123
, functions:
124
- [ benchFn " Free v5.2.0" (Trampoline326759a .runTrampoline <<< binds)
124
+ [ benchFn " Free v5.2.0" (Trampolinef686f5f .runTrampoline <<< binds)
125
125
, benchFn " Free v0.6.1" (Trampoline0df59c5 .runTrampoline <<< bindsT)
126
126
]
127
127
}
128
128
where
129
129
inputsPerSize :: Int
130
130
inputsPerSize = 1
131
131
132
- binds :: Array Number -> Trampoline326759a .Trampoline Number
132
+ binds :: Array Number -> Trampolinef686f5f .Trampoline Number
133
133
binds as = foldl (\b a -> gen a >>= const b) (gen 0.0 ) as
134
134
135
- gen :: forall a . a -> Trampoline326759a .Trampoline a
136
- gen = Free326759a .suspendF <<< Trampoline326759a .done
135
+ gen :: forall a . a -> Trampolinef686f5f .Trampoline a
136
+ gen = Freef686f5f .suspendF <<< Trampolinef686f5f .done
137
137
138
138
bindsT :: Array Number -> Trampoline0df59c5.Trampoline Number
139
139
bindsT as = foldl (\b a -> genT a >>= const b) (genT 0.0 ) as
0 commit comments