blob: c46a1ee018cdb3d594982cd899c9f21506d44bf0 (
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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "predicate.h"
#include "predicate_builder.h"
#include <vespa/vespalib/data/slime/inspector.h>
#include <cassert>
using vespalib::slime::Inspector;
namespace document {
void PredicateBuilder::visitFeatureSet(const Inspector &i) {
_nodes.push_back(new FeatureSet(i));
}
void PredicateBuilder::visitFeatureRange(const Inspector &i) {
_nodes.push_back(new FeatureRange(i));
}
void PredicateBuilder::visitNegation(const Inspector &i) {
visitChildren(i);
_nodes.back() = new Negation(PredicateNode::UP(_nodes.back()));
}
void PredicateBuilder::visitConjunction(const Inspector &i) {
std::vector<PredicateNode *> nodes;
nodes.swap(_nodes);
visitChildren(i);
nodes.push_back(new Conjunction(_nodes));
nodes.swap(_nodes);
}
void PredicateBuilder::visitDisjunction(const Inspector &i) {
std::vector<PredicateNode *> nodes;
nodes.swap(_nodes);
visitChildren(i);
nodes.push_back(new Disjunction(_nodes));
nodes.swap(_nodes);
}
void PredicateBuilder::visitTrue(const Inspector &) {
_nodes.push_back(new TruePredicate);
}
void PredicateBuilder::visitFalse(const Inspector &) {
_nodes.push_back(new FalsePredicate);
}
std::unique_ptr<PredicateNode>
PredicateBuilder::build(const vespalib::slime::Inspector &i) {
visit(i);
assert(_nodes.size() == 1);
return std::unique_ptr<PredicateNode>(_nodes.front());
}
} // namespace document
|