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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_configmgr.hxx"
#include "translatechanges.hxx"
#include "noderef.hxx"
#include "nodechange.hxx"
#include "nodechangeinfo.hxx"
#include "apifactory.hxx"
namespace configmgr
{
// ---------------------------------------------------------------------------------------------------
namespace css = ::com::sun::star;
namespace uno = css::uno;
namespace lang = css::lang;
namespace util = css::util;
namespace beans = css::beans;
namespace container = css::container;
// ---------------------------------------------------------------------------------------------------
namespace configuration
{
class NodeChange;
class NodeChanges;
class NodeRef;
class NodeID;
}
// ---------------------------------------------------------------------------------------------------
namespace configapi
{
// ---------------------------------------------------------------------------------------------------
//interpreting NodeChanges
// resolve the relative path from a given base to the changed node
bool resolveChangeLocation(configuration::RelativePath& aPath, configuration::NodeChangeLocation const& aChange, rtl::Reference< configuration::Tree > const& aBaseTree, configuration::NodeRef const& aBaseNode)
{
OSL_ENSURE(aChange.isValidLocation(), "Trying to resolve against change location that wasn't set up properly");
namespace Path = configuration::Path;
rtl::Reference< configuration::Tree > aChangeBaseTree = aChange.getBaseTree();
configuration::AbsolutePath aOuterBasePath = aBaseTree->getAbsolutePath(aBaseNode);
configuration::AbsolutePath aChangeBasePath = aChangeBaseTree->getAbsolutePath(aChange.getBaseNode());
std::vector<configuration::Path::Component>::const_reverse_iterator aChangeIt = aChangeBasePath.begin(), aChangeEnd = aChangeBasePath.end();
std::vector<configuration::Path::Component>::const_reverse_iterator aOuterIt = aOuterBasePath.begin(), aOuterEnd = aOuterBasePath.end();
// First by resolve the base node pathes
while (aOuterIt != aOuterEnd && aChangeIt != aChangeEnd)
{
if ( ! Path::matches(*aOuterIt,*aChangeIt) ) return false; // mismatch
++aOuterIt;
++aChangeIt;
}
// Next consider the stored accessor
if (aChangeIt != aChangeEnd) // stepping outward - prepend
{
Path::Rep aRemaining(aChangeIt, aChangeEnd);
aPath = configuration::RelativePath(aRemaining).compose(aChange.getAccessor());
}
else if (aOuterIt == aOuterEnd) // exact match outside
{
aPath = aChange.getAccessor();
}
else //(aChangeIt == aChangeEnd) but outer left
{
configuration::RelativePath aAccessor = aChange.getAccessor();
aChangeIt = aAccessor.begin();
aChangeEnd = aAccessor.end();
// resolve the outer path against the change accessor
while (aOuterIt != aOuterEnd && aChangeIt != aChangeEnd)
{
if ( ! Path::matches(*aOuterIt,*aChangeIt) ) return false; // mismatch
++aOuterIt;
++aChangeIt;
}
if (aOuterIt == aOuterEnd)
{
Path::Rep aRemaining(aChangeIt, aChangeEnd);
aPath = configuration::RelativePath( aRemaining );
}
}
return (aOuterIt == aOuterEnd); // resolved completely and assigned ??
}
// ---------------------------------------------------------------------------------------------------
// change path and base settings to start from the given base
bool rebaseChange(configuration::NodeChangeLocation& aChange, rtl::Reference< configuration::Tree > const& _aBaseTreeRef)
{
return rebaseChange(aChange,_aBaseTreeRef,_aBaseTreeRef->getRootNode());
}
bool rebaseChange(configuration::NodeChangeLocation& aChange, rtl::Reference< configuration::Tree > const& _aBaseTreeRef, configuration::NodeRef const& aBaseNode)
{
OSL_ENSURE(aChange.isValidLocation(), "Trying to rebase change location that wasn't set up properly");
rtl::Reference< configuration::Tree > aBaseTree(_aBaseTreeRef);
configuration::RelativePath aNewPath;
if (resolveChangeLocation(aNewPath,aChange,aBaseTree,aBaseNode))
{
aChange.setBase( aBaseTree, aBaseNode);
aChange.setAccessor( aNewPath );
return true;
}
else
return false;
}
// ---------------------------------------------------------------------------------------------------
// resolve non-uno elements to Uno Objects
bool resolveUnoObjects(UnoChange& aUnoChange, configuration::NodeChangeData const& aChange,
Factory& rFactory)
{
if (aChange.isSetChange())
{
//Check we have ElementTree
if ((aChange.element.newValue == NULL) &&
(aChange.element.oldValue == NULL))
{
if( ( aChange.unoData.newValue.getValue()!=NULL) ||
( aChange.unoData.newValue.getValue()!=NULL))
{
return true;
}
else return false;
}
//Check if complex or simple type
rtl::Reference< configuration::Tree > aTree = aChange.isRemoveSetChange()?
aChange.getOldElementTree():
aChange.getNewElementTree();
configuration::NodeRef aNodeRef = aTree->getRootNode();
if (configuration::isStructuralNode(aTree, aNodeRef))
{
uno::Reference<uno::XInterface> aNewUnoObject = rFactory.findUnoElement(aChange.getNewElementNodeID());
uno::Reference<uno::XInterface> aOldUnoObject = rFactory.findUnoElement(aChange.getOldElementNodeID());
bool bFound = aNewUnoObject.is() || aOldUnoObject.is();
aUnoChange.newValue <<= aNewUnoObject;
aUnoChange.oldValue <<= aOldUnoObject;
return bFound;
}
else
{
aUnoChange.newValue = configuration::getSimpleElementValue(aTree, aNodeRef);
if (aChange.isReplaceSetChange() )
{
rtl::Reference< configuration::Tree > aOldTree = aChange.getOldElementTree();
aNodeRef = aOldTree->getRootNode();
OSL_ENSURE(!configuration::isStructuralNode(aOldTree, aNodeRef), "resolveUnoObject types mismatch");
aUnoChange.oldValue = configuration::getSimpleElementValue(aOldTree, aNodeRef);
}
bool bFound = aUnoChange.newValue.hasValue() || aUnoChange.oldValue.hasValue();
return bFound;
}
}
else if (aChange.isValueChange())
{
aUnoChange.newValue = aChange.unoData.newValue;
aUnoChange.oldValue = aChange.unoData.oldValue;
return true;
}
else
{
return false;
}
}
// ---------------------------------------------------------------------------------------------------
// resolve non-uno elements to Uno Objects inplace
bool resolveToUno(configuration::NodeChangeData& aChange, Factory& rFactory)
{
struct UnoChange aUnoChange;
if (resolveUnoObjects(aUnoChange,aChange, rFactory))
{
aChange.unoData.newValue = aUnoChange.newValue;
aChange.unoData.oldValue = aUnoChange.oldValue;
return true;
}
else
return false;
}
// ---------------------------------------------------------------------------------------------------
/// fill a change info from a NodeChangeInfo
void fillChange(util::ElementChange& rChange, configuration::NodeChangeInformation const& aInfo, rtl::Reference< configuration::Tree > const& aBaseTree, Factory& rFactory)
{
fillChange(rChange,aInfo,aBaseTree,aBaseTree->getRootNode(),rFactory);
}
/// fill a change info from a NodeChangeInfo
void fillChange(util::ElementChange& rChange, configuration::NodeChangeInformation const& aInfo, rtl::Reference< configuration::Tree > const& aBaseTree, configuration::NodeRef const& aBaseNode, Factory& rFactory)
{
configuration::RelativePath aRelativePath;
if (!resolveChangeLocation(aRelativePath, aInfo.location, aBaseTree, aBaseNode))
OSL_ENSURE(false, "WARNING: Change is not part of the given Tree");
UnoChange aUnoChange;
if (!resolveUnoObjects(aUnoChange, aInfo.change, rFactory))
OSL_ENSURE(false, "WARNING: Cannot find out old/new UNO objects involved in change");
rChange.Accessor <<= aRelativePath.toString();
rChange.Element = aUnoChange.newValue;
rChange.ReplacedElement = aUnoChange.oldValue;
}
// ---------------------------------------------------------------------------------------------------
/// fill a change info from a NodeChangeInfo (base,path and uno objects are assumed to be resolved already)
void fillChangeFromResolved(util::ElementChange& rChange, configuration::NodeChangeInformation const& aInfo)
{
rChange.Accessor <<= aInfo.location.getAccessor().toString();
rChange.Element = aInfo.change.unoData.newValue;
rChange.ReplacedElement = aInfo.change.unoData.oldValue;
}
// ---------------------------------------------------------------------------------------------------
/// fill a event from a NodeChangeInfo (uno objects are assumed to be resolved already)
bool fillEventDataFromResolved(container::ContainerEvent& rEvent, configuration::NodeChangeInformation const& aInfo)
{
rEvent.Accessor <<= aInfo.location.getAccessor().getLocalName().getName();
rEvent.Element = aInfo.change.unoData.newValue;
rEvent.ReplacedElement = aInfo.change.unoData.oldValue;
return !aInfo.isEmptyChange();
}
// ---------------------------------------------------------------------------------------------------
/// fill a event from a NodeChangeInfo(uno objects are assumed to be resolved already)
bool fillEventDataFromResolved(beans::PropertyChangeEvent& rEvent, configuration::NodeChangeInformation const& aInfo, bool bMore)
{
if (!aInfo.isValueChange())
return false;
rEvent.PropertyName = aInfo.location.getAccessor().getLocalName().getName();
rEvent.NewValue = aInfo.change.unoData.newValue;
rEvent.OldValue = aInfo.change.unoData.oldValue;
rEvent.PropertyHandle = -1;
rEvent.Further = bMore;
return !aInfo.isEmptyChange();
}
// ---------------------------------------------------------------------------------------------------
// ---------------------------------------------------------------------------------------------------
}
// ---------------------------------------------------------------------------------------------------
}
|
