llvm/libcxx
1
0
Fork 0
mirror of https://github.com/llvm-mirror/libcxx.git synced 2025-10-24 03:32:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

Implement P0025R0: 'An algorithm to clamp a value between a pair of boundary values' for C++17

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@262871 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Marshall Clow
2016-03-07 22:43:49 +00:00
parent 8d48d9b2cc
commit 3e0808efb8
4 changed files with 150 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

61
test/std/algorithms/alg.sorting/alg.clamp/clamp.comp.pass.cpp Normal file
View File

@@ -0,0 +1,61 @@
//===----------------------------------------------------------------------===//
//
// 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>
// XFAIL: c++03, c++11, c++14
// template<class T, class Compare>
// const T&
// clamp(const T& v, const T& lo, const T& hi, Compare comp);
#include <algorithm>
#include <functional>
#include <cassert>
template <class T, class C>
void
test(const T& v, const T& lo, const T& hi, C c, const T& x)
{
assert(&std::clamp(v, lo, hi, c) == &x);
}
int main()
{
{
int x = 0;
int y = 0;
int z = 0;
test(x, y, z, std::greater<int>(), x);
test(y, x, z, std::greater<int>(), y);
}
{
int x = 0;
int y = 1;
int z = -1;
test(x, y, z, std::greater<int>(), x);
test(y, x, z, std::greater<int>(), x);
}
{
int x = 1;
int y = 0;
int z = 0;
test(x, y, z, std::greater<int>(), y);
test(y, x, z, std::greater<int>(), y);
}
#if _LIBCPP_STD_VER > 11
{
typedef int T;
constexpr T x = 1;
constexpr T y = 0;
constexpr T z = 0;
static_assert(std::clamp(x, y, z, std::greater<T>()) == y, "" );
static_assert(std::clamp(y, x, z, std::greater<T>()) == y, "" );
}
#endif
}

60
test/std/algorithms/alg.sorting/alg.clamp/clamp.pass.cpp Normal file
View File

@@ -0,0 +1,60 @@
//===----------------------------------------------------------------------===//
//
// 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>
// XFAIL: c++03, c++11, c++14
// template<class T>
// const T&
// clamp(const T& v, const T& lo, const T& hi);
#include <algorithm>
#include <cassert>
template <class T>
void
test(const T& a, const T& lo, const T& hi, const T& x)
{
assert(&std::clamp(a, lo, hi) == &x);
}
int main()
{
{
int x = 0;
int y = 0;
int z = 0;
test(x, y, z, x);
test(y, x, z, y);
}
{
int x = 0;
int y = 1;
int z = 2;
test(x, y, z, y);
test(y, x, z, y);
}
{
int x = 1;
int y = 0;
int z = 1;
test(x, y, z, x);
test(y, x, z, x);
}
#if _LIBCPP_STD_VER > 11
{
typedef int T;
constexpr T x = 1;
constexpr T y = 0;
constexpr T z = 1;
static_assert(std::clamp(x, y, z) == x, "" );
static_assert(std::clamp(y, x, z) == x, "" );
}
#endif
}