/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/text/ |
H A D | SpoofCheckerTest.java | 298 /* Latin Identifier should now fail; other non-latin test cases should still be OK */ in TestAllowedChars() 392 // Test cases chosen for substitutions of various lengths, and 866 Object[][] cases = new Object[][] { in testCombiningDot() 889 for (Object[] cas : cases) { in testCombiningDot()
|
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/util/ |
H A D | CurrencyTest.java | 253 Object[][] cases = new Object[][] { in testCurrencyVariants() 263 for (Object[] cas : cases) { in testCurrencyVariants() 948 * Test cases for rounding and fractions.
|
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/text/ |
H A D | SpoofCheckerTest.java | 295 /* Latin Identifier should now fail; other non-latin test cases should still be OK */ in TestAllowedChars() 389 // Test cases chosen for substitutions of various lengths, and 863 Object[][] cases = new Object[][] { in testCombiningDot() 886 for (Object[] cas : cases) { in testCombiningDot()
|
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/number/ |
H A D | NumberRangeFormatterTest.java | 733 Object[][] cases = new Object[][] { in testPlurals() 751 for (Object[] cas : cases) { in testPlurals()
|
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/ |
H A D | CurrencyTest.java | 250 Object[][] cases = new Object[][] { in testCurrencyVariants() 260 for (Object[] cas : cases) { in testCurrencyVariants() 960 * Test cases for rounding and fractions.
|
/third_party/icu/icu4c/source/test/intltest/ |
H A D | strtest.cpp | 459 } cases[] = { in TestStringPieceFind() local 479 for (auto& cas : cases) { in TestStringPieceFind()
|
/third_party/python/Include/internal/ |
H A D | pycore_ast.h | 283 asdl_match_case_seq *cases; member 689 stmt_ty _PyAST_Match(expr_ty subject, asdl_match_case_seq * cases, int lineno,
|
/third_party/skia/third_party/externals/tint/src/resolver/ |
H A D | entry_point_validation_test.cc | 355 static constexpr Params cases[] = { member 447 testing::ValuesIn(cases));
|
/kernel/linux/linux-5.10/arch/m68k/fpsp040/ |
H A D | setox.S | 37 | but no worse than 10% slower even in the extreme cases. 43 | but no worse than 10% slower even in the extreme cases. 59 | Step 1. Filter out extreme cases of input argument. 75 | to have a small number of cases where |X| is less than,
|
H A D | kernel_ex.S | 5 | fpu for exceptional cases detected or reported within the
|
/kernel/linux/linux-6.6/arch/m68k/fpsp040/ |
H A D | setox.S | 37 | but no worse than 10% slower even in the extreme cases. 43 | but no worse than 10% slower even in the extreme cases. 59 | Step 1. Filter out extreme cases of input argument. 75 | to have a small number of cases where |X| is less than,
|
H A D | kernel_ex.S | 5 | fpu for exceptional cases detected or reported within the
|
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/number/ |
H A D | NumberFormatterApiTest.java | 2337 Object[][] cases = { in signNearZero() 2357 for (Object[] cas : cases) { in signNearZero() 2376 Object[][][] cases = new Object[][][] { in signCoverage() 2386 for (Object[][] cas : cases) { in signCoverage() 3077 // Pass EXPECTED_MAX_INT_FRAC_SIG as the second argument so arg1 <= arg2 in expected cases in validRanges() 3088 // Pass lowerBound as the first argument so arg1 <= arg2 in expected cases in validRanges()
|
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/ |
H A D | PluralRulesTest.java | 164 // disallow screwy cases in testSyntaxRestrictions() 622 Object[][] cases = { in testBuiltInRules() 633 for (Object[] cas : cases) { in testBuiltInRules() 650 Object[][] cases = { in testSelectTrailingZeros() 663 for (Object[] cas : cases) { in testSelectTrailingZeros()
|
H A D | NumberFormatTest.java | 488 Object[][] cases = { in TestSpaceParsingStrict() 504 for (Object[] cas : cases) { in TestSpaceParsingStrict() 907 // Note: In cases where the number occurs before the currency sign, non-currency mode will parse the number in TestParseCurrency() 2055 // Test cases: in TestIllegalPatterns() 3550 int[][] cases = { { -1, 0 }, { 0, 1 }, { 1, 0 }, { 2, 0 }, { 2, 1 }, { 10, 0 } }; in TestSetMinimumIntegerDigits() 3552 if (cases.length != expectedMax.length) { in TestSetMinimumIntegerDigits() 3556 for (int i = 0; i < cases.length; i++) { in TestSetMinimumIntegerDigits() 3557 nf.setMinimumIntegerDigits(cases[i][0]); in TestSetMinimumIntegerDigits() 3558 nf.setMaximumIntegerDigits(cases[i][1]); in TestSetMinimumIntegerDigits() 3561 + "did not return an expected result for parameter " + cases[ in TestSetMinimumIntegerDigits() [all...] |
/third_party/skia/src/sksl/codegen/ |
H A D | SkSLGLSLCodeGenerator.cpp | 577 // so just replace in all cases. in writeFunctionCall() 716 // In cases like half(float), they're different types as far as SkSL is concerned but in writeCastConstructor() 1404 for (const std::unique_ptr<Statement>& stmt : s.cases()) { in writeSwitchStatement() 1453 if (s.cases().size() == 1 && !s.cases().front()->as<SwitchCase>().value()) { in writeSwitchStatement() 1456 for (const std::unique_ptr<Statement>& stmt : s.cases()) { in writeSwitchStatement()
|
/third_party/skia/third_party/externals/abseil-cpp/absl/numeric/ |
H A D | int128_test.cc | 741 TestCase cases[] = { in TEST() local 747 for (const TestCase& pair : cases) { in TEST() 816 std::pair<int64_t, int64_t> cases[]{ in TEST() 827 for (const auto& pair : cases) { in TEST() 967 // Manually calculated random large value cases in TEST() 1067 // Manually calculated cases with random large dividends in TEST()
|
/third_party/skia/third_party/externals/abseil-cpp/absl/container/ |
H A D | inlined_vector_test.cc | 1798 std::vector<V> cases; in TEST() 1807 cases.push_back(v); in TEST() 1809 cases.push_back(v); in TEST() 1812 EXPECT_TRUE(absl::VerifyTypeImplementsAbslHashCorrectly(cases)); in TEST()
|
/third_party/icu/icu4c/source/test/cintltst/ |
H A D | capitst.c | 1409 u_uastrcpy(testString1, "XFILE What subset of all possible test cases has the highest probability of detecting the most errors?"); in TestElemIter() 1410 u_uastrcpy(testString2, "Xf_ile What subset of all possible test cases has the lowest probability of detecting the least errors?"); in TestElemIter() 1831 * cases. This test tries to check this. 2026 const char* cases[] = { in TestMergeSortKeys() local 2031 uint32_t casesSize = UPRV_LENGTHOF(cases); in TestMergeSortKeys() 2047 log_verbose("Testing order of the test cases\n"); in TestMergeSortKeys() 2048 genericLocaleStarter("en", cases, casesSize); in TestMergeSortKeys() 2068 unescapedLen = u_unescape(cases[i], buffer, 256); in TestMergeSortKeys() 2111 unescapedLen = u_unescape(cases[0], buffer, 256); in TestMergeSortKeys()
|
/third_party/vk-gl-cts/modules/gles31/functional/ |
H A D | es31fTessellationGeometryInteractionTests.cpp | 3121 } cases[] = 3156 for (int ndx = 0; ndx < DE_LENGTH_OF_ARRAY(cases); ++ndx) 3157 limitGroup->addChild(new GridRenderCase(m_context, cases[ndx].name, cases[ndx].desc, cases[ndx].flags));
|
/third_party/python/Lib/test/ |
H A D | test_set.py | 1336 expected = case in self.cases 1360 cases = "==", "<=", ">=" 1368 cases = "==", "<=", ">=" 1376 cases = "!=", "<", "<=" 1384 cases = "!=", "<", "<=" 1392 cases = "!="
|
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/format/ |
H A D | NumberFormatTest.java | 491 Object[][] cases = { in TestSpaceParsingStrict() 507 for (Object[] cas : cases) { in TestSpaceParsingStrict() 910 // Note: In cases where the number occurs before the currency sign, non-currency mode will parse the number in TestParseCurrency() 2058 // Test cases: in TestIllegalPatterns() 3553 int[][] cases = { { -1, 0 }, { 0, 1 }, { 1, 0 }, { 2, 0 }, { 2, 1 }, { 10, 0 } }; in TestSetMinimumIntegerDigits() 3555 if (cases.length != expectedMax.length) { in TestSetMinimumIntegerDigits() 3559 for (int i = 0; i < cases.length; i++) { in TestSetMinimumIntegerDigits() 3560 nf.setMinimumIntegerDigits(cases[i][0]); in TestSetMinimumIntegerDigits() 3561 nf.setMaximumIntegerDigits(cases[i][1]); in TestSetMinimumIntegerDigits() 3564 + "did not return an expected result for parameter " + cases[ in TestSetMinimumIntegerDigits() [all...] |
/kernel/linux/linux-5.10/arch/arm/lib/ |
H A D | lib1funcs.S | 57 @ to save one loop in most cases.
|
/kernel/linux/linux-6.6/arch/arm/lib/ |
H A D | lib1funcs.S | 57 @ to save one loop in most cases.
|
/kernel/linux/linux-6.6/arch/s390/kernel/ |
H A D | entry.S | 242 # are some corner cases (e.g. runtime instrumentation) where ILC is unpredictable.
|