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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
use std::collections::HashSet;
use eyre::Result;
use tokio::sync::mpsc;
use crate::cli::args::BackendArg;
use crate::deps_graph::DepsGraph;
use crate::toolset::tool_request::ToolRequest;
/// Unique key for a tool request (backend full name + version)
pub type ToolKey = String;
/// Creates a unique key for a ToolRequest
fn tool_key(tr: &ToolRequest) -> ToolKey {
format!("{}@{}", tr.ba().full(), tr.version())
}
/// Manages a dependency graph of tools for installation scheduling.
/// Thin wrapper around `DepsGraph<ToolKey, ToolRequest>` with
/// tool-specific dependency resolution.
#[derive(Debug)]
pub struct ToolDeps {
inner: DepsGraph<ToolKey, ToolRequest>,
}
impl ToolDeps {
/// Creates a new ToolDeps from a list of tool requests.
/// Builds the dependency graph based on each tool's dependencies.
/// Duplicate tool requests (same backend and version) are deduplicated.
pub fn new(requests: Vec<ToolRequest>) -> Result<Self> {
// Build nodes
let nodes: Vec<(ToolKey, ToolRequest)> = requests
.iter()
.map(|tr| (tool_key(tr), tr.clone()))
.collect();
// Build a set of all tool identifiers being installed for dependency lookup
let versions_hash: HashSet<String> =
requests.iter().flat_map(|tr| tr.ba().all_fulls()).collect();
// Compute edges from backend dependencies
let mut edges: Vec<(ToolKey, ToolKey)> = vec![];
for tr in &requests {
let tr_key = tool_key(tr);
if let Ok(backend) = tr.backend()
&& let Ok(deps) = backend.get_all_dependencies(true)
{
for dep_ba in deps {
let dep_fulls = dep_ba.all_fulls();
if dep_fulls.iter().any(|full| versions_hash.contains(full)) {
for other_tr in &requests {
let other_fulls = other_tr.ba().all_fulls();
if dep_fulls.iter().any(|f| other_fulls.contains(f)) {
let other_key = tool_key(other_tr);
if tr_key != other_key {
edges.push((tr_key.clone(), other_key));
}
}
}
}
}
}
}
// Add edges from user-specified depends in tool options
for tr in &requests {
let tr_key = tool_key(tr);
if let Some(user_deps) = &tr.options().depends {
for dep_str in user_deps {
let dep_ba = BackendArg::from(dep_str.as_str());
let dep_fulls = dep_ba.all_fulls();
let mut found = false;
for other_tr in &requests {
let other_fulls = other_tr.ba().all_fulls();
if dep_fulls.iter().any(|f| other_fulls.contains(f)) {
let other_key = tool_key(other_tr);
if tr_key != other_key {
edges.push((tr_key.clone(), other_key));
found = true;
}
}
}
if !found {
warn!(
"tool '{}': depends on '{}' which is not in the current install set",
tr_key, dep_str
);
}
}
}
}
let inner = DepsGraph::new(nodes, edges, tool_key)?;
Ok(Self { inner })
}
/// Subscribe to receive tools that are ready to install.
pub fn subscribe(&mut self) -> mpsc::UnboundedReceiver<Option<ToolRequest>> {
self.inner.subscribe()
}
/// Mark a tool as successfully installed and emit any newly-ready tools.
pub fn complete_success(&mut self, tr: &ToolRequest) {
self.inner.complete_success(&tool_key(tr));
}
/// Mark a tool as failed and block all transitive dependents.
pub fn complete_failure(&mut self, tr: &ToolRequest) {
self.inner.complete_failure(&tool_key(tr));
}
/// Returns the list of blocked tools (those whose dependencies failed or are in cycles)
pub fn blocked_tools(&self) -> Vec<ToolRequest> {
self.inner.blocked_nodes()
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_empty_deps() {
let _deps = ToolDeps::new(vec![]).unwrap();
}
}