repopilot 0.17.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

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

#[derive(Debug, Clone, PartialEq, Eq)]
pub struct GraphNeighborhood {
    pub center: GraphNodeId,
    pub node_ids: Vec<GraphNodeId>,
    pub edge_count: usize,
}

pub fn neighborhood(
    snapshot: &GraphSnapshot,
    center: &GraphNodeId,
    depth: usize,
) -> GraphNeighborhood {
    let topology = topology(snapshot);
    if !topology.node_set.contains(center) {
        return GraphNeighborhood {
            center: center.clone(),
            node_ids: Vec::new(),
            edge_count: 0,
        };
    }

    let mut visited = BTreeSet::from([center.clone()]);
    let mut queue = VecDeque::from([(center.clone(), 0usize)]);

    while let Some((node, distance)) = queue.pop_front() {
        if distance >= depth {
            continue;
        }

        let neighbors = topology.outgoing[&node]
            .iter()
            .chain(topology.incoming[&node].iter())
            .cloned()
            .collect::<BTreeSet<_>>();
        for neighbor in neighbors {
            if visited.insert(neighbor.clone()) {
                queue.push_back((neighbor, distance + 1));
            }
        }
    }

    let edge_count = topology
        .edges
        .iter()
        .filter(|edge| visited.contains(&edge.from) && visited.contains(&edge.to))
        .count();

    GraphNeighborhood {
        center: center.clone(),
        node_ids: visited.into_iter().collect(),
        edge_count,
    }
}