From 9fa5be506d8eb6cafbc2a2194e9943e58d5b6f06 Mon Sep 17 00:00:00 2001 From: Tharos Date: Thu, 9 Jan 2025 11:07:15 +0100 Subject: [PATCH] Fix counting of editions --- src/compute_distance.rs | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/src/compute_distance.rs b/src/compute_distance.rs index 2ccf5ab..96d5a43 100644 --- a/src/compute_distance.rs +++ b/src/compute_distance.rs @@ -95,14 +95,14 @@ pub fn distance( breakpoint_b += node_sizes2.get(&node2).unwrap().clone(); } else if breakpoint_a < breakpoint_b { // The node in the first path is missing in the second path - // It is a split operation - splits_count += 1; // The two positions in the two paths are not aligned if spurious_breakpoints2.contains(&node2) { // Remove the spurious breakpoint from the vector spurious_breakpoints2.retain(|x| x != &node2); spurious_count += 1; } else { + // It is a split operation + splits_count += 1; println!( "{}\t{}\tS\t{}\t{}\t{}\t{}", path_name, position, node1, node2, breakpoint_a, breakpoint_b @@ -112,14 +112,14 @@ pub fn distance( breakpoint_a += node_sizes1.get(&node1).unwrap().clone(); } else if breakpoint_a > breakpoint_b { // The node in the second path is missing in the first path - // It is a merge operation - merges_count += 1; // The two positions in the two paths are not aligned if spurious_breakpoints1.contains(&node1) { // Remove the spurious breakpoint from the vector spurious_breakpoints1.retain(|x| x != &node1); spurious_count += 1; } else { + // It is a merge operation + merges_count += 1; println!( "{}\t{}\tM\t{}\t{}\t{}\t{}", path_name, position, node1, node2, breakpoint_a, breakpoint_b