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
|
/* -*- 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_SW_INC_NDINDEX_HXX
#define INCLUDED_SW_INC_NDINDEX_HXX
#include <iostream>
#include <tools/solar.h>
#include "node.hxx"
#include "ring.hxx"
#include "ndarr.hxx"
#include "nodeoffset.hxx"
/// Marks a node in the document model.
class SW_DLLPUBLIC SwNodeIndex final : public sw::Ring<SwNodeIndex>
{
SwNode * m_pNode;
void RegisterIndex( SwNodes& rNodes )
{
if(!rNodes.m_vIndices)
rNodes.m_vIndices = this;
MoveTo(rNodes.m_vIndices);
}
void DeRegisterIndex( SwNodes& rNodes )
{
if(rNodes.m_vIndices == this)
rNodes.m_vIndices = GetNextInRing();
MoveTo(nullptr);
if(rNodes.m_vIndices == this)
rNodes.m_vIndices = nullptr;
}
public:
SwNodeIndex( SwNodes& rNds, sal_Int32 nIdx ) : SwNodeIndex(rNds, SwNodeOffset(nIdx)) {}
SwNodeIndex( SwNodes& rNds, SwNodeOffset nIdx = SwNodeOffset(0) )
: m_pNode( rNds[ nIdx ] )
{
RegisterIndex( rNds );
};
SwNodeIndex( const SwNodeIndex& rIdx, sal_Int32 nDiff ) : SwNodeIndex(rIdx, SwNodeOffset(nDiff)) {}
SwNodeIndex( const SwNodeIndex& rIdx, SwNodeOffset nDiff = SwNodeOffset(0) )
: sw::Ring<SwNodeIndex>()
{
if( nDiff )
m_pNode = rIdx.GetNodes()[ rIdx.GetIndex() + nDiff ];
else
m_pNode = rIdx.m_pNode;
RegisterIndex( m_pNode->GetNodes() );
}
SwNodeIndex( const SwNode& rNd, sal_Int32 nDiff ) : SwNodeIndex(rNd, SwNodeOffset(nDiff)) {}
SwNodeIndex( const SwNode& rNd, SwNodeOffset nDiff = SwNodeOffset(0) )
{
if( nDiff )
m_pNode = rNd.GetNodes()[ rNd.GetIndex() + nDiff ];
else
m_pNode = const_cast<SwNode*>(&rNd);
RegisterIndex( m_pNode->GetNodes() );
}
virtual ~SwNodeIndex() override
{ DeRegisterIndex( m_pNode->GetNodes() ); }
inline SwNodeOffset operator++();
inline SwNodeOffset operator--();
inline SwNodeOffset operator++(int);
inline SwNodeOffset operator--(int);
inline SwNodeOffset operator+=( SwNodeOffset );
inline SwNodeOffset operator-=( SwNodeOffset );
inline bool operator< ( const SwNodeIndex& ) const;
inline bool operator<=( const SwNodeIndex& ) const;
inline bool operator> ( const SwNodeIndex& ) const;
inline bool operator>=( const SwNodeIndex& ) const;
inline bool operator==( const SwNodeIndex& ) const;
inline bool operator!=( const SwNodeIndex& ) const;
inline bool operator< ( SwNodeOffset ) const;
inline bool operator<=( SwNodeOffset ) const;
inline bool operator> ( SwNodeOffset ) const;
inline bool operator>=( SwNodeOffset ) const;
inline bool operator==( SwNodeOffset ) const;
inline bool operator!=( SwNodeOffset ) const;
inline SwNodeIndex& operator=( SwNodeOffset );
inline SwNodeIndex& operator=( const SwNodeIndex& );
inline SwNodeIndex& operator=( const SwNode& );
// Return value of index as SwNodeOffset.
inline SwNodeOffset GetIndex() const;
// Enables assignments without creation of a temporary object.
inline SwNodeIndex& Assign( SwNodes const & rNds, SwNodeOffset );
SwNodeIndex& Assign( const SwNode& rNd, sal_Int32 nOffset ) { return Assign(rNd, SwNodeOffset(nOffset)); }
inline SwNodeIndex& Assign( const SwNode& rNd, SwNodeOffset nOffset = SwNodeOffset(0) );
// Gets pointer on NodesArray.
inline const SwNodes& GetNodes() const;
inline SwNodes& GetNodes();
SwNodeIndex* GetNext() { return GetNextInRing(); }
SwNode& GetNode() const { return *m_pNode; }
};
inline std::ostream &operator <<(std::ostream& s, const SwNodeIndex& index)
{
return s << "SwNodeIndex (node " << sal_Int32(index.GetIndex()) << ")";
};
// SwRange
class SW_DLLPUBLIC SwNodeRange
{
public:
SwNodeIndex aStart;
SwNodeIndex aEnd;
SwNodeRange( const SwNodeIndex &rS, const SwNodeIndex &rE )
: aStart( rS ), aEnd( rE ) {};
SwNodeRange( const SwNodeRange &rRange )
: aStart( rRange.aStart ), aEnd( rRange.aEnd ) {};
SwNodeRange( SwNodes& rNds, SwNodeOffset nSttIdx, SwNodeOffset nEndIdx = SwNodeOffset(0) )
: aStart( rNds, nSttIdx ), aEnd( rNds, nEndIdx ) {};
SwNodeRange( const SwNodeIndex& rS, SwNodeOffset nSttDiff, const SwNodeIndex& rE, SwNodeOffset nEndDiff = SwNodeOffset(0) )
: aStart( rS, nSttDiff ), aEnd( rE, nEndDiff ) {};
SwNodeRange( const SwNode& rS, SwNodeOffset nSttDiff, const SwNode& rE, SwNodeOffset nEndDiff = SwNodeOffset(0) )
: aStart( rS, nSttDiff ), aEnd( rE, nEndDiff ) {};
};
// For inlines node.hxx is needed which in turn needs this one.
// Therefore all inlines accessing m_pNode are implemented here.
inline SwNodeOffset SwNodeIndex::GetIndex() const
{
return m_pNode->GetIndex();
}
inline const SwNodes& SwNodeIndex::GetNodes() const
{
return m_pNode->GetNodes();
}
inline SwNodes& SwNodeIndex::GetNodes()
{
return m_pNode->GetNodes();
}
inline bool SwNodeIndex::operator< ( SwNodeOffset const nOther ) const
{
return m_pNode->GetIndex() < nOther;
}
inline bool SwNodeIndex::operator<=( SwNodeOffset const nOther ) const
{
return m_pNode->GetIndex() <= nOther;
}
inline bool SwNodeIndex::operator> ( SwNodeOffset const nOther ) const
{
return m_pNode->GetIndex() > nOther;
}
inline bool SwNodeIndex::operator>=( SwNodeOffset const nOther ) const
{
return m_pNode->GetIndex() >= nOther;
}
inline bool SwNodeIndex::operator==( SwNodeOffset const nOther ) const
{
return m_pNode->GetIndex() == nOther;
}
inline bool SwNodeIndex::operator!=( SwNodeOffset const nOther ) const
{
return m_pNode->GetIndex() != nOther;
}
inline bool SwNodeIndex::operator<( const SwNodeIndex& rIndex ) const
{
return m_pNode->GetIndex() < rIndex.GetIndex();
}
inline bool SwNodeIndex::operator<=( const SwNodeIndex& rIndex ) const
{
return m_pNode->GetIndex() <= rIndex.GetIndex();
}
inline bool SwNodeIndex::operator>( const SwNodeIndex& rIndex ) const
{
return m_pNode->GetIndex() > rIndex.GetIndex();
}
inline bool SwNodeIndex::operator>=( const SwNodeIndex& rIndex ) const
{
return m_pNode->GetIndex() >= rIndex.GetIndex();
}
inline bool SwNodeIndex::operator==( const SwNodeIndex& rIdx ) const
{
return m_pNode == rIdx.m_pNode;
}
inline bool SwNodeIndex::operator!=( const SwNodeIndex& rIdx ) const
{
return m_pNode != rIdx.m_pNode;
}
inline SwNodeOffset SwNodeIndex::operator++()
{
m_pNode = GetNodes()[ m_pNode->GetIndex() + 1 ];
return m_pNode->GetIndex();
}
inline SwNodeOffset SwNodeIndex::operator--()
{
m_pNode = GetNodes()[ m_pNode->GetIndex() - 1 ];
return m_pNode->GetIndex();
}
inline SwNodeOffset SwNodeIndex::operator++(int)
{
SwNodeOffset nOldIndex = m_pNode->GetIndex();
m_pNode = GetNodes()[ nOldIndex + 1 ];
return nOldIndex;
}
inline SwNodeOffset SwNodeIndex::operator--(int)
{
SwNodeOffset nOldIndex = m_pNode->GetIndex();
m_pNode = GetNodes()[ nOldIndex - 1 ];
return nOldIndex;
}
inline SwNodeOffset SwNodeIndex::operator+=( SwNodeOffset const nOffset )
{
m_pNode = GetNodes()[ m_pNode->GetIndex() + nOffset ];
return m_pNode->GetIndex();
}
inline SwNodeOffset SwNodeIndex::operator-=( SwNodeOffset const nOffset )
{
m_pNode = GetNodes()[ m_pNode->GetIndex() - nOffset ];
return m_pNode->GetIndex();
}
inline SwNodeIndex& SwNodeIndex::operator=( SwNodeOffset const nNew )
{
m_pNode = GetNodes()[ nNew ];
return *this;
}
SwNodeIndex& SwNodeIndex::operator=( const SwNodeIndex& rIdx )
{
*this = *(rIdx.m_pNode);
return *this;
}
SwNodeIndex& SwNodeIndex::operator=( const SwNode& rNd )
{
if (&m_pNode->GetNodes() != &rNd.GetNodes())
{
DeRegisterIndex( m_pNode->GetNodes() );
m_pNode = const_cast<SwNode*>(&rNd);
RegisterIndex( m_pNode->GetNodes() );
}
else
m_pNode = const_cast<SwNode*>(&rNd);
return *this;
}
SwNodeIndex& SwNodeIndex::Assign( SwNodes const & rNds, SwNodeOffset nIdx )
{
*this = *rNds[ nIdx ];
return *this;
}
SwNodeIndex& SwNodeIndex::Assign( const SwNode& rNd, SwNodeOffset nOffset )
{
*this = rNd;
if( nOffset )
m_pNode = m_pNode->GetNodes()[ m_pNode->GetIndex() + nOffset ];
return *this;
}
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
