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
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
//! Segment builder: takes analyzed documents and produces segment bytes.
//!
//! The builder accumulates documents with their analyzed fields and source
//! JSON, then produces a complete segment in the format specified by
//! [[architecture-segment-layout]]. This is the write side of the segment lifecycle.
//!
//! See [[architecture-indexing-pipeline#Segment Building]] and [[architecture-overview#Step 6]].

use std::collections::HashMap;

use crate::analysis::Token;
use crate::core::{DocId, FieldId, SegmentId};
use crate::mapping::{FieldMapping, Mapping};

use crate::columnar::writer::{ColumnValue, ColumnarWriter};
use crate::inverted::norms::FieldNormsWriter;
use crate::inverted::postings::{BlockMaxPostingListWriter, PositionPostingListWriter};
use crate::inverted::term_dict::TermDictBuilder;
use crate::segment::format::{ComponentOffset, ComponentType, FieldMeta, SegmentHeader};
use crate::spatial::geo::{GeoPoint, GeoPointStore};
use crate::store::doc_store::DocStoreWriter;

/// Per-document posting: doc_id, term frequency, and positions.
struct TermPosting {
    doc_id: DocId,
    tf: u32,
    positions: Vec<u32>,
}

/// Builds a segment from analyzed documents.
///
/// Usage:
/// 1. Create with `new(segment_id, &schema)`
/// 2. Call `add_document()` for each document
/// 3. Call `build()` to produce the segment bytes
pub struct SegmentBuilder {
    segment_id: SegmentId,
    schema: Mapping,
    doc_count: u32,

    /// Per-field inverted index: field_id → term → Vec<TermPosting>
    postings: HashMap<FieldId, HashMap<String, Vec<TermPosting>>>,
    /// Which fields store positions (text fields do, keyword fields don't).
    fields_with_positions: HashMap<FieldId, bool>,
    /// Per-field norms: field_id → list of field lengths
    field_lengths: HashMap<FieldId, Vec<u32>>,
    /// Document store accumulator.
    doc_store: DocStoreWriter,
    /// Columnar data for doc_values fields.
    columnar: ColumnarWriter,
    /// Per-field geo point stores for geo_point fields.
    geo_stores: HashMap<FieldId, GeoPointStore>,
    /// Per-field geo shape stores for geo_shape fields.
    geo_shape_stores: HashMap<FieldId, crate::spatial::shape::GeoShapeStore>,
    /// Parent bitset: true for parent docs, false for nested docs.
    /// Only populated when nested fields are present.
    parent_bitset: Vec<bool>,
    has_nested: bool,
}

impl SegmentBuilder {
    pub fn new(segment_id: SegmentId, schema: &Mapping) -> Self {
        // Determine which fields store positions (text fields with norms)
        let mut fields_with_positions = HashMap::new();
        for mapping in schema.fields() {
            if let Some(fid) = schema.field_id(&mapping.name) {
                let has_pos = mapping.field_type == crate::mapping::FieldType::Text;
                fields_with_positions.insert(fid, has_pos);
            }
        }
        Self {
            segment_id,
            schema: schema.clone(),
            doc_count: 0,
            postings: HashMap::new(),
            fields_with_positions,
            field_lengths: HashMap::new(),
            doc_store: DocStoreWriter::new(),
            columnar: ColumnarWriter::new(),
            parent_bitset: Vec::new(),
            has_nested: schema
                .fields()
                .iter()
                .any(|f| matches!(f.field_type, crate::mapping::FieldType::Nested)),
            geo_stores: {
                let mut gs = HashMap::new();
                for mapping in schema.fields() {
                    if matches!(mapping.field_type, crate::mapping::FieldType::GeoPoint) {
                        let fid = schema.field_id(&mapping.name).unwrap();
                        gs.insert(fid, GeoPointStore::new());
                    }
                }
                gs
            },
            geo_shape_stores: {
                let mut gs = HashMap::new();
                for mapping in schema.fields() {
                    if matches!(mapping.field_type, crate::mapping::FieldType::GeoShape) {
                        let fid = schema.field_id(&mapping.name).unwrap();
                        gs.insert(fid, crate::spatial::shape::GeoShapeStore::new());
                    }
                }
                gs
            },
        }
    }

    /// Add a document with its analyzed fields and raw source JSON.
    ///
    /// `analyzed_fields` contains `(field_id, tokens)` for each indexed field.
    /// Keyword fields should have a single token with the exact value.
    /// `source` is the original JSON bytes stored for `_source` retrieval.
    pub fn add_document(&mut self, analyzed_fields: &[(FieldId, Vec<Token>)], source: &[u8]) {
        let doc_id = DocId::new(self.doc_count);

        for (field_id, tokens) in analyzed_fields {
            // Compute term frequencies and collect positions
            let mut term_positions: HashMap<&str, Vec<u32>> = HashMap::new();
            for token in tokens {
                term_positions
                    .entry(token.text.as_str())
                    .or_default()
                    .push(token.position);
            }

            // Add to inverted index
            let field_postings = self.postings.entry(*field_id).or_default();
            for (term, positions) in &term_positions {
                field_postings
                    .entry(term.to_string())
                    .or_default()
                    .push(TermPosting {
                        doc_id,
                        tf: positions.len() as u32,
                        positions: positions.clone(),
                    });
            }

            // Record field length for norms
            self.field_lengths
                .entry(*field_id)
                .or_default()
                .push(tokens.len() as u32);
        }

        // Ensure fields that didn't appear in this doc still get a norm entry (length 0)
        for mapping in self.schema.fields() {
            let field_id = self.schema.field_id(&mapping.name).unwrap();
            if mapping.norms {
                let lengths = self.field_lengths.entry(field_id).or_default();
                if lengths.len() <= self.doc_count as usize {
                    lengths.push(0);
                }
            }
        }

        // Store source
        self.doc_store.add(source);
        self.doc_count += 1;
    }

    /// Mark the most recently added doc as a parent (not nested).
    pub fn mark_parent(&mut self) {
        // Ensure bitset is sized to current doc_count
        while self.parent_bitset.len() < self.doc_count as usize {
            self.parent_bitset.push(false);
        }
        // doc_count - 1 is the index of the last added document
        self.parent_bitset[self.doc_count as usize - 1] = true;
    }

    /// Mark the current doc as a nested (hidden) doc.
    pub fn mark_nested(&mut self) {
        while self.parent_bitset.len() < self.doc_count as usize {
            self.parent_bitset.push(false);
        }
    }

    /// Add a geo point for a geo_point field.
    pub fn add_geo_point(&mut self, field_id: FieldId, point: GeoPoint) {
        if let Some(store) = self.geo_stores.get_mut(&field_id) {
            store.add(point);
        }
    }

    /// Add a geo shape for a geo_shape field.
    pub fn add_geo_shape(&mut self, field_id: FieldId, geom: &::geo::Geometry<f64>) {
        if let Some(store) = self.geo_shape_stores.get_mut(&field_id) {
            store.add(geom);
        }
    }

    /// Add a column value for a doc_values field.
    pub fn add_column_value(&mut self, field_id: FieldId, value: ColumnValue) {
        self.columnar.add(field_id, value);
    }

    /// Number of documents added so far.
    pub fn doc_count(&self) -> u32 {
        self.doc_count
    }

    /// The segment id assigned to this builder. Used by
    /// [`IndexWriter::add`] to stamp the current doc's
    /// `(segment_id, local_doc_id)` pair into the global HNSW
    /// resolver before `add_document` is called.
    pub fn segment_id(&self) -> SegmentId {
        self.segment_id
    }

    /// Is the buffer empty?
    pub fn is_empty(&self) -> bool {
        self.doc_count == 0
    }

    /// Build the complete segment bytes.
    ///
    /// Returns the serialized segment including header, inverted index,
    /// norms, and document store.
    pub fn build(self) -> Vec<u8> {
        // Phase 1: Build field metadata (before consuming self)
        let field_metas = self.build_field_metas();
        let has_columnar = !self.columnar.is_empty();
        let has_spatial = (!self.geo_stores.is_empty()
            && self.geo_stores.values().any(|s| !s.is_empty()))
            || (!self.geo_shape_stores.is_empty()
                && self.geo_shape_stores.values().any(|s| !s.is_empty()));

        // Phase 2: Build components
        let inverted_data = self.build_inverted_index();
        let columnar_data = if has_columnar {
            self.columnar.finish()
        } else {
            Vec::new()
        };
        let spatial_data = if has_spatial {
            let mut buf = Vec::new();
            let point_stores: Vec<_> = self
                .geo_stores
                .iter()
                .filter(|(_, s)| !s.is_empty())
                .collect();
            let shape_stores: Vec<_> = self
                .geo_shape_stores
                .iter()
                .filter(|(_, s)| !s.is_empty())
                .collect();
            let total = point_stores.len() + shape_stores.len();
            buf.extend_from_slice(&(total as u16).to_le_bytes());
            for (fid, store) in &point_stores {
                buf.extend_from_slice(&fid.as_u16().to_le_bytes());
                buf.push(0u8); // sub_type: GeoPoint
                let data = store.to_bytes();
                buf.extend_from_slice(&(data.len() as u32).to_le_bytes());
                buf.extend_from_slice(&data);
            }
            for (fid, store) in &shape_stores {
                buf.extend_from_slice(&fid.as_u16().to_le_bytes());
                buf.push(1u8); // sub_type: GeoShape
                let data = store.to_bytes();
                buf.extend_from_slice(&(data.len() as u32).to_le_bytes());
                buf.extend_from_slice(&data);
            }
            buf
        } else {
            Vec::new()
        };
        let doc_store_data = self.doc_store.finish();

        // Count components for header sizing
        let num_components = (!inverted_data.is_empty() as usize)
            + (!columnar_data.is_empty() as usize)
            + (!spatial_data.is_empty() as usize)
            + 1; // doc store always present

        // Compute header size manually
        let fields_size: usize = field_metas.iter().map(|f| f.to_bytes().len()).sum();
        // +1 for parent_bitset presence byte, +optional bitset data
        let parent_bitset_size = if self.has_nested && !self.parent_bitset.is_empty() {
            1 + 4 + (self.parent_bitset.len() + 7) / 8 // presence(1) + len(4) + packed bits
        } else {
            1 // just the presence byte (0)
        };
        let header_size = 28
            + 1
            + num_components * ComponentOffset::SERIALIZED_SIZE
            + 2
            + fields_size
            + parent_bitset_size;

        // Compute offsets
        let mut offset = header_size as u64;
        let mut components = Vec::new();

        if !inverted_data.is_empty() {
            let checksum = xxhash_rust::xxh3::xxh3_64(&inverted_data);
            components.push(ComponentOffset {
                component_type: ComponentType::InvertedIndex,
                offset,
                length: inverted_data.len() as u64,
                checksum,
            });
            offset += inverted_data.len() as u64;
        }

        if !columnar_data.is_empty() {
            let checksum = xxhash_rust::xxh3::xxh3_64(&columnar_data);
            components.push(ComponentOffset {
                component_type: ComponentType::Columnar,
                offset,
                length: columnar_data.len() as u64,
                checksum,
            });
            offset += columnar_data.len() as u64;
        }

        if !spatial_data.is_empty() {
            let checksum = xxhash_rust::xxh3::xxh3_64(&spatial_data);
            components.push(ComponentOffset {
                component_type: ComponentType::Spatial,
                offset,
                length: spatial_data.len() as u64,
                checksum,
            });
            offset += spatial_data.len() as u64;
        }

        let doc_store_checksum = xxhash_rust::xxh3::xxh3_64(&doc_store_data);
        components.push(ComponentOffset {
            component_type: ComponentType::DocStore,
            offset,
            length: doc_store_data.len() as u64,
            checksum: doc_store_checksum,
        });

        let pb = if self.has_nested && !self.parent_bitset.is_empty() {
            // Pad to max_doc length
            let mut bs = self.parent_bitset.clone();
            while bs.len() < self.doc_count as usize {
                bs.push(false);
            }
            Some(bs)
        } else {
            None
        };

        let header = SegmentHeader {
            segment_id: self.segment_id,
            doc_count: self.doc_count,
            max_doc: self.doc_count,
            components,
            fields: field_metas,
            parent_bitset: pb,
        };

        let header_bytes = header.to_bytes();
        debug_assert_eq!(
            header_bytes.len(),
            header_size,
            "header size measurement mismatch"
        );

        // Concatenate
        let total_size = header_size
            + inverted_data.len()
            + columnar_data.len()
            + spatial_data.len()
            + doc_store_data.len();
        let mut result = Vec::with_capacity(total_size);
        result.extend_from_slice(&header_bytes);
        result.extend_from_slice(&inverted_data);
        result.extend_from_slice(&columnar_data);
        result.extend_from_slice(&spatial_data);
        result.extend_from_slice(&doc_store_data);
        result
    }

    /// Build the inverted index component: per-field term dicts + posting lists + norms.
    ///
    /// Internal format:
    /// ```text
    /// [num_fields: u16]
    /// Per indexed field:
    ///   [field_id: u16]
    ///   [term_dict_len: u32] [term_dict_bytes]
    ///   [postings_data_len: u32] [posting_list_bytes...]
    ///   [has_norms: u8] [norms_len: u32] [norms_bytes]
    /// ```
    fn build_inverted_index(&self) -> Vec<u8> {
        if self.postings.is_empty() {
            return Vec::new();
        }

        let mut buf = Vec::new();

        // Collect indexed fields
        let mut indexed_field_ids: Vec<FieldId> = self.postings.keys().copied().collect();
        indexed_field_ids.sort();

        buf.extend_from_slice(&(indexed_field_ids.len() as u16).to_le_bytes());

        for &field_id in &indexed_field_ids {
            buf.extend_from_slice(&field_id.as_u16().to_le_bytes());

            let field_postings = &self.postings[&field_id];

            // Sort terms
            let mut terms: Vec<&String> = field_postings.keys().collect();
            terms.sort();

            // Build posting lists and record offsets
            let mut postings_data = Vec::new();
            let mut term_dict_builder = TermDictBuilder::new();

            let store_positions = self
                .fields_with_positions
                .get(&field_id)
                .copied()
                .unwrap_or(false);

            for term in &terms {
                let offset = postings_data.len() as u64;
                let docs = &field_postings[*term];

                if store_positions {
                    let mut plw = PositionPostingListWriter::new();
                    for posting in docs {
                        plw.add(posting.doc_id, &posting.positions);
                    }
                    postings_data.extend_from_slice(&plw.finish());
                } else {
                    let mut plw = BlockMaxPostingListWriter::new();
                    for posting in docs {
                        plw.add(posting.doc_id, posting.tf);
                    }
                    postings_data.extend_from_slice(&plw.finish());
                }

                term_dict_builder.add(term, offset);
            }

            // Write term dict
            let term_dict_bytes = term_dict_builder.finish();
            buf.extend_from_slice(&(term_dict_bytes.len() as u32).to_le_bytes());
            buf.extend_from_slice(&term_dict_bytes);

            // Write postings data
            buf.extend_from_slice(&(postings_data.len() as u32).to_le_bytes());
            buf.extend_from_slice(&postings_data);

            // Write norms
            let has_norms = self.field_lengths.contains_key(&field_id);
            buf.push(has_norms as u8);
            if has_norms {
                let lengths = &self.field_lengths[&field_id];
                let mut norms_writer = FieldNormsWriter::new(field_id);
                for &len in lengths {
                    norms_writer.add(len);
                }
                let norms_bytes = norms_writer.finish();
                buf.extend_from_slice(&(norms_bytes.len() as u32).to_le_bytes());
                buf.extend_from_slice(&norms_bytes);
            }
        }

        buf
    }

    fn build_field_metas(&self) -> Vec<FieldMeta> {
        self.schema
            .fields()
            .iter()
            .enumerate()
            .map(|(i, mapping)| field_meta_from_mapping(FieldId::new(i as u16), mapping))
            .collect()
    }
}

fn field_meta_from_mapping(field_id: FieldId, mapping: &FieldMapping) -> FieldMeta {
    FieldMeta::new(
        field_id,
        mapping.name.clone(),
        mapping.field_type.clone(),
        mapping.stored,
        mapping.indexed,
        mapping.doc_values,
        mapping.norms,
    )
}

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

    fn simple_schema() -> Mapping {
        Mapping::builder().field("title", FieldType::Text).build()
    }

    fn two_field_schema() -> Mapping {
        Mapping::builder()
            .field("title", FieldType::Text)
            .field("status", FieldType::Keyword)
            .build()
    }

    fn make_tokens(terms: &[&str]) -> Vec<Token> {
        terms
            .iter()
            .enumerate()
            .map(|(i, t)| Token::new(*t, 0, t.len(), i as u32))
            .collect()
    }

    #[test]
    fn single_doc_single_field() {
        let schema = simple_schema();
        let mut builder = SegmentBuilder::new(SegmentId::new(1), &schema);

        let tokens = make_tokens(&["hello", "world"]);
        builder.add_document(&[(FieldId::new(0), tokens)], br#"{"title":"hello world"}"#);

        assert_eq!(builder.doc_count(), 1);
        let data = builder.build();
        assert!(!data.is_empty());

        // Verify header is parseable
        let (header, _) = SegmentHeader::from_bytes(&data).unwrap();
        assert_eq!(header.segment_id, SegmentId::new(1));
        assert_eq!(header.doc_count, 1);
        assert_eq!(header.max_doc, 1);
    }

    #[test]
    fn multiple_docs() {
        let schema = simple_schema();
        let mut builder = SegmentBuilder::new(SegmentId::new(2), &schema);

        for i in 0..10 {
            let tokens = make_tokens(&["term"]);
            let source = format!(r#"{{"id":{i}}}"#);
            builder.add_document(&[(FieldId::new(0), tokens)], source.as_bytes());
        }

        assert_eq!(builder.doc_count(), 10);
        let data = builder.build();
        let (header, _) = SegmentHeader::from_bytes(&data).unwrap();
        assert_eq!(header.doc_count, 10);
    }

    #[test]
    fn multiple_fields() {
        let schema = two_field_schema();
        let mut builder = SegmentBuilder::new(SegmentId::new(3), &schema);

        let title_tokens = make_tokens(&["hello", "world"]);
        let status_tokens = make_tokens(&["active"]);
        builder.add_document(
            &[
                (FieldId::new(0), title_tokens),
                (FieldId::new(1), status_tokens),
            ],
            br#"{"title":"hello world","status":"active"}"#,
        );

        let data = builder.build();
        let (header, _) = SegmentHeader::from_bytes(&data).unwrap();
        assert_eq!(header.fields.len(), 2);
        assert_eq!(header.fields[0].field_name, "title");
        assert_eq!(header.fields[1].field_name, "status");
    }

    #[test]
    fn component_offsets_valid() {
        let schema = simple_schema();
        let mut builder = SegmentBuilder::new(SegmentId::new(4), &schema);
        builder.add_document(&[(FieldId::new(0), make_tokens(&["test"]))], b"{}");

        let data = builder.build();
        let (header, header_size) = SegmentHeader::from_bytes(&data).unwrap();

        // Inverted index should start right after header
        let inv = header.component(ComponentType::InvertedIndex).unwrap();
        assert_eq!(inv.offset as usize, header_size);
        assert!(inv.length > 0);

        // Doc store should follow inverted index
        let ds = header.component(ComponentType::DocStore).unwrap();
        assert_eq!(ds.offset, inv.offset + inv.length);
        assert!(ds.length > 0);

        // Total should match data length
        assert_eq!((ds.offset + ds.length) as usize, data.len());
    }

    #[test]
    fn term_dict_in_segment() {
        let schema = simple_schema();
        let mut builder = SegmentBuilder::new(SegmentId::new(5), &schema);
        builder.add_document(
            &[(FieldId::new(0), make_tokens(&["alpha", "beta", "gamma"]))],
            b"{}",
        );

        let data = builder.build();
        let (header, _) = SegmentHeader::from_bytes(&data).unwrap();

        // The inverted index component should exist and have valid checksum
        let inv = header.component(ComponentType::InvertedIndex).unwrap();
        let inv_data = &data[inv.offset as usize..(inv.offset + inv.length) as usize];
        let checksum = xxhash_rust::xxh3::xxh3_64(inv_data);
        assert_eq!(checksum, inv.checksum);
    }

    #[test]
    fn doc_store_in_segment() {
        let schema = simple_schema();
        let mut builder = SegmentBuilder::new(SegmentId::new(6), &schema);
        let source = br#"{"title":"test doc"}"#;
        builder.add_document(&[(FieldId::new(0), make_tokens(&["test", "doc"]))], source);

        let data = builder.build();
        let (header, _) = SegmentHeader::from_bytes(&data).unwrap();

        let ds = header.component(ComponentType::DocStore).unwrap();
        let ds_data = &data[ds.offset as usize..(ds.offset + ds.length) as usize];

        // Verify doc store is readable
        use crate::store::doc_store::DocStoreReader;
        let reader = DocStoreReader::open(ds_data);
        assert_eq!(reader.doc_count(), 1);
        assert_eq!(reader.get(0).unwrap(), source);
    }

    #[test]
    fn empty_builder() {
        let schema = simple_schema();
        let builder = SegmentBuilder::new(SegmentId::new(7), &schema);
        assert!(builder.is_empty());
        assert_eq!(builder.doc_count(), 0);

        let data = builder.build();
        let (header, _) = SegmentHeader::from_bytes(&data).unwrap();
        assert_eq!(header.doc_count, 0);
    }

    #[test]
    fn norms_present_for_text_fields() {
        let schema = simple_schema();
        let mut builder = SegmentBuilder::new(SegmentId::new(8), &schema);
        builder.add_document(&[(FieldId::new(0), make_tokens(&["a", "b", "c"]))], b"{}");
        builder.add_document(&[(FieldId::new(0), make_tokens(&["x"]))], b"{}");

        let data = builder.build();
        // Just verify it builds without error — detailed norms testing
        // happens through the SegmentReader in Step 7.
        let (header, _) = SegmentHeader::from_bytes(&data).unwrap();
        assert_eq!(header.doc_count, 2);
    }

    #[test]
    fn posting_lists_have_correct_doc_ids() {
        let schema = simple_schema();
        let mut builder = SegmentBuilder::new(SegmentId::new(9), &schema);

        // Doc 0 has "hello" and "world"
        builder.add_document(
            &[(FieldId::new(0), make_tokens(&["hello", "world"]))],
            b"{}",
        );
        // Doc 1 has "hello" only
        builder.add_document(&[(FieldId::new(0), make_tokens(&["hello"]))], b"{}");

        // The "hello" posting list should have docs [0, 1]
        // The "world" posting list should have docs [0]
        // We verify this via the SegmentReader in Step 7.
        let data = builder.build();
        assert!(data.len() > 0);
    }

    #[test]
    fn multiple_docs_doc_store_all_retrievable() {
        let schema = simple_schema();
        let mut builder = SegmentBuilder::new(SegmentId::new(10), &schema);
        let sources: Vec<String> = (0..50).map(|i| format!(r#"{{"id":{i}}}"#)).collect();

        for source in &sources {
            builder.add_document(
                &[(FieldId::new(0), make_tokens(&["token"]))],
                source.as_bytes(),
            );
        }

        let data = builder.build();
        let (header, _) = SegmentHeader::from_bytes(&data).unwrap();
        let ds = header.component(ComponentType::DocStore).unwrap();
        let ds_data = &data[ds.offset as usize..(ds.offset + ds.length) as usize];

        use crate::store::doc_store::DocStoreReader;
        let reader = DocStoreReader::open(ds_data);
        assert_eq!(reader.doc_count(), 50);
        for (i, expected) in sources.iter().enumerate() {
            assert_eq!(
                String::from_utf8(reader.get(i as u32).unwrap()).unwrap(),
                *expected
            );
        }
    }

    #[test]
    fn checksum_validates() {
        let schema = simple_schema();
        let mut builder = SegmentBuilder::new(SegmentId::new(11), &schema);
        builder.add_document(&[(FieldId::new(0), make_tokens(&["test"]))], b"{}");

        let data = builder.build();
        let (header, _) = SegmentHeader::from_bytes(&data).unwrap();

        // Verify component checksums
        for comp in &header.components {
            let comp_data = &data[comp.offset as usize..(comp.offset + comp.length) as usize];
            let checksum = xxhash_rust::xxh3::xxh3_64(comp_data);
            assert_eq!(
                checksum, comp.checksum,
                "component {:?} checksum mismatch",
                comp.component_type
            );
        }
    }
}