mentedb 0.40.0

A purpose-built database engine for AI agent memory
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
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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146

//! The dashboard read path must answer "newest N", "ids with tag T", "count
//! excluding tags", and "conflict counts" from the in-memory indexes, loading
//! only the rows it returns rather than scanning every memory. These tests pin
//! that behaviour on a real engine: the results are correct, and (by
//! construction) they come from the temporal, bitmap, and graph indexes, not a
//! full scan.

use std::collections::HashSet;

use mentedb::MenteDb;
use mentedb::prelude::{AgentId, EdgeType, MemoryEdge, MemoryNode, MemoryType};

fn open() -> (tempfile::TempDir, MenteDb) {
    let dir = tempfile::tempdir().unwrap();
    let db = MenteDb::open(dir.path()).expect("open");
    (dir, db)
}

/// Store a memory with a controlled creation time and tag set so the temporal
/// and bitmap indexes have deterministic contents.
fn store(
    db: &MenteDb,
    content: &str,
    created_at: u64,
    tags: &[&str],
) -> mentedb::prelude::MemoryId {
    let mut node = MemoryNode::new(
        AgentId(uuid::Uuid::nil()),
        MemoryType::Semantic,
        content.to_string(),
        Vec::new(),
    );
    node.created_at = created_at;
    node.tags = tags.iter().map(|t| t.to_string()).collect();
    let id = node.id;
    db.store(node).expect("store");
    id
}

const INTERNAL: &[&str] = &[
    "turn",
    "conversation-turn",
    "action",
    "ghost-memory",
    "entity",
];

#[test]
fn recent_memory_ids_are_newest_first_and_skip_excluded() {
    let (_dir, db) = open();
    let _oldest = store(&db, "oldest", 100, &[]);
    let a_turn = store(&db, "a raw turn", 150, &["turn"]);
    let middle = store(&db, "middle", 200, &[]);
    let an_action = store(&db, "an action capture", 250, &["action"]);
    let newest = store(&db, "newest", 300, &[]);

    // Newest first, internal working material excluded.
    let ids = db.recent_memory_ids(10, INTERNAL, None);
    assert_eq!(
        ids,
        vec![newest, middle, _oldest],
        "only the three user memories, newest first"
    );
    assert!(!ids.contains(&a_turn) && !ids.contains(&an_action));

    // A small limit returns only that many, still newest first.
    assert_eq!(db.recent_memory_ids(1, INTERNAL, None), vec![newest]);
}

#[test]
fn recent_memory_ids_paginate_after_a_cursor() {
    let (_dir, db) = open();
    let n3 = store(&db, "n3", 300, &[]);
    let n2 = store(&db, "n2", 200, &[]);
    let n1 = store(&db, "n1", 100, &[]);

    let page1 = db.recent_memory_ids(1, INTERNAL, None);
    assert_eq!(page1, vec![n3]);
    let page2 = db.recent_memory_ids(1, INTERNAL, Some(n3));
    assert_eq!(page2, vec![n2]);
    let page3 = db.recent_memory_ids(10, INTERNAL, Some(n2));
    assert_eq!(page3, vec![n1]);
}

#[test]
fn count_excluding_tags_ignores_internal_material() {
    let (_dir, db) = open();
    store(&db, "user 1", 100, &[]);
    store(&db, "user 2", 200, &["semantic"]);
    store(&db, "a turn", 300, &["turn"]);
    store(&db, "an action", 400, &["action"]);

    assert_eq!(db.memory_count(), 4, "all four are stored");
    assert_eq!(
        db.count_excluding_tags(INTERNAL),
        2,
        "only the two user memories count"
    );
}

#[test]
fn memory_ids_with_tag_finds_only_the_tagged() {
    let (_dir, db) = open();
    let pinned = store(&db, "a standing rule", 100, &["scope:always"]);
    store(&db, "not pinned", 200, &[]);
    let also = store(&db, "another rule", 300, &["scope:always"]);

    let ids: HashSet<_> = db.memory_ids_with_tag("scope:always").into_iter().collect();
    assert_eq!(ids, HashSet::from([pinned, also]));
    assert!(db.memory_ids_with_tag("no-such-tag").is_empty());
}

#[test]
fn conflict_edge_counts_track_add_and_forget_without_loading_nodes() {
    let (_dir, db) = open();
    let a = store(&db, "the database uses Postgres", 100, &[]);
    let b = store(&db, "the database uses MySQL", 200, &[]);
    let c = store(&db, "retry limit is three", 300, &[]);
    let d = store(&db, "retry limit is five", 400, &[]);

    let edge = |source, target, kind| MemoryEdge {
        source,
        target,
        edge_type: kind,
        weight: 0.9,
        created_at: 1,
        valid_from: None,
        valid_until: None,
        label: None,
    };

    // The detectors store one directed edge per conflict pair, so a directed
    // count is the pair count.
    db.relate(edge(a, b, EdgeType::Contradicts)).unwrap();
    db.relate(edge(d, c, EdgeType::Supersedes)).unwrap();
    assert_eq!(db.conflict_edge_counts(), (1, 1));

    // Forgetting an endpoint drops that pair from the running counts, with no
    // graph rescan on the read.
    db.forget(b).unwrap();
    assert_eq!(
        db.conflict_edge_counts(),
        (0, 1),
        "the contradiction goes with b, the supersession stays"
    );
}