Home
last modified time | relevance | path

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

/external/skia/tests/
DPathOpsCubicLineIntersectionTest.cpp53 int order2 = reduce2.reduce(line); in testOne() local
58 if (order2 < 2) { in testOne()
59 SkDebugf("[%d] line order=%d\n", iIndex, order2); in testOne()
62 if (order1 == 4 && order2 == 2) { in testOne()
DPathOpsCubicQuadIntersectionTest.cpp63 int order2 = reduce2.reduce(quad); in PathOpsCubicQuadIntersectionTest() local
68 if (order2 != 3) { in PathOpsCubicQuadIntersectionTest()
69 SkDebugf("[%d] quad order=%d\n", iIndex, order2); in PathOpsCubicQuadIntersectionTest()
DPathOpsQuadLineIntersectionTest.cpp113 int order2 = reducer2.reduce(line); in PathOpsQuadLineIntersectionTest() local
118 if (order2 < 2) { in PathOpsQuadLineIntersectionTest()
119 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2); in PathOpsQuadLineIntersectionTest()
DPathOpsQuadIntersectionTest.cpp23 int order2 = reduce2.reduce(quad2); in standardTestCases() local
29 if (order2 < 3) { in standardTestCases()
31 SkDebugf("[%d] quad2 order=%d\n", static_cast<int>(index), order2); in standardTestCases()
34 if (order1 == 3 && order2 == 3) { in standardTestCases()
DPathOpsCubicIntersectionTest.cpp23 int order2 = reduce2.reduce(cubic2, SkReduceOrder::kNo_Quadratics); in standardTestCases() local
31 if (order2 < 4) { in standardTestCases()
33 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, iIndex, order2); in standardTestCases()
/external/libvorbis/lib/
Dlsp.c406 int order2=(m+1)>>1; in vorbis_lpc_to_lsp() local
408 float *g1=alloca(sizeof(*g1)*(order2+1)); in vorbis_lpc_to_lsp()
409 float *g2=alloca(sizeof(*g2)*(order2+1)); in vorbis_lpc_to_lsp()
410 float *g1r=alloca(sizeof(*g1r)*(order2+1)); in vorbis_lpc_to_lsp()
411 float *g2r=alloca(sizeof(*g2r)*(order2+1)); in vorbis_lpc_to_lsp()
/external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/
DCollationElementIteratorTest.java124 int order2 = iterator2.next(); in testPrimaryOrder() local
125 int pOrder2 = CollationElementIterator.primaryOrder(order2); in testPrimaryOrder()
/external/chromium_org/chrome/browser/resources/file_manager/background/js/
Dvolume_manager.js190 var order2 = volumeManagerUtil.volumeListOrder_.indexOf(
192 if (order1 !== order2)
193 return order1 < order2 ? -1 : 1;
/external/skia/src/pathops/
DSkDCubicIntersection.cpp60 int order2, SkIntersections& i) { in intersectWithOrder() argument
61 if (order1 == 3 && order2 == 3) { in intersectWithOrder()
63 } else if (order1 <= 2 && order2 <= 2) { in intersectWithOrder()
65 } else if (order1 == 3 && order2 <= 2) { in intersectWithOrder()
68 SkASSERT(order1 <= 2 && order2 == 3); in intersectWithOrder()
/external/chromium_org/third_party/skia/src/pathops/
DSkDCubicIntersection.cpp60 int order2, SkIntersections& i) { in intersectWithOrder() argument
61 if (order1 == 3 && order2 == 3) { in intersectWithOrder()
63 } else if (order1 <= 2 && order2 <= 2) { in intersectWithOrder()
65 } else if (order1 == 3 && order2 <= 2) { in intersectWithOrder()
68 SkASSERT(order1 <= 2 && order2 == 3); in intersectWithOrder()
/external/emma/core/java12/com/vladium/emma/report/lcov/
DReportGenerator.java224 final ItemComparator order2 = m_typeSortComparators[ in emitFileCoverage() local
226 for (Iterator methods = cls.getChildren(order2); methods.hasNext(); ) in emitFileCoverage()
/external/emma/core/java12/com/vladium/emma/report/txt/
DReportGenerator.java285 …final ItemComparator order2 = m_typeSortComparators [MethodItem.getTypeMetadata ().getTypeID ()]; … in visit() local
286 for (Iterator methods = cls.getChildren (order2); methods.hasNext (); ) in visit()
/external/chromium_org/third_party/icu/source/test/intltest/
Dapicoll.cpp677 int32_t order1, order2, order3; in TestElemIter() local
693 order2 = iterator2->getOffset(); in TestElemIter()
694 doAssert((order1 != order2), "The order result should not be the same"); in TestElemIter()
695 order2 = iterator2->next(success); in TestElemIter()
703 doAssert((order1 == order2), "The order result should be the same"); in TestElemIter()
749 order2 = iterator2->next(success); in TestElemIter()
757 doAssert((order1 == order2), "The order result should be the same"); in TestElemIter()
773 …order1 = iterator1->next(success); order2 = iterator2->next(success); order3 = iterator3->next(suc… in TestElemIter()
/external/icu4c/test/intltest/
Dapicoll.cpp686 int32_t order1, order2, order3; in TestElemIter() local
702 order2 = iterator2->getOffset(); in TestElemIter()
703 doAssert((order1 != order2), "The order result should not be the same"); in TestElemIter()
704 order2 = iterator2->next(success); in TestElemIter()
712 doAssert((order1 == order2), "The order result should be the same"); in TestElemIter()
758 order2 = iterator2->next(success); in TestElemIter()
766 doAssert((order1 == order2), "The order result should be the same"); in TestElemIter()
782 …order1 = iterator1->next(success); order2 = iterator2->next(success); order3 = iterator3->next(suc… in TestElemIter()
/external/icu4c/test/cintltst/
Dcapitst.c1274 int32_t order1, order2, order3; in TestElemIter() local
1336 order2=ucol_getOffset(iterator2); in TestElemIter()
1337 doAssert((order1 != order2), "The first iterator advance failed"); in TestElemIter()
1338 order2 = ucol_next(iterator2, &status); in TestElemIter()
1349 …doAssert((order1 == order2), "The second iterator advance failed should be the same as first one"); in TestElemIter()
/external/chromium_org/third_party/icu/source/test/cintltst/
Dcapitst.c1200 int32_t order1, order2, order3; in TestElemIter() local
1262 order2=ucol_getOffset(iterator2); in TestElemIter()
1263 doAssert((order1 != order2), "The first iterator advance failed"); in TestElemIter()
1264 order2 = ucol_next(iterator2, &status); in TestElemIter()
1275 …doAssert((order1 == order2), "The second iterator advance failed should be the same as first one"); in TestElemIter()
/external/emma/core/java12/com/vladium/emma/report/html/
DReportGenerator.java560 …final ItemComparator order2 = m_typeSortComparators [MethodItem.getTypeMetadata ().getTypeID ()]; … in visit() local
561 … for (Iterator methods = cls.getChildren (order2); methods.hasNext (); odd = ! odd) in visit()