/external/skia/tests/ |
PathOpsQuadIntersectionTestData.h | 9 extern const SkDQuad quadraticLines[]; 10 extern const SkDQuad quadraticPoints[]; 11 extern const SkDQuad quadraticModEpsilonLines[]; 12 extern const SkDQuad quadraticTests[][2];
|
PathOpsQuadIntersectionTestData.cpp | 10 const SkDQuad quadraticPoints[] = { 19 const SkDQuad quadraticLines[] = { 52 const SkDQuad quadraticModEpsilonLines[] = { 85 const SkDQuad quadraticTests[][2] = {
|
PathOpsTestCommon.h | 15 void CubicToQuads(const SkDCubic& cubic, double precision, SkTArray<SkDQuad, true>& quads); 21 bool ValidQuad(const SkDQuad& quad);
|
PathOpsQuadParameterizationTest.cpp | 11 static bool point_on_parameterized_curve(const SkDQuad& quad, const SkDPoint& point) { 23 static const SkDQuad quadratics[] = { 33 const SkDQuad& test = quadratics[index]; 35 SkDQuad midThird = test.subDivide(1.0/3, 2.0/3); 36 const SkDQuad* quads[] = {
|
PathOpsDQuadTest.cpp | 11 static const SkDQuad tests[] = { 39 const SkDQuad& quad = tests[index];
|
PathOpsQuadReduceOrderTest.cpp | 13 static const SkDQuad testSet[] = { 22 const SkDQuad& quad = testSet[index]; 50 const SkDQuad& quad = quadraticLines[index]; 57 const SkDQuad& quad = quadraticModEpsilonLines[index];
|
PathOpsTestCommon.cpp | 14 void CubicToQuads(const SkDCubic& cubic, double precision, SkTArray<SkDQuad, true>& quads) { 18 SkDQuad quad = cubic.toQuad(); 26 SkDQuad quad = part.toQuad(); 86 bool ValidQuad(const SkDQuad& quad) {
|
/external/chromium_org/third_party/skia/src/pathops/ |
SkPathOpsQuad.h | 14 const SkDQuad& first() const { return (const SkDQuad&) pts[0]; } 15 const SkDQuad& second() const { return (const SkDQuad&) pts[2]; } 19 struct SkDQuad { 22 SkDQuad flip() const { 23 SkDQuad result = {{fPts[2], fPts[1], fPts[0]}}; 49 SkDQuad subDivide(double t1, double t2) const; 50 static SkDQuad SubDivide(const SkPoint a[3], double t1, double t2) { 51 SkDQuad quad [all...] |
SkDQuadImplicit.h | 14 explicit SkDQuadImplicit(const SkDQuad& q); 17 static bool Match(const SkDQuad& quad1, const SkDQuad& quad2);
|
SkReduceOrder.h | 28 int reduce(const SkDQuad& quad, Style); 34 SkDQuad fQuad;
|
SkPathOpsRect.cpp | 17 void SkDRect::setBounds(const SkDQuad& quad) { 23 roots = SkDQuad::FindExtrema(quad[0].fX, quad[1].fX, quad[2].fX, tValues); 26 roots += SkDQuad::FindExtrema(quad[0].fY, quad[1].fY, quad[2].fY, &tValues[roots]); 33 void SkDRect::setRawBounds(const SkDQuad& quad) {
|
SkPathOpsQuad.cpp | 15 double SkDQuad::nearestT(const SkDPoint& pt) const { 46 bool SkDQuad::pointInHull(const SkDPoint& pt) const { 50 SkDPoint SkDQuad::top(double startT, double endT) const { 51 SkDQuad sub = subDivide(startT, endT); 69 int SkDQuad::AddValidTs(double s[], int realRoots, double* t) { 97 int SkDQuad::RootsValidT(double A, double B, double C, double t[2]) { 112 int SkDQuad::RootsReal(const double A, const double B, const double C, double s[2]) { 137 bool SkDQuad::isLinear(int startIndex, int endIndex) const { 146 SkDCubic SkDQuad::toCubic() const { 158 SkDVector SkDQuad::dxdyAtT(double t) const [all...] |
SkIntersections.h | 90 SkDQuad quad; 138 SkDQuad quad; 144 SkDQuad quad; 150 SkDQuad quad; 158 SkDQuad aQuad; 160 SkDQuad bQuad; 196 static double Axial(const SkDQuad& , const SkDPoint& , bool vertical); 202 int horizontal(const SkDQuad&, double left, double right, double y, bool flipped); 203 int horizontal(const SkDQuad&, double left, double right, double y, double tRange[2]); 212 int intersect(const SkDQuad&, const SkDLine&) [all...] |
SkDQuadImplicit.cpp | 54 SkDQuadImplicit::SkDQuadImplicit(const SkDQuad& q) { 56 SkDQuad::SetABC(&q[0].fX, &a, &b, &c); 58 SkDQuad::SetABC(&q[0].fY, &d, &e, &f); 113 bool SkDQuadImplicit::Match(const SkDQuad& quad1, const SkDQuad& quad2) {
|
SkLineParameters.h | 48 void quadEndPoints(const SkDQuad& pts) { 55 void quadEndPoints(const SkDQuad& pts, int s, int e) { 86 void quadDistanceY(const SkDQuad& pts, SkDQuad& distance) const { 99 double controlPtDistance(const SkDQuad& pts) const {
|
SkDQuadIntersection.cpp | 22 static int findRoots(const SkDQuadImplicit& i, const SkDQuad& quad, double roots[4], 24 SkDQuad flipped; 25 const SkDQuad& q = flip ? (flipped = quad.flip()) : quad; 27 SkDQuad::SetABC(&q[0].fX, &a, &b, &c); 29 SkDQuad::SetABC(&q[0].fY, &d, &e, &f); 82 static bool only_end_pts_in_common(const SkDQuad& q1, const SkDQuad& q2) { 120 static bool add_intercept(const SkDQuad& q1, const SkDQuad& q2, double tMin, double tMax, 149 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2 [all...] |
/external/skia/src/pathops/ |
SkPathOpsQuad.h | 14 const SkDQuad& first() const { return (const SkDQuad&) pts[0]; } 15 const SkDQuad& second() const { return (const SkDQuad&) pts[2]; } 19 struct SkDQuad { 22 SkDQuad flip() const { 23 SkDQuad result = {{fPts[2], fPts[1], fPts[0]}}; 49 SkDQuad subDivide(double t1, double t2) const; 50 static SkDQuad SubDivide(const SkPoint a[3], double t1, double t2) { 51 SkDQuad quad [all...] |
SkDQuadImplicit.h | 14 explicit SkDQuadImplicit(const SkDQuad& q); 17 static bool Match(const SkDQuad& quad1, const SkDQuad& quad2);
|
SkReduceOrder.h | 28 int reduce(const SkDQuad& quad, Style); 34 SkDQuad fQuad;
|
SkPathOpsRect.cpp | 17 void SkDRect::setBounds(const SkDQuad& quad) { 23 roots = SkDQuad::FindExtrema(quad[0].fX, quad[1].fX, quad[2].fX, tValues); 26 roots += SkDQuad::FindExtrema(quad[0].fY, quad[1].fY, quad[2].fY, &tValues[roots]); 33 void SkDRect::setRawBounds(const SkDQuad& quad) {
|
SkPathOpsQuad.cpp | 15 double SkDQuad::nearestT(const SkDPoint& pt) const { 46 bool SkDQuad::pointInHull(const SkDPoint& pt) const { 50 SkDPoint SkDQuad::top(double startT, double endT) const { 51 SkDQuad sub = subDivide(startT, endT); 69 int SkDQuad::AddValidTs(double s[], int realRoots, double* t) { 97 int SkDQuad::RootsValidT(double A, double B, double C, double t[2]) { 112 int SkDQuad::RootsReal(const double A, const double B, const double C, double s[2]) { 137 bool SkDQuad::isLinear(int startIndex, int endIndex) const { 146 SkDCubic SkDQuad::toCubic() const { 158 SkDVector SkDQuad::dxdyAtT(double t) const [all...] |
SkIntersections.h | 90 SkDQuad quad; 138 SkDQuad quad; 144 SkDQuad quad; 150 SkDQuad quad; 158 SkDQuad aQuad; 160 SkDQuad bQuad; 196 static double Axial(const SkDQuad& , const SkDPoint& , bool vertical); 202 int horizontal(const SkDQuad&, double left, double right, double y, bool flipped); 203 int horizontal(const SkDQuad&, double left, double right, double y, double tRange[2]); 212 int intersect(const SkDQuad&, const SkDLine&) [all...] |
SkDQuadImplicit.cpp | 54 SkDQuadImplicit::SkDQuadImplicit(const SkDQuad& q) { 56 SkDQuad::SetABC(&q[0].fX, &a, &b, &c); 58 SkDQuad::SetABC(&q[0].fY, &d, &e, &f); 113 bool SkDQuadImplicit::Match(const SkDQuad& quad1, const SkDQuad& quad2) {
|
SkLineParameters.h | 48 void quadEndPoints(const SkDQuad& pts) { 55 void quadEndPoints(const SkDQuad& pts, int s, int e) { 86 void quadDistanceY(const SkDQuad& pts, SkDQuad& distance) const { 99 double controlPtDistance(const SkDQuad& pts) const {
|
SkDQuadIntersection.cpp | 22 static int findRoots(const SkDQuadImplicit& i, const SkDQuad& quad, double roots[4], 24 SkDQuad flipped; 25 const SkDQuad& q = flip ? (flipped = quad.flip()) : quad; 27 SkDQuad::SetABC(&q[0].fX, &a, &b, &c); 29 SkDQuad::SetABC(&q[0].fY, &d, &e, &f); 82 static bool only_end_pts_in_common(const SkDQuad& q1, const SkDQuad& q2) { 120 static bool add_intercept(const SkDQuad& q1, const SkDQuad& q2, double tMin, double tMax, 149 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2 [all...] |