|
| 1 | +use std::collections::{BTreeSet, HashMap}; |
| 2 | + |
| 3 | +use anyhow::bail; |
| 4 | + |
| 5 | +#[derive(Debug, Clone, PartialEq, Eq)] |
| 6 | +pub struct SkillNode { |
| 7 | + pub name: String, |
| 8 | + pub version: semver::Version, |
| 9 | + pub dependencies: Vec<SkillDependencyConstraint>, |
| 10 | +} |
| 11 | + |
| 12 | +#[derive(Debug, Clone, PartialEq, Eq)] |
| 13 | +pub struct SkillDependencyConstraint { |
| 14 | + pub name: String, |
| 15 | + pub version_req: semver::VersionReq, |
| 16 | +} |
| 17 | + |
| 18 | +pub fn resolve_load_order(nodes: Vec<SkillNode>) -> anyhow::Result<Vec<String>> { |
| 19 | + if nodes.is_empty() { |
| 20 | + return Ok(Vec::new()); |
| 21 | + } |
| 22 | + |
| 23 | + let mut by_name: HashMap<String, SkillNode> = HashMap::new(); |
| 24 | + for node in nodes { |
| 25 | + let name = node.name.trim().to_string(); |
| 26 | + if name.is_empty() { |
| 27 | + bail!("skill name cannot be empty"); |
| 28 | + } |
| 29 | + if by_name.insert(name.clone(), node).is_some() { |
| 30 | + bail!("duplicate skill definition: {name}"); |
| 31 | + } |
| 32 | + } |
| 33 | + |
| 34 | + let mut indegree: HashMap<String, usize> = HashMap::new(); |
| 35 | + let mut outgoing: HashMap<String, Vec<String>> = HashMap::new(); |
| 36 | + |
| 37 | + for (name, node) in &by_name { |
| 38 | + indegree.entry(name.clone()).or_insert(0); |
| 39 | + |
| 40 | + for dep in &node.dependencies { |
| 41 | + let dep_name = dep.name.trim(); |
| 42 | + if dep_name.is_empty() { |
| 43 | + bail!("dependency name cannot be empty (skill={name})"); |
| 44 | + } |
| 45 | + |
| 46 | + let Some(dep_node) = by_name.get(dep_name) else { |
| 47 | + bail!("missing dependency: skill={name}, dependency={dep_name}"); |
| 48 | + }; |
| 49 | + |
| 50 | + if !dep.version_req.matches(&dep_node.version) { |
| 51 | + bail!( |
| 52 | + "dependency version mismatch: skill={name}, dependency={dep_name}, requires={}, got={}", |
| 53 | + dep.version_req, |
| 54 | + dep_node.version |
| 55 | + ); |
| 56 | + } |
| 57 | + |
| 58 | + outgoing |
| 59 | + .entry(dep_name.to_string()) |
| 60 | + .or_default() |
| 61 | + .push(name.clone()); |
| 62 | + *indegree.entry(name.clone()).or_insert(0) += 1; |
| 63 | + } |
| 64 | + } |
| 65 | + |
| 66 | + let mut ready = BTreeSet::new(); |
| 67 | + for (name, degree) in &indegree { |
| 68 | + if *degree == 0 { |
| 69 | + ready.insert(name.clone()); |
| 70 | + } |
| 71 | + } |
| 72 | + |
| 73 | + let mut order = Vec::with_capacity(by_name.len()); |
| 74 | + while let Some(name) = ready.pop_first() { |
| 75 | + order.push(name.clone()); |
| 76 | + |
| 77 | + if let Some(next_skills) = outgoing.get(&name) { |
| 78 | + for next in next_skills { |
| 79 | + if let Some(entry) = indegree.get_mut(next) { |
| 80 | + *entry -= 1; |
| 81 | + if *entry == 0 { |
| 82 | + ready.insert(next.clone()); |
| 83 | + } |
| 84 | + } |
| 85 | + } |
| 86 | + } |
| 87 | + } |
| 88 | + |
| 89 | + if order.len() != by_name.len() { |
| 90 | + bail!("dependency cycle detected in skills graph"); |
| 91 | + } |
| 92 | + |
| 93 | + Ok(order) |
| 94 | +} |
0 commit comments