| /external/chromium/base/ |
| version_unittest.cc | 22 } cases[] = { local
42 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) {
43 scoped_ptr<Version> vers(Version::GetVersionFromString(cases[i].input));
44 EXPECT_EQ(cases[i].success, vers.get() != NULL);
45 if (cases[i].success) {
47 EXPECT_EQ(cases[i].parts, vers->components().size());
57 } cases[] = { local
69 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) {
70 scoped_ptr<Version> lhs(Version::GetVersionFromString(cases[i].lhs));
71 scoped_ptr<Version> rhs(Version::GetVersionFromString(cases[i].rhs))
[all...] |
| string_number_conversions_unittest.cc | 64 } cases[] = { local
71 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i)
72 EXPECT_EQ(cases[i].output, Uint64ToString(cases[i].input));
80 } cases[] = { local
107 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) {
108 const char* ascii_chars = cases[i].input.c_str();
110 EXPECT_EQ(cases[i].success, StringToInt(cases[i].input, &output));
111 EXPECT_EQ(cases[i].output, output)
178 } cases[] = { local
280 } cases[] = { local
350 } cases[] = { local
389 } cases[] = { local
[all...] |
| file_path_unittest.cc | 53 const struct UnaryTestData cases[] = { local
133 for (size_t i = 0; i < arraysize(cases); ++i) {
134 FilePath input(cases[i].input);
136 EXPECT_EQ(FilePath::StringType(cases[i].expected), observed.value()) <<
142 const struct UnaryTestData cases[] = { local
220 for (size_t i = 0; i < arraysize(cases); ++i) {
221 FilePath input(cases[i].input);
223 EXPECT_EQ(FilePath::StringType(cases[i].expected), observed.value()) <<
229 const struct BinaryTestData cases[] = { local
246 // Append introduces the default separator character, so these test cases
321 const struct UnaryTestData cases[] = { local
385 const struct UnaryBooleanTestData cases[] = { local
453 const struct UnaryTestData cases[] = { local
506 const struct BinaryBooleanTestData cases[] = { local
558 const struct BinaryTestData cases[] = { local
638 const struct BinaryBooleanTestData cases[] = { local
714 const struct UnaryTestData cases[] = { local
761 const struct BinaryTestData cases[] = { local
829 const struct UnaryTestData cases[] = { local
857 const struct BinaryTestData cases[] = { local
895 const struct BinaryBooleanTestData cases[] = { local
940 const struct BinaryIntTestData cases[] = { local
1017 const struct UnaryBooleanTestData cases[] = { local
1049 const struct UnaryTestData cases[] = { local
[all...] |
| /external/webkit/LayoutTests/fast/url/script-tests/ |
| trivial.js | 3 cases = [
11 for (var i = 0; i < cases.length; ++i) {
12 shouldBe("canonicalize('" + cases[i][0] + "')",
13 "'" + cases[i][1] + "'");
|
| anchor.js | 3 cases = [
15 for (var i = 0; i < cases.length; ++i) {
16 shouldBe("canonicalize('http://www.example.com/#" + cases[i][0] + "')",
17 "'http://www.example.com/#" + cases[i][1] + "'");
|
| path-url.js | 3 cases = [
10 for (var i = 0; i < cases.length; ++i) {
11 test_vector = cases[i][0];
12 expected_result = cases[i][1];
|
| trivial-segments.js | 3 cases = [
11 for (var i = 0; i < cases.length; ++i) {
12 shouldBe("segments('" + cases[i][0] + "')",
13 "'" + JSON.stringify(cases[i][1]) + "'");
|
| port.js | 3 cases = [
14 for (var i = 0; i < cases.length; ++i) {
15 shouldBe("canonicalize('http://www.example.com:" + cases[i][0] + "/')",
16 "'http://www.example.com" + cases[i][1] + "/'");
|
| relative-unix.js | 3 cases = [
17 for (var i = 0; i < cases.length; ++i) {
18 baseURL = cases[i][0];
19 relativeURL = cases[i][1];
20 expectedURL = cases[i][2];
|
| mailto.js | 3 cases = [
24 for (var i = 0; i < cases.length; ++i) {
25 shouldBe("canonicalize('mailto:" + cases[i][0] + "')",
26 "'mailto:" + cases[i][1] + "'");
|
| scheme.js | 3 cases = [
16 for (var i = 0; i < cases.length; ++i) {
17 test_vector = cases[i][0];
18 expected_result = cases[i][1];
|
| query.js | 3 cases = [
25 for (var i = 0; i < cases.length; ++i) {
26 shouldBe("canonicalize('http://www.example.com/?" + cases[i][0] + "')",
27 "'http://www.example.com/?" + cases[i][1] + "'");
|
| relative-win.js | 3 cases = [
37 for (var i = 0; i < cases.length; ++i) {
38 baseURL = cases[i][0];
39 relativeURL = cases[i][1];
40 expectedURL = cases[i][2];
|
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| SwitchData.java | 37 /** {@code non-null;} sorted list of switch cases (keys) */
38 private final IntList cases; field in class:SwitchData
56 * @param cases {@code non-null;} sorted list of switch cases (keys)
61 IntList cases, CodeAddress[] targets) {
68 if (cases == null) {
69 throw new NullPointerException("cases == null");
76 int sz = cases.size();
79 throw new IllegalArgumentException("cases / targets mismatch");
83 throw new IllegalArgumentException("too many cases");
[all...] |
| /dalvik/dx/src/com/android/dx/dex/code/ |
| SwitchData.java | 38 /** {@code non-null;} sorted list of switch cases (keys) */
39 private final IntList cases; field in class:SwitchData
57 * @param cases {@code non-null;} sorted list of switch cases (keys)
62 IntList cases, CodeAddress[] targets) {
69 if (cases == null) {
70 throw new NullPointerException("cases == null");
77 int sz = cases.size();
80 throw new IllegalArgumentException("cases / targets mismatch");
84 throw new IllegalArgumentException("too many cases");
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
| SwitchData.java | 38 /** {@code non-null;} sorted list of switch cases (keys) */
39 private final IntList cases; field in class:SwitchData
57 * @param cases {@code non-null;} sorted list of switch cases (keys)
62 IntList cases, CodeAddress[] targets) {
69 if (cases == null) {
70 throw new NullPointerException("cases == null");
77 int sz = cases.size();
80 throw new IllegalArgumentException("cases / targets mismatch");
84 throw new IllegalArgumentException("too many cases");
[all...] |
| /external/proguard/src/proguard/classfile/instruction/ |
| LookUpSwitchInstruction.java | 35 public int[] cases; field in class:LookUpSwitchInstruction
49 int[] cases,
54 this.cases = cases;
68 this.cases = lookUpSwitchInstruction.cases;
93 cases = new int[jumpOffsetCount];
98 cases[index] = readInt(code, offset); offset += 4;
114 writeInt(code, offset, cases.length); offset += 4;
117 for (int index = 0; index < cases.length; index++
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| SwitchInsn.java | 25 * Instruction which contains switch cases.
29 /** {@code non-null;} list of switch cases */
30 private final IntList cases; field in class:SwitchInsn
39 * @param cases {@code non-null;} list of switch cases
42 RegisterSpecList sources, IntList cases) {
49 if (cases == null) {
50 throw new NullPointerException("cases == null");
53 this.cases = cases;
[all...] |
| /dalvik/dx/src/com/android/dx/rop/code/ |
| SwitchInsn.java | 25 * Instruction which contains switch cases.
29 /** {@code non-null;} list of switch cases */
30 private final IntList cases; field in class:SwitchInsn
39 * @param cases {@code non-null;} list of switch cases
42 RegisterSpecList sources, IntList cases) {
49 if (cases == null) {
50 throw new NullPointerException("cases == null");
53 this.cases = cases;
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
| SwitchInsn.java | 25 * Instruction which contains switch cases.
29 /** {@code non-null;} list of switch cases */
30 private final IntList cases; field in class:SwitchInsn
39 * @param cases {@code non-null;} list of switch cases
42 RegisterSpecList sources, IntList cases) {
49 if (cases == null) {
50 throw new NullPointerException("cases == null");
53 this.cases = cases;
[all...] |
| /external/valgrind/main/memcheck/tests/ |
| leak-cases-full.stderr.exp | 7 by 0x........: mk (leak-cases.c:52)
8 by 0x........: f (leak-cases.c:78)
9 by 0x........: main (leak-cases.c:107)
13 by 0x........: mk (leak-cases.c:52)
14 by 0x........: f (leak-cases.c:81)
15 by 0x........: main (leak-cases.c:107)
19 by 0x........: mk (leak-cases.c:52)
20 by 0x........: f (leak-cases.c:84)
21 by 0x........: main (leak-cases.c:107)
25 by 0x........: mk (leak-cases.c:52
[all...] |
| leak-cases-possible.stderr.exp | 7 by 0x........: mk (leak-cases.c:52)
8 by 0x........: f (leak-cases.c:74)
9 by 0x........: main (leak-cases.c:107)
13 by 0x........: mk (leak-cases.c:52)
14 by 0x........: f (leak-cases.c:76)
15 by 0x........: main (leak-cases.c:107)
19 by 0x........: mk (leak-cases.c:52)
20 by 0x........: f (leak-cases.c:91)
21 by 0x........: main (leak-cases.c:107)
|
| /external/webkit/Source/WebKit/chromium/tests/ |
| KURLTest.cpp | 64 // Test the cases where we should be the same as WebKit's old KURL.
78 } cases[] = { local
86 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); i++) {
88 WebCore::KURL kurl(WebCore::ParsedURLString, cases[i].url);
90 EXPECT_EQ(cases[i].protocol, kurl.protocol());
91 EXPECT_EQ(cases[i].host, kurl.host());
92 EXPECT_EQ(cases[i].port, kurl.port());
93 EXPECT_EQ(cases[i].user, kurl.user());
94 EXPECT_EQ(cases[i].pass, kurl.pass());
95 EXPECT_EQ(cases[i].lastPathComponent, kurl.lastPathComponent())
120 ComponentCase cases[] = { local
213 } cases[] = { local
[all...] |
| /external/chromium/crypto/ |
| hmac_unittest.cc | 63 // Test cases from RFC 2202 section 3
71 } cases[] = { local
123 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i) {
125 ASSERT_TRUE(hmac.Init(reinterpret_cast<const unsigned char*>(cases[i].key),
126 cases[i].key_len));
127 std::string data_string(cases[i].data, cases[i].data_len);
130 EXPECT_EQ(0, memcmp(cases[i].digest, digest, kSHA1DigestSize));
218 } cases[] = { local
230 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(cases); ++i)
[all...] |
| /external/icu4c/test/intltest/ |
| calcasts.cpp | 7 * behavior of a calendar to a certain set of 'test cases', involving
42 void CalendarCaseTest::doTestCases(const TestCase *cases, Calendar *cal) {
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[i].dayOfWeek,status)
[all...] |
