Run DCE after a LoopFlatten test to reduce spurious output [nfc]
[llvm-project.git] / libcxx / test / std / containers / unord / unord.multiset / key_eq.pass.cpp
blobc2ff7bc7c281eee4dc144517e28b2d44b7e6b7e9
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_set>
11 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
12 // class Alloc = allocator<Value>>
13 // class unordered_multiset
15 // key_equal key_eq() const;
17 #include <unordered_set>
18 #include <cassert>
20 int main(int, char**) {
21 typedef std::unordered_multiset<int> set_type;
22 set_type s;
24 set_type::iterator i1 = s.insert(1);
25 set_type::iterator i2 = s.insert(1);
26 set_type::iterator i3 = s.insert(2);
28 const set_type& cs = s;
30 assert(cs.key_eq()(*i1, *i1));
31 assert(cs.key_eq()(*i2, *i2));
32 assert(cs.key_eq()(*i3, *i3));
34 assert(cs.key_eq()(*i1, *i2));
35 assert(cs.key_eq()(*i2, *i1));
37 assert(!cs.key_eq()(*i1, *i3));
38 assert(!cs.key_eq()(*i3, *i1));
40 assert(!cs.key_eq()(*i2, *i3));
41 assert(!cs.key_eq()(*i3, *i2));
43 return 0;