/external/skia/tests/ |
D | PathOpsCubicLineIntersectionTest.cpp | 39 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()
|
D | PathOpsCubicQuadIntersectionTest.cpp | 67 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()
|
D | PathOpsConicQuadIntersectionTest.cpp | 46 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()
|
D | PathOpsCubicConicIntersectionTest.cpp | 57 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()
|
D | PathOpsQuadLineIntersectionTest.cpp | 123 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()
|
D | PathOpsConicLineIntersectionTest.cpp | 122 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()
|
D | PathOpsQuadIntersectionTest.cpp | 27 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()
|
D | PathOpsCubicIntersectionTest.cpp | 29 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()
|
/external/skqp/tests/ |
D | PathOpsCubicLineIntersectionTest.cpp | 39 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()
|
D | PathOpsCubicQuadIntersectionTest.cpp | 67 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()
|
D | PathOpsConicQuadIntersectionTest.cpp | 46 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()
|
D | PathOpsCubicConicIntersectionTest.cpp | 57 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()
|
D | PathOpsQuadLineIntersectionTest.cpp | 123 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()
|
D | PathOpsConicLineIntersectionTest.cpp | 122 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()
|
D | PathOpsQuadIntersectionTest.cpp | 27 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()
|
D | PathOpsCubicIntersectionTest.cpp | 29 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()
|
/external/icu/icu4c/source/test/intltest/ |
D | itercoll.cpp | 233 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 …]
|
D | apicoll.cpp | 669 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()
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/ |
D | CollationIteratorTest.java | 273 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()
|
D | CollationAPITest.java | 311 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()
|
/external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
D | CollationIteratorTest.java | 270 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()
|
D | CollationAPITest.java | 308 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()
|
/external/emma/core/java12/com/vladium/emma/report/lcov/ |
D | ReportGenerator.java | 224 final ItemComparator order2 = m_typeSortComparators[ in emitFileCoverage() local 226 for (Iterator methods = cls.getChildren(order2); methods.hasNext(); ) in emitFileCoverage()
|
/external/cldr/tools/java/org/unicode/cldr/test/ |
D | DateOrder.java | 144 DateOrder order2 = entry2.getKey(); in getOrderingInfo() 148 … System.out.println(order2 + "\t" + value1 + "\t" + value2 + "\t" + locale1 + "\t" + locale2 in getOrderingInfo()
|
/external/emma/core/java12/com/vladium/emma/report/txt/ |
D | ReportGenerator.java | 285 …final ItemComparator order2 = m_typeSortComparators [MethodItem.getTypeMetadata ().getTypeID ()]; … in visit() local 286 for (Iterator methods = cls.getChildren (order2); methods.hasNext (); ) in visit()
|