forked from OSchip/llvm-project
74 lines
3.2 KiB
C++
74 lines
3.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 ForwardIterator, class Size, class T>
|
|
// ForwardIterator
|
|
// search_n(ForwardIterator first, ForwardIterator last, Size count,
|
|
// const T& value);
|
|
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
|
|
#include "test_iterators.h"
|
|
|
|
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));
|
|
}
|
|
|
|
int main()
|
|
{
|
|
test<forward_iterator<const int*> >();
|
|
test<bidirectional_iterator<const int*> >();
|
|
test<random_access_iterator<const int*> >();
|
|
}
|