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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <sal/config.h>
#include <com/sun/star/sheet/XSpreadsheet.hpp>
#include <com/sun/star/table/XCellRange.hpp>
#include "XMLExportIterator.hxx"
#include <dociter.hxx>
#include "xmlexprt.hxx"
#include "XMLExportSharedData.hxx"
#include "XMLStylesExportHelper.hxx"
#include <document.hxx>
#include <osl/diagnose.h>
using namespace ::com::sun::star;
ScMyIteratorBase::ScMyIteratorBase()
{
}
ScMyIteratorBase::~ScMyIteratorBase()
{
}
void ScMyIteratorBase::UpdateAddress( ScAddress& rCellAddress )
{
ScAddress aNewAddr( rCellAddress );
if( GetFirstAddress( aNewAddr ) )
{
if( ( aNewAddr.Tab() == rCellAddress.Tab() ) &&
( ( aNewAddr.Row() < rCellAddress.Row() ) ||
( ( aNewAddr.Row() == rCellAddress.Row() ) && ( aNewAddr.Col() < rCellAddress.Col() ) ) ) )
rCellAddress = aNewAddr;
}
}
inline bool ScMyShape::operator<(const ScMyShape& aShape) const
{
return aAddress.lessThanByRow( aShape.aAddress );
}
ScMyShapesContainer::ScMyShapesContainer()
{
}
ScMyShapesContainer::~ScMyShapesContainer()
{
}
void ScMyShapesContainer::AddNewShape( const ScMyShape& aShape )
{
aShapeList.push_back(aShape);
}
bool ScMyShapesContainer::GetFirstAddress( ScAddress& rCellAddress )
{
SCTAB nTable( rCellAddress.Tab() );
if( !aShapeList.empty() )
{
rCellAddress = aShapeList.begin()->aAddress;
return ( nTable == rCellAddress.Tab() );
}
return false;
}
void ScMyShapesContainer::SetCellData( ScMyCell& rMyCell )
{
rMyCell.aShapeList.clear();
ScMyShapeList::iterator aItr(aShapeList.begin());
ScMyShapeList::iterator aEndItr(aShapeList.end());
while( (aItr != aEndItr) && (aItr->aAddress == rMyCell.maCellAddress) )
{
rMyCell.aShapeList.push_back(*aItr);
aItr = aShapeList.erase(aItr);
}
rMyCell.bHasShape = !rMyCell.aShapeList.empty();
}
void ScMyShapesContainer::SkipTable(SCTAB nSkip)
{
ScMyShapeList::iterator aItr = std::find_if_not(aShapeList.begin(), aShapeList.end(),
[&nSkip](const ScMyShape& rShape) { return rShape.aAddress.Tab() == nSkip; });
aShapeList.erase(aShapeList.begin(), aItr);
}
void ScMyShapesContainer::Sort()
{
aShapeList.sort();
}
inline bool ScMyNoteShape::operator<(const ScMyNoteShape& aNote) const
{
return aPos.lessThanByRow( aNote.aPos );
}
ScMyNoteShapesContainer::ScMyNoteShapesContainer()
{
}
ScMyNoteShapesContainer::~ScMyNoteShapesContainer()
{
}
void ScMyNoteShapesContainer::AddNewNote( const ScMyNoteShape& aNote )
{
aNoteShapeList.push_back(aNote);
}
bool ScMyNoteShapesContainer::GetFirstAddress( ScAddress& rCellAddress )
{
SCTAB nTable = rCellAddress.Tab();
if( !aNoteShapeList.empty() )
{
rCellAddress = aNoteShapeList.begin()->aPos;
return ( nTable == rCellAddress.Tab() );
}
return false;
}
void ScMyNoteShapesContainer::SetCellData( ScMyCell& rMyCell )
{
ScMyNoteShapeList::iterator aItr = std::find_if_not(aNoteShapeList.begin(), aNoteShapeList.end(),
[&rMyCell](const ScMyNoteShape& rNoteShape) { return rNoteShape.aPos == rMyCell.maCellAddress; });
aNoteShapeList.erase(aNoteShapeList.begin(), aItr);
}
void ScMyNoteShapesContainer::SkipTable(SCTAB nSkip)
{
ScMyNoteShapeList::iterator aItr = std::find_if_not(aNoteShapeList.begin(), aNoteShapeList.end(),
[&nSkip](const ScMyNoteShape& rNoteShape) { return rNoteShape.aPos.Tab() == nSkip; });
aNoteShapeList.erase(aNoteShapeList.begin(), aItr);
}
void ScMyNoteShapesContainer::Sort()
{
aNoteShapeList.sort();
}
inline bool ScMyMergedRange::operator<(const ScMyMergedRange& aRange) const
{
return aCellRange.aStart.lessThanByRow( aRange.aCellRange.aStart );
}
ScMyMergedRangesContainer::ScMyMergedRangesContainer()
{
}
ScMyMergedRangesContainer::~ScMyMergedRangesContainer()
{
}
void ScMyMergedRangesContainer::AddRange(const ScRange& rMergedRange)
{
SCROW nStartRow( rMergedRange.aStart.Row() );
SCROW nEndRow( rMergedRange.aEnd.Row() );
ScMyMergedRange aRange;
aRange.bIsFirst = true;
aRange.aCellRange = rMergedRange;
aRange.aCellRange.aEnd.SetRow( nStartRow );
aRange.nRows = nEndRow - nStartRow + 1;
aRangeList.push_back( aRange );
aRange.bIsFirst = false;
aRange.nRows = 0;
for( SCROW nRow = nStartRow + 1; nRow <= nEndRow; ++nRow )
{
aRange.aCellRange.aStart.SetRow( nRow );
aRange.aCellRange.aEnd.SetRow( nRow );
aRangeList.push_back(aRange);
}
}
bool ScMyMergedRangesContainer::GetFirstAddress( ScAddress& rCellAddress )
{
SCTAB nTable( rCellAddress.Tab() );
if( !aRangeList.empty() )
{
rCellAddress = aRangeList.begin()->aCellRange.aStart;
return ( nTable == rCellAddress.Tab() );
}
return false;
}
void ScMyMergedRangesContainer::SetCellData( ScMyCell& rMyCell )
{
rMyCell.bIsMergedBase = rMyCell.bIsCovered = false;
ScMyMergedRangeList::iterator aItr(aRangeList.begin());
if( aItr == aRangeList.end() )
return;
if( aItr->aCellRange.aStart != rMyCell.aCellAddress )
return;
rMyCell.aMergeRange = aItr->aCellRange;
if (aItr->bIsFirst)
rMyCell.aMergeRange.aEnd.SetRow( rMyCell.aMergeRange.aStart.Row() + aItr->nRows - 1 );
rMyCell.bIsMergedBase = aItr->bIsFirst;
rMyCell.bIsCovered = !aItr->bIsFirst;
if( aItr->aCellRange.aStart.Col() < aItr->aCellRange.aEnd.Col() )
{
aItr->aCellRange.aStart.IncCol( 1 );
aItr->bIsFirst = false;
}
else
aRangeList.erase(aItr);
}
void ScMyMergedRangesContainer::SkipTable(SCTAB nSkip)
{
ScMyMergedRangeList::iterator aItr = std::find_if_not(aRangeList.begin(), aRangeList.end(),
[&nSkip](const ScMyMergedRange& rRange) { return rRange.aCellRange.aStart.Tab() == nSkip; });
aRangeList.erase(aRangeList.begin(), aItr);
}
void ScMyMergedRangesContainer::Sort()
{
aRangeList.sort();
}
bool ScMyAreaLink::Compare( const ScMyAreaLink& rAreaLink ) const
{
return (GetRowCount() == rAreaLink.GetRowCount()) &&
(sFilter == rAreaLink.sFilter) &&
(sFilterOptions == rAreaLink.sFilterOptions) &&
(sURL == rAreaLink.sURL) &&
(sSourceStr == rAreaLink.sSourceStr);
}
inline bool ScMyAreaLink::operator<(const ScMyAreaLink& rAreaLink ) const
{
return aDestRange.aStart.lessThanByRow( rAreaLink.aDestRange.aStart );
}
ScMyAreaLinksContainer::ScMyAreaLinksContainer()
{
}
ScMyAreaLinksContainer::~ScMyAreaLinksContainer()
{
}
bool ScMyAreaLinksContainer::GetFirstAddress( ScAddress& rCellAddress )
{
SCTAB nTable( rCellAddress.Tab() );
if( !aAreaLinkList.empty() )
{
rCellAddress = aAreaLinkList.begin()->aDestRange.aStart;
return ( nTable == rCellAddress.Tab() );
}
return false;
}
void ScMyAreaLinksContainer::SetCellData( ScMyCell& rMyCell )
{
rMyCell.bHasAreaLink = false;
ScMyAreaLinkList::iterator aItr(aAreaLinkList.begin());
if( aItr == aAreaLinkList.end() )
return;
if( aItr->aDestRange.aStart != rMyCell.aCellAddress )
return;
rMyCell.bHasAreaLink = true;
rMyCell.aAreaLink = *aItr;
aItr = aAreaLinkList.erase( aItr );
bool bFound = true;
while (aItr != aAreaLinkList.end() && bFound)
{
if ( aItr->aDestRange.aStart == rMyCell.aCellAddress )
{
OSL_FAIL("more than one linked range on one cell");
aItr = aAreaLinkList.erase( aItr );
}
else
bFound = false;
}
}
void ScMyAreaLinksContainer::SkipTable(SCTAB nSkip)
{
ScMyAreaLinkList::iterator aItr = std::find_if_not(aAreaLinkList.begin(), aAreaLinkList.end(),
[&nSkip](const ScMyAreaLink& rAreaLink) { return rAreaLink.aDestRange.aStart.Tab() == nSkip; });
aAreaLinkList.erase(aAreaLinkList.begin(), aItr);
}
void ScMyAreaLinksContainer::Sort()
{
aAreaLinkList.sort();
}
ScMyEmptyDatabaseRangesContainer::ScMyEmptyDatabaseRangesContainer()
{
}
ScMyEmptyDatabaseRangesContainer::~ScMyEmptyDatabaseRangesContainer()
{
}
void ScMyEmptyDatabaseRangesContainer::AddNewEmptyDatabaseRange(const table::CellRangeAddress& aCellRange)
{
SCROW nStartRow(aCellRange.StartRow);
SCROW nEndRow(aCellRange.EndRow);
ScRange aRange( aCellRange.StartColumn, aCellRange.StartRow, aCellRange.Sheet,
aCellRange.EndColumn, aCellRange.EndRow, aCellRange.Sheet );
for( SCROW nRow = nStartRow; nRow <= nEndRow; ++nRow )
{
aRange.aStart.SetRow( nRow );
aRange.aEnd.SetRow( nRow );
aDatabaseList.push_back( aRange );
}
}
bool ScMyEmptyDatabaseRangesContainer::GetFirstAddress( ScAddress& rCellAddress )
{
SCTAB nTable( rCellAddress.Tab() );
if( !aDatabaseList.empty() )
{
rCellAddress = aDatabaseList.begin()->aStart;
return ( nTable == rCellAddress.Tab() );
}
return false;
}
void ScMyEmptyDatabaseRangesContainer::SetCellData( ScMyCell& rMyCell )
{
rMyCell.bHasEmptyDatabase = false;
ScMyEmptyDatabaseRangeList::iterator aItr(aDatabaseList.begin());
if( aItr != aDatabaseList.end() )
{
if( aItr->aStart == rMyCell.aCellAddress )
{
rMyCell.bHasEmptyDatabase = true;
if( aItr->aStart.Col() < aItr->aEnd.Col() )
aItr->aStart.SetCol( aItr->aStart.Col() + 1 );
else
aDatabaseList.erase(aItr);
}
}
}
void ScMyEmptyDatabaseRangesContainer::SkipTable(SCTAB nSkip)
{
ScMyEmptyDatabaseRangeList::iterator aItr = std::find_if_not(aDatabaseList.begin(), aDatabaseList.end(),
[&nSkip](const ScRange& rDatabase) { return rDatabase.aStart.Tab() == nSkip; });
aDatabaseList.erase(aDatabaseList.begin(), aItr);
}
void ScMyEmptyDatabaseRangesContainer::Sort()
{
aDatabaseList.sort();
}
inline bool ScMyDetectiveObj::operator<( const ScMyDetectiveObj& rDetObj) const
{
return aPosition.lessThanByRow( rDetObj.aPosition );
}
ScMyDetectiveObjContainer::ScMyDetectiveObjContainer()
{
}
ScMyDetectiveObjContainer::~ScMyDetectiveObjContainer()
{
}
void ScMyDetectiveObjContainer::AddObject( ScDetectiveObjType eObjType, const SCTAB nSheet,
const ScAddress& rPosition, const ScRange& rSourceRange,
bool bHasError )
{
if( !((eObjType == SC_DETOBJ_ARROW) ||
(eObjType == SC_DETOBJ_FROMOTHERTAB) ||
(eObjType == SC_DETOBJ_TOOTHERTAB) ||
(eObjType == SC_DETOBJ_CIRCLE)) )
return;
ScMyDetectiveObj aDetObj;
aDetObj.eObjType = eObjType;
if( eObjType == SC_DETOBJ_TOOTHERTAB )
aDetObj.aPosition = rSourceRange.aStart;
else
aDetObj.aPosition = rPosition;
aDetObj.aSourceRange = rSourceRange;
// #111064#; take the sheet where the object is found and not the sheet given in the ranges, because they are not always true
if (eObjType != SC_DETOBJ_FROMOTHERTAB)
{
// if the ObjType == SC_DETOBJ_FROMOTHERTAB then the SourceRange is not used and so it has not to be tested and changed
OSL_ENSURE(aDetObj.aPosition.Tab() == aDetObj.aSourceRange.aStart.Tab(), "It seems to be possible to have different sheets");
aDetObj.aSourceRange.aStart.SetTab( nSheet );
aDetObj.aSourceRange.aEnd.SetTab( nSheet );
}
aDetObj.aPosition.SetTab( nSheet );
aDetObj.bHasError = bHasError;
aDetectiveObjList.push_back( aDetObj );
}
bool ScMyDetectiveObjContainer::GetFirstAddress( ScAddress& rCellAddress )
{
SCTAB nTable( rCellAddress.Tab() );
if( !aDetectiveObjList.empty() )
{
rCellAddress = aDetectiveObjList.begin()->aPosition;
return ( nTable == rCellAddress.Tab() );
}
return false;
}
void ScMyDetectiveObjContainer::SetCellData( ScMyCell& rMyCell )
{
rMyCell.aDetectiveObjVec.clear();
ScMyDetectiveObjList::iterator aItr(aDetectiveObjList.begin());
ScMyDetectiveObjList::iterator aEndItr(aDetectiveObjList.end());
while( (aItr != aEndItr) && (aItr->aPosition == rMyCell.aCellAddress) )
{
rMyCell.aDetectiveObjVec.push_back( *aItr );
aItr = aDetectiveObjList.erase( aItr );
}
rMyCell.bHasDetectiveObj = (!rMyCell.aDetectiveObjVec.empty());
}
void ScMyDetectiveObjContainer::SkipTable(SCTAB nSkip)
{
ScMyDetectiveObjList::iterator aItr = std::find_if_not(aDetectiveObjList.begin(), aDetectiveObjList.end(),
[&nSkip](const ScMyDetectiveObj& rDetectiveObj) { return rDetectiveObj.aPosition.Tab() == nSkip; });
aDetectiveObjList.erase(aDetectiveObjList.begin(), aItr);
}
void ScMyDetectiveObjContainer::Sort()
{
aDetectiveObjList.sort();
}
inline bool ScMyDetectiveOp::operator<( const ScMyDetectiveOp& rDetOp) const
{
return aPosition.lessThanByRow( rDetOp.aPosition );
}
ScMyDetectiveOpContainer::ScMyDetectiveOpContainer()
{
}
ScMyDetectiveOpContainer::~ScMyDetectiveOpContainer()
{
}
void ScMyDetectiveOpContainer::AddOperation( ScDetOpType eOpType, const ScAddress& rPosition, sal_uInt32 nIndex )
{
ScMyDetectiveOp aDetOp;
aDetOp.eOpType = eOpType;
aDetOp.aPosition = rPosition;
aDetOp.nIndex = nIndex;
aDetectiveOpList.push_back( aDetOp );
}
bool ScMyDetectiveOpContainer::GetFirstAddress( ScAddress& rCellAddress )
{
SCTAB nTable( rCellAddress.Tab() );
if( !aDetectiveOpList.empty() )
{
rCellAddress = aDetectiveOpList.begin()->aPosition;
return ( nTable == rCellAddress.Tab() );
}
return false;
}
void ScMyDetectiveOpContainer::SetCellData( ScMyCell& rMyCell )
{
rMyCell.aDetectiveOpVec.clear();
ScMyDetectiveOpList::iterator aItr(aDetectiveOpList.begin());
ScMyDetectiveOpList::iterator aEndItr(aDetectiveOpList.end());
while( (aItr != aEndItr) && (aItr->aPosition == rMyCell.aCellAddress) )
{
rMyCell.aDetectiveOpVec.push_back( *aItr );
aItr = aDetectiveOpList.erase( aItr );
}
rMyCell.bHasDetectiveOp = (!rMyCell.aDetectiveOpVec.empty());
}
void ScMyDetectiveOpContainer::SkipTable(SCTAB nSkip)
{
ScMyDetectiveOpList::iterator aItr = std::find_if_not(aDetectiveOpList.begin(), aDetectiveOpList.end(),
[&nSkip](const ScMyDetectiveOp& rDetectiveOp) { return rDetectiveOp.aPosition.Tab() == nSkip; });
aDetectiveOpList.erase(aDetectiveOpList.begin(), aItr);
}
void ScMyDetectiveOpContainer::Sort()
{
aDetectiveOpList.sort();
}
ScMyCell::ScMyCell() :
pNote(nullptr),
nValidationIndex(-1),
nStyleIndex(-1),
nNumberFormat(-1),
nType(table::CellContentType_EMPTY),
bIsAutoStyle( false ),
bHasShape( false ),
bIsMergedBase( false ),
bIsCovered( false ),
bHasAreaLink( false ),
bHasEmptyDatabase( false ),
bHasDetectiveObj( false ),
bHasDetectiveOp( false ),
bIsMatrixBase( false ),
bIsMatrixCovered( false ),
bHasAnnotation( false )
{
}
ScMyNotEmptyCellsIterator::ScMyNotEmptyCellsIterator(ScXMLExport& rTempXMLExport)
: pShapes(nullptr),
pNoteShapes(nullptr),
pEmptyDatabaseRanges(nullptr),
pMergedRanges(nullptr),
pAreaLinks(nullptr),
pDetectiveObj(nullptr),
pDetectiveOp(nullptr),
rExport(rTempXMLExport),
nCellCol(0),
nCellRow(0),
nCurrentTable(SCTAB_MAX)
{
}
ScMyNotEmptyCellsIterator::~ScMyNotEmptyCellsIterator()
{
Clear();
}
void ScMyNotEmptyCellsIterator::Clear()
{
mpCellItr.reset();
pShapes = nullptr;
pNoteShapes = nullptr;
pMergedRanges = nullptr;
pAreaLinks = nullptr;
pEmptyDatabaseRanges = nullptr;
pDetectiveObj = nullptr;
pDetectiveOp = nullptr;
nCurrentTable = SCTAB_MAX;
}
void ScMyNotEmptyCellsIterator::UpdateAddress( ScAddress& rAddress )
{
if (mpCellItr->GetPos(nCellCol, nCellRow))
{
rAddress.SetCol( nCellCol );
rAddress.SetRow( nCellRow );
}
}
void ScMyNotEmptyCellsIterator::SetCellData( ScMyCell& rMyCell, const ScAddress& rAddress )
{
rMyCell.maBaseCell.clear();
rMyCell.aCellAddress = rAddress;
rMyCell.maCellAddress = rMyCell.aCellAddress;
if( ( nCellCol == rAddress.Col() ) && ( nCellRow == rAddress.Row() ) )
{
const ScRefCellValue* pCell = mpCellItr->GetNext(nCellCol, nCellRow);
if (pCell)
rMyCell.maBaseCell = *pCell;
}
rMyCell.bIsMatrixCovered = false;
rMyCell.bIsMatrixBase = false;
switch (rMyCell.maBaseCell.meType)
{
case CELLTYPE_VALUE:
rMyCell.nType = table::CellContentType_VALUE;
break;
case CELLTYPE_STRING:
case CELLTYPE_EDIT:
rMyCell.nType = table::CellContentType_TEXT;
break;
case CELLTYPE_FORMULA:
rMyCell.nType = table::CellContentType_FORMULA;
break;
default:
rMyCell.nType = table::CellContentType_EMPTY;
}
if (rMyCell.maBaseCell.meType == CELLTYPE_FORMULA)
{
bool bIsMatrixBase = false;
if (rExport.IsMatrix(rMyCell.maCellAddress, rMyCell.aMatrixRange, bIsMatrixBase))
{
rMyCell.bIsMatrixBase = bIsMatrixBase;
rMyCell.bIsMatrixCovered = !bIsMatrixBase;
}
}
}
void ScMyNotEmptyCellsIterator::HasAnnotation(ScMyCell& aCell)
{
aCell.bHasAnnotation = false;
ScPostIt* pNote = rExport.GetDocument()->GetNote(aCell.maCellAddress);
if(pNote)
{
aCell.bHasAnnotation = true;
aCell.pNote = pNote;
}
}
void ScMyNotEmptyCellsIterator::SetCurrentTable(const SCTAB nTable,
const uno::Reference<sheet::XSpreadsheet>& rxTable)
{
aLastAddress.SetRow( 0 );
aLastAddress.SetCol( 0 );
aLastAddress.SetTab( nTable );
if (nCurrentTable == nTable)
return;
nCurrentTable = nTable;
mpCellItr.reset(
new ScHorizontalCellIterator(
*rExport.GetDocument(), nCurrentTable, 0, 0,
static_cast<SCCOL>(rExport.GetSharedData()->GetLastColumn(nCurrentTable)),
static_cast<SCROW>(rExport.GetSharedData()->GetLastRow(nCurrentTable))));
xTable.set(rxTable);
xCellRange.set(xTable);
}
void ScMyNotEmptyCellsIterator::SkipTable(SCTAB nSkip)
{
// Skip entries for a sheet that is copied instead of saving normally.
// Cells are handled separately in SetCurrentTable.
if( pShapes )
pShapes->SkipTable(nSkip);
if( pNoteShapes )
pNoteShapes->SkipTable(nSkip);
if( pEmptyDatabaseRanges )
pEmptyDatabaseRanges->SkipTable(nSkip);
if( pMergedRanges )
pMergedRanges->SkipTable(nSkip);
if( pAreaLinks )
pAreaLinks->SkipTable(nSkip);
if( pDetectiveObj )
pDetectiveObj->SkipTable(nSkip);
if( pDetectiveOp )
pDetectiveOp->SkipTable(nSkip);
}
bool ScMyNotEmptyCellsIterator::GetNext(ScMyCell& aCell, ScFormatRangeStyles* pCellStyles)
{
ScDocument* pDoc = rExport.GetDocument();
ScAddress aAddress( pDoc->MaxCol() + 1, pDoc->MaxRow() + 1, nCurrentTable );
UpdateAddress( aAddress );
if( pShapes )
pShapes->UpdateAddress( aAddress );
if( pNoteShapes )
pNoteShapes->UpdateAddress( aAddress );
if( pEmptyDatabaseRanges )
pEmptyDatabaseRanges->UpdateAddress( aAddress );
if( pMergedRanges )
pMergedRanges->UpdateAddress( aAddress );
if( pAreaLinks )
pAreaLinks->UpdateAddress( aAddress );
if( pDetectiveObj )
pDetectiveObj->UpdateAddress( aAddress );
if( pDetectiveOp )
pDetectiveOp->UpdateAddress( aAddress );
bool bFoundCell( ( aAddress.Col() <= pDoc->MaxCol() ) && ( aAddress.Row() <= pDoc->MaxRow() + 1 ) );
if( bFoundCell )
{
SetCellData( aCell, aAddress );
if( pShapes )
pShapes->SetCellData( aCell );
if( pNoteShapes )
pNoteShapes->SetCellData( aCell );
if( pEmptyDatabaseRanges )
pEmptyDatabaseRanges->SetCellData( aCell );
if( pMergedRanges )
pMergedRanges->SetCellData( aCell );
if( pAreaLinks )
pAreaLinks->SetCellData( aCell );
if( pDetectiveObj )
pDetectiveObj->SetCellData( aCell );
if( pDetectiveOp )
pDetectiveOp->SetCellData( aCell );
HasAnnotation( aCell );
bool bIsAutoStyle;
// Ranges before the previous cell are not needed by ExportFormatRanges anymore and can be removed
SCROW nRemoveBeforeRow = aLastAddress.Row();
aCell.nStyleIndex = pCellStyles->GetStyleNameIndex(aCell.maCellAddress.Tab(),
aCell.maCellAddress.Col(), aCell.maCellAddress.Row(),
bIsAutoStyle, aCell.nValidationIndex, aCell.nNumberFormat, nRemoveBeforeRow);
aLastAddress = aCell.aCellAddress;
aCell.bIsAutoStyle = bIsAutoStyle;
//#102799#; if the cell is in a DatabaseRange which should saved empty, the cell should have the type empty
if (aCell.bHasEmptyDatabase)
aCell.nType = table::CellContentType_EMPTY;
}
return bFoundCell;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|