Update benchmark metadata

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.

examples/closure.myc

@@ -1,6 +1,6 @@
 ;; Closure Scope Test
-;; Benchmark: 777ns
-;; Benchmark-Repeat: 2659
+;; Benchmark: 779ns
+;; Benchmark-Repeat: 2613
 ;; Output: 15
 (do
   (def make-adder (fn [x] 

examples/closure_cracking.myc

@@ -1,2 +1,4 @@
+;; Benchmark: 143ns
+;; Benchmark-Repeat: 14093
 ;; Output: 5
 (((fn [x] (fn [] x)) 5))

examples/closure_cracking_named.myc

@@ -1,3 +1,5 @@
+;; Benchmark: 620ns
+;; Benchmark-Repeat: 3234
 ;; Output: 5
 (do
     (def f (fn [x] (fn [] x)))

examples/currying.myc

@@ -1,3 +1,5 @@
+;; Benchmark: 1.1us
+;; Benchmark-Repeat: 1848
 ;; Output: 42
 (do
     (def f (fn [a] (fn [b] (fn [c] (+ a (+ b c))))))

examples/data.myc

@@ -1,5 +1,5 @@
 ;; Complex Data Structure Test
-;; Benchmark: 53.1us
+;; Benchmark: 53.6us
 ;; Benchmark-Repeat: 39
 ;; Output: {:name "Fibonacci", :input 10, :output 55}
 (do

examples/def_local_inlining.myc

@@ -1,3 +1,5 @@
+;; Benchmark: 363ns
+;; Benchmark-Repeat: 5561
 ;; examples/def_local_inlining.myc
 ;; Demonstrates potential for DefLocal-Inlining (Phase 2.5)
 

examples/destructuring.myc

@@ -1,5 +1,5 @@
-;; Benchmark: 2.3us
-;; Benchmark-Repeat: 880
+;; Benchmark: 2.4us
+;; Benchmark-Repeat: 848
 ;; Comprehensive Destructuring Test
 ;; Covers: Nested tuples, mixed params, dynamic passing
 

examples/extreme_capture.myc

@@ -1,5 +1,5 @@
-;; Benchmark: 1.7us
-;; Benchmark-Repeat: 1198
+;; Benchmark: 1.4us
+;; Benchmark-Repeat: 1448
 ;; Output: 36
 (do
   ;; Excessive capture test

examples/fib.myc

@@ -1,6 +1,6 @@
 ;; Fibonacci Recursive
-;; Benchmark: 52.5us
-;; Benchmark-Repeat: 38
+;; Benchmark: 53.7us
+;; Benchmark-Repeat: 39
 ;; Output: 55
 (do
   (def fib (fn [n]

examples/folding.myc

@@ -1,2 +1,4 @@
+;; Benchmark: 143ns
+;; Benchmark-Repeat: 14112
 ;; Output: 30
 (+ 10 20)

examples/hof.myc

@@ -1,6 +1,6 @@
 ;; Higher-Order Function Example
-;; Benchmark: 680ns
-;; Benchmark-Repeat: 2981
+;; Benchmark: 706ns
+;; Benchmark-Repeat: 2798
 ;; Output: 25
 (do
   (def apply (fn [f x] (f x)))

examples/macro_financial.myc

@@ -1,5 +1,5 @@
-;; Benchmark: 462ns
-;; Benchmark-Repeat: 4348
+;; Benchmark: 354ns
+;; Benchmark-Repeat: 5640
 ;; Financial DSL Macro example
 ;; Demonstrates generating complex records from simple parameters.
 ;; Output: {:price 100, :size 2, :total 200}

examples/macro_hygiene.myc

@@ -1,5 +1,5 @@
-;; Benchmark: 350ns
-;; Benchmark-Repeat: 5767
+;; Benchmark: 339ns
+;; Benchmark-Repeat: 6100
 ;; Output: 5
 (do
 (def y 1)

examples/macro_power.myc

@@ -1,5 +1,5 @@
-;; Benchmark: 376ns
-;; Benchmark-Repeat: 5359
+;; Benchmark: 217ns
+;; Benchmark-Repeat: 9500
 ;; Nested Macro and Arithmetic example
 ;; Output: 81
 

examples/macro_splice.myc

@@ -1,5 +1,5 @@
-;; Benchmark: 277ns
-;; Benchmark-Repeat: 7185
+;; Benchmark: 259ns
+;; Benchmark-Repeat: 7947
 ;; Macro Splicing example
 ;; Demonstrates unrolling a list into another list.
 ;; Output: [0 1 2 3 4]

examples/macro_unless.myc

@@ -1,5 +1,5 @@
-;; Benchmark: 177ns
-;; Benchmark-Repeat: 11587
+;; Benchmark: 146ns
+;; Benchmark-Repeat: 14044
 ;; Classic "unless" macro example
 ;; Demonstrates simple template substitution.
 ;; Output: 42

examples/optimizer_purity.myc

@@ -1,3 +1,5 @@
+;; Benchmark: 503ns
+;; Benchmark-Repeat: 3987
 (do
   (def PI 3.1415)
   (def area (fn [x] (* PI x)))

examples/record_to_tuple.myc

@@ -1,7 +1,7 @@
 ;; Record to Tuple Mapping Test
 ;; Output: 30
-;; Benchmark: 743ns
-;; Benchmark-Repeat: 2733
+;; Benchmark: 760ns
+;; Benchmark-Repeat: 2612
 (do
   (def rec {:x 10 :y 20})
   

examples/record_unpack.myc

@@ -2,8 +2,8 @@
 ;; This test calls a function that destructures a record
 ;; Current implementation is now zero-allocation for destructuring.
 ;; Output: 3
-;; Benchmark: 723ns
-;; Benchmark-Repeat: 2783
+;; Benchmark: 740ns
+;; Benchmark-Repeat: 2745
 
 (do
   (def process (fn [[x y]] 

examples/tak.myc

@@ -2,8 +2,8 @@
 ;; heavily recursive, benefits significantly from specialization of integer arithmetic
 ;; and direct function calls (skipping dynamic dispatch).
 ;; Output: 5
-
-;; Benchmark: 471.9us
+
+;; Benchmark: 488.0us
 ;; Benchmark-Repeat: 5
 
 (do

examples/tco_test.myc

@@ -1,4 +1,4 @@
-;; Benchmark: 2.7ms
+;; Benchmark: 2.9ms
 ;; Output: "done"
 (do
   (def count_down (fn [n]

examples/tuples.myc

@@ -1,5 +1,5 @@
 ;; Benchmark: 1.9us
-;; Benchmark-Repeat: 1061
+;; Benchmark-Repeat: 1043
 ;; Demonstration of N-dimensional Tuples, Vectors, and Matrices
 ;; Based on docs/Tupel 1.md
 ;;