151 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 9// UNSUPPORTED: c++03, c++11, c++14, c++17, c++2010 11// <flat_map>12 13// class flat_multimap14 15// iterator erase(iterator position);16// iterator erase(const_iterator position);17 18#include <compare>19#include <concepts>20#include <deque>21#include <flat_map>22#include <functional>23#include <utility>24#include <vector>25 26#include "MinSequenceContainer.h"27#include "../helpers.h"28#include "test_macros.h"29#include "min_allocator.h"30 31template <class KeyContainer, class ValueContainer>32constexpr void test() {33 using Key = typename KeyContainer::value_type;34 using Value = typename ValueContainer::value_type;35 using M = std::flat_multimap<Key, Value, std::less<Key>, KeyContainer, ValueContainer>;36 using P = std::pair<Key, Value>;37 using I = M::iterator;38 39 P ar[] = {40 P(1, 1.5),41 P(2, 2.5),42 P(2, 2.6),43 P(3, 3.5),44 P(4, 4.5),45 P(4, 4.5),46 P(4, 4.7),47 P(5, 5.5),48 P(6, 6.5),49 P(7, 7.5),50 P(8, 8.5),51 };52 M m(ar, ar + sizeof(ar) / sizeof(ar[0]));53 assert(m.size() == 11);54 std::same_as<I> decltype(auto) i1 = m.erase(std::next(m.cbegin(), 2));55 assert(m.size() == 10);56 assert(i1 == std::next(m.begin(), 2));57 assert(std::ranges::equal(m.keys(), std::vector<Key>{1, 2, 3, 4, 4, 4, 5, 6, 7, 8}));58 check_possible_values(m.values(),59 std::vector<std::vector<Value>>{60 {1.5}, {2.5, 2.6}, {3.5}, {4.5, 4.7}, {4.5, 4.7}, {4.5, 4.7}, {5.5}, {6.5}, {7.5}, {8.5}});61 62 std::same_as<I> decltype(auto) i2 = m.erase(std::next(m.begin(), 0));63 assert(m.size() == 9);64 assert(i2 == m.begin());65 assert(std::ranges::equal(m.keys(), std::vector<Key>{2, 3, 4, 4, 4, 5, 6, 7, 8}));66 check_possible_values(m.values(),67 std::vector<std::vector<Value>>{68 {2.5, 2.6}, {3.5}, {4.5, 4.7}, {4.5, 4.7}, {4.5, 4.7}, {5.5}, {6.5}, {7.5}, {8.5}});69 70 std::same_as<I> decltype(auto) i3 = m.erase(std::next(m.cbegin(), 8));71 assert(m.size() == 8);72 assert(i3 == m.end());73 assert(std::ranges::equal(m.keys(), std::vector<Key>{2, 3, 4, 4, 4, 5, 6, 7}));74 check_possible_values(75 m.values(),76 std::vector<std::vector<Value>>{{2.5, 2.6}, {3.5}, {4.5, 4.7}, {4.5, 4.7}, {4.5, 4.7}, {5.5}, {6.5}, {7.5}});77 78 std::same_as<I> decltype(auto) i4 = m.erase(std::next(m.begin(), 1));79 assert(m.size() == 7);80 assert(i4 == std::next(m.begin()));81 assert(std::ranges::equal(m.keys(), std::vector<Key>{2, 4, 4, 4, 5, 6, 7}));82 check_possible_values(83 m.values(), std::vector<std::vector<Value>>{{2.5, 2.6}, {4.5, 4.7}, {4.5, 4.7}, {4.5, 4.7}, {5.5}, {6.5}, {7.5}});84 85 std::same_as<I> decltype(auto) i5 = m.erase(std::next(m.cbegin(), 2));86 assert(m.size() == 6);87 assert(i5 == std::next(m.begin(), 2));88 assert(std::ranges::equal(m.keys(), std::vector<Key>{2, 4, 4, 5, 6, 7}));89 check_possible_values(90 m.values(), std::vector<std::vector<Value>>{{2.5, 2.6}, {4.5, 4.7}, {4.5, 4.7}, {5.5}, {6.5}, {7.5}});91 92 std::same_as<I> decltype(auto) i6 = m.erase(std::next(m.begin(), 2));93 assert(m.size() == 5);94 assert(i6 == std::next(m.begin(), 2));95 assert(std::ranges::equal(m.keys(), std::vector<Key>{2, 4, 5, 6, 7}));96 check_possible_values(m.values(), std::vector<std::vector<Value>>{{2.5, 2.6}, {4.5, 4.7}, {5.5}, {6.5}, {7.5}});97 98 std::same_as<I> decltype(auto) i7 = m.erase(std::next(m.cbegin(), 0));99 assert(m.size() == 4);100 assert(i7 == std::next(m.begin(), 0));101 assert(std::ranges::equal(m.keys(), std::vector<Key>{4, 5, 6, 7}));102 check_possible_values(m.values(), std::vector<std::vector<Value>>{{4.5, 4.7}, {5.5}, {6.5}, {7.5}});103 104 std::same_as<I> decltype(auto) i8 = m.erase(std::next(m.cbegin(), 2));105 assert(m.size() == 3);106 assert(i8 == std::next(m.begin(), 2));107 assert(std::ranges::equal(m.keys(), std::vector<Key>{4, 5, 7}));108 check_possible_values(m.values(), std::vector<std::vector<Value>>{{4.5, 4.7}, {5.5}, {7.5}});109 110 std::same_as<I> decltype(auto) i9 = m.erase(std::next(m.cbegin(), 2));111 assert(m.size() == 2);112 assert(i9 == std::next(m.begin(), 2));113 assert(std::ranges::equal(m.keys(), std::vector<Key>{4, 5}));114 check_possible_values(m.values(), std::vector<std::vector<Value>>{{4.5, 4.7}, {5.5}});115 116 std::same_as<I> decltype(auto) i10 = m.erase(m.cbegin());117 assert(m.size() == 1);118 assert(i10 == m.cbegin());119 assert(std::ranges::equal(m, std::vector<P>{{5, 5.5}}));120 121 std::same_as<I> decltype(auto) i11 = m.erase(m.begin());122 assert(m.size() == 0);123 assert(i11 == m.begin());124 assert(i11 == m.end());125}126 127constexpr bool test() {128 test<std::vector<int>, std::vector<double>>();129#ifndef __cpp_lib_constexpr_deque130 if (!TEST_IS_CONSTANT_EVALUATED)131#endif132 test<std::deque<int>, std::vector<double>>();133 test<MinSequenceContainer<int>, MinSequenceContainer<double>>();134 test<std::vector<int, min_allocator<int>>, std::vector<double, min_allocator<double>>>();135 136 if (!TEST_IS_CONSTANT_EVALUATED) {137 auto erase_function = [](auto& m, auto) { m.erase(m.begin() + 2); };138 test_erase_exception_guarantee(erase_function);139 }140 return true;141}142 143int main(int, char**) {144 test();145#if TEST_STD_VER >= 26146 static_assert(test());147#endif148 149 return 0;150}151