Replace scoped_ptr with std::unique_ptr in //ui

ui/gfx/geometry/cubic_bezier_unittest.cc

 // Copyright 2014 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 "ui/gfx/geometry/cubic_bezier.h"
 
-#include "base/memory/scoped_ptr.h"
+#include <memory>
+
 #include "testing/gtest/include/gtest/gtest.h"
 
 namespace gfx {
 namespace {
 
 TEST(CubicBezierTest, Basic) {
   CubicBezier function(0.25, 0.0, 0.75, 1.0);
 
   double epsilon = 0.00015;
 
@@ skipping 55 matching lines @@
   EXPECT_NEAR(function.Solve(0.9), 1.15613, epsilon);
   EXPECT_NEAR(function.Solve(0.95), 1.08954, epsilon);
   EXPECT_NEAR(function.Solve(1.0), 1.0, epsilon);
 }
 
 TEST(CubicBezierTest, Range) {
   double epsilon = 0.00015;
   double min, max;
 
   // Derivative is a constant.
-  scoped_ptr<CubicBezier> function(
+  std::unique_ptr<CubicBezier> function(
       new CubicBezier(0.25, (1.0 / 3.0), 0.75, (2.0 / 3.0)));
   function->Range(&min, &max);
   EXPECT_EQ(0, min);
   EXPECT_EQ(1, max);
 
   // Derivative is linear.
   function.reset(new CubicBezier(0.25, -0.5, 0.75, (-1.0 / 6.0)));
   function->Range(&min, &max);
   EXPECT_NEAR(min, -0.225, epsilon);
   EXPECT_EQ(1, max);
@@ skipping 111 matching lines @@
   EXPECT_EQ(2.0, coincident_endpoint.Solve(2.0));
 
   CubicBezier three_coincident_points(0.0, 0.0, 0.0, 0.0);
   EXPECT_EQ(0, three_coincident_points.Solve(-1.0));
   EXPECT_EQ(2.0, three_coincident_points.Solve(2.0));
 
 }
 
 }  // namespace
 }  // namespace gfx