/ndk/tests/device/test-stlport/unit/ |
D | multiset_test.cpp | 102 int j; in mset5() local 110 for (j = 0; i != s1.end(); ++i, ++j) { in mset5() 111 CPPUNIT_ASSERT(j != 0 || *i == 1); in mset5() 112 CPPUNIT_ASSERT(j != 1 || *i == 3); in mset5() 113 CPPUNIT_ASSERT(j != 2 || *i == 6); in mset5() 114 CPPUNIT_ASSERT(j != 3 || *i == 9); in mset5() 120 for (j = 0; i != s2.end(); ++i, ++j) { in mset5() 121 CPPUNIT_ASSERT(j != 0 || *i == 9); in mset5() 122 CPPUNIT_ASSERT(j != 1 || *i == 6); in mset5() 123 CPPUNIT_ASSERT(j != 2 || *i == 3); in mset5() [all …]
|
D | reference_wrapper_test.cpp | 35 int j = 2; in ref() local 41 r1 = std::tr1::ref(j); in ref() 49 j = 4; in ref() 55 CPPUNIT_CHECK( j == 5 ); in ref() 66 int j = 2; in cref() local 72 r1 = std::tr1::cref(j); in cref() 80 j = 4; in cref()
|
D | rope_test.cpp | 137 static int j = 0; in create_rope() local 141 result.append(1, /* c */ str[j++] ); in create_rope() 142 j %= sizeof(str); in create_rope() 167 crope::const_iterator i(r.begin()), j(r.end()); in test_saved_rope_iterators() local 169 while(i != j) in test_saved_rope_iterators() 177 while(i != j) in test_saved_rope_iterators()
|
D | time_facets_test.cpp | 78 istreambuf_iterator<char, char_traits<char> > j( istrX ); in _time_put_get() local 84 j = tmg.get_date( j, e, io, err, &yet_more ); in _time_put_get() 95 ++j; // skip space in _time_put_get() 97 j = tmg.get_time( j, e, io, err, &yet_more ); in _time_put_get() 161 istreambuf_iterator<wchar_t, char_traits<wchar_t> > j( istrX ); in _time_put_get() local 167 j = tmg.get_date( j, e, io, err, &yet_more ); in _time_put_get() 178 ++j; // skip space in _time_put_get() 180 j = tmg.get_time( j, e, io, err, &yet_more ); in _time_put_get()
|
D | mfunptr_test.cpp | 217 vector<V>::iterator j = find_if( v.begin(), v.end(), b3 ); in find() local 218 CPPUNIT_ASSERT(j != v.end()); in find() 219 CPPUNIT_ASSERT(j->v == 2); in find()
|
D | unordered_test.cpp | 194 for (int j = 0; j < NB_ELEMS; j += NB_ELEMS / 100) { in umap() local 195 umit = us.find(j); in umap() 198 CPPUNIT_ASSERT( (*umit).second == j ); in umap() 371 for (umset::iterator j = p.first; j != p.second;) { in equal_range() local 372 iumset.erase(j++); in equal_range()
|
D | hash_test.cpp | 210 for ( hashType::iterator j = range.first; j != range.second; ++j ) { in check_keys() local 211 collection.insert( j->second ); in check_keys()
|
/ndk/tests/device/test-gnustl-full/unit/ |
D | multiset_test.cpp | 102 int j; in mset5() local 110 for (j = 0; i != s1.end(); ++i, ++j) { in mset5() 111 CPPUNIT_ASSERT(j != 0 || *i == 1); in mset5() 112 CPPUNIT_ASSERT(j != 1 || *i == 3); in mset5() 113 CPPUNIT_ASSERT(j != 2 || *i == 6); in mset5() 114 CPPUNIT_ASSERT(j != 3 || *i == 9); in mset5() 120 for (j = 0; i != s2.end(); ++i, ++j) { in mset5() 121 CPPUNIT_ASSERT(j != 0 || *i == 9); in mset5() 122 CPPUNIT_ASSERT(j != 1 || *i == 6); in mset5() 123 CPPUNIT_ASSERT(j != 2 || *i == 3); in mset5() [all …]
|
D | reference_wrapper_test.cpp | 35 int j = 2; in ref() local 41 r1 = std::tr1::ref(j); in ref() 49 j = 4; in ref() 55 CPPUNIT_CHECK( j == 5 ); in ref() 66 int j = 2; in cref() local 72 r1 = std::tr1::cref(j); in cref() 80 j = 4; in cref()
|
D | rope_test.cpp | 137 static int j = 0; in create_rope() local 141 result.append(1, /* c */ str[j++] ); in create_rope() 142 j %= sizeof(str); in create_rope() 167 crope::const_iterator i(r.begin()), j(r.end()); in test_saved_rope_iterators() local 169 while(i != j) in test_saved_rope_iterators() 177 while(i != j) in test_saved_rope_iterators()
|
D | time_facets_test.cpp | 78 istreambuf_iterator<char, char_traits<char> > j( istrX ); in _time_put_get() local 84 j = tmg.get_date( j, e, io, err, &yet_more ); in _time_put_get() 95 ++j; // skip space in _time_put_get() 97 j = tmg.get_time( j, e, io, err, &yet_more ); in _time_put_get() 161 istreambuf_iterator<wchar_t, char_traits<wchar_t> > j( istrX ); in _time_put_get() local 167 j = tmg.get_date( j, e, io, err, &yet_more ); in _time_put_get() 178 ++j; // skip space in _time_put_get() 180 j = tmg.get_time( j, e, io, err, &yet_more ); in _time_put_get()
|
D | mfunptr_test.cpp | 217 vector<V>::iterator j = find_if( v.begin(), v.end(), b3 ); in find() local 218 CPPUNIT_ASSERT(j != v.end()); in find() 219 CPPUNIT_ASSERT(j->v == 2); in find()
|
D | unordered_test.cpp | 194 for (int j = 0; j < NB_ELEMS; j += NB_ELEMS / 100) { in umap() local 195 umit = us.find(j); in umap() 198 CPPUNIT_ASSERT( (*umit).second == j ); in umap() 371 for (umset::iterator j = p.first; j != p.second;) { in equal_range() local 372 iumset.erase(j++); in equal_range()
|
D | hash_test.cpp | 210 for ( hashType::iterator j = range.first; j != range.second; ++j ) { in check_keys() local 211 collection.insert( j->second ); in check_keys()
|
/ndk/sources/host-tools/sed-4.2.1/testsuite/ |
D | tst-regex2.c | 27 int testno, i, j, k, l; in main() local 131 for (j = 0, l = 1; j < 7; ++j) in main() 133 if (pmatch[l].rm_so != pmatch[0].rm_so + j in main() 189 for (j = 0, l = 1; j < 7; ++j) in main() 191 if (regs.start[l] != match + j in main()
|
/ndk/sources/host-tools/sed-4.2.1/lib/ |
D | regexec.c | 3354 Idx i, j; in build_trtable() local 3451 for (j = 0; j < dests_node[i].nelem; ++j) in build_trtable() 3453 next_node = dfa->nexts[dests_node[i].elems[j]]; in build_trtable() 3509 for (j = 0; (dests_ch[j][i] & mask) == 0; ++j) in build_trtable() 3514 trtable[ch] = dest_states_word[j]; in build_trtable() 3516 trtable[ch] = dest_states[j]; in build_trtable() 3540 for (j = 0; (dests_ch[j][i] & mask) == 0; ++j) in build_trtable() 3544 trtable[ch] = dest_states[j]; in build_trtable() 3545 trtable[ch + SBC_MAX] = dest_states_word[j]; in build_trtable() 3553 for (j = 0; j < ndests; ++j) in build_trtable() [all …]
|
D | quotearg.c | 486 size_t j; in quotearg_buffer_restyled() local 487 for (j = 1; j < bytes; j++) in quotearg_buffer_restyled() 488 switch (arg[i + m + j]) in quotearg_buffer_restyled()
|
/ndk/sources/host-tools/nawk-20071023/ |
D | lib.c | 261 int i, j, n; in fldbld() local 341 for (j = 1; j <= lastfld; j++) { in fldbld() 342 p = fldtab[j]; in fldbld() 350 for (j = 0; j <= lastfld; j++) { in fldbld() 351 p = fldtab[j]; in fldbld() 352 printf("field %d (%s): |%s|\n", j, p->nval, p->sval); in fldbld()
|
D | b.c | 852 int i, j, k; in cgoto() local 877 for (j = 1; j <= *q; j++) { in cgoto() 878 if (q[j] >= maxsetvec) { in cgoto() 885 if (setvec[q[j]] == 0) { in cgoto() 887 setvec[q[j]] = 1; in cgoto() 895 j = 1; in cgoto() 898 tmpset[j++] = i; in cgoto() 905 for (j = 1; j <= k; j++) in cgoto() 906 if (tmpset[j] != p[j]) in cgoto()
|
D | run.c | 648 Awkfloat j; in relop() local 653 j = x->fval - y->fval; in relop() 654 i = j<0? -1: (j>0? 1: 0); in relop() 998 Awkfloat i, j = 0; in arith() local 1007 j = getfval(y); in arith() 1013 i += j; in arith() 1016 i -= j; in arith() 1019 i *= j; in arith() 1022 if (j == 0) in arith() 1024 i /= j; in arith() [all …]
|
/ndk/sources/host-tools/make-3.81/ |
D | rule.c | 288 register unsigned int i, j; in new_pattern_rule() local 300 for (j = 0; r->targets[j] != 0; ++j) in new_pattern_rule() 301 if (!streq (rule->targets[i], r->targets[j])) in new_pattern_rule() 303 if (r->targets[j] == 0) in new_pattern_rule()
|
D | implicit.c | 420 register unsigned int j; in pattern_search() local 421 for (j = 0; tryrules[i]->targets[j] != 0; ++j) in pattern_search() 422 if (tryrules[i]->targets[j][1] == '\0') in pattern_search() 424 if (tryrules[i]->targets[j] != 0) in pattern_search()
|
D | getloadavg.c | 686 register unsigned int i, j; in getloadavg() local 734 j = 0; in getloadavg() 737 load += proc_sum_data.ps_nrun[j]; in getloadavg() 738 if (j++ == PS_NRUNSIZE) in getloadavg() 739 j = 0; in getloadavg()
|
/ndk/sources/host-tools/make-3.81/tests/scripts/options/ |
D | general | 14 &run_make_with_options($makefile, "-j 1foo", &get_logfile); 16 …$answer = "$make_name: Parallel jobs (-j) are not supported on this platform.\n$make_name: Resetti…
|
D | dash-l | 16 decide that it cannot run more than one job even though -j 4 was 46 $mkoptions .= " -j 4" if ($parallel_jobs);
|