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
23template <class Container>
24void do_insert_const_lvalue_test() {
25 typedef Container C;
26 typedef typename C::iterator R;
27 typedef typename C::value_type VT;
28 C c;
29 const VT v1(3.5);
30 R r = c.insert(v1);
31 assert(c.size() == 1);
32 assert(*r == 3.5);
33
34 r = c.insert(v1);
35 assert(c.size() == 2);
36 assert(*r == 3.5);
37
38 const VT v2(4.5);
39 r = c.insert(v2);
40 assert(c.size() == 3);
41 assert(*r == 4.5);
42
43 const VT v3(5.5);
44 r = c.insert(v3);
45 assert(c.size() == 4);
46 assert(*r == 5.5);
47}
48
49int main(int, char**) {
50 do_insert_const_lvalue_test<std::unordered_multiset<double> >();
51#if TEST_STD_VER >= 11
52 {
53 typedef std::unordered_multiset<double, std::hash<double>, std::equal_to<double>, min_allocator<double>> C;
54 do_insert_const_lvalue_test<C>();
55 }
56#endif
57
58 return 0;
59}
60

source code of libcxx/test/std/containers/unord/unord.multiset/insert_const_lvalue.pass.cpp