Style Change: NULL->nullptr

src/pathops/SkDQuadLineIntersection.cpp

 /*
  * Copyright 2012 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 "SkPathOpsLine.h"
 #include "SkPathOpsQuad.h"
 
@@ skipping 85 matching lines @@
     LineQuadraticIntersections(const SkDQuad& q, const SkDLine& l, SkIntersections* i)
         : fQuad(q)
         , fLine(&l)
         , fIntersections(i)
         , fAllowNear(true) {
         i->setMax(3);  // allow short partial coincidence plus discrete intersection
     }
 
     LineQuadraticIntersections(const SkDQuad& q)
         : fQuad(q) 
-        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 quadMidT = ((*fIntersections)[0][index] + (*fIntersections)[0][index + 1]) / 2;
             SkDPoint quadMidPt = fQuad.ptAtT(quadMidT);
-            double t = fLine->nearPoint(quadMidPt, NULL);
+            double t = fLine->nearPoint(quadMidPt, 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 153 matching lines @@
             fIntersections->insert(quadT, lineT, fQuad[qIndex]);
         }
     }
 
     void addNearEndPoints() {
         for (int qIndex = 0; qIndex < 3; qIndex += 2) {
             double quadT = (double) (qIndex >> 1);
             if (fIntersections->hasT(quadT)) {
                 continue;
             }
-            double lineT = fLine->nearPoint(fQuad[qIndex], NULL);
+            double lineT = fLine->nearPoint(fQuad[qIndex], nullptr);
             if (lineT < 0) {
                 continue;
             }
             fIntersections->insert(quadT, lineT, fQuad[qIndex]);
         }
         // FIXME: see if line end is nearly on quad
     }
 
     void addExactHorizontalEndPoints(double left, double right, double y) {
         for (int qIndex = 0; qIndex < 3; qIndex += 2) {
@@ skipping 130 matching lines @@
 
 int SkIntersections::HorizontalIntercept(const SkDQuad& quad, SkScalar y, double* roots) {
     LineQuadraticIntersections q(quad);
     return q.horizontalIntersect(y, roots);
 }
 
 int SkIntersections::VerticalIntercept(const SkDQuad& quad, SkScalar x, double* roots) {
     LineQuadraticIntersections q(quad);
     return q.verticalIntersect(x, roots);
 }