1 | //===----------------------------------------------------------------------===// |
2 | // |
3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
4 | // See https://llvm.org/LICENSE.txt for license information. |
5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
6 | // |
7 | //===----------------------------------------------------------------------===// |
8 | |
9 | // <unordered_map> |
10 | |
11 | // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, |
12 | // class Alloc = allocator<pair<const Key, T>>> |
13 | // class unordered_map |
14 | |
15 | // hasher key_eq() const; |
16 | |
17 | #include <unordered_map> |
18 | #include <string> |
19 | #include <cassert> |
20 | |
21 | int main(int, char**) { |
22 | typedef std::unordered_map<int, std::string> map_type; |
23 | |
24 | map_type m; |
25 | std::pair<map_type::iterator, bool> p1 = m.insert(x: map_type::value_type(1, "abc" )); |
26 | std::pair<map_type::iterator, bool> p2 = m.insert(x: map_type::value_type(2, "abc" )); |
27 | |
28 | const map_type& cm = m; |
29 | |
30 | assert(cm.key_eq()(p1.first->first, p1.first->first)); |
31 | assert(cm.key_eq()(p2.first->first, p2.first->first)); |
32 | assert(!cm.key_eq()(p1.first->first, p2.first->first)); |
33 | assert(!cm.key_eq()(p2.first->first, p1.first->first)); |
34 | |
35 | return 0; |
36 | } |
37 | |