mirror of
https://github.com/llvm-mirror/libcxx.git
synced 2025-10-23 01:18:52 +08:00
7c3769df62
to reflect the new license. These used slightly different spellings that defeated my regular expressions. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@351648 91177308-0d34-0410-b5e6-96231b3b80d8
92 lines
3.9 KiB
C++
92 lines
3.9 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <algorithm>
|
|
|
|
// template<class ForwardIterator, class Size, class T>
|
|
// constexpr ForwardIterator // constexpr after C++17
|
|
// search_n(ForwardIterator first, ForwardIterator last, Size count,
|
|
// const T& value);
|
|
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
#include "test_iterators.h"
|
|
#include "user_defined_integral.hpp"
|
|
|
|
#if TEST_STD_VER > 17
|
|
TEST_CONSTEXPR bool test_constexpr() {
|
|
int ia[] = {0, 0, 1, 1, 2, 2};
|
|
return (std::search_n(std::begin(ia), std::end(ia), 1, 0) == ia)
|
|
&& (std::search_n(std::begin(ia), std::end(ia), 2, 1) == ia+2)
|
|
&& (std::search_n(std::begin(ia), std::end(ia), 1, 3) == std::end(ia))
|
|
;
|
|
}
|
|
#endif
|
|
|
|
template <class Iter>
|
|
void
|
|
test()
|
|
{
|
|
int ia[] = {0, 1, 2, 3, 4, 5};
|
|
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
|
assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia));
|
|
assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0));
|
|
assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa));
|
|
assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0) == Iter(ia+sa));
|
|
assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3) == Iter(ia));
|
|
assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3) == Iter(ia+3));
|
|
assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3) == Iter(ia+sa));
|
|
assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3) == Iter(ia+sa));
|
|
assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5) == Iter(ia));
|
|
assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 5) == Iter(ia+5));
|
|
assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 5) == Iter(ia+sa));
|
|
assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 5) == Iter(ia+sa));
|
|
|
|
int ib[] = {0, 0, 1, 1, 2, 2};
|
|
const unsigned sb = sizeof(ib)/sizeof(ib[0]);
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib));
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0));
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0) == Iter(ib+0));
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0) == Iter(ib+sb));
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 0) == Iter(ib+sb));
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1) == Iter(ib));
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1) == Iter(ib+2));
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1) == Iter(ib+2));
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 1) == Iter(ib+sb));
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 1) == Iter(ib+sb));
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 2) == Iter(ib));
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 2) == Iter(ib+4));
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 2) == Iter(ib+4));
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 2) == Iter(ib+sb));
|
|
assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 2) == Iter(ib+sb));
|
|
|
|
int ic[] = {0, 0, 0};
|
|
const unsigned sc = sizeof(ic)/sizeof(ic[0]);
|
|
assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0) == Iter(ic));
|
|
assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0) == Iter(ic));
|
|
assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0) == Iter(ic));
|
|
assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0) == Iter(ic));
|
|
assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0) == Iter(ic+sc));
|
|
|
|
// Check that we properly convert the size argument to an integral.
|
|
(void)std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral<unsigned>(0), 0);
|
|
}
|
|
|
|
int main()
|
|
{
|
|
test<forward_iterator<const int*> >();
|
|
test<bidirectional_iterator<const int*> >();
|
|
test<random_access_iterator<const int*> >();
|
|
|
|
#if TEST_STD_VER > 17
|
|
static_assert(test_constexpr());
|
|
#endif
|
|
}
|