fix: false positive identity map warning

src/data_struct/README.md

@@ -13,7 +13,7 @@ Pros:
 
 - same serialized size
 
-- accessing elements is the almost as fast as an `HashMap` with one additional memory access
+- accessing elements is almost as fast as an `HashMap` with one additional memory access
 
 - updating the key of an element (e.g. renaming an attribute) can be performed in constant time without modifying the order
 
@@ -68,6 +68,8 @@ Cons:
 
 - no direct access to a given coordinate's keys (would be a nice to have but not really needed in practice)
 
+- multiple insertions with the same coordinate will result in multiple entries in the vector thus corrupting the structure
+
 - following linked list pointers can be slower than iterating a regular vector
 
 - serialization requires following each linked list

src/data_struct/dictionary.rs

@@ -151,6 +151,7 @@ where
     }
 
     /// Returns an iterator over keys and values in insertion order.
+    #[allow(clippy::map_identity)] // unpack &(x, y) to (&x, &y)
     pub fn iter(&self) -> impl Iterator<Item = (&K, &V)> {
         self.entries.iter().map(|(k, v)| (k, v))
     }

src/data_struct/revision_vec.rs

@@ -81,11 +81,13 @@ impl<K, T> RevisionVec<K, T> {
     }
 
     /// Returns an iterator over each key-chains pair
+    #[allow(clippy::map_identity)] // unpack &(x, y) to (&x, &y)
     pub fn iter(&self) -> impl Iterator<Item = (&K, &RevisionList<T>)> {
         self.chains.iter().map(|(key, chain)| (key, chain))
     }
 
     /// Returns an iterator over each key-chains pair that allow modifying chain
+    #[allow(clippy::map_identity)] // unpack &mut (x, y) to (&x, &mut y)
     pub fn iter_mut(&mut self) -> impl Iterator<Item = (&K, &mut RevisionList<T>)>
     where
         K: Clone,