-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathalg.cpp
180 lines (179 loc) · 6.21 KB
/
alg.cpp
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
#include "matrix.hpp"
#include "matrixview.hpp"
bool _sort_descending (float i, float j) {
return i > j;
}
bool asc_comparator (const pair<float, size_t>& l, const pair<float, size_t>& r) {
return l.first < r.first;
}
bool des_comparator (const pair<float, size_t>& l, const pair<float, size_t>& r) {
return l.first > r.first;
}
matrix<float>& matrix_sort (const matrix<float>& mx, int axis, int order) {
assert (axis == matrix<float>::SORT_FLAT ||
axis == matrix<float>::SORT_COLS ||
axis == matrix<float>::SORT_ROWS);
matrix<float>* sorted = new matrix<float>(mx.rows(), mx.cols());
*sorted = mx;
if (axis == matrix<float>::SORT_FLAT) {
// sort as if the matrix is flattened
float *ptr = sorted->mutable_ptr();
if (order == matrix<float>::SORT_ASCEND)
sort (ptr, ptr + sorted->size());
else
sort (ptr, ptr + sorted->size(), _sort_descending);
} else if (axis == matrix<float>::SORT_ROWS) {
for (size_t i=0; i < sorted->rows(); ++i) {
float *ptr = sorted->mutable_ptr();
if (order == matrix<float>::SORT_ASCEND)
sort (ptr + i*sorted->cols(), ptr + (i+1)*sorted->cols());
else
sort (ptr + i*sorted->cols(), ptr + (i+1)*sorted->cols(), _sort_descending);
}
} else {
sorted->t();
for (size_t i=0; i < sorted->rows(); ++i) {
float *ptr = sorted->mutable_ptr();
if (order == matrix<float>::SORT_ASCEND)
sort (ptr + i*sorted->cols(), ptr + (i+1)*sorted->cols());
else
sort (ptr + i*sorted->cols(), ptr + (i+1)*sorted->cols(), _sort_descending);
}
sorted->t();
}
return *sorted;
}
matrix<size_t>& matrix_argsort (const matrix<float>& mx, int axis, int order) {
assert (axis == matrix<float>::SORT_FLAT ||
axis == matrix<float>::SORT_COLS ||
axis == matrix<float>::SORT_ROWS);
vector<std::pair<float, size_t> > elems;
if (axis == matrix<float>::SORT_FLAT) {
const float* ptr = mx.ptr();
size_t m = mx.size();
for (size_t i=0; i < m; ++i)
elems.push_back(std::make_pair(ptr[i], i));
} else if (axis == matrix<float>::SORT_COLS) {
matrix<float> sorted = mx;
sorted.t();
const float* ptr = sorted.ptr();
size_t count = 0;
for (size_t j=0; j < sorted.cols(); ++j)
for (size_t i=0; i < sorted.rows(); ++i)
elems.push_back(std::make_pair(ptr[count++], i));
} else {
const float* ptr = mx.ptr();
size_t count = 0;
for (size_t i=0; i < mx.rows(); ++i)
for (size_t j=0; j < mx.cols(); ++j)
elems.push_back(std::make_pair(ptr[count++], j));
}
// sorting
if (axis == matrix<float>::SORT_FLAT) {
if (order == matrix<float>::SORT_ASCEND)
std::sort (elems.begin(), elems.end(), asc_comparator);
else
std::sort (elems.begin(), elems.end(), des_comparator);
} else if (axis == matrix<float>::SORT_ROWS){
for (size_t i=0; i < mx.rows() - 1; ++i) {
if (order == matrix<float>::SORT_ASCEND)
std::sort (elems.begin() + i*mx.cols(), elems.begin() + (i+1)*mx.cols(), asc_comparator);
else
std::sort (elems.begin() + i*mx.cols(), elems.begin() + (i+1)*mx.cols(), des_comparator);
}
} else {
for (size_t i=0; i < mx.cols() - 1; ++i) {
if (order == matrix<float>::SORT_ASCEND)
std::sort (elems.begin() + i*mx.rows(), elems.begin() + (i+1)*mx.rows(), asc_comparator);
else
std::sort (elems.begin() + i*mx.rows(), elems.begin() + (i+1)*mx.rows(), des_comparator);
}
}
matrix<size_t>* index = new matrix<size_t>(mx.rows(), mx.cols());
size_t *ptri = index->mutable_ptr();
for (size_t i=0; i < elems.size(); ++i)
ptri[i] = elems[i].second;
if (axis == matrix<float>::SORT_COLS)
index->t();
return *index;
}
matrix<size_t>& matrix_argsort (const view<float>& vx, int axis, int order) {
assert (axis == matrix<float>::SORT_FLAT ||
axis == matrix<float>::SORT_COLS ||
axis == matrix<float>::SORT_ROWS);
vector<std::pair<float, size_t> > elems;
matrix<float> mx;
mx = vx;
if (axis == matrix<float>::SORT_FLAT) {
const float* ptr = mx.ptr();
size_t m = mx.size();
for (size_t i=0; i < m; ++i)
elems.push_back(std::make_pair(ptr[i], i));
} else if (axis == matrix<float>::SORT_COLS) {
mx.t();
const float* ptr = mx.ptr();
size_t count = 0;
for (size_t j=0; j < mx.cols(); ++j)
for (size_t i=0; i < mx.rows(); ++i)
elems.push_back(std::make_pair(ptr[count++], i));
} else {
const float* ptr = mx.ptr();
size_t count = 0;
for (size_t i=0; i < mx.rows(); ++i)
for (size_t j=0; j < mx.cols(); ++j)
elems.push_back(std::make_pair(ptr[count++], j));
}
// sorting
if (axis == matrix<float>::SORT_FLAT) {
if (order == matrix<float>::SORT_ASCEND)
std::sort (elems.begin(), elems.end(), asc_comparator);
else
std::sort (elems.begin(), elems.end(), des_comparator);
} else {
for (size_t i=0; i < mx.rows() - 1; ++i) {
if (order == matrix<float>::SORT_ASCEND)
std::sort (elems.begin() + i*mx.cols(), elems.begin() + (i+1)*mx.cols(), asc_comparator);
else
std::sort (elems.begin() + i*mx.cols(), elems.begin() + (i+1)*mx.cols(), des_comparator);
}
}
matrix<size_t>* index = new matrix<size_t>(mx.rows(), mx.cols());
size_t *ptri = index->mutable_ptr();
for (size_t i=0; i < elems.size(); ++i)
ptri[i] = elems[i].second;
if (axis == matrix<float>::SORT_COLS)
index->t();
return *index;
}
matrix<float>& matrix_sort (const view<float>& mx, int axis, int order) {
assert (axis >= -1 && axis <= 1);
matrix<float>* sorted = new matrix<float>(mx.rows(), mx.cols());
*sorted = mx;
if (axis == matrix<float>::SORT_FLAT) {
// sort as if the matrix is flattened
float *ptr = sorted->mutable_ptr();
if (order == matrix<float>::SORT_ASCEND)
sort (ptr, ptr + sorted->size());
else
sort (ptr, ptr + sorted->size(), _sort_descending);
} else if (axis == matrix<float>::SORT_ROWS) {
for (size_t i=0; i < sorted->rows(); ++i) {
float *ptr = sorted->mutable_ptr();
if (order == matrix<float>::SORT_ASCEND)
sort (ptr + i*sorted->cols(), ptr + (i+1)*sorted->cols());
else
sort (ptr + i*sorted->cols(), ptr + (i+1)*sorted->cols(), _sort_descending);
}
} else {
sorted->t();
for (size_t i=0; i < sorted->rows(); ++i) {
float *ptr = sorted->mutable_ptr();
if (order == matrix<float>::SORT_ASCEND)
sort (ptr + i*sorted->cols(), ptr + (i+1)*sorted->cols());
else
sort (ptr + i*sorted->cols(), ptr + (i+1)*sorted->cols(), _sort_descending);
}
sorted->t();
}
return *sorted;
}