HomeSort by relevance Sort by last modified time
    Searched refs:cases (Results 1 - 25 of 1175) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/libchrome/base/metrics/
metrics_hashes_unittest.cc 22 } cases[] = { local
28 for (size_t i = 0; i < arraysize(cases); ++i) {
29 uint64_t hash = HashMetricName(cases[i].input);
31 EXPECT_EQ(cases[i].output, hash_hex);
  /external/libchrome/base/
version_unittest.cc 40 } cases[] = { local
69 for (size_t i = 0; i < arraysize(cases); ++i) {
70 Version version(cases[i].input);
71 EXPECT_EQ(cases[i].success, version.IsValid());
72 if (cases[i].success) {
73 EXPECT_EQ(cases[i].parts, version.components().size());
74 EXPECT_EQ(cases[i].firstpart, version.components()[0]);
84 } cases[] = { local
98 for (size_t i = 0; i < arraysize(cases); ++i) {
99 Version lhs(cases[i].lhs)
    [all...]
  /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/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...]
  /external/v8/src/asmjs/
switch-logic.cc 29 CaseNode* OrderCases(ZoneVector<int>* cases, Zone* zone) {
32 if (cases->empty()) {
35 std::sort(cases->begin(), cases->end());
37 for (size_t i = 1; i < cases->size(); ++i) {
38 if (cases->at(i) - cases->at(i - 1) > max_distance) {
42 table_breaks.push_back(cases->size());
48 int begin = cases->at(curr_pos);
49 int end = cases->at(break_pos - 1)
    [all...]
switch-logic.h 27 V8_EXPORT_PRIVATE CaseNode* OrderCases(ZoneVector<int>* cases, Zone* zone);
  /platform_testing/libraries/aupt-lib/src/android/support/test/aupt/
Scheduler.java 26 * A Scheduler produces an execution ordering for our test cases.
28 * For example, the Sequential scheduler will just repeat our test cases a fixed number of times.
32 /** Shuffle and/or iterate through a list of test cases. */
33 public final Iterable<TestCase> apply(final List<TestCase> cases) {
36 return applyInternal(cases);
42 * A Scheduler that just loops through test cases a fixed number of times.
61 protected abstract Iterator<TestCase> applyInternal(List<TestCase> cases);
70 protected Iterator<TestCase> applyInternal (final List<TestCase> cases) {
75 return count < (cases.size() * mIterations);
79 return cases.get(count++ % cases.size())
    [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/libchrome/base/strings/
string_number_conversions_unittest.cc 74 } cases[] = { local
81 for (size_t i = 0; i < arraysize(cases); ++i)
82 EXPECT_EQ(cases[i].output, Uint64ToString(cases[i].input));
92 } cases[] = { local
104 for (size_t i = 0; i < arraysize(cases); ++i)
105 EXPECT_EQ(cases[i].output, Uint64ToString(cases[i].input));
113 } cases[] = { local
140 for (size_t i = 0; i < arraysize(cases); ++i)
176 } cases[] = { local
241 } cases[] = { local
306 } cases[] = { local
376 } cases[] = { local
442 } cases[] = { local
494 } cases[] = { local
559 } cases[] = { local
618 } cases[] = { local
682 } cases[] = { local
721 } cases[] = { local
778 } cases[] = { local
    [all...]
  /external/clang/tools/scan-build-py/tests/
__init__.py 10 import tests.functional.cases
17 suite.addTests(loader.loadTestsFromModule(tests.functional.cases))
  /external/okhttp/okhttp-hpacktests/src/test/java/com/squareup/okhttp/internal/spdy/hpackjson/
Story.java 28 private List<Case> cases; field in class:Story
40 return cases;
52 story.cases = new ArrayList<>();
53 for (Case caze : cases) {
54 story.cases.add(caze.clone());
  /external/valgrind/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)
lks.stderr.exp 23 by 0x........: mk (leak-cases.c:52)
24 by 0x........: f (leak-cases.c:76)
25 by 0x........: main (leak-cases.c:107)
29 by 0x........: mk (leak-cases.c:52)
30 by 0x........: f (leak-cases.c:91)
31 by 0x........: main (leak-cases.c:107)
35 by 0x........: mk (leak-cases.c:52)
36 by 0x........: f (leak-cases.c:74)
37 by 0x........: main (leak-cases.c:107)
41 by 0x........: mk (leak-cases.c:52
    [all...]
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/
sep-err-1.s 1 ; Test error cases for separators.
sep-err-2.s 1 ; Test error cases for separators.
sep-err-3.s 1 ; Test error cases for separators.
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++abi/libcxxabi/test/
test_demangle.pass.cpp 20 const char* cases[][2] = variable
29624 std::cout << cases[i][0] << " -> " << cases[i][1] << '\\n'; local
    [all...]
  /external/libchrome/base/json/
string_escape_unittest.cc 20 } cases[] = { local
31 for (size_t i = 0; i < arraysize(cases); ++i) {
32 const char* in_ptr = cases[i].to_escape;
37 EXPECT_EQ(std::string(cases[i].escaped), out);
42 EXPECT_EQ(std::string(cases[i].escaped), out);
47 EXPECT_EQ("\"" + std::string(cases[i].escaped) + "\"", fooout);
52 std::string in = cases[0].to_escape;
69 expected += cases[0].escaped;
80 } cases[] = { local
91 for (size_t i = 0; i < arraysize(cases); ++i)
167 } cases[] = { local
    [all...]
  /external/deqp/modules/gles2/stress/
es2sLongRunningTests.cpp 56 // Buffer cases.
81 } cases[] = local
114 for (int caseNdx = 0; caseNdx < DE_LENGTH_OF_ARRAY(cases); caseNdx++)
116 const int redundantBufferFactor = cases[caseNdx].redundantBufferFactor > 0 ? cases[caseNdx].redundantBufferFactor : memoryLimitCases[memoryLimitNdx].redundantBufferFactor;
119 (string() + cases[caseNdx].name + memoryLimitCases[memoryLimitNdx].nameSuffix).c_str(),
120 (string() + cases[caseNdx].desc + memoryLimitCases[memoryLimitNdx].descSuffix).c_str(),
123 contexts, cases[caseNdx].probs,
130 // Texture cases.
153 } cases[] local
211 } cases[] = local
259 } cases[] = local
    [all...]
  /external/deqp/modules/gles3/stress/
es3sLongRunningTests.cpp 56 // Buffer cases.
81 } cases[] = local
114 for (int caseNdx = 0; caseNdx < DE_LENGTH_OF_ARRAY(cases); caseNdx++)
116 const int redundantBufferFactor = cases[caseNdx].redundantBufferFactor > 0 ? cases[caseNdx].redundantBufferFactor : memoryLimitCases[memoryLimitNdx].redundantBufferFactor;
119 (string() + cases[caseNdx].name + memoryLimitCases[memoryLimitNdx].nameSuffix).c_str(),
120 (string() + cases[caseNdx].desc + memoryLimitCases[memoryLimitNdx].descSuffix).c_str(),
123 contexts, cases[caseNdx].probs,
130 // Texture cases.
153 } cases[] local
211 } cases[] = local
259 } cases[] = local
    [all...]
  /external/libchrome/base/files/
file_path_unittest.cc 64 const struct UnaryTestData cases[] = { local
144 for (size_t i = 0; i < arraysize(cases); ++i) {
145 FilePath input(cases[i].input);
147 EXPECT_EQ(FilePath::StringType(cases[i].expected), observed.value()) <<
153 const struct UnaryTestData cases[] = { local
231 for (size_t i = 0; i < arraysize(cases); ++i) {
232 FilePath input(cases[i].input);
234 EXPECT_EQ(FilePath::StringType(cases[i].expected), observed.value()) <<
240 const struct BinaryTestData cases[] = { local
257 // Append introduces the default separator character, so these test cases
332 const struct UnaryTestData cases[] = { local
396 const struct UnaryBooleanTestData cases[] = { local
464 const struct UnaryTestData cases[] = { local
517 const struct BinaryBooleanTestData cases[] = { local
569 const struct BinaryTestData cases[] = { local
649 const struct BinaryBooleanTestData cases[] = { local
727 const struct UnaryTestData cases[] = { local
790 const struct BinaryTestData cases[] = { local
858 const struct UnaryTestData cases[] = { local
896 const struct BinaryTestData cases[] = { local
934 const struct BinaryTestData cases[] = { local
972 const struct BinaryBooleanTestData cases[] = { local
1017 const struct BinaryIntTestData cases[] = { local
1094 const struct UnaryBooleanTestData cases[] = { local
1128 const struct UTF8TestData cases[] = { local
1191 const struct UnaryTestData cases[] = { local
1234 const UnaryBooleanTestData cases[] = { local
1248 const UnaryTestData cases[] = { local
1263 const struct UnaryBooleanTestData cases[] = { local
1303 const FilePath::CharType* cases[] = { local
    [all...]
  /external/deqp/modules/gles2/functional/
es2fShaderConstExprTests.cpp 50 void addChildGroup (const char* name, const char* desc, const gls::ShaderConstExpr::TestParams* cases, int numCases);
53 void ShaderConstExprBuiltinTests::addChildGroup (const char* name, const char* desc, const gls::ShaderConstExpr::TestParams* cases, int numCases)
55 const std::vector<tcu::TestNode*> children = createTests(m_testCtx, m_context.getRenderContext(), m_context.getContextInfo(), cases, numCases, glu::GLSL_VERSION_100_ES);
72 const TestParams cases[] = local
85 addChildGroup("trigonometry", "Trigonometry", cases, DE_LENGTH_OF_ARRAY(cases));
89 const TestParams cases[] = local
100 addChildGroup("exponential", "Exponential", cases, DE_LENGTH_OF_ARRAY(cases));
104 const TestParams cases[] local
124 const TestParams cases[] = local
170 const TestParams cases[] = local
181 const TestParams cases[] = local
    [all...]

Completed in 685 milliseconds

1 2 3 4 5 6 7 8 91011>>