More switching to standard type traits

third_party/WebKit/Source/platform/graphics/ContiguousContainerTest.cpp

 // 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.
 
 #include "config.h"
 #include "platform/graphics/ContiguousContainer.h"
 
 #include "testing/gmock/include/gmock/gmock.h"
 #include "testing/gtest/include/gtest/gtest.h"
 #include "wtf/TypeTraits.h"
@@ skipping 216 matching lines @@
     ContiguousContainer<Point2D, kPointAlignment> list(kMaxPointSize);
     for (int i = 0; i < (int)kNumElements; i++)
         list.allocateAndConstruct<Point2D>(i, i);
     unsigned count = 0;
     for (Point2D& point : list) {
         EXPECT_EQ((int)count, point.x);
         count++;
     }
     EXPECT_EQ(kNumElements, count);
 
-    static_assert(WTF::IsSameType<decltype(*list.begin()), Point2D&>::value,
+    static_assert(std::is_same<decltype(*list.begin()), Point2D&>::value,
         "Non-const iteration should produce non-const references.");
 }
 
 TEST(ContiguousContainerTest, ConstForwardIteration)
 {
     ContiguousContainer<Point2D, kPointAlignment> list(kMaxPointSize);
     for (int i = 0; i < (int)kNumElements; i++)
         list.allocateAndConstruct<Point2D>(i, i);
 
     const auto& constList = list;
     unsigned count = 0;
     for (const Point2D& point : constList) {
         EXPECT_EQ((int)count, point.x);
         count++;
     }
     EXPECT_EQ(kNumElements, count);
 
-    static_assert(WTF::IsSameType<decltype(*constList.begin()), const Point2D&>::value,
+    static_assert(std::is_same<decltype(*constList.begin()), const Point2D&>::value,
         "Const iteration should produce const references.");
 }
 
 TEST(ContiguousContainerTest, ReverseIteration)
 {
     ContiguousContainer<Point2D, kPointAlignment> list(kMaxPointSize);
     for (int i = 0; i < (int)kNumElements; i++)
         list.allocateAndConstruct<Point2D>(i, i);
 
     unsigned count = 0;
     for (auto it = list.rbegin(); it != list.rend(); ++it) {
         EXPECT_EQ((int)(kNumElements - 1 - count), it->x);
         count++;
     }
     EXPECT_EQ(kNumElements, count);
 
-    static_assert(WTF::IsSameType<decltype(*list.rbegin()), Point2D&>::value,
+    static_assert(std::is_same<decltype(*list.rbegin()), Point2D&>::value,
         "Non-const iteration should produce non-const references.");
 }
 
 // Checks that the latter list has pointers to the elements of the former.
 template <typename It1, typename It2>
 bool EqualPointers(It1 it1, const It1& end1, It2 it2)
 {
     for (; it1 != end1; ++it1, ++it2) {
         if (&*it1 != *it2)
             return false;
@@ skipping 237 matching lines @@
     ContiguousContainer<Point2D, kPointAlignment> list(kMaxPointSize);
     size_t emptyCapacity = list.capacityInBytes();
     list.allocateAndConstruct<Point2D>();
     list.allocateAndConstruct<Point2D>();
     list.clear();
     EXPECT_EQ(emptyCapacity, list.capacityInBytes());
 }
 
 } // namespace
 } // namespace blink