Style Change: NULL->nullptr

src/core/SkTLList.h

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkTLList_DEFINED
 #define SkTLList_DEFINED
 
@@ skipping 85 matching lines @@
     T* addToTail() {
         this->validate();
         Node* node = this->createNode();
         fList.addToTail(node);
         new (node->fObj) T;
         this->validate();
         return reinterpret_cast<T*>(node->fObj);
     }
 
     /** Adds a new element to the list before the location indicated by the iterator. If the
-        iterator refers to a NULL location then the new element is added at the tail */
+        iterator refers to a nullptr location then the new element is added at the tail */
     T* addBefore(const T& t, const Iter& location) {
         return new (this->internalAddBefore(location)) T(t);
     }
 
     /** Adds a new element to the list after the location indicated by the iterator. If the
-        iterator refers to a NULL location then the new element is added at the head */
+        iterator refers to a nullptr location then the new element is added at the head */
     T* addAfter(const T& t, const Iter& location) {
         return new (this->internalAddAfter(location)) T(t);
     }
 
     /** Convenience methods for getting an iterator initialized to the head/tail of the list. */
     Iter headIter() const { return Iter(*this, Iter::kHead_IterStart); }
     Iter tailIter() const { return Iter(*this, Iter::kTail_IterStart); }
 
     T* head() { return Iter(*this, Iter::kHead_IterStart).get(); }
     T* tail() { return Iter(*this, Iter::kTail_IterStart).get(); }
@@ skipping 92 matching lines @@
         Iter& operator= (const Iter& iter) { INHERITED::operator=(iter); return *this; }
 
     private:
         friend class SkTLList;
         Node* getNode() { return INHERITED::get(); }
 
         T* nodeToObj(Node* node) {
             if (node) {
                 return reinterpret_cast<T*>(node->fObj);
             } else {
-                return NULL;
+                return nullptr;
             }
         }
     };
 
     // For use with operator new
     enum Placement {
         kBefore_Placement,
         kAfter_Placement,
     };
 
@@ skipping 158 matching lines @@
 #define SkNEW_INSERT_IN_LLIST_AFTER(list, location, type_name, args) \
     (new ((list), SkTLList< type_name >::kAfter_Placement, (location)) type_name args)
 
 #define SkNEW_INSERT_AT_LLIST_HEAD(list, type_name, args) \
     SkNEW_INSERT_IN_LLIST_BEFORE((list), (list)->headIter(), type_name, args)
 
 #define SkNEW_INSERT_AT_LLIST_TAIL(list, type_name, args) \
     SkNEW_INSERT_IN_LLIST_AFTER((list), (list)->tailIter(), type_name, args)
 
 #endif