1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
// template<container-compatible-range<value_type> R>
// multiset(from_range_t, R&& rg, const Compare& comp = Compare(), const Allocator& = Allocator()); // C++23
//
// template<container-compatible-range<value_type> R>
// multiset(from_range_t, R&& rg, const Allocator& a))
// : multiset(from_range, std::forward<R>(rg), Compare(), a) { } // C++23
#include <algorithm>
#include <array>
#include <set>
#include "../../from_range_associative_containers.h"
#include "test_macros.h"
void test_duplicates() {
std::array input = {1, 2, 3, 3, 3, 4, 2, 1, 2};
auto c = std::multiset<int>(std::from_range, input);
assert(std::ranges::is_permutation(input, c));
}
int main(int, char**) {
for_all_iterators_and_allocators<int>([]<class Iter, class Sent, class Alloc>() {
test_associative_set<std::multiset, int, Iter, Sent, test_less<int>, Alloc>();
});
test_associative_set_move_only<std::multiset>();
test_duplicates();
static_assert(test_set_constraints<std::multiset, int, double>());
test_set_exception_safety_throwing_copy<std::multiset>();
test_set_exception_safety_throwing_allocator<std::multiset, int>();
return 0;
}
|
