Note impls that requires rayon

Author: cuviper

src/rayon/map.rs

@@ -2,6 +2,8 @@
 //!
 //! You will rarely need to interact with this module directly unless you need to name one of the
 //! iterator types.
+//!
+//! Requires crate feature `"rayon"`
 
 use super::collect;
 use super::rayon::prelude::*;
@@ -16,6 +18,7 @@ use Bucket;
 use Entries;
 use IndexMap;
 
+/// Requires crate feature `"rayon"`.
 impl<K, V, S> IntoParallelIterator for IndexMap<K, V, S>
     where K: Hash + Eq + Send,
           V: Send,
@@ -60,6 +63,7 @@ impl<K: Send, V: Send> IndexedParallelIterator for IntoParIter<K, V> {
 }
 
 
+/// Requires crate feature `"rayon"`.
 impl<'a, K, V, S> IntoParallelIterator for &'a IndexMap<K, V, S>
     where K: Hash + Eq + Sync,
           V: Sync,
@@ -110,6 +114,7 @@ impl<'a, K: Sync, V: Sync> IndexedParallelIterator for ParIter<'a, K, V> {
 }
 
 
+/// Requires crate feature `"rayon"`.
 impl<'a, K, V, S> IntoParallelIterator for &'a mut IndexMap<K, V, S>
     where K: Hash + Eq + Sync + Send,
           V: Send,
@@ -147,6 +152,7 @@ impl<'a, K: Sync + Send, V: Send> IndexedParallelIterator for ParIterMut<'a, K,
 }
 
 
+/// Requires crate feature `"rayon"`.
 impl<K, V, S> IndexMap<K, V, S>
     where K: Hash + Eq + Sync,
           V: Sync,
@@ -255,6 +261,7 @@ impl<'a, K: Sync, V: Sync> IndexedParallelIterator for ParValues<'a, K, V> {
 }
 
 
+/// Requires crate feature `"rayon"`.
 impl<K, V, S> IndexMap<K, V, S>
     where K: Hash + Eq + Send,
           V: Send,
@@ -325,6 +332,7 @@ impl<'a, K: Send, V: Send> IndexedParallelIterator for ParValuesMut<'a, K, V> {
 }
 
 
+/// Requires crate feature `"rayon"`.
 impl<K, V, S> FromParallelIterator<(K, V)> for IndexMap<K, V, S>
     where K: Eq + Hash + Send,
           V: Send,
@@ -343,6 +351,7 @@ impl<K, V, S> FromParallelIterator<(K, V)> for IndexMap<K, V, S>
     }
 }
 
+/// Requires crate feature `"rayon"`.
 impl<K, V, S> ParallelExtend<(K, V)> for IndexMap<K, V, S>
     where K: Eq + Hash + Send,
           V: Send,
@@ -357,6 +366,7 @@ impl<K, V, S> ParallelExtend<(K, V)> for IndexMap<K, V, S>
     }
 }
 
+/// Requires crate feature `"rayon"`.
 impl<'a, K: 'a, V: 'a, S> ParallelExtend<(&'a K, &'a V)> for IndexMap<K, V, S>
     where K: Copy + Eq + Hash + Send + Sync,
           V: Copy + Send + Sync,

src/rayon/set.rs

@@ -2,6 +2,8 @@
 //!
 //! You will rarely need to interact with this module directly unless you need to name one of the
 //! iterator types.
+//!
+//! Requires crate feature `"rayon"`.
 
 use super::collect;
 use super::rayon::prelude::*;
@@ -17,6 +19,7 @@ use IndexSet;
 
 type Bucket<T> = ::Bucket<T, ()>;
 
+/// Requires crate feature `"rayon"`.
 impl<T, S> IntoParallelIterator for IndexSet<T, S>
     where T: Hash + Eq + Send,
           S: BuildHasher,
@@ -60,6 +63,7 @@ impl<T: Send> IndexedParallelIterator for IntoParIter<T> {
 }
 
 
+/// Requires crate feature `"rayon"`.
 impl<'a, T, S> IntoParallelIterator for &'a IndexSet<T, S>
     where T: Hash + Eq + Sync,
           S: BuildHasher,
@@ -109,6 +113,7 @@ impl<'a, T: Sync> IndexedParallelIterator for ParIter<'a, T> {
 }
 
 
+/// Requires crate feature `"rayon"`.
 impl<T, S> IndexSet<T, S>
     where T: Hash + Eq + Sync,
           S: BuildHasher + Sync,
@@ -396,6 +401,7 @@ impl<'a, T, S1, S2> ParallelIterator for ParUnion<'a, T, S1, S2>
 }
 
 
+/// Requires crate feature `"rayon"`.
 impl<T, S> IndexSet<T, S>
     where T: Hash + Eq + Send,
           S: BuildHasher + Send,
@@ -430,6 +436,7 @@ impl<T, S> IndexSet<T, S>
 }
 
 
+/// Requires crate feature `"rayon"`.
 impl<T, S> FromParallelIterator<T> for IndexSet<T, S>
     where T: Eq + Hash + Send,
           S: BuildHasher + Default + Send,
@@ -447,6 +454,7 @@ impl<T, S> FromParallelIterator<T> for IndexSet<T, S>
     }
 }
 
+/// Requires crate feature `"rayon"`.
 impl<T, S> ParallelExtend<(T)> for IndexSet<T, S>
     where T: Eq + Hash + Send,
           S: BuildHasher + Send,
@@ -460,6 +468,7 @@ impl<T, S> ParallelExtend<(T)> for IndexSet<T, S>
     }
 }
 
+/// Requires crate feature `"rayon"`.
 impl<'a, T: 'a, S> ParallelExtend<&'a T> for IndexSet<T, S>
     where T: Copy + Eq + Hash + Send + Sync,
           S: BuildHasher + Send,