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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#ifndef _DOCARY_HXX
#define _DOCARY_HXX
#include <com/sun/star/i18n/ForbiddenCharacters.hpp>
#include <vector>
#include <set>
#include <algorithm>
#include <o3tl/sorted_vector.hxx>
class SwFieldType;
class SwFmt;
class SwFrmFmt;
class SwCharFmt;
class SwTOXType;
class SwUndo;
class SwSectionFmt;
class SwNumRule;
class SwRedline;
class SwUnoCrsr;
class SwOLENode;
class SwTxtFmtColl;
class SwGrfFmtColl;
namespace com { namespace sun { namespace star { namespace i18n {
struct ForbiddenCharacters; ///< comes from the I18N UNO interface
}}}}
#include <swtypes.hxx>
/** provides some methods for generic operations on lists that contain
SwFmt* subclasses. */
class SwFmtsBase
{
public:
virtual size_t GetFmtCount() const = 0;
virtual SwFmt* GetFmt(size_t idx) const = 0;
virtual ~SwFmtsBase() = 0;
};
class SwGrfFmtColls : public std::vector<SwGrfFmtColl*>, public SwFmtsBase
{
public:
virtual size_t GetFmtCount() const { return size(); }
virtual SwFmt* GetFmt(size_t idx) const { return (SwFmt*)operator[](idx); }
sal_uInt16 GetPos(const SwGrfFmtColl* pFmt) const;
/// free's any remaining child objects
virtual ~SwGrfFmtColls() {}
};
/// Specific frame formats (frames, DrawObjects).
class SW_DLLPUBLIC SwFrmFmts : public std::vector<SwFrmFmt*>, public SwFmtsBase
{
public:
virtual size_t GetFmtCount() const { return size(); }
virtual SwFmt* GetFmt(size_t idx) const { return (SwFmt*)operator[](idx); }
sal_uInt16 GetPos(const SwFrmFmt* pFmt) const;
bool Contains(const SwFrmFmt* pFmt) const;
/// free's any remaining child objects
virtual ~SwFrmFmts();
};
class SwCharFmts : public std::vector<SwCharFmt*>, public SwFmtsBase
{
public:
virtual size_t GetFmtCount() const { return size(); }
virtual SwFmt* GetFmt(size_t idx) const { return (SwFmt*)operator[](idx); }
sal_uInt16 GetPos(const SwCharFmt* pFmt) const;
bool Contains(const SwCharFmt* pFmt) const;
/// free's any remaining child objects
virtual ~SwCharFmts();
};
class SwTxtFmtColls : public std::vector<SwTxtFmtColl*>, public SwFmtsBase
{
public:
virtual size_t GetFmtCount() const { return size(); }
virtual SwFmt* GetFmt(size_t idx) const { return (SwFmt*)operator[](idx); }
sal_uInt16 GetPos(const SwTxtFmtColl* pFmt) const;
virtual ~SwTxtFmtColls() {}
};
/// Array of Undo-history.
class SW_DLLPUBLIC SwSectionFmts : public std::vector<SwSectionFmt*>, public SwFmtsBase
{
public:
virtual size_t GetFmtCount() const { return size(); }
virtual SwFmt* GetFmt(size_t idx) const { return (SwFmt*)operator[](idx); }
sal_uInt16 GetPos(const SwSectionFmt* pFmt) const;
bool Contains(const SwSectionFmt* pFmt) const;
/// free's any remaining child objects
virtual ~SwSectionFmts();
};
class SwFldTypes : public std::vector<SwFieldType*> {
public:
/// the destructor will free all objects still in the vector
~SwFldTypes();
sal_uInt16 GetPos(const SwFieldType* pFieldType) const;
};
class SwTOXTypes : public std::vector<SwTOXType*> {
public:
/// the destructor will free all objects still in the vector
~SwTOXTypes();
sal_uInt16 GetPos(const SwTOXType* pTOXType) const;
};
class SW_DLLPUBLIC SwNumRuleTbl : public std::vector<SwNumRule*> {
public:
/// the destructor will free all objects still in the vector
~SwNumRuleTbl();
sal_uInt16 GetPos(const SwNumRule* pRule) const;
};
struct CompareSwRedlineTbl
{
bool operator()(SwRedline* const &lhs, SwRedline* const &rhs) const;
};
class _SwRedlineTbl
: public o3tl::sorted_vector<SwRedline*, CompareSwRedlineTbl,
o3tl::find_partialorder_ptrequals>
{
public:
~_SwRedlineTbl();
};
class SwRedlineTbl : private _SwRedlineTbl
{
public:
bool Contains(const SwRedline* p) const { return find(const_cast<SwRedline* const>(p)) != end(); }
sal_uInt16 GetPos(const SwRedline* p) const;
bool Insert( SwRedline* p, bool bIns = true );
bool Insert( SwRedline* p, sal_uInt16& rInsPos, bool bIns = true );
bool InsertWithValidRanges( SwRedline* p, sal_uInt16* pInsPos = 0 );
void Remove( sal_uInt16 nPos );
bool Remove( const SwRedline* p );
void DeleteAndDestroy( sal_uInt16 nPos, sal_uInt16 nLen = 1 );
void DeleteAndDestroyAll();
/** Search next or previous Redline with the same Seq. No.
Search can be restricted via Lookahaed.
Using 0 or USHRT_MAX makes search the whole array. */
sal_uInt16 FindNextOfSeqNo( sal_uInt16 nSttPos, sal_uInt16 nLookahead = 20 ) const;
sal_uInt16 FindPrevOfSeqNo( sal_uInt16 nSttPos, sal_uInt16 nLookahead = 20 ) const;
sal_uInt16 FindNextSeqNo( sal_uInt16 nSeqNo, sal_uInt16 nSttPos,
sal_uInt16 nLookahead = 20 ) const;
sal_uInt16 FindPrevSeqNo( sal_uInt16 nSeqNo, sal_uInt16 nSttPos,
sal_uInt16 nLookahead = 20 ) const;
using _SwRedlineTbl::size;
using _SwRedlineTbl::operator[];
using _SwRedlineTbl::empty;
};
class SwUnoCrsrTbl : public std::set<SwUnoCrsr*> {
public:
/// the destructor will free all objects still in the set
~SwUnoCrsrTbl();
};
class SwOLENodes : public std::vector<SwOLENode*> {};
#endif //_DOCARY_HXX
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
