Apply feedback from rust-lang/rust#56241

Author: Amanieu

src/external_trait_impls/rayon/raw.rs

@@ -15,8 +15,6 @@ pub struct RawParIter<T> {
     iter: RawIterRange<T>,
 }
 
-unsafe impl<T> Send for RawParIter<T> {}
-
 impl<T> ParallelIterator for RawParIter<T> {
     type Item = Bucket<T>;
 
@@ -35,8 +33,6 @@ struct ParIterProducer<T> {
     iter: RawIterRange<T>,
 }
 
-unsafe impl<T> Send for ParIterProducer<T> {}
-
 impl<T> UnindexedProducer for ParIterProducer<T> {
     type Item = Bucket<T>;
 
@@ -62,8 +58,6 @@ pub struct RawIntoParIter<T> {
     table: RawTable<T>,
 }
 
-unsafe impl<T> Send for RawIntoParIter<T> {}
-
 impl<T: Send> ParallelIterator for RawIntoParIter<T> {
     type Item = T;
 
@@ -87,8 +81,8 @@ impl<T: Send> ParallelIterator for RawIntoParIter<T> {
 
 /// Parallel iterator which consumes elements without freeing the table storage.
 pub struct RawParDrain<'a, T> {
-    // We don't use a &'a RawTable<T> because we want RawParDrain to be
-    // covariant over 'a.
+    // We don't use a &'a mut RawTable<T> because we want RawParDrain to be
+    // covariant over T.
     table: NonNull<RawTable<T>>,
     _marker: PhantomData<&'a RawTable<T>>,
 }
@@ -126,8 +120,6 @@ struct ParDrainProducer<T> {
     iter: RawIterRange<T>,
 }
 
-unsafe impl<T: Send> Send for ParDrainProducer<T> {}
-
 impl<T: Send> UnindexedProducer for ParDrainProducer<T> {
     type Item = T;
 

src/lib.rs

@@ -26,7 +26,6 @@
 #![allow(clippy::module_name_repetitions)]
 
 #[cfg(test)]
-#[cfg_attr(feature = "rayon", macro_use)]
 extern crate std;
 #[cfg(test)]
 extern crate rand;
@@ -45,6 +44,7 @@ extern crate std as alloc;
 #[macro_use]
 mod macros;
 
+mod scopeguard;
 mod external_trait_impls;
 mod fx;
 mod map;

src/map.rs

@@ -231,8 +231,7 @@ impl<K, V> HashMap<K, V, DefaultHashBuilder> {
     }
 }
 
-impl<K, V, S> HashMap<K, V, S>
-{
+impl<K, V, S> HashMap<K, V, S> {
     /// Creates an empty `HashMap` which will use the given hash builder to hash
     /// keys.
     ///
@@ -1090,7 +1089,7 @@ where
 /// [`HashMap`]: struct.HashMap.html
 pub struct Iter<'a, K: 'a, V: 'a> {
     inner: RawIter<(K, V)>,
-    _marker: PhantomData<&'a HashMap<K, V>>,
+    _marker: PhantomData<(&'a K, &'a V)>,
 }
 
 // FIXME(#26925) Remove in favor of `#[derive(Clone)]`
@@ -1120,7 +1119,7 @@ impl<'a, K: Debug, V: Debug> fmt::Debug for Iter<'a, K, V> {
 pub struct IterMut<'a, K: 'a, V: 'a> {
     inner: RawIter<(K, V)>,
     // To ensure invariance with respect to V
-    _marker: PhantomData<&'a mut V>,
+    _marker: PhantomData<(&'a K, &'a mut V)>,
 }
 
 impl<'a, K, V> IterMut<'a, K, V> {

src/raw/generic.rs

@@ -132,6 +132,12 @@ impl Group {
         BitMask((self.0 & repeat(0x80)).to_le())
     }
 
+    /// Returns a `BitMask` indicating all bytes in the group which are full.
+    #[inline]
+    pub fn match_full(&self) -> BitMask {
+        self.match_empty_or_deleted().invert()
+    }
+
     /// Performs the following transformation on all bytes in the group:
     /// - `EMPTY => EMPTY`
     /// - `DELETED => EMPTY`