find.pass.cpp (1432B)
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 Iter, class T> 13 // requires HasEqualTo<Iter::value_type, T> 14 // constexpr Iter // constexpr after C++17 15 // find(Iter first, Iter last, const T& value); 16 17 #include <algorithm> 18 #include <cassert> 19 20 #include "test_macros.h" 21 #include "test_iterators.h" 22 23 #if TEST_STD_VER > 17 24 TEST_CONSTEXPR bool test_constexpr() { 25 int ia[] = {1, 3, 5, 2, 4, 6}; 26 int ib[] = {1, 2, 3, 4, 5, 6}; 27 return (std::find(std::begin(ia), std::end(ia), 5) == ia+2) 28 && (std::find(std::begin(ib), std::end(ib), 9) == ib+6) 29 ; 30 } 31 #endif 32 33 int main() 34 { 35 int ia[] = {0, 1, 2, 3, 4, 5}; 36 const unsigned s = sizeof(ia)/sizeof(ia[0]); 37 input_iterator<const int*> r = std::find(input_iterator<const int*>(ia), 38 input_iterator<const int*>(ia+s), 3); 39 assert(*r == 3); 40 r = std::find(input_iterator<const int*>(ia), input_iterator<const int*>(ia+s), 10); 41 assert(r == input_iterator<const int*>(ia+s)); 42 43 #if TEST_STD_VER > 17 44 static_assert(test_constexpr()); 45 #endif 46 }