callisto-graph 0.4.1

Callisto Release Engine — Dependency DAG solver and topological cascade release planner.
Documentation 
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

use std::collections::BTreeMap;

use callisto_model::{DepEdge, Diagnostic, Package, PackageId};

use crate::identity::IdentityIndex;

pub use callisto_model::DependencyResolver;

pub struct ManifestWalkResolver {
    pub(crate) packages: BTreeMap<PackageId, Package>,
    pub(crate) edges: Vec<DepEdge>,
    pub(crate) out_index: BTreeMap<PackageId, Vec<usize>>,
    pub(crate) in_index: BTreeMap<PackageId, Vec<usize>>,
    pub(crate) index: IdentityIndex,
    pub(crate) diagnostics: Vec<Diagnostic>,
}

impl ManifestWalkResolver {
    pub fn diagnostics(&self) -> &[Diagnostic] {
        &self.diagnostics
    }

    pub fn identity(&self) -> &IdentityIndex {
        &self.index
    }

    pub fn get(&self, id: &PackageId) -> Option<&Package> {
        self.packages.get(id)
    }

    pub fn edges(&self) -> &[DepEdge] {
        &self.edges
    }
}

impl DependencyResolver for ManifestWalkResolver {
    fn packages(&self) -> impl Iterator<Item = &Package> {
        self.packages.values()
    }

    fn dependencies_of(&self, id: &PackageId) -> impl Iterator<Item = &DepEdge> {
        // Avoid an intermediate Vec by streaming index lookups directly as edge references.
        let edges = &self.edges;
        self.out_index
            .get(id)
            .into_iter()
            .flat_map(|v| v.iter())
            .map(move |&idx| &edges[idx])
    }

    fn dependents_of(&self, id: &PackageId) -> impl Iterator<Item = &DepEdge> {
        let edges = &self.edges;
        self.in_index
            .get(id)
            .into_iter()
            .flat_map(|v| v.iter())
            .map(move |&idx| &edges[idx])
    }

    fn diagnostics(&self) -> &[Diagnostic] {
        &self.diagnostics
    }
}