base: Get rid of 'using' declaration of StringAppendF.

courgette/adjustment_method.cc

 // Copyright (c) 2010 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 "courgette/adjustment_method.h"
 
 #include <algorithm>
 #include <list>
 #include <map>
 #include <set>
@@ skipping 63 matching lines @@
 };
 
 struct OrderLabelInfoByAddressAscending {
   bool operator()(const LabelInfo* a, const LabelInfo* b) const {
     return a->label_->rva_ < b->label_->rva_;
   }
 };
 
 static std::string ToString(LabelInfo* info) {
   std::string s;
-  StringAppendF(&s, "%c%d", "pm"[info->is_model_], info->debug_index_);
+  base::StringAppendF(&s, "%c%d", "pm"[info->is_model_], info->debug_index_);
   if (info->label_->index_ != Label::kNoIndex)
-    StringAppendF(&s, " (%d)", info->label_->index_);
+    base::StringAppendF(&s, " (%d)", info->label_->index_);
 
-  StringAppendF(&s, " #%u", info->refs_);
+  base::StringAppendF(&s, " #%u", info->refs_);
   return s;
 }
 
 // General graph matching is exponential, essentially trying all permutations.
 // The exponential algorithm can be made faster by avoiding consideration of
 // impossible or unlikely matches.  We can make the matching practical by eager
 // matching - by looking for likely matches and commiting to them, and using the
 // committed assignment as the basis for further matching.
 //
 // The basic eager graph-matching assignment is based on several ideas:
@@ skipping 586 matching lines @@
   AdjustmentMethod* method = AdjustmentMethod::MakeProductionAdjustmentMethod();
   bool ok = method->Adjust(model, program);
   method->Destroy();
   if (ok)
     return C_OK;
   else
     return C_ADJUSTMENT_FAILED;
 }
 
 }  // namespace courgette