15 #include <unordered_map> 26 class CaselessLess :
public std::binary_function<Key, Key, bool> {
28 bool operator()(
const Key& a,
const Key& b)
const noexcept {
29 return std::lexicographical_compare(std::begin(a), std::end(a), std::begin(b), std::end(b),
30 [](
const char& cha,
const char& chb) {
31 return std::tolower(cha) < std::tolower(chb);
41 class CaselessEq :
public std::binary_function<Key, Key, bool> {
43 bool operator()(
const Key& a,
const Key& b)
const noexcept {
44 return a.size() == b.size() &&
45 std::equal(std::begin(a), std::end(a), std::begin(b), [](
const char& cha,
const char& chb) {
46 return std::tolower(cha) == std::tolower(chb);
55 class CaselessHash :
public std::hash<T> {
57 size_t operator()(T __val)
const noexcept {
59 std::transform(std::begin(__val), std::end(__val), std::back_inserter(lc), [](
typename T::value_type ch) {
60 return std::tolower(ch);
62 return std::hash<T>()(lc);
66 template <
class Key,
class Value>
67 using caseless_unordered_map = std::unordered_map<Key, Value, CaselessHash<Key>, CaselessEq<Key>>;
69 template <
class Key,
class Value>
70 using caseless_unordered_multimap = std::unordered_multimap<Key, Value, CaselessHash<Key>, CaselessEq<Key>>;
72 template <
class Key,
class Value>
73 using caseless_map = std::map<Key, Value, CaselessLess<Key>>;
76 using caseless_set = std::set<Key, CaselessLess<Key>>;
Inference Engine API.
Definition: ie_argmax_layer.hpp:15