Searched defs:cases (Results 51 - 75 of 86) sorted by relevance

1234

/external/chromium_org/url/
H A Dgurl_unittest.cc229 // The tricky cases for relative URL resolving are tested in the
273 } cases[] = { local
283 for (size_t i = 0; i < ARRAYSIZE(cases); i++) {
284 GURL url(cases[i].input);
286 EXPECT_EQ(cases[i].expected, origin.spec());
294 } cases[] = { local
302 for (size_t i = 0; i < ARRAYSIZE(cases); i++) {
303 GURL url(cases[i].input);
305 EXPECT_EQ(cases[i].expected, empty_path.spec());
381 } cases[] local
471 } cases[] = { local
[all...]
H A Durl_parse_unittest.cc51 // Used for regular URL parse cases.
224 static URLParseCase cases[] = { member in namespace:url_parse::__anon15534
307 // Partially-complete IPv6 literals, and related cases.
319 // Declared outside for loop to try to catch cases in init() where we forget
322 for (size_t i = 0; i < arraysize(cases); i++) {
323 const char* url = cases[i].input;
327 EXPECT_TRUE(ComponentMatches(url, cases[i].scheme, parsed.scheme));
328 EXPECT_TRUE(ComponentMatches(url, cases[i].username, parsed.username));
329 EXPECT_TRUE(ComponentMatches(url, cases[i].password, parsed.password));
330 EXPECT_TRUE(ComponentMatches(url, cases[
[all...]
H A Durl_canon_unittest.cc48 // Test cases for CanonicalizeIPAddress(). The inputs are identical to
116 // causes it to fail in other cases. It is left a template in case we have
667 IPAddressCase cases[] = { local
740 for (size_t i = 0; i < arraysize(cases); i++) {
743 static_cast<int>(strlen(cases[i].input8)));
748 url_canon::CanonicalizeIPAddress(cases[i].input8, component, &output1,
752 EXPECT_EQ(cases[i].expected_family, host_info.family);
753 EXPECT_EQ(std::string(cases[i].expected_address_hex),
756 EXPECT_STREQ(cases[i].expected, out_str1.c_str());
757 EXPECT_EQ(cases[
787 IPAddressCase cases[] = { local
1368 } cases[] = { local
1695 } cases[] = { local
1784 } cases[] = { local
1864 } cases[] = { local
[all...]
/external/icu4c/test/intltest/
H A Dcalcasts.cpp7 * behavior of a calendar to a certain set of 'test cases', involving
42 void CalendarCaseTest::doTestCases(const TestCase *cases, Calendar *cal) { argument
51 for(i=0;cases[i].era>=0;i++) {
52 UDate t = (JULIAN_EPOCH+(ONE_DAY*cases[i].julian));
54 logln("Test case %d: julianday%f -> date %f\n", i, cases[i].julian, t);
61 checkField(cal, UCAL_ERA, cases[i].era, status);
62 checkField(cal, UCAL_YEAR, cases[i].year,status);
63 checkField(cal, UCAL_MONTH, cases[i].month - 1,status);
64 checkField(cal, UCAL_DATE, cases[i].day,status);
65 checkField(cal, UCAL_DAY_OF_WEEK, cases[
[all...]
H A Dtstnorm.cpp389 * Run a few specific cases that are failing for Verisign.
778 cases[][4]={ local
792 /* ### TODO: add more interesting cases */
807 for(i=0; i<(int32_t)(sizeof(cases)/sizeof(cases[0])); ++i) {
808 switch(*cases[i][0]) {
816 left=UnicodeString(cases[i][1], "").unescape();
817 right=UnicodeString(cases[i][2], "").unescape();
818 expect=UnicodeString(cases[i][3], "").unescape();
825 dataerrln("error in Normalizer::concatenate(), cases[] fail
[all...]
/external/chromium/base/
H A Dstring_util_unittest.cc497 } cases[] = { local
509 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i)
510 EXPECT_EQ(cases[i].expected, GetByteDisplayUnits(cases[i].bytes));
519 } cases[] = { local
521 // under two pre-decimal digits, except in cases where it makes no
551 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) {
552 EXPECT_EQ(ASCIIToUTF16(cases[i].expected),
553 FormatBytes(cases[i].bytes, cases[
566 } cases[] = { local
597 } cases[] = { local
1031 } cases[] = { local
[all...]
/external/chromium_org/base/strings/
H A Dstring_util_unittest.cc497 } cases[] = { local
499 // under two pre-decimal digits, except in cases where it makes no
522 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) {
523 EXPECT_EQ(ASCIIToUTF16(cases[i].expected),
524 FormatBytesUnlocalized(cases[i].bytes));
534 } cases[] = { local
549 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); i++) {
550 string16 str = ASCIIToUTF16(cases[i].str);
551 ReplaceSubstringsAfterOffset(&str, cases[i].start_offset,
552 ASCIIToUTF16(cases[
565 } cases[] = { local
1076 } cases[] = { local
1126 } cases[] = { local
[all...]
/external/chromium_org/ui/gfx/
H A Dtext_elider_unittest.cc240 // bother to do too many edge cases, since these are handled by the escaper
337 } cases[] = { local
346 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) {
347 string16 result = ElideText(UTF8ToUTF16(cases[i].input), font_list,
348 cases[i].width, TRUNCATE_AT_END);
349 EXPECT_EQ(cases[i].output, UTF16ToUTF8(result));
363 } cases[] = { local
372 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) {
373 string16 result = ElideText(UTF8ToUTF16(cases[i].input), font_list,
374 cases[
542 } cases[] = { local
575 } cases[] = { local
634 } cases[] = { local
674 } cases[] = { local
753 } cases[] = { local
836 } cases[] = { local
[all...]
H A Drender_text_unittest.cc35 // Various weak, LTR, RTL, and Bidi string cases with three characters each.
97 const wchar_t* const cases[] = { kWeak, kLtr, L"Hello", kRtl, L"", L"" }; local
98 for (size_t i = 0; i < arraysize(cases); ++i) {
102 render_text->SetText(WideToUTF16(cases[i]));
113 const wchar_t* const cases[] = { kWeak, kLtr, L"Hello", kRtl, L"", L"" }; local
114 for (size_t i = 0; i < arraysize(cases); ++i) {
118 render_text->SetText(WideToUTF16(cases[i]));
204 } cases[] = { local
217 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) {
219 EXPECT_EQ(cases[
408 } cases[] = { local
518 } cases[] = { local
775 } cases[] = { local
849 } cases[] = { local
881 const wchar_t* const cases[] = local
1250 base::string16 cases[] = { local
1376 } cases[] = { local
1456 } cases[] = { local
[all...]
/external/chromium_org/net/socket/
H A Dtransport_client_socket_pool_unittest.cc1042 MockClientSocketFactory::ClientSocketType* cases[2] = { local
1047 for (size_t index = 0; index < arraysize(cases); ++index) {
1048 client_socket_factory_.set_client_socket_types(cases[index], 2);
/external/v8/src/
H A Dprettyprinter.cc192 ZoneList<CaseClause*>* cases = node->cases(); local
193 for (int i = 0; i < cases->length(); i++)
194 PrintCaseClause(cases->at(i));
870 for (int i = 0; i < node->cases()->length(); i++) {
871 PrintCaseClause(node->cases()->at(i));
/external/chromium/googleurl/src/
H A Durl_canon_unittest.cc73 // Test cases for CanonicalizeIPAddress(). The inputs are identical to
129 // causes it to fail in other cases. It is left a template in case we have
543 IPAddressCase cases[] = { local
616 for (size_t i = 0; i < arraysize(cases); i++) {
619 static_cast<int>(strlen(cases[i].input8)));
624 url_canon::CanonicalizeIPAddress(cases[i].input8, component, &output1,
628 EXPECT_EQ(cases[i].expected_family, host_info.family);
630 EXPECT_STREQ(cases[i].expected, out_str1.c_str());
631 EXPECT_EQ(cases[i].expected_component.begin, host_info.out_host.begin);
632 EXPECT_EQ(cases[
659 IPAddressCase cases[] = { local
1237 } cases[] = { local
1508 } cases[] = { local
1637 } cases[] = { local
[all...]
/external/chromium/net/socket/
H A Dtransport_client_socket_pool_unittest.cc891 MockClientSocketFactory::ClientSocketType* cases[2] = { local
896 for (size_t index = 0; index < arraysize(cases); ++index) {
897 client_socket_factory_.set_client_socket_types(cases[index], 2);
/external/chromium_org/chrome/browser/autocomplete/
H A Dsearch_provider_unittest.cc144 void RunTest(TestData* cases, int num_cases, bool prefer_keyword);
289 void SearchProviderTest::RunTest(TestData* cases, argument
294 AutocompleteInput input(cases[i].input, base::string16::npos, base::string16(), GURL(),
300 base::string16 diagnostic_details = ASCIIToUTF16("Input was: ") + cases[i].input +
303 EXPECT_EQ(cases[i].num_results, matches.size()) << diagnostic_details;
304 if (matches.size() == cases[i].num_results) {
305 for (size_t j = 0; j < cases[i].num_results; ++j) {
306 EXPECT_EQ(cases[i].output[j].gurl, matches[j].destination_url) <<
308 EXPECT_EQ(cases[i].output[j].result_type, matches[j].type) <<
310 EXPECT_EQ(cases[
653 } cases[] = { local
898 TestData cases[] = { local
1013 TestData cases[] = { local
1100 } cases[] = { local
1170 } cases[] = { local
1443 } cases[] = { local
1708 } cases[] = { local
2190 } cases[] = { local
2654 } cases[] = { local
2743 } cases[] = { local
2865 } cases[] = { local
3025 } cases[] = { local
3269 } cases[] = { local
3467 } cases[] = { local
3565 } cases[] = { local
3722 } cases[] = { local
3815 } cases[] = { local
[all...]
/external/chromium_org/third_party/icu/source/test/cintltst/
H A Dcnormtst.c167 const char* const cases[][3], int32_t lengthOfCases) {
176 source=CharsToUChars(cases[x][0]);
193 assertEqual(result, cases[x][expIndex], x);
200 assertEqual(result, cases[x][expIndex], x);
529 * Here we pick some specific cases and test the C API.
549 /* normal case with length>=0 (length -1 used for special cases below) */
576 /* specific cases */
737 /* test cases to improve test code coverage */
1436 } cases[]={ local
1438 * special cases fo
166 TestNormCases(UNormalizationMode mode, const char* const cases[][3], int32_t lengthOfCases) argument
[all...]
H A Dcapitst.c1215 u_uastrcpy(testString1, "XFILE What subset of all possible test cases has the highest probability of detecting the most errors?");
1216 u_uastrcpy(testString2, "Xf_ile What subset of all possible test cases has the lowest probability of detecting the least errors?");
1626 * cases. This test tries to check this.
1821 const char* cases[] = { local
1826 uint32_t casesSize = sizeof(cases)/sizeof(cases[0]);
1842 log_verbose("Testing order of the test cases\n");
1843 genericLocaleStarter("en", cases, casesSize);
1863 unescapedLen = u_unescape(cases[i], buffer, 256);
1906 unescapedLen = u_unescape(cases[
[all...]
/external/chromium_org/third_party/icu/source/test/intltest/
H A Dtstnorm.cpp388 * Run a few specific cases that are failing for Verisign.
777 cases[][4]={ local
791 /* ### TODO: add more interesting cases */
806 for(i=0; i<(int32_t)(sizeof(cases)/sizeof(cases[0])); ++i) {
807 switch(*cases[i][0]) {
815 left=UnicodeString(cases[i][1], "").unescape();
816 right=UnicodeString(cases[i][2], "").unescape();
817 expect=UnicodeString(cases[i][3], "").unescape();
824 dataerrln("error in Normalizer::concatenate(), cases[] fail
[all...]
/external/chromium_org/v8/src/
H A Dprettyprinter.cc201 ZoneList<CaseClause*>* cases = node->cases(); local
202 for (int i = 0; i < cases->length(); i++)
203 Visit(cases->at(i));
890 for (int i = 0; i < node->cases()->length(); i++) {
891 Visit(node->cases()->at(i));
/external/icu4c/test/cintltst/
H A Dcnormtst.c171 const char* const cases[][3], int32_t lengthOfCases) {
180 source=CharsToUChars(cases[x][0]);
197 assertEqual(result, cases[x][expIndex], x);
204 assertEqual(result, cases[x][expIndex], x);
533 * Here we pick some specific cases and test the C API.
553 /* normal case with length>=0 (length -1 used for special cases below) */
580 /* specific cases */
741 /* test cases to improve test code coverage */
1440 } cases[]={ local
1442 * special cases fo
170 TestNormCases(UNormalizationMode mode, const char* const cases[][3], int32_t lengthOfCases) argument
[all...]
H A Dcapitst.c1289 u_uastrcpy(testString1, "XFILE What subset of all possible test cases has the highest probability of detecting the most errors?");
1290 u_uastrcpy(testString2, "Xf_ile What subset of all possible test cases has the lowest probability of detecting the least errors?");
1700 * cases. This test tries to check this.
1895 const char* cases[] = { local
1900 uint32_t casesSize = sizeof(cases)/sizeof(cases[0]);
1916 log_verbose("Testing order of the test cases\n");
1917 genericLocaleStarter("en", cases, casesSize);
1937 unescapedLen = u_unescape(cases[i], buffer, 256);
1980 unescapedLen = u_unescape(cases[
[all...]
/external/chromium_org/third_party/mesa/src/src/glsl/
H A Dast.h536 * is used to note these cases when no type is specified.
691 * A list of cases.
693 exec_list cases; member in class:ast_case_statement_list
/external/llvm/utils/TableGen/
H A DDAGISelMatcher.h469 /// to one matcher per opcode. If the opcode doesn't match any of the cases,
475 SwitchOpcodeMatcher(const std::pair<const SDNodeInfo*, Matcher*> *cases, argument
477 : Matcher(SwitchOpcode), Cases(cases, cases+numcases) {}
523 /// to one matcher per case. If the type doesn't match any of the cases,
529 SwitchTypeMatcher(const std::pair<MVT::SimpleValueType, Matcher*> *cases, argument
531 : Matcher(SwitchType), Cases(cases, cases+numcases) {}
/external/mesa3d/src/glsl/
H A Dast.h536 * is used to note these cases when no type is specified.
691 * A list of cases.
693 exec_list cases; member in class:ast_case_statement_list
/external/chromium_org/third_party/mesa/src/chromium_gensrc/mesa/
H A Dglsl_parser.cc2833 /* In all cases, when you get here, the value and location stacks
5448 ast_case_statement_list *cases= new(state) ast_case_statement_list(); local
5449 cases->set_location(yylloc);
5451 cases->cases.push_tail(& (yyvsp[(1) - (1)].case_statement)->link);
5452 (yyval.case_statement_list) = cases;
5462 (yyval.case_statement_list)->cases.push_tail(& (yyvsp[(2) - (2)].case_statement)->link);
/external/chromium_org/third_party/icu/source/i18n/
H A Ducol.cpp1318 // It is similar in the end results to the collIterNormalize, but for the cases when we
1798 * Handles both normal and iterative cases.
2238 // be the sentinel. Most of the cases already check for this, but we
4171 * in which cases the contents of dest is undefined
4405 /* Usually, we'll have non-zero primary1 & primary2, except in cases of a-z and friends, when primary2 will */
4587 inline void doCaseShift(uint8_t **cases, uint32_t &caseShift) { argument
4589 *(*cases)++ = UCOL_CASE_BYTE_START;
4671 uint8_t *primaries = *result, *secondaries = second, *tertiaries = tert, *cases = caseB, *quads = quad; local
4761 uint8_t *caseStart = cases;
4848 /* Usually, we'll have non-zero primary1 & primary2, except in cases o
[all...]

Completed in 2313 milliseconds

1234