Update benchmark numbers

These changes update the benchmark numbers and repeat counts in the
example files. The benchmark results have slightly varied, and these
updates reflect the most recent measurements.
This commit is contained in:
Michael Schimmel
2026-02-28 16:02:38 +01:00
parent 3f5d2620ec
commit 096f166153
26 changed files with 46 additions and 46 deletions
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 2.2us
;; Benchmark-Repeat: 935
;; Benchmark: 2.1us
;; Benchmark-Repeat: 993
;; Output: 120
(do
(def factorial (fn [n acc]
+2 -2
View File
@@ -1,6 +1,6 @@
;; Closure Scope Test
;; Benchmark: 374ns
;; Benchmark-Repeat: 5431
;; Benchmark: 391ns
;; Benchmark-Repeat: 5155
;; Output: 15
(do
(def make-adder (fn [x]
+2 -2
View File
@@ -1,4 +1,4 @@
;; Benchmark: 92ns
;; Benchmark-Repeat: 21633
;; Benchmark: 91ns
;; Benchmark-Repeat: 21799
;; Output: 5
(((fn [x] (fn [] x)) 5))
+1 -1
View File
@@ -1,5 +1,5 @@
;; Benchmark: 92ns
;; Benchmark-Repeat: 21729
;; Benchmark-Repeat: 21826
;; Output: 5
(do
(def f (fn [x] (fn [] x)))
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 91ns
;; Benchmark-Repeat: 21971
;; Benchmark: 93ns
;; Benchmark-Repeat: 21799
;; Output: 42
(do
(def f (fn [a] (fn [b] (fn [c] (+ a (+ b c))))))
+2 -2
View File
@@ -1,6 +1,6 @@
;; Complex Data Structure Test
;; Benchmark: 46.5us
;; Benchmark-Repeat: 44
;; Benchmark: 48.1us
;; Benchmark-Repeat: 43
;; Output: {:name "Fibonacci", :input 10, :output 55}
(do
(def fib (fn [n]
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 289ns
;; Benchmark-Repeat: 6962
;; Benchmark: 297ns
;; Benchmark-Repeat: 6735
;; examples/def_local_inlining.myc
;; Demonstrates potential for DefLocal-Inlining (Phase 2.5)
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 723ns
;; Benchmark-Repeat: 2781
;; Benchmark: 732ns
;; Benchmark-Repeat: 2711
;; Comprehensive Destructuring Test
;; Covers: Nested tuples, mixed params, dynamic passing
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 91ns
;; Benchmark-Repeat: 22134
;; Benchmark: 92ns
;; Benchmark-Repeat: 21750
;; Output: 36
(do
;; Excessive capture test
+2 -2
View File
@@ -1,6 +1,6 @@
;; Fibonacci Recursive
;; Benchmark: 45.9us
;; Benchmark-Repeat: 45
;; Benchmark: 47.6us
;; Benchmark-Repeat: 44
;; Output: 55
(do
(def fib (fn [n]
+1 -1
View File
@@ -1,4 +1,4 @@
;; Benchmark: 92ns
;; Benchmark-Repeat: 22073
;; Benchmark-Repeat: 21631
;; Output: 30
(+ 10 20)
+2 -2
View File
@@ -1,6 +1,6 @@
;; Higher-Order Function Example
;; Benchmark: 90ns
;; Benchmark-Repeat: 21671
;; Benchmark: 93ns
;; Benchmark-Repeat: 21559
;; Output: 25
(do
(def apply (fn [f x] (f x)))
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 352ns
;; Benchmark-Repeat: 5696
;; Benchmark: 93ns
;; Benchmark-Repeat: 21362
;; Financial DSL Macro example
;; Demonstrates generating complex records from simple parameters.
;; Output: {:price 100, :size 2, :total 200}
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 192ns
;; Benchmark-Repeat: 10538
;; Benchmark: 206ns
;; Benchmark-Repeat: 9658
;; Output: 5
(do
(def y 1)
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 154ns
;; Benchmark-Repeat: 12979
;; Benchmark: 162ns
;; Benchmark-Repeat: 12339
;; Nested Macro and Arithmetic example
;; Output: 81
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 201ns
;; Benchmark-Repeat: 9967
;; Benchmark: 200ns
;; Benchmark-Repeat: 9985
;; Macro Splicing example
;; Demonstrates unrolling a list into another list.
;; Output: [0 1 2 3 4]
+1 -1
View File
@@ -1,5 +1,5 @@
;; Benchmark: 92ns
;; Benchmark-Repeat: 21913
;; Benchmark-Repeat: 21825
;; Classic "unless" macro example
;; Demonstrates simple template substitution.
;; Output: 42
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 92ns
;; Benchmark-Repeat: 22026
;; Benchmark: 93ns
;; Benchmark-Repeat: 21646
(do
(macro wrap [f] `(fn [x] (~f x)))
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 91ns
;; Benchmark-Repeat: 22036
;; Benchmark: 92ns
;; Benchmark-Repeat: 21507
(do
(def area (fn [x] (* PI x)))
(area 10)
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 170ns
;; Benchmark-Repeat: 11959
;; Benchmark: 172ns
;; Benchmark-Repeat: 11766
(do
;; 1. Provokation Stack-Gap (bei Optimization Level 2)
(def result
+1 -1
View File
@@ -1,4 +1,4 @@
;; Benchmark: 1.3ms
;; Benchmark: 1.2ms
;; Benchmark-Repeat: 3
;; Tests the effect of record inlining and field lookup optimization
;; Output: 10000
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 3.2us
;; Benchmark-Repeat: 622
;; Benchmark: 1.9us
;; Benchmark-Repeat: 1211
;; Output: ["Alice" 101 :admin "Zürich" ["Alice" "Bob"] true]
; ---------------------------------------------------------
+1 -1
View File
@@ -2,7 +2,7 @@
;; heavily recursive, benefits significantly from specialization of integer arithmetic
;; and direct function calls (skipping dynamic dispatch).
;; Output: 5
;; Benchmark: 423.0us
;; Benchmark-Repeat: 6
+1 -1
View File
@@ -1,4 +1,4 @@
;; Benchmark: 2.4ms
;; Benchmark: 2.5ms
;; Output: "done"
(do
(def count_down (fn [n]
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 889ns
;; Benchmark-Repeat: 2282
;; Benchmark: 890ns
;; Benchmark-Repeat: 2258
(do
(def pipe (fn [conf]
(do
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 2.0us
;; Benchmark-Repeat: 1014
;; Benchmark: 1.7us
;; Benchmark-Repeat: 1209
;; Demonstration of N-dimensional Tuples, Vectors, and Matrices
;; Based on docs/Tupel 1.md
;;