1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
use crate::models::{CargoCrate, Crate, CrateId};
use std::collections::{BTreeMap, BTreeSet};
use std::path::PathBuf;
pub struct DepGraph {
members: BTreeMap<CrateId, Crate>,
dependents: BTreeMap<CrateId, BTreeSet<CrateId>>,
}
impl DepGraph {
pub fn new() -> Self {
Self {
members: Default::default(),
dependents: Default::default(),
}
}
pub fn add_crate(&mut self, cc: CargoCrate) {
let cc = Crate::new(cc);
self.members.insert(cc.id, cc);
}
pub fn finalise(&mut self) {
let mut members = self.members.clone();
members.iter_mut().for_each(|(_, c)| c.process(&self));
members.iter().for_each(|(id, _crate)| {
_crate.dependencies.iter().for_each(|dep_id| {
self.dependents.entry(*dep_id).or_default().insert(*id);
});
});
let _ = std::mem::replace(&mut self.members, members);
}
pub fn get_crate(&self, id: CrateId) -> &Crate {
self.members.get(&id).as_ref().unwrap()
}
pub fn mut_crate(&mut self, id: CrateId) -> &mut Crate {
self.members.get_mut(&id).unwrap()
}
pub fn find_crate(&self, name: &String) -> Option<CrateId> {
self.members
.iter()
.find(|(_, c)| c.name() == name)
.map(|(id, _)| *id)
}
pub fn find_crate_by_path(&self, name: &String) -> Option<CrateId> {
self.members
.iter()
.find(|(_, c)| c.path() == &PathBuf::new().join(name))
.map(|(id, _)| *id)
}
pub fn get_dependents(&self, id: CrateId) -> Vec<CrateId> {
self.dependents
.get(&id)
.as_ref()
.map(|set| set.iter().cloned().collect())
.unwrap_or(vec![])
}
pub fn get_all(&self) -> Vec<&Crate> {
self.members.iter().map(|(_, c)| c).collect()
}
}