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
|
// Copyright (C) 2021 Klarälvdalens Datakonsult AB, a KDAB Group company, info@kdab.com, author Marc Mutz <marc.mutz@kdab.com>
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR LGPL-3.0-only OR GPL-2.0-only OR GPL-3.0-only
#ifndef Q20ALGORITHM_H
#define Q20ALGORITHM_H
#include <QtCore/qglobal.h>
#include <algorithm>
#include <QtCore/q20functional.h>
//
// W A R N I N G
// -------------
//
// This file is not part of the Qt API. Types and functions defined
// in this file will behave exactly as their std counterparts. You
// may use these definitions in your own code, but be aware that we
// will remove them once Qt depends on the C++ version that supports
// them in namespace std. There will be NO deprecation warning, the
// definitions will JUST go away.
//
// If you can't agree to these terms, don't use these definitions!
//
// We mean it.
//
QT_BEGIN_NAMESPACE
namespace q20 {
// like std::is_sorted{,_until} (ie. constexpr)
#ifdef __cpp_lib_constexpr_algorithms
using std::is_sorted_until;
using std::is_sorted;
#else
template <typename ForwardIterator, typename BinaryPredicate = std::less<>>
constexpr ForwardIterator
is_sorted_until(ForwardIterator first, ForwardIterator last, BinaryPredicate p = {})
{
if (first == last)
return first;
auto prev = first;
while (++first != last) {
if (p(*first, *prev))
return first;
prev = first;
}
return first;
}
template <typename ForwardIterator, typename BinaryPredicate = std::less<>>
constexpr bool is_sorted(ForwardIterator first, ForwardIterator last, BinaryPredicate p = {})
{
return q20::is_sorted_until(first, last, p) == last;
}
#endif
}
namespace q20::ranges {
// like std::ranges::{any,all,none}_of, just unconstrained, so no range-overload
#ifdef __cpp_lib_ranges
using std::ranges::any_of;
using std::ranges::all_of;
using std::ranges::none_of;
#else
[[maybe_unused]] inline constexpr struct { // Niebloid
template <typename InputIterator, typename Sentinel,
typename Predicate, typename Projection = q20::identity>
constexpr bool operator()(InputIterator first, Sentinel last, Predicate pred, Projection proj = {}) const
{
while (first != last) {
if (std::invoke(pred, std::invoke(proj, *first)))
return true;
++first;
}
return false;
}
} any_of;
[[maybe_unused]] inline constexpr struct { // Niebloid
template <typename InputIterator, typename Sentinel,
typename Predicate, typename Projection = q20::identity>
constexpr bool operator()(InputIterator first, Sentinel last, Predicate pred, Projection proj = {}) const
{
while (first != last) {
if (!std::invoke(pred, std::invoke(proj, *first)))
return false;
++first;
}
return true;
}
} all_of;
[[maybe_unused]] inline constexpr struct { // Niebloid
template <typename InputIterator, typename Sentinel,
typename Predicate, typename Projection = q20::identity>
constexpr bool operator()(InputIterator first, Sentinel last, Predicate pred, Projection proj = {}) const
{
while (first != last) {
if (std::invoke(pred, std::invoke(proj, *first)))
return false;
++first;
}
return true;
}
} none_of;
#endif // __cpp_lib_ranges
} // namespace q20::ranges
QT_END_NAMESPACE
#endif /* Q20ALGORITHM_H */
|
