Remove base::is_trivially_destructible and use the standard library.

base/trace_event/heap_profiler_allocation_register.h

 // Copyright 2015 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.
 
 #ifndef BASE_TRACE_EVENT_HEAP_PROFILER_ALLOCATION_REGISTER_H_
 #define BASE_TRACE_EVENT_HEAP_PROFILER_ALLOCATION_REGISTER_H_
 
 #include <stddef.h>
 #include <stdint.h>
 
+#include <type_traits>
 #include <utility>
 
 #include "base/bits.h"
 #include "base/logging.h"
 #include "base/macros.h"
 #include "base/process/process_metrics.h"
-#include "base/template_util.h"
 #include "base/trace_event/heap_profiler_allocation_context.h"
 #include "build/build_config.h"
 
 namespace base {
 namespace trace_event {
 
 class AllocationRegisterTest;
 
 namespace internal {
 
 // Allocates a region of virtual address space of |size| rounded up to the
 // system page size. The memory is zeroed by the system. A guard page is
 // added after the end.
 void* AllocateGuardedVirtualMemory(size_t size);
 
 // Frees a region of virtual address space allocated by a call to
 // |AllocateVirtualMemory|.
 void FreeGuardedVirtualMemory(void* address, size_t allocated_size);
 
 // Hash map that mmaps memory only once in the constructor. Its API is
 // similar to std::unordered_map, only index (KVIndex) is used to address
 template <size_t NumBuckets, class Key, class Value, class KeyHasher>
 class FixedHashMap {
   // To keep things simple we don't call destructors.
-  static_assert(is_trivially_destructible<Key>::value &&
-                    is_trivially_destructible<Value>::value,
+  static_assert(std::is_trivially_destructible<Key>::value &&
+                    std::is_trivially_destructible<Value>::value,
                 "Key and Value shouldn't have destructors");
+
  public:
   using KVPair = std::pair<const Key, Value>;
 
   // For implementation simplicity API uses integer index instead
   // of iterators. Most operations (except Find) on KVIndex are O(1).
   using KVIndex = size_t;
   enum : KVIndex { kInvalidKVIndex = static_cast<KVIndex>(-1) };
 
   // Capacity controls how many items this hash map can hold, and largely
   // affects memory footprint.
@@ skipping 314 matching lines @@
   // Sentinel used when we run out of backtraces_ storage.
   BacktraceMap::KVIndex out_of_storage_backtrace_index_;
 
   DISALLOW_COPY_AND_ASSIGN(AllocationRegister);
 };
 
 }  // namespace trace_event
 }  // namespace base
 
 #endif  // BASE_TRACE_EVENT_HEAP_PROFILER_ALLOCATION_REGISTER_H_