recall 0.4.2

Sync Claude Code's auto memory across machines and cloud sessions
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
107
108
109
110
111
112
113
114

//! `recall backfill` — the first sync, for a project whose memory predates
//! Recall.
//!
//! Loud, like `promote` and unlike the hooks: nobody types this by accident,
//! so a file that could not be sent is worth a line of output rather than a
//! silence. It is still not allowed to be destructive — the work of deciding
//! what is safe to send happens in `recall_hooks::backfill`, and what reaches
//! this module is the report.

use recall_hooks::{backfill, exit, Disposition, Entry};

use crate::project;

/// Sends what the server is missing, then says what it left behind and why.
pub async fn run() -> anyhow::Result<i32> {
    let ctx = project::resolve().hook_context()?;

    let outcome = match backfill(&ctx).await {
        Ok(outcome) => outcome,
        Err(err) => {
            eprintln!("recall: {err}");
            // Every error that reaches here happens before anything is sent —
            // the round trip that asks what the server holds, or a local read
            // that precedes the loop — so nothing was sent in either case.
            // The split is the one `promote` draws: the server's failure is
            // not the same as this machine's.
            return Ok(match err {
                recall_hooks::Error::Pull { .. } => exit::SERVER,
                _ => exit::CONFIG,
            });
        }
    };

    // Every disposition is counted. A summary that does not account for every
    // file invites the reader to assume the difference was fine, and the one
    // originally missing was `Deleted` — the category most worth noticing.
    println!(
        "recall: {} sent, {} already on the server, {} held back, {} deleted on the \
         server, {} skipped ({})",
        outcome.count(Disposition::Sent),
        outcome.count(Disposition::Matches),
        outcome.count(Disposition::Held),
        outcome.count(Disposition::Deleted),
        outcome.count(Disposition::Unroutable)
            + outcome.count(Disposition::NotUtf8)
            + outcome.count(Disposition::Refused)
            + outcome.count(Disposition::Ignored)
            + outcome.count(Disposition::Internal),
        ctx.project_key()
    );

    // Each list names files the user can act on. A count alone tells someone
    // that something is wrong without telling them where.
    list(
        &outcome.entries,
        Disposition::Held,
        "held back: the server has a different version of these, so they were \
         not overwritten. Edit one through Claude and the server merges the two. \
         Deleting your copy deletes the server's too:",
    );
    list(
        &outcome.entries,
        Disposition::Deleted,
        "deleted on the server: removed on another machine. 'recall pull' \
         removes them here:",
    );
    list(
        &outcome.entries,
        Disposition::Refused,
        "refused by the server, so they were skipped:",
    );
    list(
        &outcome.entries,
        Disposition::Unroutable,
        "not in any scope, so these belong nowhere. Each line says what would \
         change that:",
    );
    list(
        &outcome.entries,
        Disposition::NotUtf8,
        "not text, so they cannot be synced at all:",
    );
    list(
        &outcome.entries,
        Disposition::Ignored,
        "on disk but unreadable:",
    );

    if let Some(reason) = &outcome.baseline {
        eprintln!("\nrecall: {reason}");
    }
    if let Some(reason) = &outcome.stopped {
        eprintln!(
            "\nrecall: stopped {reason}\n  {} file(s) after it were not reached.",
            outcome.not_reached
        );
        return Ok(exit::SERVER);
    }
    Ok(exit::OK)
}

fn list(entries: &[Entry], what: Disposition, heading: &str) {
    let named: Vec<&Entry> = entries.iter().filter(|e| e.disposition == what).collect();
    if named.is_empty() {
        return;
    }
    println!("\n  {heading}");
    for entry in named {
        match &entry.detail {
            Some(why) => println!("    {}: {why}", entry.path),
            None => println!("    {}", entry.path),
        }
    }
}