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 10fd1c9dddccdedb84db59a9c63f399b39240cbeffEric Fiselier// UNSUPPORTED: c++98, c++03 11fd1c9dddccdedb84db59a9c63f399b39240cbeffEric Fiselier 12bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// <algorithm> 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 14eb564e76cc3904d811c981a50ecce0659f444cc9Howard Hinnant// template<class T> 1598e5d974006989c505d7b2ec7b9e4b20b0f01e26Howard Hinnant// pair<T, T> 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// minmax(initializer_list<T> t); 17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 18bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <algorithm> 19bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 20bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 21fd1c9dddccdedb84db59a9c63f399b39240cbeffEric Fiselier#include "test_macros.h" 22fd1c9dddccdedb84db59a9c63f399b39240cbeffEric Fiselier 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 2598e5d974006989c505d7b2ec7b9e4b20b0f01e26Howard Hinnant assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3))); 2698e5d974006989c505d7b2ec7b9e4b20b0f01e26Howard Hinnant assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3))); 2798e5d974006989c505d7b2ec7b9e4b20b0f01e26Howard Hinnant assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3))); 2898e5d974006989c505d7b2ec7b9e4b20b0f01e26Howard Hinnant assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3))); 2998e5d974006989c505d7b2ec7b9e4b20b0f01e26Howard Hinnant assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3))); 3098e5d974006989c505d7b2ec7b9e4b20b0f01e26Howard Hinnant assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3))); 31fd1c9dddccdedb84db59a9c63f399b39240cbeffEric Fiselier#if TEST_STD_VER >= 14 329d9463a3555aa559884809b8a7fc842a3968193eMarshall Clow { 339d9463a3555aa559884809b8a7fc842a3968193eMarshall Clow static_assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)), ""); 349d9463a3555aa559884809b8a7fc842a3968193eMarshall Clow static_assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)), ""); 359d9463a3555aa559884809b8a7fc842a3968193eMarshall Clow static_assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)), ""); 369d9463a3555aa559884809b8a7fc842a3968193eMarshall Clow static_assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3)), ""); 379d9463a3555aa559884809b8a7fc842a3968193eMarshall Clow static_assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3)), ""); 389d9463a3555aa559884809b8a7fc842a3968193eMarshall Clow static_assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3)), ""); 399d9463a3555aa559884809b8a7fc842a3968193eMarshall Clow } 409d9463a3555aa559884809b8a7fc842a3968193eMarshall Clow#endif 41bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 42