Header cleanup in base....

base/field_trial.cc

-// Copyright (c) 2006-2009 The Chromium Authors. All rights reserved.
+// 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 "base/field_trial.h"
 
-#include "base/field_trial.h"
 #include "base/logging.h"
 #include "base/rand_util.h"
-#include "base/string_util.h"
+#include "base/stringprintf.h"
 
 using base::TimeTicks;
 
 // static
 const int FieldTrial::kNotParticipating = -1;
 
 // static
 const int FieldTrial::kAllRemainingProbability = -2;
 
 // static
@@ skipping 22 matching lines @@
          group_probability == kAllRemainingProbability);
   if (group_probability == kAllRemainingProbability)
     accumulated_group_probability_ = divisor_;
   else
     accumulated_group_probability_ += group_probability;
   DCHECK(accumulated_group_probability_ <= divisor_);
   if (group_ == kNotParticipating && accumulated_group_probability_ > random_) {
     // This is the group that crossed the random line, so we do the assignment.
     group_ = next_group_number_;
     if (name.empty())
-      StringAppendF(&group_name_, "%d", group_);
+      base::StringAppendF(&group_name_, "%d", group_);
     else
       group_name_ = name;
   }
   return next_group_number_++;
 }
 
 // static
 std::string FieldTrial::MakeName(const std::string& name_prefix,
                                  const std::string& trial_name) {
   std::string big_string(name_prefix);
@@ skipping 117 matching lines @@
         return false;
       continue;
     }
     const int kTotalProbability = 100;
     field_trial = new FieldTrial(name, kTotalProbability);
     field_trial->AppendGroup(group_name, kTotalProbability);
   }
   return true;
 }