//===----------------------------------------------------------------------===// // // 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 // //===----------------------------------------------------------------------===// // // template Pred> // requires CopyConstructible // constexpr bool // constexpr after c++17 // equal(Iter1 first1, Iter1 last1, Iter2 first2, Pred pred); // // Introduced in C++14: // template Pred> // requires CopyConstructible // constexpr bool // constexpr after c++17 // equal(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred); #include #include #include #include "test_macros.h" #include "test_iterators.h" #if TEST_STD_VER > 17 TEST_CONSTEXPR bool eq(int a, int b) { return a == b; } TEST_CONSTEXPR bool test_constexpr() { int ia[] = {1, 3, 6, 7}; int ib[] = {1, 3}; int ic[] = {1, 3, 5, 7}; typedef input_iterator II; typedef bidirectional_iterator BI; return !std::equal(std::begin(ia), std::end(ia), std::begin(ic) , eq) && !std::equal(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), eq) && std::equal(std::begin(ib), std::end(ib), std::begin(ic) , eq) && !std::equal(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq) && std::equal(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)) , eq) && !std::equal(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic)), eq) ; } #endif int comparison_count = 0; template bool counting_equals ( const T &a, const T &b ) { ++comparison_count; return a == b; } int main(int, char**) { int ia[] = {0, 1, 2, 3, 4, 5}; const unsigned s = sizeof(ia)/sizeof(ia[0]); int ib[s] = {0, 1, 2, 5, 4, 5}; assert(std::equal(input_iterator(ia), input_iterator(ia+s), input_iterator(ia), std::equal_to())); #if TEST_STD_VER >= 14 assert(std::equal(input_iterator(ia), input_iterator(ia+s), input_iterator(ia), input_iterator(ia+s), std::equal_to())); assert(std::equal(random_access_iterator(ia), random_access_iterator(ia+s), random_access_iterator(ia), random_access_iterator(ia+s), std::equal_to())); comparison_count = 0; assert(!std::equal(input_iterator(ia), input_iterator(ia+s), input_iterator(ia), input_iterator(ia+s-1), counting_equals)); assert(comparison_count > 0); comparison_count = 0; assert(!std::equal(random_access_iterator(ia), random_access_iterator(ia+s), random_access_iterator(ia), random_access_iterator(ia+s-1), counting_equals)); assert(comparison_count == 0); #endif assert(!std::equal(input_iterator(ia), input_iterator(ia+s), input_iterator(ib), std::equal_to())); #if TEST_STD_VER >= 14 assert(!std::equal(input_iterator(ia), input_iterator(ia+s), input_iterator(ib), input_iterator(ib+s), std::equal_to())); assert(!std::equal(random_access_iterator(ia), random_access_iterator(ia+s), random_access_iterator(ib), random_access_iterator(ib+s), std::equal_to())); #endif #if TEST_STD_VER > 17 static_assert(test_constexpr()); #endif return 0; }