Lines Matching refs:quadT
177 double quadT = rootVals[index];
178 double lineT = findLineT(quadT);
180 if (pinTs(&quadT, &lineT, &pt, kPointUninitialized) && uniqueAnswer(quadT, pt)) {
181 fIntersections->insert(quadT, lineT, pt);
206 double quadT = rootVals[index];
207 SkDPoint pt = fQuad.ptAtT(quadT);
209 if (pinTs(&quadT, &lineT, &pt, kPointInitialized) && uniqueAnswer(quadT, pt)) {
210 fIntersections->insert(quadT, lineT, pt);
220 bool uniqueAnswer(double quadT, const SkDPoint& pt) {
226 if (quadT == existingQuadT) {
230 double quadMidT = (existingQuadT + quadT) / 2;
237 SkDPoint qPt = fQuad.ptAtT(quadT);
262 double quadT = rootVals[index];
263 SkDPoint pt = fQuad.ptAtT(quadT);
265 if (pinTs(&quadT, &lineT, &pt, kPointInitialized) && uniqueAnswer(quadT, pt)) {
266 fIntersections->insert(quadT, lineT, pt);
284 double quadT = (double) (qIndex >> 1);
285 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
291 double quadT = (double) (qIndex >> 1);
292 if (fIntersections->hasT(quadT)) {
299 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
310 double quadT = ((SkDCurve*) &fQuad)->nearPoint(SkPath::kQuad_Verb,
312 if (quadT < 0) {
315 fIntersections->insert(quadT, lineT, (*fLine)[lIndex]);
325 double quadT = (double) (qIndex >> 1);
326 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
332 double quadT = (double) (qIndex >> 1);
333 if (fIntersections->hasT(quadT)) {
340 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
351 double quadT = (double) (qIndex >> 1);
352 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
358 double quadT = (double) (qIndex >> 1);
359 if (fIntersections->hasT(quadT)) {
366 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
381 bool pinTs(double* quadT, double* lineT, SkDPoint* pt, PinTPoint ptSet) {
388 double qT = *quadT = SkPinT(*quadT);
408 *quadT = 0;
411 *quadT = 1;
