hakutaku/tdesktop
1
0
Fork 0
Code Issues Pull Requests Actions 5 Packages Projects Releases Wiki Activity

init
Some checks failed
Docker. / Ubuntu (push) Has been cancelled
Details
User-agent updater. / User-agent (push) Failing after 15s
Details
Lock Threads / lock (push) Failing after 10s
Details
Waiting for answer. / waiting-for-answer (push) Failing after 22s
Details
Needs user action. / needs-user-action (push) Failing after 8s
Details
Can't reproduce. / cant-reproduce (push) Failing after 8s
Details
Close stale issues and PRs / stale (push) Has been cancelled
Details

Browse Source
This commit is contained in:
allhaileris
2026-02-16 15:50:16 +03:00
commit afb81b8278
13816 changed files with 3689732 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

379
Telegram/ThirdParty/range-v3/test/algorithm/set_symmetric_difference.hpp vendored Normal file
View File

@@ -0,0 +1,379 @@
// 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 <functional>
#include <vector>
#include <range/v3/core.hpp>
#include <range/v3/algorithm/fill.hpp>
#include <range/v3/algorithm/set_algorithm.hpp>
#include <range/v3/algorithm/lexicographical_compare.hpp>
#include "../simple_test.hpp"
#include "../test_utils.hpp"
#include "../test_iterators.hpp"
template<class Iter1, class Iter2, class OutIter>
void
test_iter()
{
int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};
static const int sa = sizeof(ia)/sizeof(ia[0]);
int ib[] = {2, 4, 4, 6};
static const int sb = sizeof(ib)/sizeof(ib[0]);
int ic[20];
int ir[] = {1, 2, 3, 3, 3, 4, 4, 6};
static const int sr = sizeof(ir)/sizeof(ir[0]);
auto set_symmetric_difference = ::make_testable_2(ranges::set_symmetric_difference);
set_symmetric_difference(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb), OutIter(ic)).
check([&](ranges::set_symmetric_difference_result<Iter1, Iter2, OutIter> res)
{
CHECK((base(res.out) - ic) == sr);
CHECK(std::lexicographical_compare(ic, base(res.out), ir, ir+sr) == false);
ranges::fill(ic, 0);
}
);
set_symmetric_difference(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa), OutIter(ic)).
check([&](ranges::set_symmetric_difference_result<Iter1, Iter2, OutIter> res)
{
CHECK((base(res.out) - ic) == sr);
CHECK(std::lexicographical_compare(ic, base(res.out), ir, ir+sr) == false);
ranges::fill(ic, 0);
}
);
}
template<class Iter1, class Iter2, class OutIter>
void
test_comp()
{
int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};
static const int sa = sizeof(ia)/sizeof(ia[0]);
int ib[] = {2, 4, 4, 6};
static const int sb = sizeof(ib)/sizeof(ib[0]);
int ic[20];
int ir[] = {1, 2, 3, 3, 3, 4, 4, 6};
static const int sr = sizeof(ir)/sizeof(ir[0]);
auto set_symmetric_difference = ::make_testable_2(ranges::set_symmetric_difference);
set_symmetric_difference(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>()).
check([&](ranges::set_symmetric_difference_result<Iter1, Iter2, OutIter> res)
{
CHECK((base(res.out) - ic) == sr);
CHECK(std::lexicographical_compare(ic, base(res.out), ir, ir+sr) == false);
ranges::fill(ic, 0);
}
);
set_symmetric_difference(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>()).
check([&](ranges::set_symmetric_difference_result<Iter1, Iter2, OutIter> res)
{
CHECK((base(res.out) - ic) == sr);
CHECK(std::lexicographical_compare(ic, base(res.out), ir, ir+sr) == false);
ranges::fill(ic, 0);
}
);
}
template<class Iter1, class Iter2, class OutIter>
void test()
{
test_iter<Iter1, Iter2, OutIter>();
test_comp<Iter1, Iter2, OutIter>();
}
struct S
{
int i;
};
struct T
{
int j;
};
struct U
{
int k;
U& operator=(S s) { k = s.i; return *this;}
U& operator=(T t) { k = t.j; return *this;}
};
constexpr bool test_constexpr()
{
using namespace ranges;
int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};
int ib[] = {2, 4, 4, 6};
int ic[20] = {0};
int ir[] = {1, 2, 3, 3, 3, 4, 4, 6};
const int sr = sizeof(ir) / sizeof(ir[0]);
const auto res1 = set_symmetric_difference(ia, ib, ic, less{});
STATIC_CHECK_RETURN(res1.in1 == end(ia));
STATIC_CHECK_RETURN(res1.in2 == end(ib));
STATIC_CHECK_RETURN((res1.out - begin(ic)) == sr);
STATIC_CHECK_RETURN(lexicographical_compare(ic, res1.out, ir, ir + sr, less{}) == 0);
fill(ic, 0);
const auto res2 = set_symmetric_difference(ib, ia, ic, less{});
STATIC_CHECK_RETURN(res2.in1 == end(ib));
STATIC_CHECK_RETURN(res2.in2 == end(ia));
STATIC_CHECK_RETURN(res2.out - begin(ic) == sr);
STATIC_CHECK_RETURN(lexicographical_compare(ic, res2.out, ir, ir + sr, less{}) == 0);
return true;
}
int main()
{
#ifdef SET_SYMMETRIC_DIFFERENCE_1
test<InputIterator<const int*>, InputIterator<const int*>, OutputIterator<int*> >();
test<InputIterator<const int*>, InputIterator<const int*>, ForwardIterator<int*> >();
test<InputIterator<const int*>, InputIterator<const int*>, BidirectionalIterator<int*> >();
test<InputIterator<const int*>, InputIterator<const int*>, RandomAccessIterator<int*> >();
test<InputIterator<const int*>, InputIterator<const int*>, int*>();
test<InputIterator<const int*>, ForwardIterator<const int*>, OutputIterator<int*> >();
test<InputIterator<const int*>, ForwardIterator<const int*>, ForwardIterator<int*> >();
test<InputIterator<const int*>, ForwardIterator<const int*>, BidirectionalIterator<int*> >();
test<InputIterator<const int*>, ForwardIterator<const int*>, RandomAccessIterator<int*> >();
test<InputIterator<const int*>, ForwardIterator<const int*>, int*>();
test<InputIterator<const int*>, BidirectionalIterator<const int*>, OutputIterator<int*> >();
test<InputIterator<const int*>, BidirectionalIterator<const int*>, ForwardIterator<int*> >();
test<InputIterator<const int*>, BidirectionalIterator<const int*>, BidirectionalIterator<int*> >();
test<InputIterator<const int*>, BidirectionalIterator<const int*>, RandomAccessIterator<int*> >();
test<InputIterator<const int*>, BidirectionalIterator<const int*>, int*>();
test<InputIterator<const int*>, RandomAccessIterator<const int*>, OutputIterator<int*> >();
test<InputIterator<const int*>, RandomAccessIterator<const int*>, ForwardIterator<int*> >();
test<InputIterator<const int*>, RandomAccessIterator<const int*>, BidirectionalIterator<int*> >();
test<InputIterator<const int*>, RandomAccessIterator<const int*>, RandomAccessIterator<int*> >();
test<InputIterator<const int*>, RandomAccessIterator<const int*>, int*>();
test<InputIterator<const int*>, const int*, OutputIterator<int*> >();
test<InputIterator<const int*>, const int*, ForwardIterator<int*> >();
test<InputIterator<const int*>, const int*, BidirectionalIterator<int*> >();
test<InputIterator<const int*>, const int*, RandomAccessIterator<int*> >();
test<InputIterator<const int*>, const int*, int*>();
#endif
#ifdef SET_SYMMETRIC_DIFFERENCE_2
test<ForwardIterator<const int*>, InputIterator<const int*>, OutputIterator<int*> >();
test<ForwardIterator<const int*>, InputIterator<const int*>, ForwardIterator<int*> >();
test<ForwardIterator<const int*>, InputIterator<const int*>, BidirectionalIterator<int*> >();
test<ForwardIterator<const int*>, InputIterator<const int*>, RandomAccessIterator<int*> >();
test<ForwardIterator<const int*>, InputIterator<const int*>, int*>();
test<ForwardIterator<const int*>, ForwardIterator<const int*>, OutputIterator<int*> >();
test<ForwardIterator<const int*>, ForwardIterator<const int*>, ForwardIterator<int*> >();
test<ForwardIterator<const int*>, ForwardIterator<const int*>, BidirectionalIterator<int*> >();
test<ForwardIterator<const int*>, ForwardIterator<const int*>, RandomAccessIterator<int*> >();
test<ForwardIterator<const int*>, ForwardIterator<const int*>, int*>();
test<ForwardIterator<const int*>, BidirectionalIterator<const int*>, OutputIterator<int*> >();
test<ForwardIterator<const int*>, BidirectionalIterator<const int*>, ForwardIterator<int*> >();
test<ForwardIterator<const int*>, BidirectionalIterator<const int*>, BidirectionalIterator<int*> >();
test<ForwardIterator<const int*>, BidirectionalIterator<const int*>, RandomAccessIterator<int*> >();
test<ForwardIterator<const int*>, BidirectionalIterator<const int*>, int*>();
test<ForwardIterator<const int*>, RandomAccessIterator<const int*>, OutputIterator<int*> >();
test<ForwardIterator<const int*>, RandomAccessIterator<const int*>, ForwardIterator<int*> >();
test<ForwardIterator<const int*>, RandomAccessIterator<const int*>, BidirectionalIterator<int*> >();
test<ForwardIterator<const int*>, RandomAccessIterator<const int*>, RandomAccessIterator<int*> >();
test<ForwardIterator<const int*>, RandomAccessIterator<const int*>, int*>();
test<ForwardIterator<const int*>, const int*, OutputIterator<int*> >();
test<ForwardIterator<const int*>, const int*, ForwardIterator<int*> >();
test<ForwardIterator<const int*>, const int*, BidirectionalIterator<int*> >();
test<ForwardIterator<const int*>, const int*, RandomAccessIterator<int*> >();
test<ForwardIterator<const int*>, const int*, int*>();
#endif
#ifdef SET_SYMMETRIC_DIFFERENCE_3
test<BidirectionalIterator<const int*>, InputIterator<const int*>, OutputIterator<int*> >();
test<BidirectionalIterator<const int*>, InputIterator<const int*>, ForwardIterator<int*> >();
test<BidirectionalIterator<const int*>, InputIterator<const int*>, BidirectionalIterator<int*> >();
test<BidirectionalIterator<const int*>, InputIterator<const int*>, RandomAccessIterator<int*> >();
test<BidirectionalIterator<const int*>, InputIterator<const int*>, int*>();
test<BidirectionalIterator<const int*>, ForwardIterator<const int*>, OutputIterator<int*> >();
test<BidirectionalIterator<const int*>, ForwardIterator<const int*>, ForwardIterator<int*> >();
test<BidirectionalIterator<const int*>, ForwardIterator<const int*>, BidirectionalIterator<int*> >();
test<BidirectionalIterator<const int*>, ForwardIterator<const int*>, RandomAccessIterator<int*> >();
test<BidirectionalIterator<const int*>, ForwardIterator<const int*>, int*>();
test<BidirectionalIterator<const int*>, BidirectionalIterator<const int*>, OutputIterator<int*> >();
test<BidirectionalIterator<const int*>, BidirectionalIterator<const int*>, ForwardIterator<int*> >();
test<BidirectionalIterator<const int*>, BidirectionalIterator<const int*>, BidirectionalIterator<int*> >();
test<BidirectionalIterator<const int*>, BidirectionalIterator<const int*>, RandomAccessIterator<int*> >();
test<BidirectionalIterator<const int*>, BidirectionalIterator<const int*>, int*>();
test<BidirectionalIterator<const int*>, RandomAccessIterator<const int*>, OutputIterator<int*> >();
test<BidirectionalIterator<const int*>, RandomAccessIterator<const int*>, ForwardIterator<int*> >();
test<BidirectionalIterator<const int*>, RandomAccessIterator<const int*>, BidirectionalIterator<int*> >();
test<BidirectionalIterator<const int*>, RandomAccessIterator<const int*>, RandomAccessIterator<int*> >();
test<BidirectionalIterator<const int*>, RandomAccessIterator<const int*>, int*>();
test<BidirectionalIterator<const int*>, const int*, OutputIterator<int*> >();
test<BidirectionalIterator<const int*>, const int*, ForwardIterator<int*> >();
test<BidirectionalIterator<const int*>, const int*, BidirectionalIterator<int*> >();
test<BidirectionalIterator<const int*>, const int*, RandomAccessIterator<int*> >();
test<BidirectionalIterator<const int*>, const int*, int*>();
#endif
#ifdef SET_SYMMETRIC_DIFFERENCE_4
test<RandomAccessIterator<const int*>, InputIterator<const int*>, OutputIterator<int*> >();
test<RandomAccessIterator<const int*>, InputIterator<const int*>, ForwardIterator<int*> >();
test<RandomAccessIterator<const int*>, InputIterator<const int*>, BidirectionalIterator<int*> >();
test<RandomAccessIterator<const int*>, InputIterator<const int*>, RandomAccessIterator<int*> >();
test<RandomAccessIterator<const int*>, InputIterator<const int*>, int*>();
test<RandomAccessIterator<const int*>, ForwardIterator<const int*>, OutputIterator<int*> >();
test<RandomAccessIterator<const int*>, ForwardIterator<const int*>, ForwardIterator<int*> >();
test<RandomAccessIterator<const int*>, ForwardIterator<const int*>, BidirectionalIterator<int*> >();
test<RandomAccessIterator<const int*>, ForwardIterator<const int*>, RandomAccessIterator<int*> >();
test<RandomAccessIterator<const int*>, ForwardIterator<const int*>, int*>();
test<RandomAccessIterator<const int*>, BidirectionalIterator<const int*>, OutputIterator<int*> >();
test<RandomAccessIterator<const int*>, BidirectionalIterator<const int*>, ForwardIterator<int*> >();
test<RandomAccessIterator<const int*>, BidirectionalIterator<const int*>, BidirectionalIterator<int*> >();
test<RandomAccessIterator<const int*>, BidirectionalIterator<const int*>, RandomAccessIterator<int*> >();
test<RandomAccessIterator<const int*>, BidirectionalIterator<const int*>, int*>();
test<RandomAccessIterator<const int*>, RandomAccessIterator<const int*>, OutputIterator<int*> >();
test<RandomAccessIterator<const int*>, RandomAccessIterator<const int*>, ForwardIterator<int*> >();
test<RandomAccessIterator<const int*>, RandomAccessIterator<const int*>, BidirectionalIterator<int*> >();
test<RandomAccessIterator<const int*>, RandomAccessIterator<const int*>, RandomAccessIterator<int*> >();
test<RandomAccessIterator<const int*>, RandomAccessIterator<const int*>, int*>();
test<RandomAccessIterator<const int*>, const int*, OutputIterator<int*> >();
test<RandomAccessIterator<const int*>, const int*, ForwardIterator<int*> >();
test<RandomAccessIterator<const int*>, const int*, BidirectionalIterator<int*> >();
test<RandomAccessIterator<const int*>, const int*, RandomAccessIterator<int*> >();
test<RandomAccessIterator<const int*>, const int*, int*>();
#endif
#ifdef SET_SYMMETRIC_DIFFERENCE_5
test<const int*, InputIterator<const int*>, OutputIterator<int*> >();
test<const int*, InputIterator<const int*>, BidirectionalIterator<int*> >();
test<const int*, InputIterator<const int*>, BidirectionalIterator<int*> >();
test<const int*, InputIterator<const int*>, RandomAccessIterator<int*> >();
test<const int*, InputIterator<const int*>, int*>();
test<const int*, ForwardIterator<const int*>, OutputIterator<int*> >();
test<const int*, ForwardIterator<const int*>, ForwardIterator<int*> >();
test<const int*, ForwardIterator<const int*>, BidirectionalIterator<int*> >();
test<const int*, ForwardIterator<const int*>, RandomAccessIterator<int*> >();
test<const int*, ForwardIterator<const int*>, int*>();
test<const int*, BidirectionalIterator<const int*>, OutputIterator<int*> >();
test<const int*, BidirectionalIterator<const int*>, ForwardIterator<int*> >();
test<const int*, BidirectionalIterator<const int*>, BidirectionalIterator<int*> >();
test<const int*, BidirectionalIterator<const int*>, RandomAccessIterator<int*> >();
test<const int*, BidirectionalIterator<const int*>, int*>();
test<const int*, RandomAccessIterator<const int*>, OutputIterator<int*> >();
test<const int*, RandomAccessIterator<const int*>, ForwardIterator<int*> >();
test<const int*, RandomAccessIterator<const int*>, BidirectionalIterator<int*> >();
test<const int*, RandomAccessIterator<const int*>, RandomAccessIterator<int*> >();
test<const int*, RandomAccessIterator<const int*>, int*>();
test<const int*, const int*, OutputIterator<int*> >();
test<const int*, const int*, ForwardIterator<int*> >();
test<const int*, const int*, BidirectionalIterator<int*> >();
test<const int*, const int*, RandomAccessIterator<int*> >();
test<const int*, const int*, int*>();
#endif
#ifdef SET_SYMMETRIC_DIFFERENCE_6
// Test projections
{
S ia[] = {S{1}, S{2}, S{2}, S{3}, S{3}, S{3}, S{4}, S{4}, S{4}, S{4}};
T ib[] = {T{2}, T{4}, T{4}, T{6}};
U ic[20];
int ir[] = {1, 2, 3, 3, 3, 4, 4, 6};
static const int sr = sizeof(ir)/sizeof(ir[0]);
ranges::set_symmetric_difference_result<S *, T *, U *> res1 =
ranges::set_symmetric_difference(ia, ib, ic, std::less<int>(), &S::i, &T::j);
CHECK((res1.out - ic) == sr);
CHECK(ranges::lexicographical_compare(ic, res1.out, ir, ir+sr, std::less<int>(), &U::k) == false);
ranges::fill(ic, U{0});
ranges::set_symmetric_difference_result<T *, S *, U *> res2 =
ranges::set_symmetric_difference(ib, ia, ic, std::less<int>(), &T::j, &S::i);
CHECK((res2.out - ic) == sr);
CHECK(ranges::lexicographical_compare(ic, res2.out, ir, ir+sr, std::less<int>(), &U::k) == false);
}
// Test rvalue ranges
#ifndef RANGES_WORKAROUND_MSVC_573728
{
S ia[] = {S{1}, S{2}, S{2}, S{3}, S{3}, S{3}, S{4}, S{4}, S{4}, S{4}};
T ib[] = {T{2}, T{4}, T{4}, T{6}};
U ic[20];
int ir[] = {1, 2, 3, 3, 3, 4, 4, 6};
static const int sr = sizeof(ir)/sizeof(ir[0]);
auto res1 =
ranges::set_symmetric_difference(std::move(ia), ranges::views::all(ib), ic, std::less<int>(), &S::i, &T::j);
CHECK(::is_dangling(res1.in1));
CHECK(res1.in2 == ranges::end(ib));
CHECK((res1.out - ic) == sr);
CHECK(ranges::lexicographical_compare(ic, res1.out, ir, ir+sr, std::less<int>(), &U::k) == false);
ranges::fill(ic, U{0});
auto res2 =
ranges::set_symmetric_difference(ranges::views::all(ib), std::move(ia), ic, std::less<int>(), &T::j, &S::i);
CHECK(res2.in1 == ranges::end(ib));
CHECK(::is_dangling(res2.in2));
CHECK((res2.out - ic) == sr);
CHECK(ranges::lexicographical_compare(ic, res2.out, ir, ir+sr, std::less<int>(), &U::k) == false);
}
#endif // RANGES_WORKAROUND_MSVC_573728
{
std::vector<S> ia{S{1}, S{2}, S{2}, S{3}, S{3}, S{3}, S{4}, S{4}, S{4}, S{4}};
std::vector<T> ib{T{2}, T{4}, T{4}, T{6}};
U ic[20];
int ir[] = {1, 2, 3, 3, 3, 4, 4, 6};
static const int sr = sizeof(ir)/sizeof(ir[0]);
auto res1 =
ranges::set_symmetric_difference(std::move(ia), ranges::views::all(ib), ic, std::less<int>(), &S::i, &T::j);
CHECK(::is_dangling(res1.in1));
CHECK(res1.in2 == ranges::end(ib));
CHECK((res1.out - ic) == sr);
CHECK(ranges::lexicographical_compare(ic, res1.out, ir, ir+sr, std::less<int>(), &U::k) == false);
ranges::fill(ic, U{0});
auto res2 =
ranges::set_symmetric_difference(ranges::views::all(ib), std::move(ia), ic, std::less<int>(), &T::j, &S::i);
CHECK(res2.in1 == ranges::end(ib));
CHECK(::is_dangling(res2.in2));
CHECK((res2.out - ic) == sr);
CHECK(ranges::lexicographical_compare(ic, res2.out, ir, ir+sr, std::less<int>(), &U::k) == false);
}
{
STATIC_CHECK(test_constexpr());
}
#endif
return ::test_result();
}