From 18a4b277fc7814f1ce1da757971c013cbc36fe3a Mon Sep 17 00:00:00 2001
From: Sebastian Ullrich <sebasti@nullri.ch>
Date: Wed, 12 Oct 2022 20:22:55 +0200
Subject: [PATCH] test: more fair qsort.ml benchmark

---
 tests/bench/qsort.ml    | 6 +++---
 tests/bench/qsort.swift | 2 +-
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/tests/bench/qsort.ml b/tests/bench/qsort.ml
index 97f07c92b8..fe0e2dd2dd 100644
--- a/tests/bench/qsort.ml
+++ b/tests/bench/qsort.ml
@@ -1,6 +1,6 @@
-type elem = int32
+type elem = int  (* pointer-tagged like in Lean, int32 would be actually boxed *)
 
-let badRand (seed : elem) : elem = Int32.add (Int32.mul seed 1664525l) 1013904223l
+let badRand (seed : elem) : elem = seed * 1664525 + 1013904223
 
 let mkRandomArray (seed : elem) n =
   let s = ref seed in
@@ -56,7 +56,7 @@ let qsort arr =
 let main n =
   for _ = 0 to n-1 do
     for i = 0 to n-1 do
-      let xs = mkRandomArray (Int32.of_int i) i in
+      let xs = mkRandomArray i i in
       qsort xs;
       checkSortedAux xs 0
     done
diff --git a/tests/bench/qsort.swift b/tests/bench/qsort.swift
index eeace0c564..433fc297e5 100644
--- a/tests/bench/qsort.swift
+++ b/tests/bench/qsort.swift
@@ -60,7 +60,7 @@ func qsortAux(_ a: inout Array<Elem>, _ low: Int, _ high: Int) {
 }
 
 func qsort(_ a: inout Array<Elem>) {
-  qsortAux(&a, 0, a.count - 1)
+    qsortAux(&a, 0, a.count - 1)
 }