30 lines
1,004 B
C++
30 lines
1,004 B
C++
|
//===----------------------------------------------------------------------===//
|
||
|
|
//
|
||
|
|
// The LLVM Compiler Infrastructure
|
||
|
|
//
|
||
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
||
|
|
// Source Licenses. See LICENSE.TXT for details.
|
||
|
|
//
|
||
|
|
//===----------------------------------------------------------------------===//
|
||
|
|
|
||
|
|
// <algorithm>
|
||
|
|
|
||
|
|
// template<class T>
|
||
|
|
// pair<T, T>
|
||
|
|
// minmax(initializer_list<T> t);
|
||
|
|
|
||
|
|
#include <algorithm>
|
||
|
|
#include <cassert>
|
||
|
|
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
|
||
|
|
assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)));
|
||
|
|
assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)));
|
||
|
|
assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)));
|
||
|
|
assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3)));
|
||
|
|
assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3)));
|
||
|
|
assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3)));
|
||
|
|
#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
|
||
|
|
}
|