minmax_init_list.pass.cpp revision 98e5d974006989c505d7b2ec7b9e4b20b0f01e26
1//===----------------------------------------------------------------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9 10// <algorithm> 11 12// template<class T> 13// pair<T, T> 14// minmax(initializer_list<T> t); 15 16#include <algorithm> 17#include <cassert> 18 19int main() 20{ 21#ifdef _LIBCPP_MOVE 22 assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3))); 23 assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3))); 24 assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3))); 25 assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3))); 26 assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3))); 27 assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3))); 28#endif 29} 30