Coalesce more hardcoded schemes to using predefined constants.

chrome/browser/history/visit_database.cc

 // 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.
 
 #include <algorithm>
 #include <limits>
 #include <map>
 #include <set>
 
 #include "chrome/browser/history/visit_database.h"
 
 #include "chrome/browser/history/url_database.h"
 #include "chrome/common/page_transition_types.h"
+#include "chrome/common/url_constants.h"
 
 using base::Time;
 
 // Rows, in order, of the visit table.
 #define HISTORY_VISIT_ROW_FIELDS \
   " id,url,visit_time,from_visit,transition,segment_id,is_indexed "
 
 namespace history {
 
 VisitDatabase::VisitDatabase() {
@@ skipping 295 matching lines @@
   if (to_visit)
     *to_visit = statement->column_int64(0);
   if (to_url)
     *to_url = GURL(statement->column_string(1));
   return true;
 }
 
 bool VisitDatabase::GetVisitCountToHost(const GURL& url,
                                         int* count,
                                         Time* first_visit) {
-  if (!url.SchemeIs("http") && !url.SchemeIs("https"))
+  if (!url.SchemeIs(chrome::kHttpScheme) && !url.SchemeIs(chrome::kHttpsScheme))
     return false;
 
   // We need to search for URLs with a matching host/port. One way to query for
   // this is to use the LIKE operator, eg 'url LIKE http://google.com/%'. This
   // is inefficient though in that it doesn't use the index and each entry must
   // be visited. The same query can be executed by using >= and < operator.
   // The query becomes:
   // 'url >= http://google.com/' and url < http://google.com0'.
   // 0 is used as it is one character greater than '/'.
   GURL search_url(url);
@@ skipping 20 matching lines @@
     *count = 0;
     return true;
   }
 
   *first_visit = Time::FromInternalValue(statement->column_int64(0));
   *count = statement->column_int(1);
   return true;
 }
 
 }  // namespace history