mirrors/jj
1
0
Fork 1
mirror of https://github.com/martinvonz/jj.git synced 2024-10-24 23:47:22 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 8

dag_walk: remove unused and untested leaves() function

Browse source
This commit is contained in:
Yuya Nishihara 2023-11-12 16:25:28 +09:00
parent ab214145eb
commit e5a9a26911
1 changed files with 0 additions and 35 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

35
lib/src/dag_walk.rs
View file

@ -319,41 +319,6 @@ where
result
}
pub fn leaves<T, ID, II, NI>(
start: II,
id_fn: impl Fn(&T) -> ID,
mut neighbors_fn: impl FnMut(&T) -> NI,
) -> HashSet<T>
where
T: Hash + Eq + Clone,
ID: Hash + Eq,
II: IntoIterator<Item = T>,
NI: IntoIterator<Item = T>,
{
let mut visited = HashSet::new();
let mut work: Vec<T> = start.into_iter().collect();
let mut leaves: HashSet<T> = work.iter().cloned().collect();
let mut non_leaves = HashSet::new();
while !work.is_empty() {
// TODO: make this not waste so much memory on the sets
let mut new_work = vec![];
for c in work {
let id: ID = id_fn(&c);
if visited.contains(&id) {
continue;
}
for p in neighbors_fn(&c) {
non_leaves.insert(c.clone());
new_work.push(p);
}
visited.insert(id);
leaves.insert(c);
}
work = new_work;
}
leaves.difference(&non_leaves).cloned().collect()
}
/// Find nodes in the start set that are not reachable from other nodes in the
/// start set.
pub fn heads<T, ID, II, NI>(