Merging upstream version 1.72.1+dfsg1.

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

2 files changed, 4 insertions, 4 deletions

diff --git a/vendor/gix-traverse/src/commit.rs b/vendor/gix-traverse/src/commit.rs
index 6e7e0c9e7..95d48842a 100644
--- a/vendor/gix-traverse/src/commit.rs
+++ b/vendor/gix-traverse/src/commit.rs
@@ -110,7 +110,7 @@ pub mod ancestors {
             if !matches!(self.sorting, Sorting::Topological) {
                 let mut cutoff_time_storage = self.sorting.cutoff_time().map(|cot| (cot, Vec::new()));
                 let state = self.state.borrow_mut();
-                for (commit_id, commit_time) in state.next.iter_mut() {
+                for (commit_id, commit_time) in &mut state.next {
                     let commit_iter = (self.find)(commit_id, &mut state.buf).map_err(|err| Error::FindExisting {
                         oid: *commit_id,
                         source: err.into(),
@@ -144,7 +144,7 @@ pub mod ancestors {
     {
         /// Create a new instance.
         ///
-        /// * `find` - a way to lookup new object data during traversal by their ObjectId, writing their data into buffer and returning
+        /// * `find` - a way to lookup new object data during traversal by their `ObjectId`, writing their data into buffer and returning
         ///    an iterator over commit tokens if the object is present and is a commit. Caching should be implemented within this function
         ///    as needed.
         /// * `state` - all state used for the traversal. If multiple traversals are performed, allocations can be minimized by reusing
@@ -167,7 +167,7 @@ pub mod ancestors {
     {
         /// Create a new instance with commit filtering enabled.
         ///
-        /// * `find` - a way to lookup new object data during traversal by their ObjectId, writing their data into buffer and returning
+        /// * `find` - a way to lookup new object data during traversal by their `ObjectId`, writing their data into buffer and returning
         ///    an iterator over commit tokens if the object is present and is a commit. Caching should be implemented within this function
         ///    as needed.
         /// * `state` - all state used for the traversal. If multiple traversals are performed, allocations can be minimized by reusing
diff --git a/vendor/gix-traverse/src/tree/breadthfirst.rs b/vendor/gix-traverse/src/tree/breadthfirst.rs
index b0c7ffdf5..115b9a396 100644
--- a/vendor/gix-traverse/src/tree/breadthfirst.rs
+++ b/vendor/gix-traverse/src/tree/breadthfirst.rs
@@ -43,7 +43,7 @@ pub(crate) mod impl_ {
     ///   * the tree to iterate in a nested fashion.
     /// * `state` - all state used for the iteration. If multiple iterations are performed, allocations can be minimized by reusing
     ///   this state.
-    /// * `find` - a way to lookup new object data during traversal by their ObjectId, writing their data into buffer and returning
+    /// * `find` - a way to lookup new object data during traversal by their `ObjectId`, writing their data into buffer and returning
     ///    an iterator over entries if the object is present and is a tree. Caching should be implemented within this function
     ///    as needed. The return value is `Option<TreeIter>` which degenerates all error information. Not finding a commit should also
     ///    be considered an errors as all objects in the tree DAG should be present in the database. Hence [`Error::NotFound`] should