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

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