pub fn get_equal_interval_classification<T: ToPrimitive>(
    num_bins: usize,
    data: &[T]
) -> Classification
Expand description

Returns a Classification object following the Equal Interval Breaks algorithm given the desired number of bins and one-dimensional data

Arguments

  • num_bins - An integer (usize) representing the desired number of bins
  • data - A reference to a collection of unsorted data points to generate a Classification for

Edge cases

  • Inputting large u64/i64 data (near their max values) will result in loss of precision because data is being cast to f64
  • If there is a wide enoguh gap in the data, this algorithm may produce one or more empty bins

Examples

use classify::get_equal_interval_classification;
use classify::{Classification, Bin};

let data: Vec<f32> = vec![0.0, 0.5, 1.0, 1.5, 2.5, 3.0];
let num_bins = 3;

let result: Classification = get_equal_interval_classification(num_bins, &data);
let expected: Classification = vec![
    Bin{bin_start: 0.0, bin_end: 1.0, count: 2},
    Bin{bin_start: 1.0, bin_end: 2.0, count: 2},
    Bin{bin_start: 2.0, bin_end: 3.0, count: 2}
];

assert!(result == expected);