prollytree 0.4.0

A prolly (probabilistic) tree for efficient storage, retrieval, and modification of ordered data.
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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
/*
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/

//! PR 0b — End-to-end externalisation tests on `FileNamespacedKvStore`.
//!
//! Strategy: large values written through `NamespaceHandle::insert` should
//! land as blobs in the underlying [`NodeStorage`]'s blob store (testable
//! via `inner_storage().get_blob(hash)`), while small values stay inline.
//! In all cases the public `get()` API returns the user's original bytes.

#![cfg(feature = "git")]

mod common;

use common::setup_repo_and_dataset;
use prollytree::digest::ValueDigest;
use prollytree::git::versioned_store::FileNamespacedKvStore;
use prollytree::storage::NodeStorage;

const N: usize = 32;

#[test]
fn small_value_stays_inline_when_threshold_set() {
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    store.set_externalize_threshold(Some(1024));

    let payload = b"short value".to_vec();
    {
        let mut personal = store.namespace("personal");
        personal.insert(b"small".to_vec(), payload.clone()).unwrap();
    }
    store.commit("small").unwrap();

    // get() returns the original.
    let personal = store.namespace("personal");
    assert_eq!(personal.get(b"small"), Some(payload.clone()));

    // The blob store should NOT have an entry at the payload's hash.
    let hash = ValueDigest::<N>::new(&payload);
    assert!(
        store.inner_storage().get_blob(&hash).is_none(),
        "small value should not be in blob store"
    );
}

#[test]
fn large_value_lands_in_blob_store_but_get_returns_original() {
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    store.set_externalize_threshold(Some(64));

    // Payload > 64 bytes should be externalised.
    let payload: Vec<u8> = (0..2048).map(|i| (i % 251) as u8).collect();
    {
        let mut personal = store.namespace("personal");
        personal.insert(b"big".to_vec(), payload.clone()).unwrap();
    }
    store.commit("big").unwrap();

    // get() transparently returns the original bytes.
    let personal = store.namespace("personal");
    assert_eq!(personal.get(b"big"), Some(payload.clone()));

    // The blob store now holds the payload, keyed by its content hash.
    let hash = ValueDigest::<N>::new(&payload);
    let blob = store
        .inner_storage()
        .get_blob(&hash)
        .expect("blob should be present after externalisation");
    assert_eq!(blob, payload);
}

#[test]
fn boundary_at_threshold_stays_inline() {
    // Predicate is `value.len() > threshold` — a value exactly at the
    // threshold stays inline.
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    store.set_externalize_threshold(Some(100));

    let payload: Vec<u8> = vec![0xAB; 100];
    {
        let mut personal = store.namespace("personal");
        personal
            .insert(b"borderline".to_vec(), payload.clone())
            .unwrap();
    }
    store.commit("border").unwrap();

    let hash = ValueDigest::<N>::new(&payload);
    assert!(
        store.inner_storage().get_blob(&hash).is_none(),
        "value at threshold should stay inline"
    );

    let personal = store.namespace("personal");
    assert_eq!(personal.get(b"borderline"), Some(payload));
}

#[test]
fn one_byte_above_threshold_externalises() {
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    store.set_externalize_threshold(Some(100));

    let payload: Vec<u8> = vec![0xCD; 101];
    {
        let mut personal = store.namespace("personal");
        personal.insert(b"k".to_vec(), payload.clone()).unwrap();
    }
    store.commit("over").unwrap();

    let hash = ValueDigest::<N>::new(&payload);
    assert!(
        store.inner_storage().get_blob(&hash).is_some(),
        "one byte above threshold should externalise"
    );

    let personal = store.namespace("personal");
    assert_eq!(personal.get(b"k"), Some(payload));
}

#[test]
fn externalised_value_survives_commit_and_reopen() {
    let (_temp, dataset) = setup_repo_and_dataset();
    let payload: Vec<u8> = (0..1_048_576).map(|i| (i % 251) as u8).collect(); // 1 MB
    let hash = ValueDigest::<N>::new(&payload);

    {
        let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
        store.set_externalize_threshold(Some(64 * 1024));
        let mut personal = store.namespace("personal");
        personal
            .insert(b"document".to_vec(), payload.clone())
            .unwrap();
        drop(personal);
        store.commit("ingest").unwrap();
    }

    // Fresh process. Read-side doesn't require setting the threshold.
    let mut store = FileNamespacedKvStore::<N>::open(&dataset).unwrap();
    let personal = store.namespace("personal");
    let got = personal.get(b"document").expect("should be present");
    assert_eq!(got.len(), payload.len());
    assert_eq!(got, payload);
    // The blob is still on disk under the same hash.
    assert!(store.inner_storage().get_blob(&hash).is_some());
}

#[test]
fn threshold_disabled_keeps_old_behaviour() {
    // No threshold ⇒ everything stays inline. This is the back-compat
    // default — existing users see no behaviour change at all.
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    assert!(store.externalize_threshold().is_none());

    let payload: Vec<u8> = vec![0x42; 5_000];
    let hash = ValueDigest::<N>::new(&payload);
    {
        let mut personal = store.namespace("personal");
        personal.insert(b"k".to_vec(), payload.clone()).unwrap();
    }
    store.commit("inline").unwrap();

    // Blob store is empty.
    assert!(store.inner_storage().get_blob(&hash).is_none());

    let personal = store.namespace("personal");
    assert_eq!(personal.get(b"k"), Some(payload));
}

#[test]
fn staged_large_value_is_visible_before_commit() {
    // Pre-commit, the value lives in staging as inline user bytes (not yet
    // externalised). The user-facing `get` should still return original.
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    store.set_externalize_threshold(Some(64));

    let payload: Vec<u8> = vec![0xCC; 200];
    let mut personal = store.namespace("personal");
    personal
        .insert(b"staged".to_vec(), payload.clone())
        .unwrap();
    assert_eq!(personal.get(b"staged"), Some(payload));
}

#[test]
fn delete_then_get_returns_none_even_when_externalised() {
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    store.set_externalize_threshold(Some(64));

    let payload = vec![0xDD; 500];
    {
        let mut personal = store.namespace("personal");
        personal.insert(b"k".to_vec(), payload).unwrap();
    }
    store.commit("write").unwrap();

    {
        let mut personal = store.namespace("personal");
        assert!(personal.delete(b"k").unwrap());
    }
    store.commit("delete").unwrap();

    let personal = store.namespace("personal");
    assert!(personal.get(b"k").is_none());
}

#[test]
fn upsert_changes_externalised_value() {
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    store.set_externalize_threshold(Some(64));

    let v1 = vec![0xAA; 300];
    let v2 = vec![0xBB; 400];
    let h1 = ValueDigest::<N>::new(&v1);
    let h2 = ValueDigest::<N>::new(&v2);

    {
        let mut personal = store.namespace("personal");
        personal.insert(b"k".to_vec(), v1).unwrap();
    }
    store.commit("v1").unwrap();

    {
        let mut personal = store.namespace("personal");
        personal.insert(b"k".to_vec(), v2.clone()).unwrap();
    }
    store.commit("v2").unwrap();

    // Both blobs are present (v1 isn't eagerly deleted — that's PR 0c GC).
    assert!(store.inner_storage().get_blob(&h1).is_some());
    assert!(store.inner_storage().get_blob(&h2).is_some());

    // User sees the latest.
    let personal = store.namespace("personal");
    assert_eq!(personal.get(b"k"), Some(v2));
}

// ---------------------------------------------------------------------------
// PR 0c — gc_blobs
// ---------------------------------------------------------------------------

#[test]
fn gc_blobs_empty_store_is_noop() {
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    let report = store.gc_blobs().unwrap();
    assert_eq!(report.total, 0);
    assert_eq!(report.referenced, 0);
    assert_eq!(report.removed, 0);
    assert!(report.errors.is_empty());
}

#[test]
fn gc_blobs_keeps_referenced_blobs() {
    // Insert two externalised values, both referenced. GC should keep them.
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    store.set_externalize_threshold(Some(64));

    let p1: Vec<u8> = vec![0xAA; 200];
    let p2: Vec<u8> = vec![0xBB; 300];
    let h1 = ValueDigest::<N>::new(&p1);
    let h2 = ValueDigest::<N>::new(&p2);

    {
        let mut personal = store.namespace("personal");
        personal.insert(b"a".to_vec(), p1).unwrap();
        personal.insert(b"b".to_vec(), p2).unwrap();
    }
    store.commit("two").unwrap();

    let report = store.gc_blobs().unwrap();
    assert_eq!(report.total, 2);
    assert_eq!(report.referenced, 2);
    assert_eq!(report.removed, 0);

    // Both blobs are still readable.
    assert!(store.inner_storage().get_blob(&h1).is_some());
    assert!(store.inner_storage().get_blob(&h2).is_some());
}

#[test]
fn gc_blobs_removes_orphans_from_upsert() {
    // Inserting v1 then v2 at the same key leaves v1's blob as an orphan.
    // GC should remove it.
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    store.set_externalize_threshold(Some(64));

    let v1 = vec![0xAA; 200];
    let v2 = vec![0xBB; 300];
    let h1 = ValueDigest::<N>::new(&v1);
    let h2 = ValueDigest::<N>::new(&v2);

    {
        let mut personal = store.namespace("personal");
        personal.insert(b"k".to_vec(), v1).unwrap();
    }
    store.commit("v1").unwrap();
    {
        let mut personal = store.namespace("personal");
        personal.insert(b"k".to_vec(), v2.clone()).unwrap();
    }
    store.commit("v2").unwrap();

    // Pre-GC: both blobs are still around.
    assert!(store.inner_storage().get_blob(&h1).is_some());
    assert!(store.inner_storage().get_blob(&h2).is_some());

    let report = store.gc_blobs().unwrap();
    assert_eq!(report.total, 2);
    assert_eq!(report.referenced, 1);
    assert_eq!(report.removed, 1);
    assert_eq!(report.remaining(), 1);

    // The current value's blob survives; the orphan is gone.
    assert!(store.inner_storage().get_blob(&h1).is_none());
    assert!(store.inner_storage().get_blob(&h2).is_some());

    // The user still reads the latest value normally.
    let personal = store.namespace("personal");
    assert_eq!(personal.get(b"k"), Some(v2));
}

#[test]
fn gc_blobs_removes_orphans_from_delete() {
    // Deleting a key doesn't eagerly delete the referenced blob; gc_blobs does.
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    store.set_externalize_threshold(Some(64));

    let payload = vec![0xCC; 500];
    let hash = ValueDigest::<N>::new(&payload);
    {
        let mut personal = store.namespace("personal");
        personal.insert(b"k".to_vec(), payload).unwrap();
    }
    store.commit("insert").unwrap();
    assert!(store.inner_storage().get_blob(&hash).is_some());

    {
        let mut personal = store.namespace("personal");
        assert!(personal.delete(b"k").unwrap());
    }
    store.commit("delete").unwrap();

    // Blob still around after delete commit — that's PR 0b behaviour.
    assert!(store.inner_storage().get_blob(&hash).is_some());

    let report = store.gc_blobs().unwrap();
    assert_eq!(report.total, 1);
    assert_eq!(report.referenced, 0);
    assert_eq!(report.removed, 1);

    // Blob is gone.
    assert!(store.inner_storage().get_blob(&hash).is_none());
}

#[test]
fn gc_blobs_keeps_blobs_across_namespaces() {
    // Blobs referenced from one namespace must not be deleted just because
    // another namespace also references them — but more importantly, blobs
    // unique to namespace B must not be deleted when GC runs after the user
    // only touched namespace A.
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    store.set_externalize_threshold(Some(64));

    let pa = vec![0xAA; 200];
    let pb = vec![0xBB; 300];
    let ha = ValueDigest::<N>::new(&pa);
    let hb = ValueDigest::<N>::new(&pb);

    {
        let mut a = store.namespace("ns_a");
        a.insert(b"x".to_vec(), pa).unwrap();
    }
    {
        let mut b = store.namespace("ns_b");
        b.insert(b"y".to_vec(), pb).unwrap();
    }
    store.commit("both").unwrap();

    // Drop and reopen so neither namespace is in the in-memory cache
    // initially. gc_blobs MUST load all namespaces from the registry,
    // not just operate on the in-memory ones, or it'd delete `hb`.
    drop(store);
    let mut store = FileNamespacedKvStore::<N>::open(&dataset).unwrap();

    let report = store.gc_blobs().unwrap();
    assert_eq!(report.total, 2);
    assert_eq!(
        report.referenced, 2,
        "gc must load all namespaces from registry"
    );
    assert_eq!(report.removed, 0);

    assert!(store.inner_storage().get_blob(&ha).is_some());
    assert!(store.inner_storage().get_blob(&hb).is_some());
}

#[test]
fn gc_blobs_idempotent() {
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    store.set_externalize_threshold(Some(64));

    let v1 = vec![0xAA; 200];
    let v2 = vec![0xBB; 300];
    {
        let mut personal = store.namespace("personal");
        personal.insert(b"k".to_vec(), v1).unwrap();
    }
    store.commit("v1").unwrap();
    {
        let mut personal = store.namespace("personal");
        personal.insert(b"k".to_vec(), v2).unwrap();
    }
    store.commit("v2").unwrap();

    let first = store.gc_blobs().unwrap();
    assert_eq!(first.removed, 1);

    // Second GC has nothing to do.
    let second = store.gc_blobs().unwrap();
    assert_eq!(second.total, 1);
    assert_eq!(second.referenced, 1);
    assert_eq!(second.removed, 0);
}

#[test]
fn same_large_value_under_two_keys_writes_blob_once() {
    // Content-addressed storage means two keys pointing at identical payload
    // share one blob. We verify by inserting twice and confirming get_blob
    // still returns the expected payload (idempotent dedup at insert_blob
    // is the real driver — both leaves contain identical envelopes).
    let (_temp, dataset) = setup_repo_and_dataset();
    let mut store = FileNamespacedKvStore::<N>::init(&dataset).unwrap();
    store.set_externalize_threshold(Some(64));

    let payload: Vec<u8> = (0..500).map(|i| i as u8).collect();
    let hash = ValueDigest::<N>::new(&payload);
    {
        let mut personal = store.namespace("personal");
        personal.insert(b"a".to_vec(), payload.clone()).unwrap();
        personal.insert(b"b".to_vec(), payload.clone()).unwrap();
    }
    store.commit("dedup").unwrap();

    let blob = store.inner_storage().get_blob(&hash).expect("blob exists");
    assert_eq!(blob, payload);

    let personal = store.namespace("personal");
    assert_eq!(personal.get(b"a"), Some(payload.clone()));
    assert_eq!(personal.get(b"b"), Some(payload));
}