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
270
271
272
273
274
275
276
277
278
|
/****************************************************************************
**
** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtGui module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this
** file. Please review the following information to ensure the GNU Lesser
** General Public License version 2.1 requirements will be met:
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef QPAINTERPATH_P_H
#define QPAINTERPATH_P_H
//
// W A R N I N G
// -------------
//
// This file is not part of the Qt API. It exists for the convenience
// of other Qt classes. This header file may change from version to
// version without notice, or even be removed.
//
// We mean it.
//
#include "QtGui/qpainterpath.h"
#include "QtGui/qregion.h"
#include "QtCore/qlist.h"
#include "QtCore/qvarlengtharray.h"
#include <qdebug.h>
#include <private/qvectorpath_p.h>
#include <private/qstroker_p.h>
QT_BEGIN_NAMESPACE
class QPainterPathStrokerPrivate
{
public:
QPainterPathStrokerPrivate();
QStroker stroker;
QVector<qfixed> dashPattern;
qreal dashOffset;
};
class QPolygonF;
class QVectorPathConverter;
class QVectorPathConverter
{
public:
QVectorPathConverter(const QVector<QPainterPath::Element> &path, uint fillRule, bool convex)
: pathData(path, fillRule, convex),
path(pathData.points.data(), path.size(),
pathData.elements.data(), pathData.flags) {}
const QVectorPath &vectorPath() {
return path;
}
struct QVectorPathData {
QVectorPathData(const QVector<QPainterPath::Element> &path, uint fillRule, bool convex)
: elements(path.size()),
points(path.size() * 2),
flags(0)
{
int ptsPos = 0;
bool isLines = true;
for (int i=0; i<path.size(); ++i) {
const QPainterPath::Element &e = path.at(i);
elements[i] = e.type;
points[ptsPos++] = e.x;
points[ptsPos++] = e.y;
if (e.type == QPainterPath::CurveToElement)
flags |= QVectorPath::CurvedShapeMask;
// This is to check if the path contains only alternating lineTo/moveTo,
// in which case we can set the LinesHint in the path. MoveTo is 0 and
// LineTo is 1 so the i%2 gets us what we want cheaply.
isLines = isLines && e.type == (QPainterPath::ElementType) (i%2);
}
if (fillRule == Qt::WindingFill)
flags |= QVectorPath::WindingFill;
else
flags |= QVectorPath::OddEvenFill;
if (isLines)
flags |= QVectorPath::LinesShapeMask;
else {
flags |= QVectorPath::AreaShapeMask;
if (!convex)
flags |= QVectorPath::NonConvexShapeMask;
}
}
QVarLengthArray<QPainterPath::ElementType> elements;
QVarLengthArray<qreal> points;
uint flags;
};
QVectorPathData pathData;
QVectorPath path;
private:
Q_DISABLE_COPY(QVectorPathConverter)
};
class QPainterPathData : public QPainterPathPrivate
{
public:
QPainterPathData() :
cStart(0),
fillRule(Qt::OddEvenFill),
dirtyBounds(false),
dirtyControlBounds(false),
pathConverter(0)
{
ref = 1;
require_moveTo = false;
convex = false;
}
QPainterPathData(const QPainterPathData &other) :
QPainterPathPrivate(), cStart(other.cStart), fillRule(other.fillRule),
bounds(other.bounds),
controlBounds(other.controlBounds),
dirtyBounds(other.dirtyBounds),
dirtyControlBounds(other.dirtyControlBounds),
convex(other.convex),
pathConverter(0)
{
ref = 1;
require_moveTo = false;
elements = other.elements;
}
~QPainterPathData() {
delete pathConverter;
}
inline bool isClosed() const;
inline void close();
inline void maybeMoveTo();
const QVectorPath &vectorPath() {
if (!pathConverter)
pathConverter = new QVectorPathConverter(elements, fillRule, convex);
return pathConverter->path;
}
int cStart;
Qt::FillRule fillRule;
QRectF bounds;
QRectF controlBounds;
uint require_moveTo : 1;
uint dirtyBounds : 1;
uint dirtyControlBounds : 1;
uint convex : 1;
QVectorPathConverter *pathConverter;
};
inline const QPainterPath QVectorPath::convertToPainterPath() const
{
QPainterPath path;
path.ensureData();
QPainterPathData *data = path.d_func();
data->elements.reserve(m_count);
int index = 0;
data->elements[0].x = m_points[index++];
data->elements[0].y = m_points[index++];
if (m_elements) {
data->elements[0].type = m_elements[0];
for (int i=1; i<m_count; ++i) {
QPainterPath::Element element;
element.x = m_points[index++];
element.y = m_points[index++];
element.type = m_elements[i];
data->elements << element;
}
} else {
data->elements[0].type = QPainterPath::MoveToElement;
for (int i=1; i<m_count; ++i) {
QPainterPath::Element element;
element.x = m_points[index++];
element.y = m_points[index++];
element.type = QPainterPath::LineToElement;
data->elements << element;
}
}
if (m_hints & OddEvenFill)
data->fillRule = Qt::OddEvenFill;
else
data->fillRule = Qt::WindingFill;
return path;
}
void Q_GUI_EXPORT qt_find_ellipse_coords(const QRectF &r, qreal angle, qreal length,
QPointF* startPoint, QPointF *endPoint);
inline bool QPainterPathData::isClosed() const
{
const QPainterPath::Element &first = elements.at(cStart);
const QPainterPath::Element &last = elements.last();
return first.x == last.x && first.y == last.y;
}
inline void QPainterPathData::close()
{
Q_ASSERT(ref == 1);
require_moveTo = true;
const QPainterPath::Element &first = elements.at(cStart);
QPainterPath::Element &last = elements.last();
if (first.x != last.x || first.y != last.y) {
if (qFuzzyCompare(first.x, last.x) && qFuzzyCompare(first.y, last.y)) {
last.x = first.x;
last.y = first.y;
} else {
QPainterPath::Element e = { first.x, first.y, QPainterPath::LineToElement };
elements << e;
}
}
}
inline void QPainterPathData::maybeMoveTo()
{
if (require_moveTo) {
QPainterPath::Element e = elements.last();
e.type = QPainterPath::MoveToElement;
elements.append(e);
require_moveTo = false;
}
}
#define KAPPA 0.5522847498
QT_END_NAMESPACE
#endif // QPAINTERPATH_P_H
|