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
|
/** @file
* @brief tests of MSet sorting
*/
/* Copyright (C) 2007,2008,2009,2012,2017,2019 Olly Betts
* Copyright (C) 2010 Richard Boulton
*
* 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, see
* <https://www.gnu.org/licenses/>.
*/
#include <config.h>
#include "api_sorting.h"
#include <xapian.h>
#include "apitest.h"
#include "testutils.h"
using namespace std;
DEFINE_TESTCASE(sortfunctor1, backend) {
Xapian::Enquire enquire(get_database("apitest_sortrel"));
enquire.set_query(Xapian::Query("woman"));
{
static const int keys[] = { 3, 1 };
Xapian::MultiValueKeyMaker sorter(keys, keys + 2);
enquire.set_sort_by_key(&sorter, true);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 2, 6, 7, 1, 3, 4, 5, 8, 9);
for (auto m = mset.begin(); m != mset.end(); ++m) {
const string& data = m.get_document().get_data();
string exp;
exp += data[3];
exp += string(2, '\0');
exp += data[1];
TEST_EQUAL(m.get_sort_key(), exp);
}
}
{
Xapian::MultiValueKeyMaker sorter;
sorter.add_value(3);
sorter.add_value(1, true);
enquire.set_sort_by_key(&sorter, true);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 7, 6, 2, 8, 9, 4, 5, 1, 3);
for (auto m = mset.begin(); m != mset.end(); ++m) {
const string& data = m.get_document().get_data();
string exp;
exp += data[3];
exp += string(2, '\0');
exp += char(0xff - data[1]);
exp += string(2, '\xff');
TEST_EQUAL(m.get_sort_key(), exp);
}
}
{
Xapian::MultiValueKeyMaker sorter;
sorter.add_value(100); // Value 100 isn't set.
sorter.add_value(3);
sorter.add_value(1, true);
enquire.set_sort_by_key(&sorter, true);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 7, 6, 2, 8, 9, 4, 5, 1, 3);
for (auto m = mset.begin(); m != mset.end(); ++m) {
const string& data = m.get_document().get_data();
string exp;
exp += string(2, '\0');
exp += data[3];
exp += string(2, '\0');
exp += char(0xff - data[1]);
exp += string(2, '\xff');
TEST_EQUAL(m.get_sort_key(), exp);
}
}
{
Xapian::MultiValueKeyMaker sorter;
sorter.add_value(10); // Value 10 isn't always set.
sorter.add_value(1, true);
enquire.set_sort_by_key(&sorter, true);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 8, 9, 4, 5, 1, 3, 7, 6, 2);
for (auto m = mset.begin(); m != mset.end(); ++m) {
const string& data = m.get_document().get_data();
string exp;
if (data.size() > 10) exp += data[10];
exp += string(2, '\0');
exp += char(0xff - data[1]);
exp += string(2, '\xff');
TEST_EQUAL(m.get_sort_key(), exp);
}
}
}
/// Test reverse sort functor.
DEFINE_TESTCASE(sortfunctor2, backend) {
Xapian::Database db = get_database("sortfunctor2",
[](Xapian::WritableDatabase& wdb,
const string&) {
Xapian::Document doc;
doc.add_term("foo");
doc.add_value(0, "ABB");
wdb.add_document(doc);
doc.add_value(0, "ABC");
wdb.add_document(doc);
doc.add_value(0, string("ABC", 4));
wdb.add_document(doc);
doc.add_value(0, "ABCD");
wdb.add_document(doc);
doc.add_value(0, "ABC\xff");
wdb.add_document(doc);
});
Xapian::Enquire enquire(db);
enquire.set_query(Xapian::Query("foo"));
{
Xapian::MultiValueKeyMaker sorter;
sorter.add_value(0);
enquire.set_sort_by_key(&sorter, true);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 5, 4, 3, 2, 1);
}
{
Xapian::MultiValueKeyMaker sorter;
sorter.add_value(0, true);
enquire.set_sort_by_key(&sorter, true);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 1, 2, 3, 4, 5);
}
{
Xapian::MultiValueKeyMaker sorter;
sorter.add_value(0);
sorter.add_value(1);
enquire.set_sort_by_key(&sorter, true);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 5, 4, 3, 2, 1);
}
{
Xapian::MultiValueKeyMaker sorter;
sorter.add_value(0, true);
sorter.add_value(1);
enquire.set_sort_by_key(&sorter, true);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 1, 2, 3, 4, 5);
}
{
Xapian::MultiValueKeyMaker sorter;
sorter.add_value(0);
sorter.add_value(1, true);
enquire.set_sort_by_key(&sorter, true);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 5, 4, 3, 2, 1);
}
{
Xapian::MultiValueKeyMaker sorter;
sorter.add_value(0, true);
sorter.add_value(1, true);
enquire.set_sort_by_key(&sorter, true);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 1, 2, 3, 4, 5);
}
}
// Test sort functor with some empty values.
DEFINE_TESTCASE(sortfunctor3, valuestats) {
Xapian::Database db(get_database("apitest_sortrel"));
Xapian::Enquire enquire(db);
enquire.set_query(Xapian::Query("woman"));
// Value 10 is set to 'a' for 1, 3, 4, 5, 8, 9, and not set otherwise.
{
// Test default sort order - missing values come first.
Xapian::MultiValueKeyMaker sorter;
sorter.add_value(10);
enquire.set_sort_by_key(&sorter, false);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 2, 6, 7, 1, 3, 4, 5, 8, 9);
}
{
// Use a default value to put the missing values to the end.
Xapian::MultiValueKeyMaker sorter;
sorter.add_value(10, false, db.get_value_upper_bound(10) + '\xff');
enquire.set_sort_by_key(&sorter, false);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 1, 3, 4, 5, 8, 9, 2, 6, 7);
}
{
// Test using a default value and sorting in reverse order
Xapian::MultiValueKeyMaker sorter;
sorter.add_value(10, false, db.get_value_upper_bound(10) + '\xff');
enquire.set_sort_by_key(&sorter, true);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 2, 6, 7, 1, 3, 4, 5, 8, 9);
}
{
// Test using a default value and generating reverse order keys
Xapian::MultiValueKeyMaker sorter;
sorter.add_value(10, true, db.get_value_upper_bound(10) + '\xff');
enquire.set_sort_by_key(&sorter, false);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 2, 6, 7, 1, 3, 4, 5, 8, 9);
}
{
// Test using a default value, generating reverse order keys, and
// sorting in reverse order
Xapian::MultiValueKeyMaker sorter;
sorter.add_value(10, true, db.get_value_upper_bound(10) + '\xff');
enquire.set_sort_by_key(&sorter, true);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 1, 3, 4, 5, 8, 9, 2, 6, 7);
}
}
class NeverUseMeKeyMaker : public Xapian::KeyMaker {
public:
std::string operator() (const Xapian::Document&) const override {
FAIL_TEST("NeverUseMeKeyMaker was called");
}
};
/// Regression test for changing away from a sorter.
DEFINE_TESTCASE(changesorter1, backend && !remote) {
Xapian::Enquire enquire(get_database("apitest_simpledata"));
enquire.set_query(Xapian::Query("word"));
NeverUseMeKeyMaker sorter;
enquire.set_sort_by_key(&sorter, true);
enquire.set_sort_by_value(0, true);
Xapian::MSet mset = enquire.get_mset(0, 25);
TEST_EQUAL(mset.size(), 2); // Check that search is still doing something.
enquire.set_sort_by_key(&sorter, true);
enquire.set_sort_by_value_then_relevance(0, true);
mset = enquire.get_mset(0, 25);
TEST_EQUAL(mset.size(), 2); // Check that search is still doing something.
enquire.set_sort_by_key(&sorter, true);
enquire.set_sort_by_relevance_then_value(0, true);
mset = enquire.get_mset(0, 25);
TEST_EQUAL(mset.size(), 2); // Check that search is still doing something.
enquire.set_sort_by_key(&sorter, true);
enquire.set_sort_by_relevance();
mset = enquire.get_mset(0, 25);
TEST_EQUAL(mset.size(), 2); // Check that search is still doing something.
// Check that NeverUseMeKeyMaker::operator() would actually cause a test
// failure if called.
try {
sorter(Xapian::Document());
FAIL_TEST("NeverUseMeKeyMaker::operator() didn't throw TestFail");
} catch (const TestFail &) {
}
}
/// Regression test - an empty MultiValueSorter hung in 1.0.9 and earlier.
DEFINE_TESTCASE(sortfunctorempty1, backend) {
Xapian::Enquire enquire(get_database("apitest_sortrel"));
enquire.set_query(Xapian::Query("woman"));
{
int i;
Xapian::MultiValueKeyMaker sorter(&i, &i);
enquire.set_sort_by_key(&sorter, true);
Xapian::MSet mset = enquire.get_mset(0, 10);
mset_expect_order(mset, 1, 2, 3, 4, 5, 6, 7, 8, 9);
}
}
DEFINE_TESTCASE(multivaluekeymaker1, !backend) {
static const int keys[] = { 0, 1, 2, 3 };
Xapian::MultiValueKeyMaker sorter(keys, keys + 4);
Xapian::Document doc;
TEST(sorter(doc).empty());
doc.add_value(1, "foo");
TEST_EQUAL(sorter(doc), string("\0\0foo", 5));
doc.add_value(1, string("f\0o", 3));
TEST_EQUAL(sorter(doc), string("\0\0f\0\xffo", 6));
doc.add_value(3, "xyz");
TEST_EQUAL(sorter(doc), string("\0\0f\0\xffo\0\0\0\0xyz", 13));
// An empty slot at the end, in reverse order, is terminated with \xff\xff
sorter.add_value(4, true);
TEST_EQUAL(sorter(doc), string("\0\0f\0\xffo\0\0\0\0xyz\0\0\xff\xff", 17));
// An empty slot at the end, in ascending order, has no effect
sorter.add_value(0);
TEST_EQUAL(sorter(doc), string("\0\0f\0\xffo\0\0\0\0xyz\0\0\xff\xff", 17));
// An empty slot at the end, with a default value
sorter.add_value(0, false, "hi");
TEST_EQUAL(sorter(doc), string("\0\0f\0\xffo\0\0\0\0xyz\0\0\xff\xff\0\0hi",
21));
// An empty slot at the end, with a default value, in reverse sort order
sorter.add_value(0, true, "hi");
TEST_EQUAL(sorter(doc), string("\0\0f\0\xffo\0\0\0\0xyz\0\0\xff\xff\0\0hi"
"\0\0\x97\x96\xff\xff", 27));
}
DEFINE_TESTCASE(sortfunctorremote1, remote) {
Xapian::Enquire enquire(get_database(string()));
NeverUseMeKeyMaker sorter;
enquire.set_query(Xapian::Query("word"));
enquire.set_sort_by_key(&sorter, true);
// NeverUseMeKeyMaker doesn't implemented serialise(), etc so should fail.
TEST_EXCEPTION(Xapian::UnimplementedError,
Xapian::MSet mset = enquire.get_mset(0, 10);
);
}
DEFINE_TESTCASE(replace_weights1, backend) {
Xapian::Database mydb(get_database("apitest_onedoc"));
Xapian::Enquire enquire(mydb);
enquire.set_query(Xapian::Query("word"));
Xapian::MSet mymset = enquire.get_mset(0, 10);
// old_max_possible, max_attained = 0.269763689697702
double old_max_possible = mymset.get_max_possible();
const double new_weight = 0.125;
static const double weights[] = {new_weight};
mymset.replace_weights(begin(weights), end(weights));
Xapian::MSetIterator i = mymset.begin();
TEST(i != mymset.end());
TEST_EQUAL_DOUBLE(i.get_weight(), new_weight);
TEST_EQUAL_DOUBLE(mymset.get_max_attained(), new_weight);
TEST_EQUAL_DOUBLE(mymset.get_max_possible(), old_max_possible);
}
DEFINE_TESTCASE(replace_weights2, backend) {
Xapian::Database mydb(get_database("apitest_onedoc"));
Xapian::Enquire enquire(mydb);
enquire.set_query(Xapian::Query("word"));
Xapian::MSet mymset = enquire.get_mset(0, 10);
static const double weights[] = {1.0, 2.0};
TEST_EXCEPTION(Xapian::InvalidArgumentError,
mymset.replace_weights(begin(weights), end(weights)));
}
DEFINE_TESTCASE(sort_existing_mset_by_relevance, backend) {
Xapian::Database db = get_database("apitest_simpledata");
Xapian::Enquire enquire(db);
enquire.set_query(Xapian::Query("word"));
Xapian::MSet mymset = enquire.get_mset(0, 10);
static const Xapian::docid docids[] = {*mymset[0], *mymset[1]};
double max_weight = mymset.get_max_attained();
double weights[] = {max_weight * 0.5, max_weight + 1.0};
mymset.replace_weights(begin(weights), end(weights));
mymset.sort_by_relevance();
// The order of documents should have been reversed.
int k = 1;
for (Xapian::MSetIterator m = mymset.begin(); m != mymset.end();
++m, --k) {
TEST_EQUAL(*m, docids[k]);
TEST_EQUAL_DOUBLE(m.get_weight(), weights[k]);
}
// Test that setting larger weights is reflected in these methods.
TEST_EQUAL_DOUBLE(mymset.get_max_attained(), weights[1]);
TEST_EQUAL_DOUBLE(mymset.get_max_possible(), weights[1]);
}
|