/external/chromium_org/third_party/skia/experimental/Intersection/ |
Extrema.h | 7 int findExtrema(double a, double b, double c, double d, double tValues[2]); 8 int findExtrema(double a, double b, double c, double tValue[1]);
|
QuadraticBounds.cpp | 13 if (findExtrema(quad[0].x, quad[1].x, quad[2].x, &leftT) 30 roots = findExtrema(quad[0].x, quad[1].x, quad[2].x, tValues); 33 roots += findExtrema(quad[0].y, quad[1].y, quad[2].y, &tValues[roots]);
|
CubicBounds.cpp | 19 int results = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, leftTs); 49 roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); 52 roots += findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, &tValues[roots]);
|
Extrema.cpp | 60 int findExtrema(double a, double b, double c, double d, double tValues[2]) 75 int findExtrema(double a, double b, double c, double tValue[1])
|
QuadraticReduceOrder.cpp | 34 if (findExtrema(quad[0].y, quad[1].y, quad[2].y, &tValue)) { 55 if (findExtrema(quad[0].x, quad[1].x, quad[2].x, &tValue)) { 99 root = findExtrema(quad[0].x, quad[1].x, quad[2].x, &tValue); 101 root = findExtrema(quad[0].y, quad[1].y, quad[2].y, &tValue);
|
CubicReduceOrder.cpp | 36 int roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues); 59 int roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); 130 roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); 132 roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues);
|
QuadraticUtilities.cpp | 58 if (findExtrema(sub[0].y, sub[1].y, sub[2].y, &extremeT)) {
|
CubicUtilities.cpp | 389 int roots = findExtrema(sub[0].y, sub[1].y, sub[2].y, sub[3].y, extremeTs);
|
/external/skia/experimental/Intersection/ |
Extrema.h | 7 int findExtrema(double a, double b, double c, double d, double tValues[2]); 8 int findExtrema(double a, double b, double c, double tValue[1]);
|
QuadraticBounds.cpp | 13 if (findExtrema(quad[0].x, quad[1].x, quad[2].x, &leftT) 30 roots = findExtrema(quad[0].x, quad[1].x, quad[2].x, tValues); 33 roots += findExtrema(quad[0].y, quad[1].y, quad[2].y, &tValues[roots]);
|
CubicBounds.cpp | 19 int results = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, leftTs); 49 roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); 52 roots += findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, &tValues[roots]);
|
Extrema.cpp | 60 int findExtrema(double a, double b, double c, double d, double tValues[2]) 75 int findExtrema(double a, double b, double c, double tValue[1])
|
QuadraticReduceOrder.cpp | 34 if (findExtrema(quad[0].y, quad[1].y, quad[2].y, &tValue)) { 55 if (findExtrema(quad[0].x, quad[1].x, quad[2].x, &tValue)) { 99 root = findExtrema(quad[0].x, quad[1].x, quad[2].x, &tValue); 101 root = findExtrema(quad[0].y, quad[1].y, quad[2].y, &tValue);
|
CubicReduceOrder.cpp | 36 int roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues); 59 int roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); 130 roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); 132 roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues);
|
QuadraticUtilities.cpp | 58 if (findExtrema(sub[0].y, sub[1].y, sub[2].y, &extremeT)) {
|
CubicUtilities.cpp | 389 int roots = findExtrema(sub[0].y, sub[1].y, sub[2].y, sub[3].y, extremeTs);
|