//===----------------------------------------------------------------------===// // // The LLVM Compiler Infrastructure // // This file is dual licensed under the MIT and the University of Illinois Open // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // class map // template // void // swap(map& x, map& y); #include #include #include "test_allocator.h" #include "../../../test_compare.h" #include "min_allocator.h" int main() { typedef std::pair V; { typedef std::map M; { M m1; M m2; M m1_save = m1; M m2_save = m2; swap(m1, m2); assert(m1 == m2_save); assert(m2 == m1_save); } { V ar2[] = { V(5, 5), V(6, 6), V(7, 7), V(8, 8), V(9, 9), V(10, 10), V(11, 11), V(12, 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); } { V ar1[] = { V(1, 1), V(2, 2), V(3, 3), V(4, 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); } { V ar1[] = { V(1, 1), V(2, 2), V(3, 3), V(4, 4) }; V ar2[] = { V(5, 5), V(6, 6), V(7, 7), V(8, 8), V(9, 9), V(10, 10), V(11, 11), V(12, 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); } { typedef test_allocator A; typedef test_compare > C; typedef std::map M; V ar1[] = { V(1, 1), V(2, 2), V(3, 3), V(4, 4) }; V ar2[] = { V(5, 5), V(6, 6), V(7, 7), V(8, 8), V(9, 9), V(10, 10), V(11, 11), V(12, 12) }; M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]), C(1), A(1)); M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0]), C(2), A(2)); M m1_save = m1; M m2_save = m2; swap(m1, m2); assert(m1 == m2_save); assert(m2 == m1_save); assert(m1.key_comp() == C(2)); assert(m1.get_allocator() == A(1)); assert(m2.key_comp() == C(1)); assert(m2.get_allocator() == A(2)); } { typedef other_allocator A; typedef test_compare > C; typedef std::map M; V ar1[] = { V(1, 1), V(2, 2), V(3, 3), V(4, 4) }; V ar2[] = { V(5, 5), V(6, 6), V(7, 7), V(8, 8), V(9, 9), V(10, 10), V(11, 11), V(12, 12) }; M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]), C(1), A(1)); M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0]), C(2), A(2)); M m1_save = m1; M m2_save = m2; swap(m1, m2); assert(m1 == m2_save); assert(m2 == m1_save); assert(m1.key_comp() == C(2)); assert(m1.get_allocator() == A(2)); assert(m2.key_comp() == C(1)); assert(m2.get_allocator() == A(1)); } } #if __cplusplus >= 201103L { typedef std::map, min_allocator> M; { M m1; M m2; M m1_save = m1; M m2_save = m2; swap(m1, m2); assert(m1 == m2_save); assert(m2 == m1_save); } { V ar2[] = { V(5, 5), V(6, 6), V(7, 7), V(8, 8), V(9, 9), V(10, 10), V(11, 11), V(12, 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); } { V ar1[] = { V(1, 1), V(2, 2), V(3, 3), V(4, 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); } { V ar1[] = { V(1, 1), V(2, 2), V(3, 3), V(4, 4) }; V ar2[] = { V(5, 5), V(6, 6), V(7, 7), V(8, 8), V(9, 9), V(10, 10), V(11, 11), V(12, 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); } { typedef min_allocator A; typedef test_compare > C; typedef std::map M; V ar1[] = { V(1, 1), V(2, 2), V(3, 3), V(4, 4) }; V ar2[] = { V(5, 5), V(6, 6), V(7, 7), V(8, 8), V(9, 9), V(10, 10), V(11, 11), V(12, 12) }; M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]), C(1), A()); M m2(ar2, ar2+sizeof(ar2)/sizeof(ar2[0]), C(2), A()); M m1_save = m1; M m2_save = m2; swap(m1, m2); assert(m1 == m2_save); assert(m2 == m1_save); assert(m1.key_comp() == C(2)); assert(m1.get_allocator() == A()); assert(m2.key_comp() == C(1)); assert(m2.get_allocator() == A()); } } #endif }