snyvi 1.30.0

use super::*;

fn temp_store() -> (Store, tempdir::Dir) {
    let dir = tempdir::Dir::new("snyvi-store");
    let paths = Paths {
        data_dir: dir.path.clone(),
        config_dir: dir.path.clone(),
        docs_dir: dir.path.join("docs"),
        db_path: dir.path.join("t.db"),
        token_path: dir.path.join("token"),
    };
    (Store::open(&paths).unwrap(), dir)
}

/// A document of its own, which is what most of these tests mean when they
/// set up two: the file behind it is its identity now, and a second send of
/// the same file is a version rather than a row. The body doubles as the
/// path because it is the thing that differs between them here; tests that
/// mean versions say so with `version_of`.
fn new_doc<'a>(title: &'a str, src: &'a str, wf: &'a str) -> NewDoc<'a> {
    version_of(src, title, src, wf)
}

/// The same file, sent again: a version of the document at `path`.
fn version_of<'a>(path: &'a str, title: &'a str, src: &'a str, wf: &'a str) -> NewDoc<'a> {
    NewDoc {
        project_root: "/p",
        project_name: "p",
        workflow_key: wf,
        workflow_title: wf,
        title,
        kind: Kind::Markdown,
        lang: None,
        source_path: Some(path),
        branch: None,
        origin: "cli",
        sender: "",
        desk: None,
        source: src.as_bytes(),
        staged: None,
        search_body: src,
        html: "<p>x</p>",
    }
}

/// What an old database lacks of 1.19's columns: a fixture that winds the
/// schema version back takes them off too, so step 7 adds them as it would.
const OLD_1_19: &str = "ALTER TABLE peers DROP COLUMN desk_id;
     ALTER TABLE peer_outbox DROP COLUMN text;
     ALTER TABLE desk_notes DROP COLUMN sent_by;";

/// And of 1.20's: the thread a note is in, which step 8 adds.
const OLD_1_20: &str = "ALTER TABLE desk_notes DROP COLUMN thread_id;";

/// And of 1.21's: a `run` turn's command, which step 9 adds.
const OLD_1_21: &str = "ALTER TABLE turns DROP COLUMN cmd;";

/// And of 1.22's: a folder's fingerprint and a friend's document's key, which
/// step 10 adds.
const OLD_1_22: &str = "ALTER TABLE projects DROP COLUMN repo;
     ALTER TABLE projects DROP COLUMN remote;
     ALTER TABLE projects DROP COLUMN printed_at;
     ALTER TABLE docs DROP COLUMN peer_key;";

/// And of 1.23's: where Save wrote a friend's document, and pairing's
/// second cut (`peer::COLUMNS_1_23`), which step 11 adds.
const OLD_1_23: &str = "ALTER TABLE docs DROP COLUMN saved_path;
     ALTER TABLE docs DROP COLUMN peer_frame;
     ALTER TABLE docs DROP COLUMN peer_ref;
     ALTER TABLE peers DROP COLUMN v;
     ALTER TABLE peers DROP COLUMN read_receipts;
     ALTER TABLE peer_outbox DROP COLUMN kind;
     ALTER TABLE peer_outbox DROP COLUMN re;
     ALTER TABLE peer_outbox DROP COLUMN extra;
     ALTER TABLE peer_outbox DROP COLUMN arrived_at;
     ALTER TABLE peer_outbox DROP COLUMN read_at;
     ALTER TABLE peer_outbox DROP COLUMN done_at;
     ALTER TABLE peer_outbox DROP COLUMN done_commit;
     ALTER TABLE peer_notes DROP COLUMN frame;
     ALTER TABLE peer_offers DROP COLUMN text;
     ALTER TABLE desk_notes DROP COLUMN sent_peer;
     ALTER TABLE desk_notes DROP COLUMN sent_frame;
     ALTER TABLE desk_notes DROP COLUMN told_at;";

/// And of 1.25's: a waiting frame's due time and its run of "not now"s, and
/// the two indexes, which step 12 adds. This one goes before the others:
/// SQLite will not drop a column an index reads, and 1.20's wind-back drops
/// the one `desk_notes_thread` is on.
const OLD_1_25: &str = "DROP INDEX IF EXISTS peer_outbox_unsent;
     DROP INDEX IF EXISTS desk_notes_thread;
     ALTER TABLE peer_outbox DROP COLUMN next_at;
     ALTER TABLE peer_outbox DROP COLUMN later;";

/// And of 1.26's: when a panel last took a thread up, which step 13 adds.
const OLD_1_26: &str = "ALTER TABLE threads DROP COLUMN taken_at;";

/// And of 1.30's: the Claude account a desk and a panel start as (step 14),
/// the card a turn was asked on (15), and a widget's desks, its time and
/// what its card said (16).
const OLD_1_30: &str = "ALTER TABLE desks DROP COLUMN account;
     ALTER TABLE panes DROP COLUMN account;
     ALTER TABLE panes_closed DROP COLUMN account;
     ALTER TABLE turns DROP COLUMN ask_group;
     ALTER TABLE desk_suggestions DROP COLUMN lasts;
     ALTER TABLE desk_suggestions DROP COLUMN detail;
     ALTER TABLE desk_suggestions DROP COLUMN note;
     ALTER TABLE widget_prefs DROP COLUMN desks;
     ALTER TABLE widget_prefs DROP COLUMN until;
     ALTER TABLE widget_prefs DROP COLUMN until_pane;";

#[test]
fn insert_get_previous_search() {
    let (s, _d) = temp_store();
    let a = s
        .insert(
            &new_id("a"),
            version_of("/p/PLAN.md", "Plan", "# Plan\n\nalpha bravo", "w"),
        )
        .unwrap();
    std::thread::sleep(std::time::Duration::from_millis(1100));
    let b = s
        .insert(
            &new_id("b"),
            version_of("/p/PLAN.md", "Plan", "# Plan\n\nalpha charlie", "w"),
        )
        .unwrap();
    assert_ne!(a.id, b.id);
    assert_eq!(s.get(&b.id).unwrap().unwrap().title, "Plan");
    assert_eq!(s.previous(&b).unwrap().unwrap().id, a.id);
    assert!(s.previous(&a).unwrap().is_none());
    let hits = s.search("charlie", 10).unwrap();
    assert_eq!(hits.len(), 1);
    assert_eq!(hits[0].id, b.id);
    assert!(
        s.search("\"unbalanced", 10).is_ok(),
        "punctuation must not break FTS"
    );
    assert_eq!(
        s.latest_for_path("/p", "/p/PLAN.md").unwrap().unwrap().id,
        b.id
    );
    // Two sends of one plan are one document with two versions: the lists
    // count what a reader can see, and history counts what was sent.
    let p = &s.projects().unwrap()[0];
    assert_eq!((p.docs, p.workflows), (1, 1));
    assert_eq!(s.project_tree(p.id, 10, 10).unwrap()[0].docs.len(), 1);
    assert_eq!(s.history(p.id, "/p/PLAN.md").unwrap().len(), 2);
}

#[test]
fn a_chosen_project_name_outranks_the_derived_one() {
    let (s, _d) = temp_store();
    let a = s.insert(&new_id("a"), new_doc("Plan", "one", "w")).unwrap();
    assert_eq!(a.project, "p");

    // The derived name follows the directory, so a send still refreshes it...
    let mut d = new_doc("Plan", "two", "w");
    d.project_name = "p-moved";
    let b = s.insert(&new_id("b"), d).unwrap();
    assert_eq!(b.project, "p-moved");

    // ...until it is named by hand, after which no send may reclaim the label.
    assert!(s.rename_project(b.project_id, "Auth work").unwrap());
    let mut d = new_doc("Plan", "three", "w");
    d.project_name = "p-moved-again";
    let c = s.insert(&new_id("c"), d).unwrap();
    assert_eq!(c.project_id, a.project_id, "the root is still the identity");
    assert_eq!(c.project, "Auth work");
    assert_eq!(s.projects().unwrap()[0].name, "Auth work");
    assert!(!s.rename_project(9999, "nobody").unwrap());
}

#[test]
fn a_renamed_workflow_keeps_the_key_that_sends_find_it_by() {
    let (s, _d) = temp_store();
    let a = s
        .insert(&new_id("a"), new_doc("Plan", "one", "sess-1"))
        .unwrap();
    assert_eq!(a.workflow_title, "sess-1");
    assert!(s.rename_workflow(a.workflow_id, "Auth refactor").unwrap());

    let b = s
        .insert(&new_id("b"), new_doc("Plan 2", "two", "sess-1"))
        .unwrap();
    assert_eq!(b.workflow_id, a.workflow_id, "same session, same workflow");
    assert_eq!(b.workflow_title, "Auth refactor");
    let t = s.project_tree(b.project_id, 10, 10).unwrap();
    assert_eq!(t[0].title, "Auth refactor");
    assert_eq!(t[0].key, "sess-1");
    assert!(!s.rename_workflow(9999, "nobody").unwrap());
}

#[test]
fn same_second_documents_keep_their_order() {
    // received_at counts whole seconds, so insertion order is the tiebreaker.
    let (s, _d) = temp_store();
    let a = s.insert(&new_id("a"), new_doc("A", "first", "w")).unwrap();
    let b = s.insert(&new_id("b"), new_doc("B", "second", "w")).unwrap();
    let c = s.insert(&new_id("c"), new_doc("C", "third", "w")).unwrap();
    // Three inserts land in one second on most machines and, on a slow
    // one, straddle a boundary -- so this asserted its own timing and
    // failed for it on a Windows runner. Put them in one second on
    // purpose: a clock that has to cooperate is not a precondition, and
    // the second they share is not what is being tested. What is, is that
    // rowid breaks the tie once received_at cannot.
    let t = a.received_at;
    s.conn
        .lock()
        .unwrap()
        .execute("UPDATE docs SET received_at = ?1", params![t])
        .unwrap();
    let (a, b, c) = (
        Doc {
            received_at: t,
            ..a
        },
        Doc {
            received_at: t,
            ..b
        },
        Doc {
            received_at: t,
            ..c
        },
    );
    let order: Vec<String> = s.inbox(9).unwrap().into_iter().map(|d| d.title).collect();
    assert_eq!(
        order,
        vec!["C", "B", "A"],
        "newest first even within a second"
    );
    assert_eq!(
        s.project_tree(c.project_id, 10, 10).unwrap()[0].docs[0].title,
        "C"
    );
    // Three files, so three documents, each the whole history of its own
    // and none of them the version before another.
    assert_eq!(s.history(a.project_id, "first").unwrap().len(), 1);
    assert!(
        s.previous(&b).unwrap().is_none() && s.previous(&c).unwrap().is_none(),
        "a different file is not a version of the one before it"
    );

    // A fourth send, of A's file, inside the same second: the tie `previous`
    // cannot break on received_at it breaks on rowid, which is the whole
    // point of the second these four share.
    let a2 = s
        .insert(&new_id("a2"), version_of("first", "A2", "first again", "w"))
        .unwrap();
    s.conn
        .lock()
        .unwrap()
        .execute("UPDATE docs SET received_at = ?1", params![t])
        .unwrap();
    let a2 = Doc {
        received_at: t,
        ..a2
    };
    assert_eq!(s.previous(&a2).unwrap().unwrap().id, a.id);
    assert!(
        s.previous(&a).unwrap().is_none(),
        "the first send of a file"
    );
    let order: Vec<String> = s.inbox(9).unwrap().into_iter().map(|d| d.title).collect();
    assert_eq!(order, vec!["A2", "C", "B"], "and A is behind A2 now");
}

#[test]
fn workflow_keys_ignore_case() {
    let (s, _d) = temp_store();
    let a = s
        .insert(&new_id("a"), new_doc("A", "one", "ksi pivot"))
        .unwrap();
    let b = s
        .insert(&new_id("b"), new_doc("B", "two", "ksi pivot"))
        .unwrap();
    assert_eq!(a.workflow_id, b.workflow_id, "same key is one workflow");
    assert_eq!(s.projects().unwrap()[0].workflows, 1);
}

#[test]
fn pin_and_prune() {
    let (s, _d) = temp_store();
    let a = s.insert(&new_id("a"), new_doc("A", "aaa", "w")).unwrap();
    let b = s.insert(&new_id("b"), new_doc("B", "bbb", "w")).unwrap();
    assert!(s.set_pinned(&a.id, true).unwrap());
    let dry = s.prune(now() + 10, true).unwrap();
    assert_eq!(dry.len(), 1);
    assert_eq!(s.count().unwrap(), 2, "dry run deletes nothing");
    let gone = s.prune(now() + 10, false).unwrap();
    assert_eq!(gone[0].0, b.id);
    assert_eq!(s.count().unwrap(), 1);
    assert!(s.get(&b.id).unwrap().is_none());
    assert!(s.html(&b.id).is_err(), "files removed");
    assert!(s.get(&a.id).unwrap().unwrap().pinned);
}

/// The census is what the reset sentence says and the reader types back:
/// a deleted document is not in it, a pinned one is counted twice over.
/// After the reset the store answers as a new one does, and the files are
/// gone with the rows.
#[test]
fn census_and_reset() {
    let (s, d) = temp_store();
    let a = s.insert(&new_id("a"), new_doc("A", "aaa", "w")).unwrap();
    let b = s.insert(&new_id("b"), new_doc("B", "bbb", "w")).unwrap();
    let c = s
        .insert(&new_id("c"), new_doc("C", "ccc", "other"))
        .unwrap();
    assert!(s.set_pinned(&a.id, true).unwrap());
    assert!(s.delete(&c.id).unwrap());
    assert_eq!(
        s.census().unwrap(),
        Census {
            documents: 2,
            projects: 1,
            pinned: 1,
            desks: 0,
        }
    );
    assert_eq!(std::fs::read_dir(d.path.join("docs")).unwrap().count(), 6);
    s.reset().unwrap();
    assert_eq!(s.census().unwrap(), Census::default());
    assert_eq!(s.count().unwrap(), 0);
    assert!(s.get(&a.id).unwrap().is_none());
    assert!(!s.undelete(&c.id).unwrap(), "the deleted one went too");
    assert!(
        s.search("aaa", 10).unwrap().is_empty(),
        "and the index with it"
    );
    assert_eq!(std::fs::read_dir(d.path.join("docs")).unwrap().count(), 0);
    // And it is a store again: the next document is the first.
    let again = s.insert(&new_id("b"), new_doc("B", "bbb", "w")).unwrap();
    assert_eq!(s.count().unwrap(), 1);
    assert!(s.previous(&again).unwrap().is_none());
    let _ = b;
}

/// A desk is not a document, which is a sentence about what the library
/// reads: the tree, the inbox, the queue, the counts and the search index
/// are all documents' and a desk is in none of them. What it does share is
/// the ending -- a reset promises a store as `open` makes it on a machine
/// that has never seen snyvi, and a workspace left standing would make
/// that false.
#[test]
fn a_desk_is_not_a_document_and_a_reset_still_takes_it() {
    let (s, _d) = temp_store();
    s.insert(&new_id("a"), new_doc("A", "aaa", "w")).unwrap();
    let desk = s.create_desk("/home/p/snyvi", None).unwrap();
    assert!(matches!(
        s.open_pane(desk.id, "/home/p/snyvi", "").unwrap(),
        Opened::Pane(_)
    ));

    // Nothing that reads the library can see it -- and the reset that
    // would take it says so.
    assert_eq!(s.count().unwrap(), 1);
    assert_eq!(s.census().unwrap().documents, 1);
    assert_eq!(s.census().unwrap().desks, 1);
    assert!(s.search("snyvi", 10).unwrap().is_empty());
    assert_eq!(s.projects().unwrap().len(), 1, "the desk made no project");
    assert_eq!(s.inbox(10).unwrap().len(), 1);
    assert!(s.get(&desk.id.to_string()).unwrap().is_none());

    // And it survives a restart, because that is what a desk is for.
    assert_eq!(s.desks().unwrap().len(), 1);
    assert_eq!(s.panes_open().unwrap(), 1);

    s.reset().unwrap();
    assert_eq!(s.census().unwrap(), Census::default());
    assert!(s.desks().unwrap().is_empty());
    assert_eq!(s.panes_open().unwrap(), 0);
    // A store again: the next desk is the first.
    let again = s.create_desk("/home/p/snyvi", None).unwrap();
    assert_eq!(again.name, "snyvi");
}

/// A key's or an account's value is not in the database, so a reset hands
/// back what it held for the caller to forget -- and takes the rows, or the
/// next desk 1 would start with the last desk 1's keys.
#[test]
fn a_reset_takes_the_keys_and_accounts_and_says_which_to_forget() {
    let (s, _d) = temp_store();
    let desk = s.create_desk("/home/p/snyvi", None).unwrap();
    s.add_desk_key(desk.id, "GH_TOKEN", "github").unwrap();
    s.add_desk_key(0, "OPENROUTER_API_KEY", "").unwrap();
    let work = s.add_claude_account("Work").unwrap();

    let mut held = s.reset().unwrap();
    held.keys.sort();
    assert_eq!(
        held,
        Held {
            keys: vec![
                (0, "OPENROUTER_API_KEY".into()),
                (desk.id, "GH_TOKEN".into())
            ],
            accounts: vec![work.id],
        }
    );
    assert!(s.claude_accounts().unwrap().is_empty());
    let again = s.create_desk("/home/p/snyvi", None).unwrap();
    assert_eq!(again.id, desk.id, "the id comes round again");
    assert!(
        s.desk_keys(again.id).unwrap().is_empty(),
        "without its keys"
    );
    assert_eq!(
        s.reset().unwrap(),
        Held::default(),
        "nothing the second time"
    );
}

/// A moved pane takes what it sent with it: the document pane 1 sent says
/// "[2]" once pane 1 is in position 2, and the other pane's the reverse.
#[test]
fn a_moved_pane_takes_its_documents_slot_with_it() {
    let (s, _d) = temp_store();
    let desk = s.create_desk("/home/p/snyvi", None).unwrap();
    for _ in 0..2 {
        assert!(matches!(
            s.open_pane(desk.id, "/home/p/snyvi", "").unwrap(),
            Opened::Pane(_)
        ));
    }
    let at = |slot| Origin {
        id: desk.id,
        name: "snyvi".into(),
        slot,
    };
    let (one, two) = (at(1), at(2));
    let mut d = new_doc("From one", "aaa", "w");
    d.desk = Some(&one);
    s.insert(&new_id("a"), d).unwrap();
    let mut d = new_doc("From two", "bbb", "w");
    d.desk = Some(&two);
    s.insert(&new_id("b"), d).unwrap();

    assert!(s.move_pane(desk.id, 1, 2).unwrap());
    let slot_of = |title: &str| {
        s.desk_docs(desk.id, 40, false)
            .unwrap()
            .into_iter()
            .find(|d| d.title == title)
            .unwrap()
            .slot
    };
    assert_eq!(slot_of("From one"), 2);
    assert_eq!(slot_of("From two"), 1);
    assert!(!s.move_pane(desk.id, 3, 1).unwrap(), "no pane at 3");
    assert_eq!(slot_of("From one"), 2, "a refused move changes nothing");
}

/// The rail's Documents list: what a pane on this desk sent, newest
/// first, and nothing another desk sent or the CLI did. A delete takes a
/// row off it, and an open clears its mark.
#[test]
fn a_desk_lists_what_its_panes_sent_newest_first() {
    let (s, _d) = temp_store();
    let here = Origin {
        id: 7,
        name: "snyvi".into(),
        slot: 2,
    };
    let elsewhere = Origin {
        id: 8,
        name: "other".into(),
        slot: 1,
    };
    fn from<'a>(o: &'a Origin, mut d: NewDoc<'a>) -> NewDoc<'a> {
        d.desk = Some(o);
        d
    }
    s.insert(&new_id("a"), from(&here, new_doc("First", "aaa", "w")))
        .unwrap();
    s.insert(
        &new_id("b"),
        from(&elsewhere, new_doc("Theirs", "bbb", "w")),
    )
    .unwrap();
    s.insert(&new_id("c"), new_doc("From the CLI", "ccc", "w"))
        .unwrap();
    let last = s
        .insert(&new_id("d"), from(&here, new_doc("Second", "ddd", "w")))
        .unwrap();

    let docs = s.desk_docs(7, 40, false).unwrap();
    assert_eq!(
        docs.iter().map(|d| d.title.as_str()).collect::<Vec<_>>(),
        ["Second", "First"]
    );
    assert_eq!(docs[0].slot, 2);
    assert!(docs[0].unread);
    assert_eq!(docs[0].project, "p");
    assert_eq!(s.desk_docs(8, 40, false).unwrap().len(), 1);
    assert!(s.desk_docs(9, 40, false).unwrap().is_empty());

    s.mark_read(&last.id).unwrap();
    assert!(!s.desk_docs(7, 40, false).unwrap()[0].unread);
    s.delete(&last.id).unwrap();
    assert_eq!(s.desk_docs(7, 40, false).unwrap().len(), 1);

    // The same file again is the same row, not another: a pane rewriting
    // what it sent leaves the desk holding one of it.
    let again = s
        .insert(
            &new_id("e"),
            from(&here, version_of("aaa", "First, again", "eee", "w")),
        )
        .unwrap();
    assert_eq!(
        s.desk_docs(7, 40, false)
            .unwrap()
            .iter()
            .map(|d| d.title.as_str())
            .collect::<Vec<_>>(),
        ["First, again"]
    );
    // ...and a version of it sent from anywhere else leaves that row alone,
    // because what a desk shows is what its own panes sent.
    s.insert(
        &new_id("f"),
        version_of("aaa", "First, elsewhere", "fff", "w"),
    )
    .unwrap();
    let listed = s.desk_docs(7, 40, false).unwrap();
    assert_eq!(listed.len(), 1);
    assert_eq!(listed[0].id, again.id);

    // Removed from the desk's list: gone from it, on the other half, and
    // no older version comes up in its place. Undo puts it back.
    assert!(s.set_desk_doc_off(7, &again.id, true).unwrap());
    assert!(s.desk_docs(7, 40, false).unwrap().is_empty());
    let off = s.desk_docs(7, 40, true).unwrap();
    assert_eq!(off.len(), 1);
    assert_eq!(off[0].id, again.id);
    // Another desk's document is not this desk's to remove.
    assert!(!s.set_desk_doc_off(8, &again.id, true).unwrap());
    assert!(s.set_desk_doc_off(7, &again.id, false).unwrap());
    assert_eq!(s.desk_docs(7, 40, false).unwrap()[0].id, again.id);
    assert!(s.desk_docs(7, 40, true).unwrap().is_empty());
}

/// A delete is gone from everywhere that reads the library and still on
/// disk, so Undo is one column -- and `prune` is what makes it final.
#[test]
fn a_file_sent_again_is_one_row_with_its_versions_behind_it() {
    let (s, _d) = temp_store();
    let first = s
        .insert(&new_id("1"), version_of("/p/S.md", "Script", "one", "w"))
        .unwrap();
    let second = s
        .insert(&new_id("2"), version_of("/p/S.md", "Script v2", "two", "w"))
        .unwrap();
    let third = s
        .insert(
            &new_id("3"),
            version_of("/p/S.md", "Script v3", "three", "w"),
        )
        .unwrap();
    let other = s
        .insert(&new_id("o"), new_doc("Notes", "elsewhere", "w"))
        .unwrap();

    // Every list shows the newest send and the other document. This is the
    // pile the sidebar used to be: one script, sent three times, three rows.
    let titles = |v: Vec<Doc>| v.into_iter().map(|d| d.title).collect::<Vec<_>>();
    assert_eq!(titles(s.inbox(10).unwrap()), vec!["Notes", "Script v3"]);
    let wfs = s.project_tree(first.project_id, 0, 0).unwrap();
    assert_eq!(titles(s.queue(10).unwrap()), vec!["Script v3", "Notes"]);
    // Home's Arrived reads the same rows the other way: newest first.
    assert_eq!(
        titles(s.newest_unread(10).unwrap()),
        vec!["Notes", "Script v3"]
    );
    assert_eq!(
        wfs[0]
            .docs
            .iter()
            .map(|d| d.title.as_str())
            .collect::<Vec<_>>(),
        ["Notes", "Script v3"]
    );
    assert_eq!(wfs[0].total, 2, "and it says two, not four");
    assert_eq!(s.projects().unwrap()[0].docs, 2);

    // Nothing was thrown away: the versions are where a reader goes for them.
    let hist = s.history(first.project_id, "/p/S.md").unwrap();
    assert_eq!(titles(hist), vec!["Script v3", "Script v2", "Script"]);
    assert_eq!(s.get(&first.id).unwrap().unwrap().title, "Script");
    assert_eq!(
        s.latest_for_path("/p", "/p/S.md").unwrap().unwrap().id,
        third.id
    );

    // And two things are waiting, not four: a version that replaced an
    // unread one took its place on the queue rather than queueing beside
    // it, so the badge counts rows a reader can actually reach.
    assert_eq!(s.waiting().unwrap(), 2);
    assert!(!s.mark_read(&second.id).unwrap(), "already off the queue");
    assert!(s.mark_read(&third.id).unwrap());
    assert_eq!(s.waiting().unwrap(), 1);
    let _ = other;
}

#[test]
fn removed_lists_what_can_come_back_newest_first_one_row_per_removal() {
    let (s, _d) = temp_store();
    s.insert(&new_id("1"), version_of("/p/S.md", "Script", "one", "w"))
        .unwrap();
    let newest = s
        .insert(&new_id("2"), version_of("/p/S.md", "Script v2", "two", "w"))
        .unwrap();
    let other = s
        .insert(&new_id("o"), new_doc("Notes", "elsewhere", "w"))
        .unwrap();
    s.insert(&new_id("k"), new_doc("Kept", "stays", "w"))
        .unwrap();
    assert!(
        s.removed(10, true).unwrap().is_empty(),
        "nothing removed, nothing listed"
    );

    assert_eq!(s.delete_versions(&newest.id).unwrap(), 2);
    s.delete(&other.id).unwrap();
    let desk = s.create_desk("/home/p/snyvi", None).unwrap();
    let note = s.add_desk_note(desk.id, "ship it").unwrap().unwrap();
    assert!(s.remove_desk_note(desk.id, note.id).unwrap());

    let docs: Vec<_> = s.removed(10, false).unwrap();
    assert!(
        docs.iter().all(|r| r.kind == "doc"),
        "no desk rows without the desk's gate"
    );
    assert_eq!(
        docs.len(),
        2,
        "one row for the lineage, one for the other: {docs:?}"
    );
    let script = docs
        .iter()
        .find(|r| r.versions == 2)
        .expect("the lineage says how many went");
    assert_eq!(script.title, "Script v2", "named by its newest version");
    assert_eq!(script.restore, format!("/api/docs/{}/undelete", script.id));

    let all = s.removed(10, true).unwrap();
    let n = all
        .iter()
        .find(|r| r.kind == "note")
        .expect("the removed note is listed");
    assert_eq!((n.title.as_str(), n.desk), ("ship it", Some(desk.id)));
    assert_eq!(
        n.restore,
        format!("/api/desks/{}/notes/{}/restore", desk.id, note.id)
    );
    assert!(all.windows(2).all(|w| w[0].at >= w[1].at), "newest first");

    // Brought back, it leaves the list.
    assert!(s.undelete(&script.id).unwrap());
    assert!(s.restore_desk_note(desk.id, note.id).unwrap());
    let left = s.removed(10, true).unwrap();
    assert_eq!(left.len(), 1);
    assert_eq!(left[0].title, "Notes");
}

#[test]
fn removing_a_document_takes_its_versions_and_undo_brings_them_back() {
    let (s, _d) = temp_store();
    let first = s
        .insert(&new_id("1"), version_of("/p/S.md", "Script", "one", "w"))
        .unwrap();
    let newest = s
        .insert(&new_id("2"), version_of("/p/S.md", "Script v2", "two", "w"))
        .unwrap();
    let keep = s
        .insert(&new_id("k"), new_doc("Notes", "elsewhere", "w"))
        .unwrap();

    // One ✕ on one row removes one document, versions and all -- otherwise
    // the version behind it takes its place and the delete reads as undone.
    // It says how many went, which is what the page's Undo names.
    assert_eq!(s.delete_versions(&newest.id).unwrap(), 2);
    assert!(s.get(&first.id).unwrap().is_none());
    assert_eq!(s.inbox(10).unwrap().len(), 1);
    assert!(s.history(first.project_id, "/p/S.md").unwrap().is_empty());
    assert_eq!(s.get(&keep.id).unwrap().unwrap().title, "Notes");

    assert!(s.undelete(&newest.id).unwrap());
    assert_eq!(
        s.history(first.project_id, "/p/S.md").unwrap().len(),
        2,
        "both versions came back, not just the one that was clicked"
    );
    assert_eq!(s.inbox(10).unwrap().len(), 2);

    // Reading an old version and pressing Delete removes the same thing: the
    // document it is a version of. Which snapshot is on screen is not a
    // different document to delete.
    assert!(s.delete(&first.id).unwrap());
    assert!(s.history(first.project_id, "/p/S.md").unwrap().is_empty());
    assert!(s.undelete(&first.id).unwrap());
    assert_eq!(s.history(first.project_id, "/p/S.md").unwrap().len(), 2);
}

#[test]
fn a_delete_can_be_taken_back_until_prune() {
    let (s, _d) = temp_store();
    let a = s.insert(&new_id("a"), new_doc("A", "alpha", "w")).unwrap();
    let b = s.insert(&new_id("b"), new_doc("B", "bravo", "w")).unwrap();
    assert!(s.delete(&b.id).unwrap());
    assert!(
        !s.delete(&b.id).unwrap(),
        "deleting it again changes nothing"
    );

    // Gone from every way the library is read.
    assert!(s.get(&b.id).unwrap().is_none());
    assert_eq!(s.count().unwrap(), 1);
    assert_eq!(s.inbox(10).unwrap().len(), 1);
    assert_eq!(s.waiting().unwrap(), 1, "and off the queue");
    assert!(s.search("bravo", 10).unwrap().is_empty());
    let wfs = s.project_tree(a.project_id, 0, 0).unwrap();
    assert_eq!(wfs[0].total, 1);
    assert_eq!(wfs[0].docs.len(), 1);
    assert_eq!(s.projects().unwrap()[0].docs, 1, "the sidebar's count too");
    assert!(s.html(&b.id).is_ok(), "still on disk");

    // And back, queue place and all.
    assert!(s.undelete(&b.id).unwrap());
    assert!(!s.undelete(&b.id).unwrap(), "undoing twice changes nothing");
    assert_eq!(s.get(&b.id).unwrap().unwrap().title, "B");
    assert_eq!(s.waiting().unwrap(), 2);
    assert_eq!(s.search("bravo", 10).unwrap().len(), 1);

    // Pruned, and now it is gone for good -- pinned or not, old or not.
    assert!(s.set_pinned(&b.id, true).unwrap());
    assert!(s.delete(&b.id).unwrap());
    let gone = s.prune(0, false).unwrap();
    assert_eq!(gone.len(), 1, "nothing here is old enough but this one");
    assert_eq!(gone[0].0, b.id);
    assert!(!s.undelete(&b.id).unwrap(), "nothing left to put back");
    assert!(s.html(&b.id).is_err(), "files removed");
    assert_eq!(s.get(&a.id).unwrap().unwrap().title, "A");
}

/// The queue is the unread set in arrival order: every insert joins it,
/// an open leaves it once, an overwrite changes nothing about it, and a
/// clear empties it and says what left.
#[test]
fn the_queue_is_what_arrived_and_was_not_opened() {
    let (s, _d) = temp_store();
    assert!(s.queue(10).unwrap().is_empty());
    let a = s.insert(&new_id("a"), new_doc("A", "aaa", "w")).unwrap();
    let b = s.insert(&new_id("b"), new_doc("B", "bbb", "w")).unwrap();
    let ids = |q: Vec<Doc>| q.into_iter().map(|d| d.id).collect::<Vec<_>>();
    assert_eq!(
        ids(s.queue(10).unwrap()),
        vec![a.id.clone(), b.id.clone()],
        "oldest first"
    );
    assert_eq!(s.waiting().unwrap(), 2);
    assert!(s.mark_read(&a.id).unwrap());
    assert!(!s.mark_read(&a.id).unwrap(), "already read");
    assert_eq!(s.waiting().unwrap(), 1);
    assert_eq!(ids(s.queue(10).unwrap()), vec![b.id.clone()]);
    s.replace(&b.id, new_doc("B2", "bbb2", "w")).unwrap();
    assert_eq!(
        ids(s.queue(10).unwrap()),
        vec![b.id.clone()],
        "an overwrite is not an arrival"
    );
    let c = s.insert(&new_id("c"), new_doc("C", "ccc", "w")).unwrap();
    let cleared = s.mark_all_read().unwrap();
    assert_eq!(cleared, vec![b.id, c.id]);
    assert!(s.queue(10).unwrap().is_empty());
    assert!(s.mark_all_read().unwrap().is_empty());
    // And taken back: both wait again, in the order they came, and one
    // removed in between stays gone.
    s.delete(&cleared[1]).unwrap();
    let back = s.mark_unread(&cleared).unwrap();
    assert_eq!(back, vec![cleared[0].clone()]);
    assert_eq!(ids(s.queue(10).unwrap()), vec![cleared[0].clone()]);
    assert!(
        s.mark_unread(&cleared).unwrap().is_empty(),
        "already waiting"
    );
}

#[test]
fn replace_keeps_id_and_updates_index() {
    let (s, _d) = temp_store();
    let a = s
        .insert(&new_id("a"), new_doc("A", "first draft", "w"))
        .unwrap();
    let r = s
        .replace(&a.id, new_doc("A2", "second draft", "w"))
        .unwrap();
    assert_eq!(r.id, a.id);
    assert_eq!(r.title, "A2");
    assert_eq!(s.source(&a.id).unwrap(), "second draft");
    assert!(s.search("first", 5).unwrap().is_empty());
    assert_eq!(s.search("second", 5).unwrap().len(), 1);
}

/// The sidebar is bounded, which is the whole point of these three queries:
/// a project row costs the same whatever is behind it, an expanded project
/// is a screenful, and everything past the caps is still reachable -- whole,
/// and only when asked for.
#[test]
fn an_expanded_project_is_a_screenful_not_a_year() {
    let (s, _d) = temp_store();
    // Twelve sessions of twelve documents: past both caps, in both
    // directions, so a cap that only held in one would show here.
    for w in 0..12 {
        for i in 0..12 {
            let body = format!("session {w}, document {i}");
            s.insert(
                &new_id(&format!("d{w}-{i}")),
                new_doc("Plan", &body, &format!("sess-{w}")),
            )
            .unwrap();
        }
    }

    let p = s.projects().unwrap();
    assert_eq!(p.len(), 1);
    assert_eq!(
        (p[0].docs, p[0].workflows),
        (144, 12),
        "a row carries what is behind it as two numbers, not as rows"
    );

    let capped = s.project_tree(p[0].id, 10, 10).unwrap();
    assert_eq!(capped.len(), 10, "ten of the twelve sessions");
    assert!(
        capped.iter().all(|w| w.docs.len() == 10 && w.total == 12),
        "ten documents each, and each says it holds twelve"
    );

    let all = s.project_tree(p[0].id, 0, 0).unwrap();
    assert_eq!(all.len(), 12, "a zero cap is a reader asking for the rest");
    assert!(all.iter().all(|w| w.docs.len() == 12));

    // What `[` and `]` walk. Never capped: a reader stepping back through
    // the versions of a plan has to reach the first one.
    let w = s.workflow_tree(capped[0].id).unwrap().unwrap();
    assert_eq!((w.docs.len(), w.total), (12, 12));
    assert!(s.workflow_tree(9999).unwrap().is_none());
}

/// A database from before the reader's desk order comes forward with the
/// order it had: the order the desks were made in.
#[test]
fn an_older_database_keeps_its_desk_order_on_the_upgrade() {
    let dir = tempdir::Dir::new("snyvi-store-pos");
    let paths = Paths {
        data_dir: dir.path.clone(),
        config_dir: dir.path.clone(),
        docs_dir: dir.path.join("docs"),
        db_path: dir.path.join("t.db"),
        token_path: dir.path.join("token"),
    };
    {
        let conn = Connection::open(&paths.db_path).unwrap();
        conn.execute_batch(SCHEMA).unwrap();
        conn.execute_batch(desk::SCHEMA).unwrap();
        conn.execute_batch(
            // Version 0: the schema as first made, with none of the
            // columns version 1 adds, which is what a database that
            // never counted its version holds.
            "INSERT INTO desks(id, name, root, created_at) VALUES(7, 'late', '/w', 0);
             INSERT INTO desks(id, name, root, created_at) VALUES(3, 'early', '/w', 0);
             PRAGMA user_version = 0;",
        )
        .unwrap();
    }
    let store = Store::open(&paths).unwrap();
    let names: Vec<String> = store.desks().unwrap().into_iter().map(|d| d.name).collect();
    assert_eq!(names, ["early", "late"]);
    let made = store.create_desk("/w", Some("new")).unwrap();
    assert_eq!(store.desks().unwrap().last().map(|d| d.id), Some(made.id));
}

/// A 1.15 database with a studio desk in it opens as a terminal desk on the
/// same folder, with its panel, and nothing else about it changes.
#[test]
fn a_studio_desk_from_1_15_opens_as_a_desk_on_its_folder() {
    let dir = tempdir::Dir::new("snyvi-retire-studio");
    let paths = Paths {
        data_dir: dir.path.clone(),
        config_dir: dir.path.clone(),
        docs_dir: dir.path.join("docs"),
        db_path: dir.path.join("t.db"),
        token_path: dir.path.join("token"),
    };
    let (studio, pane) = {
        let s = Store::open(&paths).unwrap();
        let d = s.create_desk("/home/me/Studio", Some("studio")).unwrap();
        let crate::desk::Opened::Pane(p) = s.open_pane(d.id, "/home/me/Studio", "claude").unwrap()
        else {
            panic!("a pane")
        };
        (d.id, p.id)
    };
    // What 1.15 wrote for it, at 1.15's schema version -- and without the
    // column 1.17 added, so the steps from 3 run as they would there.
    let conn = rusqlite::Connection::open(&paths.db_path).unwrap();
    conn.execute_batch(&format!(
        "UPDATE desks SET kind = 'studio', boards = root, row = 0.62 WHERE id = {studio};
         DROP INDEX docs_head; DROP VIEW head_docs; ALTER TABLE docs DROP COLUMN is_head;
         {OLD_1_25}
         {OLD_1_26}
         {OLD_1_30}
             {OLD_1_19}
         {OLD_1_20}
         {OLD_1_21}
         {OLD_1_22}
         {OLD_1_23}
         PRAGMA user_version = 3;"
    ))
    .unwrap();
    drop(conn);

    let s = Store::open(&paths).unwrap();
    let d = s.desk(studio).unwrap().unwrap();
    assert_eq!(
        (d.name.as_str(), d.root.as_str()),
        ("studio", "/home/me/Studio")
    );
    assert_eq!(d.panes.len(), 1);
    assert_eq!(d.panes[0].id, pane);
    let conn = rusqlite::Connection::open(&paths.db_path).unwrap();
    let (kind, boards): (String, String) = conn
        .query_row(
            &format!("SELECT kind, boards FROM desks WHERE id = {studio}"),
            [],
            |r| Ok((r.get(0)?, r.get(1)?)),
        )
        .unwrap();
    assert_eq!(kind, "terminal");
    assert_eq!(boards, "/home/me/Studio", "the column is left as it was");
    // And it takes the four panels every desk holds.
    for _ in 1..crate::desk::PER_DESK {
        assert!(matches!(
            s.open_pane(studio, "/home/me/Studio", "").unwrap(),
            crate::desk::Opened::Pane(_)
        ));
    }
}

/// How many virtual-machine steps a statement took, which is the count that
/// says whether SQLite looked at one row or at all of them. A clock would say
/// the same thing on a quiet machine and nothing on a busy one.
fn vm_steps(conn: &Connection, sql: &str, id: &str) -> i32 {
    let mut st = conn.prepare(sql).unwrap();
    st.execute(params![id]).unwrap();
    st.get_status(rusqlite::StatementStatus::VmStep)
}

fn fts_drift(conn: &Connection) -> i64 {
    conn.query_row(
        "SELECT COUNT(*) FROM docs_fts f JOIN docs d ON d.id = f.id WHERE f.rowid != d.rowid",
        [],
        |r| r.get(0),
    )
    .unwrap()
}

fn is_head(conn: &Connection, id: &str) -> i64 {
    conn.query_row("SELECT is_head FROM docs WHERE id = ?1", params![id], |r| {
        r.get(0)
    })
    .unwrap()
}

/// A save takes the document's index row out by its rowid: the same few
/// steps whether the library holds fifty documents or four hundred. The
/// delete by `id` it replaces reads every row of the index -- the steps grow
/// with the library -- which is what made every save of anything cost a
/// pass over 18 MB.
#[test]
fn a_save_takes_its_index_row_out_by_rowid_not_by_a_scan() {
    let (s, _d) = temp_store();
    let mut ids = vec![];
    for i in 0..400 {
        let body = format!("document {i} with words of its own number{i}");
        ids.push(
            s.insert(&new_id(&format!("d{i}")), new_doc("Plan", &body, "w"))
                .unwrap()
                .id,
        );
        if i == 49 {
            // Saved again, so the index rows have been through `replace` too.
            s.replace(&ids[10], new_doc("Plan", "document 10 saved again", "w"))
                .unwrap();
        }
    }
    let conn = s.conn.lock().unwrap();
    assert_eq!(
        fts_drift(&conn),
        0,
        "every index row sits at its document's rowid"
    );

    let tx = conn.unchecked_transaction().unwrap();
    let at_400 = vm_steps(&tx, FTS_DELETE, &ids[200]);
    let by_id_at_400 = vm_steps(&tx, "DELETE FROM docs_fts WHERE id = ?1", &ids[201]);
    tx.rollback().unwrap();
    // The library at fifty: everything past it gone, the delete measured again.
    conn.execute_batch(
        "DELETE FROM docs_fts WHERE rowid IN (SELECT rowid FROM docs WHERE rowid > 50);
         DELETE FROM docs WHERE rowid > 50;",
    )
    .unwrap();
    let tx = conn.unchecked_transaction().unwrap();
    let at_50 = vm_steps(&tx, FTS_DELETE, &ids[20]);
    tx.rollback().unwrap();

    assert!(
        (at_400 - at_50).abs() < 8,
        "by rowid, the cost does not follow the library: {at_50} steps at 50, {at_400} at 400"
    );
    assert!(at_400 < 120, "{at_400} steps is not one lookup");
    assert!(
        by_id_at_400 > 400,
        "the delete by id is the scan this guards against: {by_id_at_400} steps at 400"
    );
}

/// The same bytes saved again (the hook fires on a save that changed
/// nothing in the file, or only the render changed) rewrite the HTML, since
/// a renderer can change, and leave the search index alone: re-tokenising a
/// body that is the same body is the one cost of a save that buys nothing.
#[test]
fn a_save_that_changed_nothing_leaves_the_index_alone() {
    let (s, _d) = temp_store();
    let a = s
        .insert(&new_id("a"), new_doc("A", "the same draft alpha", "w"))
        .unwrap();
    let mut again = new_doc("A", "the same draft alpha", "w");
    again.search_body = "omega";
    again.html = "<p>rendered again</p>";
    let r = s.replace(&a.id, again).unwrap();
    assert_eq!(r.id, a.id);
    assert_eq!(s.html(&a.id).unwrap(), "<p>rendered again</p>");
    assert_eq!(
        s.search("alpha", 5).unwrap().len(),
        1,
        "the index row it had"
    );
    assert!(
        s.search("omega", 5).unwrap().is_empty(),
        "and not a new one"
    );
    let conn = s.conn.lock().unwrap();
    assert_eq!(fts_drift(&conn), 0);
    let rows: i64 = conn
        .query_row("SELECT COUNT(*) FROM docs_fts", [], |r| r.get(0))
        .unwrap();
    assert_eq!(rows, 1);
}

/// Which version of a file is the head is a column now, and every write that
/// can move it keeps it: a version arriving, the file removed and put back,
/// a save, and a prune that takes the newest.
#[test]
fn the_head_of_a_file_is_a_column_every_write_keeps() {
    let (s, _d) = temp_store();
    let v1 = s
        .insert(&new_id("1"), version_of("/p/F.md", "F", "one", "w"))
        .unwrap();
    let v2 = s
        .insert(&new_id("2"), version_of("/p/F.md", "F v2", "two", "w"))
        .unwrap();
    let loose = s
        .insert(&new_id("n"), new_doc("Notes", "elsewhere", "w"))
        .unwrap();
    let heads = |want: &[(&str, i64)]| {
        let conn = s.conn.lock().unwrap();
        for (id, h) in want {
            assert_eq!(is_head(&conn, id), *h, "is_head of {id}");
        }
    };
    heads(&[(&v1.id, 0), (&v2.id, 1), (&loose.id, 1)]);
    assert_eq!(s.projects().unwrap()[0].docs, 2);

    // Removed, with its versions: neither is a head. Back: the newest is.
    assert_eq!(s.delete_versions(&v2.id).unwrap(), 2);
    heads(&[(&v1.id, 0), (&v2.id, 0)]);
    assert_eq!(s.projects().unwrap()[0].docs, 1);
    assert!(s.undelete(&v2.id).unwrap());
    heads(&[(&v1.id, 0), (&v2.id, 1)]);

    // A save of the head is still the head.
    s.replace(&v2.id, version_of("/p/F.md", "F v2b", "two b", "w"))
        .unwrap();
    heads(&[(&v1.id, 0), (&v2.id, 1)]);

    // The newest pruned for age hands the row to the one before it.
    {
        let conn = s.conn.lock().unwrap();
        conn.execute(
            "UPDATE docs SET received_at = 1000 WHERE id = ?1",
            params![v2.id],
        )
        .unwrap();
    }
    s.set_pinned(&v1.id, true).unwrap();
    s.set_pinned(&loose.id, true).unwrap();
    let gone = s.prune(now() - 1, false).unwrap();
    assert_eq!(gone.len(), 1);
    assert_eq!(gone[0].0, v2.id);
    heads(&[(&v1.id, 1), (&loose.id, 1)]);
    assert_eq!(s.projects().unwrap()[0].docs, 2);
    let hist = s.history(v1.project_id, "/p/F.md").unwrap();
    assert_eq!(hist.len(), 1);
    let conn = s.conn.lock().unwrap();
    let (docs, fts): (i64, i64) = conn
        .query_row(
            "SELECT (SELECT COUNT(*) FROM docs), (SELECT COUNT(*) FROM docs_fts)",
            [],
            |r| Ok((r.get(0)?, r.get(1)?)),
        )
        .unwrap();
    assert_eq!((docs, fts), (2, 2), "the index row went with the document");
    assert_eq!(fts_drift(&conn), 0);
}

/// A desk's list is read through its index: four columns in the WHERE, and
/// without `docs_desk` the whole of `docs` for every draw of a desk.
#[test]
fn a_desks_list_is_read_through_its_index() {
    let (s, _d) = temp_store();
    let conn = s.conn.lock().unwrap();
    for off in [false, true] {
        let plan: Vec<String> = conn
            .prepare(&format!("EXPLAIN QUERY PLAN {}", desk_docs_sql(off)))
            .unwrap()
            .query_map(params![1i64, 10i64], |r| r.get::<_, String>(3))
            .unwrap()
            .collect::<std::result::Result<_, _>>()
            .unwrap();
        assert!(
            plan.iter()
                .any(|l| l.contains("docs USING INDEX docs_desk")),
            "off={off}: {plan:?}"
        );
    }
}

/// A 1.16 database comes forward on its first open: the index realigned to
/// the documents' rowids with the doubled row dropped, the workflows that
/// differed only by case folded (what used to run on every start, errors
/// dropped), and the head of each file worked out once. Then search, the
/// lists and a save work as on a new database.
#[test]
fn a_1_16_database_comes_forward_once() {
    let dir = tempdir::Dir::new("snyvi-store-116");
    let paths = Paths {
        data_dir: dir.path.clone(),
        config_dir: dir.path.clone(),
        docs_dir: dir.path.join("docs"),
        db_path: dir.path.join("t.db"),
        token_path: dir.path.join("token"),
    };
    let (v1, v2, loose, project) = {
        let s = Store::open(&paths).unwrap();
        let v1 = s
            .insert(&new_id("1"), version_of("/p/F.md", "F", "one alpha", "w"))
            .unwrap();
        let v2 = s
            .insert(
                &new_id("2"),
                version_of("/p/F.md", "F v2", "two bravo", "w"),
            )
            .unwrap();
        let loose = s
            .insert(&new_id("n"), new_doc("Notes", "elsewhere charlie", "w"))
            .unwrap();
        (v1.id, v2.id, loose.id, v1.project_id)
    };
    // What 1.16 had: no `is_head`, index rows wherever FTS5 put them (and
    // one document indexed twice), a workflow that is another one spelled
    // in capitals, at 1.16's schema version.
    {
        let conn = Connection::open(&paths.db_path).unwrap();
        conn.execute_batch(&format!(
            "DROP INDEX docs_head;
             DROP VIEW head_docs;
             ALTER TABLE docs DROP COLUMN is_head;
             DELETE FROM docs_fts;
             INSERT INTO docs_fts(id, title, body) SELECT id, title, 'stale ' || id FROM docs ORDER BY rowid DESC;
             INSERT INTO docs_fts(id, title, body) VALUES('{loose}', 'Notes', 'elsewhere charlie newest');
             INSERT INTO workflows(project_id, key, title, created_at) VALUES({project}, 'W', 'W', 0);
             UPDATE docs SET workflow_id = (SELECT id FROM workflows WHERE key = 'W') WHERE id = '{loose}';
             {OLD_1_25}
             {OLD_1_26}
         {OLD_1_30}
             {OLD_1_19}
         {OLD_1_20}
         {OLD_1_21}
         {OLD_1_22}
         {OLD_1_23}
             PRAGMA user_version = 4;"
        ))
        .unwrap();
        let drift = fts_drift(&conn);
        assert!(drift > 0, "the fixture is drifted, {drift} rows");
    }

    let s = Store::open(&paths).unwrap();
    let conn = s.conn.lock().unwrap();
    let version: i64 = conn
        .query_row("PRAGMA user_version", [], |r| r.get(0))
        .unwrap();
    assert_eq!(version, MIGRATIONS.last().unwrap().0);
    assert_eq!(fts_drift(&conn), 0, "realigned");
    let (docs, fts): (i64, i64) = conn
        .query_row(
            "SELECT (SELECT COUNT(*) FROM docs), (SELECT COUNT(*) FROM docs_fts)",
            [],
            |r| Ok((r.get(0)?, r.get(1)?)),
        )
        .unwrap();
    assert_eq!(
        (docs, fts),
        (3, 3),
        "one index row a document, the newer kept"
    );
    let kept: String = conn
        .query_row(
            "SELECT body FROM docs_fts WHERE id = ?1",
            params![loose],
            |r| r.get(0),
        )
        .unwrap();
    assert_eq!(kept, "elsewhere charlie newest");
    assert_eq!(is_head(&conn, &v1), 0);
    assert_eq!(is_head(&conn, &v2), 1);
    assert_eq!(is_head(&conn, &loose), 1);
    let keys: Vec<String> = conn
        .prepare("SELECT key FROM workflows ORDER BY key")
        .unwrap()
        .query_map([], |r| r.get(0))
        .unwrap()
        .collect::<std::result::Result<_, _>>()
        .unwrap();
    assert_eq!(keys, ["w"], "folded into the one spelled in lower case");
    drop(conn);
    assert_eq!(s.projects().unwrap()[0].docs, 2);
    assert_eq!(s.search("newest", 5).unwrap().len(), 1);
    // And a save on the brought-forward database is the one-row delete.
    s.replace(&v2, version_of("/p/F.md", "F v2", "two delta", "w"))
        .unwrap();
    assert_eq!(s.search("delta", 5).unwrap().len(), 1);
    assert!(s.search("bravo", 5).unwrap().is_empty());
    assert_eq!(fts_drift(&s.conn.lock().unwrap()), 0);
}

/// `is_head` says what the project row says: one row a document, counted
/// by the column rather than by a subquery per row.
#[test]
fn the_project_row_a_doc_event_carries_is_the_trees_row() {
    let (s, _d) = temp_store();
    let a = s
        .insert(&new_id("1"), version_of("/p/F.md", "F", "one", "w"))
        .unwrap();
    s.insert(&new_id("2"), version_of("/p/F.md", "F v2", "two", "w2"))
        .unwrap();
    let row = s.project_row(a.project_id).unwrap().unwrap();
    let listed = s.projects().unwrap();
    assert_eq!(listed.len(), 1);
    assert_eq!(
        (row.id, row.docs, row.workflows, row.latest),
        (
            listed[0].id,
            listed[0].docs,
            listed[0].workflows,
            listed[0].latest
        )
    );
    assert_eq!(
        (row.docs, row.workflows),
        (1, 1),
        "the head's workflow only"
    );
    assert!(s.project_row(999).unwrap().is_none());
}

/// A tree row says how big its document is, so a hover can decide what to
/// fetch ahead without asking; the same number from both queries that
/// draw rows.
#[test]
fn a_tree_row_carries_its_documents_size() {
    let (s, _d) = temp_store();
    let a = s
        .insert(&new_id("a"), new_doc("A", "twelve bytes", "w"))
        .unwrap();
    let wfs = s.project_tree(a.project_id, 10, 10).unwrap();
    assert_eq!(wfs[0].docs[0].size, 12);
    let whole = s.workflow_tree(wfs[0].id).unwrap().unwrap();
    assert_eq!(whole.docs[0].size, 12);
    let json = serde_json::to_value(&wfs[0].docs[0]).unwrap();
    assert_eq!(json["size"], 12);
}

/// A background highlight writes its page only over the source it rendered:
/// a save that landed meanwhile keeps its own page.
#[test]
fn a_late_highlight_does_not_write_over_a_newer_save() {
    let (s, _d) = temp_store();
    let a = s
        .insert(&new_id("a"), new_doc("A", "first draft", "w"))
        .unwrap();
    let old_hash = a.content_hash.clone();
    let mut newer = new_doc("A", "second draft", "w");
    newer.html = "<p>the newer save</p>";
    let b = s.replace(&a.id, newer).unwrap();
    assert_ne!(b.content_hash, old_hash);
    assert!(!s
        .replace_html_if(&a.id, "<p>highlighted first draft</p>", &old_hash)
        .unwrap());
    assert_eq!(s.html(&a.id).unwrap(), "<p>the newer save</p>");
    assert!(s
        .replace_html_if(&a.id, "<p>highlighted second draft</p>", &b.content_hash)
        .unwrap());
    assert_eq!(s.html(&a.id).unwrap(), "<p>highlighted second draft</p>");
}

/// A friend's document kept on a desk: every version of it moves into the
/// desk's project and onto its list, the newest still the one row, and the
/// project it left has nothing of it.
#[test]
fn a_lineage_moves_whole_onto_a_desk() {
    let (s, _d) = temp_store();
    let one = s
        .insert(&new_id("1"), version_of("seeds.md", "Seeds", "one", "sent"))
        .unwrap();
    let two = s
        .insert(&new_id("2"), version_of("seeds.md", "Seeds", "two", "sent"))
        .unwrap();
    let other = s
        .insert(&new_id("o"), new_doc("Other", "other.md", "sent"))
        .unwrap();
    let garden = Origin {
        id: 3,
        name: "Garden".into(),
        slot: 0,
    };
    let moved = s
        .move_lineage(&one.id, "/w/garden", "garden", &garden)
        .unwrap()
        .unwrap();
    assert_eq!(moved.project, "garden");
    assert_eq!(moved.desk, Some(garden.clone()));
    assert_eq!(moved.workflow, "sent", "the workflow goes with it");
    let newer = s.get(&two.id).unwrap().unwrap();
    assert_eq!(newer.project_id, moved.project_id, "every version");
    assert_eq!(
        s.previous(&newer).unwrap().map(|p| p.id),
        Some(one.id.clone())
    );
    assert_eq!(
        s.get(&other.id).unwrap().unwrap().project_id,
        one.project_id,
        "another file stays"
    );
    let on_desk = s.desk_docs(3, 10, false).unwrap();
    assert_eq!(on_desk.len(), 1, "one row on the desk's list");
    assert_eq!(on_desk[0].id, two.id);
    assert!(s
        .move_lineage("nope", "/w/garden", "garden", &garden)
        .unwrap()
        .is_none());
}

/// A folder's fingerprint is kept with its row, and a friend's frame finds
/// the folders that have it -- by the repository or by the remote -- and
/// never a friend's own row.
#[test]
fn folders_are_found_by_their_fingerprint() {
    let (s, _d) = temp_store();
    s.insert(&new_id("a"), new_doc("A", "a", "w")).unwrap();
    let mut wt = new_doc("B", "b", "w");
    wt.project_root = "/p-wt";
    wt.project_name = "p-wt";
    s.insert(&new_id("b"), wt).unwrap();
    let print = crate::git::Print {
        repo: Some("r1".into()),
        remote: Some("m1".into()),
    };
    assert_eq!(s.roots_to_print(now() + 1).unwrap(), vec!["/p", "/p-wt"]);
    s.set_print("/p", Some(&print)).unwrap();
    s.set_print(
        "/p-wt",
        Some(&crate::git::Print {
            repo: Some("r1".into()),
            remote: None,
        }),
    )
    .unwrap();
    assert!(
        s.roots_to_print(now() - 10).unwrap().is_empty(),
        "both read just now"
    );
    assert_eq!(s.print_of("/p").unwrap().unwrap().0, print);
    assert_eq!(s.print_of("/nowhere").unwrap(), None);
    let by = |repo: Option<&str>, remote: Option<&str>| {
        s.roots_by_print(&crate::peer::Folder {
            repo: repo.map(str::to_string),
            remote: remote.map(str::to_string),
            ..Default::default()
        })
        .unwrap()
        .into_iter()
        .map(|(r, _)| r)
        .collect::<Vec<_>>()
    };
    assert_eq!(
        by(Some("r1"), None),
        vec!["/p", "/p-wt"],
        "a clone and its worktree"
    );
    assert_eq!(
        by(None, Some("m1")),
        vec!["/p"],
        "a shallow clone, by its remote"
    );
    assert_eq!(by(Some("r2"), Some("m2")), Vec::<String>::new());
    assert_eq!(
        by(None, None),
        Vec::<String>::new(),
        "a frame from before 1.22"
    );
    // Unread folders and a folder in no repository: an empty print matches nothing.
    s.set_print("/p-wt", None).unwrap();
    assert_eq!(by(Some(""), Some("")), Vec::<String>::new());
    assert_eq!(by(Some("r1"), None), vec!["/p"]);
}

/// A frame of a kind this snyvi cannot read is held once, however often the
/// relay hands it over, until it is read or too old.
#[test]
fn a_frame_from_a_newer_snyvi_is_held() {
    let (s, _d) = temp_store();
    let p = s
        .pin_peer(&peer::Peer {
            id: 0,
            sign_key: "KEY".into(),
            box_key: "BOX".into(),
            name: "Trapti".into(),
            paired_at: 0,
            muted: false,
            removed_at: 0,
            last_from: 0,
            last_to: 0,
            desk_id: 0,
            v: 0,
            read_receipts: false,
        })
        .unwrap();
    s.peer_hold("f1", p.id, b"sealed").unwrap();
    s.peer_hold("f1", p.id, b"sealed").unwrap();
    assert_eq!(
        s.peer_held().unwrap(),
        vec![("f1".to_string(), p.id, b"sealed".to_vec())]
    );
    assert_eq!(s.prune_peer_held().unwrap(), 0, "a month to wait");
    s.peer_unhold("f1").unwrap();
    assert!(s.peer_held().unwrap().is_empty());
}

/// Copy path copies a file on this machine (#99): an own document's own
/// path; a friend's, never their path, until Save writes it here -- and the
/// saved file outlives the document going back to their row.
#[test]
fn copy_path_is_a_file_here() {
    let (s, dir) = temp_store();
    let mine = s
        .insert(&new_id("m"), new_doc("Mine", "/p/plan.md", "w"))
        .unwrap();
    assert_eq!(mine.local_path.as_deref(), Some("/p/plan.md"));
    assert_eq!(
        s.get(&mine.id).unwrap().unwrap().local_path.as_deref(),
        Some("/p/plan.md")
    );

    let mut d = new_doc("Theirs", "plan.md", "w");
    d.origin = "peer";
    d.sender = "Trapti";
    let theirs = s.insert(&new_id("t"), d).unwrap();
    assert_eq!(
        theirs.local_path, None,
        "the friend's path names nothing here"
    );
    assert_eq!(s.get(&theirs.id).unwrap().unwrap().local_path, None);

    let at = dir.path.join("from-trapti").join("plan.md");
    s.set_saved_path(&theirs.id, &at.to_string_lossy()).unwrap();
    let got = s.get(&theirs.id).unwrap().unwrap();
    assert_eq!(got.local_path.as_deref(), Some(&*at.to_string_lossy()));
    // The desk's rail reads the same path.
    let desk = s.create_desk("/p", Some("p")).unwrap();
    s.conn
        .lock()
        .unwrap()
        .execute(
            "UPDATE docs SET desk_id = ?1 WHERE id = ?2",
            params![desk.id, theirs.id],
        )
        .unwrap();
    let rail = s.desk_docs(desk.id, 10, false).unwrap();
    let row = rail.iter().find(|x| x.id == theirs.id).unwrap();
    assert_eq!(row.local_path.as_deref(), Some(&*at.to_string_lossy()));
}

/// A friend's document filed into a folder both have is the reader's file
/// at its place there -- when that file is there, and not otherwise.
#[test]
fn a_filed_document_copies_its_place_in_the_folder() {
    let root = tempdir::Dir::new("snyvi-filed");
    std::fs::create_dir_all(root.path.join("docs")).unwrap();
    std::fs::write(root.path.join("docs/plan.md"), "x").unwrap();
    // With this system's separators, as the code joins it.
    let src = root.path.join("docs").join("plan.md");
    assert_eq!(
        local_path(
            Some("docs/plan.md"),
            None,
            "peer",
            true,
            &root.path.to_string_lossy()
        ),
        Some(src.to_string_lossy().to_string())
    );
    assert_eq!(
        local_path(
            Some("docs/gone.md"),
            None,
            "peer",
            true,
            &root.path.to_string_lossy()
        ),
        None
    );
    assert_eq!(
        local_path(
            Some("docs/plan.md"),
            None,
            "peer",
            false,
            &root.path.to_string_lossy()
        ),
        None,
        "on the friend's own row it is their file"
    );
    for out in ["../plan.md", "/etc/passwd", "C:/x", "docs/../../plan.md"] {
        assert_eq!(
            local_path(Some(out), None, "peer", true, &root.path.to_string_lossy()),
            None,
            "{out} leaves the folder"
        );
    }
}

/// Step 6 of the 1.25 plan, measured before built: how long a 5 MB save in
/// place holds the store lock, and how much of that is the page write
/// against the search re-index. Printed, not asserted: run with
/// `--ignored --nocapture`.
#[test]
#[ignore]
fn how_long_a_big_save_holds_the_lock() {
    let (s, _d) = temp_store();
    let big = "lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do ".repeat(80_000);
    let html = format!("<p>{big}</p>");
    let d = s
        .insert(&new_id("big"), new_doc("Big", "/p/BIG.md", "w"))
        .unwrap();
    for round in 0..3 {
        let body = format!("{big} round {round}");
        let nd = NewDoc {
            html: &html,
            search_body: &body[..body.len().min(512 * 1024)],
            ..version_of("/p/BIG.md", "Big", &body, "w")
        };
        let t = std::time::Instant::now();
        s.replace(&d.id, nd).unwrap();
        let whole = t.elapsed();
        let t = std::time::Instant::now();
        std::fs::write(_d.path.join("page.html"), &html).unwrap();
        let write = t.elapsed();
        let conn = s.conn.lock().unwrap();
        let t = std::time::Instant::now();
        conn.execute(FTS_DELETE, params![d.id]).unwrap();
        conn.execute(
            FTS_INSERT,
            params![d.id, "Big", &body[..body.len().min(512 * 1024)]],
        )
        .unwrap();
        let fts = t.elapsed();
        eprintln!("round {round}: replace {whole:?}, of which the page write {write:?} and the search re-index {fts:?}");
    }
}