| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.find/ |
| D | find_if.pass.cpp | 27 input_iterator<const int*> r = std::find_if(input_iterator<const int*>(ia), in main()
31 r = std::find_if(input_iterator<const int*>(ia), in main()
|
| /ndk/tests/device/test-stlport/unit/ |
| D | unary_test.cpp | 48 int* p = find_if((int*)array, (int*)array + 3, unary_negate<odd>(odd())); in unegate1()
55 int* p = find_if((int*)array, (int*)array + 3, not1(odd())); in unegate2()
67 int* p = find_if((int*)array, (int*)array + 3, not1(ptr_fun(test_func))); in unegate3()
|
| D | bcompos_test.cpp | 41 int* p = find_if((int*)array, (int*)array + 6, b); in bcompos1()
51 int* p = find_if((int*)array, (int*)array + 6, in bcompos2()
|
| D | find_test.cpp | 78 int *location = find_if((int*)numbers, (int*)numbers + 6, odd); in findif0()
84 int *out_range = find_if((int*)numbers_even, (int*)numbers_even + 6, odd); in findif0()
103 iter = find_if(v.begin(), v.end(), div_3); in findif1()
|
| D | ptr2_test.cpp | 73 int* p = find_if((int*)array, (int*)array + 3, pointer_to_unary_function<int, bool>(even)); in ptrun1()
81 int* p = find_if((int*)array, (int*)array + 3, ptr_fun(even)); in ptrun2()
|
| D | mfunptr_test.cpp | 207 vector<V>::iterator i = find_if( v.begin(), v.end(), b ); in find()
217 vector<V>::iterator j = find_if( v.begin(), v.end(), b3 ); in find()
222 vector<V>::iterator k = find_if( v.begin(), v.end(), bind2nd( mem_fun_ref( &V::f ), 2 ) ); in find()
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| D | unary_test.cpp | 48 int* p = find_if((int*)array, (int*)array + 3, unary_negate<odd>(odd())); in unegate1()
55 int* p = find_if((int*)array, (int*)array + 3, not1(odd())); in unegate2()
67 int* p = find_if((int*)array, (int*)array + 3, not1(ptr_fun(test_func))); in unegate3()
|
| D | bcompos_test.cpp | 41 int* p = find_if((int*)array, (int*)array + 6, b); in bcompos1()
51 int* p = find_if((int*)array, (int*)array + 6, in bcompos2()
|
| D | find_test.cpp | 78 int *location = find_if((int*)numbers, (int*)numbers + 6, odd); in findif0()
84 int *out_range = find_if((int*)numbers_even, (int*)numbers_even + 6, odd); in findif0()
103 iter = find_if(v.begin(), v.end(), div_3); in findif1()
|
| D | ptr2_test.cpp | 73 int* p = find_if((int*)array, (int*)array + 3, pointer_to_unary_function<int, bool>(even)); in ptrun1()
81 int* p = find_if((int*)array, (int*)array + 3, ptr_fun(even)); in ptrun2()
|
| D | mfunptr_test.cpp | 207 vector<V>::iterator i = find_if( v.begin(), v.end(), b ); in find()
217 vector<V>::iterator j = find_if( v.begin(), v.end(), b3 ); in find()
222 vector<V>::iterator k = find_if( v.begin(), v.end(), bind2nd( mem_fun_ref( &V::f ), 2 ) ); in find()
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| D | _string.c | 68 return find_if(_M_first, _M_last, in operator()
108 { return _STLP_STD::find_if(__first1, __last1, _STLP_PRIV _Not_within_traits<_Traits>(__first2, __l… in __str_find_first_not_of_aux3()
131 { return _STLP_STD::find_if(__first1, __last1, _STLP_PRIV _Not_within_traits<_Traits>(__first2, __l… in __str_find_first_not_of_aux1()
445 _STLP_STD::find_if(this->_M_Start() + __pos, this->_M_Finish(), in find()
476 _STLP_STD::find_if(const_reverse_iterator(__last), rend(), in rfind()
532 const_pointer __result = _STLP_STD::find_if(this->_M_Start() + __pos, this->_M_Finish(), in find_first_not_of()
568 _STLP_STD::find_if(__rlast, rend(), in find_last_not_of()
|
| D | _istream.c | 105 __last = find_if(__first, __last, in operator()
140 return find_if(__first, __last, _Eq_char_bound<_Traits>(_M_val)); in operator()
158 return find_if(__first, __last, in operator()
|
| D | _algobase.c | 214 _InputIter find_if(_InputIter __first, _InputIter __last, in find_if() function
|
| D | _algobase.h | 670 _InputIter find_if(_InputIter __first, _InputIter __last, _Predicate __pred);
|
| D | _algo.h | 280 __first = find_if(__first, __last, __pred); in remove_if()
|
| /ndk/sources/cxx-stl/stlport/src/ |
| D | ctype.cpp | 332 { return _STLP_STD::find_if(__low, __high, _Ctype_is_mask(__m, _M_ctype_table)); } in scan_is()
339 { return _STLP_STD::find_if(__low, __high, _Ctype_not_mask(__m, _M_ctype_table)); } in scan_not()
414 return find_if(low, high, _Ctype_w_is_mask(m, ctype<char>::classic_table())); in do_scan_is()
421 return find_if(low, high, not1(_Ctype_w_is_mask(m, ctype<char>::classic_table()))); in do_scan_not()
|
| D | facets_byname.cpp | 151 { return find_if(low, high, _STLP_PRIV _Ctype_byname_w_is_mask(m, _M_ctype)); } in do_scan_is()
156 { return find_if(low, high, not1(_STLP_PRIV _Ctype_byname_w_is_mask(m, _M_ctype))); } in do_scan_not()
|
| D | num_put_float.cpp | 763 return find_if(buf.begin(), buf.end(), GroupPos()) - buf.begin();
|
| /ndk/sources/cxx-stl/llvm-libc++/include/ |
| D | algorithm | 44 find_if(InputIterator first, InputIterator last, Predicate pred);
811 // find_if
816 find_if(_InputIterator __first, _InputIterator __last, _Predicate __pred)
1889 __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type>
|