95 lines · cpp
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-exception6//7//===----------------------------------------------------------------------===//8// UNSUPPORTED: c++03, c++11, c++14, c++179 10// <unordered_map>11 12// template <class Key, class T, class Hash, class Pred, class Allocator, class Predicate>13// typename unordered_multimap<Key, T, Hash, Pred, Allocator>::size_type14// erase_if(unordered_multimap<Key, T, Hash, Pred, Allocator>& c, Predicate pred);15 16#include <unordered_map>17#include <algorithm>18 19#include "test_macros.h"20#include "test_allocator.h"21#include "min_allocator.h"22 23using Init = std::initializer_list<int>;24template <typename M>25M make(Init vals) {26 M ret;27 for (int v : vals)28 ret.emplace(static_cast<typename M::key_type>(v), static_cast<typename M::mapped_type>(v + 10));29 return ret;30}31 32template <typename M, typename Pred>33void test0(Init vals, Pred p, Init expected, std::size_t expected_erased_count) {34 M s = make<M>(vals);35 ASSERT_SAME_TYPE(typename M::size_type, decltype(std::erase_if(s, p)));36 assert(expected_erased_count == std::erase_if(s, p));37 M e = make<M>(expected);38 assert((std::is_permutation(s.begin(), s.end(), e.begin(), e.end())));39}40 41template <typename S>42void test() {43 auto is1 = [](auto v) { return v.first == 1; };44 auto is2 = [](auto v) { return v.first == 2; };45 auto is3 = [](auto v) { return v.first == 3; };46 auto is4 = [](auto v) { return v.first == 4; };47 auto True = [](auto) { return true; };48 auto False = [](auto) { return false; };49 50 test0<S>({}, is1, {}, 0);51 52 test0<S>({1}, is1, {}, 1);53 test0<S>({1}, is2, {1}, 0);54 55 test0<S>({1, 2}, is1, {2}, 1);56 test0<S>({1, 2}, is2, {1}, 1);57 test0<S>({1, 2}, is3, {1, 2}, 0);58 test0<S>({1, 1}, is1, {}, 2);59 test0<S>({1, 1}, is3, {1, 1}, 0);60 61 test0<S>({1, 2, 3}, is1, {2, 3}, 1);62 test0<S>({1, 2, 3}, is2, {1, 3}, 1);63 test0<S>({1, 2, 3}, is3, {1, 2}, 1);64 test0<S>({1, 2, 3}, is4, {1, 2, 3}, 0);65 66 test0<S>({1, 1, 1}, is1, {}, 3);67 test0<S>({1, 1, 1}, is2, {1, 1, 1}, 0);68 test0<S>({1, 1, 2}, is1, {2}, 2);69 test0<S>({1, 1, 2}, is2, {1, 1}, 1);70 test0<S>({1, 1, 2}, is3, {1, 1, 2}, 0);71 test0<S>({1, 2, 2}, is1, {2, 2}, 1);72 test0<S>({1, 2, 2}, is2, {1}, 2);73 test0<S>({1, 2, 2}, is3, {1, 2, 2}, 0);74 75 test0<S>({1, 2, 3}, True, {}, 3);76 test0<S>({1, 2, 3}, False, {1, 2, 3}, 0);77}78 79int main(int, char**) {80 test<std::unordered_multimap<int, int>>();81 test<82 std::83 unordered_multimap<int, int, std::hash<int>, std::equal_to<int>, min_allocator<std::pair<const int, int>>>>();84 test<std::unordered_multimap<int,85 int,86 std::hash<int>,87 std::equal_to<int>,88 test_allocator<std::pair<const int, int>>>>();89 90 test<std::unordered_multimap<long, short>>();91 test<std::unordered_multimap<short, double>>();92 93 return 0;94}95