Merge pull request #12 from Sajjon/fn_mut

Fn mut

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "identified_vec"
-version = "0.1.8"
+version = "0.1.9"
 edition = "2021"
 authors = ["Alexander Cyon <alex.cyon@gmail.com>"]
 description = "Like HashSet but retaining INSERTION order and without `Hash` requirement on the Element type."

src/vec/identified_vec.rs

@@ -473,9 +473,9 @@ where
     /// existing element gets updated by `mutate` closure and this function returns
     /// `true`.
     #[inline]
-    fn update_with<F>(&mut self, id: &I, mutate: F) -> bool
+    fn update_with<F>(&mut self, id: &I, mut mutate: F) -> bool
     where
-        F: Fn(&mut E),
+        F: FnMut(&mut E),
     {
         if !self.contains_id(id) {
             return false;

src/vec/is_identified_vec.rs

@@ -143,7 +143,7 @@ where
 
     fn update_with<F>(&mut self, id: &ID, mutate: F) -> bool
     where
-        F: Fn(&mut Element);
+        F: FnMut(&mut Element);
 
     /// Insert a new member to this identified_vec at the specified index, if the identified_vec doesn't already contain
     /// it.

src/vec_of/is_identified_vec_of_via.rs

@@ -169,10 +169,11 @@ where
         self.via_mut().try_update(element)
     }
 
+    #[allow(unused_mut)]
     #[inline]
-    fn update_with<F>(&mut self, id: &<Element as Identifiable>::ID, mutate: F) -> bool
+    fn update_with<F>(&mut self, id: &<Element as Identifiable>::ID, mut mutate: F) -> bool
     where
-        F: Fn(&mut Element),
+        F: FnMut(&mut Element),
     {
         self.via_mut().update_with(id, mutate)
     }