| /external/skia/tests/ |
| PathOpsConicQuadIntersectionTest.cpp | 46 int order2 = reduce1.reduce(quad); local
47 if (order2 != 3) {
52 SkDebugf("[%d] quad order=%d\n", index, order2);
|
| PathOpsCubicConicIntersectionTest.cpp | 57 int order2 = reduce2.reduce(conic.fPts); local
62 if (order2 != 3) {
63 SkDebugf("[%d] conic order=%d\n", index, order2);
|
| PathOpsCubicQuadIntersectionTest.cpp | 67 int order2 = reduce2.reduce(quad); local
72 if (order2 != 3) {
73 SkDebugf("[%d] quad order=%d\n", iIndex, order2);
|
| PathOpsConicLineIntersectionTest.cpp | 122 int order2 = reducer.reduce(line); local
123 if (order2 < 2) {
124 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2);
|
| PathOpsCubicLineIntersectionTest.cpp | 39 int order2 = reduce2.reduce(line); local
44 if (order2 < 2) {
45 SkDebugf("[%d] line order=%d\n", iIndex, order2);
48 if (order1 == 4 && order2 == 2) {
141 int order2 = reduce2.reduce(line); local
146 if (order2 < 2) {
147 SkDebugf("[%d] line order=%d\n", iIndex, order2);
150 if (order1 == 4 && order2 == 2) {
|
| PathOpsQuadLineIntersectionTest.cpp | 123 int order2 = reducer2.reduce(line); local
128 if (order2 < 2) {
129 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2);
|
| PathOpsQuadIntersectionTest.cpp | 27 int order2 = reduce2.reduce(quad2); local
33 if (order2 < 3) {
35 SkDebugf("[%d] quad2 order=%d\n", static_cast<int>(index), order2);
38 if (order1 == 3 && order2 == 3) {
|
| PathOpsCubicIntersectionTest.cpp | 29 int order2 = reduce2.reduce(c2, SkReduceOrder::kNo_Quadratics); local
37 if (order2 < 4) {
39 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, iIndex, order2);
|
| /external/skqp/tests/ |
| PathOpsConicQuadIntersectionTest.cpp | 46 int order2 = reduce1.reduce(quad); local
47 if (order2 != 3) {
52 SkDebugf("[%d] quad order=%d\n", index, order2);
|
| PathOpsCubicConicIntersectionTest.cpp | 57 int order2 = reduce2.reduce(conic.fPts); local
62 if (order2 != 3) {
63 SkDebugf("[%d] conic order=%d\n", index, order2);
|
| PathOpsCubicQuadIntersectionTest.cpp | 67 int order2 = reduce2.reduce(quad); local
72 if (order2 != 3) {
73 SkDebugf("[%d] quad order=%d\n", iIndex, order2);
|
| PathOpsConicLineIntersectionTest.cpp | 122 int order2 = reducer.reduce(line); local
123 if (order2 < 2) {
124 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2);
|
| PathOpsCubicLineIntersectionTest.cpp | 39 int order2 = reduce2.reduce(line); local
44 if (order2 < 2) {
45 SkDebugf("[%d] line order=%d\n", iIndex, order2);
48 if (order1 == 4 && order2 == 2) {
141 int order2 = reduce2.reduce(line); local
146 if (order2 < 2) {
147 SkDebugf("[%d] line order=%d\n", iIndex, order2);
150 if (order1 == 4 && order2 == 2) {
|
| PathOpsQuadLineIntersectionTest.cpp | 123 int order2 = reducer2.reduce(line); local
128 if (order2 < 2) {
129 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2);
|
| PathOpsQuadIntersectionTest.cpp | 27 int order2 = reduce2.reduce(quad2); local
33 if (order2 < 3) {
35 SkDebugf("[%d] quad2 order=%d\n", static_cast<int>(index), order2);
38 if (order1 == 3 && order2 == 3) {
|
| PathOpsCubicIntersectionTest.cpp | 29 int order2 = reduce2.reduce(c2, SkReduceOrder::kNo_Quadratics); local
37 if (order2 < 4) {
39 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, iIndex, order2);
|
| /external/icu/icu4c/source/test/intltest/ |
| itercoll.cpp | 233 Order *order2 = getOrders(*iter, order2Length); local
234 if (orderLength != order2Length || uprv_memcmp(order, order2, orderLength * sizeof(Order)) != 0) {
238 delete[] order2;
245 order2 = getOrders(*iter, order2Length);
246 if (orderLength != order2Length || uprv_memcmp(order, order2, orderLength * sizeof(Order)) != 0) {
250 delete[] order2;
257 order2 = getOrders(*iter, order2Length);
258 if (orderLength != order2Length || uprv_memcmp(order, order2, orderLength * sizeof(Order)) != 0) {
262 delete[] order2;
269 order2 = getOrders(*iter, order2Length)
[all...] |
| apicoll.cpp | 669 int32_t order1, order2, order3; local
685 order2 = iterator2->getOffset();
686 doAssert((order1 != order2), "The order result should not be the same");
687 order2 = iterator2->next(success);
695 doAssert((order1 == order2), "The order result should be the same");
741 order2 = iterator2->next(success);
749 doAssert((order1 == order2), "The order result should be the same");
765 order1 = iterator1->next(success); order2 = iterator2->next(success); order3 = iterator3->next(success);
[all...] |
| /external/emma/core/java12/com/vladium/emma/report/lcov/ |
| ReportGenerator.java | 224 final ItemComparator order2 = m_typeSortComparators[ local
226 for (Iterator methods = cls.getChildren(order2); methods.hasNext(); )
|
| /external/emma/core/java12/com/vladium/emma/report/txt/ |
| ReportGenerator.java | 285 final ItemComparator order2 = m_typeSortComparators [MethodItem.getTypeMetadata ().getTypeID ()]; local
286 for (Iterator methods = cls.getChildren (order2); methods.hasNext (); )
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/ |
| CollationIteratorTest.java | 273 int order2[] = CollationTest.getOrders(iter); local
274 if (!Arrays.equals(order, order2)) {
282 order2 = CollationTest.getOrders(iter);
283 if (!Arrays.equals(order, order2)) {
291 order2 = CollationTest.getOrders(iter);
292 if (!Arrays.equals(order, order2)) {
300 order2 = CollationTest.getOrders(iter);
301 if (!Arrays.equals(order, order2)) {
|
| CollationAPITest.java | 311 int order1, order2, order3; local
315 order2 = iterator2.next();
328 doAssert((order1 == order2), "The order result should be the same");
361 order2 = iterator2.next();
367 doAssert((order1 == order2), "The order result should be the same");
379 order2 = iterator2.next();
[all...] |
| /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
| CollationIteratorTest.java | 270 int order2[] = CollationTest.getOrders(iter); local
271 if (!Arrays.equals(order, order2)) {
279 order2 = CollationTest.getOrders(iter);
280 if (!Arrays.equals(order, order2)) {
288 order2 = CollationTest.getOrders(iter);
289 if (!Arrays.equals(order, order2)) {
297 order2 = CollationTest.getOrders(iter);
298 if (!Arrays.equals(order, order2)) {
|
| /external/emma/core/java12/com/vladium/emma/report/html/ |
| ReportGenerator.java | 560 final ItemComparator order2 = m_typeSortComparators [MethodItem.getTypeMetadata ().getTypeID ()]; local
561 for (Iterator methods = cls.getChildren (order2); methods.hasNext (); odd = ! odd)
[all...] |
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/format/ |
| DateTimeGeneratorTest.java | 696 DateOrder order2 = getOrdering(style2, uLocale); local
697 if (!order1.hasSameOrderAs(order2)) {
700 logln(showOrderComparison(uLocale, style1, style2, order1, order2));
704 private String showOrderComparison(ULocale uLocale, int style1, int style2, DateOrder order1, DateOrder order2) {
[all...] |
