libcxx initial import
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@103490 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
48
test/algorithms/alg.sorting/alg.min.max/minmax.pass.cpp
Normal file
48
test/algorithms/alg.sorting/alg.min.max/minmax.pass.cpp
Normal file
@@ -0,0 +1,48 @@
|
||||
//===----------------------------------------------------------------------===//
|
||||
//
|
||||
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is distributed under the University of Illinois Open Source
|
||||
// License. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// <algorithm>
|
||||
|
||||
// template<LessThanComparable T>
|
||||
// pair<const T&, const T&>
|
||||
// minmax(const T& a, const T& b);
|
||||
|
||||
#include <algorithm>
|
||||
#include <cassert>
|
||||
|
||||
template <class T>
|
||||
void
|
||||
test(const T& a, const T& b, const T& x, const T& y)
|
||||
{
|
||||
std::pair<const T&, const T&> 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);
|
||||
}
|
||||
}
|
Reference in New Issue
Block a user