Implement additional suggestions from review

Author: cuviper

src/lib.rs

@@ -275,8 +275,8 @@ impl std::error::Error for TryReserveError {}
 ///
 /// It indicates one of two possible errors:
 /// - An index is out-of-bounds.
-/// - The same index appeared multiple times in the array
-///   (or different but overlapping indices when ranges are provided).
+/// - The same index appeared multiple times in the array.
+//    (or different but overlapping indices when ranges are provided)
 #[derive(Debug, Clone, PartialEq, Eq)]
 pub enum GetDisjointMutError {
     /// An index provided was out-of-bounds for the slice.

src/map.rs

@@ -798,10 +798,9 @@ where
     /// let mut map = indexmap::IndexMap::from([(1, 'a'), (3, 'b'), (2, 'c')]);
     /// assert_eq!(map.get_disjoint_mut([&2, &1]), [Some(&mut 'c'), Some(&mut 'a')]);
     /// ```
-    #[allow(unsafe_code)]
     pub fn get_disjoint_mut<Q, const N: usize>(&mut self, keys: [&Q; N]) -> [Option<&mut V>; N]
     where
-        Q: Hash + Equivalent<K> + ?Sized,
+        Q: ?Sized + Hash + Equivalent<K>,
     {
         let indices = keys.map(|key| self.get_index_of(key));
         match self.as_mut_slice().get_disjoint_opt_mut(indices) {

src/map/slice.rs

@@ -297,7 +297,7 @@ impl<K, V> Slice<K, V> {
             };
             if idx >= len {
                 return Err(GetDisjointMutError::IndexOutOfBounds);
-            } else if indices[i + 1..N].contains(&Some(idx)) {
+            } else if indices[..i].contains(&Some(idx)) {
                 return Err(GetDisjointMutError::OverlappingIndices);
             }
         }

src/map/tests.rs

@@ -1002,7 +1002,7 @@ fn disjoint_indices_mut_fail_duplicate() {
     map.insert(1, 10);
     map.insert(321, 20);
     assert_eq!(
-        map.get_disjoint_indices_mut([1, 2, 1]),
+        map.get_disjoint_indices_mut([1, 0, 1]),
         Err(crate::GetDisjointMutError::OverlappingIndices)
     );
 }