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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
/********************************************
DISCLAIMER:
This is a wrapper code to mimic the relevant std:: class
Please use it ONLY when porting an existing code e.g. from the original sources
For all new development please use classes from Common::
*********************************************/
#ifndef COMMON_STD_ALGORITHM_H
#define COMMON_STD_ALGORITHM_H
#include "common/algorithm.h"
#include "common/util.h"
namespace Std {
template<typename T> inline T abs(T x) {
return ABS(x);
}
template<typename T> inline T min(T a, T b) {
return MIN(a, b);
}
template<typename T> inline T max(T a, T b) {
return MAX(a, b);
}
template<typename T> inline T clip(T v, T amin, T amax) {
return CLIP(v, amin, amax);
}
template<typename T> inline T sqrt(T x) {
return ::sqrt(x);
}
template<typename T> inline void swap(T &a, T &b) {
SWAP(a, b);
}
template<class In, class Value>
In fill(In first, In last, const Value &val) {
return Common::fill(first, last, val);
}
template<typename T, class StrictWeakOrdering>
void sort(T first, T last, StrictWeakOrdering comp) {
Common::sort(first, last, comp);
}
template<typename T>
void sort(T *first, T *last) {
Common::sort(first, last, Common::Less<T>());
}
template<class T>
void sort(T first, T last) {
Common::sort(first, last);
}
template<class In, class T>
In find(In first, In last, const T &v) {
return Common::find(first, last, v);
}
template<class T>
T unique(T first, T last) {
T pos;
for (pos = first + 1; pos < last; ++pos) {
// Check for duplicate
for (T existingPos = first; existingPos < last; ++existingPos) {
if (*pos == *existingPos) {
// Found a match, so shift values over the duplicate
while (pos < (last - 1)) {
T &prior = pos;
++pos;
prior = pos;
}
--last;
break;
}
}
}
return pos;
}
template<class ForwardIt, class T>
ForwardIt lower_bound(ForwardIt first, ForwardIt last, const T &value) {
for (ForwardIt it = first; it < last; ++it) {
if (*it >= value)
return it;
}
return last;
}
template<class ForwardIt, class T>
ForwardIt upper_bound(ForwardIt first, ForwardIt last, const T &value) {
for (ForwardIt it = first; it < last; ++it) {
if (*it > value)
return it;
}
return last;
}
template<class ForwardIt, class T, class Compare>
ForwardIt upper_bound(ForwardIt first, ForwardIt last, const T &value, Compare comp) {
for (ForwardIt it = first; it < last; ++it) {
if (comp(value, *it))
return it;
}
return last;
}
template<class ForwardIt>
ForwardIt next(ForwardIt it, int n = 1) {
ForwardIt it2 = it;
while (n > 0) { ++it2; --n; }
while (n < 0) { --it2; ++n; }
return it2;
}
template<class BidirIt>
BidirIt prev(BidirIt it, int n = 1) {
BidirIt it2 = it;
while (n > 0) { --it2; --n; }
while (n < 0) { ++it2; ++n; }
return it2;
}
} // namespace Std
#endif
|
