Cross Reference: /external/skqp/src/pathops/SkDConicLineIntersection.cpp

Lines Matching refs:conicT
80             double conicT = roots[index];
81             SkDPoint pt = fConic.ptAtT(conicT);
85             if (this->pinTs(&conicT, &lineT, &pt, kPointInitialized)
86                     && this->uniqueAnswer(conicT, pt)) {
87                 fIntersections->insert(conicT, lineT, pt);
105             double conicT = rootVals[index];
106             double lineT = this->findLineT(conicT);
110                 SkDEBUGCODE(SkDPoint conicPt = fConic.ptAtT(conicT));
116             if (this->pinTs(&conicT, &lineT, &pt, kPointUninitialized)
117                     && this->uniqueAnswer(conicT, pt)) {
118                 fIntersections->insert(conicT, lineT, pt);
158             double conicT = roots[index];
159             SkDPoint pt = fConic.ptAtT(conicT);
163             if (this->pinTs(&conicT, &lineT, &pt, kPointInitialized)
164                     && this->uniqueAnswer(conicT, pt)) {
165                 fIntersections->insert(conicT, lineT, pt);
184             double conicT = (double) (cIndex >> 1);
185             fIntersections->insert(conicT, lineT, fConic[cIndex]);
191             double conicT = (double) (cIndex >> 1);
192             if (fIntersections->hasT(conicT)) {
199             fIntersections->insert(conicT, lineT, fConic[cIndex]);
210             double conicT = ((SkDCurve*) &fConic)->nearPoint(SkPath::kConic_Verb,
212             if (conicT < 0) {
215             fIntersections->insert(conicT, lineT, (*fLine)[lIndex]);
225             double conicT = (double) (cIndex >> 1);
226             fIntersections->insert(conicT, lineT, fConic[cIndex]);
232             double conicT = (double) (cIndex >> 1);
233             if (fIntersections->hasT(conicT)) {
240             fIntersections->insert(conicT, lineT, fConic[cIndex]);
251             double conicT = (double) (cIndex >> 1);
252             fIntersections->insert(conicT, lineT, fConic[cIndex]);
258             double conicT = (double) (cIndex >> 1);
259             if (fIntersections->hasT(conicT)) {
266             fIntersections->insert(conicT, lineT, fConic[cIndex]);
281     bool pinTs(double* conicT, double* lineT, SkDPoint* pt, PinTPoint ptSet) {
288         double qT = *conicT = SkPinT(*conicT);
308             *conicT = 0;
311             *conicT = 1;
316     bool uniqueAnswer(double conicT, const SkDPoint& pt) {
322             if (conicT == existingConicT) {
326             double conicMidT = (existingConicT + conicT) / 2;
333         SkDPoint qPt = fConic.ptAtT(conicT);