Show More
@@ -397,14 +397,24 pub fn combine_changeset_copies<D>( | |||||
397 | // the individual copies information the curent revision. Creating a |
|
397 | // the individual copies information the curent revision. Creating a | |
398 | // new TimeStampedPath for each `rev` → `children` vertex. |
|
398 | // new TimeStampedPath for each `rev` → `children` vertex. | |
399 | let mut copies: Option<InternalPathCopies> = None; |
|
399 | let mut copies: Option<InternalPathCopies> = None; | |
400 | if p1 != NULL_REVISION { |
|
|||
401 |
|
|
400 | // Retrieve data computed in a previous iteration | |
402 | let parent_copies = get_and_clean_parent_copies( |
|
401 | let p1_copies = match p1 { | |
|
402 | NULL_REVISION => None, | |||
|
403 | _ => get_and_clean_parent_copies( | |||
403 | &mut all_copies, |
|
404 | &mut all_copies, | |
404 | &mut children_count, |
|
405 | &mut children_count, | |
405 | p1, |
|
406 | p1, | |
406 | ); |
|
407 | ), // will be None if the vertex is not to be traversed | |
407 | if let Some(parent_copies) = parent_copies { |
|
408 | }; | |
|
409 | let p2_copies = match p2 { | |||
|
410 | NULL_REVISION => None, | |||
|
411 | _ => get_and_clean_parent_copies( | |||
|
412 | &mut all_copies, | |||
|
413 | &mut children_count, | |||
|
414 | p2, | |||
|
415 | ), // will be None if the vertex is not to be traversed | |||
|
416 | }; | |||
|
417 | if let Some(parent_copies) = p1_copies { | |||
408 |
|
|
418 | // combine it with data for that revision | |
409 |
|
|
419 | let vertex_copies = add_from_changes( | |
410 |
|
|
420 | &mut path_map, | |
@@ -416,15 +426,7 pub fn combine_changeset_copies<D>( | |||||
416 |
|
|
426 | // keep that data around for potential later combination | |
417 |
|
|
427 | copies = Some(vertex_copies); | |
418 |
|
|
428 | } | |
419 | } |
|
429 | if let Some(parent_copies) = p2_copies { | |
420 | if p2 != NULL_REVISION { |
|
|||
421 | // Retrieve data computed in a previous iteration |
|
|||
422 | let parent_copies = get_and_clean_parent_copies( |
|
|||
423 | &mut all_copies, |
|
|||
424 | &mut children_count, |
|
|||
425 | p2, |
|
|||
426 | ); |
|
|||
427 | if let Some(parent_copies) = parent_copies { |
|
|||
428 |
|
|
430 | // combine it with data for that revision | |
429 |
|
|
431 | let vertex_copies = add_from_changes( | |
430 |
|
|
432 | &mut path_map, | |
@@ -450,7 +452,6 pub fn combine_changeset_copies<D>( | |||||
450 |
|
|
452 | )), | |
451 |
|
|
453 | }; | |
452 |
|
|
454 | } | |
453 | } |
|
|||
454 | match copies { |
|
455 | match copies { | |
455 | Some(copies) => { |
|
456 | Some(copies) => { | |
456 | all_copies.insert(rev, copies); |
|
457 | all_copies.insert(rev, copies); |
General Comments 0
You need to be logged in to leave comments.
Login now