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_set> |
10 | |
11 | // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, |
12 | // class Alloc = allocator<Value>> |
13 | // class unordered_multiset |
14 | |
15 | // iterator insert(const value_type& x); |
16 | |
17 | #include <unordered_set> |
18 | #include <cassert> |
19 | |
20 | #include "test_macros.h" |
21 | #include "min_allocator.h" |
22 | |
23 | template<class Container> |
24 | void do_insert_const_lvalue_test() |
25 | { |
26 | typedef Container C; |
27 | typedef typename C::iterator R; |
28 | typedef typename C::value_type VT; |
29 | C c; |
30 | const VT v1(3.5); |
31 | R r = c.insert(v1); |
32 | assert(c.size() == 1); |
33 | assert(*r == 3.5); |
34 | |
35 | r = c.insert(v1); |
36 | assert(c.size() == 2); |
37 | assert(*r == 3.5); |
38 | |
39 | const VT v2(4.5); |
40 | r = c.insert(v2); |
41 | assert(c.size() == 3); |
42 | assert(*r == 4.5); |
43 | |
44 | const VT v3(5.5); |
45 | r = c.insert(v3); |
46 | assert(c.size() == 4); |
47 | assert(*r == 5.5); |
48 | } |
49 | |
50 | int main(int, char**) |
51 | { |
52 | do_insert_const_lvalue_test<std::unordered_multiset<double> >(); |
53 | #if TEST_STD_VER >= 11 |
54 | { |
55 | typedef std::unordered_multiset<double, std::hash<double>, |
56 | std::equal_to<double>, min_allocator<double>> C; |
57 | do_insert_const_lvalue_test<C>(); |
58 | } |
59 | #endif |
60 | |
61 | return 0; |
62 | } |
63 | |