lucisearch 0.8.0

Embeddable, in-process search engine — the SQLite/DuckDB of Elasticsearch
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
use crate::core::{FieldId, LuciError, Result, SegmentId};

use crate::storage::block::{BLOCK_SIZE, BlockId, Extent};

/// An entry in the segment directory mapping a segment to its block location.
///
/// Each live segment is tracked in the metadata root block. The generation
/// counter supports snapshot isolation — readers see a consistent view of
/// which segments existed at their open time.
///
/// See [[architecture-storage-format#Root Metadata]].
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub struct SegmentEntry {
    /// Unique identifier for this segment.
    pub segment_id: SegmentId,
    /// Contiguous block range where the segment data is stored.
    pub extent: Extent,
    /// Monotonically increasing version counter. Incremented on each commit
    /// that modifies the segment directory.
    pub generation: u64,
    /// Actual byte length of the segment data. May be less than
    /// `extent.byte_len()` since the last block can be partially filled.
    pub data_len: u64,
}

impl SegmentEntry {
    pub const fn new(
        segment_id: SegmentId,
        extent: Extent,
        generation: u64,
        data_len: u64,
    ) -> Self {
        Self {
            segment_id,
            extent,
            generation,
            data_len,
        }
    }
}

/// An entry in the vector-index directory mapping a `dense_vector` field
/// to the file extent holding its serialized search index (HNSW graph
/// today; other algorithms in the future).
///
/// Vector indexes are index-wide (one per field, not per segment) per
/// [[global-vector-indices]] Alternative B. They live in their
/// own block extents, managed by the same `BlockAllocator` as segments,
/// but tracked separately so segment iteration stays clean.
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub struct VectorIndexEntry {
    /// Schema field id this index belongs to.
    pub field_id: FieldId,
    /// Contiguous block range where the serialized index lives.
    pub extent: Extent,
    /// Actual byte length of the serialized index.
    pub data_len: u64,
}

impl VectorIndexEntry {
    pub const fn new(field_id: FieldId, extent: Extent, data_len: u64) -> Self {
        Self {
            field_id,
            extent,
            data_len,
        }
    }
}

/// Point-in-time snapshot of all index metadata, stored in the metadata root
/// block referenced by a root pointer.
///
/// Contains the segment directory, vector-index directory, allocator state,
/// and free list — everything needed to reconstruct the index state after a
/// crash.
///
/// See [[architecture-storage-format#Root Metadata]].
#[derive(Clone, Debug, PartialEq, Eq)]
pub struct MetadataSnapshot {
    /// Live segments and their block locations.
    pub segments: Vec<SegmentEntry>,
    /// Live per-field vector indexes (HNSW today; algorithm-agnostic).
    /// Index-wide artifact, decoupled from segments per
    /// [[global-vector-indices]].
    pub vector_indexes: Vec<VectorIndexEntry>,
    /// Total number of data blocks the file spans.
    pub total_blocks: u64,
    /// Free block extents available for reuse.
    pub free_list: Vec<Extent>,
    /// Opaque application metadata (e.g., serialized field mappings,
    /// deletion bitmaps). The storage layer does not interpret this —
    /// it just persists and returns the bytes.
    pub user_metadata: Vec<u8>,
}

// --- Binary format ---
//
// Header (20 bytes):
//   total_blocks:        u64
//   segment_count:       u32
//   free_extent_count:   u32
//   vector_index_count:  u32
//
// Segment entries (36 bytes each):
//   segment_id:        u64
//   extent_start:      u64
//   extent_count:      u32
//   generation:        u64
//   data_len:          u64
//
// Free list entries (12 bytes each):
//   start_block:       u64
//   count:             u32
//
// Vector index entries (22 bytes each):
//   field_id:          u16
//   extent_start:      u64
//   extent_count:      u32
//   data_len:          u64

const HEADER_BYTES: usize = 20;
const SEGMENT_ENTRY_BYTES: usize = 36;
const FREE_EXTENT_BYTES: usize = 12;
const VECTOR_INDEX_ENTRY_BYTES: usize = 22;

impl MetadataSnapshot {
    /// Create an empty snapshot for a fresh index.
    pub fn empty() -> Self {
        Self {
            segments: Vec::new(),
            vector_indexes: Vec::new(),
            total_blocks: 0,
            free_list: Vec::new(),
            user_metadata: Vec::new(),
        }
    }

    /// Serialized size in bytes.
    pub fn serialized_size(&self) -> usize {
        HEADER_BYTES
            + self.segments.len() * SEGMENT_ENTRY_BYTES
            + self.free_list.len() * FREE_EXTENT_BYTES
            + self.vector_indexes.len() * VECTOR_INDEX_ENTRY_BYTES
            + 4 // user_metadata length prefix
            + self.user_metadata.len()
    }

    /// Serialize to bytes for storage in a metadata block.
    ///
    /// The output is checksummed by the caller (via [`xxh3_checksum`]) and
    /// stored in a block referenced by a root pointer.
    ///
    /// [`xxh3_checksum`]: crate::storage::xxh3_checksum
    pub fn to_bytes(&self) -> Vec<u8> {
        let size = self.serialized_size();
        let mut buf = Vec::with_capacity(size);

        // Header
        buf.extend_from_slice(&self.total_blocks.to_le_bytes());
        buf.extend_from_slice(&(self.segments.len() as u32).to_le_bytes());
        buf.extend_from_slice(&(self.free_list.len() as u32).to_le_bytes());
        buf.extend_from_slice(&(self.vector_indexes.len() as u32).to_le_bytes());

        // Segment entries
        for entry in &self.segments {
            buf.extend_from_slice(&entry.segment_id.as_u64().to_le_bytes());
            buf.extend_from_slice(&entry.extent.start.as_u64().to_le_bytes());
            buf.extend_from_slice(&entry.extent.count.to_le_bytes());
            buf.extend_from_slice(&entry.generation.to_le_bytes());
            buf.extend_from_slice(&entry.data_len.to_le_bytes());
        }

        // Free list
        for extent in &self.free_list {
            buf.extend_from_slice(&extent.start.as_u64().to_le_bytes());
            buf.extend_from_slice(&extent.count.to_le_bytes());
        }

        // Vector index entries
        for entry in &self.vector_indexes {
            buf.extend_from_slice(&entry.field_id.as_u16().to_le_bytes());
            buf.extend_from_slice(&entry.extent.start.as_u64().to_le_bytes());
            buf.extend_from_slice(&entry.extent.count.to_le_bytes());
            buf.extend_from_slice(&entry.data_len.to_le_bytes());
        }

        // User metadata (opaque blob)
        buf.extend_from_slice(&(self.user_metadata.len() as u32).to_le_bytes());
        buf.extend_from_slice(&self.user_metadata);

        debug_assert_eq!(buf.len(), size);
        buf
    }

    /// Deserialize from bytes read from a metadata block.
    ///
    /// # Errors
    ///
    /// Returns `LuciError::IndexCorrupted` if the data is truncated or
    /// contains invalid values.
    pub fn from_bytes(data: &[u8]) -> Result<Self> {
        if data.len() < HEADER_BYTES {
            return Err(LuciError::IndexCorrupted(
                "metadata block too small for header".into(),
            ));
        }

        let total_blocks = u64::from_le_bytes(data[0..8].try_into().unwrap());
        let segment_count = u32::from_le_bytes(data[8..12].try_into().unwrap()) as usize;
        let free_extent_count = u32::from_le_bytes(data[12..16].try_into().unwrap()) as usize;
        let vector_index_count = u32::from_le_bytes(data[16..20].try_into().unwrap()) as usize;

        let expected_size = HEADER_BYTES
            + segment_count * SEGMENT_ENTRY_BYTES
            + free_extent_count * FREE_EXTENT_BYTES
            + vector_index_count * VECTOR_INDEX_ENTRY_BYTES;
        if data.len() < expected_size {
            return Err(LuciError::IndexCorrupted(format!(
                "metadata block truncated: need {expected_size} bytes, got {}",
                data.len()
            )));
        }

        let mut offset = HEADER_BYTES;

        let mut segments = Vec::with_capacity(segment_count);
        for _ in 0..segment_count {
            let segment_id = SegmentId::new(u64::from_le_bytes(
                data[offset..offset + 8].try_into().unwrap(),
            ));
            offset += 8;
            let extent_start = BlockId::new(u64::from_le_bytes(
                data[offset..offset + 8].try_into().unwrap(),
            ));
            offset += 8;
            let extent_count = u32::from_le_bytes(data[offset..offset + 4].try_into().unwrap());
            offset += 4;
            let generation = u64::from_le_bytes(data[offset..offset + 8].try_into().unwrap());
            offset += 8;
            let data_len = u64::from_le_bytes(data[offset..offset + 8].try_into().unwrap());
            offset += 8;

            segments.push(SegmentEntry::new(
                segment_id,
                Extent::new(extent_start, extent_count),
                generation,
                data_len,
            ));
        }

        let mut free_list = Vec::with_capacity(free_extent_count);
        for _ in 0..free_extent_count {
            let start = BlockId::new(u64::from_le_bytes(
                data[offset..offset + 8].try_into().unwrap(),
            ));
            offset += 8;
            let count = u32::from_le_bytes(data[offset..offset + 4].try_into().unwrap());
            offset += 4;

            free_list.push(Extent::new(start, count));
        }

        let mut vector_indexes = Vec::with_capacity(vector_index_count);
        for _ in 0..vector_index_count {
            let field_id = FieldId::new(u16::from_le_bytes(
                data[offset..offset + 2].try_into().unwrap(),
            ));
            offset += 2;
            let extent_start = BlockId::new(u64::from_le_bytes(
                data[offset..offset + 8].try_into().unwrap(),
            ));
            offset += 8;
            let extent_count = u32::from_le_bytes(data[offset..offset + 4].try_into().unwrap());
            offset += 4;
            let data_len = u64::from_le_bytes(data[offset..offset + 8].try_into().unwrap());
            offset += 8;

            vector_indexes.push(VectorIndexEntry::new(
                field_id,
                Extent::new(extent_start, extent_count),
                data_len,
            ));
        }

        let user_metadata = if offset + 4 <= data.len() {
            let meta_len =
                u32::from_le_bytes(data[offset..offset + 4].try_into().unwrap()) as usize;
            offset += 4;
            if offset + meta_len <= data.len() {
                data[offset..offset + meta_len].to_vec()
            } else {
                Vec::new()
            }
        } else {
            Vec::new()
        };

        Ok(Self {
            segments,
            vector_indexes,
            total_blocks,
            free_list,
            user_metadata,
        })
    }

    /// Check that the serialized metadata fits within a single block.
    ///
    /// Returns `false` if overflow chaining would be needed (not yet
    /// implemented).
    pub fn fits_in_single_block(&self) -> bool {
        self.serialized_size() <= BLOCK_SIZE as usize
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    fn sample_snapshot() -> MetadataSnapshot {
        MetadataSnapshot {
            segments: vec![
                SegmentEntry::new(SegmentId::new(1), Extent::new(BlockId(0), 4), 1, 900_000),
                SegmentEntry::new(SegmentId::new(2), Extent::new(BlockId(4), 2), 1, 400_000),
                SegmentEntry::new(SegmentId::new(3), Extent::new(BlockId(8), 6), 2, 1_500_000),
            ],
            vector_indexes: Vec::new(),
            total_blocks: 14,
            free_list: vec![Extent::new(BlockId(6), 2)],
            user_metadata: Vec::new(),
        }
    }

    #[test]
    fn empty_snapshot() {
        let snap = MetadataSnapshot::empty();
        assert!(snap.segments.is_empty());
        assert_eq!(snap.total_blocks, 0);
        assert!(snap.free_list.is_empty());
    }

    #[test]
    fn round_trip_empty() {
        let snap = MetadataSnapshot::empty();
        let bytes = snap.to_bytes();
        let snap2 = MetadataSnapshot::from_bytes(&bytes).unwrap();
        assert_eq!(snap, snap2);
    }

    #[test]
    fn round_trip_populated() {
        let snap = sample_snapshot();
        let bytes = snap.to_bytes();
        let snap2 = MetadataSnapshot::from_bytes(&bytes).unwrap();
        assert_eq!(snap, snap2);
    }

    #[test]
    fn serialized_size_matches_output() {
        let snap = sample_snapshot();
        let bytes = snap.to_bytes();
        assert_eq!(bytes.len(), snap.serialized_size());
        // 20 header + 3*36 segments + 1*12 free + 0 vector_indexes
        //   + 4 user_metadata_len = 20 + 108 + 12 + 0 + 4 = 144
        assert_eq!(bytes.len(), 144);
    }

    #[test]
    fn round_trip_with_vector_indexes() {
        let mut snap = sample_snapshot();
        snap.vector_indexes = vec![
            VectorIndexEntry::new(FieldId::new(7), Extent::new(BlockId(100), 3), 600_000),
            VectorIndexEntry::new(FieldId::new(11), Extent::new(BlockId(103), 5), 1_200_000),
        ];
        let bytes = snap.to_bytes();
        let snap2 = MetadataSnapshot::from_bytes(&bytes).unwrap();
        assert_eq!(snap, snap2);
    }

    #[test]
    fn truncated_header_is_rejected() {
        let err = MetadataSnapshot::from_bytes(&[0u8; 10]).unwrap_err();
        assert!(format!("{err}").contains("too small"));
    }

    #[test]
    fn truncated_body_is_rejected() {
        let snap = sample_snapshot();
        let bytes = snap.to_bytes();
        let err = MetadataSnapshot::from_bytes(&bytes[..bytes.len() - 5]).unwrap_err();
        assert!(format!("{err}").contains("truncated"));
    }

    #[test]
    fn fits_in_single_block() {
        let snap = sample_snapshot();
        assert!(snap.fits_in_single_block());
    }

    #[test]
    fn from_bytes_tolerates_trailing_data() {
        let snap = sample_snapshot();
        let mut bytes = snap.to_bytes();
        bytes.extend_from_slice(&[0u8; 1024]);
        let snap2 = MetadataSnapshot::from_bytes(&bytes).unwrap();
        assert_eq!(snap, snap2);
    }

    #[test]
    fn segment_entry_fields() {
        let entry = SegmentEntry::new(SegmentId::new(42), Extent::new(BlockId(10), 3), 7, 768_000);
        assert_eq!(entry.segment_id, SegmentId::new(42));
        assert_eq!(entry.extent, Extent::new(BlockId(10), 3));
        assert_eq!(entry.generation, 7);
        assert_eq!(entry.data_len, 768_000);
    }

    #[test]
    fn round_trip_large_snapshot() {
        let segments: Vec<_> = (0..500)
            .map(|i| {
                SegmentEntry::new(
                    SegmentId::new(i),
                    Extent::new(BlockId(i * 10), 5),
                    i / 10,
                    256_000,
                )
            })
            .collect();
        let free_list: Vec<_> = (0..200)
            .map(|i| Extent::new(BlockId(5000 + i * 3), 2))
            .collect();
        let snap = MetadataSnapshot {
            segments,
            vector_indexes: Vec::new(),
            total_blocks: 10000,
            free_list,
            user_metadata: Vec::new(),
        };

        assert!(snap.fits_in_single_block());
        let bytes = snap.to_bytes();
        let snap2 = MetadataSnapshot::from_bytes(&bytes).unwrap();
        assert_eq!(snap, snap2);
    }

    #[test]
    fn checksum_integration() {
        let snap = sample_snapshot();
        let bytes = snap.to_bytes();
        let checksum = crate::storage::xxh3_checksum(&bytes);
        assert_eq!(checksum, crate::storage::xxh3_checksum(&bytes));
        let snap2 = MetadataSnapshot::empty();
        let bytes2 = snap2.to_bytes();
        assert_ne!(checksum, crate::storage::xxh3_checksum(&bytes2));
    }
}