afb81b8278
Some checks failed
Docker. / Ubuntu (push) Has been cancelled
User-agent updater. / User-agent (push) Failing after 15s
Lock Threads / lock (push) Failing after 10s
Waiting for answer. / waiting-for-answer (push) Failing after 22s
Close stale issues and PRs / stale (push) Successful in 13s
Needs user action. / needs-user-action (push) Failing after 8s
Can't reproduce. / cant-reproduce (push) Failing after 8s
143 lines
3.7 KiB
C++
143 lines
3.7 KiB
C++
// Range v3 library
|
|
//
|
|
// Copyright Eric Niebler 2014-present
|
|
//
|
|
// Use, modification and distribution is subject to the
|
|
// Boost Software License, Version 1.0. (See accompanying
|
|
// file LICENSE_1_0.txt or copy at
|
|
// http://www.boost.org/LICENSE_1_0.txt)
|
|
//
|
|
// Project home: https://github.com/ericniebler/range-v3
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include <algorithm>
|
|
#include <random>
|
|
#include <range/v3/core.hpp>
|
|
#include <range/v3/algorithm/inplace_merge.hpp>
|
|
#include "../simple_test.hpp"
|
|
#include "../test_utils.hpp"
|
|
#include "../test_iterators.hpp"
|
|
|
|
RANGES_DIAGNOSTIC_IGNORE_GLOBAL_CONSTRUCTORS
|
|
RANGES_DIAGNOSTIC_IGNORE_SIGN_CONVERSION
|
|
|
|
namespace
|
|
{
|
|
std::mt19937 gen;
|
|
|
|
template<class Iter, typename Sent = Iter>
|
|
void
|
|
test_one_iter(unsigned N, unsigned M)
|
|
{
|
|
RANGES_ENSURE(M <= N);
|
|
int* ia = new int[N];
|
|
for (unsigned i = 0; i < N; ++i)
|
|
ia[i] = i;
|
|
std::shuffle(ia, ia+N, gen);
|
|
std::sort(ia, ia+M);
|
|
std::sort(ia+M, ia+N);
|
|
auto res = ranges::inplace_merge(Iter(ia), Iter(ia+M), Sent(ia+N));
|
|
CHECK(res == Iter(ia+N));
|
|
if(N > 0)
|
|
{
|
|
CHECK(ia[0] == 0);
|
|
CHECK(ia[N-1] == (int)N-1);
|
|
CHECK(std::is_sorted(ia, ia+N));
|
|
}
|
|
delete [] ia;
|
|
}
|
|
|
|
template<class Iter, typename Sent = Iter>
|
|
void
|
|
test_one_rng(unsigned N, unsigned M)
|
|
{
|
|
RANGES_ENSURE(M <= N);
|
|
int* ia = new int[N];
|
|
for (unsigned i = 0; i < N; ++i)
|
|
ia[i] = i;
|
|
std::shuffle(ia, ia+N, gen);
|
|
std::sort(ia, ia+M);
|
|
std::sort(ia+M, ia+N);
|
|
auto res = ranges::inplace_merge(ranges::make_subrange(Iter(ia), Sent(ia+N)), Iter(ia+M));
|
|
CHECK(res == Iter(ia+N));
|
|
if(N > 0)
|
|
{
|
|
CHECK(ia[0] == 0);
|
|
CHECK(ia[N-1] == (int)N-1);
|
|
CHECK(std::is_sorted(ia, ia+N));
|
|
}
|
|
|
|
std::shuffle(ia, ia+N, gen);
|
|
std::sort(ia, ia+M);
|
|
std::sort(ia+M, ia+N);
|
|
auto res2 = ranges::inplace_merge(::MakeTestRange(Iter(ia), Sent(ia+N)), Iter(ia+M));
|
|
CHECK(::is_dangling(res2));
|
|
if(N > 0)
|
|
{
|
|
CHECK(ia[0] == 0);
|
|
CHECK(ia[N-1] == (int)N-1);
|
|
CHECK(std::is_sorted(ia, ia+N));
|
|
}
|
|
|
|
delete [] ia;
|
|
}
|
|
|
|
template<class Iter>
|
|
void
|
|
test_one(unsigned N, unsigned M)
|
|
{
|
|
test_one_iter<Iter>(N, M);
|
|
test_one_iter<Iter, typename sentinel_type<Iter>::type>(N, M);
|
|
test_one_rng<Iter>(N, M);
|
|
test_one_rng<Iter, typename sentinel_type<Iter>::type>(N, M);
|
|
}
|
|
|
|
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<ForwardIterator<int*> >();
|
|
test<BidirectionalIterator<int*> >();
|
|
test<RandomAccessIterator<int*> >();
|
|
test<int*>();
|
|
|
|
return ::test_result();
|
|
}
|