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
|
/* -*- 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 <svl/slstitm.hxx>
#include <svl/poolitem.hxx>
#include <com/sun/star/uno/Any.hxx>
#include <com/sun/star/uno/Sequence.hxx>
#include <tools/stream.hxx>
#include <stringio.hxx>
TYPEINIT1_AUTOFACTORY(SfxStringListItem, SfxPoolItem);
class SfxImpStringList
{
public:
sal_uInt16 nRefCount;
std::vector<OUString> aList;
SfxImpStringList() { nRefCount = 1; }
~SfxImpStringList();
};
SfxImpStringList::~SfxImpStringList()
{
DBG_ASSERT(nRefCount!=0xffff,"ImpList already deleted");
nRefCount = 0xffff;
}
SfxStringListItem::SfxStringListItem() :
pImp(NULL)
{
}
SfxStringListItem::SfxStringListItem( sal_uInt16 which, const std::vector<OUString>* pList ) :
SfxPoolItem( which ),
pImp(NULL)
{
// FIXME: Putting an empty list does not work
// Therefore the query after the count is commented out
if( pList /*!!! && pList->Count() */ )
{
pImp = new SfxImpStringList;
if (pImp)
pImp->aList = *pList;
}
}
SfxStringListItem::SfxStringListItem( sal_uInt16 which, SvStream& rStream ) :
SfxPoolItem( which ),
pImp(NULL)
{
sal_Int32 nEntryCount;
rStream.ReadInt32( nEntryCount );
if( nEntryCount )
pImp = new SfxImpStringList;
if (pImp)
{
for( sal_Int32 i=0; i < nEntryCount; i++ )
{
pImp->aList.push_back( readByteString(rStream) );
}
}
}
SfxStringListItem::SfxStringListItem( const SfxStringListItem& rItem ) :
SfxPoolItem( rItem ),
pImp(rItem.pImp)
{
if( pImp )
{
DBG_ASSERT(pImp->nRefCount!=0xffff,"ImpList not valid");
pImp->nRefCount++;
}
}
SfxStringListItem::~SfxStringListItem()
{
if( pImp )
{
DBG_ASSERT(pImp->nRefCount!=0xffff,"ImpList not valid");
if( pImp->nRefCount > 1 )
pImp->nRefCount--;
else
delete pImp;
}
}
std::vector<OUString>& SfxStringListItem::GetList()
{
if( !pImp )
pImp = new SfxImpStringList;
DBG_ASSERT(pImp->nRefCount!=0xffff,"ImpList not valid");
return pImp->aList;
}
const std::vector<OUString>& SfxStringListItem::GetList () const
{
return (const_cast< SfxStringListItem * >(this))->GetList();
}
bool SfxStringListItem::operator==( const SfxPoolItem& rItem ) const
{
DBG_ASSERT( SfxPoolItem::operator==( rItem ), "unequal type" );
const SfxStringListItem& rSSLItem = static_cast<const SfxStringListItem&>(rItem);
return pImp == rSSLItem.pImp;
}
bool SfxStringListItem::GetPresentation
(
SfxItemPresentation /*ePresentation*/,
SfxMapUnit /*eCoreMetric*/,
SfxMapUnit /*ePresentationMetric*/,
OUString& rText,
const IntlWrapper *
) const
{
rText = "(List)";
return false;
}
SfxPoolItem* SfxStringListItem::Clone( SfxItemPool *) const
{
return new SfxStringListItem( *this );
/*
if( pImp )
return new SfxStringListItem( Which(), &(pImp->aList) );
else
return new SfxStringListItem( Which(), NULL );
*/
}
SfxPoolItem* SfxStringListItem::Create( SvStream & rStream, sal_uInt16 ) const
{
return new SfxStringListItem( Which(), rStream );
}
SvStream& SfxStringListItem::Store( SvStream & rStream, sal_uInt16 ) const
{
if( !pImp )
{
rStream.WriteInt32( 0 );
return rStream;
}
DBG_ASSERT(pImp->nRefCount!=0xffff,"ImpList not valid");
sal_uInt32 nCount = pImp->aList.size();
rStream.WriteUInt32( nCount );
for( sal_uInt32 i=0; i < nCount; i++ )
writeByteString(rStream, pImp->aList[i]);
return rStream;
}
void SfxStringListItem::SetString( const OUString& rStr )
{
DBG_ASSERT(GetRefCount()==0,"SetString:RefCount!=0");
if ( pImp && (pImp->nRefCount == 1) )
delete pImp;
else if( pImp )
pImp->nRefCount--;
pImp = new SfxImpStringList;
sal_Int32 nStart = 0;
OUString aStr(convertLineEnd(rStr, LINEEND_CR));
for (;;)
{
const sal_Int32 nDelimPos = aStr.indexOf( '\r', nStart );
if ( nDelimPos < 0 )
{
if (nStart<aStr.getLength())
{
// put last string only if not empty
pImp->aList.push_back(aStr.copy(nStart));
}
break;
}
pImp->aList.push_back(aStr.copy(nStart, nDelimPos-nStart));
// skip both inserted string and delimiter
nStart = nDelimPos + 1 ;
}
}
OUString SfxStringListItem::GetString()
{
OUString aStr;
if ( pImp )
{
DBG_ASSERT(pImp->nRefCount!=0xffff,"ImpList not valid");
std::vector<OUString>::iterator iter = pImp->aList.begin();
for (;;)
{
aStr += *iter;
++iter;
if (iter == pImp->aList.end())
break;
aStr += "\r";
}
}
return convertLineEnd(aStr, GetSystemLineEnd());
}
void SfxStringListItem::SetStringList( const com::sun::star::uno::Sequence< OUString >& rList )
{
DBG_ASSERT(GetRefCount()==0,"SetString:RefCount!=0");
if ( pImp && (pImp->nRefCount == 1) )
delete pImp;
else if( pImp )
pImp->nRefCount--;
pImp = new SfxImpStringList;
if (pImp)
{
// String belongs to the list
for ( sal_Int32 n = 0; n < rList.getLength(); n++ )
pImp->aList.push_back(rList[n]);
}
}
void SfxStringListItem::GetStringList( com::sun::star::uno::Sequence< OUString >& rList ) const
{
long nCount = pImp->aList.size();
rList.realloc( nCount );
for( long i=0; i < nCount; i++ )
rList[i] = pImp->aList[i];
}
// virtual
bool SfxStringListItem::PutValue( const com::sun::star::uno::Any& rVal, sal_uInt8 )
{
com::sun::star::uno::Sequence< OUString > aValue;
if ( rVal >>= aValue )
{
SetStringList( aValue );
return true;
}
OSL_FAIL( "SfxStringListItem::PutValue - Wrong type!" );
return false;
}
// virtual
bool SfxStringListItem::QueryValue( com::sun::star::uno::Any& rVal, sal_uInt8 ) const
{
// GetString() is not const!!!
SfxStringListItem* pThis = const_cast< SfxStringListItem * >( this );
com::sun::star::uno::Sequence< OUString > aStringList;
pThis->GetStringList( aStringList );
rVal = ::com::sun::star::uno::makeAny( aStringList );
return true;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
