blob: bf92f0ae04c04db401d19b168db0510e71975f30 (
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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "customtypevisitor.h"
#include "intermediate.h"
namespace search::query {
template <class NodeTypes>
class CustomTypeTermVisitor : public CustomTypeVisitor<NodeTypes>
{
protected:
void visitChildren(Intermediate &n) {
for (auto & child : n.getChildren()) {
child->accept(*this);
}
}
private:
void visit(typename NodeTypes::And &n) override { visitChildren(n); }
void visit(typename NodeTypes::AndNot &n) override { visitChildren(n); }
void visit(typename NodeTypes::Equiv &n) override { visitChildren(n); }
void visit(typename NodeTypes::Near &n) override { visitChildren(n); }
void visit(typename NodeTypes::ONear &n) override { visitChildren(n); }
void visit(typename NodeTypes::Or &n) override { visitChildren(n); }
void visit(typename NodeTypes::Rank &n) override { visitChildren(n); }
void visit(typename NodeTypes::WeakAnd &n) override { visitChildren(n); }
void visit(typename NodeTypes::SameElement &n) override { visitChildren(n); }
// leaf nodes without terms:
void visit(typename NodeTypes::TrueQueryNode &) override {}
void visit(typename NodeTypes::FalseQueryNode &) override {}
// phrases and weighted set terms are conceptual leaf nodes and
// should be handled that way.
};
}
|
