merge_comp.pass.cpp (1655B)
1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 // <list> 11 12 // template <class Compare> void merge(list& x, Compare comp); 13 // If (&addressof(x) == this) does nothing; otherwise ... 14 15 #include <list> 16 #include <functional> 17 #include <cassert> 18 19 #include "min_allocator.h" 20 21 int main() 22 { 23 { 24 int a1[] = {10, 9, 7, 3, 1}; 25 int a2[] = {11, 8, 6, 5, 4, 2, 0}; 26 int a3[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; 27 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 28 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 29 c1.merge(c2, std::greater<int>()); 30 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0]))); 31 assert(c2.empty()); 32 } 33 { 34 int a1[] = {10, 9, 7, 3, 1}; 35 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 36 c1.merge(c1, std::greater<int>()); 37 assert((c1 == std::list<int>(a1, a1+sizeof(a1)/sizeof(a1[0])))); 38 } 39 40 #if TEST_STD_VER >= 11 41 { 42 int a1[] = {10, 9, 7, 3, 1}; 43 int a2[] = {11, 8, 6, 5, 4, 2, 0}; 44 int a3[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; 45 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 46 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 47 c1.merge(c2, std::greater<int>()); 48 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0])))); 49 assert(c2.empty()); 50 } 51 #endif 52 }