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
|
/* -*- 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 <iterator>
#include <com/sun/star/ucb/Command.hpp>
#include <com/sun/star/ucb/XCommandEnvironment.hpp>
#include <com/sun/star/i18n/Transliteration.hpp>
#include <com/sun/star/ucb/XCommandProcessor.hpp>
#include <com/sun/star/lang/Locale.hpp>
#include <helpcompiler/HelpSearch.hxx>
#include <tools/diagnose_ex.h>
#if defined(__GNUC__)
# pragma GCC visibility push (default)
#endif
#include <CLucene.h>
#if defined(__GNUC__)
# pragma GCC visibility pop
#endif
#include <rtl/ustring.hxx>
#include <sal/log.hxx>
#include <algorithm>
#include <set>
#include "resultsetforquery.hxx"
#include "databases.hxx"
using namespace chelp;
using namespace com::sun::star;
using namespace com::sun::star::ucb;
using namespace com::sun::star::i18n;
using namespace com::sun::star::uno;
using namespace com::sun::star::lang;
namespace {
struct HitItem
{
OUString m_aURL;
float m_fScore;
HitItem(const OUString& aURL, float fScore)
: m_aURL(aURL)
, m_fScore(fScore)
{}
bool operator < ( const HitItem& rHitItem ) const
{
return rHitItem.m_fScore < m_fScore;
}
};
}
ResultSetForQuery::ResultSetForQuery( const uno::Reference< uno::XComponentContext >& rxContext,
const uno::Reference< XContentProvider >& xProvider,
const uno::Sequence< beans::Property >& seq,
const URLParameter& aURLParameter,
Databases* pDatabases )
: ResultSetBase( rxContext,xProvider,seq )
{
Reference< XExtendedTransliteration > xTrans = Transliteration::create( rxContext );
Locale aLocale( aURLParameter.get_language(),
OUString(),
OUString() );
xTrans->loadModule(TransliterationModules_UPPERCASE_LOWERCASE,
aLocale );
std::vector< std::vector< OUString > > queryList;
{
sal_Int32 idx;
OUString query = aURLParameter.get_query();
while( !query.isEmpty() )
{
idx = query.indexOf( ' ' );
if( idx == -1 )
idx = query.getLength();
std::vector< OUString > currentQuery;
OUString tmp(query.copy( 0,idx ));
Sequence<sal_Int32> aSeq;
OUString toliterate = xTrans->transliterate(
tmp,0,tmp.getLength(),aSeq);
currentQuery.push_back( toliterate );
queryList.push_back( currentQuery );
int nCpy = 1 + idx;
if( nCpy >= query.getLength() )
query.clear();
else
query = query.copy( 1 + idx );
}
}
std::vector< OUString > aCompleteResultVector;
OUString scope = aURLParameter.get_scope();
bool bCaptionsOnly = scope == "Heading";
sal_Int32 hitCount = aURLParameter.get_hitCount();
IndexFolderIterator aIndexFolderIt( *pDatabases, aURLParameter.get_module(), aURLParameter.get_language() );
OUString idxDir;
bool bExtension = false;
std::vector< std::vector<HitItem> > aIndexFolderResultVectorVector;
bool bTemporary;
for (;;)
{
idxDir = aIndexFolderIt.nextIndexFolder( bExtension, bTemporary );
if( idxDir.isEmpty() )
break;
std::vector<HitItem> aIndexFolderResultVector;
try
{
std::vector< std::vector<HitItem> > aQueryListResultVectorVector;
std::set< OUString > aSet,aCurrent,aResultSet;
int nQueryListSize = queryList.size();
if( nQueryListSize > 1 )
hitCount = 2000;
for( int i = 0; i < nQueryListSize; ++i )
{
std::vector<HitItem>* pQueryResultVector;
if( nQueryListSize > 1 )
{
aQueryListResultVectorVector.emplace_back();
pQueryResultVector = &aQueryListResultVectorVector.back();
}
else
{
pQueryResultVector = &aIndexFolderResultVector;
}
pQueryResultVector->reserve( hitCount );
const std::vector< OUString >& aListItem = queryList[i];
OUString aNewQueryStr = aListItem[0];
std::vector<float> aScoreVector;
std::vector<OUString> aPathVector;
try
{
HelpSearch searcher(idxDir);
searcher.query(aNewQueryStr, bCaptionsOnly, aPathVector, aScoreVector);
}
catch (CLuceneError &e)
{
SAL_WARN("xmlhelp", "CLuceneError: " << e.what());
}
if( nQueryListSize > 1 )
aSet.clear();
for (size_t j = 0; j < aPathVector.size(); ++j) {
pQueryResultVector->push_back(HitItem(aPathVector[j], aScoreVector[j]));
if (nQueryListSize > 1)
aSet.insert(aPathVector[j]);
}
// intersect
if( nQueryListSize > 1 )
{
if( i == 0 )
{
aResultSet = aSet;
}
else
{
aCurrent = aResultSet;
aResultSet.clear();
set_intersection( aSet.begin(),aSet.end(),
aCurrent.begin(),aCurrent.end(),
inserter(aResultSet,aResultSet.begin()));
}
}
}
// Combine results in aIndexFolderResultVector
if( nQueryListSize > 1 )
{
for( int n = 0 ; n < nQueryListSize ; ++n )
{
std::vector<HitItem>& rQueryResultVector = aQueryListResultVectorVector[n];
int nItemCount = rQueryResultVector.size();
for( int i = 0 ; i < nItemCount ; ++i )
{
const HitItem& rItem = rQueryResultVector[ i ];
if( (aResultSet.find( rItem.m_aURL )) != aResultSet.end() )
{
HitItem aItemCopy( rItem );
aItemCopy.m_fScore /= nQueryListSize; // To get average score
if( n == 0 )
{
// Use first pass to create entry
aIndexFolderResultVector.push_back( aItemCopy );
}
else
{
// Find entry in vector
int nCount = aIndexFolderResultVector.size();
for( int j = 0 ; j < nCount ; ++j )
{
HitItem& rFindItem = aIndexFolderResultVector[ j ];
if( rFindItem.m_aURL == aItemCopy.m_aURL )
{
rFindItem.m_fScore += aItemCopy.m_fScore;
break;
}
}
}
}
}
}
sort( aIndexFolderResultVector.begin(), aIndexFolderResultVector.end() );
}
aIndexFolderResultVectorVector.push_back( std::move(aIndexFolderResultVector) );
}
catch (const Exception &)
{
TOOLS_WARN_EXCEPTION("xmlhelp", "");
}
if( bTemporary )
aIndexFolderIt.deleteTempIndexFolder( idxDir );
} // Iterator
int nVectorCount = aIndexFolderResultVectorVector.size();
std::unique_ptr<std::vector<HitItem>::size_type[]> pCurrentVectorIndex(new std::vector<HitItem>::size_type[nVectorCount]);
for( int j = 0 ; j < nVectorCount ; ++j )
pCurrentVectorIndex[j] = 0;
sal_Int32 nTotalHitCount = aURLParameter.get_hitCount();
sal_Int32 nHitCount = 0;
while( nHitCount < nTotalHitCount )
{
int iVectorWithBestScore = -1;
float fBestScore = 0.0;
for( int k = 0 ; k < nVectorCount ; ++k )
{
std::vector<HitItem>& rIndexFolderVector = aIndexFolderResultVectorVector[k];
if( pCurrentVectorIndex[k] < rIndexFolderVector.size() )
{
const HitItem& rItem = rIndexFolderVector[ pCurrentVectorIndex[k] ];
if( fBestScore < rItem.m_fScore )
{
fBestScore = rItem.m_fScore;
iVectorWithBestScore = k;
}
}
}
if( iVectorWithBestScore == -1 ) // No item left at all
break;
std::vector<HitItem>& rIndexFolderVector = aIndexFolderResultVectorVector[iVectorWithBestScore];
const HitItem& rItem = rIndexFolderVector[ pCurrentVectorIndex[iVectorWithBestScore] ];
pCurrentVectorIndex[iVectorWithBestScore]++;
aCompleteResultVector.push_back( rItem.m_aURL );
++nHitCount;
}
pCurrentVectorIndex.reset();
aIndexFolderResultVectorVector.clear();
sal_Int32 replIdx = OUString( "#HLP#" ).getLength();
OUString replWith = "vnd.sun.star.help://";
int nResultCount = aCompleteResultVector.size();
for( int r = 0 ; r < nResultCount ; ++r )
{
OUString aURL = aCompleteResultVector[r];
OUString aResultStr = replWith + aURL.subView(replIdx);
m_aPath.push_back( aResultStr );
}
m_aItems.resize( m_aPath.size() );
m_aIdents.resize( m_aPath.size() );
Command aCommand;
aCommand.Name = "getPropertyValues";
aCommand.Argument <<= m_sProperty;
for( m_nRow = 0; sal::static_int_cast<sal_uInt32>( m_nRow ) < m_aPath.size(); ++m_nRow )
{
m_aPath[m_nRow] =
m_aPath[m_nRow] +
"?Language=" +
aURLParameter.get_language() +
"&System=" +
aURLParameter.get_system();
uno::Reference< XContent > content = queryContent();
if( content.is() )
{
uno::Reference< XCommandProcessor > cmd( content,uno::UNO_QUERY );
cmd->execute( aCommand,0,uno::Reference< XCommandEnvironment >( nullptr ) ) >>= m_aItems[m_nRow]; //TODO: check return value of operator >>=
}
}
m_nRow = 0xffffffff;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
