/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/find_if/requirements/explicit_instantiation/ |
H A D | pod.cc | 34 template iterator_type find_if(iterator_type, iterator_type, predicate_type);
|
H A D | 2.cc | 35 template iterator_type find_if(iterator_type, iterator_type, predicate_type);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/find_if/ |
H A D | check_type.cc | 18 // 25.1.2 find_if 43 { return std::find_if(begin, end, pred_function); } 48 { return std::find_if(begin, end, pred_obj()); }
|
H A D | 1.cc | 18 // 25.1.2 find_if 40 VERIFY( std::find_if(con.begin(), con.end(), 50 VERIFY( std::find_if(con.begin(), con.end(), 60 VERIFY( std::find_if(con.begin(), con.end(),
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.robertl/ |
H A D | eb129.C | 17 find_if( l.begin(), l.end(),
|
H A D | eb129a.C | 16 std::find_if( l.begin(), l.end(),
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/ |
H A D | constexpr-empty4.C | 19 constexpr size_type find_if(T (&x)[N], Pred p) { 32 constexpr auto pos1 = find_if(items_long, IsNegative<long>{}); // Line 30 34 static_assert(pos1 == 4, "find_if failure");
|
/haiku-buildtools/legacy/gcc/libstdc++/stl/ |
H A D | algo.h | 40 using __STD::find_if;
|
H A D | stl_algo.h | 87 // find and find_if. 100 inline _InputIter find_if(_InputIter __first, _InputIter __last, function 150 _RandomAccessIter find_if(_RandomAccessIter __first, _RandomAccessIter __last, function 197 inline _InputIter find_if(_InputIter __first, _InputIter __last, function 199 return find_if(__first, __last, __pred, __ITERATOR_CATEGORY(__first)); 552 __first = find_if(__first, __last, __pred);
|
/haiku-buildtools/gcc/libstdc++-v3/include/parallel/ |
H A D | find_selectors.h | 48 * and std::find_if (). 75 { return std::make_pair(find_if(__begin1, __end1, __pred,
|
H A D | algorithmfwd.h | 158 find_if(_IIter, _IIter, _Predicate, __gnu_parallel::sequential_tag); 162 find_if(_IIter, _IIter, _Predicate);
|
H A D | algo.h | 177 find_if(_IIter __begin, _IIter __end, _Predicate __pred, function in namespace:__parallel 179 { return _GLIBCXX_STD_A::find_if(__begin, __end, __pred); } 186 { return _GLIBCXX_STD_A::find_if(__begin, __end, __pred); } 188 // Parallel find_if for random access iterators 199 return _GLIBCXX_STD_A::find_if(__begin, __end, __pred); 205 find_if(_IIter __begin, _IIter __end, _Predicate __pred) function in namespace:__parallel
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/headers/algorithm/ |
H A D | synopsis.cc | 35 find_if(_IIter, _IIter, _Predicate);
|
/haiku-buildtools/gcc/libstdc++-v3/include/bits/ |
H A D | algorithmfwd.h | 64 find_if 259 // find_if 652 find_if(_IIter, _IIter, _Predicate);
|
H A D | stl_algo.h | 195 // find_if 526 { return __last == _GLIBCXX_STD_A::find_if(__first, __last, __pred); } 3806 find_if(_InputIterator __first, _InputIterator __last, function
|