68 lines
1.5 KiB
C++
68 lines
1.5 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, StrictWeakOrder<auto, Iter::value_type> Compare>
|
||
|
// requires CopyConstructible<Compare>
|
||
|
// Iter
|
||
|
// min_element(Iter first, Iter last, Compare comp);
|
||
|
|
||
|
#include <algorithm>
|
||
|
#include <functional>
|
||
|
#include <cassert>
|
||
|
|
||
|
#include "test_iterators.h"
|
||
|
|
||
|
template <class Iter>
|
||
|
void
|
||
|
test(Iter first, Iter last)
|
||
|
{
|
||
|
Iter i = std::min_element(first, last, std::greater<int>());
|
||
|
if (first != last)
|
||
|
{
|
||
|
for (Iter j = first; j != last; ++j)
|
||
|
assert(!std::greater<int>()(*j, *i));
|
||
|
}
|
||
|
else
|
||
|
assert(i == last);
|
||
|
}
|
||
|
|
||
|
template <class Iter>
|
||
|
void
|
||
|
test(unsigned N)
|
||
|
{
|
||
|
int* a = new int[N];
|
||
|
for (int i = 0; i < N; ++i)
|
||
|
a[i] = i;
|
||
|
std::random_shuffle(a, a+N);
|
||
|
test(Iter(a), Iter(a+N));
|
||
|
delete [] a;
|
||
|
}
|
||
|
|
||
|
template <class Iter>
|
||
|
void
|
||
|
test()
|
||
|
{
|
||
|
test<Iter>(0);
|
||
|
test<Iter>(1);
|
||
|
test<Iter>(2);
|
||
|
test<Iter>(3);
|
||
|
test<Iter>(10);
|
||
|
test<Iter>(1000);
|
||
|
}
|
||
|
|
||
|
int main()
|
||
|
{
|
||
|
test<forward_iterator<const int*> >();
|
||
|
test<bidirectional_iterator<const int*> >();
|
||
|
test<random_access_iterator<const int*> >();
|
||
|
test<const int*>();
|
||
|
}
|