blob: f90ceeaafcb5a6d15c9c178f52c0473e90077d97 (
plain)
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
|
/*------------------------------------------------------------------------------
* 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 "FilteredTermEnum.h"
CL_NS_USE(index)
CL_NS_DEF(search)
FilteredTermEnum::FilteredTermEnum(){
//Func - Constructor
//Pre - true
//Post - Instance has been created
currentTerm = NULL;
actualEnum = NULL;
}
FilteredTermEnum::~FilteredTermEnum() {
//Func - Destructor
//Pre - true
//Post - The instance has been destroyed
close();
}
int32_t FilteredTermEnum::docFreq() const {
//Func - Returns the docFreq of the current Term in the enumeration.
//Pre - next() must have been called at least once
//Post - if actualEnum is NULL result is -1 otherwise the frequencey is returned
if (actualEnum == NULL){
return -1;
}
return actualEnum->docFreq();
}
bool FilteredTermEnum::next() {
//Func - Increments the enumeration to the next element.
//Pre - true
//Post - Returns True if the enumeration has been moved to the next element otherwise false
//The actual enumerator is not initialized!
if (actualEnum == NULL){
return false;
}
//Finalize the currentTerm and reset it to NULL
_CLDECDELETE( currentTerm );
//Iterate through the enumeration
while (currentTerm == NULL) {
if (endEnum())
return false;
if (actualEnum->next()) {
//Order term not to return reference ownership here. */
Term* term = actualEnum->term(false);
//Compare the retrieved term
if (termCompare(term)){
//Matched so finalize the current
_CLDECDELETE(currentTerm);
//Get a reference to the matched term
currentTerm = _CL_POINTER(term);
return true;
}
}else
return false;
}
_CLDECDELETE(currentTerm);
currentTerm = NULL;
return false;
}
Term* FilteredTermEnum::term() {
//Func - Returns the current Term in the enumeration.
//Pre - next() must have been called at least once
// pointer is true or false
//Post - if pre(pointer) is true the reference counter of currentTerm is increased
// and current Term is returned otherwise currentTerm is only returned
return _CL_POINTER(currentTerm);
}
Term* FilteredTermEnum::term(bool pointer) {
if ( pointer )
return _CL_POINTER(currentTerm);
else
return currentTerm;
}
void FilteredTermEnum::close(){
//Func - Closes the enumeration to further activity, freeing resources.
//Pre - true
//Post - The Enumeration has been closed
//Check if actualEnum is valid
if (actualEnum){
//Close the enumeration
actualEnum->close();
}
//Destroy the enumeration
_CLDELETE(actualEnum);
//Destroy currentTerm
_CLDECDELETE(currentTerm);
}
void FilteredTermEnum::setEnum(TermEnum* actualEnum) {
//Func - Sets the actual Enumeration
//Pre - actualEnum != NULL
//Post - The instance has been created
CND_PRECONDITION(actualEnum != NULL,"actualEnum is NULL");
_CLDELETE(this->actualEnum);
this->actualEnum = actualEnum;
// Find the first term that matches
//Ordered term not to return reference ownership here.
Term* term = actualEnum->term(false);
if (term != NULL && termCompare(term)){
_CLDECDELETE(currentTerm);
currentTerm = _CL_POINTER(term);
}else{
next();
}
}
CL_NS_END
|
