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
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
|
/* -*- 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 <sal/config.h>
#include <algorithm>
#include <hintids.hxx>
#include <editeng/charscaleitem.hxx>
#include <svl/itemiter.hxx>
#include <svx/svdobj.hxx>
#include <vcl/svapp.hxx>
#include <fmtanchr.hxx>
#include <fmtfsize.hxx>
#include <fmtornt.hxx>
#include <fmtflcnt.hxx>
#include <fmtcntnt.hxx>
#include <fmtftn.hxx>
#include <frmatr.hxx>
#include <frmfmt.hxx>
#include <fmtfld.hxx>
#include <doc.hxx>
#include <IDocumentLayoutAccess.hxx>
#include <txatbase.hxx>
#include <viewsh.hxx>
#include <rootfrm.hxx>
#include <docary.hxx>
#include <ndtxt.hxx>
#include <fldbas.hxx>
#include <pam.hxx>
#include "itratr.hxx"
#include <htmltbl.hxx>
#include <swtable.hxx>
#include "redlnitr.hxx"
#include <redline.hxx>
#include <fmtsrnd.hxx>
#include "itrtxt.hxx"
#include <breakit.hxx>
#include <com/sun/star/i18n/WordType.hpp>
#include <com/sun/star/i18n/XBreakIterator.hpp>
#include <editeng/lrspitem.hxx>
#include <calbck.hxx>
#include <frameformats.hxx>
using namespace ::com::sun::star::i18n;
using namespace ::com::sun::star;
static sal_Int32 GetNextAttrImpl(SwTextNode const* pTextNode,
size_t nStartIndex, size_t nEndIndex, sal_Int32 nPosition);
SwAttrIter::SwAttrIter(SwTextNode const * pTextNode)
: m_pViewShell(nullptr)
, m_pFont(nullptr)
, m_pScriptInfo(nullptr)
, m_pLastOut(nullptr)
, m_nChgCnt(0)
, m_nStartIndex(0)
, m_nEndIndex(0)
, m_nPosition(0)
, m_nPropFont(0)
, m_pTextNode(pTextNode)
, m_pMergedPara(nullptr)
{
m_aFontCacheIds[SwFontScript::Latin] = m_aFontCacheIds[SwFontScript::CJK] = m_aFontCacheIds[SwFontScript::CTL] = nullptr;
}
SwAttrIter::SwAttrIter(SwTextNode& rTextNode, SwScriptInfo& rScrInf, SwTextFrame const*const pFrame)
: m_pViewShell(nullptr)
, m_pFont(nullptr)
, m_pScriptInfo(nullptr)
, m_pLastOut(nullptr)
, m_nChgCnt(0)
, m_nPropFont(0)
, m_pTextNode(&rTextNode)
, m_pMergedPara(nullptr)
{
CtorInitAttrIter(rTextNode, rScrInf, pFrame);
}
void SwAttrIter::Chg( SwTextAttr const *pHt )
{
assert(pHt && m_pFont && "No attribute of font available for change");
if( m_pRedline && m_pRedline->IsOn() )
m_pRedline->ChangeTextAttr( m_pFont, *pHt, true );
else
m_aAttrHandler.PushAndChg( *pHt, *m_pFont );
m_nChgCnt++;
}
void SwAttrIter::Rst( SwTextAttr const *pHt )
{
assert(pHt && m_pFont && "No attribute of font available for reset");
// get top from stack after removing pHt
if( m_pRedline && m_pRedline->IsOn() )
m_pRedline->ChangeTextAttr( m_pFont, *pHt, false );
else
m_aAttrHandler.PopAndChg( *pHt, *m_pFont );
m_nChgCnt--;
}
SwAttrIter::~SwAttrIter()
{
m_pRedline.reset();
delete m_pFont;
}
bool SwAttrIter::MaybeHasHints() const
{
return nullptr != m_pTextNode->GetpSwpHints() || nullptr != m_pMergedPara;
}
/**
* Returns the attribute for a position
*
* Only if the attribute is exactly at the position @param nPos and
* does not have an EndIndex
*
* We need this function for attributes which should alter formatting without
* changing the content of the string.
* Such "degenerated" attributes are e.g.: fields which retain expanded text and
* line-bound Frames.
* In order to avoid ambiguities between different such attributes, we insert a
* special character at the start of the string, when creating such an attribute.
* The Formatter later on encounters such a special character and retrieves the
* degenerate attribute via GetAttr().
*/
SwTextAttr *SwAttrIter::GetAttr(TextFrameIndex const nPosition) const
{
std::pair<SwTextNode const*, sal_Int32> const pos( m_pMergedPara
? sw::MapViewToModel(*m_pMergedPara, nPosition)
: std::make_pair(m_pTextNode, sal_Int32(nPosition)));
return pos.first->GetTextAttrForCharAt(pos.second);
}
bool SwAttrIter::SeekAndChgAttrIter(TextFrameIndex const nNewPos, OutputDevice* pOut)
{
std::pair<SwTextNode const*, sal_Int32> const pos( m_pMergedPara
? sw::MapViewToModel(*m_pMergedPara, nNewPos)
: std::make_pair(m_pTextNode, sal_Int32(nNewPos)));
bool bChg = m_nStartIndex && pos.first == m_pTextNode && pos.second == m_nPosition
? m_pFont->IsFntChg()
: Seek( nNewPos );
if ( m_pLastOut.get() != pOut )
{
m_pLastOut = pOut;
m_pFont->SetFntChg( true );
bChg = true;
}
if( bChg )
{
// if the change counter is zero, we know the cache id of the wanted font
if ( !m_nChgCnt && !m_nPropFont )
m_pFont->SetFontCacheId( m_aFontCacheIds[ m_pFont->GetActual() ],
m_aFontIdx[ m_pFont->GetActual() ], m_pFont->GetActual() );
m_pFont->ChgPhysFnt( m_pViewShell, *pOut );
}
return bChg;
}
bool SwAttrIter::IsSymbol(TextFrameIndex const nNewPos)
{
Seek( nNewPos );
if ( !m_nChgCnt && !m_nPropFont )
m_pFont->SetFontCacheId( m_aFontCacheIds[ m_pFont->GetActual() ],
m_aFontIdx[ m_pFont->GetActual() ], m_pFont->GetActual() );
return m_pFont->IsSymbol( m_pViewShell );
}
bool SwTextFrame::IsSymbolAt(TextFrameIndex const nPos) const
{
SwTextInfo info(const_cast<SwTextFrame*>(this));
SwTextIter iter(const_cast<SwTextFrame*>(this), &info);
return iter.IsSymbol(nPos);
}
bool SwAttrIter::SeekStartAndChgAttrIter( OutputDevice* pOut, const bool bParaFont )
{
SwTextNode const*const pFirstTextNode(m_pMergedPara ? m_pMergedPara->pFirstNode : m_pTextNode);
if ( m_pRedline && m_pRedline->ExtOn() )
m_pRedline->LeaveExtend(*m_pFont, pFirstTextNode->GetIndex(), 0);
if (m_pTextNode != pFirstTextNode)
{
assert(m_pMergedPara);
m_pTextNode = m_pMergedPara->pFirstNode;
InitFontAndAttrHandler(*m_pMergedPara->pParaPropsNode, *m_pTextNode,
m_pMergedPara->mergedText, nullptr, nullptr);
}
// reset font to its original state
m_aAttrHandler.Reset();
m_aAttrHandler.ResetFont( *m_pFont );
m_nStartIndex = 0;
m_nEndIndex = 0;
m_nPosition = 0;
m_nChgCnt = 0;
if( m_nPropFont )
m_pFont->SetProportion( m_nPropFont );
if( m_pRedline )
{
m_pRedline->Clear( m_pFont );
if( !bParaFont )
m_nChgCnt = m_nChgCnt + m_pRedline->Seek(*m_pFont, pFirstTextNode->GetIndex(), 0, COMPLETE_STRING);
else
m_pRedline->Reset();
}
SwpHints const*const pHints(m_pTextNode->GetpSwpHints());
if (pHints && !bParaFont)
{
SwTextAttr *pTextAttr;
// While we've not reached the end of the StartArray && the TextAttribute starts at position 0...
while ((m_nStartIndex < pHints->Count()) &&
!((pTextAttr = pHints->Get(m_nStartIndex))->GetStart()))
{
// open the TextAttributes
Chg( pTextAttr );
m_nStartIndex++;
}
}
bool bChg = m_pFont->IsFntChg();
if ( m_pLastOut.get() != pOut )
{
m_pLastOut = pOut;
m_pFont->SetFntChg( true );
bChg = true;
}
if( bChg )
{
// if the application counter is zero, we know the cache id of the wanted font
if ( !m_nChgCnt && !m_nPropFont )
m_pFont->SetFontCacheId( m_aFontCacheIds[ m_pFont->GetActual() ],
m_aFontIdx[ m_pFont->GetActual() ], m_pFont->GetActual() );
m_pFont->ChgPhysFnt( m_pViewShell, *pOut );
}
return bChg;
}
// AMA: New AttrIter Nov 94
void SwAttrIter::SeekFwd(const sal_Int32 nOldPos, const sal_Int32 nNewPos)
{
SwpHints const*const pHints(m_pTextNode->GetpSwpHints());
SwTextAttr *pTextAttr;
if ( m_nStartIndex ) // If attributes have been opened at all ...
{
// Close attributes that are currently open, but stop at nNewPos+1
// As long as we've not yet reached the end of EndArray and the
// TextAttribute ends before or at the new position ...
while ((m_nEndIndex < pHints->Count()) &&
((pTextAttr = pHints->GetSortedByEnd(m_nEndIndex))->GetAnyEnd() <= nNewPos))
{
// Close the TextAttributes, whose StartPos were before or at
// the old nPos and are currently open
if (pTextAttr->GetStart() <= nOldPos) Rst( pTextAttr );
m_nEndIndex++;
}
}
else // skip the not opened ends
{
while ((m_nEndIndex < pHints->Count()) &&
(pHints->GetSortedByEnd(m_nEndIndex)->GetAnyEnd() <= nNewPos))
{
m_nEndIndex++;
}
}
// As long as we've not yet reached the end of EndArray and the
// TextAttribute ends before or at the new position...
while ((m_nStartIndex < pHints->Count()) &&
((pTextAttr = pHints->Get(m_nStartIndex))->GetStart() <= nNewPos))
{
// open the TextAttributes, whose ends lie behind the new position
if ( pTextAttr->GetAnyEnd() > nNewPos ) Chg( pTextAttr );
m_nStartIndex++;
}
}
bool SwAttrIter::Seek(TextFrameIndex const nNewPos)
{
// note: nNewPos isn't necessarily an index returned from GetNextAttr
std::pair<SwTextNode const*, sal_Int32> const newPos( m_pMergedPara
? sw::MapViewToModel(*m_pMergedPara, nNewPos)
: std::make_pair(m_pTextNode, sal_Int32(nNewPos)));
if ( m_pRedline && m_pRedline->ExtOn() )
m_pRedline->LeaveExtend(*m_pFont, newPos.first->GetIndex(), newPos.second);
if (m_pTextNode->GetIndex() < newPos.first->GetIndex())
{
// Skipping to a different node - first seek until the end of this node
// to get rid of all hint items
if (m_pTextNode->GetpSwpHints())
{
sal_Int32 nPos(m_nPosition);
do
{
sal_Int32 const nOldPos(nPos);
nPos = GetNextAttrImpl(m_pTextNode, m_nStartIndex, m_nEndIndex, nPos);
if (nPos <= m_pTextNode->Len())
{
SeekFwd(nOldPos, nPos);
}
else
{
SeekFwd(nOldPos, m_pTextNode->Len());
}
}
while (nPos < m_pTextNode->Len());
}
assert(m_nChgCnt == 0); // should have reset it all? there cannot be ExtOn() inside of a Delete redline, surely?
// Unapply current para items:
// the SwAttrHandler doesn't appear to be capable of *unapplying*
// items at all; it can only apply a previously effective item.
// So do this by recreating the font from scratch.
// Apply new para items:
assert(m_pMergedPara);
InitFontAndAttrHandler(*m_pMergedPara->pParaPropsNode, *newPos.first,
m_pMergedPara->mergedText, nullptr, nullptr);
// reset to next
m_pTextNode = newPos.first;
m_nStartIndex = 0;
m_nEndIndex = 0;
m_nPosition = 0;
assert(m_pRedline);
}
// sw_redlinehide: Seek(0) must move before the first character, which
// has a special case where the first node starts with delete redline.
if ((!nNewPos && !m_pMergedPara)
|| newPos.first != m_pTextNode
|| newPos.second < m_nPosition)
{
if (m_pMergedPara)
{
if (m_pTextNode != newPos.first)
{
m_pTextNode = newPos.first;
// sw_redlinehide: hope it's okay to use the current text node
// here; the AttrHandler shouldn't care about non-char items
InitFontAndAttrHandler(*m_pMergedPara->pParaPropsNode, *m_pTextNode,
m_pMergedPara->mergedText, nullptr, nullptr);
}
}
if (m_pMergedPara || m_pTextNode->GetpSwpHints())
{
if( m_pRedline )
m_pRedline->Clear( nullptr );
// reset font to its original state
m_aAttrHandler.Reset();
m_aAttrHandler.ResetFont( *m_pFont );
if( m_nPropFont )
m_pFont->SetProportion( m_nPropFont );
m_nStartIndex = 0;
m_nEndIndex = 0;
m_nPosition = 0;
m_nChgCnt = 0;
// Attention!
// resetting the font here makes it necessary to apply any
// changes for extended input directly to the font
if ( m_pRedline && m_pRedline->ExtOn() )
{
m_pRedline->UpdateExtFont( *m_pFont );
++m_nChgCnt;
}
}
}
if (m_pTextNode->GetpSwpHints())
{
if (m_pMergedPara)
{
// iterate hint by hint: SeekFwd does not mix ends and starts,
// it always applies all the starts last, so it must be called once
// per position where hints start/end!
sal_Int32 nPos(m_nPosition);
do
{
sal_Int32 const nOldPos(nPos);
nPos = GetNextAttrImpl(m_pTextNode, m_nStartIndex, m_nEndIndex, nPos);
if (nPos <= newPos.second)
{
SeekFwd(nOldPos, nPos);
}
else
{
SeekFwd(nOldPos, newPos.second);
}
}
while (nPos < newPos.second);
}
else
{
SeekFwd(m_nPosition, newPos.second);
}
}
m_pFont->SetActual( m_pScriptInfo->WhichFont(nNewPos) );
if( m_pRedline )
m_nChgCnt = m_nChgCnt + m_pRedline->Seek(*m_pFont, m_pTextNode->GetIndex(), newPos.second, m_nPosition);
m_nPosition = newPos.second;
if( m_nPropFont )
m_pFont->SetProportion( m_nPropFont );
return m_pFont->IsFntChg();
}
static void InsertCharAttrs(SfxPoolItem const** pAttrs, SfxItemSet const& rItems)
{
SfxItemIter iter(rItems);
for (SfxPoolItem const* pItem = iter.GetCurItem(); pItem; pItem = iter.NextItem())
{
auto const nWhich(pItem->Which());
if (isCHRATR(nWhich) && RES_CHRATR_RSID != nWhich)
{
pAttrs[nWhich - RES_CHRATR_BEGIN] = pItem;
}
else if (nWhich == RES_TXTATR_UNKNOWN_CONTAINER)
{
pAttrs[RES_CHRATR_END] = pItem;
}
}
}
// if return false: portion ends at start of redline, indexes unchanged
// if return true: portion end not known (past end of redline), indexes point to first hint past end of redline
static bool CanSkipOverRedline(
SwTextNode const& rStartNode, sal_Int32 const nStartRedline,
SwRangeRedline const& rRedline,
size_t & rStartIndex, size_t & rEndIndex,
bool const isTheAnswerYes)
{
size_t nStartIndex(rStartIndex);
size_t nEndIndex(rEndIndex);
SwPosition const*const pRLEnd(rRedline.End());
if (!pRLEnd->nNode.GetNode().IsTextNode() // if fully deleted...
|| pRLEnd->nContent == pRLEnd->nNode.GetNode().GetTextNode()->Len())
{
// shortcut: nothing follows redline
// current state is end state
return false;
}
std::vector<SwTextAttr*> activeCharFmts;
// can't compare the SwFont that's stored somewhere, it doesn't have compare
// operator, so try to recreate the situation with some temp arrays here
SfxPoolItem const* activeCharAttrsStart[RES_CHRATR_END - RES_CHRATR_BEGIN + 1] = { nullptr, };
if (&rStartNode != &pRLEnd->nNode.GetNode())
{ // nodes' attributes are only needed if there are different nodes
InsertCharAttrs(activeCharAttrsStart, rStartNode.GetSwAttrSet());
}
if (SwpHints const*const pStartHints = rStartNode.GetpSwpHints())
{
// check hint ends of hints that start before and end within
sal_Int32 const nRedlineEnd(&rStartNode == &pRLEnd->nNode.GetNode()
? pRLEnd->nContent.GetIndex()
: rStartNode.Len());
for ( ; nEndIndex < pStartHints->Count(); ++nEndIndex)
{
SwTextAttr *const pAttr(pStartHints->GetSortedByEnd(nEndIndex));
if (!pAttr->End())
{
continue;
}
if (nRedlineEnd < *pAttr->End())
{
break;
}
if (nStartRedline <= pAttr->GetStart())
{
continue;
}
if (pAttr->IsFormatIgnoreEnd())
{
continue;
}
switch (pAttr->Which())
{
// if any of these ends inside RL then we need a new portion
case RES_TXTATR_REFMARK:
case RES_TXTATR_TOXMARK:
case RES_TXTATR_META: // actually these 2 aren't allowed to overlap ???
case RES_TXTATR_METAFIELD:
case RES_TXTATR_INETFMT:
case RES_TXTATR_CJK_RUBY:
case RES_TXTATR_INPUTFIELD:
{
if (!isTheAnswerYes) return false; // always break
}
break;
// these are guaranteed not to overlap
// and come in order of application
case RES_TXTATR_AUTOFMT:
case RES_TXTATR_CHARFMT:
{
if (pAttr->Which() == RES_TXTATR_CHARFMT)
{
activeCharFmts.push_back(pAttr);
}
// pure formatting hints may end inside the redline &
// start again inside the redline, which must not cause
// a new text portion if they have the same items - so
// store the effective items & compare all at the end
SfxItemSet const& rSet((pAttr->Which() == RES_TXTATR_CHARFMT)
? static_cast<SfxItemSet const&>(pAttr->GetCharFormat().GetCharFormat()->GetAttrSet())
: *pAttr->GetAutoFormat().GetStyleHandle());
InsertCharAttrs(activeCharAttrsStart, rSet);
}
break;
// SwTextNode::SetAttr puts it into AUTOFMT which is quite
// sensible so it doesn't actually exist as a hint
case RES_TXTATR_UNKNOWN_CONTAINER:
default: assert(false);
}
}
assert(nEndIndex == pStartHints->Count() ||
pRLEnd->nContent.GetIndex() < pStartHints->GetSortedByEnd(nEndIndex)->GetAnyEnd());
}
if (&rStartNode != &pRLEnd->nNode.GetNode())
{
nStartIndex = 0;
nEndIndex = 0;
}
// treat para properties as text properties
// ... with the FormatToTextAttr we get autofmts that correspond to the *effective* attr set difference
// effective attr set: para props + charfmts + autofmt *in that order*
// ... and the charfmt must be *nominally* the same
SfxPoolItem const* activeCharAttrsEnd[RES_CHRATR_END - RES_CHRATR_BEGIN + 1] = { nullptr, };
if (&rStartNode != &pRLEnd->nNode.GetNode())
{ // nodes' attributes are only needed if there are different nodes
InsertCharAttrs(activeCharAttrsEnd,
pRLEnd->nNode.GetNode().GetTextNode()->GetSwAttrSet());
}
if (SwpHints *const pEndHints = pRLEnd->nNode.GetNode().GetTextNode()->GetpSwpHints())
{
// check hint starts of hints that start within and end after
#ifndef NDEBUG
sal_Int32 const nRedlineStart(&rStartNode == &pRLEnd->nNode.GetNode()
? nStartRedline
: 0);
#endif
for ( ; nStartIndex < pEndHints->Count(); ++nStartIndex)
{
SwTextAttr *const pAttr(pEndHints->Get(nStartIndex));
// compare with < here, not <=, to get the effective formatting
// of the 1st char after the redline; should not cause problems
// with consecutive delete redlines because those are handed by
// GetNextRedln() and here we have the last end pos.
if (pRLEnd->nContent.GetIndex() < pAttr->GetStart())
{
break;
}
if (!pAttr->End())
continue;
if (pAttr->IsFormatIgnoreStart())
{
continue;
}
assert(nRedlineStart <= pAttr->GetStart()); // we wouldn't be here otherwise?
if (*pAttr->End() <= pRLEnd->nContent.GetIndex())
{
continue;
}
switch (pAttr->Which())
{
case RES_TXTATR_REFMARK:
case RES_TXTATR_TOXMARK:
case RES_TXTATR_META: // actually these 2 aren't allowed to overlap ???
case RES_TXTATR_METAFIELD:
case RES_TXTATR_INETFMT:
case RES_TXTATR_CJK_RUBY:
case RES_TXTATR_INPUTFIELD:
{
if (!isTheAnswerYes) return false;
}
break;
case RES_TXTATR_AUTOFMT:
case RES_TXTATR_CHARFMT:
{
// char formats must be *nominally* the same
if (pAttr->Which() == RES_TXTATR_CHARFMT)
{
auto iter = std::find_if(activeCharFmts.begin(), activeCharFmts.end(),
[&pAttr](const SwTextAttr* pCharFmt) { return *pCharFmt == *pAttr; });
if (iter != activeCharFmts.end())
activeCharFmts.erase(iter);
else if (!isTheAnswerYes)
return false;
}
SfxItemSet const& rSet((pAttr->Which() == RES_TXTATR_CHARFMT)
? static_cast<SfxItemSet const&>(pAttr->GetCharFormat().GetCharFormat()->GetAttrSet())
: *pAttr->GetAutoFormat().GetStyleHandle());
InsertCharAttrs(activeCharAttrsEnd, rSet);
}
break;
// SwTextNode::SetAttr puts it into AUTOFMT which is quite
// sensible so it doesn't actually exist as a hint
case RES_TXTATR_UNKNOWN_CONTAINER:
default: assert(false);
}
}
if (&rStartNode != &pRLEnd->nNode.GetNode())
{
// need to iterate the nEndIndex forward too so the loop in the
// caller can look for the right ends in the next iteration
for (nEndIndex = 0; nEndIndex < pEndHints->Count(); ++nEndIndex)
{
SwTextAttr *const pAttr(pEndHints->GetSortedByEnd(nEndIndex));
if (!pAttr->End())
continue;
if (pRLEnd->nContent.GetIndex() < *pAttr->End())
{
break;
}
}
}
}
// if we didn't find a matching start for any end, then it really ends inside
if (!activeCharFmts.empty())
{
if (!isTheAnswerYes) return false;
}
for (size_t i = 0; i < SAL_N_ELEMENTS(activeCharAttrsStart); ++i)
{
// all of these are poolable
// assert(!activeCharAttrsStart[i] || activeCharAttrsStart[i]->GetItemPool()->IsItemPoolable(*activeCharAttrsStart[i]));
if (activeCharAttrsStart[i] != activeCharAttrsEnd[i])
{
if (!isTheAnswerYes) return false;
}
}
rStartIndex = nStartIndex;
rEndIndex = nEndIndex;
return true;
}
static sal_Int32 GetNextAttrImpl(SwTextNode const*const pTextNode,
size_t const nStartIndex, size_t const nEndIndex,
sal_Int32 const nPosition)
{
// note: this used to be COMPLETE_STRING, but was set to Len() + 1 below,
// which is rather silly, so set it to Len() instead
sal_Int32 nNext = pTextNode->Len();
if (SwpHints const*const pHints = pTextNode->GetpSwpHints())
{
// are there attribute starts left?
for (size_t i = nStartIndex; i < pHints->Count(); ++i)
{
SwTextAttr *const pAttr(pHints->Get(i));
if (!pAttr->IsFormatIgnoreStart())
{
nNext = pAttr->GetStart();
break;
}
}
// are there attribute ends left?
for (size_t i = nEndIndex; i < pHints->Count(); ++i)
{
SwTextAttr *const pAttr(pHints->GetSortedByEnd(i));
if (!pAttr->IsFormatIgnoreEnd())
{
sal_Int32 const nNextEnd = pAttr->GetAnyEnd();
nNext = std::min(nNext, nNextEnd); // pick nearest one
break;
}
}
}
// TODO: maybe use hints like FieldHints for this instead of looking at the text...
const sal_Int32 l = std::min(nNext, pTextNode->Len());
sal_Int32 p = nPosition;
const sal_Unicode* pStr = pTextNode->GetText().getStr();
while (p < l)
{
sal_Unicode aChar = pStr[p];
switch (aChar)
{
case CH_TXT_ATR_FORMELEMENT:
case CH_TXT_ATR_FIELDSTART:
case CH_TXT_ATR_FIELDSEP:
case CH_TXT_ATR_FIELDEND:
goto break_; // sigh...
default:
++p;
}
}
break_:
assert(p <= nNext);
if (p < l)
{
// found a CH_TXT_ATR_FIELD*: if it's same as current position,
// skip behind it so that both before- and after-positions are returned
nNext = (nPosition < p) ? p : p + 1;
}
return nNext;
}
TextFrameIndex SwAttrIter::GetNextAttr() const
{
size_t nStartIndex(m_nStartIndex);
size_t nEndIndex(m_nEndIndex);
size_t nPosition(m_nPosition);
SwTextNode const* pTextNode(m_pTextNode);
SwRedlineTable::size_type nActRedline(m_pRedline ? m_pRedline->GetAct() : SwRedlineTable::npos);
while (true)
{
sal_Int32 nNext = GetNextAttrImpl(pTextNode, nStartIndex, nEndIndex, nPosition);
if( m_pRedline )
{
std::pair<sal_Int32, std::pair<SwRangeRedline const*, size_t>> const redline(
m_pRedline->GetNextRedln(nNext, pTextNode, nActRedline));
if (redline.second.first)
{
assert(m_pMergedPara);
assert(redline.second.first->End()->nNode.GetIndex() <= m_pMergedPara->pLastNode->GetIndex()
|| !redline.second.first->End()->nNode.GetNode().IsTextNode());
if (CanSkipOverRedline(*pTextNode, redline.first, *redline.second.first,
nStartIndex, nEndIndex, m_nPosition == redline.first))
{ // if current position is start of the redline, must skip!
nActRedline += redline.second.second;
if (&redline.second.first->End()->nNode.GetNode() != pTextNode)
{
pTextNode = redline.second.first->End()->nNode.GetNode().GetTextNode();
nPosition = redline.second.first->End()->nContent.GetIndex();
}
else
{
nPosition = redline.second.first->End()->nContent.GetIndex();
}
}
else
{
return sw::MapModelToView(*m_pMergedPara, pTextNode, redline.first);
}
}
else
{
return m_pMergedPara
? sw::MapModelToView(*m_pMergedPara, pTextNode, redline.first)
: TextFrameIndex(redline.first);
}
}
else
{
return TextFrameIndex(nNext);
}
}
}
namespace {
class SwMinMaxArgs
{
public:
VclPtr<OutputDevice> pOut;
SwViewShell const * pSh;
sal_uLong &rMin;
sal_uLong &rAbsMin;
long nRowWidth;
long nWordWidth;
long nWordAdd;
sal_Int32 nNoLineBreak;
SwMinMaxArgs( OutputDevice* pOutI, SwViewShell const * pShI, sal_uLong& rMinI, sal_uLong &rAbsI )
: pOut( pOutI ), pSh( pShI ), rMin( rMinI ), rAbsMin( rAbsI ), nRowWidth(0),
nWordWidth(0), nWordAdd(0), nNoLineBreak(COMPLETE_STRING)
{ }
void Minimum( long nNew ) const { if( static_cast<long>(rMin) < nNew ) rMin = nNew; }
void NewWord() { nWordAdd = nWordWidth = 0; }
};
}
static bool lcl_MinMaxString( SwMinMaxArgs& rArg, SwFont* pFnt, const OUString &rText,
sal_Int32 nIdx, sal_Int32 nEnd )
{
bool bRet = false;
while( nIdx < nEnd )
{
sal_Int32 nStop = nIdx;
LanguageType eLang = pFnt->GetLanguage();
assert(g_pBreakIt && g_pBreakIt->GetBreakIter().is());
bool bClear = CH_BLANK == rText[ nStop ];
Boundary aBndry( g_pBreakIt->GetBreakIter()->getWordBoundary( rText, nIdx,
g_pBreakIt->GetLocale( eLang ),
WordType::DICTIONARY_WORD, true ) );
nStop = aBndry.endPos;
if( nIdx <= aBndry.startPos && nIdx && nIdx-1 != rArg.nNoLineBreak )
rArg.NewWord();
if( nStop == nIdx )
++nStop;
if( nStop > nEnd )
nStop = nEnd;
SwDrawTextInfo aDrawInf(rArg.pSh, *rArg.pOut, rText, nIdx, nStop - nIdx);
long nCurrentWidth = pFnt->GetTextSize_( aDrawInf ).Width();
rArg.nRowWidth += nCurrentWidth;
if( bClear )
rArg.NewWord();
else
{
rArg.nWordWidth += nCurrentWidth;
if( static_cast<long>(rArg.rAbsMin) < rArg.nWordWidth )
rArg.rAbsMin = rArg.nWordWidth;
rArg.Minimum( rArg.nWordWidth + rArg.nWordAdd );
bRet = true;
}
nIdx = nStop;
}
return bRet;
}
bool SwTextNode::IsSymbolAt(const sal_Int32 nBegin) const
{
SwScriptInfo aScriptInfo;
SwAttrIter aIter( *const_cast<SwTextNode*>(this), aScriptInfo );
aIter.Seek( TextFrameIndex(nBegin) );
return aIter.GetFnt()->IsSymbol( getIDocumentLayoutAccess().GetCurrentViewShell() );
}
namespace {
class SwMinMaxNodeArgs
{
public:
sal_uLong nMaxWidth; // sum of all frame widths
long nMinWidth; // biggest frame
long nLeftRest; // space not already covered by frames in the left margin
long nRightRest; // space not already covered by frames in the right margin
long nLeftDiff; // Min/Max-difference of the frame in the left margin
long nRightDiff; // Min/Max-difference of the frame in the right margin
sal_uLong nIndx; // index of the node
void Minimum( long nNew ) { if( nNew > nMinWidth ) nMinWidth = nNew; }
};
}
static void lcl_MinMaxNode( SwFrameFormat* pNd, SwMinMaxNodeArgs* pIn )
{
const SwFormatAnchor& rFormatA = pNd->GetAnchor();
if ((RndStdIds::FLY_AT_PARA != rFormatA.GetAnchorId()) &&
(RndStdIds::FLY_AT_CHAR != rFormatA.GetAnchorId()))
{
return;
}
const SwPosition *pPos = rFormatA.GetContentAnchor();
OSL_ENSURE(pPos && pIn, "Unexpected NULL arguments");
if (!pPos || !pIn || pIn->nIndx != pPos->nNode.GetIndex())
return;
long nMin, nMax;
SwHTMLTableLayout *pLayout = nullptr;
const bool bIsDrawFrameFormat = pNd->Which()==RES_DRAWFRMFMT;
if( !bIsDrawFrameFormat )
{
// Does the frame contain a table at the start or the end?
const SwNodes& rNodes = pNd->GetDoc()->GetNodes();
const SwFormatContent& rFlyContent = pNd->GetContent();
sal_uLong nStt = rFlyContent.GetContentIdx()->GetIndex();
SwTableNode* pTableNd = rNodes[nStt+1]->GetTableNode();
if( !pTableNd )
{
SwNode *pNd2 = rNodes[nStt];
pNd2 = rNodes[pNd2->EndOfSectionIndex()-1];
if( pNd2->IsEndNode() )
pTableNd = pNd2->StartOfSectionNode()->GetTableNode();
}
if( pTableNd )
pLayout = pTableNd->GetTable().GetHTMLTableLayout();
}
const SwFormatHoriOrient& rOrient = pNd->GetHoriOrient();
sal_Int16 eHoriOri = rOrient.GetHoriOrient();
long nDiff;
if( pLayout )
{
nMin = pLayout->GetMin();
nMax = pLayout->GetMax();
nDiff = nMax - nMin;
}
else
{
if( bIsDrawFrameFormat )
{
const SdrObject* pSObj = pNd->FindSdrObject();
if( pSObj )
nMin = pSObj->GetCurrentBoundRect().GetWidth();
else
nMin = 0;
}
else
{
const SwFormatFrameSize &rSz = pNd->GetFrameSize();
nMin = rSz.GetWidth();
}
nMax = nMin;
nDiff = 0;
}
const SvxLRSpaceItem &rLR = pNd->GetLRSpace();
nMin += rLR.GetLeft();
nMin += rLR.GetRight();
nMax += rLR.GetLeft();
nMax += rLR.GetRight();
if( css::text::WrapTextMode_THROUGH == pNd->GetSurround().GetSurround() )
{
pIn->Minimum( nMin );
return;
}
// Frames, which are left- or right-aligned are only party considered
// when calculating the maximum, since the border is already being considered.
// Only if the frame extends into the text body, this part is being added
switch( eHoriOri )
{
case text::HoriOrientation::RIGHT:
{
if( nDiff )
{
pIn->nRightRest -= pIn->nRightDiff;
pIn->nRightDiff = nDiff;
}
if( text::RelOrientation::FRAME != rOrient.GetRelationOrient() )
{
if( pIn->nRightRest > 0 )
pIn->nRightRest = 0;
}
pIn->nRightRest -= nMin;
break;
}
case text::HoriOrientation::LEFT:
{
if( nDiff )
{
pIn->nLeftRest -= pIn->nLeftDiff;
pIn->nLeftDiff = nDiff;
}
if( text::RelOrientation::FRAME != rOrient.GetRelationOrient() &&
pIn->nLeftRest < 0 )
pIn->nLeftRest = 0;
pIn->nLeftRest -= nMin;
break;
}
default:
{
pIn->nMaxWidth += nMax;
pIn->Minimum( nMin );
}
}
}
#define FLYINCNT_MIN_WIDTH 284
/**
* Changing this method very likely requires changing of GetScalingOfSelectedText
* This one is called exclusively from import filters, so there is no layout.
*/
void SwTextNode::GetMinMaxSize( sal_uLong nIndex, sal_uLong& rMin, sal_uLong &rMax,
sal_uLong& rAbsMin ) const
{
SwViewShell const * pSh = GetDoc()->getIDocumentLayoutAccess().GetCurrentViewShell();
OutputDevice* pOut = nullptr;
if( pSh )
pOut = pSh->GetWin();
if( !pOut )
pOut = Application::GetDefaultDevice();
MapMode aOldMap( pOut->GetMapMode() );
pOut->SetMapMode( MapMode( MapUnit::MapTwip ) );
rMin = 0;
rMax = 0;
rAbsMin = 0;
const SvxLRSpaceItem &rSpace = GetSwAttrSet().GetLRSpace();
long nLROffset = rSpace.GetTextLeft() + GetLeftMarginWithNum( true );
short nFLOffs;
// For enumerations a negative first line indentation is probably filled already
if( !GetFirstLineOfsWithNum( nFLOffs ) || nFLOffs > nLROffset )
nLROffset = nFLOffs;
SwMinMaxNodeArgs aNodeArgs;
aNodeArgs.nMinWidth = 0;
aNodeArgs.nMaxWidth = 0;
aNodeArgs.nLeftRest = nLROffset;
aNodeArgs.nRightRest = rSpace.GetRight();
aNodeArgs.nLeftDiff = 0;
aNodeArgs.nRightDiff = 0;
if( nIndex )
{
SwFrameFormats* pTmp = const_cast<SwFrameFormats*>(GetDoc()->GetSpzFrameFormats());
if( pTmp )
{
aNodeArgs.nIndx = nIndex;
for( SwFrameFormat *pFormat : *pTmp )
lcl_MinMaxNode( pFormat, &aNodeArgs );
}
}
if( aNodeArgs.nLeftRest < 0 )
aNodeArgs.Minimum( nLROffset - aNodeArgs.nLeftRest );
aNodeArgs.nLeftRest -= aNodeArgs.nLeftDiff;
if( aNodeArgs.nLeftRest < 0 )
aNodeArgs.nMaxWidth -= aNodeArgs.nLeftRest;
if( aNodeArgs.nRightRest < 0 )
aNodeArgs.Minimum( rSpace.GetRight() - aNodeArgs.nRightRest );
aNodeArgs.nRightRest -= aNodeArgs.nRightDiff;
if( aNodeArgs.nRightRest < 0 )
aNodeArgs.nMaxWidth -= aNodeArgs.nRightRest;
SwScriptInfo aScriptInfo;
SwAttrIter aIter( *const_cast<SwTextNode*>(this), aScriptInfo );
TextFrameIndex nIdx(0);
aIter.SeekAndChgAttrIter( nIdx, pOut );
TextFrameIndex nLen(m_Text.getLength());
long nCurrentWidth = 0;
long nAdd = 0;
SwMinMaxArgs aArg( pOut, pSh, rMin, rAbsMin );
while( nIdx < nLen )
{
TextFrameIndex nNextChg = aIter.GetNextAttr();
TextFrameIndex nStop = aScriptInfo.NextScriptChg( nIdx );
if( nNextChg > nStop )
nNextChg = nStop;
SwTextAttr *pHint = nullptr;
sal_Unicode cChar = CH_BLANK;
nStop = nIdx;
while( nStop < nLen && nStop < nNextChg &&
CH_TAB != (cChar = m_Text[sal_Int32(nStop)]) &&
CH_BREAK != cChar && CHAR_HARDBLANK != cChar &&
CHAR_HARDHYPHEN != cChar && CHAR_SOFTHYPHEN != cChar &&
CH_TXT_ATR_INPUTFIELDSTART != cChar &&
CH_TXT_ATR_INPUTFIELDEND != cChar &&
CH_TXT_ATR_FORMELEMENT != cChar &&
CH_TXT_ATR_FIELDSTART != cChar &&
CH_TXT_ATR_FIELDSEP != cChar &&
CH_TXT_ATR_FIELDEND != cChar &&
!pHint )
{
// this looks like some defensive programming to handle dummy char
// with missing hint? but it's rather silly because it may pass the
// dummy char to lcl_MinMaxString in that case...
if( ( CH_TXTATR_BREAKWORD != cChar && CH_TXTATR_INWORD != cChar )
|| ( nullptr == ( pHint = aIter.GetAttr( nStop ) ) ) )
++nStop;
}
if (lcl_MinMaxString(aArg, aIter.GetFnt(), m_Text, sal_Int32(nIdx), sal_Int32(nStop)))
{
nAdd = 20;
}
nIdx = nStop;
aIter.SeekAndChgAttrIter( nIdx, pOut );
switch( cChar )
{
case CH_BREAK :
{
if( static_cast<long>(rMax) < aArg.nRowWidth )
rMax = aArg.nRowWidth;
aArg.nRowWidth = 0;
aArg.NewWord();
aIter.SeekAndChgAttrIter( ++nIdx, pOut );
}
break;
case CH_TAB :
{
aArg.NewWord();
aIter.SeekAndChgAttrIter( ++nIdx, pOut );
}
break;
case CHAR_SOFTHYPHEN:
++nIdx;
break;
case CHAR_HARDBLANK:
case CHAR_HARDHYPHEN:
{
OUString sTmp( cChar );
SwDrawTextInfo aDrawInf( pSh,
*pOut, sTmp, 0, 1, 0, false );
nCurrentWidth = aIter.GetFnt()->GetTextSize_( aDrawInf ).Width();
aArg.nWordWidth += nCurrentWidth;
aArg.nRowWidth += nCurrentWidth;
if( static_cast<long>(rAbsMin) < aArg.nWordWidth )
rAbsMin = aArg.nWordWidth;
aArg.Minimum( aArg.nWordWidth + aArg.nWordAdd );
aArg.nNoLineBreak = sal_Int32(nIdx++);
}
break;
case CH_TXTATR_BREAKWORD:
case CH_TXTATR_INWORD:
{
if( !pHint )
break;
long nOldWidth = aArg.nWordWidth;
long nOldAdd = aArg.nWordAdd;
aArg.NewWord();
switch( pHint->Which() )
{
case RES_TXTATR_FLYCNT :
{
SwFrameFormat *pFrameFormat = pHint->GetFlyCnt().GetFrameFormat();
const SvxLRSpaceItem &rLR = pFrameFormat->GetLRSpace();
if( RES_DRAWFRMFMT == pFrameFormat->Which() )
{
const SdrObject* pSObj = pFrameFormat->FindSdrObject();
if( pSObj )
nCurrentWidth = pSObj->GetCurrentBoundRect().GetWidth();
else
nCurrentWidth = 0;
}
else
{
const SwFormatFrameSize& rTmpSize = pFrameFormat->GetFrameSize();
if( RES_FLYFRMFMT == pFrameFormat->Which()
&& rTmpSize.GetWidthPercent() )
{
// This is a hack for the following situation: In the paragraph there's a
// text frame with relative size. Then let's take 0.5 cm as minimum width
// and USHRT_MAX as maximum width
// It were cleaner and maybe necessary later on to iterate over the content
// of the text frame and call GetMinMaxSize recursively
nCurrentWidth = FLYINCNT_MIN_WIDTH; // 0.5 cm
rMax = std::max(rMax, sal_uLong(USHRT_MAX));
}
else
nCurrentWidth = pFrameFormat->GetFrameSize().GetWidth();
}
nCurrentWidth += rLR.GetLeft();
nCurrentWidth += rLR.GetRight();
aArg.nWordAdd = nOldWidth + nOldAdd;
aArg.nWordWidth = nCurrentWidth;
aArg.nRowWidth += nCurrentWidth;
if( static_cast<long>(rAbsMin) < aArg.nWordWidth )
rAbsMin = aArg.nWordWidth;
aArg.Minimum( aArg.nWordWidth + aArg.nWordAdd );
break;
}
case RES_TXTATR_FTN :
{
const OUString aText = pHint->GetFootnote().GetNumStr();
if( lcl_MinMaxString( aArg, aIter.GetFnt(), aText, 0,
aText.getLength() ) )
nAdd = 20;
break;
}
case RES_TXTATR_FIELD :
case RES_TXTATR_ANNOTATION :
{
SwField *pField = const_cast<SwField*>(pHint->GetFormatField().GetField());
const OUString aText = pField->ExpandField(true, nullptr);
if( lcl_MinMaxString( aArg, aIter.GetFnt(), aText, 0,
aText.getLength() ) )
nAdd = 20;
break;
}
default: aArg.nWordWidth = nOldWidth;
aArg.nWordAdd = nOldAdd;
}
aIter.SeekAndChgAttrIter( ++nIdx, pOut );
}
break;
case CH_TXT_ATR_INPUTFIELDSTART:
case CH_TXT_ATR_INPUTFIELDEND:
case CH_TXT_ATR_FORMELEMENT:
case CH_TXT_ATR_FIELDSTART:
case CH_TXT_ATR_FIELDSEP:
case CH_TXT_ATR_FIELDEND:
{ // just skip it and continue with the content...
aIter.SeekAndChgAttrIter( ++nIdx, pOut );
}
break;
}
}
if( static_cast<long>(rMax) < aArg.nRowWidth )
rMax = aArg.nRowWidth;
nLROffset += rSpace.GetRight();
rAbsMin += nLROffset;
rAbsMin += nAdd;
rMin += nLROffset;
rMin += nAdd;
if( static_cast<long>(rMin) < aNodeArgs.nMinWidth )
rMin = aNodeArgs.nMinWidth;
if( static_cast<long>(rAbsMin) < aNodeArgs.nMinWidth )
rAbsMin = aNodeArgs.nMinWidth;
rMax += aNodeArgs.nMaxWidth;
rMax += nLROffset;
rMax += nAdd;
if( rMax < rMin ) // e.g. Frames with flow through only contribute to the minimum
rMax = rMin;
pOut->SetMapMode( aOldMap );
}
/**
* Calculates the width of the text part specified by nStart and nEnd,
* the height of the line containing nStart is divided by this width,
* indicating the scaling factor, if the text part is rotated.
* Having CH_BREAKs in the text part, this method returns the scaling
* factor for the longest of the text parts separated by the CH_BREAK
*
* Changing this method very likely requires changing of "GetMinMaxSize"
*/
sal_uInt16 SwTextFrame::GetScalingOfSelectedText(
TextFrameIndex nStart, TextFrameIndex nEnd)
{
assert(GetOffset() <= nStart && (!GetFollow() || nStart < GetFollow()->GetOffset()));
SwViewShell const*const pSh = getRootFrame()->GetCurrShell();
assert(pSh);
OutputDevice *const pOut = &pSh->GetRefDev();
assert(pOut);
MapMode aOldMap( pOut->GetMapMode() );
pOut->SetMapMode( MapMode( MapUnit::MapTwip ) );
if (nStart == nEnd)
{
assert(g_pBreakIt && g_pBreakIt->GetBreakIter().is());
SwScriptInfo aScriptInfo;
SwAttrIter aIter(*GetTextNodeFirst(), aScriptInfo, this);
aIter.SeekAndChgAttrIter( nStart, pOut );
Boundary aBound = g_pBreakIt->GetBreakIter()->getWordBoundary(
GetText(), sal_Int32(nStart),
g_pBreakIt->GetLocale( aIter.GetFnt()->GetLanguage() ),
WordType::DICTIONARY_WORD, true );
if (sal_Int32(nStart) == aBound.startPos)
{
// cursor is at left or right border of word
pOut->SetMapMode( aOldMap );
return 100;
}
nStart = TextFrameIndex(aBound.startPos);
nEnd = TextFrameIndex(aBound.endPos);
if (nStart == nEnd)
{
pOut->SetMapMode( aOldMap );
return 100;
}
}
SwScriptInfo aScriptInfo;
SwAttrIter aIter(*GetTextNodeFirst(), aScriptInfo, this);
// We do not want scaling attributes to be considered during this
// calculation. For this, we push a temporary scaling attribute with
// scaling value 100 and priority flag on top of the scaling stack
SwAttrHandler& rAH = aIter.GetAttrHandler();
SvxCharScaleWidthItem aItem(100, RES_CHRATR_SCALEW);
SwTextAttrEnd aAttr( aItem, 0, COMPLETE_STRING );
aAttr.SetPriorityAttr( true );
rAH.PushAndChg( aAttr, *(aIter.GetFnt()) );
TextFrameIndex nIdx = nStart;
sal_uLong nWidth = 0;
sal_uLong nProWidth = 0;
while( nIdx < nEnd )
{
aIter.SeekAndChgAttrIter( nIdx, pOut );
// scan for end of portion
TextFrameIndex const nNextChg = std::min(aIter.GetNextAttr(), aScriptInfo.NextScriptChg(nIdx));
TextFrameIndex nStop = nIdx;
sal_Unicode cChar = CH_BLANK;
SwTextAttr* pHint = nullptr;
// stop at special characters in [ nIdx, nNextChg ]
while( nStop < nEnd && nStop < nNextChg )
{
cChar = GetText()[sal_Int32(nStop)];
if (
CH_TAB == cChar ||
CH_BREAK == cChar ||
CHAR_HARDBLANK == cChar ||
CHAR_HARDHYPHEN == cChar ||
CHAR_SOFTHYPHEN == cChar ||
CH_TXT_ATR_INPUTFIELDSTART == cChar ||
CH_TXT_ATR_INPUTFIELDEND == cChar ||
CH_TXT_ATR_FORMELEMENT == cChar ||
CH_TXT_ATR_FIELDSTART == cChar ||
CH_TXT_ATR_FIELDSEP == cChar ||
CH_TXT_ATR_FIELDEND == cChar ||
(
(CH_TXTATR_BREAKWORD == cChar || CH_TXTATR_INWORD == cChar) &&
(nullptr == (pHint = aIter.GetAttr(nStop)))
)
)
{
break;
}
else
++nStop;
}
// calculate text widths up to cChar
if ( nStop > nIdx )
{
SwDrawTextInfo aDrawInf(pSh, *pOut, GetText(), sal_Int32(nIdx), sal_Int32(nStop - nIdx));
nProWidth += aIter.GetFnt()->GetTextSize_( aDrawInf ).Width();
}
nIdx = nStop;
aIter.SeekAndChgAttrIter( nIdx, pOut );
if ( cChar == CH_BREAK )
{
nWidth = std::max( nWidth, nProWidth );
nProWidth = 0;
nIdx++;
}
else if ( cChar == CH_TAB )
{
// tab receives width of one space
OUString sTmp( CH_BLANK );
SwDrawTextInfo aDrawInf(pSh, *pOut, sTmp, 0, 1);
nProWidth += aIter.GetFnt()->GetTextSize_( aDrawInf ).Width();
nIdx++;
}
else if ( cChar == CHAR_SOFTHYPHEN )
++nIdx;
else if ( cChar == CHAR_HARDBLANK || cChar == CHAR_HARDHYPHEN )
{
OUString sTmp( cChar );
SwDrawTextInfo aDrawInf(pSh, *pOut, sTmp, 0, 1);
nProWidth += aIter.GetFnt()->GetTextSize_( aDrawInf ).Width();
nIdx++;
}
else if ( pHint && ( cChar == CH_TXTATR_BREAKWORD || cChar == CH_TXTATR_INWORD ) )
{
switch( pHint->Which() )
{
case RES_TXTATR_FTN :
{
const OUString aText = pHint->GetFootnote().GetNumStr();
SwDrawTextInfo aDrawInf(pSh, *pOut, aText, 0, aText.getLength());
nProWidth += aIter.GetFnt()->GetTextSize_( aDrawInf ).Width();
break;
}
case RES_TXTATR_FIELD :
case RES_TXTATR_ANNOTATION :
{
SwField *pField = const_cast<SwField*>(pHint->GetFormatField().GetField());
OUString const aText = pField->ExpandField(true, getRootFrame());
SwDrawTextInfo aDrawInf(pSh, *pOut, aText, 0, aText.getLength());
nProWidth += aIter.GetFnt()->GetTextSize_( aDrawInf ).Width();
break;
}
default:
{
// any suggestions for a default action?
}
} // end of switch
nIdx++;
}
else if (CH_TXT_ATR_INPUTFIELDSTART == cChar ||
CH_TXT_ATR_INPUTFIELDEND == cChar ||
CH_TXT_ATR_FORMELEMENT == cChar ||
CH_TXT_ATR_FIELDSTART == cChar ||
CH_TXT_ATR_FIELDSEP == cChar ||
CH_TXT_ATR_FIELDEND == cChar)
{ // just skip it and continue with the content...
++nIdx;
}
} // end of while
nWidth = std::max( nWidth, nProWidth );
// search for the line containing nStart
if (HasPara())
{
SwTextInfo aInf(this);
SwTextIter aLine(this, &aInf);
aLine.CharToLine( nStart );
pOut->SetMapMode( aOldMap );
return static_cast<sal_uInt16>( nWidth ?
( ( 100 * aLine.GetCurr()->Height() ) / nWidth ) : 0 );
}
// no frame or no paragraph, we take the height of the character
// at nStart as line height
aIter.SeekAndChgAttrIter( nStart, pOut );
pOut->SetMapMode( aOldMap );
SwDrawTextInfo aDrawInf(pSh, *pOut, GetText(), sal_Int32(nStart), 1);
return static_cast<sal_uInt16>( nWidth ? ((100 * aIter.GetFnt()->GetTextSize_( aDrawInf ).Height()) / nWidth ) : 0 );
}
SwTwips SwTextNode::GetWidthOfLeadingTabs() const
{
SwTwips nRet = 0;
sal_Int32 nIdx = 0;
while ( nIdx < GetText().getLength() )
{
const sal_Unicode cCh = GetText()[nIdx];
if ( cCh!='\t' && cCh!=' ' )
{
break;
}
++nIdx;
}
if ( nIdx > 0 )
{
SwPosition aPos( *this );
aPos.nContent += nIdx;
// Find the non-follow text frame:
SwIterator<SwTextFrame, SwTextNode, sw::IteratorMode::UnwrapMulti> aIter(*this);
for( SwTextFrame* pFrame = aIter.First(); pFrame; pFrame = aIter.Next() )
{
// Only consider master frames:
if (!pFrame->IsFollow() &&
pFrame->GetTextNodeForFirstText() == this)
{
SwRectFnSet aRectFnSet(pFrame);
SwRect aRect;
pFrame->GetCharRect( aRect, aPos );
nRet = pFrame->IsRightToLeft() ?
aRectFnSet.GetPrtRight(*pFrame) - aRectFnSet.GetRight(aRect) :
aRectFnSet.GetLeft(aRect) - aRectFnSet.GetPrtLeft(*pFrame);
break;
}
}
}
return nRet;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|