1bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 2bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 3f5256e16dfc425c1d466f6308d4026d529ce9e0bHoward Hinnant// The LLVM Compiler Infrastructure 4bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 5b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// This file is dual licensed under the MIT and the University of Illinois Open 6b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// Source Licenses. See LICENSE.TXT for details. 7bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 8bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 9bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 10bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// <list> 11bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 12bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// template <class Compare> void merge(list& x, Compare comp); 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 14bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <list> 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <functional> 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 18061d0cc4db18d17bf01ed14c5db0be098205bd47Marshall Clow#include "min_allocator.h" 1929f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant 20bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 2229f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant { 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int a1[] = {10, 9, 7, 3, 1}; 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int a2[] = {11, 8, 6, 5, 4, 2, 0}; 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int a3[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; 26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c1.merge(c2, std::greater<int>()); 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0]))); 3029f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant } 31d24c465beaec2fe9a0e365e6379cd5d3acaeb2caEric Fiselier#if TEST_STD_VER >= 11 3229f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant { 3329f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant int a1[] = {10, 9, 7, 3, 1}; 3429f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant int a2[] = {11, 8, 6, 5, 4, 2, 0}; 3529f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant int a3[] = {11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; 3629f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 3729f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 3829f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant c1.merge(c2, std::greater<int>()); 3929f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0])))); 4029f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant } 4129f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant#endif 42bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 43