Style Change: NULL->nullptr

tests/LListTest.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 "SkRandom.h"
 #include "SkTInternalLList.h"
 #include "SkTLList.h"
@@ skipping 73 matching lines @@
 
     check_list(list, reporter, false, 1, false, false, true, false, elements);
 
     // remove last element
     list.remove(&elements[2]);
 
     // list should be empty again
     check_list(list, reporter, true, 0, false, false, false, false, elements);
 
     // test out methods that add to the middle of the list.
-    list.addAfter(&elements[1], NULL);
+    list.addAfter(&elements[1], nullptr);
     check_list(list, reporter, false, 1, false, true, false, false, elements);
 
     list.remove(&elements[1]);
 
-    list.addBefore(&elements[1], NULL);
+    list.addBefore(&elements[1], nullptr);
     check_list(list, reporter, false, 1, false, true, false, false, elements);
 
     list.addBefore(&elements[0], &elements[1]);
     check_list(list, reporter, false, 2, true, true, false, false, elements);
 
     list.addAfter(&elements[3], &elements[1]);
     check_list(list, reporter, false, 3, true, true, false, true, elements);
 
     list.addBefore(&elements[2], &elements[3]);
     check_list(list, reporter, false, 4, true, true, true, true, elements);
@@ skipping 12 matching lines @@
     for (int i = 1; i <= 16; i *= 2) {
 
         ElList list1(i);
         ElList list2(i);
         Iter iter1;
         Iter iter2;
         Iter iter3;
         Iter iter4;
 
         REPORTER_ASSERT(reporter, list1.isEmpty());
-        REPORTER_ASSERT(reporter, NULL == iter1.init(list1, Iter::kHead_IterStart));
-        REPORTER_ASSERT(reporter, NULL == iter1.init(list1, Iter::kTail_IterStart));
+        REPORTER_ASSERT(reporter, nullptr == iter1.init(list1, Iter::kHead_IterStart));
+        REPORTER_ASSERT(reporter, nullptr == iter1.init(list1, Iter::kTail_IterStart));
         // Try popping an empty list
         list1.popHead();
         list1.popTail();
         REPORTER_ASSERT(reporter, list1.isEmpty());
         REPORTER_ASSERT(reporter, list1 == list2);
 
         // Create two identical lists, one by appending to head and the other to the tail.
         list1.addToHead(ListElement(1));
         list2.addToTail(ListElement(1));
         iter1.init(list1, Iter::kHead_IterStart);
@@ skipping 120 matching lines @@
                 Iter next = iter;
                 prev.prev();
                 next.next();
                 list1.remove(iter.get());
 
                 // make sure the remembered next/prev iters still work
                 Iter pn = prev; pn.next();
                 Iter np = next; np.prev();
                 // pn should match next unless the target node was the head, in which case prev
                 // walked off the list.
-                REPORTER_ASSERT(reporter, pn.get() == next.get() || NULL == prev.get());
+                REPORTER_ASSERT(reporter, pn.get() == next.get() || nullptr == prev.get());
                 // Similarly, np should match prev unless next originally walked off the tail.
-                REPORTER_ASSERT(reporter, np.get() == prev.get() || NULL == next.get());
+                REPORTER_ASSERT(reporter, np.get() == prev.get() || nullptr == next.get());
                 --count;
             }
             REPORTER_ASSERT(reporter, count == list1.count());
         }
         list1.reset();
     }
 }
 
 DEF_TEST(LList, reporter) {
     TestTInternalLList(reporter);
     TestTLList(reporter);
 }