Run rustfmt

benches/rpds_hash_trie_map.rs

@@ -11,10 +11,10 @@ extern crate rpds;
 
 mod utils;
 
+use bencher::{black_box, Bencher};
 use rpds::HashTrieMap;
 use utils::BencherNoDrop;
 use utils::iterations;
-use bencher::{Bencher, black_box};
 
 fn hash_trie_map_insert(bench: &mut Bencher) -> () {
     let limit = iterations(100_000);
@@ -81,6 +81,9 @@ fn hash_trie_map_iterate(bench: &mut Bencher) -> () {
 
 benchmark_group!(
     benches,
-    hash_trie_map_insert, hash_trie_map_remove, hash_trie_map_get, hash_trie_map_iterate
+    hash_trie_map_insert,
+    hash_trie_map_remove,
+    hash_trie_map_get,
+    hash_trie_map_iterate
 );
 benchmark_main!(benches);

benches/rpds_list.rs

@@ -11,10 +11,10 @@ extern crate rpds;
 
 mod utils;
 
+use bencher::{black_box, Bencher};
 use rpds::List;
 use utils::BencherNoDrop;
 use utils::iterations;
-use bencher::{Bencher, black_box};
 
 fn list_push_front(bench: &mut Bencher) -> () {
     let limit = iterations(100_000);

benches/rpds_red_black_tree_map.rs

@@ -11,10 +11,10 @@ extern crate rpds;
 
 mod utils;
 
+use bencher::{black_box, Bencher};
 use rpds::RedBlackTreeMap;
 use utils::BencherNoDrop;
 use utils::iterations;
-use bencher::{Bencher, black_box};
 
 fn red_black_tree_map_insert(bench: &mut Bencher) -> () {
     let limit = iterations(100_000);
@@ -81,6 +81,9 @@ fn red_black_tree_map_iterate(bench: &mut Bencher) -> () {
 
 benchmark_group!(
     benches,
-    red_black_tree_map_insert, red_black_tree_map_remove, red_black_tree_map_get, red_black_tree_map_iterate
+    red_black_tree_map_insert,
+    red_black_tree_map_remove,
+    red_black_tree_map_get,
+    red_black_tree_map_iterate
 );
 benchmark_main!(benches);

benches/rpds_vector.rs

@@ -11,10 +11,10 @@ extern crate rpds;
 
 mod utils;
 
+use bencher::{black_box, Bencher};
 use rpds::Vector;
 use utils::BencherNoDrop;
 use utils::iterations;
-use bencher::{black_box, Bencher};
 
 fn vector_push_back(bench: &mut Bencher) -> () {
     let limit = iterations(100_000);

benches/rust_btreemap.rs

@@ -10,10 +10,10 @@ extern crate bencher;
 
 mod utils;
 
+use bencher::{black_box, Bencher};
 use std::collections::BTreeMap;
 use utils::BencherNoDrop;
 use utils::iterations;
-use bencher::{Bencher, black_box};
 
 fn rust_btreemap_insert(bench: &mut Bencher) -> () {
     let limit = iterations(100_000);
@@ -62,5 +62,10 @@ fn rust_btreemap_iterate(bench: &mut Bencher) -> () {
     });
 }
 
-benchmark_group!(benches, rust_btreemap_insert, rust_btreemap_get, rust_btreemap_iterate);
+benchmark_group!(
+    benches,
+    rust_btreemap_insert,
+    rust_btreemap_get,
+    rust_btreemap_iterate
+);
 benchmark_main!(benches);

benches/rust_hashmap.rs

@@ -10,10 +10,10 @@ extern crate bencher;
 
 mod utils;
 
+use bencher::{black_box, Bencher};
 use std::collections::HashMap;
 use utils::BencherNoDrop;
 use utils::iterations;
-use bencher::{Bencher, black_box};
 
 fn rust_hashmap_insert(bench: &mut Bencher) -> () {
     let limit = iterations(100_000);
@@ -62,5 +62,10 @@ fn rust_hashmap_iterate(bench: &mut Bencher) -> () {
     });
 }
 
-benchmark_group!(benches, rust_hashmap_insert, rust_hashmap_get, rust_hashmap_iterate);
+benchmark_group!(
+    benches,
+    rust_hashmap_insert,
+    rust_hashmap_get,
+    rust_hashmap_iterate
+);
 benchmark_main!(benches);

benches/rust_linked_list.rs

@@ -10,10 +10,10 @@ extern crate bencher;
 
 mod utils;
 
+use bencher::{black_box, Bencher};
 use std::collections::LinkedList;
 use utils::BencherNoDrop;
 use utils::iterations;
-use bencher::{Bencher, black_box};
 
 fn rust_linked_list_push_front(bench: &mut Bencher) -> () {
     let limit = iterations(100_000);
@@ -60,6 +60,8 @@ fn rust_linked_list_iterate(bench: &mut Bencher) -> () {
 
 benchmark_group!(
     benches,
-    rust_linked_list_push_front, rust_linked_list_push_back, rust_linked_list_iterate
+    rust_linked_list_push_front,
+    rust_linked_list_push_back,
+    rust_linked_list_iterate
 );
 benchmark_main!(benches);

benches/rust_vec.rs

@@ -10,9 +10,9 @@ extern crate bencher;
 
 mod utils;
 
+use bencher::{black_box, Bencher};
 use utils::BencherNoDrop;
 use utils::iterations;
-use bencher::{Bencher, black_box};
 
 fn rust_vec_push(bench: &mut Bencher) -> () {
     let limit = iterations(100_000);

src/lib.rs

@@ -263,17 +263,17 @@ extern crate bincode;
 
 mod utils;
 
-pub mod sequence;
-pub mod stack;
-pub mod queue;
 pub mod map;
+pub mod queue;
+pub mod sequence;
 pub mod set;
+pub mod stack;
 
+pub use map::hash_trie_map::HashTrieMap;
+pub use map::red_black_tree_map::RedBlackTreeMap;
+pub use queue::Queue;
 pub use sequence::list::List;
 pub use sequence::vector::Vector;
-pub use stack::Stack;
-pub use queue::Queue;
-pub use map::hash_trie_map::HashTrieMap;
 pub use set::hash_trie_set::HashTrieSet;
-pub use map::red_black_tree_map::RedBlackTreeMap;
 pub use set::red_black_tree_set::RedBlackTreeSet;
+pub use stack::Stack;

src/map/entry.rs

@@ -5,7 +5,7 @@
 
 #[derive(Debug, PartialEq, Eq)]
 pub struct Entry<K, V> {
-    pub key:   K,
+    pub key: K,
     pub value: V,
 }