a3s-vec 0.1.8

Native Rust in-process vector database with zvec-compatible capabilities
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
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
//! Query payloads and per-index search controls.

use crate::error::{Error, Result};
use serde::{Deserialize, Serialize};
use serde_json::{json, Map, Value};

#[derive(Debug, Clone, Copy, PartialEq, Serialize, Deserialize)]
pub struct HnswQueryParams {
    pub ef: i32,
    pub radius: f32,
    pub is_linear: bool,
    pub is_using_refiner: bool,
}
impl HnswQueryParams {
    pub fn new(ef: i32, radius: f32, is_linear: bool, is_using_refiner: bool) -> Self {
        Self {
            ef,
            radius,
            is_linear,
            is_using_refiner,
        }
    }
    pub fn set_ef(&mut self, ef: i32) -> Result<()> {
        if ef <= 0 {
            return Err(Error::invalid_argument("HNSW ef must be positive"));
        }
        self.ef = ef;
        Ok(())
    }
    pub fn ef(&self) -> i32 {
        self.ef
    }
}

#[derive(Debug, Clone, Copy, PartialEq, Serialize, Deserialize)]
pub struct IvfQueryParams {
    pub nprobe: i32,
    pub is_using_refiner: bool,
    pub scale_factor: f32,
}
impl IvfQueryParams {
    pub fn new(nprobe: i32, is_using_refiner: bool, scale_factor: f32) -> Self {
        Self {
            nprobe,
            is_using_refiner,
            scale_factor,
        }
    }
    pub fn set_nprobe(&mut self, nprobe: i32) -> Result<()> {
        if nprobe <= 0 {
            return Err(Error::invalid_argument("IVF nprobe must be positive"));
        }
        self.nprobe = nprobe;
        Ok(())
    }
    pub fn nprobe(&self) -> i32 {
        self.nprobe
    }
    pub fn set_scale_factor(&mut self, value: f32) -> Result<()> {
        if !value.is_finite() || value <= 0.0 {
            return Err(Error::invalid_argument(
                "scale factor must be finite and positive",
            ));
        }
        self.scale_factor = value;
        Ok(())
    }
    pub fn scale_factor(&self) -> f32 {
        self.scale_factor
    }
}

#[derive(Debug, Clone, Copy, PartialEq, Serialize, Deserialize)]
pub struct IvfRabitqQueryParams {
    pub nprobe: i32,
    pub radius: f32,
    pub is_linear: bool,
    pub is_using_refiner: bool,
    pub scale_factor: f32,
}
impl IvfRabitqQueryParams {
    pub fn new(nprobe: i32, radius: f32, is_linear: bool, is_using_refiner: bool) -> Self {
        Self {
            nprobe,
            radius,
            is_linear,
            is_using_refiner,
            scale_factor: 1.0,
        }
    }
    pub fn set_nprobe(&mut self, nprobe: i32) -> Result<()> {
        if nprobe <= 0 {
            return Err(Error::invalid_argument(
                "IVF RaBitQ nprobe must be positive",
            ));
        }
        self.nprobe = nprobe;
        Ok(())
    }
    pub fn nprobe(&self) -> i32 {
        self.nprobe
    }
    pub fn set_scale_factor(&mut self, value: f32) -> Result<()> {
        if !value.is_finite() || value <= 0.0 {
            return Err(Error::invalid_argument(
                "scale factor must be finite and positive",
            ));
        }
        self.scale_factor = value;
        Ok(())
    }
    pub fn scale_factor(&self) -> f32 {
        self.scale_factor
    }
}

#[derive(Debug, Clone, Copy, PartialEq, Serialize, Deserialize)]
pub struct FlatQueryParams {
    pub is_using_refiner: bool,
    pub scale_factor: f32,
}
impl FlatQueryParams {
    pub fn new(is_using_refiner: bool, scale_factor: f32) -> Self {
        Self {
            is_using_refiner,
            scale_factor,
        }
    }
}

#[derive(Debug, Clone, Copy, PartialEq, Serialize, Deserialize)]
pub struct DiskannQueryParams {
    pub list_size: i32,
}
impl DiskannQueryParams {
    pub fn new(list_size: i32) -> Self {
        Self { list_size }
    }
    pub fn set_list_size(&mut self, value: i32) -> Result<()> {
        if value <= 0 {
            return Err(Error::invalid_argument(
                "DiskANN list_size must be positive",
            ));
        }
        self.list_size = value;
        Ok(())
    }
    pub fn list_size(&self) -> i32 {
        self.list_size
    }
}

/// Full-text query controls.
///
/// Omitting `default_operator` preserves OR semantics. `AND` intersects all
/// analyzed terms before BM25 scoring, which is useful for selective n-gram
/// substring queries.
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
pub struct FtsQueryParams {
    pub default_operator: Option<String>,
}

#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub(crate) enum FtsDefaultOperator {
    Or,
    And,
}

impl FtsDefaultOperator {
    fn parse(value: &str) -> Result<Self> {
        match value.to_ascii_lowercase().as_str() {
            "or" => Ok(Self::Or),
            "and" => Ok(Self::And),
            _ => Err(Error::invalid_argument(
                "FTS default operator must be AND or OR",
            )),
        }
    }

    fn as_str(self) -> &'static str {
        match self {
            Self::Or => "or",
            Self::And => "and",
        }
    }
}
impl FtsQueryParams {
    pub fn new(default_operator: Option<&str>) -> Result<Self> {
        let mut out = Self {
            default_operator: None,
        };
        if let Some(value) = default_operator {
            out.set_default_operator(value)?;
        }
        Ok(out)
    }
    pub fn set_default_operator(&mut self, op: &str) -> Result<()> {
        self.default_operator = Some(FtsDefaultOperator::parse(op)?.as_str().to_string());
        Ok(())
    }
    pub fn default_operator(&self) -> Option<String> {
        self.default_operator.clone()
    }
}

#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
pub struct Fts {
    pub query_string: Option<String>,
    pub match_string: Option<String>,
}
impl Fts {
    pub fn new() -> Result<Self> {
        Ok(Self {
            query_string: None,
            match_string: None,
        })
    }
    pub fn set_query_string(&mut self, query: &str) -> Result<()> {
        if query.trim().is_empty() {
            return Err(Error::invalid_argument(
                "FTS query string must not be empty",
            ));
        }
        self.query_string = Some(query.to_string());
        Ok(())
    }
    pub fn set_match_string(&mut self, query: &str) -> Result<()> {
        if query.trim().is_empty() {
            return Err(Error::invalid_argument(
                "FTS match string must not be empty",
            ));
        }
        self.match_string = Some(query.to_string());
        Ok(())
    }
    pub fn query_string(&self) -> Option<String> {
        self.query_string.clone()
    }
    pub fn match_string(&self) -> Option<String> {
        self.match_string.clone()
    }
}

/// A single dense, sparse, binary, id-based, or FTS query.
#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]
pub struct SearchQuery {
    pub field_name: String,
    pub vector: Option<Vec<f32>>,
    #[serde(default)]
    pub binary_vector: Option<Vec<u8>>,
    pub sparse_vector: Option<Vec<(u32, f32)>>,
    pub id: Option<String>,
    pub topk: i32,
    pub filter: Option<String>,
    pub include_vector: bool,
    pub include_doc_id: bool,
    pub output_fields: Option<Vec<String>>,
    pub fts: Option<Fts>,
    #[serde(default)]
    pub params: Map<String, Value>,
}

/// Compatibility alias used by the zvec vocabulary.
pub type VectorQuery = SearchQuery;

impl SearchQuery {
    pub fn new(field_name: &str, vector: &[f32], topk: i32) -> Result<Self> {
        validate_query_header(field_name, topk)?;
        if vector.is_empty() || !vector.iter().all(|v| v.is_finite()) {
            return Err(Error::invalid_argument(
                "query vector must be non-empty and finite",
            ));
        }
        Ok(Self {
            field_name: field_name.to_string(),
            vector: Some(vector.to_vec()),
            binary_vector: None,
            sparse_vector: None,
            id: None,
            topk,
            filter: None,
            include_vector: false,
            include_doc_id: false,
            output_fields: None,
            fts: None,
            params: Map::new(),
        })
    }
    pub fn fts(field_name: &str, fts: &Fts, topk: i32) -> Result<Self> {
        validate_query_header(field_name, topk)?;
        if fts.query_string.is_none() && fts.match_string.is_none() {
            return Err(Error::invalid_argument("FTS query has no expression"));
        }
        Ok(Self {
            field_name: field_name.to_string(),
            vector: None,
            binary_vector: None,
            sparse_vector: None,
            id: None,
            topk,
            filter: None,
            include_vector: false,
            include_doc_id: false,
            output_fields: None,
            fts: Some(fts.clone()),
            params: Map::new(),
        })
    }
    pub fn by_id(field_name: &str, id: &str, topk: i32) -> Result<Self> {
        validate_query_header(field_name, topk)?;
        if id.is_empty() || id.contains('\0') {
            return Err(Error::invalid_argument(
                "query id must be non-empty and contain no NUL byte",
            ));
        }
        Ok(Self {
            field_name: field_name.to_string(),
            vector: None,
            binary_vector: None,
            sparse_vector: None,
            id: Some(id.to_string()),
            topk,
            filter: None,
            include_vector: false,
            include_doc_id: false,
            output_fields: None,
            fts: None,
            params: Map::new(),
        })
    }
    pub fn sparse(field_name: &str, indices: &[u32], values: &[f32], topk: i32) -> Result<Self> {
        validate_query_header(field_name, topk)?;
        if indices.is_empty()
            || indices.len() != values.len()
            || !values.iter().all(|v| v.is_finite())
        {
            return Err(Error::invalid_argument(
                "sparse query indices and values must have equal non-zero length",
            ));
        }
        Ok(Self {
            field_name: field_name.to_string(),
            vector: None,
            binary_vector: None,
            sparse_vector: Some(
                indices
                    .iter()
                    .copied()
                    .zip(values.iter().copied())
                    .collect(),
            ),
            id: None,
            topk,
            filter: None,
            include_vector: false,
            include_doc_id: false,
            output_fields: None,
            fts: None,
            params: Map::new(),
        })
    }
    /// Creates a packed Binary32 or Binary64 exact query.
    ///
    /// The collection schema determines the binary type and validates the byte
    /// length. Binary search uses L2 over bit coordinates, whose squared
    /// distance is the XOR Hamming count.
    pub fn binary(field_name: &str, vector: &[u8], topk: i32) -> Result<Self> {
        validate_query_header(field_name, topk)?;
        if vector.is_empty() {
            return Err(Error::invalid_argument(
                "binary query vector must be non-empty",
            ));
        }
        Ok(Self {
            field_name: field_name.to_string(),
            vector: None,
            binary_vector: Some(vector.to_vec()),
            sparse_vector: None,
            id: None,
            topk,
            filter: None,
            include_vector: false,
            include_doc_id: false,
            output_fields: None,
            fts: None,
            params: Map::new(),
        })
    }
    pub fn builder() -> SearchQueryBuilder {
        SearchQueryBuilder::new()
    }
    pub fn set_field_name(&mut self, name: &str) -> Result<()> {
        validate_name(name)?;
        self.field_name = name.to_string();
        Ok(())
    }
    pub fn set_query_vector(&mut self, vector: &[f32]) -> Result<()> {
        if vector.is_empty() || !vector.iter().all(|v| v.is_finite()) {
            return Err(Error::invalid_argument(
                "query vector must be non-empty and finite",
            ));
        }
        self.vector = Some(vector.to_vec());
        self.binary_vector = None;
        self.sparse_vector = None;
        self.id = None;
        self.fts = None;
        Ok(())
    }
    pub fn set_binary_vector(&mut self, vector: &[u8]) -> Result<()> {
        if vector.is_empty() {
            return Err(Error::invalid_argument(
                "binary query vector must be non-empty",
            ));
        }
        self.binary_vector = Some(vector.to_vec());
        self.vector = None;
        self.sparse_vector = None;
        self.id = None;
        self.fts = None;
        Ok(())
    }
    pub fn set_sparse_vector(&mut self, indices: &[u32], values: &[f32]) -> Result<()> {
        if indices.is_empty()
            || indices.len() != values.len()
            || !values.iter().all(|v| v.is_finite())
        {
            return Err(Error::invalid_argument(
                "sparse query indices and values are invalid",
            ));
        }
        self.sparse_vector = Some(
            indices
                .iter()
                .copied()
                .zip(values.iter().copied())
                .collect(),
        );
        self.vector = None;
        self.binary_vector = None;
        self.id = None;
        self.fts = None;
        Ok(())
    }
    pub fn set_filter(&mut self, filter: &str) -> Result<()> {
        if filter.trim().is_empty() {
            self.filter = None;
            return Ok(());
        }
        self.filter = Some(filter.to_string());
        Ok(())
    }
    pub fn set_topk(&mut self, topk: i32) -> Result<()> {
        if topk <= 0 {
            return Err(Error::invalid_argument("topk must be positive"));
        }
        self.topk = topk;
        Ok(())
    }
    pub fn set_include_vector(&mut self, include: bool) -> Result<()> {
        self.include_vector = include;
        Ok(())
    }
    pub fn set_include_doc_id(&mut self, include: bool) -> Result<()> {
        self.include_doc_id = include;
        Ok(())
    }
    pub fn set_output_fields(&mut self, fields: &[&str]) -> Result<()> {
        for field in fields {
            validate_name(field)?;
        }
        self.output_fields = Some(fields.iter().map(|s| (*s).to_string()).collect());
        Ok(())
    }
    pub fn set_hnsw_params(&mut self, params: HnswQueryParams) -> Result<()> {
        apply_hnsw_query_controls(&mut self.params, params)
    }
    pub fn set_ivf_params(&mut self, params: IvfQueryParams) -> Result<()> {
        apply_ivf_query_controls(&mut self.params, params)
    }
    pub fn set_ivf_rabitq_params(&mut self, params: IvfRabitqQueryParams) -> Result<()> {
        apply_ivf_rabitq_query_controls(&mut self.params, params)
    }
    pub fn set_flat_params(&mut self, _params: FlatQueryParams) -> Result<()> {
        unsupported_query_controls("Flat refinement")
    }
    pub fn set_diskann_params(&mut self, params: DiskannQueryParams) -> Result<()> {
        apply_diskann_query_controls(&mut self.params, params)
    }
    pub fn set_fts_params(&mut self, params: FtsQueryParams) -> Result<()> {
        apply_fts_query_controls(&mut self.params, params)
    }
    pub fn set_fts(&mut self, fts: &Fts) -> Result<()> {
        if fts.query_string.is_none() && fts.match_string.is_none() {
            return Err(Error::invalid_argument("FTS query has no expression"));
        }
        self.fts = Some(fts.clone());
        self.vector = None;
        self.binary_vector = None;
        self.sparse_vector = None;
        self.id = None;
        Ok(())
    }
    pub fn set_radius(&mut self, radius: f32) -> Result<()> {
        if !radius.is_finite() {
            return Err(Error::invalid_argument("radius must be finite"));
        }
        self.params.insert("radius".into(), json!(radius));
        Ok(())
    }
    pub fn get_filter(&self) -> Option<&str> {
        self.filter.as_deref()
    }
    pub fn has_vector(&self) -> bool {
        self.vector.is_some() || self.binary_vector.is_some() || self.sparse_vector.is_some()
    }
}

/// Fluent builder matching the official SDK's naming.
///
/// A builder can construct a dense-vector, binary-vector, or pure FTS query.
/// The routes are mutually exclusive, as are the FTS `query_string` and
/// `match_string` forms.
#[derive(Debug, Clone, Default)]
pub struct SearchQueryBuilder {
    field_name: Option<String>,
    vector: Option<Vec<f32>>,
    binary_vector: Option<Vec<u8>>,
    topk: i32,
    filter: Option<String>,
    include_vector: Option<bool>,
    include_doc_id: Option<bool>,
    output_fields: Option<Vec<String>>,
    fts_query_string: Option<String>,
    fts_match_string: Option<String>,
}
impl SearchQueryBuilder {
    pub fn new() -> Self {
        Self {
            topk: 10,
            ..Self::default()
        }
    }
    pub fn field_name(mut self, name: &str) -> Self {
        self.field_name = Some(name.to_string());
        self
    }
    pub fn vector(mut self, vector: &[f32]) -> Self {
        self.vector = Some(vector.to_vec());
        self
    }
    pub fn binary_vector(mut self, vector: &[u8]) -> Self {
        self.binary_vector = Some(vector.to_vec());
        self
    }
    pub fn topk(mut self, topk: i32) -> Self {
        self.topk = topk;
        self
    }
    pub fn filter(mut self, filter: &str) -> Self {
        self.filter = Some(filter.to_string());
        self
    }
    pub fn include_vector(mut self, include: bool) -> Self {
        self.include_vector = Some(include);
        self
    }
    pub fn include_doc_id(mut self, include: bool) -> Self {
        self.include_doc_id = Some(include);
        self
    }
    pub fn output_fields(mut self, fields: &[&str]) -> Self {
        self.output_fields = Some(fields.iter().map(|v| (*v).to_string()).collect());
        self
    }
    pub fn fts_query_string(mut self, query: &str) -> Self {
        self.fts_query_string = Some(query.to_string());
        self
    }
    pub fn fts_match_string(mut self, query: &str) -> Self {
        self.fts_match_string = Some(query.to_string());
        self
    }
    /// Validates the selected route and creates the immutable query payload.
    pub fn build(self) -> Result<SearchQuery> {
        let field = self
            .field_name
            .ok_or_else(|| Error::invalid_argument("field_name is required"))?;
        let has_query_string = self.fts_query_string.is_some();
        let has_match_string = self.fts_match_string.is_some();
        let route_count = usize::from(self.vector.is_some())
            + usize::from(self.binary_vector.is_some())
            + usize::from(has_query_string || has_match_string);
        if route_count > 1 {
            return Err(Error::invalid_argument(
                "query builder cannot combine dense, binary, and FTS routes",
            ));
        }
        if has_query_string && has_match_string {
            return Err(Error::invalid_argument(
                "query builder cannot combine FTS query_string and match_string",
            ));
        }

        let mut query = if has_query_string || has_match_string {
            let mut fts = Fts::new()?;
            if let Some(value) = self.fts_query_string {
                fts.set_query_string(&value)?;
            }
            if let Some(value) = self.fts_match_string {
                fts.set_match_string(&value)?;
            }
            SearchQuery::fts(&field, &fts, self.topk)?
        } else if let Some(vector) = self.vector {
            SearchQuery::new(&field, &vector, self.topk)?
        } else if let Some(vector) = self.binary_vector {
            SearchQuery::binary(&field, &vector, self.topk)?
        } else {
            return Err(Error::invalid_argument(
                "dense vector, binary vector, or FTS expression is required",
            ));
        };
        if let Some(filter) = self.filter {
            query.set_filter(&filter)?;
        }
        if let Some(value) = self.include_vector {
            query.set_include_vector(value)?;
        }
        if let Some(value) = self.include_doc_id {
            query.set_include_doc_id(value)?;
        }
        if let Some(fields) = self.output_fields {
            let refs: Vec<&str> = fields.iter().map(String::as_str).collect();
            query.set_output_fields(&refs)?;
        }
        Ok(query)
    }
}

/// Group-by vector query payload.
#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]
pub struct GroupBySearchQuery {
    pub field_name: String,
    pub group_by_field: String,
    pub vector: Vec<f32>,
    #[serde(default)]
    pub binary_vector: Option<Vec<u8>>,
    pub group_count: u32,
    pub group_topk: u32,
    pub filter: Option<String>,
    pub include_vector: bool,
    pub output_fields: Option<Vec<String>>,
    pub params: Map<String, Value>,
}
impl GroupBySearchQuery {
    pub fn new(
        field_name: &str,
        group_by_field: &str,
        vector: &[f32],
        group_count: u32,
        group_topk: u32,
    ) -> Result<Self> {
        validate_name(field_name)?;
        validate_name(group_by_field)?;
        if vector.is_empty()
            || !vector.iter().all(|v| v.is_finite())
            || group_count == 0
            || group_topk == 0
        {
            return Err(Error::invalid_argument("invalid group-by query parameters"));
        }
        Ok(Self {
            field_name: field_name.to_string(),
            group_by_field: group_by_field.to_string(),
            vector: vector.to_vec(),
            binary_vector: None,
            group_count,
            group_topk,
            filter: None,
            include_vector: false,
            output_fields: None,
            params: Map::new(),
        })
    }
    /// Creates a grouped packed-binary exact query.
    pub fn binary(
        field_name: &str,
        group_by_field: &str,
        vector: &[u8],
        group_count: u32,
        group_topk: u32,
    ) -> Result<Self> {
        validate_name(field_name)?;
        validate_name(group_by_field)?;
        if vector.is_empty() || group_count == 0 || group_topk == 0 {
            return Err(Error::invalid_argument("invalid group-by query parameters"));
        }
        Ok(Self {
            field_name: field_name.to_string(),
            group_by_field: group_by_field.to_string(),
            vector: Vec::new(),
            binary_vector: Some(vector.to_vec()),
            group_count,
            group_topk,
            filter: None,
            include_vector: false,
            output_fields: None,
            params: Map::new(),
        })
    }
    pub fn set_filter(&mut self, filter: &str) -> Result<()> {
        self.filter = (!filter.trim().is_empty()).then_some(filter.to_string());
        Ok(())
    }
    pub fn set_include_vector(&mut self, include: bool) -> Result<()> {
        self.include_vector = include;
        Ok(())
    }
    pub fn set_output_fields(&mut self, fields: &[&str]) -> Result<()> {
        for field in fields {
            validate_name(field)?;
        }
        self.output_fields = Some(fields.iter().map(|s| (*s).to_string()).collect());
        Ok(())
    }
    pub fn set_hnsw_params(&mut self, params: HnswQueryParams) -> Result<()> {
        apply_hnsw_query_controls(&mut self.params, params)
    }
    pub fn set_ivf_params(&mut self, params: IvfQueryParams) -> Result<()> {
        apply_ivf_query_controls(&mut self.params, params)
    }
    pub fn set_ivf_rabitq_params(&mut self, params: IvfRabitqQueryParams) -> Result<()> {
        apply_ivf_rabitq_query_controls(&mut self.params, params)
    }
    pub fn set_flat_params(&mut self, _params: FlatQueryParams) -> Result<()> {
        unsupported_query_controls("Flat refinement")
    }
    pub fn set_diskann_params(&mut self, params: DiskannQueryParams) -> Result<()> {
        apply_diskann_query_controls(&mut self.params, params)
    }
}

pub(crate) fn unsupported_query_controls(name: &str) -> Result<()> {
    Err(Error::not_supported(format!(
        "{name} query controls have no execution consumer"
    )))
}

pub(crate) fn apply_hnsw_query_controls(
    target: &mut Map<String, Value>,
    params: HnswQueryParams,
) -> Result<()> {
    if params.ef <= 0 {
        return Err(Error::invalid_argument("HNSW ef must be positive"));
    }
    if !params.radius.is_finite() {
        return Err(Error::invalid_argument("HNSW radius must be finite"));
    }
    clear_ann_query_controls(target);
    target.insert("type".into(), json!("hnsw"));
    target.insert("ef".into(), json!(params.ef));
    target.insert("is_linear".into(), json!(params.is_linear));
    target.insert("is_using_refiner".into(), json!(params.is_using_refiner));
    if params.radius == 0.0 {
        target.remove("radius");
    } else {
        target.insert("radius".into(), json!(params.radius));
    }
    Ok(())
}

pub(crate) fn apply_ivf_query_controls(
    target: &mut Map<String, Value>,
    params: IvfQueryParams,
) -> Result<()> {
    if params.nprobe <= 0 {
        return Err(Error::invalid_argument("IVF nprobe must be positive"));
    }
    if !params.scale_factor.is_finite() || params.scale_factor <= 0.0 {
        return Err(Error::invalid_argument(
            "IVF scale factor must be finite and positive",
        ));
    }
    clear_ann_query_controls(target);
    target.insert("type".into(), json!("ivf"));
    target.insert("nprobe".into(), json!(params.nprobe));
    target.insert("is_using_refiner".into(), json!(params.is_using_refiner));
    target.insert("scale_factor".into(), json!(params.scale_factor));
    Ok(())
}

pub(crate) fn apply_ivf_rabitq_query_controls(
    target: &mut Map<String, Value>,
    params: IvfRabitqQueryParams,
) -> Result<()> {
    if params.nprobe <= 0 {
        return Err(Error::invalid_argument(
            "IVF RaBitQ nprobe must be positive",
        ));
    }
    if !params.radius.is_finite() {
        return Err(Error::invalid_argument("IVF RaBitQ radius must be finite"));
    }
    if !params.scale_factor.is_finite() || params.scale_factor <= 0.0 {
        return Err(Error::invalid_argument(
            "IVF RaBitQ scale factor must be finite and positive",
        ));
    }
    clear_ann_query_controls(target);
    target.insert("type".into(), json!("ivf_rabitq"));
    target.insert("nprobe".into(), json!(params.nprobe));
    target.insert("is_linear".into(), json!(params.is_linear));
    target.insert("is_using_refiner".into(), json!(params.is_using_refiner));
    target.insert("scale_factor".into(), json!(params.scale_factor));
    if params.radius == 0.0 {
        target.remove("radius");
    } else {
        target.insert("radius".into(), json!(params.radius));
    }
    Ok(())
}

pub(crate) fn apply_diskann_query_controls(
    target: &mut Map<String, Value>,
    params: DiskannQueryParams,
) -> Result<()> {
    if params.list_size <= 0 {
        return Err(Error::invalid_argument(
            "DiskANN list_size must be positive",
        ));
    }
    clear_ann_query_controls(target);
    target.insert("type".into(), json!("diskann"));
    target.insert("list_size".into(), json!(params.list_size));
    Ok(())
}

fn clear_ann_query_controls(target: &mut Map<String, Value>) {
    for name in [
        "type",
        "ef",
        "nprobe",
        "is_linear",
        "is_using_refiner",
        "scale_factor",
        "list_size",
    ] {
        target.remove(name);
    }
}

pub(crate) fn apply_fts_query_controls(
    target: &mut Map<String, Value>,
    params: FtsQueryParams,
) -> Result<()> {
    if let Some(value) = params.default_operator {
        let operator = FtsDefaultOperator::parse(&value)?;
        target.insert("default_operator".into(), json!(operator.as_str()));
    } else {
        target.remove("default_operator");
    }
    Ok(())
}

pub(crate) fn fts_default_operator(query: &SearchQuery) -> Result<FtsDefaultOperator> {
    query.params.get("default_operator").map_or_else(
        || Ok(FtsDefaultOperator::Or),
        |value| {
            value
                .as_str()
                .ok_or_else(|| {
                    Error::invalid_argument("FTS default_operator parameter must be a string")
                })
                .and_then(FtsDefaultOperator::parse)
        },
    )
}

fn validate_name(name: &str) -> Result<()> {
    if name.trim().is_empty() || name.contains('\0') {
        Err(Error::invalid_argument(
            "field name must be non-empty and contain no NUL byte",
        ))
    } else {
        Ok(())
    }
}
fn validate_query_header(name: &str, topk: i32) -> Result<()> {
    validate_name(name)?;
    if topk <= 0 {
        return Err(Error::invalid_argument("topk must be positive"));
    }
    Ok(())
}

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

    #[test]
    fn ann_query_controls_reject_non_positive_and_non_finite_values() {
        let mut params = Map::new();
        assert!(
            apply_hnsw_query_controls(&mut params, HnswQueryParams::new(0, 0.0, false, false))
                .is_err()
        );
        assert!(apply_hnsw_query_controls(
            &mut params,
            HnswQueryParams::new(8, f32::NAN, false, false)
        )
        .is_err());
        assert!(
            apply_hnsw_query_controls(&mut params, HnswQueryParams::new(8, 1.0, false, false))
                .is_ok()
        );
        assert!(params.get("radius").is_some());
        assert!(
            apply_hnsw_query_controls(&mut params, HnswQueryParams::new(8, 0.0, true, true))
                .is_ok()
        );
        assert!(params.get("radius").is_none());

        assert!(apply_ivf_query_controls(&mut params, IvfQueryParams::new(0, false, 1.0)).is_err());
        assert!(apply_ivf_query_controls(
            &mut params,
            IvfQueryParams::new(4, false, f32::INFINITY)
        )
        .is_err());
        assert!(apply_ivf_query_controls(&mut params, IvfQueryParams::new(4, true, 2.0)).is_ok());

        assert!(apply_ivf_rabitq_query_controls(
            &mut params,
            IvfRabitqQueryParams::new(0, 0.0, false, false)
        )
        .is_err());
        assert!(apply_ivf_rabitq_query_controls(
            &mut params,
            IvfRabitqQueryParams::new(2, f32::NAN, false, false)
        )
        .is_err());
        let mut bad_scale = IvfRabitqQueryParams::new(2, 0.0, false, false);
        bad_scale.scale_factor = 0.0;
        assert!(apply_ivf_rabitq_query_controls(&mut params, bad_scale).is_err());
        let mut good = IvfRabitqQueryParams::new(2, 1.5, true, true);
        good.scale_factor = 3.0;
        assert!(apply_ivf_rabitq_query_controls(&mut params, good).is_ok());
        assert!(params.get("radius").is_some());
        assert!(apply_ivf_rabitq_query_controls(
            &mut params,
            IvfRabitqQueryParams::new(2, 0.0, false, false)
        )
        .is_ok());
        assert!(params.get("radius").is_none());

        assert!(apply_diskann_query_controls(&mut params, DiskannQueryParams::new(0)).is_err());
        assert!(apply_diskann_query_controls(&mut params, DiskannQueryParams::new(64)).is_ok());

        assert!(unsupported_query_controls("Flat refinement").is_err());
        let mut query = SearchQuery::new("embedding", &[1.0, 0.0], 8).expect("query");
        assert!(query
            .set_flat_params(FlatQueryParams::new(false, 1.0))
            .is_err());
        assert!(HnswQueryParams::new(8, 0.0, false, false)
            .set_ef(0)
            .is_err());
        assert!(IvfQueryParams::new(4, false, 1.0).set_nprobe(0).is_err());
        assert!(IvfQueryParams::new(4, false, 1.0)
            .set_scale_factor(-1.0)
            .is_err());
        assert!(DiskannQueryParams::new(8).set_list_size(0).is_err());
    }

    #[test]
    fn fts_and_group_by_query_builders_cover_validation_edges() {
        assert!(FtsQueryParams::new(Some("xor")).is_err());
        assert!(FtsQueryParams::new(Some("AND")).is_ok());
        assert!(FtsQueryParams::new(Some("nope")).is_err());
        let params = FtsQueryParams::new(Some("OR")).expect("or");
        let mut map = Map::new();
        apply_fts_query_controls(&mut map, params).expect("apply");
        assert_eq!(
            map.get("default_operator").and_then(|v| v.as_str()),
            Some("or")
        );
        apply_fts_query_controls(&mut map, FtsQueryParams::new(None).expect("none"))
            .expect("clear");
        assert!(!map.contains_key("default_operator"));

        assert!(SearchQuery::new("", &[1.0], 1).is_err());
        assert!(SearchQuery::new("embedding", &[1.0], 0).is_err());
        assert!(SearchQuery::binary("embedding", &[], 8).is_err());
        assert!(SearchQuery::sparse("embedding", &[0], &[1.0, 2.0], 8).is_err());
        let mut fts = Fts::new().expect("fts");
        assert!(SearchQuery::fts("body", &fts, 8).is_err());
        fts.set_query_string("rust").expect("q");
        let mut query = SearchQuery::fts("body", &fts, 8).expect("fts query");
        query
            .set_fts_params(FtsQueryParams::new(Some("AND")).expect("and"))
            .expect("set");
        query.set_filter("").expect("empty filter");
        query.set_include_vector(true).expect("include");
        assert!(query.set_output_fields(&["", "body"]).is_err());
        query.set_output_fields(&["body"]).expect("fields");
    }
}