lucisearch 0.8.1

Embeddable, in-process search engine — the SQLite/DuckDB of search
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
//! LZ4-compressed document store.
//!
//! Stores original JSON source documents in 16 KB blocks compressed with
//! `lz4_flex`. Each document can be retrieved by doc ID.
//!
//! On-disk format:
//! ```text
//! [num_blocks: u32] [num_docs: u32]
//! Per-block: [offset: u64] [compressed_len: u32] [uncompressed_len: u32]
//! Per-doc:   [block_idx: u32] [within_block_offset: u32] [len: u32]
//! Compressed block data
//! ```
//!
//! See [[document-store]] and [[architecture-overview#Step 4]].

/// Uncompressed block size target (16 KB).
const BLOCK_SIZE: usize = 16 * 1024;

// --- DocStoreWriter ---

/// Builds a compressed document store from raw document bytes.
pub struct DocStoreWriter {
    /// Current uncompressed block being filled.
    current_block: Vec<u8>,
    /// Compressed blocks accumulated so far.
    compressed_blocks: Vec<CompressedBlock>,
    /// Per-document metadata: (block_idx, offset_in_block, length).
    doc_entries: Vec<DocEntry>,
}

struct CompressedBlock {
    data: Vec<u8>,
    uncompressed_len: u32,
}

#[derive(Clone, Copy)]
struct DocEntry {
    block_idx: u32,
    within_block_offset: u32,
    len: u32,
}

impl DocStoreWriter {
    pub fn new() -> Self {
        Self {
            current_block: Vec::new(),
            compressed_blocks: Vec::new(),
            doc_entries: Vec::new(),
        }
    }

    /// Add a document's raw bytes (typically JSON). Documents are assigned
    /// sequential IDs starting from 0.
    pub fn add(&mut self, doc_bytes: &[u8]) {
        let block_idx = self.compressed_blocks.len() as u32;
        let offset = self.current_block.len() as u32;

        self.doc_entries.push(DocEntry {
            block_idx,
            within_block_offset: offset,
            len: doc_bytes.len() as u32,
        });

        self.current_block.extend_from_slice(doc_bytes);

        // Flush if block is full
        if self.current_block.len() >= BLOCK_SIZE {
            self.flush_block();
        }
    }

    /// Number of documents stored so far.
    pub fn doc_count(&self) -> u32 {
        self.doc_entries.len() as u32
    }

    fn flush_block(&mut self) {
        if self.current_block.is_empty() {
            return;
        }
        let uncompressed_len = self.current_block.len() as u32;
        let compressed = lz4_flex::compress_prepend_size(&self.current_block);
        self.compressed_blocks.push(CompressedBlock {
            data: compressed,
            uncompressed_len,
        });
        self.current_block.clear();
    }

    /// Finalize and return the encoded doc store bytes.
    pub fn finish(mut self) -> Vec<u8> {
        // Flush any remaining data in the current block
        self.flush_block();

        // Fix up doc entries for docs that were in the last block
        // (their block_idx was set to compressed_blocks.len() before flush)
        // This is already correct because flush_block pushes to compressed_blocks.

        let num_blocks = self.compressed_blocks.len() as u32;
        let num_docs = self.doc_entries.len() as u32;

        let mut result = Vec::new();

        // Header
        result.extend_from_slice(&num_blocks.to_le_bytes());
        result.extend_from_slice(&num_docs.to_le_bytes());

        // Block metadata (offsets filled in after we know where blocks start)
        let block_meta_start = result.len();
        // Reserve space: per block = 8 (offset) + 4 (compressed_len) + 4 (uncompressed_len) = 16
        let block_meta_size = num_blocks as usize * 16;
        result.resize(result.len() + block_meta_size, 0);

        // Doc metadata
        let doc_meta_start = result.len();
        // Per doc = 4 (block_idx) + 4 (within_block_offset) + 4 (len) = 12
        let doc_meta_size = num_docs as usize * 12;
        result.resize(result.len() + doc_meta_size, 0);

        // Write compressed blocks and record offsets
        for (i, block) in self.compressed_blocks.iter().enumerate() {
            let offset = result.len() as u64;
            let compressed_len = block.data.len() as u32;

            // Write block metadata
            let meta_pos = block_meta_start + i * 16;
            result[meta_pos..meta_pos + 8].copy_from_slice(&offset.to_le_bytes());
            result[meta_pos + 8..meta_pos + 12].copy_from_slice(&compressed_len.to_le_bytes());
            result[meta_pos + 12..meta_pos + 16]
                .copy_from_slice(&block.uncompressed_len.to_le_bytes());

            // Write compressed data
            result.extend_from_slice(&block.data);
        }

        // Write doc metadata
        for (i, entry) in self.doc_entries.iter().enumerate() {
            let pos = doc_meta_start + i * 12;
            result[pos..pos + 4].copy_from_slice(&entry.block_idx.to_le_bytes());
            result[pos + 4..pos + 8].copy_from_slice(&entry.within_block_offset.to_le_bytes());
            result[pos + 8..pos + 12].copy_from_slice(&entry.len.to_le_bytes());
        }

        result
    }
}

impl Default for DocStoreWriter {
    fn default() -> Self {
        Self::new()
    }
}

// --- DocStoreReader ---

/// Reads documents from a compressed doc store.
///
/// Caches the most recently decompressed block to avoid redundant
/// decompression when reading sequential documents.
pub struct DocStoreReader<'a> {
    data: &'a [u8],
    #[allow(dead_code)]
    num_blocks: u32,
    num_docs: u32,
    block_meta_start: usize,
    doc_meta_start: usize,
    /// Cached last decompressed block index and data.
    cached_block: std::sync::Mutex<Option<(u32, Vec<u8>)>>,
}

impl<'a> DocStoreReader<'a> {
    /// Open a doc store from encoded bytes.
    pub fn open(data: &'a [u8]) -> Self {
        let num_blocks = u32::from_le_bytes([data[0], data[1], data[2], data[3]]);
        let num_docs = u32::from_le_bytes([data[4], data[5], data[6], data[7]]);
        let block_meta_start = 8;
        let doc_meta_start = block_meta_start + num_blocks as usize * 16;

        Self {
            data,
            num_blocks,
            num_docs,
            block_meta_start,
            doc_meta_start,
            cached_block: std::sync::Mutex::new(None),
        }
    }

    /// Number of documents in the store.
    pub fn doc_count(&self) -> u32 {
        self.num_docs
    }

    /// Retrieve a document by doc ID. Returns None if out of range.
    pub fn get(&self, doc_id: u32) -> Option<Vec<u8>> {
        if doc_id >= self.num_docs {
            return None;
        }

        // Read doc metadata
        let doc_pos = self.doc_meta_start + doc_id as usize * 12;
        let block_idx = u32::from_le_bytes(self.data[doc_pos..doc_pos + 4].try_into().unwrap());
        let within_offset =
            u32::from_le_bytes(self.data[doc_pos + 4..doc_pos + 8].try_into().unwrap());
        let len = u32::from_le_bytes(self.data[doc_pos + 8..doc_pos + 12].try_into().unwrap());

        // Decompress block (with caching)
        let block_data = self.get_block(block_idx);
        let start = within_offset as usize;
        let end = start + len as usize;
        Some(block_data[start..end].to_vec())
    }

    fn get_block(&self, block_idx: u32) -> Vec<u8> {
        // Check cache
        {
            let cache = self.cached_block.lock().unwrap();
            if let Some((cached_idx, ref data)) = *cache {
                if cached_idx == block_idx {
                    return data.clone();
                }
            }
        }

        // Read block metadata
        let meta_pos = self.block_meta_start + block_idx as usize * 16;
        let offset =
            u64::from_le_bytes(self.data[meta_pos..meta_pos + 8].try_into().unwrap()) as usize;
        let compressed_len =
            u32::from_le_bytes(self.data[meta_pos + 8..meta_pos + 12].try_into().unwrap()) as usize;

        // Decompress
        let compressed = &self.data[offset..offset + compressed_len];
        let decompressed =
            lz4_flex::decompress_size_prepended(compressed).expect("LZ4 decompression failed");

        // Update cache
        *self.cached_block.lock().unwrap() = Some((block_idx, decompressed.clone()));

        decompressed
    }
}

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

    #[test]
    fn single_doc() {
        let mut writer = DocStoreWriter::new();
        writer.add(b"hello world");
        let data = writer.finish();

        let reader = DocStoreReader::open(&data);
        assert_eq!(reader.doc_count(), 1);
        assert_eq!(reader.get(0).unwrap(), b"hello world");
        assert_eq!(reader.get(1), None);
    }

    #[test]
    fn multiple_docs() {
        let mut writer = DocStoreWriter::new();
        writer.add(b"doc zero");
        writer.add(b"doc one");
        writer.add(b"doc two");
        let data = writer.finish();

        let reader = DocStoreReader::open(&data);
        assert_eq!(reader.doc_count(), 3);
        assert_eq!(reader.get(0).unwrap(), b"doc zero");
        assert_eq!(reader.get(1).unwrap(), b"doc one");
        assert_eq!(reader.get(2).unwrap(), b"doc two");
    }

    #[test]
    fn empty_doc() {
        let mut writer = DocStoreWriter::new();
        writer.add(b"");
        writer.add(b"nonempty");
        writer.add(b"");
        let data = writer.finish();

        let reader = DocStoreReader::open(&data);
        assert_eq!(reader.get(0).unwrap(), b"");
        assert_eq!(reader.get(1).unwrap(), b"nonempty");
        assert_eq!(reader.get(2).unwrap(), b"");
    }

    #[test]
    fn multi_block_spanning() {
        // Write enough docs to fill multiple blocks
        let mut writer = DocStoreWriter::new();
        let doc = vec![b'x'; 4096]; // 4 KB each, 4 docs per block
        for _ in 0..20 {
            writer.add(&doc);
        }
        let data = writer.finish();

        let reader = DocStoreReader::open(&data);
        assert_eq!(reader.doc_count(), 20);
        for i in 0..20 {
            assert_eq!(reader.get(i).unwrap(), doc);
        }
    }

    #[test]
    fn large_doc_filling_block() {
        let mut writer = DocStoreWriter::new();
        let large_doc = vec![b'A'; BLOCK_SIZE]; // exactly one block
        writer.add(&large_doc);
        writer.add(b"small");
        let data = writer.finish();

        let reader = DocStoreReader::open(&data);
        assert_eq!(reader.get(0).unwrap(), large_doc);
        assert_eq!(reader.get(1).unwrap(), b"small");
    }

    #[test]
    fn compression_reduces_size() {
        let mut writer = DocStoreWriter::new();
        // Highly compressible: all zeros
        let doc = vec![0u8; BLOCK_SIZE * 2];
        writer.add(&doc);
        let data = writer.finish();

        // Compressed should be significantly smaller than raw
        assert!(
            data.len() < doc.len(),
            "compressed size {} should be less than raw {}",
            data.len(),
            doc.len()
        );
    }

    #[test]
    fn all_docs_retrievable() {
        let mut writer = DocStoreWriter::new();
        let docs: Vec<Vec<u8>> = (0..100)
            .map(|i| format!("{{\"id\": {i}, \"text\": \"document number {i}\"}}").into_bytes())
            .collect();

        for doc in &docs {
            writer.add(doc);
        }
        let data = writer.finish();

        let reader = DocStoreReader::open(&data);
        assert_eq!(reader.doc_count(), 100);
        for (i, expected) in docs.iter().enumerate() {
            assert_eq!(&reader.get(i as u32).unwrap(), expected);
        }
    }

    #[test]
    fn out_of_range_returns_none() {
        let mut writer = DocStoreWriter::new();
        writer.add(b"only one");
        let data = writer.finish();

        let reader = DocStoreReader::open(&data);
        assert_eq!(reader.get(1), None);
        assert_eq!(reader.get(100), None);
        assert_eq!(reader.get(u32::MAX), None);
    }

    #[test]
    fn empty_store() {
        let writer = DocStoreWriter::new();
        let data = writer.finish();

        let reader = DocStoreReader::open(&data);
        assert_eq!(reader.doc_count(), 0);
        assert_eq!(reader.get(0), None);
    }

    #[test]
    fn json_docs_round_trip() {
        let mut writer = DocStoreWriter::new();
        let json1 = br#"{"title":"hello","body":"world"}"#;
        let json2 = br#"{"title":"foo","body":"bar baz"}"#;
        writer.add(json1);
        writer.add(json2);
        let data = writer.finish();

        let reader = DocStoreReader::open(&data);
        let doc1: serde_json::Value = serde_json::from_slice(&reader.get(0).unwrap()).unwrap();
        assert_eq!(doc1["title"], "hello");
        let doc2: serde_json::Value = serde_json::from_slice(&reader.get(1).unwrap()).unwrap();
        assert_eq!(doc2["body"], "bar baz");
    }

    #[test]
    fn block_cache_hit() {
        // Two docs in the same block — second read should hit cache
        let mut writer = DocStoreWriter::new();
        writer.add(b"doc A");
        writer.add(b"doc B");
        let data = writer.finish();

        let reader = DocStoreReader::open(&data);
        assert_eq!(reader.get(0).unwrap(), b"doc A");
        // Second get from same block should use cache
        assert_eq!(reader.get(1).unwrap(), b"doc B");
    }

    #[test]
    fn varying_doc_sizes() {
        let mut writer = DocStoreWriter::new();
        writer.add(b"x");
        writer.add(&vec![b'y'; 1000]);
        writer.add(b"z");
        writer.add(&vec![b'w'; 8000]);
        let data = writer.finish();

        let reader = DocStoreReader::open(&data);
        assert_eq!(reader.get(0).unwrap(), b"x");
        assert_eq!(reader.get(1).unwrap(), vec![b'y'; 1000]);
        assert_eq!(reader.get(2).unwrap(), b"z");
        assert_eq!(reader.get(3).unwrap(), vec![b'w'; 8000]);
    }
}