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
|
/* -*- 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 .
*/
#ifndef INCLUDED_SC_SOURCE_FILTER_XML_XMLEXPORTITERATOR_HXX
#define INCLUDED_SC_SOURCE_FILTER_XML_XMLEXPORTITERATOR_HXX
#include <vector>
#include <list>
#include <set>
#include <com/sun/star/sheet/XSpreadsheet.hpp>
#include <com/sun/star/table/CellAddress.hpp>
#include <com/sun/star/table/CellRangeAddress.hpp>
#include <com/sun/star/table/XCell.hpp>
#include <com/sun/star/text/XText.hpp>
#include <com/sun/star/sheet/XSheetAnnotation.hpp>
#include <com/sun/star/drawing/XShape.hpp>
#include "global.hxx"
#include "detfunc.hxx"
#include "detdata.hxx"
#include "postit.hxx"
#include "cellvalue.hxx"
#include <memory>
class ScHorizontalCellIterator;
struct ScMyCell;
class ScXMLExport;
class ScFormatRangeStyles;
class ScMyIteratorBase
{
protected:
virtual bool GetFirstAddress( css::table::CellAddress& rCellAddress ) = 0;
public:
ScMyIteratorBase();
virtual ~ScMyIteratorBase();
virtual void SetCellData( ScMyCell& rMyCell ) = 0;
virtual void Sort() = 0;
void UpdateAddress( css::table::CellAddress& rCellAddress );
};
struct ScMyShape
{
ScAddress aAddress;
ScAddress aEndAddress;
sal_Int32 nEndX;
sal_Int32 nEndY;
css::uno::Reference<css::drawing::XShape> xShape;
bool operator<(const ScMyShape& aShape) const;
};
typedef std::list<ScMyShape> ScMyShapeList;
class ScMyShapesContainer : public ScMyIteratorBase
{
private:
ScMyShapeList aShapeList;
protected:
virtual bool GetFirstAddress( css::table::CellAddress& rCellAddress ) override;
public:
ScMyShapesContainer();
virtual ~ScMyShapesContainer();
using ScMyIteratorBase::UpdateAddress;
void AddNewShape(const ScMyShape& aShape);
bool HasShapes() { return !aShapeList.empty(); }
const ScMyShapeList& GetShapes() const { return aShapeList; }
virtual void SetCellData( ScMyCell& rMyCell ) override;
virtual void Sort() override;
void SkipTable(SCTAB nSkip);
};
struct ScMyNoteShape
{
css::uno::Reference<css::drawing::XShape> xShape;
ScAddress aPos;
bool operator<(const ScMyNoteShape& aNote) const;
};
typedef std::list<ScMyNoteShape> ScMyNoteShapeList;
class ScMyNoteShapesContainer : public ScMyIteratorBase
{
private:
ScMyNoteShapeList aNoteShapeList;
protected:
virtual bool GetFirstAddress( css::table::CellAddress& rCellAddress ) override;
public:
ScMyNoteShapesContainer();
virtual ~ScMyNoteShapesContainer();
using ScMyIteratorBase::UpdateAddress;
void AddNewNote(const ScMyNoteShape& aNote);
const ScMyNoteShapeList& GetNotes() const { return aNoteShapeList; }
virtual void SetCellData( ScMyCell& rMyCell ) override;
virtual void Sort() override;
void SkipTable(SCTAB nSkip);
};
struct ScMyMergedRange
{
css::table::CellRangeAddress aCellRange;
sal_Int32 nRows;
bool bIsFirst;
bool operator<(const ScMyMergedRange& aRange) const;
};
typedef std::list<ScMyMergedRange> ScMyMergedRangeList;
class ScMyMergedRangesContainer : public ScMyIteratorBase
{
private:
ScMyMergedRangeList aRangeList;
protected:
virtual bool GetFirstAddress( css::table::CellAddress& rCellAddress ) override;
public:
ScMyMergedRangesContainer();
virtual ~ScMyMergedRangesContainer();
void AddRange(const css::table::CellRangeAddress& rMergedRange);
using ScMyIteratorBase::UpdateAddress;
virtual void SetCellData( ScMyCell& rMyCell ) override;
virtual void Sort() override; // + remove doublets
void SkipTable(SCTAB nSkip);
};
struct ScMyAreaLink
{
OUString sFilter;
OUString sFilterOptions;
OUString sURL;
OUString sSourceStr;
css::table::CellRangeAddress aDestRange;
sal_Int32 nRefresh;
inline ScMyAreaLink() : nRefresh( 0 ) {}
inline sal_Int32 GetColCount() const { return aDestRange.EndColumn - aDestRange.StartColumn + 1; }
inline sal_Int32 GetRowCount() const { return aDestRange.EndRow - aDestRange.StartRow + 1; }
bool Compare( const ScMyAreaLink& rAreaLink ) const;
bool operator<(const ScMyAreaLink& rAreaLink ) const;
};
typedef ::std::list< ScMyAreaLink > ScMyAreaLinkList;
class ScMyAreaLinksContainer : public ScMyIteratorBase
{
private:
ScMyAreaLinkList aAreaLinkList;
protected:
virtual bool GetFirstAddress( css::table::CellAddress& rCellAddress ) override;
public:
ScMyAreaLinksContainer();
virtual ~ScMyAreaLinksContainer();
inline void AddNewAreaLink( const ScMyAreaLink& rAreaLink )
{ aAreaLinkList.push_back( rAreaLink ); }
using ScMyIteratorBase::UpdateAddress;
virtual void SetCellData( ScMyCell& rMyCell ) override;
virtual void Sort() override;
void SkipTable(SCTAB nSkip);
};
struct ScMyCellRangeAddress : css::table::CellRangeAddress
{
explicit ScMyCellRangeAddress(const css::table::CellRangeAddress& rRange);
bool operator<(const ScMyCellRangeAddress& rCellRangeAddress ) const;
};
typedef std::list<ScMyCellRangeAddress> ScMyEmptyDatabaseRangeList;
class ScMyEmptyDatabaseRangesContainer : public ScMyIteratorBase
{
private:
ScMyEmptyDatabaseRangeList aDatabaseList;
protected:
virtual bool GetFirstAddress( css::table::CellAddress& rCellAddress ) override;
public:
ScMyEmptyDatabaseRangesContainer();
virtual ~ScMyEmptyDatabaseRangesContainer();
void AddNewEmptyDatabaseRange(const css::table::CellRangeAddress& aCellRangeAddress);
using ScMyIteratorBase::UpdateAddress;
virtual void SetCellData( ScMyCell& rMyCell ) override;
virtual void Sort() override;
void SkipTable(SCTAB nSkip);
};
struct ScMyDetectiveObj
{
css::table::CellAddress aPosition;
css::table::CellRangeAddress aSourceRange;
ScDetectiveObjType eObjType;
bool bHasError;
bool operator<(const ScMyDetectiveObj& rDetObj) const;
};
typedef ::std::list< ScMyDetectiveObj > ScMyDetectiveObjList;
typedef ::std::vector< ScMyDetectiveObj > ScMyDetectiveObjVec;
class ScMyDetectiveObjContainer : public ScMyIteratorBase
{
private:
ScMyDetectiveObjList aDetectiveObjList;
protected:
virtual bool GetFirstAddress( css::table::CellAddress& rCellAddress ) override;
public:
ScMyDetectiveObjContainer();
virtual ~ScMyDetectiveObjContainer();
void AddObject(
ScDetectiveObjType eObjType,
const SCTAB nSheet,
const ScAddress& rPosition,
const ScRange& rSourceRange,
bool bHasError );
using ScMyIteratorBase::UpdateAddress;
virtual void SetCellData( ScMyCell& rMyCell ) override;
virtual void Sort() override;
void SkipTable(SCTAB nSkip);
};
struct ScMyDetectiveOp
{
css::table::CellAddress aPosition;
ScDetOpType eOpType;
sal_Int32 nIndex;
bool operator<(const ScMyDetectiveOp& rDetOp) const;
};
typedef ::std::list< ScMyDetectiveOp > ScMyDetectiveOpList;
typedef ::std::vector< ScMyDetectiveOp > ScMyDetectiveOpVec;
class ScMyDetectiveOpContainer : public ScMyIteratorBase
{
private:
ScMyDetectiveOpList aDetectiveOpList;
protected:
virtual bool GetFirstAddress( css::table::CellAddress& rCellAddress ) override;
public:
ScMyDetectiveOpContainer();
virtual ~ScMyDetectiveOpContainer();
void AddOperation( ScDetOpType eOpType, const ScAddress& rPosition, sal_uInt32 nIndex );
using ScMyIteratorBase::UpdateAddress;
virtual void SetCellData( ScMyCell& rMyCell ) override;
virtual void Sort() override;
void SkipTable(SCTAB nSkip);
};
// contains data to export for the current cell position
struct ScMyCell
{
ScAddress maCellAddress; /// Use this instead of the UNO one.
css::table::CellAddress aCellAddress;
css::table::CellRangeAddress aMergeRange;
css::table::CellRangeAddress aMatrixRange;
ScMyAreaLink aAreaLink;
ScMyShapeList aShapeList;
ScMyDetectiveObjVec aDetectiveObjVec;
ScMyDetectiveOpVec aDetectiveOpVec;
ScPostIt* pNote;
sal_Int32 nValidationIndex;
sal_Int32 nStyleIndex;
sal_Int32 nNumberFormat;
css::table::CellContentType nType;
ScRefCellValue maBaseCell;
bool bIsAutoStyle;
bool bHasShape;
bool bIsMergedBase;
bool bIsCovered;
bool bHasAreaLink;
bool bHasEmptyDatabase;
bool bHasDetectiveObj;
bool bHasDetectiveOp;
bool bIsMatrixBase;
bool bIsMatrixCovered;
bool bHasAnnotation;
ScMyCell();
~ScMyCell();
};
class ScMyNotEmptyCellsIterator
{
ScMyNotEmptyCellsIterator(const ScMyNotEmptyCellsIterator&) = delete;
const ScMyNotEmptyCellsIterator& operator=(const ScMyNotEmptyCellsIterator&) = delete;
css::uno::Reference<css::sheet::XSpreadsheet> xTable;
css::uno::Reference<css::table::XCellRange> xCellRange;
css::table::CellAddress aLastAddress;
ScMyShapesContainer* pShapes;
ScMyNoteShapesContainer* pNoteShapes;
ScMyEmptyDatabaseRangesContainer* pEmptyDatabaseRanges;
ScMyMergedRangesContainer* pMergedRanges;
ScMyAreaLinksContainer* pAreaLinks;
ScMyDetectiveObjContainer* pDetectiveObj;
ScMyDetectiveOpContainer* pDetectiveOp;
ScXMLExport& rExport;
std::unique_ptr<ScHorizontalCellIterator> mpCellItr;
SCCOL nCellCol;
SCROW nCellRow;
SCTAB nCurrentTable;
void UpdateAddress( css::table::CellAddress& rAddress );
void SetCellData( ScMyCell& rMyCell, const css::table::CellAddress& rAddress );
void HasAnnotation( ScMyCell& aCell );
public:
explicit ScMyNotEmptyCellsIterator(ScXMLExport& rExport);
~ScMyNotEmptyCellsIterator();
void Clear();
inline void SetShapes(ScMyShapesContainer* pNewShapes)
{ pShapes = pNewShapes; }
inline void SetNoteShapes(ScMyNoteShapesContainer* pNewNoteShapes)
{ pNoteShapes = pNewNoteShapes; }
inline void SetEmptyDatabaseRanges(ScMyEmptyDatabaseRangesContainer* pNewEmptyDatabaseRanges)
{ pEmptyDatabaseRanges = pNewEmptyDatabaseRanges; }
inline void SetMergedRanges(ScMyMergedRangesContainer* pNewMergedRanges)
{ pMergedRanges = pNewMergedRanges; }
inline void SetAreaLinks(ScMyAreaLinksContainer* pNewAreaLinks)
{ pAreaLinks = pNewAreaLinks; }
inline void SetDetectiveObj(ScMyDetectiveObjContainer* pNewDetectiveObj)
{ pDetectiveObj = pNewDetectiveObj; }
inline void SetDetectiveOp(ScMyDetectiveOpContainer* pNewDetectiveOp)
{ pDetectiveOp = pNewDetectiveOp; }
void SetCurrentTable(const SCTAB nTable,
css::uno::Reference<css::sheet::XSpreadsheet>& rxTable);
void SkipTable(SCTAB nSkip);
bool GetNext(ScMyCell& aCell, ScFormatRangeStyles* pCellStyles);
};
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
