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
|
/* -*- 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_INDEX_HXX
#define INCLUDED_SW_INC_INDEX_HXX
#include <sal/types.h>
#include <tools/rtti.hxx>
#include <swdllapi.h>
class SwIndexReg;
struct SwPosition;
/// Marks a character position inside a document model node.
class SW_DLLPUBLIC SwIndex
{
private:
friend class SwIndexReg;
sal_Int32 m_nIndex;
SwIndexReg * m_pIndexReg;
// doubly linked list of Indexes registered at m_pIndexReg
SwIndex * m_pNext;
SwIndex * m_pPrev;
SwIndex& ChgValue( const SwIndex& rIdx, sal_Int32 nNewValue );
void Init(sal_Int32 const nIdx);
void Remove();
public:
explicit SwIndex(SwIndexReg *const pReg, sal_Int32 const nIdx = 0);
SwIndex( const SwIndex & );
SwIndex( const SwIndex &, short nDiff );
~SwIndex() { Remove(); }
SwIndex& operator=( sal_Int32 const );
SwIndex& operator=( const SwIndex & );
sal_Int32 operator++();
sal_Int32 operator--();
sal_Int32 operator++(int);
sal_Int32 operator--(int);
sal_Int32 operator+=( sal_Int32 const );
sal_Int32 operator-=( sal_Int32 const );
sal_Int32 operator+=( const SwIndex& );
sal_Int32 operator-=( const SwIndex& );
bool operator< ( const SwIndex& ) const;
bool operator<=( const SwIndex& ) const;
bool operator> ( const SwIndex& ) const;
bool operator>=( const SwIndex& ) const;
bool operator< ( sal_Int32 const nVal ) const { return m_nIndex < nVal; }
bool operator<=( sal_Int32 const nVal ) const { return m_nIndex <= nVal; }
bool operator> ( sal_Int32 const nVal ) const { return m_nIndex > nVal; }
bool operator>=( sal_Int32 const nVal ) const { return m_nIndex >= nVal; }
bool operator==( sal_Int32 const nVal ) const { return m_nIndex == nVal; }
bool operator!=( sal_Int32 const nVal ) const { return m_nIndex != nVal; }
bool operator==( const SwIndex& rSwIndex ) const
{
return (m_nIndex == rSwIndex.m_nIndex)
&& (m_pIndexReg == rSwIndex.m_pIndexReg);
}
bool operator!=( const SwIndex& rSwIndex ) const
{
return (m_nIndex != rSwIndex.m_nIndex)
|| (m_pIndexReg != rSwIndex.m_pIndexReg);
}
sal_Int32 GetIndex() const { return m_nIndex; }
// Assignments without creating a temporary object.
SwIndex &Assign(SwIndexReg *, sal_Int32);
// Returns pointer to IndexArray (for RTTI at SwIndexReg).
const SwIndexReg* GetIdxReg() const { return m_pIndexReg; }
};
class SwIndexReg
{
friend class SwIndex;
friend bool sw_PosOk(const SwPosition & aPos);
const SwIndex * m_pFirst;
const SwIndex * m_pLast;
protected:
virtual void Update( SwIndex const & rPos, const sal_Int32 nChangeLen,
const bool bNegative = false, const bool bDelete = false );
void ChkArr();
bool HasAnyIndex() const { return 0 != m_pFirst; }
public:
SwIndexReg();
virtual ~SwIndexReg();
/// rtti, derived classes might do the same. If so, one can cast typesavely
/// via SwIndexReg.
TYPEINFO();
void MoveTo( SwIndexReg& rArr );
};
#ifndef DBG_UTIL
inline sal_Int32 SwIndex::operator++()
{
return ChgValue( *this, m_nIndex+1 ).m_nIndex;
}
inline sal_Int32 SwIndex::operator--()
{
return ChgValue( *this, m_nIndex-1 ).m_nIndex;
}
inline sal_Int32 SwIndex::operator++(int)
{
sal_Int32 const nOldIndex = m_nIndex;
ChgValue( *this, m_nIndex+1 );
return nOldIndex;
}
inline sal_Int32 SwIndex::operator--(int)
{
sal_Int32 const nOldIndex = m_nIndex;
ChgValue( *this, m_nIndex-1 );
return nOldIndex;
}
inline sal_Int32 SwIndex::operator+=( sal_Int32 const nVal )
{
return ChgValue( *this, m_nIndex + nVal ).m_nIndex;
}
inline sal_Int32 SwIndex::operator-=( sal_Int32 const nVal )
{
return ChgValue( *this, m_nIndex - nVal ).m_nIndex;
}
inline sal_Int32 SwIndex::operator+=( const SwIndex& rIndex )
{
return ChgValue( *this, m_nIndex + rIndex.m_nIndex ).m_nIndex;
}
inline sal_Int32 SwIndex::operator-=( const SwIndex& rIndex )
{
return ChgValue( *this, m_nIndex - rIndex.m_nIndex ).m_nIndex;
}
inline bool SwIndex::operator< ( const SwIndex& rIndex ) const
{
return m_nIndex < rIndex.m_nIndex;
}
inline bool SwIndex::operator<=( const SwIndex& rIndex ) const
{
return m_nIndex <= rIndex.m_nIndex;
}
inline bool SwIndex::operator> ( const SwIndex& rIndex ) const
{
return m_nIndex > rIndex.m_nIndex;
}
inline bool SwIndex::operator>=( const SwIndex& rIndex ) const
{
return m_nIndex >= rIndex.m_nIndex;
}
inline SwIndex& SwIndex::operator= ( sal_Int32 const nVal )
{
if (m_nIndex != nVal)
{
ChgValue( *this, nVal );
}
return *this;
}
#endif // ifndef DBG_UTIL
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
