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
|
/* -*- 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 _NDHINTS_HXX
#define _NDHINTS_HXX
#include <svl/svarray.hxx>
#include <tools/mempool.hxx>
#include "swtypes.hxx"
class SwTxtNode;
class SwRegHistory; // Is in RolBck.hxx.
class SwTxtAttr;
class SwTxtAttrNesting;
class SfxPoolItem;
class SfxItemSet;
class SwDoc;
typedef enum {
COPY = true,
NEW = false,
} CopyOrNew_t;
// if COPY then pTxtNode must be given!
SW_DLLPRIVATE SwTxtAttr *
MakeTxtAttr( SwDoc & rDoc, SfxPoolItem & rNew,
xub_StrLen const nStt, xub_StrLen const nEnd,
CopyOrNew_t const bIsCopy = NEW, SwTxtNode *const pTxtNode = 0);
SW_DLLPRIVATE SwTxtAttr *
MakeTxtAttr( SwDoc & rDoc, const SfxItemSet & rSet,
xub_StrLen nStt, xub_StrLen nEnd );
// create redline dummy text hint that must not be inserted into hints array
SW_DLLPRIVATE SwTxtAttr*
MakeRedlineTxtAttr( SwDoc & rDoc, SfxPoolItem& rAttr );
// Class SwpHints is derived indirectly via SwpHts, because only the
// class SwTxtNode should be allowed to insert and remove attributes.
// Other classes like the Frames are given only reading access via
// the index-operator.
// Size when created is 1 because an array is created only if
// also a hint is inserted.
// Class SwpHtStart/End
SV_DECL_PTRARR_SORT(SwpHtStart,SwTxtAttr*,1)
SV_DECL_PTRARR_SORT(SwpHtEnd,SwTxtAttr*,1)
// Class SwpHintsArr
/// the Hints array
class SwpHintsArray
{
protected:
SwpHtStart m_HintStarts;
SwpHtEnd m_HintEnds;
//FIXME: why are the non-const methods public?
public:
void Insert( const SwTxtAttr *pHt );
void DeleteAtPos( const sal_uInt16 nPosInStart );
bool Resort();
SwTxtAttr * Cut( const sal_uInt16 nPosInStart );
inline const SwTxtAttr * GetStart( const sal_uInt16 nPos ) const
{ return m_HintStarts[nPos]; }
inline const SwTxtAttr * GetEnd ( const sal_uInt16 nPos ) const
{ return m_HintEnds [nPos]; }
inline SwTxtAttr * GetStart( const sal_uInt16 nPos )
{ return m_HintStarts[nPos]; }
inline SwTxtAttr * GetEnd ( const sal_uInt16 nPos )
{ return m_HintEnds [nPos]; }
inline sal_uInt16 GetEndCount() const { return m_HintEnds .Count(); }
inline sal_uInt16 GetStartCount() const { return m_HintStarts.Count(); }
inline sal_uInt16 GetStartOf( const SwTxtAttr *pHt ) const;
inline sal_uInt16 GetPos( const SwTxtAttr *pHt ) const
{ return m_HintStarts.GetPos( pHt ); }
inline SwTxtAttr * GetTextHint( const sal_uInt16 nIdx )
{ return GetStart(nIdx); }
inline const SwTxtAttr * operator[]( const sal_uInt16 nIdx ) const
{ return m_HintStarts[nIdx]; }
inline sal_uInt16 Count() const { return m_HintStarts.Count(); }
#ifdef DBG_UTIL
bool Check() const;
#endif
};
// Class SwpHints
// public interface
class SwpHints : public SwpHintsArray
{
private:
SwRegHistory* m_pHistory; // for Undo
bool m_bFontChange : 1; // font change
// true: the Node is in Split and Frames are moved
bool m_bInSplitNode : 1;
// m_bHasHiddenParaField is invalid, call CalcHiddenParaField()
bool m_bCalcHiddenParaField : 1;
bool m_bHasHiddenParaField : 1; // HiddenParaFld
bool m_bFootnote : 1; // footnotes
bool m_bDDEFields : 1; // the TextNode has DDE fields
// records a new attibute in m_pHistory.
void NoteInHistory( SwTxtAttr *pAttr, const bool bNew = false );
void CalcFlags( );
// Delete methods may only be called by the TextNode!
// Because the TextNode also guarantees removal of the Character for
// attributes without an end.
friend class SwTxtNode;
void DeleteAtPos( const sal_uInt16 nPos );
// Delete the given Hint. The Hint must actually be in the array!
void Delete( SwTxtAttr* pTxtHt );
inline void SetInSplitNode(bool bInSplit) { m_bInSplitNode = bInSplit; }
inline void SetCalcHiddenParaField() { m_bCalcHiddenParaField = true; }
inline void SetHiddenParaField( const bool bNew )
{ m_bHasHiddenParaField = bNew; }
inline bool HasHiddenParaField() const
{
if ( m_bCalcHiddenParaField )
{
(const_cast<SwpHints*>(this))->CalcHiddenParaField();
}
return m_bHasHiddenParaField;
}
void InsertNesting(SwTxtAttrNesting & rNewHint);
bool TryInsertNesting(SwTxtNode & rNode, SwTxtAttrNesting & rNewHint);
void BuildPortions( SwTxtNode& rNode, SwTxtAttr& rNewHint,
const SetAttrMode nMode );
bool MergePortions( SwTxtNode& rNode );
public:
SwpHints();
inline bool CanBeDeleted() const { return !Count(); }
// register a History, which receives all attribute changes (for Undo)
void Register( SwRegHistory* pHist ) { m_pHistory = pHist; }
// deregister the currently registered History
void DeRegister() { Register(0); }
SwRegHistory* GetHistory() const { return m_pHistory; }
/// try to insert the hint
/// @return true iff hint successfully inserted
bool TryInsertHint( SwTxtAttr * const pHint, SwTxtNode & rNode,
const SetAttrMode nMode = nsSetAttrMode::SETATTR_DEFAULT );
inline bool HasFtn() const { return m_bFootnote; }
inline bool IsInSplitNode() const { return m_bInSplitNode; }
// calc current value of m_bHasHiddenParaField, returns true iff changed
bool CalcHiddenParaField();
DECL_FIXEDMEMPOOL_NEWDEL(SwpHints)
};
// Output operator for text hints.
SvStream &operator<<(SvStream &aS, const SwpHints &rHints); //$ ostream
// Inline Implementations
inline sal_uInt16 SwpHintsArray::GetStartOf( const SwTxtAttr *pHt ) const
{
sal_uInt16 nPos;
if ( !m_HintStarts.Seek_Entry( pHt, &nPos ) )
{
nPos = USHRT_MAX;
}
return nPos;
}
inline SwTxtAttr *SwpHintsArray::Cut( const sal_uInt16 nPosInStart )
{
SwTxtAttr *pHt = GetTextHint(nPosInStart);
DeleteAtPos( nPosInStart );
return pHt;
}
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
