1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#include "sal/config.h"
#include "sal/precppunit.hxx"
// autogenerated file with codegen.pl
#include "cppunit/TestAssert.h"
#include "cppunit/TestFixture.h"
#include "cppunit/extensions/HelperMacros.h"
#include <basegfx/matrix/b2dhommatrix.hxx>
#include <basegfx/curve/b2dcubicbezier.hxx>
#include <basegfx/curve/b2dbeziertools.hxx>
#include <basegfx/range/b2dpolyrange.hxx>
#include <basegfx/polygon/b2dpolygon.hxx>
#include <basegfx/polygon/b2dpolygontools.hxx>
#include <basegfx/polygon/b2dpolypolygontools.hxx>
#include <basegfx/polygon/b2dpolypolygoncutter.hxx>
#include <basegfx/polygon/b2dpolygonclipper.hxx>
#include <basegfx/polygon/b2dpolypolygon.hxx>
#include <basegfx/numeric/ftools.hxx>
using namespace ::basegfx;
namespace basegfx2d
{
class genericclipper : public CppUnit::TestFixture
{
private:
B2DPolygon aSelfIntersecting;
B2DPolygon aShiftedRectangle;
public:
// initialise your test code values here.
void setUp()
{
aSelfIntersecting.append(B2DPoint(0, 0));
aSelfIntersecting.append(B2DPoint(0, 100));
aSelfIntersecting.append(B2DPoint(75, 100));
aSelfIntersecting.append(B2DPoint(75, 50));
aSelfIntersecting.append(B2DPoint(25, 50));
aSelfIntersecting.append(B2DPoint(25, 150));
aSelfIntersecting.append(B2DPoint(100,150));
aSelfIntersecting.append(B2DPoint(100,0));
aSelfIntersecting.setClosed(true);
aShiftedRectangle = tools::createPolygonFromRect(
B2DRange(0,90,20,150));
}
void tearDown()
{}
void validate(const char* pName,
const char* pValidSvgD,
B2DPolyPolygon (*pFunc)(const B2DPolyPolygon&, const B2DPolyPolygon&))
{
const B2DPolyPolygon aSelfIntersect(
tools::prepareForPolygonOperation(aSelfIntersecting));
const B2DPolyPolygon aRect(
tools::prepareForPolygonOperation(aShiftedRectangle));
#if OSL_DEBUG_LEVEL > 2
fprintf(stderr, "%s input LHS - svg:d=\"%s\"\n",
pName, rtl::OUStringToOString(
basegfx::tools::exportToSvgD(
aSelfIntersect),
RTL_TEXTENCODING_UTF8).getStr() );
fprintf(stderr, "%s input RHS - svg:d=\"%s\"\n",
pName, rtl::OUStringToOString(
basegfx::tools::exportToSvgD(
aRect),
RTL_TEXTENCODING_UTF8).getStr() );
#endif
const B2DPolyPolygon aRes=
pFunc(aSelfIntersect, aRect);
#if OSL_DEBUG_LEVEL > 2
fprintf(stderr, "%s - svg:d=\"%s\"\n",
pName, rtl::OUStringToOString(
basegfx::tools::exportToSvgD(aRes),
RTL_TEXTENCODING_UTF8).getStr() );
#endif
rtl::OUString aValid=rtl::OUString::createFromAscii(pValidSvgD);
CPPUNIT_ASSERT_MESSAGE(pName,
basegfx::tools::exportToSvgD(aRes) == aValid);
}
void validateOr()
{
const char* pValid="m0 0h100v150h-75v-50h-5v50h-20v-50-10zm75 100v-50h-50v50z";
validate("validateOr", pValid, &tools::solvePolygonOperationOr);
}
void validateXor()
{
const char* pValid="m0 0h100v150h-75v-50h-5v50h-20v-50-10zm0 100h20v-10h-20zm75 0v-50h-50v50z";
validate("validateXor", pValid, &tools::solvePolygonOperationXor);
}
void validateAnd()
{
const char* pValid="m0 100v-10h20v10z";
validate("validateAnd", pValid, &tools::solvePolygonOperationAnd);
}
void validateDiff()
{
const char* pValid="m0 90v-90h100v150h-75v-50h-5v-10zm75 10v-50h-50v50z";
validate("validateDiff", pValid, &tools::solvePolygonOperationDiff);
}
void validateCrossover(const char* pName,
const char* pInputSvgD,
const char* pValidSvgD)
{
rtl::OUString aInput=rtl::OUString::createFromAscii(pInputSvgD);
rtl::OUString aValid=rtl::OUString::createFromAscii(pValidSvgD);
B2DPolyPolygon aInputPoly, aValidPoly;
tools::importFromSvgD(aInputPoly, aInput);
tools::importFromSvgD(aValidPoly, aValid);
CPPUNIT_ASSERT_MESSAGE(
pName,
basegfx::tools::exportToSvgD(
tools::solveCrossovers(aInputPoly)) == aValid);
}
void checkCrossoverSolver()
{
// partially intersecting polygons, with a common subsection
validateCrossover(
"partially intersecting",
"m0 0 v 5 h 3 h 1 h 1 h 1 v -2 v -3 z"
"m3 7 v -2 h 1 h 1 h 1 v -2 h 1 v 3 z",
"m0 0v5h3 1 1 1v-2-3zm3 7v-2h1 1 1v-2h1v3z");
// first polygon is identical to subset of second polygon
validateCrossover(
"full subset",
"m0 0 v 5 h 3 h 1 h 1 v -5 z"
"m3 10 v -5 h 1 h 1 v -5 h -5 v 5 h 3 z",
"m0 0v5h3 1 1v-5zm3 10v-5zm1-5h1v-5h-5v5h3z");
// first polygon is identical to subset of second polygon, but
// oriented in the opposite direction
validateCrossover(
"full subset, opposite direction",
"m0 0 v 5 h 3 h 1 h 1 v -5 z"
"m3 10 v -5 h -1 h -1 h -1 v -5 h 5 v 5 h 2 z",
"m0 0v5h1 1 1-1-1-1v-5h5v5-5zm4 5h1 2l-4 5v-5z");
// first polygon is identical to subset of second polygon, and
// has a curve segment (triggers different code path)
validateCrossover(
"full subset, plus curves",
"m0 0 v 5 h 3 h 1 h 1 c 2 0 2 0 0 -5 z"
"m3 10 v -5 h 1 h 1 c 2 0 2 0 0 -5 h -5 v 5 h 3 z",
"m0 0v5h3 1 1c2 0 2 0 0-5zm3 10v-5zm1-5h1c2 0 2 0 0-5h-5v5h3z");
}
// Change the following lines only, if you add, remove or rename
// member functions of the current class,
// because these macros are need by auto register mechanism.
CPPUNIT_TEST_SUITE(genericclipper);
CPPUNIT_TEST(validateOr);
CPPUNIT_TEST(validateXor);
CPPUNIT_TEST(validateAnd);
CPPUNIT_TEST(validateDiff);
CPPUNIT_TEST(checkCrossoverSolver);
CPPUNIT_TEST_SUITE_END();
};
// -----------------------------------------------------------------------------
CPPUNIT_TEST_SUITE_REGISTRATION(basegfx2d::genericclipper);
} // namespace basegfx2d
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
