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// <forward_list> 11bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 12bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// template <class Compare> void merge(forward_list&& x, Compare comp); 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 14bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <forward_list> 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <iterator> 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <functional> 17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 18bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 19061d0cc4db18d17bf01ed14c5db0be098205bd47Marshall Clow#include "min_allocator.h" 2081381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant 21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 22bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef int T; 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef std::forward_list<T> C; 26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const T t1[] = {13, 12, 7, 6, 5, 3}; 27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const T t2[] = {15, 14, 11, 10, 9, 8, 4, 2, 1, 0}; 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const T t3[] = {15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant C c1(std::begin(t1), std::end(t1)); 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant C c2(std::begin(t2), std::end(t2)); 31bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant c1.merge(c2, std::greater<T>()); 32bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant C c3(std::begin(t3), std::end(t3)); 33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(c1 == c3); 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 3581381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant#if __cplusplus >= 201103L 3681381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant { 3781381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant typedef int T; 3881381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant typedef std::forward_list<T, min_allocator<T>> C; 3981381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant const T t1[] = {13, 12, 7, 6, 5, 3}; 4081381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant const T t2[] = {15, 14, 11, 10, 9, 8, 4, 2, 1, 0}; 4181381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant const T t3[] = {15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; 4281381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant C c1(std::begin(t1), std::end(t1)); 4381381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant C c2(std::begin(t2), std::end(t2)); 4481381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant c1.merge(c2, std::greater<T>()); 4581381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant C c3(std::begin(t3), std::end(t3)); 4681381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant assert(c1 == c3); 4781381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant } 4881381a932fbebb384adfe5c0116d45b37479efdeHoward Hinnant#endif 49bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 50