Searched refs:testCases (Results 1 - 25 of 44) sorted by relevance

12

/external/chromium_org/content/browser/resources/media/new/
H A Dwebui_resource_test.js126 var testCases = [];
147 testCases.push(name);
149 if (!testCases.length) {
183 if (testCases.length > 0) {
184 var fn = testCases.pop();
202 if (testCases.length) {
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitperl/VCSUtils_unittest/
H A DprepareParsedPatch.pl52 my @testCases = (
124 my $testCasesCount = @testCases;
127 foreach my $testCase (@testCases) {
/external/libphonenumber/java/test/com/android/i18n/phonenumbers/
H A DPhoneNumberMatcherTest.java460 List<NumberTest> testCases = new ArrayList<NumberTest>();
461 testCases.addAll(Arrays.asList(STRICT_GROUPING_CASES));
462 testCases.addAll(Arrays.asList(EXACT_GROUPING_CASES));
463 testCases.addAll(Arrays.asList(VALID_CASES));
464 testCases.addAll(Arrays.asList(POSSIBLE_ONLY_CASES));
465 doTestNumberMatchesForLeniency(testCases, Leniency.POSSIBLE);
469 List<NumberTest> testCases = new ArrayList<NumberTest>();
470 testCases.addAll(Arrays.asList(IMPOSSIBLE_CASES));
471 doTestNumberNonMatchesForLeniency(testCases, Leniency.POSSIBLE);
475 List<NumberTest> testCases
519 doTestNumberMatchesForLeniency(List<NumberTest> testCases, PhoneNumberUtil.Leniency leniency) argument
542 doTestNumberNonMatchesForLeniency(List<NumberTest> testCases, PhoneNumberUtil.Leniency leniency) argument
[all...]
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/net/
H A DInetSocketAddressTest.java111 Object[] testCases = {
115 SerializationTest.verifySelf(testCases, COMPARATOR);
123 Object[] testCases = {
127 SerializationTest.verifyGolden(this, testCases, COMPARATOR);
/external/chromium_org/third_party/icu/source/test/cintltst/
H A Dcg7coll.c67 const static UChar testCases[][MAX_TOKEN_LEN] = { variable
178 doTest(tblColl1, testCases[results[i][j]], testCases[results[i][n]], UCOL_LESS);
211 doTest(myCollation, testCases[results[8][j]], testCases[results[8][n]], UCOL_LESS);
241 doTest(myCollation, testCases[results[9][j]], testCases[results[9][n]], UCOL_LESS);
271 doTest(myCollation, testCases[results[10][j]], testCases[results[10][n]], UCOL_LESS);
300 doTest(myCollation, testCases[result
[all...]
H A Dputiltst.c294 const char *testCases[] = { local
309 for(j=0;testCases[j]!=NULL;j+=3) {
310 v1str = testCases[j+0];
311 opstr = testCases[j+1];
312 v2str = testCases[j+2];
539 } testCases[] = { local
557 int32_t count=(sizeof(testCases)/sizeof(testCases[0]));
564 const char *input = STRNULL(testCases[i].inBuf);
565 const char *expect = STRNULL(testCases[
585 } testCases[] = { local
[all...]
H A Dcloctst.c1450 } testCases[] = { local
1489 for(i = 0; i < sizeof(testCases)/sizeof(testCases[0]); i++) {
1492 keywords = uloc_openKeywords(testCases[i].localeID, &status);
1494 if(status != testCases[i].expectedStatus) {
1496 testCases[i].localeID,
1497 u_errorName(testCases[i].expectedStatus), u_errorName(status));
1501 if((keyCount = uenum_count(keywords, &status)) != testCases[i].numKeywords) {
1502 log_err("Expected to get %i keywords, got %i\n", testCases[i].numKeywords, keyCount);
1507 if(strcmp(keyword, testCases[
1543 } testCases[] = { local
1757 } testCases[] = { local
1899 } testCases[] = { local
1962 } testCases[] = { local
2111 } testCases[] = { local
[all...]
H A Dcapitst.c1948 } testCases[] = { local
1977 for(i = 0; i < sizeof(testCases)/sizeof(testCases[0]); i++) {
1979 if(testCases[i].locale) {
1980 locale = testCases[i].locale;
1985 coll = ucol_openFromShortString(testCases[i].input, FALSE, &parseError, &status);
1986 if(status != testCases[i].expectedStatus) {
1988 u_errorName(status), u_errorName(testCases[i].expectedStatus), testCases[i].input);
1995 if(strcmp(fromShortBuffer, testCases[
[all...]
H A Dcalldata.h92 const UChar testCases[][4] = variable
H A Dcbiditst.c1180 } testCases[]={ local
1208 LENGTHOF(testCases));
1210 for(i=0; i<LENGTHOF(testCases); ++i) {
1211 dir = ubidi_getBaseDirection(testCases[i].s, testCases[i].length );
2028 } testCases[]={ local
2047 log_verbose("inverse Bidi: testInverse(L) with %u test cases ---\n", LENGTHOF(testCases));
2048 for(i=0; i<LENGTHOF(testCases); ++i) {
2051 _testInverseBidi(pBiDi, testCases[i].s, testCases[
3418 } testCases[] = { local
[all...]
/external/chromium_org/third_party/icu/source/test/intltest/
H A Dg7coll.cpp19 static const UChar testCases[][G7CollationTest::MAX_TOKEN_LEN] = { variable
149 doTest(tblColl1, testCases[results[i][j]], testCases[results[i][n]], Collator::LESS);
184 doTest(myCollation, testCases[results[8][j]], testCases[results[8][n]], Collator::LESS);
218 doTest(myCollation, testCases[results[9][j]], testCases[results[9][n]], Collator::LESS);
252 doTest(myCollation, testCases[results[10][j]], testCases[results[10][n]], Collator::LESS);
281 doTest(myCollation, testCases[result
[all...]
H A Dloctest.cpp1576 } testCases[] = { local
1606 for(i = 0; i < (int32_t)(sizeof(testCases)/sizeof(testCases[0])); i++) {
1608 Locale l(testCases[i].localeID);
1611 if(status != testCases[i].expectedStatus) {
1613 u_errorName(testCases[i].expectedStatus), u_errorName(status));
1617 if((keyCount = keywords->count(status)) != testCases[i].numKeywords) {
1618 err("Expected to get %i keywords, got %i\n", testCases[i].numKeywords, keyCount);
1626 if(strcmp(keyword, testCases[i].expectedKeywords[j]) != 0) {
1627 err("Expected to get keyword value %s, got %s\n", testCases[
1679 } testCases[] = { local
1708 } testCases[] = { local
1742 } testCases[] = { local
2086 } testCases[] = { local
[all...]
H A Dallcoll.cpp138 doTest(myCollation, testCases[i], testCases[j], Collator::LESS);
H A Dssearch.cpp374 UdhrTestCase testCases[] = { local
386 int32_t testCount = ARRAY_SIZE(testCases);
394 ucbuf_resolveFileName(udhrPath, testCases[t].file, NULL, &len, &status);
405 ucbuf_resolveFileName(udhrPath, testCases[t].file, resolvedFileName, &len, &status);
411 infoln("Could not open the input file %s. Test skipped\n", testCases[t].file);
437 UCollator *coll = ucol_open(testCases[t].locale, &status);
442 errln("Could not open collator for %s", testCases[t].locale);
449 errln("Could not open CollData object for %s", testCases[t].locale);
456 errln("Could not open search object for %s", testCases[t].locale);
466 errln("Could not find pattern - locale: %s, file: %s ", testCases[
[all...]
/external/icu4c/test/cintltst/
H A Dcg7coll.c67 const static UChar testCases[][MAX_TOKEN_LEN] = { variable
182 doTest(tblColl1, testCases[results[i][j]], testCases[results[i][n]], UCOL_LESS);
215 doTest(myCollation, testCases[results[8][j]], testCases[results[8][n]], UCOL_LESS);
245 doTest(myCollation, testCases[results[9][j]], testCases[results[9][n]], UCOL_LESS);
275 doTest(myCollation, testCases[results[10][j]], testCases[results[10][n]], UCOL_LESS);
304 doTest(myCollation, testCases[result
[all...]
H A Dputiltst.c305 const char *testCases[] = { local
320 for(j=0;testCases[j]!=NULL;j+=3) {
321 v1str = testCases[j+0];
322 opstr = testCases[j+1];
323 v2str = testCases[j+2];
550 } testCases[] = { local
568 int32_t count=(sizeof(testCases)/sizeof(testCases[0]));
575 const char *input = STRNULL(testCases[i].inBuf);
576 const char *expect = STRNULL(testCases[
596 } testCases[] = { local
[all...]
H A Dcloctst.c1596 } testCases[] = { local
1635 for(i = 0; i < sizeof(testCases)/sizeof(testCases[0]); i++) {
1638 keywords = uloc_openKeywords(testCases[i].localeID, &status);
1640 if(status != testCases[i].expectedStatus) {
1642 testCases[i].localeID,
1643 u_errorName(testCases[i].expectedStatus), u_errorName(status));
1647 if((keyCount = uenum_count(keywords, &status)) != testCases[i].numKeywords) {
1648 log_err("Expected to get %i keywords, got %i\n", testCases[i].numKeywords, keyCount);
1653 if(strcmp(keyword, testCases[
1689 } testCases[] = { local
1903 } testCases[] = { local
2045 } testCases[] = { local
2108 } testCases[] = { local
2257 } testCases[] = { local
[all...]
H A Dcapitst.c2022 } testCases[] = { local
2051 for(i = 0; i < sizeof(testCases)/sizeof(testCases[0]); i++) {
2053 if(testCases[i].locale) {
2054 locale = testCases[i].locale;
2059 coll = ucol_openFromShortString(testCases[i].input, FALSE, &parseError, &status);
2060 if(status != testCases[i].expectedStatus) {
2062 u_errorName(status), u_errorName(testCases[i].expectedStatus), testCases[i].input);
2069 if(strcmp(fromShortBuffer, testCases[
[all...]
H A Dcalldata.h92 const UChar testCases[][4] = variable
H A Dcbiditst.c1324 } testCases[]={ local
1352 LENGTHOF(testCases));
1354 for(i=0; i<LENGTHOF(testCases); ++i) {
1355 dir = ubidi_getBaseDirection(testCases[i].s, testCases[i].length );
2172 } testCases[]={ local
2191 log_verbose("inverse Bidi: testInverse(L) with %u test cases ---\n", LENGTHOF(testCases));
2192 for(i=0; i<LENGTHOF(testCases); ++i) {
2195 _testInverseBidi(pBiDi, testCases[i].s, testCases[
3898 } testCases[] = { local
[all...]
/external/icu4c/test/intltest/
H A Dg7coll.cpp19 static const UChar testCases[][G7CollationTest::MAX_TOKEN_LEN] = { variable
149 doTest(tblColl1, testCases[results[i][j]], testCases[results[i][n]], Collator::LESS);
184 doTest(myCollation, testCases[results[8][j]], testCases[results[8][n]], Collator::LESS);
218 doTest(myCollation, testCases[results[9][j]], testCases[results[9][n]], Collator::LESS);
252 doTest(myCollation, testCases[results[10][j]], testCases[results[10][n]], Collator::LESS);
281 doTest(myCollation, testCases[result
[all...]
H A Dloctest.cpp1597 } testCases[] = { local
1627 for(i = 0; i < (int32_t)(sizeof(testCases)/sizeof(testCases[0])); i++) {
1629 Locale l(testCases[i].localeID);
1632 if(status != testCases[i].expectedStatus) {
1634 u_errorName(testCases[i].expectedStatus), u_errorName(status));
1638 if((keyCount = keywords->count(status)) != testCases[i].numKeywords) {
1639 err("Expected to get %i keywords, got %i\n", testCases[i].numKeywords, keyCount);
1647 if(strcmp(keyword, testCases[i].expectedKeywords[j]) != 0) {
1648 err("Expected to get keyword value %s, got %s\n", testCases[
1700 } testCases[] = { local
1729 } testCases[] = { local
1763 } testCases[] = { local
2111 } testCases[] = { local
[all...]
H A Dallcoll.cpp138 doTest(myCollation, testCases[i], testCases[j], Collator::LESS);
H A Dalphaindextst.cpp620 } testCases[] = { local
635 for (int32_t i = 0; i < LENGTHOF(testCases); ++i) {
636 const TestCase &testCase = testCases[i];
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/lang/
H A DEnumTest.java227 Object[] testCases = { enumColorMap, Sample.CURLY };
229 SerializationTest.verifySelf(testCases);
256 Object[] testCases = { Sample.CURLY, new MockEnum(),
262 SerializationTest.verifyGolden(this, testCases);

Completed in 4747 milliseconds

12