aboutsummaryrefslogtreecommitdiffstats
path: root/progs/bench
diff options
context:
space:
mode:
authorGustav Sörnäs <gustav@sornas.net>2021-03-05 19:07:13 +0100
committerGustav Sörnäs <gustav@sornas.net>2021-03-05 19:07:13 +0100
commit2570830850c6dadadc2c86bf9d6f3203c9aba488 (patch)
treef6d00459337da26261c16e39cb4241be6441bfb4 /progs/bench
parent9d0a930d811b825b39ee16614e645b6934130cc1 (diff)
downloadsylt-2570830850c6dadadc2c86bf9d6f3203c9aba488.tar.gz
convert tests to files
Diffstat (limited to 'progs/bench')
-rw-r--r--progs/bench/fib.sy6
-rw-r--r--progs/bench/fib_iter.sy21
-rw-r--r--progs/bench/sum.sy13
3 files changed, 25 insertions, 15 deletions
diff --git a/progs/bench/fib.sy b/progs/bench/fib.sy
index de68f5c..76c3af7 100644
--- a/progs/bench/fib.sy
+++ b/progs/bench/fib.sy
@@ -7,4 +7,8 @@ fib :: fn a:int -> int {
ret fib(a - 1) + fib(a - 2)
}
// 23 is around where things start getting slow.
-fib(23) <=> 28657
+start :: fn {
+ //TODO pass arguments to skip debug printing. this test is very slow otherwise
+ <!>
+ // fib(23) <=> 28657
+}
diff --git a/progs/bench/fib_iter.sy b/progs/bench/fib_iter.sy
index c51469a..f82d6f8 100644
--- a/progs/bench/fib_iter.sy
+++ b/progs/bench/fib_iter.sy
@@ -1,14 +1,17 @@
// A Fibonacci implementation that is a little
// less awful. But we run it 1000 times instead.
-j := 0
-for , j < 1000, j = j + 1 {
- a := 0
- b := 1
+start :: fn {
+ <!>
+ j := 0
+ for , j < 1000, j = j + 1 {
+ a := 0
+ b := 1
- for i := 0, i < 50, i = i + 1 {
- c := a
- a = b
- b = c + b
+ for i := 0, i < 50, i = i + 1 {
+ c := a
+ a = b
+ b = c + b
+ }
+ a <=> 12586269025
}
- a <=> 12586269025
}
diff --git a/progs/bench/sum.sy b/progs/bench/sum.sy
index bb6870f..39252cd 100644
--- a/progs/bench/sum.sy
+++ b/progs/bench/sum.sy
@@ -1,6 +1,9 @@
-// Adds the numbers 0 to 10000
-sum := 0
-for i := 0, i <= 100000, i += 1 {
- sum += i
+// Adds the numbers 0 to 100000
+start :: fn {
+ <!>
+ sum := 0
+ for i := 0, i <= 100000, i += 1 {
+ sum += i
+ }
+ sum <=> 5000050000
}
-sum <=> 5000050000