Replace NULL with nullptr in all C++ files.

webrtc/modules/rtp_rtcp/source/vp8_partition_aggregator_unittest.cc

 /*
  *  Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
  *
  *  Use of this source code is governed by a BSD-style license
  *  that can be found in the LICENSE file in the root of the source
  *  tree. An additional intellectual property rights grant can be found
  *  in the file PATENTS.  All contributing project authors may
  *  be found in the AUTHORS file in the root of the source tree.
  */
 
-#include <stdlib.h>  // NULL
+#include <stdlib.h>  // nullptr
 
 #include "webrtc/modules/rtp_rtcp/source/vp8_partition_aggregator.h"
 #include "webrtc/test/gtest.h"
 
 namespace webrtc {
 
 TEST(PartitionTreeNode, CreateAndDelete) {
   const size_t kVector[] = {1, 2, 3};
   const size_t kNumPartitions = GTEST_ARRAY_SIZE_(kVector);
   PartitionTreeNode* node1 =
       PartitionTreeNode::CreateRootNode(kVector, kNumPartitions);
   PartitionTreeNode* node2 =
       new PartitionTreeNode(node1, kVector, kNumPartitions, 17);
   delete node1;
   delete node2;
 }
 
 TEST(PartitionTreeNode, CreateChildrenAndDelete) {
   const size_t kVector[] = {1, 2, 3};
   const size_t kNumPartitions = GTEST_ARRAY_SIZE_(kVector);
   const size_t kMaxSize = 10;
   const size_t kPenalty = 5;
   PartitionTreeNode* root =
       PartitionTreeNode::CreateRootNode(kVector, kNumPartitions);
   EXPECT_TRUE(root->CreateChildren(kMaxSize));
-  ASSERT_TRUE(NULL != root->left_child());
-  ASSERT_TRUE(NULL != root->right_child());
+  ASSERT_TRUE(nullptr != root->left_child());
+  ASSERT_TRUE(nullptr != root->right_child());
   EXPECT_EQ(3u, root->left_child()->this_size());
   EXPECT_EQ(2u, root->right_child()->this_size());
   EXPECT_EQ(11, root->right_child()->Cost(kPenalty));
   EXPECT_FALSE(root->left_child()->packet_start());
   EXPECT_TRUE(root->right_child()->packet_start());
   delete root;
 }
 
 TEST(PartitionTreeNode, FindOptimalConfig) {
   const size_t kVector[] = {197, 194, 213, 215, 184, 199, 197, 207};
   const size_t kNumPartitions = GTEST_ARRAY_SIZE_(kVector);
   const size_t kMaxSize = 1500;
   const size_t kPenalty = 1;
   PartitionTreeNode* root =
       PartitionTreeNode::CreateRootNode(kVector, kNumPartitions);
   root->set_max_parent_size(500);
   root->set_min_parent_size(300);
   PartitionTreeNode* opt = root->GetOptimalNode(kMaxSize, kPenalty);
-  ASSERT_TRUE(opt != NULL);
+  ASSERT_TRUE(opt != nullptr);
   EXPECT_EQ(4u, opt->NumPackets());
   // Expect optimal sequence to be {1, 0, 1, 0, 1, 0, 1, 0}, which corresponds
   // to (right)-left-right-left-right-left-right-left, where the root node is
   // implicitly a "right" node by definition.
   EXPECT_TRUE(opt->parent()->parent()->parent()->parent()->parent()->
               parent()->parent()->packet_start());
   EXPECT_FALSE(opt->parent()->parent()->parent()->parent()->parent()->
                parent()->packet_start());
   EXPECT_TRUE(opt->parent()->parent()->parent()->parent()->parent()->
               packet_start());
   EXPECT_FALSE(opt->parent()->parent()->parent()->parent()->packet_start());
   EXPECT_TRUE(opt->parent()->parent()->parent()->packet_start());
   EXPECT_FALSE(opt->parent()->parent()->packet_start());
   EXPECT_TRUE(opt->parent()->packet_start());
   EXPECT_FALSE(opt->packet_start());
   EXPECT_TRUE(opt == root->left_child()->right_child()->left_child()->
               right_child()->left_child()->right_child()->left_child());
   delete root;
 }
 
 TEST(PartitionTreeNode, FindOptimalConfigSinglePartition) {
   const size_t kVector[] = {17};
   const size_t kNumPartitions = GTEST_ARRAY_SIZE_(kVector);
   const size_t kMaxSize = 1500;
   const size_t kPenalty = 1;
   PartitionTreeNode* root =
       PartitionTreeNode::CreateRootNode(kVector, kNumPartitions);
   PartitionTreeNode* opt = root->GetOptimalNode(kMaxSize, kPenalty);
-  ASSERT_TRUE(opt != NULL);
+  ASSERT_TRUE(opt != nullptr);
   EXPECT_EQ(1u, opt->NumPackets());
   EXPECT_TRUE(opt == root);
   delete root;
 }
 
 static void VerifyConfiguration(
     const size_t* expected_config,
     size_t expected_config_len,
     const Vp8PartitionAggregator::ConfigVec& opt_config,
     const RTPFragmentationHeader& fragmentation) {
@@ skipping 106 matching lines @@
                 1600, kMTU, 1, 300, 900));
   EXPECT_EQ(3u,
             Vp8PartitionAggregator::CalcNumberOfFragments(
                 1600, kMTU, 1, 300, 798));
   EXPECT_EQ(2u,
             Vp8PartitionAggregator::CalcNumberOfFragments(
                 1600, kMTU, 1, 900, 1000));
 }
 
 }  // namespace webrtc