Home
last modified time | relevance | path

Searched refs:order2 (Results 1 – 25 of 28) sorted by relevance

12

/third_party/skia/tests/
DPathOpsCubicLineIntersectionTest.cpp39 int order2 = reduce2.reduce(line); in testFail() local
44 if (order2 < 2) { in testFail()
45 SkDebugf("[%d] line order=%d\n", iIndex, order2); in testFail()
48 if (order1 == 4 && order2 == 2) { in testFail()
141 int order2 = reduce2.reduce(line); in testOne() local
146 if (order2 < 2) { in testOne()
147 SkDebugf("[%d] line order=%d\n", iIndex, order2); in testOne()
150 if (order1 == 4 && order2 == 2) { in testOne()
DPathOpsCubicConicIntersectionTest.cpp57 int order2 = reduce2.reduce(conic.fPts); in cubicConicIntersection() local
62 if (order2 != 3) { in cubicConicIntersection()
63 SkDebugf("[%d] conic order=%d\n", index, order2); in cubicConicIntersection()
DPathOpsCubicQuadIntersectionTest.cpp67 int order2 = reduce2.reduce(quad); in cubicQuadIntersection() local
72 if (order2 != 3) { in cubicQuadIntersection()
73 SkDebugf("[%d] quad order=%d\n", iIndex, order2); in cubicQuadIntersection()
DPathOpsConicQuadIntersectionTest.cpp46 int order2 = reduce1.reduce(quad); in conicQuadIntersection() local
47 if (order2 != 3) { in conicQuadIntersection()
52 SkDebugf("[%d] quad order=%d\n", index, order2); in conicQuadIntersection()
DPathOpsQuadLineIntersectionTest.cpp122 int order2 = reducer2.reduce(line); in DEF_TEST() local
127 if (order2 < 2) { in DEF_TEST()
128 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2); in DEF_TEST()
DPathOpsConicLineIntersectionTest.cpp121 int order2 = reducer.reduce(line); in DEF_TEST() local
122 if (order2 < 2) { in DEF_TEST()
123 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2); in DEF_TEST()
DPathOpsQuadIntersectionTest.cpp27 int order2 = reduce2.reduce(quad2); in standardTestCases() local
33 if (order2 < 3) { in standardTestCases()
35 SkDebugf("[%d] quad2 order=%d\n", static_cast<int>(index), order2); in standardTestCases()
38 if (order1 == 3 && order2 == 3) { in standardTestCases()
DPathOpsCubicIntersectionTest.cpp31 int order2 = reduce2.reduce(c2, SkReduceOrder::kNo_Quadratics); in standardTestCases() local
39 if (order2 < 4) { in standardTestCases()
41 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, iIndex, order2); in standardTestCases()
/third_party/flutter/skia/tests/
DPathOpsCubicLineIntersectionTest.cpp39 int order2 = reduce2.reduce(line); in testFail() local
44 if (order2 < 2) { in testFail()
45 SkDebugf("[%d] line order=%d\n", iIndex, order2); in testFail()
48 if (order1 == 4 && order2 == 2) { in testFail()
141 int order2 = reduce2.reduce(line); in testOne() local
146 if (order2 < 2) { in testOne()
147 SkDebugf("[%d] line order=%d\n", iIndex, order2); in testOne()
150 if (order1 == 4 && order2 == 2) { in testOne()
DPathOpsConicQuadIntersectionTest.cpp46 int order2 = reduce1.reduce(quad); in conicQuadIntersection() local
47 if (order2 != 3) { in conicQuadIntersection()
52 SkDebugf("[%d] quad order=%d\n", index, order2); in conicQuadIntersection()
DPathOpsCubicConicIntersectionTest.cpp57 int order2 = reduce2.reduce(conic.fPts); in cubicConicIntersection() local
62 if (order2 != 3) { in cubicConicIntersection()
63 SkDebugf("[%d] conic order=%d\n", index, order2); in cubicConicIntersection()
DPathOpsCubicQuadIntersectionTest.cpp67 int order2 = reduce2.reduce(quad); in cubicQuadIntersection() local
72 if (order2 != 3) { in cubicQuadIntersection()
73 SkDebugf("[%d] quad order=%d\n", iIndex, order2); in cubicQuadIntersection()
DPathOpsQuadLineIntersectionTest.cpp123 int order2 = reducer2.reduce(line); in DEF_TEST() local
128 if (order2 < 2) { in DEF_TEST()
129 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2); in DEF_TEST()
DPathOpsConicLineIntersectionTest.cpp122 int order2 = reducer.reduce(line); in DEF_TEST() local
123 if (order2 < 2) { in DEF_TEST()
124 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2); in DEF_TEST()
DPathOpsQuadIntersectionTest.cpp27 int order2 = reduce2.reduce(quad2); in standardTestCases() local
33 if (order2 < 3) { in standardTestCases()
35 SkDebugf("[%d] quad2 order=%d\n", static_cast<int>(index), order2); in standardTestCases()
38 if (order1 == 3 && order2 == 3) { in standardTestCases()
DPathOpsCubicIntersectionTest.cpp29 int order2 = reduce2.reduce(c2, SkReduceOrder::kNo_Quadratics); in standardTestCases() local
37 if (order2 < 4) { in standardTestCases()
39 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, iIndex, order2); in standardTestCases()
/third_party/icu/icu4c/source/test/intltest/
Ditercoll.cpp233 Order *order2 = getOrders(*iter, order2Length); in TestOffset() local
234 … if (orderLength != order2Length || uprv_memcmp(order, order2, orderLength * sizeof(Order)) != 0) { in TestOffset()
238 delete[] order2; in TestOffset()
245 order2 = getOrders(*iter, order2Length); in TestOffset()
246 … if (orderLength != order2Length || uprv_memcmp(order, order2, orderLength * sizeof(Order)) != 0) { in TestOffset()
250 delete[] order2; in TestOffset()
257 order2 = getOrders(*iter, order2Length); in TestOffset()
258 … if (orderLength != order2Length || uprv_memcmp(order, order2, orderLength * sizeof(Order)) != 0) { in TestOffset()
262 delete[] order2; in TestOffset()
269 order2 = getOrders(*iter, order2Length); in TestOffset()
[all …]
Dapicoll.cpp669 int32_t order1, order2, order3; in TestElemIter() local
685 order2 = iterator2->getOffset(); in TestElemIter()
686 doAssert((order1 != order2), "The order result should not be the same"); in TestElemIter()
687 order2 = iterator2->next(success); in TestElemIter()
695 doAssert((order1 == order2), "The order result should be the same"); in TestElemIter()
741 order2 = iterator2->next(success); in TestElemIter()
749 doAssert((order1 == order2), "The order result should be the same"); in TestElemIter()
765 …order1 = iterator1->next(success); order2 = iterator2->next(success); order3 = iterator3->next(suc… in TestElemIter()
/third_party/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/
DCollationIteratorTest.java270 int order2[] = CollationTest.getOrders(iter); in TestOffset() local
271 if (!Arrays.equals(order, order2)) { in TestOffset()
279 order2 = CollationTest.getOrders(iter); in TestOffset()
280 if (!Arrays.equals(order, order2)) { in TestOffset()
288 order2 = CollationTest.getOrders(iter); in TestOffset()
289 if (!Arrays.equals(order, order2)) { in TestOffset()
297 order2 = CollationTest.getOrders(iter); in TestOffset()
298 if (!Arrays.equals(order, order2)) { in TestOffset()
DCollationAPITest.java308 int order1, order2, order3; in TestElemIter() local
312 order2 = iterator2.next(); in TestElemIter()
325 doAssert((order1 == order2), "The order result should be the same"); in TestElemIter()
358 order2 = iterator2.next(); in TestElemIter()
364 doAssert((order1 == order2), "The order result should be the same"); in TestElemIter()
376 order2 = iterator2.next(); in TestElemIter()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/collator/
DCollationIteratorTest.java273 int order2[] = CollationTest.getOrders(iter); in TestOffset() local
274 if (!Arrays.equals(order, order2)) { in TestOffset()
282 order2 = CollationTest.getOrders(iter); in TestOffset()
283 if (!Arrays.equals(order, order2)) { in TestOffset()
291 order2 = CollationTest.getOrders(iter); in TestOffset()
292 if (!Arrays.equals(order, order2)) { in TestOffset()
300 order2 = CollationTest.getOrders(iter); in TestOffset()
301 if (!Arrays.equals(order, order2)) { in TestOffset()
DCollationAPITest.java311 int order1, order2, order3; in TestElemIter() local
315 order2 = iterator2.next(); in TestElemIter()
328 doAssert((order1 == order2), "The order result should be the same"); in TestElemIter()
361 order2 = iterator2.next(); in TestElemIter()
367 doAssert((order1 == order2), "The order result should be the same"); in TestElemIter()
379 order2 = iterator2.next(); in TestElemIter()
/third_party/node/deps/npm/node_modules/object-assign/
Dindex.js41 var order2 = Object.getOwnPropertyNames(test2).map(function (n) {
44 if (order2.join('') !== '0123456789') {
/third_party/boost/libs/endian/doc/endian/
Dconversion.adoc89 order order1, order order2) noexcept;
112 order order1, order order2) noexcept;
348 order order1, order order2) noexcept;
354 `order1 == order2? x: endian_reverse(x)`.
429 order order1, order order2) noexcept;
435 If `order1 == order2` then `endian_reverse_inplace(x)`.
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/format/
DDateTimeGeneratorTest.java716 DateOrder order2 = getOrdering(style2, uLocale); in checkCompatible() local
717 if (!order1.hasSameOrderAs(order2)) { in checkCompatible()
720 logln(showOrderComparison(uLocale, style1, style2, order1, order2)); in checkCompatible()
724 … showOrderComparison(ULocale uLocale, int style1, int style2, DateOrder order1, DateOrder order2) { in showOrderComparison() argument
729 + DATE_STYLE_NAMES[style2] + ": " + order2 + ", <" + pattern2 + ">; " ; in showOrderComparison()

12