blob: 1fd5471fcbd392097d3fbafc05d9edb363f2192a (
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.
#pragma once
#include <vespa/vespalib/stllike/string.h>
#include <set>
#include <map>
namespace search {
/**
* Keeps track of a set of field names to calculate MatchingElements for.
*
* Also has mapping of the full name of struct fields into the name of the enclosing field.
* Example:
* A map<string, string> field "my_map" could contain two struct fields: "my_map.key" and "my_map.value".
**/
class MatchingElementsFields {
private:
std::set<vespalib::string> _fields;
std::map<vespalib::string, vespalib::string> _struct_fields;
public:
MatchingElementsFields();
~MatchingElementsFields();
bool empty() const { return _fields.empty(); }
void add_field(const vespalib::string &field_name) {
_fields.insert(field_name);
}
void add_mapping(const vespalib::string &field_name,
const vespalib::string &struct_field_name) {
_fields.insert(field_name);
_struct_fields[struct_field_name] = field_name;
}
bool has_field(const vespalib::string &field_name) const {
return (_fields.count(field_name) > 0);
}
bool has_struct_field(const vespalib::string &struct_field_name) const {
return (_struct_fields.find(struct_field_name) != _struct_fields.end());
}
const vespalib::string &get_enclosing_field(const vespalib::string &struct_field_name) const {
static const vespalib::string empty;
auto res = _struct_fields.find(struct_field_name);
if (res == _struct_fields.end()) {
return empty;
}
return res->second;
}
};
} // namespace search
|
