fix bugs in path contains

tests/PathTest.cpp

 /*
  * Copyright 2011 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "SkCanvas.h"
 #include "SkGeometry.h"
 #include "SkPaint.h"
@@ skipping 3573 matching lines @@
     p.moveTo(4, 4);
     p.quadTo(6, 6, 8, 8);
     p.quadTo(6, 8, 4, 8);
     p.quadTo(4, 6, 4, 4);
     REPORTER_ASSERT(reporter, p.contains(5, 6));
     REPORTER_ASSERT(reporter, !p.contains(6, 5));
     // test quad edge
     REPORTER_ASSERT(reporter, p.contains(5, 5));
     REPORTER_ASSERT(reporter, p.contains(5, 8));
     REPORTER_ASSERT(reporter, p.contains(4, 5));
+    // test quad endpoints
+    REPORTER_ASSERT(reporter, p.contains(4, 4));
+    REPORTER_ASSERT(reporter, p.contains(8, 8));
+    REPORTER_ASSERT(reporter, p.contains(4, 8));
 
     p.reset();
     const SkPoint qPts[] = {{6, 6}, {8, 8}, {6, 8}, {4, 8}, {4, 6}, {4, 4}, {6, 6}};
     p.moveTo(qPts[0]);
     for (int index = 1; index < (int) SK_ARRAY_COUNT(qPts); index += 2) {
         p.quadTo(qPts[index], qPts[index + 1]);
     }
     REPORTER_ASSERT(reporter, p.contains(5, 6));
     REPORTER_ASSERT(reporter, !p.contains(6, 5));
     // test quad edge
@@ skipping 11 matching lines @@
         p.conicTo(kPts[index], kPts[index + 1], 0.5f);
     }
     REPORTER_ASSERT(reporter, p.contains(5, 6));
     REPORTER_ASSERT(reporter, !p.contains(6, 5));
     // test conic edge
     for (int index = 0; index < (int) SK_ARRAY_COUNT(kPts) - 2; index += 2) {
         SkConic conic(&kPts[index], 0.5f);
         halfway = conic.evalAt(0.5f);
         REPORTER_ASSERT(reporter, p.contains(halfway.fX, halfway.fY));
     }
+    // test conic end points
+    REPORTER_ASSERT(reporter, p.contains(4, 4));
+    REPORTER_ASSERT(reporter, p.contains(8, 8));
+    REPORTER_ASSERT(reporter, p.contains(4, 8));
 
     // test cubics
     SkPoint pts[] = {{5, 4}, {6, 5}, {7, 6}, {6, 6}, {4, 6}, {5, 7}, {5, 5}, {5, 4}, {6, 5}, {7, 6}};
     for (int i = 0; i < 3; ++i) {
         p.reset();
         p.setFillType(SkPath::kEvenOdd_FillType);
         p.moveTo(pts[i].fX, pts[i].fY);
         p.cubicTo(pts[i + 1].fX, pts[i + 1].fY, pts[i + 2].fX, pts[i + 2].fY, pts[i + 3].fX, pts[i + 3].fY);
         p.cubicTo(pts[i + 4].fX, pts[i + 4].fY, pts[i + 5].fX, pts[i + 5].fY, pts[i + 6].fX, pts[i + 6].fY);
         p.close();
         REPORTER_ASSERT(reporter, p.contains(5.5f, 5.5f));
         REPORTER_ASSERT(reporter, !p.contains(4.5f, 5.5f));
         // test cubic edge
         SkEvalCubicAt(&pts[i], 0.5f, &halfway, nullptr, nullptr);
         REPORTER_ASSERT(reporter, p.contains(halfway.fX, halfway.fY));
         SkEvalCubicAt(&pts[i + 3], 0.5f, &halfway, nullptr, nullptr);
         REPORTER_ASSERT(reporter, p.contains(halfway.fX, halfway.fY));
+        // test cubic end points
+        REPORTER_ASSERT(reporter, p.contains(pts[i].fX, pts[i].fY));
+        REPORTER_ASSERT(reporter, p.contains(pts[i + 3].fX, pts[i + 3].fY));
+        REPORTER_ASSERT(reporter, p.contains(pts[i + 6].fX, pts[i + 6].fY));
     }
 }
 
 class PathRefTest_Private {
 public:
     static void TestPathRef(skiatest::Reporter* reporter) {
         static const int kRepeatCnt = 10;
 
         SkAutoTUnref<SkPathRef> pathRef(new SkPathRef);
 
@@ skipping 362 matching lines @@
     PathTest_Private::TestPathTo(reporter);
     PathRefTest_Private::TestPathRef(reporter);
     PathTest_Private::TestPathrefListeners(reporter);
     test_dump(reporter);
     test_path_crbug389050(reporter);
     test_path_crbugskia2820(reporter);
     test_skbug_3469(reporter);
     test_skbug_3239(reporter);
     test_bounds_crbug_513799(reporter);
 }