tg_windows5.12.6/Telegram/ThirdParty/range-v3/test/algorithm/adjacent_remove_if.cpp

/// \file
// Range v3 library
//
//  Copyright Eric Niebler
//  Copyright Christopher Di Bella
//
//  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
//
//  Copyright 2005 - 2007 Adobe Systems Incorporated
//  Distributed under the MIT License(see accompanying file LICENSE_1_0_0.txt
//  or a copy at http://stlab.adobe.com/licenses.html)

//===----------------------------------------------------------------------===//
//
//                     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/algorithm/adjacent_remove_if.hpp>
#include <range/v3/core.hpp>
#include "../simple_test.hpp"
#include "../test_utils.hpp"
#include "../test_iterators.hpp"

template<class Iter, class Sent = Iter>
void
test_iter()
{
   int ia[] = {0, 1, 1, 1, 4, 2, 2, 4, 2};
   constexpr auto sa = ranges::size(ia);
   Iter r = ranges::adjacent_remove_if(Iter(ia), Sent(ia+sa), ranges::equal_to{});
   CHECK(base(r) == ia + sa-3);
   CHECK(ia[0] == 0);
   CHECK(ia[1] == 1);
   CHECK(ia[2] == 4);
   CHECK(ia[3] == 2);
   CHECK(ia[4] == 4);
   CHECK(ia[5] == 2);
}

template<class Iter, class Sent = Iter>
void
test_range()
{
    int ia[] = {0, 1, 1, 1, 4, 2, 2, 4, 2};
    constexpr auto sa = ranges::size(ia);
    Iter r = ranges::adjacent_remove_if(
        ranges::make_subrange(Iter(ia), Sent(ia+sa)),
        ranges::equal_to{});
    CHECK(base(r) == ia + sa-3);
    CHECK(ia[0] == 0);
    CHECK(ia[1] == 1);
    CHECK(ia[2] == 4);
    CHECK(ia[3] == 2);
    CHECK(ia[4] == 4);
    CHECK(ia[5] == 2);
}

struct pred
{
    bool operator()(const std::unique_ptr<int> &i, const std::unique_ptr<int> &j)
    {
        return *i == 2 && *j == 3;
    }
};

template<class Iter, class Sent = Iter>
void
test_iter_rvalue()
{
    constexpr unsigned sa = 9;
    std::unique_ptr<int> ia[sa];
    ia[0].reset(new int(0));
    ia[1].reset(new int(1));
    ia[2].reset(new int(2));
    ia[3].reset(new int(3));
    ia[4].reset(new int(4));
    ia[5].reset(new int(2));
    ia[6].reset(new int(3));
    ia[7].reset(new int(4));
    ia[8].reset(new int(2));
    Iter r = ranges::adjacent_remove_if(Iter(ia), Sent(ia+sa), pred());
    CHECK(base(r) == ia + sa-2);
    CHECK(*ia[0] == 0);
    CHECK(*ia[1] == 1);
    CHECK(*ia[2] == 3);
    CHECK(*ia[3] == 4);
    CHECK(*ia[4] == 3);
    CHECK(*ia[5] == 4);
    CHECK(*ia[6] == 2);
}

template<class Iter, class Sent = Iter>
void
test_range_rvalue()
{
    constexpr unsigned sa = 9;
    std::unique_ptr<int> ia[sa];
    ia[0].reset(new int(0));
    ia[1].reset(new int(1));
    ia[2].reset(new int(2));
    ia[3].reset(new int(3));
    ia[4].reset(new int(4));
    ia[5].reset(new int(2));
    ia[6].reset(new int(3));
    ia[7].reset(new int(4));
    ia[8].reset(new int(2));
    Iter r = ranges::adjacent_remove_if(ranges::make_subrange(Iter(ia), Sent(ia+sa)), pred());
    CHECK(base(r) == ia + sa-2);
    CHECK(*ia[0] == 0);
    CHECK(*ia[1] == 1);
    CHECK(*ia[2] == 3);
    CHECK(*ia[3] == 4);
    CHECK(*ia[4] == 3);
    CHECK(*ia[5] == 4);
    CHECK(*ia[6] == 2);
}

template<class Iter, class Sent = Iter>
bool constexpr test_constexpr()
{
    int ia[] = {0, 1, 1, 1, 4, 2, 2, 4, 2};
    constexpr auto sa = ranges::size(ia);
    Iter r = ranges::adjacent_remove_if(ranges::make_subrange(Iter(ia), Sent(ia + sa)),
                                        ranges::equal_to{});
    STATIC_CHECK_RETURN(base(r) == ia + sa - 3);
    STATIC_CHECK_RETURN(ia[0] == 0);
    STATIC_CHECK_RETURN(ia[1] == 1);
    STATIC_CHECK_RETURN(ia[2] == 4);
    STATIC_CHECK_RETURN(ia[3] == 2);
    STATIC_CHECK_RETURN(ia[4] == 4);
    STATIC_CHECK_RETURN(ia[5] == 2);

    return true;
}

struct S
{
    int i;
};

int main()
{
    test_iter<ForwardIterator<int*> >();
    test_iter<BidirectionalIterator<int*> >();
    test_iter<RandomAccessIterator<int*> >();
    test_iter<int*>();
    test_iter<ForwardIterator<int*>, Sentinel<int*>>();
    test_iter<BidirectionalIterator<int*>, Sentinel<int*>>();
    test_iter<RandomAccessIterator<int*>, Sentinel<int*>>();
    test_range<ForwardIterator<int*> >();
    test_range<BidirectionalIterator<int*> >();
    test_range<RandomAccessIterator<int*> >();
    test_range<int*>();
    test_range<ForwardIterator<int*>, Sentinel<int*>>();
    test_range<BidirectionalIterator<int*>, Sentinel<int*>>();
    test_range<RandomAccessIterator<int*>, Sentinel<int*>>();

    test_iter_rvalue<ForwardIterator<std::unique_ptr<int>*> >();
    test_iter_rvalue<BidirectionalIterator<std::unique_ptr<int>*> >();
    test_iter_rvalue<RandomAccessIterator<std::unique_ptr<int>*> >();
    test_iter_rvalue<std::unique_ptr<int>*>();
    test_iter_rvalue<ForwardIterator<std::unique_ptr<int>*>, Sentinel<std::unique_ptr<int>*>>();
    test_iter_rvalue<BidirectionalIterator<std::unique_ptr<int>*>, Sentinel<std::unique_ptr<int>*>>();
    test_iter_rvalue<RandomAccessIterator<std::unique_ptr<int>*>, Sentinel<std::unique_ptr<int>*>>();

    test_range_rvalue<ForwardIterator<std::unique_ptr<int>*> >();
    test_range_rvalue<BidirectionalIterator<std::unique_ptr<int>*> >();
    test_range_rvalue<RandomAccessIterator<std::unique_ptr<int>*> >();
    test_range_rvalue<std::unique_ptr<int>*>();
    test_range_rvalue<ForwardIterator<std::unique_ptr<int>*>, Sentinel<std::unique_ptr<int>*>>();
    test_range_rvalue<BidirectionalIterator<std::unique_ptr<int>*>, Sentinel<std::unique_ptr<int>*>>();
    test_range_rvalue<RandomAccessIterator<std::unique_ptr<int>*>, Sentinel<std::unique_ptr<int>*>>();

    {
        // Check projection
        S ia[] = {S{0}, S{1}, S{1}, S{1}, S{4}, S{2}, S{2}, S{4}, S{2}};
        constexpr auto sa = ranges::size(ia);
        S* r = ranges::adjacent_remove_if(ia, ranges::equal_to{}, &S::i);
        CHECK(r == ia + sa-3);
        CHECK(ia[0].i == 0);
        CHECK(ia[1].i == 1);
        CHECK(ia[2].i == 4);
        CHECK(ia[3].i == 2);
        CHECK(ia[4].i == 4);
        CHECK(ia[5].i == 2);
    }

    {
        // Check rvalue range
        S ia[] = {S{0}, S{1}, S{1}, S{2}, S{3}, S{5}, S{8}, S{13}, S{21}};
        constexpr auto sa = ranges::size(ia);
        using namespace std::placeholders;
        auto r = ranges::adjacent_remove_if(
            ranges::views::all(ia),
            [](int x, int y) noexcept { return (x + y) % 2 == 0; },
            &S::i);
        CHECK(r == ia + sa-3);
        CHECK(ia[0].i == 0);
        CHECK(ia[1].i == 1);
        CHECK(ia[2].i == 2);
        CHECK(ia[3].i == 5);
        CHECK(ia[4].i == 8);
        CHECK(ia[5].i == 21);
    }

    STATIC_CHECK(test_constexpr<ForwardIterator<int *>>());
    STATIC_CHECK(test_constexpr<BidirectionalIterator<int *>>());
    STATIC_CHECK(test_constexpr<RandomAccessIterator<int *>>());
    STATIC_CHECK(test_constexpr<int *>());
    STATIC_CHECK(test_constexpr<ForwardIterator<int *>, Sentinel<int *>>());
    STATIC_CHECK(test_constexpr<BidirectionalIterator<int *>, Sentinel<int *>>());
    STATIC_CHECK(test_constexpr<RandomAccessIterator<int *>, Sentinel<int *>>());

    return ::test_result();
}