Style Change: NULL->nullptr

src/pathops/SkDConicLineIntersection.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 "SkIntersections.h"
 #include "SkPathOpsConic.h"
 #include "SkPathOpsLine.h"
 
 class LineConicIntersections {
 public:
     enum PinTPoint {
         kPointUninitialized,
         kPointInitialized
     };
 
     LineConicIntersections(const SkDConic& c, const SkDLine& l, SkIntersections* i)
         : fConic(c)
         , fLine(&l)
         , fIntersections(i)
         , fAllowNear(true) {
         i->setMax(3);  // allow short partial coincidence plus discrete intersection
     }
 
     LineConicIntersections(const SkDConic& c)
         : fConic(c)
-        SkDEBUGPARAMS(fLine(NULL))
-        SkDEBUGPARAMS(fIntersections(NULL))
+        SkDEBUGPARAMS(fLine(nullptr))
+        SkDEBUGPARAMS(fIntersections(nullptr))
         SkDEBUGPARAMS(fAllowNear(false)) {
     }
 
     void allowNear(bool allow) {
         fAllowNear = allow;
     }
 
     void checkCoincident() {
         int last = fIntersections->used() - 1;
         for (int index = 0; index < last; ) {
             double conicMidT = ((*fIntersections)[0][index] + (*fIntersections)[0][index + 1]) / 2;
             SkDPoint conicMidPt = fConic.ptAtT(conicMidT);
-            double t = fLine->nearPoint(conicMidPt, NULL);
+            double t = fLine->nearPoint(conicMidPt, nullptr);
             if (t < 0) {
                 ++index;
                 continue;
             }
             if (fIntersections->isCoincident(index)) {
                 fIntersections->removeOne(index);
                 --last;
             } else if (fIntersections->isCoincident(index + 1)) {
                 fIntersections->removeOne(index + 1);
                 --last;
@@ skipping 126 matching lines @@
             fIntersections->insert(conicT, lineT, fConic[cIndex]);
         }
     }
 
     void addNearEndPoints() {
         for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) {
             double conicT = (double) (cIndex >> 1);
             if (fIntersections->hasT(conicT)) {
                 continue;
             }
-            double lineT = fLine->nearPoint(fConic[cIndex], NULL);
+            double lineT = fLine->nearPoint(fConic[cIndex], nullptr);
             if (lineT < 0) {
                 continue;
             }
             fIntersections->insert(conicT, lineT, fConic[cIndex]);
         }
         // FIXME: see if line end is nearly on conic
     }
 
     void addExactHorizontalEndPoints(double left, double right, double y) {
         for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) {
@@ skipping 154 matching lines @@
 
 int SkIntersections::HorizontalIntercept(const SkDConic& conic, SkScalar y, double* roots) {
     LineConicIntersections c(conic);
     return c.horizontalIntersect(y, roots);
 }
 
 int SkIntersections::VerticalIntercept(const SkDConic& conic, SkScalar x, double* roots) {
     LineConicIntersections c(conic);
     return c.verticalIntersect(x, roots);
 }