blob: f17403bd33a3c617e92d42164f80040aecc109b5 (
plain) (
blame)
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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "common.h"
#include <random>
#include <sstream>
using search::attribute::CollectionType;
namespace search::queryeval::test {
vespalib::string
to_string(const Config& attr_config)
{
std::ostringstream oss;
auto col_type = attr_config.collectionType();
auto basic_type = attr_config.basicType();
if (col_type == CollectionType::SINGLE) {
oss << basic_type.asString();
} else {
oss << col_type.asString() << "<" << basic_type.asString() << ">";
}
if (attr_config.fastSearch()) {
oss << "(fs)";
}
return oss.str();
}
vespalib::string
to_string(QueryOperator query_op)
{
switch (query_op) {
case QueryOperator::Term: return "Term";
case QueryOperator::In: return "In";
case QueryOperator::WeightedSet: return "WeightedSet";
case QueryOperator::DotProduct: return "DotProduct";
case QueryOperator::And: return "And";
case QueryOperator::Or: return "Or";
case QueryOperator::WeakAnd: return "WeakAnd";
case QueryOperator::ParallelWeakAnd: return "ParallelWeakAnd";
}
return "unknown";
}
namespace {
// TODO: Make seed configurable.
constexpr uint32_t default_seed = 1234;
std::mt19937 gen(default_seed);
}
BitVector::UP
random_docids(uint32_t docid_limit, uint32_t count)
{
auto res = BitVector::create(docid_limit);
if ((count + 1) == docid_limit) {
res->notSelf();
res->clearBit(0);
return res;
}
uint32_t docids_left = count;
// Bit 0 is never set since it is reserved as docid 0.
// All other docids have equal probability to be set.
for (uint32_t docid = 1; docid < docid_limit; ++docid) {
std::uniform_int_distribution<uint32_t> distr(0, docid_limit - docid - 1);
if (distr(gen) < docids_left) {
res->setBit(docid);
--docids_left;
}
}
res->invalidateCachedCount();
assert(res->countTrueBits() == count);
return res;
}
int32_t
random_int(int32_t a, int32_t b)
{
std::uniform_int_distribution<int32_t> distr(a, b);
return distr(gen);
}
}
|
