Style Change: NULL->nullptr

src/pathops/SkDCubicLineIntersection.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 "SkPathOpsCubic.h"
 #include "SkPathOpsLine.h"
 
@@ skipping 80 matching lines @@
 
     void allowNear(bool allow) {
         fAllowNear = allow;
     }
 
     void checkCoincident() {
         int last = fIntersections->used() - 1;
         for (int index = 0; index < last; ) {
             double cubicMidT = ((*fIntersections)[0][index] + (*fIntersections)[0][index + 1]) / 2;
             SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT);
-            double t = fLine.nearPoint(cubicMidPt, NULL);
+            double t = fLine.nearPoint(cubicMidPt, 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 166 matching lines @@
     }
 
     /* Note that this does not look for endpoints of the line that are near the cubic.
        These points are found later when check ends looks for missing points */
     void addNearEndPoints() {
         for (int cIndex = 0; cIndex < 4; cIndex += 3) {
             double cubicT = (double) (cIndex >> 1);
             if (fIntersections->hasT(cubicT)) {
                 continue;
             }
-            double lineT = fLine.nearPoint(fCubic[cIndex], NULL);
+            double lineT = fLine.nearPoint(fCubic[cIndex], nullptr);
             if (lineT < 0) {
                 continue;
             }
             fIntersections->insert(cubicT, lineT, fCubic[cIndex]);
         }
     }
 
     void addExactHorizontalEndPoints(double left, double right, double y) {
         for (int cIndex = 0; cIndex < 4; cIndex += 3) {
             double lineT = SkDLine::ExactPointH(fCubic[cIndex], left, right, y);
@@ skipping 129 matching lines @@
 
 // SkDCubic accessors to Intersection utilities
 
 int SkDCubic::horizontalIntersect(double yIntercept, double roots[3]) const {
     return LineCubicIntersections::HorizontalIntersect(*this, yIntercept, roots);
 }
 
 int SkDCubic::verticalIntersect(double xIntercept, double roots[3]) const {
     return LineCubicIntersections::VerticalIntersect(*this, xIntercept, roots);
 }