Style Change: NULL->nullptr

src/pathops/SkOpCoincidence.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 "SkOpCoincidence.h"
 #include "SkOpSegment.h"
 #include "SkPathOpsTSect.h"
 
@@ skipping 199 matching lines @@
 
 /* detects overlaps of different coincident runs on same segment */
 /* does not detect overlaps for pairs without any segments in common */
 bool SkOpCoincidence::addMissing(SkChunkAlloc* allocator) {
     SkCoincidentSpans* outer = fHead;
     if (!outer) {
         return true;
     }
     bool result;
     fTop = outer;
-    fHead = NULL;
+    fHead = nullptr;
     do {
     // addifmissing can modify the list that this is walking
     // maybe save head so that walker can iterate over old data unperturbed
     // and addifmissing can add to head freely then add saved head in the end
         const SkOpSegment* outerCoin = outer->fCoinPtTStart->segment();
         SkASSERT(outerCoin == outer->fCoinPtTEnd->segment());
         const SkOpSegment* outerOpp = outer->fOppPtTStart->segment();
         SkASSERT(outerOpp == outer->fOppPtTEnd->segment());
         SkCoincidentSpans* inner = outer;
         while ((inner = inner->fNext)) {
@@ skipping 229 matching lines @@
                oNext = oStart;
             }
             oStart = oNext->upCast();
         } while (true);
     } while ((coin = coin->fNext));
     return true;
 }
 
 void SkOpCoincidence::detach(SkCoincidentSpans* remove) {
     SkCoincidentSpans* coin = fHead;
-    SkCoincidentSpans* prev = NULL;
+    SkCoincidentSpans* prev = nullptr;
     SkCoincidentSpans* next;
     do {
         next = coin->fNext;
         if (coin == remove) {
             if (prev) {
                 prev->fNext = next;
             } else {
                 fHead = next;
             }
             break;
@@ skipping 17 matching lines @@
         SkOpSpan* prev = start->prev();
         SkOpPtT* oppPtT;
         if (prev && (oppPtT = prev->contains(oppSegment))) {
             double midT = (prev->t() + start->t()) / 2;
             if (segment->isClose(midT, oppSegment)) {
                 coin->fCoinPtTStart = prev->ptT();
                 coin->fOppPtTStart = oppPtT;
                 expanded = true;
             }
         }
-        SkOpSpanBase* next = end->final() ? NULL : end->upCast()->next();
+        SkOpSpanBase* next = end->final() ? nullptr : end->upCast()->next();
         if (next && (oppPtT = next->contains(oppSegment))) {
             double midT = (end->t() + next->t()) / 2;
             if (segment->isClose(midT, oppSegment)) {
                 coin->fCoinPtTEnd = next->ptT();
                 coin->fOppPtTEnd = oppPtT;
                 expanded = true;
             }
         }
     } while ((coin = coin->fNext));
     return expanded;
 }
 
 void SkOpCoincidence::findOverlaps(SkOpCoincidence* overlaps, SkChunkAlloc* allocator) const {
-    overlaps->fHead = overlaps->fTop = NULL;
+    overlaps->fHead = overlaps->fTop = nullptr;
     SkDEBUGCODE_(overlaps->debugSetGlobalState(fDebugState));
     SkCoincidentSpans* outer = fHead;
     while (outer) {
         SkOpSegment* outerCoin = outer->fCoinPtTStart->segment();
         SkOpSegment* outerOpp = outer->fOppPtTStart->segment();
         SkCoincidentSpans* inner = outer;
         while ((inner = inner->fNext)) {
             SkOpSegment* innerCoin = inner->fCoinPtTStart->segment();
             if (outerCoin == innerCoin) {
                 continue;  // both winners are the same segment, so there's no additional overlap
@@ skipping 127 matching lines @@
     *overS = SkTMax(SkTMin(coin1s->fT, coin1e->fT), SkTMin(coin2s->fT, coin2e->fT));
     *overE = SkTMin(SkTMax(coin1s->fT, coin1e->fT), SkTMax(coin2s->fT, coin2e->fT));
     return *overS < *overE;
 }
 
 bool SkOpCoincidence::testForCoincidence(const SkCoincidentSpans* outer, SkOpPtT* testS,
         SkOpPtT* testE) const {
     return testS->segment()->testForCoincidence(testS, testE, testS->span(),
             testE->span(), outer->fCoinPtTStart->segment(), 120000);  // FIXME: replace with tuned
 }