11 #include <unordered_map>
21 class CaselessLess :
public std::binary_function<Key, Key, bool> {
23 bool operator()(
const Key& a,
const Key& b)
const noexcept {
24 return std::lexicographical_compare(std::begin(a), std::end(a), std::begin(b), std::end(b),
25 [](
const char& cha,
const char& chb) {
26 return std::tolower(cha) < std::tolower(chb);
36 class CaselessEq :
public std::binary_function<Key, Key, bool> {
38 bool operator()(
const Key& a,
const Key& b)
const noexcept {
39 return a.size() == b.size() &&
40 std::equal(std::begin(a), std::end(a), std::begin(b), [](
const char& cha,
const char& chb) {
41 return std::tolower(cha) == std::tolower(chb);
50 class CaselessHash :
public std::hash<T> {
52 size_t operator()(T __val)
const noexcept {
54 std::transform(std::begin(__val), std::end(__val), std::back_inserter(lc), [](
typename T::value_type ch) {
55 return std::tolower(ch);
57 return std::hash<T>()(lc);
61 template <
class Key,
class Value>
62 using caseless_unordered_map = std::unordered_map<Key, Value, CaselessHash<Key>, CaselessEq<Key>>;
64 template <
class Key,
class Value>
65 using caseless_unordered_multimap = std::unordered_multimap<Key, Value, CaselessHash<Key>, CaselessEq<Key>>;
67 template <
class Key,
class Value>
68 using caseless_map = std::map<Key, Value, CaselessLess<Key>>;
71 using caseless_set = std::set<Key, CaselessLess<Key>>;
Inference Engine API.
Definition: ie_argmax_layer.hpp:11