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
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
|
/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: b2dsvgpolypolygon.cxx,v $
*
* $Revision: 1.3 $
*
* last change: $Author: rt $ $Date: 2005-09-07 20:47:54 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library 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 for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
************************************************************************/
#include <basegfx/polygon/b2dpolypolygontools.hxx>
#include <basegfx/polygon/b2dpolypolygon.hxx>
#ifndef _RTL_USTRING_
#include <rtl/ustring.hxx>
#endif
#ifndef INCLUDED_RTL_MATH_HXX
#include <rtl/math.hxx>
#endif
namespace basegfx
{
namespace tools
{
namespace
{
void lcl_skipSpaces(sal_Int32& io_rPos,
const ::rtl::OUString& rStr,
const sal_Int32 nLen)
{
while( io_rPos < nLen &&
sal_Unicode(' ') == rStr[io_rPos] )
{
++io_rPos;
}
}
void lcl_skipSpacesAndCommas(sal_Int32& io_rPos,
const ::rtl::OUString& rStr,
const sal_Int32 nLen)
{
while(io_rPos < nLen
&& (sal_Unicode(' ') == rStr[io_rPos] || sal_Unicode(',') == rStr[io_rPos]))
{
++io_rPos;
}
}
bool lcl_isOnNumberChar(const ::rtl::OUString& rStr, const sal_Int32 nPos, bool bSignAllowed = true)
{
const sal_Unicode aChar(rStr[nPos]);
const bool bPredicate( (sal_Unicode('0') <= aChar && sal_Unicode('9') >= aChar)
|| (bSignAllowed && sal_Unicode('+') == aChar)
|| (bSignAllowed && sal_Unicode('-') == aChar) );
return bPredicate;
}
bool lcl_getDoubleChar(double& o_fRetval,
sal_Int32& io_rPos,
const ::rtl::OUString& rStr,
const sal_Int32 nLen)
{
sal_Unicode aChar( rStr[io_rPos] );
::rtl::OUStringBuffer sNumberString;
if(sal_Unicode('+') == aChar || sal_Unicode('-') == aChar)
{
sNumberString.append(rStr[io_rPos]);
aChar = rStr[++io_rPos];
}
while((sal_Unicode('0') <= aChar && sal_Unicode('9') >= aChar)
|| sal_Unicode('.') == aChar)
{
sNumberString.append(rStr[io_rPos]);
aChar = rStr[++io_rPos];
}
if(sal_Unicode('e') == aChar || sal_Unicode('E') == aChar)
{
sNumberString.append(rStr[io_rPos]);
aChar = rStr[++io_rPos];
if(sal_Unicode('+') == aChar || sal_Unicode('-') == aChar)
{
sNumberString.append(rStr[io_rPos]);
aChar = rStr[++io_rPos];
}
while(sal_Unicode('0') <= aChar && sal_Unicode('9') >= aChar)
{
sNumberString.append(rStr[io_rPos]);
aChar = rStr[++io_rPos];
}
}
if(sNumberString.getLength())
{
rtl_math_ConversionStatus eStatus;
o_fRetval = ::rtl::math::stringToDouble( sNumberString.makeStringAndClear(),
(sal_Unicode)('.'),
(sal_Unicode)(','),
&eStatus,
NULL );
return ( eStatus == rtl_math_ConversionStatus_Ok );
}
return false;
}
bool lcl_importDoubleAndSpaces( double& o_fRetval,
sal_Int32& io_rPos,
const ::rtl::OUString& rStr,
const sal_Int32 nLen )
{
if( !lcl_getDoubleChar(o_fRetval, io_rPos, rStr, nLen) )
return false;
lcl_skipSpacesAndCommas(io_rPos, rStr, nLen);
return true;
}
void lcl_skipNumber(sal_Int32& io_rPos,
const ::rtl::OUString& rStr,
const sal_Int32 nLen)
{
bool bSignAllowed(true);
while(io_rPos < nLen && lcl_isOnNumberChar(rStr, io_rPos, bSignAllowed))
{
bSignAllowed = false;
++io_rPos;
}
}
void lcl_skipDouble(sal_Int32& io_rPos,
const ::rtl::OUString& rStr,
const sal_Int32 nLen)
{
sal_Unicode aChar( rStr[io_rPos] );
if(sal_Unicode('+') == aChar || sal_Unicode('-') == aChar)
aChar = rStr[++io_rPos];
while((sal_Unicode('0') <= aChar && sal_Unicode('9') >= aChar)
|| sal_Unicode('.') == aChar)
{
aChar = rStr[++io_rPos];
}
if(sal_Unicode('e') == aChar || sal_Unicode('E') == aChar)
{
aChar = rStr[++io_rPos];
if(sal_Unicode('+') == aChar || sal_Unicode('-') == aChar)
aChar = rStr[++io_rPos];
while(sal_Unicode('0') <= aChar && sal_Unicode('9') >= aChar)
{
aChar = rStr[++io_rPos];
}
}
}
void lcl_skipNumberAndSpacesAndCommas(sal_Int32& io_rPos,
const ::rtl::OUString& rStr,
const sal_Int32 nLen)
{
lcl_skipNumber(io_rPos, rStr, nLen);
lcl_skipSpacesAndCommas(io_rPos, rStr, nLen);
}
// #100617# Allow to skip doubles, too.
void lcl_skipDoubleAndSpacesAndCommas(sal_Int32& io_rPos,
const ::rtl::OUString& rStr,
const sal_Int32 nLen)
{
lcl_skipDouble(io_rPos, rStr, nLen);
lcl_skipSpacesAndCommas(io_rPos, rStr, nLen);
}
}
bool importFromSvgD( ::basegfx::B2DPolyPolygon& o_rPolyPoly,
const ::rtl::OUString& rSvgDStatement )
{
const sal_Int32 nLen( rSvgDStatement.getLength() );
sal_Int32 nPos(0);
B2DPolygon aCurrPoly;
lcl_skipSpaces(nPos, rSvgDStatement, nLen);
// #104076# reset closed flag for next to be started polygon
bool bIsClosed = false;
double nLastX( 0.0 );
double nLastY( 0.0 );
while( nPos < nLen )
{
bool bRelative(false);
bool bMoveTo(false);
const sal_Unicode aCurrChar( rSvgDStatement[nPos] );
switch( aCurrChar )
{
case 'z' :
case 'Z' :
{
nPos++;
lcl_skipSpaces(nPos, rSvgDStatement, nLen);
// #104076# remember closed state of current polygon
bIsClosed = true;
break;
}
case 'm' :
case 'M' :
{
bMoveTo = true;
// FALLTHROUGH intended
}
case 'l' :
case 'L' :
{
if( aCurrChar == 'm' || aCurrChar == 'l' )
bRelative = true;
if( bMoveTo )
{
if( aCurrPoly.count() )
{
// #104076# end-process current poly
aCurrPoly.setClosed( bIsClosed );
// reset closed flag for next to be started polygon
bIsClosed = false;
// next poly
o_rPolyPoly.append( aCurrPoly );
aCurrPoly.clear();
}
}
nPos++;
lcl_skipSpaces(nPos, rSvgDStatement, nLen);
while(nPos < nLen && lcl_isOnNumberChar(rSvgDStatement, nPos))
{
double nX, nY;
if( !lcl_importDoubleAndSpaces(nX, nPos, rSvgDStatement, nLen) )
return false;
if( !lcl_importDoubleAndSpaces(nY, nPos, rSvgDStatement, nLen) )
return false;
if(bRelative)
{
nX += nLastX;
nY += nLastY;
}
// set last position
nLastX = nX;
nLastY = nY;
// add point
aCurrPoly.append( B2DPoint( nX, nY ) );
}
break;
}
case 'h' :
{
bRelative = true;
// FALLTHROUGH intended
}
case 'H' :
{
nPos++;
lcl_skipSpaces(nPos, rSvgDStatement, nLen);
while(nPos < nLen && lcl_isOnNumberChar(rSvgDStatement, nPos))
{
double nX, nY( nLastY );
if( !lcl_importDoubleAndSpaces(nX, nPos, rSvgDStatement, nLen) )
return false;
if(bRelative)
nX += nLastX;
// set last position
nLastX = nX;
// add point
aCurrPoly.append( B2DPoint( nX, nY ) );
}
break;
}
case 'v' :
{
bRelative = true;
// FALLTHROUGH intended
}
case 'V' :
{
nPos++;
lcl_skipSpaces(nPos, rSvgDStatement, nLen);
while(nPos < nLen && lcl_isOnNumberChar(rSvgDStatement, nPos))
{
double nX( nLastX ), nY;
if( !lcl_importDoubleAndSpaces(nY, nPos, rSvgDStatement, nLen) )
return false;
if(bRelative)
nY += nLastY;
// set last position
nLastY = nY;
// add point
aCurrPoly.append( B2DPoint( nX, nY ) );
}
break;
}
case 's' :
{
bRelative = true;
// FALLTHROUGH intended
}
case 'S' :
{
nPos++;
lcl_skipSpaces(nPos, rSvgDStatement, nLen);
while(nPos < nLen && lcl_isOnNumberChar(rSvgDStatement, nPos))
{
double nX, nY;
double nX2, nY2;
if( !lcl_importDoubleAndSpaces(nX2, nPos, rSvgDStatement, nLen) )
return false;
if( !lcl_importDoubleAndSpaces(nY2, nPos, rSvgDStatement, nLen) )
return false;
if( !lcl_importDoubleAndSpaces(nX, nPos, rSvgDStatement, nLen) )
return false;
if( !lcl_importDoubleAndSpaces(nY, nPos, rSvgDStatement, nLen) )
return false;
if(bRelative)
{
nX2 += nLastX;
nY2 += nLastY;
nX += nLastX;
nY += nLastY;
}
// set control points/vectors
sal_uInt32 nNumEntries( aCurrPoly.count() );
if( nNumEntries == 0 )
{
// ensure valid prev point - if none
// was explicitely added, take last
// position
aCurrPoly.append( B2DPoint( nLastX, nLastY ) );
++nNumEntries;
}
if( nNumEntries > 1 )
{
// set reflected control
// vector.
aCurrPoly.setControlVectorA( nNumEntries-1,
-aCurrPoly.getControlVectorB( nNumEntries-2 ) );
}
// as required in the SVG spec, if there's
// no previous control point, the implicit
// control point shall be coincident with
// the current point. That means, there's
// effectively a zero control vector B at
// index nNumEntries-2
aCurrPoly.setControlPointB( nNumEntries-1,
B2DPoint( nX2, nY2 ) );
// set last position
if( !nNumEntries )
{
aCurrPoly.append( B2DPoint( nLastX, nLastY ) );
++nNumEntries;
}
nLastX = nX;
nLastY = nY;
// add point
aCurrPoly.append( B2DPoint( nX, nY ) );
}
break;
}
case 'c' :
{
bRelative = true;
// FALLTHROUGH intended
}
case 'C' :
{
nPos++;
lcl_skipSpaces(nPos, rSvgDStatement, nLen);
while(nPos < nLen && lcl_isOnNumberChar(rSvgDStatement, nPos))
{
double nX, nY;
double nX1, nY1;
double nX2, nY2;
if( !lcl_importDoubleAndSpaces(nX1, nPos, rSvgDStatement, nLen) )
return false;
if( !lcl_importDoubleAndSpaces(nY1, nPos, rSvgDStatement, nLen) )
return false;
if( !lcl_importDoubleAndSpaces(nX2, nPos, rSvgDStatement, nLen) )
return false;
if( !lcl_importDoubleAndSpaces(nY2, nPos, rSvgDStatement, nLen) )
return false;
if( !lcl_importDoubleAndSpaces(nX, nPos, rSvgDStatement, nLen) )
return false;
if( !lcl_importDoubleAndSpaces(nY, nPos, rSvgDStatement, nLen) )
return false;
if(bRelative)
{
nX1 += nLastX;
nY1 += nLastY;
nX2 += nLastX;
nY2 += nLastY;
nX += nLastX;
nY += nLastY;
}
// ensure at least one previous point (to
// set the control vector at)
sal_uInt32 nNumEntries( aCurrPoly.count() );
if( nNumEntries == 0 )
{
// ensure valid prev point - if none
// was explicitely added, take last
// position
aCurrPoly.append( B2DPoint( nLastX, nLastY ) );
++nNumEntries;
}
aCurrPoly.setControlPointA( nNumEntries-1,
B2DPoint( nX1, nY1 ) );
aCurrPoly.setControlPointB( nNumEntries-1,
B2DPoint( nX2, nY2 ) );
// set last position
nLastX = nX;
nLastY = nY;
// add new point
aCurrPoly.append( B2DPoint( nX, nY ) );
}
break;
}
// #100617# quadratic beziers are imported as cubic ones
case 'q' :
{
bRelative = true;
// FALLTHROUGH intended
}
case 'Q' :
{
nPos++;
lcl_skipSpaces(nPos, rSvgDStatement, nLen);
while(nPos < nLen && lcl_isOnNumberChar(rSvgDStatement, nPos))
{
double nX, nY;
double nX1, nY1;
if( !lcl_importDoubleAndSpaces(nX1, nPos, rSvgDStatement, nLen) )
return false;
if( !lcl_importDoubleAndSpaces(nY1, nPos, rSvgDStatement, nLen) )
return false;
if( !lcl_importDoubleAndSpaces(nX, nPos, rSvgDStatement, nLen) )
return false;
if( !lcl_importDoubleAndSpaces(nY, nPos, rSvgDStatement, nLen) )
return false;
if(bRelative)
{
nX1 += nLastX;
nY1 += nLastY;
nX += nLastX;
nY += nLastY;
}
// calculate the cubic bezier coefficients from the quadratic ones
const double nX1Prime( (nX1*2.0 + nLastX) / 3.0 );
const double nY1Prime( (nY1*2.0 + nLastY) / 3.0 );
const double nX2Prime( (nX1*2.0 + nX) / 3.0 );
const double nY2Prime( (nY1*2.0 + nY) / 3.0 );
sal_uInt32 nNumEntries( aCurrPoly.count() );
// ensure at least one previous point (to
// set the control vector at)
if( nNumEntries == 0 )
{
// ensure valid prev point - if none
// was explicitely added, take last
// position
aCurrPoly.append( B2DPoint( nLastX, nLastY ) );
++nNumEntries;
}
aCurrPoly.setControlPointA( nNumEntries-1,
B2DPoint( nX1Prime, nY1Prime ) );
aCurrPoly.setControlPointB( nNumEntries-1,
B2DPoint( nX2Prime, nY2Prime ) );
// set last position
nLastX = nX;
nLastY = nY;
// add new point
aCurrPoly.append( B2DPoint( nX, nY ) );
}
break;
}
// #100617# relative quadratic beziers are imported as cubic
case 't' :
{
bRelative = true;
// FALLTHROUGH intended
}
case 'T' :
{
nPos++;
lcl_skipSpaces(nPos, rSvgDStatement, nLen);
while(nPos < nLen && lcl_isOnNumberChar(rSvgDStatement, nPos))
{
double nX, nY;
if( !lcl_importDoubleAndSpaces(nX, nPos, rSvgDStatement, nLen) )
return false;
if( !lcl_importDoubleAndSpaces(nY, nPos, rSvgDStatement, nLen) )
return false;
if(bRelative)
{
nX += nLastX;
nY += nLastY;
}
// calc control points/vectors. Since the
// previous curve segment (if any) was
// already converted to cubic, we can
// simply take controlVectorB and apply it
// without further adaptions.
sal_uInt32 nNumEntries( aCurrPoly.count() );
if( nNumEntries == 0 )
{
// ensure valid prev point - if none
// was explicitely added, take last
// position
aCurrPoly.append( B2DPoint( nLastX, nLastY ) );
++nNumEntries;
}
if( nNumEntries > 1 )
{
// TODO(F2): Strictly speaking, we
// must check whether the previous
// segment is indeed quadratic
// (otherwise, if it is cubic, the
// spec requires the control point to
// be coincident with the current
// point)
const B2DVector aVecA( -aCurrPoly.getControlVectorB( nNumEntries-2 ) );
// set reflected control vector
aCurrPoly.setControlVectorA( nNumEntries-1, aVecA );
// calc real quadratic control point from prev point and prev
// cubic control vector
const B2DPoint aQuadControlPoint(
(3.0*aCurrPoly.getControlPointB( nNumEntries-2 ) -
aCurrPoly.getB2DPoint( nNumEntries-1 )) / 2.0 );
// calc new cubic control point
const double nX2Prime( (aQuadControlPoint.getX()*2.0 + nX) / 3.0 );
const double nY2Prime( (aQuadControlPoint.getY()*2.0 + nY) / 3.0 );
aCurrPoly.setControlPointB( nNumEntries-1,
B2DPoint( nX2Prime, nY2Prime ) );
}
// after the SVG spec, if there's no previous control point, the implicit
// control point shall be coincident with the current point. Which means,
// the quadratic bezier is a straight line in this case
// set last position
nLastX = nX;
nLastY = nY;
// add point
aCurrPoly.append( B2DPoint( nX, nY ) );
}
break;
}
// #100617# not yet supported: elliptical arc
case 'A' :
// FALLTHROUGH intended
case 'a' :
{
OSL_ENSURE( false,
"importFromSvgD(): non-interpreted tags in svg:d element (elliptical arc)!");
nPos++;
lcl_skipSpaces(nPos, rSvgDStatement, nLen);
while(nPos < nLen && lcl_isOnNumberChar(rSvgDStatement, nPos))
{
lcl_skipDoubleAndSpacesAndCommas(nPos, rSvgDStatement, nLen);
lcl_skipDoubleAndSpacesAndCommas(nPos, rSvgDStatement, nLen);
lcl_skipDoubleAndSpacesAndCommas(nPos, rSvgDStatement, nLen);
lcl_skipNumberAndSpacesAndCommas(nPos, rSvgDStatement, nLen);
lcl_skipNumberAndSpacesAndCommas(nPos, rSvgDStatement, nLen);
lcl_skipDoubleAndSpacesAndCommas(nPos, rSvgDStatement, nLen);
lcl_skipDoubleAndSpacesAndCommas(nPos, rSvgDStatement, nLen);
}
break;
}
default:
{
OSL_ENSURE( false,
"importFromSvgD(): skipping tags in svg:d element (unknown)!" );
OSL_TRACE( "importFromSvgD(): skipping tags in svg:d element (unknown: \"%c\")!", aCurrChar );
++nPos;
break;
}
}
}
if( aCurrPoly.count() )
{
// #104076# end-process closed state of last poly
aCurrPoly.setClosed( bIsClosed );
// add last polygon
o_rPolyPoly.append( aCurrPoly );
}
return true;
}
}
}
|
