car-voice 0.13.0

Voice I/O capability for CAR — mic capture, VAD, listener/speaker traits
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
//! Speaker diarization via ONNX speaker embeddings + online clustering.
//!
//! Pipeline:
//! ```text
//!   16k mono PCM segment ──► Mel features ──► ResNet34 ONNX
//!//!                                            256-d embedding
//!//!                                ┌──── cosine sim ─┴── existing centroids
//!//!                         max sim > merge_threshold ?
//!                         ├─ yes → assign to cluster, update centroid
//!                         └─ no  → spawn new cluster
//! ```
//!
//! ## Model choice — pyannote/wespeaker-voxceleb-resnet34-LM
//!
//! 28 MB ONNX-exported ResNet34 trained on VoxCeleb2 with large-margin
//! fine-tuning. MIT-licensed. The model is one of two pyannote-blessed
//! embedders (the other is the older 80-MB X-Vector); ResNet34 is more
//! accurate at half the size and is what pyannote 3.x uses internally
//! when no override is provided.
//!
//! Why not pyannote/segmentation-3.0 too: that model does VAD + overlap
//! detection in one shot. We already have Silero VAD doing speech
//! segmentation upstream — bringing in segmentation-3.0 would
//! duplicate the VAD work and conflict on segment boundaries. If we
//! later want overlapping-speaker detection ("two people talked at
//! once"), that's the model to add.
//!
//! ## Online clustering
//!
//! We don't have the full transcript at segment time, so we use online
//! agglomerative-style clustering: each new embedding is compared to
//! every existing centroid via cosine similarity; the closest cluster
//! above [`DiarizationConfig::merge_threshold`] absorbs the segment
//! and updates its centroid as a running mean. New segments below the
//! threshold spawn a new cluster.
//!
//! This is less accurate than offline spectral clustering (the
//! pyannote-default for finished recordings) but it's what live
//! meeting capture needs — speaker labels have to arrive with the
//! transcript event, not minutes later.
//!
//! ## Mel feature extraction
//!
//! ResNet34 expects 80-dim log-mel spectrograms at 100 frames/second
//! (10 ms hop, 25 ms window). This module ships a minimal mel
//! frontend rather than pulling in `mel_spec` or `aubio` — the
//! spectrogram math is ~80 lines and keeping it in tree avoids a heavy
//! dep for what's essentially librosa-equivalent FFT-then-mel.

#![cfg(feature = "diarization")]

use crate::enrollment::TranscriptRole;
use ndarray::{Array1, Array2, Array3};
use ort::session::Session;
use ort::value::Tensor;
use std::path::PathBuf;
use std::sync::{Arc, Mutex};

/// Tunable parameters for the diarizer.
#[derive(Debug, Clone)]
pub struct DiarizationConfig {
    /// Cosine similarity above which a new segment joins an existing
    /// cluster. Conservative default — pyannote uses 0.7 for the
    /// resnet34 embedding space; we mirror that. Lower = fewer
    /// clusters (more "merging strangers"); higher = more clusters
    /// (more "splitting one person into two").
    pub merge_threshold: f32,

    /// Minimum segment duration (ms) for which we'll bother computing
    /// an embedding. Short clips (under ~250 ms) produce noisy
    /// embeddings that hurt clustering.
    pub min_segment_ms: u32,

    /// Maximum number of speakers to track. New clusters past this
    /// cap fall back to the closest existing centroid even when the
    /// similarity is below the merge threshold. Defaults to 8 — most
    /// meetings have fewer than that, and unbounded growth lets
    /// background noise fragment into pseudo-speakers.
    pub max_speakers: usize,

    /// Path override for the embedder ONNX file. None = look at the
    /// default cache path (`~/.car/models/wespeaker-resnet34.onnx`)
    /// and download on miss.
    pub model_path: Option<PathBuf>,
}

impl Default for DiarizationConfig {
    fn default() -> Self {
        Self {
            merge_threshold: 0.70,
            min_segment_ms: 250,
            max_speakers: 8,
            model_path: None,
        }
    }
}

/// Errors specific to the diarization pipeline.
#[derive(Debug, thiserror::Error)]
pub enum DiarizationError {
    #[error("model file not found at {0}")]
    ModelMissing(PathBuf),
    #[error("ONNX runtime error: {0}")]
    Onnx(String),
    #[error("audio segment too short: {0} ms (min {1} ms)")]
    SegmentTooShort(u32, u32),
    #[error("io: {0}")]
    Io(#[from] std::io::Error),
}

/// One cluster's running state.
#[derive(Debug, Clone)]
struct SpeakerCluster {
    /// Stable id assigned at cluster creation. Surfaces as
    /// `speaker_<n>` in [`TranscriptRole::OtherSpeaker`].
    id: usize,
    /// Running mean of all embeddings assigned so far.
    centroid: Array1<f32>,
    /// Number of segments contributing to the centroid; used for the
    /// running-mean update.
    count: usize,
}

impl SpeakerCluster {
    fn merge(&mut self, embedding: &Array1<f32>) {
        let n = self.count as f32;
        // running mean: c' = (n*c + e) / (n+1)
        for (c, e) in self.centroid.iter_mut().zip(embedding.iter()) {
            *c = (n * *c + e) / (n + 1.0);
        }
        self.count += 1;
        l2_normalize_in_place(&mut self.centroid);
    }
}

/// Online speaker diarizer.
///
/// Construct once per voice session (or once per meeting if mic and
/// system audio should share a speaker space — usually they shouldn't,
/// since "you on the mic" and "everyone else over the speakers" is
/// already a clean two-way split that doesn't need clustering).
pub struct SpeakerDiarizer {
    session: Mutex<Session>,
    config: DiarizationConfig,
    clusters: Mutex<Vec<SpeakerCluster>>,
    next_id: Mutex<usize>,
}

impl SpeakerDiarizer {
    /// Build a diarizer, loading the ONNX model.
    ///
    /// On first run with the default `model_path`, downloads the
    /// 28 MB ResNet34 weights from Hugging Face into
    /// `~/.car/models/`. Subsequent runs load from disk.
    pub fn new(config: DiarizationConfig) -> std::result::Result<Self, DiarizationError> {
        let path = match &config.model_path {
            Some(p) => p.clone(),
            None => default_model_path()?,
        };
        if !path.exists() {
            download_model(&path)?;
        }
        let session = Session::builder()
            .map_err(|e| DiarizationError::Onnx(e.to_string()))?
            .commit_from_file(&path)
            .map_err(|e| DiarizationError::Onnx(e.to_string()))?;
        Ok(Self {
            session: Mutex::new(session),
            config,
            clusters: Mutex::new(Vec::new()),
            next_id: Mutex::new(0),
        })
    }

    /// Run a finalized speech segment through the embedder and return
    /// the speaker label.
    ///
    /// Returns [`TranscriptRole::Unknown`] if the segment is shorter
    /// than [`DiarizationConfig::min_segment_ms`] — short clips
    /// produce noisy embeddings that destabilize the clusters.
    pub fn classify(
        &self,
        samples: &[i16],
        sample_rate: u32,
    ) -> std::result::Result<TranscriptRole, DiarizationError> {
        let duration_ms = (samples.len() as u64 * 1000 / sample_rate as u64) as u32;
        if duration_ms < self.config.min_segment_ms {
            return Ok(TranscriptRole::Unknown);
        }
        let embedding = self.embed(samples, sample_rate)?;
        let label = self.assign(embedding);
        Ok(label)
    }

    /// Number of speakers tracked so far. Useful for tests + UI.
    pub fn speaker_count(&self) -> usize {
        self.clusters.lock().unwrap().len()
    }

    fn embed(
        &self,
        samples: &[i16],
        sample_rate: u32,
    ) -> std::result::Result<Array1<f32>, DiarizationError> {
        // Resample to 16 kHz mono if needed. The embedder is trained
        // on 16k VoxCeleb2 — feeding 48k destroys the spectrogram.
        let pcm_16k = if sample_rate == 16_000 {
            i16_to_f32(samples)
        } else {
            resample_to_16k(samples, sample_rate)
        };
        let mel = log_mel_spectrogram(&pcm_16k);
        let input = mel_to_input_tensor(&mel);

        let mut session = self
            .session
            .lock()
            .map_err(|e| DiarizationError::Onnx(format!("session lock: {}", e)))?;
        let outputs = session
            .run(ort::inputs![input])
            .map_err(|e| DiarizationError::Onnx(e.to_string()))?;
        let (_shape, data) = outputs[0]
            .try_extract_tensor::<f32>()
            .map_err(|e| DiarizationError::Onnx(e.to_string()))?;
        let mut embedding = Array1::from_iter(data.iter().copied());
        l2_normalize_in_place(&mut embedding);
        Ok(embedding)
    }

    fn assign(&self, embedding: Array1<f32>) -> TranscriptRole {
        let mut clusters = self.clusters.lock().unwrap();
        let mut next_id = self.next_id.lock().unwrap();

        // Find the closest cluster.
        let best = clusters
            .iter()
            .enumerate()
            .map(|(i, c)| (i, cosine_similarity(&embedding, &c.centroid)))
            .max_by(|a, b| a.1.partial_cmp(&b.1).unwrap_or(std::cmp::Ordering::Equal));

        match best {
            Some((idx, sim)) if sim >= self.config.merge_threshold => {
                clusters[idx].merge(&embedding);
                TranscriptRole::OtherSpeaker {
                    local_id: format!("speaker_{}", clusters[idx].id),
                }
            }
            Some((idx, _sim)) if clusters.len() >= self.config.max_speakers => {
                // At cap — fall back to nearest cluster even if below
                // threshold rather than spawn a new one. This is the
                // "background noise creating phantom speakers"
                // mitigation; well-tuned thresholds make it rare.
                clusters[idx].merge(&embedding);
                TranscriptRole::OtherSpeaker {
                    local_id: format!("speaker_{}", clusters[idx].id),
                }
            }
            _ => {
                let id = *next_id;
                *next_id += 1;
                let cluster = SpeakerCluster {
                    id,
                    centroid: embedding,
                    count: 1,
                };
                clusters.push(cluster);
                TranscriptRole::OtherSpeaker {
                    local_id: format!("speaker_{}", id),
                }
            }
        }
    }
}

// ─── Audio frontend ────────────────────────────────────────────────────────

const SAMPLE_RATE_HZ: usize = 16_000;
const N_FFT: usize = 512;
const HOP_LENGTH: usize = 160; // 10 ms at 16 kHz
const N_MELS: usize = 80;

/// 80-dim log-mel spectrogram with 25 ms window / 10 ms hop, matching
/// what wespeaker's resnet34 expects.
fn log_mel_spectrogram(pcm: &[f32]) -> Array2<f32> {
    let frames = (pcm.len().saturating_sub(N_FFT)) / HOP_LENGTH + 1;
    if frames == 0 {
        return Array2::zeros((N_MELS, 1));
    }
    let mel_filters = mel_filterbank();
    let window = hann_window(N_FFT);
    let mut mel = Array2::<f32>::zeros((N_MELS, frames));
    for f in 0..frames {
        let start = f * HOP_LENGTH;
        let end = (start + N_FFT).min(pcm.len());
        let mut frame = vec![0f32; N_FFT];
        let len = end - start;
        frame[..len].copy_from_slice(&pcm[start..end]);
        for (i, w) in window.iter().enumerate() {
            frame[i] *= w;
        }
        let spec = power_spectrum(&frame);
        for m in 0..N_MELS {
            let energy: f32 = spec
                .iter()
                .zip(mel_filters[m].iter())
                .map(|(s, w)| s * w)
                .sum();
            mel[(m, f)] = (energy + 1e-10).ln();
        }
    }
    mel
}

fn power_spectrum(frame: &[f32]) -> Vec<f32> {
    // Real-input DFT via the `realfft` crate would be ideal but
    // car-voice already pulls in `realfft` indirectly via Silero;
    // staying with naive DFT here keeps the diarization module
    // independent. Performance: ~80 frames/s of audio → ~80 × 80 ×
    // 257 = 1.6M ops per second, well under realtime on any modern
    // CPU.
    let n = frame.len();
    let half = n / 2 + 1;
    let mut out = Vec::with_capacity(half);
    for k in 0..half {
        let (mut re, mut im) = (0f32, 0f32);
        for (i, &x) in frame.iter().enumerate() {
            let theta = -2.0 * std::f32::consts::PI * (k * i) as f32 / n as f32;
            re += x * theta.cos();
            im += x * theta.sin();
        }
        out.push(re * re + im * im);
    }
    out
}

fn hann_window(n: usize) -> Vec<f32> {
    (0..n)
        .map(|i| 0.5 - 0.5 * (2.0 * std::f32::consts::PI * i as f32 / (n - 1) as f32).cos())
        .collect()
}

fn mel_filterbank() -> Vec<Vec<f32>> {
    let n_fft_bins = N_FFT / 2 + 1;
    let mel_low = hz_to_mel(0.0);
    let mel_high = hz_to_mel(SAMPLE_RATE_HZ as f32 / 2.0);
    let mel_pts: Vec<f32> = (0..N_MELS + 2)
        .map(|i| mel_low + (mel_high - mel_low) * i as f32 / (N_MELS + 1) as f32)
        .collect();
    let hz_pts: Vec<f32> = mel_pts.iter().map(|m| mel_to_hz(*m)).collect();
    let bin_pts: Vec<f32> = hz_pts
        .iter()
        .map(|h| h * (N_FFT as f32) / (SAMPLE_RATE_HZ as f32))
        .collect();

    let mut filters = vec![vec![0f32; n_fft_bins]; N_MELS];
    for m in 0..N_MELS {
        let left = bin_pts[m];
        let center = bin_pts[m + 1];
        let right = bin_pts[m + 2];
        for k in 0..n_fft_bins {
            let kf = k as f32;
            let v = if kf < left || kf > right {
                0.0
            } else if kf <= center {
                (kf - left) / (center - left).max(1e-10)
            } else {
                (right - kf) / (right - center).max(1e-10)
            };
            filters[m][k] = v.max(0.0);
        }
    }
    filters
}

fn hz_to_mel(hz: f32) -> f32 {
    2595.0 * (1.0 + hz / 700.0).log10()
}

fn mel_to_hz(mel: f32) -> f32 {
    700.0 * (10f32.powf(mel / 2595.0) - 1.0)
}

fn mel_to_input_tensor(mel: &Array2<f32>) -> Tensor<f32> {
    // The onnx-community/wespeaker-voxceleb-resnet34-LM mirror that
    // #114 switched to declares `input_features: ['B', 'T', 80]` —
    // the mel-bin axis is *trailing*, not the channel axis as the
    // original WeSpeaker PyTorch checkpoint had. Using (1, 80, T)
    // here raised `Got invalid dimensions for input: input_features
    // — index: 2 Got: <T> Expected: 80` on every embed call; the
    // listener silently fell back to `role: "unknown"` for every
    // segment (#143). Mel-bin count stays N_MELS = 80; only the
    // axis order changes.
    let (n_mels, n_frames) = mel.dim();
    let arr = Array3::from_shape_fn((1, n_frames, n_mels), |(_, t, m)| mel[(m, t)]);
    Tensor::from_array(arr).expect("mel array shape always builds a valid tensor")
}

// ─── Math helpers ──────────────────────────────────────────────────────────

fn i16_to_f32(samples: &[i16]) -> Vec<f32> {
    samples
        .iter()
        .map(|s| *s as f32 / i16::MAX as f32)
        .collect()
}

fn resample_to_16k(samples: &[i16], from_rate: u32) -> Vec<f32> {
    // Linear-interpolation resample. Fine for an embedder's frontend —
    // anti-aliasing matters less when the downstream consumer is a
    // 16 kHz mel spectrogram that throws away anything above 8 kHz
    // anyway.
    let f32_in = i16_to_f32(samples);
    let ratio = SAMPLE_RATE_HZ as f64 / from_rate as f64;
    let out_len = (f32_in.len() as f64 * ratio) as usize;
    let mut out = Vec::with_capacity(out_len);
    for i in 0..out_len {
        let src = i as f64 / ratio;
        let lo = src.floor() as usize;
        let hi = (lo + 1).min(f32_in.len() - 1);
        let frac = (src - lo as f64) as f32;
        out.push(f32_in[lo] * (1.0 - frac) + f32_in[hi] * frac);
    }
    out
}

fn cosine_similarity(a: &Array1<f32>, b: &Array1<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 <= f32::EPSILON || nb <= f32::EPSILON {
        return 0.0;
    }
    dot / (na * nb)
}

fn l2_normalize_in_place(v: &mut Array1<f32>) {
    let norm: f32 = v.iter().map(|x| x * x).sum::<f32>().sqrt();
    if norm > f32::EPSILON {
        for x in v.iter_mut() {
            *x /= norm;
        }
    }
}

// ─── Model file resolution ─────────────────────────────────────────────────

fn default_model_path() -> std::result::Result<PathBuf, DiarizationError> {
    let home = std::env::var_os("HOME").map(PathBuf::from).ok_or_else(|| {
        DiarizationError::Io(std::io::Error::new(
            std::io::ErrorKind::NotFound,
            "HOME not set",
        ))
    })?;
    Ok(home
        .join(".car")
        .join("models")
        .join("wespeaker-resnet34.onnx"))
}

// `pyannote/wespeaker-voxceleb-resnet34-LM` does not publish an ONNX export
// (only `pytorch_model.bin`), so the previous URL 404'd on first run for any
// user without a pre-baked `~/.car/models/wespeaker-resnet34.onnx`. The
// onnx-community mirror publishes the same architecture exported through
// Optimum, preserving input/output tensor shapes — drop-in replacement.
// Issue #114.
const MODEL_URL: &str =
    "https://huggingface.co/onnx-community/wespeaker-voxceleb-resnet34-LM/resolve/main/onnx/model.onnx";

fn download_model(target: &PathBuf) -> std::result::Result<(), DiarizationError> {
    if let Some(parent) = target.parent() {
        std::fs::create_dir_all(parent)?;
    }
    tracing::info!(
        "[diarization] downloading speaker embedder (~28 MB) to {}",
        target.display()
    );
    let bytes = reqwest::blocking::get(MODEL_URL)
        .and_then(|r| r.bytes())
        .map_err(|e| DiarizationError::Onnx(format!("download failed: {}", e)))?;
    std::fs::write(target, &bytes)?;
    tracing::info!("[diarization] wrote {} bytes", bytes.len());
    Ok(())
}

// ─── Public conversion helper ──────────────────────────────────────────────

/// Convert a freshly classified [`TranscriptRole`] to the JSON-friendly
/// string the FFI surface emits. Mirrors `session::role_to_str`.
pub fn role_to_str(role: &TranscriptRole) -> String {
    match role {
        TranscriptRole::EnrolledUser => "enrolled_user".to_string(),
        TranscriptRole::OtherSpeaker { local_id } => format!("other:{}", local_id),
        TranscriptRole::Unknown => "unknown".to_string(),
    }
}

/// Public alias for tests and integrations that want to refer to the
/// diarizer by the trait-style name.
pub type Diarizer = SpeakerDiarizer;

/// Optional injected diarizer, ergonomic for `Option<Arc<Diarizer>>`
/// fields on listener structs.
pub type SharedDiarizer = Arc<Diarizer>;

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

    /// Issue #114: the speaker-embedder URL has bitrotted before. Lock the
    /// host + path shape to the onnx-community mirror so a regression
    /// (typo, accidental rebase, or a maintainer-flipped repo) is caught
    /// before it ships rather than at a user's first `prepareDiarizer()`
    /// call.
    #[test]
    fn diarizer_model_url_points_at_onnx_community_mirror() {
        assert!(
            MODEL_URL.starts_with("https://huggingface.co/onnx-community/"),
            "diarizer URL must point at the onnx-community mirror that \
             actually publishes the ONNX export; got {MODEL_URL}"
        );
        assert!(
            MODEL_URL.ends_with("/model.onnx"),
            "diarizer URL must point at the unquantized model.onnx file \
             (~28 MB) for parity with the docstring; got {MODEL_URL}"
        );
    }

    /// Issue #143: the onnx-community wespeaker mirror declares
    /// `input_features: ['B', 'T', 80]` — mel-bins on the trailing
    /// axis, not the channel axis. A future flip back to (1, 80, T)
    /// would silently fall through to "unknown" speaker labels in
    /// production; lock the layout here so it's caught at
    /// `cargo test --features diarization` instead.
    #[test]
    fn mel_to_input_tensor_has_trailing_mel_axis() {
        // Build a (N_MELS, T) mel where mel[m, t] = m * 100 + t so
        // we can verify the destination indices map correctly.
        let n_frames = 4;
        let mel = Array2::from_shape_fn((N_MELS, n_frames), |(m, t)| (m * 100 + t) as f32);
        let tensor = mel_to_input_tensor(&mel);
        let (shape, _data) = tensor
            .try_extract_tensor::<f32>()
            .expect("tensor should extract back to ndarray");
        let dims: Vec<i64> = shape.to_vec();
        assert_eq!(
            dims,
            vec![1_i64, n_frames as i64, N_MELS as i64],
            "expected (B=1, T={n_frames}, 80); got {dims:?}"
        );
    }

    /// Cluster math: a fresh embedding well above threshold should
    /// merge into the existing cluster and update its centroid.
    #[test]
    fn cluster_merge_updates_running_mean() {
        let mut cluster = SpeakerCluster {
            id: 0,
            centroid: Array1::from_vec(vec![1.0, 0.0, 0.0]),
            count: 1,
        };
        let new = Array1::from_vec(vec![0.0, 1.0, 0.0]);
        cluster.merge(&new);
        // After merge, centroid should be (0.5, 0.5, 0) then
        // L2-normalized to (~0.707, ~0.707, 0).
        let expected = 1.0 / 2f32.sqrt();
        assert!((cluster.centroid[0] - expected).abs() < 1e-4);
        assert!((cluster.centroid[1] - expected).abs() < 1e-4);
        assert!(cluster.centroid[2].abs() < 1e-4);
        assert_eq!(cluster.count, 2);
    }

    #[test]
    fn cosine_similarity_matches_definition() {
        let a = Array1::from_vec(vec![1.0, 0.0, 0.0]);
        let b = Array1::from_vec(vec![1.0, 0.0, 0.0]);
        let c = Array1::from_vec(vec![0.0, 1.0, 0.0]);
        assert!((cosine_similarity(&a, &b) - 1.0).abs() < 1e-6);
        assert!(cosine_similarity(&a, &c).abs() < 1e-6);
    }

    #[test]
    fn cosine_similarity_handles_zero_vectors() {
        let a = Array1::from_vec(vec![0.0, 0.0, 0.0]);
        let b = Array1::from_vec(vec![1.0, 0.0, 0.0]);
        assert_eq!(cosine_similarity(&a, &b), 0.0);
    }

    #[test]
    fn l2_normalize_unit_norm() {
        let mut v = Array1::from_vec(vec![3.0, 4.0, 0.0]);
        l2_normalize_in_place(&mut v);
        let norm = v.iter().map(|x| x * x).sum::<f32>().sqrt();
        assert!((norm - 1.0).abs() < 1e-6);
    }

    #[test]
    fn hz_mel_round_trip() {
        let hz = 1000.0_f32;
        let mel = hz_to_mel(hz);
        let back = mel_to_hz(mel);
        assert!((hz - back).abs() < 0.5);
    }

    #[test]
    fn mel_filterbank_has_expected_shape() {
        let bank = mel_filterbank();
        assert_eq!(bank.len(), N_MELS);
        let n_fft_bins = N_FFT / 2 + 1;
        for filt in &bank {
            assert_eq!(filt.len(), n_fft_bins);
            // Triangular filters are non-negative.
            assert!(filt.iter().all(|v| *v >= 0.0));
        }
    }

    #[test]
    fn role_to_str_matches_session_format() {
        assert_eq!(role_to_str(&TranscriptRole::EnrolledUser), "enrolled_user");
        assert_eq!(role_to_str(&TranscriptRole::Unknown), "unknown");
        assert_eq!(
            role_to_str(&TranscriptRole::OtherSpeaker {
                local_id: "speaker_0".into()
            }),
            "other:speaker_0"
        );
    }

    /// Resampler smoke: downsampling 32 kHz → 16 kHz halves the
    /// sample count.
    #[test]
    fn resample_halves_sample_count_at_2x_rate() {
        let input = vec![0i16; 32_000]; // 1s at 32 kHz
        let out = resample_to_16k(&input, 32_000);
        // Allow ±1 due to integer rounding.
        assert!(((out.len() as i32) - 16_000).abs() <= 1);
    }

    #[test]
    fn resample_passthrough_at_16k() {
        let input = vec![0i16; 16_000];
        let out = resample_to_16k(&input, 16_000);
        assert_eq!(out.len(), 16_000);
    }

    #[test]
    fn config_defaults_are_sane() {
        let c = DiarizationConfig::default();
        assert!(c.merge_threshold > 0.0 && c.merge_threshold < 1.0);
        assert!(c.min_segment_ms > 0);
        assert!(c.max_speakers > 0);
    }

    /// End-to-end clustering test using synthetic embeddings (we
    /// construct a SpeakerDiarizer's clusters field directly to avoid
    /// needing the actual ONNX model). This exercises the assignment
    /// logic without I/O.
    #[test]
    fn synthetic_clustering_assigns_three_speakers() {
        // Three orthogonal embeddings → should split into 3 clusters.
        // We simulate the assign() logic here since constructing a
        // real Diarizer requires the ONNX model file.
        let config = DiarizationConfig::default();
        let mut clusters: Vec<SpeakerCluster> = Vec::new();
        let mut next_id = 0;

        let inputs = [
            Array1::from_vec(vec![1.0, 0.0, 0.0]),
            Array1::from_vec(vec![0.0, 1.0, 0.0]),
            Array1::from_vec(vec![0.0, 0.0, 1.0]),
            // Repeats of the first one — should join cluster 0.
            Array1::from_vec(vec![0.95, 0.05, 0.0]),
            Array1::from_vec(vec![0.99, 0.01, 0.0]),
        ];

        let mut labels = Vec::new();
        for emb in &inputs {
            let best = clusters
                .iter()
                .enumerate()
                .map(|(i, c)| (i, cosine_similarity(emb, &c.centroid)))
                .max_by(|a, b| a.1.partial_cmp(&b.1).unwrap_or(std::cmp::Ordering::Equal));
            match best {
                Some((idx, sim)) if sim >= config.merge_threshold => {
                    clusters[idx].merge(emb);
                    labels.push(clusters[idx].id);
                }
                _ => {
                    let id = next_id;
                    next_id += 1;
                    clusters.push(SpeakerCluster {
                        id,
                        centroid: emb.clone(),
                        count: 1,
                    });
                    labels.push(id);
                }
            }
        }
        // 3 distinct ids assigned to the first 3, then repeats.
        assert_eq!(labels.len(), 5);
        assert_eq!(labels[0], 0);
        assert_eq!(labels[1], 1);
        assert_eq!(labels[2], 2);
        assert_eq!(labels[3], 0);
        assert_eq!(labels[4], 0);
        assert_eq!(clusters.len(), 3);
    }
}