Remove dependency on //content from history DownloadDatabase

chrome/browser/safe_browsing/incident_reporting/last_download_finder.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 "chrome/browser/safe_browsing/incident_reporting/last_download_finder.h"
 
 #include <algorithm>
 #include <functional>
 #include <utility>
 
 #include "base/bind.h"
 #include "base/macros.h"
 #include "base/prefs/pref_service.h"
 #include "chrome/browser/browser_process.h"
 #include "chrome/browser/chrome_notification_types.h"
 #include "chrome/browser/history/history_service.h"
 #include "chrome/browser/history/history_service_factory.h"
 #include "chrome/browser/profiles/profile_manager.h"
 #include "chrome/common/pref_names.h"
 #include "chrome/common/safe_browsing/csd.pb.h"
 #include "chrome/common/safe_browsing/download_protection_util.h"
-#include "content/public/browser/download_item.h"
+#include "components/history/core/browser/download_constants.h"
 #include "content/public/browser/notification_details.h"
 #include "content/public/browser/notification_service.h"
 #include "content/public/browser/notification_source.h"
 
 namespace safe_browsing {
 
 namespace {
 
 // The following functions are overloaded for the two object types that
 // represent the metadata for a download: history::DownloadRow and
@@ skipping 45 matching lines @@
           (HasBeenOpened(first) && !HasBeenOpened(second)));
 }
 
 // Returns a pointer to the most interesting completed download in |downloads|.
 const history::DownloadRow* FindMostInteresting(
     const std::vector<history::DownloadRow>& downloads) {
   const history::DownloadRow* most_recent_row = NULL;
   for (size_t i = 0; i < downloads.size(); ++i) {
     const history::DownloadRow& row = downloads[i];
     // Ignore incomplete downloads.
-    if (row.state != content::DownloadItem::COMPLETE)
+    if (row.state != history::DownloadState::COMPLETE)
       continue;
     if (!most_recent_row || IsMoreInterestingThan(row, *most_recent_row))
       most_recent_row = &row;
   }
   return most_recent_row;
 }
 
 // Returns true if |candidate| is more interesting than whichever of |details|
 // or |best_row| is present.
 template <class D>
@@ skipping 239 matching lines @@
     }
   }
 }
 
 void LastDownloadFinder::HistoryServiceBeingDeleted(
     HistoryService* history_service) {
   history_service_observer_.Remove(history_service);
 }
 
 }  // namespace safe_browsing