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
|
/*
* Copyright (c) 2015 Oleg Morozenkov
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#ifndef TGBOT_UTILS_H
#define TGBOT_UTILS_H
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <unordered_map>
#include <boost/lexical_cast.hpp>
template<typename T>
inline std::string diff(const T& test, const T& expected, std::string (*toStringFunc)(const typename T::value_type&)) {
std::string result;
result += "\n*** BEGIN *** Count: t=";
result += boost::lexical_cast<std::string>(test.size());
result += " e=";
result += boost::lexical_cast<std::string>(expected.size());
result += '\n';
typename T::const_iterator iter1 = test.begin();
typename T::const_iterator end1 = test.end();
typename T::const_iterator iter2 = expected.begin();
typename T::const_iterator end2 = expected.end();
bool r1, r2;
std::string s1, s2;
size_t i = 0;
do {
r1 = iter1 != end1;
r2 = iter2 != end2;
if (r1) {
s1 = toStringFunc(*iter1++);
}
if (r2) {
s2 = toStringFunc(*iter2++);
}
if (r1 && r2 && s1 == s2) {
result += boost::lexical_cast<std::string>(i);
result += " [=] ";
result += s1;
result += "\n";
} else {
if (r1) {
result += boost::lexical_cast<std::string>(i);
result += " [t] ";
result += s1;
result += "\n";
}
if (r2) {
result += boost::lexical_cast<std::string>(i);
result += " [e] ";
result += s2;
result += "\n";
}
}
++i;
} while (r1 || r2);
result += "*** END ***\n";
return result;
}
inline std::string diffS(const std::string& test, const std::string& expected) {
std::vector<std::string> v1, v2;
std::istringstream ss1(test);
std::istringstream ss2(expected);
std::string s1, s2;
bool r1, r2;
do {
r1 = std::getline(ss1, s1) ? true : false;
r2 = std::getline(ss2, s2) ? true : false;
if (r1) {
v1.push_back(s1);
}
if (r2) {
v2.push_back(s2);
}
} while (r1 || r2);
return diff(v1, v2, [](const std::string& item) {
return item;
});
}
inline std::string diffMSS(const std::unordered_map<std::string, std::string>& test, const std::unordered_map<std::string, std::string>& expected) {
std::map<std::string, std::string> v1(test.begin(), test.end());
std::map<std::string, std::string> v2(expected.begin(), expected.end());
return diff(v1, v2, [](const std::pair<const std::string, std::string>& item) {
return item.first + '=' + item.second;
});
}
#endif //TGBOT_UTILS_H
|
