31cb7fe75e
Summary: The requirement on the `Size` type passed to *_n algorithms is that it is convertible to an integral type. This means we can't use a variable of type `Size` directly. Instead we need to convert it to an integral type first. The problem is finding out what integral type to convert it to. `__convert_to_integral` figures out what integral type to convert it to and performs the conversion, It also promotes the resulting integral type so that it is at least as big as an integer. `__convert_to_integral` also has a special case for converting enums. This should only work on non-scoped enumerations because it does not apply an explicit conversion from the enum to its underlying type. Reviewers: chandlerc, mclow.lists Reviewed By: mclow.lists Subscribers: cfe-commits Differential Revision: http://reviews.llvm.org/D7449 git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@228704 91177308-0d34-0410-b5e6-96231b3b80d8
78 lines
3.4 KiB
C++
78 lines
3.4 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"
|
|
#include "user_defined_integral.hpp"
|
|
|
|
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.
|
|
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*> >();
|
|
}
|