Michael Schimmel
0ed52a811d
This commit updates the benchmark metadata in several example files. The benchmark runs and repeat counts have been slightly adjusted due to optimizations or minor variations in execution.
18 lines
420 B
Plaintext
18 lines
420 B
Plaintext
;; Takeuchi Function Benchmark
|
|
;; heavily recursive, benefits significantly from specialization of integer arithmetic
|
|
;; and direct function calls (skipping dynamic dispatch).
|
|
;; Output: 5
|
|
|
|
;; Benchmark: 488.0us
|
|
;; Benchmark-Repeat: 5
|
|
|
|
(do
|
|
(def tak (fn [x y z]
|
|
(if (<= x y)
|
|
z
|
|
(tak (tak (- x 1) y z)
|
|
(tak (- y 1) z x)
|
|
(tak (- z 1) x y)))))
|
|
|
|
(tak 12 8 4)
|
|
)
|