Finish up into something that does not regress performance

Author: Markus Westerlind

benches/bench.rs

@@ -86,7 +86,7 @@ macro_rules! bench_insert {
             b.iter(|| {
                 m.clear();
                 for i in ($keydist).take(SIZE) {
-                    m.insert(i, DropType(i));
+                    m.insert(i, (DropType(i), [i; 20]));
                 }
                 black_box(&mut m);
             });
@@ -112,7 +112,7 @@ macro_rules! bench_grow_insert {
             b.iter(|| {
                 let mut m = $maptype::default();
                 for i in ($keydist).take(SIZE) {
-                    m.insert(i, i);
+                    m.insert(i, DropType(i));
                 }
                 black_box(&mut m);
             })

src/lib.rs

@@ -57,6 +57,11 @@ pub mod raw {
     pub use inner::*;
 
     #[cfg(feature = "rayon")]
+    /// [rayon]-based parallel iterator types for hash maps.
+    /// You will rarely need to interact with it directly unless you have need
+    /// to name one of the iterator types.
+    ///
+    /// [rayon]: https://docs.rs/rayon/1.0/rayon
     pub mod rayon {
         pub use crate::external_trait_impls::rayon::raw::*;
     }

src/main.rs

@@ -61,16 +61,6 @@ impl BitMask {
         }
     }
 
-    #[inline]
-    pub fn take_next_bit(&mut self) -> Option<usize> {
-        if let Some(index) = self.lowest_set_bit() {
-            *self = self.remove_lowest_bit();
-            Some(index)
-        } else {
-            None
-        }
-    }
-
     /// Returns the first set bit in the `BitMask`, if there is one. The
     /// bitmask must not be empty.
     #[inline]