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

chrome/browser/extensions/extensions_quota_service.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 "chrome/browser/extensions/extensions_quota_service.h"
 
 #include "base/message_loop.h"
 #include "base/stl_util.h"
 #include "chrome/browser/extensions/extension_function.h"
 #include "extensions/common/error_utils.h"
@@ skipping 24 matching lines @@
 }
 
 std::string ExtensionsQuotaService::Assess(
     const std::string& extension_id,
     ExtensionFunction* function,
     const ListValue* args,
     const base::TimeTicks& event_time) {
   DCHECK(CalledOnValidThread());
 
   if (function->ShouldSkipQuotaLimiting())
-    return "";
+    return std::string();
 
   // Lookup function list for extension.
   FunctionHeuristicsMap& functions = function_heuristics_[extension_id];
 
   // Lookup heuristics for function, create if necessary.
   QuotaLimitHeuristics& heuristics = functions[function->name()];
   if (heuristics.empty())
     function->GetQuotaLimitHeuristics(&heuristics);
 
   if (heuristics.empty())
-    return "";  // No heuristic implies no limit.
+    return std::string();  // No heuristic implies no limit.
 
   ViolationErrorMap::iterator violation_error =
       violation_errors_.find(extension_id);
   if (violation_error != violation_errors_.end())
     return violation_error->second;  // Repeat offender.
 
   QuotaLimitHeuristic* failed_heuristic = NULL;
   for (QuotaLimitHeuristics::iterator heuristic = heuristics.begin();
        heuristic != heuristics.end(); ++heuristic) {
     // Apply heuristic to each item (bucket).
     if (!(*heuristic)->ApplyToArgs(args, event_time)) {
       failed_heuristic = *heuristic;
       break;
     }
   }
 
   if (!failed_heuristic)
-    return "";
+    return std::string();
 
   std::string error = failed_heuristic->GetError();
   DCHECK_GT(error.length(), 0u);
 
   PurgeFunctionHeuristicsMap(&functions);
   function_heuristics_.erase(extension_id);
   violation_errors_[extension_id] = error;
   return error;
 }
 
@@ skipping 97 matching lines @@
       return false;
     }
   }
 
   // We can go negative since we check has_tokens when we get to *next* bucket,
   // and for the small interval all that matters is whether we used up all the
   // tokens (which is true if num_tokens_ <= 0).
   bucket->DeductToken();
   return true;
 }