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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
use std::cmp::Ordering;
use num_traits::{Float, FromPrimitive};
/// The result of a call to `nanminmax`.
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum NanMinMaxResult<T> {
/// The iterator contains multiple distinct float; the minimum and maximum are returned.
MinMax(T, T),
/// The iterator contains exactly one distict float, after optionally ignoring NaNs.
OneElement(T),
/// The iterator was empty, or was empty after ignoring NaNs.
NoElements,
/// The iterator contains at least one NaN value, and NaNs were not ignored.
///
/// This is unreachable if `nanminmax` was called with `ignore_nans: true`.
NaN,
}
// Helper function used by nanmin and nanmax.
fn nan_reduce<I, T, F>(iter: I, ignore_nans: bool, f: F) -> T
where
I: Iterator<Item = T>,
T: Float + FromPrimitive,
F: Fn(T, T) -> T,
{
iter.reduce(|acc, x| {
if ignore_nans && x.is_nan() {
acc
} else if x.is_nan() || acc.is_nan() {
T::nan()
} else {
f(acc, x)
}
})
.unwrap_or_else(T::nan)
}
/// Helper trait for calculating summary statistics on floating point iterators with alternative NaN handling.
///
/// This is intended to be similar to numpy's `nanmean`, `nanmin`, `nanmax` etc.
pub trait FloatIterExt<T: Float + FromPrimitive>: Iterator<Item = T> {
/// Returns the minimum of all elements in the iterator, handling NaN values.
///
/// If `ignore_nans` is true, NaN values will be ignored and
/// not included in the minimum.
/// Otherwise, the minimum will be NaN if any element is NaN.
///
/// # Examples
///
/// ## Simple usage
///
/// ```rust
/// use augurs_core::FloatIterExt;
///
/// let x = [1.0, 2.0, 3.0, f64::NAN, 5.0];
/// assert_eq!(x.iter().copied().nanmin(true), 1.0);
/// assert!(x.iter().copied().nanmin(false).is_nan());
/// ```
///
/// ## Empty iterator
///
/// ```rust
/// use augurs_core::FloatIterExt;
///
/// let x: [f64; 0] = [];
/// assert!(x.iter().copied().nanmin(true).is_nan());
/// assert!(x.iter().copied().nanmin(false).is_nan());
/// ```
///
/// ## Only NaN values
///
/// ```rust
/// use augurs_core::FloatIterExt;
///
/// let x = [f64::NAN, f64::NAN];
/// assert!(x.iter().copied().nanmin(true).is_nan());
/// assert!(x.iter().copied().nanmin(false).is_nan());
/// ```
fn nanmin(self, ignore_nans: bool) -> T
where
Self: Sized,
{
nan_reduce(self, ignore_nans, T::min)
}
/// Returns the maximum of all elements in the iterator, handling NaN values.
///
/// If `ignore_nans` is true, NaN values will be ignored and
/// not included in the maximum.
/// Otherwise, the maximum will be NaN if any element is NaN.
///
/// # Examples
///
/// ## Simple usage
///
/// ```rust
/// use augurs_core::FloatIterExt;
///
/// let x = [1.0, 2.0, 3.0, f64::NAN, 5.0];
/// assert_eq!(x.iter().copied().nanmax(true), 5.0);
/// assert!(x.iter().copied().nanmax(false).is_nan());
/// ```
///
/// ## Empty iterator
///
/// ```rust
/// use augurs_core::FloatIterExt;
///
/// let x: [f64; 0] = [];
/// assert!(x.iter().copied().nanmax(true).is_nan());
/// assert!(x.iter().copied().nanmax(false).is_nan());
/// ```
///
/// ## Only NaN values
///
/// ```rust
/// use augurs_core::FloatIterExt;
///
/// let x = [f64::NAN, f64::NAN];
/// assert!(x.iter().copied().nanmax(true).is_nan());
/// assert!(x.iter().copied().nanmax(false).is_nan());
/// ```
fn nanmax(self, ignore_nans: bool) -> T
where
Self: Sized,
{
nan_reduce(self, ignore_nans, T::max)
}
/// Returns the minimum and maximum of all elements in the iterator,
/// handling NaN values.
///
/// If `ignore_nans` is true, NaN values will be ignored and
/// not included in the minimum or maximum.
/// Otherwise, the minimum and maximum will be NaN if any element is NaN.
///
/// The return value is a [`NanMinMaxResult`], which is similar to
/// [`itertools::MinMaxResult`](https://docs.rs/itertools/latest/itertools/enum.MinMaxResult.html)
/// and provides more granular information on the result.
///
/// # Examples
///
/// ## Simple usage, ignoring NaNs
///
/// ```
/// use augurs_core::{FloatIterExt, NanMinMaxResult};
///
/// let x = [1.0, 2.0, 3.0, f64::NAN, 5.0];
/// let min_max = x.iter().copied().nanminmax(true);
/// assert_eq!(min_max, NanMinMaxResult::MinMax(1.0, 5.0));
/// ```
///
/// ## Simple usage, including NaNs
///
/// ```
/// use augurs_core::{FloatIterExt, NanMinMaxResult};
///
/// let x = [1.0, 2.0, 3.0, f64::NAN, 5.0];
/// let min_max = x.iter().copied().nanminmax(false);
/// assert_eq!(min_max, NanMinMaxResult::NaN);
/// ```
///
/// ## Only NaNs
///
/// ```
/// use augurs_core::{FloatIterExt, NanMinMaxResult};
///
/// let x = [f64::NAN, f64::NAN, f64::NAN];
/// let min_max = x.iter().copied().nanminmax(true);
/// assert_eq!(min_max, NanMinMaxResult::NoElements);
///
/// let min_max = x.iter().copied().nanminmax(false);
/// assert_eq!(min_max, NanMinMaxResult::NaN);
/// ```
///
/// ## Empty iterator
///
/// ```
/// use augurs_core::{FloatIterExt, NanMinMaxResult};
///
/// let x: [f64; 0] = [];
/// let min_max = x.iter().copied().nanminmax(true);
/// assert_eq!(min_max, NanMinMaxResult::NoElements);
///
/// let min_max = x.iter().copied().nanminmax(false);
/// assert_eq!(min_max, NanMinMaxResult::NoElements);
/// ```
///
/// ## Only one distinct element
///
/// ```
/// use augurs_core::{FloatIterExt, NanMinMaxResult};
///
/// let x = [1.0, f64::NAN, 1.0];
/// let min_max = x.iter().copied().nanminmax(true);
/// assert_eq!(min_max, NanMinMaxResult::OneElement(1.0));
///
/// let min_max = x.iter().copied().nanminmax(false);
/// assert_eq!(min_max, NanMinMaxResult::NaN);
/// ```
fn nanminmax(self, ignore_nans: bool) -> NanMinMaxResult<T>
where
Self: Sized,
{
let mut acc = NanMinMaxResult::NoElements;
for x in self {
let is_nan = x.is_nan();
if is_nan && !ignore_nans {
return NanMinMaxResult::NaN;
}
if is_nan {
continue;
}
// From here on, we're ignoring NaNs.
acc = match acc {
NanMinMaxResult::NoElements => NanMinMaxResult::OneElement(x),
NanMinMaxResult::OneElement(one) => {
match one.partial_cmp(&x).expect("x should not be NaN") {
Ordering::Equal => acc,
Ordering::Less => NanMinMaxResult::MinMax(one, x),
Ordering::Greater => NanMinMaxResult::MinMax(x, one),
}
}
NanMinMaxResult::MinMax(min, max) => {
NanMinMaxResult::MinMax(min.min(x), max.max(x))
}
// This case is unreachable because we return early for NaN values when ignore_nans is false
NanMinMaxResult::NaN => {
unreachable!("NaN case should have been handled by early return")
}
};
}
acc
}
/// Returns the mean of all elements in the iterator, handling NaN values.
///
/// If `ignore_nans` is true, NaN values will be ignored and
/// not included in the mean.
/// Otherwise, the mean will be NaN if any element is NaN.
///
/// # Examples
///
/// ## Simple usage
///
/// ```rust
/// use augurs_core::FloatIterExt;
///
/// let x = [1.0, 2.0, 3.0, f64::NAN, 4.0];
/// assert_eq!(x.iter().copied().nanmean(true), 2.5);
/// assert!(x.iter().copied().nanmean(false).is_nan());
/// ```
///
/// ## Empty iterator
///
/// ```rust
/// use augurs_core::FloatIterExt;
///
/// let x: [f64; 0] = [];
/// assert!(x.iter().copied().nanmean(true).is_nan());
/// assert!(x.iter().copied().nanmean(false).is_nan());
/// ```
///
/// ## Only NaN values
///
/// ```rust
/// use augurs_core::FloatIterExt;
///
/// let x = [f64::NAN, f64::NAN];
/// assert!(x.iter().copied().nanmean(true).is_nan());
/// assert!(x.iter().copied().nanmean(false).is_nan());
/// ```
fn nanmean(self, ignore_nans: bool) -> T
where
Self: Sized,
{
let (n, sum) = self.fold((0, T::zero()), |(n, sum), x| {
if ignore_nans && x.is_nan() {
(n, sum)
} else if x.is_nan() || sum.is_nan() {
(n, T::nan())
} else {
(n + 1, sum + x)
}
});
if n == 0 {
T::nan()
} else if sum.is_nan() {
sum
} else {
sum / T::from_usize(n).unwrap_or_else(|| T::nan())
}
}
}
impl<T: Float + FromPrimitive, I: Iterator<Item = T>> FloatIterExt<T> for I {}
#[cfg(test)]
mod test {
use super::*;
#[test]
fn empty() {
let x: &[f64] = &[];
assert!(x.iter().copied().nanmin(true).is_nan());
assert!(x.iter().copied().nanmax(true).is_nan());
}
#[test]
fn no_nans() {
let x: &[f64] = &[-3.0, -2.0, -1.0, 0.0, 1.0, 2.0, 3.0];
assert_eq!(x.iter().copied().nanmin(true), -3.0);
assert_eq!(x.iter().copied().nanmax(true), 3.0);
assert_eq!(x.iter().copied().nanmin(false), -3.0);
assert_eq!(x.iter().copied().nanmax(false), 3.0);
}
#[test]
fn nans() {
let x: &[f64] = &[-3.0, -2.0, -1.0, f64::NAN, 1.0, 2.0, 3.0];
assert_eq!(x.iter().copied().nanmin(true), -3.0);
assert_eq!(x.iter().copied().nanmax(true), 3.0);
assert!(x.iter().copied().nanmin(false).is_nan());
assert!(x.iter().copied().nanmax(false).is_nan());
}
#[test]
fn nanmean() {
let x: &[f64] = &[-3.0, -2.0, -1.0, 0.0, 1.0, 2.0, 3.0];
assert_eq!(x.iter().copied().nanmean(true), 0.0);
let y: &[f64] = &[-3.0, -2.0, -1.0, f64::NAN, 1.0, 2.0, 3.0];
assert_eq!(y.iter().copied().nanmean(true), 0.0);
assert!(y.iter().copied().nanmean(false).is_nan());
let z: &[f64] = &[f64::NAN, f64::NAN];
assert!(z.iter().copied().nanmean(true).is_nan());
}
#[test]
fn nanminmax() {
let x: &[f64] = &[-3.0, -2.0, -1.0, 0.0, 1.0, 2.0, 3.0];
assert_eq!(
x.iter().copied().nanminmax(true),
NanMinMaxResult::MinMax(-3.0, 3.0)
);
assert_eq!(
x.iter().copied().nanminmax(false),
NanMinMaxResult::MinMax(-3.0, 3.0)
);
let y: &[f64] = &[-3.0, -2.0, -1.0, f64::NAN, 1.0, 2.0, 3.0];
assert_eq!(
y.iter().copied().nanminmax(true),
NanMinMaxResult::MinMax(-3.0, 3.0)
);
assert_eq!(y.iter().copied().nanminmax(false), NanMinMaxResult::NaN);
let z: &[f64] = &[f64::NAN, f64::NAN];
assert_eq!(
z.iter().copied().nanminmax(true),
NanMinMaxResult::NoElements
);
assert_eq!(z.iter().copied().nanminmax(false), NanMinMaxResult::NaN);
let e: &[f64] = &[];
assert_eq!(
e.iter().copied().nanminmax(true),
NanMinMaxResult::NoElements
);
assert_eq!(
e.iter().copied().nanminmax(false),
NanMinMaxResult::NoElements
);
let o: &[f64] = &[1.0, f64::NAN, 1.0];
assert_eq!(
o.iter().copied().nanminmax(true),
NanMinMaxResult::OneElement(1.0),
);
assert_eq!(o.iter().copied().nanminmax(false), NanMinMaxResult::NaN);
}
}