use super::greedy::is_consistent_pair;
pub fn zheng_keep_mask(
lats: &[f64],
lngs: &[f64],
times: &[f64],
max_speed_kmh: f64,
min_seg_size: usize,
) -> Vec<bool> {
let n = lats.len();
let mut keep = vec![false; n];
if n <= 1 {
keep.fill(true);
return keep;
}
let mut range_start = 0usize;
let mut segment_size = 1usize;
for i in 1..n {
if is_consistent_pair(lats, lngs, times, i - 1, i, max_speed_kmh) {
segment_size += 1;
} else {
if segment_size > min_seg_size {
keep[range_start..i].fill(true);
}
range_start = i;
segment_size = 1;
}
}
if segment_size > min_seg_size {
keep[range_start..n].fill(true);
}
keep
}
#[cfg(test)]
mod tests {
use super::*;
fn times_seq(n: usize) -> Vec<f64> {
(0..n).map(|i| i as f64 * 3600.0).collect()
}
#[test]
fn drops_short_segments_and_keeps_long_ones() {
let mut lats: Vec<f64> = (0..4).map(|i| i as f64 * 0.001).collect();
lats.push(5.0); lats.extend((0..3).map(|i| 0.004 + i as f64 * 0.001));
let lngs = vec![0.0; lats.len()];
let times = times_seq(lats.len());
let keep = zheng_keep_mask(&lats, &lngs, ×, 10.0, 1);
assert_eq!(keep, vec![true, true, true, true, false, true, true, true]);
}
#[test]
fn min_seg_size_drops_a_run_at_or_below_threshold() {
let lats = vec![0.0, 0.001, 5.0, 5.001];
let lngs = vec![0.0; 4];
let times = times_seq(4);
let keep = zheng_keep_mask(&lats, &lngs, ×, 10.0, 2);
assert_eq!(keep, vec![false, false, false, false]);
}
#[test]
fn trivial_sequences_always_kept() {
assert_eq!(zheng_keep_mask(&[], &[], &[], 10.0, 1), Vec::<bool>::new());
assert_eq!(zheng_keep_mask(&[0.0], &[0.0], &[0.0], 10.0, 1), vec![true]);
}
}