8 #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),
28 [](
const char&cha,
const char&chb) {
29 return std::tolower(cha) < std::tolower(chb);
39 class CaselessEq :
public std::binary_function<Key, Key, bool> {
41 bool operator () (
const Key & a,
const Key & b)
const noexcept {
42 return a.size() == b.size() &&
43 std::equal(std::begin(a),
46 [](
const char&cha,
const char&chb) {
47 return std::tolower(cha) == std::tolower(chb);
56 class CaselessHash :
public std::hash<T> {
58 size_t operator()(T __val)
const noexcept {
60 std::transform(std::begin(__val), std::end(__val), std::back_inserter(lc), [](
typename T::value_type ch) {
61 return std::tolower(ch);
63 return std::hash<T>()(lc);
67 template <
class Key,
class Value>
68 using caseless_unordered_map = std::unordered_map<Key, Value, CaselessHash<Key>, CaselessEq<Key>>;
70 template <
class Key,
class Value>
71 using caseless_unordered_multimap = std::unordered_multimap<Key, Value, CaselessHash<Key>, CaselessEq<Key>>;
73 template <
class Key,
class Value>
74 using caseless_map = std::map<Key, Value, CaselessLess<Key>>;
77 using caseless_set = std::set<Key, CaselessLess<Key>>;
Definition: ie_argmax_layer.hpp:11