trs_dataframe/dataframe/column_store/
from.rs

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
use data_value::DataValue;
use halfbrown::HashMap;
use ndarray::Array2;

use crate::{Key, MLChefMap};

use super::{ColumnFrame, KeyIndex};

/// NOTE: Because of randomnes of the key order in the hashmap, the order of
/// the keys are sorted!
impl From<Vec<std::collections::HashMap<Key, DataValue>>> for ColumnFrame {
    fn from(dataframe: Vec<std::collections::HashMap<Key, DataValue>>) -> Self {
        let mut keys = dataframe
            .iter()
            .flat_map(|x| x.keys())
            .cloned()
            .collect::<Vec<_>>();
        keys.sort();
        let index = KeyIndex::new(keys);
        let mut data_frame = Array2::default((dataframe.len(), index.len()));
        for (idx, row) in dataframe.iter().enumerate() {
            for (key, value) in row.iter() {
                if let Some(column) = index.get_column_index(key) {
                    if let Some(x) = data_frame.get_mut((idx, column)) {
                        *x = value.clone();
                    }
                }
            }
        }
        Self::new(index, data_frame)
    }
}

/// NOTE: Because of randomnes of the key order in the hashmap, the order of
/// the keys are sorted!
impl From<Vec<HashMap<Key, DataValue>>> for ColumnFrame {
    fn from(dataframe: Vec<HashMap<Key, DataValue>>) -> Self {
        let mut keys = dataframe
            .iter()
            .flat_map(|x| x.keys())
            .cloned()
            .collect::<Vec<_>>();
        keys.sort();
        let index = KeyIndex::new(keys);
        let mut data_frame = Array2::default((dataframe.len(), index.len()));
        for (idx, row) in dataframe.iter().enumerate() {
            for (key, value) in row.iter() {
                if let Some(column) = index.get_column_index(key) {
                    if let Some(x) = data_frame.get_mut((idx, column)) {
                        *x = value.clone();
                    }
                }
            }
        }
        Self::new(index, data_frame)
    }
}

/// NOTE: Because of randomnes of the key order in the hashmap, the order of
/// the keys are sorted!
impl From<std::collections::HashMap<String, Vec<DataValue>>> for ColumnFrame {
    fn from(dataframe: std::collections::HashMap<String, Vec<DataValue>>) -> Self {
        let mut keys = dataframe
            .keys()
            .map(|x| x.as_str().into())
            .collect::<Vec<_>>();
        keys.sort();
        let index = KeyIndex::new(keys);
        let size = dataframe
            .values()
            .map(|x| x.len())
            .max()
            .unwrap_or_default();
        let mut data_frame = Array2::default((size, index.len()));
        for (key, value) in dataframe.into_iter() {
            let key = key.as_str().into();
            for (idx, value) in value.into_iter().enumerate() {
                if let Some(column) = index.get_column_index(&key) {
                    if let Some(x) = data_frame.get_mut((idx, column)) {
                        *x = value.clone();
                    }
                }
            }
        }
        Self::new(index, data_frame)
    }
}

impl From<MLChefMap> for ColumnFrame {
    fn from(dataframe: MLChefMap) -> Self {
        let mut keys = dataframe
            .keys()
            .map(|x| x.as_str().into())
            .collect::<Vec<_>>();
        keys.sort();
        let index = KeyIndex::new(keys);
        let size = dataframe
            .values()
            .map(|x| x.len())
            .max()
            .unwrap_or_default();
        let mut data_frame = Array2::default((size, index.len()));
        for (key, value) in dataframe.into_iter() {
            let key = key.as_str().into();
            for (idx, value) in value.into_iter().enumerate() {
                if let Some(column) = index.get_column_index(&key) {
                    if let Some(x) = data_frame.get_mut((idx, column)) {
                        *x = value.clone();
                    }
                }
            }
        }
        Self::new(index, data_frame)
    }
}

impl From<Vec<(Key, Vec<DataValue>)>> for ColumnFrame {
    fn from(dataframe: Vec<(Key, Vec<DataValue>)>) -> Self {
        let keys = dataframe
            .iter()
            .map(|(key, _)| key.clone())
            .collect::<Vec<_>>();
        let index = KeyIndex::new(keys);

        let mut data_frame = Array2::default((dataframe.len(), index.len()));
        for (key, value) in dataframe.into_iter() {
            for (idx, value) in value.into_iter().enumerate() {
                if let Some(column) = index.get_column_index(&key) {
                    if let Some(x) = data_frame.get_mut((idx, column)) {
                        *x = value.clone();
                    }
                }
            }
        }
        Self::new(index, data_frame)
    }
}