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
|
/* queryparser.cc: The non-lemon-generated parts of the QueryParser
* class.
*
* Copyright (C) 2005,2006,2007,2008,2010 Olly Betts
* Copyright (C) 2010 Adam Sjøgren
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301
* USA
*/
#include <config.h>
#include <xapian/queryparser.h>
#include <xapian/termiterator.h>
#include "queryparser_internal.h"
#include "vectortermlist.h"
#include <cstring>
using namespace Xapian;
using namespace std;
// Default implementation in case the user hasn't implemented it.
string
Stopper::get_description() const
{
return "Xapian::Stopper subclass";
}
string
SimpleStopper::get_description() const
{
string desc("Xapian::SimpleStopper(");
set<string>::const_iterator i;
for (i = stop_words.begin(); i != stop_words.end(); ++i) {
if (i != stop_words.begin()) desc += ' ';
desc += *i;
}
desc += ')';
return desc;
}
ValueRangeProcessor::~ValueRangeProcessor() { }
QueryParser::QueryParser(const QueryParser & o) : internal(o.internal) { }
QueryParser &
QueryParser::operator=(const QueryParser & o)
{
internal = o.internal;
return *this;
}
QueryParser::QueryParser() : internal(new QueryParser::Internal) { }
QueryParser::~QueryParser() { }
void
QueryParser::set_stemmer(const Xapian::Stem & stemmer)
{
internal->stemmer = stemmer;
}
void
QueryParser::set_stemming_strategy(stem_strategy strategy)
{
internal->stem_action = strategy;
}
void
QueryParser::set_stopper(const Stopper * stopper)
{
internal->stopper = stopper;
}
void
QueryParser::set_default_op(Query::op default_op)
{
internal->default_op = default_op;
}
Query::op
QueryParser::get_default_op() const
{
return internal->default_op;
}
void
QueryParser::set_database(const Database &db) {
internal->db = db;
}
void
QueryParser::set_max_wildcard_expansion(Xapian::termcount max)
{
internal->max_wildcard_expansion = max;
}
Query
QueryParser::parse_query(const string &query_string, unsigned flags,
const string &default_prefix)
{
internal->stoplist.clear();
internal->unstem.clear();
internal->errmsg = NULL;
if (query_string.empty()) return Query();
Query result = internal->parse_query(query_string, flags, default_prefix);
if (internal->errmsg && strcmp(internal->errmsg, "parse error") == 0) {
result = internal->parse_query(query_string, 0, default_prefix);
}
if (internal->errmsg) throw Xapian::QueryParserError(internal->errmsg);
return result;
}
void
QueryParser::add_prefix(const string &field, const string &prefix)
{
Assert(internal.get());
internal->add_prefix(field, prefix, NON_BOOLEAN);
}
void
QueryParser::add_boolean_prefix(const string &field, const string &prefix,
bool exclusive)
{
Assert(internal.get());
// Don't allow the empty prefix to be set as boolean as it doesn't
// really make sense.
if (field.empty())
throw Xapian::UnimplementedError("Can't set the empty prefix to be a boolean filter");
filter_type type = (exclusive ? BOOLEAN_EXCLUSIVE : BOOLEAN);
internal->add_prefix(field, prefix, type);
}
void
QueryParser::add_boolean_prefix(const string &field, const string &prefix)
{
add_boolean_prefix(field, prefix, true);
}
TermIterator
QueryParser::stoplist_begin() const
{
const list<string> & sl = internal->stoplist;
return TermIterator(new VectorTermList(sl.begin(), sl.end()));
}
TermIterator
QueryParser::unstem_begin(const string &term) const
{
pair<multimap<string, string>::iterator,
multimap<string, string>::iterator> range;
range = internal->unstem.equal_range(term);
list<string> l;
multimap<string, string>::iterator & i = range.first;
while (i != range.second) {
l.push_back(i->second);
++i;
}
return TermIterator(new VectorTermList(l.begin(), l.end()));
}
void
QueryParser::add_valuerangeprocessor(Xapian::ValueRangeProcessor * vrproc)
{
Assert(internal.get());
internal->valrangeprocs.push_back(vrproc);
}
string
QueryParser::get_corrected_query_string() const
{
return internal->corrected_query;
}
string
QueryParser::get_description() const
{
// FIXME : describe better!
return "Xapian::QueryParser()";
}
|
