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
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// <unordered_map>
// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
// class Alloc = allocator<pair<const Key, T>>>
// class unordered_multimap
// hasher key_eq() const;
#include <unordered_map>
#include <string>
#include <cassert>
#include "test_macros.h"
int main(int, char**) {
typedef std::unordered_multimap<int, std::string> map_type;
map_type m;
map_type::iterator i1 = m.insert(map_type::value_type(1, "abc"));
map_type::iterator i2 = m.insert(map_type::value_type(1, "bcd"));
map_type::iterator i3 = m.insert(map_type::value_type(2, "abc"));
const map_type& cm = m;
assert(cm.key_eq()(i1->first, i1->first));
assert(cm.key_eq()(i2->first, i2->first));
assert(cm.key_eq()(i3->first, i3->first));
assert(cm.key_eq()(i1->first, i2->first));
assert(cm.key_eq()(i2->first, i1->first));
assert(!cm.key_eq()(i1->first, i3->first));
assert(!cm.key_eq()(i3->first, i1->first));
assert(!cm.key_eq()(i2->first, i3->first));
assert(!cm.key_eq()(i3->first, i2->first));
return 0;
}
|
