Searched defs:axisIntercept (Results 1 - 12 of 12) sorted by relevance

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DLineUtilities.cpp10 bool implicitLine(const _Line& line, double& slope, double& axisIntercept) { argument
16 axisIntercept = line[0].y - slope * line[0].x;
19 axisIntercept = line[0].x - slope * line[0].y;
H A DLineCubicIntersection.cpp118 int horizontalIntersect(double axisIntercept, double roots[3]) { argument
121 D -= axisIntercept;
125 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument
126 addHorizontalEndPoints(left, right, axisIntercept);
128 int roots = horizontalIntersect(axisIntercept, rootVals);
144 int verticalIntersect(double axisIntercept, double roots[3]) { argument
147 D -= axisIntercept;
151 int verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) { argument
152 addVerticalEndPoints(top, bottom, axisIntercept);
154 int roots = verticalIntersect(axisIntercept, rootVal
[all...]
H A DLineQuadraticIntersection.cpp146 int horizontalIntersect(double axisIntercept, double roots[2]) { argument
152 F -= axisIntercept;
156 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument
157 addHorizontalEndPoints(left, right, axisIntercept);
159 int roots = horizontalIntersect(axisIntercept, rootVals);
175 int verticalIntersect(double axisIntercept, double roots[2]) { argument
181 F -= axisIntercept;
185 int verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) { argument
186 addVerticalEndPoints(top, bottom, axisIntercept);
188 int roots = verticalIntersect(axisIntercept, rootVal
[all...]
/external/skia/experimental/Intersection/
H A DLineUtilities.cpp10 bool implicitLine(const _Line& line, double& slope, double& axisIntercept) { argument
16 axisIntercept = line[0].y - slope * line[0].x;
19 axisIntercept = line[0].x - slope * line[0].y;
H A DLineCubicIntersection.cpp118 int horizontalIntersect(double axisIntercept, double roots[3]) { argument
121 D -= axisIntercept;
125 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument
126 addHorizontalEndPoints(left, right, axisIntercept);
128 int roots = horizontalIntersect(axisIntercept, rootVals);
144 int verticalIntersect(double axisIntercept, double roots[3]) { argument
147 D -= axisIntercept;
151 int verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) { argument
152 addVerticalEndPoints(top, bottom, axisIntercept);
154 int roots = verticalIntersect(axisIntercept, rootVal
[all...]
H A DLineQuadraticIntersection.cpp146 int horizontalIntersect(double axisIntercept, double roots[2]) { argument
152 F -= axisIntercept;
156 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument
157 addHorizontalEndPoints(left, right, axisIntercept);
159 int roots = horizontalIntersect(axisIntercept, rootVals);
175 int verticalIntersect(double axisIntercept, double roots[2]) { argument
181 F -= axisIntercept;
185 int verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) { argument
186 addVerticalEndPoints(top, bottom, axisIntercept);
188 int roots = verticalIntersect(axisIntercept, rootVal
[all...]
/external/chromium_org/third_party/skia/src/pathops/
H A DSkDQuadLineIntersection.cpp160 int horizontalIntersect(double axisIntercept, double roots[2]) { argument
166 F -= axisIntercept;
170 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument
171 addExactHorizontalEndPoints(left, right, axisIntercept);
173 addNearHorizontalEndPoints(left, right, axisIntercept);
176 int roots = horizontalIntersect(axisIntercept, rootVals);
191 int verticalIntersect(double axisIntercept, double roots[2]) { argument
197 F -= axisIntercept;
201 int verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) { argument
202 addExactVerticalEndPoints(top, bottom, axisIntercept);
[all...]
H A DSkDCubicLineIntersection.cpp163 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { argument
166 D -= axisIntercept;
170 if (!approximately_equal(calcPt.fY, axisIntercept)) {
173 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots);
180 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument
181 addExactHorizontalEndPoints(left, right, axisIntercept);
183 addNearHorizontalEndPoints(left, right, axisIntercept);
186 int count = HorizontalIntersect(fCubic, axisIntercept, roots);
191 pt.fY = axisIntercept;
203 static int VerticalIntersect(const SkDCubic& c, double axisIntercept, doubl argument
220 verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) argument
[all...]
H A DSkPathOpsCubic.cpp18 double SkDCubic::binarySearch(double min, double max, double axisIntercept, argument
24 double calcDist = calcPos - axisIntercept;
33 double lessDist = (&lessPt.fX)[xAxis] - axisIntercept;
50 double moreDist = (&morePt.fX)[xAxis] - axisIntercept;
59 calcDist = calcPos - axisIntercept;
60 } while (!approximately_equal(calcPos, axisIntercept));
145 int SkDCubic::searchRoots(double extremeTs[6], int extrema, double axisIntercept, argument
158 double newT = binarySearch(min, max, axisIntercept, xAxis);
/external/skia/src/pathops/
H A DSkDQuadLineIntersection.cpp160 int horizontalIntersect(double axisIntercept, double roots[2]) { argument
166 F -= axisIntercept;
170 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument
171 addExactHorizontalEndPoints(left, right, axisIntercept);
173 addNearHorizontalEndPoints(left, right, axisIntercept);
176 int roots = horizontalIntersect(axisIntercept, rootVals);
191 int verticalIntersect(double axisIntercept, double roots[2]) { argument
197 F -= axisIntercept;
201 int verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) { argument
202 addExactVerticalEndPoints(top, bottom, axisIntercept);
[all...]
H A DSkDCubicLineIntersection.cpp163 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { argument
166 D -= axisIntercept;
170 if (!approximately_equal(calcPt.fY, axisIntercept)) {
173 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots);
180 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument
181 addExactHorizontalEndPoints(left, right, axisIntercept);
183 addNearHorizontalEndPoints(left, right, axisIntercept);
186 int count = HorizontalIntersect(fCubic, axisIntercept, roots);
191 pt.fY = axisIntercept;
203 static int VerticalIntersect(const SkDCubic& c, double axisIntercept, doubl argument
220 verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) argument
[all...]
H A DSkPathOpsCubic.cpp18 double SkDCubic::binarySearch(double min, double max, double axisIntercept, argument
24 double calcDist = calcPos - axisIntercept;
33 double lessDist = (&lessPt.fX)[xAxis] - axisIntercept;
50 double moreDist = (&morePt.fX)[xAxis] - axisIntercept;
59 calcDist = calcPos - axisIntercept;
60 } while (!approximately_equal(calcPos, axisIntercept));
145 int SkDCubic::searchRoots(double extremeTs[6], int extrema, double axisIntercept, argument
158 double newT = binarySearch(min, max, axisIntercept, xAxis);

Completed in 126 milliseconds