inkhaven 2.2.0

Inkhaven — TUI literary work editor for Typst books
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

//! 2.0 perf harness — `inkhaven _bench-graph` (hidden). Builds an isolated edge
//! store in a temp dir, inserts N edges fanning out from a small hub set, then
//! times neighbour queries against the hubs. Self-contained (no project /
//! fixture, no network), so it slots into the gated bench set like the others.
//! Drives the criterion `graph` bench.

use std::time::Instant;

use uuid::Uuid;

use crate::error::{Error, Result};
use crate::storage::edge_store::EdgeStore;
use crate::store::graph::{Edge, EdgeKind, EdgeOrigin, EndpointRef};

const HUBS: usize = 16;

/// Insert `edges` edges (timed) into an isolated temp store, then run `queries`
/// reverse-index neighbour lookups (timed, skipped when 0). Both figures are the
/// internal times, so the criterion `graph` bench can drive either metric
/// proportionally (`--edges <iters> --queries 0` for insert throughput; a fixed
/// `--edges` + `--queries <iters>` for query latency).
pub fn run(edges: usize, queries: usize) -> Result<()> {
    let dir = std::env::temp_dir().join(format!("inkhaven-bench-graph-{}", std::process::id()));
    std::fs::create_dir_all(&dir)
        .map_err(|e| Error::Config(format!("bench-graph tmp dir: {e}")))?;
    let path = dir.join("edges.db");
    let store = EdgeStore::new(&path, 2).map_err(|e| Error::Config(format!("bench-graph store: {e}")))?;

    let hubs: Vec<Uuid> = (0..HUBS).map(|_| Uuid::now_v7()).collect();
    let mut batch = Vec::with_capacity(edges);
    for i in 0..edges {
        let src = EndpointRef::Node(hubs[i % hubs.len()]);
        let dst = EndpointRef::Node(Uuid::now_v7());
        batch.push(Edge::new(src, EdgeKind::LinksTo, dst, EdgeOrigin::Structural));
    }

    let t_ins = Instant::now();
    store
        .insert_batch(&batch)
        .map_err(|e| Error::Config(format!("bench-graph insert: {e}")))?;
    let insert = t_ins.elapsed();

    // Neighbour queries against the hubs — exercises the reverse index.
    let t_q = Instant::now();
    let mut acc = 0usize;
    for i in 0..queries {
        let ep = EndpointRef::Node(hubs[i % hubs.len()]);
        acc += store
            .outgoing(&ep, &[])
            .map_err(|e| Error::Config(format!("bench-graph query: {e}")))?
            .len();
    }
    let query = t_q.elapsed();
    std::hint::black_box(acc);

    // Best-effort cleanup of the throwaway store.
    let _ = std::fs::remove_dir_all(&dir);

    println!("edge_count: {edges}");
    println!("edge_insert_total_us: {}", insert.as_micros());
    if queries > 0 {
        println!("edge_query_iters: {queries}");
        println!("edge_query_total_us: {}", query.as_micros());
        println!("edge_query_avg_us: {}", query.as_micros() / (queries as u128));
    }
    Ok(())
}