diff options
author | Marshall Clow <mclow.lists@gmail.com> | 2018-01-20 20:14:32 +0000 |
---|---|---|
committer | Marshall Clow <mclow.lists@gmail.com> | 2018-01-20 20:14:32 +0000 |
commit | 4bfb9313c1ede05d3d59571faace20cd810e1fb9 (patch) | |
tree | 0d3ab7d6bd8a9f75caf8a2e4efa608a352052f91 /libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/unique_copy.pass.cpp | |
parent | 52fa0e9300892bfe982b948136c91c512170200c (diff) | |
download | bcm5719-llvm-4bfb9313c1ede05d3d59571faace20cd810e1fb9.tar.gz bcm5719-llvm-4bfb9313c1ede05d3d59571faace20cd810e1fb9.zip |
More P0202 constexpr work. This commit adds fill/fill_n/generate/generate_n/unique/unique_copy. I removed a specialization of fill_n that recognized when we were dealing with raw pointers and 1 byte trivially-assignable types and did a memset, because the compiler will do that optimization for us.
llvm-svn: 323050
Diffstat (limited to 'libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/unique_copy.pass.cpp')
-rw-r--r-- | libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/unique_copy.pass.cpp | 21 |
1 files changed, 20 insertions, 1 deletions
diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/unique_copy.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/unique_copy.pass.cpp index 761dad4ecd0..48ddcf921e4 100644 --- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/unique_copy.pass.cpp +++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/unique_copy.pass.cpp @@ -14,14 +14,29 @@ // && EqualityComparable<InIter::value_type> // && HasAssign<InIter::value_type, InIter::reference> // && Constructible<InIter::value_type, InIter::reference> -// OutIter +// constexpr OutIter // constexpr after C++17 // unique_copy(InIter first, InIter last, OutIter result); #include <algorithm> #include <cassert> +#include "test_macros.h" #include "test_iterators.h" +#if TEST_STD_VER > 17 +TEST_CONSTEXPR bool test_constexpr() { + int ia[] = {0, 1, 2, 2, 4}; + int ib[] = {0, 0, 0, 0, 0}; + const int expected[] = {0, 1, 2, 4}; + + auto it = std::unique_copy(std::begin(ia), std::end(ia), std::begin(ib)); + return it == (std::begin(ib) + std::size(expected)) + && *it == 0 // don't overwrite final value in output + && std::equal(std::begin(ib), it, std::begin(expected), std::end(expected)) + ; + } +#endif + template <class InIter, class OutIter> void test() @@ -122,4 +137,8 @@ int main() test<const int*, bidirectional_iterator<int*> >(); test<const int*, random_access_iterator<int*> >(); test<const int*, int*>(); + +#if TEST_STD_VER > 17 + static_assert(test_constexpr()); +#endif } |