From 0a6de0ae2af529fe04342caedd8cc6c273063011 Mon Sep 17 00:00:00 2001
From: Diogo Sousa <diogogsousa@gmail.com>
Date: Sun, 5 Nov 2023 18:13:00 +0000
Subject: [PATCH] Increase the limits of benchmarks.

They were running too fast to have reliable results.
---
 benches/rpds_hash_trie_map.rs           | 12 ++++++------
 benches/rpds_hash_trie_map_sync.rs      | 12 ++++++------
 benches/rpds_list.rs                    | 14 +++++++-------
 benches/rpds_list_sync.rs               | 14 +++++++-------
 benches/rpds_queue.rs                   | 10 +++++-----
 benches/rpds_queue_sync.rs              | 10 +++++-----
 benches/rpds_red_black_tree_map.rs      | 12 ++++++------
 benches/rpds_red_black_tree_map_sync.rs | 12 ++++++------
 benches/rpds_vector.rs                  | 12 ++++++------
 benches/rpds_vector_sync.rs             | 12 ++++++------
 benches/std_btree_map.rs                |  8 ++++----
 benches/std_hash_map.rs                 |  8 ++++----
 benches/std_linked_list.rs              | 10 +++++-----
 benches/std_vec.rs                      | 10 +++++-----
 benches/std_vec_deque.rs                |  6 +++---
 15 files changed, 81 insertions(+), 81 deletions(-)

diff --git a/benches/rpds_hash_trie_map.rs b/benches/rpds_hash_trie_map.rs
index d9d69f5..e7a7886 100644
--- a/benches/rpds_hash_trie_map.rs
+++ b/benches/rpds_hash_trie_map.rs
@@ -10,7 +10,7 @@ use rpds::HashTrieMap;
 use std::hint::black_box;
 
 fn rpds_hash_trie_map_insert(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds hash trie map insert", move |b| {
         b.iter(|| {
@@ -26,7 +26,7 @@ fn rpds_hash_trie_map_insert(c: &mut Criterion) {
 }
 
 fn rpds_hash_trie_map_insert_mut(c: &mut Criterion) {
-    let limit = 5_000;
+    let limit = 50_000;
 
     c.bench_function("rpds hash trie map insert mut", move |b| {
         b.iter(|| {
@@ -42,7 +42,7 @@ fn rpds_hash_trie_map_insert_mut(c: &mut Criterion) {
 }
 
 fn rpds_hash_trie_map_remove(c: &mut Criterion) {
-    let limit = 5_000;
+    let limit = 50_000;
 
     c.bench_function("rpds hash trie map remove", move |b| {
         b.iter_with_setup(
@@ -67,7 +67,7 @@ fn rpds_hash_trie_map_remove(c: &mut Criterion) {
 }
 
 fn rpds_hash_trie_map_remove_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds hash trie map remove mut", move |b| {
         b.iter_with_setup(
@@ -92,7 +92,7 @@ fn rpds_hash_trie_map_remove_mut(c: &mut Criterion) {
 }
 
 fn rpds_hash_trie_map_get(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut map = HashTrieMap::new();
 
     for i in 0..limit {
@@ -109,7 +109,7 @@ fn rpds_hash_trie_map_get(c: &mut Criterion) {
 }
 
 fn rpds_hash_trie_map_iterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut map = HashTrieMap::new();
 
     for i in 0..limit {
diff --git a/benches/rpds_hash_trie_map_sync.rs b/benches/rpds_hash_trie_map_sync.rs
index 359aac7..4619654 100644
--- a/benches/rpds_hash_trie_map_sync.rs
+++ b/benches/rpds_hash_trie_map_sync.rs
@@ -10,7 +10,7 @@ use rpds::HashTrieMapSync;
 use std::hint::black_box;
 
 fn rpds_hash_trie_map_sync_insert(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds hash trie map sync insert", move |b| {
         b.iter(|| {
@@ -26,7 +26,7 @@ fn rpds_hash_trie_map_sync_insert(c: &mut Criterion) {
 }
 
 fn rpds_hash_trie_map_sync_insert_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds hash trie map sync insert mut", move |b| {
         b.iter(|| {
@@ -42,7 +42,7 @@ fn rpds_hash_trie_map_sync_insert_mut(c: &mut Criterion) {
 }
 
 fn rpds_hash_trie_map_sync_remove(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds hash trie map sync remove", move |b| {
         b.iter_with_setup(
@@ -67,7 +67,7 @@ fn rpds_hash_trie_map_sync_remove(c: &mut Criterion) {
 }
 
 fn rpds_hash_trie_map_sync_remove_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds hash trie map sync remove mut", move |b| {
         b.iter_with_setup(
@@ -92,7 +92,7 @@ fn rpds_hash_trie_map_sync_remove_mut(c: &mut Criterion) {
 }
 
 fn rpds_hash_trie_map_sync_get(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut map = HashTrieMapSync::new_sync();
 
     for i in 0..limit {
@@ -109,7 +109,7 @@ fn rpds_hash_trie_map_sync_get(c: &mut Criterion) {
 }
 
 fn rpds_hash_trie_map_sync_iterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 1_000_000;
     let mut map = HashTrieMapSync::new_sync();
 
     for i in 0..limit {
diff --git a/benches/rpds_list.rs b/benches/rpds_list.rs
index 0ebd4aa..24cf074 100644
--- a/benches/rpds_list.rs
+++ b/benches/rpds_list.rs
@@ -10,7 +10,7 @@ use rpds::List;
 use std::hint::black_box;
 
 fn rpds_list_push_front(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds list push front", move |b| {
         b.iter(|| {
@@ -26,7 +26,7 @@ fn rpds_list_push_front(c: &mut Criterion) {
 }
 
 fn rpds_list_push_front_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds list push front mut", move |b| {
         b.iter(|| {
@@ -42,7 +42,7 @@ fn rpds_list_push_front_mut(c: &mut Criterion) {
 }
 
 fn rpds_list_drop_first(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds list drop first", move |b| {
         b.iter_with_setup(
@@ -67,7 +67,7 @@ fn rpds_list_drop_first(c: &mut Criterion) {
 }
 
 fn rpds_list_drop_first_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds list drop first mut", move |b| {
         b.iter_with_setup(
@@ -92,7 +92,7 @@ fn rpds_list_drop_first_mut(c: &mut Criterion) {
 }
 
 fn rpds_list_reverse(c: &mut Criterion) {
-    let limit = 1_000;
+    let limit = 10_000;
 
     c.bench_function("rpds list reverse", move |b| {
         b.iter_with_setup(
@@ -117,7 +117,7 @@ fn rpds_list_reverse(c: &mut Criterion) {
 }
 
 fn rpds_list_reverse_mut(c: &mut Criterion) {
-    let limit = 1_000;
+    let limit = 10_000;
 
     c.bench_function("rpds list reverse mut", move |b| {
         b.iter_with_setup(
@@ -142,7 +142,7 @@ fn rpds_list_reverse_mut(c: &mut Criterion) {
 }
 
 fn rpds_list_iterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut list = List::new();
 
     for i in 0..limit {
diff --git a/benches/rpds_list_sync.rs b/benches/rpds_list_sync.rs
index 1a8dba1..30335cb 100644
--- a/benches/rpds_list_sync.rs
+++ b/benches/rpds_list_sync.rs
@@ -10,7 +10,7 @@ use rpds::ListSync;
 use std::hint::black_box;
 
 fn rpds_list_sync_push_front(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds list sync push front", move |b| {
         b.iter(|| {
@@ -26,7 +26,7 @@ fn rpds_list_sync_push_front(c: &mut Criterion) {
 }
 
 fn rpds_list_sync_push_front_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds list sync push front mut", move |b| {
         b.iter(|| {
@@ -42,7 +42,7 @@ fn rpds_list_sync_push_front_mut(c: &mut Criterion) {
 }
 
 fn rpds_list_sync_drop_first(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds list sync drop first", move |b| {
         b.iter_with_setup(
@@ -67,7 +67,7 @@ fn rpds_list_sync_drop_first(c: &mut Criterion) {
 }
 
 fn rpds_list_sync_drop_first_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds list sync drop first mut", move |b| {
         b.iter_with_setup(
@@ -92,7 +92,7 @@ fn rpds_list_sync_drop_first_mut(c: &mut Criterion) {
 }
 
 fn rpds_list_sync_reverse(c: &mut Criterion) {
-    let limit = 1_000;
+    let limit = 2_000;
 
     c.bench_function("rpds list sync reverse", move |b| {
         b.iter_with_setup(
@@ -117,7 +117,7 @@ fn rpds_list_sync_reverse(c: &mut Criterion) {
 }
 
 fn rpds_list_sync_reverse_mut(c: &mut Criterion) {
-    let limit = 1_000;
+    let limit = 2_000;
 
     c.bench_function("rpds list sync reverse mut", move |b| {
         b.iter_with_setup(
@@ -142,7 +142,7 @@ fn rpds_list_sync_reverse_mut(c: &mut Criterion) {
 }
 
 fn rpds_list_sync_iterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 1_000_000;
     let mut list: ListSync<usize> = ListSync::new_sync();
 
     for i in 0..limit {
diff --git a/benches/rpds_queue.rs b/benches/rpds_queue.rs
index 1aafea9..d598c4d 100644
--- a/benches/rpds_queue.rs
+++ b/benches/rpds_queue.rs
@@ -10,7 +10,7 @@ use rpds::Queue;
 use std::hint::black_box;
 
 fn rpds_queue_enqueue(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds queue enqueue", move |b| {
         b.iter(|| {
@@ -26,7 +26,7 @@ fn rpds_queue_enqueue(c: &mut Criterion) {
 }
 
 fn rpds_queue_enqueue_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds queue enqueue mut", move |b| {
         b.iter(|| {
@@ -42,7 +42,7 @@ fn rpds_queue_enqueue_mut(c: &mut Criterion) {
 }
 
 fn rpds_queue_dequeue(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds queue dequeue", move |b| {
         b.iter_with_setup(
@@ -67,7 +67,7 @@ fn rpds_queue_dequeue(c: &mut Criterion) {
 }
 
 fn rpds_queue_dequeue_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds queue dequeue mut", move |b| {
         b.iter_with_setup(
@@ -92,7 +92,7 @@ fn rpds_queue_dequeue_mut(c: &mut Criterion) {
 }
 
 fn rpds_queue_iterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut queue: Queue<usize> = Queue::new();
 
     for i in 0..limit {
diff --git a/benches/rpds_queue_sync.rs b/benches/rpds_queue_sync.rs
index 9c6cd2a..a286681 100644
--- a/benches/rpds_queue_sync.rs
+++ b/benches/rpds_queue_sync.rs
@@ -10,7 +10,7 @@ use rpds::QueueSync;
 use std::hint::black_box;
 
 fn rpds_queue_sync_enqueue(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds queue sync enqueue", move |b| {
         b.iter(|| {
@@ -26,7 +26,7 @@ fn rpds_queue_sync_enqueue(c: &mut Criterion) {
 }
 
 fn rpds_queue_sync_enqueue_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds queue sync enqueue mut", move |b| {
         b.iter(|| {
@@ -42,7 +42,7 @@ fn rpds_queue_sync_enqueue_mut(c: &mut Criterion) {
 }
 
 fn rpds_queue_sync_dequeue(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds queue sync dequeue", move |b| {
         b.iter_with_setup(
@@ -67,7 +67,7 @@ fn rpds_queue_sync_dequeue(c: &mut Criterion) {
 }
 
 fn rpds_queue_sync_dequeue_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds queue sync dequeue mut", move |b| {
         b.iter_with_setup(
@@ -92,7 +92,7 @@ fn rpds_queue_sync_dequeue_mut(c: &mut Criterion) {
 }
 
 fn rpds_queue_sync_iterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 1_000_000;
     let mut queue: QueueSync<usize> = QueueSync::new_sync();
 
     for i in 0..limit {
diff --git a/benches/rpds_red_black_tree_map.rs b/benches/rpds_red_black_tree_map.rs
index 35d5442..71665f6 100644
--- a/benches/rpds_red_black_tree_map.rs
+++ b/benches/rpds_red_black_tree_map.rs
@@ -10,7 +10,7 @@ use rpds::RedBlackTreeMap;
 use std::hint::black_box;
 
 fn rpds_red_black_tree_map_insert(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds red black tree map insert", move |b| {
         b.iter(|| {
@@ -26,7 +26,7 @@ fn rpds_red_black_tree_map_insert(c: &mut Criterion) {
 }
 
 fn rpds_red_black_tree_map_insert_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds red black tree map insert mut", move |b| {
         b.iter(|| {
@@ -42,7 +42,7 @@ fn rpds_red_black_tree_map_insert_mut(c: &mut Criterion) {
 }
 
 fn rpds_red_black_tree_map_remove(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds red black tree map remove", move |b| {
         b.iter_with_setup(
@@ -67,7 +67,7 @@ fn rpds_red_black_tree_map_remove(c: &mut Criterion) {
 }
 
 fn rpds_red_black_tree_map_remove_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds red black tree map remove mut", move |b| {
         b.iter_with_setup(
@@ -92,7 +92,7 @@ fn rpds_red_black_tree_map_remove_mut(c: &mut Criterion) {
 }
 
 fn rpds_red_black_tree_map_get(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut map = RedBlackTreeMap::new();
 
     for i in 0..limit {
@@ -109,7 +109,7 @@ fn rpds_red_black_tree_map_get(c: &mut Criterion) {
 }
 
 fn rpds_red_black_tree_map_iterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut map = RedBlackTreeMap::new();
 
     for i in 0..limit {
diff --git a/benches/rpds_red_black_tree_map_sync.rs b/benches/rpds_red_black_tree_map_sync.rs
index 825a30a..8d09290 100644
--- a/benches/rpds_red_black_tree_map_sync.rs
+++ b/benches/rpds_red_black_tree_map_sync.rs
@@ -10,7 +10,7 @@ use rpds::RedBlackTreeMapSync;
 use std::hint::black_box;
 
 fn rpds_red_black_tree_map_sync_insert(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds red black tree map sync insert", move |b| {
         b.iter(|| {
@@ -26,7 +26,7 @@ fn rpds_red_black_tree_map_sync_insert(c: &mut Criterion) {
 }
 
 fn rpds_red_black_tree_map_sync_insert_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds red black tree map sync insert mut", move |b| {
         b.iter(|| {
@@ -42,7 +42,7 @@ fn rpds_red_black_tree_map_sync_insert_mut(c: &mut Criterion) {
 }
 
 fn rpds_red_black_tree_map_sync_remove(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds red black tree map sync remove", move |b| {
         b.iter_with_setup(
@@ -67,7 +67,7 @@ fn rpds_red_black_tree_map_sync_remove(c: &mut Criterion) {
 }
 
 fn rpds_red_black_tree_map_sync_remove_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds red black tree map sync remove mut", move |b| {
         b.iter_with_setup(
@@ -92,7 +92,7 @@ fn rpds_red_black_tree_map_sync_remove_mut(c: &mut Criterion) {
 }
 
 fn rpds_red_black_tree_map_sync_get(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut map = RedBlackTreeMapSync::new_sync();
 
     for i in 0..limit {
@@ -109,7 +109,7 @@ fn rpds_red_black_tree_map_sync_get(c: &mut Criterion) {
 }
 
 fn rpds_red_black_tree_map_sync_iterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 1_000_000;
     let mut map = RedBlackTreeMapSync::new_sync();
 
     for i in 0..limit {
diff --git a/benches/rpds_vector.rs b/benches/rpds_vector.rs
index b3e1607..bc65384 100644
--- a/benches/rpds_vector.rs
+++ b/benches/rpds_vector.rs
@@ -10,7 +10,7 @@ use rpds::Vector;
 use std::hint::black_box;
 
 fn rpds_vector_push_back(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds vector push back", move |b| {
         b.iter(|| {
@@ -26,7 +26,7 @@ fn rpds_vector_push_back(c: &mut Criterion) {
 }
 
 fn rpds_vector_push_back_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds vector push back mut", move |b| {
         b.iter(|| {
@@ -42,7 +42,7 @@ fn rpds_vector_push_back_mut(c: &mut Criterion) {
 }
 
 fn rpds_vector_drop_last(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds vector drop last", move |b| {
         b.iter_with_setup(
@@ -67,7 +67,7 @@ fn rpds_vector_drop_last(c: &mut Criterion) {
 }
 
 fn rpds_vector_drop_last_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds vector drop last mut", move |b| {
         b.iter_with_setup(
@@ -92,7 +92,7 @@ fn rpds_vector_drop_last_mut(c: &mut Criterion) {
 }
 
 fn rpds_vector_get(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut vector: Vector<usize> = Vector::new();
 
     for i in 0..limit {
@@ -109,7 +109,7 @@ fn rpds_vector_get(c: &mut Criterion) {
 }
 
 fn rpds_vector_iterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut vector: Vector<usize> = Vector::new();
 
     for i in 0..limit {
diff --git a/benches/rpds_vector_sync.rs b/benches/rpds_vector_sync.rs
index 5667ea3..07b227d 100644
--- a/benches/rpds_vector_sync.rs
+++ b/benches/rpds_vector_sync.rs
@@ -10,7 +10,7 @@ use rpds::VectorSync;
 use std::hint::black_box;
 
 fn rpds_vector_syncpush_back(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds vector sync push back", move |b| {
         b.iter(|| {
@@ -26,7 +26,7 @@ fn rpds_vector_syncpush_back(c: &mut Criterion) {
 }
 
 fn rpds_vector_syncpush_back_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds vector sync push back mut", move |b| {
         b.iter(|| {
@@ -42,7 +42,7 @@ fn rpds_vector_syncpush_back_mut(c: &mut Criterion) {
 }
 
 fn rpds_vector_syncdrop_last(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds vector sync drop last", move |b| {
         b.iter_with_setup(
@@ -67,7 +67,7 @@ fn rpds_vector_syncdrop_last(c: &mut Criterion) {
 }
 
 fn rpds_vector_syncdrop_last_mut(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("rpds vector sync drop last mut", move |b| {
         b.iter_with_setup(
@@ -92,7 +92,7 @@ fn rpds_vector_syncdrop_last_mut(c: &mut Criterion) {
 }
 
 fn rpds_vector_syncget(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 1_000_000;
     let mut vector: VectorSync<usize> = VectorSync::new_sync();
 
     for i in 0..limit {
@@ -109,7 +109,7 @@ fn rpds_vector_syncget(c: &mut Criterion) {
 }
 
 fn rpds_vector_synciterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 1_000_000;
     let mut vector: VectorSync<usize> = VectorSync::new_sync();
 
     for i in 0..limit {
diff --git a/benches/std_btree_map.rs b/benches/std_btree_map.rs
index eb71fdb..4c3c3b3 100644
--- a/benches/std_btree_map.rs
+++ b/benches/std_btree_map.rs
@@ -10,7 +10,7 @@ use std::collections::BTreeMap;
 use std::hint::black_box;
 
 fn std_btree_map_insert(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("std b-tree map insert", move |b| {
         b.iter(|| {
@@ -26,7 +26,7 @@ fn std_btree_map_insert(c: &mut Criterion) {
 }
 
 fn std_btree_map_remove(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("std btree map remove", move |b| {
         b.iter_with_setup(
@@ -51,7 +51,7 @@ fn std_btree_map_remove(c: &mut Criterion) {
 }
 
 fn std_btree_map_get(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut map: BTreeMap<usize, isize> = BTreeMap::new();
 
     for i in 0..limit {
@@ -68,7 +68,7 @@ fn std_btree_map_get(c: &mut Criterion) {
 }
 
 fn std_btree_map_iterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut map: BTreeMap<usize, isize> = BTreeMap::new();
 
     for i in 0..limit {
diff --git a/benches/std_hash_map.rs b/benches/std_hash_map.rs
index 05d6682..e55edf8 100644
--- a/benches/std_hash_map.rs
+++ b/benches/std_hash_map.rs
@@ -10,7 +10,7 @@ use std::collections::HashMap;
 use std::hint::black_box;
 
 fn std_hash_map_insert(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("std hash map insert", move |b| {
         b.iter(|| {
@@ -26,7 +26,7 @@ fn std_hash_map_insert(c: &mut Criterion) {
 }
 
 fn std_hash_map_remove(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("std hash map remove", move |b| {
         b.iter_with_setup(
@@ -51,7 +51,7 @@ fn std_hash_map_remove(c: &mut Criterion) {
 }
 
 fn std_hash_map_get(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut map: HashMap<usize, isize> = HashMap::new();
 
     for i in 0..limit {
@@ -68,7 +68,7 @@ fn std_hash_map_get(c: &mut Criterion) {
 }
 
 fn std_hash_map_iterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut map: HashMap<usize, isize> = HashMap::new();
 
     for i in 0..limit {
diff --git a/benches/std_linked_list.rs b/benches/std_linked_list.rs
index aa03a6b..3901b30 100644
--- a/benches/std_linked_list.rs
+++ b/benches/std_linked_list.rs
@@ -10,7 +10,7 @@ use std::collections::LinkedList;
 use std::hint::black_box;
 
 fn std_linked_list_push_front(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("std linked list push front", move |b| {
         b.iter(|| {
@@ -26,7 +26,7 @@ fn std_linked_list_push_front(c: &mut Criterion) {
 }
 
 fn std_linked_list_push_back(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("std linked list push back", move |b| {
         b.iter(|| {
@@ -42,7 +42,7 @@ fn std_linked_list_push_back(c: &mut Criterion) {
 }
 
 fn std_linked_list_pop_front(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("std linked list pop front", move |b| {
         b.iter_with_setup(
@@ -67,7 +67,7 @@ fn std_linked_list_pop_front(c: &mut Criterion) {
 }
 
 fn std_linked_list_pop_back(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("std linked list pop back", move |b| {
         b.iter_with_setup(
@@ -92,7 +92,7 @@ fn std_linked_list_pop_back(c: &mut Criterion) {
 }
 
 fn std_linked_list_iterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut linked_list: LinkedList<usize> = LinkedList::new();
 
     for i in 0..limit {
diff --git a/benches/std_vec.rs b/benches/std_vec.rs
index 9052010..c0fe976 100644
--- a/benches/std_vec.rs
+++ b/benches/std_vec.rs
@@ -9,7 +9,7 @@ use criterion::{criterion_group, criterion_main, Criterion};
 use std::hint::black_box;
 
 fn std_vec_push(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("std vec push", move |b| {
         b.iter(|| {
@@ -25,7 +25,7 @@ fn std_vec_push(c: &mut Criterion) {
 }
 
 fn std_vec_pop(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("std vec pop", move |b| {
         b.iter_with_setup(
@@ -50,7 +50,7 @@ fn std_vec_pop(c: &mut Criterion) {
 }
 
 fn std_vec_reverse(c: &mut Criterion) {
-    let limit = 1_000;
+    let limit = 10_000;
 
     c.bench_function("std vec reverse", move |b| {
         b.iter_with_setup(
@@ -75,7 +75,7 @@ fn std_vec_reverse(c: &mut Criterion) {
 }
 
 fn std_vec_get(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut vector: Vec<usize> = Vec::new();
 
     for i in 0..limit {
@@ -92,7 +92,7 @@ fn std_vec_get(c: &mut Criterion) {
 }
 
 fn std_vec_iterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut vector: Vec<usize> = Vec::new();
 
     for i in 0..limit {
diff --git a/benches/std_vec_deque.rs b/benches/std_vec_deque.rs
index d05bfab..1333fa6 100644
--- a/benches/std_vec_deque.rs
+++ b/benches/std_vec_deque.rs
@@ -10,7 +10,7 @@ use std::collections::VecDeque;
 use std::hint::black_box;
 
 fn std_vec_dequeue_push_back(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("std vec dequeue push back", move |b| {
         b.iter(|| {
@@ -26,7 +26,7 @@ fn std_vec_dequeue_push_back(c: &mut Criterion) {
 }
 
 fn std_vec_dequeue_pop_front(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
 
     c.bench_function("std vec dequeue pop front", move |b| {
         b.iter_with_setup(
@@ -51,7 +51,7 @@ fn std_vec_dequeue_pop_front(c: &mut Criterion) {
 }
 
 fn std_vec_dequeue_iterate(c: &mut Criterion) {
-    let limit = 10_000;
+    let limit = 100_000;
     let mut deque: VecDeque<usize> = VecDeque::new();
 
     for i in 0..limit {