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
|
/*------------------------------------------------------------------------------
* Copyright (C) 2003-2006 Ben van Klinken and the CLucene Team
*
* Distributable under the terms of either the Apache License (Version 2.0) or
* the GNU Lesser General Public License, as specified in the COPYING file.
------------------------------------------------------------------------------*/
#include "CLucene/StdHeader.h"
#include "BooleanScorer.h"
#include "Scorer.h"
#include "Similarity.h"
CL_NS_USE(util)
CL_NS_DEF(search)
BooleanScorer::BooleanScorer(Similarity* similarity):
Scorer(similarity),
scorers(NULL),
maxCoord (1),
nextMask (1),
end(0),
current(NULL),
requiredMask (0),
prohibitedMask (0),
coordFactors (NULL)
{
bucketTable = _CLNEW BucketTable(this);
}
BooleanScorer::~BooleanScorer(){
//Func - Destructor
//Pre - true
//Post - The instance has been destroyed
_CLDELETE(bucketTable);
_CLDELETE_ARRAY(coordFactors);
_CLDELETE(scorers);
}
bool BooleanScorer::next() {
bool more;
do {
while (bucketTable->first != NULL) { // more queued
current = bucketTable->first;
bucketTable->first = current->next; // pop the queue
// check prohibited & required
if ((current->bits & prohibitedMask) == 0 &&
(current->bits & requiredMask) == requiredMask) {
return true;
}
}
// refill the queue
more = false;
end += BooleanScorer::BucketTable_SIZE;
for (SubScorer* sub = scorers; sub != NULL; sub = sub->next) {
Scorer* scorer = sub->scorer;
int32_t doc;
while (!sub->done && (doc=scorer->doc()) < end) {
sub->collector->collect(doc, scorer->score());
sub->done = !scorer->next();
}
if (!sub->done) {
more = true;
}
}
} while (bucketTable->first != NULL || more);
return false;
}
qreal BooleanScorer::score(){
if (coordFactors == NULL)
computeCoordFactors();
return current->score * coordFactors[current->coord];
}
bool BooleanScorer::skipTo(int32_t target) {
_CLTHROWA(CL_ERR_UnsupportedOperation,"UnsupportedOperationException: BooleanScorer::skipTo");
}
void BooleanScorer::explain(int32_t doc, Explanation* ret) {
_CLTHROWA(CL_ERR_UnsupportedOperation,"UnsupportedOperationException: BooleanScorer::explain");
}
TCHAR* BooleanScorer::toString() {
CL_NS(util)::StringBuffer buffer;
buffer.append(_T("boolean("));
for (SubScorer* sub = scorers; sub != NULL; sub = sub->next) {
buffer.append(sub->scorer->toString());
buffer.append(_T(" "));
}
buffer.appendChar(')');
return buffer.toString();
}
void BooleanScorer::add(Scorer* scorer, const bool required, const bool prohibited) {
int32_t mask = 0;
if (required || prohibited) {
if (nextMask == 0)
_CLTHROWA(CL_ERR_IndexOutOfBounds, "More than 32 required/prohibited clauses in query.");
mask = nextMask;
nextMask = ( nextMask << 1 );
} else
mask = 0;
if (!prohibited)
maxCoord++;
if (prohibited)
prohibitedMask |= mask; // update prohibited mask
else if (required)
requiredMask |= mask; // update required mask
//scorer, HitCollector, and scorers is delete in the SubScorer
scorers = _CLNEW SubScorer(scorer, required, prohibited,
bucketTable->newCollector(mask), scorers);
}
void BooleanScorer::computeCoordFactors(){
coordFactors = _CL_NEWARRAY(qreal,maxCoord);
for (int32_t i = 0; i < maxCoord; i++)
coordFactors[i] = getSimilarity()->coord(i, maxCoord-1);
}
/*void BooleanScorer::score(HitCollector* results, const int32_t maxDoc) {
if (coordFactors == NULL)
computeCoordFactors();
while (currentDoc < maxDoc) {
currentDoc = (currentDoc+BucketTable_SIZE<maxDoc?currentDoc+BucketTable_SIZE:maxDoc);
for (SubScorer* t = scorers; t != NULL; t = t->next)
t->scorer->score((t->collector), currentDoc);
bucketTable->collectHits(results);
}
}*/
BooleanScorer::SubScorer::SubScorer(Scorer* scr, const bool r, const bool p, HitCollector* c, SubScorer* nxt):
scorer(scr),
required(r),
prohibited(p),
collector(c),
next(nxt)
{
//Func - Constructor
//Pre - scr != NULL,
// c != NULL
// nxt may or may not be NULL
//Post - The instance has been created
CND_PRECONDITION(scr != NULL,"scr is NULL");
CND_PRECONDITION(c != NULL,"c is NULL");
done = !scorer->next();
}
BooleanScorer::SubScorer::~SubScorer(){
//Func - Destructor
//Pre - true
//Post - The instance has been destroyed
for (SubScorer * ptr = next; ptr; ){
SubScorer* next = ptr->next;
ptr->next = NULL;
_CLDELETE(ptr);
ptr = next;
}
_CLDELETE(scorer);
_CLDELETE(collector);
}
BooleanScorer::Bucket::Bucket():
doc(-1),
score(0.0),
bits(0),
coord(0),
next(NULL)
{
}
BooleanScorer::Bucket::~Bucket(){
}
BooleanScorer::BucketTable::BucketTable(BooleanScorer* scr):
scorer(scr),
first(NULL)
{
buckets = _CL_NEWARRAY(Bucket,BucketTable_SIZE);
}
BooleanScorer::BucketTable::~BucketTable(){
clear();
_CLDELETE_ARRAY(buckets);
}
void BooleanScorer::BucketTable::clear(){
//delete first;
first = NULL;
}
int32_t BooleanScorer::BucketTable::size() const { return BooleanScorer::BucketTable_SIZE; }
HitCollector* BooleanScorer::BucketTable::newCollector(const int32_t mask) {
return _CLNEW Collector(mask, this);
}
BooleanScorer::Collector::Collector(const int32_t msk, BucketTable* bucketTbl):
bucketTable(bucketTbl),
mask(msk)
{
}
void BooleanScorer::Collector::collect(const int32_t doc, const qreal score){
BucketTable* table = bucketTable;
int32_t i = doc & (BooleanScorer::BucketTable_SIZE-1);
Bucket* bucket = &table->buckets[i];
if (bucket->doc != doc) { // invalid bucket
bucket->doc = doc; // set doc
bucket->score = score; // initialize score
bucket->bits = mask; // initialize mask
bucket->coord = 1; // initialize coord
bucket->next = table->first; // push onto valid list
table->first = bucket;
} else { // valid bucket
bucket->score += score; // increment score
bucket->bits |= mask; // add bits in mask
bucket->coord++; // increment coord
}
}
CL_NS_END
|
