1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <basegfx/utils/b2dclipstate.hxx>
#include <basegfx/range/b2drange.hxx>
#include <basegfx/range/b2dpolyrange.hxx>
#include <basegfx/range/b2drangeclipper.hxx>
#include <basegfx/polygon/b2dpolygon.hxx>
#include <basegfx/polygon/b2dpolygontools.hxx>
#include <basegfx/polygon/b2dpolypolygon.hxx>
#include <basegfx/polygon/b2dpolypolygontools.hxx>
#include <basegfx/polygon/b2dpolypolygoncutter.hxx>
namespace basegfx
{
namespace utils
{
class ImplB2DClipState
{
public:
enum Operation {UNION, INTERSECT, XOR, SUBTRACT};
ImplB2DClipState() :
maPendingPolygons(),
maPendingRanges(),
maClipPoly(),
mePendingOps(UNION)
{}
explicit ImplB2DClipState( const B2DPolyPolygon& rPoly ) :
maPendingPolygons(),
maPendingRanges(),
maClipPoly(rPoly),
mePendingOps(UNION)
{}
bool isCleared() const
{
return !maClipPoly.count()
&& !maPendingPolygons.count()
&& !maPendingRanges.count();
}
bool isNullClipPoly() const
{
return maClipPoly.count() == 1
&& !maClipPoly.getB2DPolygon(0).count();
}
bool isNull() const
{
return !maPendingPolygons.count()
&& !maPendingRanges.count()
&& isNullClipPoly();
}
void makeNull()
{
maPendingPolygons.clear();
maPendingRanges.clear();
maClipPoly.clear();
maClipPoly.append(B2DPolygon());
mePendingOps = UNION;
}
bool operator==(const ImplB2DClipState& rRHS) const
{
return maPendingPolygons == rRHS.maPendingPolygons
&& maPendingRanges == rRHS.maPendingRanges
&& maClipPoly == rRHS.maClipPoly
&& mePendingOps == rRHS.mePendingOps;
}
void addRange(const B2DRange& rRange, Operation eOp)
{
if( rRange.isEmpty() )
return;
commitPendingPolygons();
if( mePendingOps != eOp )
commitPendingRanges();
mePendingOps = eOp;
maPendingRanges.appendElement(
rRange,
B2VectorOrientation::Positive);
}
void addPolyPolygon(const B2DPolyPolygon& aPoly, Operation eOp)
{
commitPendingRanges();
if( mePendingOps != eOp )
commitPendingPolygons();
mePendingOps = eOp;
maPendingPolygons.append(aPoly);
}
void unionRange(const B2DRange& rRange)
{
if( isCleared() )
return;
addRange(rRange,UNION);
}
void unionPolyPolygon(const B2DPolyPolygon& rPolyPoly)
{
if( isCleared() )
return;
addPolyPolygon(rPolyPoly,UNION);
}
void intersectRange(const B2DRange& rRange)
{
if( isNull() )
return;
addRange(rRange,INTERSECT);
}
void intersectPolyPolygon(const B2DPolyPolygon& rPolyPoly)
{
if( isNull() )
return;
addPolyPolygon(rPolyPoly,INTERSECT);
}
void subtractRange(const B2DRange& rRange )
{
if( isNull() )
return;
addRange(rRange,SUBTRACT);
}
void subtractPolyPolygon(const B2DPolyPolygon& rPolyPoly)
{
if( isNull() )
return;
addPolyPolygon(rPolyPoly,SUBTRACT);
}
void xorRange(const B2DRange& rRange)
{
addRange(rRange,XOR);
}
void xorPolyPolygon(const B2DPolyPolygon& rPolyPoly)
{
addPolyPolygon(rPolyPoly,XOR);
}
void transform(const basegfx::B2DHomMatrix& rTranslate)
{
maPendingRanges.transform(rTranslate);
maPendingPolygons.transform(rTranslate);
maClipPoly.transform(rTranslate);
}
B2DPolyPolygon const & getClipPoly() const
{
commitPendingRanges();
commitPendingPolygons();
return maClipPoly;
}
private:
void commitPendingPolygons() const
{
if( !maPendingPolygons.count() )
return;
// assumption: maClipPoly has kept polygons prepared for
// clipping; i.e. no neutral polygons & correct
// orientation
maPendingPolygons = utils::prepareForPolygonOperation(maPendingPolygons);
const bool bIsEmpty=isNullClipPoly();
const bool bIsCleared=!maClipPoly.count();
switch(mePendingOps)
{
case UNION:
assert( !bIsCleared );
if( bIsEmpty )
maClipPoly = maPendingPolygons;
else
maClipPoly = utils::solvePolygonOperationOr(
maClipPoly,
maPendingPolygons);
break;
case INTERSECT:
assert( !bIsEmpty );
if( bIsCleared )
maClipPoly = maPendingPolygons;
else
maClipPoly = utils::solvePolygonOperationAnd(
maClipPoly,
maPendingPolygons);
break;
case XOR:
if( bIsEmpty )
maClipPoly = maPendingPolygons;
else if( bIsCleared )
{
// not representable, strictly speaking,
// using polygons with the common even/odd
// or nonzero winding number fill rule. If
// we'd want to represent it, fill rule
// would need to be "non-negative winding
// number" (and we then would return
// 'holes' here)
// going for an ugly hack meanwhile
maClipPoly = utils::solvePolygonOperationXor(
B2DPolyPolygon(
utils::createPolygonFromRect(B2DRange(-1E20,-1E20,1E20,1E20))),
maPendingPolygons);
}
else
maClipPoly = utils::solvePolygonOperationXor(
maClipPoly,
maPendingPolygons);
break;
case SUBTRACT:
assert( !bIsEmpty );
// first union all pending ones, subtract en bloc then
maPendingPolygons = solveCrossovers(maPendingPolygons);
maPendingPolygons = stripNeutralPolygons(maPendingPolygons);
maPendingPolygons = stripDispensablePolygons(maPendingPolygons);
if( bIsCleared )
{
// not representable, strictly speaking,
// using polygons with the common even/odd
// or nonzero winding number fill rule. If
// we'd want to represent it, fill rule
// would need to be "non-negative winding
// number" (and we then would return
// 'holes' here)
// going for an ugly hack meanwhile
maClipPoly = utils::solvePolygonOperationDiff(
B2DPolyPolygon(
utils::createPolygonFromRect(B2DRange(-1E20,-1E20,1E20,1E20))),
maPendingPolygons);
}
else
maClipPoly = utils::solvePolygonOperationDiff(
maClipPoly,
maPendingPolygons);
break;
}
maPendingPolygons.clear();
mePendingOps = UNION;
}
void commitPendingRanges() const
{
if( !maPendingRanges.count() )
return;
// use the specialized range clipper for the win
B2DPolyPolygon aCollectedRanges;
const bool bIsEmpty=isNullClipPoly();
const bool bIsCleared=!maClipPoly.count();
switch(mePendingOps)
{
case UNION:
assert( !bIsCleared );
aCollectedRanges = maPendingRanges.solveCrossovers();
aCollectedRanges = stripNeutralPolygons(aCollectedRanges);
aCollectedRanges = stripDispensablePolygons(aCollectedRanges);
if( bIsEmpty )
maClipPoly = aCollectedRanges;
else
maClipPoly = utils::solvePolygonOperationOr(
maClipPoly,
aCollectedRanges);
break;
case INTERSECT:
assert( !bIsEmpty );
aCollectedRanges = maPendingRanges.solveCrossovers();
aCollectedRanges = stripNeutralPolygons(aCollectedRanges);
if( maPendingRanges.count() > 1 )
aCollectedRanges = stripDispensablePolygons(aCollectedRanges, true);
if( bIsCleared )
maClipPoly = aCollectedRanges;
else
maClipPoly = utils::solvePolygonOperationAnd(
maClipPoly,
aCollectedRanges);
break;
case XOR:
aCollectedRanges = maPendingRanges.solveCrossovers();
aCollectedRanges = stripNeutralPolygons(aCollectedRanges);
aCollectedRanges = correctOrientations(aCollectedRanges);
if( bIsEmpty )
maClipPoly = aCollectedRanges;
else if( bIsCleared )
{
// not representable, strictly speaking,
// using polygons with the common even/odd
// or nonzero winding number fill rule. If
// we'd want to represent it, fill rule
// would need to be "non-negative winding
// number" (and we then would return
// 'holes' here)
// going for an ugly hack meanwhile
maClipPoly = utils::solvePolygonOperationXor(
B2DPolyPolygon(
utils::createPolygonFromRect(B2DRange(-1E20,-1E20,1E20,1E20))),
aCollectedRanges);
}
else
maClipPoly = utils::solvePolygonOperationXor(
maClipPoly,
aCollectedRanges);
break;
case SUBTRACT:
assert( !bIsEmpty );
// first union all pending ranges, subtract en bloc then
aCollectedRanges = maPendingRanges.solveCrossovers();
aCollectedRanges = stripNeutralPolygons(aCollectedRanges);
aCollectedRanges = stripDispensablePolygons(aCollectedRanges);
if( bIsCleared )
{
// not representable, strictly speaking,
// using polygons with the common even/odd
// or nonzero winding number fill rule. If
// we'd want to represent it, fill rule
// would need to be "non-negative winding
// number" (and we then would return
// 'holes' here)
// going for an ugly hack meanwhile
maClipPoly = utils::solvePolygonOperationDiff(
B2DPolyPolygon(
utils::createPolygonFromRect(B2DRange(-1E20,-1E20,1E20,1E20))),
aCollectedRanges);
}
else
maClipPoly = utils::solvePolygonOperationDiff(
maClipPoly,
aCollectedRanges);
break;
}
maPendingRanges.clear();
mePendingOps = UNION;
}
mutable B2DPolyPolygon maPendingPolygons;
mutable B2DPolyRange maPendingRanges;
mutable B2DPolyPolygon maClipPoly;
mutable Operation mePendingOps;
};
B2DClipState::B2DClipState() :
mpImpl()
{}
B2DClipState::~B2DClipState()
{}
B2DClipState::B2DClipState( const B2DClipState& rOrig ) :
mpImpl(rOrig.mpImpl)
{}
B2DClipState::B2DClipState( B2DClipState&& rOrig ) :
mpImpl(std::move(rOrig.mpImpl))
{}
B2DClipState::B2DClipState( const B2DPolyPolygon& rPolyPoly ) :
mpImpl( ImplB2DClipState(rPolyPoly) )
{}
B2DClipState& B2DClipState::operator=( const B2DClipState& rRHS )
{
mpImpl = rRHS.mpImpl;
return *this;
}
B2DClipState& B2DClipState::operator=( B2DClipState&& rRHS )
{
mpImpl = std::move(rRHS.mpImpl);
return *this;
}
void B2DClipState::makeNull()
{
mpImpl->makeNull();
}
bool B2DClipState::isCleared() const
{
return mpImpl->isCleared();
}
bool B2DClipState::operator==(const B2DClipState& rRHS) const
{
if(mpImpl.same_object(rRHS.mpImpl))
return true;
return ((*mpImpl) == (*rRHS.mpImpl));
}
bool B2DClipState::operator!=(const B2DClipState& rRHS) const
{
return !(*this == rRHS);
}
void B2DClipState::unionRange(const B2DRange& rRange)
{
mpImpl->unionRange(rRange);
}
void B2DClipState::unionPolyPolygon(const B2DPolyPolygon& rPolyPoly)
{
mpImpl->unionPolyPolygon(rPolyPoly);
}
void B2DClipState::intersectRange(const B2DRange& rRange)
{
mpImpl->intersectRange(rRange);
}
void B2DClipState::intersectPolyPolygon(const B2DPolyPolygon& rPolyPoly)
{
mpImpl->intersectPolyPolygon(rPolyPoly);
}
void B2DClipState::subtractRange(const B2DRange& rRange)
{
mpImpl->subtractRange(rRange);
}
void B2DClipState::subtractPolyPolygon(const B2DPolyPolygon& rPolyPoly)
{
mpImpl->subtractPolyPolygon(rPolyPoly);
}
void B2DClipState::xorRange(const B2DRange& rRange)
{
mpImpl->xorRange(rRange);
}
void B2DClipState::xorPolyPolygon(const B2DPolyPolygon& rPolyPoly)
{
mpImpl->xorPolyPolygon(rPolyPoly);
}
B2DPolyPolygon const & B2DClipState::getClipPoly() const
{
return mpImpl->getClipPoly();
}
void B2DClipState::transform(const basegfx::B2DHomMatrix& rTranslate)
{
return mpImpl->transform(rTranslate);
}
} // end of namespace utils
} // end of namespace basegfx
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|