unsafe-libopus 0.2.0

libopus transpiled to rust by c2rust
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

pub unsafe fn silk_insertion_sort_increasing(a: *mut i32, idx: *mut i32, L: i32, K: i32) {
    let mut value: i32 = 0;
    let mut i: i32 = 0;
    let mut j: i32 = 0;
    assert!(K > 0);
    assert!(L > 0);
    assert!(L >= K);
    i = 0;
    while i < K {
        *idx.offset(i as isize) = i;
        i += 1;
    }
    i = 1;
    while i < K {
        value = *a.offset(i as isize);
        j = i - 1;
        while j >= 0 && value < *a.offset(j as isize) {
            *a.offset((j + 1) as isize) = *a.offset(j as isize);
            *idx.offset((j + 1) as isize) = *idx.offset(j as isize);
            j -= 1;
        }
        *a.offset((j + 1) as isize) = value;
        *idx.offset((j + 1) as isize) = i;
        i += 1;
    }
    i = K;
    while i < L {
        value = *a.offset(i as isize);
        if value < *a.offset((K - 1) as isize) {
            j = K - 2;
            while j >= 0 && value < *a.offset(j as isize) {
                *a.offset((j + 1) as isize) = *a.offset(j as isize);
                *idx.offset((j + 1) as isize) = *idx.offset(j as isize);
                j -= 1;
            }
            *a.offset((j + 1) as isize) = value;
            *idx.offset((j + 1) as isize) = i;
        }
        i += 1;
    }
}

pub fn silk_insertion_sort_increasing_all_values_int16(a: &mut [i16]) {
    for i in 1..a.len() {
        let mut j = i;
        while j > 0 && a[j] < a[j - 1] {
            a.swap(j, j - 1);
            j -= 1;
        }
    }
}