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
|
/* -*- 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 .
*/
#pragma once
#include <sal/types.h>
#include "IMark.hxx"
#include <memory>
#include <optional>
class SwPaM;
struct SwPosition;
class SwTextNode;
class SwCursorShell;
namespace sw::mark {
class AnnotationMark;
class SaveBookmark; // FIXME: Ugly: SaveBookmark is a core-internal class, and should not be used in the interface
class MarkBase;
class Fieldmark;
}
/** Provides access to the marks of a document.
*/
class IDocumentMarkAccess
{
public:
enum class MarkType
{
UNO_BOOKMARK,
DDE_BOOKMARK,
BOOKMARK,
CROSSREF_HEADING_BOOKMARK,
CROSSREF_NUMITEM_BOOKMARK,
ANNOTATIONMARK,
TEXT_FIELDMARK,
CHECKBOX_FIELDMARK,
DROPDOWN_FIELDMARK,
DATE_FIELDMARK,
NAVIGATOR_REMINDER
};
typedef std::vector<::sw::mark::MarkBase*>::const_iterator const_iterator;
typedef std::vector<::sw::mark::MarkBase*>::iterator iterator;
/// To avoid recursive calls of deleteMark, the removal of dummy
/// characters of fieldmarks has to be delayed; this is the baseclass
/// that can be subclassed for that purpose.
struct ILazyDeleter { virtual ~ILazyDeleter() { } };
/** Generates a new mark in the document for a certain selection.
@param rPaM
[in] the selection being marked.
@param rProposedName
[in] the proposed name of the new mark.
@param eMark
[in] the type of the new mark.
@param eMode
[in] is the new mark part of a text copy operation
@returns
a pointer to the new mark (name might have changed).
*/
virtual ::sw::mark::MarkBase* makeMark(const SwPaM& rPaM,
const OUString& rProposedName,
MarkType eMark, ::sw::mark::InsertMode eMode,
SwPosition const* pSepPos = nullptr) = 0;
virtual sw::mark::Fieldmark* makeFieldBookmark( const SwPaM& rPaM,
const OUString& rName,
const OUString& rType,
SwPosition const* pSepPos = nullptr) = 0;
virtual sw::mark::Fieldmark* makeNoTextFieldBookmark( const SwPaM& rPaM,
const OUString& rName,
const OUString& rType) = 0;
virtual sw::mark::MarkBase* makeAnnotationMark(
const SwPaM& rPaM,
const OUString& rName ) = 0;
/** Returns a mark in the document for a paragraph.
If there is none, a mark will be created.
@param rTextNode
[in] the paragraph being marked (a selection over the paragraph is marked)
@param eMark
[in] the type of the new mark.
@returns
a pointer to the new mark (name might have changed).
*/
virtual ::sw::mark::MarkBase* getMarkForTextNode(const SwTextNode& rTextNode,
MarkType eMark) =0;
/** Moves an existing mark to a new selection and performs needed updates.
@param io_pMark
[in/out] the mark to be moved
@param rPaM
[in] new selection to be marked
*/
virtual void repositionMark(::sw::mark::MarkBase* io_pMark,
const SwPaM& rPaM) =0;
/** Renames an existing Mark, if possible.
@param io_pMark
[in/out] the mark to be renamed
@param rNewName
[in] new name for the mark
@returns false, if renaming failed (because the name is already in use)
*/
virtual bool renameMark(::sw::mark::MarkBase* io_pMark,
const OUString& rNewName) =0;
/** Corrects marks (absolute)
This method ignores the previous position of the mark in the paragraph
@param rOldNode
[in] the node from which nodes should be moved
@param rNewPos
[in] new position to which marks will be moved, if nOffset == 0
@param nOffset
[in] the offset by which the mark gets positioned of rNewPos
*/
virtual void correctMarksAbsolute(const SwNode& rOldNode,
const SwPosition& rNewPos,
const sal_Int32 nOffset) =0;
/** Corrects marks (relative)
This method uses the previous position of the mark in the paragraph as offset
@param rOldNode
[in] the node from which nodes should be moved
@param rNewPos
[in] new position to which marks from the start of the paragraph will be
moved, if nOffset == 0
@param nOffset
[in] the offset by which the mark gets positioned of rNewPos in addition to
its old position in the paragraph
*/
virtual void correctMarksRelative(const SwNode& rOldNode,
const SwPosition& rNewPos,
const sal_Int32 nOffset) =0;
/** Deletes marks in a range
Note: navigator reminders are excluded
*/
virtual void deleteMarks(
const SwNode& rStt,
const SwNode& rEnd,
std::vector< ::sw::mark::SaveBookmark>* pSaveBkmk, // Ugly: SaveBookmark is core-internal
std::optional<sal_Int32> oStartContentIdx,
std::optional<sal_Int32> oEndContentIdx,
bool isReplace) = 0;
/** Deletes a mark.
@param ppMark
[in] an iterator pointing to the Mark to be deleted.
@param isMoveNodes
[in] the mark is deleted only temporarily for a node move, do not
remove fieldmark chars.
*/
virtual std::unique_ptr<ILazyDeleter>
deleteMark(const IDocumentMarkAccess::const_iterator& ppMark, bool isMoveNodes) =0;
/** Deletes a mark.
@param ppMark
[in] the name of the mark to be deleted.
*/
virtual void deleteMark(const ::sw::mark::MarkBase* const pMark) =0;
/** Clear (deletes) all marks.
*/
virtual void clearAllMarks() =0;
virtual void assureSortedMarkContainers() const = 0;
/**
* called when we need to sort a sub-range of the container, elements starting
* at nMinIndexModified where modified. This is used from ContentIdxStoreImpl::RestoreBkmks,
* where we are only modifying a small range at the end of the container.
*/
virtual void assureSortedMarkContainers(sal_Int32 nMinIndexModified) const = 0;
/** returns a STL-like random access iterator to the begin of the sequence of marks.
*/
virtual const_iterator getAllMarksBegin() const =0;
/** returns a STL-like random access iterator to the end of the sequence of marks.
*/
virtual const_iterator getAllMarksEnd() const =0;
/** returns the number of marks.
Note: annotation marks are excluded
*/
virtual sal_Int32 getAllMarksCount() const =0;
/** Finds a mark by name.
@param rName
[in] the name of the mark to find.
@returns
an iterator pointing to the mark, or pointing to getAllMarksEnd() if nothing was found.
*/
virtual const_iterator findMark(const OUString& rMark) const =0;
/** Find the first Bookmark that does not start before.
@returns
an iterator pointing to the mark, or pointing to getAllMarksEnd() if nothing was found.
*/
virtual std::vector<sw::mark::Bookmark*>::const_iterator findFirstBookmarkNotStartsBefore(const SwPosition& rPos) const =0;
// interface Bookmarks (BOOKMARK, CROSSREF_NUMITEM_BOOKMARK, CROSSREF_HEADING_BOOKMARK )
/** check if the selection would delete a BOOKMARK */
virtual bool isBookmarkDeleted(SwPaM const& rPaM, bool isReplace) const =0;
/** returns a STL-like random access iterator to the begin of the sequence the Bookmarks.
*/
virtual std::vector<sw::mark::Bookmark*>::const_iterator getBookmarksBegin() const =0;
/** returns a STL-like random access iterator to the end of the sequence of Bookmarks.
*/
virtual std::vector<sw::mark::Bookmark*>::const_iterator getBookmarksEnd() const =0;
/** returns the number of Bookmarks.
*/
virtual sal_Int32 getBookmarksCount() const =0;
/** Finds a bookmark by name.
@param rName
[in] the name of the bookmark to find.
@returns
an iterator pointing to the bookmark, or getBookmarksEnd() if nothing was found.
*/
virtual std::vector<sw::mark::Bookmark*>::const_iterator findBookmark(const OUString& rMark) const =0;
/** Finds the first mark that is starting after.
@returns
an iterator pointing to the mark, or pointing to getBookmarksEnd() if nothing was found.
*/
virtual std::vector<sw::mark::Bookmark*>::const_iterator findFirstBookmarkStartsAfter(const SwPosition& rPos) const =0;
/// Get the innermost bookmark that contains rPos.
virtual sw::mark::Bookmark* getOneInnermostBookmarkFor(const SwPosition& rPos) const = 0;
// Fieldmarks
/** returns a STL-like random access iterator to the begin of the sequence of fieldmarks.
*/
virtual std::vector<sw::mark::Fieldmark*>::const_iterator getFieldmarksBegin() const =0;
/** returns a STL-like random access iterator to the end of the sequence of fieldmarks.
*/
virtual std::vector<sw::mark::Fieldmark*>::const_iterator getFieldmarksEnd() const =0;
/// returns the number of Fieldmarks.
virtual sal_Int32 getFieldmarksCount() const = 0;
/// get Fieldmark for CH_TXT_ATR_FIELDSTART/CH_TXT_ATR_FIELDEND at rPos
virtual ::sw::mark::Fieldmark* getFieldmarkAt(const SwPosition& rPos) const =0;
virtual sw::mark::Fieldmark* getInnerFieldmarkFor(const SwPosition& pos) const = 0;
virtual sw::mark::Fieldmark* getFieldmarkBefore(const SwPosition& pos, bool bLoop) const =0;
virtual sw::mark::Fieldmark* getFieldmarkAfter(const SwPosition& pos, bool bLoop) const =0;
virtual ::sw::mark::Fieldmark* getDropDownFor(const SwPosition& pos) const=0;
virtual std::vector<::sw::mark::Fieldmark*> getNoTextFieldmarksIn(const SwPaM &rPaM) const=0;
virtual void deleteFieldmarkAt(const SwPosition& rPos) = 0;
virtual ::sw::mark::Fieldmark* changeFormFieldmarkType(::sw::mark::Fieldmark* pFieldmark, const OUString& rNewType) = 0;
virtual void NotifyCursorUpdate(const SwCursorShell& rCursorShell) = 0;
virtual void ClearFieldActivation() = 0;
// Annotation Marks
virtual std::vector<sw::mark::AnnotationMark*>::const_iterator getAnnotationMarksBegin() const = 0;
virtual std::vector<sw::mark::AnnotationMark*>::const_iterator getAnnotationMarksEnd() const = 0;
virtual sal_Int32 getAnnotationMarksCount() const = 0;
virtual std::vector<sw::mark::AnnotationMark*>::const_iterator findAnnotationMark( const OUString& rName ) const = 0;
virtual sw::mark::AnnotationMark* getAnnotationMarkFor(const SwPosition& rPosition) const = 0;
// handle and restore text ranges of annotations of tracked deletions
// based on the helper bookmarks (which can survive I/O and hiding redlines)
virtual ::sw::mark::Bookmark* makeAnnotationBookmark(const SwPaM& rPaM,
const OUString& rProposedName,
::sw::mark::InsertMode eMode,
SwPosition const* pSepPos = nullptr) = 0;
/** Find the first AnnotationMark that does not start before.
@returns
an iterator pointing to the mark, or pointing to getAnnotationMarksEnd() if nothing was found.
*/
virtual std::vector<sw::mark::AnnotationMark*>::const_iterator findFirstAnnotationMarkNotStartsBefore(const SwPosition& rPos) const =0;
virtual std::vector<sw::mark::AnnotationMark*>::const_iterator findFirstAnnotationMarkNotStartsBefore(const SwNode& rPos) const =0;
virtual std::vector<sw::mark::Bookmark*>::const_iterator findAnnotationBookmark( const OUString& rName ) const = 0;
virtual void restoreAnnotationMarks(bool bDelete = true) = 0;
/** Returns the MarkType used to create the mark
*/
static SW_DLLPUBLIC MarkType GetType(const ::sw::mark::MarkBase& rMark);
static SW_DLLPUBLIC OUString GetCrossRefHeadingBookmarkNamePrefix();
static SW_DLLPUBLIC bool IsLegalPaMForCrossRefHeadingBookmark( const SwPaM& rPaM );
static void DeleteFieldmarkCommand(::sw::mark::Fieldmark const& rMark);
protected:
virtual ~IDocumentMarkAccess() {};
};
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|