Move base/values.h into the base namespace.

chrome/browser/sync/syncable/syncable_id.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 CHROME_BROWSER_SYNC_SYNCABLE_SYNCABLE_ID_H_
 #define CHROME_BROWSER_SYNC_SYNCABLE_SYNCABLE_ID_H_
 #pragma once
 
 #include <iosfwd>
 #include <limits>
 #include <sstream>
 #include <string>
 
 #include "base/hash_tables.h"
 
+namespace base {
 class StringValue;
+}
 
 namespace syncable {
 struct EntryKernel;
 class Id;
 }
 
 class MockConnectionManager;
 class SQLStatement;
 
 namespace syncable {
@@ skipping 61 matching lines @@
   inline bool operator > (const Id& that) const {
     return s_ > that.s_;
   }
   // Return the next highest ID in the lexicographic ordering.  This is
   // useful for computing upper bounds on std::sets that are ordered
   // by operator<.
   Id GetLexicographicSuccessor() const;
 
   // Dumps the ID as a value and returns it.  Transfers ownership of
   // the StringValue to the caller.
-  StringValue* ToValue() const;
+  base::StringValue* ToValue() const;
 
   // Three functions are used to work with our proto buffers.
   std::string GetServerId() const;
   static Id CreateFromServerId(const std::string& server_id);
   // This should only be used if you get back a reference to a local
   // id from the server. Returns a client only opaque id.
   static Id CreateFromClientString(const std::string& local_id);
 
   // This method returns an ID that will compare less than any valid ID.
   // The returned ID is not a valid ID itself.  This is useful for
   // computing lower bounds on std::sets that are ordered by operator<.
   static Id GetLeastIdForLexicographicComparison();
 
  private:
   std::string s_;
 };
 
 extern const Id kNullId;
 
 }  // namespace syncable
 
 #endif  // CHROME_BROWSER_SYNC_SYNCABLE_SYNCABLE_ID_H_