/external/chromium_org/third_party/skia/src/pathops/ |
SkDCubicToQuads.cpp | 117 // it would still take the prechopped cubic for reduce order and find cubic inflections 125 int inflections = findInflections(inflectT); local 126 SkASSERT(inflections <= 2); 128 inflections += findMaxCurvature(&inflectT[inflections]); 129 SkASSERT(inflections <= 5); 131 SkTQSort<double>(inflectT, &inflectT[inflections - 1]); 134 while (inflections && approximately_less_than_zero(inflectT[0])) { 135 memmove(inflectT, &inflectT[1], sizeof(inflectT[0]) * --inflections); 139 while (next < inflections) { [all...] |
SkPathOpsDebug.cpp | 331 double inflections[2]; local 332 return dst.findInflections(inflections);
|
SkOpSegment.cpp | [all...] |
/external/skia/src/pathops/ |
SkDCubicToQuads.cpp | 117 // it would still take the prechopped cubic for reduce order and find cubic inflections 125 int inflections = findInflections(inflectT); local 126 SkASSERT(inflections <= 2); 128 inflections += findMaxCurvature(&inflectT[inflections]); 129 SkASSERT(inflections <= 5); 131 SkTQSort<double>(inflectT, &inflectT[inflections - 1]); 134 while (inflections && approximately_less_than_zero(inflectT[0])) { 135 memmove(inflectT, &inflectT[1], sizeof(inflectT[0]) * --inflections); 139 while (next < inflections) { [all...] |
SkPathOpsDebug.cpp | 330 double inflections[2]; local 331 return dst.findInflections(inflections);
|
SkOpSegment.cpp | [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
CubicToQuadratics.cpp | 143 // it would still take the prechopped cubic for reduce order and find cubic inflections 152 int inflections = find_cubic_inflections(cubic, inflectT); 153 SkASSERT(inflections <= 2); 155 inflections += find_cubic_max_curvature(cubic, &inflectT[inflections]); 156 SkASSERT(inflections <= 5); 158 QSort<double>(inflectT, &inflectT[inflections - 1]); 161 while (inflections && approximately_less_than_zero(inflectT[0])) { 162 memcpy(inflectT, &inflectT[1], sizeof(inflectT[0]) * --inflections); 167 if (next >= inflections) { [all...] |
/external/skia/experimental/Intersection/ |
CubicToQuadratics.cpp | 143 // it would still take the prechopped cubic for reduce order and find cubic inflections 152 int inflections = find_cubic_inflections(cubic, inflectT); 153 SkASSERT(inflections <= 2); 155 inflections += find_cubic_max_curvature(cubic, &inflectT[inflections]); 156 SkASSERT(inflections <= 5); 158 QSort<double>(inflectT, &inflectT[inflections - 1]); 161 while (inflections && approximately_less_than_zero(inflectT[0])) { 162 memcpy(inflectT, &inflectT[1], sizeof(inflectT[0]) * --inflections); 167 if (next >= inflections) { [all...] |
/external/chromium_org/third_party/skia/tests/ |
PathOpsTestCommon.cpp | 92 int inflections = cubic.findInflections(tInflects); local 93 if (inflections > 1 && tInflects[0] > tInflects[1]) { 97 for (int index = 0; index <= inflections; ++index) { 98 double hi = index < inflections ? tInflects[index] : 1;
|
/external/skia/tests/ |
PathOpsTestCommon.cpp | 92 int inflections = cubic.findInflections(tInflects); local 93 if (inflections > 1 && tInflects[0] > tInflects[1]) { 97 for (int index = 0; index <= inflections; ++index) { 98 double hi = index < inflections ? tInflects[index] : 1;
|