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
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
|
/* -*- 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 <editeng/boxitem.hxx>
#include <editeng/protitem.hxx>
#include <osl/diagnose.h>
#include <hintids.hxx>
#include <fmtanchr.hxx>
#include <fmtfsize.hxx>
#include <frmatr.hxx>
#include <tblsel.hxx>
#include <crsrsh.hxx>
#include <doc.hxx>
#include <IDocumentUndoRedo.hxx>
#include <IDocumentLayoutAccess.hxx>
#include <pam.hxx>
#include <ndtxt.hxx>
#include <swtable.hxx>
#include <cntfrm.hxx>
#include <tabfrm.hxx>
#include <rowfrm.hxx>
#include <cellfrm.hxx>
#include <rootfrm.hxx>
#include <viscrs.hxx>
#include <swtblfmt.hxx>
#include <UndoTable.hxx>
#include <sectfrm.hxx>
#include <frmtool.hxx>
#include <calbck.hxx>
#include <frameformats.hxx>
#include <deque>
#include <memory>
// see also swtable.cxx
#define COLFUZZY 20L
// macros, determining how table boxes are merged:
// - 1. remove empty lines, all boxes separated with blanks,
// all lines separated with ParaBreak
// - 2. remove all empty lines and remove all empty boxes at beginning and end,
// all boxes separated with Blank,
// all lines separated with ParaBreak
// - 3. remove all empty boxes, all boxes separated with blanks,
// all lines separated with ParaBreak
#undef DEL_ONLY_EMPTY_LINES
#undef DEL_EMPTY_BOXES_AT_START_AND_END
namespace {
struct CmpLPt
{
Point aPos;
const SwTableBox* pSelBox;
bool bVert;
CmpLPt( const Point& rPt, const SwTableBox* pBox, bool bVertical );
bool operator<( const CmpLPt& rCmp ) const
{
if ( bVert )
return X() > rCmp.X() || ( X() == rCmp.X() && Y() < rCmp.Y() );
else
return Y() < rCmp.Y() || ( Y() == rCmp.Y() && X() < rCmp.X() );
}
tools::Long X() const { return aPos.X(); }
tools::Long Y() const { return aPos.Y(); }
};
}
typedef o3tl::sorted_vector<CmpLPt> MergePos;
namespace {
struct Sort_CellFrame
{
const SwCellFrame* pFrame;
explicit Sort_CellFrame( const SwCellFrame& rCFrame )
: pFrame( &rCFrame ) {}
};
}
static const SwLayoutFrame *lcl_FindCellFrame( const SwLayoutFrame *pLay )
{
while ( pLay && !pLay->IsCellFrame() )
pLay = pLay->GetUpper();
return pLay;
}
static const SwLayoutFrame *lcl_FindNextCellFrame( const SwLayoutFrame *pLay )
{
// ensure we leave the cell (sections)
const SwLayoutFrame *pTmp = pLay;
do {
pTmp = pTmp->GetNextLayoutLeaf();
} while( pLay->IsAnLower( pTmp ) );
while( pTmp && !pTmp->IsCellFrame() )
pTmp = pTmp->GetUpper();
return pTmp;
}
void GetTableSelCrs( const SwCursorShell &rShell, SwSelBoxes& rBoxes )
{
rBoxes.clear();
if( rShell.IsTableMode() && const_cast<SwCursorShell&>(rShell).UpdateTableSelBoxes())
{
rBoxes.insert(rShell.GetTableCursor()->GetSelectedBoxes());
}
}
void GetTableSelCrs( const SwTableCursor& rTableCursor, SwSelBoxes& rBoxes )
{
rBoxes.clear();
if (rTableCursor.IsChgd() || !rTableCursor.GetSelectedBoxesCount())
{
SwTableCursor* pTCursor = const_cast<SwTableCursor*>(&rTableCursor);
pTCursor->GetDoc().getIDocumentLayoutAccess().GetCurrentLayout()->MakeTableCursors( *pTCursor );
}
if (rTableCursor.GetSelectedBoxesCount())
{
rBoxes.insert(rTableCursor.GetSelectedBoxes());
}
}
void GetTableSel( const SwCursorShell& rShell, SwSelBoxes& rBoxes,
const SwTableSearchType eSearchType )
{
// get start and end cell
if ( !rShell.IsTableMode() )
rShell.GetCursor();
GetTableSel( *rShell.getShellCursor(false), rBoxes, eSearchType );
}
void GetTableSel( const SwCursor& rCursor, SwSelBoxes& rBoxes,
const SwTableSearchType eSearchType )
{
// get start and end cell
OSL_ENSURE( rCursor.GetPointContentNode() && rCursor.GetMarkContentNode(),
"Tabselection not on Cnt." );
// Row-selection:
// Check for complex tables. If Yes, search selected boxes via
// the layout. Otherwise via the table structure (for macros !!)
const SwContentNode* pContentNd = rCursor.GetPointNode().GetContentNode();
const SwTableNode* pTableNd = pContentNd ? pContentNd->FindTableNode() : nullptr;
if( pTableNd && pTableNd->GetTable().IsNewModel() )
{
SwTable::SearchType eSearch;
switch( SwTableSearchType::Col & eSearchType )
{
case SwTableSearchType::Row: eSearch = SwTable::SEARCH_ROW; break;
case SwTableSearchType::Col: eSearch = SwTable::SEARCH_COL; break;
default: eSearch = SwTable::SEARCH_NONE; break;
}
const bool bChkP( SwTableSearchType::Protect & eSearchType );
pTableNd->GetTable().CreateSelection( rCursor, rBoxes, eSearch, bChkP );
return;
}
if( SwTableSearchType::Row == ((~SwTableSearchType::Protect ) & eSearchType ) &&
pTableNd && !pTableNd->GetTable().IsTableComplex() )
{
const SwTable& rTable = pTableNd->GetTable();
const SwTableLines& rLines = rTable.GetTabLines();
const SwNode& rMarkNode = rCursor.GetMarkNode();
const SwNodeOffset nMarkSectionStart = rMarkNode.StartOfSectionIndex();
const SwTableBox* pMarkBox = rTable.GetTableBox( nMarkSectionStart );
OSL_ENSURE( pMarkBox, "Point in table, mark outside?" );
const SwTableLine* pLine = pMarkBox ? pMarkBox->GetUpper() : nullptr;
sal_uInt16 nSttPos = rLines.GetPos( pLine );
OSL_ENSURE( USHRT_MAX != nSttPos, "Where is my row in the table?" );
pLine = rTable.GetTableBox( rCursor.GetPointNode().StartOfSectionIndex() )->GetUpper();
sal_uInt16 nEndPos = rLines.GetPos( pLine );
OSL_ENSURE( USHRT_MAX != nEndPos, "Where is my row in the table?" );
// pb: #i20193# if tableintable then nSttPos == nEndPos == USHRT_MAX
if ( nSttPos != USHRT_MAX && nEndPos != USHRT_MAX )
{
if( nEndPos < nSttPos ) // exchange
std::swap( nSttPos, nEndPos );
bool bChkProtected( SwTableSearchType::Protect & eSearchType );
for( ; nSttPos <= nEndPos; ++nSttPos )
{
pLine = rLines[ nSttPos ];
for( auto n = pLine->GetTabBoxes().size(); n ; )
{
SwTableBox* pBox = pLine->GetTabBoxes()[ --n ];
// check for cell protection??
if( !bChkProtected ||
!pBox->GetFrameFormat()->GetProtect().IsContentProtected() )
rBoxes.insert( pBox );
}
}
}
}
else
{
Point aPtPos, aMkPos;
const SwShellCursor* pShCursor = dynamic_cast<const SwShellCursor*>(&rCursor);
if( pShCursor )
{
aPtPos = pShCursor->GetPtPos();
aMkPos = pShCursor->GetMkPos();
}
const SwContentNode *pCntNd = rCursor.GetPointContentNode();
std::pair<Point, bool> tmp(aPtPos, true);
const SwLayoutFrame *pStart = pCntNd ?
pCntNd->getLayoutFrame(pCntNd->GetDoc().getIDocumentLayoutAccess().GetCurrentLayout(), nullptr, &tmp)->GetUpper() : nullptr;
pCntNd = rCursor.GetMarkContentNode();
tmp.first = aMkPos;
const SwLayoutFrame *pEnd = pCntNd ?
pCntNd->getLayoutFrame(pCntNd->GetDoc().getIDocumentLayoutAccess().GetCurrentLayout(), nullptr, &tmp)->GetUpper() : nullptr;
if( pStart && pEnd )
GetTableSel( pStart, pEnd, rBoxes, nullptr, eSearchType );
}
}
void GetTableSel( const SwLayoutFrame* pStart, const SwLayoutFrame* pEnd,
SwSelBoxes& rBoxes, SwCellFrames* pCells,
const SwTableSearchType eSearchType )
{
const SwTabFrame* pStartTab = pStart->FindTabFrame();
if ( !pStartTab )
{
OSL_FAIL( "GetTableSel without start table" );
return;
}
bool bChkProtected( SwTableSearchType::Protect & eSearchType );
// #i55421# Reduced value 10
int nLoopMax = 10;
do {
bool bTableIsValid = true;
// First, compute tables and rectangles
SwSelUnions aUnions;
::MakeSelUnions( aUnions, pStart, pEnd, eSearchType );
Point aCurrentTopLeft( LONG_MAX, LONG_MAX );
Point aCurrentTopRight( 0, LONG_MAX );
Point aCurrentBottomLeft( LONG_MAX, 0 );
Point aCurrentBottomRight( 0, 0 );
const SwCellFrame* pCurrentTopLeftFrame = nullptr;
const SwCellFrame* pCurrentTopRightFrame = nullptr;
const SwCellFrame* pCurrentBottomLeftFrame = nullptr;
const SwCellFrame* pCurrentBottomRightFrame = nullptr;
// Now find boxes for each entry and emit
for (size_t i = 0; i < aUnions.size() && bTableIsValid; ++i)
{
SwSelUnion *pUnion = &aUnions[i];
const SwTabFrame *pTable = pUnion->GetTable();
if( !pTable->isFrameAreaDefinitionValid() && nLoopMax )
{
bTableIsValid = false;
break;
}
// Skip any repeated headlines in the follow:
const SwLayoutFrame* pRow = pTable->IsFollow() ?
pTable->GetFirstNonHeadlineRow() :
static_cast<const SwLayoutFrame*>(pTable->Lower());
while( pRow && bTableIsValid )
{
if( !pRow->isFrameAreaDefinitionValid() && nLoopMax )
{
bTableIsValid = false;
break;
}
if ( pRow->getFrameArea().Overlaps( pUnion->GetUnion() ) )
{
const SwLayoutFrame *pCell = pRow->FirstCell();
while (pCell && pRow->IsAnLower(pCell))
{
if( !pCell->isFrameAreaDefinitionValid() && nLoopMax )
{
bTableIsValid = false;
break;
}
OSL_ENSURE( pCell->IsCellFrame(), "Frame without Cell" );
if( ::IsFrameInTableSel( pUnion->GetUnion(), pCell ) )
{
SwTableBox* pBox = const_cast<SwTableBox*>(
static_cast<const SwCellFrame*>(pCell)->GetTabBox());
// check for cell protection??
if( !bChkProtected ||
!pBox->GetFrameFormat()->GetProtect().IsContentProtected() )
rBoxes.insert( pBox );
if ( pCells )
{
const Point aTopLeft( pCell->getFrameArea().TopLeft() );
const Point aTopRight( pCell->getFrameArea().TopRight() );
const Point aBottomLeft( pCell->getFrameArea().BottomLeft() );
const Point aBottomRight( pCell->getFrameArea().BottomRight() );
if ( aTopLeft.getY() < aCurrentTopLeft.getY() ||
( aTopLeft.getY() == aCurrentTopLeft.getY() &&
aTopLeft.getX() < aCurrentTopLeft.getX() ) )
{
aCurrentTopLeft = aTopLeft;
pCurrentTopLeftFrame = static_cast<const SwCellFrame*>( pCell );
}
if ( aTopRight.getY() < aCurrentTopRight.getY() ||
( aTopRight.getY() == aCurrentTopRight.getY() &&
aTopRight.getX() > aCurrentTopRight.getX() ) )
{
aCurrentTopRight = aTopRight;
pCurrentTopRightFrame = static_cast<const SwCellFrame*>( pCell );
}
if ( aBottomLeft.getY() > aCurrentBottomLeft.getY() ||
( aBottomLeft.getY() == aCurrentBottomLeft.getY() &&
aBottomLeft.getX() < aCurrentBottomLeft.getX() ) )
{
aCurrentBottomLeft = aBottomLeft;
pCurrentBottomLeftFrame = static_cast<const SwCellFrame*>( pCell );
}
if ( aBottomRight.getY() > aCurrentBottomRight.getY() ||
( aBottomRight.getY() == aCurrentBottomRight.getY() &&
aBottomRight.getX() > aCurrentBottomRight.getX() ) )
{
aCurrentBottomRight = aBottomRight;
pCurrentBottomRightFrame = static_cast<const SwCellFrame*>( pCell );
}
}
}
if ( pCell->GetNext() )
{
pCell = static_cast<const SwLayoutFrame*>(pCell->GetNext());
if ( pCell->Lower() && pCell->Lower()->IsRowFrame() )
pCell = pCell->FirstCell();
}
else
pCell = ::lcl_FindNextCellFrame( pCell );
}
}
pRow = static_cast<const SwLayoutFrame*>(pRow->GetNext());
}
}
if ( pCells )
{
pCells->clear();
pCells->push_back( const_cast< SwCellFrame* >(pCurrentTopLeftFrame) );
pCells->push_back( const_cast< SwCellFrame* >(pCurrentTopRightFrame) );
pCells->push_back( const_cast< SwCellFrame* >(pCurrentBottomLeftFrame) );
pCells->push_back( const_cast< SwCellFrame* >(pCurrentBottomRightFrame) );
}
if( bTableIsValid )
break;
SwDeletionChecker aDelCheck( pStart );
// otherwise quickly "calculate" the table layout and start over
SwTabFrame *pTable = aUnions.front().GetTable();
while( pTable )
{
if( pTable->isFrameAreaDefinitionValid() )
{
pTable->InvalidatePos();
}
pTable->SetONECalcLowers();
pTable->Calc(pTable->getRootFrame()->GetCurrShell()->GetOut());
pTable->SetCompletePaint();
pTable = pTable->GetFollow();
if( nullptr == pTable )
break;
}
// --> Make code robust, check if pStart has
// been deleted due to the formatting of the table:
if ( aDelCheck.HasBeenDeleted() )
{
OSL_FAIL( "Current box has been deleted during GetTableSel()" );
break;
}
rBoxes.clear();
--nLoopMax;
} while( true );
OSL_ENSURE( nLoopMax, "Table layout is still invalid!" );
}
bool ChkChartSel( const SwNode& rSttNd, const SwNode& rEndNd )
{
const SwTableNode* pTNd = rSttNd.FindTableNode();
if( !pTNd )
return false;
Point aNullPos;
SwNodeIndex aIdx( rSttNd );
const SwContentNode* pCNd = aIdx.GetNode().GetContentNode();
if( !pCNd )
pCNd = aIdx.GetNodes().GoNextSection( &aIdx, false, false );
// if table is invisible, return
// (layout needed for forming table selection further down, so we can't
// continue with invisible tables)
// #i22135# - Also the content of the table could be
// invisible - e.g. in a hidden section
// Robust: check, if content was found (e.g. empty table cells)
if ( !pCNd || pCNd->getLayoutFrame( pCNd->GetDoc().getIDocumentLayoutAccess().GetCurrentLayout() ) == nullptr )
return false;
std::pair<Point, bool> tmp(aNullPos, true);
const SwLayoutFrame *const pStart = pCNd->getLayoutFrame(
pCNd->GetDoc().getIDocumentLayoutAccess().GetCurrentLayout(),
nullptr, &tmp)->GetUpper();
OSL_ENSURE( pStart, "without frame nothing works" );
aIdx = rEndNd;
pCNd = aIdx.GetNode().GetContentNode();
if( !pCNd )
pCNd = aIdx.GetNodes().GoNextSection( &aIdx, false, false );
// #i22135# - Robust: check, if content was found and if it's visible
if ( !pCNd || pCNd->getLayoutFrame( pCNd->GetDoc().getIDocumentLayoutAccess().GetCurrentLayout() ) == nullptr )
{
return false;
}
const SwLayoutFrame *const pEnd = pCNd->getLayoutFrame(
pCNd->GetDoc().getIDocumentLayoutAccess().GetCurrentLayout(),
nullptr, &tmp)->GetUpper();
OSL_ENSURE( pEnd, "without frame nothing works" );
bool bValidChartSel;
// #i55421# Reduced value 10
int nLoopMax = 10; //JP 28.06.99: max 100 loops - Bug 67292
do {
bool bTableIsValid = true;
bValidChartSel = true;
sal_uInt16 nRowCells = USHRT_MAX;
// First, compute tables and rectangles
SwSelUnions aUnions;
::MakeSelUnions( aUnions, pStart, pEnd, SwTableSearchType::NoUnionCorrect );
// find boxes for each entry and emit
for( auto & rSelUnion : aUnions )
{
if (!bTableIsValid || !bValidChartSel)
break;
SwSelUnion *pUnion = &rSelUnion;
const SwTabFrame *pTable = pUnion->GetTable();
SwRectFnSet aRectFnSet(pTable);
bool bRTL = pTable->IsRightToLeft();
if( !pTable->isFrameAreaDefinitionValid() && nLoopMax )
{
bTableIsValid = false;
break;
}
std::deque< Sort_CellFrame > aCellFrames;
// Skip any repeated headlines in the follow:
const SwLayoutFrame* pRow = pTable->IsFollow() ?
pTable->GetFirstNonHeadlineRow() :
static_cast<const SwLayoutFrame*>(pTable->Lower());
while( pRow && bTableIsValid && bValidChartSel )
{
if( !pRow->isFrameAreaDefinitionValid() && nLoopMax )
{
bTableIsValid = false;
break;
}
if( pRow->getFrameArea().Overlaps( pUnion->GetUnion() ) )
{
const SwLayoutFrame *pCell = pRow->FirstCell();
while (pCell && pRow->IsAnLower(pCell))
{
if( !pCell->isFrameAreaDefinitionValid() && nLoopMax )
{
bTableIsValid = false;
break;
}
OSL_ENSURE( pCell->IsCellFrame(), "Frame without Cell" );
const SwRect& rUnion = pUnion->GetUnion(),
& rFrameRect = pCell->getFrameArea();
const tools::Long nUnionRight = rUnion.Right();
const tools::Long nUnionBottom = rUnion.Bottom();
const tools::Long nFrameRight = rFrameRect.Right();
const tools::Long nFrameBottom = rFrameRect.Bottom();
// ignore if FrameRect is outside the union
const tools::Long nXFuzzy = aRectFnSet.IsVert() ? 0 : 20;
const tools::Long nYFuzzy = aRectFnSet.IsVert() ? 20 : 0;
if( !( rUnion.Top() + nYFuzzy > nFrameBottom ||
nUnionBottom < rFrameRect.Top() + nYFuzzy ||
rUnion.Left() + nXFuzzy > nFrameRight ||
nUnionRight < rFrameRect.Left() + nXFuzzy ))
{
// ok, rUnion is _not_ completely outside of rFrameRect
// if not completely inside the union, then
// for Chart it is an invalid selection
if( rUnion.Left() <= rFrameRect.Left() + nXFuzzy &&
rFrameRect.Left() <= nUnionRight &&
rUnion.Left() <= nFrameRight &&
nFrameRight <= nUnionRight + nXFuzzy &&
rUnion.Top() <= rFrameRect.Top() + nYFuzzy &&
rFrameRect.Top() <= nUnionBottom &&
rUnion.Top() <= nFrameBottom &&
nFrameBottom <= nUnionBottom+ nYFuzzy )
aCellFrames.emplace_back( *static_cast<const SwCellFrame*>(pCell) );
else
{
bValidChartSel = false;
break;
}
}
if ( pCell->GetNext() )
{
pCell = static_cast<const SwLayoutFrame*>(pCell->GetNext());
if ( pCell->Lower() && pCell->Lower()->IsRowFrame() )
pCell = pCell->FirstCell();
}
else
pCell = ::lcl_FindNextCellFrame( pCell );
}
}
pRow = static_cast<const SwLayoutFrame*>(pRow->GetNext());
}
if( !bValidChartSel )
break;
// all cells of the (part) table together. Now check if
// they're all adjacent
size_t n;
sal_uInt16 nCellCnt = 0;
tools::Long nYPos = LONG_MAX;
tools::Long nXPos = 0;
tools::Long nHeight = 0;
for( n = 0 ; n < aCellFrames.size(); ++n )
{
const Sort_CellFrame& rCF = aCellFrames[ n ];
if( aRectFnSet.GetTop(rCF.pFrame->getFrameArea()) != nYPos )
{
// new row
if( n )
{
if( USHRT_MAX == nRowCells ) // 1. row change
nRowCells = nCellCnt;
else if( nRowCells != nCellCnt )
{
bValidChartSel = false;
break;
}
}
nCellCnt = 1;
nYPos = aRectFnSet.GetTop(rCF.pFrame->getFrameArea());
nHeight = aRectFnSet.GetHeight(rCF.pFrame->getFrameArea());
nXPos = bRTL ?
aRectFnSet.GetLeft(rCF.pFrame->getFrameArea()) :
aRectFnSet.GetRight(rCF.pFrame->getFrameArea());
}
else if( nXPos == ( bRTL ?
aRectFnSet.GetRight(rCF.pFrame->getFrameArea()) :
aRectFnSet.GetLeft(rCF.pFrame->getFrameArea()) ) &&
nHeight == aRectFnSet.GetHeight(rCF.pFrame->getFrameArea()) )
{
nXPos += ( bRTL ? -1 : 1 ) *
aRectFnSet.GetWidth(rCF.pFrame->getFrameArea());
++nCellCnt;
}
else
{
bValidChartSel = false;
break;
}
}
if( bValidChartSel )
{
if( USHRT_MAX == nRowCells )
nRowCells = nCellCnt;
else if( nRowCells != nCellCnt )
bValidChartSel = false;
}
}
if( bTableIsValid )
break;
// otherwise quickly "calculate" table layout and start over
SwTabFrame *pTable = aUnions.front().GetTable();
for( SwSelUnions::size_type i = 0; i < aUnions.size(); ++i )
{
if( pTable->isFrameAreaDefinitionValid() )
{
pTable->InvalidatePos();
}
pTable->SetONECalcLowers();
pTable->Calc(pTable->getRootFrame()->GetCurrShell()->GetOut());
pTable->SetCompletePaint();
pTable = pTable->GetFollow();
if( nullptr == pTable )
break;
}
--nLoopMax;
} while( true );
OSL_ENSURE( nLoopMax, "table layout is still invalid!" );
return bValidChartSel;
}
bool IsFrameInTableSel( const SwRect& rUnion, const SwFrame* pCell )
{
OSL_ENSURE( pCell->IsCellFrame(), "Frame without Gazelle" );
if( pCell->FindTabFrame()->IsVertical() )
return rUnion.Right() >= pCell->getFrameArea().Right() &&
rUnion.Left() <= pCell->getFrameArea().Left() &&
(( rUnion.Top() <= pCell->getFrameArea().Top()+20 &&
rUnion.Bottom() > pCell->getFrameArea().Top() ) ||
( rUnion.Top() >= pCell->getFrameArea().Top() &&
rUnion.Bottom() < pCell->getFrameArea().Bottom() ));
return
rUnion.Top() <= pCell->getFrameArea().Top() &&
rUnion.Bottom() >= pCell->getFrameArea().Bottom() &&
(( rUnion.Left() <= pCell->getFrameArea().Left()+20 &&
rUnion.Right() > pCell->getFrameArea().Left() ) ||
( rUnion.Left() >= pCell->getFrameArea().Left() &&
rUnion.Right() < pCell->getFrameArea().Right() ));
}
bool GetAutoSumSel( const SwCursorShell& rShell, SwCellFrames& rBoxes )
{
SwShellCursor* pCursor = rShell.m_pCurrentCursor;
if ( rShell.IsTableMode() )
pCursor = rShell.m_pTableCursor;
std::pair<Point, bool> tmp(pCursor->GetPtPos(), true);
const SwLayoutFrame *const pStart = pCursor->GetPointContentNode()->getLayoutFrame(
rShell.GetLayout(), nullptr, &tmp)->GetUpper();
tmp.first = pCursor->GetMkPos();
const SwLayoutFrame *const pEnd = pCursor->GetMarkContentNode()->getLayoutFrame(
rShell.GetLayout(), nullptr, &tmp)->GetUpper();
const SwLayoutFrame* pSttCell = pStart;
while( pSttCell && !pSttCell->IsCellFrame() )
pSttCell = pSttCell->GetUpper();
// First, compute tables and rectangles
SwSelUnions aUnions;
// by default, first test above and then to the left
::MakeSelUnions( aUnions, pStart, pEnd, SwTableSearchType::Col );
bool bTstRow = true, bFound = false;
// 1. check if box above contains value/formula
for( SwSelUnions::size_type i = 0; i < aUnions.size(); ++i )
{
SwSelUnion *pUnion = &aUnions[i];
const SwTabFrame *pTable = pUnion->GetTable();
// Skip any repeated headlines in the follow:
const SwLayoutFrame* pRow = pTable->IsFollow() ?
pTable->GetFirstNonHeadlineRow() :
static_cast<const SwLayoutFrame*>(pTable->Lower());
while( pRow )
{
if( pRow->getFrameArea().Overlaps( pUnion->GetUnion() ) )
{
const SwCellFrame* pUpperCell = nullptr;
const SwLayoutFrame *pCell = pRow->FirstCell();
while( pCell && pRow->IsAnLower( pCell ) )
{
if( pCell == pSttCell )
{
sal_uInt16 nWhichId = 0;
for( size_t n = rBoxes.size(); n; )
{
nWhichId = rBoxes[ --n ]->GetTabBox()->IsFormulaOrValueBox();
if( USHRT_MAX != nWhichId )
break;
}
// all boxes together, do not check the
// row, if a formula or value was found
bTstRow = 0 == nWhichId || USHRT_MAX == nWhichId;
bFound = true;
break;
}
OSL_ENSURE( pCell->IsCellFrame(), "Frame without cell" );
if( ::IsFrameInTableSel( pUnion->GetUnion(), pCell ) )
pUpperCell = static_cast<const SwCellFrame*>(pCell);
if( pCell->GetNext() )
{
pCell = static_cast<const SwLayoutFrame*>(pCell->GetNext());
if ( pCell->Lower() && pCell->Lower()->IsRowFrame() )
pCell = pCell->FirstCell();
}
else
pCell = ::lcl_FindNextCellFrame( pCell );
}
if( pUpperCell )
rBoxes.push_back( const_cast< SwCellFrame* >(pUpperCell) );
}
if( bFound )
{
i = aUnions.size();
break;
}
pRow = static_cast<const SwLayoutFrame*>(pRow->GetNext());
}
}
// 2. check if box on left contains value/formula
if( bTstRow )
{
bFound = false;
rBoxes.clear();
aUnions.clear();
::MakeSelUnions( aUnions, pStart, pEnd, SwTableSearchType::Row );
for( SwSelUnions::size_type i = 0; i < aUnions.size(); ++i )
{
SwSelUnion *pUnion = &aUnions[i];
const SwTabFrame *pTable = pUnion->GetTable();
// Skip any repeated headlines in the follow:
const SwLayoutFrame* pRow = pTable->IsFollow() ?
pTable->GetFirstNonHeadlineRow() :
static_cast<const SwLayoutFrame*>(pTable->Lower());
while( pRow )
{
if( pRow->getFrameArea().Overlaps( pUnion->GetUnion() ) )
{
const SwLayoutFrame *pCell = pRow->FirstCell();
while( pCell && pRow->IsAnLower( pCell ) )
{
if( pCell == pSttCell )
{
sal_uInt16 nWhichId = 0;
for( size_t n = rBoxes.size(); n; )
{
nWhichId = rBoxes[ --n ]
->GetTabBox()->IsFormulaOrValueBox();
if( USHRT_MAX != nWhichId )
break;
}
// all boxes together, do not check the
// row if a formula or value was found
bFound = 0 != nWhichId && USHRT_MAX != nWhichId;
bTstRow = false;
break;
}
OSL_ENSURE( pCell->IsCellFrame(), "Frame without cell" );
if( ::IsFrameInTableSel( pUnion->GetUnion(), pCell ) )
{
SwCellFrame* pC = const_cast<SwCellFrame*>(static_cast<const SwCellFrame*>(pCell));
rBoxes.push_back( pC );
}
if( pCell->GetNext() )
{
pCell = static_cast<const SwLayoutFrame*>(pCell->GetNext());
if ( pCell->Lower() && pCell->Lower()->IsRowFrame() )
pCell = pCell->FirstCell();
}
else
pCell = ::lcl_FindNextCellFrame( pCell );
}
}
if( !bTstRow )
{
i = aUnions.size();
break;
}
pRow = static_cast<const SwLayoutFrame*>(pRow->GetNext());
}
}
}
return bFound;
}
bool HasProtectedCells( const SwSelBoxes& rBoxes )
{
bool bRet = false;
for (size_t n = 0; n < rBoxes.size(); ++n)
{
if( rBoxes[ n ]->GetFrameFormat()->GetProtect().IsContentProtected() )
{
bRet = true;
break;
}
}
return bRet;
}
CmpLPt::CmpLPt( const Point& rPt, const SwTableBox* pBox, bool bVertical )
: aPos( rPt ), pSelBox( pBox ), bVert( bVertical )
{}
static void lcl_InsTableBox( SwTableNode* pTableNd, SwDoc* pDoc, SwTableBox* pBox,
sal_uInt16 nInsPos, sal_uInt16 nCnt = 1 )
{
OSL_ENSURE( pBox->GetSttNd(), "Box without Start-Node" );
SwContentNode* pCNd = pDoc->GetNodes()[ pBox->GetSttIdx() + 1 ]
->GetContentNode();
if( pCNd && pCNd->IsTextNode() )
pDoc->GetNodes().InsBoxen( pTableNd, pBox->GetUpper(),
static_cast<SwTableBoxFormat*>(pBox->GetFrameFormat()),
static_cast<SwTextNode*>(pCNd)->GetTextColl(),
pCNd->GetpSwAttrSet(),
nInsPos, nCnt );
else
pDoc->GetNodes().InsBoxen( pTableNd, pBox->GetUpper(),
static_cast<SwTableBoxFormat*>(pBox->GetFrameFormat()),
pDoc->GetDfltTextFormatColl(), nullptr,
nInsPos, nCnt );
}
bool IsEmptyBox( const SwTableBox& rBox, SwPaM& rPam )
{
rPam.GetPoint()->Assign( *rBox.GetSttNd()->EndOfSectionNode() );
rPam.Move( fnMoveBackward, GoInContent );
rPam.SetMark();
rPam.GetPoint()->Assign( *rBox.GetSttNd() );
rPam.Move( fnMoveForward, GoInContent );
bool bRet = *rPam.GetMark() == *rPam.GetPoint()
&& ( rBox.GetSttNd()->GetIndex() + 1 == rPam.GetPoint()->GetNodeIndex() );
if( bRet )
{
// now check for paragraph bound flies
const sw::SpzFrameFormats& rFormats = *rPam.GetDoc().GetSpzFrameFormats();
SwNodeOffset nSttIdx = rPam.GetPoint()->GetNodeIndex(),
nEndIdx = rBox.GetSttNd()->EndOfSectionIndex(),
nIdx;
for( auto pFormat : rFormats )
{
const SwFormatAnchor& rAnchor = pFormat->GetAnchor();
const SwNode* pAnchorNode = rAnchor.GetAnchorNode();
if (pAnchorNode &&
((RndStdIds::FLY_AT_PARA == rAnchor.GetAnchorId()) ||
(RndStdIds::FLY_AT_CHAR == rAnchor.GetAnchorId())) &&
nSttIdx <= ( nIdx = pAnchorNode->GetIndex() ) &&
nIdx < nEndIdx )
{
bRet = false;
break;
}
}
}
return bRet;
}
void GetMergeSel( const SwPaM& rPam, SwSelBoxes& rBoxes,
SwTableBox** ppMergeBox, SwUndoTableMerge* pUndo )
{
rBoxes.clear();
OSL_ENSURE( rPam.GetPointContentNode() && rPam.GetMarkContentNode(),
"Tabselection not on Cnt." );
//JP 24.09.96: Merge with repeating TableHeadLines does not work properly.
// Why not use point 0,0? Then it is assured the first
// headline is contained.
Point aPt( 0, 0 );
const SwContentNode* pCntNd = rPam.GetPointContentNode();
std::pair<Point, bool> const tmp(aPt, true);
const SwLayoutFrame *const pStart = pCntNd->getLayoutFrame(
pCntNd->GetDoc().getIDocumentLayoutAccess().GetCurrentLayout(),
nullptr, &tmp)->GetUpper();
pCntNd = rPam.GetMarkContentNode();
const SwLayoutFrame *const pEnd = pCntNd->getLayoutFrame(
pCntNd->GetDoc().getIDocumentLayoutAccess().GetCurrentLayout(),
nullptr, &tmp)->GetUpper();
// First, compute tables and rectangles
SwSelUnions aUnions;
::MakeSelUnions( aUnions, pStart, pEnd );
if( aUnions.empty() )
return;
const SwTable *pTable = aUnions.front().GetTable()->GetTable();
SwDoc* pDoc = const_cast<SwDoc*>(pStart->GetFormat()->GetDoc());
SwTableNode* pTableNd = const_cast<SwTableNode*>(pTable->GetTabSortBoxes()[ 0 ]->
GetSttNd()->FindTableNode());
MergePos aPosArr; // Sort-Array with the frame positions
tools::Long nWidth;
SwTableBox* pLastBox = nullptr;
SwRectFnSet aRectFnSet(pStart->GetUpper());
for ( auto & rSelUnion : aUnions )
{
const SwTabFrame *pTabFrame = rSelUnion.GetTable();
SwRect &rUnion = rSelUnion.GetUnion();
// Skip any repeated headlines in the follow:
const SwLayoutFrame* pRow = pTabFrame->IsFollow() ?
pTabFrame->GetFirstNonHeadlineRow() :
static_cast<const SwLayoutFrame*>(pTabFrame->Lower());
while ( pRow )
{
if ( pRow->getFrameArea().Overlaps( rUnion ) )
{
const SwLayoutFrame *pCell = pRow->FirstCell();
while ( pCell && pRow->IsAnLower( pCell ) )
{
OSL_ENSURE( pCell->IsCellFrame(), "Frame without cell" );
// overlap in full width?
if( rUnion.Top() <= pCell->getFrameArea().Top() &&
rUnion.Bottom() >= pCell->getFrameArea().Bottom() )
{
SwTableBox* pBox = const_cast<SwTableBox*>(static_cast<const SwCellFrame*>(pCell)->GetTabBox());
// only overlap to the right?
if( ( rUnion.Left() - COLFUZZY ) <= pCell->getFrameArea().Left() &&
( rUnion.Right() - COLFUZZY ) > pCell->getFrameArea().Left() )
{
if( ( rUnion.Right() + COLFUZZY ) < pCell->getFrameArea().Right() )
{
sal_uInt16 nInsPos = pBox->GetUpper()->GetBoxPos( pBox )+1;
lcl_InsTableBox( pTableNd, pDoc, pBox, nInsPos );
pBox->ClaimFrameFormat();
SwFormatFrameSize aNew(
pBox->GetFrameFormat()->GetFrameSize() );
nWidth = rUnion.Right() - pCell->getFrameArea().Left();
nWidth = nWidth * aNew.GetWidth() /
pCell->getFrameArea().Width();
tools::Long nTmpWidth = aNew.GetWidth() - nWidth;
aNew.SetWidth( nWidth );
pBox->GetFrameFormat()->SetFormatAttr( aNew );
// this box is selected
pLastBox = pBox;
rBoxes.insert( pBox );
aPosArr.insert(
CmpLPt( aRectFnSet.GetPos(pCell->getFrameArea()),
pBox, aRectFnSet.IsVert() ) );
pBox = pBox->GetUpper()->GetTabBoxes()[ nInsPos ];
aNew.SetWidth( nTmpWidth );
pBox->ClaimFrameFormat();
pBox->GetFrameFormat()->SetFormatAttr( aNew );
if( pUndo )
pUndo->AddNewBox( pBox->GetSttIdx() );
}
else
{
// this box is selected
pLastBox = pBox;
rBoxes.insert( pBox );
aPosArr.insert(
CmpLPt( aRectFnSet.GetPos(pCell->getFrameArea()),
pBox, aRectFnSet.IsVert() ) );
}
}
// overlapping on left- or right-side
else if( ( rUnion.Left() - COLFUZZY ) >= pCell->getFrameArea().Left() &&
( rUnion.Right() + COLFUZZY ) < pCell->getFrameArea().Right() )
{
sal_uInt16 nInsPos = pBox->GetUpper()->GetBoxPos( pBox )+1;
lcl_InsTableBox( pTableNd, pDoc, pBox, nInsPos, 2 );
pBox->ClaimFrameFormat();
SwFormatFrameSize aNew(
pBox->GetFrameFormat()->GetFrameSize() );
tools::Long nLeft = rUnion.Left() - pCell->getFrameArea().Left();
nLeft = nLeft * aNew.GetWidth() /
pCell->getFrameArea().Width();
tools::Long nRight = pCell->getFrameArea().Right() - rUnion.Right();
nRight = nRight * aNew.GetWidth() /
pCell->getFrameArea().Width();
nWidth = aNew.GetWidth() - nLeft - nRight;
aNew.SetWidth( nLeft );
pBox->GetFrameFormat()->SetFormatAttr( aNew );
if( const SvxBoxItem* pItem = pBox->GetFrameFormat()->GetAttrSet()
.GetItemIfSet( RES_BOX, false ))
{
SvxBoxItem aBox( *pItem );
aBox.SetLine( nullptr, SvxBoxItemLine::RIGHT );
pBox->GetFrameFormat()->SetFormatAttr( aBox );
}
pBox = pBox->GetUpper()->GetTabBoxes()[ nInsPos ];
aNew.SetWidth( nWidth );
pBox->ClaimFrameFormat();
pBox->GetFrameFormat()->SetFormatAttr( aNew );
if( pUndo )
pUndo->AddNewBox( pBox->GetSttIdx() );
// this box is selected
pLastBox = pBox;
rBoxes.insert( pBox );
aPosArr.insert(
CmpLPt( aRectFnSet.GetPos(pCell->getFrameArea()),
pBox, aRectFnSet.IsVert() ) );
pBox = pBox->GetUpper()->GetTabBoxes()[ nInsPos+1 ];
aNew.SetWidth( nRight );
pBox->ClaimFrameFormat();
pBox->GetFrameFormat()->SetFormatAttr( aNew );
if( pUndo )
pUndo->AddNewBox( pBox->GetSttIdx() );
}
// is right side of box part of the selected area?
else if( ( pCell->getFrameArea().Right() - COLFUZZY ) < rUnion.Right() &&
( pCell->getFrameArea().Right() - COLFUZZY ) > rUnion.Left() &&
( pCell->getFrameArea().Left() + COLFUZZY ) < rUnion.Left() )
{
// then we should insert a new box and adjust the widths
sal_uInt16 nInsPos = pBox->GetUpper()->GetBoxPos( pBox )+1;
lcl_InsTableBox( pTableNd, pDoc, pBox, nInsPos );
SwFormatFrameSize aNew(pBox->GetFrameFormat()->GetFrameSize() );
tools::Long nLeft = rUnion.Left() - pCell->getFrameArea().Left(),
nRight = pCell->getFrameArea().Right() - rUnion.Left();
nLeft = nLeft * aNew.GetWidth() /
pCell->getFrameArea().Width();
nRight = nRight * aNew.GetWidth() /
pCell->getFrameArea().Width();
aNew.SetWidth( nLeft );
pBox->ClaimFrameFormat()->SetFormatAttr( aNew );
// this box is selected
pBox = pBox->GetUpper()->GetTabBoxes()[ nInsPos ];
aNew.SetWidth( nRight );
pBox->ClaimFrameFormat();
pBox->GetFrameFormat()->SetFormatAttr( aNew );
pLastBox = pBox;
rBoxes.insert( pBox );
aPosArr.insert( CmpLPt( Point( rUnion.Left(),
pCell->getFrameArea().Top()), pBox, aRectFnSet.IsVert() ));
if( pUndo )
pUndo->AddNewBox( pBox->GetSttIdx() );
}
}
if ( pCell->GetNext() )
{
pCell = static_cast<const SwLayoutFrame*>(pCell->GetNext());
// --> Check if table cell is not empty
if ( pCell->Lower() && pCell->Lower()->IsRowFrame() )
pCell = pCell->FirstCell();
}
else
pCell = ::lcl_FindNextCellFrame( pCell );
}
}
pRow = static_cast<const SwLayoutFrame*>(pRow->GetNext());
}
}
// no SSelection / no boxes found
if( 1 >= rBoxes.size() )
return;
// now search all horizontally adjacent boxes and connect
// their contents with blanks. All vertically adjacent will be tied
// together as paragraphs
// 1. Solution: map array and all on same Y-level
// are separated with blanks
// all others are separated with paragraphs
bool bCalcWidth = true;
const SwTableBox* pFirstBox = aPosArr[ 0 ].pSelBox;
// JP 27.03.98: Optimise - if boxes on one row are empty,
// then do not insert blanks or carriage returns
//Block to assure SwPaM, SwPosition are deleted from stack
{
SwPaM aPam( pDoc->GetNodes() );
#if defined( DEL_ONLY_EMPTY_LINES )
nWidth = pFirstBox->GetFrameFormat()->GetFrameSize().GetWidth();
bool bEmptyLine = sal_True;
sal_uInt16 n, nSttPos = 0;
for( n = 0; n < aPosArr.Count(); ++n )
{
const CmpLPt& rPt = aPosArr[ n ];
if( n && aPosArr[ n - 1 ].Y() == rPt.Y() ) // same Y level?
{
if( bEmptyLine && !IsEmptyBox( *rPt.pSelBox, aPam ))
bEmptyLine = sal_False;
if( bCalcWidth )
nWidth += rPt.pSelBox->GetFrameFormat()->GetFrameSize().GetWidth();
}
else
{
if( bCalcWidth && n )
bCalcWidth = false; // one line is ready
if( bEmptyLine && nSttPos < n )
{
// now complete line is empty and should not
// be filled with blanks and be inserted as paragraph
if( pUndo )
for( sal_uInt16 i = nSttPos; i < n; ++i )
pUndo->SaveCollection( *aPosArr[ i ].pSelBox );
aPosArr.Remove( nSttPos, n - nSttPos );
n = nSttPos;
}
else
nSttPos = n;
bEmptyLine = IsEmptyBox( *aPosArr[n].pSelBox, aPam );
}
}
if( bEmptyLine && nSttPos < n )
{
if( pUndo )
for( sal_uInt16 i = nSttPos; i < n; ++i )
pUndo->SaveCollection( *aPosArr[ i ].pSelBox );
aPosArr.Remove( nSttPos, n - nSttPos );
}
#elif defined( DEL_EMPTY_BOXES_AT_START_AND_END )
nWidth = pFirstBox->GetFrameFormat()->GetFrameSize().GetWidth();
sal_uInt16 n, nSttPos = 0, nSEndPos = 0, nESttPos = 0;
for( n = 0; n < aPosArr.Count(); ++n )
{
const CmpLPt& rPt = aPosArr[ n ];
if( n && aPosArr[ n - 1 ].Y() == rPt.Y() ) // same Y level?
{
bool bEmptyBox = IsEmptyBox( *rPt.pSelBox, aPam );
if( bEmptyBox )
{
if( nSEndPos == n ) // beginning is empty
nESttPos = ++nSEndPos;
}
else // end could be empty
nESttPos = n+1;
if( bCalcWidth )
nWidth += rPt.pSelBox->GetFrameFormat()->GetFrameSize().GetWidth();
}
else
{
if( bCalcWidth && n )
bCalcWidth = false; // one line ready
// first those at the beginning
if( nSttPos < nSEndPos )
{
// now the beginning of the line is empty and should
// not be filled with blanks
if( pUndo )
for( sal_uInt16 i = nSttPos; i < nSEndPos; ++i )
pUndo->SaveCollection( *aPosArr[ i ].pSelBox );
sal_uInt16 nCnt = nSEndPos - nSttPos;
aPosArr.Remove( nSttPos, nCnt );
nESttPos -= nCnt;
n -= nCnt;
}
if( nESttPos < n )
{
// now the beginning of the line is empty and should
// not be filled with blanks
if( pUndo )
for( sal_uInt16 i = nESttPos; i < n; ++i )
pUndo->SaveCollection( *aPosArr[ i ].pSelBox );
sal_uInt16 nCnt = n - nESttPos;
aPosArr.Remove( nESttPos, nCnt );
n -= nCnt;
}
nSttPos = nSEndPos = nESttPos = n;
if( IsEmptyBox( *aPosArr[n].pSelBox, aPam ))
++nSEndPos;
else
++nESttPos;
}
}
// first those at the beginning
if( nSttPos < nSEndPos )
{
// now the beginning of the line is empty and should
// not be filled with blanks
if( pUndo )
for( sal_uInt16 i = nSttPos; i < nSEndPos; ++i )
pUndo->SaveCollection( *aPosArr[ i ].pSelBox );
sal_uInt16 nCnt = nSEndPos - nSttPos;
aPosArr.Remove( nSttPos, nCnt );
nESttPos -= nCnt;
n -= nCnt;
}
if( nESttPos < n )
{
// now the beginning of the line is empty and should
// not be filled with blanks
if( pUndo )
for( sal_uInt16 i = nESttPos; i < n; ++i )
pUndo->SaveCollection( *aPosArr[ i ].pSelBox );
sal_uInt16 nCnt = n - nESttPos;
aPosArr.Remove( nESttPos, nCnt );
}
#else
// DEL_ALL_EMPTY_BOXES
nWidth = 0;
tools::Long nY = !aPosArr.empty() ?
( aRectFnSet.IsVert() ?
aPosArr[ 0 ].X() :
aPosArr[ 0 ].Y() ) :
0;
for( MergePos::size_type n = 0; n < aPosArr.size(); ++n )
{
const CmpLPt& rPt = aPosArr[ n ];
if( bCalcWidth )
{
if( nY == ( aRectFnSet.IsVert() ? rPt.X() : rPt.Y() ) ) // same Y level?
nWidth += rPt.pSelBox->GetFrameFormat()->GetFrameSize().GetWidth();
else
bCalcWidth = false; // one line ready
}
if( IsEmptyBox( *rPt.pSelBox, aPam ) )
{
if( pUndo )
pUndo->SaveCollection( *rPt.pSelBox );
aPosArr.erase( aPosArr.begin() + n );
--n;
}
}
#endif
}
// first create new box
{
SwTableBox* pTmpBox = rBoxes[0];
SwTableLine* pInsLine = pTmpBox->GetUpper();
sal_uInt16 nInsPos = pInsLine->GetBoxPos( pTmpBox );
lcl_InsTableBox( pTableNd, pDoc, pTmpBox, nInsPos );
(*ppMergeBox) = pInsLine->GetTabBoxes()[ nInsPos ];
pInsLine->GetTabBoxes().erase( pInsLine->GetTabBoxes().begin() + nInsPos ); // remove again
(*ppMergeBox)->SetUpper( nullptr );
(*ppMergeBox)->ClaimFrameFormat();
// define the border: the upper/left side of the first box,
// the lower/right side of the last box:
if( pLastBox && pFirstBox )
{
SvxBoxItem aBox( pFirstBox->GetFrameFormat()->GetBox() );
const SvxBoxItem& rBox = pLastBox->GetFrameFormat()->GetBox();
aBox.SetLine( rBox.GetRight(), SvxBoxItemLine::RIGHT );
aBox.SetLine( rBox.GetBottom(), SvxBoxItemLine::BOTTOM );
if( aBox.GetLeft() || aBox.GetTop() ||
aBox.GetRight() || aBox.GetBottom() )
(*ppMergeBox)->GetFrameFormat()->SetFormatAttr( aBox );
}
}
//Block to delete SwPaM, SwPosition from stack
if( !aPosArr.empty() )
{
SwPosition aInsPos( *(*ppMergeBox)->GetSttNd() );
SwPaM aPam( aInsPos );
for( const auto &rPt : aPosArr )
{
aPam.GetPoint()->Assign( *rPt.pSelBox->GetSttNd()->
EndOfSectionNode(), SwNodeOffset(-1) );
SwContentNode* pCNd = aPam.GetPointContentNode();
if( pCNd )
aPam.GetPoint()->SetContent( pCNd->Len() );
SwNodeIndex aSttNdIdx( *rPt.pSelBox->GetSttNd(), 1 );
// one node should be kept in the box (otherwise the
// section would be deleted during a move)
bool const bUndo(pDoc->GetIDocumentUndoRedo().DoesUndo());
if( pUndo )
{
pDoc->GetIDocumentUndoRedo().DoUndo(false);
}
pDoc->getIDocumentContentOperations().AppendTextNode( *aPam.GetPoint() );
if( pUndo )
{
pDoc->GetIDocumentUndoRedo().DoUndo(bUndo);
}
SwNodeRange aRg( aSttNdIdx.GetNode(), aPam.GetPoint()->GetNode() );
aInsPos.Adjust(SwNodeOffset(1));
if( pUndo )
pUndo->MoveBoxContent( *pDoc, aRg, aInsPos.GetNode() );
else
{
pDoc->getIDocumentContentOperations().MoveNodeRange( aRg, aInsPos.GetNode(),
SwMoveFlags::DEFAULT );
}
// where is now aInsPos ??
if( bCalcWidth )
bCalcWidth = false; // one line is ready
// skip the first TextNode
aInsPos.Assign( *pDoc->GetNodes()[ aInsPos.GetNode().EndOfSectionIndex() - 2] );
SwTextNode* pTextNd = aInsPos.GetNode().GetTextNode();
if( pTextNd )
aInsPos.SetContent( pTextNd->GetText().getLength());
}
// the MergeBox should contain the complete text
// now erase the initial TextNode
OSL_ENSURE( (*ppMergeBox)->GetSttIdx()+2 <
(*ppMergeBox)->GetSttNd()->EndOfSectionIndex(),
"empty box" );
SwNodeIndex aIdx( *(*ppMergeBox)->GetSttNd()->EndOfSectionNode(), -1 );
pDoc->GetNodes().Delete( aIdx );
}
// set width of the box
(*ppMergeBox)->GetFrameFormat()->SetFormatAttr( SwFormatFrameSize( SwFrameSize::Variable, nWidth, 0 ));
if( pUndo )
pUndo->AddNewBox( (*ppMergeBox)->GetSttIdx() );
}
static bool lcl_CheckCol(FndBox_ const&, bool* pPara);
static bool lcl_CheckRow( const FndLine_& rFndLine, bool* pPara )
{
for (auto const& it : rFndLine.GetBoxes())
{
lcl_CheckCol(*it, pPara);
}
return *pPara;
}
static bool lcl_CheckCol( FndBox_ const& rFndBox, bool* pPara )
{
if (!rFndBox.GetBox()->GetSttNd())
{
if (rFndBox.GetLines().size() !=
rFndBox.GetBox()->GetTabLines().size())
{
*pPara = false;
}
else
{
for (auto const& rpFndLine : rFndBox.GetLines())
{
lcl_CheckRow( *rpFndLine, pPara );
}
}
}
// is box protected ??
else if (rFndBox.GetBox()->GetFrameFormat()->GetProtect().IsContentProtected())
*pPara = false;
return *pPara;
}
TableMergeErr CheckMergeSel( const SwPaM& rPam )
{
SwSelBoxes aBoxes;
//JP 24.09.96: Merge with repeating TableHeadLines does not work properly.
// Why not use point 0,0? Then it is assured the first
// headline is contained.
Point aPt;
const SwContentNode* pCntNd = rPam.GetPointContentNode();
std::pair<Point, bool> tmp(aPt, true);
const SwLayoutFrame *const pStart = pCntNd->getLayoutFrame(
pCntNd->GetDoc().getIDocumentLayoutAccess().GetCurrentLayout(),
nullptr, &tmp)->GetUpper();
pCntNd = rPam.GetMarkContentNode();
const SwLayoutFrame *const pEnd = pCntNd->getLayoutFrame(
pCntNd->GetDoc().getIDocumentLayoutAccess().GetCurrentLayout(),
nullptr, &tmp)->GetUpper();
GetTableSel( pStart, pEnd, aBoxes, nullptr );
return CheckMergeSel( aBoxes );
}
TableMergeErr CheckMergeSel( const SwSelBoxes& rBoxes )
{
TableMergeErr eRet = TableMergeErr::NoSelection;
if( !rBoxes.empty() )
{
eRet = TableMergeErr::Ok;
FndBox_ aFndBox( nullptr, nullptr );
FndPara aPara( rBoxes, &aFndBox );
const SwTableNode* pTableNd = aPara.rBoxes[0]->GetSttNd()->FindTableNode();
ForEach_FndLineCopyCol( const_cast<SwTableLines&>(pTableNd->GetTable().GetTabLines()), &aPara );
if( !aFndBox.GetLines().empty() )
{
bool bMergeSelOk = true;
FndBox_* pFndBox = &aFndBox;
FndLine_* pFndLine = nullptr;
while( pFndBox && 1 == pFndBox->GetLines().size() )
{
pFndLine = pFndBox->GetLines().front().get();
if( 1 == pFndLine->GetBoxes().size() )
pFndBox = pFndLine->GetBoxes().front().get();
else
pFndBox = nullptr;
}
if( pFndBox )
{
for (auto const& it : pFndBox->GetLines())
{
lcl_CheckRow(*it, &bMergeSelOk);
}
}
else if( pFndLine )
{
for (auto const& it : pFndLine->GetBoxes())
{
lcl_CheckCol(*it, &bMergeSelOk);
}
}
if( !bMergeSelOk )
eRet = TableMergeErr::TooComplex;
}
else
eRet = TableMergeErr::NoSelection;
}
return eRet;
}
static SwTwips lcl_CalcWish( const SwLayoutFrame *pCell, tools::Long nWish,
const tools::Long nAct )
{
const SwLayoutFrame *pTmp = pCell;
if ( !nWish )
nWish = 1;
const bool bRTL = pCell->IsRightToLeft();
SwTwips nRet = bRTL ?
nAct - pCell->getFrameArea().Width() :
0;
while ( pTmp )
{
while ( pTmp->GetPrev() )
{
pTmp = static_cast<const SwLayoutFrame*>(pTmp->GetPrev());
sal_Int64 nTmp = pTmp->GetFormat()->GetFrameSize().GetWidth();
// multiply in 64-bit to avoid overflow here!
nRet += ( bRTL ? -1 : 1 ) * nTmp * nAct / nWish;
}
pTmp = pTmp->GetUpper()->GetUpper();
if ( pTmp && !pTmp->IsCellFrame() )
pTmp = nullptr;
}
return nRet;
}
static void lcl_FindStartEndRow( const SwLayoutFrame *&rpStart,
const SwLayoutFrame *&rpEnd,
const bool bChkProtected )
{
// Put Start at beginning of a row.
// Put End at the end of its row.
rpStart = static_cast<const SwLayoutFrame*>(rpStart->GetUpper()->Lower());
while ( rpEnd->GetNext() )
rpEnd = static_cast<const SwLayoutFrame*>(rpEnd->GetNext());
std::deque<const SwLayoutFrame *> aSttArr, aEndArr;
const SwLayoutFrame *pTmp;
for( pTmp = rpStart; (SwFrameType::Cell|SwFrameType::Row) & pTmp->GetType();
pTmp = pTmp->GetUpper() )
{
aSttArr.push_front( pTmp );
}
for( pTmp = rpEnd; (SwFrameType::Cell|SwFrameType::Row) & pTmp->GetType();
pTmp = pTmp->GetUpper() )
{
aEndArr.push_front( pTmp );
}
for( std::deque<const SwLayoutFrame *>::size_type n = 0; n < aEndArr.size() && n < aSttArr.size(); ++n )
if( aSttArr[ n ] != aEndArr[ n ] )
{
// first unequal line or box - all odds are
if( n & 1 ) // 1, 3, 5, ... are boxes
{
rpStart = aSttArr[ n ];
rpEnd = aEndArr[ n ];
}
else // 0, 2, 4, ... are lines
{
// check if start & end line are the first & last Line of the
// box. If not return these cells.
// Else the whole line with all Boxes has to be deleted.
rpStart = aSttArr[ n+1 ];
rpEnd = aEndArr[ n+1 ];
if( n )
{
const SwCellFrame* pCellFrame = static_cast<const SwCellFrame*>(aSttArr[ n-1 ]);
const SwTableLines& rLns = pCellFrame->
GetTabBox()->GetTabLines();
if( rLns[ 0 ] == static_cast<const SwRowFrame*>(aSttArr[ n ])->GetTabLine() &&
rLns[ rLns.size() - 1 ] ==
static_cast<const SwRowFrame*>(aEndArr[ n ])->GetTabLine() )
{
rpStart = rpEnd = pCellFrame;
while ( rpStart->GetPrev() )
rpStart = static_cast<const SwLayoutFrame*>(rpStart->GetPrev());
while ( rpEnd->GetNext() )
rpEnd = static_cast<const SwLayoutFrame*>(rpEnd->GetNext());
}
}
}
break;
}
if( !bChkProtected ) // protected cell ?
return;
// Beginning and end should not be in protected cells
while ( rpStart->GetFormat()->GetProtect().IsContentProtected() )
rpStart = static_cast<const SwLayoutFrame*>(rpStart->GetNext());
while ( rpEnd->GetFormat()->GetProtect().IsContentProtected() )
rpEnd = static_cast<const SwLayoutFrame*>(rpEnd->GetPrev());
}
static void lcl_FindStartEndCol( const SwLayoutFrame *&rpStart,
const SwLayoutFrame *&rpEnd,
const bool bChkProtected )
{
// Beginning and end vertical till the border of the table;
// Consider the whole table, including master and follows.
// In order to start we need the mother-tableFrame
if( !rpStart )
return;
const SwTabFrame *pOrg = rpStart->FindTabFrame();
const SwTabFrame *pTab = pOrg;
SwRectFnSet aRectFnSet(pTab);
bool bRTL = pTab->IsRightToLeft();
const tools::Long nTmpWish = pOrg->GetFormat()->GetFrameSize().GetWidth();
const tools::Long nWish = ( nTmpWish > 0 ) ? nTmpWish : 1;
while ( pTab->IsFollow() )
{
const SwFrame *pTmp = pTab->FindPrev();
OSL_ENSURE( pTmp->IsTabFrame(), "Predecessor of Follow is not Master." );
pTab = static_cast<const SwTabFrame*>(pTmp);
}
SwTwips nSX = 0;
SwTwips nSX2 = 0;
if ( pTab->GetTable()->IsNewModel() )
{
nSX = aRectFnSet.GetLeft(rpStart->getFrameArea());
nSX2 = aRectFnSet.GetRight(rpStart->getFrameArea());
}
else
{
const SwTwips nPrtWidth = aRectFnSet.GetWidth(pTab->getFramePrintArea());
nSX = ::lcl_CalcWish( rpStart, nWish, nPrtWidth ) + aRectFnSet.GetPrtLeft(*pTab);
nSX2 = nSX + (rpStart->GetFormat()->GetFrameSize().GetWidth() * nPrtWidth / nWish);
}
const SwLayoutFrame *pTmp = pTab->FirstCell();
while ( pTmp &&
(!pTmp->IsCellFrame() ||
( ( ! bRTL && aRectFnSet.GetLeft(pTmp->getFrameArea()) < nSX &&
aRectFnSet.GetRight(pTmp->getFrameArea())< nSX2 ) ||
( bRTL && aRectFnSet.GetLeft(pTmp->getFrameArea()) > nSX &&
aRectFnSet.GetRight(pTmp->getFrameArea())> nSX2 ) ) ) )
pTmp = pTmp->GetNextLayoutLeaf();
if ( pTmp )
rpStart = pTmp;
pTab = pOrg;
const SwTabFrame* pLastValidTab = pTab;
while ( pTab->GetFollow() )
{
// Check if pTab->GetFollow() is a valid follow table:
// Only follow tables with at least on non-FollowFlowLine
// should be considered.
if ( pTab->HasFollowFlowLine() )
{
pTab = pTab->GetFollow();
const SwFrame* pTmpRow = pTab->GetFirstNonHeadlineRow();
if ( pTmpRow && pTmpRow->GetNext() )
pLastValidTab = pTab;
}
else
pLastValidTab = pTab = pTab->GetFollow();
}
pTab = pLastValidTab;
SwTwips nEX = 0;
if ( pTab->GetTable()->IsNewModel() )
{
nEX = aRectFnSet.GetLeft(rpEnd->getFrameArea());
}
else
{
const SwTwips nPrtWidth = aRectFnSet.GetWidth(pTab->getFramePrintArea());
nEX = ::lcl_CalcWish( rpEnd, nWish, nPrtWidth ) + aRectFnSet.GetPrtLeft(*pTab);
}
SwFrame const*const pLastContent = pTab->FindLastContentOrTable();
rpEnd = pLastContent ? pLastContent->GetUpper() : nullptr;
// --> Made code robust. If pTab does not have a lower,
// we would crash here.
if ( !pLastContent ) return;
while( !rpEnd->IsCellFrame() )
rpEnd = rpEnd->GetUpper();
while ( ( bRTL && aRectFnSet.GetLeft(rpEnd->getFrameArea()) < nEX ) ||
( ! bRTL && aRectFnSet.GetLeft(rpEnd->getFrameArea()) > nEX ) )
{
const SwLayoutFrame* pTmpLeaf = rpEnd->GetPrevLayoutLeaf();
if( !pTmpLeaf || !pTab->IsAnLower( pTmpLeaf ) )
break;
rpEnd = pTmpLeaf;
}
if( !bChkProtected ) // check for protected cell ?
return;
// Beginning and end should not be in protected cells.
// If necessary we should search backwards again
while ( rpStart->GetFormat()->GetProtect().IsContentProtected() )
{
const SwLayoutFrame *pTmpLeaf = rpStart->GetNextLayoutLeaf();
while ( pTmpLeaf && aRectFnSet.GetLeft(pTmpLeaf->getFrameArea()) > nEX ) // first skip line
pTmpLeaf = pTmpLeaf->GetNextLayoutLeaf();
while ( pTmpLeaf && aRectFnSet.GetLeft(pTmpLeaf->getFrameArea()) < nSX &&
aRectFnSet.GetRight(pTmpLeaf->getFrameArea())< nSX2 )
pTmpLeaf = pTmpLeaf->GetNextLayoutLeaf();
const SwTabFrame *pTmpTab = rpStart->FindTabFrame();
if ( !pTmpTab->IsAnLower( pTmpLeaf ) )
{
pTmpTab = pTmpTab->GetFollow();
rpStart = pTmpTab->FirstCell();
while ( rpStart &&
aRectFnSet.GetLeft(rpStart->getFrameArea()) < nSX &&
aRectFnSet.GetRight(rpStart->getFrameArea())< nSX2 )
rpStart = rpStart->GetNextLayoutLeaf();
}
else
rpStart = pTmpLeaf;
}
while ( rpEnd->GetFormat()->GetProtect().IsContentProtected() )
{
const SwLayoutFrame *pTmpLeaf = rpEnd->GetPrevLayoutLeaf();
while ( pTmpLeaf && aRectFnSet.GetLeft(pTmpLeaf->getFrameArea()) < nEX ) // skip the line for now
pTmpLeaf = pTmpLeaf->GetPrevLayoutLeaf();
while ( pTmpLeaf && aRectFnSet.GetLeft(pTmpLeaf->getFrameArea()) > nEX )
pTmpLeaf = pTmpLeaf->GetPrevLayoutLeaf();
const SwTabFrame *pTmpTab = rpEnd->FindTabFrame();
if ( !pTmpLeaf || !pTmpTab->IsAnLower( pTmpLeaf ) )
{
pTmpTab = static_cast<const SwTabFrame*>(pTmpTab->FindPrev());
OSL_ENSURE( pTmpTab->IsTabFrame(), "Predecessor of Follow not Master.");
rpEnd = pTmpTab->FindLastContentOrTable()->GetUpper();
while( !rpEnd->IsCellFrame() )
rpEnd = rpEnd->GetUpper();
while ( aRectFnSet.GetLeft(rpEnd->getFrameArea()) > nEX )
rpEnd = rpEnd->GetPrevLayoutLeaf();
}
else
rpEnd = pTmpLeaf;
}
}
void MakeSelUnions( SwSelUnions& rUnions, const SwLayoutFrame *pStart,
const SwLayoutFrame *pEnd, const SwTableSearchType eSearchType )
{
while ( pStart && !pStart->IsCellFrame() )
pStart = pStart->GetUpper();
while ( pEnd && !pEnd->IsCellFrame() )
pEnd = pEnd->GetUpper();
if ( !pStart || !pEnd )
{
OSL_FAIL( "MakeSelUnions with pStart or pEnd not in CellFrame" );
return;
}
const SwTabFrame *pTable = pStart->FindTabFrame();
const SwTabFrame *pEndTable = pEnd->FindTabFrame();
if( !pTable || !pEndTable )
return;
bool bExchange = false;
if ( pTable != pEndTable )
{
if ( !pTable->IsAnFollow( pEndTable ) )
{
OSL_ENSURE( pEndTable->IsAnFollow( pTable ), "Tabchain in knots." );
bExchange = true;
}
}
else
{
SwRectFnSet aRectFnSet(pTable);
tools::Long nSttTop = aRectFnSet.GetTop(pStart->getFrameArea());
tools::Long nEndTop = aRectFnSet.GetTop(pEnd->getFrameArea());
if( nSttTop == nEndTop )
{
if( aRectFnSet.GetLeft(pStart->getFrameArea()) >
aRectFnSet.GetLeft(pEnd->getFrameArea()) )
bExchange = true;
}
else if( aRectFnSet.IsVert() == ( nSttTop < nEndTop ) )
bExchange = true;
}
if ( bExchange )
{
const SwLayoutFrame *pTmp = pStart;
pStart = pEnd;
pEnd = pTmp;
// do no resort pTable and pEndTable, set new below
// MA: 28. Dec. 93 Bug: 5190
}
// Beginning and end now nicely sorted, if required we
// should move them
if( SwTableSearchType::Row == ((~SwTableSearchType::Protect ) & eSearchType ) )
::lcl_FindStartEndRow( pStart, pEnd, bool(SwTableSearchType::Protect & eSearchType) );
else if( SwTableSearchType::Col == ((~SwTableSearchType::Protect ) & eSearchType ) )
::lcl_FindStartEndCol( pStart, pEnd, bool(SwTableSearchType::Protect & eSearchType) );
if ( !pEnd || !pStart ) return; // Made code robust.
// retrieve again, as they have been moved
pTable = pStart->FindTabFrame();
pEndTable = pEnd->FindTabFrame();
const tools::Long nStSz = pStart->GetFormat()->GetFrameSize().GetWidth();
const tools::Long nEdSz = pEnd->GetFormat()->GetFrameSize().GetWidth();
const tools::Long nWish = std::max( tools::Long(1), pTable->GetFormat()->GetFrameSize().GetWidth() );
while ( pTable )
{
SwRectFnSet aRectFnSet(pTable);
const tools::Long nOfst = aRectFnSet.GetPrtLeft(*pTable);
const tools::Long nPrtWidth = aRectFnSet.GetWidth(pTable->getFramePrintArea());
tools::Long nSt1 = ::lcl_CalcWish( pStart, nWish, nPrtWidth ) + nOfst;
tools::Long nEd1 = ::lcl_CalcWish( pEnd, nWish, nPrtWidth ) + nOfst;
if ( nSt1 <= nEd1 )
nEd1 += static_cast<tools::Long>((nEdSz * nPrtWidth) / nWish) - 1;
else
nSt1 += static_cast<tools::Long>((nStSz * nPrtWidth) / nWish) - 1;
tools::Long nSt2;
tools::Long nEd2;
if( pTable->IsAnLower( pStart ) )
nSt2 = aRectFnSet.GetTop(pStart->getFrameArea());
else
nSt2 = aRectFnSet.GetTop(pTable->getFrameArea());
if( pTable->IsAnLower( pEnd ) )
nEd2 = aRectFnSet.GetBottom(pEnd->getFrameArea());
else
nEd2 = aRectFnSet.GetBottom(pTable->getFrameArea());
Point aSt, aEd;
if( nSt1 > nEd1 )
std::swap( nSt1, nEd1 );
if( nSt2 > nEd2 )
std::swap( nSt2, nEd2 );
if( aRectFnSet.IsVert() )
{
aSt = Point( nSt2, nSt1 );
aEd = Point( nEd2, nEd1 );
}
else
{
aSt = Point( nSt1, nSt2 );
aEd = Point( nEd1, nEd2 );
}
const Point aDiff( aEd - aSt );
SwRect aUnion( aSt, Size( aDiff.X(), aDiff.Y() ) );
aUnion.Justify();
if( !(SwTableSearchType::NoUnionCorrect & eSearchType ))
{
// Unfortunately the union contains rounding errors now, therefore
// erroneous results could occur during split/merge.
// To prevent these we will determine the first and last row
// within the union and use their values for a new union
const SwLayoutFrame* pRow = pTable->IsFollow() ?
pTable->GetFirstNonHeadlineRow() :
static_cast<const SwLayoutFrame*>(pTable->Lower());
while ( pRow && !pRow->getFrameArea().Overlaps( aUnion ) )
pRow = static_cast<const SwLayoutFrame*>(pRow->GetNext());
// #i31976#
// A follow flow row may contain empty cells. These are not
// considered by FirstCell(). Therefore we have to find
// the first cell manually:
const SwFrame* pTmpCell = nullptr;
if ( pTable->IsFollow() && pRow && pRow->IsInFollowFlowRow() )
{
const SwFrame* pTmpRow = pRow;
while ( pTmpRow && pTmpRow->IsRowFrame() )
{
pTmpCell = static_cast<const SwRowFrame*>(pTmpRow)->Lower();
pTmpRow = static_cast<const SwCellFrame*>(pTmpCell)->Lower();
}
OSL_ENSURE( !pTmpCell || pTmpCell->IsCellFrame(), "Lower of rowframe != cellframe?!" );
}
const SwLayoutFrame* pFirst = pTmpCell ?
static_cast<const SwLayoutFrame*>(pTmpCell) :
pRow ?
pRow->FirstCell() :
nullptr;
while ( pFirst && !::IsFrameInTableSel( aUnion, pFirst ) )
{
if ( pFirst->GetNext() )
{
pFirst = static_cast<const SwLayoutFrame*>(pFirst->GetNext());
if ( pFirst->Lower() && pFirst->Lower()->IsRowFrame() )
pFirst = pFirst->FirstCell();
}
else
pFirst = ::lcl_FindNextCellFrame( pFirst );
}
const SwLayoutFrame* pLast = nullptr;
SwFrame const*const pLastContent = pTable->FindLastContentOrTable();
if ( pLastContent )
pLast = ::lcl_FindCellFrame( pLastContent->GetUpper() );
while ( pLast && !::IsFrameInTableSel( aUnion, pLast ) )
pLast = ::lcl_FindCellFrame( pLast->GetPrevLayoutLeaf() );
if ( pFirst && pLast ) //Robust
{
aUnion = pFirst->getFrameArea();
aUnion.Union( pLast->getFrameArea() );
}
else
aUnion.Width( 0 );
}
if( aRectFnSet.GetWidth(aUnion) )
{
rUnions.emplace_back(aUnion, const_cast<SwTabFrame*>(pTable));
}
pTable = pTable->GetFollow();
if ( pTable != pEndTable && pEndTable->IsAnFollow( pTable ) )
pTable = nullptr;
}
}
bool CheckSplitCells( const SwCursorShell& rShell, sal_uInt16 nDiv,
const SwTableSearchType eSearchType )
{
if( !rShell.IsTableMode() )
rShell.GetCursor();
return CheckSplitCells( *rShell.getShellCursor(false), nDiv, eSearchType );
}
bool CheckSplitCells( const SwCursor& rCursor, sal_uInt16 nDiv,
const SwTableSearchType eSearchType )
{
if( 1 >= nDiv )
return false;
sal_uInt16 nMinValue = nDiv * MINLAY;
// Get start and end cell
Point aPtPos, aMkPos;
const SwShellCursor* pShCursor = dynamic_cast<const SwShellCursor*>(&rCursor);
if( pShCursor )
{
aPtPos = pShCursor->GetPtPos();
aMkPos = pShCursor->GetMkPos();
}
const SwContentNode* pCntNd = rCursor.GetPointContentNode();
std::pair<Point, bool> tmp(aPtPos, true);
const SwLayoutFrame *const pStart = pCntNd->getLayoutFrame(
pCntNd->GetDoc().getIDocumentLayoutAccess().GetCurrentLayout(),
nullptr, &tmp)->GetUpper();
pCntNd = rCursor.GetMarkContentNode();
tmp.first = aMkPos;
const SwLayoutFrame *const pEnd = pCntNd->getLayoutFrame(
pCntNd->GetDoc().getIDocumentLayoutAccess().GetCurrentLayout(),
nullptr, &tmp)->GetUpper();
SwRectFnSet aRectFnSet(pStart->GetUpper());
// First, compute tables and rectangles
SwSelUnions aUnions;
::MakeSelUnions( aUnions, pStart, pEnd, eSearchType );
// now search boxes for each entry and emit
for ( const auto& rSelUnion : aUnions )
{
const SwTabFrame *pTable = rSelUnion.GetTable();
// Skip any repeated headlines in the follow:
const SwLayoutFrame* pRow = pTable->IsFollow() ?
pTable->GetFirstNonHeadlineRow() :
static_cast<const SwLayoutFrame*>(pTable->Lower());
while ( pRow )
{
if ( pRow->getFrameArea().Overlaps( rSelUnion.GetUnion() ) )
{
const SwLayoutFrame *pCell = pRow->FirstCell();
while ( pCell && pRow->IsAnLower( pCell ) )
{
OSL_ENSURE( pCell->IsCellFrame(), "Frame without cell" );
if( ::IsFrameInTableSel( rSelUnion.GetUnion(), pCell ) )
{
if( aRectFnSet.GetWidth(pCell->getFrameArea()) < nMinValue )
return false;
}
if ( pCell->GetNext() )
{
pCell = static_cast<const SwLayoutFrame*>(pCell->GetNext());
if ( pCell->Lower() && pCell->Lower()->IsRowFrame() )
pCell = pCell->FirstCell();
}
else
pCell = ::lcl_FindNextCellFrame( pCell );
}
}
pRow = static_cast<const SwLayoutFrame*>(pRow->GetNext());
}
}
return true;
}
// These Classes copy the current table selections (rBoxes),
// into a new structure, retaining the table structure
// new: SS for targeted erasing/restoring of the layout
static void lcl_InsertRow( SwTableLine const &rLine, SwLayoutFrame *pUpper, SwFrame *pSibling )
{
SwRowFrame *pRow = new SwRowFrame( rLine, pUpper );
if ( pUpper->IsTabFrame() && static_cast<SwTabFrame*>(pUpper)->IsFollow() )
{
SwTabFrame* pTabFrame = static_cast<SwTabFrame*>(pUpper);
pTabFrame->FindMaster()->InvalidatePos(); //can absorb the line
if ( pSibling && pTabFrame->IsInHeadline( *pSibling ) )
{
// Skip any repeated headlines in the follow:
pSibling = pTabFrame->GetFirstNonHeadlineRow();
}
}
pRow->Paste( pUpper, pSibling );
pRow->RegistFlys();
}
static void FndBoxCopyCol( SwTableBox* pBox, FndPara* pFndPara )
{
std::unique_ptr<FndBox_> pFndBox(new FndBox_( pBox, pFndPara->pFndLine ));
if( !pBox->GetTabLines().empty() )
{
FndPara aPara( *pFndPara, pFndBox.get() );
ForEach_FndLineCopyCol( pFndBox->GetBox()->GetTabLines(), &aPara );
if( pFndBox->GetLines().empty() )
{
return;
}
}
else
{
if( pFndPara->rBoxes.find( pBox ) == pFndPara->rBoxes.end())
{
return;
}
}
pFndPara->pFndLine->GetBoxes().push_back( std::move(pFndBox) );
}
static void FndLineCopyCol( SwTableLine* pLine, FndPara* pFndPara )
{
std::unique_ptr<FndLine_> pFndLine(new FndLine_(pLine, pFndPara->pFndBox));
FndPara aPara(*pFndPara, pFndLine.get());
for( auto& rpBox : pFndLine->GetLine()->GetTabBoxes() )
FndBoxCopyCol(rpBox, &aPara );
if( !pFndLine->GetBoxes().empty() )
{
pFndPara->pFndBox->GetLines().push_back( std::move(pFndLine) );
}
}
void ForEach_FndLineCopyCol(SwTableLines& rLines, FndPara* pFndPara )
{
for( SwTableLines::iterator it = rLines.begin(); it != rLines.end(); ++it )
FndLineCopyCol( *it, pFndPara );
}
void FndBox_::SetTableLines( const SwSelBoxes &rBoxes, const SwTable &rTable )
{
// Set pointers to lines before and after the area to process.
// If the first/last lines are contained in the area, then the pointers
// are 0. We first search for the positions of the first/last affected
// lines in array of the SwTable. In order to use 0 for 'no line'
// we adjust the positions by 1.
sal_uInt16 nStPos = USHRT_MAX;
sal_uInt16 nEndPos= 0;
for (size_t i = 0; i < rBoxes.size(); ++i)
{
SwTableLine *pLine = rBoxes[i]->GetUpper();
while ( pLine->GetUpper() )
pLine = pLine->GetUpper()->GetUpper();
const sal_uInt16 nPos = rTable.GetTabLines().GetPos(
const_cast<const SwTableLine*&>(pLine) ) + 1;
OSL_ENSURE( nPos != USHRT_MAX, "TableLine not found." );
if( nStPos > nPos )
nStPos = nPos;
if( nEndPos < nPos )
nEndPos = nPos;
}
if (USHRT_MAX != nStPos && nStPos > 1)
m_pLineBefore = rTable.GetTabLines()[nStPos - 2];
if ( nEndPos < rTable.GetTabLines().size() )
m_pLineBehind = rTable.GetTabLines()[nEndPos];
}
void FndBox_::SetTableLines( const SwTable &rTable )
{
// Set pointers to lines before and after the area to process.
// If the first/last lines are contained in the area, then the pointers
// are 0. The positions of the first/last affected lines in the array
// of the SwTable are in FndBox. In order to use 0 for 'no line'
// we adjust the positions by 1.
if( GetLines().empty() )
return;
SwTableLine* pTmpLine = GetLines().front()->GetLine();
sal_uInt16 nPos = rTable.GetTabLines().GetPos( pTmpLine );
OSL_ENSURE( USHRT_MAX != nPos, "Line is not in table" );
if( nPos )
m_pLineBefore = rTable.GetTabLines()[ nPos - 1 ];
pTmpLine = GetLines().back()->GetLine();
nPos = rTable.GetTabLines().GetPos( pTmpLine );
OSL_ENSURE( USHRT_MAX != nPos, "Line is not in the table" );
if( ++nPos < rTable.GetTabLines().size() )
m_pLineBehind = rTable.GetTabLines()[nPos];
}
inline void UnsetFollow( SwFlowFrame *pTab )
{
pTab->m_pPrecede = nullptr;
}
void FndBox_::DelFrames( SwTable &rTable )
{
// All lines between pLineBefore and pLineBehind should be cut
// from the layout and erased.
// If this creates empty Follows we should destroy these.
// If a master is destroyed, the follow should become master.
// Always a TabFrame should remain.
sal_uInt16 nStPos = 0;
sal_uInt16 nEndPos= rTable.GetTabLines().size() - 1;
if( rTable.IsNewModel() && m_pLineBefore )
rTable.CheckRowSpan( m_pLineBefore, true );
if ( m_pLineBefore )
{
nStPos = rTable.GetTabLines().GetPos(
const_cast<const SwTableLine*&>(m_pLineBefore) );
OSL_ENSURE( nStPos != USHRT_MAX, "The fox stole the line!" );
++nStPos;
}
if( rTable.IsNewModel() && m_pLineBehind )
rTable.CheckRowSpan( m_pLineBehind, false );
if ( m_pLineBehind )
{
nEndPos = rTable.GetTabLines().GetPos(
const_cast<const SwTableLine*&>(m_pLineBehind) );
OSL_ENSURE( nEndPos != USHRT_MAX, "The fox stole the line!" );
if (nEndPos != 0)
--nEndPos;
}
for ( sal_uInt16 i = nStPos; i <= nEndPos; ++i)
{
SwFrameFormat *pFormat = rTable.GetTabLines()[i]->GetFrameFormat();
SwIterator<SwRowFrame,SwFormat> aIter( *pFormat );
for ( SwRowFrame* pFrame = aIter.First(); pFrame; pFrame = aIter.Next() )
{
if ( pFrame->GetTabLine() == rTable.GetTabLines()[i] )
{
bool bDel = true;
SwTabFrame *pUp = !pFrame->GetPrev() && !pFrame->GetNext() ?
static_cast<SwTabFrame*>(pFrame->GetUpper()) : nullptr;
if ( !pUp )
{
const sal_uInt16 nRepeat =
static_cast<SwTabFrame*>(pFrame->GetUpper())->GetTable()->GetRowsToRepeat();
if ( nRepeat > 0 &&
static_cast<SwTabFrame*>(pFrame->GetUpper())->IsFollow() )
{
if ( !pFrame->GetNext() )
{
SwRowFrame* pFirstNonHeadline =
static_cast<SwTabFrame*>(pFrame->GetUpper())->GetFirstNonHeadlineRow();
if ( pFirstNonHeadline == pFrame )
{
pUp = static_cast<SwTabFrame*>(pFrame->GetUpper());
}
}
}
}
if ( pUp )
{
SwTabFrame *pFollow = pUp->GetFollow();
SwTabFrame *pPrev = pUp->IsFollow() ? pUp : nullptr;
if ( pPrev )
{
SwFrame *pTmp = pPrev->FindPrev();
OSL_ENSURE( pTmp->IsTabFrame(),
"Predecessor of Follow is no Master.");
pPrev = static_cast<SwTabFrame*>(pTmp);
}
if ( pPrev )
{
pPrev->SetFollow( pFollow );
// #i60340# Do not transfer the
// flag from pUp to pPrev. pUp may still have the
// flag set although there is not more follow flow
// line associated with pUp.
pPrev->SetFollowFlowLine( false );
}
else if ( pFollow )
::UnsetFollow( pFollow );
// A TableFrame should always remain!
if ( pPrev || pFollow )
{
// OD 26.08.2003 #i18103# - if table is in a section,
// lock the section, to avoid its delete.
{
SwSectionFrame* pSctFrame = pUp->FindSctFrame();
bool bOldSectLock = false;
if ( pSctFrame )
{
bOldSectLock = pSctFrame->IsColLocked();
pSctFrame->ColLock();
}
pUp->Cut();
if ( pSctFrame && !bOldSectLock )
{
pSctFrame->ColUnlock();
}
}
SwFrame::DestroyFrame(pUp);
bDel = false; // Row goes to /dev/null.
}
}
if ( bDel )
{
SwFrame* pTabFrame = pFrame->GetUpper();
if ( pTabFrame->IsTabFrame() &&
!pFrame->GetNext() &&
static_cast<SwTabFrame*>(pTabFrame)->GetFollow() )
{
// We do not delete the follow flow line,
// this will be done automatically in the
// next turn.
static_cast<SwTabFrame*>(pTabFrame)->SetFollowFlowLine( false );
}
pFrame->Cut();
SwFrame::DestroyFrame(pFrame);
}
}
}
}
}
static bool lcl_IsLineOfTableFrame( const SwTabFrame& rTable, const SwFrame& rChk )
{
const SwTabFrame* pTableFrame = rChk.FindTabFrame();
if( pTableFrame->IsFollow() )
pTableFrame = pTableFrame->FindMaster( true );
return &rTable == pTableFrame;
}
static void lcl_UpdateRepeatedHeadlines( SwTabFrame& rTabFrame, bool bCalcLowers )
{
OSL_ENSURE( rTabFrame.IsFollow(), "lcl_UpdateRepeatedHeadlines called for non-follow tab" );
// Delete remaining headlines:
SwRowFrame* pLower = nullptr;
while ( nullptr != ( pLower = static_cast<SwRowFrame*>(rTabFrame.Lower()) ) && pLower->IsRepeatedHeadline() )
{
pLower->Cut();
SwFrame::DestroyFrame(pLower);
}
// Insert fresh set of headlines:
pLower = static_cast<SwRowFrame*>(rTabFrame.Lower());
SwTable& rTable = *rTabFrame.GetTable();
const sal_uInt16 nRepeat = rTable.GetRowsToRepeat();
for ( sal_uInt16 nIdx = 0; nIdx < nRepeat; ++nIdx )
{
SwRowFrame* pHeadline = new SwRowFrame( *rTable.GetTabLines()[ nIdx ], &rTabFrame );
pHeadline->SetRepeatedHeadline( true );
pHeadline->Paste( &rTabFrame, pLower );
pHeadline->RegistFlys();
}
if ( bCalcLowers )
rTabFrame.SetCalcLowers();
}
void FndBox_::MakeFrames( SwTable &rTable )
{
// All lines between pLineBefore and pLineBehind should be re-generated in layout.
// And this for all instances of a table (for example in header/footer).
sal_uInt16 nStPos = 0;
sal_uInt16 nEndPos= rTable.GetTabLines().size() - 1;
SwRootFrame* pLayout =
rTable.GetFrameFormat()->GetDoc()->getIDocumentLayoutAccess().GetCurrentLayout();
bool bHideChanges = pLayout && pLayout->IsHideRedlines();
if ( m_pLineBefore )
{
nStPos = rTable.GetTabLines().GetPos(
const_cast<const SwTableLine*&>(m_pLineBefore) );
OSL_ENSURE( nStPos != USHRT_MAX, "Fox stole the line!" );
++nStPos;
}
if ( m_pLineBehind )
{
nEndPos = rTable.GetTabLines().GetPos(
const_cast<const SwTableLine*&>(m_pLineBehind) );
OSL_ENSURE( nEndPos != USHRT_MAX, "Fox stole the line!" );
--nEndPos;
}
// now big insert operation for all tables.
SwIterator<SwTabFrame,SwFormat> aTabIter( *rTable.GetFrameFormat() );
for ( SwTabFrame *pTable = aTabIter.First(); pTable; pTable = aTabIter.Next() )
{
if ( !pTable->IsFollow() )
{
SwRowFrame *pSibling = nullptr;
SwFrame *pUpperFrame = nullptr;
int i;
for ( i = rTable.GetTabLines().size()-1;
i >= 0 && !pSibling; --i )
{
SwTableLine *pLine = m_pLineBehind ? m_pLineBehind :
rTable.GetTabLines()[o3tl::narrowing<sal_uInt16>(i)];
SwIterator<SwRowFrame,SwFormat> aIter( *pLine->GetFrameFormat() );
pSibling = aIter.First();
while ( pSibling && (
pSibling->GetTabLine() != pLine ||
!lcl_IsLineOfTableFrame( *pTable, *pSibling ) ||
pSibling->IsRepeatedHeadline() ||
// #i53647# If !pLineBehind,
// IsInSplitTableRow() should be checked.
( m_pLineBehind && pSibling->IsInFollowFlowRow() ) ||
(!m_pLineBehind && pSibling->IsInSplitTableRow() ) ) )
{
pSibling = aIter.Next();
}
}
if ( pSibling )
{
pUpperFrame = pSibling->GetUpper();
if ( !m_pLineBehind )
pSibling = nullptr;
}
else
// ???? or is this the last Follow of the table ????
pUpperFrame = pTable;
SwRedlineTable::size_type nRedlinePos = 0;
for ( sal_uInt16 j = nStPos; j <= nEndPos; ++j )
{
SwTableLine * pLine = rTable.GetTabLines()[j];
if ( ( !bHideChanges || !pLine->IsDeleted(nRedlinePos) ) &&
// tdf#159026 fix Undo crash with floating tables
pUpperFrame->GetUpper() )
::lcl_InsertRow( *pLine,
static_cast<SwLayoutFrame*>(pUpperFrame), pSibling );
}
if ( pUpperFrame->IsTabFrame() )
static_cast<SwTabFrame*>(pUpperFrame)->SetCalcLowers();
}
else if ( rTable.GetRowsToRepeat() > 0 )
{
// Insert new headlines:
lcl_UpdateRepeatedHeadlines( *pTable, true );
}
}
}
void FndBox_::MakeNewFrames( SwTable &rTable, const sal_uInt16 nNumber,
const bool bBehind )
{
// Create Frames for newly inserted lines
// bBehind == true: before pLineBehind
// == false: after pLineBefore
const sal_uInt16 nBfPos = m_pLineBefore ?
rTable.GetTabLines().GetPos( const_cast<const SwTableLine*&>(m_pLineBefore) ) :
USHRT_MAX;
const sal_uInt16 nBhPos = m_pLineBehind ?
rTable.GetTabLines().GetPos( const_cast<const SwTableLine*&>(m_pLineBehind) ) :
USHRT_MAX;
//nNumber: how often did we insert
//nCnt: how many were inserted nNumber times
const sal_uInt16 nCnt =
((nBhPos != USHRT_MAX ? nBhPos : rTable.GetTabLines().size()) -
(nBfPos != USHRT_MAX ? nBfPos + 1 : 0)) / (nNumber + 1);
// search the Master-TabFrame
SwIterator<SwTabFrame,SwFormat> aTabIter( *rTable.GetFrameFormat() );
SwTabFrame *pTable;
for ( pTable = aTabIter.First(); pTable; pTable = aTabIter.Next() )
{
if( !pTable->IsFollow() )
{
SwRowFrame* pSibling = nullptr;
SwLayoutFrame *pUpperFrame = nullptr;
if ( bBehind )
{
if ( m_pLineBehind )
{
SwIterator<SwRowFrame,SwFormat> aIter( *m_pLineBehind->GetFrameFormat() );
pSibling = aIter.First();
while ( pSibling && (
// only consider row frames associated with pLineBehind:
pSibling->GetTabLine() != m_pLineBehind ||
// only consider row frames that are in pTables Master-Follow chain:
!lcl_IsLineOfTableFrame( *pTable, *pSibling ) ||
// only consider row frames that are not repeated headlines:
pSibling->IsRepeatedHeadline() ||
// only consider row frames that are not follow flow rows
pSibling->IsInFollowFlowRow() ) )
{
pSibling = aIter.Next();
}
}
if ( pSibling )
pUpperFrame = pSibling->GetUpper();
else
{
while( pTable->GetFollow() )
pTable = pTable->GetFollow();
pUpperFrame = pTable;
}
const sal_uInt16 nMax = nBhPos != USHRT_MAX ?
nBhPos : rTable.GetTabLines().size();
sal_uInt16 i = nBfPos != USHRT_MAX ? nBfPos + 1 + nCnt : nCnt;
for ( ; i < nMax; ++i )
::lcl_InsertRow( *rTable.GetTabLines()[i], pUpperFrame, pSibling );
if ( pUpperFrame->IsTabFrame() )
static_cast<SwTabFrame*>(pUpperFrame)->SetCalcLowers();
}
else // insert before
{
sal_uInt16 i;
// We are looking for the frame that is behind the row frame
// that should be inserted.
for ( i = 0; !pSibling; ++i )
{
SwTableLine* pLine = m_pLineBefore ? m_pLineBefore : rTable.GetTabLines()[i];
SwIterator<SwRowFrame,SwFormat> aIter( *pLine->GetFrameFormat() );
pSibling = aIter.First();
while ( pSibling && (
// only consider row frames associated with pLineBefore:
pSibling->GetTabLine() != pLine ||
// only consider row frames that are in pTables Master-Follow chain:
!lcl_IsLineOfTableFrame( *pTable, *pSibling ) ||
// only consider row frames that are not repeated headlines:
pSibling->IsRepeatedHeadline() ||
// 1. case: pLineBefore == 0:
// only consider row frames that are not follow flow rows
// 2. case: pLineBefore != 0:
// only consider row frames that are not split table rows
// #i37476# If !pLineBefore,
// check IsInFollowFlowRow instead of IsInSplitTableRow.
( ( !m_pLineBefore && pSibling->IsInFollowFlowRow() ) ||
( m_pLineBefore && pSibling->IsInSplitTableRow() ) ) ) )
{
pSibling = aIter.Next();
}
}
pUpperFrame = pSibling->GetUpper();
if ( m_pLineBefore )
pSibling = static_cast<SwRowFrame*>( pSibling->GetNext() );
sal_uInt16 nMax = nBhPos != USHRT_MAX ?
nBhPos - nCnt :
rTable.GetTabLines().size() - nCnt;
i = nBfPos != USHRT_MAX ? nBfPos + 1 : 0;
for ( ; i < nMax; ++i )
::lcl_InsertRow( *rTable.GetTabLines()[i],
pUpperFrame, pSibling );
if ( pUpperFrame->IsTabFrame() )
static_cast<SwTabFrame*>(pUpperFrame)->SetCalcLowers();
}
}
}
// If necessary headlines should be processed. In order to
// not to fragment good code, we iterate once more.
const sal_uInt16 nRowsToRepeat = rTable.GetRowsToRepeat();
if ( !(nRowsToRepeat > 0 &&
( ( !bBehind && ( nBfPos == USHRT_MAX || nBfPos + 1 < nRowsToRepeat ) ) ||
( bBehind && ( ( nBfPos == USHRT_MAX && nRowsToRepeat > 1 ) || nBfPos + 2 < nRowsToRepeat ) ) )) )
return;
for ( pTable = aTabIter.First(); pTable; pTable = aTabIter.Next() )
{
if ( pTable->Lower() )
{
if ( pTable->IsFollow() )
{
lcl_UpdateRepeatedHeadlines( *pTable, true );
}
OSL_ENSURE( static_cast<SwRowFrame*>(pTable->Lower())->GetTabLine() ==
rTable.GetTabLines()[0], "MakeNewFrames: Table corruption!" );
}
}
}
bool FndBox_::AreLinesToRestore( const SwTable &rTable ) const
{
// Should we call MakeFrames here?
if ( !m_pLineBefore && !m_pLineBehind && !rTable.GetTabLines().empty() )
return true;
sal_uInt16 nBfPos;
if(m_pLineBefore)
{
const SwTableLine* rLBefore = const_cast<const SwTableLine*>(m_pLineBefore);
nBfPos = rTable.GetTabLines().GetPos( rLBefore );
}
else
nBfPos = USHRT_MAX;
sal_uInt16 nBhPos;
if(m_pLineBehind)
{
const SwTableLine* rLBehind = const_cast<const SwTableLine*>(m_pLineBehind);
nBhPos = rTable.GetTabLines().GetPos( rLBehind );
}
else
nBhPos = USHRT_MAX;
if ( nBfPos == nBhPos ) // Should never occur.
{
OSL_FAIL( "Table, erase but not on any area !?!" );
return false;
}
if ( rTable.GetRowsToRepeat() > 0 )
{
// oops: should the repeated headline have been deleted??
SwIterator<SwTabFrame,SwFormat> aIter( *rTable.GetFrameFormat() );
for( SwTabFrame* pTable = aIter.First(); pTable; pTable = aIter.Next() )
{
if( pTable->IsFollow() )
{
// Insert new headlines:
lcl_UpdateRepeatedHeadlines( *pTable, false );
}
}
}
// Some adjacent lines at the beginning of the table have been deleted:
if ( nBfPos == USHRT_MAX && nBhPos == 0 )
return false;
// Some adjacent lines at the end of the table have been deleted:
if ( nBhPos == USHRT_MAX && nBfPos == (rTable.GetTabLines().size() - 1) )
return false;
// Some adjacent lines in the middle of the table have been deleted:
if ( nBfPos != USHRT_MAX && nBhPos != USHRT_MAX && (nBfPos + 1) == nBhPos )
return false;
// The structure of the deleted lines is more complex due to split lines.
// A call of MakeFrames() is necessary.
return true;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|