HomeSort by relevance Sort by last modified time
    Searched defs:order2 (Results 1 - 25 of 36) sorted by null

1 2

  /external/chromium_org/third_party/skia/experimental/Intersection/
CubicBezierClip_Test.cpp 18 int order2 = reduceOrder(cubic2, reduce2, kReduceOrder_NoQuadraticsAllowed, local
23 if (order2 < 4) {
24 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, (int) index, order2);
26 if (order1 == 4 && order2 == 4) {
QuadraticBezierClip_Test.cpp 51 int order2 = reduceOrder(quad2, reduce2, kReduceOrder_TreatAsFill); local
55 if (order2 < 3) {
56 SkDebugf("%s [%d] quad2 order=%d\n", __FUNCTION__, (int)index, order2);
58 if (order1 == 3 && order2 == 3) {
LineCubicIntersection_Test.cpp 32 int order2 = reduceOrder(line, reduce2); local
36 if (order2 < 2) {
37 printf("[%d] line order=%d\n", (int) index, order2);
39 if (order1 == 4 && order2 == 2) {
LineQuadraticIntersection_Test.cpp 99 int order2 = reduceOrder(line, reduce2); local
104 if (order2 < 2) {
105 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, (int) index, order2);
QuadraticIntersection_Test.cpp 24 int order2 = reduceOrder(quad2, reduce2, kReduceOrder_TreatAsFill); local
28 if (order2 < 3) {
29 printf("[%d] quad2 order=%d\n", (int) index, order2);
31 if (order1 == 3 && order2 == 3) {
  /external/skia/experimental/Intersection/
CubicBezierClip_Test.cpp 18 int order2 = reduceOrder(cubic2, reduce2, kReduceOrder_NoQuadraticsAllowed, local
23 if (order2 < 4) {
24 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, (int) index, order2);
26 if (order1 == 4 && order2 == 4) {
QuadraticBezierClip_Test.cpp 51 int order2 = reduceOrder(quad2, reduce2, kReduceOrder_TreatAsFill); local
55 if (order2 < 3) {
56 SkDebugf("%s [%d] quad2 order=%d\n", __FUNCTION__, (int)index, order2);
58 if (order1 == 3 && order2 == 3) {
LineCubicIntersection_Test.cpp 32 int order2 = reduceOrder(line, reduce2); local
36 if (order2 < 2) {
37 printf("[%d] line order=%d\n", (int) index, order2);
39 if (order1 == 4 && order2 == 2) {
LineQuadraticIntersection_Test.cpp 99 int order2 = reduceOrder(line, reduce2); local
104 if (order2 < 2) {
105 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, (int) index, order2);
QuadraticIntersection_Test.cpp 24 int order2 = reduceOrder(quad2, reduce2, kReduceOrder_TreatAsFill); local
28 if (order2 < 3) {
29 printf("[%d] quad2 order=%d\n", (int) index, order2);
31 if (order1 == 3 && order2 == 3) {
  /external/chromium_org/third_party/skia/tests/
PathOpsCubicLineIntersectionTest.cpp 35 int order2 = reduce2.reduce(line); local
40 if (order2 < 2) {
41 SkDebugf("[%d] line order=%d\n", iIndex, order2);
44 if (order1 == 4 && order2 == 2) {
127 int order2 = reduce2.reduce(line); local
132 if (order2 < 2) {
133 SkDebugf("[%d] line order=%d\n", iIndex, order2);
136 if (order1 == 4 && order2 == 2) {
PathOpsCubicQuadIntersectionTest.cpp 69 int order2 = reduce2.reduce(quad); local
74 if (order2 != 3) {
75 SkDebugf("[%d] quad order=%d\n", iIndex, order2);
PathOpsQuadLineIntersectionTest.cpp 115 int order2 = reducer2.reduce(line); local
120 if (order2 < 2) {
121 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2);
PathOpsQuadIntersectionTest.cpp 23 int order2 = reduce2.reduce(quad2); local
29 if (order2 < 3) {
31 SkDebugf("[%d] quad2 order=%d\n", static_cast<int>(index), order2);
34 if (order1 == 3 && order2 == 3) {
PathOpsCubicIntersectionTest.cpp 23 int order2 = reduce2.reduce(cubic2, SkReduceOrder::kNo_Quadratics); local
31 if (order2 < 4) {
33 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, iIndex, order2);
  /external/skia/tests/
PathOpsCubicLineIntersectionTest.cpp 35 int order2 = reduce2.reduce(line); local
40 if (order2 < 2) {
41 SkDebugf("[%d] line order=%d\n", iIndex, order2);
44 if (order1 == 4 && order2 == 2) {
127 int order2 = reduce2.reduce(line); local
132 if (order2 < 2) {
133 SkDebugf("[%d] line order=%d\n", iIndex, order2);
136 if (order1 == 4 && order2 == 2) {
PathOpsCubicQuadIntersectionTest.cpp 69 int order2 = reduce2.reduce(quad); local
74 if (order2 != 3) {
75 SkDebugf("[%d] quad order=%d\n", iIndex, order2);
PathOpsQuadLineIntersectionTest.cpp 115 int order2 = reducer2.reduce(line); local
120 if (order2 < 2) {
121 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2);
PathOpsQuadIntersectionTest.cpp 23 int order2 = reduce2.reduce(quad2); local
29 if (order2 < 3) {
31 SkDebugf("[%d] quad2 order=%d\n", static_cast<int>(index), order2);
34 if (order1 == 3 && order2 == 3) {
PathOpsCubicIntersectionTest.cpp 23 int order2 = reduce2.reduce(cubic2, SkReduceOrder::kNo_Quadratics); local
31 if (order2 < 4) {
33 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...]
  /external/libvorbis/lib/
lsp.c 406 int order2=(m+1)>>1; local
408 float *g1=alloca(sizeof(*g1)*(order2+1));
409 float *g2=alloca(sizeof(*g2)*(order2+1));
410 float *g1r=alloca(sizeof(*g1r)*(order2+1));
411 float *g2r=alloca(sizeof(*g2r)*(order2+1));
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/text/
CollationElementIteratorTest.java 145 int order2 = iterator2.next(); local
146 int pOrder2 = CollationElementIterator.primaryOrder(order2);
  /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 (); )

Completed in 334 milliseconds

1 2