Searched refs:tValues (Results 1 - 10 of 10) sorted by relevance
/third_party/skia/src/pathops/ |
H A D | SkPathOpsRect.cpp | 16 double tValues[2]; in setBounds() local 19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues); in setBounds() 22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds() 25 double t = startT + (endT - startT) * tValues[index]; in setBounds() 33 double tValues[2]; in setBounds() local 36 roots = SkDConic::FindExtrema(&sub[0].fX, sub.fWeight, tValues); in setBounds() 39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]); in setBounds() 42 double t = startT + (endT - startT) * tValues[index]; in setBounds() 50 double tValues[4]; in setBounds() local 53 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues); in setBounds() [all...] |
H A D | SkPathOpsCubic.h | 66 int findInflections(double tValues[2]) const; 68 static int FindInflections(const SkPoint a[kPointCount], double tValues[2]) { in FindInflections() 70 return cubic.set(a).findInflections(tValues); in FindInflections() 73 int findMaxCurvature(double tValues[]) const;
|
H A D | SkPathOpsConic.cpp | 36 double tValues[2]; in FindExtrema() local 37 int roots = SkDQuad::RootsValidT(coeff[0], coeff[1], coeff[2], tValues); in FindExtrema() 44 t[0] = tValues[0]; in FindExtrema()
|
H A D | SkPathOpsAsWinding.cpp | 145 double tValues[2]; in left_edge() 146 roots = SkDCubic::FindExtrema(&cubic[0].fX, tValues); in left_edge() 149 SkPoint temp = cubic.ptAtT(tValues[index]).asSkPoint(); in left_edge() 152 t = tValues[index]; in left_edge()
|
H A D | SkPathOpsCubic.cpp | 517 int SkDCubic::findInflections(double tValues[]) const { 524 return SkDQuad::RootsValidT(Bx * Cy - By * Cx, Ax * Cy - Ay * Cx, Ax * By - Ay * Bx, tValues); 543 int SkDCubic::FindExtrema(const double src[], double tValues[2]) { 553 return SkDQuad::RootsValidT(A, B, C, tValues); 568 int SkDCubic::findMaxCurvature(double tValues[]) const { 576 return RootsValidT(coeffX[0], coeffX[1], coeffX[2], coeffX[3], tValues);
|
/third_party/skia/src/core/ |
H A D | SkGeometry.cpp | 436 SkScalar tValues[2]) { 442 return SkFindUnitQuadRoots(A, B, C, tValues); 526 const SkScalar tValues[], int tCount) { 529 SkASSERT(std::all_of(tValues, tValues + tCount, [](SkScalar t) { return t >= 0 && t <= 1; })); 530 SkASSERT(std::is_sorted(tValues, tValues + tCount)); 539 float2 tt = float2::Load(tValues + i); 541 float lastT = tValues[i - 1]; 550 float t = tValues[ [all...] |
H A D | SkGeometry.h | 91 Returned count tValues[] 93 1 0 < tValues[0] < 1 95 int SkFindQuadExtrema(SkScalar a, SkScalar b, SkScalar c, SkScalar tValues[1]); 195 Returned count tValues[] 197 1 0 < tValues[0] < 1 198 2 0 < tValues[0] < tValues[1] < 1 201 SkScalar tValues[2]); 217 int SkFindCubicInflections(const SkPoint src[4], SkScalar tValues[2]); 225 int SkFindCubicMaxCurvature(const SkPoint src[4], SkScalar tValues[ [all...] |
H A D | SkStroke.cpp | 652 SkScalar tValues[3]; 653 int count = SkFindCubicMaxCurvature(cubic, tValues); 657 SkScalar t = tValues[index]; 1314 SkScalar tValues[2]; 1315 int count = SkFindCubicInflections(cubic, tValues); 1318 SkScalar nextT = index < count ? tValues[index] : 1;
|
H A D | SkScan_Hairline.cpp | 433 SkScalar tValues[3]; 435 int count = SkChopCubicAtMaxCurvature(pts, tmp, tValues);
|
/third_party/skia/tests/ |
H A D | GeometryTest.cpp | 22 Inspired by this test, which used to assert that the tValues had dups in testChopCubic() 33 SkScalar tValues[3]; in testChopCubic() local 35 int count = SkChopCubicAtMaxCurvature(src, dst, tValues); in testChopCubic()
|
Completed in 9 milliseconds