aboutsummaryrefslogtreecommitdiffstats
path: root/src/lib/corelib/tools/qttools.h
blob: 86e81936b63dcc251b39c9969187ea9ed83605a6 (plain)
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
/****************************************************************************
**
** Copyright (C) 2016 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 QBSQTTOOLS_H
#define QBSQTTOOLS_H

#include <tools/qbsassert.h>
#include <tools/stlutils.h>

#include <QtCore/qhash.h>
#include <QtCore/qstringlist.h>
#include <QtCore/qtextstream.h>
#include <QtCore/qvariant.h>

#include <functional>

QT_BEGIN_NAMESPACE
class QProcessEnvironment;
QT_END_NAMESPACE

#if (QT_VERSION < QT_VERSION_CHECK(5, 14, 0))
#define QBS_SKIP_EMPTY_PARTS QString::SkipEmptyParts
#else
#define QBS_SKIP_EMPTY_PARTS Qt::SkipEmptyParts
#endif

namespace std {
#if (QT_VERSION < QT_VERSION_CHECK(5, 14, 0))
template<> struct hash<QString> {
    std::size_t operator()(const QString &s) const { return qHash(s); }
};
#endif

template<typename T1, typename T2> struct hash<std::pair<T1, T2>>
{
    size_t operator()(const pair<T1, T2> &x) const
    {
        return std::hash<T1>()(x.first) ^ std::hash<T2>()(x.second);
    }
};

template <typename... Ts>
struct hash<std::tuple<Ts...>>
{
private:
    template<std::size_t... Ns>
    static size_t helper(std::index_sequence<Ns...>, const std::tuple<Ts...> &tuple) noexcept
    {
        size_t seed = 0;
        (qbs::Internal::hashCombineHelper(seed, std::get<Ns>(tuple)), ...);
        return seed;
    }

public:
    size_t operator()(const std::tuple<Ts...> & tuple) const noexcept
    {
        return helper(std::make_index_sequence<sizeof...(Ts)>(), tuple);
    }
};


template<> struct hash<QStringList>
{
    std::size_t operator()(const QStringList &s) const noexcept
    {
        return qbs::Internal::hashRange(s);
    }
};

template<> struct hash<QVariant>
{
    size_t operator()(const QVariant &v) const noexcept;
};

template<> struct hash<QVariantList>
{
    size_t operator()(const QVariantList &v) const noexcept
    {
        return qbs::Internal::hashRange(v);
    }
};

template<> struct hash<QVariantMap>
{
    size_t operator()(const QVariantMap &v) const noexcept
    {
        return qbs::Internal::hashRange(v);
    }
};

template<> struct hash<QVariantHash>
{
    size_t operator()(const QVariantHash &v) const noexcept
    {
        return qbs::Internal::hashRange(v);
    }
};

} // namespace std

QT_BEGIN_NAMESPACE

uint qHash(const QStringList &list);
uint qHash(const QProcessEnvironment &env);

template<typename... Args>
uint qHash(const std::tuple<Args...> &tuple)
{
    return std::hash<std::tuple<Args...>>()(tuple) % std::numeric_limits<uint>::max();
}

inline uint qHash(const QVariant &v)
{
    return std::hash<QVariant>()(v) % std::numeric_limits<uint>::max();
}

inline uint qHash(const QVariantMap &v)
{
    return std::hash<QVariantMap>()(v) % std::numeric_limits<uint>::max();
}

inline uint qHash(const QVariantHash &v)
{
    return std::hash<QVariantHash>()(v) % std::numeric_limits<uint>::max();
}

#if (QT_VERSION < QT_VERSION_CHECK(5, 14, 0))
namespace Qt {
inline QTextStream &endl(QTextStream &stream) { return stream << QT_PREPEND_NAMESPACE(endl); }
} // namespace Qt
#endif

QT_END_NAMESPACE

namespace qbs {

template <class T>
QSet<T> toSet(const QList<T> &list)
{
#if (QT_VERSION < QT_VERSION_CHECK(5, 14, 0))
    return list.toSet();
#else
    return QSet<T>(list.begin(), list.end());
#endif
}

template<class T>
QList<T> toList(const QSet<T> &set)
{
#if (QT_VERSION < QT_VERSION_CHECK(5, 14, 0))
    return set.toList();
#else
    return QList<T>(set.begin(), set.end());
#endif
}

template<typename K, typename V>
QHash<K, V> &unite(QHash<K, V> &h, const QHash<K, V> &other)
{
#if (QT_VERSION < QT_VERSION_CHECK(5, 15, 0))
    return h.unite(other);
#else
    h.insert(other);
    return h;
#endif
}

inline void setupDefaultCodec(QTextStream &stream)
{
#if (QT_VERSION < QT_VERSION_CHECK(6, 0, 0))
    stream.setCodec("UTF-8");
#else
    Q_UNUSED(stream);
#endif
}

inline bool qVariantCanConvert(const QVariant &variant, int typeId)
{
#if (QT_VERSION >= QT_VERSION_CHECK(6, 0, 0))
    return variant.canConvert(QMetaType(typeId));
#else
    return variant.canConvert(typeId); // deprecated in Qt6
#endif
}

inline bool qVariantConvert(QVariant &variant, int typeId)
{
#if (QT_VERSION >= QT_VERSION_CHECK(6, 0, 0))
    return variant.convert(QMetaType(typeId));
#else
    return variant.convert(typeId); // deprecated in Qt6
#endif
}

} // namespace qbs

#endif // QBSQTTOOLS_H