Rewrite std::string("") to std::string(), Linux edition.

base/test/trace_event_analyzer_unittest.cc

 // Copyright (c) 2012 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 "base/bind.h"
 #include "base/debug/trace_event_unittest.h"
 #include "base/test/trace_event_analyzer.h"
 #include "testing/gmock/include/gmock/gmock.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
@@ skipping 768 matching lines @@
   events.resize(num_events);
   for (size_t i = 0; i < events.size(); ++i) {
     // timestamps go up exponentially so the lower index is always closer in
     // time than the higher index.
     events[i].timestamp = static_cast<double>(i) * static_cast<double>(i);
     event_ptrs.push_back(&events[i]);
   }
   events[0].name = "one";
   events[2].name = "two";
   events[4].name = "three";
-  Query query_named = Query::EventName() != Query::String("");
+  Query query_named = Query::EventName() != Query::String(std::string());
   Query query_one = Query::EventName() == Query::String("one");
 
   // Only one event matches query_one, so two closest can't be found.
   EXPECT_FALSE(FindClosest(event_ptrs, query_one, 0, &index_1, &index_2));
 
   EXPECT_TRUE(FindClosest(event_ptrs, query_one, 3, &index_1, NULL));
   EXPECT_EQ(0u, index_1);
 
   EXPECT_TRUE(FindClosest(event_ptrs, query_named, 1, &index_1, &index_2));
   EXPECT_EQ(0u, index_1);
@@ skipping 15 matching lines @@
 
   size_t num_events = 5;
   size_t num_named = 3;
   std::vector<TraceEvent> events;
   events.resize(num_events);
   for (size_t i = 0; i < events.size(); ++i)
     event_ptrs.push_back(&events[i]);
   events[0].name = "one";
   events[2].name = "two";
   events[4].name = "three";
-  Query query_named = Query::EventName() != Query::String("");
+  Query query_named = Query::EventName() != Query::String(std::string());
   Query query_one = Query::EventName() == Query::String("one");
 
   EXPECT_EQ(0u, CountMatches(event_ptrs, Query::Bool(false)));
   EXPECT_EQ(num_events, CountMatches(event_ptrs, Query::Bool(true)));
   EXPECT_EQ(num_events - 1, CountMatches(event_ptrs, Query::Bool(true),
                                          1, num_events));
   EXPECT_EQ(1u, CountMatches(event_ptrs, query_one));
   EXPECT_EQ(num_events - 1, CountMatches(event_ptrs, !query_one));
   EXPECT_EQ(num_named, CountMatches(event_ptrs, query_named));
 }
 
 
 }  // namespace trace_analyzer