author | Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com> |
Tue, 06 Jul 2010 15:10:48 +0300 | |
changeset 30 | 5dc02b23752f |
parent 18 | 2f34d5167611 |
permissions | -rw-r--r-- |
0 | 1 |
/**************************************************************************** |
2 |
** |
|
18
2f34d5167611
Revision: 201011
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
3
diff
changeset
|
3 |
** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies). |
0 | 4 |
** All rights reserved. |
5 |
** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 |
** |
|
7 |
** This file is part of the QtGui module of the Qt Toolkit. |
|
8 |
** |
|
9 |
** $QT_BEGIN_LICENSE:LGPL$ |
|
10 |
** No Commercial Usage |
|
11 |
** This file contains pre-release code and may not be distributed. |
|
12 |
** You may use this file in accordance with the terms and conditions |
|
13 |
** contained in the Technology Preview License Agreement accompanying |
|
14 |
** this package. |
|
15 |
** |
|
16 |
** GNU Lesser General Public License Usage |
|
17 |
** Alternatively, this file may be used under the terms of the GNU Lesser |
|
18 |
** General Public License version 2.1 as published by the Free Software |
|
19 |
** Foundation and appearing in the file LICENSE.LGPL included in the |
|
20 |
** packaging of this file. Please review the following information to |
|
21 |
** ensure the GNU Lesser General Public License version 2.1 requirements |
|
22 |
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
23 |
** |
|
24 |
** In addition, as a special exception, Nokia gives you certain additional |
|
25 |
** rights. These rights are described in the Nokia Qt LGPL Exception |
|
26 |
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
|
27 |
** |
|
28 |
** If you have questions regarding the use of this file, please contact |
|
29 |
** Nokia at qt-info@nokia.com. |
|
30 |
** |
|
31 |
** |
|
32 |
** |
|
33 |
** |
|
34 |
** |
|
35 |
** |
|
36 |
** |
|
37 |
** |
|
38 |
** $QT_END_LICENSE$ |
|
39 |
** |
|
40 |
****************************************************************************/ |
|
41 |
||
42 |
#include "qpainterpath.h" |
|
43 |
#include "qpainterpath_p.h" |
|
44 |
||
45 |
#include <qbitmap.h> |
|
46 |
#include <qdebug.h> |
|
47 |
#include <qiodevice.h> |
|
48 |
#include <qlist.h> |
|
49 |
#include <qmatrix.h> |
|
50 |
#include <qpen.h> |
|
51 |
#include <qpolygon.h> |
|
52 |
#include <qtextlayout.h> |
|
53 |
#include <qvarlengtharray.h> |
|
54 |
#include <qmath.h> |
|
55 |
||
56 |
#include <private/qbezier_p.h> |
|
57 |
#include <private/qfontengine_p.h> |
|
58 |
#include <private/qnumeric_p.h> |
|
59 |
#include <private/qobject_p.h> |
|
60 |
#include <private/qpathclipper_p.h> |
|
61 |
#include <private/qstroker_p.h> |
|
62 |
#include <private/qtextengine_p.h> |
|
63 |
||
64 |
#include <limits.h> |
|
65 |
||
66 |
#if 0 |
|
67 |
#include <performance.h> |
|
68 |
#else |
|
69 |
#define PM_INIT |
|
70 |
#define PM_MEASURE(x) |
|
71 |
#define PM_DISPLAY |
|
72 |
#endif |
|
73 |
||
74 |
QT_BEGIN_NAMESPACE |
|
75 |
||
76 |
struct QPainterPathPrivateDeleter |
|
77 |
{ |
|
78 |
static inline void cleanup(QPainterPathPrivate *d) |
|
79 |
{ |
|
80 |
// note - we must up-cast to QPainterPathData since QPainterPathPrivate |
|
81 |
// has a non-virtual destructor! |
|
82 |
if (d && !d->ref.deref()) |
|
83 |
delete static_cast<QPainterPathData *>(d); |
|
84 |
} |
|
85 |
}; |
|
86 |
||
87 |
// This value is used to determine the length of control point vectors |
|
88 |
// when approximating arc segments as curves. The factor is multiplied |
|
89 |
// with the radius of the circle. |
|
90 |
||
91 |
// #define QPP_DEBUG |
|
92 |
// #define QPP_STROKE_DEBUG |
|
93 |
//#define QPP_FILLPOLYGONS_DEBUG |
|
94 |
||
95 |
QPainterPath qt_stroke_dash(const QPainterPath &path, qreal *dashes, int dashCount); |
|
96 |
||
97 |
void qt_find_ellipse_coords(const QRectF &r, qreal angle, qreal length, |
|
98 |
QPointF* startPoint, QPointF *endPoint) |
|
99 |
{ |
|
100 |
if (r.isNull()) { |
|
101 |
if (startPoint) |
|
102 |
*startPoint = QPointF(); |
|
103 |
if (endPoint) |
|
104 |
*endPoint = QPointF(); |
|
105 |
return; |
|
106 |
} |
|
107 |
||
108 |
qreal w2 = r.width() / 2; |
|
109 |
qreal h2 = r.height() / 2; |
|
110 |
||
111 |
qreal angles[2] = { angle, angle + length }; |
|
112 |
QPointF *points[2] = { startPoint, endPoint }; |
|
113 |
||
114 |
for (int i = 0; i < 2; ++i) { |
|
115 |
if (!points[i]) |
|
116 |
continue; |
|
117 |
||
118 |
qreal theta = angles[i] - 360 * qFloor(angles[i] / 360); |
|
119 |
qreal t = theta / 90; |
|
120 |
// truncate |
|
121 |
int quadrant = int(t); |
|
122 |
t -= quadrant; |
|
123 |
||
124 |
t = qt_t_for_arc_angle(90 * t); |
|
125 |
||
126 |
// swap x and y? |
|
127 |
if (quadrant & 1) |
|
128 |
t = 1 - t; |
|
129 |
||
130 |
qreal a, b, c, d; |
|
131 |
QBezier::coefficients(t, a, b, c, d); |
|
132 |
QPointF p(a + b + c*QT_PATH_KAPPA, d + c + b*QT_PATH_KAPPA); |
|
133 |
||
134 |
// left quadrants |
|
135 |
if (quadrant == 1 || quadrant == 2) |
|
136 |
p.rx() = -p.x(); |
|
137 |
||
138 |
// top quadrants |
|
139 |
if (quadrant == 0 || quadrant == 1) |
|
140 |
p.ry() = -p.y(); |
|
141 |
||
142 |
*points[i] = r.center() + QPointF(w2 * p.x(), h2 * p.y()); |
|
143 |
} |
|
144 |
} |
|
145 |
||
146 |
#ifdef QPP_DEBUG |
|
147 |
static void qt_debug_path(const QPainterPath &path) |
|
148 |
{ |
|
149 |
const char *names[] = { |
|
150 |
"MoveTo ", |
|
151 |
"LineTo ", |
|
152 |
"CurveTo ", |
|
153 |
"CurveToData" |
|
154 |
}; |
|
155 |
||
156 |
printf("\nQPainterPath: elementCount=%d\n", path.elementCount()); |
|
157 |
for (int i=0; i<path.elementCount(); ++i) { |
|
158 |
const QPainterPath::Element &e = path.elementAt(i); |
|
159 |
Q_ASSERT(e.type >= 0 && e.type <= QPainterPath::CurveToDataElement); |
|
160 |
printf(" - %3d:: %s, (%.2f, %.2f)\n", i, names[e.type], e.x, e.y); |
|
161 |
} |
|
162 |
} |
|
163 |
#endif |
|
164 |
||
165 |
/*! |
|
166 |
\class QPainterPath |
|
167 |
\ingroup painting |
|
168 |
\ingroup shared |
|
169 |
||
170 |
\brief The QPainterPath class provides a container for painting operations, |
|
171 |
enabling graphical shapes to be constructed and reused. |
|
172 |
||
173 |
A painter path is an object composed of a number of graphical |
|
174 |
building blocks, such as rectangles, ellipses, lines, and curves. |
|
175 |
Building blocks can be joined in closed subpaths, for example as a |
|
176 |
rectangle or an ellipse. A closed path has coinciding start and |
|
177 |
end points. Or they can exist independently as unclosed subpaths, |
|
178 |
such as lines and curves. |
|
179 |
||
180 |
A QPainterPath object can be used for filling, outlining, and |
|
181 |
clipping. To generate fillable outlines for a given painter path, |
|
182 |
use the QPainterPathStroker class. The main advantage of painter |
|
183 |
paths over normal drawing operations is that complex shapes only |
|
184 |
need to be created once; then they can be drawn many times using |
|
185 |
only calls to the QPainter::drawPath() function. |
|
186 |
||
187 |
QPainterPath provides a collection of functions that can be used |
|
188 |
to obtain information about the path and its elements. In addition |
|
189 |
it is possible to reverse the order of the elements using the |
|
190 |
toReversed() function. There are also several functions to convert |
|
191 |
this painter path object into a polygon representation. |
|
192 |
||
193 |
\tableofcontents |
|
194 |
||
195 |
\section1 Composing a QPainterPath |
|
196 |
||
197 |
A QPainterPath object can be constructed as an empty path, with a |
|
198 |
given start point, or as a copy of another QPainterPath object. |
|
199 |
Once created, lines and curves can be added to the path using the |
|
200 |
lineTo(), arcTo(), cubicTo() and quadTo() functions. The lines and |
|
201 |
curves stretch from the currentPosition() to the position passed |
|
202 |
as argument. |
|
203 |
||
204 |
The currentPosition() of the QPainterPath object is always the end |
|
205 |
position of the last subpath that was added (or the initial start |
|
206 |
point). Use the moveTo() function to move the currentPosition() |
|
207 |
without adding a component. The moveTo() function implicitly |
|
208 |
starts a new subpath, and closes the previous one. Another way of |
|
209 |
starting a new subpath is to call the closeSubpath() function |
|
210 |
which closes the current path by adding a line from the |
|
211 |
currentPosition() back to the path's start position. Note that the |
|
212 |
new path will have (0, 0) as its initial currentPosition(). |
|
213 |
||
214 |
QPainterPath class also provides several convenience functions to |
|
215 |
add closed subpaths to a painter path: addEllipse(), addPath(), |
|
216 |
addRect(), addRegion() and addText(). The addPolygon() function |
|
217 |
adds an \e unclosed subpath. In fact, these functions are all |
|
218 |
collections of moveTo(), lineTo() and cubicTo() operations. |
|
219 |
||
220 |
In addition, a path can be added to the current path using the |
|
221 |
connectPath() function. But note that this function will connect |
|
222 |
the last element of the current path to the first element of given |
|
223 |
one by adding a line. |
|
224 |
||
225 |
Below is a code snippet that shows how a QPainterPath object can |
|
226 |
be used: |
|
227 |
||
228 |
\table 100% |
|
229 |
\row |
|
230 |
\o \inlineimage qpainterpath-construction.png |
|
231 |
\o |
|
232 |
\snippet doc/src/snippets/code/src_gui_painting_qpainterpath.cpp 0 |
|
233 |
\endtable |
|
234 |
||
235 |
The painter path is initially empty when constructed. We first add |
|
236 |
a rectangle, which is a closed subpath. Then we add two bezier |
|
237 |
curves which together form a closed subpath even though they are |
|
238 |
not closed individually. Finally we draw the entire path. The path |
|
239 |
is filled using the default fill rule, Qt::OddEvenFill. Qt |
|
240 |
provides two methods for filling paths: |
|
241 |
||
242 |
\table |
|
243 |
\row |
|
244 |
\o \inlineimage qt-fillrule-oddeven.png |
|
245 |
\o \inlineimage qt-fillrule-winding.png |
|
246 |
\header |
|
247 |
\o Qt::OddEvenFill |
|
248 |
\o Qt::WindingFill |
|
249 |
\endtable |
|
250 |
||
251 |
See the Qt::FillRule documentation for the definition of the |
|
252 |
rules. A painter path's currently set fill rule can be retrieved |
|
253 |
using the fillRule() function, and altered using the setFillRule() |
|
254 |
function. |
|
255 |
||
256 |
\section1 QPainterPath Information |
|
257 |
||
258 |
The QPainterPath class provides a collection of functions that |
|
259 |
returns information about the path and its elements. |
|
260 |
||
261 |
The currentPosition() function returns the end point of the last |
|
262 |
subpath that was added (or the initial start point). The |
|
263 |
elementAt() function can be used to retrieve the various subpath |
|
264 |
elements, the \e number of elements can be retrieved using the |
|
265 |
elementCount() function, and the isEmpty() function tells whether |
|
266 |
this QPainterPath object contains any elements at all. |
|
267 |
||
268 |
The controlPointRect() function returns the rectangle containing |
|
269 |
all the points and control points in this path. This function is |
|
270 |
significantly faster to compute than the exact boundingRect() |
|
271 |
which returns the bounding rectangle of this painter path with |
|
272 |
floating point precision. |
|
273 |
||
274 |
Finally, QPainterPath provides the contains() function which can |
|
275 |
be used to determine whether a given point or rectangle is inside |
|
276 |
the path, and the intersects() function which determines if any of |
|
277 |
the points inside a given rectangle also are inside this path. |
|
278 |
||
279 |
\section1 QPainterPath Conversion |
|
280 |
||
281 |
For compatibility reasons, it might be required to simplify the |
|
282 |
representation of a painter path: QPainterPath provides the |
|
283 |
toFillPolygon(), toFillPolygons() and toSubpathPolygons() |
|
284 |
functions which convert the painter path into a polygon. The |
|
285 |
toFillPolygon() returns the painter path as one single polygon, |
|
286 |
while the two latter functions return a list of polygons. |
|
287 |
||
288 |
The toFillPolygons() and toSubpathPolygons() functions are |
|
289 |
provided because it is usually faster to draw several small |
|
290 |
polygons than to draw one large polygon, even though the total |
|
291 |
number of points drawn is the same. The difference between the two |
|
292 |
is the \e number of polygons they return: The toSubpathPolygons() |
|
293 |
creates one polygon for each subpath regardless of intersecting |
|
294 |
subpaths (i.e. overlapping bounding rectangles), while the |
|
295 |
toFillPolygons() functions creates only one polygon for |
|
296 |
overlapping subpaths. |
|
297 |
||
298 |
The toFillPolygon() and toFillPolygons() functions first convert |
|
299 |
all the subpaths to polygons, then uses a rewinding technique to |
|
300 |
make sure that overlapping subpaths can be filled using the |
|
301 |
correct fill rule. Note that rewinding inserts additional lines in |
|
302 |
the polygon so the outline of the fill polygon does not match the |
|
303 |
outline of the path. |
|
304 |
||
305 |
\section1 Examples |
|
306 |
||
307 |
Qt provides the \l {painting/painterpaths}{Painter Paths Example} |
|
308 |
and the \l {demos/deform}{Vector Deformation Demo} which are |
|
309 |
located in Qt's example and demo directories respectively. |
|
310 |
||
311 |
The \l {painting/painterpaths}{Painter Paths Example} shows how |
|
312 |
painter paths can be used to build complex shapes for rendering |
|
313 |
and lets the user experiment with the filling and stroking. The |
|
314 |
\l {demos/deform}{Vector Deformation Demo} shows how to use |
|
315 |
QPainterPath to draw text. |
|
316 |
||
317 |
\table |
|
318 |
\row |
|
319 |
\o \inlineimage qpainterpath-example.png |
|
320 |
\o \inlineimage qpainterpath-demo.png |
|
321 |
\header |
|
322 |
\o \l {painting/painterpaths}{Painter Paths Example} |
|
323 |
\o \l {demos/deform}{Vector Deformation Demo} |
|
324 |
\endtable |
|
325 |
||
326 |
\sa QPainterPathStroker, QPainter, QRegion, {Painter Paths Example} |
|
327 |
*/ |
|
328 |
||
329 |
/*! |
|
330 |
\enum QPainterPath::ElementType |
|
331 |
||
332 |
This enum describes the types of elements used to connect vertices |
|
333 |
in subpaths. |
|
334 |
||
335 |
Note that elements added as closed subpaths using the |
|
336 |
addEllipse(), addPath(), addPolygon(), addRect(), addRegion() and |
|
337 |
addText() convenience functions, is actually added to the path as |
|
338 |
a collection of separate elements using the moveTo(), lineTo() and |
|
339 |
cubicTo() functions. |
|
340 |
||
341 |
\value MoveToElement A new subpath. See also moveTo(). |
|
342 |
\value LineToElement A line. See also lineTo(). |
|
343 |
\value CurveToElement A curve. See also cubicTo() and quadTo(). |
|
344 |
\value CurveToDataElement The extra data required to describe a curve in |
|
345 |
a CurveToElement element. |
|
346 |
||
347 |
\sa elementAt(), elementCount() |
|
348 |
*/ |
|
349 |
||
350 |
/*! |
|
351 |
\class QPainterPath::Element |
|
352 |
||
353 |
\brief The QPainterPath::Element class specifies the position and |
|
354 |
type of a subpath. |
|
355 |
||
356 |
Once a QPainterPath object is constructed, subpaths like lines and |
|
357 |
curves can be added to the path (creating |
|
358 |
QPainterPath::LineToElement and QPainterPath::CurveToElement |
|
359 |
components). |
|
360 |
||
361 |
The lines and curves stretch from the currentPosition() to the |
|
362 |
position passed as argument. The currentPosition() of the |
|
363 |
QPainterPath object is always the end position of the last subpath |
|
364 |
that was added (or the initial start point). The moveTo() function |
|
365 |
can be used to move the currentPosition() without adding a line or |
|
366 |
curve, creating a QPainterPath::MoveToElement component. |
|
367 |
||
368 |
\sa QPainterPath |
|
369 |
*/ |
|
370 |
||
371 |
/*! |
|
372 |
\variable QPainterPath::Element::x |
|
373 |
\brief the x coordinate of the element's position. |
|
374 |
||
375 |
\sa {operator QPointF()} |
|
376 |
*/ |
|
377 |
||
378 |
/*! |
|
379 |
\variable QPainterPath::Element::y |
|
380 |
\brief the y coordinate of the element's position. |
|
381 |
||
382 |
\sa {operator QPointF()} |
|
383 |
*/ |
|
384 |
||
385 |
/*! |
|
386 |
\variable QPainterPath::Element::type |
|
387 |
\brief the type of element |
|
388 |
||
389 |
\sa isCurveTo(), isLineTo(), isMoveTo() |
|
390 |
*/ |
|
391 |
||
392 |
/*! |
|
393 |
\fn bool QPainterPath::Element::operator==(const Element &other) const |
|
394 |
\since 4.2 |
|
395 |
||
396 |
Returns true if this element is equal to \a other; |
|
397 |
otherwise returns false. |
|
398 |
||
399 |
\sa operator!=() |
|
400 |
*/ |
|
401 |
||
402 |
/*! |
|
403 |
\fn bool QPainterPath::Element::operator!=(const Element &other) const |
|
404 |
\since 4.2 |
|
405 |
||
406 |
Returns true if this element is not equal to \a other; |
|
407 |
otherwise returns false. |
|
408 |
||
409 |
\sa operator==() |
|
410 |
*/ |
|
411 |
||
412 |
/*! |
|
413 |
\fn bool QPainterPath::Element::isCurveTo () const |
|
414 |
||
415 |
Returns true if the element is a curve, otherwise returns false. |
|
416 |
||
417 |
\sa type, QPainterPath::CurveToElement |
|
418 |
*/ |
|
419 |
||
420 |
/*! |
|
421 |
\fn bool QPainterPath::Element::isLineTo () const |
|
422 |
||
423 |
Returns true if the element is a line, otherwise returns false. |
|
424 |
||
425 |
\sa type, QPainterPath::LineToElement |
|
426 |
*/ |
|
427 |
||
428 |
/*! |
|
429 |
\fn bool QPainterPath::Element::isMoveTo () const |
|
430 |
||
431 |
Returns true if the element is moving the current position, |
|
432 |
otherwise returns false. |
|
433 |
||
434 |
\sa type, QPainterPath::MoveToElement |
|
435 |
*/ |
|
436 |
||
437 |
/*! |
|
438 |
\fn QPainterPath::Element::operator QPointF () const |
|
439 |
||
440 |
Returns the element's position. |
|
441 |
||
442 |
\sa x, y |
|
443 |
*/ |
|
444 |
||
445 |
/*! |
|
446 |
\fn void QPainterPath::addEllipse(qreal x, qreal y, qreal width, qreal height) |
|
447 |
\overload |
|
448 |
||
449 |
Creates an ellipse within the bounding rectangle defined by its top-left |
|
450 |
corner at (\a x, \a y), \a width and \a height, and adds it to the |
|
451 |
painter path as a closed subpath. |
|
452 |
*/ |
|
453 |
||
454 |
/*! |
|
455 |
\since 4.4 |
|
456 |
||
457 |
\fn void QPainterPath::addEllipse(const QPointF ¢er, qreal rx, qreal ry) |
|
458 |
\overload |
|
459 |
||
460 |
Creates an ellipse positioned at \a{center} with radii \a{rx} and \a{ry}, |
|
461 |
and adds it to the painter path as a closed subpath. |
|
462 |
*/ |
|
463 |
||
464 |
/*! |
|
465 |
\fn void QPainterPath::addText(qreal x, qreal y, const QFont &font, const QString &text) |
|
466 |
\overload |
|
467 |
||
468 |
Adds the given \a text to this path as a set of closed subpaths created |
|
469 |
from the \a font supplied. The subpaths are positioned so that the left |
|
470 |
end of the text's baseline lies at the point specified by (\a x, \a y). |
|
471 |
*/ |
|
472 |
||
473 |
/*! |
|
474 |
\fn int QPainterPath::elementCount() const |
|
475 |
||
476 |
Returns the number of path elements in the painter path. |
|
477 |
||
478 |
\sa ElementType, elementAt(), isEmpty() |
|
479 |
*/ |
|
480 |
||
481 |
/*! |
|
482 |
\fn const QPainterPath::Element &QPainterPath::elementAt(int index) const |
|
483 |
||
484 |
Returns the element at the given \a index in the painter path. |
|
485 |
||
486 |
\sa ElementType, elementCount(), isEmpty() |
|
487 |
*/ |
|
488 |
||
489 |
/*! |
|
490 |
\fn void QPainterPath::setElementPositionAt(int index, qreal x, qreal y) |
|
491 |
\since 4.2 |
|
492 |
||
493 |
Sets the x and y coordinate of the element at index \a index to \a |
|
494 |
x and \a y. |
|
495 |
*/ |
|
496 |
||
497 |
/*### |
|
498 |
\fn QPainterPath &QPainterPath::operator +=(const QPainterPath &other) |
|
499 |
||
500 |
Appends the \a other painter path to this painter path and returns a |
|
501 |
reference to the result. |
|
502 |
*/ |
|
503 |
||
504 |
/*! |
|
505 |
Constructs an empty QPainterPath object. |
|
506 |
*/ |
|
507 |
QPainterPath::QPainterPath() |
|
508 |
: d_ptr(0) |
|
509 |
{ |
|
510 |
} |
|
511 |
||
512 |
/*! |
|
513 |
\fn QPainterPath::QPainterPath(const QPainterPath &path) |
|
514 |
||
515 |
Creates a QPainterPath object that is a copy of the given \a path. |
|
516 |
||
517 |
\sa operator=() |
|
518 |
*/ |
|
519 |
QPainterPath::QPainterPath(const QPainterPath &other) |
|
520 |
: d_ptr(other.d_ptr.data()) |
|
521 |
{ |
|
522 |
if (d_ptr) |
|
523 |
d_ptr->ref.ref(); |
|
524 |
} |
|
525 |
||
526 |
/*! |
|
527 |
Creates a QPainterPath object with the given \a startPoint as its |
|
528 |
current position. |
|
529 |
*/ |
|
530 |
||
531 |
QPainterPath::QPainterPath(const QPointF &startPoint) |
|
532 |
: d_ptr(new QPainterPathData) |
|
533 |
{ |
|
534 |
Element e = { startPoint.x(), startPoint.y(), MoveToElement }; |
|
535 |
d_func()->elements << e; |
|
536 |
} |
|
537 |
||
538 |
/*! |
|
539 |
\internal |
|
540 |
*/ |
|
541 |
void QPainterPath::detach_helper() |
|
542 |
{ |
|
543 |
QPainterPathPrivate *data = new QPainterPathData(*d_func()); |
|
544 |
d_ptr.reset(data); |
|
545 |
} |
|
546 |
||
547 |
/*! |
|
548 |
\internal |
|
549 |
*/ |
|
550 |
void QPainterPath::ensureData_helper() |
|
551 |
{ |
|
552 |
QPainterPathPrivate *data = new QPainterPathData; |
|
553 |
data->elements.reserve(16); |
|
554 |
QPainterPath::Element e = { 0, 0, QPainterPath::MoveToElement }; |
|
555 |
data->elements << e; |
|
556 |
d_ptr.reset(data); |
|
557 |
Q_ASSERT(d_ptr != 0); |
|
558 |
} |
|
559 |
||
560 |
/*! |
|
561 |
\fn QPainterPath &QPainterPath::operator=(const QPainterPath &path) |
|
562 |
||
563 |
Assigns the given \a path to this painter path. |
|
564 |
||
565 |
\sa QPainterPath() |
|
566 |
*/ |
|
567 |
QPainterPath &QPainterPath::operator=(const QPainterPath &other) |
|
568 |
{ |
|
569 |
if (other.d_func() != d_func()) { |
|
570 |
QPainterPathPrivate *data = other.d_func(); |
|
571 |
if (data) |
|
572 |
data->ref.ref(); |
|
573 |
d_ptr.reset(data); |
|
574 |
} |
|
575 |
return *this; |
|
576 |
} |
|
577 |
||
578 |
/*! |
|
579 |
Destroys this QPainterPath object. |
|
580 |
*/ |
|
581 |
QPainterPath::~QPainterPath() |
|
582 |
{ |
|
583 |
} |
|
584 |
||
585 |
/*! |
|
586 |
Closes the current subpath by drawing a line to the beginning of |
|
587 |
the subpath, automatically starting a new path. The current point |
|
588 |
of the new path is (0, 0). |
|
589 |
||
590 |
If the subpath does not contain any elements, this function does |
|
591 |
nothing. |
|
592 |
||
593 |
\sa moveTo(), {QPainterPath#Composing a QPainterPath}{Composing |
|
594 |
a QPainterPath} |
|
595 |
*/ |
|
596 |
void QPainterPath::closeSubpath() |
|
597 |
{ |
|
598 |
#ifdef QPP_DEBUG |
|
599 |
printf("QPainterPath::closeSubpath()\n"); |
|
600 |
#endif |
|
601 |
if (isEmpty()) |
|
602 |
return; |
|
603 |
detach(); |
|
604 |
||
605 |
d_func()->close(); |
|
606 |
} |
|
607 |
||
608 |
/*! |
|
609 |
\fn void QPainterPath::moveTo(qreal x, qreal y) |
|
610 |
||
611 |
\overload |
|
612 |
||
613 |
Moves the current position to (\a{x}, \a{y}) and starts a new |
|
614 |
subpath, implicitly closing the previous path. |
|
615 |
*/ |
|
616 |
||
617 |
/*! |
|
618 |
\fn void QPainterPath::moveTo(const QPointF &point) |
|
619 |
||
620 |
Moves the current point to the given \a point, implicitly starting |
|
621 |
a new subpath and closing the previous one. |
|
622 |
||
623 |
\sa closeSubpath(), {QPainterPath#Composing a |
|
624 |
QPainterPath}{Composing a QPainterPath} |
|
625 |
*/ |
|
626 |
void QPainterPath::moveTo(const QPointF &p) |
|
627 |
{ |
|
628 |
#ifdef QPP_DEBUG |
|
629 |
printf("QPainterPath::moveTo() (%.2f,%.2f)\n", p.x(), p.y()); |
|
630 |
#endif |
|
631 |
#ifndef QT_NO_DEBUG |
|
632 |
if (qt_is_nan(p.x()) || qt_is_nan(p.y())) |
|
633 |
qWarning("QPainterPath::moveTo: Adding point where x or y is NaN, results are undefined"); |
|
634 |
#endif |
|
635 |
ensureData(); |
|
636 |
detach(); |
|
637 |
||
638 |
QPainterPathData *d = d_func(); |
|
639 |
Q_ASSERT(!d->elements.isEmpty()); |
|
640 |
||
641 |
d->require_moveTo = false; |
|
642 |
||
643 |
if (d->elements.last().type == MoveToElement) { |
|
644 |
d->elements.last().x = p.x(); |
|
645 |
d->elements.last().y = p.y(); |
|
646 |
} else { |
|
647 |
Element elm = { p.x(), p.y(), MoveToElement }; |
|
648 |
d->elements.append(elm); |
|
649 |
} |
|
650 |
d->cStart = d->elements.size() - 1; |
|
651 |
} |
|
652 |
||
653 |
/*! |
|
654 |
\fn void QPainterPath::lineTo(qreal x, qreal y) |
|
655 |
||
656 |
\overload |
|
657 |
||
658 |
Draws a line from the current position to the point (\a{x}, |
|
659 |
\a{y}). |
|
660 |
*/ |
|
661 |
||
662 |
/*! |
|
663 |
\fn void QPainterPath::lineTo(const QPointF &endPoint) |
|
664 |
||
665 |
Adds a straight line from the current position to the given \a |
|
666 |
endPoint. After the line is drawn, the current position is updated |
|
667 |
to be at the end point of the line. |
|
668 |
||
669 |
\sa addPolygon(), addRect(), {QPainterPath#Composing a |
|
670 |
QPainterPath}{Composing a QPainterPath} |
|
671 |
*/ |
|
672 |
void QPainterPath::lineTo(const QPointF &p) |
|
673 |
{ |
|
674 |
#ifdef QPP_DEBUG |
|
675 |
printf("QPainterPath::lineTo() (%.2f,%.2f)\n", p.x(), p.y()); |
|
676 |
#endif |
|
677 |
#ifndef QT_NO_DEBUG |
|
678 |
if (qt_is_nan(p.x()) || qt_is_nan(p.y())) |
|
679 |
qWarning("QPainterPath::lineTo: Adding point where x or y is NaN, results are undefined"); |
|
680 |
#endif |
|
681 |
ensureData(); |
|
682 |
detach(); |
|
683 |
||
684 |
QPainterPathData *d = d_func(); |
|
685 |
Q_ASSERT(!d->elements.isEmpty()); |
|
686 |
d->maybeMoveTo(); |
|
687 |
if (p == QPointF(d->elements.last())) |
|
688 |
return; |
|
689 |
Element elm = { p.x(), p.y(), LineToElement }; |
|
690 |
d->elements.append(elm); |
|
3
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
691 |
|
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
692 |
d->convex = d->elements.size() == 3 || (d->elements.size() == 4 && d->isClosed()); |
0 | 693 |
} |
694 |
||
695 |
/*! |
|
696 |
\fn void QPainterPath::cubicTo(qreal c1X, qreal c1Y, qreal c2X, |
|
697 |
qreal c2Y, qreal endPointX, qreal endPointY); |
|
698 |
||
699 |
\overload |
|
700 |
||
701 |
Adds a cubic Bezier curve between the current position and the end |
|
702 |
point (\a{endPointX}, \a{endPointY}) with control points specified |
|
703 |
by (\a{c1X}, \a{c1Y}) and (\a{c2X}, \a{c2Y}). |
|
704 |
*/ |
|
705 |
||
706 |
/*! |
|
707 |
\fn void QPainterPath::cubicTo(const QPointF &c1, const QPointF &c2, const QPointF &endPoint) |
|
708 |
||
709 |
Adds a cubic Bezier curve between the current position and the |
|
710 |
given \a endPoint using the control points specified by \a c1, and |
|
711 |
\a c2. |
|
712 |
||
713 |
After the curve is added, the current position is updated to be at |
|
714 |
the end point of the curve. |
|
715 |
||
716 |
\table 100% |
|
717 |
\row |
|
718 |
\o \inlineimage qpainterpath-cubicto.png |
|
719 |
\o |
|
720 |
\snippet doc/src/snippets/code/src_gui_painting_qpainterpath.cpp 1 |
|
721 |
\endtable |
|
722 |
||
723 |
\sa quadTo(), {QPainterPath#Composing a QPainterPath}{Composing |
|
724 |
a QPainterPath} |
|
725 |
*/ |
|
726 |
void QPainterPath::cubicTo(const QPointF &c1, const QPointF &c2, const QPointF &e) |
|
727 |
{ |
|
728 |
#ifdef QPP_DEBUG |
|
729 |
printf("QPainterPath::cubicTo() (%.2f,%.2f), (%.2f,%.2f), (%.2f,%.2f)\n", |
|
730 |
c1.x(), c1.y(), c2.x(), c2.y(), e.x(), e.y()); |
|
731 |
#endif |
|
732 |
#ifndef QT_NO_DEBUG |
|
733 |
if (qt_is_nan(c1.x()) || qt_is_nan(c1.y()) || qt_is_nan(c2.x()) || qt_is_nan(c2.y()) |
|
734 |
|| qt_is_nan(e.x()) || qt_is_nan(e.y())) |
|
735 |
qWarning("QPainterPath::cubicTo: Adding point where x or y is NaN, results are undefined"); |
|
736 |
#endif |
|
737 |
ensureData(); |
|
738 |
detach(); |
|
739 |
||
740 |
QPainterPathData *d = d_func(); |
|
741 |
Q_ASSERT(!d->elements.isEmpty()); |
|
742 |
||
743 |
||
744 |
// Abort on empty curve as a stroker cannot handle this and the |
|
745 |
// curve is irrelevant anyway. |
|
746 |
if (d->elements.last() == c1 && c1 == c2 && c2 == e) |
|
747 |
return; |
|
748 |
||
749 |
d->maybeMoveTo(); |
|
750 |
||
751 |
Element ce1 = { c1.x(), c1.y(), CurveToElement }; |
|
752 |
Element ce2 = { c2.x(), c2.y(), CurveToDataElement }; |
|
753 |
Element ee = { e.x(), e.y(), CurveToDataElement }; |
|
754 |
d->elements << ce1 << ce2 << ee; |
|
755 |
} |
|
756 |
||
757 |
/*! |
|
758 |
\fn void QPainterPath::quadTo(qreal cx, qreal cy, qreal endPointX, qreal endPointY); |
|
759 |
||
760 |
\overload |
|
761 |
||
762 |
Adds a quadratic Bezier curve between the current point and the endpoint |
|
763 |
(\a{endPointX}, \a{endPointY}) with the control point specified by |
|
764 |
(\a{cx}, \a{cy}). |
|
765 |
*/ |
|
766 |
||
767 |
/*! |
|
768 |
\fn void QPainterPath::quadTo(const QPointF &c, const QPointF &endPoint) |
|
769 |
||
770 |
Adds a quadratic Bezier curve between the current position and the |
|
771 |
given \a endPoint with the control point specified by \a c. |
|
772 |
||
773 |
After the curve is added, the current point is updated to be at |
|
774 |
the end point of the curve. |
|
775 |
||
776 |
\sa cubicTo(), {QPainterPath#Composing a QPainterPath}{Composing a |
|
777 |
QPainterPath} |
|
778 |
*/ |
|
779 |
void QPainterPath::quadTo(const QPointF &c, const QPointF &e) |
|
780 |
{ |
|
781 |
#ifdef QPP_DEBUG |
|
782 |
printf("QPainterPath::quadTo() (%.2f,%.2f), (%.2f,%.2f)\n", |
|
783 |
c.x(), c.y(), e.x(), e.y()); |
|
784 |
#endif |
|
785 |
#ifndef QT_NO_DEBUG |
|
786 |
if (qt_is_nan(c.x()) || qt_is_nan(c.y()) || qt_is_nan(e.x()) || qt_is_nan(e.y())) |
|
787 |
qWarning("QPainterPath::quadTo: Adding point where x or y is NaN, results are undefined"); |
|
788 |
#endif |
|
789 |
ensureData(); |
|
790 |
detach(); |
|
791 |
||
792 |
Q_D(QPainterPath); |
|
793 |
Q_ASSERT(!d->elements.isEmpty()); |
|
794 |
const QPainterPath::Element &elm = d->elements.at(elementCount()-1); |
|
795 |
QPointF prev(elm.x, elm.y); |
|
796 |
||
797 |
// Abort on empty curve as a stroker cannot handle this and the |
|
798 |
// curve is irrelevant anyway. |
|
799 |
if (prev == c && c == e) |
|
800 |
return; |
|
801 |
||
802 |
QPointF c1((prev.x() + 2*c.x()) / 3, (prev.y() + 2*c.y()) / 3); |
|
803 |
QPointF c2((e.x() + 2*c.x()) / 3, (e.y() + 2*c.y()) / 3); |
|
804 |
cubicTo(c1, c2, e); |
|
805 |
} |
|
806 |
||
807 |
/*! |
|
808 |
\fn void QPainterPath::arcTo(qreal x, qreal y, qreal width, qreal |
|
809 |
height, qreal startAngle, qreal sweepLength) |
|
810 |
||
811 |
\overload |
|
812 |
||
813 |
Creates an arc that occupies the rectangle QRectF(\a x, \a y, \a |
|
814 |
width, \a height), beginning at the specified \a startAngle and |
|
815 |
extending \a sweepLength degrees counter-clockwise. |
|
816 |
||
817 |
*/ |
|
818 |
||
819 |
/*! |
|
820 |
\fn void QPainterPath::arcTo(const QRectF &rectangle, qreal startAngle, qreal sweepLength) |
|
821 |
||
822 |
Creates an arc that occupies the given \a rectangle, beginning at |
|
823 |
the specified \a startAngle and extending \a sweepLength degrees |
|
824 |
counter-clockwise. |
|
825 |
||
826 |
Angles are specified in degrees. Clockwise arcs can be specified |
|
827 |
using negative angles. |
|
828 |
||
829 |
Note that this function connects the starting point of the arc to |
|
830 |
the current position if they are not already connected. After the |
|
831 |
arc has been added, the current position is the last point in |
|
832 |
arc. To draw a line back to the first point, use the |
|
833 |
closeSubpath() function. |
|
834 |
||
835 |
\table 100% |
|
836 |
\row |
|
837 |
\o \inlineimage qpainterpath-arcto.png |
|
838 |
\o |
|
839 |
\snippet doc/src/snippets/code/src_gui_painting_qpainterpath.cpp 2 |
|
840 |
\endtable |
|
841 |
||
842 |
\sa arcMoveTo(), addEllipse(), QPainter::drawArc(), QPainter::drawPie(), |
|
843 |
{QPainterPath#Composing a QPainterPath}{Composing a |
|
844 |
QPainterPath} |
|
845 |
*/ |
|
846 |
void QPainterPath::arcTo(const QRectF &rect, qreal startAngle, qreal sweepLength) |
|
847 |
{ |
|
848 |
#ifdef QPP_DEBUG |
|
849 |
printf("QPainterPath::arcTo() (%.2f, %.2f, %.2f, %.2f, angle=%.2f, sweep=%.2f\n", |
|
850 |
rect.x(), rect.y(), rect.width(), rect.height(), startAngle, sweepLength); |
|
851 |
#endif |
|
852 |
#ifndef QT_NO_DEBUG |
|
853 |
if (qt_is_nan(rect.x()) || qt_is_nan(rect.y()) || qt_is_nan(rect.width()) || qt_is_nan(rect.height()) |
|
854 |
|| qt_is_nan(startAngle) || qt_is_nan(sweepLength)) |
|
855 |
qWarning("QPainterPath::arcTo: Adding arc where a parameter is NaN, results are undefined"); |
|
856 |
#endif |
|
857 |
if (rect.isNull()) |
|
858 |
return; |
|
859 |
||
860 |
ensureData(); |
|
861 |
detach(); |
|
862 |
||
863 |
int point_count; |
|
864 |
QPointF pts[15]; |
|
865 |
QPointF curve_start = qt_curves_for_arc(rect, startAngle, sweepLength, pts, &point_count); |
|
866 |
||
867 |
lineTo(curve_start); |
|
868 |
for (int i=0; i<point_count; i+=3) { |
|
869 |
cubicTo(pts[i].x(), pts[i].y(), |
|
870 |
pts[i+1].x(), pts[i+1].y(), |
|
871 |
pts[i+2].x(), pts[i+2].y()); |
|
872 |
} |
|
873 |
||
874 |
} |
|
875 |
||
876 |
||
877 |
/*! |
|
878 |
\fn void QPainterPath::arcMoveTo(qreal x, qreal y, qreal width, qreal height, qreal angle) |
|
879 |
\overload |
|
880 |
\since 4.2 |
|
881 |
||
882 |
Creates a move to that lies on the arc that occupies the |
|
883 |
QRectF(\a x, \a y, \a width, \a height) at \a angle. |
|
884 |
*/ |
|
885 |
||
886 |
||
887 |
/*! |
|
888 |
\fn void QPainterPath::arcMoveTo(const QRectF &rectangle, qreal angle) |
|
889 |
\since 4.2 |
|
890 |
||
891 |
Creates a move to that lies on the arc that occupies the given \a |
|
892 |
rectangle at \a angle. |
|
893 |
||
894 |
Angles are specified in degrees. Clockwise arcs can be specified |
|
895 |
using negative angles. |
|
896 |
||
897 |
\sa moveTo(), arcTo() |
|
898 |
*/ |
|
899 |
||
900 |
void QPainterPath::arcMoveTo(const QRectF &rect, qreal angle) |
|
901 |
{ |
|
902 |
if (rect.isNull()) |
|
903 |
return; |
|
904 |
||
905 |
QPointF pt; |
|
906 |
qt_find_ellipse_coords(rect, angle, 0, &pt, 0); |
|
907 |
moveTo(pt); |
|
908 |
} |
|
909 |
||
910 |
||
911 |
||
912 |
/*! |
|
913 |
\fn QPointF QPainterPath::currentPosition() const |
|
914 |
||
915 |
Returns the current position of the path. |
|
916 |
*/ |
|
917 |
QPointF QPainterPath::currentPosition() const |
|
918 |
{ |
|
919 |
return !d_ptr || d_func()->elements.isEmpty() |
|
920 |
? QPointF() |
|
921 |
: QPointF(d_func()->elements.last().x, d_func()->elements.last().y); |
|
922 |
} |
|
923 |
||
924 |
||
925 |
/*! |
|
926 |
\fn void QPainterPath::addRect(qreal x, qreal y, qreal width, qreal height) |
|
927 |
||
928 |
\overload |
|
929 |
||
930 |
Adds a rectangle at position (\a{x}, \a{y}), with the given \a |
|
931 |
width and \a height, as a closed subpath. |
|
932 |
*/ |
|
933 |
||
934 |
/*! |
|
935 |
\fn void QPainterPath::addRect(const QRectF &rectangle) |
|
936 |
||
937 |
Adds the given \a rectangle to this path as a closed subpath. |
|
938 |
||
939 |
The \a rectangle is added as a clockwise set of lines. The painter |
|
940 |
path's current position after the \a rectangle has been added is |
|
941 |
at the top-left corner of the rectangle. |
|
942 |
||
943 |
\table 100% |
|
944 |
\row |
|
945 |
\o \inlineimage qpainterpath-addrectangle.png |
|
946 |
\o |
|
947 |
\snippet doc/src/snippets/code/src_gui_painting_qpainterpath.cpp 3 |
|
948 |
\endtable |
|
949 |
||
950 |
\sa addRegion(), lineTo(), {QPainterPath#Composing a |
|
951 |
QPainterPath}{Composing a QPainterPath} |
|
952 |
*/ |
|
953 |
void QPainterPath::addRect(const QRectF &r) |
|
954 |
{ |
|
955 |
#ifndef QT_NO_DEBUG |
|
956 |
if (qt_is_nan(r.x()) || qt_is_nan(r.y()) || qt_is_nan(r.width()) || qt_is_nan(r.height())) |
|
957 |
qWarning("QPainterPath::addRect: Adding rect where a parameter is NaN, results are undefined"); |
|
958 |
#endif |
|
959 |
if (r.isNull()) |
|
960 |
return; |
|
961 |
||
962 |
ensureData(); |
|
963 |
detach(); |
|
964 |
||
3
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
965 |
bool first = d_func()->elements.size() < 2; |
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
966 |
|
0 | 967 |
d_func()->elements.reserve(d_func()->elements.size() + 5); |
968 |
moveTo(r.x(), r.y()); |
|
969 |
||
970 |
Element l1 = { r.x() + r.width(), r.y(), LineToElement }; |
|
971 |
Element l2 = { r.x() + r.width(), r.y() + r.height(), LineToElement }; |
|
972 |
Element l3 = { r.x(), r.y() + r.height(), LineToElement }; |
|
973 |
Element l4 = { r.x(), r.y(), LineToElement }; |
|
974 |
||
975 |
d_func()->elements << l1 << l2 << l3 << l4; |
|
976 |
d_func()->require_moveTo = true; |
|
3
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
977 |
d_func()->convex = first; |
0 | 978 |
} |
979 |
||
980 |
/*! |
|
981 |
Adds the given \a polygon to the path as an (unclosed) subpath. |
|
982 |
||
983 |
Note that the current position after the polygon has been added, |
|
984 |
is the last point in \a polygon. To draw a line back to the first |
|
985 |
point, use the closeSubpath() function. |
|
986 |
||
987 |
\table 100% |
|
988 |
\row |
|
989 |
\o \inlineimage qpainterpath-addpolygon.png |
|
990 |
\o |
|
991 |
\snippet doc/src/snippets/code/src_gui_painting_qpainterpath.cpp 4 |
|
992 |
\endtable |
|
993 |
||
994 |
\sa lineTo(), {QPainterPath#Composing a QPainterPath}{Composing |
|
995 |
a QPainterPath} |
|
996 |
*/ |
|
997 |
void QPainterPath::addPolygon(const QPolygonF &polygon) |
|
998 |
{ |
|
999 |
if (polygon.isEmpty()) |
|
1000 |
return; |
|
1001 |
||
1002 |
ensureData(); |
|
1003 |
detach(); |
|
1004 |
||
1005 |
d_func()->elements.reserve(d_func()->elements.size() + polygon.size()); |
|
1006 |
||
1007 |
moveTo(polygon.first()); |
|
1008 |
for (int i=1; i<polygon.size(); ++i) { |
|
1009 |
Element elm = { polygon.at(i).x(), polygon.at(i).y(), LineToElement }; |
|
1010 |
d_func()->elements << elm; |
|
1011 |
} |
|
1012 |
} |
|
1013 |
||
1014 |
/*! |
|
1015 |
\fn void QPainterPath::addEllipse(const QRectF &boundingRectangle) |
|
1016 |
||
1017 |
Creates an ellipse within the specified \a boundingRectangle |
|
1018 |
and adds it to the painter path as a closed subpath. |
|
1019 |
||
1020 |
The ellipse is composed of a clockwise curve, starting and |
|
1021 |
finishing at zero degrees (the 3 o'clock position). |
|
1022 |
||
1023 |
\table 100% |
|
1024 |
\row |
|
1025 |
\o \inlineimage qpainterpath-addellipse.png |
|
1026 |
\o |
|
1027 |
\snippet doc/src/snippets/code/src_gui_painting_qpainterpath.cpp 5 |
|
1028 |
\endtable |
|
1029 |
||
1030 |
\sa arcTo(), QPainter::drawEllipse(), {QPainterPath#Composing a |
|
1031 |
QPainterPath}{Composing a QPainterPath} |
|
1032 |
*/ |
|
1033 |
void QPainterPath::addEllipse(const QRectF &boundingRect) |
|
1034 |
{ |
|
1035 |
#ifndef QT_NO_DEBUG |
|
1036 |
if (qt_is_nan(boundingRect.x()) || qt_is_nan(boundingRect.y()) |
|
1037 |
|| qt_is_nan(boundingRect.width()) || qt_is_nan(boundingRect.height())) |
|
1038 |
qWarning("QPainterPath::addEllipse: Adding ellipse where a parameter is NaN, results are undefined"); |
|
1039 |
#endif |
|
1040 |
if (boundingRect.isNull()) |
|
1041 |
return; |
|
1042 |
||
1043 |
ensureData(); |
|
1044 |
detach(); |
|
1045 |
||
1046 |
Q_D(QPainterPath); |
|
3
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
1047 |
bool first = d_func()->elements.size() < 2; |
0 | 1048 |
d->elements.reserve(d->elements.size() + 13); |
1049 |
||
1050 |
QPointF pts[12]; |
|
1051 |
int point_count; |
|
1052 |
QPointF start = qt_curves_for_arc(boundingRect, 0, -360, pts, &point_count); |
|
1053 |
||
1054 |
moveTo(start); |
|
1055 |
cubicTo(pts[0], pts[1], pts[2]); // 0 -> 270 |
|
1056 |
cubicTo(pts[3], pts[4], pts[5]); // 270 -> 180 |
|
1057 |
cubicTo(pts[6], pts[7], pts[8]); // 180 -> 90 |
|
1058 |
cubicTo(pts[9], pts[10], pts[11]); // 90 - >0 |
|
1059 |
d_func()->require_moveTo = true; |
|
3
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
1060 |
|
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
1061 |
d_func()->convex = first; |
0 | 1062 |
} |
1063 |
||
1064 |
/*! |
|
1065 |
\fn void QPainterPath::addText(const QPointF &point, const QFont &font, const QString &text) |
|
1066 |
||
1067 |
Adds the given \a text to this path as a set of closed subpaths |
|
1068 |
created from the \a font supplied. The subpaths are positioned so |
|
1069 |
that the left end of the text's baseline lies at the specified \a |
|
1070 |
point. |
|
1071 |
||
1072 |
\table 100% |
|
1073 |
\row |
|
1074 |
\o \inlineimage qpainterpath-addtext.png |
|
1075 |
\o |
|
1076 |
\snippet doc/src/snippets/code/src_gui_painting_qpainterpath.cpp 6 |
|
1077 |
\endtable |
|
1078 |
||
1079 |
\sa QPainter::drawText(), {QPainterPath#Composing a |
|
1080 |
QPainterPath}{Composing a QPainterPath} |
|
1081 |
*/ |
|
1082 |
void QPainterPath::addText(const QPointF &point, const QFont &f, const QString &text) |
|
1083 |
{ |
|
1084 |
if (text.isEmpty()) |
|
1085 |
return; |
|
1086 |
||
1087 |
ensureData(); |
|
1088 |
detach(); |
|
1089 |
||
1090 |
QTextLayout layout(text, f); |
|
1091 |
layout.setCacheEnabled(true); |
|
1092 |
QTextEngine *eng = layout.engine(); |
|
1093 |
layout.beginLayout(); |
|
1094 |
QTextLine line = layout.createLine(); |
|
1095 |
layout.endLayout(); |
|
1096 |
const QScriptLine &sl = eng->lines[0]; |
|
1097 |
if (!sl.length || !eng->layoutData) |
|
1098 |
return; |
|
1099 |
||
1100 |
int nItems = eng->layoutData->items.size(); |
|
1101 |
||
1102 |
qreal x(point.x()); |
|
1103 |
qreal y(point.y()); |
|
1104 |
||
1105 |
QVarLengthArray<int> visualOrder(nItems); |
|
1106 |
QVarLengthArray<uchar> levels(nItems); |
|
1107 |
for (int i = 0; i < nItems; ++i) |
|
1108 |
levels[i] = eng->layoutData->items[i].analysis.bidiLevel; |
|
1109 |
QTextEngine::bidiReorder(nItems, levels.data(), visualOrder.data()); |
|
1110 |
||
1111 |
for (int i = 0; i < nItems; ++i) { |
|
1112 |
int item = visualOrder[i]; |
|
1113 |
QScriptItem &si = eng->layoutData->items[item]; |
|
1114 |
||
1115 |
if (si.analysis.flags < QScriptAnalysis::TabOrObject) { |
|
1116 |
QGlyphLayout glyphs = eng->shapedGlyphs(&si); |
|
1117 |
QFontEngine *fe = f.d->engineForScript(si.analysis.script); |
|
1118 |
Q_ASSERT(fe); |
|
1119 |
fe->addOutlineToPath(x, y, glyphs, this, |
|
1120 |
si.analysis.bidiLevel % 2 |
|
1121 |
? QTextItem::RenderFlags(QTextItem::RightToLeft) |
|
1122 |
: QTextItem::RenderFlags(0)); |
|
1123 |
||
1124 |
const qreal lw = fe->lineThickness().toReal(); |
|
1125 |
if (f.d->underline) { |
|
1126 |
qreal pos = fe->underlinePosition().toReal(); |
|
1127 |
addRect(x, y + pos, si.width.toReal(), lw); |
|
1128 |
} |
|
1129 |
if (f.d->overline) { |
|
1130 |
qreal pos = fe->ascent().toReal() + 1; |
|
1131 |
addRect(x, y - pos, si.width.toReal(), lw); |
|
1132 |
} |
|
1133 |
if (f.d->strikeOut) { |
|
1134 |
qreal pos = fe->ascent().toReal() / 3; |
|
1135 |
addRect(x, y - pos, si.width.toReal(), lw); |
|
1136 |
} |
|
1137 |
} |
|
1138 |
x += si.width.toReal(); |
|
1139 |
} |
|
1140 |
} |
|
1141 |
||
1142 |
/*! |
|
1143 |
\fn void QPainterPath::addPath(const QPainterPath &path) |
|
1144 |
||
1145 |
Adds the given \a path to \e this path as a closed subpath. |
|
1146 |
||
1147 |
\sa connectPath(), {QPainterPath#Composing a |
|
1148 |
QPainterPath}{Composing a QPainterPath} |
|
1149 |
*/ |
|
1150 |
void QPainterPath::addPath(const QPainterPath &other) |
|
1151 |
{ |
|
1152 |
if (other.isEmpty()) |
|
1153 |
return; |
|
1154 |
||
1155 |
ensureData(); |
|
1156 |
detach(); |
|
1157 |
||
1158 |
QPainterPathData *d = reinterpret_cast<QPainterPathData *>(d_func()); |
|
1159 |
// Remove last moveto so we don't get multiple moveto's |
|
1160 |
if (d->elements.last().type == MoveToElement) |
|
1161 |
d->elements.remove(d->elements.size()-1); |
|
1162 |
||
1163 |
// Locate where our own current subpath will start after the other path is added. |
|
1164 |
int cStart = d->elements.size() + other.d_func()->cStart; |
|
1165 |
d->elements += other.d_func()->elements; |
|
1166 |
d->cStart = cStart; |
|
1167 |
||
1168 |
d->require_moveTo = other.d_func()->isClosed(); |
|
1169 |
} |
|
1170 |
||
1171 |
||
1172 |
/*! |
|
1173 |
\fn void QPainterPath::connectPath(const QPainterPath &path) |
|
1174 |
||
1175 |
Connects the given \a path to \e this path by adding a line from the |
|
1176 |
last element of this path to the first element of the given path. |
|
1177 |
||
1178 |
\sa addPath(), {QPainterPath#Composing a QPainterPath}{Composing |
|
1179 |
a QPainterPath} |
|
1180 |
*/ |
|
1181 |
void QPainterPath::connectPath(const QPainterPath &other) |
|
1182 |
{ |
|
1183 |
if (other.isEmpty()) |
|
1184 |
return; |
|
1185 |
||
1186 |
ensureData(); |
|
1187 |
detach(); |
|
1188 |
||
1189 |
QPainterPathData *d = reinterpret_cast<QPainterPathData *>(d_func()); |
|
1190 |
// Remove last moveto so we don't get multiple moveto's |
|
1191 |
if (d->elements.last().type == MoveToElement) |
|
1192 |
d->elements.remove(d->elements.size()-1); |
|
1193 |
||
1194 |
// Locate where our own current subpath will start after the other path is added. |
|
1195 |
int cStart = d->elements.size() + other.d_func()->cStart; |
|
1196 |
int first = d->elements.size(); |
|
1197 |
d->elements += other.d_func()->elements; |
|
1198 |
||
1199 |
d->elements[first].type = LineToElement; |
|
1200 |
||
1201 |
// avoid duplicate points |
|
1202 |
if (first > 0 && QPointF(d->elements[first]) == QPointF(d->elements[first - 1])) { |
|
1203 |
d->elements.remove(first--); |
|
1204 |
--cStart; |
|
1205 |
} |
|
1206 |
||
1207 |
if (cStart != first) |
|
1208 |
d->cStart = cStart; |
|
1209 |
} |
|
1210 |
||
1211 |
/*! |
|
1212 |
Adds the given \a region to the path by adding each rectangle in |
|
1213 |
the region as a separate closed subpath. |
|
1214 |
||
1215 |
\sa addRect(), {QPainterPath#Composing a QPainterPath}{Composing |
|
1216 |
a QPainterPath} |
|
1217 |
*/ |
|
1218 |
void QPainterPath::addRegion(const QRegion ®ion) |
|
1219 |
{ |
|
1220 |
ensureData(); |
|
1221 |
detach(); |
|
1222 |
||
1223 |
QVector<QRect> rects = region.rects(); |
|
1224 |
d_func()->elements.reserve(rects.size() * 5); |
|
1225 |
for (int i=0; i<rects.size(); ++i) |
|
1226 |
addRect(rects.at(i)); |
|
1227 |
} |
|
1228 |
||
1229 |
||
1230 |
/*! |
|
1231 |
Returns the painter path's currently set fill rule. |
|
1232 |
||
1233 |
\sa setFillRule() |
|
1234 |
*/ |
|
1235 |
Qt::FillRule QPainterPath::fillRule() const |
|
1236 |
{ |
|
1237 |
return isEmpty() ? Qt::OddEvenFill : d_func()->fillRule; |
|
1238 |
} |
|
1239 |
||
1240 |
/*! |
|
1241 |
\fn void QPainterPath::setFillRule(Qt::FillRule fillRule) |
|
1242 |
||
1243 |
Sets the fill rule of the painter path to the given \a |
|
1244 |
fillRule. Qt provides two methods for filling paths: |
|
1245 |
||
1246 |
\table |
|
1247 |
\row |
|
1248 |
\o \inlineimage qt-fillrule-oddeven.png |
|
1249 |
\o \inlineimage qt-fillrule-winding.png |
|
1250 |
\header |
|
1251 |
\o Qt::OddEvenFill (default) |
|
1252 |
\o Qt::WindingFill |
|
1253 |
\endtable |
|
1254 |
||
1255 |
\sa fillRule() |
|
1256 |
*/ |
|
1257 |
void QPainterPath::setFillRule(Qt::FillRule fillRule) |
|
1258 |
{ |
|
1259 |
ensureData(); |
|
30
5dc02b23752f
Revision: 201025
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
18
diff
changeset
|
1260 |
if (d_func()->fillRule == fillRule) |
5dc02b23752f
Revision: 201025
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
18
diff
changeset
|
1261 |
return; |
0 | 1262 |
detach(); |
1263 |
||
1264 |
d_func()->fillRule = fillRule; |
|
1265 |
} |
|
1266 |
||
1267 |
#define QT_BEZIER_A(bezier, coord) 3 * (-bezier.coord##1 \ |
|
1268 |
+ 3*bezier.coord##2 \ |
|
1269 |
- 3*bezier.coord##3 \ |
|
1270 |
+bezier.coord##4) |
|
1271 |
||
1272 |
#define QT_BEZIER_B(bezier, coord) 6 * (bezier.coord##1 \ |
|
1273 |
- 2*bezier.coord##2 \ |
|
1274 |
+ bezier.coord##3) |
|
1275 |
||
1276 |
#define QT_BEZIER_C(bezier, coord) 3 * (- bezier.coord##1 \ |
|
1277 |
+ bezier.coord##2) |
|
1278 |
||
1279 |
#define QT_BEZIER_CHECK_T(bezier, t) \ |
|
1280 |
if (t >= 0 && t <= 1) { \ |
|
1281 |
QPointF p(b.pointAt(t)); \ |
|
1282 |
if (p.x() < minx) minx = p.x(); \ |
|
1283 |
else if (p.x() > maxx) maxx = p.x(); \ |
|
1284 |
if (p.y() < miny) miny = p.y(); \ |
|
1285 |
else if (p.y() > maxy) maxy = p.y(); \ |
|
1286 |
} |
|
1287 |
||
1288 |
||
1289 |
static QRectF qt_painterpath_bezier_extrema(const QBezier &b) |
|
1290 |
{ |
|
1291 |
qreal minx, miny, maxx, maxy; |
|
1292 |
||
1293 |
// initialize with end points |
|
1294 |
if (b.x1 < b.x4) { |
|
1295 |
minx = b.x1; |
|
1296 |
maxx = b.x4; |
|
1297 |
} else { |
|
1298 |
minx = b.x4; |
|
1299 |
maxx = b.x1; |
|
1300 |
} |
|
1301 |
if (b.y1 < b.y4) { |
|
1302 |
miny = b.y1; |
|
1303 |
maxy = b.y4; |
|
1304 |
} else { |
|
1305 |
miny = b.y4; |
|
1306 |
maxy = b.y1; |
|
1307 |
} |
|
1308 |
||
1309 |
// Update for the X extrema |
|
1310 |
{ |
|
1311 |
qreal ax = QT_BEZIER_A(b, x); |
|
1312 |
qreal bx = QT_BEZIER_B(b, x); |
|
1313 |
qreal cx = QT_BEZIER_C(b, x); |
|
1314 |
// specialcase quadratic curves to avoid div by zero |
|
1315 |
if (qFuzzyIsNull(ax)) { |
|
1316 |
||
1317 |
// linear curves are covered by initialization. |
|
1318 |
if (!qFuzzyIsNull(bx)) { |
|
1319 |
qreal t = -cx / bx; |
|
1320 |
QT_BEZIER_CHECK_T(b, t); |
|
1321 |
} |
|
1322 |
||
1323 |
} else { |
|
1324 |
const qreal tx = bx * bx - 4 * ax * cx; |
|
1325 |
||
1326 |
if (tx >= 0) { |
|
1327 |
qreal temp = qSqrt(tx); |
|
1328 |
qreal rcp = 1 / (2 * ax); |
|
1329 |
qreal t1 = (-bx + temp) * rcp; |
|
1330 |
QT_BEZIER_CHECK_T(b, t1); |
|
1331 |
||
1332 |
qreal t2 = (-bx - temp) * rcp; |
|
1333 |
QT_BEZIER_CHECK_T(b, t2); |
|
1334 |
} |
|
1335 |
} |
|
1336 |
} |
|
1337 |
||
1338 |
// Update for the Y extrema |
|
1339 |
{ |
|
1340 |
qreal ay = QT_BEZIER_A(b, y); |
|
1341 |
qreal by = QT_BEZIER_B(b, y); |
|
1342 |
qreal cy = QT_BEZIER_C(b, y); |
|
1343 |
||
1344 |
// specialcase quadratic curves to avoid div by zero |
|
1345 |
if (qFuzzyIsNull(ay)) { |
|
1346 |
||
1347 |
// linear curves are covered by initialization. |
|
1348 |
if (!qFuzzyIsNull(by)) { |
|
1349 |
qreal t = -cy / by; |
|
1350 |
QT_BEZIER_CHECK_T(b, t); |
|
1351 |
} |
|
1352 |
||
1353 |
} else { |
|
1354 |
const qreal ty = by * by - 4 * ay * cy; |
|
1355 |
||
1356 |
if (ty > 0) { |
|
1357 |
qreal temp = qSqrt(ty); |
|
1358 |
qreal rcp = 1 / (2 * ay); |
|
1359 |
qreal t1 = (-by + temp) * rcp; |
|
1360 |
QT_BEZIER_CHECK_T(b, t1); |
|
1361 |
||
1362 |
qreal t2 = (-by - temp) * rcp; |
|
1363 |
QT_BEZIER_CHECK_T(b, t2); |
|
1364 |
} |
|
1365 |
} |
|
1366 |
} |
|
1367 |
return QRectF(minx, miny, maxx - minx, maxy - miny); |
|
1368 |
} |
|
1369 |
||
1370 |
/*! |
|
1371 |
Returns the bounding rectangle of this painter path as a rectangle with |
|
1372 |
floating point precision. |
|
1373 |
||
1374 |
\sa controlPointRect() |
|
1375 |
*/ |
|
1376 |
QRectF QPainterPath::boundingRect() const |
|
1377 |
{ |
|
1378 |
if (!d_ptr) |
|
1379 |
return QRectF(); |
|
1380 |
QPainterPathData *d = d_func(); |
|
1381 |
||
1382 |
if (d->dirtyBounds) |
|
1383 |
computeBoundingRect(); |
|
1384 |
return d->bounds; |
|
1385 |
} |
|
1386 |
||
1387 |
/*! |
|
1388 |
Returns the rectangle containing all the points and control points |
|
1389 |
in this path. |
|
1390 |
||
1391 |
This function is significantly faster to compute than the exact |
|
1392 |
boundingRect(), and the returned rectangle is always a superset of |
|
1393 |
the rectangle returned by boundingRect(). |
|
1394 |
||
1395 |
\sa boundingRect() |
|
1396 |
*/ |
|
1397 |
QRectF QPainterPath::controlPointRect() const |
|
1398 |
{ |
|
1399 |
if (!d_ptr) |
|
1400 |
return QRectF(); |
|
1401 |
QPainterPathData *d = d_func(); |
|
1402 |
||
1403 |
if (d->dirtyControlBounds) |
|
1404 |
computeControlPointRect(); |
|
1405 |
return d->controlBounds; |
|
1406 |
} |
|
1407 |
||
1408 |
||
1409 |
/*! |
|
1410 |
\fn bool QPainterPath::isEmpty() const |
|
1411 |
||
1412 |
Returns true if either there are no elements in this path, or if the only |
|
1413 |
element is a MoveToElement; otherwise returns false. |
|
1414 |
||
1415 |
\sa elementCount() |
|
1416 |
*/ |
|
1417 |
||
1418 |
/*! |
|
1419 |
Creates and returns a reversed copy of the path. |
|
1420 |
||
1421 |
It is the order of the elements that is reversed: If a |
|
1422 |
QPainterPath is composed by calling the moveTo(), lineTo() and |
|
1423 |
cubicTo() functions in the specified order, the reversed copy is |
|
1424 |
composed by calling cubicTo(), lineTo() and moveTo(). |
|
1425 |
*/ |
|
1426 |
QPainterPath QPainterPath::toReversed() const |
|
1427 |
{ |
|
1428 |
Q_D(const QPainterPath); |
|
1429 |
QPainterPath rev; |
|
1430 |
||
1431 |
if (isEmpty()) { |
|
1432 |
rev = *this; |
|
1433 |
return rev; |
|
1434 |
} |
|
1435 |
||
1436 |
rev.moveTo(d->elements.at(d->elements.size()-1).x, d->elements.at(d->elements.size()-1).y); |
|
1437 |
||
1438 |
for (int i=d->elements.size()-1; i>=1; --i) { |
|
1439 |
const QPainterPath::Element &elm = d->elements.at(i); |
|
1440 |
const QPainterPath::Element &prev = d->elements.at(i-1); |
|
1441 |
switch (elm.type) { |
|
1442 |
case LineToElement: |
|
1443 |
rev.lineTo(prev.x, prev.y); |
|
1444 |
break; |
|
1445 |
case MoveToElement: |
|
1446 |
rev.moveTo(prev.x, prev.y); |
|
1447 |
break; |
|
1448 |
case CurveToDataElement: |
|
1449 |
{ |
|
1450 |
Q_ASSERT(i>=3); |
|
1451 |
const QPainterPath::Element &cp1 = d->elements.at(i-2); |
|
1452 |
const QPainterPath::Element &sp = d->elements.at(i-3); |
|
1453 |
Q_ASSERT(prev.type == CurveToDataElement); |
|
1454 |
Q_ASSERT(cp1.type == CurveToElement); |
|
1455 |
rev.cubicTo(prev.x, prev.y, cp1.x, cp1.y, sp.x, sp.y); |
|
1456 |
i -= 2; |
|
1457 |
break; |
|
1458 |
} |
|
1459 |
default: |
|
1460 |
Q_ASSERT(!"qt_reversed_path"); |
|
1461 |
break; |
|
1462 |
} |
|
1463 |
} |
|
1464 |
//qt_debug_path(rev); |
|
1465 |
return rev; |
|
1466 |
} |
|
1467 |
||
1468 |
/*! |
|
1469 |
Converts the path into a list of polygons using the QTransform |
|
1470 |
\a matrix, and returns the list. |
|
1471 |
||
1472 |
This function creates one polygon for each subpath regardless of |
|
1473 |
intersecting subpaths (i.e. overlapping bounding rectangles). To |
|
1474 |
make sure that such overlapping subpaths are filled correctly, use |
|
1475 |
the toFillPolygons() function instead. |
|
1476 |
||
1477 |
\sa toFillPolygons(), toFillPolygon(), {QPainterPath#QPainterPath |
|
1478 |
Conversion}{QPainterPath Conversion} |
|
1479 |
*/ |
|
1480 |
QList<QPolygonF> QPainterPath::toSubpathPolygons(const QTransform &matrix) const |
|
1481 |
{ |
|
1482 |
||
1483 |
Q_D(const QPainterPath); |
|
1484 |
QList<QPolygonF> flatCurves; |
|
1485 |
if (isEmpty()) |
|
1486 |
return flatCurves; |
|
1487 |
||
1488 |
QPolygonF current; |
|
1489 |
for (int i=0; i<elementCount(); ++i) { |
|
1490 |
const QPainterPath::Element &e = d->elements.at(i); |
|
1491 |
switch (e.type) { |
|
1492 |
case QPainterPath::MoveToElement: |
|
1493 |
if (current.size() > 1) |
|
1494 |
flatCurves += current; |
|
1495 |
current.clear(); |
|
1496 |
current.reserve(16); |
|
1497 |
current += QPointF(e.x, e.y) * matrix; |
|
1498 |
break; |
|
1499 |
case QPainterPath::LineToElement: |
|
1500 |
current += QPointF(e.x, e.y) * matrix; |
|
1501 |
break; |
|
1502 |
case QPainterPath::CurveToElement: { |
|
1503 |
Q_ASSERT(d->elements.at(i+1).type == QPainterPath::CurveToDataElement); |
|
1504 |
Q_ASSERT(d->elements.at(i+2).type == QPainterPath::CurveToDataElement); |
|
1505 |
QBezier bezier = QBezier::fromPoints(QPointF(d->elements.at(i-1).x, d->elements.at(i-1).y) * matrix, |
|
1506 |
QPointF(e.x, e.y) * matrix, |
|
1507 |
QPointF(d->elements.at(i+1).x, d->elements.at(i+1).y) * matrix, |
|
1508 |
QPointF(d->elements.at(i+2).x, d->elements.at(i+2).y) * matrix); |
|
1509 |
bezier.addToPolygon(¤t); |
|
1510 |
i+=2; |
|
1511 |
break; |
|
1512 |
} |
|
1513 |
case QPainterPath::CurveToDataElement: |
|
1514 |
Q_ASSERT(!"QPainterPath::toSubpathPolygons(), bad element type"); |
|
1515 |
break; |
|
1516 |
} |
|
1517 |
} |
|
1518 |
||
1519 |
if (current.size()>1) |
|
1520 |
flatCurves += current; |
|
1521 |
||
1522 |
return flatCurves; |
|
1523 |
} |
|
1524 |
||
1525 |
/*! |
|
1526 |
\overload |
|
1527 |
*/ |
|
1528 |
QList<QPolygonF> QPainterPath::toSubpathPolygons(const QMatrix &matrix) const |
|
1529 |
{ |
|
1530 |
return toSubpathPolygons(QTransform(matrix)); |
|
1531 |
} |
|
1532 |
||
1533 |
/*! |
|
1534 |
Converts the path into a list of polygons using the |
|
1535 |
QTransform \a matrix, and returns the list. |
|
1536 |
||
1537 |
The function differs from the toFillPolygon() function in that it |
|
1538 |
creates several polygons. It is provided because it is usually |
|
1539 |
faster to draw several small polygons than to draw one large |
|
1540 |
polygon, even though the total number of points drawn is the same. |
|
1541 |
||
1542 |
The toFillPolygons() function differs from the toSubpathPolygons() |
|
1543 |
function in that it create only polygon for subpaths that have |
|
1544 |
overlapping bounding rectangles. |
|
1545 |
||
1546 |
Like the toFillPolygon() function, this function uses a rewinding |
|
1547 |
technique to make sure that overlapping subpaths can be filled |
|
1548 |
using the correct fill rule. Note that rewinding inserts addition |
|
1549 |
lines in the polygons so the outline of the fill polygon does not |
|
1550 |
match the outline of the path. |
|
1551 |
||
1552 |
\sa toSubpathPolygons(), toFillPolygon(), |
|
1553 |
{QPainterPath#QPainterPath Conversion}{QPainterPath Conversion} |
|
1554 |
*/ |
|
1555 |
QList<QPolygonF> QPainterPath::toFillPolygons(const QTransform &matrix) const |
|
1556 |
{ |
|
1557 |
||
1558 |
QList<QPolygonF> polys; |
|
1559 |
||
1560 |
QList<QPolygonF> subpaths = toSubpathPolygons(matrix); |
|
1561 |
int count = subpaths.size(); |
|
1562 |
||
1563 |
if (count == 0) |
|
1564 |
return polys; |
|
1565 |
||
1566 |
QList<QRectF> bounds; |
|
1567 |
for (int i=0; i<count; ++i) |
|
1568 |
bounds += subpaths.at(i).boundingRect(); |
|
1569 |
||
1570 |
#ifdef QPP_FILLPOLYGONS_DEBUG |
|
1571 |
printf("QPainterPath::toFillPolygons, subpathCount=%d\n", count); |
|
1572 |
for (int i=0; i<bounds.size(); ++i) |
|
1573 |
qDebug() << " bounds" << i << bounds.at(i); |
|
1574 |
#endif |
|
1575 |
||
1576 |
QVector< QList<int> > isects; |
|
1577 |
isects.resize(count); |
|
1578 |
||
1579 |
// find all intersections |
|
1580 |
for (int j=0; j<count; ++j) { |
|
1581 |
if (subpaths.at(j).size() <= 2) |
|
1582 |
continue; |
|
1583 |
QRectF cbounds = bounds.at(j); |
|
1584 |
for (int i=0; i<count; ++i) { |
|
1585 |
if (cbounds.intersects(bounds.at(i))) { |
|
1586 |
isects[j] << i; |
|
1587 |
} |
|
1588 |
} |
|
1589 |
} |
|
1590 |
||
1591 |
#ifdef QPP_FILLPOLYGONS_DEBUG |
|
1592 |
printf("Intersections before flattening:\n"); |
|
1593 |
for (int i = 0; i < count; ++i) { |
|
1594 |
printf("%d: ", i); |
|
1595 |
for (int j = 0; j < isects[i].size(); ++j) { |
|
1596 |
printf("%d ", isects[i][j]); |
|
1597 |
} |
|
1598 |
printf("\n"); |
|
1599 |
} |
|
1600 |
#endif |
|
1601 |
||
1602 |
// flatten the sets of intersections |
|
1603 |
for (int i=0; i<count; ++i) { |
|
1604 |
const QList<int> ¤t_isects = isects.at(i); |
|
1605 |
for (int j=0; j<current_isects.size(); ++j) { |
|
1606 |
int isect_j = current_isects.at(j); |
|
1607 |
if (isect_j == i) |
|
1608 |
continue; |
|
1609 |
for (int k=0; k<isects[isect_j].size(); ++k) { |
|
1610 |
int isect_k = isects[isect_j][k]; |
|
1611 |
if (isect_k != i && !isects.at(i).contains(isect_k)) { |
|
1612 |
isects[i] += isect_k; |
|
1613 |
} |
|
1614 |
} |
|
1615 |
isects[isect_j].clear(); |
|
1616 |
} |
|
1617 |
} |
|
1618 |
||
1619 |
#ifdef QPP_FILLPOLYGONS_DEBUG |
|
1620 |
printf("Intersections after flattening:\n"); |
|
1621 |
for (int i = 0; i < count; ++i) { |
|
1622 |
printf("%d: ", i); |
|
1623 |
for (int j = 0; j < isects[i].size(); ++j) { |
|
1624 |
printf("%d ", isects[i][j]); |
|
1625 |
} |
|
1626 |
printf("\n"); |
|
1627 |
} |
|
1628 |
#endif |
|
1629 |
||
1630 |
// Join the intersected subpaths as rewinded polygons |
|
1631 |
for (int i=0; i<count; ++i) { |
|
1632 |
const QList<int> &subpath_list = isects[i]; |
|
1633 |
if (!subpath_list.isEmpty()) { |
|
1634 |
QPolygonF buildUp; |
|
1635 |
for (int j=0; j<subpath_list.size(); ++j) { |
|
1636 |
const QPolygonF &subpath = subpaths.at(subpath_list.at(j)); |
|
1637 |
buildUp += subpath; |
|
1638 |
if (!subpath.isClosed()) |
|
1639 |
buildUp += subpath.first(); |
|
1640 |
if (!buildUp.isClosed()) |
|
1641 |
buildUp += buildUp.first(); |
|
1642 |
} |
|
1643 |
polys += buildUp; |
|
1644 |
} |
|
1645 |
} |
|
1646 |
||
1647 |
return polys; |
|
1648 |
} |
|
1649 |
||
1650 |
/*! |
|
1651 |
\overload |
|
1652 |
*/ |
|
1653 |
QList<QPolygonF> QPainterPath::toFillPolygons(const QMatrix &matrix) const |
|
1654 |
{ |
|
1655 |
return toFillPolygons(QTransform(matrix)); |
|
1656 |
} |
|
1657 |
||
1658 |
//same as qt_polygon_isect_line in qpolygon.cpp |
|
1659 |
static void qt_painterpath_isect_line(const QPointF &p1, |
|
1660 |
const QPointF &p2, |
|
1661 |
const QPointF &pos, |
|
1662 |
int *winding) |
|
1663 |
{ |
|
1664 |
qreal x1 = p1.x(); |
|
1665 |
qreal y1 = p1.y(); |
|
1666 |
qreal x2 = p2.x(); |
|
1667 |
qreal y2 = p2.y(); |
|
1668 |
qreal y = pos.y(); |
|
1669 |
||
1670 |
int dir = 1; |
|
1671 |
||
1672 |
if (qFuzzyCompare(y1, y2)) { |
|
1673 |
// ignore horizontal lines according to scan conversion rule |
|
1674 |
return; |
|
1675 |
} else if (y2 < y1) { |
|
1676 |
qreal x_tmp = x2; x2 = x1; x1 = x_tmp; |
|
1677 |
qreal y_tmp = y2; y2 = y1; y1 = y_tmp; |
|
1678 |
dir = -1; |
|
1679 |
} |
|
1680 |
||
1681 |
if (y >= y1 && y < y2) { |
|
1682 |
qreal x = x1 + ((x2 - x1) / (y2 - y1)) * (y - y1); |
|
1683 |
||
1684 |
// count up the winding number if we're |
|
1685 |
if (x<=pos.x()) { |
|
1686 |
(*winding) += dir; |
|
1687 |
} |
|
1688 |
} |
|
1689 |
} |
|
1690 |
||
1691 |
static void qt_painterpath_isect_curve(const QBezier &bezier, const QPointF &pt, |
|
1692 |
int *winding) |
|
1693 |
{ |
|
1694 |
qreal y = pt.y(); |
|
1695 |
qreal x = pt.x(); |
|
1696 |
QRectF bounds = bezier.bounds(); |
|
1697 |
||
1698 |
// potential intersection, divide and try again... |
|
1699 |
// Please note that a sideeffect of the bottom exclusion is that |
|
1700 |
// horizontal lines are dropped, but this is correct according to |
|
1701 |
// scan conversion rules. |
|
1702 |
if (y >= bounds.y() && y < bounds.y() + bounds.height()) { |
|
1703 |
||
1704 |
// hit lower limit... This is a rough threshold, but its a |
|
1705 |
// tradeoff between speed and precision. |
|
1706 |
const qreal lower_bound = qreal(.001); |
|
1707 |
if (bounds.width() < lower_bound && bounds.height() < lower_bound) { |
|
1708 |
// We make the assumption here that the curve starts to |
|
1709 |
// approximate a line after while (i.e. that it doesn't |
|
1710 |
// change direction drastically during its slope) |
|
1711 |
if (bezier.pt1().x() <= x) { |
|
1712 |
(*winding) += (bezier.pt4().y() > bezier.pt1().y() ? 1 : -1); |
|
1713 |
} |
|
1714 |
return; |
|
1715 |
} |
|
1716 |
||
1717 |
// split curve and try again... |
|
1718 |
QBezier first_half, second_half; |
|
1719 |
bezier.split(&first_half, &second_half); |
|
1720 |
qt_painterpath_isect_curve(first_half, pt, winding); |
|
1721 |
qt_painterpath_isect_curve(second_half, pt, winding); |
|
1722 |
} |
|
1723 |
} |
|
1724 |
||
1725 |
/*! |
|
1726 |
\fn bool QPainterPath::contains(const QPointF &point) const |
|
1727 |
||
1728 |
Returns true if the given \a point is inside the path, otherwise |
|
1729 |
returns false. |
|
1730 |
||
1731 |
\sa intersects() |
|
1732 |
*/ |
|
1733 |
bool QPainterPath::contains(const QPointF &pt) const |
|
1734 |
{ |
|
1735 |
if (isEmpty() || !controlPointRect().contains(pt)) |
|
1736 |
return false; |
|
1737 |
||
1738 |
QPainterPathData *d = d_func(); |
|
1739 |
||
1740 |
int winding_number = 0; |
|
1741 |
||
1742 |
QPointF last_pt; |
|
1743 |
QPointF last_start; |
|
1744 |
for (int i=0; i<d->elements.size(); ++i) { |
|
1745 |
const Element &e = d->elements.at(i); |
|
1746 |
||
1747 |
switch (e.type) { |
|
1748 |
||
1749 |
case MoveToElement: |
|
1750 |
if (i > 0) // implicitly close all paths. |
|
1751 |
qt_painterpath_isect_line(last_pt, last_start, pt, &winding_number); |
|
1752 |
last_start = last_pt = e; |
|
1753 |
break; |
|
1754 |
||
1755 |
case LineToElement: |
|
1756 |
qt_painterpath_isect_line(last_pt, e, pt, &winding_number); |
|
1757 |
last_pt = e; |
|
1758 |
break; |
|
1759 |
||
1760 |
case CurveToElement: |
|
1761 |
{ |
|
1762 |
const QPainterPath::Element &cp2 = d->elements.at(++i); |
|
1763 |
const QPainterPath::Element &ep = d->elements.at(++i); |
|
1764 |
qt_painterpath_isect_curve(QBezier::fromPoints(last_pt, e, cp2, ep), |
|
1765 |
pt, &winding_number); |
|
1766 |
last_pt = ep; |
|
1767 |
||
1768 |
} |
|
1769 |
break; |
|
1770 |
||
1771 |
default: |
|
1772 |
break; |
|
1773 |
} |
|
1774 |
} |
|
1775 |
||
1776 |
// implicitly close last subpath |
|
1777 |
if (last_pt != last_start) |
|
1778 |
qt_painterpath_isect_line(last_pt, last_start, pt, &winding_number); |
|
1779 |
||
1780 |
return (d->fillRule == Qt::WindingFill |
|
1781 |
? (winding_number != 0) |
|
1782 |
: ((winding_number % 2) != 0)); |
|
1783 |
} |
|
1784 |
||
1785 |
static bool qt_painterpath_isect_line_rect(qreal x1, qreal y1, qreal x2, qreal y2, |
|
1786 |
const QRectF &rect) |
|
1787 |
{ |
|
1788 |
qreal left = rect.left(); |
|
1789 |
qreal right = rect.right(); |
|
1790 |
qreal top = rect.top(); |
|
1791 |
qreal bottom = rect.bottom(); |
|
1792 |
||
1793 |
enum { Left, Right, Top, Bottom }; |
|
1794 |
// clip the lines, after cohen-sutherland, see e.g. http://www.nondot.org/~sabre/graphpro/line6.html |
|
1795 |
int p1 = ((x1 < left) << Left) |
|
1796 |
| ((x1 > right) << Right) |
|
1797 |
| ((y1 < top) << Top) |
|
1798 |
| ((y1 > bottom) << Bottom); |
|
1799 |
int p2 = ((x2 < left) << Left) |
|
1800 |
| ((x2 > right) << Right) |
|
1801 |
| ((y2 < top) << Top) |
|
1802 |
| ((y2 > bottom) << Bottom); |
|
1803 |
||
1804 |
if (p1 & p2) |
|
1805 |
// completely inside |
|
1806 |
return false; |
|
1807 |
||
1808 |
if (p1 | p2) { |
|
1809 |
qreal dx = x2 - x1; |
|
1810 |
qreal dy = y2 - y1; |
|
1811 |
||
1812 |
// clip x coordinates |
|
1813 |
if (x1 < left) { |
|
1814 |
y1 += dy/dx * (left - x1); |
|
1815 |
x1 = left; |
|
1816 |
} else if (x1 > right) { |
|
1817 |
y1 -= dy/dx * (x1 - right); |
|
1818 |
x1 = right; |
|
1819 |
} |
|
1820 |
if (x2 < left) { |
|
1821 |
y2 += dy/dx * (left - x2); |
|
1822 |
x2 = left; |
|
1823 |
} else if (x2 > right) { |
|
1824 |
y2 -= dy/dx * (x2 - right); |
|
1825 |
x2 = right; |
|
1826 |
} |
|
1827 |
||
1828 |
p1 = ((y1 < top) << Top) |
|
1829 |
| ((y1 > bottom) << Bottom); |
|
1830 |
p2 = ((y2 < top) << Top) |
|
1831 |
| ((y2 > bottom) << Bottom); |
|
1832 |
||
1833 |
if (p1 & p2) |
|
1834 |
return false; |
|
1835 |
||
1836 |
// clip y coordinates |
|
1837 |
if (y1 < top) { |
|
1838 |
x1 += dx/dy * (top - y1); |
|
1839 |
y1 = top; |
|
1840 |
} else if (y1 > bottom) { |
|
1841 |
x1 -= dx/dy * (y1 - bottom); |
|
1842 |
y1 = bottom; |
|
1843 |
} |
|
1844 |
if (y2 < top) { |
|
1845 |
x2 += dx/dy * (top - y2); |
|
1846 |
y2 = top; |
|
1847 |
} else if (y2 > bottom) { |
|
1848 |
x2 -= dx/dy * (y2 - bottom); |
|
1849 |
y2 = bottom; |
|
1850 |
} |
|
1851 |
||
1852 |
p1 = ((x1 < left) << Left) |
|
1853 |
| ((x1 > right) << Right); |
|
1854 |
p2 = ((x2 < left) << Left) |
|
1855 |
| ((x2 > right) << Right); |
|
1856 |
||
1857 |
if (p1 & p2) |
|
1858 |
return false; |
|
1859 |
||
1860 |
return true; |
|
1861 |
} |
|
1862 |
return false; |
|
1863 |
} |
|
1864 |
||
1865 |
static bool qt_isect_curve_horizontal(const QBezier &bezier, qreal y, qreal x1, qreal x2) |
|
1866 |
{ |
|
1867 |
QRectF bounds = bezier.bounds(); |
|
1868 |
||
1869 |
if (y >= bounds.top() && y < bounds.bottom() |
|
1870 |
&& bounds.right() >= x1 && bounds.left() < x2) { |
|
1871 |
const qreal lower_bound = qreal(.01); |
|
1872 |
if (bounds.width() < lower_bound && bounds.height() < lower_bound) |
|
1873 |
return true; |
|
1874 |
||
1875 |
QBezier first_half, second_half; |
|
1876 |
bezier.split(&first_half, &second_half); |
|
1877 |
if (qt_isect_curve_horizontal(first_half, y, x1, x2) |
|
1878 |
|| qt_isect_curve_horizontal(second_half, y, x1, x2)) |
|
1879 |
return true; |
|
1880 |
} |
|
1881 |
return false; |
|
1882 |
} |
|
1883 |
||
1884 |
static bool qt_isect_curve_vertical(const QBezier &bezier, qreal x, qreal y1, qreal y2) |
|
1885 |
{ |
|
1886 |
QRectF bounds = bezier.bounds(); |
|
1887 |
||
1888 |
if (x >= bounds.left() && x < bounds.right() |
|
1889 |
&& bounds.bottom() >= y1 && bounds.top() < y2) { |
|
1890 |
const qreal lower_bound = qreal(.01); |
|
1891 |
if (bounds.width() < lower_bound && bounds.height() < lower_bound) |
|
1892 |
return true; |
|
1893 |
||
1894 |
QBezier first_half, second_half; |
|
1895 |
bezier.split(&first_half, &second_half); |
|
1896 |
if (qt_isect_curve_vertical(first_half, x, y1, y2) |
|
1897 |
|| qt_isect_curve_vertical(second_half, x, y1, y2)) |
|
1898 |
return true; |
|
1899 |
} |
|
1900 |
return false; |
|
1901 |
} |
|
1902 |
||
1903 |
/* |
|
1904 |
Returns true if any lines or curves cross the four edges in of rect |
|
1905 |
*/ |
|
1906 |
static bool qt_painterpath_check_crossing(const QPainterPath *path, const QRectF &rect) |
|
1907 |
{ |
|
1908 |
QPointF last_pt; |
|
1909 |
QPointF last_start; |
|
1910 |
for (int i=0; i<path->elementCount(); ++i) { |
|
1911 |
const QPainterPath::Element &e = path->elementAt(i); |
|
1912 |
||
1913 |
switch (e.type) { |
|
1914 |
||
1915 |
case QPainterPath::MoveToElement: |
|
1916 |
if (i > 0 |
|
30
5dc02b23752f
Revision: 201025
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
18
diff
changeset
|
1917 |
&& qFuzzyCompare(last_pt.x(), last_start.x()) |
0 | 1918 |
&& qFuzzyCompare(last_pt.y(), last_start.y()) |
1919 |
&& qt_painterpath_isect_line_rect(last_pt.x(), last_pt.y(), |
|
1920 |
last_start.x(), last_start.y(), rect)) |
|
1921 |
return true; |
|
1922 |
last_start = last_pt = e; |
|
1923 |
break; |
|
1924 |
||
1925 |
case QPainterPath::LineToElement: |
|
1926 |
if (qt_painterpath_isect_line_rect(last_pt.x(), last_pt.y(), e.x, e.y, rect)) |
|
1927 |
return true; |
|
1928 |
last_pt = e; |
|
1929 |
break; |
|
1930 |
||
1931 |
case QPainterPath::CurveToElement: |
|
1932 |
{ |
|
1933 |
QPointF cp2 = path->elementAt(++i); |
|
1934 |
QPointF ep = path->elementAt(++i); |
|
1935 |
QBezier bezier = QBezier::fromPoints(last_pt, e, cp2, ep); |
|
1936 |
if (qt_isect_curve_horizontal(bezier, rect.top(), rect.left(), rect.right()) |
|
1937 |
|| qt_isect_curve_horizontal(bezier, rect.bottom(), rect.left(), rect.right()) |
|
1938 |
|| qt_isect_curve_vertical(bezier, rect.left(), rect.top(), rect.bottom()) |
|
1939 |
|| qt_isect_curve_vertical(bezier, rect.right(), rect.top(), rect.bottom())) |
|
1940 |
return true; |
|
1941 |
last_pt = ep; |
|
1942 |
} |
|
1943 |
break; |
|
1944 |
||
1945 |
default: |
|
1946 |
break; |
|
1947 |
} |
|
1948 |
} |
|
1949 |
||
1950 |
// implicitly close last subpath |
|
1951 |
if (last_pt != last_start |
|
1952 |
&& qt_painterpath_isect_line_rect(last_pt.x(), last_pt.y(), |
|
1953 |
last_start.x(), last_start.y(), rect)) |
|
1954 |
return true; |
|
1955 |
||
1956 |
return false; |
|
1957 |
} |
|
1958 |
||
1959 |
/*! |
|
1960 |
\fn bool QPainterPath::intersects(const QRectF &rectangle) const |
|
1961 |
||
1962 |
Returns true if any point in the given \a rectangle intersects the |
|
1963 |
path; otherwise returns false. |
|
1964 |
||
1965 |
There is an intersection if any of the lines making up the |
|
1966 |
rectangle crosses a part of the path or if any part of the |
|
1967 |
rectangle overlaps with any area enclosed by the path. This |
|
1968 |
function respects the current fillRule to determine what is |
|
1969 |
considered inside the path. |
|
1970 |
||
1971 |
\sa contains() |
|
1972 |
*/ |
|
1973 |
bool QPainterPath::intersects(const QRectF &rect) const |
|
1974 |
{ |
|
1975 |
if (elementCount() == 1 && rect.contains(elementAt(0))) |
|
1976 |
return true; |
|
1977 |
||
1978 |
if (isEmpty()) |
|
1979 |
return false; |
|
1980 |
||
1981 |
QRectF cp = controlPointRect(); |
|
1982 |
QRectF rn = rect.normalized(); |
|
1983 |
||
1984 |
// QRectF::intersects returns false if one of the rects is a null rect |
|
1985 |
// which would happen for a painter path consisting of a vertical or |
|
1986 |
// horizontal line |
|
1987 |
if (qMax(rn.left(), cp.left()) > qMin(rn.right(), cp.right()) |
|
1988 |
|| qMax(rn.top(), cp.top()) > qMin(rn.bottom(), cp.bottom())) |
|
1989 |
return false; |
|
1990 |
||
1991 |
// If any path element cross the rect its bound to be an intersection |
|
1992 |
if (qt_painterpath_check_crossing(this, rect)) |
|
1993 |
return true; |
|
1994 |
||
1995 |
if (contains(rect.center())) |
|
1996 |
return true; |
|
1997 |
||
1998 |
Q_D(QPainterPath); |
|
1999 |
||
2000 |
// Check if the rectangle surounds any subpath... |
|
2001 |
for (int i=0; i<d->elements.size(); ++i) { |
|
2002 |
const Element &e = d->elements.at(i); |
|
2003 |
if (e.type == QPainterPath::MoveToElement && rect.contains(e)) |
|
2004 |
return true; |
|
2005 |
} |
|
2006 |
||
2007 |
return false; |
|
2008 |
} |
|
2009 |
||
2010 |
/*! |
|
2011 |
Translates all elements in the path by (\a{dx}, \a{dy}). |
|
2012 |
||
2013 |
\since 4.6 |
|
2014 |
\sa translated() |
|
2015 |
*/ |
|
2016 |
void QPainterPath::translate(qreal dx, qreal dy) |
|
2017 |
{ |
|
2018 |
if (!d_ptr || (dx == 0 && dy == 0)) |
|
2019 |
return; |
|
2020 |
||
2021 |
int elementsLeft = d_ptr->elements.size(); |
|
2022 |
if (elementsLeft <= 0) |
|
2023 |
return; |
|
2024 |
||
2025 |
detach(); |
|
2026 |
QPainterPath::Element *element = d_func()->elements.data(); |
|
2027 |
Q_ASSERT(element); |
|
2028 |
while (elementsLeft--) { |
|
2029 |
element->x += dx; |
|
2030 |
element->y += dy; |
|
2031 |
++element; |
|
2032 |
} |
|
2033 |
} |
|
2034 |
||
2035 |
/*! |
|
2036 |
\fn void QPainterPath::translate(const QPointF &offset) |
|
2037 |
\overload |
|
2038 |
\since 4.6 |
|
2039 |
||
2040 |
Translates all elements in the path by the given \a offset. |
|
2041 |
||
2042 |
\sa translated() |
|
2043 |
*/ |
|
2044 |
||
2045 |
/*! |
|
2046 |
Returns a copy of the path that is translated by (\a{dx}, \a{dy}). |
|
2047 |
||
2048 |
\since 4.6 |
|
2049 |
\sa translate() |
|
2050 |
*/ |
|
2051 |
QPainterPath QPainterPath::translated(qreal dx, qreal dy) const |
|
2052 |
{ |
|
2053 |
QPainterPath copy(*this); |
|
2054 |
copy.translate(dx, dy); |
|
2055 |
return copy; |
|
2056 |
} |
|
2057 |
||
2058 |
/*! |
|
2059 |
\fn QPainterPath QPainterPath::translated(const QPointF &offset) const; |
|
2060 |
\overload |
|
2061 |
\since 4.6 |
|
2062 |
||
2063 |
Returns a copy of the path that is translated by the given \a offset. |
|
2064 |
||
2065 |
\sa translate() |
|
2066 |
*/ |
|
2067 |
||
2068 |
/*! |
|
2069 |
\fn bool QPainterPath::contains(const QRectF &rectangle) const |
|
2070 |
||
2071 |
Returns true if the given \a rectangle is inside the path, |
|
2072 |
otherwise returns false. |
|
2073 |
*/ |
|
2074 |
bool QPainterPath::contains(const QRectF &rect) const |
|
2075 |
{ |
|
2076 |
Q_D(QPainterPath); |
|
2077 |
||
2078 |
// the path is empty or the control point rect doesn't completely |
|
2079 |
// cover the rectangle we abort stratight away. |
|
2080 |
if (isEmpty() || !controlPointRect().contains(rect)) |
|
2081 |
return false; |
|
2082 |
||
2083 |
// if there are intersections, chances are that the rect is not |
|
2084 |
// contained, except if we have winding rule, in which case it |
|
2085 |
// still might. |
|
2086 |
if (qt_painterpath_check_crossing(this, rect)) { |
|
2087 |
if (fillRule() == Qt::OddEvenFill) { |
|
2088 |
return false; |
|
2089 |
} else { |
|
2090 |
// Do some wague sampling in the winding case. This is not |
|
2091 |
// precise but it should mostly be good enough. |
|
2092 |
if (!contains(rect.topLeft()) || |
|
2093 |
!contains(rect.topRight()) || |
|
2094 |
!contains(rect.bottomRight()) || |
|
2095 |
!contains(rect.bottomLeft())) |
|
2096 |
return false; |
|
2097 |
} |
|
2098 |
} |
|
2099 |
||
2100 |
// If there exists a point inside that is not part of the path its |
|
2101 |
// because: rectangle lies completely outside path or a subpath |
|
2102 |
// excludes parts of the rectangle. Both cases mean that the rect |
|
2103 |
// is not contained |
|
2104 |
if (!contains(rect.center())) |
|
2105 |
return false; |
|
2106 |
||
2107 |
// If there are any subpaths inside this rectangle we need to |
|
2108 |
// check if they are still contained as a result of the fill |
|
2109 |
// rule. This can only be the case for WindingFill though. For |
|
2110 |
// OddEvenFill the rect will never be contained if it surrounds a |
|
2111 |
// subpath. (the case where two subpaths are completely identical |
|
2112 |
// can be argued but we choose to neglect it). |
|
2113 |
for (int i=0; i<d->elements.size(); ++i) { |
|
2114 |
const Element &e = d->elements.at(i); |
|
2115 |
if (e.type == QPainterPath::MoveToElement && rect.contains(e)) { |
|
2116 |
if (fillRule() == Qt::OddEvenFill) |
|
2117 |
return false; |
|
2118 |
||
2119 |
bool stop = false; |
|
2120 |
for (; !stop && i<d->elements.size(); ++i) { |
|
2121 |
const Element &el = d->elements.at(i); |
|
2122 |
switch (el.type) { |
|
2123 |
case MoveToElement: |
|
2124 |
stop = true; |
|
2125 |
break; |
|
2126 |
case LineToElement: |
|
2127 |
if (!contains(el)) |
|
2128 |
return false; |
|
2129 |
break; |
|
2130 |
case CurveToElement: |
|
2131 |
if (!contains(d->elements.at(i+2))) |
|
2132 |
return false; |
|
2133 |
i += 2; |
|
2134 |
break; |
|
2135 |
default: |
|
2136 |
break; |
|
2137 |
} |
|
2138 |
} |
|
2139 |
||
2140 |
// compensate for the last ++i in the inner for |
|
2141 |
--i; |
|
2142 |
} |
|
2143 |
} |
|
2144 |
||
2145 |
return true; |
|
2146 |
} |
|
2147 |
||
2148 |
static inline bool epsilonCompare(const QPointF &a, const QPointF &b, const QSizeF &epsilon) |
|
2149 |
{ |
|
2150 |
return qAbs(a.x() - b.x()) <= epsilon.width() |
|
2151 |
&& qAbs(a.y() - b.y()) <= epsilon.height(); |
|
2152 |
} |
|
2153 |
||
2154 |
/*! |
|
2155 |
Returns true if this painterpath is equal to the given \a path. |
|
2156 |
||
2157 |
Note that comparing paths may involve a per element comparison |
|
2158 |
which can be slow for complex paths. |
|
2159 |
||
2160 |
\sa operator!=() |
|
2161 |
*/ |
|
2162 |
||
2163 |
bool QPainterPath::operator==(const QPainterPath &path) const |
|
2164 |
{ |
|
2165 |
QPainterPathData *d = reinterpret_cast<QPainterPathData *>(d_func()); |
|
2166 |
if (path.d_func() == d) |
|
2167 |
return true; |
|
2168 |
else if (!d || !path.d_func()) |
|
2169 |
return false; |
|
2170 |
else if (d->fillRule != path.d_func()->fillRule) |
|
2171 |
return false; |
|
2172 |
else if (d->elements.size() != path.d_func()->elements.size()) |
|
2173 |
return false; |
|
2174 |
||
2175 |
const qreal qt_epsilon = sizeof(qreal) == sizeof(double) ? 1e-12 : qreal(1e-5); |
|
2176 |
||
2177 |
QSizeF epsilon = boundingRect().size(); |
|
2178 |
epsilon.rwidth() *= qt_epsilon; |
|
2179 |
epsilon.rheight() *= qt_epsilon; |
|
2180 |
||
2181 |
for (int i = 0; i < d->elements.size(); ++i) |
|
2182 |
if (d->elements.at(i).type != path.d_func()->elements.at(i).type |
|
2183 |
|| !epsilonCompare(d->elements.at(i), path.d_func()->elements.at(i), epsilon)) |
|
2184 |
return false; |
|
2185 |
||
2186 |
return true; |
|
2187 |
} |
|
2188 |
||
2189 |
/*! |
|
2190 |
Returns true if this painter path differs from the given \a path. |
|
2191 |
||
2192 |
Note that comparing paths may involve a per element comparison |
|
2193 |
which can be slow for complex paths. |
|
2194 |
||
2195 |
\sa operator==() |
|
2196 |
*/ |
|
2197 |
||
2198 |
bool QPainterPath::operator!=(const QPainterPath &path) const |
|
2199 |
{ |
|
2200 |
return !(*this==path); |
|
2201 |
} |
|
2202 |
||
2203 |
/*! |
|
2204 |
\since 4.5 |
|
2205 |
||
2206 |
Returns the intersection of this path and the \a other path. |
|
2207 |
||
2208 |
\sa intersected(), operator&=(), united(), operator|() |
|
2209 |
*/ |
|
2210 |
QPainterPath QPainterPath::operator&(const QPainterPath &other) const |
|
2211 |
{ |
|
2212 |
return intersected(other); |
|
2213 |
} |
|
2214 |
||
2215 |
/*! |
|
2216 |
\since 4.5 |
|
2217 |
||
2218 |
Returns the union of this path and the \a other path. |
|
2219 |
||
2220 |
\sa united(), operator|=(), intersected(), operator&() |
|
2221 |
*/ |
|
2222 |
QPainterPath QPainterPath::operator|(const QPainterPath &other) const |
|
2223 |
{ |
|
2224 |
return united(other); |
|
2225 |
} |
|
2226 |
||
2227 |
/*! |
|
2228 |
\since 4.5 |
|
2229 |
||
2230 |
Returns the union of this path and the \a other path. This function is equivalent |
|
2231 |
to operator|(). |
|
2232 |
||
2233 |
\sa united(), operator+=(), operator-() |
|
2234 |
*/ |
|
2235 |
QPainterPath QPainterPath::operator+(const QPainterPath &other) const |
|
2236 |
{ |
|
2237 |
return united(other); |
|
2238 |
} |
|
2239 |
||
2240 |
/*! |
|
2241 |
\since 4.5 |
|
2242 |
||
2243 |
Subtracts the \a other path from a copy of this path, and returns the copy. |
|
2244 |
||
2245 |
\sa subtracted(), operator-=(), operator+() |
|
2246 |
*/ |
|
2247 |
QPainterPath QPainterPath::operator-(const QPainterPath &other) const |
|
2248 |
{ |
|
2249 |
return subtracted(other); |
|
2250 |
} |
|
2251 |
||
2252 |
/*! |
|
2253 |
\since 4.5 |
|
2254 |
||
2255 |
Intersects this path with \a other and returns a reference to this path. |
|
2256 |
||
2257 |
\sa intersected(), operator&(), operator|=() |
|
2258 |
*/ |
|
2259 |
QPainterPath &QPainterPath::operator&=(const QPainterPath &other) |
|
2260 |
{ |
|
2261 |
return *this = (*this & other); |
|
2262 |
} |
|
2263 |
||
2264 |
/*! |
|
2265 |
\since 4.5 |
|
2266 |
||
2267 |
Unites this path with \a other and returns a reference to this path. |
|
2268 |
||
2269 |
\sa united(), operator|(), operator&=() |
|
2270 |
*/ |
|
2271 |
QPainterPath &QPainterPath::operator|=(const QPainterPath &other) |
|
2272 |
{ |
|
2273 |
return *this = (*this | other); |
|
2274 |
} |
|
2275 |
||
2276 |
/*! |
|
2277 |
\since 4.5 |
|
2278 |
||
2279 |
Unites this path with \a other, and returns a reference to this path. This |
|
2280 |
is equivalent to operator|=(). |
|
2281 |
||
2282 |
\sa united(), operator+(), operator-=() |
|
2283 |
*/ |
|
2284 |
QPainterPath &QPainterPath::operator+=(const QPainterPath &other) |
|
2285 |
{ |
|
2286 |
return *this = (*this + other); |
|
2287 |
} |
|
2288 |
||
2289 |
/*! |
|
2290 |
\since 4.5 |
|
2291 |
||
2292 |
Subtracts \a other from this path, and returns a reference to this |
|
2293 |
path. |
|
2294 |
||
2295 |
\sa subtracted(), operator-(), operator+=() |
|
2296 |
*/ |
|
2297 |
QPainterPath &QPainterPath::operator-=(const QPainterPath &other) |
|
2298 |
{ |
|
2299 |
return *this = (*this - other); |
|
2300 |
} |
|
2301 |
||
2302 |
#ifndef QT_NO_DATASTREAM |
|
2303 |
/*! |
|
2304 |
\fn QDataStream &operator<<(QDataStream &stream, const QPainterPath &path) |
|
2305 |
\relates QPainterPath |
|
2306 |
||
2307 |
Writes the given painter \a path to the given \a stream, and |
|
2308 |
returns a reference to the \a stream. |
|
2309 |
||
30
5dc02b23752f
Revision: 201025
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
18
diff
changeset
|
2310 |
\sa {Serializing Qt Data Types} |
0 | 2311 |
*/ |
2312 |
QDataStream &operator<<(QDataStream &s, const QPainterPath &p) |
|
2313 |
{ |
|
2314 |
if (p.isEmpty()) { |
|
2315 |
s << 0; |
|
2316 |
return s; |
|
2317 |
} |
|
2318 |
||
2319 |
s << p.elementCount(); |
|
2320 |
for (int i=0; i < p.d_func()->elements.size(); ++i) { |
|
2321 |
const QPainterPath::Element &e = p.d_func()->elements.at(i); |
|
2322 |
s << int(e.type); |
|
2323 |
s << double(e.x) << double(e.y); |
|
2324 |
} |
|
2325 |
s << p.d_func()->cStart; |
|
2326 |
s << int(p.d_func()->fillRule); |
|
2327 |
return s; |
|
2328 |
} |
|
2329 |
||
2330 |
/*! |
|
2331 |
\fn QDataStream &operator>>(QDataStream &stream, QPainterPath &path) |
|
2332 |
\relates QPainterPath |
|
2333 |
||
2334 |
Reads a painter path from the given \a stream into the specified \a path, |
|
2335 |
and returns a reference to the \a stream. |
|
2336 |
||
30
5dc02b23752f
Revision: 201025
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
18
diff
changeset
|
2337 |
\sa {Serializing Qt Data Types} |
0 | 2338 |
*/ |
2339 |
QDataStream &operator>>(QDataStream &s, QPainterPath &p) |
|
2340 |
{ |
|
2341 |
int size; |
|
2342 |
s >> size; |
|
2343 |
||
2344 |
if (size == 0) |
|
2345 |
return s; |
|
2346 |
||
2347 |
p.ensureData(); // in case if p.d_func() == 0 |
|
2348 |
if (p.d_func()->elements.size() == 1) { |
|
2349 |
Q_ASSERT(p.d_func()->elements.at(0).type == QPainterPath::MoveToElement); |
|
2350 |
p.d_func()->elements.clear(); |
|
2351 |
} |
|
2352 |
p.d_func()->elements.reserve(p.d_func()->elements.size() + size); |
|
2353 |
for (int i=0; i<size; ++i) { |
|
2354 |
int type; |
|
2355 |
double x, y; |
|
2356 |
s >> type; |
|
2357 |
s >> x; |
|
2358 |
s >> y; |
|
2359 |
Q_ASSERT(type >= 0 && type <= 3); |
|
2360 |
#ifndef QT_NO_DEBUG |
|
2361 |
if (qt_is_nan(x) || qt_is_nan(y)) |
|
2362 |
qWarning("QDataStream::operator>>: Adding a NaN element to path, results are undefined"); |
|
2363 |
#endif |
|
2364 |
QPainterPath::Element elm = { x, y, QPainterPath::ElementType(type) }; |
|
2365 |
p.d_func()->elements.append(elm); |
|
2366 |
} |
|
2367 |
s >> p.d_func()->cStart; |
|
2368 |
int fillRule; |
|
2369 |
s >> fillRule; |
|
2370 |
Q_ASSERT(fillRule == Qt::OddEvenFill || Qt::WindingFill); |
|
2371 |
p.d_func()->fillRule = Qt::FillRule(fillRule); |
|
2372 |
p.d_func()->dirtyBounds = true; |
|
2373 |
p.d_func()->dirtyControlBounds = true; |
|
2374 |
return s; |
|
2375 |
} |
|
2376 |
#endif // QT_NO_DATASTREAM |
|
2377 |
||
2378 |
||
2379 |
/******************************************************************************* |
|
2380 |
* class QPainterPathStroker |
|
2381 |
*/ |
|
2382 |
||
2383 |
void qt_path_stroke_move_to(qfixed x, qfixed y, void *data) |
|
2384 |
{ |
|
2385 |
((QPainterPath *) data)->moveTo(qt_fixed_to_real(x), qt_fixed_to_real(y)); |
|
2386 |
} |
|
2387 |
||
2388 |
void qt_path_stroke_line_to(qfixed x, qfixed y, void *data) |
|
2389 |
{ |
|
2390 |
((QPainterPath *) data)->lineTo(qt_fixed_to_real(x), qt_fixed_to_real(y)); |
|
2391 |
} |
|
2392 |
||
2393 |
void qt_path_stroke_cubic_to(qfixed c1x, qfixed c1y, |
|
2394 |
qfixed c2x, qfixed c2y, |
|
2395 |
qfixed ex, qfixed ey, |
|
2396 |
void *data) |
|
2397 |
{ |
|
2398 |
((QPainterPath *) data)->cubicTo(qt_fixed_to_real(c1x), qt_fixed_to_real(c1y), |
|
2399 |
qt_fixed_to_real(c2x), qt_fixed_to_real(c2y), |
|
2400 |
qt_fixed_to_real(ex), qt_fixed_to_real(ey)); |
|
2401 |
} |
|
2402 |
||
2403 |
/*! |
|
2404 |
\since 4.1 |
|
2405 |
\class QPainterPathStroker |
|
2406 |
\ingroup painting |
|
2407 |
||
2408 |
\brief The QPainterPathStroker class is used to generate fillable |
|
2409 |
outlines for a given painter path. |
|
2410 |
||
2411 |
By calling the createStroke() function, passing a given |
|
2412 |
QPainterPath as argument, a new painter path representing the |
|
2413 |
outline of the given path is created. The newly created painter |
|
2414 |
path can then be filled to draw the original painter path's |
|
2415 |
outline. |
|
2416 |
||
2417 |
You can control the various design aspects (width, cap styles, |
|
2418 |
join styles and dash pattern) of the outlining using the following |
|
2419 |
functions: |
|
2420 |
||
2421 |
\list |
|
2422 |
\o setWidth() |
|
2423 |
\o setCapStyle() |
|
2424 |
\o setJoinStyle() |
|
2425 |
\o setDashPattern() |
|
2426 |
\endlist |
|
2427 |
||
2428 |
The setDashPattern() function accepts both a Qt::PenStyle object |
|
2429 |
and a vector representation of the pattern as argument. |
|
2430 |
||
2431 |
In addition you can specify a curve's threshold, controlling the |
|
2432 |
granularity with which a curve is drawn, using the |
|
2433 |
setCurveThreshold() function. The default threshold is a well |
|
2434 |
adjusted value (0.25), and normally you should not need to modify |
|
2435 |
it. However, you can make the curve's appearance smoother by |
|
2436 |
decreasing its value. |
|
2437 |
||
2438 |
You can also control the miter limit for the generated outline |
|
2439 |
using the setMiterLimit() function. The miter limit describes how |
|
2440 |
far from each join the miter join can extend. The limit is |
|
2441 |
specified in the units of width so the pixelwise miter limit will |
|
2442 |
be \c {miterlimit * width}. This value is only used if the join |
|
2443 |
style is Qt::MiterJoin. |
|
2444 |
||
2445 |
The painter path generated by the createStroke() function should |
|
2446 |
only be used for outlining the given painter path. Otherwise it |
|
2447 |
may cause unexpected behavior. Generated outlines also require the |
|
2448 |
Qt::WindingFill rule which is set by default. |
|
2449 |
||
2450 |
\sa QPen, QBrush |
|
2451 |
*/ |
|
2452 |
||
2453 |
QPainterPathStrokerPrivate::QPainterPathStrokerPrivate() |
|
2454 |
: dashOffset(0) |
|
2455 |
{ |
|
2456 |
stroker.setMoveToHook(qt_path_stroke_move_to); |
|
2457 |
stroker.setLineToHook(qt_path_stroke_line_to); |
|
2458 |
stroker.setCubicToHook(qt_path_stroke_cubic_to); |
|
2459 |
} |
|
2460 |
||
2461 |
/*! |
|
2462 |
Creates a new stroker. |
|
2463 |
*/ |
|
2464 |
QPainterPathStroker::QPainterPathStroker() |
|
2465 |
: d_ptr(new QPainterPathStrokerPrivate) |
|
2466 |
{ |
|
2467 |
} |
|
2468 |
||
2469 |
/*! |
|
2470 |
Destroys the stroker. |
|
2471 |
*/ |
|
2472 |
QPainterPathStroker::~QPainterPathStroker() |
|
2473 |
{ |
|
2474 |
} |
|
2475 |
||
2476 |
||
2477 |
/*! |
|
2478 |
Generates a new path that is a fillable area representing the |
|
2479 |
outline of the given \a path. |
|
2480 |
||
2481 |
The various design aspects of the outline are based on the |
|
2482 |
stroker's properties: width(), capStyle(), joinStyle(), |
|
2483 |
dashPattern(), curveThreshold() and miterLimit(). |
|
2484 |
||
2485 |
The generated path should only be used for outlining the given |
|
2486 |
painter path. Otherwise it may cause unexpected |
|
2487 |
behavior. Generated outlines also require the Qt::WindingFill rule |
|
2488 |
which is set by default. |
|
2489 |
*/ |
|
2490 |
QPainterPath QPainterPathStroker::createStroke(const QPainterPath &path) const |
|
2491 |
{ |
|
2492 |
QPainterPathStrokerPrivate *d = const_cast<QPainterPathStrokerPrivate *>(d_func()); |
|
2493 |
QPainterPath stroke; |
|
2494 |
if (path.isEmpty()) |
|
2495 |
return path; |
|
2496 |
if (d->dashPattern.isEmpty()) { |
|
2497 |
d->stroker.strokePath(path, &stroke, QTransform()); |
|
2498 |
} else { |
|
2499 |
QDashStroker dashStroker(&d->stroker); |
|
2500 |
dashStroker.setDashPattern(d->dashPattern); |
|
2501 |
dashStroker.setDashOffset(d->dashOffset); |
|
2502 |
dashStroker.setClipRect(d->stroker.clipRect()); |
|
2503 |
dashStroker.strokePath(path, &stroke, QTransform()); |
|
2504 |
} |
|
2505 |
stroke.setFillRule(Qt::WindingFill); |
|
2506 |
return stroke; |
|
2507 |
} |
|
2508 |
||
2509 |
/*! |
|
2510 |
Sets the width of the generated outline painter path to \a width. |
|
2511 |
||
2512 |
The generated outlines will extend approximately 50% of \a width |
|
2513 |
to each side of the given input path's original outline. |
|
2514 |
*/ |
|
2515 |
void QPainterPathStroker::setWidth(qreal width) |
|
2516 |
{ |
|
2517 |
Q_D(QPainterPathStroker); |
|
2518 |
if (width <= 0) |
|
2519 |
width = 1; |
|
2520 |
d->stroker.setStrokeWidth(qt_real_to_fixed(width)); |
|
2521 |
} |
|
2522 |
||
2523 |
/*! |
|
2524 |
Returns the width of the generated outlines. |
|
2525 |
*/ |
|
2526 |
qreal QPainterPathStroker::width() const |
|
2527 |
{ |
|
2528 |
return qt_fixed_to_real(d_func()->stroker.strokeWidth()); |
|
2529 |
} |
|
2530 |
||
2531 |
||
2532 |
/*! |
|
2533 |
Sets the cap style of the generated outlines to \a style. If a |
|
2534 |
dash pattern is set, each segment of the pattern is subject to the |
|
2535 |
cap \a style. |
|
2536 |
*/ |
|
2537 |
void QPainterPathStroker::setCapStyle(Qt::PenCapStyle style) |
|
2538 |
{ |
|
2539 |
d_func()->stroker.setCapStyle(style); |
|
2540 |
} |
|
2541 |
||
2542 |
||
2543 |
/*! |
|
2544 |
Returns the cap style of the generated outlines. |
|
2545 |
*/ |
|
2546 |
Qt::PenCapStyle QPainterPathStroker::capStyle() const |
|
2547 |
{ |
|
2548 |
return d_func()->stroker.capStyle(); |
|
2549 |
} |
|
2550 |
||
2551 |
/*! |
|
2552 |
Sets the join style of the generated outlines to \a style. |
|
2553 |
*/ |
|
2554 |
void QPainterPathStroker::setJoinStyle(Qt::PenJoinStyle style) |
|
2555 |
{ |
|
2556 |
d_func()->stroker.setJoinStyle(style); |
|
2557 |
} |
|
2558 |
||
2559 |
/*! |
|
2560 |
Returns the join style of the generated outlines. |
|
2561 |
*/ |
|
2562 |
Qt::PenJoinStyle QPainterPathStroker::joinStyle() const |
|
2563 |
{ |
|
2564 |
return d_func()->stroker.joinStyle(); |
|
2565 |
} |
|
2566 |
||
2567 |
/*! |
|
2568 |
Sets the miter limit of the generated outlines to \a limit. |
|
2569 |
||
2570 |
The miter limit describes how far from each join the miter join |
|
2571 |
can extend. The limit is specified in units of the currently set |
|
2572 |
width. So the pixelwise miter limit will be \c { miterlimit * |
|
2573 |
width}. |
|
2574 |
||
2575 |
This value is only used if the join style is Qt::MiterJoin. |
|
2576 |
*/ |
|
2577 |
void QPainterPathStroker::setMiterLimit(qreal limit) |
|
2578 |
{ |
|
2579 |
d_func()->stroker.setMiterLimit(qt_real_to_fixed(limit)); |
|
2580 |
} |
|
2581 |
||
2582 |
/*! |
|
2583 |
Returns the miter limit for the generated outlines. |
|
2584 |
*/ |
|
2585 |
qreal QPainterPathStroker::miterLimit() const |
|
2586 |
{ |
|
2587 |
return qt_fixed_to_real(d_func()->stroker.miterLimit()); |
|
2588 |
} |
|
2589 |
||
2590 |
||
2591 |
/*! |
|
2592 |
Specifies the curve flattening \a threshold, controlling the |
|
2593 |
granularity with which the generated outlines' curve is drawn. |
|
2594 |
||
2595 |
The default threshold is a well adjusted value (0.25), and |
|
2596 |
normally you should not need to modify it. However, you can make |
|
2597 |
the curve's appearance smoother by decreasing its value. |
|
2598 |
*/ |
|
2599 |
void QPainterPathStroker::setCurveThreshold(qreal threshold) |
|
2600 |
{ |
|
2601 |
d_func()->stroker.setCurveThreshold(qt_real_to_fixed(threshold)); |
|
2602 |
} |
|
2603 |
||
2604 |
/*! |
|
2605 |
Returns the curve flattening threshold for the generated |
|
2606 |
outlines. |
|
2607 |
*/ |
|
2608 |
qreal QPainterPathStroker::curveThreshold() const |
|
2609 |
{ |
|
2610 |
return qt_fixed_to_real(d_func()->stroker.curveThreshold()); |
|
2611 |
} |
|
2612 |
||
2613 |
/*! |
|
2614 |
Sets the dash pattern for the generated outlines to \a style. |
|
2615 |
*/ |
|
2616 |
void QPainterPathStroker::setDashPattern(Qt::PenStyle style) |
|
2617 |
{ |
|
2618 |
d_func()->dashPattern = QDashStroker::patternForStyle(style); |
|
2619 |
} |
|
2620 |
||
2621 |
/*! |
|
2622 |
\overload |
|
2623 |
||
2624 |
Sets the dash pattern for the generated outlines to \a |
|
2625 |
dashPattern. This function makes it possible to specify custom |
|
2626 |
dash patterns. |
|
2627 |
||
2628 |
Each element in the vector contains the lengths of the dashes and spaces |
|
2629 |
in the stroke, beginning with the first dash in the first element, the |
|
2630 |
first space in the second element, and alternating between dashes and |
|
2631 |
spaces for each following pair of elements. |
|
2632 |
||
2633 |
The vector can contain an odd number of elements, in which case the last |
|
2634 |
element will be extended by the length of the first element when the |
|
2635 |
pattern repeats. |
|
2636 |
*/ |
|
2637 |
void QPainterPathStroker::setDashPattern(const QVector<qreal> &dashPattern) |
|
2638 |
{ |
|
2639 |
d_func()->dashPattern.clear(); |
|
2640 |
for (int i=0; i<dashPattern.size(); ++i) |
|
2641 |
d_func()->dashPattern << qt_real_to_fixed(dashPattern.at(i)); |
|
2642 |
} |
|
2643 |
||
2644 |
/*! |
|
2645 |
Returns the dash pattern for the generated outlines. |
|
2646 |
*/ |
|
2647 |
QVector<qreal> QPainterPathStroker::dashPattern() const |
|
2648 |
{ |
|
2649 |
return d_func()->dashPattern; |
|
2650 |
} |
|
2651 |
||
2652 |
/*! |
|
2653 |
Returns the dash offset for the generated outlines. |
|
2654 |
*/ |
|
2655 |
qreal QPainterPathStroker::dashOffset() const |
|
2656 |
{ |
|
2657 |
return d_func()->dashOffset; |
|
2658 |
} |
|
2659 |
||
2660 |
/*! |
|
2661 |
Sets the dash offset for the generated outlines to \a offset. |
|
2662 |
||
2663 |
See the documentation for QPen::setDashOffset() for a description of the |
|
2664 |
dash offset. |
|
2665 |
*/ |
|
2666 |
void QPainterPathStroker::setDashOffset(qreal offset) |
|
2667 |
{ |
|
2668 |
d_func()->dashOffset = offset; |
|
2669 |
} |
|
2670 |
||
2671 |
/*! |
|
2672 |
Converts the path into a polygon using the QTransform |
|
2673 |
\a matrix, and returns the polygon. |
|
2674 |
||
2675 |
The polygon is created by first converting all subpaths to |
|
2676 |
polygons, then using a rewinding technique to make sure that |
|
2677 |
overlapping subpaths can be filled using the correct fill rule. |
|
2678 |
||
2679 |
Note that rewinding inserts addition lines in the polygon so |
|
2680 |
the outline of the fill polygon does not match the outline of |
|
2681 |
the path. |
|
2682 |
||
2683 |
\sa toSubpathPolygons(), toFillPolygons(), |
|
2684 |
{QPainterPath#QPainterPath Conversion}{QPainterPath Conversion} |
|
2685 |
*/ |
|
2686 |
QPolygonF QPainterPath::toFillPolygon(const QTransform &matrix) const |
|
2687 |
{ |
|
2688 |
||
2689 |
QList<QPolygonF> flats = toSubpathPolygons(matrix); |
|
2690 |
QPolygonF polygon; |
|
2691 |
if (flats.isEmpty()) |
|
2692 |
return polygon; |
|
2693 |
QPointF first = flats.first().first(); |
|
2694 |
for (int i=0; i<flats.size(); ++i) { |
|
2695 |
polygon += flats.at(i); |
|
2696 |
if (!flats.at(i).isClosed()) |
|
2697 |
polygon += flats.at(i).first(); |
|
2698 |
if (i > 0) |
|
2699 |
polygon += first; |
|
2700 |
} |
|
2701 |
return polygon; |
|
2702 |
} |
|
2703 |
||
2704 |
/*! |
|
2705 |
\overload |
|
2706 |
*/ |
|
2707 |
QPolygonF QPainterPath::toFillPolygon(const QMatrix &matrix) const |
|
2708 |
{ |
|
2709 |
return toFillPolygon(QTransform(matrix)); |
|
2710 |
} |
|
2711 |
||
2712 |
||
2713 |
//derivative of the equation |
|
2714 |
static inline qreal slopeAt(qreal t, qreal a, qreal b, qreal c, qreal d) |
|
2715 |
{ |
|
2716 |
return 3*t*t*(d - 3*c + 3*b - a) + 6*t*(c - 2*b + a) + 3*(b - a); |
|
2717 |
} |
|
2718 |
||
2719 |
/*! |
|
2720 |
Returns the length of the current path. |
|
2721 |
*/ |
|
2722 |
qreal QPainterPath::length() const |
|
2723 |
{ |
|
2724 |
Q_D(QPainterPath); |
|
2725 |
if (isEmpty()) |
|
2726 |
return 0; |
|
2727 |
||
2728 |
qreal len = 0; |
|
2729 |
for (int i=1; i<d->elements.size(); ++i) { |
|
2730 |
const Element &e = d->elements.at(i); |
|
2731 |
||
2732 |
switch (e.type) { |
|
2733 |
case MoveToElement: |
|
2734 |
break; |
|
2735 |
case LineToElement: |
|
2736 |
{ |
|
2737 |
len += QLineF(d->elements.at(i-1), e).length(); |
|
2738 |
break; |
|
2739 |
} |
|
2740 |
case CurveToElement: |
|
2741 |
{ |
|
2742 |
QBezier b = QBezier::fromPoints(d->elements.at(i-1), |
|
2743 |
e, |
|
2744 |
d->elements.at(i+1), |
|
2745 |
d->elements.at(i+2)); |
|
2746 |
len += b.length(); |
|
2747 |
i += 2; |
|
2748 |
break; |
|
2749 |
} |
|
2750 |
default: |
|
2751 |
break; |
|
2752 |
} |
|
2753 |
} |
|
2754 |
return len; |
|
2755 |
} |
|
2756 |
||
2757 |
/*! |
|
2758 |
Returns percentage of the whole path at the specified length \a len. |
|
2759 |
||
2760 |
Note that similarly to other percent methods, the percentage measurement |
|
2761 |
is not linear with regards to the length, if curves are present |
|
2762 |
in the path. When curves are present the percentage argument is mapped |
|
2763 |
to the t parameter of the Bezier equations. |
|
2764 |
*/ |
|
2765 |
qreal QPainterPath::percentAtLength(qreal len) const |
|
2766 |
{ |
|
2767 |
Q_D(QPainterPath); |
|
2768 |
if (isEmpty() || len <= 0) |
|
2769 |
return 0; |
|
2770 |
||
2771 |
qreal totalLength = length(); |
|
2772 |
if (len > totalLength) |
|
2773 |
return 1; |
|
2774 |
||
2775 |
qreal curLen = 0; |
|
2776 |
for (int i=1; i<d->elements.size(); ++i) { |
|
2777 |
const Element &e = d->elements.at(i); |
|
2778 |
||
2779 |
switch (e.type) { |
|
2780 |
case MoveToElement: |
|
2781 |
break; |
|
2782 |
case LineToElement: |
|
2783 |
{ |
|
2784 |
QLineF line(d->elements.at(i-1), e); |
|
2785 |
qreal llen = line.length(); |
|
2786 |
curLen += llen; |
|
2787 |
if (curLen >= len) { |
|
2788 |
return len/totalLength ; |
|
2789 |
} |
|
2790 |
||
2791 |
break; |
|
2792 |
} |
|
2793 |
case CurveToElement: |
|
2794 |
{ |
|
2795 |
QBezier b = QBezier::fromPoints(d->elements.at(i-1), |
|
2796 |
e, |
|
2797 |
d->elements.at(i+1), |
|
2798 |
d->elements.at(i+2)); |
|
2799 |
qreal blen = b.length(); |
|
2800 |
qreal prevLen = curLen; |
|
2801 |
curLen += blen; |
|
2802 |
||
2803 |
if (curLen >= len) { |
|
2804 |
qreal res = b.tAtLength(len - prevLen); |
|
2805 |
return (res * blen + prevLen)/totalLength; |
|
2806 |
} |
|
2807 |
||
2808 |
i += 2; |
|
2809 |
break; |
|
2810 |
} |
|
2811 |
default: |
|
2812 |
break; |
|
2813 |
} |
|
2814 |
} |
|
2815 |
||
2816 |
return 0; |
|
2817 |
} |
|
2818 |
||
2819 |
static inline QBezier bezierAtT(const QPainterPath &path, qreal t, qreal *startingLength, qreal *bezierLength) |
|
2820 |
{ |
|
2821 |
*startingLength = 0; |
|
2822 |
if (t > 1) |
|
2823 |
return QBezier(); |
|
2824 |
||
2825 |
qreal curLen = 0; |
|
2826 |
qreal totalLength = path.length(); |
|
2827 |
||
2828 |
const int lastElement = path.elementCount() - 1; |
|
2829 |
for (int i=0; i <= lastElement; ++i) { |
|
2830 |
const QPainterPath::Element &e = path.elementAt(i); |
|
2831 |
||
2832 |
switch (e.type) { |
|
2833 |
case QPainterPath::MoveToElement: |
|
2834 |
break; |
|
2835 |
case QPainterPath::LineToElement: |
|
2836 |
{ |
|
2837 |
QLineF line(path.elementAt(i-1), e); |
|
2838 |
qreal llen = line.length(); |
|
2839 |
curLen += llen; |
|
2840 |
if (i == lastElement || curLen/totalLength >= t) { |
|
2841 |
*bezierLength = llen; |
|
2842 |
QPointF a = path.elementAt(i-1); |
|
2843 |
QPointF delta = e - a; |
|
2844 |
return QBezier::fromPoints(a, a + delta / 3, a + 2 * delta / 3, e); |
|
2845 |
} |
|
2846 |
break; |
|
2847 |
} |
|
2848 |
case QPainterPath::CurveToElement: |
|
2849 |
{ |
|
2850 |
QBezier b = QBezier::fromPoints(path.elementAt(i-1), |
|
2851 |
e, |
|
2852 |
path.elementAt(i+1), |
|
2853 |
path.elementAt(i+2)); |
|
2854 |
qreal blen = b.length(); |
|
2855 |
curLen += blen; |
|
2856 |
||
2857 |
if (i + 2 == lastElement || curLen/totalLength >= t) { |
|
2858 |
*bezierLength = blen; |
|
2859 |
return b; |
|
2860 |
} |
|
2861 |
||
2862 |
i += 2; |
|
2863 |
break; |
|
2864 |
} |
|
2865 |
default: |
|
2866 |
break; |
|
2867 |
} |
|
2868 |
*startingLength = curLen; |
|
2869 |
} |
|
2870 |
return QBezier(); |
|
2871 |
} |
|
2872 |
||
2873 |
/*! |
|
2874 |
Returns the point at at the percentage \a t of the current path. |
|
2875 |
The argument \a t has to be between 0 and 1. |
|
2876 |
||
2877 |
Note that similarly to other percent methods, the percentage measurement |
|
2878 |
is not linear with regards to the length, if curves are present |
|
2879 |
in the path. When curves are present the percentage argument is mapped |
|
2880 |
to the t parameter of the Bezier equations. |
|
2881 |
*/ |
|
2882 |
QPointF QPainterPath::pointAtPercent(qreal t) const |
|
2883 |
{ |
|
2884 |
if (t < 0 || t > 1) { |
|
2885 |
qWarning("QPainterPath::pointAtPercent accepts only values between 0 and 1"); |
|
2886 |
return QPointF(); |
|
2887 |
} |
|
2888 |
||
2889 |
if (isEmpty()) |
|
2890 |
return QPointF(); |
|
2891 |
||
2892 |
qreal totalLength = length(); |
|
2893 |
qreal curLen = 0; |
|
2894 |
qreal bezierLen = 0; |
|
2895 |
QBezier b = bezierAtT(*this, t, &curLen, &bezierLen); |
|
2896 |
qreal realT = (totalLength * t - curLen) / bezierLen; |
|
2897 |
||
2898 |
return b.pointAt(qBound(qreal(0), realT, qreal(1))); |
|
2899 |
} |
|
2900 |
||
2901 |
/*! |
|
2902 |
Returns the angle of the path tangent at the percentage \a t. |
|
2903 |
The argument \a t has to be between 0 and 1. |
|
2904 |
||
2905 |
Positive values for the angles mean counter-clockwise while negative values |
|
2906 |
mean the clockwise direction. Zero degrees is at the 3 o'clock position. |
|
2907 |
||
2908 |
Note that similarly to the other percent methods, the percentage measurement |
|
2909 |
is not linear with regards to the length if curves are present |
|
2910 |
in the path. When curves are present the percentage argument is mapped |
|
2911 |
to the t parameter of the Bezier equations. |
|
2912 |
*/ |
|
2913 |
qreal QPainterPath::angleAtPercent(qreal t) const |
|
2914 |
{ |
|
2915 |
if (t < 0 || t > 1) { |
|
2916 |
qWarning("QPainterPath::angleAtPercent accepts only values between 0 and 1"); |
|
2917 |
return 0; |
|
2918 |
} |
|
2919 |
||
2920 |
qreal totalLength = length(); |
|
2921 |
qreal curLen = 0; |
|
2922 |
qreal bezierLen = 0; |
|
2923 |
QBezier bez = bezierAtT(*this, t, &curLen, &bezierLen); |
|
2924 |
qreal realT = (totalLength * t - curLen) / bezierLen; |
|
2925 |
||
2926 |
qreal m1 = slopeAt(realT, bez.x1, bez.x2, bez.x3, bez.x4); |
|
2927 |
qreal m2 = slopeAt(realT, bez.y1, bez.y2, bez.y3, bez.y4); |
|
2928 |
||
2929 |
return QLineF(0, 0, m1, m2).angle(); |
|
2930 |
} |
|
2931 |
||
2932 |
#if defined(Q_WS_WINCE) |
|
2933 |
#pragma warning( disable : 4056 4756 ) |
|
2934 |
#endif |
|
2935 |
||
2936 |
/*! |
|
2937 |
Returns the slope of the path at the percentage \a t. The |
|
2938 |
argument \a t has to be between 0 and 1. |
|
2939 |
||
2940 |
Note that similarly to other percent methods, the percentage measurement |
|
2941 |
is not linear with regards to the length, if curves are present |
|
2942 |
in the path. When curves are present the percentage argument is mapped |
|
2943 |
to the t parameter of the Bezier equations. |
|
2944 |
*/ |
|
2945 |
qreal QPainterPath::slopeAtPercent(qreal t) const |
|
2946 |
{ |
|
2947 |
if (t < 0 || t > 1) { |
|
2948 |
qWarning("QPainterPath::slopeAtPercent accepts only values between 0 and 1"); |
|
2949 |
return 0; |
|
2950 |
} |
|
2951 |
||
2952 |
qreal totalLength = length(); |
|
2953 |
qreal curLen = 0; |
|
2954 |
qreal bezierLen = 0; |
|
2955 |
QBezier bez = bezierAtT(*this, t, &curLen, &bezierLen); |
|
2956 |
qreal realT = (totalLength * t - curLen) / bezierLen; |
|
2957 |
||
2958 |
qreal m1 = slopeAt(realT, bez.x1, bez.x2, bez.x3, bez.x4); |
|
2959 |
qreal m2 = slopeAt(realT, bez.y1, bez.y2, bez.y3, bez.y4); |
|
2960 |
//tangent line |
|
2961 |
qreal slope = 0; |
|
2962 |
||
2963 |
#define SIGN(x) ((x < 0)?-1:1) |
|
2964 |
if (m1) |
|
2965 |
slope = m2/m1; |
|
2966 |
else { |
|
2967 |
//windows doesn't define INFINITY :( |
|
2968 |
#ifdef INFINITY |
|
2969 |
slope = INFINITY*SIGN(m2); |
|
2970 |
#else |
|
2971 |
if (sizeof(qreal) == sizeof(double)) { |
|
2972 |
return 1.79769313486231570e+308; |
|
2973 |
} else { |
|
2974 |
return ((qreal)3.40282346638528860e+38); |
|
2975 |
} |
|
2976 |
#endif |
|
2977 |
} |
|
2978 |
||
2979 |
return slope; |
|
2980 |
} |
|
2981 |
||
2982 |
/*! |
|
2983 |
\since 4.4 |
|
2984 |
||
2985 |
Adds the given rectangle \a rect with rounded corners to the path. |
|
2986 |
||
2987 |
The \a xRadius and \a yRadius arguments specify the radii of |
|
2988 |
the ellipses defining the corners of the rounded rectangle. |
|
2989 |
When \a mode is Qt::RelativeSize, \a xRadius and |
|
2990 |
\a yRadius are specified in percentage of half the rectangle's |
|
2991 |
width and height respectively, and should be in the range 0.0 to 100.0. |
|
2992 |
||
2993 |
\sa addRect() |
|
2994 |
*/ |
|
2995 |
void QPainterPath::addRoundedRect(const QRectF &rect, qreal xRadius, qreal yRadius, |
|
2996 |
Qt::SizeMode mode) |
|
2997 |
{ |
|
2998 |
QRectF r = rect.normalized(); |
|
2999 |
||
3000 |
if (r.isNull()) |
|
3001 |
return; |
|
3002 |
||
3003 |
if (mode == Qt::AbsoluteSize) { |
|
3004 |
qreal w = r.width() / 2; |
|
3005 |
qreal h = r.height() / 2; |
|
3006 |
||
3007 |
if (w == 0) { |
|
3008 |
xRadius = 0; |
|
3009 |
} else { |
|
3010 |
xRadius = 100 * qMin(xRadius, w) / w; |
|
3011 |
} |
|
3012 |
if (h == 0) { |
|
3013 |
yRadius = 0; |
|
3014 |
} else { |
|
3015 |
yRadius = 100 * qMin(yRadius, h) / h; |
|
3016 |
} |
|
3017 |
} else { |
|
3018 |
if (xRadius > 100) // fix ranges |
|
3019 |
xRadius = 100; |
|
3020 |
||
3021 |
if (yRadius > 100) |
|
3022 |
yRadius = 100; |
|
3023 |
} |
|
3024 |
||
3025 |
if (xRadius <= 0 || yRadius <= 0) { // add normal rectangle |
|
3026 |
addRect(r); |
|
3027 |
return; |
|
3028 |
} |
|
3029 |
||
3030 |
qreal x = r.x(); |
|
3031 |
qreal y = r.y(); |
|
3032 |
qreal w = r.width(); |
|
3033 |
qreal h = r.height(); |
|
3034 |
qreal rxx2 = w*xRadius/100; |
|
3035 |
qreal ryy2 = h*yRadius/100; |
|
3036 |
||
3037 |
ensureData(); |
|
3038 |
detach(); |
|
3039 |
||
3
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3040 |
bool first = d_func()->elements.size() < 2; |
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3041 |
|
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3042 |
arcMoveTo(x, y, rxx2, ryy2, 180); |
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3043 |
arcTo(x, y, rxx2, ryy2, 180, -90); |
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3044 |
arcTo(x+w-rxx2, y, rxx2, ryy2, 90, -90); |
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3045 |
arcTo(x+w-rxx2, y+h-ryy2, rxx2, ryy2, 0, -90); |
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3046 |
arcTo(x, y+h-ryy2, rxx2, ryy2, 270, -90); |
0 | 3047 |
closeSubpath(); |
3048 |
||
3049 |
d_func()->require_moveTo = true; |
|
3
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3050 |
d_func()->convex = first; |
0 | 3051 |
} |
3052 |
||
3053 |
/*! |
|
3054 |
\fn void QPainterPath::addRoundedRect(qreal x, qreal y, qreal w, qreal h, qreal xRadius, qreal yRadius, Qt::SizeMode mode = Qt::AbsoluteSize); |
|
3055 |
\since 4.4 |
|
3056 |
\overload |
|
3057 |
||
3058 |
Adds the given rectangle \a x, \a y, \a w, \a h with rounded corners to the path. |
|
3059 |
*/ |
|
3060 |
||
3061 |
/*! |
|
3062 |
\obsolete |
|
3063 |
||
3064 |
Adds a rectangle \a r with rounded corners to the path. |
|
3065 |
||
3066 |
The \a xRnd and \a yRnd arguments specify how rounded the corners |
|
3067 |
should be. 0 is angled corners, 99 is maximum roundedness. |
|
3068 |
||
3069 |
\sa addRoundedRect() |
|
3070 |
*/ |
|
3071 |
void QPainterPath::addRoundRect(const QRectF &r, int xRnd, int yRnd) |
|
3072 |
{ |
|
3073 |
if(xRnd >= 100) // fix ranges |
|
3074 |
xRnd = 99; |
|
3075 |
if(yRnd >= 100) |
|
3076 |
yRnd = 99; |
|
3077 |
if(xRnd <= 0 || yRnd <= 0) { // add normal rectangle |
|
3078 |
addRect(r); |
|
3079 |
return; |
|
3080 |
} |
|
3081 |
||
3082 |
QRectF rect = r.normalized(); |
|
3083 |
||
3084 |
if (rect.isNull()) |
|
3085 |
return; |
|
3086 |
||
3087 |
qreal x = rect.x(); |
|
3088 |
qreal y = rect.y(); |
|
3089 |
qreal w = rect.width(); |
|
3090 |
qreal h = rect.height(); |
|
3091 |
qreal rxx2 = w*xRnd/100; |
|
3092 |
qreal ryy2 = h*yRnd/100; |
|
3093 |
||
3094 |
ensureData(); |
|
3095 |
detach(); |
|
3096 |
||
3
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3097 |
bool first = d_func()->elements.size() < 2; |
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3098 |
|
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3099 |
arcMoveTo(x, y, rxx2, ryy2, 180); |
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3100 |
arcTo(x, y, rxx2, ryy2, 180, -90); |
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3101 |
arcTo(x+w-rxx2, y, rxx2, ryy2, 90, -90); |
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3102 |
arcTo(x+w-rxx2, y+h-ryy2, rxx2, ryy2, 0, -90); |
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3103 |
arcTo(x, y+h-ryy2, rxx2, ryy2, 270, -90); |
0 | 3104 |
closeSubpath(); |
3105 |
||
3106 |
d_func()->require_moveTo = true; |
|
3
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3107 |
d_func()->convex = first; |
0 | 3108 |
} |
3109 |
||
3110 |
/*! |
|
3111 |
\obsolete |
|
3112 |
||
3113 |
\fn bool QPainterPath::addRoundRect(const QRectF &rect, int roundness); |
|
3114 |
\since 4.3 |
|
3115 |
\overload |
|
3116 |
||
3117 |
Adds a rounded rectangle, \a rect, to the path. |
|
3118 |
||
3119 |
The \a roundness argument specifies uniform roundness for the |
|
3120 |
rectangle. Vertical and horizontal roundness factors will be |
|
3121 |
adjusted accordingly to act uniformly around both axes. Use this |
|
3122 |
method if you want a rectangle equally rounded across both the X and |
|
3123 |
Y axis. |
|
3124 |
||
3125 |
\sa addRoundedRect() |
|
3126 |
*/ |
|
3127 |
||
3128 |
/*! |
|
3129 |
\obsolete |
|
3130 |
||
3131 |
\fn void QPainterPath::addRoundRect(qreal x, qreal y, qreal w, qreal h, int xRnd, int yRnd); |
|
3132 |
\overload |
|
3133 |
||
3134 |
Adds a rectangle with rounded corners to the path. The rectangle |
|
3135 |
is constructed from \a x, \a y, and the width and height \a w |
|
3136 |
and \a h. |
|
3137 |
||
3138 |
The \a xRnd and \a yRnd arguments specify how rounded the corners |
|
3139 |
should be. 0 is angled corners, 99 is maximum roundedness. |
|
3140 |
||
3141 |
\sa addRoundedRect() |
|
3142 |
*/ |
|
3143 |
||
3144 |
/*! |
|
3145 |
\obsolete |
|
3146 |
||
3147 |
\fn bool QPainterPath::addRoundRect(qreal x, qreal y, qreal width, qreal height, int roundness); |
|
3148 |
\since 4.3 |
|
3149 |
\overload |
|
3150 |
||
3151 |
Adds a rounded rectangle to the path, defined by the coordinates \a |
|
3152 |
x and \a y with the specified \a width and \a height. |
|
3153 |
||
3154 |
The \a roundness argument specifies uniform roundness for the |
|
3155 |
rectangle. Vertical and horizontal roundness factors will be |
|
3156 |
adjusted accordingly to act uniformly around both axes. Use this |
|
3157 |
method if you want a rectangle equally rounded across both the X and |
|
3158 |
Y axis. |
|
3159 |
||
3160 |
\sa addRoundedRect() |
|
3161 |
*/ |
|
3162 |
||
3163 |
/*! |
|
3164 |
\since 4.3 |
|
3165 |
||
3166 |
Returns a path which is the union of this path's fill area and \a p's fill area. |
|
3167 |
||
3168 |
Set operations on paths will treat the paths as areas. Non-closed |
|
3169 |
paths will be treated as implicitly closed. |
|
30
5dc02b23752f
Revision: 201025
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
18
diff
changeset
|
3170 |
Bezier curves may be flattened to line segments due to numerical instability of |
5dc02b23752f
Revision: 201025
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
18
diff
changeset
|
3171 |
doing bezier curve intersections. |
0 | 3172 |
|
3173 |
\sa intersected(), subtracted() |
|
3174 |
*/ |
|
3175 |
QPainterPath QPainterPath::united(const QPainterPath &p) const |
|
3176 |
{ |
|
3177 |
if (isEmpty() || p.isEmpty()) |
|
3178 |
return isEmpty() ? p : *this; |
|
3179 |
QPathClipper clipper(*this, p); |
|
3180 |
return clipper.clip(QPathClipper::BoolOr); |
|
3181 |
} |
|
3182 |
||
3183 |
/*! |
|
3184 |
\since 4.3 |
|
3185 |
||
3186 |
Returns a path which is the intersection of this path's fill area and \a p's fill area. |
|
30
5dc02b23752f
Revision: 201025
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
18
diff
changeset
|
3187 |
Bezier curves may be flattened to line segments due to numerical instability of |
5dc02b23752f
Revision: 201025
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
18
diff
changeset
|
3188 |
doing bezier curve intersections. |
0 | 3189 |
*/ |
3190 |
QPainterPath QPainterPath::intersected(const QPainterPath &p) const |
|
3191 |
{ |
|
3192 |
if (isEmpty() || p.isEmpty()) |
|
3193 |
return QPainterPath(); |
|
3194 |
QPathClipper clipper(*this, p); |
|
3195 |
return clipper.clip(QPathClipper::BoolAnd); |
|
3196 |
} |
|
3197 |
||
3198 |
/*! |
|
3199 |
\since 4.3 |
|
3200 |
||
3201 |
Returns a path which is \a p's fill area subtracted from this path's fill area. |
|
3202 |
||
3203 |
Set operations on paths will treat the paths as areas. Non-closed |
|
3204 |
paths will be treated as implicitly closed. |
|
30
5dc02b23752f
Revision: 201025
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
18
diff
changeset
|
3205 |
Bezier curves may be flattened to line segments due to numerical instability of |
5dc02b23752f
Revision: 201025
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
18
diff
changeset
|
3206 |
doing bezier curve intersections. |
0 | 3207 |
*/ |
3208 |
QPainterPath QPainterPath::subtracted(const QPainterPath &p) const |
|
3209 |
{ |
|
3210 |
if (isEmpty() || p.isEmpty()) |
|
3211 |
return *this; |
|
3212 |
QPathClipper clipper(*this, p); |
|
3213 |
return clipper.clip(QPathClipper::BoolSub); |
|
3214 |
} |
|
3215 |
||
3216 |
/*! |
|
3217 |
\since 4.3 |
|
3218 |
\obsolete |
|
3219 |
||
3220 |
Use subtracted() instead. |
|
3221 |
||
3222 |
\sa subtracted() |
|
3223 |
*/ |
|
3224 |
QPainterPath QPainterPath::subtractedInverted(const QPainterPath &p) const |
|
3225 |
{ |
|
3226 |
return p.subtracted(*this); |
|
3227 |
} |
|
3228 |
||
3229 |
/*! |
|
3230 |
\since 4.4 |
|
3231 |
||
3232 |
Returns a simplified version of this path. This implies merging all subpaths that intersect, |
|
3233 |
and returning a path containing no intersecting edges. Consecutive parallel lines will also |
|
3234 |
be merged. The simplified path will always use the default fill rule, Qt::OddEvenFill. |
|
30
5dc02b23752f
Revision: 201025
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
18
diff
changeset
|
3235 |
Bezier curves may be flattened to line segments due to numerical instability of |
5dc02b23752f
Revision: 201025
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
18
diff
changeset
|
3236 |
doing bezier curve intersections. |
0 | 3237 |
*/ |
3238 |
QPainterPath QPainterPath::simplified() const |
|
3239 |
{ |
|
3240 |
if(isEmpty()) |
|
3241 |
return *this; |
|
3242 |
QPathClipper clipper(*this, QPainterPath()); |
|
3243 |
return clipper.clip(QPathClipper::Simplify); |
|
3244 |
} |
|
3245 |
||
3246 |
/*! |
|
3247 |
\since 4.3 |
|
3248 |
||
3249 |
Returns true if the current path intersects at any point the given path \a p. |
|
3250 |
Also returns true if the current path contains or is contained by any part of \a p. |
|
3251 |
||
3252 |
Set operations on paths will treat the paths as areas. Non-closed |
|
3253 |
paths will be treated as implicitly closed. |
|
3254 |
||
3255 |
\sa contains() |
|
3256 |
*/ |
|
3257 |
bool QPainterPath::intersects(const QPainterPath &p) const |
|
3258 |
{ |
|
3259 |
if (p.elementCount() == 1) |
|
3260 |
return contains(p.elementAt(0)); |
|
3261 |
if (isEmpty() || p.isEmpty()) |
|
3262 |
return false; |
|
3263 |
QPathClipper clipper(*this, p); |
|
3264 |
return clipper.intersect(); |
|
3265 |
} |
|
3266 |
||
3267 |
/*! |
|
3268 |
\since 4.3 |
|
3269 |
||
3270 |
Returns true if the given path \a p is contained within |
|
3271 |
the current path. Returns false if any edges of the current path and |
|
3272 |
\a p intersect. |
|
3273 |
||
3274 |
Set operations on paths will treat the paths as areas. Non-closed |
|
3275 |
paths will be treated as implicitly closed. |
|
3276 |
||
3277 |
\sa intersects() |
|
3278 |
*/ |
|
3279 |
bool QPainterPath::contains(const QPainterPath &p) const |
|
3280 |
{ |
|
3281 |
if (p.elementCount() == 1) |
|
3282 |
return contains(p.elementAt(0)); |
|
3283 |
if (isEmpty() || p.isEmpty()) |
|
3284 |
return false; |
|
3285 |
QPathClipper clipper(*this, p); |
|
3286 |
return clipper.contains(); |
|
3287 |
} |
|
3288 |
||
3289 |
void QPainterPath::setDirty(bool dirty) |
|
3290 |
{ |
|
3291 |
d_func()->dirtyBounds = dirty; |
|
3292 |
d_func()->dirtyControlBounds = dirty; |
|
3293 |
delete d_func()->pathConverter; |
|
3294 |
d_func()->pathConverter = 0; |
|
3
41300fa6a67c
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3295 |
d_func()->convex = false; |
0 | 3296 |
} |
3297 |
||
3298 |
void QPainterPath::computeBoundingRect() const |
|
3299 |
{ |
|
3300 |
QPainterPathData *d = d_func(); |
|
3301 |
d->dirtyBounds = false; |
|
3302 |
if (!d_ptr) { |
|
3303 |
d->bounds = QRect(); |
|
3304 |
return; |
|
3305 |
} |
|
3306 |
||
3307 |
qreal minx, maxx, miny, maxy; |
|
3308 |
minx = maxx = d->elements.at(0).x; |
|
3309 |
miny = maxy = d->elements.at(0).y; |
|
3310 |
for (int i=1; i<d->elements.size(); ++i) { |
|
3311 |
const Element &e = d->elements.at(i); |
|
3312 |
||
3313 |
switch (e.type) { |
|
3314 |
case MoveToElement: |
|
3315 |
case LineToElement: |
|
3316 |
if (e.x > maxx) maxx = e.x; |
|
3317 |
else if (e.x < minx) minx = e.x; |
|
3318 |
if (e.y > maxy) maxy = e.y; |
|
3319 |
else if (e.y < miny) miny = e.y; |
|
3320 |
break; |
|
3321 |
case CurveToElement: |
|
3322 |
{ |
|
3323 |
QBezier b = QBezier::fromPoints(d->elements.at(i-1), |
|
3324 |
e, |
|
3325 |
d->elements.at(i+1), |
|
3326 |
d->elements.at(i+2)); |
|
3327 |
QRectF r = qt_painterpath_bezier_extrema(b); |
|
3328 |
qreal right = r.right(); |
|
3329 |
qreal bottom = r.bottom(); |
|
3330 |
if (r.x() < minx) minx = r.x(); |
|
3331 |
if (right > maxx) maxx = right; |
|
3332 |
if (r.y() < miny) miny = r.y(); |
|
3333 |
if (bottom > maxy) maxy = bottom; |
|
3334 |
i += 2; |
|
3335 |
} |
|
3336 |
break; |
|
3337 |
default: |
|
3338 |
break; |
|
3339 |
} |
|
3340 |
} |
|
3341 |
d->bounds = QRectF(minx, miny, maxx - minx, maxy - miny); |
|
3342 |
} |
|
3343 |
||
3344 |
||
3345 |
void QPainterPath::computeControlPointRect() const |
|
3346 |
{ |
|
3347 |
QPainterPathData *d = d_func(); |
|
3348 |
d->dirtyControlBounds = false; |
|
3349 |
if (!d_ptr) { |
|
3350 |
d->controlBounds = QRect(); |
|
3351 |
return; |
|
3352 |
} |
|
3353 |
||
3354 |
qreal minx, maxx, miny, maxy; |
|
3355 |
minx = maxx = d->elements.at(0).x; |
|
3356 |
miny = maxy = d->elements.at(0).y; |
|
3357 |
for (int i=1; i<d->elements.size(); ++i) { |
|
3358 |
const Element &e = d->elements.at(i); |
|
3359 |
if (e.x > maxx) maxx = e.x; |
|
3360 |
else if (e.x < minx) minx = e.x; |
|
3361 |
if (e.y > maxy) maxy = e.y; |
|
3362 |
else if (e.y < miny) miny = e.y; |
|
3363 |
} |
|
3364 |
d->controlBounds = QRectF(minx, miny, maxx - minx, maxy - miny); |
|
3365 |
} |
|
3366 |
||
3367 |
#ifndef QT_NO_DEBUG_STREAM |
|
3368 |
QDebug operator<<(QDebug s, const QPainterPath &p) |
|
3369 |
{ |
|
3370 |
s.nospace() << "QPainterPath: Element count=" << p.elementCount() << endl; |
|
3371 |
const char *types[] = {"MoveTo", "LineTo", "CurveTo", "CurveToData"}; |
|
3372 |
for (int i=0; i<p.elementCount(); ++i) { |
|
3373 |
s.nospace() << " -> " << types[p.elementAt(i).type] << "(x=" << p.elementAt(i).x << ", y=" << p.elementAt(i).y << ')' << endl; |
|
3374 |
||
3375 |
} |
|
3376 |
return s; |
|
3377 |
} |
|
3378 |
#endif |
|
3379 |
||
3380 |
QT_END_NAMESPACE |