forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
92 lines
2.5 KiB
C++
92 lines
2.5 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
// UNSUPPORTED: c++98, c++03, c++11, c++14, c++17
|
|
|
|
// <set>
|
|
|
|
// template <class T, class Hash, class Compare, class Allocator, class Predicate>
|
|
// void erase_if(unordered_multiset<T, Hash, Compare, Allocator>& c, Predicate pred);
|
|
|
|
#include <unordered_set>
|
|
|
|
#include "test_macros.h"
|
|
#include "test_allocator.h"
|
|
#include "min_allocator.h"
|
|
|
|
using Init = std::initializer_list<int>;
|
|
|
|
template <typename M>
|
|
M make (Init vals)
|
|
{
|
|
M ret;
|
|
for (int v : vals)
|
|
ret.insert(v);
|
|
return ret;
|
|
}
|
|
|
|
template <typename M, typename Pred>
|
|
void
|
|
test0(Init vals, Pred p, Init expected)
|
|
{
|
|
M s = make<M> (vals);
|
|
ASSERT_SAME_TYPE(void, decltype(std::erase_if(s, p)));
|
|
std::erase_if(s, p);
|
|
M e = make<M>(expected);
|
|
assert((std::is_permutation(s.begin(), s.end(), e.begin(), e.end())));
|
|
}
|
|
|
|
template <typename S>
|
|
void test()
|
|
{
|
|
auto is1 = [](auto v) { return v == 1;};
|
|
auto is2 = [](auto v) { return v == 2;};
|
|
auto is3 = [](auto v) { return v == 3;};
|
|
auto is4 = [](auto v) { return v == 4;};
|
|
auto True = [](auto) { return true; };
|
|
auto False = [](auto) { return false; };
|
|
|
|
test0<S>({}, is1, {});
|
|
|
|
test0<S>({1}, is1, {});
|
|
test0<S>({1}, is2, {1});
|
|
|
|
test0<S>({1,2}, is1, {2});
|
|
test0<S>({1,2}, is2, {1});
|
|
test0<S>({1,2}, is3, {1,2});
|
|
test0<S>({1,1}, is1, {});
|
|
test0<S>({1,1}, is3, {1,1});
|
|
|
|
test0<S>({1,2,3}, is1, {2,3});
|
|
test0<S>({1,2,3}, is2, {1,3});
|
|
test0<S>({1,2,3}, is3, {1,2});
|
|
test0<S>({1,2,3}, is4, {1,2,3});
|
|
|
|
test0<S>({1,1,1}, is1, {});
|
|
test0<S>({1,1,1}, is2, {1,1,1});
|
|
test0<S>({1,1,2}, is1, {2});
|
|
test0<S>({1,1,2}, is2, {1,1});
|
|
test0<S>({1,1,2}, is3, {1,1,2});
|
|
test0<S>({1,2,2}, is1, {2,2});
|
|
test0<S>({1,2,2}, is2, {1});
|
|
test0<S>({1,2,2}, is3, {1,2,2});
|
|
|
|
test0<S>({1,2,3}, True, {});
|
|
test0<S>({1,2,3}, False, {1,2,3});
|
|
}
|
|
|
|
int main()
|
|
{
|
|
test<std::unordered_multiset<int>>();
|
|
test<std::unordered_multiset<int, std::hash<int>, std::equal_to<int>, min_allocator<int>>> ();
|
|
test<std::unordered_multiset<int, std::hash<int>, std::equal_to<int>, test_allocator<int>>> ();
|
|
|
|
test<std::unordered_multiset<long>>();
|
|
test<std::unordered_multiset<double>>();
|
|
}
|