Move RefCountedMemory class to base namespace.

ui/gfx/color_analysis.h

 // Copyright (c) 2011 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.
 
 #ifndef UI_GFX_COLOR_ANALYSIS_H_
 #define UI_GFX_COLOR_ANALYSIS_H_
 #pragma once
 
 #include "base/basictypes.h"
 #include "base/compiler_specific.h"
@@ skipping 39 matching lines @@
    int calls_;
 };
 
 // Returns a recommended background color for a PNG image. This color might
 // not even exist in the image, but it is typically representative of the
 // image and tinted towards the white end of the spectrum.
 // The function CalculateKMeanColorOfPNG is used to grab the KMean calculated
 // color of the image, then the color is moved to HSV space so the saturation
 // and luminance can be modified to move the color towards the white end of
 // the spectrum. The color is then moved back to RGB space and returned.
-SkColor CalculateRecommendedBgColorForPNG(scoped_refptr<RefCountedMemory> png);
+SkColor CalculateRecommendedBgColorForPNG(
+    scoped_refptr<base::RefCountedMemory> png);
 
-SkColor CalculateRecommendedBgColorForPNG(scoped_refptr<RefCountedMemory> png,
-                                          KMeanImageSampler& sampler);
+SkColor CalculateRecommendedBgColorForPNG(
+    scoped_refptr<base::RefCountedMemory> png,
+    KMeanImageSampler& sampler);
 
 // Returns an SkColor that represents the calculated dominant color in the png.
 // This uses a KMean clustering algorithm to find clusters of pixel colors in
 // RGB space.
 // |png| represents the data of a png encoded image.
 // |darkness_limit| represents the minimum sum of the RGB components that is
 // acceptable as a color choice. This can be from 0 to 765.
 // |brightness_limit| represents the maximum sum of the RGB components that is
 // acceptable as a color choice. This can be from 0 to 765.
 //
@@ skipping 18 matching lines @@
 //     b) If any centroid moved, repeat step 2 with the new centroids for up
 //        to M iterations.
 // 5.Once the clusters have converged or M iterations have been tried, sort
 //   the clusters by weight (where weight is the number of pixels that make up
 //   this cluster).
 // 6.Going through the sorted list of clusters, pick the first cluster with the
 //   largest weight that's centroid fulfills the equation
 //   |darkness_limit| < SUM(R, G, B) < |brightness_limit|. Return that color.
 //   If no color fulfills that requirement return the color with the largest
 //   weight regardless of whether or not it fulfills the equation above.
-SkColor CalculateKMeanColorOfPNG(scoped_refptr<RefCountedMemory> png,
+SkColor CalculateKMeanColorOfPNG(scoped_refptr<base::RefCountedMemory> png,
                                  uint32_t darkness_limit,
                                  uint32_t brightness_limit);
 
-UI_EXPORT SkColor CalculateKMeanColorOfPNG(scoped_refptr<RefCountedMemory> png,
-                                           uint32_t darkness_limit,
-                                           uint32_t brightness_limit,
-                                           KMeanImageSampler& sampler);
+UI_EXPORT SkColor CalculateKMeanColorOfPNG(
+    scoped_refptr<base::RefCountedMemory> png,
+    uint32_t darkness_limit,
+    uint32_t brightness_limit,
+    KMeanImageSampler& sampler);
 
 }  // namespace color_utils
 
 #endif  // UI_GFX_COLOR_ANALYSIS_H_