Show More
@@ -126,11 +126,10 b' impl<G: Graph> Iterator for AncestorsIte' | |||
|
126 | 126 | } |
|
127 | 127 | Some(c) => *c, |
|
128 | 128 | }; |
|
129 |
let |
|
|
129 | let (p1, p2) = self | |
|
130 | 130 | .graph |
|
131 | 131 | .parents(current) |
|
132 | 132 | .unwrap_or((NULL_REVISION, NULL_REVISION)); |
|
133 | let p1 = parents.0; | |
|
134 | 133 | if p1 < self.stoprev || self.seen.contains(&p1) { |
|
135 | 134 | self.visit.pop(); |
|
136 | 135 | } else { |
@@ -138,7 +137,7 b' impl<G: Graph> Iterator for AncestorsIte' | |||
|
138 | 137 | self.seen.insert(p1); |
|
139 | 138 | }; |
|
140 | 139 | |
|
141 |
self.conditionally_push_rev(p |
|
|
140 | self.conditionally_push_rev(p2); | |
|
142 | 141 | Some(current) |
|
143 | 142 | } |
|
144 | 143 | } |
General Comments 0
You need to be logged in to leave comments.
Login now