minix/external/bsd/libc++/dist/libcxx/test/algorithms/alg.sorting/alg.min.max/minmax_comp.pass.cpp
Lionel Sambuc 4684ddb6aa LLVM Minix changes
- import libcxx
 - reduce targets to the one when compiled as a tools

Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
2014-07-28 17:05:59 +02:00

50 lines
1.2 KiB
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, StrictWeakOrder<auto, T> Compare>
// requires !SameType<T, Compare> && CopyConstructible<Compare>
// pair<const T&, const T&>
// minmax(const T& a, const T& b, Compare comp);
#include <algorithm>
#include <functional>
#include <cassert>
template <class T, class C>
void
test(const T& a, const T& b, C c, const T& x, const T& y)
{
std::pair<const T&, const T&> p = std::minmax(a, b, c);
assert(&p.first == &x);
assert(&p.second == &y);
}
int main()
{
{
int x = 0;
int y = 0;
test(x, y, std::greater<int>(), x, y);
test(y, x, std::greater<int>(), y, x);
}
{
int x = 0;
int y = 1;
test(x, y, std::greater<int>(), y, x);
test(y, x, std::greater<int>(), y, x);
}
{
int x = 1;
int y = 0;
test(x, y, std::greater<int>(), x, y);
test(y, x, std::greater<int>(), x, y);
}
}