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
|
/*************************************************************************
*
* $RCSfile: nodechangeinfo.hxx,v $
*
* $Revision: 1.5 $
*
* last change: $Author: jb $ $Date: 2002-02-11 13:47:54 $
*
* 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_CONFIGCHANGEINFO_HXX_
#define CONFIGMGR_CONFIGCHANGEINFO_HXX_
#ifndef CONFIGMGR_API_APITYPES_HXX_
#include "apitypes.hxx"
#endif
#ifndef CONFIGMGR_CONFIGPATH_HXX_
#include "configpath.hxx"
#endif
#ifndef CONFIGMGR_CONFIGNODE_HXX_
#include "noderef.hxx"
#endif
#ifndef CONFIGMGR_CONFIGVALUEREF_HXX_
#include "valueref.hxx"
#endif
#ifndef _RTL_REF_HXX_
#include <rtl/ref.hxx>
#endif
#ifndef INCLUDED_VECTOR
#include <vector>
#define INCLUDED_VECTOR
#endif
namespace configmgr
{
namespace configuration
{
//-----------------------------------------------------------------------------
typedef com::sun::star::uno::Type UnoType;
typedef com::sun::star::uno::Any UnoAny;
//-----------------------------------------------------------------------------
class Tree;
class NodeRef;
class ValueRef;
class NodeID;
class SubNodeID;
class ElementTreeImpl;
typedef rtl::Reference<ElementTreeImpl> ElementTreeHolder;
//-----------------------------------------------------------------------------
/// captures the values of something changing
template <class DataT>
struct DataChange
{
DataT newValue;
DataT oldValue;
DataChange()
: newValue(), oldValue()
{}
DataChange(DataT const& newValue_, DataT const& oldValue_)
: newValue(newValue_), oldValue(oldValue_)
{}
// note: maybe we should support a comparison object
bool isDataChange() const
{ return !(oldValue == newValue); } // not using != to avoid conversion warning
};
//-----------------------------------------------------------------------------
/// information about what changed (but close to no context)
class NodeChangeData
{
public:
//-------------------------------------------------
enum Type
{
eNoChange,
// Changes to value nodes
eSetValue,
eSetDefault,
// Changes to set nodes
eInsertElement,
eReplaceElement,
eRemoveElement,
eRenameElementTree, // not fully supported yet
eResetSetDefault
};
//-------------------------------------------------
bool isEmptyChange() const { return eNoChange == type; }
bool isValueChange() const { return eSetValue <= type && type <= eSetDefault; }
bool isSetChange() const { return eInsertElement <= type && type <= eRemoveElement; }
//-------------------------------------------------
bool isDataChange() const;
//-------------------------------------------------
// wrapper object creation
Tree getNewElementTree(data::Accessor const& aAccessor) const;
Tree getOldElementTree(data::Accessor const& aAccessor) const;
NodeRef getNewElementNodeRef() const;
NodeRef getOldElementNodeRef() const;
NodeID getNewElementNodeID() const;
NodeID getOldElementNodeID() const;
//-------------------------------------------------
//-- Compiler barrier for element tree ------------
NodeChangeData();
NodeChangeData(NodeChangeData const& aOther);
NodeChangeData& operator=(NodeChangeData const& aOther);
~NodeChangeData();
//-------------------------------------------------
Type type;
// Value change: old/new value; Set change: new/old api element (if known); Rename: old/new name
DataChange< UnoAny > unoData;
// Value change: NULL,NULL; Set change: new/old tree element; Rename: the affected element-tree (twice)
DataChange< ElementTreeHolder > element;
//-------------------------------------------------
};
//-------------------------------------------------
// Identify the location of a change. Interpretation of members may depend upon
class NodeChangeLocation
{
public:
//-------------------------------------------------
// checks whether the base has been properly set up.
// Does not check for existence of the affected node
/// check whether the location has been initialized properly
bool isValidData() const;
/// check whether the location is for a valid object
bool isValidLocation(data::Accessor const& aAccessor) const;
//-------------------------------------------------
/// retrieve the path from the base node to the changed node (which might be a child of the affected node)
RelativePath getAccessor() const { return m_path; }
/// retrieve the tree where the change is actually initiated/reported
Tree getBaseTree(data::Accessor const& aAccessor) const;
/// retrieve the node where the change is actually initiated/reported
NodeRef getBaseNode() const;
/// retrieve the tree where the change is actually taking place (may be Empty, if the tree has never been accessed)
Tree getAffectedTree(data::Accessor const& aAccessor) const;
/// retrieve the tree where the change is actually taking place (may be Empty, if the tree has never been accessed)
TreeRef getAffectedTreeRef() const;
/// retrieve the node where the change is actually taking place (if the affected Tree is not empty)
NodeRef getAffectedNode() const;
/// identify the node where the change is actually taking place
NodeID getAffectedNodeID() const;
/// identify the node (within the affected tree), that actually is changed (this one may be a value node)
SubNodeID getChangingValueID() const;
//-------------------------------------------------
void setAccessor( RelativePath const& aAccessor );
void setBase( NodeID const& aBaseID );
void setBase( Tree const& aBaseTree, NodeRef const& aBaseNode )
{ setBase( NodeID(aBaseTree,aBaseNode) ); }
void setAffected( NodeID const& aTargetID );
void setAffected( Tree const& aTargetTree, NodeRef const& aTargetNode )
{ setAffected( NodeID(aTargetTree,aTargetNode) ); }
void setChangingSubnode( bool bSubnode = true );
//-------------------------------------------------
NodeChangeLocation();
// NodeChangeLocation(NodeChangeLocation const& aOther);
// NodeChangeLocation& operator=(NodeChangeLocation const& aOther);
// ~NodeChangeLocation();
//-------------------------------------------------
private:
RelativePath m_path; // path from baseNode to changing node
NodeID m_base; // a (non-empty) node
NodeID m_affected; // identifies the affected node (if available)
bool m_bSubNodeChanging; // do we change a value ?
//-------------------------------------------------
};
//-----------------------------------------------------------------------------
class NodeChangeInformation
{
public:
//-------------------------------------------------
explicit
NodeChangeInformation(data::Accessor const& _accessor)
: accessor(_accessor)
, change()
, location()
{
}
//-------------------------------------------------
data::Accessor accessor;
NodeChangeData change;
NodeChangeLocation location;
//-------------------------------------------------
bool hasValidLocation() const { return location.isValidLocation(accessor); }
bool isDataChange() const { return change.isDataChange(); }
bool isEmptyChange() const { return change.isEmptyChange(); }
bool isValueChange() const { return change.isValueChange(); }
bool isSetChange() const { return change.isSetChange(); }
//-------------------------------------------------
};
//-----------------------------------------------------------------------------
class NodeChangesInformation
{
typedef std::vector< NodeChangeInformation > Rep;
public:
typedef Rep::const_iterator Iterator;
Rep::size_type size() const { return m_data.size(); }
bool empty() const { return m_data.empty(); }
void reserve(Rep::size_type sz_) { m_data.reserve(sz_); }
void clear() { m_data.clear(); }
void swap(NodeChangesInformation& aOther) throw() { m_data.swap(aOther.m_data); }
void push_back(NodeChangeInformation const& aChange_)
{ m_data.push_back(aChange_); }
Iterator begin() const { return m_data.begin(); }
Iterator end() const { return m_data.end(); }
private:
Rep m_data;
};
//-----------------------------------------------------------------------------
}
}
namespace std
{
template <>
inline
void swap(configmgr::configuration::NodeChangesInformation& lhs, configmgr::configuration::NodeChangesInformation& rhs)
{ lhs.swap(rhs); }
}
#endif // CONFIGMGR_CONFIGCHANGEINFO_HXX_
|
