blob: e88e6d3ec01e70c5bced759ccabcc88bcac057c9 (
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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "resultset.h"
namespace document::select {
const ResultSet::PreCalculated ResultSet::_preCalc(ResultSet::illegalMask());
/*
* Precalculate possible outcomes of boolean operations, given possible
* inputs.
*/
ResultSet::PreCalculated::PreCalculated(uint32_t range)
: _ands(range * range),
_ors(range * range),
_nots(range)
{
uint32_t erange = Result::enumRange;
for (ResultSet lset; lset.pcvalid(); lset.pcnext()) {
for (ResultSet rset; rset.pcvalid(); rset.pcnext()) {
ResultSet myand;
ResultSet myor;
for (uint32_t lenum = 0; lenum < erange; ++lenum) {
if (!lset.hasEnum(lenum))
continue;
const Result &lhs(Result::fromEnum(lenum));
for (uint32_t renum = 0; renum < erange; ++renum) {
if (!rset.hasEnum(renum))
continue;
const Result &rhs(Result::fromEnum(renum));
myand.add(lhs && rhs);
myor.add(lhs || rhs);
}
}
_ands[(lset._val << erange) + rset._val] = myand;
_ors[(lset._val << erange) + rset._val] = myor;
}
ResultSet mynot;
for (uint32_t lenum = 0; lenum < erange; ++lenum) {
if (!lset.hasEnum(lenum))
continue;
const Result &lhs(Result::fromEnum(lenum));
mynot.add(!lhs);
}
_nots[lset._val] = mynot;
}
}
ResultSet::PreCalculated::~PreCalculated() = default;
}
|
