-
Notifications
You must be signed in to change notification settings - Fork 0
/
Util.cpp
132 lines (128 loc) · 3.01 KB
/
Util.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
#include "Util.h"
#include <cmath>
#include <iostream>
std::string printComposite(std::set<int> value) {
std::string str("[");
int prev = -100, newele, start = -100;
for (auto it = value.begin(); it != value.end(); ++it) {
int v = *it;
if (v - prev > 1) {
newele = 1;
} else {
newele = 0;
}
if (newele) {
if (start >= 0) {
if (prev - start == 1) {
str += ",";
str += std::to_string(prev);
} else if (prev - start > 1) {
str += "-";
str += std::to_string(prev);
}
}
if (str.size() > 1)
str += ",";
str += std::to_string(v);
start = v;
}
prev = v;
}
if (newele == 0) {
if (prev - start == 1) {
str += ",";
} else {
str += "-";
}
str += std::to_string(prev);
}
str += "]";
return str;
}
void parserDouble(const char *cstr, std::vector<double> &value) {
value.clear();
std::vector<int> digs;
std::vector<int> dige;
int i = 0;
int flag = 0; // digit chunk
while (1) {
if ((cstr[i] >= '0' && cstr[i] <= '9') || cstr[i] == '.' ||
cstr[i] == 'e' || cstr[i] == 'E' || cstr[i] == '+' || cstr[i] == '-') {
if (flag == 0) {
digs.push_back(i);
}
flag = 1;
} else {
if (flag == 1) {
dige.push_back(i);
}
flag = 0;
}
if (cstr[i] == 0)
break;
++i;
}
double k;
for (int i = 0; i < digs.size(); ++i) {
std::string cuts(cstr + digs[i], dige[i] - digs[i]);
if (sscanf(cuts.c_str(), "%lf", &k) < 1) {
std::cout << "error: parser double " << cuts << std::endl;
}
value.push_back(k);
}
}
void parserUInt(const char *cstr, std::vector<int> &value) {
value.clear();
std::vector<int> digs;
std::vector<int> dige;
int i = 0;
int flag = 0; // digit chunk
while (1) {
if (cstr[i] >= '0' && cstr[i] <= '9') {
if (flag == 0) {
digs.push_back(i);
}
flag = 1;
} else {
if (flag == 1) {
dige.push_back(i);
}
flag = 0;
}
if (cstr[i] == 0)
break;
++i;
}
int k;
for (int i = 0; i < digs.size(); ++i) {
std::string cuts(cstr + digs[i], dige[i] - digs[i]); // data in [s e-1]
if (sscanf(cuts.c_str(), "%d", &k) < 1) {
std::cout << "error: parser int " << cuts << std::endl;
}
if (i > 0 && (digs[i] - dige[i - 1]) == 1 && cstr[digs[i] - 1] == '-') {
for (int j = value[value.size() - 1] + 1; j < k; ++j) {
value.push_back(j);
}
}
value.push_back(k);
}
}
double transformz(double z, int nlayers, std::vector<double> &targz,
double offset0, double offset1) {
int i = round(z * nlayers);
if (targz.size() > i) {
double off = 0.;
if (i == 0)
off = -offset0;
if (i == nlayers)
off = offset1;
return targz[i] + off;
} else {
return z;
}
}
void transform(std::vector<double> &p, double AoA) {
double x = p[0], y = p[1];
p[0] = x * cos(AoA) + y * sin(AoA);
p[1] = -x * sin(AoA) + y * cos(AoA);
}