sz-orm-ai 2.4.0

SZ-ORM AI Extension - Embedding, Vector Store, RAG Engine
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
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
use crate::error::AiError;
use async_trait::async_trait;
use parking_lot::RwLock;
use std::collections::HashMap;

#[derive(Debug, Clone)]
pub struct EmbeddingError {
    pub message: String,
    pub model: Option<String>,
}

impl EmbeddingError {
    pub fn new(message: impl Into<String>) -> Self {
        Self {
            message: message.into(),
            model: None,
        }
    }

    pub fn with_model(message: impl Into<String>, model: impl Into<String>) -> Self {
        Self {
            message: message.into(),
            model: Some(model.into()),
        }
    }
}

impl std::fmt::Display for EmbeddingError {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(f, "EmbeddingError: {}", self.message)?;
        if let Some(ref model) = self.model {
            write!(f, " (model: {})", model)?;
        }
        Ok(())
    }
}

impl std::error::Error for EmbeddingError {}

#[async_trait]
pub trait EmbeddingModel: Send + Sync {
    async fn embed(&self, text: &str) -> Result<Vec<f32>, AiError>;
    async fn embed_batch(&self, texts: &[String]) -> Result<Vec<Vec<f32>>, AiError>;
    fn dimension(&self) -> usize;
    fn model_name(&self) -> &str;
}

pub struct EmbeddingRecord {
    pub id: String,
    pub text: String,
    pub vector: Vec<f32>,
    pub metadata: Option<std::collections::HashMap<String, serde_json::Value>>,
}

impl EmbeddingRecord {
    pub fn new(id: impl Into<String>, text: impl Into<String>, vector: Vec<f32>) -> Self {
        Self {
            id: id.into(),
            text: text.into(),
            vector,
            metadata: None,
        }
    }

    pub fn with_metadata(
        id: impl Into<String>,
        text: impl Into<String>,
        vector: Vec<f32>,
        metadata: std::collections::HashMap<String, serde_json::Value>,
    ) -> Self {
        Self {
            id: id.into(),
            text: text.into(),
            vector,
            metadata: Some(metadata),
        }
    }
}

pub struct EmbeddingBatch {
    pub records: Vec<EmbeddingRecord>,
    pub batch_size: usize,
}

impl EmbeddingBatch {
    pub fn new(records: Vec<EmbeddingRecord>) -> Self {
        Self {
            records,
            batch_size: 32,
        }
    }

    pub fn with_batch_size(mut self, size: usize) -> Self {
        self.batch_size = size;
        self
    }

    pub fn batch_chunks(&self) -> Vec<&[EmbeddingRecord]> {
        self.records.chunks(self.batch_size).collect()
    }
}

/// Simple embedding model based on token frequency statistics.
///
/// This is a deterministic, in-memory embedding implementation:
/// - Maintains a fixed-size vocabulary (`dimension` slots).
/// - Each token is hashed into one of the `dimension` slots using FNV-1a.
/// - The embedding vector is the L2-normalized token-frequency histogram.
///
/// This is NOT a neural embedding (no semantic knowledge), but it is a real,
/// deterministic, reproducible vector representation suitable for testing
/// similarity-search pipelines end-to-end.
pub struct SimpleEmbeddingModel {
    name: String,
    dimension: usize,
    vocabulary: RwLock<HashMap<String, usize>>,
}

impl SimpleEmbeddingModel {
    pub fn new(name: impl Into<String>, dimension: usize) -> Self {
        Self {
            name: name.into(),
            dimension,
            vocabulary: RwLock::new(HashMap::new()),
        }
    }

    pub fn vocabulary_size(&self) -> usize {
        self.vocabulary.read().len()
    }

    /// Registers a token in the vocabulary, returning its slot index.
    /// New tokens are appended; existing tokens keep their slot.
    fn register_token(&self, token: &str) -> usize {
        let mut vocab = self.vocabulary.write();
        if let Some(&idx) = vocab.get(token) {
            return idx;
        }
        // Hash into the dimension space to keep vector length stable
        // regardless of vocabulary size (bucket collisions are acceptable
        // for a simple model and keep memory bounded).
        let idx = fnv1a(token) % self.dimension.max(1);
        vocab.insert(token.to_string(), idx);
        idx
    }

    fn tokenize(text: &str) -> Vec<String> {
        text.split(|c: char| !c.is_alphanumeric())
            .filter(|s| !s.is_empty())
            .map(|s| s.to_lowercase())
            .collect()
    }

    fn embed_text(&self, text: &str) -> Vec<f32> {
        let mut vec = vec![0.0f32; self.dimension];
        if self.dimension == 0 {
            return vec;
        }
        let tokens = Self::tokenize(text);
        if tokens.is_empty() {
            return vec;
        }

        for token in &tokens {
            let idx = self.register_token(token);
            vec[idx] += 1.0;
        }

        // L2 normalize so cosine similarity is well-defined.
        let norm: f32 = vec.iter().map(|v| v * v).sum::<f32>().sqrt();
        if norm > 0.0 {
            for v in vec.iter_mut() {
                *v /= norm;
            }
        }
        vec
    }
}

fn fnv1a(s: &str) -> usize {
    let mut hash: u64 = 0xcbf29ce484222325;
    for byte in s.as_bytes() {
        hash ^= *byte as u64;
        hash = hash.wrapping_mul(0x100000001b3);
    }
    hash as usize
}

// ==================== Embedding 模型适配器 ====================

/// 缓存型 Embedding 模型适配器
///
/// 包装一个内部 EmbeddingModel,对相同输入文本返回缓存的向量,
/// 避免重复计算。适用于嵌入计算成本高的场景(如调用远程 API)。
///
/// # 泛型参数
/// - `M`: 内部嵌入模型
pub struct CachingEmbeddingModel<M>
where
    M: EmbeddingModel,
{
    /// 内部嵌入模型
    inner: M,
    /// 缓存:文本 → 向量
    cache: RwLock<HashMap<String, Vec<f32>>>,
    /// 缓存命中次数(用于统计)
    hits: std::sync::atomic::AtomicU64,
    /// 缓存未命中次数
    misses: std::sync::atomic::AtomicU64,
}

impl<M> CachingEmbeddingModel<M>
where
    M: EmbeddingModel,
{
    /// 创建缓存型适配器
    pub fn new(inner: M) -> Self {
        Self {
            inner,
            cache: RwLock::new(HashMap::new()),
            hits: std::sync::atomic::AtomicU64::new(0),
            misses: std::sync::atomic::AtomicU64::new(0),
        }
    }

    /// 获取缓存大小
    pub fn cache_size(&self) -> usize {
        self.cache.read().len()
    }

    /// 获取缓存命中次数
    pub fn cache_hits(&self) -> u64 {
        self.hits.load(std::sync::atomic::Ordering::Relaxed)
    }

    /// 获取缓存未命中次数
    pub fn cache_misses(&self) -> u64 {
        self.misses.load(std::sync::atomic::Ordering::Relaxed)
    }

    /// 缓存命中率
    pub fn hit_rate(&self) -> f64 {
        let hits = self.cache_hits();
        let misses = self.cache_misses();
        let total = hits + misses;
        if total == 0 {
            return 0.0;
        }
        hits as f64 / total as f64
    }

    /// 清空缓存
    pub fn clear_cache(&self) {
        let mut cache = self.cache.write();
        cache.clear();
    }

    /// 获取内部模型引用
    pub fn inner(&self) -> &M {
        &self.inner
    }
}

#[async_trait]
impl<M> EmbeddingModel for CachingEmbeddingModel<M>
where
    M: EmbeddingModel,
{
    async fn embed(&self, text: &str) -> Result<Vec<f32>, AiError> {
        // 先查缓存
        {
            let cache = self.cache.read();
            if let Some(vector) = cache.get(text) {
                self.hits.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
                return Ok(vector.clone());
            }
        }

        // 缓存未命中,调用内部模型
        self.misses
            .fetch_add(1, std::sync::atomic::Ordering::Relaxed);
        let vector = self.inner.embed(text).await?;

        // 写入缓存
        {
            let mut cache = self.cache.write();
            cache.insert(text.to_string(), vector.clone());
        }

        Ok(vector)
    }

    async fn embed_batch(&self, texts: &[String]) -> Result<Vec<Vec<f32>>, AiError> {
        let mut results = Vec::with_capacity(texts.len());
        let mut uncached_indices = Vec::new();
        let mut uncached_texts = Vec::new();

        // 先查缓存
        {
            let cache = self.cache.read();
            for (idx, text) in texts.iter().enumerate() {
                if let Some(vector) = cache.get(text) {
                    self.hits.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
                    results.push(vector.clone());
                } else {
                    self.misses
                        .fetch_add(1, std::sync::atomic::Ordering::Relaxed);
                    uncached_indices.push(idx);
                    uncached_texts.push(text.clone());
                    results.push(Vec::new()); // 占位
                }
            }
        }

        // 批量计算未缓存的
        if !uncached_texts.is_empty() {
            let vectors = self.inner.embed_batch(&uncached_texts).await?;
            let mut cache = self.cache.write();
            for (i, idx) in uncached_indices.iter().enumerate() {
                let text = &uncached_texts[i];
                let vector = &vectors[i];
                results[*idx] = vector.clone();
                cache.insert(text.clone(), vector.clone());
            }
        }

        Ok(results)
    }

    fn dimension(&self) -> usize {
        self.inner.dimension()
    }

    fn model_name(&self) -> &str {
        self.inner.model_name()
    }
}

/// 归一化 Embedding 模型适配器
///
/// 包装一个内部 EmbeddingModel,对输出向量进行 L2 归一化,
/// 确保所有向量都是单位向量。适用于需要使用余弦相似度的场景。
pub struct NormalizedEmbeddingModel<M>
where
    M: EmbeddingModel,
{
    /// 内部嵌入模型
    inner: M,
}

impl<M> NormalizedEmbeddingModel<M>
where
    M: EmbeddingModel,
{
    /// 创建归一化适配器
    pub fn new(inner: M) -> Self {
        Self { inner }
    }

    /// 对向量进行 L2 归一化
    pub fn l2_normalize(vector: &mut [f32]) {
        let norm: f32 = vector.iter().map(|v| v * v).sum::<f32>().sqrt();
        if norm > 0.0 {
            for v in vector.iter_mut() {
                *v /= norm;
            }
        }
    }

    /// 获取内部模型引用
    pub fn inner(&self) -> &M {
        &self.inner
    }
}

#[async_trait]
impl<M> EmbeddingModel for NormalizedEmbeddingModel<M>
where
    M: EmbeddingModel,
{
    async fn embed(&self, text: &str) -> Result<Vec<f32>, AiError> {
        let mut vector = self.inner.embed(text).await?;
        Self::l2_normalize(&mut vector);
        Ok(vector)
    }

    async fn embed_batch(&self, texts: &[String]) -> Result<Vec<Vec<f32>>, AiError> {
        let mut vectors = self.inner.embed_batch(texts).await?;
        for vector in vectors.iter_mut() {
            Self::l2_normalize(vector);
        }
        Ok(vectors)
    }

    fn dimension(&self) -> usize {
        self.inner.dimension()
    }

    fn model_name(&self) -> &str {
        self.inner.model_name()
    }
}

/// 降维 Embedding 模型适配器
///
/// 包装一个内部 EmbeddingModel,通过截断或平均池化将输出向量降维到指定维度。
/// 适用于需要将高维向量适配到低维索引的场景。
pub struct DimReductionEmbeddingModel<M>
where
    M: EmbeddingModel,
{
    /// 内部嵌入模型
    inner: M,
    /// 目标维度
    target_dimension: usize,
    /// 降维策略
    strategy: DimReductionStrategy,
}

/// 降维策略
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum DimReductionStrategy {
    /// 截断:只保留前 N 维
    Truncate,
    /// 平均池化:将向量分块后取平均
    Average,
}

impl<M> DimReductionEmbeddingModel<M>
where
    M: EmbeddingModel,
{
    /// 创建降维适配器
    pub fn new(inner: M, target_dimension: usize, strategy: DimReductionStrategy) -> Self {
        Self {
            inner,
            target_dimension,
            strategy,
        }
    }

    /// 创建截断降维适配器
    pub fn truncate(inner: M, target_dimension: usize) -> Self {
        Self::new(inner, target_dimension, DimReductionStrategy::Truncate)
    }

    /// 创建平均池化降维适配器
    pub fn average(inner: M, target_dimension: usize) -> Self {
        Self::new(inner, target_dimension, DimReductionStrategy::Average)
    }

    /// 降维单个向量
    pub fn reduce(&self, vector: Vec<f32>) -> Vec<f32> {
        match self.strategy {
            DimReductionStrategy::Truncate => {
                vector.into_iter().take(self.target_dimension).collect()
            }
            DimReductionStrategy::Average => {
                if vector.is_empty() || self.target_dimension == 0 {
                    return Vec::new();
                }
                let chunk_size = vector.len() / self.target_dimension;
                if chunk_size == 0 {
                    return vector.into_iter().take(self.target_dimension).collect();
                }
                let mut result = Vec::with_capacity(self.target_dimension);
                for i in 0..self.target_dimension {
                    let start = i * chunk_size;
                    let end = if i == self.target_dimension - 1 {
                        vector.len()
                    } else {
                        start + chunk_size
                    };
                    let chunk = &vector[start..end];
                    let avg: f32 = chunk.iter().sum::<f32>() / chunk.len() as f32;
                    result.push(avg);
                }
                result
            }
        }
    }

    /// 获取内部模型引用
    pub fn inner(&self) -> &M {
        &self.inner
    }

    /// 获取目标维度
    pub fn target_dimension(&self) -> usize {
        self.target_dimension
    }

    /// 获取降维策略
    pub fn strategy(&self) -> DimReductionStrategy {
        self.strategy
    }
}

#[async_trait]
impl<M> EmbeddingModel for DimReductionEmbeddingModel<M>
where
    M: EmbeddingModel,
{
    async fn embed(&self, text: &str) -> Result<Vec<f32>, AiError> {
        let vector = self.inner.embed(text).await?;
        Ok(self.reduce(vector))
    }

    async fn embed_batch(&self, texts: &[String]) -> Result<Vec<Vec<f32>>, AiError> {
        let vectors = self.inner.embed_batch(texts).await?;
        Ok(vectors.into_iter().map(|v| self.reduce(v)).collect())
    }

    fn dimension(&self) -> usize {
        self.target_dimension
    }

    fn model_name(&self) -> &str {
        self.inner.model_name()
    }
}

/// 日志型 Embedding 模型适配器
///
/// 包装一个内部 EmbeddingModel,在调用时记录调用的文本和耗时。
/// 适用于调试和性能分析场景。
pub struct LoggingEmbeddingModel<M>
where
    M: EmbeddingModel,
{
    /// 内部嵌入模型
    inner: M,
    /// 调用次数
    call_count: std::sync::atomic::AtomicU64,
    /// 总文本数
    total_texts: std::sync::atomic::AtomicU64,
}

impl<M> LoggingEmbeddingModel<M>
where
    M: EmbeddingModel,
{
    /// 创建日志型适配器
    pub fn new(inner: M) -> Self {
        Self {
            inner,
            call_count: std::sync::atomic::AtomicU64::new(0),
            total_texts: std::sync::atomic::AtomicU64::new(0),
        }
    }

    /// 获取调用次数
    pub fn call_count(&self) -> u64 {
        self.call_count.load(std::sync::atomic::Ordering::Relaxed)
    }

    /// 获取处理的文本总数
    pub fn total_texts(&self) -> u64 {
        self.total_texts.load(std::sync::atomic::Ordering::Relaxed)
    }

    /// 获取内部模型引用
    pub fn inner(&self) -> &M {
        &self.inner
    }
}

#[async_trait]
impl<M> EmbeddingModel for LoggingEmbeddingModel<M>
where
    M: EmbeddingModel,
{
    async fn embed(&self, text: &str) -> Result<Vec<f32>, AiError> {
        self.call_count
            .fetch_add(1, std::sync::atomic::Ordering::Relaxed);
        self.total_texts
            .fetch_add(1, std::sync::atomic::Ordering::Relaxed);
        self.inner.embed(text).await
    }

    async fn embed_batch(&self, texts: &[String]) -> Result<Vec<Vec<f32>>, AiError> {
        self.call_count
            .fetch_add(1, std::sync::atomic::Ordering::Relaxed);
        self.total_texts
            .fetch_add(texts.len() as u64, std::sync::atomic::Ordering::Relaxed);
        self.inner.embed_batch(texts).await
    }

    fn dimension(&self) -> usize {
        self.inner.dimension()
    }

    fn model_name(&self) -> &str {
        self.inner.model_name()
    }
}

#[async_trait]
impl EmbeddingModel for SimpleEmbeddingModel {
    async fn embed(&self, text: &str) -> Result<Vec<f32>, AiError> {
        Ok(self.embed_text(text))
    }

    async fn embed_batch(&self, texts: &[String]) -> Result<Vec<Vec<f32>>, AiError> {
        Ok(texts.iter().map(|t| self.embed_text(t)).collect())
    }

    fn dimension(&self) -> usize {
        self.dimension
    }

    fn model_name(&self) -> &str {
        &self.name
    }
}

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

    #[tokio::test]
    async fn test_embed_simple_text() {
        let model = SimpleEmbeddingModel::new("test-model", 16);
        let v = model.embed("hello world").await.unwrap();
        assert_eq!(v.len(), 16);
        // L2 norm should be ~1 (or 0 for empty input)
        let norm: f32 = v.iter().map(|x| x * x).sum::<f32>().sqrt();
        assert!((norm - 1.0).abs() < 1e-5 || norm.abs() < 1e-5);
    }

    #[tokio::test]
    async fn test_embed_empty_text() {
        let model = SimpleEmbeddingModel::new("test-model", 8);
        let v = model.embed("").await.unwrap();
        assert!(v.iter().all(|x| *x == 0.0));
    }

    #[tokio::test]
    async fn test_embed_deterministic() {
        let model = SimpleEmbeddingModel::new("test-model", 32);
        let v1 = model.embed("rust programming language").await.unwrap();
        let v2 = model.embed("rust programming language").await.unwrap();
        assert_eq!(v1, v2);
    }

    #[tokio::test]
    async fn test_embed_similar_texts_closer_than_different() {
        let model = SimpleEmbeddingModel::new("test-model", 64);
        let v1 = model.embed("the quick brown fox jumps").await.unwrap();
        let v2 = model.embed("the quick brown fox").await.unwrap();
        let v3 = model
            .embed("completely different words here")
            .await
            .unwrap();

        let sim_close = cosine(&v1, &v2);
        let sim_far = cosine(&v1, &v3);
        assert!(
            sim_close >= sim_far,
            "similar texts should be at least as close"
        );
    }

    #[tokio::test]
    async fn test_embed_batch() {
        let model = SimpleEmbeddingModel::new("test-model", 16);
        let texts = vec!["hello".to_string(), "world".to_string()];
        let vecs = model.embed_batch(&texts).await.unwrap();
        assert_eq!(vecs.len(), 2);
        assert_eq!(vecs[0].len(), 16);
        assert_eq!(vecs[1].len(), 16);
    }

    #[test]
    fn test_dimension_and_name() {
        let model = SimpleEmbeddingModel::new("my-model", 128);
        assert_eq!(model.dimension(), 128);
        assert_eq!(model.model_name(), "my-model");
    }

    fn cosine(a: &[f32], b: &[f32]) -> f32 {
        let dot: f32 = a.iter().zip(b.iter()).map(|(x, y)| x * y).sum();
        let na: f32 = a.iter().map(|x| x * x).sum::<f32>().sqrt();
        let nb: f32 = b.iter().map(|x| x * x).sum::<f32>().sqrt();
        if na == 0.0 || nb == 0.0 {
            return 0.0;
        }
        dot / (na * nb)
    }

    // ============ Embedding 适配器测试 ============

    // ---- CachingEmbeddingModel 测试 ----

    #[tokio::test]
    async fn test_caching_model_caches_repeated_calls() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let caching = CachingEmbeddingModel::new(inner);

        let v1 = caching.embed("hello world").await.unwrap();
        let v2 = caching.embed("hello world").await.unwrap();

        // 第二次应命中缓存
        assert_eq!(v1, v2);
        assert_eq!(caching.cache_hits(), 1);
        assert_eq!(caching.cache_misses(), 1);
        assert_eq!(caching.cache_size(), 1);
    }

    #[tokio::test]
    async fn test_caching_model_different_texts() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let caching = CachingEmbeddingModel::new(inner);

        let v1 = caching.embed("hello").await.unwrap();
        let v2 = caching.embed("world").await.unwrap();

        // 不同输入应产生不同向量
        assert_eq!(v1.len(), 16);
        assert_eq!(v2.len(), 16);
        assert_ne!(v1, v2, "different inputs must yield different embeddings");
        assert_eq!(caching.cache_misses(), 2);
        assert_eq!(caching.cache_hits(), 0);
        assert_eq!(caching.cache_size(), 2);
    }

    #[tokio::test]
    async fn test_caching_model_hit_rate() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let caching = CachingEmbeddingModel::new(inner);

        let v1_miss = caching.embed("a").await.unwrap();
        let v1_hit = caching.embed("a").await.unwrap(); // hit
        let v2_miss = caching.embed("b").await.unwrap();
        let v1_hit2 = caching.embed("a").await.unwrap(); // hit

        // 缓存命中必须返回与首次 miss 相同的向量
        assert_eq!(v1_miss, v1_hit, "cache hit must return identical vector");
        assert_eq!(v1_miss, v1_hit2, "cache hit must return identical vector");
        assert_ne!(
            v1_miss, v2_miss,
            "different inputs must yield different vectors"
        );

        // 4 calls: 2 misses, 2 hits
        assert!((caching.hit_rate() - 0.5).abs() < 1e-6);
    }

    #[tokio::test]
    async fn test_caching_model_hit_rate_zero_when_empty() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let caching = CachingEmbeddingModel::new(inner);
        assert_eq!(caching.hit_rate(), 0.0);
    }

    #[tokio::test]
    async fn test_caching_model_clear_cache() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let caching = CachingEmbeddingModel::new(inner);

        let v1 = caching.embed("hello").await.unwrap();
        assert_eq!(caching.cache_size(), 1);

        caching.clear_cache();
        assert_eq!(caching.cache_size(), 0);

        // 再次调用应 miss,且必须返回与首次相同的向量(确定性)
        let v2 = caching.embed("hello").await.unwrap();
        assert_eq!(
            v1, v2,
            "embeddings must be deterministic across cache clears"
        );
        assert_eq!(caching.cache_misses(), 2);
    }

    #[tokio::test]
    async fn test_caching_model_batch_mixed() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let caching = CachingEmbeddingModel::new(inner);

        // 先缓存一个
        let seed = caching.embed("hello").await.unwrap();

        // 批量调用:hello 已缓存,world 未缓存
        let texts = vec!["hello".to_string(), "world".to_string()];
        let results = caching.embed_batch(&texts).await.unwrap();

        assert_eq!(results.len(), 2);
        // hello 必须返回与 seed 相同的向量(缓存命中)
        assert_eq!(results[0], seed, "cached entry must match seed vector");
        // world 是新向量,维度必须一致
        assert_eq!(results[1].len(), 16);
        assert_ne!(results[0], results[1], "different inputs must differ");
        assert_eq!(caching.cache_hits(), 1); // hello
        assert_eq!(caching.cache_misses(), 2); // 初始 hello + world
    }

    #[tokio::test]
    async fn test_caching_model_batch_all_cached() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let caching = CachingEmbeddingModel::new(inner);

        // 先缓存全部
        let seed_hello = caching.embed("hello").await.unwrap();
        let seed_world = caching.embed("world").await.unwrap();

        // 批量调用:全部命中
        let texts = vec!["hello".to_string(), "world".to_string()];
        let results = caching.embed_batch(&texts).await.unwrap();

        assert_eq!(results.len(), 2);
        // 批量结果必须与 seed 向量逐一匹配
        assert_eq!(results[0], seed_hello, "cached hello must match seed");
        assert_eq!(results[1], seed_world, "cached world must match seed");
        assert_eq!(caching.cache_hits(), 2);
    }

    #[tokio::test]
    async fn test_caching_model_preserves_dimension_and_name() {
        let inner = SimpleEmbeddingModel::new("my-model", 32);
        let caching = CachingEmbeddingModel::new(inner);

        assert_eq!(caching.dimension(), 32);
        assert_eq!(caching.model_name(), "my-model");
    }

    #[tokio::test]
    async fn test_caching_model_inner_access() {
        let inner = SimpleEmbeddingModel::new("inner", 8);
        let caching = CachingEmbeddingModel::new(inner);
        assert_eq!(caching.inner().model_name(), "inner");
    }

    // ---- NormalizedEmbeddingModel 测试 ----

    #[tokio::test]
    async fn test_normalized_model_produces_unit_vector() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let normalized = NormalizedEmbeddingModel::new(inner);

        let v = normalized.embed("hello world").await.unwrap();
        let norm: f32 = v.iter().map(|x| x * x).sum::<f32>().sqrt();
        // L2 范数应接近 1(或 0 对于空输入)
        assert!(norm.abs() < 1e-5 || (norm - 1.0).abs() < 1e-5);
    }

    #[tokio::test]
    async fn test_normalized_model_batch_produces_unit_vectors() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let normalized = NormalizedEmbeddingModel::new(inner);

        let texts = vec!["hello".to_string(), "world".to_string()];
        let vectors = normalized.embed_batch(&texts).await.unwrap();

        for v in &vectors {
            let norm: f32 = v.iter().map(|x| x * x).sum::<f32>().sqrt();
            assert!(norm.abs() < 1e-5 || (norm - 1.0).abs() < 1e-5);
        }
    }

    #[tokio::test]
    async fn test_normalized_model_l2_normalize_static() {
        let mut vector = vec![3.0, 4.0]; // norm = 5
        NormalizedEmbeddingModel::<SimpleEmbeddingModel>::l2_normalize(&mut vector);
        assert!((vector[0] - 0.6).abs() < 1e-5);
        assert!((vector[1] - 0.8).abs() < 1e-5);
    }

    #[tokio::test]
    async fn test_normalized_model_l2_normalize_zero_vector() {
        let mut vector = vec![0.0, 0.0, 0.0];
        NormalizedEmbeddingModel::<SimpleEmbeddingModel>::l2_normalize(&mut vector);
        // 零向量归一化后仍为零
        assert!(vector.iter().all(|x| *x == 0.0));
    }

    #[tokio::test]
    async fn test_normalized_model_preserves_dimension_and_name() {
        let inner = SimpleEmbeddingModel::new("norm-model", 64);
        let normalized = NormalizedEmbeddingModel::new(inner);
        assert_eq!(normalized.dimension(), 64);
        assert_eq!(normalized.model_name(), "norm-model");
    }

    #[tokio::test]
    async fn test_normalized_model_inner_access() {
        let inner = SimpleEmbeddingModel::new("inner", 8);
        let normalized = NormalizedEmbeddingModel::new(inner);
        assert_eq!(normalized.inner().model_name(), "inner");
    }

    // ---- DimReductionEmbeddingModel 测试 ----

    #[test]
    fn test_dim_reduction_strategy_variants() {
        assert_eq!(
            DimReductionStrategy::Truncate,
            DimReductionStrategy::Truncate
        );
        assert_eq!(DimReductionStrategy::Average, DimReductionStrategy::Average);
        assert_ne!(
            DimReductionStrategy::Truncate,
            DimReductionStrategy::Average
        );
    }

    #[tokio::test]
    async fn test_dim_reduction_truncate() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let reduced = DimReductionEmbeddingModel::truncate(inner, 8);

        let v = reduced.embed("hello world").await.unwrap();
        assert_eq!(v.len(), 8);
    }

    #[tokio::test]
    async fn test_dim_reduction_truncate_batch() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let reduced = DimReductionEmbeddingModel::truncate(inner, 4);

        let texts = vec!["hello".to_string(), "world".to_string()];
        let vectors = reduced.embed_batch(&texts).await.unwrap();
        for v in &vectors {
            assert_eq!(v.len(), 4);
        }
    }

    #[tokio::test]
    async fn test_dim_reduction_average() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let reduced = DimReductionEmbeddingModel::average(inner, 4);

        let v = reduced.embed("hello world").await.unwrap();
        assert_eq!(v.len(), 4);
    }

    #[test]
    fn test_dim_reduction_reduce_truncate() {
        let inner = SimpleEmbeddingModel::new("test", 8);
        let reduced = DimReductionEmbeddingModel::truncate(inner, 3);
        let result = reduced.reduce(vec![1.0, 2.0, 3.0, 4.0, 5.0, 6.0]);
        assert_eq!(result, vec![1.0, 2.0, 3.0]);
    }

    #[test]
    fn test_dim_reduction_reduce_average() {
        let inner = SimpleEmbeddingModel::new("test", 8);
        let reduced = DimReductionEmbeddingModel::average(inner, 2);
        // 4 维降到 2 维:chunk_size = 4/2 = 2
        // [1,2] -> avg=1.5, [3,4] -> avg=3.5
        let result = reduced.reduce(vec![1.0, 2.0, 3.0, 4.0]);
        assert!((result[0] - 1.5).abs() < 1e-5);
        assert!((result[1] - 3.5).abs() < 1e-5);
    }

    #[test]
    fn test_dim_reduction_reduce_empty() {
        let inner = SimpleEmbeddingModel::new("test", 8);
        let reduced = DimReductionEmbeddingModel::average(inner, 2);
        let result = reduced.reduce(vec![]);
        assert!(result.is_empty());
    }

    #[test]
    fn test_dim_reduction_reduce_target_zero() {
        let inner = SimpleEmbeddingModel::new("test", 8);
        let reduced = DimReductionEmbeddingModel::average(inner, 0);
        let result = reduced.reduce(vec![1.0, 2.0, 3.0]);
        assert!(result.is_empty());
    }

    #[test]
    fn test_dim_reduction_reduce_truncate_smaller_than_target() {
        let inner = SimpleEmbeddingModel::new("test", 8);
        let reduced = DimReductionEmbeddingModel::truncate(inner, 10);
        // 原始 3 维,目标 10 维:截断后只有 3 维
        let result = reduced.reduce(vec![1.0, 2.0, 3.0]);
        assert_eq!(result.len(), 3);
    }

    #[tokio::test]
    async fn test_dim_reduction_dimension_returns_target() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let reduced = DimReductionEmbeddingModel::truncate(inner, 8);
        assert_eq!(reduced.dimension(), 8);
    }

    #[tokio::test]
    async fn test_dim_reduction_preserves_model_name() {
        let inner = SimpleEmbeddingModel::new("original", 16);
        let reduced = DimReductionEmbeddingModel::truncate(inner, 8);
        assert_eq!(reduced.model_name(), "original");
    }

    #[test]
    fn test_dim_reduction_target_dimension_and_strategy_accessors() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let reduced = DimReductionEmbeddingModel::new(inner, 8, DimReductionStrategy::Average);
        assert_eq!(reduced.target_dimension(), 8);
        assert_eq!(reduced.strategy(), DimReductionStrategy::Average);
    }

    // ---- LoggingEmbeddingModel 测试 ----

    #[tokio::test]
    async fn test_logging_model_counts_calls() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let logging = LoggingEmbeddingModel::new(inner);

        let v1 = logging.embed("hello").await.unwrap();
        let v2 = logging.embed("world").await.unwrap();

        // 返回向量必须与底层 SimpleEmbeddingModel 直接计算的结果一致
        let baseline = SimpleEmbeddingModel::new("test", 16);
        assert_eq!(v1, baseline.embed_text("hello"));
        assert_eq!(v2, baseline.embed_text("world"));
        assert_ne!(v1, v2);
        assert_eq!(logging.call_count(), 2);
        assert_eq!(logging.total_texts(), 2);
    }

    #[tokio::test]
    async fn test_logging_model_batch_counts() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let logging = LoggingEmbeddingModel::new(inner);

        let texts = vec!["hello".to_string(), "world".to_string(), "foo".to_string()];
        let results = logging.embed_batch(&texts).await.unwrap();

        // 验证批量返回值与底层模型直接计算结果一致
        let baseline = SimpleEmbeddingModel::new("test", 16);
        assert_eq!(results.len(), 3);
        assert_eq!(results[0], baseline.embed_text("hello"));
        assert_eq!(results[1], baseline.embed_text("world"));
        assert_eq!(results[2], baseline.embed_text("foo"));
        assert_eq!(logging.call_count(), 1);
        assert_eq!(logging.total_texts(), 3);
    }

    #[tokio::test]
    async fn test_logging_model_preserves_dimension_and_name() {
        let inner = SimpleEmbeddingModel::new("logged", 32);
        let logging = LoggingEmbeddingModel::new(inner);
        assert_eq!(logging.dimension(), 32);
        assert_eq!(logging.model_name(), "logged");
    }

    #[tokio::test]
    async fn test_logging_model_inner_access() {
        let inner = SimpleEmbeddingModel::new("inner", 8);
        let logging = LoggingEmbeddingModel::new(inner);
        assert_eq!(logging.inner().model_name(), "inner");
    }

    #[tokio::test]
    async fn test_logging_model_initial_counts_zero() {
        let inner = SimpleEmbeddingModel::new("test", 16);
        let logging = LoggingEmbeddingModel::new(inner);
        assert_eq!(logging.call_count(), 0);
        assert_eq!(logging.total_texts(), 0);
    }

    // ---- 适配器组合测试 ----

    #[tokio::test]
    async fn test_compose_caching_and_normalized() {
        let inner = SimpleEmbeddingModel::new("composed", 16);
        let caching = CachingEmbeddingModel::new(inner);
        let normalized = NormalizedEmbeddingModel::new(caching);

        let v1 = normalized.embed("hello world").await.unwrap();
        let v2 = normalized.embed("hello world").await.unwrap();

        // 缓存应生效(第二次命中)
        assert_eq!(v1, v2);
        let norm: f32 = v1.iter().map(|x| x * x).sum::<f32>().sqrt();
        assert!(norm.abs() < 1e-5 || (norm - 1.0).abs() < 1e-5);
    }

    #[tokio::test]
    async fn test_compose_logging_and_caching() {
        let inner = SimpleEmbeddingModel::new("composed", 16);
        let logging = LoggingEmbeddingModel::new(inner);
        let caching = CachingEmbeddingModel::new(logging);

        let v1 = caching.embed("hello").await.unwrap();
        let v2 = caching.embed("hello").await.unwrap(); // cache hit

        // 两次调用返回必须一致(缓存命中)
        assert_eq!(v1, v2, "cache hit must return identical vector");
        // 验证向量与底层 SimpleEmbeddingModel 直接计算结果一致
        let baseline = SimpleEmbeddingModel::new("composed", 16);
        assert_eq!(v1, baseline.embed_text("hello"));
        // 缓存命中时不会调用内部模型,所以日志层只记录 1 次
        assert_eq!(caching.inner().call_count(), 1);
        assert_eq!(caching.cache_hits(), 1);
    }
}