/external/skia/src/pathops/ |
H A D | SkDConicLineIntersection.cpp | 67 int horizontalIntersect(double axisIntercept, double roots[2]) { argument 69 return this->validT(conicVals, axisIntercept, roots); 72 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument 73 this->addExactHorizontalEndPoints(left, right, axisIntercept); 75 this->addNearHorizontalEndPoints(left, right, axisIntercept); 78 int count = this->horizontalIntersect(axisIntercept, roots); 83 SkOPOBJASSERT(fIntersections, close_to(pt.fY, axisIntercept, conicVals)); 135 int validT(double r[3], double axisIntercept, double roots[2]) { argument 137 double B = r[1] * fConic.fWeight - axisIntercept * fConic.fWeight + axisIntercept; 145 verticalIntersect(double axisIntercept, double roots[2]) argument 150 verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) argument [all...] |
H A D | SkDCubicLineIntersection.cpp | 167 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { argument 170 D -= axisIntercept; 174 if (!approximately_equal(calcPt.fY, axisIntercept)) { 177 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots); 184 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument 185 addExactHorizontalEndPoints(left, right, axisIntercept); 187 addNearHorizontalEndPoints(left, right, axisIntercept); 190 int count = HorizontalIntersect(fCubic, axisIntercept, roots); 193 SkDPoint pt = { fCubic.ptAtT(cubicT).fX, axisIntercept }; 230 static int VerticalIntersect(const SkDCubic& c, double axisIntercept, doubl argument 247 verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) argument [all...] |
H A D | SkDQuadLineIntersection.cpp | 188 int horizontalIntersect(double axisIntercept, double roots[2]) { argument 194 F -= axisIntercept; 198 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument 199 addExactHorizontalEndPoints(left, right, axisIntercept); 201 addNearHorizontalEndPoints(left, right, axisIntercept); 204 int roots = horizontalIntersect(axisIntercept, rootVals); 244 int verticalIntersect(double axisIntercept, double roots[2]) { argument 250 F -= axisIntercept; 254 int verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) { argument 255 addExactVerticalEndPoints(top, bottom, axisIntercept); [all...] |
H A D | SkPathOpsCubic.h | 46 double binarySearch(double min, double max, double axisIntercept, SearchAxis xAxis) const; 90 int searchRoots(double extremes[6], int extrema, double axisIntercept,
|
H A D | SkPathOpsCubic.cpp | 30 double SkDCubic::binarySearch(double min, double max, double axisIntercept, argument 36 double calcDist = calcPos - axisIntercept; 45 double lessDist = (&lessPt.fX)[xAxis] - axisIntercept; 64 double moreDist = (&morePt.fX)[xAxis] - axisIntercept; 73 calcDist = calcPos - axisIntercept; 74 } while (!approximately_equal(calcPos, axisIntercept)); 343 int SkDCubic::searchRoots(double extremeTs[6], int extrema, double axisIntercept, argument 357 double newT = binarySearch(min, max, axisIntercept, xAxis);
|
/external/skqp/src/pathops/ |
H A D | SkDConicLineIntersection.cpp | 67 int horizontalIntersect(double axisIntercept, double roots[2]) { argument 69 return this->validT(conicVals, axisIntercept, roots); 72 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument 73 this->addExactHorizontalEndPoints(left, right, axisIntercept); 75 this->addNearHorizontalEndPoints(left, right, axisIntercept); 78 int count = this->horizontalIntersect(axisIntercept, roots); 83 SkOPOBJASSERT(fIntersections, close_to(pt.fY, axisIntercept, conicVals)); 135 int validT(double r[3], double axisIntercept, double roots[2]) { argument 137 double B = r[1] * fConic.fWeight - axisIntercept * fConic.fWeight + axisIntercept; 145 verticalIntersect(double axisIntercept, double roots[2]) argument 150 verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) argument [all...] |
H A D | SkDCubicLineIntersection.cpp | 167 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { argument 170 D -= axisIntercept; 174 if (!approximately_equal(calcPt.fY, axisIntercept)) { 177 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots); 184 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument 185 addExactHorizontalEndPoints(left, right, axisIntercept); 187 addNearHorizontalEndPoints(left, right, axisIntercept); 190 int count = HorizontalIntersect(fCubic, axisIntercept, roots); 193 SkDPoint pt = { fCubic.ptAtT(cubicT).fX, axisIntercept }; 230 static int VerticalIntersect(const SkDCubic& c, double axisIntercept, doubl argument 247 verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) argument [all...] |
H A D | SkDQuadLineIntersection.cpp | 188 int horizontalIntersect(double axisIntercept, double roots[2]) { argument 194 F -= axisIntercept; 198 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument 199 addExactHorizontalEndPoints(left, right, axisIntercept); 201 addNearHorizontalEndPoints(left, right, axisIntercept); 204 int roots = horizontalIntersect(axisIntercept, rootVals); 244 int verticalIntersect(double axisIntercept, double roots[2]) { argument 250 F -= axisIntercept; 254 int verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) { argument 255 addExactVerticalEndPoints(top, bottom, axisIntercept); [all...] |
H A D | SkPathOpsCubic.h | 46 double binarySearch(double min, double max, double axisIntercept, SearchAxis xAxis) const; 90 int searchRoots(double extremes[6], int extrema, double axisIntercept,
|
H A D | SkPathOpsCubic.cpp | 30 double SkDCubic::binarySearch(double min, double max, double axisIntercept, argument 36 double calcDist = calcPos - axisIntercept; 45 double lessDist = (&lessPt.fX)[xAxis] - axisIntercept; 64 double moreDist = (&morePt.fX)[xAxis] - axisIntercept; 73 calcDist = calcPos - axisIntercept; 74 } while (!approximately_equal(calcPos, axisIntercept)); 343 int SkDCubic::searchRoots(double extremeTs[6], int extrema, double axisIntercept, argument 357 double newT = binarySearch(min, max, axisIntercept, xAxis);
|