Style Change: NULL->nullptr

tests/ClipStackTest.cpp

 /*
  * Copyright 2011 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "Test.h"
 #if SK_SUPPORT_GPU
     #include "GrReducedClip.h"
@@ skipping 126 matching lines @@
 
     for (size_t i = 0; i < SK_ARRAY_COUNT(gRects); i++) {
         // the union op will prevent these from being fused together
         stack.clipDevRect(gRects[i], SkRegion::kUnion_Op, false);
     }
 
     assert_count(reporter, stack, 4);
 
     // bottom to top iteration
     {
-        const SkClipStack::Element* element = NULL;
+        const SkClipStack::Element* element = nullptr;
 
         SkClipStack::B2TIter iter(stack);
         int i;
 
         for (i = 0, element = iter.next(); element; ++i, element = iter.next()) {
             REPORTER_ASSERT(reporter, SkClipStack::Element::kRect_Type == element->getType());
             REPORTER_ASSERT(reporter, element->getRect() == gRects[i]);
         }
 
         SkASSERT(i == 4);
     }
 
     // top to bottom iteration
     {
-        const SkClipStack::Element* element = NULL;
+        const SkClipStack::Element* element = nullptr;
 
         SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart);
         int i;
 
         for (i = 3, element = iter.prev(); element; --i, element = iter.prev()) {
             REPORTER_ASSERT(reporter, SkClipStack::Element::kRect_Type == element->getType());
             REPORTER_ASSERT(reporter, element->getRect() == gRects[i]);
         }
 
         SkASSERT(i == -1);
     }
 
     // skipToTopmost
     {
-        const SkClipStack::Element* element = NULL;
+        const SkClipStack::Element* element = nullptr;
 
         SkClipStack::Iter iter(stack, SkClipStack::Iter::kBottom_IterStart);
 
         element = iter.skipToTopmost(SkRegion::kUnion_Op);
         REPORTER_ASSERT(reporter, SkClipStack::Element::kRect_Type == element->getType());
         REPORTER_ASSERT(reporter, element->getRect() == gRects[3]);
     }
 }
 
 // Exercise the SkClipStack's getConservativeBounds computation
@@ skipping 188 matching lines @@
 
         REPORTER_ASSERT(reporter, stack.isWideOpen());
         REPORTER_ASSERT(reporter, SkClipStack::kWideOpenGenID == stack.getTopmostGenID());
     }
 }
 
 static int count(const SkClipStack& stack) {
 
     SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart);
 
-    const SkClipStack::Element* element = NULL;
+    const SkClipStack::Element* element = nullptr;
     int count = 0;
 
     for (element = iter.prev(); element; element = iter.prev(), ++count) {
         ;
     }
 
     return count;
 }
 
 static void test_rect_inverse_fill(skiatest::Reporter* reporter) {
@@ skipping 560 matching lines @@
         inflatedBounds.outset(kBounds.width() / 2, kBounds.height() / 2);
         SkIRect inflatedIBounds;
         inflatedBounds.roundOut(&inflatedIBounds);
 
         typedef GrReducedClip::ElementList ElementList;
         // Get the reduced version of the stack.
         ElementList reducedClips;
         int32_t reducedGenID;
         GrReducedClip::InitialState initial;
         SkIRect tBounds(inflatedIBounds);
-        SkIRect* tightBounds = r.nextBool() ? &tBounds : NULL;
+        SkIRect* tightBounds = r.nextBool() ? &tBounds : nullptr;
         GrReducedClip::ReduceClipStack(stack,
                                        inflatedIBounds,
                                        &reducedClips,
                                        &reducedGenID,
                                        &initial,
                                        tightBounds);
 
         REPORTER_ASSERT(reporter, SkClipStack::kInvalidGenID != reducedGenID);
 
         // Build a new clip stack based on the reduced clip elements
@@ skipping 144 matching lines @@
             GrReducedClip::ElementList reducedClips;
             int32_t reducedGenID;
             GrReducedClip::InitialState initial;
             SkIRect tightBounds;
 
             GrReducedClip::ReduceClipStack(stack,
                                            testCases[i].testBounds,
                                            &reducedClips,
                                            &reducedGenID,
                                            &initial,
-                                           testCases[i].tighterBounds.isEmpty() ? NULL : &tightBounds);
+                                           testCases[i].tighterBounds.isEmpty() ? nullptr : &tightBounds);
 
             REPORTER_ASSERT(reporter, reducedClips.count() == testCases[i].reducedClipCount);
             SkASSERT(reducedClips.count() == testCases[i].reducedClipCount);
             REPORTER_ASSERT(reporter, reducedGenID == testCases[i].reducedGenID);
             SkASSERT(reducedGenID == testCases[i].reducedGenID);
             REPORTER_ASSERT(reporter, initial == testCases[i].initialState);
             SkASSERT(initial == testCases[i].initialState);
             if (!testCases[i].tighterBounds.isEmpty()) {
                 REPORTER_ASSERT(reporter, tightBounds == testCases[i].tighterBounds);
                 SkASSERT(tightBounds == testCases[i].tighterBounds);
@@ skipping 69 matching lines @@
     test_rect_replace(reporter);
     test_rect_inverse_fill(reporter);
     test_path_replace(reporter);
     test_quickContains(reporter);
 #if SK_SUPPORT_GPU
     test_reduced_clip_stack(reporter);
     test_reduced_clip_stack_genid(reporter);
     test_reduced_clip_stack_no_aa_crash(reporter);
 #endif
 }