4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
79 lines
1.7 KiB
C++
79 lines
1.7 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<BidirectionalIterator Iter>
|
|
// requires ShuffleIterator<Iter>
|
|
// && LessThanComparable<Iter::value_type>
|
|
// void
|
|
// inplace_merge(Iter first, Iter middle, Iter last);
|
|
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
|
|
#include "test_iterators.h"
|
|
|
|
template <class Iter>
|
|
void
|
|
test_one(unsigned N, unsigned M)
|
|
{
|
|
assert(M <= N);
|
|
int* ia = new int[N];
|
|
for (unsigned i = 0; i < N; ++i)
|
|
ia[i] = i;
|
|
std::random_shuffle(ia, ia+N);
|
|
std::sort(ia, ia+M);
|
|
std::sort(ia+M, ia+N);
|
|
std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N));
|
|
if(N > 0)
|
|
{
|
|
assert(ia[0] == 0);
|
|
assert(ia[N-1] == N-1);
|
|
assert(std::is_sorted(ia, ia+N));
|
|
}
|
|
delete [] ia;
|
|
}
|
|
|
|
template <class Iter>
|
|
void
|
|
test(unsigned N)
|
|
{
|
|
test_one<Iter>(N, 0);
|
|
test_one<Iter>(N, N/4);
|
|
test_one<Iter>(N, N/2);
|
|
test_one<Iter>(N, 3*N/4);
|
|
test_one<Iter>(N, N);
|
|
}
|
|
|
|
template <class Iter>
|
|
void
|
|
test()
|
|
{
|
|
test_one<Iter>(0, 0);
|
|
test_one<Iter>(1, 0);
|
|
test_one<Iter>(1, 1);
|
|
test_one<Iter>(2, 0);
|
|
test_one<Iter>(2, 1);
|
|
test_one<Iter>(2, 2);
|
|
test_one<Iter>(3, 0);
|
|
test_one<Iter>(3, 1);
|
|
test_one<Iter>(3, 2);
|
|
test_one<Iter>(3, 3);
|
|
test<Iter>(4);
|
|
test<Iter>(100);
|
|
test<Iter>(1000);
|
|
}
|
|
|
|
int main()
|
|
{
|
|
test<bidirectional_iterator<int*> >();
|
|
test<random_access_iterator<int*> >();
|
|
test<int*>();
|
|
}
|