| /external/skia/tests/ |
| PathOpsCubicIntersectionTestData.h | 9 extern const SkDCubic pointDegenerates[];
10 extern const SkDCubic notPointDegenerates[];
11 extern const SkDCubic tests[][2];
12 extern SkDCubic hexTests[][2];
14 extern const SkDCubic lines[];
15 extern const SkDCubic notLines[];
16 extern const SkDCubic modEpsilonLines[];
17 extern const SkDCubic lessEpsilonLines[];
18 extern const SkDCubic negEpsilonLines[];
|
| PathOpsDCubicTest.cpp | 11 static const SkDCubic tests[] = {
21 const SkDCubic& cubic = tests[index];
|
| PathOpsTestCommon.h | 15 void CubicToQuads(const SkDCubic& cubic, double precision, SkTArray<SkDQuad, true>& quads);
17 bool ValidCubic(const SkDCubic& cubic);
|
| PathOpsCubicIntersectionTestData.cpp | 15 const SkDCubic pointDegenerates[] = {
46 const SkDCubic notPointDegenerates[] = {
55 const SkDCubic tests[][2] = {
110 const SkDCubic lines[] = {
146 const SkDCubic notLines[] = {
160 const SkDCubic modEpsilonLines[] = {
203 const SkDCubic lessEpsilonLines[] = {
239 const SkDCubic negEpsilonLines[] = {
|
| PathOpsCubicReduceOrderTest.cpp | 16 static bool controls_inside(const SkDCubic& cubic) {
23 static bool tiny(const SkDCubic& cubic) {
44 static void find_tight_bounds(const SkDCubic& cubic, SkDRect& bounds) {
108 const SkDCubic& cubic = pointDegenerates[index];
117 const SkDCubic& cubic = notPointDegenerates[index];
127 const SkDCubic& cubic = lines[index];
136 const SkDCubic& cubic = notLines[index];
145 const SkDCubic& cubic = modEpsilonLines[index];
154 const SkDCubic& cubic = lessEpsilonLines[index];
164 const SkDCubic& cubic = negEpsilonLines[index]
[all...] |
| PathOpsTestCommon.cpp | 14 void CubicToQuads(const SkDCubic& cubic, double precision, SkTArray<SkDQuad, true>& quads) {
25 SkDCubic part = cubic.subDivide(tStart, tEnd);
49 bool ValidCubic(const SkDCubic& cubic) {
|
| PathOpsCubicToQuadsTest.cpp | 16 static void test(skiatest::Reporter* reporter, const SkDCubic* cubics, const char* name,
19 const SkDCubic& cubic = cubics[index];
37 SkDCubic cubic = quad.toCubic();
49 static void testC(skiatest::Reporter* reporter, const SkDCubic* cubics, const char* name,
53 const SkDCubic& cubic = cubics[index];
72 static void testC(skiatest::Reporter* reporter, const SkDCubic(* cubics)[2], const char* name,
76 const SkDCubic& cubic = cubics[index][idx2];
155 static SkDCubic locals[] = {
174 const SkDCubic& cubic = locals[x];
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkReduceOrder.h | 22 int reduce(const SkDCubic& cubic, Quadratics);
31 SkDCubic fCubic;
|
| SkPathOpsCubic.h | 16 const SkDCubic& first() const { return (const SkDCubic&) pts[0]; }
17 const SkDCubic& second() const { return (const SkDCubic&) pts[3]; }
21 struct SkDCubic {
48 SkDCubic cubic;
60 SkDCubic subDivide(double t1, double t2) const;
62 static SkDCubic SubDivide(const SkPoint a[4], double t1, double t2) {
63 SkDCubic cubic;
72 SkDCubic cubic
[all...] |
| SkIntersections.h | 55 SkDCubic cubic;
62 SkDCubic aCubic;
64 SkDCubic bCubic;
72 SkDCubic cubic;
79 SkDCubic cubic;
86 SkDCubic cubic;
95 SkDCubic cubic;
222 int horizontal(const SkDCubic&, double y, double tRange[3]);
223 int horizontal(const SkDCubic&, double left, double right, double y, bool flipped);
224 int horizontal(const SkDCubic&, double left, double right, double y, double tRange[3])
[all...] |
| SkDCubicToQuads.cpp | 24 SkDCubic defined by: P1/2 - anchor points, C1/C2 control points
57 static double calc_t_div(const SkDCubic& cubic, double precision, double start) {
59 SkDCubic sub;
60 const SkDCubic* cPtr;
68 const SkDCubic& c = *cPtr;
80 SkDQuad SkDCubic::toQuad() const {
91 static bool add_simple_ts(const SkDCubic& cubic, double precision, SkTArray<double, true>* ts) {
103 static void addTs(const SkDCubic& cubic, double precision, double start, double end,
119 void SkDCubic::toQuadraticTs(double precision, SkTArray<double, true>* ts) const {
176 SkDCubic part = subDivide(0, inflectT[0])
[all...] |
| SkPathOpsRect.cpp | 44 void SkDRect::setBounds(const SkDCubic& c) {
50 roots = SkDCubic::FindExtrema(c[0].fX, c[1].fX, c[2].fX, c[3].fX, tValues);
53 roots += SkDCubic::FindExtrema(c[0].fY, c[1].fY, c[2].fY, c[3].fY, &tValues[roots]);
60 void SkDRect::setRawBounds(const SkDCubic& cubic) {
|
| SkPathOpsCubic.cpp | 13 const int SkDCubic::gPrecisionUnit = 256; // FIXME: test different values in test framework
16 double SkDCubic::calcPrecision() const {
24 bool SkDCubic::clockwise() const {
32 void SkDCubic::Coefficients(const double* src, double* A, double* B, double* C, double* D) {
42 bool SkDCubic::controlsContainedByEnds() const {
71 bool SkDCubic::endsAreExtremaInXOrY() const {
78 bool SkDCubic::isLinear(int startIndex, int endIndex) const {
91 bool SkDCubic::monotonicInY() const {
96 bool SkDCubic::serpentine() const {
116 int SkDCubic::RootsValidT(double A, double B, double C, double D, double t[3])
[all...] |
| SkDCubicLineIntersection.cpp | 84 LineCubicIntersections(const SkDCubic& c, const SkDLine& l, SkIntersections* i)
100 SkDCubic r;
105 SkDCubic::Coefficients(&r[0].fX, &A, &B, &C, &D);
106 return SkDCubic::RootsValidT(A, B, C, D, roots);
151 SkDCubic::Coefficients(&fCubic[0].fY, &A, &B, &C, &D);
153 return SkDCubic::RootsValidT(A, B, C, D, roots);
179 SkDCubic::Coefficients(&fCubic[0].fX, &A, &B, &C, &D);
181 return SkDCubic::RootsValidT(A, B, C, D, roots);
325 const SkDCubic& fCubic;
331 int SkIntersections::horizontal(const SkDCubic& cubic, double left, double right, double y
[all...] |
| SkReduceOrder.cpp | 109 static int coincident_line(const SkDCubic& cubic, SkDCubic& reduction) {
114 static int reductionLineCount(const SkDCubic& reduction) {
118 static int vertical_line(const SkDCubic& cubic, SkDCubic& reduction) {
124 static int horizontal_line(const SkDCubic& cubic, SkDCubic& reduction) {
131 static int check_quadratic(const SkDCubic& cubic, SkDCubic& reduction) {
157 static int check_linear(const SkDCubic& cubic
[all...] |
| SkLineParameters.h | 27 void cubicEndPoints(const SkDCubic& pts) {
65 void cubicEndPoints(const SkDCubic& pts, int s, int e) {
71 double cubicPart(const SkDCubic& part) {
130 void cubicDistanceY(const SkDCubic& pts, SkDCubic& distance) const {
146 double controlPtDistance(const SkDCubic& pts, int index) const {
|
| /external/skia/src/pathops/ |
| SkReduceOrder.h | 22 int reduce(const SkDCubic& cubic, Quadratics);
31 SkDCubic fCubic;
|
| SkPathOpsCubic.h | 16 const SkDCubic& first() const { return (const SkDCubic&) pts[0]; }
17 const SkDCubic& second() const { return (const SkDCubic&) pts[3]; }
21 struct SkDCubic {
48 SkDCubic cubic;
60 SkDCubic subDivide(double t1, double t2) const;
62 static SkDCubic SubDivide(const SkPoint a[4], double t1, double t2) {
63 SkDCubic cubic;
72 SkDCubic cubic
[all...] |
| SkIntersections.h | 55 SkDCubic cubic;
62 SkDCubic aCubic;
64 SkDCubic bCubic;
72 SkDCubic cubic;
79 SkDCubic cubic;
86 SkDCubic cubic;
95 SkDCubic cubic;
222 int horizontal(const SkDCubic&, double y, double tRange[3]);
223 int horizontal(const SkDCubic&, double left, double right, double y, bool flipped);
224 int horizontal(const SkDCubic&, double left, double right, double y, double tRange[3])
[all...] |
| SkDCubicToQuads.cpp | 24 SkDCubic defined by: P1/2 - anchor points, C1/C2 control points
57 static double calc_t_div(const SkDCubic& cubic, double precision, double start) {
59 SkDCubic sub;
60 const SkDCubic* cPtr;
68 const SkDCubic& c = *cPtr;
80 SkDQuad SkDCubic::toQuad() const {
91 static bool add_simple_ts(const SkDCubic& cubic, double precision, SkTArray<double, true>* ts) {
103 static void addTs(const SkDCubic& cubic, double precision, double start, double end,
119 void SkDCubic::toQuadraticTs(double precision, SkTArray<double, true>* ts) const {
176 SkDCubic part = subDivide(0, inflectT[0])
[all...] |
| SkPathOpsRect.cpp | 44 void SkDRect::setBounds(const SkDCubic& c) {
50 roots = SkDCubic::FindExtrema(c[0].fX, c[1].fX, c[2].fX, c[3].fX, tValues);
53 roots += SkDCubic::FindExtrema(c[0].fY, c[1].fY, c[2].fY, c[3].fY, &tValues[roots]);
60 void SkDRect::setRawBounds(const SkDCubic& cubic) {
|
| SkPathOpsCubic.cpp | 13 const int SkDCubic::gPrecisionUnit = 256; // FIXME: test different values in test framework
16 double SkDCubic::calcPrecision() const {
24 bool SkDCubic::clockwise() const {
32 void SkDCubic::Coefficients(const double* src, double* A, double* B, double* C, double* D) {
42 bool SkDCubic::controlsContainedByEnds() const {
71 bool SkDCubic::endsAreExtremaInXOrY() const {
78 bool SkDCubic::isLinear(int startIndex, int endIndex) const {
91 bool SkDCubic::monotonicInY() const {
96 bool SkDCubic::serpentine() const {
116 int SkDCubic::RootsValidT(double A, double B, double C, double D, double t[3])
[all...] |
| SkDCubicLineIntersection.cpp | 84 LineCubicIntersections(const SkDCubic& c, const SkDLine& l, SkIntersections* i)
100 SkDCubic r;
105 SkDCubic::Coefficients(&r[0].fX, &A, &B, &C, &D);
106 return SkDCubic::RootsValidT(A, B, C, D, roots);
151 SkDCubic::Coefficients(&fCubic[0].fY, &A, &B, &C, &D);
153 return SkDCubic::RootsValidT(A, B, C, D, roots);
179 SkDCubic::Coefficients(&fCubic[0].fX, &A, &B, &C, &D);
181 return SkDCubic::RootsValidT(A, B, C, D, roots);
325 const SkDCubic& fCubic;
331 int SkIntersections::horizontal(const SkDCubic& cubic, double left, double right, double y
[all...] |
| SkReduceOrder.cpp | 109 static int coincident_line(const SkDCubic& cubic, SkDCubic& reduction) {
114 static int reductionLineCount(const SkDCubic& reduction) {
118 static int vertical_line(const SkDCubic& cubic, SkDCubic& reduction) {
124 static int horizontal_line(const SkDCubic& cubic, SkDCubic& reduction) {
131 static int check_quadratic(const SkDCubic& cubic, SkDCubic& reduction) {
157 static int check_linear(const SkDCubic& cubic
[all...] |
| SkLineParameters.h | 27 void cubicEndPoints(const SkDCubic& pts) {
65 void cubicEndPoints(const SkDCubic& pts, int s, int e) {
71 double cubicPart(const SkDCubic& part) {
130 void cubicDistanceY(const SkDCubic& pts, SkDCubic& distance) const {
146 double controlPtDistance(const SkDCubic& pts, int index) const {
|
