1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
|
/****************************************************************************
**
** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the test suite of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL21$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 or version 3 as published by the Free
** Software Foundation and appearing in the file LICENSE.LGPLv21 and
** LICENSE.LGPLv3 included in the packaging of this file. Please review the
** following information to ensure the GNU Lesser General Public License
** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights. These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef PATHCOMPARE_H
#define PATHCOMPARE_H
#include <qmath.h>
namespace QPathCompare {
static const int precision = 8;
static const qreal epsilon = qPow(0.1, precision);
static inline bool fuzzyIsZero(qreal x, qreal relative)
{
if (qAbs(relative) < epsilon)
return qAbs(x) < epsilon;
else
return qAbs(x / relative) < epsilon;
}
static bool fuzzyCompare(const QPointF &a, const QPointF &b)
{
const QPointF delta = a - b;
const qreal x = qMax(qAbs(a.x()), qAbs(b.x()));
const qreal y = qMax(qAbs(a.y()), qAbs(b.y()));
return fuzzyIsZero(delta.x(), x) && fuzzyIsZero(delta.y(), y);
}
static bool isClosed(const QPainterPath &path)
{
if (path.elementCount() == 0)
return false;
QPointF first = path.elementAt(0);
QPointF last = path.elementAt(path.elementCount() - 1);
return fuzzyCompare(first, last);
}
// rotation and direction independent path comparison
// allows paths to be shifted or reversed relative to each other
static bool comparePaths(const QPainterPath &actual, const QPainterPath &expected)
{
const int endActual = isClosed(actual) ? actual.elementCount() - 1 : actual.elementCount();
const int endExpected = isClosed(expected) ? expected.elementCount() - 1 : expected.elementCount();
if (endActual != endExpected)
return false;
for (int i = 0; i < endActual; ++i) {
int k = 0;
for (k = 0; k < endActual; ++k) {
int i1 = k;
int i2 = (i + k) % endActual;
QPointF a = actual.elementAt(i1);
QPointF b = expected.elementAt(i2);
if (!fuzzyCompare(a, b))
break;
}
if (k == endActual)
return true;
for (k = 0; k < endActual; ++k) {
int i1 = k;
int i2 = (i + endActual - k) % endActual;
QPointF a = actual.elementAt(i1);
QPointF b = expected.elementAt(i2);
if (!fuzzyCompare(a, b))
break;
}
if (k == endActual)
return true;
}
return false;
}
}
#endif
|
