Run DCE after a LoopFlatten test to reduce spurious output [nfc]
[llvm-project.git] / libcxx / test / std / containers / unord / unord.map / key_eq.pass.cpp
blobbeb19c84544b18460e8b3592292fe2ee08dc7e9f
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 //===----------------------------------------------------------------------===//
9 // <unordered_map>
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
15 // hasher key_eq() const;
17 #include <unordered_map>
18 #include <string>
19 #include <cassert>
21 int main(int, char**) {
22 typedef std::unordered_map<int, std::string> map_type;
24 map_type m;
25 std::pair<map_type::iterator, bool> p1 = m.insert(map_type::value_type(1, "abc"));
26 std::pair<map_type::iterator, bool> p2 = m.insert(map_type::value_type(2, "abc"));
28 const map_type& cm = m;
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));
35 return 0;