blob: 4abdf31cde5207351ad1d1cd2fa927187b5efd87 (
plain)
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
|
#pragma once
#include "indexer/classificator.hpp"
#include "indexer/feature_data.hpp"
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
namespace ftypes
{
template <typename Container>
class Matcher
{
public:
using ConstIterator = typename Container::const_iterator;
ConstIterator Find(feature::TypesHolder const & types) const
{
for (auto const t : types)
{
for (auto level = ftype::GetLevel(t); level; --level)
{
auto truncatedType = t;
ftype::TruncValue(truncatedType, level);
auto const it = m_mapping.find(truncatedType);
if (it != m_mapping.cend())
return it;
}
}
return m_mapping.cend();
}
ConstIterator End() const
{
return m_mapping.cend();
}
bool IsValid(ConstIterator it) const
{
return it != m_mapping.cend();
}
bool Contains(feature::TypesHolder const & types) const
{
return IsValid(Find(types));
}
template <typename Type, typename... Args>
void AppendType(Type && type, Args &&... args)
{
m_mapping.emplace(classif().GetTypeByPath(std::forward<Type>(type)),
std::forward<Args>(args)...);
}
template <typename TypesPaths, typename... Args>
void Append(TypesPaths && types, Args &&... args)
{
// We mustn't forward args in the loop below because it will be forwarded at first iteration.
for (auto const & type : types)
AppendType(type, args...);
}
private:
Container m_mapping;
};
template <typename Key, typename Value>
using HashMapMatcher = Matcher<std::unordered_map<Key, Value>>;
template <typename Key>
using HashSetMatcher = Matcher<std::unordered_set<Key>>;
} // namespace ftypes
|
