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
//! Finite differences and moving averages.
use core::ops::{Add, Div, Mul, Sub};
use crate::Vec1;
impl<T> Vec1<T>
where
T: Copy + Add<Output = T> + Sub<Output = T> + Default,
{
/// Forward finite difference: `diff[i] = v[i+1] - v[i]`.
///
/// ```rust
/// use one_indexed_vec::vec1;
/// let v = vec1![1, 3, 6, 10];
/// assert_eq!(v.finite_difference().as_slice(), &[2, 3, 4]);
/// ```
#[inline]
pub fn finite_difference(&self) -> Vec1<T> {
if self.len() < 2 {
return Vec1::new();
}
let mut out = Vec1::with_capacity(self.len() - 1);
for i in 1..self.len() {
out.push(self[i + 1] - self[i]);
}
out
}
/// Second finite difference: `v[i+2] - 2·v[i+1] + v[i]`.
///
/// ```rust
/// use one_indexed_vec::vec1;
/// let v = vec1![1, 4, 9, 16, 25];
/// assert_eq!(v.second_finite_difference().as_slice(), &[2, 2, 2]);
/// ```
#[inline]
pub fn second_finite_difference(&self) -> Vec1<T> {
if self.len() < 3 {
return Vec1::new();
}
let mut out = Vec1::with_capacity(self.len() - 2);
for i in 1..=self.len() - 2 {
out.push(self[i + 2] - self[i + 1] - self[i + 1] + self[i]);
}
out
}
}
impl<T> Vec1<T>
where
T: Copy
+ Add<Output = T>
+ Mul<Output = T>
+ Sub<Output = T>
+ Div<Output = T>
+ Default
+ From<u8>,
{
/// Central finite difference: `(v[i+1] - v[i-1]) / 2`.
///
/// ```rust
/// use one_indexed_vec::{vec1, Vec1};
/// let v: Vec1<f64> = vec1![1.0, 4.0, 9.0, 16.0, 25.0];
/// assert_eq!(v.central_difference().as_slice(), &[4.0, 6.0, 8.0]);
/// ```
#[inline]
pub fn central_difference(&self) -> Vec1<T> {
if self.len() < 3 {
return Vec1::new();
}
let two = T::from(2u8);
let mut out = Vec1::with_capacity(self.len() - 2);
for i in 2..self.len() {
out.push((self[i + 1] - self[i - 1]) / two);
}
out
}
/// Forward difference with a custom step `h`: `(v[i+1] - v[i]) / h`.
#[inline]
pub fn finite_difference_step(&self, h: T) -> Vec1<T> {
if self.len() < 2 {
return Vec1::new();
}
let mut out = Vec1::with_capacity(self.len() - 1);
for i in 1..self.len() {
out.push((self[i + 1] - self[i]) / h);
}
out
}
}
#[cfg(test)]
mod tests {
use crate::vec1;
#[test]
fn finite_difference_basic() {
assert_eq!(vec1![1, 3, 6, 10].finite_difference().as_slice(), &[2, 3, 4]);
}
#[test]
fn second_finite_difference_basic() {
assert_eq!(vec1![1, 4, 9, 16, 25].second_finite_difference().as_slice(), &[2, 2, 2]);
}
#[test]
fn central_difference_basic() {
let v = vec1![1.0, 4.0, 9.0, 16.0, 25.0];
assert_eq!(v.central_difference().as_slice(), &[4.0, 6.0, 8.0]);
}
}