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
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>LCOV - lcov.info - ept/core/xapian.h</title>
<link rel="stylesheet" type="text/css" href="../../gcov.css">
</head>
<body>
<table width="100%" border=0 cellspacing=0 cellpadding=0>
<tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
<tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
<tr>
<td width="100%">
<table cellpadding=1 border=0 width="100%">
<tr>
<td class="headerItem" width="20%">Current view:</td>
<td class="headerValue" width="80%" colspan=4><a href="../../index.html">directory</a> - <a href="index.html">ept/core</a> - xapian.h</td>
</tr>
<tr>
<td class="headerItem" width="20%">Test:</td>
<td class="headerValue" width="80%" colspan=4>lcov.info</td>
</tr>
<tr>
<td class="headerItem" width="20%">Date:</td>
<td class="headerValue" width="20%">2008-08-14</td>
<td width="20%"></td>
<td class="headerItem" width="20%">Instrumented lines:</td>
<td class="headerValue" width="20%">109</td>
</tr>
<tr>
<td class="headerItem" width="20%">Code covered:</td>
<td class="headerValue" width="20%">87.2 %</td>
<td width="20%"></td>
<td class="headerItem" width="20%">Executed lines:</td>
<td class="headerValue" width="20%">95</td>
</tr>
</table>
</td>
</tr>
<tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
</table>
<table cellpadding=0 cellspacing=0 border=0>
<tr>
<td><br></td>
</tr>
<tr>
<td><pre class="source">
<span class="lineNum"> 1 </span> : // -*- C++ -*-
<span class="lineNum"> 2 </span> : #include <xapian.h>
<span class="lineNum"> 3 </span> : #include <ept/core/apt.h>
<span class="lineNum"> 4 </span> : #include <wibble/regexp.h>
<span class="lineNum"> 5 </span> : #include <wibble/sys/pipe.h>
<span class="lineNum"> 6 </span> : #include <wibble/sys/exec.h>
<span class="lineNum"> 7 </span> :
<span class="lineNum"> 8 </span> : #ifndef EPT_XAPIAN_H
<span class="lineNum"> 9 </span> : #define EPT_XAPIAN_H
<span class="lineNum"> 10 </span> :
<span class="lineNum"> 11 </span> : namespace ept {
<span class="lineNum"> 12 </span> : namespace core {
<span class="lineNum"> 13 </span> : namespace xapian {
<span class="lineNum"> 14 </span> :
<span class="lineNum"> 15 </span> : // Allocate value indexes for known values
<span class="lineNum"> 16 </span> : const Xapian::valueno VAL_APT_INSTALLED_SIZE = 1;
<span class="lineNum"> 17 </span> : const Xapian::valueno VAL_APT_PACKAGE_SIZE = 2;
<span class="lineNum"> 18 </span> : const Xapian::valueno VAL_POPCON = 10;
<span class="lineNum"> 19 </span> : const Xapian::valueno VAL_ITERATING_RATING = 20;
<span class="lineNum"> 20 </span> : const Xapian::valueno VAL_ITERATING_FUNCTIONALITY = 21;
<span class="lineNum"> 21 </span> : const Xapian::valueno VAL_ITERATING_USABILITY = 22;
<span class="lineNum"> 22 </span> : const Xapian::valueno VAL_ITERATING_SECURITY = 23;
<span class="lineNum"> 23 </span> : const Xapian::valueno VAL_ITERATING_PERFORMANCE = 24;
<span class="lineNum"> 24 </span> : const Xapian::valueno VAL_ITERATING_QUALITY = 25;
<span class="lineNum"> 25 </span> : const Xapian::valueno VAL_ITERATING_SUPPORT = 26;
<span class="lineNum"> 26 </span> : const Xapian::valueno VAL_ITERATING_ADOPTION = 27;
<span class="lineNum"> 27 </span> :
<span class="lineNum"> 28 </span> : struct TagFilter : public Xapian::ExpandDecider
<span class="lineNum"> 29 </span><span class="lineCov"> 8 : {</span>
<span class="lineNum"> 30 </span><span class="lineCov"> 1760 : virtual bool operator()(const std::string &term) const {</span>
<span class="lineNum"> 31 </span><span class="lineCov"> 1760 : return term[0] == 'X' && term[1] == 'T';</span>
<span class="lineNum"> 32 </span> : }
<span class="lineNum"> 33 </span> : };
<span class="lineNum"> 34 </span> :
<span class="lineNum"> 35 </span><span class="lineCov"> 91 : struct List {</span>
<span class="lineNum"> 36 </span> : char m_enqPlace[sizeof(Xapian::Enquire)];
<span class="lineNum"> 37 </span> : mutable Xapian::MSet m_matches;
<span class="lineNum"> 38 </span> : mutable Xapian::MSet::const_iterator m_iter;
<span class="lineNum"> 39 </span> : mutable int m_pos;
<span class="lineNum"> 40 </span> : typedef List Type;
<span class="lineNum"> 41 </span> :
<span class="lineNum"> 42 </span> : static const size_t chunkSize = 20;
<span class="lineNum"> 43 </span> :
<span class="lineNum"> 44 </span> : List head() const {
<span class="lineNum"> 45 </span> : seek();
<span class="lineNum"> 46 </span> : return *this;
<span class="lineNum"> 47 </span> : }
<span class="lineNum"> 48 </span> :
<span class="lineNum"> 49 </span><span class="lineCov"> 15 : Token token() const {</span>
<span class="lineNum"> 50 </span><span class="lineCov"> 15 : Token t;</span>
<span class="lineNum"> 51 </span><span class="lineCov"> 15 : t._id = m_iter.get_document().get_data();</span>
<span class="lineNum"> 52 </span><span class="lineNoCov"> 0 : return t;</span>
<span class="lineNum"> 53 </span> : }
<span class="lineNum"> 54 </span> :
<span class="lineNum"> 55 </span> : bool operator<( const List &o ) const {
<span class="lineNum"> 56 </span> : return token() < o.token();
<span class="lineNum"> 57 </span> : }
<span class="lineNum"> 58 </span> :
<span class="lineNum"> 59 </span><span class="lineCov"> 58 : void seek() const {</span>
<span class="lineNum"> 60 </span><span class="lineCov"> 58 : if ( m_matches.size() == chunkSize && m_iter == m_matches.end() ) {</span>
<span class="lineNum"> 61 </span><span class="lineNoCov"> 0 : m_matches = enq().get_mset( m_pos, chunkSize );</span>
<span class="lineNum"> 62 </span><span class="lineNoCov"> 0 : m_iter = m_matches.begin();</span>
<span class="lineNum"> 63 </span><span class="lineNoCov"> 0 : m_pos += chunkSize;</span>
<span class="lineNum"> 64 </span> : }
<span class="lineNum"> 65 </span><span class="lineCov"> 58 : }</span>
<span class="lineNum"> 66 </span> :
<span class="lineNum"> 67 </span><span class="lineCov"> 30 : bool empty() const {</span>
<span class="lineNum"> 68 </span><span class="lineCov"> 30 : if ( m_pos == -1 )</span>
<span class="lineNum"> 69 </span><span class="lineNoCov"> 0 : return true;</span>
<span class="lineNum"> 70 </span><span class="lineCov"> 30 : seek();</span>
<span class="lineNum"> 71 </span><span class="lineCov"> 30 : return m_matches.size() < 30 && m_iter == m_matches.end();</span>
<span class="lineNum"> 72 </span> : }
<span class="lineNum"> 73 </span> :
<span class="lineNum"> 74 </span><span class="lineCov"> 28 : List tail() const {</span>
<span class="lineNum"> 75 </span><span class="lineCov"> 28 : List t = *this;</span>
<span class="lineNum"> 76 </span><span class="lineCov"> 28 : t.seek();</span>
<span class="lineNum"> 77 </span><span class="lineCov"> 28 : t.m_iter ++;</span>
<span class="lineNum"> 78 </span><span class="lineNoCov"> 0 : return t;</span>
<span class="lineNum"> 79 </span> : }
<span class="lineNum"> 80 </span> :
<span class="lineNum"> 81 </span><span class="lineCov"> 6 : Xapian::Enquire const &enq() const {</span>
<span class="lineNum"> 82 </span><span class="lineCov"> 6 : return *reinterpret_cast< Xapian::Enquire const * >( m_enqPlace );</span>
<span class="lineNum"> 83 </span> : }
<span class="lineNum"> 84 </span> :
<span class="lineNum"> 85 </span><span class="lineCov"> 3 : List( Xapian::Enquire _enq )</span>
<span class="lineNum"> 86 </span><span class="lineCov"> 3 : {</span>
<span class="lineNum"> 87 </span><span class="lineCov"> 3 : Xapian::Enquire *e = new (m_enqPlace) Xapian::Enquire( _enq );</span>
<span class="lineNum"> 88 </span><span class="lineCov"> 3 : assert_eq( e, &enq() );</span>
<span class="lineNum"> 89 </span><span class="lineCov"> 6 : m_matches = enq().get_mset( 0, chunkSize );</span>
<span class="lineNum"> 90 </span><span class="lineCov"> 3 : m_iter = m_matches.begin();</span>
<span class="lineNum"> 91 </span><span class="lineCov"> 3 : m_pos = chunkSize;</span>
<span class="lineNum"> 92 </span><span class="lineCov"> 3 : }</span>
<span class="lineNum"> 93 </span> :
<span class="lineNum"> 94 </span> : List() {}
<span class="lineNum"> 95 </span> : };
<span class="lineNum"> 96 </span> :
<span class="lineNum"> 97 </span><span class="lineCov"> 13 : struct Query {</span>
<span class="lineNum"> 98 </span> : Xapian::Database *m_db;
<span class="lineNum"> 99 </span> : Xapian::Enquire m_enq;
<span class="lineNum"> 100 </span> : Xapian::Stem m_stem;
<span class="lineNum"> 101 </span> : typedef std::set< std::string > Terms;
<span class="lineNum"> 102 </span> : Terms m_include, m_exclude;
<span class="lineNum"> 103 </span> : int m_cutoff;
<span class="lineNum"> 104 </span> : bool m_expand;
<span class="lineNum"> 105 </span> :
<span class="lineNum"> 106 </span><span class="lineCov"> 5 : void setQualityCutoff( int c ) {</span>
<span class="lineNum"> 107 </span><span class="lineCov"> 5 : m_cutoff = c;</span>
<span class="lineNum"> 108 </span><span class="lineCov"> 5 : }</span>
<span class="lineNum"> 109 </span> :
<span class="lineNum"> 110 </span><span class="lineCov"> 5 : void setExpand( bool e ) { m_expand = e; }</span>
<span class="lineNum"> 111 </span> :
<span class="lineNum"> 112 </span><span class="lineCov"> 9 : Query( Xapian::Database &e ) : m_db( &e ), m_enq( e ) {</span>
<span class="lineNum"> 113 </span><span class="lineCov"> 9 : m_cutoff = 50;</span>
<span class="lineNum"> 114 </span><span class="lineCov"> 9 : m_expand = true;</span>
<span class="lineNum"> 115 </span><span class="lineCov"> 9 : }</span>
<span class="lineNum"> 116 </span> :
<span class="lineNum"> 117 </span><span class="lineCov"> 5 : wibble::Tokenizer queryTokenizer( std::string q ) const {</span>
<span class="lineNum"> 118 </span><span class="lineCov"> 5 : return wibble::Tokenizer( q, "[A-Za-z0-9_+:-]+", REG_EXTENDED );</span>
<span class="lineNum"> 119 </span> : }
<span class="lineNum"> 120 </span> :
<span class="lineNum"> 121 </span> : template< typename Out >
<span class="lineNum"> 122 </span><span class="lineCov"> 5 : void tokenizeQuery( std::string q, Out o ) const</span>
<span class="lineNum"> 123 </span> : {
<span class="lineNum"> 124 </span><span class="lineCov"> 5 : wibble::Tokenizer tok = queryTokenizer( q );</span>
<span class="lineNum"> 125 </span><span class="lineCov"> 15 : for (wibble::Tokenizer::const_iterator i = tok.begin(); i != tok.end(); ++i )</span>
<span class="lineNum"> 126 </span> : {
<span class="lineNum"> 127 </span><span class="lineCov"> 10 : if ( (*i).find( "::" ) != std::string::npos ) { // assume tag</span>
<span class="lineNum"> 128 </span><span class="lineNoCov"> 0 : *o++ = ("XT" + *i);</span>
<span class="lineNum"> 129 </span> : } else {
<span class="lineNum"> 130 </span><span class="lineCov"> 10 : std::string t = wibble::str::tolower(*i);</span>
<span class="lineNum"> 131 </span><span class="lineCov"> 10 : std::string s = m_stem(t);</span>
<span class="lineNum"> 132 </span><span class="lineCov"> 10 : *o++ = t;</span>
<span class="lineNum"> 133 </span><span class="lineCov"> 10 : if (s != t)</span>
<span class="lineNum"> 134 </span><span class="lineCov"> 5 : *o++ = ("Z" + s);</span>
<span class="lineNum"> 135 </span> : }
<span class="lineNum"> 136 </span> : }
<span class="lineNum"> 137 </span><span class="lineCov"> 5 : }</span>
<span class="lineNum"> 138 </span> :
<span class="lineNum"> 139 </span> : template< typename Out >
<span class="lineNum"> 140 </span><span class="lineCov"> 4 : void expand( Out o ) const</span>
<span class="lineNum"> 141 </span> : {
<span class="lineNum"> 142 </span><span class="lineCov"> 4 : Xapian::RSet rset;</span>
<span class="lineNum"> 143 </span> : // Get the top 5 results as 'good ones' to compute the search expansion
<span class="lineNum"> 144 </span><span class="lineCov"> 4 : Xapian::MSet mset = m_enq.get_mset(0, 5);</span>
<span class="lineNum"> 145 </span><span class="lineCov"> 24 : for ( Xapian::MSet::iterator i = mset.begin(); i != mset.end(); ++i )</span>
<span class="lineNum"> 146 </span><span class="lineCov"> 24 : rset.add_document(i);</span>
<span class="lineNum"> 147 </span> : // Get the expanded set, only expanding the query with tag names
<span class="lineNum"> 148 </span><span class="lineCov"> 4 : TagFilter tagf;</span>
<span class="lineNum"> 149 </span><span class="lineCov"> 4 : Xapian::ESet eset = m_enq.get_eset(5, rset, &tagf);</span>
<span class="lineNum"> 150 </span><span class="lineCov"> 4 : for ( Xapian::ESetIterator i = eset.begin(); i != eset.end(); ++i )</span>
<span class="lineNum"> 151 </span><span class="lineCov"> 4 : *o++ = *i;</span>
<span class="lineNum"> 152 </span><span class="lineCov"> 4 : }</span>
<span class="lineNum"> 153 </span> :
<span class="lineNum"> 154 </span><span class="lineCov"> 8 : void updateEnquire() {</span>
<span class="lineNum"> 155 </span> : // set up query now
<span class="lineNum"> 156 </span> : Xapian::Query inc( Xapian::Query::OP_OR,
<span class="lineNum"> 157 </span> : m_include.begin(),
<span class="lineNum"> 158 </span><span class="lineCov"> 8 : m_include.end() ),</span>
<span class="lineNum"> 159 </span> : exc( Xapian::Query::OP_OR,
<span class="lineNum"> 160 </span> : m_exclude.begin(),
<span class="lineNum"> 161 </span><span class="lineCov"> 8 : m_exclude.end() ),</span>
<span class="lineNum"> 162 </span><span class="lineCov"> 8 : query( Xapian::Query::OP_AND_NOT, inc, exc );</span>
<span class="lineNum"> 163 </span> :
<span class="lineNum"> 164 </span><span class="lineCov"> 8 : m_enq.set_query( query );</span>
<span class="lineNum"> 165 </span> :
<span class="lineNum"> 166 </span><span class="lineCov"> 8 : if ( m_expand ) {</span>
<span class="lineNum"> 167 </span><span class="lineCov"> 4 : m_expand = false;</span>
<span class="lineNum"> 168 </span><span class="lineCov"> 4 : expand( std::inserter( m_include, m_include.begin() ) );</span>
<span class="lineNum"> 169 </span><span class="lineCov"> 4 : updateEnquire();</span>
<span class="lineNum"> 170 </span><span class="lineCov"> 4 : m_expand = true;</span>
<span class="lineNum"> 171 </span><span class="lineCov"> 4 : return;</span>
<span class="lineNum"> 172 </span> : }
<span class="lineNum"> 173 </span> :
<span class="lineNum"> 174 </span><span class="lineCov"> 4 : Xapian::MSet first = m_enq.get_mset(0, 1, 0, 0, 0);</span>
<span class="lineNum"> 175 </span><span class="lineCov"> 4 : Xapian::MSetIterator ifirst = first.begin();</span>
<span class="lineNum"> 176 </span><span class="lineCov"> 4 : if ( ifirst != first.end() ) {</span>
<span class="lineNum"> 177 </span><span class="lineCov"> 4 : Xapian::percent cutoff = ifirst.get_percent() * m_cutoff / 100;</span>
<span class="lineNum"> 178 </span><span class="lineCov"> 4 : m_enq.set_cutoff(cutoff);</span>
<span class="lineNum"> 179 </span><span class="lineCov"> 4 : }</span>
<span class="lineNum"> 180 </span> : }
<span class="lineNum"> 181 </span> :
<span class="lineNum"> 182 </span><span class="lineCov"> 3 : List results() {</span>
<span class="lineNum"> 183 </span><span class="lineCov"> 3 : updateEnquire();</span>
<span class="lineNum"> 184 </span><span class="lineCov"> 3 : return List( m_enq );</span>
<span class="lineNum"> 185 </span> : }
<span class="lineNum"> 186 </span> :
<span class="lineNum"> 187 </span> : std::map< std::string, int > relevantTags( int n = 30 ) {
<span class="lineNum"> 188 </span> : updateEnquire();
<span class="lineNum"> 189 </span> : std::map< std::string, int > relev;
<span class="lineNum"> 190 </span> : Xapian::RSet rset;
<span class="lineNum"> 191 </span> : Xapian::MSet mset = m_enq.get_mset(0, 100);
<span class="lineNum"> 192 </span> : for ( Xapian::MSet::iterator i = mset.begin(); i != mset.end(); ++i )
<span class="lineNum"> 193 </span> : rset.add_document(i);
<span class="lineNum"> 194 </span> : // Get the expanded set, only expanding the query with tag names
<span class="lineNum"> 195 </span> : TagFilter tagf;
<span class="lineNum"> 196 </span> : Xapian::ESet eset = m_enq.get_eset(n, rset, &tagf);
<span class="lineNum"> 197 </span> : for ( Xapian::ESetIterator i = eset.begin(); i != eset.end(); ++i )
<span class="lineNum"> 198 </span> : relev.insert( relev.begin(),
<span class="lineNum"> 199 </span> : std::make_pair(
<span class="lineNum"> 200 </span> : std::string( *i, 2, std::string::npos ),
<span class="lineNum"> 201 </span> : i.get_weight() ) );
<span class="lineNum"> 202 </span> : return relev;
<span class="lineNum"> 203 </span> : }
<span class="lineNum"> 204 </span> :
<span class="lineNum"> 205 </span><span class="lineCov"> 5 : void addTerms( std::string t, bool partial = false, bool exclude = false ) {</span>
<span class="lineNum"> 206 </span><span class="lineCov"> 5 : Terms &to = exclude ? m_exclude : m_include;</span>
<span class="lineNum"> 207 </span><span class="lineCov"> 5 : std::vector< std::string > tok;</span>
<span class="lineNum"> 208 </span><span class="lineCov"> 5 : tokenizeQuery( t, std::back_inserter( tok ) );</span>
<span class="lineNum"> 209 </span><span class="lineCov"> 5 : if ( partial ) {</span>
<span class="lineNum"> 210 </span><span class="lineNoCov"> 0 : if ( tok.back().size() == 1 ) {</span>
<span class="lineNum"> 211 </span><span class="lineNoCov"> 0 : tok.pop_back();</span>
<span class="lineNum"> 212 </span> : } else {
<span class="lineNum"> 213 </span> : std::copy(
<span class="lineNum"> 214 </span> : m_db->allterms_begin( tok.back() ),
<span class="lineNum"> 215 </span> : m_db->allterms_end( tok.back() ),
<span class="lineNum"> 216 </span><span class="lineNoCov"> 0 : std::back_inserter( tok ) );</span>
<span class="lineNum"> 217 </span> : }
<span class="lineNum"> 218 </span> : }
<span class="lineNum"> 219 </span><span class="lineCov"> 5 : std::copy( tok.begin(), tok.end(), std::inserter( to, to.begin() ) );</span>
<span class="lineNum"> 220 </span><span class="lineCov"> 5 : }</span>
<span class="lineNum"> 221 </span> :
<span class="lineNum"> 222 </span> : void addTerms( const Terms &t, bool exclude = false ) {
<span class="lineNum"> 223 </span> : Terms &to = exclude ? m_exclude : m_include;
<span class="lineNum"> 224 </span> : std::copy( t.begin(), t.end(), std::inserter( to, to.begin() ) );
<span class="lineNum"> 225 </span> : }
<span class="lineNum"> 226 </span> :
<span class="lineNum"> 227 </span> : };
<span class="lineNum"> 228 </span> :
<span class="lineNum"> 229 </span> : struct Source
<span class="lineNum"> 230 </span><span class="lineCov"> 4 : {</span>
<span class="lineNum"> 231 </span> : protected:
<span class="lineNum"> 232 </span> : mutable Xapian::Database m_db;
<span class="lineNum"> 233 </span> : Xapian::Stem m_stem;
<span class="lineNum"> 234 </span> : mutable bool m_opened;
<span class="lineNum"> 235 </span> :
<span class="lineNum"> 236 </span> : /// Return a lowercased copy of the string
<span class="lineNum"> 237 </span> : static std::string toLower(const std::string& str);
<span class="lineNum"> 238 </span> :
<span class="lineNum"> 239 </span> : /**
<span class="lineNum"> 240 </span> : * Add normalised tokens computed from the string to the document doc.
<span class="lineNum"> 241 </span> : *
<span class="lineNum"> 242 </span> : * pos is used as a sequence generator for entering the token position in
<span class="lineNum"> 243 </span> : * the document.
<span class="lineNum"> 244 </span> : */
<span class="lineNum"> 245 </span> : void normalize_and_add(Xapian::Document& doc, const std::string& term,
<span class="lineNum"> 246 </span> : int& pos) const;
<span class="lineNum"> 247 </span> :
<span class="lineNum"> 248 </span> : public:
<span class="lineNum"> 249 </span> : Source();
<span class="lineNum"> 250 </span> :
<span class="lineNum"> 251 </span> : /// Access the Xapian database
<span class="lineNum"> 252 </span><span class="lineCov"> 9 : Xapian::Database& db() {</span>
<span class="lineNum"> 253 </span><span class="lineCov"> 9 : open();</span>
<span class="lineNum"> 254 </span><span class="lineCov"> 9 : return m_db;</span>
<span class="lineNum"> 255 </span> : }
<span class="lineNum"> 256 </span> :
<span class="lineNum"> 257 </span> : /// Access the Xapian database
<span class="lineNum"> 258 </span><span class="lineNoCov"> 0 : const Xapian::Database& db() const {</span>
<span class="lineNum"> 259 </span><span class="lineNoCov"> 0 : open();</span>
<span class="lineNum"> 260 </span><span class="lineNoCov"> 0 : return m_db;</span>
<span class="lineNum"> 261 </span> : }
<span class="lineNum"> 262 </span> :
<span class="lineNum"> 263 </span> : void open() const;
<span class="lineNum"> 264 </span> : void invalidate() {
<span class="lineNum"> 265 </span> : m_db = Xapian::Database();
<span class="lineNum"> 266 </span> : m_opened = false;
<span class="lineNum"> 267 </span> : }
<span class="lineNum"> 268 </span> :
<span class="lineNum"> 269 </span> : /// Timestamp of when the Xapian database was last updated
<span class="lineNum"> 270 </span> : time_t timestamp() const;
<span class="lineNum"> 271 </span> :
<span class="lineNum"> 272 </span> : void updateLeniently( AptDatabase &apt, OpProgress *op = 0 ) {
<span class="lineNum"> 273 </span> : if (apt.timestamp() - timestamp() > 86400 * 8) // a little over a week
<span class="lineNum"> 274 </span> : update( op );
<span class="lineNum"> 275 </span> : }
<span class="lineNum"> 276 </span> :
<span class="lineNum"> 277 </span> : void update( OpProgress *op = 0 ) {
<span class="lineNum"> 278 </span> : if ( !op )
<span class="lineNum"> 279 </span> : op = new OpProgress();
<span class="lineNum"> 280 </span> :
<span class="lineNum"> 281 </span> : wibble::exception::AddContext _ctx( "Rebuilding Xapian database." );
<span class="lineNum"> 282 </span> : int outfd;
<span class="lineNum"> 283 </span> : std::string op_str;
<span class="lineNum"> 284 </span> :
<span class="lineNum"> 285 </span> : wibble::sys::Exec ex( "update-apt-xapian-index" );
<span class="lineNum"> 286 </span> : ex.args.push_back( "--batch-mode" );
<span class="lineNum"> 287 </span> : ex.searchInPath = true;
<span class="lineNum"> 288 </span> : ex.forkAndRedirect( 0, &outfd, 0 );
<span class="lineNum"> 289 </span> :
<span class="lineNum"> 290 </span> : wibble::sys::Pipe monit( outfd );
<span class="lineNum"> 291 </span> : while ( !monit.eof() ) {
<span class="lineNum"> 292 </span> : std::string line = monit.nextLine();
<span class="lineNum"> 293 </span> : if ( line.empty() ) {
<span class="lineNum"> 294 </span> : usleep( 100000 );
<span class="lineNum"> 295 </span> : continue;
<span class="lineNum"> 296 </span> : }
<span class="lineNum"> 297 </span> : std::cerr << "got : " << line << std::endl;
<span class="lineNum"> 298 </span> : if ( wibble::str::startsWith( line, "begin: " ) ) {
<span class="lineNum"> 299 </span> : op_str = std::string( line, 7, std::string::npos );
<span class="lineNum"> 300 </span> : op->OverallProgress( 0, 100, 100, op_str );
<span class="lineNum"> 301 </span> :
<span class="lineNum"> 302 </span> : } else if ( wibble::str::startsWith( line, "done: " ) ) {
<span class="lineNum"> 303 </span> : op->Done();
<span class="lineNum"> 304 </span> : } else if ( wibble::str::startsWith( line, "progress: " ) ) {
<span class="lineNum"> 305 </span> : wibble::ERegexp re( "progress: ([0-9]+)/([0-9]+)", 3 );
<span class="lineNum"> 306 </span> : if ( re.match( line ) ) {
<span class="lineNum"> 307 </span> : assert_eq( re[2], "100" );
<span class="lineNum"> 308 </span> : op->OverallProgress( atoi( re[1].c_str() ), 100, 100, op_str );
<span class="lineNum"> 309 </span> : }
<span class="lineNum"> 310 </span> : }
<span class="lineNum"> 311 </span> : }
<span class="lineNum"> 312 </span> : ex.waitForSuccess();
<span class="lineNum"> 313 </span> : invalidate();
<span class="lineNum"> 314 </span> : }
<span class="lineNum"> 315 </span> :
<span class="lineNum"> 316 </span> : /// Returns true if the index has data
<span class="lineNum"> 317 </span> : bool hasData() const { return timestamp() > 0; }
<span class="lineNum"> 318 </span> :
<span class="lineNum"> 319 </span> : Query query( const std::string &s,
<span class="lineNum"> 320 </span> : bool expand = true,
<span class="lineNum"> 321 </span><span class="lineCov"> 5 : int qualityCutoff = 50 )</span>
<span class="lineNum"> 322 </span> : {
<span class="lineNum"> 323 </span><span class="lineCov"> 5 : Query q( db() );</span>
<span class="lineNum"> 324 </span><span class="lineCov"> 5 : q.setQualityCutoff( qualityCutoff );</span>
<span class="lineNum"> 325 </span><span class="lineCov"> 5 : q.setExpand( expand );</span>
<span class="lineNum"> 326 </span><span class="lineCov"> 5 : q.addTerms( s );</span>
<span class="lineNum"> 327 </span><span class="lineNoCov"> 0 : return q;</span>
<span class="lineNum"> 328 </span> : }
<span class="lineNum"> 329 </span> :
<span class="lineNum"> 330 </span> : Query partialQuery( const std::string &s ) {
<span class="lineNum"> 331 </span> : Query q( db() );
<span class="lineNum"> 332 </span> : q.addTerms( s, true ); // partial
<span class="lineNum"> 333 </span> : return q;
<span class="lineNum"> 334 </span> : }
<span class="lineNum"> 335 </span> :
<span class="lineNum"> 336 </span> : /// Returns true if the index is older than the Apt database information
<span class="lineNum"> 337 </span> : // bool needsRebuild(apt::Apt& apt);
<span class="lineNum"> 338 </span> :
<span class="lineNum"> 339 </span> : Xapian::docid docidByName(const std::string& pkgname) const;
<span class="lineNum"> 340 </span> :
<span class="lineNum"> 341 </span> : /**
<span class="lineNum"> 342 </span> : * Tokenize the string and build an OR query with the resulting keywords
<span class="lineNum"> 343 </span> : */
<span class="lineNum"> 344 </span> : Xapian::Query makeORQuery(const std::string& keywords) const;
<span class="lineNum"> 345 </span> :
<span class="lineNum"> 346 </span> : /**
<span class="lineNum"> 347 </span> : * Tokenize the string and build an OR query with the resulting keywords.
<span class="lineNum"> 348 </span> : *
<span class="lineNum"> 349 </span> : * The last token in keywords is considered to be typed only partially, to
<span class="lineNum"> 350 </span> : * implement proper search-as-you-type.
<span class="lineNum"> 351 </span> : */
<span class="lineNum"> 352 </span> : Xapian::Query makePartialORQuery(const std::string& keywords) const;
<span class="lineNum"> 353 </span> :
<span class="lineNum"> 354 </span> : /**
<span class="lineNum"> 355 </span> : * Build a query with the given keywords, specified as iterators of strings
<span class="lineNum"> 356 </span> : */
<span class="lineNum"> 357 </span> : template<typename ITER>
<span class="lineNum"> 358 </span> : Xapian::Query makeORQuery(const ITER& begin, const ITER& end) const
<span class="lineNum"> 359 </span> : {
<span class="lineNum"> 360 </span> : return Xapian::Query(Xapian::Query::OP_OR, begin, end);
<span class="lineNum"> 361 </span> : }
<span class="lineNum"> 362 </span> :
<span class="lineNum"> 363 </span> : /// Return a list of tag-based terms that can be used to expand an OR query
<span class="lineNum"> 364 </span> : std::vector<std::string> expand(Xapian::Enquire& enq) const;
<span class="lineNum"> 365 </span> :
<span class="lineNum"> 366 </span> : // std::vector<std::string> similar(const std::string& pkg);
<span class="lineNum"> 367 </span> :
<span class="lineNum"> 368 </span> : /**
<span class="lineNum"> 369 </span> : * Create a query to look for packages similar to the given one
<span class="lineNum"> 370 </span> : */
<span class="lineNum"> 371 </span> : Xapian::Query makeRelatedQuery(const std::string& pkgname) const;
<span class="lineNum"> 372 </span> :
<span class="lineNum"> 373 </span> : /**
<span class="lineNum"> 374 </span> : * Get the integer value for
<span class="lineNum"> 375 </span> : */
<span class="lineNum"> 376 </span> : double getDoubleValue(const std::string& pkgname,
<span class="lineNum"> 377 </span> : Xapian::valueno val_id) const;
<span class="lineNum"> 378 </span> :
<span class="lineNum"> 379 </span> : /**
<span class="lineNum"> 380 </span> : * Get the integer value for
<span class="lineNum"> 381 </span> : */
<span class="lineNum"> 382 </span> : int getIntValue(const std::string& pkgname, Xapian::valueno val_id) const;
<span class="lineNum"> 383 </span> : };
<span class="lineNum"> 384 </span> :
<span class="lineNum"> 385 </span> : }
<span class="lineNum"> 386 </span> : }
<span class="lineNum"> 387 </span> : }
<span class="lineNum"> 388 </span> :
<span class="lineNum"> 389 </span> : #endif
</pre>
</td>
</tr>
</table>
<br>
<table width="100%" border=0 cellspacing=0 cellpadding=0>
<tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
<tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
</table>
<br>
</body>
</html>
|
