modelvault-core 0.14.0

Core engine for ModelVault — application-focused embedded storage with model schemas, validation, and migrations.
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

    use super::*;
    use crate::error::FormatError;
    use crate::spill::TempSpillFile;
    use crate::storage::VecStore;
    use std::collections::BTreeMap;

    fn fp(s: &'static str) -> FieldPath {
        FieldPath::new([std::borrow::Cow::Borrowed(s)]).unwrap()
    }

    fn row(k: i64) -> BTreeMap<String, RowValue> {
        let mut m = BTreeMap::new();
        m.insert("k".to_string(), RowValue::Int64(k));
        m
    }

    fn row_missing() -> BTreeMap<String, RowValue> {
        BTreeMap::new()
    }

    #[test]
    fn decode_entries_truncated_errors() {
        let err = decode_entries(&[]).unwrap_err();
        assert!(matches!(err, DbError::Query(_)));

        let mut buf = Vec::new();
        buf.extend_from_slice(&1u32.to_le_bytes());
        buf.extend_from_slice(&0i64.to_le_bytes());
        let err = decode_entries(&buf).unwrap_err();
        assert!(matches!(err, DbError::Query(_)));
    }

    #[test]
    fn join_rejects_zero_budget_and_requires_spill_store_when_over_budget() {
        let err = spillable_hash_join_match_count_i64::<_, _, VecStore>(
            std::iter::once(Ok(row(1))),
            std::iter::once(Ok(row(1))),
            &fp("k"),
            &fp("k"),
            0,
            None,
        )
        .unwrap_err();
        assert!(matches!(err, DbError::Query(_)));

        // Over budget with no spill store: 2 distinct keys with budget 1.
        let left = vec![Ok(row(1)), Ok(row(2))].into_iter();
        let right = vec![Ok(row(1))].into_iter();
        let err = spillable_hash_join_match_count_i64::<_, _, VecStore>(
            left,
            right,
            &fp("k"),
            &fp("k"),
            1,
            None,
        )
        .unwrap_err();
        assert!(matches!(err, DbError::Query(_)));
    }

    #[test]
    fn join_propagates_left_row_error() {
        let left = vec![Err(DbError::Format(FormatError::InvalidCatalogPayload {
            message: "boom".into(),
        }))]
        .into_iter();
        let right = vec![Ok(row(1))].into_iter();
        let err = spillable_hash_join_match_count_i64::<_, _, VecStore>(
            left,
            right,
            &fp("k"),
            &fp("k"),
            10,
            None,
        )
        .unwrap_err();
        assert!(matches!(err, DbError::Format(_)));
    }

    #[test]
    fn join_propagates_right_row_error() {
        let left = vec![Ok(row(1))].into_iter();
        let right = vec![Err(DbError::Format(FormatError::InvalidCatalogPayload {
            message: "boom".into(),
        }))]
        .into_iter();
        let err = spillable_hash_join_match_count_i64::<_, _, VecStore>(
            left,
            right,
            &fp("k"),
            &fp("k"),
            10,
            None,
        )
        .unwrap_err();
        assert!(matches!(err, DbError::Format(_)));
    }

    #[test]
    fn join_no_spill_path_counts_matches() {
        let left = vec![Ok(row_missing()), Ok(row(1)), Ok(row(1)), Ok(row(2))].into_iter();
        let right = vec![Ok(row_missing()), Ok(row(1)), Ok(row(3)), Ok(row(1))].into_iter();
        let total = spillable_hash_join_match_count_i64::<_, _, VecStore>(
            left,
            right,
            &fp("k"),
            &fp("k"),
            10,
            None,
        )
        .unwrap();
        // left(1)=2, right(1)=2 => 4 matches; key 2 has 0 matches.
        assert_eq!(total, 4);
    }

    #[test]
    fn join_spills_and_merges_partitions() {
        let left = vec![Ok(row(1)), Ok(row(2)), Ok(row(1)), Ok(row(3))].into_iter();
        let right = vec![Ok(row(1)), Ok(row(1)), Ok(row(2))].into_iter();

        let base = VecStore::new();
        let mut spill = TempSpillFile::new(base).unwrap();
        let total = spillable_hash_join_match_count_i64(
            left,
            right,
            &fp("k"),
            &fp("k"),
            1,
            Some(&mut spill),
        )
        .unwrap();

        // left counts: 1->2,2->1,3->1 ; right: 1->2,2->1 => 2*2 + 1*1 = 5
        assert_eq!(total, 5);
    }