quad and conic do not intersect

src/pathops/SkPathOpsCurve.cpp

 /*
  * Copyright 2015 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "SkPathOpsBounds.h"
 #include "SkPathOpsRect.h"
 #include "SkPathOpsCurve.h"
 
  // this cheats and assumes that the perpendicular to the point is the closest ray to the curve
  // this case (where the line and the curve are nearly coincident) may be the only case that counts
 double SkDCurve::nearPoint(SkPath::Verb verb, const SkDPoint& xy, const SkDPoint& opp) const {
     int count = SkPathOpsVerbToPoints(verb);
     double minX = fCubic.fPts[0].fX;
     double maxX = minX;
-    for (int index = 0; index < count; ++index) {
+    for (int index = 1; index <= count; ++index) {
         minX = SkTMin(minX, fCubic.fPts[index].fX);
         maxX = SkTMax(maxX, fCubic.fPts[index].fX);
     }
     if (!AlmostBetweenUlps(minX, xy.fX, maxX)) {
         return -1;
     }
     double minY = fCubic.fPts[0].fY;
     double maxY = minY;
-    for (int index = 0; index < count; ++index) {
+    for (int index = 1; index <= count; ++index) {
         minY = SkTMin(minY, fCubic.fPts[index].fY);
         maxY = SkTMax(maxY, fCubic.fPts[index].fY);
     }
     if (!AlmostBetweenUlps(minY, xy.fY, maxY)) {
         return -1;
     }
     SkIntersections i;
     SkDLine perp = {{ xy, { xy.fX + opp.fY - xy.fY, xy.fY + xy.fX - opp.fX }}};
     (*CurveDIntersectRay[verb])(*this, perp, &i);
     int minIndex = -1;
@@ skipping 99 matching lines @@
         if (s3x2 * s2x1 < 0) {
             SkASSERT(s2x1 * s1x3 > 0);
             fSweep[0] = fSweep[1];
             fOrdered = false;
         }
         fSweep[1] = thirdSweep;
     }
 setIsCurve:
     fIsCurve = fSweep[0].crossCheck(fSweep[1]) != 0;
 }