velesdb-core 1.15.0

High-performance vector database engine written in Rust
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

//! Tests for column-store vacuum, `should_vacuum()` threshold logic,
//! and `is_row_deleted_bitmap()`.

#![allow(clippy::cast_possible_wrap)]

use crate::column_store::{ColumnStore, ColumnType, ColumnValue, VacuumConfig};

/// Helper: builds a store with `count` rows, each having an Int `id` column.
fn store_with_id_rows(count: usize) -> ColumnStore {
    let mut store = ColumnStore::with_schema(&[("id", ColumnType::Int)]);
    for i in 0..count {
        store.push_row(&[("id", ColumnValue::Int(i as i64))]);
    }
    store
}

// ─────────────────────────────────────────────────────────────────────────────
// vacuum() removes deleted rows
// ─────────────────────────────────────────────────────────────────────────────

#[test]
fn vacuum_removes_tombstones() {
    let mut store = store_with_id_rows(10);

    // Soft-delete rows 3 and 7
    store.deleted_rows.insert(3);
    store.deleted_rows.insert(7);
    if let Ok(idx) = u32::try_from(3_usize) {
        store.deletion_bitmap.insert(idx);
    }
    if let Ok(idx) = u32::try_from(7_usize) {
        store.deletion_bitmap.insert(idx);
    }

    let stats = store.vacuum(VacuumConfig::default());
    assert!(stats.completed);
    assert_eq!(stats.tombstones_found, 2);
    assert_eq!(stats.tombstones_removed, 2);
    assert_eq!(store.row_count(), 8);
    assert_eq!(store.deleted_row_count(), 0);
}

#[test]
fn vacuum_no_tombstones_is_noop() {
    let mut store = store_with_id_rows(5);
    let stats = store.vacuum(VacuumConfig::default());
    assert!(stats.completed);
    assert_eq!(stats.tombstones_found, 0);
    assert_eq!(store.row_count(), 5);
}

#[test]
fn vacuum_preserves_remaining_data() {
    let mut store = store_with_id_rows(5);
    // Delete row at index 2 (id=2)
    store.deleted_rows.insert(2);
    if let Ok(idx) = u32::try_from(2_usize) {
        store.deletion_bitmap.insert(idx);
    }

    store.vacuum(VacuumConfig::default());

    // The remaining 4 rows should have ids 0,1,3,4 (compacted)
    let ids = store.filter_eq_int("id", 2);
    assert!(ids.is_empty(), "deleted id=2 must not appear after vacuum");

    let all_rows = store.row_count();
    assert_eq!(all_rows, 4);
}

// ─────────────────────────────────────────────────────────────────────────────
// should_vacuum() threshold logic
// ─────────────────────────────────────────────────────────────────────────────

#[test]
fn should_vacuum_below_threshold() {
    let mut store = store_with_id_rows(100);
    // Delete 10 out of 100 => 10%, threshold 20% => false
    for i in 0..10 {
        store.deleted_rows.insert(i);
    }
    assert!(!store.should_vacuum(0.20));
}

#[test]
fn should_vacuum_at_threshold() {
    let mut store = store_with_id_rows(100);
    // Delete 20 out of 100 => 20%, threshold 20% => true
    for i in 0..20 {
        store.deleted_rows.insert(i);
    }
    assert!(store.should_vacuum(0.20));
}

#[test]
fn should_vacuum_above_threshold() {
    let mut store = store_with_id_rows(100);
    for i in 0..50 {
        store.deleted_rows.insert(i);
    }
    assert!(store.should_vacuum(0.20));
}

#[test]
fn should_vacuum_empty_store() {
    let store = ColumnStore::new();
    assert!(!store.should_vacuum(0.20));
}

// ─────────────────────────────────────────────────────────────────────────────
// is_row_deleted_bitmap()
// ─────────────────────────────────────────────────────────────────────────────

#[test]
fn is_row_deleted_bitmap_true_for_deleted() {
    let mut store = store_with_id_rows(5);
    store.deleted_rows.insert(2);
    store.deletion_bitmap.insert(2);

    assert!(store.is_row_deleted_bitmap(2));
}

#[test]
fn is_row_deleted_bitmap_false_for_live() {
    let store = store_with_id_rows(5);
    assert!(!store.is_row_deleted_bitmap(0));
    assert!(!store.is_row_deleted_bitmap(4));
}

#[test]
fn live_row_indices_excludes_deleted() {
    let mut store = store_with_id_rows(5);
    store.deleted_rows.insert(1);
    store.deletion_bitmap.insert(1);
    store.deleted_rows.insert(3);
    store.deletion_bitmap.insert(3);

    let live: Vec<usize> = store.live_row_indices().collect();
    assert_eq!(live, vec![0, 2, 4]);
}

#[test]
fn deleted_count_bitmap_matches_set() {
    let mut store = store_with_id_rows(10);
    for i in [0, 2, 4, 6] {
        store.deleted_rows.insert(i);
        if let Ok(idx) = u32::try_from(i) {
            store.deletion_bitmap.insert(idx);
        }
    }
    assert_eq!(store.deleted_count_bitmap(), 4);
}