Home
last modified time | relevance | path

Searched refs:find_if (Results 1 – 25 of 30) sorted by relevance

12

/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/
Dfind_if.hpp26 BOOST_MPL_AUX_COMMON_NAME_WKND(find_if)
32 struct find_if struct
43 BOOST_MPL_AUX_LAMBDA_SUPPORT(2,find_if,(Sequence,Predicate))
46 BOOST_MPL_AUX_NA_SPEC(2,find_if)
Dfind.hpp29 : find_if< Sequence,same_as<T> >
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.find/
Dfind_if.pass.cpp27 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-gnustl-full/unit/
Dunary_test.cpp48 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()
Dbcompos_test.cpp41 int* p = find_if((int*)array, (int*)array + 6, b); in bcompos1()
51 int* p = find_if((int*)array, (int*)array + 6, in bcompos2()
Dfind_test.cpp78 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()
Dptr2_test.cpp73 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()
Dmfunptr_test.cpp207 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-stlport/unit/
Dunary_test.cpp48 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()
Dbcompos_test.cpp41 int* p = find_if((int*)array, (int*)array + 6, b); in bcompos1()
51 int* p = find_if((int*)array, (int*)array + 6, in bcompos2()
Dfind_test.cpp78 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()
Dptr2_test.cpp73 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()
Dmfunptr_test.cpp207 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/issue42891-boost-1_52/jni/boost/boost/test/utils/
Dalgorithm.hpp114 if( std::find_if( first2, last2, std::bind1st( pred, *first1 ) ) == last2 ) in find_first_not_of()
164 … while( --it1 != first1 && std::find_if( first2, last2, std::bind1st( pred, *it1 ) ) == last2 ) {} in find_last_of()
166 …return it1 == first1 && std::find_if( first2, last2, std::bind1st( pred, *it1 ) ) == last2 ? last1… in find_last_of()
211 … while( --it1 != first1 && std::find_if( first2, last2, std::bind1st( pred, *it1 ) ) != last2 ) {} in find_last_not_of()
213 …return it1 == first1 && std::find_if( first2, last2, std::bind1st( pred, *it1 ) ) == last2 ? last1… in find_last_not_of()
/ndk/sources/cxx-stl/stlport/stlport/stl/
D_string.c68 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.c105 __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.c214 _InputIter find_if(_InputIter __first, _InputIter __last, in find_if() function
D_algobase.h670 _InputIter find_if(_InputIter __first, _InputIter __last, _Predicate __pred);
D_algo.h280 __first = find_if(__first, __last, __pred); in remove_if()
/ndk/sources/cxx-stl/stlport/src/
Dctype.cpp332 { 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()
Dfacets_byname.cpp151 { 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()
Dnum_put_float.cpp763 return find_if(buf.begin(), buf.end(), GroupPos()) - buf.begin();
/ndk/sources/third_party/googletest/googletest/test/
Dgtest_stress_test.cc81 std::find_if(properties.begin(), properties.end(), matches_key); in ExpectKeyAndValueWereRecordedForId()
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/impl/
Dunit_test_main.ipp135 …std::find_if( filters.begin(), filters.end(), bind( &single_filter::pass, _1, boost::ref(tu) ) ) !…
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/algorithm/string/detail/
Dfinder.hpp570 ForwardIteratorT It=std::find_if( Begin, End, m_Pred ); in operator ()()

12