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
|
#ifndef UTIL_H
#define UTIL_H
#include <list>
#include <set>
#include <string>
class IAICallback;
namespace util {
std::string GetAbsFileName(IAICallback*, const std::string&, bool readonly = false);
void StringToLowerInPlace(std::string&);
std::string StringToLower(std::string);
std::string StringStripSpaces(const std::string&);
int RemoveWhiteSpaceInPlace(std::string&);
float WeightedAverage(std::list<float>&, std::list<float>&);
float GaussDens(float, float mu = 0.0f, float sigma = 1.0f);
unsigned int CountOneBits(unsigned int n);
/**
* Determines if A is a binary subset of B
*
* @param unsigned, binary mask A
* @param unsigned, binary mask B
* @return bool, A \subseteq B
*/
bool IsBinarySubset(unsigned A, unsigned B);
template<typename T> std::set<T> IntersectSets(const std::set<T>& s1, const std::set<T>& s2) {
typename std::set<T> r;
typename std::set<T>::const_iterator sit;
for (sit = s1.begin(); sit != s1.end(); sit++) {
if (s2.find(*sit) != s2.end()) {
r.insert(*sit);
}
}
return r;
}
template<typename T> std::set<T> UnionSets(const std::set<T>& s1, const std::set<T>& s2) {
typename std::set<T> r;
typename std::set<T>::const_iterator sit;
for (sit = s1.begin(); sit != s1.end(); sit++) { r.insert(*sit); }
for (sit = s2.begin(); sit != s2.end(); sit++) { r.insert(*sit); }
return r;
}
}
#endif
|
