Move Time, TimeDelta and TimeTicks into namespace base.

chrome/browser/safe_browsing/safe_browsing_database_bloom.h

 // Copyright (c) 2006-2008 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_SAFE_BROWSING_SAFE_BROWSING_DATABASE_BLOOM_H_
 #define CHROME_BROWSER_SAFE_BROWSING_SAFE_BROWSING_DATABASE_BLOOM_H_
 
 #include <deque>
 #include <list>
 #include <queue>
@@ skipping 26 matching lines @@
   // Deletes the current database and creates a new one.
   virtual bool ResetDatabase();
 
   // Returns false if the given url is not in the database.  If it returns
   // true, then either "list" is the name of the matching list, or prefix_hits
   // contains the matching hash prefixes.
   virtual bool ContainsUrl(const GURL& url,
                            std::string* matching_list,
                            std::vector<SBPrefix>* prefix_hits,
                            std::vector<SBFullHashResult>* full_hits,
-                           Time last_update);
+                           base::Time last_update);
 
   // Processes add/sub commands.  Database will free the chunks when it's done.
   virtual void InsertChunks(const std::string& list_name,
                             std::deque<SBChunk>* chunks);
 
   // Processs adddel/subdel commands.  Database will free chunk_deletes when
   // it's done.
   virtual void DeleteChunks(std::vector<SBChunkDelete>* chunk_deletes);
 
   // Returns the lists and their add/sub chunks.
@@ skipping 85 matching lines @@
   void AddDel(int list_id, int add_chunk_id);
 
   // Processes a sub-del command, which just removes the sub chunk id from
   // our list.
   void SubDel(const std::string& list_name, int sub_chunk_id);
   void SubDel(int list_id, int sub_chunk_id);
 
   // Looks up any cached full hashes we may have.
   void GetCachedFullHashes(const std::vector<SBPrefix>* prefix_hits,
                            std::vector<SBFullHashResult>* full_hits,
-                           Time last_update);
+                           base::Time last_update);
 
   // Remove cached entries that have prefixes contained in the entry.
   void ClearCachedHashes(const SBEntry* entry);
 
   // Remove all GetHash entries that match the list and chunk id from an AddDel.
   void ClearCachedHashesForChunk(int list_id, int add_chunk_id);
 
   void HandleCorruptDatabase();
   void OnHandleCorruptDatabase();
 
@@ skipping 59 matching lines @@
   ScopedRunnableMethodFactory<SafeBrowsingDatabaseBloom> reset_factory_;
 
   // Used to schedule resuming from a lower power state.
   ScopedRunnableMethodFactory<SafeBrowsingDatabaseBloom> resume_factory_;
 
   // Used for caching GetHash results.
   typedef struct HashCacheEntry {
     SBFullHash full_hash;
     int list_id;
     int add_chunk_id;
-    Time received;
+    base::Time received;
   } HashCacheEntry;
 
   typedef std::list<HashCacheEntry> HashList;
   typedef base::hash_map<SBPrefix, HashList> HashCache;
   HashCache hash_cache_;
 
   // Cache of prefixes that returned empty results (no full hash match).
   std::set<SBPrefix> prefix_miss_cache_;
 
   // a cache of all of the existing add and sub chunks
   std::set<int> add_chunk_cache_;
   std::set<int> sub_chunk_cache_;
 
   // The number of entries in the add_prefix table. Used to pick the correct
   // size for the bloom filter.
   int add_count_;
 
   // Set to true if the machine just resumed out of a sleep.  When this happens,
   // we pause disk activity for some time to avoid thrashing the system while
   // it's presumably going to be pretty busy.
   bool did_resume_;
 
   DISALLOW_COPY_AND_ASSIGN(SafeBrowsingDatabaseBloom);
 };
 
 #endif  // CHROME_BROWSER_SAFE_BROWSING_SAFE_BROWSING_DATABASE_BLOOM_H_