From 61b9a7258a7693d7f3674a5a1daf7b036ff1d382 Mon Sep 17 00:00:00 2001 From: Dimitry Andric Date: Sun, 6 Sep 2015 18:46:46 +0000 Subject: Import libc++ 3.7.0 release (r246257). --- .../alg.sorting/alg.min.max/minmax.pass.cpp | 62 ++++++++++++++++++++++ 1 file changed, 62 insertions(+) create mode 100644 test/std/algorithms/alg.sorting/alg.min.max/minmax.pass.cpp (limited to 'test/std/algorithms/alg.sorting/alg.min.max/minmax.pass.cpp') diff --git a/test/std/algorithms/alg.sorting/alg.min.max/minmax.pass.cpp b/test/std/algorithms/alg.sorting/alg.min.max/minmax.pass.cpp new file mode 100644 index 000000000000..6ac972a2547b --- /dev/null +++ b/test/std/algorithms/alg.sorting/alg.min.max/minmax.pass.cpp @@ -0,0 +1,62 @@ +//===----------------------------------------------------------------------===// +// +// 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. +// +//===----------------------------------------------------------------------===// + +// + +// template +// pair +// minmax(const T& a, const T& b); + +#include +#include + +template +void +test(const T& a, const T& b, const T& x, const T& y) +{ + std::pair p = std::minmax(a, b); + assert(&p.first == &x); + assert(&p.second == &y); +} + +int main() +{ + { + int x = 0; + int y = 0; + test(x, y, x, y); + test(y, x, y, x); + } + { + int x = 0; + int y = 1; + test(x, y, x, y); + test(y, x, x, y); + } + { + int x = 1; + int y = 0; + test(x, y, y, x); + test(y, x, y, x); + } +#if _LIBCPP_STD_VER > 11 + { +// Note that you can't take a reference to a local var, since +// its address is not a compile-time constant. + constexpr static int x = 1; + constexpr static int y = 0; + constexpr auto p1 = std::minmax (x, y); + static_assert(p1.first == y, ""); + static_assert(p1.second == x, ""); + constexpr auto p2 = std::minmax (y, x); + static_assert(p2.first == y, ""); + static_assert(p2.second == x, ""); + } +#endif +} -- cgit v1.2.3