forked from ObEngine/ObEngine
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFunctions.cpp
More file actions
386 lines (354 loc) · 10.1 KB
/
Copy pathFunctions.cpp
File metadata and controls
386 lines (354 loc) · 10.1 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
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
//Author : Sygmei
//Key : 976938ef7d46c286a2027d73f3a99467bcfa8ff0c1e10bd0016139744ef5404f4eb4d069709f9831f6de74a094944bf0f1c5bf89109e9855290336a66420376f
#include "Functions.hpp"
namespace obe
{
namespace Functions
{
double Math::pi = 3.14159265359;
std::random_device rd; // only used once to initialise (seed) engine
std::mt19937 rng(rd()); // random-number engine used (Mersenne-Twister in this case)
//Functions::Math
int Math::randint(const int& min, const int& max)
{
std::uniform_int_distribution<int> uni(min, max); // guaranteed unbiased
return uni(rng);
}
double Math::randfloat()
{
std::uniform_real_distribution<> dis(0, 1);
return dis(rng);
}
bool Math::isDoubleInt(const double& value)
{
return (std::trunc(value) == value);
}
//Functions::Run
Run::Parser::Parser(char** start, int size)
{
this->start = start;
this->size = size;
}
bool Run::Parser::argumentExists(const std::string& arg) const
{
return std::find(start, start + size, arg) != (start + size);
}
std::string Run::Parser::getArgumentValue(const std::string& arg) const
{
char** itr = std::find(start, start + size, arg);
if (itr != (start + size) && ++itr != (start + size))
{
return std::string(*itr);
}
return "";
}
//Functions::String
void String::removeCharFromString(std::string& str, const std::string& charToRemove)
{
str.erase(remove(str.begin(), str.end(), charToRemove.c_str()[0]), str.end());
}
std::vector<std::string> String::split(const std::string& str, const std::string& delimiters)
{
std::vector<std::string> tokens;
std::string::size_type lastPos = str.find_first_not_of(delimiters, 0);
std::string::size_type pos = str.find_first_of(delimiters, lastPos);
while (std::string::npos != pos || std::string::npos != lastPos)
{
tokens.push_back(str.substr(lastPos, pos - lastPos));
lastPos = str.find_first_not_of(delimiters, pos);
pos = str.find_first_of(delimiters, lastPos);
}
return tokens;
}
std::vector<std::string> String::multiSplit(std::string str, const std::vector<std::string>& seps)
{
for (unsigned int i = 0; i < seps.size(); i++)
String::replaceStringInPlace(str, seps[i], "~" + seps[i] + "~");
return String::split(str, "~");
}
int String::occurencesInString(const std::string& str, const std::string& occur)
{
int occurrences = 0;
std::string::size_type start = 0;
while ((start = str.find(occur, start)) != std::string::npos)
{
++occurrences;
start += occur.length(); // see the note
}
return occurrences;
}
bool String::isStringAlpha(const std::string& str)
{
if (str.size() > 0)
return std::all_of(str.begin(), str.end(), ::isalpha);
else
return false;
}
bool String::isStringAlphaNumeric(const std::string& str)
{
if (str.size() > 0)
return std::all_of(str.begin(), str.end(), ::isalnum);
else
return false;
}
bool String::isStringInt(const std::string& str)
{
if (str.size() > 0)
{
if (str.substr(0, 1) == "-")
return std::all_of(str.substr(1).begin(), str.substr(1).end(), ::isdigit);
return std::all_of(str.begin(), str.end(), ::isdigit);
}
else
return false;
}
bool String::isStringFloat(const std::string& str)
{
std::string modifyStr = str;
bool isFloat = false;
if (modifyStr.size() > 0)
{
if (modifyStr.substr(0, 1) == "-")
modifyStr = modifyStr.substr(1);
if (String::occurencesInString(modifyStr, ".") == 1)
{
isFloat = true;
String::removeCharFromString(modifyStr, ".");
}
return (std::all_of(modifyStr.begin(), modifyStr.end(), ::isdigit) && isFloat);
}
else
return false;
}
bool String::isStringNumeric(const std::string& str)
{
return (String::isStringFloat(str) || String::isStringInt(str));
}
void String::replaceStringInPlace(std::string& subject, const std::string& search, const std::string& replace)
{
size_t pos = 0;
while ((pos = subject.find(search, pos)) != std::string::npos)
{
subject.replace(pos, search.length(), replace);
pos += replace.length();
}
}
std::string String::replaceString(std::string subject, const std::string& search, const std::string& replace)
{
size_t pos = 0;
while ((pos = subject.find(search, pos)) != std::string::npos)
{
subject.replace(pos, search.length(), replace);
pos += replace.length();
}
return subject;
}
bool String::isBetween(const std::string& string, const std::string& bet)
{
return (string.substr(0, bet.size()) == bet && string.substr(string.size() - bet.size(), bet.size()) == bet);
}
std::string String::extract(const std::string& base, int start, int end)
{
return base.substr(start, base.size() - start - end);
}
std::vector<std::string> String::extractBetween(std::string& str, char delimiter1, char delimiter2)
{
std::vector<std::string> strings;
int start = 0;
int end = 0;
bool hasFindStart = false;
bool hasFind = false;
for (int i = 0; i < str.size(); i++)
{
if (hasFindStart && str[i] == delimiter2)
{
hasFindStart = false;
end = i;
hasFind = true;
}
if (str[i] == delimiter1 && !hasFindStart && !hasFind)
{
start = i;
hasFindStart = true;
}
if (hasFind)
{
strings.push_back(str.substr(start + 1, end - start - 1));
hasFind = false;
}
}
for (int i = 0; i < strings.size(); i++)
String::replaceStringInPlace(str, strings[i], "");
return strings;
}
std::string String::getRandomKey(std::string set, int len)
{
std::string r;
for (int i = 0; i < len; i++) r.push_back(set.at(size_t(Math::randint(0, 100000) % set.size())));
return r;
}
void String::regenerateEncoding(std::string& str)
{
std::vector<int> data(str.begin(), str.end());
//for (int i = 0; i < data.size(); i++) { std::cout << data[i] << " "; }
//std::cout << std::endl;
int i = 0;
char ch;
str = "";
while (i < data.size())
{
if (data[i] == -61)
{
if (i < data.size() - 1) { data[i] = data[i + 1] + 64; }
data.erase(data.begin() + i + 1);
}
i++;
}
for (int j = 0; j < data.size(); j++)
{
ch = data[j];
str += ch;
}
}
std::string String::stringToAsciiCode(std::string& str)
{
std::vector<int> data(str.begin(), str.end());
std::vector<std::string> dataStr;
std::transform(data.begin(), data.end(), std::back_inserter(dataStr), [](const int& idata) { return std::to_string(idata); });
return Vector::join(dataStr, ",");
}
std::string String::cutBeforeAsciiCode(std::string& str, int asciiCode)
{
std::vector<int> data(str.begin(), str.end());
std::vector<std::string> dataStr;
for (int i = 0; i < data.size(); i++)
{
if (data[i] != asciiCode)
{
char a = data[i];
std::string strbuf;
std::stringstream strbridge;
strbridge << a;
strbridge >> strbuf;
//std::cout << "Trsf : " << strbuf << std::endl;
dataStr.push_back(strbuf);
}
else
break;
}
return Vector::join(dataStr, ",");
}
String::StringExtractor String::extractAllStrings(std::string string)
{
bool readingString = false;
std::vector<std::string> extractedStrings;
std::vector<std::string> otherComponents;
std::vector<std::pair<int, int>> indexes;
std::string currentStack = "";
for (unsigned int i = 0; i < string.size(); i++)
{
std::string currentChar = string.substr(i, 1);
if (currentChar == "\"")
{
if (readingString)
{
extractedStrings.push_back(currentStack);
indexes.push_back(std::pair<int, int>(0, extractedStrings.size() - 1));
}
else if (currentStack.size() > 0)
{
otherComponents.push_back(currentStack);
indexes.push_back(std::pair<int, int>(1, otherComponents.size() - 1));
}
readingString = !readingString;
currentStack.clear();
}
else
{
currentStack += currentChar;
}
}
if (!readingString)
{
otherComponents.push_back(currentStack);
indexes.push_back(std::pair<int, int>(1, otherComponents.size() - 1));
}
return std::make_tuple(extractedStrings, otherComponents, indexes);
}
bool String::contains(const std::string& string, const std::string& search)
{
return (string.find(search) != std::string::npos);
}
//Functions::Vector
std::string Vector::join(std::vector<std::string>& vector, std::string sep, int start, int end)
{
std::string result = "";
if (end >= vector.size())
end = vector.size();
if (start >= vector.size() - 1)
start = vector.size() - 1;
for (int i = start; i < vector.size() - end; i++)
{
if (i != vector.size() - 1)
result += vector[i] + sep;
else
result += vector[i];
}
return result;
}
void Vector::joinBetween(std::vector<std::string>& vector, std::string joinValue, std::string sep)
{
std::string stack = "";
bool stacking = false;
std::vector<int> toErase;
for (int i = 0; i < vector.size(); i++)
{
if (vector.at(i) == joinValue)
{
if (stacking)
{
stack += vector.at(i);
vector.at(i) = stack;
stack = "";
}
stacking = !stacking;
}
if (stacking)
{
stack += vector.at(i) + sep;
toErase.push_back(i);
}
}
for (int i = toErase.size() - 1; i >= 0; i--)
vector.erase(vector.begin() + toErase[i]);
}
void Vector::mergeNeighboors(std::vector<std::string>& vector, std::string n1, std::string n2, std::string sep, bool strict)
{
if (vector.size() > 0)
{
std::vector<int> toErase;
for (int i = 0; i < vector.size() - 1; i++)
{
if (strict)
{
if (vector.at(i) == n1 && vector.at(i + 1) == n2)
{
vector.at(i) = vector.at(i) + sep + vector.at(i + 1);
toErase.push_back(i + 1);
}
}
else
{
if ((vector.at(i) == n1 && vector.at(i + 1) == n2) || (vector.at(i) == n2 && vector.at(i + 1) == n1))
{
vector.at(i) = vector.at(i) + sep + vector.at(i + 1);
toErase.push_back(i + 1);
}
}
}
for (int i = toErase.size() - 1; i >= 0; i--)
vector.erase(vector.begin() + toErase[i]);
}
}
}
}