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
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* 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.
*
************************************************************************/
//_______________________________________________
// includes
#include <comphelper/sequenceashashmap.hxx>
//_______________________________________________
// namespace
namespace comphelper{
namespace css = ::com::sun::star;
//_______________________________________________
// definitions
/*-----------------------------------------------
04.11.2003 09:29
-----------------------------------------------*/
SequenceAsHashMap::SequenceAsHashMap()
: SequenceAsHashMapBase()
{
}
/*-----------------------------------------------
04.11.2003 08:30
-----------------------------------------------*/
SequenceAsHashMap::SequenceAsHashMap(const css::uno::Any& aSource)
{
(*this) << aSource;
}
//-----------------------------------------------
SequenceAsHashMap::SequenceAsHashMap(const css::uno::Sequence< css::uno::Any >& lSource)
{
(*this) << lSource;
}
/*-----------------------------------------------
04.11.2003 08:30
-----------------------------------------------*/
SequenceAsHashMap::SequenceAsHashMap(const css::uno::Sequence< css::beans::PropertyValue >& lSource)
{
(*this) << lSource;
}
/*-----------------------------------------------
04.11.2003 08:30
-----------------------------------------------*/
SequenceAsHashMap::SequenceAsHashMap(const css::uno::Sequence< css::beans::NamedValue >& lSource)
{
(*this) << lSource;
}
/*-----------------------------------------------
04.11.2003 09:04
-----------------------------------------------*/
SequenceAsHashMap::~SequenceAsHashMap()
{
}
/*-----------------------------------------------
04.11.2003 10:21
-----------------------------------------------*/
void SequenceAsHashMap::operator<<(const css::uno::Any& aSource)
{
// An empty Any reset this instance!
if (!aSource.hasValue())
{
clear();
return;
}
css::uno::Sequence< css::beans::NamedValue > lN;
if (aSource >>= lN)
{
(*this) << lN;
return;
}
css::uno::Sequence< css::beans::PropertyValue > lP;
if (aSource >>= lP)
{
(*this) << lP;
return;
}
throw css::beans::IllegalTypeException(
::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "Any contains wrong type." )),
css::uno::Reference< css::uno::XInterface >());
}
//-----------------------------------------------
void SequenceAsHashMap::operator<<(const css::uno::Sequence< css::uno::Any >& lSource)
{
sal_Int32 c = lSource.getLength();
sal_Int32 i = 0;
for (i=0; i<c; ++i)
{
css::beans::PropertyValue lP;
if (lSource[i] >>= lP)
{
if (
(lP.Name.isEmpty()) ||
(!lP.Value.hasValue())
)
throw css::beans::IllegalTypeException(
::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "PropertyValue struct contains no usefull informations." )),
css::uno::Reference< css::uno::XInterface >());
(*this)[lP.Name] = lP.Value;
continue;
}
css::beans::NamedValue lN;
if (lSource[i] >>= lN)
{
if (
(lN.Name.isEmpty()) ||
(!lN.Value.hasValue())
)
throw css::beans::IllegalTypeException(
::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "NamedValue struct contains no usefull informations." )),
css::uno::Reference< css::uno::XInterface >());
(*this)[lN.Name] = lN.Value;
continue;
}
// ignore VOID Any ... but reject wrong filled ones!
if (lSource[i].hasValue())
throw css::beans::IllegalTypeException(
::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "Any contains wrong type." )),
css::uno::Reference< css::uno::XInterface >());
}
}
/*-----------------------------------------------
04.11.2003 08:30
-----------------------------------------------*/
void SequenceAsHashMap::operator<<(const css::uno::Sequence< css::beans::PropertyValue >& lSource)
{
clear();
sal_Int32 c = lSource.getLength();
const css::beans::PropertyValue* pSource = lSource.getConstArray();
for (sal_Int32 i=0; i<c; ++i)
(*this)[pSource[i].Name] = pSource[i].Value;
}
/*-----------------------------------------------
04.11.2003 08:30
-----------------------------------------------*/
void SequenceAsHashMap::operator<<(const css::uno::Sequence< css::beans::NamedValue >& lSource)
{
clear();
sal_Int32 c = lSource.getLength();
const css::beans::NamedValue* pSource = lSource.getConstArray();
for (sal_Int32 i=0; i<c; ++i)
(*this)[pSource[i].Name] = pSource[i].Value;
}
/*-----------------------------------------------
04.11.2003 08:30
-----------------------------------------------*/
void SequenceAsHashMap::operator>>(css::uno::Sequence< css::beans::PropertyValue >& lDestination) const
{
sal_Int32 c = (sal_Int32)size();
lDestination.realloc(c);
css::beans::PropertyValue* pDestination = lDestination.getArray();
sal_Int32 i = 0;
for (const_iterator pThis = begin();
pThis != end() ;
++pThis )
{
pDestination[i].Name = pThis->first ;
pDestination[i].Value = pThis->second;
++i;
}
}
/*-----------------------------------------------
04.11.2003 08:30
-----------------------------------------------*/
void SequenceAsHashMap::operator>>(css::uno::Sequence< css::beans::NamedValue >& lDestination) const
{
sal_Int32 c = (sal_Int32)size();
lDestination.realloc(c);
css::beans::NamedValue* pDestination = lDestination.getArray();
sal_Int32 i = 0;
for (const_iterator pThis = begin();
pThis != end() ;
++pThis )
{
pDestination[i].Name = pThis->first ;
pDestination[i].Value = pThis->second;
++i;
}
}
/*-----------------------------------------------
30.07.2007 14:10
-----------------------------------------------*/
const css::uno::Any SequenceAsHashMap::getAsConstAny(::sal_Bool bAsPropertyValueList) const
{
css::uno::Any aDestination;
if (bAsPropertyValueList)
aDestination = css::uno::makeAny(getAsConstPropertyValueList());
else
aDestination = css::uno::makeAny(getAsConstNamedValueList());
return aDestination;
}
/*-----------------------------------------------
30.07.2007 14:10
-----------------------------------------------*/
const css::uno::Sequence< css::uno::Any > SequenceAsHashMap::getAsConstAnyList(::sal_Bool bAsPropertyValueList) const
{
::sal_Int32 i = 0;
::sal_Int32 c = (::sal_Int32)size();
css::uno::Sequence< css::uno::Any > lDestination(c);
css::uno::Any* pDestination = lDestination.getArray();
for (const_iterator pThis = begin();
pThis != end() ;
++pThis )
{
if (bAsPropertyValueList)
{
css::beans::PropertyValue aProp;
aProp.Name = pThis->first;
aProp.Value = pThis->second;
pDestination[i] = css::uno::makeAny(aProp);
}
else
{
css::beans::NamedValue aProp;
aProp.Name = pThis->first;
aProp.Value = pThis->second;
pDestination[i] = css::uno::makeAny(aProp);
}
++i;
}
return lDestination;
}
/*-----------------------------------------------
04.11.2003 08:30
-----------------------------------------------*/
const css::uno::Sequence< css::beans::NamedValue > SequenceAsHashMap::getAsConstNamedValueList() const
{
css::uno::Sequence< css::beans::NamedValue > lReturn;
(*this) >> lReturn;
return lReturn;
}
/*-----------------------------------------------
04.11.2003 08:30
-----------------------------------------------*/
const css::uno::Sequence< css::beans::PropertyValue > SequenceAsHashMap::getAsConstPropertyValueList() const
{
css::uno::Sequence< css::beans::PropertyValue > lReturn;
(*this) >> lReturn;
return lReturn;
}
/*-----------------------------------------------
07.03.2007 12:45
-----------------------------------------------*/
sal_Bool SequenceAsHashMap::match(const SequenceAsHashMap& rCheck) const
{
const_iterator pCheck;
for ( pCheck = rCheck.begin();
pCheck != rCheck.end() ;
++pCheck )
{
const ::rtl::OUString& sCheckName = pCheck->first;
const css::uno::Any& aCheckValue = pCheck->second;
const_iterator pFound = find(sCheckName);
if (pFound == end())
return sal_False;
const css::uno::Any& aFoundValue = pFound->second;
if (aFoundValue != aCheckValue)
return sal_False;
}
return sal_True;
}
/*-----------------------------------------------
30.07.2007 14:30
-----------------------------------------------*/
void SequenceAsHashMap::update(const SequenceAsHashMap& rUpdate)
{
const_iterator pUpdate;
for ( pUpdate = rUpdate.begin();
pUpdate != rUpdate.end() ;
++pUpdate )
{
const ::rtl::OUString& sName = pUpdate->first;
const css::uno::Any& aValue = pUpdate->second;
(*this)[sName] = aValue;
}
}
/*-----------------------------------------------
04.11.2003 08:30
-----------------------------------------------*/
#if OSL_DEBUG_LEVEL > 1
void SequenceAsHashMap::dbg_dumpToFile(const char* pFileName,
const char* pComment ) const
{
if (!pFileName || !pComment)
return;
FILE* pFile = fopen(pFileName, "a");
if (!pFile)
return;
::rtl::OUStringBuffer sBuffer(1000);
sBuffer.appendAscii("\n----------------------------------------\n");
sBuffer.appendAscii(pComment );
sBuffer.appendAscii("\n----------------------------------------\n");
sal_Int32 i = 0;
for (const_iterator pIt = begin();
pIt != end() ;
++pIt )
{
sBuffer.appendAscii("[" );
sBuffer.append (i++ );
sBuffer.appendAscii("] " );
sBuffer.appendAscii("\"" );
sBuffer.append (pIt->first);
sBuffer.appendAscii("\" = \"" );
::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface > xv;
::rtl::OUString sv;
sal_Int32 nv;
sal_Bool bv;
if (pIt->second >>= sv)
sBuffer.append(sv);
else
if (pIt->second >>= nv)
sBuffer.append(nv);
else
if (pIt->second >>= bv)
sBuffer.appendAscii(bv ? "true" : "false");
else
if (pIt->second >>= xv)
sBuffer.appendAscii(xv.is() ? "object" : "null");
else
sBuffer.appendAscii("???");
sBuffer.appendAscii("\"\n");
}
fprintf(pFile, ::rtl::OUStringToOString(sBuffer.makeStringAndClear(), RTL_TEXTENCODING_UTF8).getStr());
fclose(pFile);
}
#endif // OSL_DEBUG_LEVEL > 1
} // namespace comphelper
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|