[C++11 Allowed Features] Declares a type-safe null pointer converting from NULL to nullptr in src/…

cc/resources/raster_tile_priority_queue.cc

 // Copyright 2014 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "cc/resources/raster_tile_priority_queue.h"
 
 namespace cc {
 
 namespace {
 
@@ skipping 183 matching lines @@
           next_tree == ACTIVE_TREE ? &active_iterator : &pending_iterator;
 
       // Accept all non-shared tiles.
       const Tile* tile = **next_iterator;
       if (!tile->is_shared())
         break;
 
       // Accept a shared tile if the next tree is the higher priority one
       // corresponding the iterator (active or pending) which usually (but due
       // to spiral iterators not always) returns the shared tile first.
-      if (next_tree == HigherPriorityTree(tree_priority, NULL, NULL, tile))
+      if (next_tree == HigherPriorityTree(tree_priority, NULL, nullptr, tile))
         break;
     }
   }
 
   // If no empty, use Top to do DCHECK the next iterator.
   DCHECK(IsEmpty() || Top(tree_priority));
 }
 
 WhichTree
 RasterTilePriorityQueue::PairedPictureLayerQueue::NextTileIteratorTree(
     TreePriority tree_priority) const {
   DCHECK(!IsEmpty());
 
   // If we only have one iterator with tiles, return it.
   if (!active_iterator)
     return PENDING_TREE;
   if (!pending_iterator)
     return ACTIVE_TREE;
 
   // Now both iterators have tiles, so we have to decide based on tree priority.
   return HigherPriorityTree(
-      tree_priority, &active_iterator, &pending_iterator, NULL);
+      tree_priority, &active_iterator, &pending_iterator, nullptr);
 }
 
 }  // namespace cc