Unified · Split
| @@ -37,7 +37,6 @@ impl<'repo> Tree<'repo> { · 36 unmodified lines | ||
| 37 | 37 | I: IntoIterator<Item = P>, |
| 38 | 38 | P: PartialEq<BStr>, |
| 39 | 39 | { |
| 40 | − // let mut out = None; | |
| 41 | 40 | let mut path = path.into_iter().peekable(); |
| 42 | 41 | while let Some(component) = path.next() { |
| 43 | 42 | match TreeRefIter::from_bytes(&self.data) |
| @@ -49,9 +48,9 @@ impl<'repo> Tree<'repo> { · 5 unmodified lines | ||
| 49 | 48 | return Ok(Some(entry.into())); |
| 50 | 49 | } else { |
| 51 | 50 | let next_id = entry.oid.to_owned(); |
| 52 | − let handle = self.repo; | |
| 51 | + let repo = self.repo; | |
| 53 | 52 | drop(self); |
| 54 | − self = match handle.find_object(next_id)?.try_into_tree() { | |
| 53 | + self = match repo.find_object(next_id)?.try_into_tree() { | |
| 55 | 54 | Ok(tree) => tree, |
| 56 | 55 | Err(_) => return Ok(None), |
| 57 | 56 | }; |