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
|
/*------------------------------------------------------------------------------
* 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 "ConjunctionScorer.h"
#include "CLucene/util/Arrays.h"
CL_NS_USE(index)
CL_NS_USE(util)
CL_NS_DEF(search)
Scorer* ConjunctionScorer::first() const{
if ( scorers.end() == scorers.begin() )
return NULL;
return *scorers.begin();
} //get First
Scorer* ConjunctionScorer::last() {
if ( scorers.end() == scorers.begin() )
return NULL;
CL_NS_STD(list)<Scorer*>::iterator i = scorers.end();
--i;
return *i;
} //get Last
class _ScorerSorter:public CL_NS(util)::Arrays::_Arrays<Scorer*>{
public:
bool equals(Scorer* o1,Scorer* o2) const{
return o1->doc() == o2->doc();
}
int32_t compare(Scorer* o1,Scorer* o2) const{
return o1->doc() - o2->doc();
}
};
_ScorerSorter __ScorerSorter;
void ConjunctionScorer::sortScorers() {
// move scorers to an array
int32_t size = scorers.size();
Scorer** array = _CL_NEWARRAY(Scorer*,size+1);
scorers.toArray(array);
scorers.clear(); // empty the list
// note that this comparator is not consistent with equals!
__ScorerSorter.sort(array,size,0,size);
for (int32_t i = 0; i<size; i++) {
scorers.push_back(array[i]); // re-build list, now sorted
}
_CLDELETE_ARRAY(array);
}
bool ConjunctionScorer::doNext() {
while (more && first()->doc() < last()->doc()) { // find doc w/ all clauses
more = first()->skipTo(last()->doc()); // skip first upto last
Scorer* scorer = *scorers.begin();
scorers.delete_front();
scorers.push_back(scorer); // move first to last
}
return more; // found a doc with all clauses
}
void ConjunctionScorer::init() {
more = scorers.size() > 0;
// compute coord factor
coord = getSimilarity()->coord(scorers.size(), scorers.size());
// move each scorer to its first entry
CL_NS_STD(list)<Scorer*>::iterator i = scorers.begin();
while (more && i!=scorers.end()) {
more = ((Scorer*)*i)->next();
++i;
}
if (more)
sortScorers(); // initial sort of list
firstTime = false;
}
ConjunctionScorer::ConjunctionScorer(Similarity* similarity):
Scorer(similarity),
scorers(false),
firstTime(true),
more(true),
coord(0.0)
{
}
ConjunctionScorer::~ConjunctionScorer(){
scorers.setDoDelete(true);
}
TCHAR *CL_NS(search)::Scorer::toString(void){
return STRDUP_TtoT(_T("ConjunctionScorer"));
}
void ConjunctionScorer::add(Scorer* scorer){
scorers.push_back(scorer);
}
int32_t ConjunctionScorer::doc() const{ return first()->doc(); }
bool ConjunctionScorer::next() {
if (firstTime) {
init();
} else if (more) {
more = last()->next(); // trigger further scanning
}
return doNext();
}
bool ConjunctionScorer::skipTo(int32_t target) {
CL_NS_STD(list)<Scorer*>::iterator i = scorers.begin();
while (more && i!=scorers.end()) {
more = ((Scorer*)*i)->skipTo(target);
++i;
}
if (more)
sortScorers(); // re-sort scorers
return doNext();
}
qreal ConjunctionScorer::score(){
qreal score = 0.0f; // sum scores
CL_NS_STD(list)<Scorer*>::const_iterator i = scorers.begin();
while (i!=scorers.end()){
score += (*i)->score();
++i;
}
score *= coord;
return score;
}
CL_NS_END
|
