find_first_of_pred.pass.cpp (3707B)
1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 // <algorithm> 11 12 // template<InputIterator Iter1, ForwardIterator Iter2, 13 // Predicate<auto, Iter1::value_type, Iter2::value_type> Pred> 14 // requires CopyConstructible<Pred> 15 // constexpr Iter1 // constexpr after C++17 16 // find_first_of(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred); 17 18 #include <algorithm> 19 #include <functional> 20 #include <cassert> 21 22 #include "test_macros.h" 23 #include "test_iterators.h" 24 25 #if TEST_STD_VER > 17 26 constexpr bool test_constexpr() { 27 int ia[] = {1, 2, 3}; 28 int ib[] = {7, 8, 9}; 29 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3}; 30 typedef forward_iterator<int*> FI; 31 typedef bidirectional_iterator<int*> BI; 32 typedef random_access_iterator<int*> RI; 33 std::equal_to<int> eq{}; 34 return (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)), eq) == FI(ic+1)) 35 && (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)), eq) == FI(std::end(ic))) 36 && (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) == BI(ic+1)) 37 && (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), eq) == BI(std::end(ic))) 38 && (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)), eq) == RI(ic+1)) 39 && (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)), eq) == RI(std::end(ic))) 40 ; 41 } 42 #endif 43 44 int main() 45 { 46 int ia[] = {0, 1, 2, 3, 0, 1, 2, 3}; 47 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 48 int ib[] = {1, 3, 5, 7}; 49 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 50 assert(std::find_first_of(input_iterator<const int*>(ia), 51 input_iterator<const int*>(ia + sa), 52 forward_iterator<const int*>(ib), 53 forward_iterator<const int*>(ib + sb), 54 std::equal_to<int>()) == 55 input_iterator<const int*>(ia+1)); 56 int ic[] = {7}; 57 assert(std::find_first_of(input_iterator<const int*>(ia), 58 input_iterator<const int*>(ia + sa), 59 forward_iterator<const int*>(ic), 60 forward_iterator<const int*>(ic + 1), 61 std::equal_to<int>()) == 62 input_iterator<const int*>(ia+sa)); 63 assert(std::find_first_of(input_iterator<const int*>(ia), 64 input_iterator<const int*>(ia + sa), 65 forward_iterator<const int*>(ic), 66 forward_iterator<const int*>(ic), 67 std::equal_to<int>()) == 68 input_iterator<const int*>(ia+sa)); 69 assert(std::find_first_of(input_iterator<const int*>(ia), 70 input_iterator<const int*>(ia), 71 forward_iterator<const int*>(ic), 72 forward_iterator<const int*>(ic+1), 73 std::equal_to<int>()) == 74 input_iterator<const int*>(ia)); 75 76 #if TEST_STD_VER > 17 77 static_assert(test_constexpr()); 78 #endif 79 }