From 2b0a09462ce1dfd7c9af46943573f6800a0b49b9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ion=20Gazta=C3=B1aga?= <igaztanaga@gmail.com>
Date: Wed, 22 Apr 2026 23:18:12 +0200
Subject: [PATCH] Put fastest, allocation only, tests first to avoid allocation
 pollution for subsequent tests

---
 experimental/bench_hub.cpp | 13 ++++++-------
 1 file changed, 6 insertions(+), 7 deletions(-)

diff --git a/experimental/bench_hub.cpp b/experimental/bench_hub.cpp
index 0eaf189..89fad32 100644
--- a/experimental/bench_hub.cpp
+++ b/experimental/bench_hub.cpp
@@ -476,19 +476,18 @@ int main(int argc,char* argv[])
       using den  = nest<element>;
 
       table t;
-
-      t.push_back(benchmark(
-         "creat, ins, erase, ins",
-         create<num>{}, create<den>{}));
-      t.push_back(benchmark(
-         "creat, ins, erase, ins, destroy",
-         create_and_destroy<num>{}, create_and_destroy<den>{}));
       t.push_back(benchmark(
          "for_each",
          for_each<num>{}, for_each<den>{}));
       t.push_back(benchmark(
          "visit_all",
          visit_all<num>{}, visit_all<den>{}));
+      t.push_back(benchmark(
+         "creat, ins, erase, ins",
+         create<num>{}, create<den>{}));
+      t.push_back(benchmark(
+         "creat, ins, erase, ins, destroy",
+         create_and_destroy<num>{}, create_and_destroy<den>{}));
       t.push_back(benchmark(
          "sort",
          sort<num>{}, sort<den>{}));