opus-rs 0.1.7

pure Rust implementation of Opus codec
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

pub fn silk_insertion_sort_increasing(a: &mut [i32], idx: &mut [i32], l: usize, k: usize) {
    assert!(k > 0);
    assert!(l > 0);
    assert!(l >= k);

    // Write start indices in index vector
    for i in 0..k {
        idx[i] = i as i32;
    }

    // Sort vector elements by value, increasing order
    for i in 1..k {
        let value = a[i];
        let mut j = i as i32 - 1;
        while j >= 0 && value < a[j as usize] {
            a[(j + 1) as usize] = a[j as usize]; // Shift value
            idx[(j + 1) as usize] = idx[j as usize]; // Shift index
            j -= 1;
        }
        a[(j + 1) as usize] = value; // Write value
        idx[(j + 1) as usize] = i as i32; // Write index
    }

    // If less than L values are asked for, check the remaining values,
    // but only spend CPU to ensure that the K first values are correct
    for i in k..l {
        let value = a[i];
        if value < a[k - 1] {
            let mut j = k as i32 - 2;
            while j >= 0 && value < a[j as usize] {
                a[(j + 1) as usize] = a[j as usize]; // Shift value
                idx[(j + 1) as usize] = idx[j as usize]; // Shift index
                j -= 1;
            }
            a[(j + 1) as usize] = value; // Write value
            idx[(j + 1) as usize] = i as i32; // Write index
        }
    }
}

pub fn silk_insertion_sort_increasing_all_values_int16(a: &mut [i16], l: usize) {
    for i in 1..l {
        let value = a[i];
        let mut j = i as i32 - 1;
        while j >= 0 && value < a[j as usize] {
            a[(j + 1) as usize] = a[j as usize];
            j -= 1;
        }
        a[(j + 1) as usize] = value;
    }
}

pub fn silk_insertion_sort_decreasing_int16(a: &mut [i16], idx: &mut [i32], l: usize, k: usize) {
    assert!(k > 0);
    assert!(l > 0);
    assert!(l >= k);

    // Write start indices in index vector
    for i in 0..k {
        idx[i] = i as i32;
    }

    // Sort vector elements by value, decreasing order
    for i in 1..k {
        let value = a[i];
        let mut j = i as i32 - 1;
        while j >= 0 && value > a[j as usize] {
            a[(j + 1) as usize] = a[j as usize]; // Shift value
            idx[(j + 1) as usize] = idx[j as usize]; // Shift index
            j -= 1;
        }
        a[(j + 1) as usize] = value; // Write value
        idx[(j + 1) as usize] = i as i32; // Write index
    }

    // If less than L values are asked for, check the remaining values,
    // but only spend CPU to ensure that the K first values are correct
    for i in k..l {
        let value = a[i];
        if value > a[k - 1] {
            let mut j = k as i32 - 2;
            while j >= 0 && value > a[j as usize] {
                a[(j + 1) as usize] = a[j as usize]; // Shift value
                idx[(j + 1) as usize] = idx[j as usize]; // Shift index
                j -= 1;
            }
            a[(j + 1) as usize] = value; // Write value
            idx[(j + 1) as usize] = i as i32; // Write index
        }
    }
}