//===----------------------------------------------------------------------===// // // 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 // // class multiset // multiset& operator=(multiset&& s); #include #include #include "test_macros.h" #include "MoveOnly.h" #include "../../../test_compare.h" #include "test_allocator.h" #include "min_allocator.h" int main(int, char**) { { typedef MoveOnly V; typedef test_compare > C; typedef test_allocator A; typedef std::multiset M; typedef std::move_iterator I; V a1[] = { V(1), V(1), V(1), V(2), V(2), V(2), V(3), V(3), V(3) }; M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); V a2[] = { V(1), V(1), V(1), V(2), V(2), V(2), V(3), V(3), V(3) }; M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); M m3(C(3), A(7)); m3 = std::move(m1); assert(m3 == m2); assert(m3.get_allocator() == A(7)); assert(m3.key_comp() == C(5)); assert(m1.empty()); } { typedef MoveOnly V; typedef test_compare > C; typedef test_allocator A; typedef std::multiset M; typedef std::move_iterator I; V a1[] = { V(1), V(1), V(1), V(2), V(2), V(2), V(3), V(3), V(3) }; M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); V a2[] = { V(1), V(1), V(1), V(2), V(2), V(2), V(3), V(3), V(3) }; M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); M m3(C(3), A(5)); m3 = std::move(m1); assert(m3 == m2); assert(m3.get_allocator() == A(5)); assert(m3.key_comp() == C(5)); LIBCPP_ASSERT(m1.empty()); } { typedef MoveOnly V; typedef test_compare > C; typedef other_allocator A; typedef std::multiset M; typedef std::move_iterator I; V a1[] = { V(1), V(1), V(1), V(2), V(2), V(2), V(3), V(3), V(3) }; M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7)); V a2[] = { V(1), V(1), V(1), V(2), V(2), V(2), V(3), V(3), V(3) }; M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); M m3(C(3), A(5)); m3 = std::move(m1); assert(m3 == m2); assert(m3.get_allocator() == A(7)); assert(m3.key_comp() == C(5)); assert(m1.empty()); } { typedef MoveOnly V; typedef test_compare > C; typedef min_allocator A; typedef std::multiset M; typedef std::move_iterator I; V a1[] = { V(1), V(1), V(1), V(2), V(2), V(2), V(3), V(3), V(3) }; M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A()); V a2[] = { V(1), V(1), V(1), V(2), V(2), V(2), V(3), V(3), V(3) }; M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A()); M m3(C(3), A()); m3 = std::move(m1); assert(m3 == m2); assert(m3.get_allocator() == A()); assert(m3.key_comp() == C(5)); assert(m1.empty()); } return 0; }