Skip to content

Clarify which (arg)min/max index/value is returned #32

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Mar 14, 2019
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 26 additions & 2 deletions src/quantile.rs
Original file line number Diff line number Diff line change
Expand Up @@ -182,14 +182,18 @@ where
S: Data<Elem = A>,
D: Dimension,
{
/// Finds the first index of the minimum value of the array.
/// Finds the index of the minimum value of the array.
///
/// Returns `None` if any of the pairwise orderings tested by the function
/// are undefined. (For example, this occurs if there are any
/// floating-point NaN values in the array.)
///
/// Returns `None` if the array is empty.
///
/// Even if there are multiple (equal) elements that are minima, only one
/// index is returned. (Which one is returned is unspecified and may depend
/// on the memory layout of the array.)
///
/// # Example
///
/// ```
Expand All @@ -214,12 +218,20 @@ where
/// floating-point NaN values in the array.)
///
/// Additionally, returns `None` if the array is empty.
///
/// Even if there are multiple (equal) elements that are minima, only one
/// is returned. (Which one is returned is unspecified and may depend on
/// the memory layout of the array.)
fn min(&self) -> Option<&A>
where
A: PartialOrd;

/// Finds the elementwise minimum of the array, skipping NaN values.
///
/// Even if there are multiple (equal) elements that are minima, only one
/// is returned. (Which one is returned is unspecified and may depend on
/// the memory layout of the array.)
///
/// **Warning** This method will return a NaN value if none of the values
/// in the array are non-NaN values. Note that the NaN value might not be
/// in the array.
Expand All @@ -228,14 +240,18 @@ where
A: MaybeNan,
A::NotNan: Ord;

/// Finds the first index of the maximum value of the array.
/// Finds the index of the maximum value of the array.
///
/// Returns `None` if any of the pairwise orderings tested by the function
/// are undefined. (For example, this occurs if there are any
/// floating-point NaN values in the array.)
///
/// Returns `None` if the array is empty.
///
/// Even if there are multiple (equal) elements that are maxima, only one
/// index is returned. (Which one is returned is unspecified and may depend
/// on the memory layout of the array.)
///
/// # Example
///
/// ```
Expand All @@ -260,12 +276,20 @@ where
/// floating-point NaN values in the array.)
///
/// Additionally, returns `None` if the array is empty.
///
/// Even if there are multiple (equal) elements that are maxima, only one
/// is returned. (Which one is returned is unspecified and may depend on
/// the memory layout of the array.)
fn max(&self) -> Option<&A>
where
A: PartialOrd;

/// Finds the elementwise maximum of the array, skipping NaN values.
///
/// Even if there are multiple (equal) elements that are maxima, only one
/// is returned. (Which one is returned is unspecified and may depend on
/// the memory layout of the array.)
///
/// **Warning** This method will return a NaN value if none of the values
/// in the array are non-NaN values. Note that the NaN value might not be
/// in the array.
Expand Down
22 changes: 16 additions & 6 deletions tests/quantile.rs
Original file line number Diff line number Diff line change
@@ -1,12 +1,14 @@
#[macro_use(array)]
extern crate ndarray;
extern crate ndarray_stats;
extern crate quickcheck;

use ndarray::prelude::*;
use ndarray_stats::{
interpolate::{Higher, Linear, Lower, Midpoint, Nearest},
Quantile1dExt, QuantileExt,
};
use quickcheck::quickcheck;

#[test]
fn test_argmin() {
Expand All @@ -19,13 +21,17 @@ fn test_argmin() {
let a = array![[1., 5., 3.], [2., ::std::f64::NAN, 6.]];
assert_eq!(a.argmin(), None);

let a = array![[1, 0, 3], [2, 0, 6]];
assert_eq!(a.argmin(), Some((0, 1)));

let a: Array2<i32> = array![[], []];
assert_eq!(a.argmin(), None);
}

quickcheck! {
fn argmin_matches_min(data: Vec<f32>) -> bool {
let a = Array1::from(data);
a.argmin().map(|i| a[i]) == a.min().cloned()
}
}

#[test]
fn test_min() {
let a = array![[1, 5, 3], [2, 0, 6]];
Expand Down Expand Up @@ -64,13 +70,17 @@ fn test_argmax() {
let a = array![[1., 5., 3.], [2., ::std::f64::NAN, 6.]];
assert_eq!(a.argmax(), None);

let a = array![[1, 5, 6], [2, 0, 6]];
assert_eq!(a.argmax(), Some((0, 2)));

let a: Array2<i32> = array![[], []];
assert_eq!(a.argmax(), None);
}

quickcheck! {
fn argmax_matches_max(data: Vec<f32>) -> bool {
let a = Array1::from(data);
a.argmax().map(|i| a[i]) == a.max().cloned()
}
}

#[test]
fn test_max() {
let a = array![[1, 5, 7], [2, 0, 6]];
Expand Down