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 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447
|
/** @file queryinternal.h
* @brief Xapian::Query internals
*/
/* Copyright (C) 2011,2012,2013,2014,2015,2016 Olly Betts
*
* 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
*/
#ifndef XAPIAN_INCLUDED_QUERYINTERNAL_H
#define XAPIAN_INCLUDED_QUERYINTERNAL_H
#include "postlist.h"
#include "queryvector.h"
#include "xapian/intrusive_ptr.h"
#include "xapian/query.h"
/// Default set_size for OP_ELITE_SET:
const Xapian::termcount DEFAULT_ELITE_SET_SIZE = 10;
class QueryOptimiser;
namespace Xapian {
namespace Internal {
class QueryTerm : public Query::Internal {
std::string term;
Xapian::termcount wqf;
Xapian::termpos pos;
public:
QueryTerm(const std::string & term_,
Xapian::termcount wqf_,
Xapian::termpos pos_)
: term(term_), wqf(wqf_), pos(pos_) { }
Xapian::Query::op get_type() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION;
const std::string & get_term() const { return term; }
PostingIterator::Internal * postlist(QueryOptimiser * qopt, double factor) const;
termcount get_length() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION {
return wqf;
}
void serialise(std::string & result) const;
std::string get_description() const;
void gather_terms(void * void_terms) const;
};
class QueryPostingSource : public Query::Internal {
Xapian::Internal::opt_intrusive_ptr<PostingSource> source;
public:
explicit QueryPostingSource(PostingSource * source_);
PostingIterator::Internal * postlist(QueryOptimiser *qopt, double factor) const;
void serialise(std::string & result) const;
Xapian::Query::op get_type() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION;
std::string get_description() const;
};
class QueryScaleWeight : public Query::Internal {
double scale_factor;
Query subquery;
public:
QueryScaleWeight(double factor, const Query & subquery_);
PostingIterator::Internal * postlist(QueryOptimiser *qopt, double factor) const;
termcount get_length() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION {
return subquery.internal->get_length();
}
void serialise(std::string & result) const;
Xapian::Query::op get_type() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION;
size_t get_num_subqueries() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION;
const Query get_subquery(size_t n) const;
std::string get_description() const;
void gather_terms(void * void_terms) const;
};
class QueryValueBase : public Query::Internal {
protected:
Xapian::valueno slot;
public:
explicit QueryValueBase(Xapian::valueno slot_)
: slot(slot_) { }
Xapian::valueno get_slot() const { return slot; }
};
class QueryValueRange : public QueryValueBase {
std::string begin, end;
public:
QueryValueRange(Xapian::valueno slot_,
const std::string &begin_,
const std::string &end_)
: QueryValueBase(slot_), begin(begin_), end(end_) { }
PostingIterator::Internal * postlist(QueryOptimiser *qopt, double factor) const;
void serialise(std::string & result) const;
Xapian::Query::op get_type() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION;
std::string get_description() const;
};
class QueryValueLE : public QueryValueBase {
std::string limit;
public:
QueryValueLE(Xapian::valueno slot_, const std::string &limit_)
: QueryValueBase(slot_), limit(limit_) { }
PostingIterator::Internal * postlist(QueryOptimiser *qopt, double factor) const;
void serialise(std::string & result) const;
Xapian::Query::op get_type() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION;
std::string get_description() const;
};
class QueryValueGE : public QueryValueBase {
std::string limit;
public:
QueryValueGE(Xapian::valueno slot_, const std::string &limit_)
: QueryValueBase(slot_), limit(limit_) { }
PostingIterator::Internal * postlist(QueryOptimiser *qopt, double factor) const;
void serialise(std::string & result) const;
Xapian::Query::op get_type() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION;
std::string get_description() const;
};
class QueryBranch : public Query::Internal {
virtual Xapian::Query::op get_op() const = 0;
protected:
QueryVector subqueries;
explicit QueryBranch(size_t n_subqueries) : subqueries(n_subqueries) { }
void serialise_(std::string & result, Xapian::termcount parameter = 0) const;
void do_or_like(OrContext& ctx, QueryOptimiser * qopt, double factor,
Xapian::termcount elite_set_size = 0, size_t first = 0) const;
PostList * do_synonym(QueryOptimiser * qopt, double factor) const;
PostList * do_max(QueryOptimiser * qopt, double factor) const;
const std::string get_description_helper(const char * op,
Xapian::termcount window = 0) const;
public:
termcount get_length() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION;
void serialise(std::string & result) const;
void gather_terms(void * void_terms) const;
virtual void add_subquery(const Xapian::Query & subquery) = 0;
Xapian::Query::op get_type() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION;
size_t get_num_subqueries() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION;
const Query get_subquery(size_t n) const;
virtual Query::Internal * done() = 0;
};
class QueryAndLike : public QueryBranch {
protected:
explicit QueryAndLike(size_t num_subqueries_)
: QueryBranch(num_subqueries_) { }
public:
void add_subquery(const Xapian::Query & subquery);
Query::Internal * done();
PostingIterator::Internal * postlist(QueryOptimiser * qopt, double factor) const;
void postlist_sub_and_like(AndContext& ctx, QueryOptimiser * qopt, double factor) const;
};
class QueryOrLike : public QueryBranch {
protected:
explicit QueryOrLike(size_t num_subqueries_)
: QueryBranch(num_subqueries_) { }
public:
void add_subquery(const Xapian::Query & subquery);
Query::Internal * done();
};
class QueryAnd : public QueryAndLike {
Xapian::Query::op get_op() const;
public:
explicit QueryAnd(size_t n_subqueries) : QueryAndLike(n_subqueries) { }
std::string get_description() const;
};
class QueryOr : public QueryOrLike {
Xapian::Query::op get_op() const;
public:
explicit QueryOr(size_t n_subqueries) : QueryOrLike(n_subqueries) { }
PostingIterator::Internal * postlist(QueryOptimiser * qopt, double factor) const;
void postlist_sub_or_like(OrContext& ctx, QueryOptimiser * qopt, double factor) const;
std::string get_description() const;
};
class QueryAndNot : public QueryBranch {
Xapian::Query::op get_op() const;
public:
explicit QueryAndNot(size_t n_subqueries) : QueryBranch(n_subqueries) { }
PostingIterator::Internal * postlist(QueryOptimiser * qopt, double factor) const;
void add_subquery(const Xapian::Query & subquery);
Query::Internal * done();
std::string get_description() const;
};
class QueryXor : public QueryOrLike {
Xapian::Query::op get_op() const;
public:
explicit QueryXor(size_t n_subqueries) : QueryOrLike(n_subqueries) { }
PostingIterator::Internal * postlist(QueryOptimiser * qopt, double factor) const;
void postlist_sub_xor(XorContext& ctx, QueryOptimiser * qopt, double factor) const;
std::string get_description() const;
};
class QueryAndMaybe : public QueryBranch {
Xapian::Query::op get_op() const;
public:
explicit QueryAndMaybe(size_t n_subqueries) : QueryBranch(n_subqueries) { }
PostingIterator::Internal * postlist(QueryOptimiser * qopt, double factor) const;
void add_subquery(const Xapian::Query & subquery);
Query::Internal * done();
std::string get_description() const;
};
class QueryFilter : public QueryAndLike {
Xapian::Query::op get_op() const;
public:
explicit QueryFilter(size_t n_subqueries) : QueryAndLike(n_subqueries) { }
PostingIterator::Internal * postlist(QueryOptimiser * qopt, double factor) const;
void postlist_sub_and_like(AndContext& ctx, QueryOptimiser * qopt, double factor) const;
std::string get_description() const;
};
class QueryWindowed : public QueryAndLike {
protected:
Xapian::termcount window;
QueryWindowed(size_t n_subqueries, Xapian::termcount window_)
: QueryAndLike(n_subqueries), window(window_) { }
void postlist_windowed(Xapian::Query::op op, AndContext& ctx,
QueryOptimiser * qopt, double factor) const;
public:
size_t get_window() const { return window; }
Query::Internal * done();
};
class QueryNear : public QueryWindowed {
Xapian::Query::op get_op() const;
public:
QueryNear(size_t n_subqueries, Xapian::termcount window_)
: QueryWindowed(n_subqueries, window_) { }
void serialise(std::string & result) const;
void postlist_sub_and_like(AndContext& ctx, QueryOptimiser * qopt, double factor) const;
std::string get_description() const;
};
class QueryPhrase : public QueryWindowed {
Xapian::Query::op get_op() const;
public:
QueryPhrase(size_t n_subqueries, Xapian::termcount window_)
: QueryWindowed(n_subqueries, window_) { }
void serialise(std::string & result) const;
void postlist_sub_and_like(AndContext& ctx, QueryOptimiser * qopt, double factor) const;
std::string get_description() const;
};
class QueryEliteSet : public QueryOrLike {
Xapian::Query::op get_op() const;
Xapian::termcount set_size;
public:
QueryEliteSet(size_t n_subqueries, Xapian::termcount set_size_)
: QueryOrLike(n_subqueries),
set_size(set_size_ ? set_size_ : DEFAULT_ELITE_SET_SIZE) { }
void serialise(std::string & result) const;
PostingIterator::Internal * postlist(QueryOptimiser * qopt, double factor) const;
void postlist_sub_or_like(OrContext& ctx, QueryOptimiser * qopt, double factor) const;
std::string get_description() const;
};
class QuerySynonym : public QueryOrLike {
Xapian::Query::op get_op() const;
public:
explicit QuerySynonym(size_t n_subqueries) : QueryOrLike(n_subqueries) { }
PostingIterator::Internal * postlist(QueryOptimiser * qopt, double factor) const;
Query::Internal * done();
std::string get_description() const;
};
class QueryMax : public QueryOrLike {
Xapian::Query::op get_op() const;
public:
explicit QueryMax(size_t n_subqueries) : QueryOrLike(n_subqueries) { }
PostingIterator::Internal * postlist(QueryOptimiser * qopt, double factor) const;
std::string get_description() const;
};
class QueryWildcard : public Query::Internal {
std::string pattern;
Xapian::termcount max_expansion;
int max_type;
Query::op combiner;
Xapian::Query::op get_op() const;
public:
QueryWildcard(const std::string &pattern_,
Xapian::termcount max_expansion_,
int max_type_,
Query::op combiner_)
: pattern(pattern_),
max_expansion(max_expansion_),
max_type(max_type_),
combiner(combiner_)
{ }
Xapian::Query::op get_type() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION;
const std::string & get_pattern() const { return pattern; }
PostingIterator::Internal * postlist(QueryOptimiser * qopt, double factor) const;
termcount get_length() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION;
void serialise(std::string & result) const;
std::string get_description() const;
};
class QueryInvalid : public Query::Internal {
public:
QueryInvalid() { }
Xapian::Query::op get_type() const XAPIAN_NOEXCEPT XAPIAN_PURE_FUNCTION;
PostingIterator::Internal * postlist(QueryOptimiser * qopt, double factor) const;
void serialise(std::string & result) const;
std::string get_description() const;
};
}
}
#endif // XAPIAN_INCLUDED_QUERYINTERNAL_H
|