Searched refs:midT (Results 1 – 6 of 6) sorted by relevance
| /external/skia/src/pathops/ |
| D | SkPathOpsConic.cpp | 90 double midT = (t1 + t2) / 2; in subDivide() local
91 double dx = conic_eval_numerator(&fPts[0].fX, fWeight, midT); in subDivide()
92 double dy = conic_eval_numerator(&fPts[0].fY, fWeight, midT); in subDivide()
93 double dz = conic_eval_denominator(fWeight, midT); in subDivide()
|
| D | SkOpCoincidence.cpp | 332 double midT = (prev->t() + start->t()) / 2; in expand() local
333 if (segment->isClose(midT, oppSegment)) { in expand()
340 double midT = (end->t() + next->t()) / 2; in expand() local
341 if (segment->isClose(midT, oppSegment)) { in expand()
|
| D | SkOpAngle.h | 80 double midT() const;
|
| D | SkOpAngle.cpp | 311 SkDVector m0 = segment()->dPtAtT(this->midT()) - this->fCurvePart[0]; in checkParallel()
312 SkDVector m1 = rh->segment()->dPtAtT(rh->midT()) - rh->fCurvePart[0]; in checkParallel()
407 SkDVector m0 = this->segment()->dPtAtT(this->midT()) - this->fCurvePart[0]; in convexHullOverlaps()
408 SkDVector m1 = rh->segment()->dPtAtT(rh->midT()) - rh->fCurvePart[0]; in convexHullOverlaps()
772 double SkOpAngle::midT() const { in midT() function in SkOpAngle
|
| D | SkOpSegment.cpp | 1184 double midT = (prior->t() + spanBase->t()) / 2; in missingCoincidence() local
1185 SkPoint midPt = this->ptAtT(midT); in missingCoincidence()
1192 SkVector dxdy = (*CurveSlopeAtT[fVerb])(this->pts(), this->weight(), midT); in missingCoincidence()
1398 double midT = (t1 + t2) / 2; in ptsDisjoint() local
1399 SkPoint midPt = this->ptAtT(midT); in ptsDisjoint()
|
| D | SkPathOpsTSect.h | 1442 double midT = (smaller->fEndT + larger->fStartT) / 2; in mergeCoincidence() local
1443 SkDPoint midPt = fCurve.ptAtT(midT); in mergeCoincidence()
1445 coin.setPerp(fCurve, midT, midPt, sect2->fCurve); in mergeCoincidence()
2074 double midT = ((*intersections)[0][index] + (*intersections)[0][index + 1]) / 2; in BinarySearch() local
2075 SkDPoint midPt = sect1->fCurve.ptAtT(midT); in BinarySearch()
2078 perp.setPerp(sect1->fCurve, midT, midPt, sect2->fCurve); in BinarySearch()
|