sassy 0.2.1

Approximate string matching using SIMD
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

#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum TracePostProcess {
    All,
    LocalMinima,
}

/// Find indices of local minima in a list of (position, cost) pairs
#[inline(always)]
pub fn local_minima_indices(positions_and_costs: &[(isize, isize)], out_indices: &mut Vec<usize>) {
    out_indices.clear();
    if positions_and_costs.is_empty() {
        return;
    }
    let mut prev_pos = positions_and_costs[0].0;
    let mut prev_cost = positions_and_costs[0].1;
    let mut prev_idx = 0usize;
    let mut last_trend: i8 = 2; // 2 = none, -1 = down/flat, 0 = flat, 1 = up

    for (idx, &(pos, cost)) in positions_and_costs.iter().enumerate().skip(1) {
        if pos - prev_pos > 1 {
            if last_trend != 1 {
                out_indices.push(prev_idx);
            }
            last_trend = 2;
            prev_cost = cost;
            prev_idx = idx;
            prev_pos = pos;
            continue;
        }

        let increasing = cost > prev_cost;
        let decreasing = cost < prev_cost;
        let equal = cost == prev_cost;

        if increasing && last_trend != 1 {
            out_indices.push(prev_idx);
            last_trend = 1;
        } else if decreasing {
            last_trend = -1;
        } else if equal && last_trend == 2 {
            last_trend = 0;
        }

        prev_cost = cost;
        prev_idx = idx;
        prev_pos = pos;
    }

    if last_trend != 1 {
        out_indices.push(prev_idx);
    }
}