cera 0.5.4

Rust-native LLM inference 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
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
//! Token classification and constrained BIOES Viterbi decoding.
//!
//! Provides zero-dependency named entity recognition (NER) and PII detection
//! over bidirectional token classification models (such as LiquidAI/pii-detect).

use crate::kv_cache::InferenceState;
use crate::model::Model;
use crate::session::CeraError;
use crate::tokenizer::{BpeTokenizer, TokenOffset};

/// An identified entity span in source text.
#[derive(Debug, Clone, PartialEq)]
pub struct EntitySpan {
    /// Entity label type (e.g. "NAME", "EMAIL", "PHONE_NUMBER", "STREET_ADDRESS").
    pub entity_type: String,
    /// UTF-8 character start index in source text (inclusive).
    pub start_char: usize,
    /// UTF-8 character end index in source text (exclusive).
    pub end_char: usize,
    /// Token start index in sequence (inclusive).
    pub start_token: usize,
    /// Token end index in sequence (exclusive).
    pub end_token: usize,
    /// Extracted text slice.
    pub text: String,
    /// Mean classification confidence score across the span tokens [0.0..1.0].
    pub score: f32,
}

/// BIOES tag prefix.
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum BioesPrefix {
    /// Outside any entity.
    O,
    /// Beginning of a multi-token entity.
    B,
    /// Inside a multi-token entity.
    I,
    /// End of a multi-token entity.
    E,
    /// Single-token entity.
    S,
}

/// Parse a raw label string (e.g. "B-NAME", "S-EMAIL", "O") into prefix and entity type.
pub fn parse_bioes(label: &str) -> (BioesPrefix, &str) {
    if label == "O" || label.is_empty() {
        return (BioesPrefix::O, "");
    }
    if let Some(rest) = label.strip_prefix("B-") {
        return (BioesPrefix::B, rest);
    }
    if let Some(rest) = label.strip_prefix("I-") {
        return (BioesPrefix::I, rest);
    }
    if let Some(rest) = label.strip_prefix("E-") {
        return (BioesPrefix::E, rest);
    }
    if let Some(rest) = label.strip_prefix("S-") {
        return (BioesPrefix::S, rest);
    }
    (BioesPrefix::O, label)
}

/// Check if transitioning from `(prev_prefix, prev_type)` to `(curr_prefix, curr_type)`
/// is grammatically valid under the BIOES scheme.
pub fn is_valid_transition(
    prev_prefix: BioesPrefix,
    prev_type: &str,
    curr_prefix: BioesPrefix,
    curr_type: &str,
) -> bool {
    match prev_prefix {
        BioesPrefix::O | BioesPrefix::E | BioesPrefix::S => {
            // From non-entity or completed entity, can only start new entity or stay O
            matches!(
                curr_prefix,
                BioesPrefix::O | BioesPrefix::B | BioesPrefix::S
            )
        }
        BioesPrefix::B | BioesPrefix::I => {
            // Must continue or end the same entity type
            (curr_prefix == BioesPrefix::I || curr_prefix == BioesPrefix::E)
                && prev_type == curr_type
        }
    }
}

/// Decode the most likely tag sequence under BIOES grammatical constraints
/// using the Viterbi dynamic programming algorithm.
pub fn viterbi_decode(logits: &[f32], num_classes: usize, class_labels: &[String]) -> Vec<usize> {
    if num_classes == 0 || logits.is_empty() || class_labels.len() < num_classes {
        return Vec::new();
    }
    let n_tokens = logits.len() / num_classes;
    if n_tokens == 0 {
        return Vec::new();
    }

    let parsed_labels: Vec<(BioesPrefix, &str)> = class_labels
        .iter()
        .map(|s| parse_bioes(s.as_str()))
        .collect();

    // Pre-compute allowed transition predecessors for each class c.
    // Because BIOES grammar is sparse (most transitions are forbidden),
    // traversing only valid predecessors reduces per-token transition checks from O(C^2) to O(C).
    let mut allowed_predecessors = vec![Vec::new(); num_classes];
    for c in 0..num_classes {
        let (curr_prefix, curr_type) = parsed_labels[c];
        for (p, &(prev_prefix, prev_type)) in parsed_labels.iter().enumerate().take(num_classes) {
            if is_valid_transition(prev_prefix, prev_type, curr_prefix, curr_type) {
                allowed_predecessors[c].push(p);
            }
        }
    }

    // dp[c] = max score of path ending at class c.
    // Dynamic programming transitions are invariant to per-token uniform log-softmax offsets,
    // so scoring directly with raw logits saves heap allocations and exp/ln calculations.
    let mut dp = vec![f32::NEG_INFINITY; num_classes];
    let mut backpointer = vec![0usize; n_tokens * num_classes];

    // Token 0: can only start with O, B-*, or S-*
    for c in 0..num_classes {
        let (prefix, _) = parsed_labels[c];
        if matches!(prefix, BioesPrefix::O | BioesPrefix::B | BioesPrefix::S) {
            dp[c] = logits[c];
        }
    }

    let mut next_dp = vec![f32::NEG_INFINITY; num_classes];

    for t in 1..n_tokens {
        next_dp.fill(f32::NEG_INFINITY);
        let curr_logits = &logits[t * num_classes..(t + 1) * num_classes];

        for c in 0..num_classes {
            let mut best_score = f32::NEG_INFINITY;
            let mut best_prev = 0usize;

            for &p in &allowed_predecessors[c] {
                if dp[p] <= f32::NEG_INFINITY {
                    continue;
                }
                let score = dp[p] + curr_logits[c];
                if score > best_score {
                    best_score = score;
                    best_prev = p;
                }
            }

            next_dp[c] = best_score;
            backpointer[t * num_classes + c] = best_prev;
        }

        std::mem::swap(&mut dp, &mut next_dp);
    }

    // Final token: must end in O, E-*, or S-*
    let mut best_final_class = 0usize;
    let mut best_final_score = f32::NEG_INFINITY;
    for c in 0..num_classes {
        let (prefix, _) = parsed_labels[c];
        if matches!(prefix, BioesPrefix::O | BioesPrefix::E | BioesPrefix::S)
            && dp[c] > best_final_score
        {
            best_final_score = dp[c];
            best_final_class = c;
        }
    }

    // If all valid final states had -inf (extreme fallback), pick argmax
    if best_final_score <= f32::NEG_INFINITY {
        for (c, &score) in dp.iter().enumerate().take(num_classes) {
            if score > best_final_score {
                best_final_score = score;
                best_final_class = c;
            }
        }
    }

    // Backtrack path
    let mut path = vec![0usize; n_tokens];
    let mut curr = best_final_class;
    for t in (0..n_tokens).rev() {
        path[t] = curr;
        if t > 0 {
            curr = backpointer[t * num_classes + curr];
        }
    }

    path
}

fn char_slice(text: &str, start_char: usize, end_char: usize) -> String {
    if start_char < end_char {
        text.chars()
            .skip(start_char)
            .take(end_char - start_char)
            .collect()
    } else {
        String::new()
    }
}

fn safe_span_slice<'a>(
    text: &'a str,
    byte_start: usize,
    byte_end: usize,
    char_start: usize,
    char_end: usize,
) -> std::borrow::Cow<'a, str> {
    if let Some(slice) = (byte_start <= byte_end)
        .then(|| text.get(byte_start..byte_end))
        .flatten()
    {
        return std::borrow::Cow::Borrowed(slice);
    }
    std::borrow::Cow::Owned(char_slice(text, char_start, char_end))
}

/// Extract entity spans from decoded tag indices and token character offsets.
pub fn extract_spans(
    tags: &[usize],
    class_labels: &[String],
    offsets: &[TokenOffset],
    text: &str,
    logits: &[f32],
    num_classes: usize,
) -> Vec<EntitySpan> {
    let mut spans = Vec::new();
    let n = tags.len();
    if n == 0
        || offsets.len() < n
        || num_classes == 0
        || logits.len() < n * num_classes
        || class_labels.len() < num_classes
    {
        return spans;
    }

    let parsed_labels: Vec<(BioesPrefix, &str)> = class_labels
        .iter()
        .map(|s| parse_bioes(s.as_str()))
        .collect();

    if tags.iter().any(|&t| t >= parsed_labels.len()) {
        return spans;
    }

    // Softmax probabilities for scoring
    let mut probs = vec![0.0f32; logits.len()];
    for t in 0..n {
        let row = &logits[t * num_classes..(t + 1) * num_classes];
        let out_row = &mut probs[t * num_classes..(t + 1) * num_classes];
        let max_val = row.iter().copied().fold(f32::NEG_INFINITY, f32::max);
        let mut sum_exp = 0.0f32;
        for c in 0..num_classes {
            let e = (row[c] - max_val).exp();
            out_row[c] = e;
            sum_exp += e;
        }
        for val in out_row.iter_mut().take(num_classes) {
            *val /= sum_exp;
        }
    }

    let mut i = 0;
    while i < n {
        let (prefix, ent_type) = parsed_labels[tags[i]];
        match prefix {
            BioesPrefix::S => {
                let start_char = offsets[i].char_start;
                let end_char = offsets[i].char_end;
                let span_text = safe_span_slice(
                    text,
                    offsets[i].byte_start,
                    offsets[i].byte_end,
                    start_char,
                    end_char,
                );
                let score = probs[i * num_classes + tags[i]];
                let leading_ws = span_text.chars().take_while(|c| c.is_whitespace()).count();
                let trailing_ws = span_text
                    .chars()
                    .rev()
                    .take_while(|c| c.is_whitespace())
                    .count();
                let trimmed_start = start_char + leading_ws;
                let trimmed_end = if end_char >= trailing_ws {
                    end_char - trailing_ws
                } else {
                    end_char
                };
                let trimmed_text = span_text.trim().to_string();
                if trimmed_start < trimmed_end && !trimmed_text.is_empty() {
                    spans.push(EntitySpan {
                        entity_type: ent_type.to_string(),
                        start_char: trimmed_start,
                        end_char: trimmed_end,
                        start_token: i,
                        end_token: i + 1,
                        text: trimmed_text,
                        score,
                    });
                }
                i += 1;
            }
            BioesPrefix::B => {
                let start_token = i;
                let start_char = offsets[i].char_start;
                let mut end_token = i + 1;
                let mut sum_score = probs[i * num_classes + tags[i]];

                let mut j = i + 1;
                while j < n {
                    let (sub_prefix, sub_type) = parsed_labels[tags[j]];
                    if sub_type != ent_type {
                        break;
                    }
                    if sub_prefix == BioesPrefix::B || sub_prefix == BioesPrefix::S {
                        break;
                    }
                    sum_score += probs[j * num_classes + tags[j]];
                    end_token = j + 1;
                    if sub_prefix == BioesPrefix::E {
                        break;
                    }
                    if sub_prefix != BioesPrefix::I {
                        break;
                    }
                    j += 1;
                }

                let end_char = offsets[end_token - 1].char_end;
                let span_len = end_token - start_token;
                let avg_score = sum_score / (span_len as f32);
                let span_text = safe_span_slice(
                    text,
                    offsets[start_token].byte_start,
                    offsets[end_token - 1].byte_end,
                    start_char,
                    end_char,
                );

                let leading_ws = span_text.chars().take_while(|c| c.is_whitespace()).count();
                let trailing_ws = span_text
                    .chars()
                    .rev()
                    .take_while(|c| c.is_whitespace())
                    .count();
                let trimmed_start = start_char + leading_ws;
                let trimmed_end = if end_char >= trailing_ws {
                    end_char - trailing_ws
                } else {
                    end_char
                };
                let trimmed_text = span_text.trim().to_string();
                if trimmed_start < trimmed_end && !trimmed_text.is_empty() {
                    spans.push(EntitySpan {
                        entity_type: ent_type.to_string(),
                        start_char: trimmed_start,
                        end_char: trimmed_end,
                        start_token,
                        end_token,
                        text: trimmed_text,
                        score: avg_score,
                    });
                }

                i = end_token;
            }
            _ => {
                i += 1;
            }
        }
    }

    spans
}

/// Detect PII entity spans in text using the provided token classification model and tokenizer.
pub fn detect_pii(
    model: &dyn Model,
    tokenizer: &BpeTokenizer,
    text: &str,
    state: &mut InferenceState,
) -> Result<Vec<EntitySpan>, CeraError> {
    if text.is_empty() {
        return Ok(Vec::new());
    }

    let (tokens, offsets) = if tokenizer.add_bos_token() || tokenizer.add_eos_token() {
        tokenizer.encode_special_with_offsets(text, true)
    } else if let Some(bos) = tokenizer.bos_token() {
        let (raw_tokens, raw_offsets) = tokenizer.encode_with_offsets(text);
        let mut t = Vec::with_capacity(raw_tokens.len() + 1);
        let mut o = Vec::with_capacity(raw_offsets.len() + 1);
        t.push(bos);
        o.push(TokenOffset {
            char_start: 0,
            char_end: 0,
            byte_start: 0,
            byte_end: 0,
        });
        t.extend(raw_tokens);
        o.extend(raw_offsets);
        (t, o)
    } else {
        tokenizer.encode_with_offsets(text)
    };
    if tokens.is_empty() {
        return Ok(Vec::new());
    }

    let max_seq = model.config().max_seq_len;
    if tokens.len() > max_seq {
        return Err(CeraError::Backend(format!(
            "sequence length {} exceeds maximum model sequence limit {}",
            tokens.len(),
            max_seq
        )));
    }

    let logits = model.classify_tokens(&tokens, state)?;
    let (class_labels, num_classes) = if let Some(ref lora) = state.lora {
        if !lora.class_labels.is_empty() {
            (lora.class_labels.as_slice(), lora.class_labels.len())
        } else if !model.class_labels().is_empty() {
            (model.class_labels(), model.num_classes())
        } else {
            (model.class_labels(), lora.num_classes())
        }
    } else {
        (model.class_labels(), model.num_classes())
    };

    if num_classes == 0 || class_labels.is_empty() {
        return Err(CeraError::Backend(
            "neither model nor attached adapter has token classification labels".into(),
        ));
    }

    if class_labels.len() != num_classes {
        return Err(CeraError::Backend(format!(
            "mismatch between class labels count ({}) and num_classes ({})",
            class_labels.len(),
            num_classes
        )));
    }

    let expected_logits_len = tokens.len() * num_classes;
    if logits.len() != expected_logits_len {
        return Err(CeraError::Backend(format!(
            "logits length mismatch: expected {} ({} tokens * {} classes), got {}",
            expected_logits_len,
            tokens.len(),
            num_classes,
            logits.len()
        )));
    }

    let tags = viterbi_decode(&logits, num_classes, class_labels);
    let spans = extract_spans(&tags, class_labels, &offsets, text, &logits, num_classes);
    Ok(spans)
}

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

    #[test]
    fn test_bioes_parsing() {
        assert_eq!(parse_bioes("O"), (BioesPrefix::O, ""));
        assert_eq!(parse_bioes("B-NAME"), (BioesPrefix::B, "NAME"));
        assert_eq!(parse_bioes("I-NAME"), (BioesPrefix::I, "NAME"));
        assert_eq!(parse_bioes("E-NAME"), (BioesPrefix::E, "NAME"));
        assert_eq!(parse_bioes("S-EMAIL"), (BioesPrefix::S, "EMAIL"));
    }

    #[test]
    fn test_bioes_transitions() {
        // Valid transitions
        assert!(is_valid_transition(BioesPrefix::O, "", BioesPrefix::O, ""));
        assert!(is_valid_transition(
            BioesPrefix::O,
            "",
            BioesPrefix::B,
            "NAME"
        ));
        assert!(is_valid_transition(
            BioesPrefix::O,
            "",
            BioesPrefix::S,
            "EMAIL"
        ));
        assert!(is_valid_transition(
            BioesPrefix::B,
            "NAME",
            BioesPrefix::I,
            "NAME"
        ));
        assert!(is_valid_transition(
            BioesPrefix::B,
            "NAME",
            BioesPrefix::E,
            "NAME"
        ));
        assert!(is_valid_transition(
            BioesPrefix::I,
            "NAME",
            BioesPrefix::I,
            "NAME"
        ));
        assert!(is_valid_transition(
            BioesPrefix::I,
            "NAME",
            BioesPrefix::E,
            "NAME"
        ));
        assert!(is_valid_transition(
            BioesPrefix::E,
            "NAME",
            BioesPrefix::O,
            ""
        ));
        assert!(is_valid_transition(
            BioesPrefix::E,
            "NAME",
            BioesPrefix::S,
            "DATE"
        ));
        assert!(is_valid_transition(
            BioesPrefix::S,
            "EMAIL",
            BioesPrefix::O,
            ""
        ));

        // Invalid transitions
        assert!(!is_valid_transition(
            BioesPrefix::O,
            "",
            BioesPrefix::I,
            "NAME"
        ));
        assert!(!is_valid_transition(
            BioesPrefix::O,
            "",
            BioesPrefix::E,
            "NAME"
        ));
        assert!(!is_valid_transition(
            BioesPrefix::B,
            "NAME",
            BioesPrefix::O,
            ""
        ));
        assert!(!is_valid_transition(
            BioesPrefix::B,
            "NAME",
            BioesPrefix::B,
            "NAME"
        ));
        assert!(!is_valid_transition(
            BioesPrefix::B,
            "NAME",
            BioesPrefix::I,
            "EMAIL"
        ));
        assert!(!is_valid_transition(
            BioesPrefix::I,
            "NAME",
            BioesPrefix::O,
            ""
        ));
    }

    #[test]
    fn test_viterbi_decoding_and_span_extraction() {
        let labels = vec![
            "O".to_string(),
            "B-NAME".to_string(),
            "I-NAME".to_string(),
            "E-NAME".to_string(),
            "S-EMAIL".to_string(),
        ];
        let num_classes = labels.len();

        // 4 tokens: "Hello", " John", " Smith", " user@example.com"
        // Expected:
        // Token 0: O
        // Token 1: B-NAME
        // Token 2: E-NAME
        // Token 3: S-EMAIL
        let logits = vec![
            // Token 0
            10.0, -10.0, -10.0, -10.0, -10.0, // Token 1
            -10.0, 10.0, -10.0, -10.0, -10.0, // Token 2
            -10.0, -10.0, -10.0, 10.0, -10.0, // Token 3
            -10.0, -10.0, -10.0, -10.0, 10.0,
        ];

        let tags = viterbi_decode(&logits, num_classes, &labels);
        assert_eq!(tags, vec![0, 1, 3, 4]);

        let text = "Hello John Smith user@example.com";
        let offsets = vec![
            TokenOffset {
                char_start: 0,
                char_end: 5,
                byte_start: 0,
                byte_end: 5,
            },
            TokenOffset {
                char_start: 6,
                char_end: 10,
                byte_start: 6,
                byte_end: 10,
            },
            TokenOffset {
                char_start: 11,
                char_end: 16,
                byte_start: 11,
                byte_end: 16,
            },
            TokenOffset {
                char_start: 17,
                char_end: 33,
                byte_start: 17,
                byte_end: 33,
            },
        ];

        let spans = extract_spans(&tags, &labels, &offsets, text, &logits, num_classes);
        assert_eq!(spans.len(), 2);

        assert_eq!(spans[0].entity_type, "NAME");
        assert_eq!(spans[0].start_char, 6);
        assert_eq!(spans[0].end_char, 16);
        assert_eq!(spans[0].text, "John Smith");

        assert_eq!(spans[1].entity_type, "EMAIL");
        assert_eq!(spans[1].start_char, 17);
        assert_eq!(spans[1].end_char, 33);
        assert_eq!(spans[1].text, "user@example.com");
    }

    struct MockClassifierModel {
        labels: Vec<String>,
        config: crate::model::ModelConfig,
    }

    impl Model for MockClassifierModel {
        fn forward(&self, _tokens: &[u32], _pos: usize, _state: &mut InferenceState) -> Vec<f32> {
            Vec::new()
        }
        fn config(&self) -> &crate::model::ModelConfig {
            &self.config
        }
        fn is_classifier(&self) -> bool {
            true
        }
        fn num_classes(&self) -> usize {
            self.labels.len()
        }
        fn class_labels(&self) -> &[String] {
            &self.labels
        }
        fn classify_tokens(
            &self,
            tokens: &[u32],
            _state: &mut InferenceState,
        ) -> Result<Vec<f32>, CeraError> {
            let n = tokens.len();
            let k = self.labels.len();
            let mut logits = vec![0.0f32; n * k];
            for t in 0..n {
                logits[t * k] = 5.0; // O by default
            }
            if n >= 2 {
                logits[0] = -5.0;
                logits[1] = 10.0; // B-NAME
                logits[k] = -5.0;
                logits[k + 3] = 10.0; // E-NAME
            }
            Ok(logits)
        }
    }

    #[test]
    fn test_detect_pii_end_to_end() {
        let labels = vec![
            "O".to_string(),
            "B-NAME".to_string(),
            "I-NAME".to_string(),
            "E-NAME".to_string(),
            "S-EMAIL".to_string(),
        ];
        let model = MockClassifierModel {
            labels: labels.clone(),
            config: crate::model::ModelConfig {
                architecture: "mock".into(),
                n_layers: 1,
                hidden_size: 4,
                intermediate_size: 8,
                n_heads: 1,
                n_kv_heads: 1,
                head_dim: 4,
                vocab_size: 256,
                max_seq_len: 64,
                rope_theta: 10000.0,
                rms_norm_eps: 1e-5,
                block_types: vec![crate::model::BlockType::Attention],
                conv_kernel_size: None,
                kv_heads_per_layer: vec![1],
                scalars: crate::model::ScalarMultipliers::default(),
                moe: None,
                is_causal: false,
                class_labels: labels,
            },
        };

        // Create a simple BPE tokenizer with bytes + tokens
        let mut vocab_vec = Vec::new();
        let mut token_to_id = std::collections::HashMap::new();
        for b in 0u8..=255 {
            vocab_vec.push(vec![b]);
            token_to_id.insert(vec![b], b as u32);
        }
        let alice_bytes = b"Alice".to_vec();
        token_to_id.insert(alice_bytes.clone(), 256);
        vocab_vec.push(alice_bytes);

        let smith_bytes = b" Smith".to_vec();
        token_to_id.insert(smith_bytes.clone(), 257);
        vocab_vec.push(smith_bytes);

        let tokenizer =
            BpeTokenizer::new_for_testing(vocab_vec, token_to_id, std::collections::HashMap::new());

        let mut state = InferenceState::from_config(&model.config).unwrap();
        let spans = detect_pii(&model, &tokenizer, "AB", &mut state).unwrap();

        assert_eq!(spans.len(), 1);
        assert_eq!(spans[0].entity_type, "NAME");
        assert_eq!(spans[0].text, "AB");
        assert_eq!(spans[0].start_char, 0);
        assert_eq!(spans[0].end_char, 2);
    }

    struct MockBaseModel {
        config: crate::model::ModelConfig,
    }

    impl Model for MockBaseModel {
        fn forward(&self, _tokens: &[u32], _pos: usize, _state: &mut InferenceState) -> Vec<f32> {
            Vec::new()
        }
        fn config(&self) -> &crate::model::ModelConfig {
            &self.config
        }
        fn classify_tokens(
            &self,
            tokens: &[u32],
            state: &mut InferenceState,
        ) -> Result<Vec<f32>, CeraError> {
            let Some(ref lora) = state.lora else {
                return Err(CeraError::Backend("no classifier head".into()));
            };
            let k = lora.class_labels.len();
            let n = tokens.len();
            let mut logits = vec![0.0f32; n * k];
            for t in 0..n {
                logits[t * k] = 5.0; // O
            }
            if n >= 1 {
                logits[0] = -5.0;
                logits[1] = 10.0; // S-EMAIL
            }
            Ok(logits)
        }
    }

    #[test]
    fn test_detect_pii_with_separate_lora_adapter() {
        let base_model = MockBaseModel {
            config: crate::model::ModelConfig {
                architecture: "mock".into(),
                n_layers: 1,
                hidden_size: 4,
                intermediate_size: 8,
                n_heads: 1,
                n_kv_heads: 1,
                head_dim: 4,
                vocab_size: 256,
                max_seq_len: 64,
                rope_theta: 10000.0,
                rms_norm_eps: 1e-5,
                block_types: vec![crate::model::BlockType::Attention],
                conv_kernel_size: None,
                kv_heads_per_layer: vec![1],
                scalars: crate::model::ScalarMultipliers::default(),
                moe: None,
                is_causal: true,          // base model is causal
                class_labels: Vec::new(), // base model has no classifier labels
            },
        };

        // Construct mock LoRA adapter with classifier head and labels
        let lora = crate::lora::LoraAdapterWeights::new_classifier_for_testing(
            vec![0.0; 8],
            Some(vec![0.0; 2]),
            vec!["O".to_string(), "S-EMAIL".to_string()],
        );

        let mut vocab_vec = Vec::new();
        let mut token_to_id = std::collections::HashMap::new();
        for b in 0u8..=255 {
            vocab_vec.push(vec![b]);
            token_to_id.insert(vec![b], b as u32);
        }
        let tokenizer =
            BpeTokenizer::new_for_testing(vocab_vec, token_to_id, std::collections::HashMap::new());

        let mut state = InferenceState::from_config(&base_model.config).unwrap();
        state.lora = Some(lora);

        let spans = detect_pii(&base_model, &tokenizer, "X", &mut state).unwrap();
        assert_eq!(spans.len(), 1);
        assert_eq!(spans[0].entity_type, "EMAIL");
        assert_eq!(spans[0].text, "X");
        assert_eq!(spans[0].start_char, 0);
        assert_eq!(spans[0].end_char, 1);
    }

    #[test]
    fn test_consecutive_b_and_s_tags_extraction() {
        let labels = vec![
            "O".to_string(),
            "B-NAME".to_string(),
            "I-NAME".to_string(),
            "E-NAME".to_string(),
            "S-EMAIL".to_string(),
        ];
        let num_classes = labels.len();
        let tags = vec![1, 1, 4]; // B-NAME, B-NAME, S-EMAIL
        let text = "Alice Bob user@example.com";
        let offsets = vec![
            TokenOffset {
                char_start: 0,
                char_end: 5,
                byte_start: 0,
                byte_end: 5,
            },
            TokenOffset {
                char_start: 6,
                char_end: 9,
                byte_start: 6,
                byte_end: 9,
            },
            TokenOffset {
                char_start: 10,
                char_end: 26,
                byte_start: 10,
                byte_end: 26,
            },
        ];
        let mut logits = vec![-10.0f32; 3 * num_classes];
        logits[1] = 10.0;
        logits[num_classes + 1] = 10.0;
        logits[2 * num_classes + 4] = 10.0;

        let spans = extract_spans(&tags, &labels, &offsets, text, &logits, num_classes);
        assert_eq!(spans.len(), 3);
        assert_eq!(spans[0].text, "Alice");
        assert_eq!(spans[1].text, "Bob");
        assert_eq!(spans[2].text, "user@example.com");
    }

    #[test]
    fn test_detect_pii_sequence_length_exceeded() {
        let labels = vec![
            "O".to_string(),
            "B-NAME".to_string(),
            "I-NAME".to_string(),
            "E-NAME".to_string(),
            "S-NAME".to_string(),
        ];
        let model = MockClassifierModel {
            labels: labels.clone(),
            config: crate::model::ModelConfig {
                architecture: "mock".to_string(),
                n_layers: 1,
                hidden_size: 4,
                intermediate_size: 8,
                n_heads: 1,
                n_kv_heads: 1,
                head_dim: 4,
                vocab_size: 256,
                max_seq_len: 2,
                rope_theta: 10000.0,
                rms_norm_eps: 1e-5,
                block_types: vec![crate::model::BlockType::Attention],
                conv_kernel_size: None,
                kv_heads_per_layer: vec![1],
                scalars: crate::model::ScalarMultipliers::default(),
                moe: None,
                is_causal: false,
                class_labels: labels,
            },
        };

        let mut vocab_vec = Vec::new();
        let mut token_to_id = std::collections::HashMap::new();
        for b in 0u8..=255 {
            vocab_vec.push(vec![b]);
            token_to_id.insert(vec![b], b as u32);
        }
        let tokenizer =
            BpeTokenizer::new_for_testing(vocab_vec, token_to_id, std::collections::HashMap::new());

        let mut state = InferenceState::from_config(&model.config).unwrap();
        let result = detect_pii(&model, &tokenizer, "ABCDE", &mut state);
        assert!(result.is_err());
        if let Err(CeraError::Backend(msg)) = result {
            assert!(msg.contains("exceeds maximum model sequence limit"));
        } else {
            panic!("expected CeraError::Backend on sequence length exceeded");
        }
    }

    #[test]
    #[ignore]
    #[cfg(feature = "mmap")]
    fn test_real_model_pii_classification() {
        let Some(path_str) = std::env::var_os("PII_MODEL_PATH") else {
            return;
        };
        let model_path = std::path::Path::new(&path_str);
        if !model_path.exists() {
            return;
        }
        let engine = crate::engine::CeraEngine::from_path(
            model_path,
            crate::engine::EngineConfig::default(),
        )
        .unwrap();

        let text = "Hello, my name is Alice Smith and my email is alice.smith@example.com";
        let spans = engine.detect_pii(text).unwrap();
        assert_eq!(spans.len(), 2);
        assert_eq!(spans[0].entity_type, "identity.person_name");
        assert_eq!(spans[0].text, "Alice Smith");
        assert_eq!(spans[1].entity_type, "contact.email");
        assert_eq!(spans[1].text, "alice.smith@example.com");
    }

    #[test]
    fn test_viterbi_decode_zero_or_mismatched_inputs() {
        let labels = vec!["O".to_string(), "B-PER".to_string(), "I-PER".to_string()];
        // Zero num_classes must safely return empty vec without division-by-zero panic
        assert!(viterbi_decode(&[1.0, 2.0], 0, &labels).is_empty());
        // Empty logits must return empty vec
        assert!(viterbi_decode(&[], 3, &labels).is_empty());
        // Fewer labels than num_classes must safely return empty vec without indexing out of bounds
        assert!(viterbi_decode(&[1.0, 2.0, 3.0], 5, &labels).is_empty());
    }

    #[test]
    fn test_viterbi_decode_all_neg_infinity_logits() {
        let labels = vec!["O".to_string(), "B-PER".to_string(), "I-PER".to_string()];
        let num_classes = labels.len();
        // 3 tokens with all logits -inf
        let logits = vec![f32::NEG_INFINITY; 3 * num_classes];
        let path = viterbi_decode(&logits, num_classes, &labels);
        assert_eq!(path.len(), 3);
        assert_eq!(path, vec![0, 0, 0]);
    }

    #[test]
    fn test_extract_spans_multibyte_utf8() {
        // Multi-byte Unicode characters (emoji: 4 bytes, cafe: acute accent 2 bytes)
        let text = "Hello 🦀 Alice, welcome to café!";
        let labels = vec![
            "O".to_string(),
            "B-NAME".to_string(),
            "I-NAME".to_string(),
            "E-NAME".to_string(),
            "S-NAME".to_string(),
        ];
        let offsets = vec![
            TokenOffset {
                char_start: 0,
                char_end: 6,
                byte_start: 0,
                byte_end: 6,
            },
            TokenOffset {
                char_start: 6,
                char_end: 8,
                byte_start: 6,
                byte_end: 11,
            },
            TokenOffset {
                char_start: 8,
                char_end: 13,
                byte_start: 11,
                byte_end: 16,
            },
            TokenOffset {
                char_start: 13,
                char_end: 31,
                byte_start: 16,
                byte_end: 35,
            },
        ];
        let tags = vec![0, 0, 4, 0]; // S-NAME at token 2
        let num_classes = labels.len();
        let mut logits = vec![0.0f32; 4 * num_classes];
        logits[2 * num_classes + 4] = 10.0; // High logit for S-NAME

        let spans = extract_spans(&tags, &labels, &offsets, text, &logits, num_classes);
        assert_eq!(spans.len(), 1);
        assert_eq!(spans[0].entity_type, "NAME");
        assert_eq!(spans[0].text, "Alice");
        assert_eq!(spans[0].start_char, 8);
        assert_eq!(spans[0].end_char, 13);
    }

    #[test]
    fn test_safe_span_slice_split_code_point_fallback() {
        // "🦀" is 4 bytes: byte index 1 is not a character boundary.
        // safe_span_slice must fallback to char_slice without panicking.
        let text = "🦀";
        let slice = safe_span_slice(text, 1, 3, 0, 1);
        assert_eq!(slice, "🦀");
    }

    #[test]
    fn test_extract_spans_special_token_empty_offset_filtered() {
        let labels = vec![
            "O".to_string(),
            "B-NAME".to_string(),
            "I-NAME".to_string(),
            "E-NAME".to_string(),
            "S-NAME".to_string(),
        ];
        let offsets = vec![
            // BOS token has 0-length offset
            TokenOffset {
                char_start: 0,
                char_end: 0,
                byte_start: 0,
                byte_end: 0,
            },
            // Content token "Alice"
            TokenOffset {
                char_start: 0,
                char_end: 5,
                byte_start: 0,
                byte_end: 5,
            },
            // EOS token has 0-length offset
            TokenOffset {
                char_start: 5,
                char_end: 5,
                byte_start: 5,
                byte_end: 5,
            },
        ];
        // Suppose the classifier marks both BOS and EOS as S-NAME (tag 4) as well as Alice
        let tags = vec![4, 4, 4];
        let num_classes = labels.len();
        let mut logits = vec![0.0f32; 3 * num_classes];
        for t in 0..3 {
            logits[t * num_classes + 4] = 10.0;
        }
        let text = "Alice";
        let spans = extract_spans(&tags, &labels, &offsets, text, &logits, num_classes);
        // Only "Alice" should be extracted because BOS and EOS have empty spans (trimmed_start >= trimmed_end)
        assert_eq!(spans.len(), 1);
        assert_eq!(spans[0].entity_type, "NAME");
        assert_eq!(spans[0].text, "Alice");
        assert_eq!(spans[0].start_char, 0);
        assert_eq!(spans[0].end_char, 5);
    }

    #[test]
    fn test_detect_pii_with_configured_special_tokens() {
        let labels = vec![
            "O".to_string(),
            "B-NAME".to_string(),
            "I-NAME".to_string(),
            "E-NAME".to_string(),
            "S-EMAIL".to_string(),
        ];
        struct SpecialTokenMockModel {
            labels: Vec<String>,
            config: crate::model::ModelConfig,
        }
        impl Model for SpecialTokenMockModel {
            fn forward(
                &self,
                _tokens: &[u32],
                _pos: usize,
                _state: &mut InferenceState,
            ) -> Vec<f32> {
                Vec::new()
            }
            fn config(&self) -> &crate::model::ModelConfig {
                &self.config
            }
            fn is_classifier(&self) -> bool {
                true
            }
            fn num_classes(&self) -> usize {
                self.labels.len()
            }
            fn class_labels(&self) -> &[String] {
                &self.labels
            }
            fn classify_tokens(
                &self,
                tokens: &[u32],
                _state: &mut InferenceState,
            ) -> Result<Vec<f32>, CeraError> {
                let n = tokens.len();
                let k = self.labels.len();
                let mut logits = vec![0.0f32; n * k];
                for t in 0..n {
                    logits[t * k] = 5.0; // O by default
                }
                // Tokens: [BOS (100), 'A' (65), 'B' (66), EOS (101)]
                assert_eq!(tokens.first().copied(), Some(100));
                assert_eq!(tokens.last().copied(), Some(101));
                if n >= 4 {
                    logits[k] = -5.0;
                    logits[k + 1] = 10.0; // B-NAME
                    logits[2 * k] = -5.0;
                    logits[2 * k + 3] = 10.0; // E-NAME
                }
                Ok(logits)
            }
        }
        let model = SpecialTokenMockModel {
            labels: labels.clone(),
            config: crate::model::ModelConfig {
                architecture: "mock".into(),
                n_layers: 1,
                hidden_size: 4,
                intermediate_size: 8,
                n_heads: 1,
                n_kv_heads: 1,
                head_dim: 4,
                vocab_size: 256,
                max_seq_len: 64,
                rope_theta: 10000.0,
                rms_norm_eps: 1e-5,
                block_types: vec![crate::model::BlockType::Attention],
                conv_kernel_size: None,
                kv_heads_per_layer: vec![1],
                scalars: crate::model::ScalarMultipliers::default(),
                moe: None,
                is_causal: false,
                class_labels: labels,
            },
        };

        let mut vocab_vec = Vec::new();
        let mut token_to_id = std::collections::HashMap::new();
        for b in 0u8..=255 {
            vocab_vec.push(vec![b]);
            token_to_id.insert(vec![b], b as u32);
        }
        let tokenizer =
            BpeTokenizer::new_for_testing(vocab_vec, token_to_id, std::collections::HashMap::new())
                .with_special_tokens_for_testing(Some(100), Some(101), true, true);

        let mut state = InferenceState::from_config(&model.config).unwrap();
        let spans = detect_pii(&model, &tokenizer, "AB", &mut state).unwrap();

        assert_eq!(spans.len(), 1);
        assert_eq!(spans[0].entity_type, "NAME");
        assert_eq!(spans[0].text, "AB");
        assert_eq!(spans[0].start_char, 0);
        assert_eq!(spans[0].end_char, 2);
    }
}