uqa-storage 0.5.3

Document store, inverted index, IVF/HNSW vectors, B-tree, R*Tree, catalog
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

//
// Unified Query Algebra
//
// Copyright (c) 2023-2026 Cognica, Inc.
//

use super::{nearest_centroids, scored_posting_list};
use crate::{read_control::StorageReadControl, StorageBackendError};

#[test]
fn centroid_probes_preserve_ordinal_ties_and_retain_only_the_result_buffer() {
    let centroids = [
        vec![1.0, 0.0],
        vec![0.0, 1.0],
        vec![1.0, 0.0],
        vec![-1.0, 0.0],
    ];
    let control = StorageReadControl::with_limit(4096);
    for (query, count, expected) in [
        ([2.0, 0.0], 0, vec![0]),
        ([2.0, 0.0], 2, vec![0, 2]),
        ([0.0, 0.0], 10, vec![0, 1, 2, 3]),
    ] {
        let probes = nearest_centroids(&query, &centroids, count, Some(&control)).unwrap();
        assert_eq!(&*probes, expected);
        assert_eq!(
            &*nearest_centroids(&query, &centroids, count, None).unwrap(),
            expected
        );
        assert!(control.memory().used() >= expected.len() * size_of::<usize>());
        let held = control
            .memory()
            .reserve(control.memory().limit() - control.memory().used())
            .unwrap();
        assert!(matches!(
            nearest_centroids(&query, &centroids, count, Some(&control)),
            Err(StorageBackendError::Memory(_))
        ));
        assert_eq!(&*probes, expected);
        drop((held, probes));
        assert_eq!(control.memory().used(), 0);
    }
    control.cancellation().cancel();
    assert!(matches!(
        nearest_centroids(&[1.0, 0.0], &centroids, 1, Some(&control)),
        Err(StorageBackendError::Cancelled(_))
    ));
    assert_eq!(control.memory().used(), 0);
}

#[test]
fn provider_scores_preserve_tensor_maxima_ties_and_posting_order() {
    let control = StorageReadControl::with_limit(1 << 20);
    let entries = [
        (9, [0.0, 1.0]),
        (3, [-1.0, 0.0]),
        (9, [1.0, 0.0]),
        (1, [1.0, 0.0]),
    ];
    for (k, expected) in [
        (0, vec![]),
        (1, vec![(1, 1.0)]),
        (2, vec![(1, 1.0), (9, 1.0)]),
        (8, vec![(1, 1.0), (3, -1.0), (9, 1.0)]),
    ] {
        let read = || {
            entries
                .iter()
                .map(|(doc, vector)| (*doc, vector.as_slice()))
        };
        let result = scored_posting_list(&[1.0, 0.0], read(), k, Some(&control)).unwrap();
        assert_eq!(
            result,
            scored_posting_list(&[1.0, 0.0], read(), k, None).unwrap()
        );
        assert_eq!(
            result
                .iter()
                .map(|entry| (entry.doc_id, entry.payload.score))
                .collect::<Vec<_>>(),
            expected
        );
        // PostingList keeps its established caller-owned output boundary.
        assert_eq!(control.memory().used(), 0);
    }
    let large = [
        (1, [1.0e30, 0.0]),
        (1, [1.0, 0.0]),
        (2, [1.0, 0.0]),
        (2, [1.0e30, 0.0]),
    ];
    let result = scored_posting_list(
        &[1.0e30, 0.0],
        large.iter().map(|(doc, vector)| (*doc, vector.as_slice())),
        8,
        Some(&control),
    )
    .unwrap();
    assert_eq!(
        result
            .iter()
            .map(|entry| (entry.doc_id, entry.payload.score))
            .collect::<Vec<_>>(),
        [(1, 0.0), (2, 0.0)]
    );
    assert_eq!(control.memory().used(), 0);
}

#[test]
fn candidate_scoring_unwinds_quota_and_midstream_cancellation_without_replaying_input() {
    let control = StorageReadControl::with_limit(4096);
    let vector = [1.0, 0.0];
    let mut calls = 0;
    let input = (1..=3).map(|doc| {
        calls += 1;
        if doc == 2 {
            control.cancellation().cancel();
        }
        (doc, vector.as_slice())
    });
    assert!(matches!(
        scored_posting_list(&vector, input, 2, Some(&control)),
        Err(StorageBackendError::Cancelled(_))
    ));
    assert_eq!(calls, 2);
    assert_eq!(control.memory().used(), 0);
    assert!(control.memory().peak() > 0);
    control.cancellation().reset();
    let held = control.memory().reserve(control.memory().limit()).unwrap();
    assert!(matches!(
        scored_posting_list(&vector, [(1, vector.as_slice())], 1, Some(&control)),
        Err(StorageBackendError::Memory(_))
    ));
    assert_eq!(control.memory().used(), control.memory().limit());
    drop(held);
    assert_eq!(
        scored_posting_list(&vector, [(1, vector.as_slice())], 1, Some(&control))
            .unwrap()
            .doc_ids()
            .collect::<Vec<_>>(),
        [1]
    );
    assert_eq!(control.memory().used(), 0);
}