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
|
/*************************************************************************
*
* $RCSfile: treeactions.hxx,v $
*
* $Revision: 1.10 $
*
* last change: $Author: jb $ $Date: 2001-06-20 20:25:26 $
*
* The Contents of this file are made available subject to the terms of
* either of the following licenses
*
* - GNU Lesser General Public License Version 2.1
* - Sun Industry Standards Source License Version 1.1
*
* Sun Microsystems Inc., October, 2000
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2000 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library 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 for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
*
* Sun Industry Standards Source License Version 1.1
* =================================================
* The contents of this file are subject to the Sun Industry Standards
* Source License Version 1.1 (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.openoffice.org/license.html.
*
* Software provided under this License is provided on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
* WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
* MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
* See the License for the specific provisions governing your rights and
* obligations concerning the Software.
*
* The Initial Developer of the Original Code is: Sun Microsystems, Inc.
*
* Copyright: 2000 by Sun Microsystems, Inc.
*
* All Rights Reserved.
*
* Contributor(s): _______________________________________
*
*
************************************************************************/
#ifndef _CONFIGMGR_TREEACTIONS_HXX_
#define _CONFIGMGR_TREEACTIONS_HXX_
#ifndef CONFIGMGR_CHANGE_HXX
#include "change.hxx"
#endif
//..........................................................................
namespace configmgr
{
//..........................................................................
class OTreeNodeFactory;
extern OTreeNodeFactory& getDefaultTreeNodeFactory();
//==========================================================================
//= OIdPropagator
//==========================================================================
/** propagates a node id to a subtree and its descendants
*/
class OIdPropagator : private NodeModification
{
::rtl::OUString sId;
OIdPropagator(const ::rtl::OUString& _rId) : sId(_rId) { }
virtual void handle(ValueNode& _rValueNode);
virtual void handle(ISubtree& _rSubtree);
public:
static void propagateIdToChildren(ISubtree& rTree);
static void propagateIdToTree( ::rtl::OUString const& aId, ISubtree& rTree);
};
//==========================================================================
//= OIdRemover
//==========================================================================
/** propagates a node id to a subtree and its descendants
*/
class OIdRemover : private NodeModification
{
virtual void handle(ValueNode& _rValueNode);
virtual void handle(ISubtree& _rSubtree);
public:
static void removeIds(INode& rNode);
};
//==========================================================================
//= OChangeActionCounter
//==========================================================================
/** collects meta data about a changes tree
*/
struct OChangeActionCounter : public ChangeTreeAction
{
sal_Int32 nValues, nAdds, nRemoves;
OChangeActionCounter() :nValues(0), nAdds(0), nRemoves(0) {}
virtual void handle(ValueChange const& aValueNode);
virtual void handle(AddNode const& aAddNode);
virtual void handle(RemoveNode const& aRemoveNode);
virtual void handle(SubtreeChange const& aSubtree);
sal_Bool hasChanges() const {return nValues || nAdds || nRemoves;}
};
//==========================================================================
//= ONodeConverter
//==========================================================================
class ONodeConverter : public ChangeTreeModification
{
OTreeNodeFactory& m_rFactory;
std::auto_ptr<INode> m_pNode;
public:
static std::auto_ptr<ISubtree> createCorrespondingNode(SubtreeChange const& _rChange, OTreeNodeFactory& _rFactory);
static std::auto_ptr<ValueNode> createCorrespondingNode(ValueChange const& _rChange, OTreeNodeFactory& _rFactory);
static std::auto_ptr<INode> extractCorrespondingNode(AddNode& _rChange);
static std::auto_ptr<INode> convertToNode(Change& _rChange, OTreeNodeFactory& _rFactory);
public:
explicit
ONodeConverter(OTreeNodeFactory& rFactory)
: m_rFactory(rFactory)
{
}
virtual void handle(ValueChange& aValueNode);
virtual void handle(AddNode& aAddNode);
virtual void handle(RemoveNode& aRemoveNode);
virtual void handle(SubtreeChange& aSubtree);
};
//==========================================================================
//= OMergeTreeAction
//==========================================================================
//= This class tests changes on an existing tree and drops them if they
//= are not need anymore or alters add nodes in node changes and vice versa
//==========================================================================
struct OMergeTreeAction : public ChangeTreeModification
{
SubtreeChange& m_rChangeList; // list which containes changes merged with the existing nodes
const ISubtree* m_pRefTree; // reference node needed for merging
OTreeNodeFactory& m_rNodeFactory;
public:
OMergeTreeAction(SubtreeChange& rList, const ISubtree* pTree)
:m_rChangeList(rList)
,m_pRefTree(pTree)
,m_rNodeFactory( getDefaultTreeNodeFactory())
{}
OMergeTreeAction(SubtreeChange& rList, const ISubtree* pTree, OTreeNodeFactory& rFactory )
:m_rChangeList(rList)
,m_pRefTree(pTree)
,m_rNodeFactory(rFactory)
{}
void handle(ValueChange& aValueNode);
void handle(AddNode& aAddNode);
void handle(RemoveNode& aRemoveNode);
void handle(SubtreeChange& aSubtree);
private:
// ensuring the correct state
void ensure();
};
//==========================================================================
//= OCreateSubtreeAction
//==========================================================================
//= creates a subtree out of a changes list
//==========================================================================
struct OCreateSubtreeAction : public ChangeTreeModification
{
ISubtree& m_rTree;
OTreeNodeFactory& m_rNodeFactory;
public:
OCreateSubtreeAction(ISubtree& _rTree, OTreeNodeFactory& rFactory)
:m_rTree(_rTree)
,m_rNodeFactory(rFactory) {}
void handle(ValueChange& aValueNode);
void handle(AddNode& aAddNode);
void handle(RemoveNode& aRemoveNode);
void handle(SubtreeChange& aSubtree);
static std::auto_ptr<ISubtree> createSubtree(SubtreeChange& aSubtree, OTreeNodeFactory& rFactory);
};
//==========================================================================
//= OCloneForLocale
//==========================================================================
//= clones a subtree , in the process selecting only the best match locale
//= from the set representation of localized values
//==========================================================================
class OCloneForLocale : public NodeAction
{
rtl::OUString m_sTargetLocale;
std::auto_ptr<INode> m_pClone;
public:
OCloneForLocale(OUString const& aLocale) : m_sTargetLocale(aLocale) {}
std::auto_ptr<INode> getResult() { return m_pClone; }
private:
void handle(ValueNode const& _aValue);
void handle(ISubtree const& _aSubtree);
};
//==========================================================================
//= OExpandLocalizedValues
//==========================================================================
//= clones a subtree , in the process expanding localized value nodes to a one-element set
//==========================================================================
class OExpandLocalizedValues : public NodeAction
{
std::auto_ptr<INode> m_pClone;
public:
OExpandLocalizedValues() {}
std::auto_ptr<INode> getResult() { return m_pClone; }
private:
void handle(ValueNode const& _aValue);
void handle(ISubtree const& _aSubtree);
};
//==========================================================================
// Helper function to invoke the previous ones properly
// convert to the given locale format, no matter what the original representation
std::auto_ptr<INode> cloneForLocale(INode const* _pNode, OUString const& _sLocale);
// convert to the given locale format, assuming the original representation was expanded
std::auto_ptr<INode> cloneExpandedForLocale(INode const* _pNode, OUString const& _sLocale);
// convert to the given locale format, assuming the original representation was expanded
std::auto_ptr<INode> cloneExpandedForLocale(ISubtree const* _pNode, OUString const& _sLocale);
// convert to the given locale format, assuming the original representation was expanded
std::auto_ptr<INode> reduceExpandedForLocale(std::auto_ptr<ISubtree> _pNode, OUString const& _sLocale);
// ===================================================================
// = OChangeCounter
// ===================================================================
struct OChangeCounter : public ChangeTreeAction
{
sal_Int32 nCount;
OChangeCounter() : nCount(0) { }
virtual void handle(ValueChange const& aValueNode);
virtual void handle(AddNode const& aAddNode);
virtual void handle(RemoveNode const& aRemoveNode);
virtual void handle(SubtreeChange const& aSubtree);
};
// ===================================================================
// = CollectNames
// ===================================================================
class CollectNames : public NodeAction
{
public:
typedef std::vector<OUString> NameList;
public:
NameList const& list() const { return aList; }
CollectNames() : aList() {}
void handle(ValueNode const& aValue) { add(aValue); }
void handle(ISubtree const& m_aSubtree) { add(m_aSubtree); }
void add(INode const& aNode)
{
aList.push_back(aNode.getName());
}
private:
NameList aList;
};
// --------------------------------- TreeUpdate ---------------------------------
class TreeUpdate : public ChangeTreeModification
{
ISubtree* m_pCurrentSubtree;
#if DBUG
std::vector<OString> aLog;
#endif
public:
TreeUpdate(ISubtree* pSubtree):m_pCurrentSubtree(pSubtree){}
void handle(ValueChange& aValueNode);
void handle(AddNode& aAddNode);
void handle(RemoveNode& aRemoveNode);
void handle(SubtreeChange& aSubtree);
};
//..........................................................................
} // namespace configmgr
//..........................................................................
#endif // _CONFIGMGR_TREEACTIONS_HXX_
|