Replace SmartArrayPointer<T> with unique_ptr<T[]>

src/profiler/strings-storage.cc

 // Copyright 2015 the V8 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.
 
 #include "src/profiler/strings-storage.h"
 
+#include <memory>
+
 #include "src/base/smart-pointers.h"
 #include "src/objects-inl.h"
 
 namespace v8 {
 namespace internal {
 
 
 bool StringsStorage::StringsMatch(void* key1, void* key2) {
   return strcmp(reinterpret_cast<char*>(key1), reinterpret_cast<char*>(key2)) ==
          0;
@@ skipping 57 matching lines @@
   }
   return AddOrDisposeString(str.start(), len);
 }
 
 
 const char* StringsStorage::GetName(Name* name) {
   if (name->IsString()) {
     String* str = String::cast(name);
     int length = Min(kMaxNameSize, str->length());
     int actual_length = 0;
-    base::SmartArrayPointer<char> data = str->ToCString(
+    std::unique_ptr<char[]> data = str->ToCString(
         DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL, 0, length, &actual_length);
-    return AddOrDisposeString(data.Detach(), actual_length);
+    return AddOrDisposeString(data.release(), actual_length);
   } else if (name->IsSymbol()) {
     return "<symbol>";
   }
   return "";
 }
 
 
 const char* StringsStorage::GetName(int index) {
   return GetFormatted("%d", index);
 }
@@ skipping 18 matching lines @@
   }
   return size;
 }
 
 base::HashMap::Entry* StringsStorage::GetEntry(const char* str, int len) {
   uint32_t hash = StringHasher::HashSequentialString(str, len, hash_seed_);
   return names_.LookupOrInsert(const_cast<char*>(str), hash);
 }
 }  // namespace internal
 }  // namespace v8