blob: f384821978c690fee3102a0266cbf0f5bd18b4dd (
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
|
// Copyright (C) 2023 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR LGPL-3.0-only OR GPL-2.0-only OR GPL-3.0-only
#ifndef QSGGRADIENTCACHE_P_H
#define QSGGRADIENTCACHE_P_H
//
// W A R N I N G
// -------------
//
// This file is not part of the Qt API. It exists for the convenience
// of a number of Qt sources files. This header file may change from
// version to version without notice, or even be removed.
//
// We mean it.
//
#include <QtCore/qhash.h>
#include <QtGui/qbrush.h>
#include <QtQuick/qtquickexports.h>
QT_BEGIN_NAMESPACE
class QSGTexture;
class QSGPlainTexture;
class QRhi;
struct Q_QUICK_EXPORT QSGGradientCacheKey
{
QSGGradientCacheKey(const QGradientStops &stops, QGradient::Spread spread)
: stops(stops), spread(spread)
{ }
QGradientStops stops;
QGradient::Spread spread;
bool operator==(const QSGGradientCacheKey &other) const
{
return spread == other.spread && stops == other.stops;
}
};
inline size_t qHash(const QSGGradientCacheKey &v, size_t seed = 0)
{
size_t h = seed + v.spread;
for (int i = 0; i < 3 && i < v.stops.size(); ++i)
h += v.stops[i].second.rgba();
return h;
}
class Q_QUICK_EXPORT QSGGradientCache
{
public:
struct GradientDesc { // can fully describe a linear/radial/conical gradient
QGradientStops stops;
QGradient::Spread spread = QGradient::PadSpread;
QPointF a; // start (L) or center point (R/C)
QPointF b; // end (L) or focal point (R)
qreal v0; // center radius (R) or start angle (C)
qreal v1; // focal radius (R)
};
~QSGGradientCache();
static QSGGradientCache *cacheForRhi(QRhi *rhi);
QSGTexture *get(const QSGGradientCacheKey &grad);
private:
QHash<QSGGradientCacheKey, QSGPlainTexture *> m_textures;
};
QT_END_NAMESPACE
#endif // QSGGRADIENTCACHE_P_H
|
