// Copyright 2024 The Jujutsu Authors//// Licensed under the Apache License, Version 2.0 (the "License");// you may not use this file except in compliance with the License.// You may obtain a copy of the License at//// https://www.apache.org/licenses/LICENSE-2.0//// Unless required by applicable law or agreed to in writing, software// distributed under the License is distributed on an "AS IS" BASIS,// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.// See the License for the specific language governing permissions and// limitations under the License. //! Methods that allow annotation (attribution and blame) for a file in a//! repository.//!//! TODO: Add support for different blame layers with a trait in the future.//! Like commit metadata and more. use std::collections::hash_map;use std::collections::HashMap;use std::iter;use std::ops::Range;use std::rc::Rc; use bstr::BStr;use bstr::BString;use itertools::Itertools as _;use pollster::FutureExt as _; use crate::backend::BackendError;use crate::backend::CommitId;use crate::commit::Commit;use crate::conflicts::materialize_merge_result_to_bytes;use crate::conflicts::materialize_tree_value;use crate::conflicts::ConflictMarkerStyle;use crate::conflicts::MaterializedTreeValue;use crate::diff::Diff;use crate::diff::DiffHunkKind;use crate::fileset::FilesetExpression;use crate::graph::GraphEdge;use crate::graph::GraphEdgeType;use crate::merged_tree::MergedTree;use crate::repo::Repo;use crate::repo_path::RepoPath;use crate::revset::ResolvedRevsetExpression;use crate::revset::RevsetEvaluationError;use crate::revset::RevsetExpression;use crate::revset::RevsetFilterPredicate;use crate::store::Store; /// Annotation results for a specific file#[derive(Clone, Debug)]pub struct FileAnnotation { line_map: OriginalLineMap, text: BString,} impl FileAnnotation { /// Returns iterator over `(commit_id, line)`s. /// /// For each line, `Ok(commit_id)` points to the originator commit of the /// line. If no originator commit was found within the domain, /// `Err(commit_id)` should be set. It points to the root (or boundary) /// commit where the line exists. /// /// The `line` includes newline character. pub fn lines(&self) -> impl Iterator<Item = (Result<&CommitId, &CommitId>, &BStr)> { itertools::zip_eq(&self.line_map, self.text.split_inclusive(|b| *b == b'\n')) .map(|(commit_id, line)| (commit_id.as_ref(), line.as_ref())) } /// Returns iterator over `(commit_id, line_range)`s. /// /// See [`Self::lines()`] for `commit_id`s. /// /// The `line_range` is a slice range in the file `text`. Consecutive ranges /// having the same `commit_id` are not compacted. pub fn line_ranges( &self, ) -> impl Iterator<Item = (Result<&CommitId, &CommitId>, Range<usize>)> { let ranges = self .text .split_inclusive(|b| *b == b'\n') .scan(0, |total, line| { let start = *total; *total += line.len(); Some(start..*total) }); itertools::zip_eq(&self.line_map, ranges) .map(|(commit_id, range)| (commit_id.as_ref(), range)) } /// Returns iterator over compacted `(commit_id, line_range)`s. /// /// Consecutive ranges having the same `commit_id` are merged into one. pub fn compact_line_ranges( &self, ) -> impl Iterator<Item = (Result<&CommitId, &CommitId>, Range<usize>)> { let mut ranges = self.line_ranges(); let mut acc = ranges.next(); iter::from_fn(move || { let (acc_commit_id, acc_range) = acc.as_mut()?; for (cur_commit_id, cur_range) in ranges.by_ref() { if *acc_commit_id == cur_commit_id { acc_range.end = cur_range.end; } else { return acc.replace((cur_commit_id, cur_range)); } } acc.take() }) } /// File content at the starting commit. pub fn text(&self) -> &BStr { self.text.as_ref() }} /// A map from commits to file line mappings and contents.type CommitSourceMap = HashMap<CommitId, Source>; /// Line mapping and file content at a certain commit.#[derive(Clone, Debug)]struct Source { /// Mapping of line numbers in the file at the current commit to the /// original file, sorted by the line numbers at the current commit. line_map: Vec<(usize, usize)>, /// File content at the current commit. text: BString,} impl Source { fn new(text: BString) -> Self { Source { line_map: Vec::new(), text, } } fn load(commit: &Commit, file_path: &RepoPath) -> Result<Self, BackendError> { let tree = commit.tree()?; let text = get_file_contents(commit.store(), file_path, &tree)?; Ok(Self::new(text)) } fn fill_line_map(&mut self) { let lines = self.text.split_inclusive(|b| *b == b'\n'); self.line_map = lines.enumerate().map(|(i, _)| (i, i)).collect(); }} /// List of commit IDs that originated lines, indexed by line numbers in the/// original file.type OriginalLineMap = Vec<Result<CommitId, CommitId>>; /// Get line by line annotations for a specific file path in the repo.////// The `domain` expression narrows the range of ancestors to search. It will be/// intersected as `domain & ::starting_commit & files(file_path)`. The/// `starting_commit` is assumed to be included in the `domain`.////// If the file is not found, returns empty results.pub fn get_annotation_for_file( repo: &dyn Repo, starting_commit: &Commit, domain: &Rc<ResolvedRevsetExpression>, file_path: &RepoPath,) -> Result<FileAnnotation, RevsetEvaluationError> { let source = Source::load(starting_commit, file_path)?; compute_file_annotation(repo, starting_commit.id(), domain, file_path, source)} /// Get line by line annotations for a specific file path starting with the/// given content.////// The file content at the `starting_commit` is set to `starting_text`. This is/// typically one of the file contents in the conflict or merged-parent tree.////// See [`get_annotation_for_file()`] for the other arguments.pub fn get_annotation_with_file_content( repo: &dyn Repo, starting_commit_id: &CommitId, domain: &Rc<ResolvedRevsetExpression>, file_path: &RepoPath, starting_text: impl Into<Vec<u8>>,) -> Result<FileAnnotation, RevsetEvaluationError> { let source = Source::new(BString::new(starting_text.into())); compute_file_annotation(repo, starting_commit_id, domain, file_path, source)} fn compute_file_annotation( repo: &dyn Repo, starting_commit_id: &CommitId, domain: &Rc<ResolvedRevsetExpression>, file_path: &RepoPath, mut source: Source,) -> Result<FileAnnotation, RevsetEvaluationError> { source.fill_line_map(); let text = source.text.clone(); let line_map = process_commits(repo, starting_commit_id, source, domain, file_path)?; Ok(FileAnnotation { line_map, text })} /// Starting at the starting commit, compute changes at that commit relative to/// it's direct parents, updating the mappings as we go. We return the final/// original line map that represents where each line of the original came from.fn process_commits( repo: &dyn Repo, starting_commit_id: &CommitId, starting_source: Source, domain: &Rc<ResolvedRevsetExpression>, file_name: &RepoPath,) -> Result<OriginalLineMap, RevsetEvaluationError> { let predicate = RevsetFilterPredicate::File(FilesetExpression::file_path(file_name.to_owned())); // TODO: If the domain isn't a contiguous range, changes masked out by it // might not be caught by the closest ancestor revision. For example, // domain=merges() would pick up almost nothing because merge revisions // are usually empty. Perhaps, we want to query `files(file_path, // within_sub_graph=domain)`, not `domain & files(file_path)`. let ancestors = RevsetExpression::commit(starting_commit_id.clone()).ancestors(); let revset = RevsetExpression::commit(starting_commit_id.clone()) .union(&domain.intersection(&ancestors).filtered(predicate)) .evaluate(repo)?; let mut original_line_map = vec![Err(starting_commit_id.clone()); starting_source.line_map.len()]; let mut commit_source_map = HashMap::from([(starting_commit_id.clone(), starting_source)]); for node in revset.iter_graph() { let (commit_id, edge_list) = node?; process_commit( repo, file_name, &mut original_line_map, &mut commit_source_map, &commit_id, &edge_list, )?; if commit_source_map.is_empty() { // No more lines to propagate to ancestors. break; } } Ok(original_line_map)} /// For a given commit, for each parent, we compare the version in the parent/// tree with the current version, updating the mappings for any lines in/// common. If the parent doesn't have the file, we skip it.fn process_commit( repo: &dyn Repo, file_name: &RepoPath, original_line_map: &mut OriginalLineMap, commit_source_map: &mut CommitSourceMap, current_commit_id: &CommitId, edges: &[GraphEdge<CommitId>],) -> Result<(), BackendError> { let Some(mut current_source) = commit_source_map.remove(current_commit_id) else { return Ok(()); }; for parent_edge in edges { let parent_commit_id = &parent_edge.target; let parent_source = match commit_source_map.entry(parent_commit_id.clone()) { hash_map::Entry::Occupied(entry) => entry.into_mut(), hash_map::Entry::Vacant(entry) => { let commit = repo.store().get_commit(entry.key())?; entry.insert(Source::load(&commit, file_name)?) } }; // For two versions of the same file, for all the lines in common, // overwrite the new mapping in the results for the new commit. Let's // say I have a file in commit A and commit B. We know that according to // local line_map, in commit A, line 3 corresponds to line 7 of the // original file. Now, line 3 in Commit A corresponds to line 6 in // commit B. Then, we update local line_map to say that "Commit B line 6 // goes to line 7 of the original file". We repeat this for all lines in // common in the two commits. let mut current_lines = current_source.line_map.iter().copied().peekable(); let mut new_current_line_map = Vec::new(); let mut new_parent_line_map = Vec::new(); copy_same_lines_with( ¤t_source.text, &parent_source.text, |current_start, parent_start, count| { new_current_line_map .extend(current_lines.peeking_take_while(|&(cur, _)| cur < current_start)); while let Some((current, original)) = current_lines.next_if(|&(cur, _)| cur < current_start + count) { let parent = parent_start + (current - current_start); new_parent_line_map.push((parent, original)); } }, ); new_current_line_map.extend(current_lines); current_source.line_map = new_current_line_map; parent_source.line_map = if parent_source.line_map.is_empty() { new_parent_line_map } else { itertools::merge(parent_source.line_map.iter().copied(), new_parent_line_map).collect() }; // If an omitted parent had the file, leave these lines unresolved. The // origin of the unresolved lines is represented as Err(root_commit_id). if parent_edge.edge_type == GraphEdgeType::Missing { for (_, original_line_number) in parent_source.line_map.drain(..) { original_line_map[original_line_number] = Err(current_commit_id.clone()); } } if parent_source.line_map.is_empty() { commit_source_map.remove(parent_commit_id); } } // Once we've looked at all parents of a commit, any leftover lines must be // original to the current commit, so we save this information in // original_line_map. for (_, original_line_number) in current_source.line_map { original_line_map[original_line_number] = Ok(current_commit_id.clone()); } Ok(())} /// For two files, calls `copy(current_start, parent_start, count)` for each/// range of contiguous lines in common (e.g. line 8-10 maps to line 9-11.)fn copy_same_lines_with( current_contents: &[u8], parent_contents: &[u8], mut copy: impl FnMut(usize, usize, usize),) { let diff = Diff::by_line([current_contents, parent_contents]); let mut current_line_counter: usize = 0; let mut parent_line_counter: usize = 0; for hunk in diff.hunks() { match hunk.kind { DiffHunkKind::Matching => { let count = hunk.contents[0].split_inclusive(|b| *b == b'\n').count(); copy(current_line_counter, parent_line_counter, count); current_line_counter += count; parent_line_counter += count; } DiffHunkKind::Different => { let current_output = hunk.contents[0]; let parent_output = hunk.contents[1]; current_line_counter += current_output.split_inclusive(|b| *b == b'\n').count(); parent_line_counter += parent_output.split_inclusive(|b| *b == b'\n').count(); } } }} fn get_file_contents( store: &Store, path: &RepoPath, tree: &MergedTree,) -> Result<BString, BackendError> { let file_value = tree.path_value(path)?; let effective_file_value = materialize_tree_value(store, path, file_value).block_on()?; match effective_file_value { MaterializedTreeValue::File(mut file) => Ok(file.read_all(path)?.into()), MaterializedTreeValue::FileConflict { contents, .. } => Ok( materialize_merge_result_to_bytes(&contents, ConflictMarkerStyle::default()), ), _ => Ok(BString::default()), }} #[cfg(test)]mod tests { use super::*; #[test] fn test_lines_iterator_empty() { let annotation = FileAnnotation { line_map: vec![], text: "".into(), }; assert_eq!(annotation.lines().collect_vec(), vec![]); assert_eq!(annotation.line_ranges().collect_vec(), vec![]); assert_eq!(annotation.compact_line_ranges().collect_vec(), vec![]); } #[test] fn test_lines_iterator_with_content() { let commit_id1 = CommitId::from_hex("111111"); let commit_id2 = CommitId::from_hex("222222"); let commit_id3 = CommitId::from_hex("333333"); let annotation = FileAnnotation { line_map: vec![ Ok(commit_id1.clone()), Ok(commit_id2.clone()), Ok(commit_id3.clone()), ], text: "foo\n\nbar\n".into(), }; assert_eq!( annotation.lines().collect_vec(), vec![ (Ok(&commit_id1), "foo\n".as_ref()), (Ok(&commit_id2), "\n".as_ref()), (Ok(&commit_id3), "bar\n".as_ref()), ] ); assert_eq!( annotation.line_ranges().collect_vec(), vec![ (Ok(&commit_id1), 0..4), (Ok(&commit_id2), 4..5), (Ok(&commit_id3), 5..9), ] ); assert_eq!( annotation.compact_line_ranges().collect_vec(), vec![ (Ok(&commit_id1), 0..4), (Ok(&commit_id2), 4..5), (Ok(&commit_id3), 5..9), ] ); } #[test] fn test_lines_iterator_compaction() { let commit_id1 = CommitId::from_hex("111111"); let commit_id2 = CommitId::from_hex("222222"); let commit_id3 = CommitId::from_hex("333333"); let annotation = FileAnnotation { line_map: vec![ Ok(commit_id1.clone()), Ok(commit_id1.clone()), Ok(commit_id2.clone()), Ok(commit_id1.clone()), Ok(commit_id3.clone()), Ok(commit_id3.clone()), Ok(commit_id3.clone()), ], text: "\n".repeat(7).into(), }; assert_eq!( annotation.compact_line_ranges().collect_vec(), vec![ (Ok(&commit_id1), 0..2), (Ok(&commit_id2), 2..3), (Ok(&commit_id1), 3..4), (Ok(&commit_id3), 4..7), ] ); }}
// Copyright 2024 The Jujutsu Authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//! Methods that allow annotation (attribution and blame) for a file in a
//! repository.
//!
//! TODO: Add support for different blame layers with a trait in the future.
//! Like commit metadata and more.
use std::collections::hash_map;
use std::collections::HashMap;
use std::iter;
use std::ops::Range;
use std::rc::Rc;
use bstr::BStr;
use bstr::BString;
use itertools::Itertools as _;
use pollster::FutureExt as _;
use crate::backend::BackendError;
use crate::backend::CommitId;
use crate::commit::Commit;
use crate::conflicts::materialize_merge_result_to_bytes;
use crate::conflicts::materialize_tree_value;
use crate::conflicts::ConflictMarkerStyle;
use crate::conflicts::MaterializedTreeValue;
use crate::diff::Diff;
use crate::diff::DiffHunkKind;
use crate::fileset::FilesetExpression;
use crate::graph::GraphEdge;
use crate::graph::GraphEdgeType;
use crate::merged_tree::MergedTree;
use crate::repo::Repo;
use crate::repo_path::RepoPath;
use crate::revset::ResolvedRevsetExpression;
use crate::revset::RevsetEvaluationError;
use crate::revset::RevsetExpression;
use crate::revset::RevsetFilterPredicate;
use crate::store::Store;
/// Annotation results for a specific file
#[derive(Clone, Debug)]
pub struct FileAnnotation {
line_map: OriginalLineMap,
text: BString,
}
impl FileAnnotation {
/// Returns iterator over `(commit_id, line)`s.
///
/// For each line, `Ok(commit_id)` points to the originator commit of the
/// line. If no originator commit was found within the domain,
/// `Err(commit_id)` should be set. It points to the root (or boundary)
/// commit where the line exists.
///
/// The `line` includes newline character.
pub fn lines(&self) -> impl Iterator<Item = (Result<&CommitId, &CommitId>, &BStr)> {
itertools::zip_eq(&self.line_map, self.text.split_inclusive(|b| *b == b'\n'))
.map(|(commit_id, line)| (commit_id.as_ref(), line.as_ref()))
}
/// Returns iterator over `(commit_id, line_range)`s.
///
/// See [`Self::lines()`] for `commit_id`s.
///
/// The `line_range` is a slice range in the file `text`. Consecutive ranges
/// having the same `commit_id` are not compacted.
pub fn line_ranges(
&self,
) -> impl Iterator<Item = (Result<&CommitId, &CommitId>, Range<usize>)> {
let ranges = self
.text
.split_inclusive(|b| *b == b'\n')
.scan(0, |total, line| {
let start = *total;
*total += line.len();
Some(start..*total)
});
itertools::zip_eq(&self.line_map, ranges)
.map(|(commit_id, range)| (commit_id.as_ref(), range))
}
/// Returns iterator over compacted `(commit_id, line_range)`s.
///
/// Consecutive ranges having the same `commit_id` are merged into one.
pub fn compact_line_ranges(
&self,
) -> impl Iterator<Item = (Result<&CommitId, &CommitId>, Range<usize>)> {
let mut ranges = self.line_ranges();
let mut acc = ranges.next();
iter::from_fn(move || {
let (acc_commit_id, acc_range) = acc.as_mut()?;
for (cur_commit_id, cur_range) in ranges.by_ref() {
if *acc_commit_id == cur_commit_id {
acc_range.end = cur_range.end;
} else {
return acc.replace((cur_commit_id, cur_range));
}
}
acc.take()
})
}
/// File content at the starting commit.
pub fn text(&self) -> &BStr {
self.text.as_ref()
}
}
/// A map from commits to file line mappings and contents.
type CommitSourceMap = HashMap<CommitId, Source>;
/// Line mapping and file content at a certain commit.
#[derive(Clone, Debug)]
struct Source {
/// Mapping of line numbers in the file at the current commit to the
/// original file, sorted by the line numbers at the current commit.
line_map: Vec<(usize, usize)>,
/// File content at the current commit.
text: BString,
}
impl Source {
fn new(text: BString) -> Self {
Source {
line_map: Vec::new(),
text,
}
}
fn load(commit: &Commit, file_path: &RepoPath) -> Result<Self, BackendError> {
let tree = commit.tree()?;
let text = get_file_contents(commit.store(), file_path, &tree)?;
Ok(Self::new(text))
}
fn fill_line_map(&mut self) {
let lines = self.text.split_inclusive(|b| *b == b'\n');
self.line_map = lines.enumerate().map(|(i, _)| (i, i)).collect();
}
}
/// List of commit IDs that originated lines, indexed by line numbers in the
/// original file.
type OriginalLineMap = Vec<Result<CommitId, CommitId>>;
/// Get line by line annotations for a specific file path in the repo.
///
/// The `domain` expression narrows the range of ancestors to search. It will be
/// intersected as `domain & ::starting_commit & files(file_path)`. The
/// `starting_commit` is assumed to be included in the `domain`.
///
/// If the file is not found, returns empty results.
pub fn get_annotation_for_file(
repo: &dyn Repo,
starting_commit: &Commit,
domain: &Rc<ResolvedRevsetExpression>,
file_path: &RepoPath,
) -> Result<FileAnnotation, RevsetEvaluationError> {
let source = Source::load(starting_commit, file_path)?;
compute_file_annotation(repo, starting_commit.id(), domain, file_path, source)
}
/// Get line by line annotations for a specific file path starting with the
/// given content.
///
/// The file content at the `starting_commit` is set to `starting_text`. This is
/// typically one of the file contents in the conflict or merged-parent tree.
///
/// See [`get_annotation_for_file()`] for the other arguments.
pub fn get_annotation_with_file_content(
repo: &dyn Repo,
starting_commit_id: &CommitId,
domain: &Rc<ResolvedRevsetExpression>,
file_path: &RepoPath,
starting_text: impl Into<Vec<u8>>,
) -> Result<FileAnnotation, RevsetEvaluationError> {
let source = Source::new(BString::new(starting_text.into()));
compute_file_annotation(repo, starting_commit_id, domain, file_path, source)
}
fn compute_file_annotation(
repo: &dyn Repo,
starting_commit_id: &CommitId,
domain: &Rc<ResolvedRevsetExpression>,
file_path: &RepoPath,
mut source: Source,
) -> Result<FileAnnotation, RevsetEvaluationError> {
source.fill_line_map();
let text = source.text.clone();
let line_map = process_commits(repo, starting_commit_id, source, domain, file_path)?;
Ok(FileAnnotation { line_map, text })
}
/// Starting at the starting commit, compute changes at that commit relative to
/// it's direct parents, updating the mappings as we go. We return the final
/// original line map that represents where each line of the original came from.
fn process_commits(
repo: &dyn Repo,
starting_commit_id: &CommitId,
starting_source: Source,
domain: &Rc<ResolvedRevsetExpression>,
file_name: &RepoPath,
) -> Result<OriginalLineMap, RevsetEvaluationError> {
let predicate = RevsetFilterPredicate::File(FilesetExpression::file_path(file_name.to_owned()));
// TODO: If the domain isn't a contiguous range, changes masked out by it
// might not be caught by the closest ancestor revision. For example,
// domain=merges() would pick up almost nothing because merge revisions
// are usually empty. Perhaps, we want to query `files(file_path,
// within_sub_graph=domain)`, not `domain & files(file_path)`.
let ancestors = RevsetExpression::commit(starting_commit_id.clone()).ancestors();
let revset = RevsetExpression::commit(starting_commit_id.clone())
.union(&domain.intersection(&ancestors).filtered(predicate))
.evaluate(repo)?;
let mut original_line_map =
vec![Err(starting_commit_id.clone()); starting_source.line_map.len()];
let mut commit_source_map = HashMap::from([(starting_commit_id.clone(), starting_source)]);
for node in revset.iter_graph() {
let (commit_id, edge_list) = node?;
process_commit(
repo,
file_name,
&mut original_line_map,
&mut commit_source_map,
&commit_id,
&edge_list,
)?;
if commit_source_map.is_empty() {
// No more lines to propagate to ancestors.
break;
}
}
Ok(original_line_map)
}
/// For a given commit, for each parent, we compare the version in the parent
/// tree with the current version, updating the mappings for any lines in
/// common. If the parent doesn't have the file, we skip it.
fn process_commit(
repo: &dyn Repo,
file_name: &RepoPath,
original_line_map: &mut OriginalLineMap,
commit_source_map: &mut CommitSourceMap,
current_commit_id: &CommitId,
edges: &[GraphEdge<CommitId>],
) -> Result<(), BackendError> {
let Some(mut current_source) = commit_source_map.remove(current_commit_id) else {
return Ok(());
};
for parent_edge in edges {
let parent_commit_id = &parent_edge.target;
let parent_source = match commit_source_map.entry(parent_commit_id.clone()) {
hash_map::Entry::Occupied(entry) => entry.into_mut(),
hash_map::Entry::Vacant(entry) => {
let commit = repo.store().get_commit(entry.key())?;
entry.insert(Source::load(&commit, file_name)?)
}
};
// For two versions of the same file, for all the lines in common,
// overwrite the new mapping in the results for the new commit. Let's
// say I have a file in commit A and commit B. We know that according to
// local line_map, in commit A, line 3 corresponds to line 7 of the
// original file. Now, line 3 in Commit A corresponds to line 6 in
// commit B. Then, we update local line_map to say that "Commit B line 6
// goes to line 7 of the original file". We repeat this for all lines in
// common in the two commits.
let mut current_lines = current_source.line_map.iter().copied().peekable();
let mut new_current_line_map = Vec::new();
let mut new_parent_line_map = Vec::new();
copy_same_lines_with(
¤t_source.text,
&parent_source.text,
|current_start, parent_start, count| {
new_current_line_map
.extend(current_lines.peeking_take_while(|&(cur, _)| cur < current_start));
while let Some((current, original)) =
current_lines.next_if(|&(cur, _)| cur < current_start + count)
{
let parent = parent_start + (current - current_start);
new_parent_line_map.push((parent, original));
}
},
);
new_current_line_map.extend(current_lines);
current_source.line_map = new_current_line_map;
parent_source.line_map = if parent_source.line_map.is_empty() {
new_parent_line_map
} else {
itertools::merge(parent_source.line_map.iter().copied(), new_parent_line_map).collect()
};
// If an omitted parent had the file, leave these lines unresolved. The
// origin of the unresolved lines is represented as Err(root_commit_id).
if parent_edge.edge_type == GraphEdgeType::Missing {
for (_, original_line_number) in parent_source.line_map.drain(..) {
original_line_map[original_line_number] = Err(current_commit_id.clone());
}
}
if parent_source.line_map.is_empty() {
commit_source_map.remove(parent_commit_id);
}
}
// Once we've looked at all parents of a commit, any leftover lines must be
// original to the current commit, so we save this information in
// original_line_map.
for (_, original_line_number) in current_source.line_map {
original_line_map[original_line_number] = Ok(current_commit_id.clone());
}
Ok(())
}
/// For two files, calls `copy(current_start, parent_start, count)` for each
/// range of contiguous lines in common (e.g. line 8-10 maps to line 9-11.)
fn copy_same_lines_with(
current_contents: &[u8],
parent_contents: &[u8],
mut copy: impl FnMut(usize, usize, usize),
) {
let diff = Diff::by_line([current_contents, parent_contents]);
let mut current_line_counter: usize = 0;
let mut parent_line_counter: usize = 0;
for hunk in diff.hunks() {
match hunk.kind {
DiffHunkKind::Matching => {
let count = hunk.contents[0].split_inclusive(|b| *b == b'\n').count();
copy(current_line_counter, parent_line_counter, count);
current_line_counter += count;
parent_line_counter += count;
}
DiffHunkKind::Different => {
let current_output = hunk.contents[0];
let parent_output = hunk.contents[1];
current_line_counter += current_output.split_inclusive(|b| *b == b'\n').count();
parent_line_counter += parent_output.split_inclusive(|b| *b == b'\n').count();
}
}
}
}
fn get_file_contents(
store: &Store,
path: &RepoPath,
tree: &MergedTree,
) -> Result<BString, BackendError> {
let file_value = tree.path_value(path)?;
let effective_file_value = materialize_tree_value(store, path, file_value).block_on()?;
match effective_file_value {
MaterializedTreeValue::File(mut file) => Ok(file.read_all(path)?.into()),
MaterializedTreeValue::FileConflict { contents, .. } => Ok(
materialize_merge_result_to_bytes(&contents, ConflictMarkerStyle::default()),
),
_ => Ok(BString::default()),
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_lines_iterator_empty() {
let annotation = FileAnnotation {
line_map: vec![],
text: "".into(),
};
assert_eq!(annotation.lines().collect_vec(), vec![]);
assert_eq!(annotation.line_ranges().collect_vec(), vec![]);
assert_eq!(annotation.compact_line_ranges().collect_vec(), vec![]);
}
#[test]
fn test_lines_iterator_with_content() {
let commit_id1 = CommitId::from_hex("111111");
let commit_id2 = CommitId::from_hex("222222");
let commit_id3 = CommitId::from_hex("333333");
let annotation = FileAnnotation {
line_map: vec![
Ok(commit_id1.clone()),
Ok(commit_id2.clone()),
Ok(commit_id3.clone()),
],
text: "foo\n\nbar\n".into(),
};
assert_eq!(
annotation.lines().collect_vec(),
vec![
(Ok(&commit_id1), "foo\n".as_ref()),
(Ok(&commit_id2), "\n".as_ref()),
(Ok(&commit_id3), "bar\n".as_ref()),
]
);
assert_eq!(
annotation.line_ranges().collect_vec(),
vec![
(Ok(&commit_id1), 0..4),
(Ok(&commit_id2), 4..5),
(Ok(&commit_id3), 5..9),
]
);
assert_eq!(
annotation.compact_line_ranges().collect_vec(),
vec![
(Ok(&commit_id1), 0..4),
(Ok(&commit_id2), 4..5),
(Ok(&commit_id3), 5..9),
]
);
}
#[test]
fn test_lines_iterator_compaction() {
let commit_id1 = CommitId::from_hex("111111");
let commit_id2 = CommitId::from_hex("222222");
let commit_id3 = CommitId::from_hex("333333");
let annotation = FileAnnotation {
line_map: vec![
Ok(commit_id1.clone()),
Ok(commit_id1.clone()),
Ok(commit_id2.clone()),
Ok(commit_id1.clone()),
Ok(commit_id3.clone()),
Ok(commit_id3.clone()),
Ok(commit_id3.clone()),
],
text: "\n".repeat(7).into(),
};
assert_eq!(
annotation.compact_line_ranges().collect_vec(),
vec![
(Ok(&commit_id1), 0..2),
(Ok(&commit_id2), 2..3),
(Ok(&commit_id1), 3..4),
(Ok(&commit_id3), 4..7),
]
);
}
}