[presubmit] Enable readability/namespace linter checking.

test/unittests/compiler/node-matchers-unittest.cc

 // Copyright 2014 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/compiler/common-operator.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/machine-operator.h"
 #include "src/compiler/node.h"
 #include "src/compiler/node-matchers.h"
 #include "src/compiler/opcodes.h"
@@ skipping 20 matching lines @@
 
 template <class Matcher>
 void CheckBaseWithIndexAndDisplacement(Matcher* matcher, Node* index, int scale,
                                        Node* base, Node* displacement) {
   EXPECT_TRUE(matcher->matches());
   EXPECT_EQ(index, matcher->index());
   EXPECT_EQ(scale, matcher->scale());
   EXPECT_EQ(base, matcher->base());
   EXPECT_EQ(displacement, matcher->displacement());
 }
-};
+
+}  // namespace
 
 
 TEST_F(NodeMatcherTest, ScaledWithOffset32Matcher) {
   graph()->SetStart(graph()->NewNode(common()->Start(0)));
 
   const Operator* d0_op = common()->Int32Constant(0);
   Node* d0 = graph()->NewNode(d0_op);
   USE(d0);
   const Operator* d1_op = common()->Int32Constant(1);
   Node* d1 = graph()->NewNode(d1_op);
@@ skipping 890 matching lines @@
     Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
     DiamondMatcher matcher(merge);
     EXPECT_FALSE(matcher.Matched());
   }
 }
 
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8