4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
65 lines
1.6 KiB
C++
65 lines
1.6 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<ForwardIterator Iter, class T>
|
|
// requires HasLess<Iter::value_type, T>
|
|
// Iter
|
|
// lower_bound(Iter first, Iter last, const T& value);
|
|
|
|
#include <algorithm>
|
|
#include <functional>
|
|
#include <vector>
|
|
#include <cassert>
|
|
|
|
#include "test_iterators.h"
|
|
|
|
template <class Iter, class T>
|
|
void
|
|
test(Iter first, Iter last, const T& value)
|
|
{
|
|
Iter i = std::lower_bound(first, last, value, std::greater<int>());
|
|
for (Iter j = first; j != i; ++j)
|
|
assert(std::greater<int>()(*j, value));
|
|
for (Iter j = i; j != last; ++j)
|
|
assert(!std::greater<int>()(*j, value));
|
|
}
|
|
|
|
template <class Iter>
|
|
void
|
|
test()
|
|
{
|
|
const unsigned N = 1000;
|
|
const unsigned M = 10;
|
|
std::vector<int> v(N);
|
|
int x = 0;
|
|
for (int i = 0; i < v.size(); ++i)
|
|
{
|
|
v[i] = x;
|
|
if (++x == M)
|
|
x = 0;
|
|
}
|
|
std::sort(v.begin(), v.end(), std::greater<int>());
|
|
for (x = 0; x <= M; ++x)
|
|
test(Iter(v.data()), Iter(v.data()+v.size()), x);
|
|
}
|
|
|
|
int main()
|
|
{
|
|
int d[] = {3, 2, 1, 0};
|
|
for (int* e = d; e <= d+4; ++e)
|
|
for (int x = -1; x <= 4; ++x)
|
|
test(d, e, x);
|
|
|
|
test<forward_iterator<const int*> >();
|
|
test<bidirectional_iterator<const int*> >();
|
|
test<random_access_iterator<const int*> >();
|
|
test<const int*>();
|
|
}
|