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
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083 | /* -*- 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 <drawinglayer/primitive2d/svggradientprimitive2d.hxx>
#include <drawinglayer/primitive2d/drawinglayer_primitivetypes2d.hxx>
#include <drawinglayer/primitive2d/PolyPolygonColorPrimitive2D.hxx>
#include <drawinglayer/primitive2d/unifiedtransparenceprimitive2d.hxx>
#include <basegfx/matrix/b2dhommatrixtools.hxx>
#include <basegfx/polygon/b2dpolygontools.hxx>
#include <basegfx/polygon/b2dpolygon.hxx>
#include <drawinglayer/primitive2d/transparenceprimitive2d.hxx>
#include <drawinglayer/primitive2d/transformprimitive2d.hxx>
#include <drawinglayer/primitive2d/maskprimitive2d.hxx>
#include <drawinglayer/geometry/viewinformation2d.hxx>
#include <sal/log.hxx>
#include <cmath>
using namespace com::sun::star;
namespace
{
sal_uInt32 calculateStepsForSvgGradient(const basegfx::BColor& rColorA, const basegfx::BColor& rColorB, double fDelta, double fDiscreteUnit)
{
// use color distance, assume to do every color step (full quality)
sal_uInt32 nSteps(basegfx::fround(rColorA.getDistance(rColorB) * 255.0));
if(nSteps)
{
// calc discrete length to change color all 1.5 discrete units (pixels)
const sal_uInt32 nDistSteps(basegfx::fround(fDelta / (fDiscreteUnit * 1.5)));
nSteps = std::min(nSteps, nDistSteps);
}
// roughly cut when too big or too small
nSteps = std::min(nSteps, sal_uInt32(255));
nSteps = std::max(nSteps, sal_uInt32(1));
return nSteps;
}
} // end of anonymous namespace
namespace drawinglayer::primitive2d
{
void SvgGradientHelper::createSingleGradientEntryFill(Primitive2DContainer& rContainer) const
{
const SvgGradientEntryVector& rEntries = getGradientEntries();
const sal_uInt32 nCount(rEntries.size());
if(nCount)
{
const SvgGradientEntry& rSingleEntry = rEntries[nCount - 1];
const double fOpacity(rSingleEntry.getOpacity());
if(fOpacity > 0.0)
{
Primitive2DReference xRef(
new PolyPolygonColorPrimitive2D(
getPolyPolygon(),
rSingleEntry.getColor()));
if(fOpacity < 1.0)
{
const Primitive2DContainer aContent { xRef };
xRef = Primitive2DReference(
new UnifiedTransparencePrimitive2D(
aContent,
1.0 - fOpacity));
}
rContainer.push_back(xRef);
}
}
else
{
OSL_ENSURE(false, "Single gradient entry construction without entry (!)");
}
}
void SvgGradientHelper::checkPreconditions()
{
mbPreconditionsChecked = true;
const SvgGradientEntryVector& rEntries = getGradientEntries();
if(rEntries.empty())
{
// no fill at all, done
return;
}
// sort maGradientEntries by offset, small to big
std::sort(maGradientEntries.begin(), maGradientEntries.end());
// gradient with at least two colors
bool bAllInvisible(true);
bool bInvalidEntries(false);
for(const SvgGradientEntry& rCandidate : rEntries)
{
if(basegfx::fTools::equalZero(rCandidate.getOpacity()))
{
// invisible
mbFullyOpaque = false;
}
else if(basegfx::fTools::equal(rCandidate.getOpacity(), 1.0))
{
// completely opaque
bAllInvisible = false;
}
else
{
// opacity
bAllInvisible = false;
mbFullyOpaque = false;
}
if(!basegfx::fTools::betweenOrEqualEither(rCandidate.getOffset(), 0.0, 1.0))
{
bInvalidEntries = true;
}
}
if(bAllInvisible)
{
// all invisible, nothing to do
return;
}
if(bInvalidEntries)
{
// invalid entries, do nothing
SAL_WARN("drawinglayer", "SvgGradientHelper got invalid SvgGradientEntries outside [0.0 .. 1.0]");
return;
}
const basegfx::B2DRange aPolyRange(getPolyPolygon().getB2DRange());
if(aPolyRange.isEmpty())
{
// no range to fill, nothing to do
return;
}
const double fPolyWidth(aPolyRange.getWidth());
const double fPolyHeight(aPolyRange.getHeight());
if(basegfx::fTools::equalZero(fPolyWidth) || basegfx::fTools::equalZero(fPolyHeight))
{
// no width/height to fill, nothing to do
return;
}
mbCreatesContent = true;
if(1 == rEntries.size())
{
// fill with single existing color
setSingleEntry();
}
}
const SvgGradientEntry& SvgGradientHelper::FindEntryLessOrEqual(
sal_Int32& rInt,
const double fFrac) const
{
const bool bMirror(SpreadMethod::Reflect == getSpreadMethod() && 0 != rInt % 2);
const SvgGradientEntryVector& rCurrent(bMirror ? getMirroredGradientEntries() : getGradientEntries());
for(SvgGradientEntryVector::const_reverse_iterator aIter(rCurrent.rbegin()); aIter != rCurrent.rend(); aIter++)<--- Prefer prefix ++/-- operators for non-primitive types. [+]Prefix ++/-- operators should be preferred for non-primitive types. Pre-increment/decrement can be more efficient than post-increment/decrement. Post-increment/decrement usually involves keeping a copy of the previous value around and adds a little extra code.
{
if(basegfx::fTools::lessOrEqual(aIter->getOffset(), fFrac))
{
return *aIter;
}
}
// walk over gap to the left, be prepared for missing 0.0/1.0 entries
rInt--;
const bool bMirror2(SpreadMethod::Reflect == getSpreadMethod() && 0 != rInt % 2);
const SvgGradientEntryVector& rCurrent2(bMirror2 ? getMirroredGradientEntries() : getGradientEntries());
return rCurrent2.back();
}
const SvgGradientEntry& SvgGradientHelper::FindEntryMore(
sal_Int32& rInt,
const double fFrac) const
{
const bool bMirror(SpreadMethod::Reflect == getSpreadMethod() && 0 != rInt % 2);
const SvgGradientEntryVector& rCurrent(bMirror ? getMirroredGradientEntries() : getGradientEntries());
for(SvgGradientEntryVector::const_iterator aIter(rCurrent.begin()); aIter != rCurrent.end(); aIter++)<--- Prefer prefix ++/-- operators for non-primitive types. [+]Prefix ++/-- operators should be preferred for non-primitive types. Pre-increment/decrement can be more efficient than post-increment/decrement. Post-increment/decrement usually involves keeping a copy of the previous value around and adds a little extra code.
{
if(basegfx::fTools::more(aIter->getOffset(), fFrac))
{
return *aIter;
}
}
// walk over gap to the right, be prepared for missing 0.0/1.0 entries
rInt++;
const bool bMirror2(SpreadMethod::Reflect == getSpreadMethod() && 0 != rInt % 2);
const SvgGradientEntryVector& rCurrent2(bMirror2 ? getMirroredGradientEntries() : getGradientEntries());
return rCurrent2.front();
}
// tdf#124424 Adapted creation of color runs to do in a single effort. Previous
// version tried to do this from [0.0 .. 1.0] and to re-use transformed versions
// in the caller if SpreadMethod was on some repeat mode, but had problems when
// e.g. like in the bugdoc from the task a negative-only fStart/fEnd run was
// requested in which case it did nothing. Even when reusing the spread might
// not have been a full one from [0.0 .. 1.0].
// This gets complicated due to mirrored runs, but also for gradient definitions
// with missing entries for 0.0 and 1.0 in which case these have to be guessed
// to be there with same parametrisation as their nearest existing entries. These
// *could* have been added at checkPreconditions() but would then create unnecessary
// spreads on zone overlaps.
void SvgGradientHelper::createRun(
Primitive2DContainer& rTargetColor,
Primitive2DContainer& rTargetOpacity,
double fStart,
double fEnd) const
{
double fInt(0.0);
double fFrac(0.0);<--- Variable 'fFrac' is assigned a value that is never used.
double fEnd2(0.0);
if(SpreadMethod::Pad == getSpreadMethod())
{
if(fStart < 0.0)
{
fFrac = std::modf(fStart, &fInt);
const SvgGradientEntry& rFront(getGradientEntries().front());
const SvgGradientEntry aTemp(1.0 + fFrac, rFront.getColor(), rFront.getOpacity());
createAtom(rTargetColor, rTargetOpacity, aTemp, rFront, static_cast<sal_Int32>(fInt - 1), 0);
fStart = rFront.getOffset();
}
if(fEnd > 1.0)
{
// change fEnd early, but create geometry later (after range below)
fEnd2 = fEnd;
fEnd = getGradientEntries().back().getOffset();
}
}
while(fStart < fEnd)
{
fFrac = std::modf(fStart, &fInt);
if(fFrac < 0.0)
{
fInt -= 1;
fFrac = 1.0 + fFrac;
}
sal_Int32 nIntLeft(static_cast<sal_Int32>(fInt));
sal_Int32 nIntRight(nIntLeft);
const SvgGradientEntry& rLeft(FindEntryLessOrEqual(nIntLeft, fFrac));
const SvgGradientEntry& rRight(FindEntryMore(nIntRight, fFrac));
createAtom(rTargetColor, rTargetOpacity, rLeft, rRight, nIntLeft, nIntRight);
const double fNextfStart(static_cast<double>(nIntRight) + rRight.getOffset());
if(basegfx::fTools::more(fNextfStart, fStart))
{
fStart = fNextfStart;
}
else
{
SAL_WARN("drawinglayer", "SvgGradientHelper spread error");
fStart += 1.0;
}
}
if(fEnd2 > 1.0)
{
// create end run for SpreadMethod::Pad late to keep correct creation order
fFrac = std::modf(fEnd2, &fInt);
const SvgGradientEntry& rBack(getGradientEntries().back());
const SvgGradientEntry aTemp(fFrac, rBack.getColor(), rBack.getOpacity());
createAtom(rTargetColor, rTargetOpacity, rBack, aTemp, 0, static_cast<sal_Int32>(fInt));
}
}
void SvgGradientHelper::createResult(
Primitive2DContainer& rContainer,
const Primitive2DContainer& rTargetColor,
const Primitive2DContainer& rTargetOpacity,
const basegfx::B2DHomMatrix& rUnitGradientToObject,
bool bInvert) const
{
const Primitive2DContainer aTargetColorEntries(rTargetColor.maybeInvert(bInvert));
const Primitive2DContainer aTargetOpacityEntries(rTargetOpacity.maybeInvert(bInvert));
if(aTargetColorEntries.empty())
return;
Primitive2DReference xRefContent;
if(!aTargetOpacityEntries.empty())
{
const Primitive2DReference xRefOpacity = new TransparencePrimitive2D(
aTargetColorEntries,
aTargetOpacityEntries);
xRefContent = new TransformPrimitive2D(
rUnitGradientToObject,
Primitive2DContainer { xRefOpacity });
}
else
{
xRefContent = new TransformPrimitive2D(
rUnitGradientToObject,
aTargetColorEntries);
}
rContainer.push_back(new MaskPrimitive2D(
getPolyPolygon(),
Primitive2DContainer { xRefContent }));
}
SvgGradientHelper::SvgGradientHelper(
const basegfx::B2DHomMatrix& rGradientTransform,
const basegfx::B2DPolyPolygon& rPolyPolygon,
const SvgGradientEntryVector& rGradientEntries,
const basegfx::B2DPoint& rStart,
bool bUseUnitCoordinates,
SpreadMethod aSpreadMethod)
: maGradientTransform(rGradientTransform),
maPolyPolygon(rPolyPolygon),
maGradientEntries(rGradientEntries),
maMirroredGradientEntries(),
maStart(rStart),
maSpreadMethod(aSpreadMethod),
mbPreconditionsChecked(false),
mbCreatesContent(false),
mbSingleEntry(false),
mbFullyOpaque(true),
mbUseUnitCoordinates(bUseUnitCoordinates)
{
}
SvgGradientHelper::~SvgGradientHelper()
{
}
const SvgGradientEntryVector& SvgGradientHelper::getMirroredGradientEntries() const
{
if(maMirroredGradientEntries.empty() && !getGradientEntries().empty())
{
const_cast< SvgGradientHelper* >(this)->createMirroredGradientEntries();
}
return maMirroredGradientEntries;
}
void SvgGradientHelper::createMirroredGradientEntries()
{
if(!(maMirroredGradientEntries.empty() && !getGradientEntries().empty()))
return;
const sal_uInt32 nCount(getGradientEntries().size());
maMirroredGradientEntries.clear();
maMirroredGradientEntries.reserve(nCount);
for(sal_uInt32 a(0); a < nCount; a++)
{
const SvgGradientEntry& rCandidate = getGradientEntries()[nCount - 1 - a];
maMirroredGradientEntries.emplace_back(
1.0 - rCandidate.getOffset(),
rCandidate.getColor(),
rCandidate.getOpacity());
}
}
bool SvgGradientHelper::operator==(const SvgGradientHelper& rSvgGradientHelper) const
{
const SvgGradientHelper& rCompare = rSvgGradientHelper;
return (getGradientTransform() == rCompare.getGradientTransform()
&& getPolyPolygon() == rCompare.getPolyPolygon()
&& getGradientEntries() == rCompare.getGradientEntries()
&& getStart() == rCompare.getStart()
&& getUseUnitCoordinates() == rCompare.getUseUnitCoordinates()
&& getSpreadMethod() == rCompare.getSpreadMethod());
}
} // end of namespace drawinglayer::primitive2d
namespace drawinglayer::primitive2d
{
void SvgLinearGradientPrimitive2D::checkPreconditions()
{
// call parent
SvgGradientHelper::checkPreconditions();
if(getCreatesContent())
{
// Check Vector
const basegfx::B2DVector aVector(getEnd() - getStart());
if(basegfx::fTools::equalZero(aVector.getX()) && basegfx::fTools::equalZero(aVector.getY()))
{
// fill with single color using last stop color
setSingleEntry();
}
}
}
void SvgLinearGradientPrimitive2D::createAtom(
Primitive2DContainer& rTargetColor,
Primitive2DContainer& rTargetOpacity,
const SvgGradientEntry& rFrom,
const SvgGradientEntry& rTo,
sal_Int32 nOffsetFrom,
sal_Int32 nOffsetTo) const
{
// create gradient atom [rFrom.getOffset() .. rTo.getOffset()] with (rFrom.getOffset() > rTo.getOffset())
if(rFrom.getOffset() == rTo.getOffset())
{
OSL_ENSURE(false, "SvgGradient Atom creation with no step width (!)");
}
else
{
rTargetColor.push_back(
new SvgLinearAtomPrimitive2D(
rFrom.getColor(), rFrom.getOffset() + nOffsetFrom,
rTo.getColor(), rTo.getOffset() + nOffsetTo));
if(!getFullyOpaque())
{
const double fTransFrom(1.0 - rFrom.getOpacity());
const double fTransTo(1.0 - rTo.getOpacity());
const basegfx::BColor aColorFrom(fTransFrom, fTransFrom, fTransFrom);
const basegfx::BColor aColorTo(fTransTo, fTransTo, fTransTo);
rTargetOpacity.push_back(
new SvgLinearAtomPrimitive2D(
aColorFrom, rFrom.getOffset() + nOffsetFrom,
aColorTo, rTo.getOffset() + nOffsetTo));
}
}
}
void SvgLinearGradientPrimitive2D::create2DDecomposition(Primitive2DContainer& rContainer, const geometry::ViewInformation2D& /*rViewInformation*/) const
{
if(!getPreconditionsChecked())
{
const_cast< SvgLinearGradientPrimitive2D* >(this)->checkPreconditions();
}
if(getSingleEntry())
{
// fill with last existing color
createSingleGradientEntryFill(rContainer);
}
else if(getCreatesContent())
{
// at least two color stops in range [0.0 .. 1.0], sorted, non-null vector, not completely
// invisible, width and height to fill are not empty
const basegfx::B2DRange aPolyRange(getPolyPolygon().getB2DRange());
const double fPolyWidth(aPolyRange.getWidth());
const double fPolyHeight(aPolyRange.getHeight());
// create ObjectTransform based on polygon range
const basegfx::B2DHomMatrix aObjectTransform(
basegfx::utils::createScaleTranslateB2DHomMatrix(
fPolyWidth, fPolyHeight,
aPolyRange.getMinX(), aPolyRange.getMinY()));
basegfx::B2DHomMatrix aUnitGradientToObject;
if(getUseUnitCoordinates())
{
// interpret in unit coordinate system -> object aspect ratio will scale result
// create unit transform from unit vector [0.0 .. 1.0] along the X-Axis to given
// gradient vector defined by Start,End
const basegfx::B2DVector aVector(getEnd() - getStart());
const double fVectorLength(aVector.getLength());
aUnitGradientToObject.scale(fVectorLength, 1.0);
aUnitGradientToObject.rotate(atan2(aVector.getY(), aVector.getX()));
aUnitGradientToObject.translate(getStart().getX(), getStart().getY());
aUnitGradientToObject *= getGradientTransform();
// create full transform from unit gradient coordinates to object coordinates
// including the SvgGradient transformation
aUnitGradientToObject *= aObjectTransform;
}
else
{
// interpret in object coordinate system -> object aspect ratio will not scale result
const basegfx::B2DPoint aStart(aObjectTransform * getStart());
const basegfx::B2DPoint aEnd(aObjectTransform * getEnd());
const basegfx::B2DVector aVector(aEnd - aStart);
aUnitGradientToObject.scale(aVector.getLength(), 1.0);
aUnitGradientToObject.rotate(atan2(aVector.getY(), aVector.getX()));
aUnitGradientToObject.translate(aStart.getX(), aStart.getY());
aUnitGradientToObject *= getGradientTransform();
}
// create inverse from it
basegfx::B2DHomMatrix aObjectToUnitGradient(aUnitGradientToObject);
aObjectToUnitGradient.invert();
// back-transform polygon to unit gradient coordinates and get
// UnitRage. This is the range the gradient has to cover
basegfx::B2DPolyPolygon aUnitPoly(getPolyPolygon());
aUnitPoly.transform(aObjectToUnitGradient);
const basegfx::B2DRange aUnitRange(aUnitPoly.getB2DRange());
// prepare result vectors
Primitive2DContainer aTargetColor;
Primitive2DContainer aTargetOpacity;
if(basegfx::fTools::more(aUnitRange.getWidth(), 0.0))
{
// add a pre-multiply to aUnitGradientToObject to allow
// multiplication of the polygon(xl, 0.0, xr, 1.0)
const basegfx::B2DHomMatrix aPreMultiply(
basegfx::utils::createScaleTranslateB2DHomMatrix(
1.0, aUnitRange.getHeight(), 0.0, aUnitRange.getMinY()));
aUnitGradientToObject = aUnitGradientToObject * aPreMultiply;
// create full color run, including all SpreadMethod variants
createRun(
aTargetColor,
aTargetOpacity,
aUnitRange.getMinX(),
aUnitRange.getMaxX());
}
createResult(rContainer, aTargetColor, aTargetOpacity, aUnitGradientToObject);
}
}
SvgLinearGradientPrimitive2D::SvgLinearGradientPrimitive2D(
const basegfx::B2DHomMatrix& rGradientTransform,
const basegfx::B2DPolyPolygon& rPolyPolygon,
const SvgGradientEntryVector& rGradientEntries,
const basegfx::B2DPoint& rStart,
const basegfx::B2DPoint& rEnd,
bool bUseUnitCoordinates,
SpreadMethod aSpreadMethod)
: BufferedDecompositionPrimitive2D(),
SvgGradientHelper(rGradientTransform, rPolyPolygon, rGradientEntries, rStart, bUseUnitCoordinates, aSpreadMethod),
maEnd(rEnd)
{
}
SvgLinearGradientPrimitive2D::~SvgLinearGradientPrimitive2D()
{
}
bool SvgLinearGradientPrimitive2D::operator==(const BasePrimitive2D& rPrimitive) const
{
const SvgGradientHelper* pSvgGradientHelper = dynamic_cast< const SvgGradientHelper* >(&rPrimitive);
if(pSvgGradientHelper && SvgGradientHelper::operator==(*pSvgGradientHelper))
{
const SvgLinearGradientPrimitive2D& rCompare = static_cast< const SvgLinearGradientPrimitive2D& >(rPrimitive);
return (getEnd() == rCompare.getEnd());
}
return false;
}
basegfx::B2DRange SvgLinearGradientPrimitive2D::getB2DRange(const geometry::ViewInformation2D& /*rViewInformation*/) const
{
// return ObjectRange
return getPolyPolygon().getB2DRange();
}
// provide unique ID
ImplPrimitive2DIDBlock(SvgLinearGradientPrimitive2D, PRIMITIVE2D_ID_SVGLINEARGRADIENTPRIMITIVE2D)
} // end of namespace drawinglayer::primitive2d
namespace drawinglayer::primitive2d
{
void SvgRadialGradientPrimitive2D::checkPreconditions()
{
// call parent
SvgGradientHelper::checkPreconditions();
if(getCreatesContent())
{
// Check Radius
if(basegfx::fTools::equalZero(getRadius()))
{
// fill with single color using last stop color
setSingleEntry();
}
}
}
void SvgRadialGradientPrimitive2D::createAtom(
Primitive2DContainer& rTargetColor,
Primitive2DContainer& rTargetOpacity,
const SvgGradientEntry& rFrom,
const SvgGradientEntry& rTo,
sal_Int32 nOffsetFrom,
sal_Int32 nOffsetTo) const
{
// create gradient atom [rFrom.getOffset() .. rTo.getOffset()] with (rFrom.getOffset() > rTo.getOffset())
if(rFrom.getOffset() == rTo.getOffset())
{
OSL_ENSURE(false, "SvgGradient Atom creation with no step width (!)");
}
else
{
const double fScaleFrom(rFrom.getOffset() + nOffsetFrom);
const double fScaleTo(rTo.getOffset() + nOffsetTo);
if(isFocalSet())
{
const basegfx::B2DVector aTranslateFrom(maFocalVector * (maFocalLength - fScaleFrom));
const basegfx::B2DVector aTranslateTo(maFocalVector * (maFocalLength - fScaleTo));
rTargetColor.push_back(
new SvgRadialAtomPrimitive2D(
rFrom.getColor(), fScaleFrom, aTranslateFrom,
rTo.getColor(), fScaleTo, aTranslateTo));
}
else
{
rTargetColor.push_back(
new SvgRadialAtomPrimitive2D(
rFrom.getColor(), fScaleFrom,
rTo.getColor(), fScaleTo));
}
if(!getFullyOpaque())
{
const double fTransFrom(1.0 - rFrom.getOpacity());
const double fTransTo(1.0 - rTo.getOpacity());
const basegfx::BColor aColorFrom(fTransFrom, fTransFrom, fTransFrom);
const basegfx::BColor aColorTo(fTransTo, fTransTo, fTransTo);
if(isFocalSet())
{
const basegfx::B2DVector aTranslateFrom(maFocalVector * (maFocalLength - fScaleFrom));
const basegfx::B2DVector aTranslateTo(maFocalVector * (maFocalLength - fScaleTo));
rTargetOpacity.push_back(
new SvgRadialAtomPrimitive2D(
aColorFrom, fScaleFrom, aTranslateFrom,
aColorTo, fScaleTo, aTranslateTo));
}
else
{
rTargetOpacity.push_back(
new SvgRadialAtomPrimitive2D(
aColorFrom, fScaleFrom,
aColorTo, fScaleTo));
}
}
}
}
void SvgRadialGradientPrimitive2D::create2DDecomposition(Primitive2DContainer& rContainer, const geometry::ViewInformation2D& /*rViewInformation*/) const
{
if(!getPreconditionsChecked())
{
const_cast< SvgRadialGradientPrimitive2D* >(this)->checkPreconditions();
}
if(getSingleEntry())
{
// fill with last existing color
createSingleGradientEntryFill(rContainer);
}
else if(getCreatesContent())
{
// at least two color stops in range [0.0 .. 1.0], sorted, non-null vector, not completely
// invisible, width and height to fill are not empty
const basegfx::B2DRange aPolyRange(getPolyPolygon().getB2DRange());
const double fPolyWidth(aPolyRange.getWidth());
const double fPolyHeight(aPolyRange.getHeight());
// create ObjectTransform based on polygon range
const basegfx::B2DHomMatrix aObjectTransform(
basegfx::utils::createScaleTranslateB2DHomMatrix(
fPolyWidth, fPolyHeight,
aPolyRange.getMinX(), aPolyRange.getMinY()));
basegfx::B2DHomMatrix aUnitGradientToObject;
if(getUseUnitCoordinates())
{
// interpret in unit coordinate system -> object aspect ratio will scale result
// create unit transform from unit vector to given linear gradient vector
aUnitGradientToObject.scale(getRadius(), getRadius());
aUnitGradientToObject.translate(getStart().getX(), getStart().getY());
if(!getGradientTransform().isIdentity())
{
aUnitGradientToObject = getGradientTransform() * aUnitGradientToObject;
}
// create full transform from unit gradient coordinates to object coordinates
// including the SvgGradient transformation
aUnitGradientToObject = aObjectTransform * aUnitGradientToObject;
}
else
{
// interpret in object coordinate system -> object aspect ratio will not scale result
// use X-Axis with radius, it was already made relative to object width when coming from
// SVG import
const double fRadius((aObjectTransform * basegfx::B2DVector(getRadius(), 0.0)).getLength());
const basegfx::B2DPoint aStart(aObjectTransform * getStart());
aUnitGradientToObject.scale(fRadius, fRadius);
aUnitGradientToObject.translate(aStart.getX(), aStart.getY());
aUnitGradientToObject *= getGradientTransform();
}
// create inverse from it
basegfx::B2DHomMatrix aObjectToUnitGradient(aUnitGradientToObject);
aObjectToUnitGradient.invert();
// back-transform polygon to unit gradient coordinates and get
// UnitRage. This is the range the gradient has to cover
basegfx::B2DPolyPolygon aUnitPoly(getPolyPolygon());
aUnitPoly.transform(aObjectToUnitGradient);
const basegfx::B2DRange aUnitRange(aUnitPoly.getB2DRange());
// create range which the gradient has to cover to cover the whole given geometry.
// For circle, go from 0.0 to max radius in all directions (the corners)
double fMax(basegfx::B2DVector(aUnitRange.getMinimum()).getLength());
fMax = std::max(fMax, basegfx::B2DVector(aUnitRange.getMaximum()).getLength());
fMax = std::max(fMax, basegfx::B2DVector(aUnitRange.getMinX(), aUnitRange.getMaxY()).getLength());
fMax = std::max(fMax, basegfx::B2DVector(aUnitRange.getMaxX(), aUnitRange.getMinY()).getLength());
// prepare result vectors
Primitive2DContainer aTargetColor;
Primitive2DContainer aTargetOpacity;
if(0.0 < fMax)
{
// prepare maFocalVector
if(isFocalSet())
{
const_cast< SvgRadialGradientPrimitive2D* >(this)->maFocalLength = fMax;
}
// create full color run, including all SpreadMethod variants
createRun(
aTargetColor,
aTargetOpacity,
0.0,
fMax);
}
createResult(rContainer, aTargetColor, aTargetOpacity, aUnitGradientToObject, true);
}
}
SvgRadialGradientPrimitive2D::SvgRadialGradientPrimitive2D(
const basegfx::B2DHomMatrix& rGradientTransform,
const basegfx::B2DPolyPolygon& rPolyPolygon,
const SvgGradientEntryVector& rGradientEntries,
const basegfx::B2DPoint& rStart,
double fRadius,
bool bUseUnitCoordinates,
SpreadMethod aSpreadMethod,
const basegfx::B2DPoint* pFocal)
: BufferedDecompositionPrimitive2D(),
SvgGradientHelper(rGradientTransform, rPolyPolygon, rGradientEntries, rStart, bUseUnitCoordinates, aSpreadMethod),
mfRadius(fRadius),
maFocal(rStart),
maFocalVector(0.0, 0.0),
maFocalLength(0.0),
mbFocalSet(false)
{
if(pFocal && !pFocal->equal(getStart()))
{
maFocal = *pFocal;
maFocalVector = maFocal - getStart();
mbFocalSet = true;
}
}
SvgRadialGradientPrimitive2D::~SvgRadialGradientPrimitive2D()
{
}
bool SvgRadialGradientPrimitive2D::operator==(const BasePrimitive2D& rPrimitive) const
{
const SvgGradientHelper* pSvgGradientHelper = dynamic_cast< const SvgGradientHelper* >(&rPrimitive);
if(pSvgGradientHelper && SvgGradientHelper::operator==(*pSvgGradientHelper))
{
const SvgRadialGradientPrimitive2D& rCompare = static_cast< const SvgRadialGradientPrimitive2D& >(rPrimitive);
if(getRadius() == rCompare.getRadius())
{
if(isFocalSet() == rCompare.isFocalSet())
{
if(isFocalSet())
{
return getFocal() == rCompare.getFocal();
}
else
{
return true;
}
}
}
}
return false;
}
basegfx::B2DRange SvgRadialGradientPrimitive2D::getB2DRange(const geometry::ViewInformation2D& /*rViewInformation*/) const
{
// return ObjectRange
return getPolyPolygon().getB2DRange();
}
// provide unique ID
ImplPrimitive2DIDBlock(SvgRadialGradientPrimitive2D, PRIMITIVE2D_ID_SVGRADIALGRADIENTPRIMITIVE2D)
} // end of namespace drawinglayer::primitive2d
// SvgLinearAtomPrimitive2D class
namespace drawinglayer::primitive2d
{
void SvgLinearAtomPrimitive2D::create2DDecomposition(Primitive2DContainer& rContainer, const geometry::ViewInformation2D& /*rViewInformation*/) const
{
const double fDelta(getOffsetB() - getOffsetA());
if(basegfx::fTools::equalZero(fDelta))
return;
// use one discrete unit for overlap (one pixel)
const double fDiscreteUnit(getDiscreteUnit());
// use color distance and discrete lengths to calculate step count
const sal_uInt32 nSteps(calculateStepsForSvgGradient(getColorA(), getColorB(), fDelta, fDiscreteUnit));
// tdf#117949 Use a small amount of discrete overlap at the edges. Usually this
// should be exactly 0.0 and 1.0, but there were cases when this gets clipped
// against the mask polygon which got numerically problematic.
// This change is unnecessary in that respect, but avoids that numerical havoc
// by at the same time doing no real harm AFAIK
// TTTT: Remove again when clipping is fixed (!)
// prepare polygon in needed width at start position (with discrete overlap)
const basegfx::B2DPolygon aPolygon(
basegfx::utils::createPolygonFromRect(
basegfx::B2DRange(
getOffsetA() - fDiscreteUnit,
-0.0001, // TTTT -> should be 0.0, see comment above
getOffsetA() + (fDelta / nSteps) + fDiscreteUnit,
1.0001))); // TTTT -> should be 1.0, see comment above
// prepare loop (inside to outside, [0.0 .. 1.0[)
double fUnitScale(0.0);
const double fUnitStep(1.0 / nSteps);
for(sal_uInt32 a(0); a < nSteps; a++, fUnitScale += fUnitStep)
{
basegfx::B2DPolygon aNew(aPolygon);
aNew.transform(basegfx::utils::createTranslateB2DHomMatrix(fDelta * fUnitScale, 0.0));
rContainer.push_back(new PolyPolygonColorPrimitive2D(
basegfx::B2DPolyPolygon(aNew),
basegfx::interpolate(getColorA(), getColorB(), fUnitScale)));
}
}
SvgLinearAtomPrimitive2D::SvgLinearAtomPrimitive2D(
const basegfx::BColor& aColorA, double fOffsetA,
const basegfx::BColor& aColorB, double fOffsetB)
: DiscreteMetricDependentPrimitive2D(),
maColorA(aColorA),
maColorB(aColorB),
mfOffsetA(fOffsetA),
mfOffsetB(fOffsetB)
{
if(mfOffsetA > mfOffsetB)
{
OSL_ENSURE(false, "Wrong offset order (!)");
std::swap(mfOffsetA, mfOffsetB);
}
}
bool SvgLinearAtomPrimitive2D::operator==(const BasePrimitive2D& rPrimitive) const
{
if(DiscreteMetricDependentPrimitive2D::operator==(rPrimitive))
{
const SvgLinearAtomPrimitive2D& rCompare = static_cast< const SvgLinearAtomPrimitive2D& >(rPrimitive);
return (getColorA() == rCompare.getColorA()
&& getColorB() == rCompare.getColorB()
&& getOffsetA() == rCompare.getOffsetA()
&& getOffsetB() == rCompare.getOffsetB());
}
return false;
}
// provide unique ID
ImplPrimitive2DIDBlock(SvgLinearAtomPrimitive2D, PRIMITIVE2D_ID_SVGLINEARATOMPRIMITIVE2D)
} // end of namespace drawinglayer::primitive2d
// SvgRadialAtomPrimitive2D class
namespace drawinglayer::primitive2d
{
void SvgRadialAtomPrimitive2D::create2DDecomposition(Primitive2DContainer& rContainer, const geometry::ViewInformation2D& /*rViewInformation*/) const
{
const double fDeltaScale(getScaleB() - getScaleA());
if(basegfx::fTools::equalZero(fDeltaScale))
return;
// use one discrete unit for overlap (one pixel)
const double fDiscreteUnit(getDiscreteUnit());
// use color distance and discrete lengths to calculate step count
const sal_uInt32 nSteps(calculateStepsForSvgGradient(getColorA(), getColorB(), fDeltaScale, fDiscreteUnit));
// prepare loop ([0.0 .. 1.0[, full polygons, no polypolygons with holes)
double fUnitScale(0.0);
const double fUnitStep(1.0 / nSteps);
for(sal_uInt32 a(0); a < nSteps; a++, fUnitScale += fUnitStep)
{
basegfx::B2DHomMatrix aTransform;
const double fEndScale(getScaleB() - (fDeltaScale * fUnitScale));
if(isTranslateSet())
{
const basegfx::B2DVector aTranslate(
basegfx::interpolate(
getTranslateB(),
getTranslateA(),
fUnitScale));
aTransform = basegfx::utils::createScaleTranslateB2DHomMatrix(
fEndScale,
fEndScale,
aTranslate.getX(),
aTranslate.getY());
}
else
{
aTransform = basegfx::utils::createScaleB2DHomMatrix(
fEndScale,
fEndScale);
}
basegfx::B2DPolygon aNew(basegfx::utils::createPolygonFromUnitCircle());
aNew.transform(aTransform);
rContainer.push_back(new PolyPolygonColorPrimitive2D(
basegfx::B2DPolyPolygon(aNew),
basegfx::interpolate(getColorB(), getColorA(), fUnitScale)));
}
}
SvgRadialAtomPrimitive2D::SvgRadialAtomPrimitive2D(
const basegfx::BColor& aColorA, double fScaleA, const basegfx::B2DVector& rTranslateA,
const basegfx::BColor& aColorB, double fScaleB, const basegfx::B2DVector& rTranslateB)
: DiscreteMetricDependentPrimitive2D(),
maColorA(aColorA),
maColorB(aColorB),
mfScaleA(fScaleA),
mfScaleB(fScaleB)
{
// check and evtl. set translations
if(!rTranslateA.equal(rTranslateB))
{
mpTranslate.reset( new VectorPair(rTranslateA, rTranslateB) );
}
// scale A and B have to be positive
mfScaleA = std::max(mfScaleA, 0.0);
mfScaleB = std::max(mfScaleB, 0.0);
// scale B has to be bigger than scale A; swap if different
if(mfScaleA > mfScaleB)
{
OSL_ENSURE(false, "Wrong offset order (!)");
std::swap(mfScaleA, mfScaleB);
if(mpTranslate)
{
std::swap(mpTranslate->maTranslateA, mpTranslate->maTranslateB);
}
}
}
SvgRadialAtomPrimitive2D::SvgRadialAtomPrimitive2D(
const basegfx::BColor& aColorA, double fScaleA,
const basegfx::BColor& aColorB, double fScaleB)
: DiscreteMetricDependentPrimitive2D(),
maColorA(aColorA),
maColorB(aColorB),
mfScaleA(fScaleA),
mfScaleB(fScaleB)
{
// scale A and B have to be positive
mfScaleA = std::max(mfScaleA, 0.0);
mfScaleB = std::max(mfScaleB, 0.0);
// scale B has to be bigger than scale A; swap if different
if(mfScaleA > mfScaleB)
{
OSL_ENSURE(false, "Wrong offset order (!)");
std::swap(mfScaleA, mfScaleB);
}
}
SvgRadialAtomPrimitive2D::~SvgRadialAtomPrimitive2D()
{
}
bool SvgRadialAtomPrimitive2D::operator==(const BasePrimitive2D& rPrimitive) const
{
if(DiscreteMetricDependentPrimitive2D::operator==(rPrimitive))
{
const SvgRadialAtomPrimitive2D& rCompare = static_cast< const SvgRadialAtomPrimitive2D& >(rPrimitive);
if(getColorA() == rCompare.getColorA()
&& getColorB() == rCompare.getColorB()
&& getScaleA() == rCompare.getScaleA()
&& getScaleB() == rCompare.getScaleB())
{
if(isTranslateSet() && rCompare.isTranslateSet())
{
return (getTranslateA() == rCompare.getTranslateA()
&& getTranslateB() == rCompare.getTranslateB());
}
else if(!isTranslateSet() && !rCompare.isTranslateSet())
{
return true;
}
}
}
return false;
}
// provide unique ID
ImplPrimitive2DIDBlock(SvgRadialAtomPrimitive2D, PRIMITIVE2D_ID_SVGRADIALATOMPRIMITIVE2D)
} // end of namespace
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|