Convert most of extensions and some other random stuff to using the base namespace for Values.

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 19 matching lines @@
 
 ExtensionsQuotaService::~ExtensionsQuotaService() {
   DCHECK(CalledOnValidThread());
   purge_timer_.Stop();
   Purge();
 }
 
 std::string ExtensionsQuotaService::Assess(
     const std::string& extension_id,
     ExtensionFunction* function,
-    const ListValue* args,
+    const base::ListValue* args,
     const base::TimeTicks& event_time) {
   DCHECK(CalledOnValidThread());
 
   if (function->ShouldSkipQuotaLimiting())
     return std::string();
 
   // Lookup function list for extension.
   FunctionHeuristicsMap& functions = function_heuristics_[extension_id];
 
   // Lookup heuristics for function, create if necessary.
@@ skipping 48 matching lines @@
     PurgeFunctionHeuristicsMap(&it->second);
 }
 
 void QuotaLimitHeuristic::Bucket::Reset(const Config& config,
     const base::TimeTicks& start) {
   num_tokens_ = config.refill_token_count;
   expiration_ = start + config.refill_interval;
 }
 
 void QuotaLimitHeuristic::SingletonBucketMapper::GetBucketsForArgs(
-    const ListValue* args,
+    const base::ListValue* args,
     BucketList* buckets) {
   buckets->push_back(&bucket_);
 }
 
 QuotaLimitHeuristic::QuotaLimitHeuristic(const Config& config,
                                          BucketMapper* map,
                                          const std::string& name)
     : config_(config), bucket_mapper_(map), name_(name) {
 }
 
 QuotaLimitHeuristic::~QuotaLimitHeuristic() {}
 
-bool QuotaLimitHeuristic::ApplyToArgs(const ListValue* args,
+bool QuotaLimitHeuristic::ApplyToArgs(const base::ListValue* args,
     const base::TimeTicks& event_time) {
   BucketList buckets;
   bucket_mapper_->GetBucketsForArgs(args, &buckets);
   for (BucketList::iterator i = buckets.begin(); i != buckets.end(); ++i) {
     if ((*i)->expiration().is_null())  // A brand new bucket.
       (*i)->Reset(config_, event_time);
     if (!Apply(*i, event_time))
       return false;  // It only takes one to spoil it for everyone.
   }
   return true;
@@ skipping 49 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;
 }