-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathsplit.cpp
More file actions
358 lines (322 loc) · 11.6 KB
/
Copy pathsplit.cpp
File metadata and controls
358 lines (322 loc) · 11.6 KB
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
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
#include <iostream>
#include <bits/stdc++.h>
#include "H5Cpp.h"
#include "common.h"
#include "compress.h"
#include <unistd.h>
using namespace H5;
using namespace std;
const int NX = 500;
int NY = 1000;
int NZ = 1000;
const int kStkN = 10;
int kN = NX * NY * NZ / kStkN;
const int RANK_OUT = 3;
string prefix_path = "";
string output_prefix_path = "";
string trade_id = "1";
string output_cuo_path = "";
vector<Order> order_stk[kStkN];
vector<int> prev_close(kStkN);
vector<int> hook(kStkN * 100 * 4);
void QuickSort() {
for (int i = 0; i < kStkN; ++i) {
sort(order_stk[i].begin(), order_stk[i].end(), [&](Order order1, Order order2) {
return order1.order_id < order2.order_id;
});
}
}
void CountingSort() {
for (int i = 0; i < kStkN; ++i) {
vector<int> address(kN * 2 + 1, -1);
for (int j = 0; j < order_stk[i].size(); ++j) {
#ifdef Test
assert(address[order_stk[i][j].order_id] == -1);
#endif
address[order_stk[i][j].order_id] = j; //address[3] = 0
}
vector<Order> tmp = order_stk[i];
int k = 0;
for (int j = 1; j <= kN * 2; ++j) {
if (address[j] == -1) continue;
order_stk[i][k++] = tmp[address[j]];
}
assert(k == kN);
}
}
void ReadHdf5Int(
H5File &file,
DataSet &dataset,
string csv_name,
int NX,
int NY,
int NZ
) {
// string path = prefix_path + dataset_name + id + ".h5";
// H5std_string FILE_NAME(path);
// H5std_string DATASET_NAME(csv_name);
int size = NX * NY * NZ;
int *data_read = new int [size];
memset(data_read, 0, sizeof(int) * size);
// H5File file(FILE_NAME, H5F_ACC_RDONLY);
// DataSet dataset = file.openDataSet(DATASET_NAME);
DataSpace dataspace = dataset.getSpace();
int rank = dataspace.getSimpleExtentNdims();
hsize_t dims_out[3] = {1, 1, 1};
dataspace.getSimpleExtentDims(dims_out, NULL);
printf("rank %d, shape (%llu, %llu, %llu)\n", rank, dims_out[0], dims_out[1], dims_out[2]);
hsize_t offset[3];
hsize_t count[3];
offset[0] = 0;
offset[1] = 0;
offset[2] = 0;
count[0] = NX;
count[1] = NY;
count[2] = NZ;
dataspace.selectHyperslab(H5S_SELECT_SET, count, offset); //select in file, this api can set api
hsize_t dimsm[3];
dimsm[0] = NX;
dimsm[1] = NY;
dimsm[2] = NZ;
for (int i = 0; i < 3; ++i) assert(dimsm[i] == dims_out[i]);
DataSpace memspace(RANK_OUT, dimsm);
hsize_t offset_out[3];
hsize_t count_out[3];
offset_out[0] = 0;
offset_out[1] = 0;
offset_out[2] = 0;
count_out[0] = NX;
count_out[1] = NY;
count_out[2] = NZ;
memspace.selectHyperslab(H5S_SELECT_SET, count_out, offset_out); // select in memory
dataset.read(data_read, PredType::NATIVE_INT, memspace, dataspace);
//read from file to memory, you can set offset in memory space
// vector<int> stk[kStkN];
// for (int i = 0; i < kStkN; ++i) {
// stk[i].reserve(kN);
// }
// for (int i = 0; i < dims_out[0]; ++i) {
// for (int j = 0; j < dims_out[1]; ++j) {
// for (int k = 0; k < dims_out[2]; ++k) {
// int stk_code = i % kStkN;
// stk[stk_code].push_back(data_read[i * dims_out[1] * dims_out[2] + j * dims_out[2] + k]);
// }
// }
// }
// for (int i = 0; i < kStkN; ++i) {
// for (int j = 0; j < stk[i].size(); ++j) {
// if (csv_name == "order_id") order_stk[i][j].order_id = stk[i][j];
// if (csv_name == "volume") order_stk[i][j].volume = stk[i][j];
// if (csv_name == "direction") order_stk[i][j].combined |= (stk[i][j] == 1?1:0) << 3;
// if (csv_name == "type") order_stk[i][j].combined |= stk[i][j];
// if (csv_name == "prev_close") prev_close[i] = round(stk[i][j] * 100);
// if (csv_name == "hook") hook[i * 100 * 4 + j] = stk[i][j];
// }
// }
for (int i = 0; i < dims_out[0]; ++i) {
for (int j = 0; j < dims_out[1]; ++j) {
for (int k = 0; k < dims_out[2]; ++k) {
int id = (i * dims_out[1] * dims_out[2] + j * dims_out[2] + k);
int stk_code = i % kStkN;
int next = id / (kStkN * NY * NZ) * NY * NZ + id % (NY * NZ);
//cout << id << " " << stk_code << " " << next << " "<< kN <<" " << data_read[id] << endl;
if (csv_name == "order_id") order_stk[stk_code][next].order_id = data_read[id];
if (csv_name == "volume") order_stk[stk_code][next].volume = data_read[id];
if (csv_name == "direction") order_stk[stk_code][next].combined |= (data_read[id] == 1?1:0) << 3;
if (csv_name == "type") order_stk[stk_code][next].combined |= data_read[id];
if (csv_name == "hook") hook[stk_code * 100 * 4 + next] = data_read[id];
if (csv_name == "prev_close") prev_close[stk_code] = round(data_read[id] * 100);
}
}
}
delete[] data_read;
dataspace.close();
//datatype.close();
// dataset.close();
// file.close();
}
void ReadHdf5Double(
H5File &file,
DataSet &dataset,
string csv_name,
int NX,
int NY,
int NZ
) {
// string path = prefix_path + dataset_name + id + ".h5";
// cout << path << " " << dataset_name << endl;
// H5std_string FILE_NAME(path);
// H5std_string DATASET_NAME(csv_name);
int size = NX * NY * NZ;
double *data_read = new double [size];
memset(data_read, 0, sizeof(double) * size);
// H5File file(FILE_NAME, H5F_ACC_RDONLY);
// DataSet dataset = file.openDataSet(DATASET_NAME);
DataSpace dataspace = dataset.getSpace();
int rank = dataspace.getSimpleExtentNdims();
hsize_t dims_out[3] = {1, 1, 1};
dataspace.getSimpleExtentDims(dims_out, NULL);
printf("rank %d, shape (%llu, %llu, %llu)\n", rank, dims_out[0], dims_out[1], dims_out[2]);
hsize_t offset[3];
hsize_t count[3];
offset[0] = 0;
offset[1] = 0;
offset[2] = 0;
count[0] = NX;
count[1] = NY;
count[2] = NZ;
dataspace.selectHyperslab(H5S_SELECT_SET, count, offset); //select in file, this api can set api
hsize_t dimsm[3];
dimsm[0] = NX;
dimsm[1] = NY;
dimsm[2] = NZ;
for (int i = 0; i < 3; ++i) cout << "dim=" << " " << dimsm[i] << " " << dims_out[i] << endl;
for (int i = 0; i < 3; ++i) assert(dimsm[i] == dims_out[i]);
DataSpace memspace(RANK_OUT, dimsm);
hsize_t offset_out[3];
hsize_t count_out[3];
offset_out[0] = 0;
offset_out[1] = 0;
offset_out[2] = 0;
count_out[0] = NX;
count_out[1] = NY;
count_out[2] = NZ;
memspace.selectHyperslab(H5S_SELECT_SET, count_out, offset_out); // select in memory
dataset.read(data_read, PredType::NATIVE_DOUBLE, memspace, dataspace);
//read from file to memory, you can set offset in memory space
// vector<double> stk[kStkN];
// for (int i = 0; i < kStkN; ++i) {
// stk[i].reserve(kN);
// }
// for (int i = 0; i < dims_out[0]; ++i) {
// for (int j = 0; j < dims_out[1]; ++j) {
// for (int k = 0; k < dims_out[2]; ++k) {
// int stk_code = i % kStkN;
// //stk[i % kStkN][i * dims_out[1] * dims_out[2] + j * dims_out[2] + k]
// // == data_read[i * dims_out[1] * dims_out[2] + j * dims_out[2] + k]
// stk[stk_code].push_back(data_read[i * dims_out[1] * dims_out[2] + j * dims_out[2] + k]);
// }
// }
// }
// for (int i = 0; i < kStkN; ++i) {
// for (int j = 0; j < stk[i].size(); ++j) {
// if (csv_name == "price") {
// order_stk[i][j].combined |= i << 4;
// order_stk[i][j].price = round(stk[i][j] * 100); //floor 0.01
// }
// if (csv_name == "prev_close") prev_close[i] = round(stk[i][j] * 100);
// }
// }
for (int i = 0; i < dims_out[0]; ++i) {
for (int j = 0; j < dims_out[1]; ++j) {
for (int k = 0; k < dims_out[2]; ++k) {
int id = (i * dims_out[1] * dims_out[2] + j * dims_out[2] + k);
int stk_code = i % kStkN;
int next = id / (kStkN * NY * NZ) * NY * NZ + id % (NY * NZ);
//cout << id << " " << stk_code << " " << next << " "<< kN <<" " << data_read[id] << endl;
//stk[i % kStkN][i * dims_out[1] * dims_out[2] + j * dims_out[2] + k]
// == data_read[i * dims_out[1] * dims_out[2] + j * dims_out[2] + k]
// stk[stk_code].push_back(data_read[i * dims_out[1] * dims_out[2] + j * dims_out[2] + k]);
if (csv_name == "price") {
order_stk[stk_code][next].combined |= stk_code << 4;
order_stk[stk_code][next].price = round(data_read[id] * 100); //floor 0.01
}
if (csv_name == "prev_close") prev_close[stk_code] = round(data_read[id] * 100);
}
}
}
delete[] data_read;
dataspace.close();
//datatype.close();
// dataset.close();
// file.close();
}
void OutputOrderBinaryFile(int stk_id) {
#ifdef Test
for (int i = 0; i < kN; ++i) {
bool output_flag = i < 3;
OutputOrder(order_stk[stk_id][i], output_flag, kN);
}
#endif
assert(order_stk[stk_id].size() == kN);
assert(kN % kSplitN == 0);
int length = kN / kSplitN;
for (int i = 0; i < kSplitN; ++i) {
string binary_file_path = output_prefix_path + "/" "stock" + to_string(stk_id + 1) + "_" + to_string(i + 1);
// cout << "binary_file_path=" << binary_file_path << endl;
// std::ofstream outfile(binary_file_path, std::ios::out | std::ios::binary);
// outfile.write((char *)(&order_stk[stk_id][length * i]), sizeof(Order) * length);
// outfile.close();
start_compress((void *)(&order_stk[stk_id][length * i]), sizeof(Order) * length, binary_file_path);
// mark as successful
auto successFlagPath = binary_file_path + COMPRESS_TYPE;
successFlagPath += SUCCESS_FILE_EXTENSION;
std::ofstream outFileSuccess(successFlagPath, std::ios::out | std::ios::binary);
outFileSuccess.write("success", 8);
}
}
void ReadHdf5(
string dataset_name,
string csv_name,
string id,
int NX,
int NY,
int NZ
) {
string path = prefix_path + dataset_name + id + ".h5";
H5std_string FILE_NAME(path);
H5std_string DATASET_NAME(csv_name);
H5File file(FILE_NAME, H5F_ACC_RDONLY);
DataSet dataset = file.openDataSet(DATASET_NAME);
DataType datatype = dataset.getDataType();
H5T_class_t classt = datatype.getClass();
cout << "class_t=" << classt << endl;
assert(classt < 2);
if (classt == 0) ReadHdf5Int(file, dataset, csv_name, NX, NY, NZ);
if (classt == 1) ReadHdf5Double(file, dataset, csv_name, NX, NY, NZ);
datatype.close();
dataset.close();
file.close();
}
void OutputIntBinaryFile(vector<int> &V, string file_name) {
string binary_file_path = output_cuo_path + "/" + file_name;
cout << binary_file_path << endl;
std::ofstream outfile(binary_file_path, std::ios::out | std::ios::binary);
for (auto v : V) {
outfile.write((char *)(&v), sizeof(int));
}
outfile.close();
}
int main(int argc,char **argv) {
prefix_path = argv[1];
trade_id = argv[2];
output_prefix_path = argv[3];
output_cuo_path = argv[4];
NY = atoi(argv[5]);
NZ = atoi(argv[6]);
assert(argc == 7);
kN = NX * NY * NZ / kStkN;
for (int i = 0; i < kStkN; ++i) {
order_stk[i] = vector<Order>(kN);
}
vector<string> dataset_name_vec{"order_id", "direction", "type", "volume"};
// for (auto dataset_name : dataset_name_vec)
// ReadHdf5Int(dataset_name, dataset_name, trade_id, NX, NY, NZ);
// ReadHdf5Double("price", "price", trade_id, NX, NY, NZ);
// ReadHdf5Int("price", "prev_close", trade_id, kStkN, 1, 1);
// ReadHdf5Int("hook", "hook", "", kStkN, 100, 4);
for (auto dataset_name : dataset_name_vec)
ReadHdf5(dataset_name, dataset_name, trade_id, NX, NY, NZ);
ReadHdf5("price", "price", trade_id, NX, NY, NZ);
ReadHdf5("price", "prev_close", trade_id, kStkN, 1, 1);
ReadHdf5("hook", "hook", "", kStkN, 100, 4);
QuickSort();
for (int i = 0; i < kStkN; ++i)
OutputOrderBinaryFile(i);
OutputIntBinaryFile(prev_close, "prev_price");
OutputIntBinaryFile(hook, "hook");
for (int i = 0; i < kStkN; ++i) {
cout << "prev_close=" << prev_close[i] << endl;
}
return 0;
}