Rename lines_to_blame to hunks_to_blame

Author: cruessler

gix-blame/src/lib.rs

@@ -770,7 +770,7 @@ pub fn blame_file<E>(
     // TODO Verify that `imara-diff` tokenizes lines the same way `lines` does.
     let number_of_lines = std::fs::read_to_string(absolute_path).unwrap().lines().count();
 
-    let mut lines_to_blame: Vec<UnblamedHunk> = vec![UnblamedHunk::new(
+    let mut hunks_to_blame: Vec<UnblamedHunk> = vec![UnblamedHunk::new(
         0..number_of_lines.try_into().unwrap(),
         Offset::Added(0),
     )];
@@ -787,7 +787,7 @@ pub fn blame_file<E>(
             // remaining lines to it, even though we don’t explicitly check whether that is true
             // here. We could perhaps use `needed_to_obtain` to compare `suspect` against an empty
             // tree to validate this assumption.
-            out.extend(lines_to_blame.iter().map(|hunk| {
+            out.extend(hunks_to_blame.iter().map(|hunk| {
                 BlameEntry::new(
                     hunk.range_in_blamed_file.clone(),
                     // TODO
@@ -798,7 +798,7 @@ pub fn blame_file<E>(
                 )
             }));
 
-            lines_to_blame = vec![];
+            hunks_to_blame = vec![];
 
             break;
         }
@@ -820,7 +820,7 @@ pub fn blame_file<E>(
             gix_diff::tree::recorder::Change::Addition { .. } => {
                 // Every line that has not been blamed yet on a commit, is expected to have been
                 // added when the file was added to the repository.
-                out.extend(lines_to_blame.iter().map(|hunk| {
+                out.extend(hunks_to_blame.iter().map(|hunk| {
                     BlameEntry::new(
                         hunk.range_in_blamed_file.clone(),
                         // TODO
@@ -831,20 +831,20 @@ pub fn blame_file<E>(
                     )
                 }));
 
-                lines_to_blame = vec![];
+                hunks_to_blame = vec![];
 
                 break;
             }
             gix_diff::tree::recorder::Change::Deletion { .. } => todo!(),
             gix_diff::tree::recorder::Change::Modification { previous_oid, oid, .. } => {
                 let changes = get_changes(&odb, resource_cache, *oid, *previous_oid, file_path);
 
-                lines_to_blame = process_changes(&mut out, &lines_to_blame, &changes, suspect);
+                hunks_to_blame = process_changes(&mut out, &hunks_to_blame, &changes, suspect);
             }
         }
     }
 
-    assert_eq!(lines_to_blame, vec![]);
+    assert_eq!(hunks_to_blame, vec![]);
 
     // I don’t know yet whether it would make sense to use a data structure instead that preserves
     // order on insertion.