//===----------------------------------------------------------------------===// // // 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 // // mapped_type& operator[](const key_type& k); #include #include #include #include #include #include #include "MinSequenceContainer.h" #include "../helpers.h" #include "min_allocator.h" #include "test_macros.h" // Constraints: is_constructible_v is true. template concept CanIndex = requires(M m, Input k) { m[k]; }; static_assert(CanIndex, const int&>); static_assert(!CanIndex, const int&>); template constexpr void test() { using P = std::pair; P ar[] = { P(1, 1.5), P(2, 2.5), P(3, 3.5), P(4, 4.5), P(5, 5.5), P(7, 7.5), P(8, 8.5), }; const int one = 1; std::flat_map, KeyContainer, ValueContainer> m(ar, ar + sizeof(ar) / sizeof(ar[0])); ASSERT_SAME_TYPE(decltype(m[one]), double&); assert(m.size() == 7); assert(m[one] == 1.5); assert(m.size() == 7); m[1] = -1.5; assert(m[1] == -1.5); assert(m.size() == 7); assert(m[6] == 0); assert(m.size() == 8); m[6] = 6.5; assert(m[6] == 6.5); assert(m.size() == 8); } constexpr bool test() { test, std::vector>(); #ifndef __cpp_lib_constexpr_deque if (!TEST_IS_CONSTANT_EVALUATED) #endif { test, std::vector>(); } test, MinSequenceContainer>(); test>, std::vector>>(); if (!TEST_IS_CONSTANT_EVALUATED) { auto index_func = [](auto& m, auto key_arg, auto value_arg) { using FlatMap = std::decay_t; const typename FlatMap::key_type key = key_arg; const typename FlatMap::mapped_type value = value_arg; m[key] = value; }; test_emplace_exception_guarantee(index_func); } return true; } int main(int, char**) { test(); #if TEST_STD_VER >= 26 static_assert(test()); #endif return 0; }