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
|
/* -*- 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 .
*/
#include <list.hxx>
#include <vector>
#include <numrule.hxx>
#include <ndarr.hxx>
#include <node.hxx>
#include <pam.hxx>
#include <SwNodeNum.hxx>
// implementation class for SwList
class SwListImpl
{
public:
SwListImpl( const OUString& sListId,
SwNumRule& rDefaultListStyle,
const SwNodes& rNodes );
~SwListImpl();
const OUString& GetListId() const { return msListId;}
const OUString& GetDefaultListStyleName() const { return msDefaultListStyleName;}
void InsertListItem( SwNodeNum& rNodeNum,
const int nLevel );
static void RemoveListItem( SwNodeNum& rNodeNum );
void InvalidateListTree();
void ValidateListTree();
void MarkListLevel( const int nListLevel,
const bool bValue );
bool IsListLevelMarked( const int nListLevel ) const;
// unique identifier of the list
const OUString msListId;
// default list style for the list items, identified by the list style name
OUString msDefaultListStyleName;
// list trees for certain document ranges
typedef std::pair<SwNodeNum*, SwPaM*> tListTreeForRange;
typedef std::vector<tListTreeForRange> tListTrees;
tListTrees maListTrees;
int mnMarkedListLevel;
void NotifyItemsOnListLevel( const int nLevel );
};
SwListImpl::SwListImpl( const OUString& sListId,
SwNumRule& rDefaultListStyle,
const SwNodes& rNodes )
: msListId( sListId ),
msDefaultListStyleName( rDefaultListStyle.GetName() ),
maListTrees(),
mnMarkedListLevel( MAXLEVEL )
{
// create empty list trees for the document ranges
const SwNode* pNode = rNodes[0];
do
{
SwPaM aPam( *pNode, *pNode->EndOfSectionNode() );
SwNodeNum* pNumberTreeRootNode = new SwNodeNum( &rDefaultListStyle );
SwPaM* pPam = new SwPaM( *(aPam.Start()), *(aPam.End()) );
tListTreeForRange aListTreeForRange( pNumberTreeRootNode, pPam );
maListTrees.push_back( aListTreeForRange );
pNode = pNode->EndOfSectionNode();
if (pNode != &rNodes.GetEndOfContent())
{
sal_uLong nIndex = pNode->GetIndex();
nIndex++;
pNode = rNodes[nIndex];
}
}
while ( pNode != &rNodes.GetEndOfContent() );
}
SwListImpl::~SwListImpl()
{
tListTrees::iterator aNumberTreeIter;
for ( aNumberTreeIter = maListTrees.begin();
aNumberTreeIter != maListTrees.end();
++aNumberTreeIter )
{
SwNodeNum::HandleNumberTreeRootNodeDelete( *((*aNumberTreeIter).first) );
delete (*aNumberTreeIter).first;
delete (*aNumberTreeIter).second;
}
}
void SwListImpl::InsertListItem( SwNodeNum& rNodeNum,
const int nLevel )
{
const SwPosition aPosOfNodeNum( rNodeNum.GetPosition() );
const SwNodes* pNodesOfNodeNum = &(aPosOfNodeNum.nNode.GetNode().GetNodes());
tListTrees::const_iterator aNumberTreeIter;
for ( aNumberTreeIter = maListTrees.begin();
aNumberTreeIter != maListTrees.end();
++aNumberTreeIter )
{
const SwPosition* pStart = (*aNumberTreeIter).second->Start();
const SwPosition* pEnd = (*aNumberTreeIter).second->End();
const SwNodes* pRangeNodes = &(pStart->nNode.GetNode().GetNodes());
if ( pRangeNodes == pNodesOfNodeNum &&
*pStart <= aPosOfNodeNum && aPosOfNodeNum <= *pEnd)
{
(*aNumberTreeIter).first->AddChild( &rNodeNum, nLevel );
break;
}
}
}
void SwListImpl::RemoveListItem( SwNodeNum& rNodeNum )
{
rNodeNum.RemoveMe();
}
void SwListImpl::InvalidateListTree()
{
tListTrees::iterator aNumberTreeIter;
for ( aNumberTreeIter = maListTrees.begin();
aNumberTreeIter != maListTrees.end();
++aNumberTreeIter )
{
(*aNumberTreeIter).first->InvalidateTree();
}
}
void SwListImpl::ValidateListTree()
{
tListTrees::iterator aNumberTreeIter;
for ( aNumberTreeIter = maListTrees.begin();
aNumberTreeIter != maListTrees.end();
++aNumberTreeIter )
{
(*aNumberTreeIter).first->NotifyInvalidChildren();
}
}
void SwListImpl::MarkListLevel( const int nListLevel,
const bool bValue )
{
if ( bValue )
{
if ( nListLevel != mnMarkedListLevel )
{
if ( mnMarkedListLevel != MAXLEVEL )
{
// notify former marked list nodes
NotifyItemsOnListLevel( mnMarkedListLevel );
}
mnMarkedListLevel = nListLevel;
// notify new marked list nodes
NotifyItemsOnListLevel( mnMarkedListLevel );
}
}
else
{
if ( mnMarkedListLevel != MAXLEVEL )
{
// notify former marked list nodes
NotifyItemsOnListLevel( mnMarkedListLevel );
}
mnMarkedListLevel = MAXLEVEL;
}
}
bool SwListImpl::IsListLevelMarked( const int nListLevel ) const
{
return nListLevel == mnMarkedListLevel;
}
void SwListImpl::NotifyItemsOnListLevel( const int nLevel )
{
tListTrees::iterator aNumberTreeIter;
for ( aNumberTreeIter = maListTrees.begin();
aNumberTreeIter != maListTrees.end();
++aNumberTreeIter )
{
(*aNumberTreeIter).first->NotifyNodesOnListLevel( nLevel );
}
}
SwList::SwList( const OUString& sListId,
SwNumRule& rDefaultListStyle,
const SwNodes& rNodes )
: mpListImpl( new SwListImpl( sListId, rDefaultListStyle, rNodes ) )
{
}
SwList::~SwList()
{
delete mpListImpl;
}
const OUString SwList::GetListId() const
{
return mpListImpl->GetListId();
}
const OUString SwList::GetDefaultListStyleName() const
{
return mpListImpl->GetDefaultListStyleName();
}
void SwList::SetDefaultListStyleName(OUString const& rNew)
{
mpListImpl->msDefaultListStyleName = rNew;
}
void SwList::InsertListItem( SwNodeNum& rNodeNum,
const int nLevel )
{
mpListImpl->InsertListItem( rNodeNum, nLevel );
}
void SwList::RemoveListItem( SwNodeNum& rNodeNum )
{
SwListImpl::RemoveListItem( rNodeNum );
}
void SwList::InvalidateListTree()
{
mpListImpl->InvalidateListTree();
}
void SwList::ValidateListTree()
{
mpListImpl->ValidateListTree();
}
void SwList::MarkListLevel( const int nListLevel,
const bool bValue )
{
mpListImpl->MarkListLevel( nListLevel, bValue );
}
bool SwList::IsListLevelMarked( const int nListLevel ) const
{
return mpListImpl->IsListLevelMarked( nListLevel );
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
