2020-12-07 05:22:30 +00:00
|
|
|
// Get two non-overlapping ranges starting at i & j, both with length len
|
|
|
|
pub fn get_both_ranges<T>(
|
|
|
|
vector: &mut Vec<T>,
|
|
|
|
i: usize,
|
|
|
|
j: usize,
|
|
|
|
len: usize,
|
|
|
|
) -> (&mut [T], &mut [T]) {
|
|
|
|
debug_assert_ne!(i, j);
|
|
|
|
debug_assert!(i + len <= vector.len());
|
|
|
|
debug_assert!(j + len <= vector.len());
|
|
|
|
if i < j {
|
|
|
|
debug_assert!(i + len <= j);
|
|
|
|
let (first, last) = vector.split_at_mut(j);
|
|
|
|
return (&mut first[i..(i + len)], &mut last[0..len]);
|
|
|
|
} else {
|
|
|
|
debug_assert!(j + len <= i);
|
|
|
|
let (first, last) = vector.split_at_mut(i);
|
|
|
|
return (&mut last[0..len], &mut first[j..(j + len)]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-02-13 06:11:19 +00:00
|
|
|
pub fn get_both_indices<T>(vector: &mut Vec<T>, i: usize, j: usize) -> (&mut T, &mut T) {
|
2019-02-18 18:34:43 +00:00
|
|
|
debug_assert_ne!(i, j);
|
|
|
|
debug_assert!(i < vector.len());
|
|
|
|
debug_assert!(j < vector.len());
|
2019-02-13 06:11:19 +00:00
|
|
|
if i < j {
|
|
|
|
let (first, last) = vector.split_at_mut(j);
|
2019-03-28 21:13:19 +00:00
|
|
|
return (&mut first[i], &mut last[0]);
|
|
|
|
} else {
|
2019-02-13 06:11:19 +00:00
|
|
|
let (first, last) = vector.split_at_mut(i);
|
2019-03-28 21:13:19 +00:00
|
|
|
return (&mut last[0], &mut first[j]);
|
2019-02-13 06:11:19 +00:00
|
|
|
}
|
2019-03-28 21:13:19 +00:00
|
|
|
}
|