repopilot 0.18.0

Local-first CLI for reviewing Git changes, security boundaries, and blast radius before merge.
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
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

use super::topology;
use crate::graph::v2::{GraphNodeId, GraphSnapshot};
use std::collections::BTreeMap;

#[derive(Debug, Default, Clone, PartialEq, Eq)]
pub struct GraphDegreeSummary {
    pub nodes: Vec<NodeDegree>,
}

#[derive(Debug, Clone, PartialEq, Eq)]
pub struct NodeDegree {
    pub node_id: GraphNodeId,
    pub fan_in: usize,
    pub fan_out: usize,
}

impl NodeDegree {
    /// instability = fan_out / (fan_in + fan_out); 0.0 when the node has no
    /// edges. Owns the derived coupling metric in graph v2 so rules no longer
    /// recompute it from the v1 graph.
    pub fn instability(&self) -> f32 {
        let total = self.fan_in + self.fan_out;
        if total == 0 {
            0.0
        } else {
            self.fan_out as f32 / total as f32
        }
    }
}

pub fn compute_degrees(snapshot: &GraphSnapshot) -> GraphDegreeSummary {
    let topology = topology(snapshot);
    let mut degrees = topology
        .node_ids
        .into_iter()
        .map(|node_id| {
            (
                node_id.clone(),
                NodeDegree {
                    node_id,
                    fan_in: 0,
                    fan_out: 0,
                },
            )
        })
        .collect::<BTreeMap<_, _>>();

    for edge in topology.edges {
        degrees
            .get_mut(&edge.from)
            .expect("validated source node")
            .fan_out += 1;
        degrees
            .get_mut(&edge.to)
            .expect("validated target node")
            .fan_in += 1;
    }

    GraphDegreeSummary {
        nodes: degrees.into_values().collect(),
    }
}

pub fn top_fan_in(summary: &GraphDegreeSummary, limit: usize) -> Vec<NodeDegree> {
    if limit == 0 {
        return Vec::new();
    }

    let mut nodes = summary
        .nodes
        .iter()
        .filter(|node| node.fan_in > 0)
        .cloned()
        .collect::<Vec<_>>();
    nodes.sort_by(|left, right| {
        right
            .fan_in
            .cmp(&left.fan_in)
            .then_with(|| right.fan_out.cmp(&left.fan_out))
            .then_with(|| left.node_id.cmp(&right.node_id))
    });
    nodes.truncate(limit);
    nodes
}

pub fn top_fan_out(summary: &GraphDegreeSummary, limit: usize) -> Vec<NodeDegree> {
    if limit == 0 {
        return Vec::new();
    }

    let mut nodes = summary
        .nodes
        .iter()
        .filter(|node| node.fan_out > 0)
        .cloned()
        .collect::<Vec<_>>();
    nodes.sort_by(|left, right| {
        right
            .fan_out
            .cmp(&left.fan_out)
            .then_with(|| right.fan_in.cmp(&left.fan_in))
            .then_with(|| left.node_id.cmp(&right.node_id))
    });
    nodes.truncate(limit);
    nodes
}