ffc5d2b5d4
This PR refactors tests for `ranges::swap_range`, `std::{swap_range,
iter_swap, swap}` algorithms to eliminate redundant code.
53 lines
1.3 KiB
C++
53 lines
1.3 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <algorithm>
|
|
|
|
// template<Iterator Iter1, Iterator Iter2>
|
|
// requires HasSwap<Iter1::reference, Iter2::reference>
|
|
// void iter_swap(Iter1 a, Iter2 b); // constexpr since C++20
|
|
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
#include "test_iterators.h"
|
|
#include "type_algorithms.h"
|
|
|
|
struct TestIterators {
|
|
template <class Iter>
|
|
TEST_CONSTEXPR_CXX20 void operator()() {
|
|
types::for_each(types::forward_iterator_list<int*>(), TestImpl<Iter>());
|
|
}
|
|
|
|
template <class Iter1>
|
|
struct TestImpl {
|
|
template <class Iter2>
|
|
TEST_CONSTEXPR_CXX20 void operator()() {
|
|
int i = 1;
|
|
int j = 2;
|
|
std::iter_swap(Iter1(&i), Iter2(&j));
|
|
assert(i == 2 && j == 1);
|
|
}
|
|
};
|
|
};
|
|
|
|
TEST_CONSTEXPR_CXX20 bool test() {
|
|
types::for_each(types::forward_iterator_list<int*>(), TestIterators());
|
|
return true;
|
|
}
|
|
|
|
int main(int, char**) {
|
|
test();
|
|
#if TEST_STD_VER >= 20
|
|
static_assert(test());
|
|
#endif
|
|
|
|
return 0;
|
|
}
|