init
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
Needs user action. / needs-user-action (push) Failing after 8s
Can't reproduce. / cant-reproduce (push) Failing after 8s
Close stale issues and PRs / stale (push) Has been cancelled
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
Needs user action. / needs-user-action (push) Failing after 8s
Can't reproduce. / cant-reproduce (push) Failing after 8s
Close stale issues and PRs / stale (push) Has been cancelled
This commit is contained in:
allhaileris
295
Telegram/ThirdParty/range-v3/test/algorithm/equal.cpp
vendored
Normal file
295
Telegram/ThirdParty/range-v3/test/algorithm/equal.cpp
vendored
Normal file
@@ -0,0 +1,295 @@
|
||||
// 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 <range/v3/core.hpp>
|
||||
#include <range/v3/algorithm/equal.hpp>
|
||||
#include <range/v3/view/unbounded.hpp>
|
||||
#include "../simple_test.hpp"
|
||||
#include "../test_iterators.hpp"
|
||||
|
||||
RANGES_DIAGNOSTIC_IGNORE_DEPRECATED_DECLARATIONS
|
||||
|
||||
void test()
|
||||
{
|
||||
using namespace ranges;
|
||||
int ia[] = {0, 1, 2, 3, 4, 5};
|
||||
constexpr auto s = size(ia);
|
||||
int ib[s] = {0, 1, 2, 5, 4, 5};
|
||||
CHECK(equal(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
InputIterator<const int*>(ia)));
|
||||
CHECK(equal(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)));
|
||||
CHECK(equal(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s),
|
||||
RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia + s)));
|
||||
CHECK(equal(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia + s)));
|
||||
CHECK(!equal(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
InputIterator<const int*>(ib)));
|
||||
CHECK(!equal(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
InputIterator<const int*>(ib),
|
||||
Sentinel<const int*>(ib + s)));
|
||||
CHECK(!equal(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s),
|
||||
RandomAccessIterator<const int*>(ib),
|
||||
RandomAccessIterator<const int*>(ib+s)));
|
||||
CHECK(!equal(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
RandomAccessIterator<const int*>(ib),
|
||||
Sentinel<const int*>(ib + s)));
|
||||
CHECK(!equal(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia + s - 1)));
|
||||
CHECK(!equal(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s),
|
||||
RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s-1)));
|
||||
CHECK(!equal(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia + s - 1)));
|
||||
}
|
||||
|
||||
void test_rng()
|
||||
{
|
||||
using namespace ranges;
|
||||
int ia[] = {0, 1, 2, 3, 4, 5};
|
||||
constexpr auto s = size(ia);
|
||||
int ib[s] = {0, 1, 2, 5, 4, 5};
|
||||
CHECK(equal(make_subrange(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
InputIterator<const int*>(ia)));
|
||||
CHECK(equal(make_subrange(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
make_subrange(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s))));
|
||||
CHECK(equal(make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s)),
|
||||
make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia + s))));
|
||||
CHECK(equal(make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia + s))));
|
||||
CHECK(!equal(make_subrange(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
InputIterator<const int*>(ib)));
|
||||
CHECK(!equal(make_subrange(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
make_subrange(InputIterator<const int*>(ib),
|
||||
Sentinel<const int*>(ib + s))));
|
||||
CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s)),
|
||||
make_subrange(RandomAccessIterator<const int*>(ib),
|
||||
RandomAccessIterator<const int*>(ib+s))));
|
||||
CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
make_subrange(RandomAccessIterator<const int*>(ib),
|
||||
Sentinel<const int*>(ib + s))));
|
||||
CHECK(!equal(make_subrange(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
make_subrange(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia + s - 1))));
|
||||
CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s)),
|
||||
make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s-1))));
|
||||
CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia + s - 1))));
|
||||
}
|
||||
|
||||
int comparison_count = 0;
|
||||
|
||||
template<typename T>
|
||||
bool counting_equals(const T &a, const T &b)
|
||||
{
|
||||
++comparison_count;
|
||||
return a == b;
|
||||
}
|
||||
|
||||
void test_pred()
|
||||
{
|
||||
using namespace ranges;
|
||||
int ia[] = {0, 1, 2, 3, 4, 5};
|
||||
constexpr auto s = size(ia);
|
||||
int ib[s] = {0, 1, 2, 5, 4, 5};
|
||||
CHECK(equal(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
InputIterator<const int*>(ia),
|
||||
std::equal_to<int>()));
|
||||
CHECK(equal(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia + s),
|
||||
std::equal_to<int>()));
|
||||
CHECK(equal(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s),
|
||||
RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s),
|
||||
std::equal_to<int>()));
|
||||
CHECK(equal(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia + s),
|
||||
std::equal_to<int>()));
|
||||
|
||||
comparison_count = 0;
|
||||
CHECK(!equal(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia + s - 1),
|
||||
counting_equals<int>));
|
||||
CHECK(comparison_count > 0);
|
||||
comparison_count = 0;
|
||||
CHECK(!equal(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s),
|
||||
RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s-1),
|
||||
counting_equals<int>));
|
||||
CHECK(comparison_count == 0);
|
||||
comparison_count = 0;
|
||||
CHECK(!equal(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia + s - 1),
|
||||
counting_equals<int>));
|
||||
CHECK(comparison_count > 0);
|
||||
CHECK(!equal(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
InputIterator<const int*>(ib),
|
||||
std::equal_to<int>()));
|
||||
CHECK(!equal(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
InputIterator<const int*>(ib),
|
||||
Sentinel<const int*>(ib + s),
|
||||
std::equal_to<int>()));
|
||||
CHECK(!equal(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s),
|
||||
RandomAccessIterator<const int*>(ib),
|
||||
RandomAccessIterator<const int*>(ib+s),
|
||||
std::equal_to<int>()));
|
||||
CHECK(!equal(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s),
|
||||
RandomAccessIterator<const int*>(ib),
|
||||
Sentinel<const int*>(ib + s),
|
||||
std::equal_to<int>()));
|
||||
}
|
||||
|
||||
void test_rng_pred()
|
||||
{
|
||||
using namespace ranges;
|
||||
int ia[] = {0, 1, 2, 3, 4, 5};
|
||||
constexpr auto s = size(ia);
|
||||
int ib[s] = {0, 1, 2, 5, 4, 5};
|
||||
CHECK(equal(make_subrange(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
InputIterator<const int*>(ia),
|
||||
std::equal_to<int>()));
|
||||
CHECK(equal(make_subrange(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
make_subrange(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia + s)),
|
||||
std::equal_to<int>()));
|
||||
CHECK(equal(make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s)),
|
||||
make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s)),
|
||||
std::equal_to<int>()));
|
||||
CHECK(equal(make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia + s)),
|
||||
std::equal_to<int>()));
|
||||
|
||||
comparison_count = 0;
|
||||
CHECK(!equal(make_subrange(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
make_subrange(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia + s - 1)),
|
||||
counting_equals<int>));
|
||||
CHECK(comparison_count > 0);
|
||||
comparison_count = 0;
|
||||
CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s)),
|
||||
make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s-1)),
|
||||
counting_equals<int>));
|
||||
CHECK(comparison_count == 0);
|
||||
comparison_count = 0;
|
||||
CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia + s - 1)),
|
||||
counting_equals<int>));
|
||||
CHECK(comparison_count > 0);
|
||||
CHECK(!equal(make_subrange(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
InputIterator<const int*>(ib),
|
||||
std::equal_to<int>()));
|
||||
CHECK(!equal(make_subrange(InputIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
make_subrange(InputIterator<const int*>(ib),
|
||||
Sentinel<const int*>(ib + s)),
|
||||
std::equal_to<int>()));
|
||||
CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
RandomAccessIterator<const int*>(ia+s)),
|
||||
make_subrange(RandomAccessIterator<const int*>(ib),
|
||||
RandomAccessIterator<const int*>(ib+s)),
|
||||
std::equal_to<int>()));
|
||||
CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
|
||||
Sentinel<const int*>(ia+s)),
|
||||
make_subrange(RandomAccessIterator<const int*>(ib),
|
||||
Sentinel<const int*>(ib + s)),
|
||||
std::equal_to<int>()));
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
::test();
|
||||
::test_rng();
|
||||
::test_pred();
|
||||
::test_rng_pred();
|
||||
|
||||
using IL = std::initializer_list<int>;
|
||||
int *p = nullptr;
|
||||
static_assert(std::is_same<bool, decltype(ranges::equal(IL{1, 2, 3, 4}, p))>::value, "");
|
||||
static_assert(std::is_same<bool, decltype(ranges::equal(IL{1, 2, 3, 4}, IL{1, 2, 3, 4}))>::value, "");
|
||||
static_assert(std::is_same<bool, decltype(ranges::equal(IL{1, 2, 3, 4}, ranges::views::unbounded(p)))>::value, "");
|
||||
|
||||
#if RANGES_CXX_CONSTEXPR >= RANGES_CXX_CONSTEXPR_14 && RANGES_CONSTEXPR_INVOKE
|
||||
static_assert(ranges::equal(IL{1, 2, 3, 4}, IL{1, 2, 3, 4}), "");
|
||||
static_assert(!ranges::equal(IL{1, 2, 3, 4}, IL{1, 2, 3}), "");
|
||||
static_assert(!ranges::equal(IL{1, 2, 3, 4}, IL{1, 2, 4, 3}), "");
|
||||
static_assert(ranges::equal(IL{}, IL{}), "");
|
||||
#endif
|
||||
|
||||
return ::test_result();
|
||||
}
|
||||
Reference in New Issue
Block a user