Searched refs:s_res (Results 1 – 4 of 4) sorted by relevance
| /third_party/boost/libs/algorithm/test/ |
| D | search_test4.cpp | 89 …vec::const_iterator s_res = std::search ( haystack.begin (), haystack.end (), needle.begin (), nee… in check_one() local
90 if ( s_res != exp.first ) { in check_one()
91 …std::cout << "Expected " << exp.first - haystack.begin () << " got " << s_res - haystack.begin () … in check_one()
|
| D | search_test2.cpp | 117 …vec::const_iterator s_res = std::search ( haystack.begin (), haystack.end (), needle.begin (), nee… in check_one() local
118 if ( s_res != exp.first ) { in check_one()
119 …n # " << i << " expected " << exp.first - haystack.begin () << " got " << s_res - haystack.begin (… in check_one()
|
| D | search_test3.cpp | 117 …vec::const_iterator s_res = std::search ( haystack.begin (), haystack.end (), needle.begin (), nee… in check_one() local
118 if ( s_res != exp.first ) { in check_one()
119 …n # " << i << " expected " << exp.first - haystack.begin () << " got " << s_res - haystack.begin (… in check_one()
|
| /third_party/optimized-routines/math/test/ |
| D | mathtest.c | 999 sgl s_arg1, s_arg2, s_res, s_res2; in runtest() local
1065 case at_s: s_res.f = t.func->func.s_s_ptr(s_arg1.f); break; in runtest()
1067 case at_s2: s_res.f = t.func->func.s2_s_ptr(s_arg1.f, s_arg2.f); break; in runtest()
1069 case at_si: s_res.f = t.func->func.si_s_ptr(s_arg1.f, s_arg2.i); break; in runtest()
1071 case at_sip: s_res.f = t.func->func.sip_s_ptr(s_arg1.f, (int*)&intres); break; in runtest()
1073 case at_ssp: s_res.f = t.func->func.ssp_s_ptr(s_arg1.f, &s_res2.f); break; in runtest()
1165 resultr[0] = s_res.i; in runtest()
|