grapha 0.1.0

Blazingly fast code intelligence CLI and MCP server for Swift and Rust
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

pub mod json;
pub mod sqlite;

use crate::delta::{EntitySyncStats, GraphDelta, SyncMode};
use grapha_core::graph::Graph;

#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct StoreWriteStats {
    pub mode: SyncMode,
    pub nodes: EntitySyncStats,
    pub edges: EntitySyncStats,
}

impl StoreWriteStats {
    pub fn from_graphs(previous: Option<&Graph>, graph: &Graph, mode: SyncMode) -> Self {
        let (nodes, edges) = match previous {
            Some(previous_graph) => {
                let delta = GraphDelta::between(previous_graph, graph);
                (delta.node_stats(), delta.edge_stats())
            }
            None => (
                EntitySyncStats::from_total(graph.nodes.len()),
                EntitySyncStats::from_total(graph.edges.len()),
            ),
        };
        Self { mode, nodes, edges }
    }

    pub fn summary(self) -> String {
        format!(
            "{} nodes +{} ~{} -{}, edges +{} ~{} -{}",
            self.mode.label(),
            self.nodes.added,
            self.nodes.updated,
            self.nodes.deleted,
            self.edges.added,
            self.edges.updated,
            self.edges.deleted
        )
    }
}

/// Abstraction over graph storage backends.
pub trait Store {
    fn save(&self, graph: &Graph) -> anyhow::Result<()>;

    fn save_incremental(
        &self,
        previous: Option<&Graph>,
        graph: &Graph,
    ) -> anyhow::Result<StoreWriteStats> {
        let stats = StoreWriteStats::from_graphs(previous, graph, SyncMode::FullRebuild);
        self.save(graph)?;
        Ok(stats)
    }

    fn load(&self) -> anyhow::Result<Graph>;
}