-
Notifications
You must be signed in to change notification settings - Fork 1
/
tools.h
163 lines (138 loc) · 2.85 KB
/
tools.h
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
#ifndef TOOLS_H
#define TOOLS_H
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <complex>
#include <cassert>
#include <algorithm>
#include <memory>
#ifndef M_PI
#define M_PI 3.1415926535897932384626433832795
#endif
#include <QDebug>
#include <QString>
#include "types.h"
namespace Tools
{
int intRound(double x);
double mod2Pi(double t);
double randDouble(double min, double max);
template <typename T> T exponentiation(T base, int power)
{
T res = 1;
if (power >= 0)
{
T pow = base;
while (power > 0)
{
if (power & 1)
{
res = res*pow;
}
pow = pow*pow;
power >>= 1;
}
}
else
{
throw(QString("ERROR in Tools::exponentiation: no negative exponents!"));
}
return res;
}
std::string convertToString(int i);
template <typename T> std::vector<uint> findInList(const T &x, const std::vector<T> &V)
{
std::vector<uint> outputIndices;
for (uint i=0; i<V.size(); i++)
{
if (V[i] == x)
{
outputIndices.push_back(i);
}
}
return outputIndices;
}
template <typename T> bool isInList(const T &x, const std::vector<T> &V)
{
for (const auto &v : V)
{
if (v == x)
{
return true;
}
}
return false;
}
template <typename T> bool containsDuplicates(const std::vector<T> & V)
{
uint i,j, N=V.size();
for (i=0; i!=N-1; ++i)
{
for (j=i+1; j!=N; ++j)
{
if (V[i] == V[j])
{
return true;
}
}
}
return false;
}
template <typename T> bool haveCommonElements(const std::vector<T> & V1, const std::vector<T> & V2)
{
uint i, j, N1 = V1.size(), N2 = V2.size();
for (i=0; i!=N1; i++)
{
for (j=0; j!=N2; j++)
{
if (V1[i] == V2[j])
{
return true;
}
}
}
return false;
}
template <typename T> int sign(T val)
{
return (T(0) < val) - (val < T(0));
}
template<typename T> void pop_front(std::vector<T> &vector)
{
assert(!vector.empty());
vector.erase(vector.begin());
}
}
std::ostream & operator<<(std::ostream &out, const Complex &z);
template<typename T> std::ostream & operator<<(std::ostream &out, const std::vector<T> &V)
{
out << "[";
for (uint i = 0; i+1 != V.size(); ++i)
{
out << V[i] << ", ";
}
if (!V.empty())
{
out << V.back() << "]";
}
return out;
}
template<typename T> std::vector<T> operator+(std::vector<T> V, const T &x)
{
for (auto &v : V)
{
v += x;
}
return V;
}
template<typename T, typename F> std::vector<T> operator*(const F & f, std::vector<T> V)
{
for (auto &v : V)
{
v = f*v;
}
return V;
}
#endif // TOOLS_H