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// UNSUPPORTED: c++03
10
11// <unordered_set>
12
13// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
14// class Alloc = allocator<Value>>
15// class unordered_multiset
16
17// void insert(initializer_list<value_type> il);
18
19#include <unordered_set>
20#include <cassert>
21
22#include "test_macros.h"
23#include "test_iterators.h"
24#include "min_allocator.h"
25
26int main(int, char**)
27{
28 {
29 typedef std::unordered_multiset<int> C;
30 typedef int P;
31 C c;
32 c.insert(
33 l: {
34 P(1),
35 P(2),
36 P(3),
37 P(4),
38 P(1),
39 P(2)
40 }
41 );
42 assert(c.size() == 6);
43 assert(c.count(1) == 2);
44 assert(c.count(2) == 2);
45 assert(c.count(3) == 1);
46 assert(c.count(4) == 1);
47 }
48 {
49 typedef std::unordered_multiset<int, std::hash<int>,
50 std::equal_to<int>, min_allocator<int>> C;
51 typedef int P;
52 C c;
53 c.insert(
54 {
55 P(1),
56 P(2),
57 P(3),
58 P(4),
59 P(1),
60 P(2)
61 }
62 );
63 assert(c.size() == 6);
64 assert(c.count(1) == 2);
65 assert(c.count(2) == 2);
66 assert(c.count(3) == 1);
67 assert(c.count(4) == 1);
68 }
69
70 return 0;
71}
72

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