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:
142
Telegram/ThirdParty/range-v3/test/algorithm/replace.cpp
vendored
Normal file
142
Telegram/ThirdParty/range-v3/test/algorithm/replace.cpp
vendored
Normal file
@@ -0,0 +1,142 @@
|
||||
// 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
|
||||
//
|
||||
// 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 <utility>
|
||||
#include <vector>
|
||||
#include <range/v3/core.hpp>
|
||||
#include <range/v3/algorithm/replace.hpp>
|
||||
#include "../simple_test.hpp"
|
||||
#include "../test_utils.hpp"
|
||||
#include "../test_iterators.hpp"
|
||||
|
||||
template<typename Iter, typename Sent = Iter>
|
||||
void test_iter()
|
||||
{
|
||||
int ia[] = {0, 1, 2, 3, 4};
|
||||
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
||||
Iter i = ranges::replace(Iter(ia), Sent(ia+sa), 2, 5);
|
||||
CHECK(ia[0] == 0);
|
||||
CHECK(ia[1] == 1);
|
||||
CHECK(ia[2] == 5);
|
||||
CHECK(ia[3] == 3);
|
||||
CHECK(ia[4] == 4);
|
||||
CHECK(base(i) == ia + sa);
|
||||
}
|
||||
|
||||
template<typename Iter, typename Sent = Iter>
|
||||
void test_rng()
|
||||
{
|
||||
int ia[] = {0, 1, 2, 3, 4};
|
||||
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
|
||||
auto rng = ranges::make_subrange(Iter(ia), Sent(ia+sa));
|
||||
Iter i = ranges::replace(rng, 2, 5);
|
||||
CHECK(ia[0] == 0);
|
||||
CHECK(ia[1] == 1);
|
||||
CHECK(ia[2] == 5);
|
||||
CHECK(ia[3] == 3);
|
||||
CHECK(ia[4] == 4);
|
||||
CHECK(base(i) == ia + sa);
|
||||
}
|
||||
|
||||
constexpr bool test_constexpr()
|
||||
{
|
||||
using namespace ranges;
|
||||
int ia[] = {0, 1, 2, 3, 4};
|
||||
constexpr auto sa = ranges::size(ia);
|
||||
auto r = ranges::replace(ia, 2, 42);
|
||||
STATIC_CHECK_RETURN(r == ia + sa);
|
||||
STATIC_CHECK_RETURN(ia[0] == 0);
|
||||
STATIC_CHECK_RETURN(ia[1] == 1);
|
||||
STATIC_CHECK_RETURN(ia[2] == 42);
|
||||
STATIC_CHECK_RETURN(ia[3] == 3);
|
||||
STATIC_CHECK_RETURN(ia[4] == 4);
|
||||
return true;
|
||||
}
|
||||
|
||||
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_rng<ForwardIterator<int*> >();
|
||||
test_rng<BidirectionalIterator<int*> >();
|
||||
test_rng<RandomAccessIterator<int*> >();
|
||||
test_rng<int*>();
|
||||
|
||||
test_rng<ForwardIterator<int*>, Sentinel<int*> >();
|
||||
test_rng<BidirectionalIterator<int*>, Sentinel<int*> >();
|
||||
test_rng<RandomAccessIterator<int*>, Sentinel<int*> >();
|
||||
|
||||
// test projection
|
||||
{
|
||||
using P = std::pair<int,std::string>;
|
||||
P ia[] = {{0,"0"}, {1,"1"}, {2,"2"}, {3,"3"}, {4,"4"}};
|
||||
P *i = ranges::replace(ia, 2, std::make_pair(42,"42"), &std::pair<int,std::string>::first);
|
||||
CHECK(ia[0] == P{0,"0"});
|
||||
CHECK(ia[1] == P{1,"1"});
|
||||
CHECK(ia[2] == P{42,"42"});
|
||||
CHECK(ia[3] == P{3,"3"});
|
||||
CHECK(ia[4] == P{4,"4"});
|
||||
CHECK(i == ranges::end(ia));
|
||||
}
|
||||
|
||||
// test rvalue ranges
|
||||
{
|
||||
using P = std::pair<int,std::string>;
|
||||
P ia[] = {{0,"0"}, {1,"1"}, {2,"2"}, {3,"3"}, {4,"4"}};
|
||||
auto i = ranges::replace(std::move(ia), 2, std::make_pair(42,"42"), &std::pair<int,std::string>::first);
|
||||
#ifndef RANGES_WORKAROUND_MSVC_573728
|
||||
CHECK(::is_dangling(i));
|
||||
#endif // RANGES_WORKAROUND_MSVC_573728
|
||||
CHECK(ia[0] == P{0,"0"});
|
||||
CHECK(ia[1] == P{1,"1"});
|
||||
CHECK(ia[2] == P{42,"42"});
|
||||
CHECK(ia[3] == P{3,"3"});
|
||||
CHECK(ia[4] == P{4,"4"});
|
||||
}
|
||||
|
||||
{
|
||||
using P = std::pair<int,std::string>;
|
||||
std::vector<P> ia{{0,"0"}, {1,"1"}, {2,"2"}, {3,"3"}, {4,"4"}};
|
||||
auto i = ranges::replace(std::move(ia), 2, std::make_pair(42,"42"), &std::pair<int,std::string>::first);
|
||||
CHECK(::is_dangling(i));
|
||||
CHECK(ia[0] == P{0,"0"});
|
||||
CHECK(ia[1] == P{1,"1"});
|
||||
CHECK(ia[2] == P{42,"42"});
|
||||
CHECK(ia[3] == P{3,"3"});
|
||||
CHECK(ia[4] == P{4,"4"});
|
||||
}
|
||||
|
||||
{
|
||||
STATIC_CHECK(test_constexpr());
|
||||
}
|
||||
|
||||
return ::test_result();
|
||||
}
|
||||
Reference in New Issue
Block a user