Be explicit about namespace testing to not mix it with blink::testing

third_party/WebKit/Source/platform/scheduler/base/intrusive_heap_unittest.cc

 // Copyright 2016 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 "platform/scheduler/base/intrusive_heap.h"
 #include "testing/gmock/include/gmock/gmock.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 namespace blink {
 namespace scheduler {
@@ skipping 260 matching lines @@
   }
 
   heap.ChangeKey(index[5], {17, &index[5]});
 
   std::vector<int> results;
   while (!heap.empty()) {
     results.push_back(heap.Min().key);
     heap.Pop();
   }
 
-  EXPECT_THAT(results, testing::ElementsAre(0, 2, 4, 6, 8, 12, 14, 16, 17, 18));
+  EXPECT_THAT(results,
+              ::testing::ElementsAre(0, 2, 4, 6, 8, 12, 14, 16, 17, 18));
 }
 
 TEST_F(IntrusiveHeapTest, ChangeKeyUpButDoesntMove) {
   IntrusiveHeap<TestElement> heap;
   HeapHandle index[10];
 
   for (size_t i = 0; i < 10; i++) {
     heap.insert({static_cast<int>(i) * 2, &index[i]});
   }
 
   heap.ChangeKey(index[5], {11, &index[5]});
 
   std::vector<int> results;
   while (!heap.empty()) {
     results.push_back(heap.Min().key);
     heap.Pop();
   }
 
-  EXPECT_THAT(results, testing::ElementsAre(0, 2, 4, 6, 8, 11, 12, 14, 16, 18));
+  EXPECT_THAT(results,
+              ::testing::ElementsAre(0, 2, 4, 6, 8, 11, 12, 14, 16, 18));
 }
 
 TEST_F(IntrusiveHeapTest, ChangeKeyDown) {
   IntrusiveHeap<TestElement> heap;
   HeapHandle index[10];
 
   for (size_t i = 0; i < 10; i++) {
     heap.insert({static_cast<int>(i) * 2, &index[i]});
   }
 
   heap.ChangeKey(index[5], {1, &index[5]});
 
   std::vector<int> results;
   while (!heap.empty()) {
     results.push_back(heap.Min().key);
     heap.Pop();
   }
 
-  EXPECT_THAT(results, testing::ElementsAre(0, 1, 2, 4, 6, 8, 12, 14, 16, 18));
+  EXPECT_THAT(results,
+              ::testing::ElementsAre(0, 1, 2, 4, 6, 8, 12, 14, 16, 18));
 }
 
 TEST_F(IntrusiveHeapTest, ChangeKeyDownButDoesntMove) {
   IntrusiveHeap<TestElement> heap;
   HeapHandle index[10];
 
   for (size_t i = 0; i < 10; i++) {
     heap.insert({static_cast<int>(i) * 2, &index[i]});
   }
 
   heap.ChangeKey(index[5], {9, &index[5]});
 
   std::vector<int> results;
   while (!heap.empty()) {
     results.push_back(heap.Min().key);
     heap.Pop();
   }
 
-  EXPECT_THAT(results, testing::ElementsAre(0, 2, 4, 6, 8, 9, 12, 14, 16, 18));
+  EXPECT_THAT(results,
+              ::testing::ElementsAre(0, 2, 4, 6, 8, 9, 12, 14, 16, 18));
 }
 
 TEST_F(IntrusiveHeapTest, ChangeKeyCheckAllFinalPositions) {
   HeapHandle index[100];
 
   for (int j = -1; j <= 201; j += 2) {
     IntrusiveHeap<TestElement> heap;
     for (size_t i = 0; i < 100; i++) {
       heap.insert({static_cast<int>(i) * 2, &index[i]});
     }
@@ skipping 16 matching lines @@
 
   // This is the stdlibc++ assertion that fails in http://crbug.com/661080
   EXPECT_FALSE(IntrusiveHeapTest::CompareNodes(six, six));
 
   EXPECT_FALSE(IntrusiveHeapTest::CompareNodes(five, six));
   EXPECT_TRUE(IntrusiveHeapTest::CompareNodes(six, five));
 }
 
 }  // namespace scheduler
 }  // namespace blink