//===----------------------------------------------------------------------===// // // 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 // // friend void swap(flat_multiset& x, flat_multiset& y) noexcept #include #include #include #include #include #include "MinSequenceContainer.h" #include "MoveOnly.h" #include "min_allocator.h" #include "test_macros.h" #include "../helpers.h" // test noexcept template concept NoExceptAdlSwap = requires(T t1, T t2) { { swap(t1, t2) } noexcept; }; static_assert(NoExceptAdlSwap>); #ifndef TEST_HAS_NO_EXCEPTIONS static_assert(NoExceptAdlSwap, ThrowOnMoveContainer>>); #endif template constexpr void test_one() { using Key = typename KeyContainer::value_type; using M = std::flat_multiset, KeyContainer>; { M m1; M m2; M m1_save = m1; M m2_save = m2; swap(m1, m2); assert(m1 == m2_save); assert(m2 == m1_save); } { int ar2[] = {5, 5, 7, 8, 8, 10, 11, 12}; M m1; M m2(ar2, ar2 + sizeof(ar2) / sizeof(ar2[0])); M m1_save = m1; M m2_save = m2; swap(m1, m2); assert(m1 == m2_save); assert(m2 == m1_save); } { int ar1[] = {1, 1, 3, 4}; M m1(ar1, ar1 + sizeof(ar1) / sizeof(ar1[0])); M m2; M m1_save = m1; M m2_save = m2; swap(m1, m2); assert(m1 == m2_save); assert(m2 == m1_save); } { int ar1[] = {1, 1, 3, 4}; int ar2[] = {5, 5, 7, 8, 9, 10, 11, 12}; M m1(ar1, ar1 + sizeof(ar1) / sizeof(ar1[0])); M m2(ar2, ar2 + sizeof(ar2) / sizeof(ar2[0])); M m1_save = m1; M m2_save = m2; swap(m1, m2); assert(m1 == m2_save); assert(m2 == m1_save); } } constexpr bool test() { test_one>(); #ifndef __cpp_lib_constexpr_deque if (!TEST_IS_CONSTANT_EVALUATED) #endif test_one>(); test_one>(); test_one>>(); return true; } int main(int, char**) { test(); #if TEST_STD_VER >= 26 static_assert(test()); #endif return 0; }