stft 0.2.0

computes the short-time fourier transform on streaming data
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

use std::str::FromStr;

extern crate stft;
use stft::{STFT, WindowType};

#[test]
fn test_window_type_from_string() {
    assert_eq!(WindowType::from_str("Hanning").unwrap(), WindowType::Hanning);
    assert_eq!(WindowType::from_str("hanning").unwrap(), WindowType::Hanning);
    assert_eq!(WindowType::from_str("hann").unwrap(), WindowType::Hanning);
    assert_eq!(WindowType::from_str("blackman").unwrap(), WindowType::Blackman);
}

#[test]
fn test_window_type_to_string() {
    assert_eq!(WindowType::Hanning.to_string(), "Hanning");
}

#[test]
fn test_window_types_to_strings() {
    assert_eq!(
        vec!["Hanning", "Hamming", "Blackman", "Nuttall", "None"],
        WindowType::values().iter().map(|x| x.to_string()).collect::<Vec<String>>());
}

#[test]
fn test_log10_positive() {
    assert!(stft::log10_positive(-1. as f64).is_nan());
    assert_eq!(stft::log10_positive(0.), 0.);
    assert_eq!(stft::log10_positive(1.), 0.);
    assert_eq!(stft::log10_positive(10.), 1.);
    assert_eq!(stft::log10_positive(100.), 2.);
    assert_eq!(stft::log10_positive(1000.), 3.);
}

#[test]
fn test_stft() {
    let mut stft = STFT::<f64>::new(WindowType::Hanning, 8, 4);
    assert!(!stft.contains_enough_to_compute());
    assert_eq!(stft.output_size(), 4);
    assert_eq!(stft.len(), 0);
    stft.append_samples(&vec![500., 0., 100.][..]);
    assert_eq!(stft.len(), 3);
    assert!(!stft.contains_enough_to_compute());
    stft.append_samples(&vec![500., 0., 100., 0.][..]);
    assert_eq!(stft.len(), 7);
    assert!(!stft.contains_enough_to_compute());

    stft.append_samples(&vec![500.][..]);
    assert!(stft.contains_enough_to_compute());

    let mut output: Vec<f64> = vec![0.; 4];
    stft.compute_column(&mut output[..]);
    println!("{:?}", output);
}