Style Change: NULL->nullptr

src/pathops/SkOpSpan.cpp

 /*
  * Copyright 2014 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "SkOpCoincidence.h"
 #include "SkOpContour.h"
 #include "SkOpSegment.h"
 #include "SkPathWriter.h"
@@ skipping 26 matching lines @@
 
 SkOpPtT* SkOpPtT::contains(const SkOpSegment* check) {
     SkASSERT(this->segment() != check);
     SkOpPtT* ptT = this;
     const SkOpPtT* stopPtT = ptT;
     while ((ptT = ptT->next()) != stopPtT) {
         if (ptT->segment() == check) {
             return ptT;
         }
     }
-    return NULL;
+    return nullptr;
 }
 
 SkOpContour* SkOpPtT::contour() const {
     return segment()->contour();
 }
 
 SkOpPtT* SkOpPtT::doppelganger() {
     SkASSERT(fDeleted);
     SkOpPtT* ptT = fNext;
     while (ptT->fDeleted) {
         ptT = ptT->fNext;
     }
     const SkOpPtT* stopPtT = ptT;
     do {
         if (ptT->fSpan == fSpan) {
             return ptT;
         }
         ptT = ptT->fNext;
     } while (stopPtT != ptT);
     SkASSERT(0);
-    return NULL;
+    return nullptr;
 }
 
 SkOpPtT* SkOpPtT::find(SkOpSegment* segment) {
     SkOpPtT* ptT = this;
     const SkOpPtT* stopPtT = ptT;
     do {
         if (ptT->segment() == segment) {
             return ptT;
         }
         ptT = ptT->fNext;
     } while (stopPtT != ptT);
     SkASSERT(0);
-    return NULL;
+    return nullptr;
 }
 
 SkOpGlobalState* SkOpPtT::globalState() const {
     return contour()->globalState(); 
 }
 
 void SkOpPtT::init(SkOpSpanBase* span, double t, const SkPoint& pt, bool duplicate) {
     fT = t;
     fPt = pt;
     fSpan = span;
@@ skipping 28 matching lines @@
         SkOpPtT* next = prev->fNext;
         if (next == this) {
             prev->removeNext(this);
             SkASSERT(prev->fNext != prev);
             fDeleted = true;
             return prev;
         }
         prev = next;
     } while (prev != this);
     SkASSERT(0);
-    return NULL;
+    return nullptr;
 }
 
 void SkOpPtT::removeNext(SkOpPtT* kept) {
     SkASSERT(this->fNext);
     SkOpPtT* next = this->fNext;
     SkASSERT(this != next->fNext);
     this->fNext = next->fNext;
     SkOpSpanBase* span = next->span();
     next->setDeleted();
     if (span->ptT() == next) {
@@ skipping 104 matching lines @@
 }
 
 SkOpPtT* SkOpSpanBase::contains(const SkOpSegment* segment) {
     SkOpPtT* start = &fPtT;
     SkOpPtT* walk = start;
     while ((walk = walk->next()) != start) {
         if (walk->segment() == segment) {
             return walk;
         }
     }
-    return NULL;
+    return nullptr;
 }
 
 bool SkOpSpanBase::containsCoinEnd(const SkOpSegment* segment) const {
     SkASSERT(this->segment() != segment);
     const SkOpSpanBase* next = this;
     while ((next = next->fCoinEnd) != this) {
         if (next->segment() == segment) {
             return true;
         }
     }
     return false;
 }
 
 SkOpContour* SkOpSpanBase::contour() const {
     return segment()->contour();
 }
 
 SkOpGlobalState* SkOpSpanBase::globalState() const {
     return contour()->globalState(); 
 }
 
 void SkOpSpanBase::initBase(SkOpSegment* segment, SkOpSpan* prev, double t, const SkPoint& pt) {
     fSegment = segment;
     fPtT.init(this, t, pt, false);
     fCoinEnd = this;
-    fFromAngle = NULL;
+    fFromAngle = nullptr;
     fPrev = prev;
     fSpanAdds = 0;
     fAligned = true;
     fChased = false;
     SkDEBUGCODE(fCount = 1);
     SkDEBUGCODE(fID = globalState()->nextSpanID());
 }
 
 // this pair of spans share a common t value or point; merge them and eliminate duplicates
 // this does not compute the best t or pt value; this merely moves all data into a single list
@@ skipping 55 matching lines @@
     if (coincidence) {
         coincidence->fixUp(this->ptT(), kept);
     }
     this->ptT()->setDeleted();
 }
 
 void SkOpSpan::init(SkOpSegment* segment, SkOpSpan* prev, double t, const SkPoint& pt) {
     SkASSERT(t != 1);
     initBase(segment, prev, t, pt);
     fCoincident = this;
-    fToAngle = NULL;
+    fToAngle = nullptr;
     fWindSum = fOppSum = SK_MinS32;
     fWindValue = 1;
     fOppValue = 0;
     fTopTTry = 0;
     fChased = fDone = false;
     segment->bumpCount();
 }
 
 void SkOpSpan::setOppSum(int oppSum) {
     SkASSERT(!final());
     if (fOppSum != SK_MinS32 && fOppSum != oppSum) {
         this->globalState()->setWindingFailed();
         return;
     }
     SkASSERT(!DEBUG_LIMIT_WIND_SUM || SkTAbs(oppSum) <= DEBUG_LIMIT_WIND_SUM);
     fOppSum = oppSum;
 }
 
 void SkOpSpan::setWindSum(int windSum) {
     SkASSERT(!final());
     if (fWindSum != SK_MinS32 && fWindSum != windSum) {
         this->globalState()->setWindingFailed();
         return;
     }
     SkASSERT(!DEBUG_LIMIT_WIND_SUM || SkTAbs(windSum) <= DEBUG_LIMIT_WIND_SUM);
     fWindSum = windSum;
 }