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
|
/* -*- 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 <svl/intitem.hxx>
#include <svl/zforlist.hxx>
#include <svl/zformat.hxx>
#include <formula/token.hxx>
#include <document.hxx>
#include <table.hxx>
#include <globstr.hrc>
#include <subtotal.hxx>
#include <docoptio.hxx>
#include <interpre.hxx>
#include <markdata.hxx>
#include <validat.hxx>
#include <scitems.hxx>
#include <stlpool.hxx>
#include <poolhelp.hxx>
#include <detdata.hxx>
#include <patattr.hxx>
#include <chgtrack.hxx>
#include <progress.hxx>
#include <paramisc.hxx>
#include <compiler.hxx>
#include <externalrefmgr.hxx>
#include <colorscale.hxx>
#include <attrib.hxx>
#include <formulacell.hxx>
#include <tokenarray.hxx>
#include <scmatrix.hxx>
#include <tokenstringcontext.hxx>
#include <memory>
using namespace formula;
/** (Goal Seek) Find a value of x that is a root of f(x)
This function is used internally for the goal seek operation. It uses the
Regula Falsi (aka false position) algorithm to find a root of f(x). The
start value and the target value are to be given by the user in the
goal seek dialog. The f(x) in this case is defined as the formula in the
formula cell minus target value. This function may also perform additional
search in the horizontal directions when the f(x) is discrete in order to
ensure a non-zero slope necessary for deriving a subsequent x that is
reasonably close to the root of interest.
@change 24.10.2004 by Kohei Yoshida (kohei@openoffice.org)
@see #i28955#
@change 6 Aug 2013, fdo37341
*/
bool ScDocument::Solver(SCCOL nFCol, SCROW nFRow, SCTAB nFTab,
SCCOL nVCol, SCROW nVRow, SCTAB nVTab,
const OUString& sValStr, double& nX)
{
bool bRet = false;
nX = 0.0;
if ( ValidColRow( nFCol, nFRow ) && ValidTab( nFTab ) &&
ValidColRow( nVCol, nVRow ) && ValidTab( nVTab ) &&
nFTab < static_cast<SCTAB>( maTabs.size() ) && maTabs[nFTab] &&
nVTab < static_cast<SCTAB>( maTabs.size() ) && maTabs[nVTab] )
{
CellType eFType, eVType;
GetCellType(nFCol, nFRow, nFTab, eFType);
GetCellType(nVCol, nVRow, nVTab, eVType);
// #i108005# convert target value to number using default format,
// as previously done in ScInterpreter::GetDouble
ScFormulaCell* pFormula = nullptr;
double fTargetVal = 0.0;
sal_uInt32 nFIndex = 0;
if ( eFType == CELLTYPE_FORMULA && eVType == CELLTYPE_VALUE &&
GetFormatTable()->IsNumberFormat( sValStr, nFIndex, fTargetVal ) )
{
ScAddress aFormulaAdr( nFCol, nFRow, nFTab );
pFormula = GetFormulaCell( aFormulaAdr );
}
if (pFormula)
{
bool bDoneIteration = false;
ScAddress aValueAdr( nVCol, nVRow, nVTab );
double* pVCell = GetValueCell( aValueAdr );
ScRange aVRange( aValueAdr, aValueAdr ); // for SetDirty
// Original value to be restored later if necessary
double fSaveVal = *pVCell;
const sal_uInt16 nMaxIter = 100;
const double fEps = 1E-10;
const double fDelta = 1E-6;
double fBestX, fXPrev;
double fBestF, fFPrev;
fBestX = fXPrev = fSaveVal;
pFormula->Interpret();
bool bError = ( pFormula->GetErrCode() != FormulaError::NONE );
// bError always corresponds with fF
fFPrev = pFormula->GetValue() - fTargetVal;
fBestF = fabs( fFPrev );
if ( fBestF < fDelta )
bDoneIteration = true;
double fX = fXPrev + fEps;
double fF = fFPrev;
double fSlope;
sal_uInt16 nIter = 0;
bool bHorMoveError = false;
// Conform Regula Falsi Method
while ( !bDoneIteration && ( nIter++ < nMaxIter ) )
{
*pVCell = fX;
SetDirty( aVRange, false );
pFormula->Interpret();
bError = ( pFormula->GetErrCode() != FormulaError::NONE );
fF = pFormula->GetValue() - fTargetVal;
if ( fF == fFPrev && !bError )
{
// HORIZONTAL SEARCH: Keep moving x in both directions until the f(x)
// becomes different from the previous f(x). This routine is needed
// when a given function is discrete, in which case the resulting slope
// may become zero which ultimately causes the goal seek operation
// to fail. #i28955#
sal_uInt16 nHorIter = 0;
const double fHorStepAngle = 5.0;
const double fHorMaxAngle = 80.0;
int const nHorMaxIter = static_cast<int>( fHorMaxAngle / fHorStepAngle );
bool bDoneHorMove = false;
while ( !bDoneHorMove && !bHorMoveError && nHorIter++ < nHorMaxIter )
{
double fHorAngle = fHorStepAngle * static_cast<double>( nHorIter );
double fHorTangent = ::rtl::math::tan( fHorAngle * F_PI / 180 );
sal_uInt16 nIdx = 0;
while( nIdx++ < 2 && !bDoneHorMove )
{
double fHorX;
if ( nIdx == 1 )
fHorX = fX + fabs( fF ) * fHorTangent;
else
fHorX = fX - fabs( fF ) * fHorTangent;
*pVCell = fHorX;
SetDirty( aVRange, false );
pFormula->Interpret();
bHorMoveError = ( pFormula->GetErrCode() != FormulaError::NONE );
if ( bHorMoveError )
break;
fF = pFormula->GetValue() - fTargetVal;
if ( fF != fFPrev )
{
fX = fHorX;
bDoneHorMove = true;
}
}
}
if ( !bDoneHorMove )
bHorMoveError = true;
}
if ( bError )
{
// move closer to last valid value (fXPrev), keep fXPrev & fFPrev
double fDiff = ( fXPrev - fX ) / 2;
if ( fabs( fDiff ) < fEps )
fDiff = ( fDiff < 0.0 ? - fEps : fEps );
fX += fDiff;
}
else if ( bHorMoveError )
break;
else if ( fabs(fF) < fDelta )
{
// converged to root
fBestX = fX;
bDoneIteration = true;
}
else
{
if ( fabs(fF) + fDelta < fBestF )
{
fBestX = fX;
fBestF = fabs( fF );
}
if ( ( fXPrev - fX ) != 0 )
{
fSlope = ( fFPrev - fF ) / ( fXPrev - fX );
if ( fabs( fSlope ) < fEps )
fSlope = fSlope < 0.0 ? -fEps : fEps;
}
else
fSlope = fEps;
fXPrev = fX;
fFPrev = fF;
fX = fX - ( fF / fSlope );
}
}
// Try a nice rounded input value if possible.
const double fNiceDelta = ( bDoneIteration && fabs( fBestX ) >= 1e-3 ? 1e-3 : fDelta );
nX = ::rtl::math::approxFloor( ( fBestX / fNiceDelta ) + 0.5 ) * fNiceDelta;
if ( bDoneIteration )
{
*pVCell = nX;
SetDirty( aVRange, false );
pFormula->Interpret();
if ( fabs( pFormula->GetValue() - fTargetVal ) > fabs( fF ) )
nX = fBestX;
bRet = true;
}
else if ( bError || bHorMoveError )
{
nX = fBestX;
}
*pVCell = fSaveVal;
SetDirty( aVRange, false );
pFormula->Interpret();
if ( !bDoneIteration )
{
SetError( nVCol, nVRow, nVTab, FormulaError::NotAvailable );
}
}
else
{
SetError( nVCol, nVRow, nVTab, FormulaError::NotAvailable );
}
}
return bRet;
}
void ScDocument::InsertMatrixFormula(SCCOL nCol1, SCROW nRow1,
SCCOL nCol2, SCROW nRow2,
const ScMarkData& rMark,
const OUString& rFormula,
const ScTokenArray* pArr,
const formula::FormulaGrammar::Grammar eGram )
{
PutInOrder(nCol1, nCol2);
PutInOrder(nRow1, nRow2);
nCol2 = std::min<SCCOL>(nCol2, MAXCOL);
nRow2 = std::min<SCROW>(nRow2, MAXROW);
if (!rMark.GetSelectCount())
{
SAL_WARN("sc", "ScDocument::InsertMatrixFormula: No table marked");
return;
}
assert( ValidColRow( nCol1, nRow1) && ValidColRow( nCol2, nRow2));
SCTAB nTab1 = *rMark.begin();
ScFormulaCell* pCell;
ScAddress aPos( nCol1, nRow1, nTab1 );
if (pArr)
pCell = new ScFormulaCell(this, aPos, *pArr, eGram, ScMatrixMode::Formula);
else
pCell = new ScFormulaCell( this, aPos, rFormula, eGram, ScMatrixMode::Formula );
pCell->SetMatColsRows( nCol2 - nCol1 + 1, nRow2 - nRow1 + 1 );
ScMarkData::const_iterator itr = rMark.begin(), itrEnd = rMark.end();
SCTAB nMax = static_cast<SCTAB>(maTabs.size());
for (; itr != itrEnd && *itr < nMax; ++itr)
{
if (!maTabs[*itr])
continue;
if (*itr == nTab1)
{
pCell = maTabs[*itr]->SetFormulaCell(nCol1, nRow1, pCell);
if (!pCell) //NULL if nCol1/nRow1 is invalid, which it can't be here
break;
}
else
maTabs[*itr]->SetFormulaCell(
nCol1, nRow1,
new ScFormulaCell(
*pCell, *this, ScAddress(nCol1, nRow1, *itr), ScCloneFlags::StartListening));
}
ScAddress aBasePos(nCol1, nRow1, nTab1);
ScSingleRefData aRefData;
aRefData.InitFlags();
aRefData.SetColRel( true );
aRefData.SetRowRel( true );
aRefData.SetTabRel( true );
aRefData.SetAddress(aBasePos, aBasePos);
ScTokenArray aArr; // consists only of one single reference token.
formula::FormulaToken* t = aArr.AddMatrixSingleReference( aRefData);
itr = rMark.begin();
for (; itr != itrEnd && *itr < nMax; ++itr)
{
SCTAB nTab = *itr;
ScTable* pTab = FetchTable(nTab);
if (!pTab)
continue;
if (nTab != nTab1)
{
aRefData.SetRelTab(nTab - aBasePos.Tab());
*t->GetSingleRef() = aRefData;
}
for (SCCOL nCol : GetColumnsRange(nTab1, nCol1, nCol2))
{
for (SCROW nRow = nRow1; nRow <= nRow2; ++nRow)
{
if (nCol == nCol1 && nRow == nRow1)
// Skip the base position.
continue;
// Token array must be cloned so that each formula cell receives its own copy.
aPos = ScAddress(nCol, nRow, nTab);
// Reference in each cell must point to the origin cell relative to the current cell.
aRefData.SetAddress(aBasePos, aPos);
*t->GetSingleRef() = aRefData;
std::unique_ptr<ScTokenArray> pTokArr(aArr.Clone());
pCell = new ScFormulaCell(this, aPos, *pTokArr, eGram, ScMatrixMode::Reference);
pTab->SetFormulaCell(nCol, nRow, pCell);
}
}
}
}
void ScDocument::InsertTableOp(const ScTabOpParam& rParam, // multiple (repeated?) operation
SCCOL nCol1, SCROW nRow1, SCCOL nCol2, SCROW nRow2,
const ScMarkData& rMark)
{
PutInOrder(nCol1, nCol2);
PutInOrder(nRow1, nRow2);
assert( ValidColRow( nCol1, nRow1) && ValidColRow( nCol2, nRow2));
SCTAB i, nTab1;
SCCOL j;
SCROW k;
i = 0;
bool bStop = false;
SCTAB nMax = static_cast<SCTAB>(maTabs.size());
ScMarkData::const_iterator itr = rMark.begin(), itrEnd = rMark.end();
for (; itr != itrEnd && *itr < nMax; ++itr)
{
if (maTabs[*itr])
{
i = *itr;
bStop = true;
break;
}
}
nTab1 = i;
if (!bStop)
{
OSL_FAIL("ScDocument::InsertTableOp: No table marked");
return;
}
ScRefAddress aRef;
OUStringBuffer aForString;
aForString.append('=');
aForString.append(ScCompiler::GetNativeSymbol(ocTableOp));
aForString.append(ScCompiler::GetNativeSymbol( ocOpen));
const OUString& sSep = ScCompiler::GetNativeSymbol( ocSep);
if (rParam.meMode == ScTabOpParam::Column) // column only
{
aRef.Set( rParam.aRefFormulaCell.GetAddress(), true, false, false );
aForString.append(aRef.GetRefString(this, nTab1));
aForString.append(sSep);
aForString.append(rParam.aRefColCell.GetRefString(this, nTab1));
aForString.append(sSep);
aRef.Set( nCol1, nRow1, nTab1, false, true, true );
aForString.append(aRef.GetRefString(this, nTab1));
nCol1++;
nCol2 = std::min( nCol2, (SCCOL)(rParam.aRefFormulaEnd.Col() -
rParam.aRefFormulaCell.Col() + nCol1 + 1));
}
else if (rParam.meMode == ScTabOpParam::Row) // row only
{
aRef.Set( rParam.aRefFormulaCell.GetAddress(), false, true, false );
aForString.append(aRef.GetRefString(this, nTab1));
aForString.append(sSep);
aForString.append(rParam.aRefRowCell.GetRefString(this, nTab1));
aForString.append(sSep);
aRef.Set( nCol1, nRow1, nTab1, true, false, true );
aForString.append(aRef.GetRefString(this, nTab1));
nRow1++;
nRow2 = std::min( nRow2, (SCROW)(rParam.aRefFormulaEnd.Row() -
rParam.aRefFormulaCell.Row() + nRow1 + 1));
}
else // both
{
aForString.append(rParam.aRefFormulaCell.GetRefString(this, nTab1));
aForString.append(sSep);
aForString.append(rParam.aRefColCell.GetRefString(this, nTab1));
aForString.append(sSep);
aRef.Set( nCol1, nRow1 + 1, nTab1, false, true, true );
aForString.append(aRef.GetRefString(this, nTab1));
aForString.append(sSep);
aForString.append(rParam.aRefRowCell.GetRefString(this, nTab1));
aForString.append(sSep);
aRef.Set( nCol1 + 1, nRow1, nTab1, true, false, true );
aForString.append(aRef.GetRefString(this, nTab1));
nCol1++; nRow1++;
}
aForString.append(ScCompiler::GetNativeSymbol( ocClose ));
ScFormulaCell aRefCell( this, ScAddress( nCol1, nRow1, nTab1 ), aForString.makeStringAndClear(),
formula::FormulaGrammar::GRAM_NATIVE, ScMatrixMode::NONE );
for( j = nCol1; j <= nCol2; j++ )
for( k = nRow1; k <= nRow2; k++ )
for (i = 0; i < static_cast<SCTAB>(maTabs.size()); i++)
{
itr = rMark.begin();
for (; itr != itrEnd && *itr < nMax; ++itr)
if( maTabs[*itr] )
maTabs[*itr]->SetFormulaCell(
j, k, new ScFormulaCell(aRefCell, *this, ScAddress(j, k, *itr), ScCloneFlags::StartListening));
}
}
namespace {
bool setCacheTableReferenced(formula::FormulaToken& rToken, ScExternalRefManager& rRefMgr, const ScAddress& rPos)
{
switch (rToken.GetType())
{
case svExternalSingleRef:
return rRefMgr.setCacheTableReferenced(
rToken.GetIndex(), rToken.GetString().getString(), 1);
case svExternalDoubleRef:
{
const ScComplexRefData& rRef = *rToken.GetDoubleRef();
ScRange aAbs = rRef.toAbs(rPos);
size_t nSheets = aAbs.aEnd.Tab() - aAbs.aStart.Tab() + 1;
return rRefMgr.setCacheTableReferenced(
rToken.GetIndex(), rToken.GetString().getString(), nSheets);
}
case svExternalName:
/* TODO: external names aren't supported yet, but would
* have to be marked as well, if so. Mechanism would be
* different. */
OSL_FAIL("ScDocument::MarkUsedExternalReferences: implement the svExternalName case!");
break;
default:
break;
}
return false;
}
}
bool ScDocument::MarkUsedExternalReferences( const ScTokenArray& rArr, const ScAddress& rPos )
{
if (!rArr.GetLen())
return false;
ScExternalRefManager* pRefMgr = nullptr;
formula::FormulaTokenArrayPlainIterator aIter( rArr );
formula::FormulaToken* t = nullptr;
bool bAllMarked = false;
while (!bAllMarked && (t = aIter.GetNextReferenceOrName()) != nullptr)
{
if (t->IsExternalRef())
{
if (!pRefMgr)
pRefMgr = GetExternalRefManager();
bAllMarked = setCacheTableReferenced(*t, *pRefMgr, rPos);
}
else if (t->GetType() == svIndex)
{
// this is a named range. Check if the range contains an external
// reference.
ScRangeData* pRangeData = GetRangeName()->findByIndex(t->GetIndex());
if (!pRangeData)
continue;
ScTokenArray* pArray = pRangeData->GetCode();
formula::FormulaTokenArrayPlainIterator aArrayIter(*pArray);
for (t = aArrayIter.First(); t; t = aArrayIter.Next())
{
if (!t->IsExternalRef())
continue;
if (!pRefMgr)
pRefMgr = GetExternalRefManager();
bAllMarked = setCacheTableReferenced(*t, *pRefMgr, rPos);
}
}
}
return bAllMarked;
}
bool ScDocument::GetNextSpellingCell(SCCOL& nCol, SCROW& nRow, SCTAB nTab,
bool bInSel, const ScMarkData& rMark) const
{
if (ValidTab(nTab) && nTab < static_cast<SCTAB>(maTabs.size()) && maTabs[nTab])
return maTabs[nTab]->GetNextSpellingCell( nCol, nRow, bInSel, rMark );
else
return false;
}
bool ScDocument::GetNextMarkedCell( SCCOL& rCol, SCROW& rRow, SCTAB nTab,
const ScMarkData& rMark )
{
if (ValidTab(nTab) && nTab < static_cast<SCTAB>(maTabs.size()) && maTabs[nTab])
return maTabs[nTab]->GetNextMarkedCell( rCol, rRow, rMark );
else
return false;
}
void ScDocument::ReplaceStyle(const SvxSearchItem& rSearchItem,
SCCOL nCol, SCROW nRow, SCTAB nTab,
const ScMarkData& rMark)
{
if (nTab < static_cast<SCTAB>(maTabs.size()) && maTabs[nTab])
maTabs[nTab]->ReplaceStyle(rSearchItem, nCol, nRow, rMark, true/*bIsUndoP*/);
}
void ScDocument::CompileDBFormula()
{
sc::CompileFormulaContext aCxt(this);
TableContainer::iterator it = maTabs.begin();
for (;it != maTabs.end(); ++it)
{
if (*it)
(*it)->CompileDBFormula(aCxt);
}
}
void ScDocument::CompileColRowNameFormula()
{
sc::CompileFormulaContext aCxt(this);
TableContainer::iterator it = maTabs.begin();
for (;it != maTabs.end(); ++it)
{
if (*it)
(*it)->CompileColRowNameFormula(aCxt);
}
}
void ScDocument::InvalidateTableArea()
{
TableContainer::iterator it = maTabs.begin();
for (;it != maTabs.end() && *it; ++it)
{
(*it)->InvalidateTableArea();
if ( (*it)->IsScenario() )
(*it)->InvalidateScenarioRanges();
}
}
sal_Int32 ScDocument::GetMaxStringLen( SCTAB nTab, SCCOL nCol,
SCROW nRowStart, SCROW nRowEnd, rtl_TextEncoding eCharSet ) const
{
if (ValidTab(nTab) && nTab < static_cast<SCTAB>(maTabs.size()) && maTabs[nTab])
return maTabs[nTab]->GetMaxStringLen( nCol, nRowStart, nRowEnd, eCharSet );
else
return 0;
}
sal_Int32 ScDocument::GetMaxNumberStringLen( sal_uInt16& nPrecision, SCTAB nTab,
SCCOL nCol,
SCROW nRowStart, SCROW nRowEnd ) const
{
if (ValidTab(nTab) && nTab < static_cast<SCTAB>(maTabs.size()) && maTabs[nTab])
return maTabs[nTab]->GetMaxNumberStringLen( nPrecision, nCol,
nRowStart, nRowEnd );
else
return 0;
}
bool ScDocument::GetSelectionFunction( ScSubTotalFunc eFunc,
const ScAddress& rCursor, const ScMarkData& rMark,
double& rResult )
{
ScFunctionData aData(eFunc);
ScMarkData aMark(rMark);
aMark.MarkToMulti();
if (!aMark.IsMultiMarked() && !aMark.IsCellMarked(rCursor.Col(), rCursor.Row()))
aMark.SetMarkArea(rCursor);
SCTAB nMax = static_cast<SCTAB>(maTabs.size());
ScMarkData::const_iterator itr = aMark.begin(), itrEnd = aMark.end();
for (; itr != itrEnd && *itr < nMax && !aData.bError; ++itr)
if (maTabs[*itr])
maTabs[*itr]->UpdateSelectionFunction(aData, aMark);
//TODO: pass rMark to UpdateSelection Function !!!!!
if (!aData.bError)
switch (eFunc)
{
case SUBTOTAL_FUNC_SUM:
rResult = aData.nVal;
break;
case SUBTOTAL_FUNC_SELECTION_COUNT:
rResult = aData.nCount;
break;
case SUBTOTAL_FUNC_CNT:
case SUBTOTAL_FUNC_CNT2:
rResult = aData.nCount;
break;
case SUBTOTAL_FUNC_AVE:
if (aData.nCount)
rResult = aData.nVal / (double) aData.nCount;
else
aData.bError = true;
break;
case SUBTOTAL_FUNC_MAX:
case SUBTOTAL_FUNC_MIN:
if (aData.nCount)
rResult = aData.nVal;
else
aData.bError = true;
break;
default:
{
// added to avoid warnings
}
}
if (aData.bError)
rResult = 0.0;
return !aData.bError;
}
double ScDocument::RoundValueAsShown( double fVal, sal_uInt32 nFormat ) const
{
const SvNumberformat* pFormat = GetFormatTable()->GetEntry( nFormat );
short nType;
if (pFormat && (nType = pFormat->GetMaskedType()) != css::util::NumberFormat::DATE
&& nType != css::util::NumberFormat::TIME && nType != css::util::NumberFormat::DATETIME )
{
short nPrecision;
if ((nFormat % SV_COUNTRY_LANGUAGE_OFFSET) != 0)
{
sal_uInt16 nIdx = pFormat->GetSubformatIndex( fVal );
nPrecision = (short)pFormat->GetFormatPrecision( nIdx );
switch ( nType )
{
case css::util::NumberFormat::PERCENT: // 0.41% == 0.0041
nPrecision += 2;
break;
case css::util::NumberFormat::SCIENTIFIC: // 1.23e-3 == 0.00123
{
short nExp = 0;
if ( fVal > 0.0 )
nExp = (short)floor( log10( fVal ) );
else if ( fVal < 0.0 )
nExp = (short)floor( log10( -fVal ) );
nPrecision -= nExp;
short nInteger = (short)pFormat->GetFormatIntegerDigits( nIdx );
if ( nInteger > 1 ) // Engineering notation
{
short nIncrement = nExp % nInteger;
if ( nIncrement != 0 )
{
nPrecision += nIncrement;
if (nExp < 0 )
nPrecision += nInteger;
}
}
break;
}
case css::util::NumberFormat::FRACTION: // get value of fraction representation
{
return pFormat->GetRoundFractionValue( fVal );
}
case css::util::NumberFormat::NUMBER:
case css::util::NumberFormat::CURRENCY:
{ // tdf#106253 Thousands divisors for format "0,"
nPrecision -= pFormat->GetThousandDivisorPrecision( nIdx );
break;
}
}
}
else
{
nPrecision = (short)GetDocOptions().GetStdPrecision();
// #i115512# no rounding for automatic decimals
if (nPrecision == static_cast<short>(SvNumberFormatter::UNLIMITED_PRECISION))
return fVal;
}
double fRound = ::rtl::math::round( fVal, nPrecision );
if ( ::rtl::math::approxEqual( fVal, fRound ) )
return fVal; // rounding might introduce some error
else
return fRound;
}
else
return fVal;
}
// conditional formats and validation ranges
sal_uLong ScDocument::AddCondFormat( ScConditionalFormat* pNew, SCTAB nTab )
{
if(!pNew)
return 0;
if(ValidTab(nTab) && nTab < static_cast<SCTAB>(maTabs.size()) && maTabs[nTab])
return maTabs[nTab]->AddCondFormat( pNew );
return 0;
}
sal_uLong ScDocument::AddValidationEntry( const ScValidationData& rNew )
{
if (rNew.IsEmpty())
return 0; // empty is always 0
if (!pValidationList)
pValidationList = new ScValidationDataList;
sal_uLong nMax = 0;
for( ScValidationDataList::iterator it = pValidationList->begin(); it != pValidationList->end(); ++it )
{
const ScValidationData* pData = *it;
sal_uLong nKey = pData->GetKey();
if ( pData->EqualEntries( rNew ) )
return nKey;
if ( nKey > nMax )
nMax = nKey;
}
// might be called from ScPatternAttr::PutInPool; thus clone (real copy)
sal_uLong nNewKey = nMax + 1;
ScValidationData* pInsert = rNew.Clone(this);
pInsert->SetKey( nNewKey );
pValidationList->InsertNew( pInsert );
return nNewKey;
}
const SfxPoolItem* ScDocument::GetEffItem(
SCCOL nCol, SCROW nRow, SCTAB nTab, sal_uInt16 nWhich ) const
{
const ScPatternAttr* pPattern = GetPattern( nCol, nRow, nTab );
if ( pPattern )
{
const SfxItemSet& rSet = pPattern->GetItemSet();
const SfxPoolItem* pItem;
if ( rSet.GetItemState( ATTR_CONDITIONAL, true, &pItem ) == SfxItemState::SET )
{
const std::vector<sal_uInt32>& rIndex = static_cast<const ScCondFormatItem&>(pPattern->GetItem(ATTR_CONDITIONAL)).GetCondFormatData();
ScConditionalFormatList* pCondFormList = GetCondFormList( nTab );
if (!rIndex.empty() && pCondFormList)
{
for(std::vector<sal_uInt32>::const_iterator itr = rIndex.begin(), itrEnd = rIndex.end();
itr != itrEnd; ++itr)
{
const ScConditionalFormat* pForm = pCondFormList->GetFormat( *itr );
if ( pForm )
{
ScAddress aPos(nCol, nRow, nTab);
ScRefCellValue aCell(const_cast<ScDocument&>(*this), aPos);
OUString aStyle = pForm->GetCellStyle(aCell, aPos);
if (!aStyle.isEmpty())
{
SfxStyleSheetBase* pStyleSheet = mxPoolHelper->GetStylePool()->Find(
aStyle, SfxStyleFamily::Para );
if ( pStyleSheet && pStyleSheet->GetItemSet().GetItemState(
nWhich, true, &pItem ) == SfxItemState::SET )
return pItem;
}
}
}
}
}
return &rSet.Get( nWhich );
}
OSL_FAIL("no pattern");
return nullptr;
}
const SfxItemSet* ScDocument::GetCondResult( SCCOL nCol, SCROW nRow, SCTAB nTab ) const
{
ScConditionalFormatList* pFormatList = GetCondFormList(nTab);
if (!pFormatList)
return nullptr;
ScAddress aPos(nCol, nRow, nTab);
ScRefCellValue aCell(const_cast<ScDocument&>(*this), aPos);
const ScPatternAttr* pPattern = GetPattern( nCol, nRow, nTab );
const std::vector<sal_uInt32>& rIndex =
static_cast<const ScCondFormatItem&>(pPattern->GetItem(ATTR_CONDITIONAL)).GetCondFormatData();
return GetCondResult(aCell, aPos, *pFormatList, rIndex);
}
const SfxItemSet* ScDocument::GetCondResult(
ScRefCellValue& rCell, const ScAddress& rPos, const ScConditionalFormatList& rList,
const std::vector<sal_uInt32>& rIndex ) const
{
std::vector<sal_uInt32>::const_iterator itr = rIndex.begin(), itrEnd = rIndex.end();
for (; itr != itrEnd; ++itr)
{
const ScConditionalFormat* pForm = rList.GetFormat(*itr);
if (!pForm)
continue;
const OUString& aStyle = pForm->GetCellStyle(rCell, rPos);
if (!aStyle.isEmpty())
{
SfxStyleSheetBase* pStyleSheet =
mxPoolHelper->GetStylePool()->Find(aStyle, SfxStyleFamily::Para);
if (pStyleSheet)
return &pStyleSheet->GetItemSet();
// if style is not there, treat like no condition
}
}
return nullptr;
}
ScConditionalFormat* ScDocument::GetCondFormat(
SCCOL nCol, SCROW nRow, SCTAB nTab ) const
{
sal_uInt32 nIndex = 0;
const std::vector<sal_uInt32>& rCondFormats = static_cast<const ScCondFormatItem*>(GetAttr(nCol, nRow, nTab, ATTR_CONDITIONAL))->GetCondFormatData();
if(!rCondFormats.empty())
nIndex = rCondFormats[0];
if (nIndex)
{
ScConditionalFormatList* pCondFormList = GetCondFormList(nTab);
if (pCondFormList)
return pCondFormList->GetFormat( nIndex );
else
{
OSL_FAIL("pCondFormList is 0");
}
}
return nullptr;
}
ScConditionalFormatList* ScDocument::GetCondFormList(SCTAB nTab) const
{
if(ValidTab(nTab) && nTab < static_cast<SCTAB>(maTabs.size()) && maTabs[nTab])
return maTabs[nTab]->GetCondFormList();
return nullptr;
}
void ScDocument::SetCondFormList( ScConditionalFormatList* pList, SCTAB nTab )
{
if(ValidTab(nTab) && nTab < static_cast<SCTAB>(maTabs.size()) && maTabs[nTab])
maTabs[nTab]->SetCondFormList(pList);
}
const ScValidationData* ScDocument::GetValidationEntry( sal_uLong nIndex ) const
{
if ( pValidationList )
return pValidationList->GetData( nIndex );
else
return nullptr;
}
void ScDocument::DeleteConditionalFormat(sal_uLong nOldIndex, SCTAB nTab)
{
if(ValidTab(nTab) && nTab < static_cast<SCTAB>(maTabs.size()) && maTabs[nTab])
maTabs[nTab]->DeleteConditionalFormat(nOldIndex);
}
bool ScDocument::HasDetectiveOperations() const
{
return pDetOpList && pDetOpList->Count();
}
void ScDocument::AddDetectiveOperation( const ScDetOpData& rData )
{
if (!pDetOpList)
pDetOpList = new ScDetOpList;
pDetOpList->Append( new ScDetOpData( rData ) );
}
void ScDocument::ClearDetectiveOperations()
{
delete pDetOpList; // deletes also the entries
pDetOpList = nullptr;
}
void ScDocument::SetDetOpList(ScDetOpList* pNew)
{
delete pDetOpList; // deletes also the entries
pDetOpList = pNew;
}
// Comparison of Documents
// Pfriemel-Factors
#define SC_DOCCOMP_MAXDIFF 256
#define SC_DOCCOMP_MINGOOD 128
#define SC_DOCCOMP_COLUMNS 10
#define SC_DOCCOMP_ROWS 100
sal_uInt16 ScDocument::RowDifferences( SCROW nThisRow, SCTAB nThisTab,
ScDocument& rOtherDoc, SCROW nOtherRow, SCTAB nOtherTab,
SCCOL nMaxCol, const SCCOLROW* pOtherCols )
{
sal_uLong nDif = 0;
sal_uLong nUsed = 0;
for (SCCOL nThisCol=0; nThisCol<=nMaxCol; nThisCol++)
{
SCCOL nOtherCol;
if ( pOtherCols )
nOtherCol = static_cast<SCCOL>(pOtherCols[nThisCol]);
else
nOtherCol = nThisCol;
if (ValidCol(nOtherCol)) // only compare columns that are common to both docs
{
ScRefCellValue aThisCell(*this, ScAddress(nThisCol, nThisRow, nThisTab));
ScRefCellValue aOtherCell(rOtherDoc, ScAddress(nOtherCol, nOtherRow, nOtherTab));
if (!aThisCell.equalsWithoutFormat(aOtherCell))
{
if (!aThisCell.isEmpty() && !aOtherCell.isEmpty())
nDif += 3;
else
nDif += 4; // content <-> empty counts more
}
if (!aThisCell.isEmpty() || !aOtherCell.isEmpty())
++nUsed;
}
}
if (nUsed > 0)
return static_cast<sal_uInt16>((nDif*64)/nUsed); // max.256 (SC_DOCCOMP_MAXDIFF)
OSL_ENSURE(!nDif,"Diff without Used");
return 0;
}
sal_uInt16 ScDocument::ColDifferences( SCCOL nThisCol, SCTAB nThisTab,
ScDocument& rOtherDoc, SCCOL nOtherCol, SCTAB nOtherTab,
SCROW nMaxRow, const SCCOLROW* pOtherRows )
{
//TODO: optimize e.g. with iterator?
sal_uLong nDif = 0;
sal_uLong nUsed = 0;
for (SCROW nThisRow=0; nThisRow<=nMaxRow; nThisRow++)
{
SCROW nOtherRow;
if ( pOtherRows )
nOtherRow = pOtherRows[nThisRow];
else
nOtherRow = nThisRow;
if (ValidRow(nOtherRow)) // only compare rows that are common to both docs
{
ScRefCellValue aThisCell(*this, ScAddress(nThisCol, nThisRow, nThisTab));
ScRefCellValue aOtherCell(rOtherDoc, ScAddress(nOtherCol, nOtherRow, nOtherTab));
if (!aThisCell.equalsWithoutFormat(aOtherCell))
{
if (!aThisCell.isEmpty() && !aOtherCell.isEmpty())
nDif += 3;
else
nDif += 4; // content <-> empty counts more
}
if (!aThisCell.isEmpty() || !aOtherCell.isEmpty())
++nUsed;
}
}
if (nUsed > 0)
return static_cast<sal_uInt16>((nDif*64)/nUsed); // max.256
OSL_ENSURE(!nDif,"Diff without Used");
return 0;
}
void ScDocument::FindOrder( SCCOLROW* pOtherRows, SCCOLROW nThisEndRow, SCCOLROW nOtherEndRow,
bool bColumns, ScDocument& rOtherDoc, SCTAB nThisTab, SCTAB nOtherTab,
SCCOLROW nEndCol, const SCCOLROW* pTranslate, ScProgress* pProgress, sal_uLong nProAdd )
{
// bColumns=true: rows are columns and vice versa
SCCOLROW nMaxCont; // continue by how much
SCCOLROW nMinGood; // what is a hit (incl.)
if ( bColumns )
{
nMaxCont = SC_DOCCOMP_COLUMNS; // 10 columns
nMinGood = SC_DOCCOMP_MINGOOD;
//TODO: additional pass with nMinGood = 0 ????
}
else
{
nMaxCont = SC_DOCCOMP_ROWS; // 100 rows
nMinGood = SC_DOCCOMP_MINGOOD;
}
bool bUseTotal = bColumns && !pTranslate; // only for the 1st pass
SCCOLROW nOtherRow = 0;
sal_uInt16 nComp;
SCCOLROW nThisRow;
bool bTotal = false; // hold for several nThisRow
SCCOLROW nUnknown = 0;
for (nThisRow = 0; nThisRow <= nThisEndRow; nThisRow++)
{
SCCOLROW nTempOther = nOtherRow;
bool bFound = false;
sal_uInt16 nBest = SC_DOCCOMP_MAXDIFF;
SCCOLROW nMax = std::min( nOtherEndRow, static_cast<SCCOLROW>(( nTempOther + nMaxCont + nUnknown )) );
for (SCCOLROW i=nTempOther; i<=nMax && nBest>0; i++) // stop at 0
{
if (bColumns)
nComp = ColDifferences( static_cast<SCCOL>(nThisRow), nThisTab, rOtherDoc, static_cast<SCCOL>(i), nOtherTab, nEndCol, pTranslate );
else
nComp = RowDifferences( nThisRow, nThisTab, rOtherDoc, i, nOtherTab, static_cast<SCCOL>(nEndCol), pTranslate );
if ( nComp < nBest && ( nComp <= nMinGood || bTotal ) )
{
nTempOther = i;
nBest = nComp;
bFound = true;
}
if ( nComp < SC_DOCCOMP_MAXDIFF || bFound )
bTotal = false;
else if ( i == nTempOther && bUseTotal )
bTotal = true; // only at the very top
}
if ( bFound )
{
pOtherRows[nThisRow] = nTempOther;
nOtherRow = nTempOther + 1;
nUnknown = 0;
}
else
{
pOtherRows[nThisRow] = SCROW_MAX;
++nUnknown;
}
if (pProgress)
pProgress->SetStateOnPercent(nProAdd+static_cast<sal_uLong>(nThisRow));
}
// fill in blocks that don't match
SCROW nFillStart = 0;
SCROW nFillPos = 0;
bool bInFill = false;
for (nThisRow = 0; nThisRow <= nThisEndRow+1; nThisRow++)
{
SCROW nThisOther = ( nThisRow <= nThisEndRow ) ? pOtherRows[nThisRow] : (nOtherEndRow+1);
if ( ValidRow(nThisOther) )
{
if ( bInFill )
{
if ( nThisOther > nFillStart ) // is there something to distribute?
{
SCROW nDiff1 = nThisOther - nFillStart;
SCROW nDiff2 = nThisRow - nFillPos;
SCROW nMinDiff = std::min(nDiff1, nDiff2);
for (SCROW i=0; i<nMinDiff; i++)
pOtherRows[nFillPos+i] = nFillStart+i;
}
bInFill = false;
}
nFillStart = nThisOther + 1;
nFillPos = nThisRow + 1;
}
else
bInFill = true;
}
}
void ScDocument::CompareDocument( ScDocument& rOtherDoc )
{
if (!pChangeTrack)
return;
SCTAB nThisCount = GetTableCount();
SCTAB nOtherCount = rOtherDoc.GetTableCount();
std::unique_ptr<SCTAB[]> pOtherTabs(new SCTAB[nThisCount]);
SCTAB nThisTab;
// compare tables with identical names
OUString aThisName;
OUString aOtherName;
for (nThisTab=0; nThisTab<nThisCount; nThisTab++)
{
SCTAB nOtherTab = SCTAB_MAX;
if (!IsScenario(nThisTab)) // skip scenarios
{
GetName( nThisTab, aThisName );
for (SCTAB nTemp=0; nTemp<nOtherCount && nOtherTab>MAXTAB; nTemp++)
if (!rOtherDoc.IsScenario(nTemp))
{
rOtherDoc.GetName( nTemp, aOtherName );
if ( aThisName == aOtherName )
nOtherTab = nTemp;
}
}
pOtherTabs[nThisTab] = nOtherTab;
}
// fill in, so that un-named tables don't get lost
SCTAB nFillStart = 0;
SCTAB nFillPos = 0;
bool bInFill = false;
for (nThisTab = 0; nThisTab <= nThisCount; nThisTab++)
{
SCTAB nThisOther = ( nThisTab < nThisCount ) ? pOtherTabs[nThisTab] : nOtherCount;
if ( ValidTab(nThisOther) )
{
if ( bInFill )
{
if ( nThisOther > nFillStart ) // is there something to distribute?
{
SCTAB nDiff1 = nThisOther - nFillStart;
SCTAB nDiff2 = nThisTab - nFillPos;
SCTAB nMinDiff = std::min(nDiff1, nDiff2);
for (SCTAB i=0; i<nMinDiff; i++)
if ( !IsScenario(nFillPos+i) && !rOtherDoc.IsScenario(nFillStart+i) )
pOtherTabs[nFillPos+i] = nFillStart+i;
}
bInFill = false;
}
nFillStart = nThisOther + 1;
nFillPos = nThisTab + 1;
}
else
bInFill = true;
}
// compare tables in the original order
for (nThisTab=0; nThisTab<nThisCount; nThisTab++)
{
SCTAB nOtherTab = pOtherTabs[nThisTab];
if ( ValidTab(nOtherTab) )
{
SCCOL nThisEndCol = 0;
SCROW nThisEndRow = 0;
SCCOL nOtherEndCol = 0;
SCROW nOtherEndRow = 0;
GetCellArea( nThisTab, nThisEndCol, nThisEndRow );
rOtherDoc.GetCellArea( nOtherTab, nOtherEndCol, nOtherEndRow );
SCCOL nEndCol = std::max(nThisEndCol, nOtherEndCol);
SCROW nEndRow = std::max(nThisEndRow, nOtherEndRow);
SCCOL nThisCol;
SCROW nThisRow;
sal_uLong n1,n2; // for AppendDeleteRange
//TODO: one Progress over all tables ???
OUString aTabName;
GetName( nThisTab, aTabName );
OUString aTemplate = ScGlobal::GetRscString(STR_PROGRESS_COMPARING);
sal_Int32 nIndex = 0;
OUStringBuffer aProText = aTemplate.getToken( 0, '#', nIndex );
aProText.append(aTabName);
nIndex = 0;
aProText.append(aTemplate.getToken( 1, '#', nIndex ));
ScProgress aProgress( GetDocumentShell(),
aProText.makeStringAndClear(), 3*nThisEndRow, true ); // 2x FindOrder, 1x here
long nProgressStart = 2*nThisEndRow; // start for here
std::unique_ptr<SCCOLROW[]> pTempRows(new SCCOLROW[nThisEndRow+1]);
std::unique_ptr<SCCOLROW[]> pOtherRows(new SCCOLROW[nThisEndRow+1]);
std::unique_ptr<SCCOLROW[]> pOtherCols(new SCCOLROW[nThisEndCol+1]);
// find inserted/deleted columns/rows:
// Two attempts:
// 1) compare original rows (pTempRows)
// 2) compare original columns (pOtherCols)
// with this column order compare rows (pOtherRows)
//TODO: compare columns twice with different nMinGood ???
// 1
FindOrder( pTempRows.get(), nThisEndRow, nOtherEndRow, false,
rOtherDoc, nThisTab, nOtherTab, nEndCol, nullptr, &aProgress, 0 );
// 2
FindOrder( pOtherCols.get(), nThisEndCol, nOtherEndCol, true,
rOtherDoc, nThisTab, nOtherTab, nEndRow, nullptr, nullptr, 0 );
FindOrder( pOtherRows.get(), nThisEndRow, nOtherEndRow, false,
rOtherDoc, nThisTab, nOtherTab, nThisEndCol,
pOtherCols.get(), &aProgress, nThisEndRow );
sal_uLong nMatch1 = 0; // pTempRows, no columns
for (nThisRow = 0; nThisRow<=nThisEndRow; nThisRow++)
if (ValidRow(pTempRows[nThisRow]))
nMatch1 += SC_DOCCOMP_MAXDIFF -
RowDifferences( nThisRow, nThisTab, rOtherDoc, pTempRows[nThisRow],
nOtherTab, nEndCol, nullptr );
sal_uLong nMatch2 = 0; // pOtherRows, pOtherCols
for (nThisRow = 0; nThisRow<=nThisEndRow; nThisRow++)
if (ValidRow(pOtherRows[nThisRow]))
nMatch2 += SC_DOCCOMP_MAXDIFF -
RowDifferences( nThisRow, nThisTab, rOtherDoc, pOtherRows[nThisRow],
nOtherTab, nThisEndCol, pOtherCols.get() );
if ( nMatch1 >= nMatch2 ) // without columns ?
{
// reset columns
for (nThisCol = 0; nThisCol<=nThisEndCol; nThisCol++)
pOtherCols[nThisCol] = nThisCol;
// swap row-arrays (they get both deleted anyway)
pTempRows.swap(pOtherRows);
}
else
{
// remains for pOtherCols, pOtherRows
}
// Generate Change-Actions
// 1) columns from the right
// 2) rows from below
// 3) single cells in normal order
// Actions for inserted/deleted columns
SCCOL nLastOtherCol = static_cast<SCCOL>(nOtherEndCol + 1);
// nThisEndCol ... 0
for ( nThisCol = nThisEndCol+1; nThisCol > 0; )
{
--nThisCol;
SCCOL nOtherCol = static_cast<SCCOL>(pOtherCols[nThisCol]);
if ( ValidCol(nOtherCol) && nOtherCol+1 < nLastOtherCol )
{
// gap -> deleted
ScRange aDelRange( nOtherCol+1, 0, nOtherTab,
nLastOtherCol-1, MAXROW, nOtherTab );
pChangeTrack->AppendDeleteRange( aDelRange, &rOtherDoc, n1, n2 );
}
if ( nOtherCol > MAXCOL ) // inserted
{
// combine
if ( nThisCol == nThisEndCol || ValidCol(static_cast<SCCOL>(pOtherCols[nThisCol+1])) )
{
SCCOL nFirstNew = nThisCol;
while ( nFirstNew > 0 && pOtherCols[nFirstNew-1] > MAXCOL )
--nFirstNew;
SCCOL nDiff = nThisCol - nFirstNew;
ScRange aRange( nLastOtherCol, 0, nOtherTab,
nLastOtherCol+nDiff, MAXROW, nOtherTab );
pChangeTrack->AppendInsert( aRange );
}
}
else
nLastOtherCol = nOtherCol;
}
if ( nLastOtherCol > 0 ) // deleted at the very top
{
ScRange aDelRange( 0, 0, nOtherTab,
nLastOtherCol-1, MAXROW, nOtherTab );
pChangeTrack->AppendDeleteRange( aDelRange, &rOtherDoc, n1, n2 );
}
// Actions for inserted/deleted rows
SCROW nLastOtherRow = nOtherEndRow + 1;
// nThisEndRow ... 0
for ( nThisRow = nThisEndRow+1; nThisRow > 0; )
{
--nThisRow;
SCROW nOtherRow = pOtherRows[nThisRow];
if ( ValidRow(nOtherRow) && nOtherRow+1 < nLastOtherRow )
{
// gap -> deleted
ScRange aDelRange( 0, nOtherRow+1, nOtherTab,
MAXCOL, nLastOtherRow-1, nOtherTab );
pChangeTrack->AppendDeleteRange( aDelRange, &rOtherDoc, n1, n2 );
}
if ( nOtherRow > MAXROW ) // inserted
{
// combine
if ( nThisRow == nThisEndRow || ValidRow(pOtherRows[nThisRow+1]) )
{
SCROW nFirstNew = nThisRow;
while ( nFirstNew > 0 && pOtherRows[nFirstNew-1] > MAXROW )
--nFirstNew;
SCROW nDiff = nThisRow - nFirstNew;
ScRange aRange( 0, nLastOtherRow, nOtherTab,
MAXCOL, nLastOtherRow+nDiff, nOtherTab );
pChangeTrack->AppendInsert( aRange );
}
}
else
nLastOtherRow = nOtherRow;
}
if ( nLastOtherRow > 0 ) // deleted at the very top
{
ScRange aDelRange( 0, 0, nOtherTab,
MAXCOL, nLastOtherRow-1, nOtherTab );
pChangeTrack->AppendDeleteRange( aDelRange, &rOtherDoc, n1, n2 );
}
// walk rows to find single cells
for (nThisRow = 0; nThisRow <= nThisEndRow; nThisRow++)
{
SCROW nOtherRow = pOtherRows[nThisRow];
for (nThisCol = 0; nThisCol <= nThisEndCol; nThisCol++)
{
SCCOL nOtherCol = static_cast<SCCOL>(pOtherCols[nThisCol]);
ScAddress aThisPos( nThisCol, nThisRow, nThisTab );
ScCellValue aThisCell;
aThisCell.assign(*this, aThisPos);
ScCellValue aOtherCell; // start empty
if ( ValidCol(nOtherCol) && ValidRow(nOtherRow) )
{
ScAddress aOtherPos( nOtherCol, nOtherRow, nOtherTab );
aOtherCell.assign(rOtherDoc, aOtherPos);
}
if (!aThisCell.equalsWithoutFormat(aOtherCell))
{
ScRange aRange( aThisPos );
ScChangeActionContent* pAction = new ScChangeActionContent( aRange );
pAction->SetOldValue(aOtherCell, &rOtherDoc, this);
pAction->SetNewValue(aThisCell, this);
pChangeTrack->Append( pAction );
}
}
aProgress.SetStateOnPercent(nProgressStart+nThisRow);
}
}
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|