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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
//! Missing-value fill and interpolation.
use crate::Vec1;
#[cfg(not(feature = "std"))]
use alloc::vec::Vec;
impl<T> Vec1<T>
where
T: Copy + PartialEq + Default,
{
/// Forward fill missing values (`T::default()`).
///
/// ```rust
/// use one_indexed_vec::vec1;
/// let v = vec1![1, 0, 0, 2, 0, 3];
/// assert_eq!(v.forward_fill().as_slice(), &[1, 1, 1, 2, 2, 3]);
/// ```
#[inline]
pub fn forward_fill(&self) -> Vec1<T> {
let mut out = Vec1::with_capacity(self.len());
let mut last = T::default();
let mut found = false;
for i in 1..=self.len() {
if self[i] != T::default() {
last = self[i];
found = true;
}
out.push(if found { last } else { self[i] });
}
out
}
/// Backward fill missing values (`T::default()`).
///
/// ```rust
/// use one_indexed_vec::vec1;
/// let v = vec1![1, 0, 0, 2, 0, 3];
/// assert_eq!(v.backward_fill().as_slice(), &[1, 2, 2, 2, 3, 3]);
/// ```
#[inline]
pub fn backward_fill(&self) -> Vec1<T> {
if self.is_empty() {
return Vec1::new();
}
let mut out = Vec1::with_capacity(self.len());
let mut next = T::default();
let mut found = false;
for i in (1..=self.len()).rev() {
if self[i] != T::default() {
next = self[i];
found = true;
}
out.push(if found { next } else { self[i] });
}
out.reverse();
out
}
}
impl<T> Vec1<T>
where
T: Copy + PartialEq + Default + Into<f64>,
{
/// Linear interpolation of missing values (`T::default()`), returns `f64`.
///
/// ```rust
/// use one_indexed_vec::vec1;
/// let v = vec1![1.0f64, 0.0, 0.0, 4.0];
/// let r = v.linear_interpolate();
/// assert!((r[1] - 1.0).abs() < 1e-10);
/// assert!((r[2] - 2.0).abs() < 1e-10);
/// assert!((r[3] - 3.0).abs() < 1e-10);
/// assert!((r[4] - 4.0).abs() < 1e-10);
/// ```
#[inline]
pub fn linear_interpolate(&self) -> Vec1<f64> {
if self.is_empty() {
return Vec1::new();
}
let mut known: Vec<(usize, f64)> = Vec::new();
for i in 1..=self.len() {
if self[i] != T::default() {
known.push((i, self[i].into()));
}
}
let mut out = Vec1::with_capacity(self.len());
for _ in 1..=self.len() {
out.push(0.0);
}
if known.is_empty() {
return out;
}
if known.len() == 1 {
let v = known[0].1;
for i in 1..=self.len() {
out[i] = v;
}
return out;
}
let (fi, fv) = known[0];
for i in 1..fi {
out[i] = fv;
}
out[fi] = fv;
for w in known.windows(2) {
let (i1, v1) = w[0];
let (i2, v2) = w[1];
for i in i1..=i2 {
let frac = (i - i1) as f64 / (i2 - i1) as f64;
out[i] = v1 + frac * (v2 - v1);
}
}
let (li, lv) = known[known.len() - 1];
for i in li..=self.len() {
out[i] = lv;
}
out
}
}
#[cfg(test)]
mod tests {
use crate::vec1;
#[test]
fn forward_fill_basic() {
let v = vec1![1, 0, 0, 2, 0, 3];
assert_eq!(v.forward_fill().as_slice(), &[1, 1, 1, 2, 2, 3]);
}
#[test]
fn backward_fill_basic() {
let v = vec1![1, 0, 0, 2, 0, 3];
assert_eq!(v.backward_fill().as_slice(), &[1, 2, 2, 2, 3, 3]);
}
#[test]
fn linear_interpolate_basic() {
let v = vec1![1.0, 0.0, 0.0, 4.0];
let r = v.linear_interpolate();
assert!((r[1] - 1.0).abs() < 1e-10);
assert!((r[2] - 2.0).abs() < 1e-10);
assert!((r[3] - 3.0).abs() < 1e-10);
assert!((r[4] - 4.0).abs() < 1e-10);
}
#[test]
fn forward_fill_all_missing() {
let v = vec1![0, 0, 0];
assert_eq!(v.forward_fill().as_slice(), &[0, 0, 0]);
}
}