| 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 |
// UNSUPPORTED: c++03, c++11, c++14, c++17 |
| 9 |
|
| 10 |
// <set> |
| 11 |
|
| 12 |
// template <class T, class Compare, class Allocator, class Predicate> |
| 13 |
// typename multiset<T, Compare, Allocator>::size_type |
| 14 |
// erase_if(multiset<T, Compare, Allocator>& c, Predicate pred); |
| 15 |
|
| 16 |
#include <set> |
| 17 |
|
| 18 |
#include "test_macros.h" |
| 19 |
#include "test_allocator.h" |
| 20 |
#include "min_allocator.h" |
| 21 |
|
| 22 |
template <class S, class Pred> |
| 23 |
void test0(S s, Pred p, S expected, std::size_t expected_erased_count) { |
| 24 |
ASSERT_SAME_TYPE(typename S::size_type, decltype(std::erase_if(s, p))); |
| 25 |
assert(expected_erased_count == std::erase_if(s, p)); |
| 26 |
assert(s == expected); |
| 27 |
} |
| 28 |
|
| 29 |
template <typename S> |
| 30 |
void test() { |
| 31 |
auto is1 = [](auto v) { return v == 1; }; |
| 32 |
auto is2 = [](auto v) { return v == 2; }; |
| 33 |
auto is3 = [](auto v) { return v == 3; }; |
| 34 |
auto is4 = [](auto v) { return v == 4; }; |
| 35 |
auto True = [](auto) { return true; }; |
| 36 |
auto False = [](auto) { return false; }; |
| 37 |
|
| 38 |
test0(S(), is1, S(), 0); |
| 39 |
|
| 40 |
test0(S({1}), is1, S(), 1); |
| 41 |
test0(S({1}), is2, S({1}), 0); |
| 42 |
|
| 43 |
test0(S({1, 2}), is1, S({2}), 1); |
| 44 |
test0(S({1, 2}), is2, S({1}), 1); |
| 45 |
test0(S({1, 2}), is3, S({1, 2}), 0); |
| 46 |
test0(S({1, 1}), is1, S(), 2); |
| 47 |
test0(S({1, 1}), is3, S({1, 1}), 0); |
| 48 |
|
| 49 |
test0(S({1, 2, 3}), is1, S({2, 3}), 1); |
| 50 |
test0(S({1, 2, 3}), is2, S({1, 3}), 1); |
| 51 |
test0(S({1, 2, 3}), is3, S({1, 2}), 1); |
| 52 |
test0(S({1, 2, 3}), is4, S({1, 2, 3}), 0); |
| 53 |
|
| 54 |
test0(S({1, 1, 1}), is1, S(), 3); |
| 55 |
test0(S({1, 1, 1}), is2, S({1, 1, 1}), 0); |
| 56 |
test0(S({1, 1, 2}), is1, S({2}), 2); |
| 57 |
test0(S({1, 1, 2}), is2, S({1, 1}), 1); |
| 58 |
test0(S({1, 1, 2}), is3, S({1, 1, 2}), 0); |
| 59 |
test0(S({1, 2, 2}), is1, S({2, 2}), 1); |
| 60 |
test0(S({1, 2, 2}), is2, S({1}), 2); |
| 61 |
test0(S({1, 2, 2}), is3, S({1, 2, 2}), 0); |
| 62 |
|
| 63 |
test0(S({1, 2, 3}), True, S(), 3); |
| 64 |
test0(S({1, 2, 3}), False, S({1, 2, 3}), 0); |
| 65 |
} |
| 66 |
|
| 67 |
int main(int, char**) { |
| 68 |
test<std::multiset<int>>(); |
| 69 |
test<std::multiset<int, std::less<int>, min_allocator<int>>>(); |
| 70 |
test<std::multiset<int, std::less<int>, test_allocator<int>>>(); |
| 71 |
|
| 72 |
test<std::multiset<long>>(); |
| 73 |
test<std::multiset<double>>(); |
| 74 |
|
| 75 |
return 0; |
| 76 |
} |