contextdb-core 0.3.2

Core types, traits, and error types for contextdb
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

use contextdb_core::{AdjEntry, MemoryAccountant, Value, VectorEntry, VersionedRow};
use std::collections::HashMap;
use std::sync::{Arc, Barrier};
use std::thread;
use uuid::Uuid;

// RACE: this exercises the current two-atomic budget representation. The bug
// window is small, so the loop count is intentionally high to make the failure
// observable without turning the test into a hard blocker if the scheduler does
// not hit the interleaving on a given machine.
#[test]
fn mem_01_set_budget_none_concurrent_allocate() {
    let mut saw_spurious_failure = false;

    for _ in 0..200 {
        let accountant = Arc::new(MemoryAccountant::no_limit());
        accountant
            .set_budget(Some(1024))
            .expect("test setup should allow adding a removable runtime budget");
        let barrier = Arc::new(Barrier::new(2));

        let alloc_acc = accountant.clone();
        let alloc_barrier = barrier.clone();
        let allocator = thread::spawn(move || {
            alloc_barrier.wait();
            let mut failures = 0usize;
            let mut observed_unbounded = false;
            for _ in 0..20_000 {
                if alloc_acc.usage().limit.is_none() {
                    observed_unbounded = true;
                }
                if observed_unbounded && alloc_acc.try_allocate(1).is_err() {
                    failures += 1;
                }
            }
            failures
        });

        let budget_acc = accountant.clone();
        let toggler = thread::spawn(move || {
            barrier.wait();
            budget_acc
                .set_budget(None)
                .expect("removing the budget should succeed");
        });

        toggler.join().expect("budget thread must finish");
        let failures = allocator.join().expect("allocator thread must finish");
        if failures > 0 {
            saw_spurious_failure = true;
            break;
        }
    }

    assert!(
        !saw_spurious_failure,
        "allocator observed MemoryBudgetExceeded after set_budget(None)"
    );
}

#[test]
fn mem_02_visible_at_uses_option_combinator() {
    let row = VersionedRow {
        row_id: 1,
        values: HashMap::new(),
        created_tx: 1,
        deleted_tx: None,
        lsn: 0,
        created_at: None,
    };
    assert!(row.visible_at(1));
    assert!(row.visible_at(99));

    let deleted_row = VersionedRow {
        deleted_tx: Some(5),
        ..row.clone()
    };
    assert!(deleted_row.visible_at(3));
    assert!(!deleted_row.visible_at(5));
    assert!(!deleted_row.visible_at(7));

    let edge = AdjEntry {
        source: Uuid::new_v4(),
        target: Uuid::new_v4(),
        edge_type: "CITES".to_string(),
        properties: HashMap::new(),
        created_tx: 1,
        deleted_tx: Some(5),
        lsn: 0,
    };
    assert!(edge.visible_at(3));
    assert!(!edge.visible_at(5));
    assert!(!edge.visible_at(7));

    let vector = VectorEntry {
        row_id: 1,
        vector: vec![1.0, 2.0, 3.0],
        created_tx: 1,
        deleted_tx: Some(5),
        lsn: 0,
    };
    assert!(vector.visible_at(3));
    assert!(!vector.visible_at(5));
    assert!(!vector.visible_at(7));

    let _ = Value::Null;
}