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
402
403
404
405
406
407
408
409
410
411
412
|
/* -*- 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 .
*/
/**************************************************************************
TODO
**************************************************************************
*************************************************************************/
#include <vector>
#include <com/sun/star/ucb/IllegalIdentifierException.hpp>
#include <com/sun/star/ucb/OpenMode.hpp>
#include <ucbhelper/contentidentifier.hxx>
#include "hierarchydatasupplier.hxx"
#include "hierarchyprovider.hxx"
#include "hierarchycontent.hxx"
using namespace com::sun::star;
using namespace hierarchy_ucp;
namespace hierarchy_ucp
{
// struct ResultListEntry.
namespace {
struct ResultListEntry
{
OUString aId;
uno::Reference< ucb::XContentIdentifier > xId;
uno::Reference< ucb::XContent > xContent;
uno::Reference< sdbc::XRow > xRow;
HierarchyEntryData aData;
explicit ResultListEntry( const HierarchyEntryData& rEntry ) : aData( rEntry ) {}
};
}
// ResultList.
typedef std::vector< std::unique_ptr<ResultListEntry> > ResultList;
// struct DataSupplier_Impl.
struct DataSupplier_Impl
{
osl::Mutex m_aMutex;
ResultList m_aResults;
rtl::Reference< HierarchyContent > m_xContent;
uno::Reference< uno::XComponentContext > m_xContext;
HierarchyEntry m_aFolder;
HierarchyEntry::iterator m_aIterator;
sal_Int32 m_nOpenMode;
bool m_bCountFinal;
DataSupplier_Impl(
const uno::Reference< uno::XComponentContext >& rxContext,
const rtl::Reference< HierarchyContent >& rContent,
sal_Int32 nOpenMode )
: m_xContent( rContent ), m_xContext( rxContext ),
m_aFolder( rxContext,
static_cast< HierarchyContentProvider * >(
rContent->getProvider().get() ),
rContent->getIdentifier()->getContentIdentifier() ),
m_nOpenMode( nOpenMode ), m_bCountFinal( false ) {}
};
}
// HierarchyResultSetDataSupplier Implementation.
HierarchyResultSetDataSupplier::HierarchyResultSetDataSupplier(
const uno::Reference< uno::XComponentContext >& rxContext,
const rtl::Reference< HierarchyContent >& rContent,
sal_Int32 nOpenMode )
: m_pImpl( new DataSupplier_Impl( rxContext, rContent, nOpenMode ) )
{
}
// virtual
HierarchyResultSetDataSupplier::~HierarchyResultSetDataSupplier()
{
}
// virtual
OUString HierarchyResultSetDataSupplier::queryContentIdentifierString(
sal_uInt32 nIndex )
{
osl::Guard< osl::Mutex > aGuard( m_pImpl->m_aMutex );
if ( nIndex < m_pImpl->m_aResults.size() )
{
OUString aId = m_pImpl->m_aResults[ nIndex ]->aId;
if ( !aId.isEmpty() )
{
// Already cached.
return aId;
}
}
if ( getResult( nIndex ) )
{
OUString aId
= m_pImpl->m_xContent->getIdentifier()->getContentIdentifier();
if ( ( aId.lastIndexOf( '/' ) + 1 ) != aId.getLength() )
aId += "/";
aId += m_pImpl->m_aResults[ nIndex ]->aData.getName();
m_pImpl->m_aResults[ nIndex ]->aId = aId;
return aId;
}
return OUString();
}
// virtual
uno::Reference< ucb::XContentIdentifier >
HierarchyResultSetDataSupplier::queryContentIdentifier( sal_uInt32 nIndex )
{
osl::Guard< osl::Mutex > aGuard( m_pImpl->m_aMutex );
if ( nIndex < m_pImpl->m_aResults.size() )
{
uno::Reference< ucb::XContentIdentifier > xId
= m_pImpl->m_aResults[ nIndex ]->xId;
if ( xId.is() )
{
// Already cached.
return xId;
}
}
OUString aId = queryContentIdentifierString( nIndex );
if ( !aId.isEmpty() )
{
uno::Reference< ucb::XContentIdentifier > xId
= new ::ucbhelper::ContentIdentifier( aId );
m_pImpl->m_aResults[ nIndex ]->xId = xId;
return xId;
}
return uno::Reference< ucb::XContentIdentifier >();
}
// virtual
uno::Reference< ucb::XContent >
HierarchyResultSetDataSupplier::queryContent( sal_uInt32 nIndex )
{
osl::Guard< osl::Mutex > aGuard( m_pImpl->m_aMutex );
if ( nIndex < m_pImpl->m_aResults.size() )
{
uno::Reference< ucb::XContent > xContent
= m_pImpl->m_aResults[ nIndex ]->xContent;
if ( xContent.is() )
{
// Already cached.
return xContent;
}
}
uno::Reference< ucb::XContentIdentifier > xId
= queryContentIdentifier( nIndex );
if ( xId.is() )
{
try
{
uno::Reference< ucb::XContent > xContent
= m_pImpl->m_xContent->getProvider()->queryContent( xId );
m_pImpl->m_aResults[ nIndex ]->xContent = xContent;
return xContent;
}
catch ( ucb::IllegalIdentifierException const & )
{
}
}
return uno::Reference< ucb::XContent >();
}
// virtual
bool HierarchyResultSetDataSupplier::getResult( sal_uInt32 nIndex )
{
osl::ClearableGuard< osl::Mutex > aGuard( m_pImpl->m_aMutex );
if ( m_pImpl->m_aResults.size() > nIndex )
{
// Result already present.
return true;
}
// Result not (yet) present.
if ( m_pImpl->m_bCountFinal )
return false;
// Try to obtain result...
sal_uInt32 nOldCount = m_pImpl->m_aResults.size();
bool bFound = false;
sal_uInt32 nPos = nOldCount;
while ( m_pImpl->m_aFolder.next( m_pImpl->m_aIterator ) )
{
const HierarchyEntryData& rResult = *m_pImpl->m_aIterator;
if ( checkResult( rResult ) )
{
m_pImpl->m_aResults.emplace_back( new ResultListEntry( rResult ) );
if ( nPos == nIndex )
{
// Result obtained.
bFound = true;
break;
}
}
nPos++;
}
if ( !bFound )
m_pImpl->m_bCountFinal = true;
rtl::Reference< ::ucbhelper::ResultSet > xResultSet = getResultSet().get();
if ( xResultSet.is() )
{
// Callbacks follow!
aGuard.clear();
if ( nOldCount < m_pImpl->m_aResults.size() )
xResultSet->rowCountChanged(
nOldCount, m_pImpl->m_aResults.size() );
if ( m_pImpl->m_bCountFinal )
xResultSet->rowCountFinal();
}
return bFound;
}
// virtual
sal_uInt32 HierarchyResultSetDataSupplier::totalCount()
{
osl::ClearableGuard< osl::Mutex > aGuard( m_pImpl->m_aMutex );
if ( m_pImpl->m_bCountFinal )
return m_pImpl->m_aResults.size();
sal_uInt32 nOldCount = m_pImpl->m_aResults.size();
while ( m_pImpl->m_aFolder.next( m_pImpl->m_aIterator ) )
{
const HierarchyEntryData& rResult = *m_pImpl->m_aIterator;
if ( checkResult( rResult ) )
m_pImpl->m_aResults.emplace_back( new ResultListEntry( rResult ) );
}
m_pImpl->m_bCountFinal = true;
rtl::Reference< ::ucbhelper::ResultSet > xResultSet = getResultSet().get();
if ( xResultSet.is() )
{
// Callbacks follow!
aGuard.clear();
if ( nOldCount < m_pImpl->m_aResults.size() )
xResultSet->rowCountChanged(
nOldCount, m_pImpl->m_aResults.size() );
xResultSet->rowCountFinal();
}
return m_pImpl->m_aResults.size();
}
// virtual
sal_uInt32 HierarchyResultSetDataSupplier::currentCount()
{
return m_pImpl->m_aResults.size();
}
// virtual
bool HierarchyResultSetDataSupplier::isCountFinal()
{
return m_pImpl->m_bCountFinal;
}
// virtual
uno::Reference< sdbc::XRow >
HierarchyResultSetDataSupplier::queryPropertyValues( sal_uInt32 nIndex )
{
osl::Guard< osl::Mutex > aGuard( m_pImpl->m_aMutex );
if ( nIndex < m_pImpl->m_aResults.size() )
{
uno::Reference< sdbc::XRow > xRow
= m_pImpl->m_aResults[ nIndex ]->xRow;
if ( xRow.is() )
{
// Already cached.
return xRow;
}
}
if ( getResult( nIndex ) )
{
HierarchyContentProperties aData(
m_pImpl->m_aResults[ nIndex ]->aData );
uno::Reference< sdbc::XRow > xRow
= HierarchyContent::getPropertyValues(
m_pImpl->m_xContext,
getResultSet()->getProperties(),
aData,
static_cast< HierarchyContentProvider * >(
m_pImpl->m_xContent->getProvider().get() ),
queryContentIdentifierString( nIndex ) );
m_pImpl->m_aResults[ nIndex ]->xRow = xRow;
return xRow;
}
return uno::Reference< sdbc::XRow >();
}
// virtual
void HierarchyResultSetDataSupplier::releasePropertyValues( sal_uInt32 nIndex )
{
osl::Guard< osl::Mutex > aGuard( m_pImpl->m_aMutex );
if ( nIndex < m_pImpl->m_aResults.size() )
m_pImpl->m_aResults[ nIndex ]->xRow.clear();
}
// virtual
void HierarchyResultSetDataSupplier::close()
{
}
// virtual
void HierarchyResultSetDataSupplier::validate()
{
}
bool HierarchyResultSetDataSupplier::checkResult(
const HierarchyEntryData& rResult )
{
switch ( m_pImpl->m_nOpenMode )
{
case ucb::OpenMode::FOLDERS:
if ( rResult.getType() == HierarchyEntryData::LINK )
{
// Entry is a link.
return false;
}
break;
case ucb::OpenMode::DOCUMENTS:
if ( rResult.getType() == HierarchyEntryData::FOLDER )
{
// Entry is a folder.
return false;
}
break;
case ucb::OpenMode::ALL:
default:
break;
}
return true;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
