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
|
/*------------------------------------------------------------------------------
* 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 "SearchHeader.h"
#include "CLucene/document/Document.h"
#include "CLucene/index/IndexReader.h"
#include "Filter.h"
#include "CLucene/search/SearchHeader.h"
CL_NS_USE(document)
CL_NS_USE(util)
CL_NS_USE(index)
CL_NS_DEF(search)
HitDoc::HitDoc(const qreal s, const int32_t i)
{
//Func - Constructor
//Pre - true
//Post - The instance has been created
next = NULL;
prev = NULL;
doc = NULL;
score = s;
id = i;
}
HitDoc::~HitDoc(){
//Func - Destructor
//Pre - true
//Post - The instance has been destroyed
_CLDELETE(doc);
}
Hits::Hits(Searcher* s, Query* q, Filter* f, const Sort* _sort):
query(q), searcher(s), filter(f), sort(_sort)
{
//Func - Constructor
//Pre - s contains a valid reference to a searcher s
// q contains a valid reference to a Query
// f is NULL or contains a pointer to a filter
//Post - The instance has been created
_length = 0;
first = NULL;
last = NULL;
numDocs = 0;
maxDocs = 200;
//retrieve 100 initially
getMoreDocs(50);
}
Hits::~Hits(){
}
int32_t Hits::length() const {
return _length;
}
Document& Hits::doc(const int32_t n){
HitDoc* hitDoc = getHitDoc(n);
// Update LRU cache of documents
remove(hitDoc); // remove from list, if there
addToFront(hitDoc); // add to front of list
if (numDocs > maxDocs) { // if cache is full
HitDoc* oldLast = last;
remove(last); // flush last
_CLDELETE( oldLast->doc );
oldLast->doc = NULL;
}
if (hitDoc->doc == NULL){
hitDoc->doc = _CLNEW Document;
searcher->doc(hitDoc->id, hitDoc->doc); // cache miss: read document
}
return *hitDoc->doc;
}
int32_t Hits::id (const int32_t n){
return getHitDoc(n)->id;
}
qreal Hits::score(const int32_t n){
return getHitDoc(n)->score;
}
void Hits::getMoreDocs(const size_t m){
size_t _min = m;
{
size_t nHits = hitDocs.size();
if ( nHits > _min)
_min = nHits;
}
size_t n = _min * 2; // double # retrieved
TopDocs* topDocs = NULL;
if ( sort==NULL )
topDocs = (TopDocs*)((Searchable*)searcher)->_search(query, filter, n);
else
topDocs = (TopDocs*)((Searchable*)searcher)->_search(query, filter, n, sort);
_length = topDocs->totalHits;
ScoreDoc* scoreDocs = topDocs->scoreDocs;
int32_t scoreDocsLength = topDocs->scoreDocsLength;
qreal scoreNorm = 1.0f;
//Check that scoreDocs is a valid pointer before using it
if (scoreDocs != NULL){
if (_length > 0 && scoreDocs[0].score > 1.0f){
scoreNorm = 1.0f / scoreDocs[0].score;
}
int32_t end = scoreDocsLength < _length ? scoreDocsLength : _length;
for (int32_t i = hitDocs.size(); i < end; i++) {
hitDocs.push_back(_CLNEW HitDoc(scoreDocs[i].score*scoreNorm, scoreDocs[i].doc));
}
}
_CLDELETE(topDocs);
}
HitDoc* Hits::getHitDoc(const size_t n){
if (n >= _length){
TCHAR buf[100];
_sntprintf(buf, 100,_T("Not a valid hit number: %d"),n);
_CLTHROWT(CL_ERR_IndexOutOfBounds, buf );
}
if (n >= hitDocs.size())
getMoreDocs(n);
return hitDocs[n];
}
void Hits::addToFront(HitDoc* hitDoc) { // insert at front of cache
if (first == NULL)
last = hitDoc;
else
first->prev = hitDoc;
hitDoc->next = first;
first = hitDoc;
hitDoc->prev = NULL;
numDocs++;
}
void Hits::remove(const HitDoc* hitDoc) { // remove from cache
if (hitDoc->doc == NULL) // it's not in the list
return; // abort
if (hitDoc->next == NULL)
last = hitDoc->prev;
else
hitDoc->next->prev = hitDoc->prev;
if (hitDoc->prev == NULL)
first = hitDoc->next;
else
hitDoc->prev->next = hitDoc->next;
numDocs--;
}
CL_NS_END
|
