classify 0.2.2

A collection of algorithms for categorizing 1D data
Documentation 
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

use crate::Bin;
use serde::{Deserialize, Serialize};
use wasm_bindgen::prelude::*;

#[derive(Serialize, Deserialize)]
pub struct JSBin {
    pub bin_start: f64,
    pub bin_end: f64,
    pub count: u64,
}

impl PartialEq for JSBin {
    fn eq(&self, other: &Self) -> bool {
        let starts_eq: bool = self.bin_start == other.bin_start;
        let ends_eq: bool = self.bin_end == other.bin_end;
        let counts_eq: bool = self.count == other.count;
        starts_eq && ends_eq && counts_eq
    }
}

#[derive(Serialize, Deserialize)]
pub struct JSClassification(Vec<JSBin>);

impl PartialEq for JSClassification {
    fn eq(&self, other: &Self) -> bool {
        let JSClassification(self_bins) = self;
        let JSClassification(other_bins) = other;

        self_bins == other_bins
    }
}

impl From<Vec<Bin>> for JSClassification {
    fn from(classification: Vec<Bin>) -> Self {
        JSClassification(classification.iter().map(|bin| JSBin::from(bin)).collect())
    }
}

impl From<JSClassification> for Vec<Bin> {
    fn from(jsclassification: JSClassification) -> Self {
        let JSClassification(jsbins) = jsclassification;
        let mut result: Vec<Bin> = vec![];

        for bin in jsbins {
            result.push(Bin {
                bin_start: bin.bin_start,
                bin_end: bin.bin_end,
                count: bin.count,
            });
        }

        result
    }
}

impl From<&JSClassification> for Vec<Bin> {
    fn from(jsclassification: &JSClassification) -> Self {
        let JSClassification(jsbins) = jsclassification;
        let mut result: Vec<Bin> = vec![];

        for bin in jsbins {
            result.push(Bin {
                bin_start: bin.bin_start,
                bin_end: bin.bin_end,
                count: bin.count,
            });
        }

        result
    }
}

impl From<&Bin> for JSBin {
    fn from(bin: &Bin) -> Self {
        JSBin {
            bin_start: bin.bin_start,
            bin_end: bin.bin_end,
            count: bin.count,
        }
    }
}

#[wasm_bindgen]
pub fn breaks_to_classification(breaks: &[f64], data: &[f64]) -> JsValue {
    let class: JSClassification =
        crate::utilities::breaks_to_classification(&breaks.to_vec(), data).into();
    JsValue::from_serde(&class).unwrap()
}

#[wasm_bindgen]
pub fn classify_val(val: f64, class: &JsValue) -> Option<usize> {
    let class: JSClassification = class.into_serde().unwrap();
    let bin: Option<usize> = crate::utilities::classify_val(val, &(class.into()));
    bin
}

#[wasm_bindgen]
pub fn get_jenks_breaks(no_bins: usize, data: &[f64]) -> Box<[f64]> {
    let breaks = crate::jenks::get_jenks_breaks(no_bins, data);
    breaks.into_boxed_slice()
}

#[wasm_bindgen]
pub fn get_jenks_classification(no_bins: usize, data: &[f64]) -> JsValue {
    let class: JSClassification = crate::jenks::get_jenks_classification(no_bins, data).into();
    JsValue::from_serde(&class).unwrap()
}

#[wasm_bindgen]
pub fn get_quantile_breaks(no_bins: usize, data: &[f64]) -> Box<[f64]> {
    let breaks = crate::quantile::get_quantile_breaks(no_bins, data);
    breaks.into_boxed_slice()
}

#[wasm_bindgen]
pub fn get_quantile_classification(no_bins: usize, data: &[f64]) -> JsValue {
    let class: JSClassification =
        crate::quantile::get_quantile_classification(no_bins, data).into();
    JsValue::from_serde(&class).unwrap()
}

#[wasm_bindgen]
pub fn get_head_tail_breaks(data: &[f64]) -> Box<[f64]> {
    let breaks = crate::head_tail::get_head_tail_breaks(data);
    breaks.into_boxed_slice()
}

#[wasm_bindgen]
pub fn get_head_tail_classification(data: &[f64]) -> JsValue {
    let class: JSClassification = crate::head_tail::get_head_tail_classification(data).into();
    JsValue::from_serde(&class).unwrap()
}

#[wasm_bindgen]
pub fn get_equal_interval_breaks(no_bins: usize, data: &[f64]) -> Box<[f64]> {
    let breaks = crate::equal_interval::get_equal_interval_breaks(no_bins, data);
    breaks.into_boxed_slice()
}

#[wasm_bindgen]
pub fn get_equal_interval_classification(no_bins: usize, data: &[f64]) -> JsValue {
    let class: JSClassification =
        crate::equal_interval::get_equal_interval_classification(no_bins, data).into();
    JsValue::from_serde(&class).unwrap()
}

#[wasm_bindgen]
pub fn get_st_dev_breaks(bin_size: f64, data: &[f64]) -> Box<[f64]> {
    let breaks = crate::standard_deviation::get_st_dev_breaks(bin_size, data);
    breaks.into_boxed_slice()
}

#[wasm_bindgen]
pub fn get_st_dev_classification(bin_size: f64, data: &[f64]) -> JsValue {
    let class: JSClassification =
        crate::standard_deviation::get_st_dev_classification(bin_size, data).into();
    JsValue::from_serde(&class).unwrap()
}

#[wasm_bindgen]
pub fn get_hinge_breaks(hinge_coefficient: f64, data: &[f64]) -> Box<[f64]> {
    let breaks = crate::hinge::get_hinge_breaks(hinge_coefficient, data);
    breaks.into_boxed_slice()
}

#[wasm_bindgen]
pub fn get_hinge_classification(hinge_coefficient: f64, data: &[f64]) -> JsValue {
    let class: JSClassification =
        crate::hinge::get_hinge_classification(hinge_coefficient, data).into();
    JsValue::from_serde(&class).unwrap()
}