Convert //base to use std::unique_ptr

base/md5_unittest.cc

 // Copyright (c) 2011 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 "base/md5.h"
+
 #include <string.h>
+
+#include <memory>
 #include <string>
 
-#include "base/memory/scoped_ptr.h"
-#include "base/md5.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 namespace base {
 
 TEST(MD5, DigestToBase16) {
   MD5Digest digest;
 
   int data[] = {
     0xd4, 0x1d, 0x8c, 0xd9,
     0x8f, 0x00, 0xb2, 0x04,
@@ skipping 39 matching lines @@
     0x31, 0xc3, 0x99, 0xe2,
     0x69, 0x77, 0x26, 0x61
   };
 
   for (int i = 0; i < 16; ++i)
     EXPECT_EQ(expected[i], digest.a[i] & 0xFF);
 }
 
 TEST(MD5, MD5SumLongData) {
   const int length = 10 * 1024 * 1024 + 1;
-  scoped_ptr<char[]> data(new char[length]);
+  std::unique_ptr<char[]> data(new char[length]);
 
   for (int i = 0; i < length; ++i)
     data[i] = i & 0xFF;
 
   MD5Digest digest;
   MD5Sum(data.get(), length, &digest);
 
   int expected[] = {
     0x90, 0xbd, 0x6a, 0xd9,
     0x0a, 0xce, 0xf5, 0xad,
@@ skipping 21 matching lines @@
 
   for (int i = 0; i < 16; ++i)
     EXPECT_EQ(expected[i], digest.a[i] & 0xFF);
 }
 
 TEST(MD5, ContextWithLongData) {
   MD5Context ctx;
   MD5Init(&ctx);
 
   const int length = 10 * 1024 * 1024 + 1;
-  scoped_ptr<char[]> data(new char[length]);
+  std::unique_ptr<char[]> data(new char[length]);
 
   for (int i = 0; i < length; ++i)
     data[i] = i & 0xFF;
 
   int total = 0;
   while (total < length) {
     int len = 4097;  // intentionally not 2^k.
     if (len > length - total)
       len = length - total;
 
@@ skipping 120 matching lines @@
 
   // The header and full digest pairs are the same, and they aren't the same as
   // each other.
   EXPECT_TRUE(!memcmp(&header_digest, &check_header_digest,
                       sizeof(header_digest)));
   EXPECT_TRUE(!memcmp(&digest, &check_full_digest, sizeof(digest)));
   EXPECT_TRUE(memcmp(&digest, &header_digest, sizeof(digest)));
 }
 
 }  // namespace base