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
|
/****************************************************************************
**
** Copyright (C) 2017 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of Qbs.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 3 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL3 included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 3 requirements
** will be met: https://www.gnu.org/licenses/lgpl-3.0.html.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 2.0 or (at your option) the GNU General
** Public license version 3 or any later version approved by the KDE Free
** Qt Foundation. The licenses are as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-2.0.html and
** https://www.gnu.org/licenses/gpl-3.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef QBS_STLUTILS_H
#define QBS_STLUTILS_H
#include <algorithm>
#include <iterator>
namespace qbs {
namespace Internal {
template <typename C>
auto sorted(C &&container)
{
using R = std::remove_cv_t<std::remove_reference_t<C>>;
R result(std::forward<C>(container));
std::sort(std::begin(result), std::end(result));
return result;
}
template <typename C, typename Pred>
auto sorted(C &&container, Pred &&pred)
{
using R = std::remove_cv_t<std::remove_reference_t<C>>;
R result(std::forward<C>(container));
std::sort(std::begin(result), std::end(result), std::forward<Pred>(pred));
return result;
}
template <typename To, typename From, typename Op>
To transformed(const From &from, Op op)
{
To to;
to.reserve(int(from.size()));
std::transform(std::cbegin(from), std::cend(from), std::back_inserter(to), std::move(op));
return to;
}
template <typename C, typename Op>
void transform(C &&container, Op op)
{
std::transform(std::begin(container), std::end(container), std::begin(container),
std::move(op));
}
template <typename To, typename From, typename Op>
void transform(const From &from, To &&to, Op op)
{
std::transform(std::cbegin(from), std::cend(from), std::back_inserter(to), std::move(op));
}
template <class C, class T>
bool contains(const C &container, const T &v)
{
const auto &end = std::cend(container);
return std::find(std::cbegin(container), end, v) != end;
}
template <class T, size_t N, class U>
bool contains(const T (&container)[N], const U &v)
{
const auto &end = std::cend(container);
return std::find(std::cbegin(container), end, v) != end;
}
template <class C>
bool containsKey(const C &container, const typename C::key_type &v)
{
const auto &end = container.cend();
return container.find(v) != end;
}
template <class C>
typename C::mapped_type mapValue(
const C &container,
const typename C::key_type &key,
const typename C::mapped_type &value = typename C::mapped_type())
{
const auto end = container.cend();
const auto it = container.find(key);
return it != end ? it->second : value;
}
template <typename C>
bool removeOne(C &container, const typename C::value_type &v)
{
auto end = std::end(container);
auto it = std::find(std::begin(container), end, v);
if (it == end)
return false;
container.erase(it);
return true;
}
template <typename C>
void removeAll(C &container, const typename C::value_type &v)
{
container.erase(std::remove(std::begin(container), std::end(container), v),
std::end(container));
}
template <typename C, typename Pred>
void removeIf(C &container, const Pred &pred)
{
container.erase(std::remove_if(std::begin(container), std::end(container), pred),
std::end(container));
}
template <class Container, class UnaryPredicate>
bool any_of(const Container &container, const UnaryPredicate &predicate)
{
return std::any_of(std::begin(container), std::end(container), predicate);
}
template <class Container, class UnaryPredicate>
bool all_of(const Container &container, const UnaryPredicate &predicate)
{
return std::all_of(std::begin(container), std::end(container), predicate);
}
template <class Container, class UnaryPredicate>
bool none_of(const Container &container, const UnaryPredicate &predicate)
{
return std::none_of(std::begin(container), std::end(container), predicate);
}
template <class It, class T, class Compare>
It binaryFind(It begin, It end, const T &value, Compare comp)
{
const auto it = std::lower_bound(begin, end, value, comp);
if (it == end || comp(value, *it))
return end;
return it;
}
template <class It, class T>
It binaryFind(It begin, It end, const T &value)
{
return binaryFind(begin, end, value, std::less<T>());
}
template <class C>
C &operator<<(C &container, const typename C::value_type &v)
{
container.push_back(v);
return container;
}
template <class C>
C &operator<<(C &container, const C &other)
{
container.insert(container.end(), other.cbegin(), other.cend());
return container;
}
// based on http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0814r0.pdf
template<typename T>
void hashCombineHelper(size_t &seed, const T &val)
{
seed ^= std::hash<T>()(val) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
template<typename... Types>
size_t hashCombine(const Types &... args)
{
size_t seed = 0;
(hashCombineHelper(seed, args), ...); // create hash value with seed over all args return seed;
return seed;
}
template<typename It>
size_t hashRange(It first, It last)
{
size_t seed = 0;
for (; first != last; ++first)
hashCombineHelper(seed, *first);
return seed;
}
template<typename R>
size_t hashRange(R &&range)
{
return hashRange(std::begin(range), std::end(range));
}
// based on qcontainertools_impl.h
template <typename Iterator>
using IfIsForwardIterator_t = typename std::enable_if_t<
std::is_convertible_v<
typename std::iterator_traits<Iterator>::iterator_category, std::forward_iterator_tag>,
bool>;
template <typename Iterator>
using IfIsNotForwardIterator = typename std::enable_if_t<
!std::is_convertible_v<
typename std::iterator_traits<Iterator>::iterator_category, std::forward_iterator_tag>,
bool>;
template <typename Container,
typename InputIterator,
IfIsNotForwardIterator<InputIterator> = true>
void reserveIfForwardIterator(Container *, InputIterator, InputIterator)
{
}
template <typename Container,
typename ForwardIterator,
IfIsForwardIterator_t<ForwardIterator> = true>
void reserveIfForwardIterator(Container *c, ForwardIterator f, ForwardIterator l)
{
c->reserve(static_cast<typename Container::size_type>(std::distance(f, l)));
}
// similar to ranges::to proposal
// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2019/p1206r1.pdf
template <class C, class R>
C rangeTo(R &&r)
{
return C(std::begin(r), std::end(r));
}
template<class Enum>
constexpr std::underlying_type_t<Enum> toUnderlying(Enum e) noexcept
{
return static_cast<std::underlying_type_t<Enum>>(e);
}
} // namespace Internal
} // namespace qbs
#endif // QBS_STLUTILS_H
|
