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

third_party/WebKit/Source/core/html/HTMLSlotElementTest.cpp

 // Copyright 2017 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 "core/html/HTMLSlotElement.h"
 
 #include <array>
 
 #include "testing/gtest/include/gtest/gtest.h"
 
 namespace blink {
 
 namespace {
 constexpr int kTableSize = 16;
 using Seq = std::vector<char>;
 using Backtrack = std::pair<size_t, size_t>;
 }
 
-class HTMLSlotElementTest : public testing::Test {
+class HTMLSlotElementTest : public ::testing::Test {
  protected:
   HTMLSlotElementTest() {}
   Seq LongestCommonSubsequence(const Seq& seq1, const Seq& seq2);
   std::array<std::array<size_t, kTableSize>, kTableSize> lcs_table_;
   std::array<std::array<Backtrack, kTableSize>, kTableSize> backtrack_table_;
 };
 
 std::vector<char> HTMLSlotElementTest::LongestCommonSubsequence(
     const Seq& seq1,
     const Seq& seq2) {
@@ skipping 92 matching lines @@
   // If we use kTableSize here, it should hit DCHECK().
   std::fill_n(std::back_inserter(seq1), kTableSize - 1, 'a');
   Seq seq2;
   std::fill_n(std::back_inserter(seq2), kTableSize - 1, 'a');
   Seq lcs;
   std::fill_n(std::back_inserter(lcs), kTableSize - 1, 'a');
   EXPECT_EQ(lcs, LongestCommonSubsequence(seq1, seq2));
 }
 
 }  // namespace blink