mirrors/jj
1
0
Fork 1
mirror of https://github.com/martinvonz/jj.git synced 2025-01-18 02:04:19 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 5

dag_walk: delete unused common_ancestor()

Browse source
This commit is contained in:
Martin von Zweigbergk 2023-01-28 14:56:03 -08:00 committed by Martin von Zweigbergk
parent 890327ea68
commit be638d0205
1 changed files with 0 additions and 15 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

15
lib/src/dag_walk.rs
View file

@ -16,8 +16,6 @@ use std::collections::HashSet;
use std::hash::Hash;
use std::iter::Iterator;
use crate::commit::Commit;
pub struct BfsIter<'id_fn, 'neighbors_fn, T, ID, NI> {
id_fn: Box<dyn Fn(&T) -> ID + 'id_fn>,
neighbors_fn: Box<dyn FnMut(&T) -> NI + 'neighbors_fn>,
@ -174,19 +172,6 @@ where
reachable
}
pub fn common_ancestor<'a, I1, I2>(set1: I1, set2: I2) -> Commit
where
I1: IntoIterator<Item = &'a Commit>,
I2: IntoIterator<Item = &'a Commit>,
{
let set1: Vec<Commit> = set1.into_iter().cloned().collect();
let set2: Vec<Commit> = set2.into_iter().cloned().collect();
closest_common_node(set1, set2, &|commit| commit.parents(), &|commit| {
commit.id().clone()
})
.unwrap()
}
pub fn closest_common_node<T, ID, II1, II2, NI>(
set1: II1,
set2: II2,