1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the test suite of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the either Technology Preview License Agreement or the
** Beta Release License Agreement.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain
** additional rights. These rights are described in the Nokia Qt LGPL
** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this
** package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
** If you are unsure which license is appropriate for your use, please
** contact the sales department at http://qt.nokia.com/contact.
** $QT_END_LICENSE$
**
****************************************************************************/
#include "testtessellator.h"
#include <private/qtessellator_p.h>
#include "math.h"
class TestTessellator : public QTessellator
{
public:
QVector<XTrapezoid> *traps;
void addTrap(const Trapezoid &trap);
};
void TestTessellator::addTrap(const Trapezoid &trap)
{
XTrapezoid xtrap;
xtrap.top = Q27Dot5ToXFixed(trap.top);
xtrap.bottom = Q27Dot5ToXFixed(trap.bottom);
xtrap.left.p1.x = Q27Dot5ToXFixed(trap.topLeft->x);
xtrap.left.p1.y = Q27Dot5ToXFixed(trap.topLeft->y);
xtrap.left.p2.x = Q27Dot5ToXFixed(trap.bottomLeft->x);
xtrap.left.p2.y = Q27Dot5ToXFixed(trap.bottomLeft->y);
xtrap.right.p1.x = Q27Dot5ToXFixed(trap.topRight->x);
xtrap.right.p1.y = Q27Dot5ToXFixed(trap.topRight->y);
xtrap.right.p2.x = Q27Dot5ToXFixed(trap.bottomRight->x);
xtrap.right.p2.y = Q27Dot5ToXFixed(trap.bottomRight->y);
traps->append(xtrap);
}
void test_tesselate_polygon(QVector<XTrapezoid> *traps, const QPointF *points, int nPoints,
bool winding)
{
TestTessellator t;
t.traps = traps;
t.setWinding(winding);
t.tessellate(points, nPoints);
}
void test_tessellate_polygon_convex(QVector<XTrapezoid> *traps, const QPointF *points, int nPoints,
bool winding)
{
TestTessellator t;
t.traps = traps;
t.setWinding(winding);
t.tessellateConvex(points, nPoints);
}
void test_tessellate_polygon_rect(QVector<XTrapezoid> *traps, const QPointF *points, int nPoints,
bool winding)
{
// 5 points per rect
Q_ASSERT(nPoints % 5 == 0);
TestTessellator t;
t.traps = traps;
t.setWinding(winding);
for (int i = 0; i < nPoints / 5; ++i) {
QPointF rectA = points[5*i];
QPointF rectB = points[5*i+1];
QPointF rectC = points[5*i+2];
QPointF rectD = points[5*i+3];
QPointF a = (rectA + rectD) * 0.5;
QPointF b = (rectB + rectC) * 0.5;
QPointF delta = rectA - rectD;
qreal width = sqrt(delta.x() * delta.x() + delta.y() * delta.y());
t.tessellateRect(a, b, width);
}
}
|
