rivox 1.0.0

Universal polyglot build coordination layer for Python, Rust, and Node monorepos
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79

use super::GraphNode;
use serde::{Deserialize, Serialize};
use std::collections::HashMap;

#[derive(Debug, Serialize, Deserialize, Clone, PartialEq, Eq)]
pub struct NodeDiff {
    pub package_name: String,
    pub ecosystem: String,
    pub old_version: Option<String>,
    pub new_version: Option<String>,
    pub old_hash: Option<String>,
    pub new_hash: Option<String>,
}

#[derive(Debug, Serialize, Deserialize, Clone)]
pub struct GraphDiffResult {
    pub added: Vec<GraphNode>,
    pub removed: Vec<GraphNode>,
    pub changed: Vec<NodeDiff>,
    pub unchanged_count: usize,
    pub rebuild_required: bool,
}

pub fn diff_graphs(old_nodes: &[GraphNode], new_nodes: &[GraphNode]) -> GraphDiffResult {
    let mut old_map: HashMap<(String, String), &GraphNode> = HashMap::new();
    for node in old_nodes {
        old_map.insert((node.ecosystem.clone(), node.package_name.clone()), node);
    }

    let mut new_map: HashMap<(String, String), &GraphNode> = HashMap::new();
    for node in new_nodes {
        new_map.insert((node.ecosystem.clone(), node.package_name.clone()), node);
    }

    let mut added = Vec::new();
    let mut removed = Vec::new();
    let mut changed = Vec::new();
    let mut unchanged_count = 0;

    for (key, new_node) in &new_map {
        match old_map.get(key) {
            Some(old_node) => {
                if old_node.resolved_version != new_node.resolved_version
                    || old_node.content_hash != new_node.content_hash
                {
                    changed.push(NodeDiff {
                        package_name: new_node.package_name.clone(),
                        ecosystem: new_node.ecosystem.clone(),
                        old_version: Some(old_node.resolved_version.clone()),
                        new_version: Some(new_node.resolved_version.clone()),
                        old_hash: Some(old_node.content_hash.clone()),
                        new_hash: Some(new_node.content_hash.clone()),
                    });
                } else {
                    unchanged_count += 1;
                }
            }
            None => {
                added.push((*new_node).clone());
            }
        }
    }

    for (key, old_node) in &old_map {
        if !new_map.contains_key(key) {
            removed.push((*old_node).clone());
        }
    }

    let rebuild_required = !added.is_empty() || !removed.is_empty() || !changed.is_empty();

    GraphDiffResult {
        added,
        removed,
        changed,
        unchanged_count,
        rebuild_required,
    }
}