[Safe browsing] Clean up code to scan hash results for threats.

chrome/browser/safe_browsing/safe_browsing_util_unittest.cc

 // 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.
 
 #include <algorithm>
 
 #include "base/strings/stringprintf.h"
 #include "chrome/browser/safe_browsing/safe_browsing_util.h"
 #include "testing/gtest/include/gtest/gtest.h"
 #include "url/gurl.h"
@@ skipping 259 matching lines @@
 
     EXPECT_EQ(tests[i].expected_canonicalized_hostname,
               canonicalized_hostname);
     EXPECT_EQ(tests[i].expected_canonicalized_path,
               canonicalized_path);
     EXPECT_EQ(tests[i].expected_canonicalized_query,
               canonicalized_query);
   }
 }
 
-TEST(SafeBrowsingUtilTest, GetUrlHashIndex) {
-  GURL url("http://www.evil.com/phish.html");
-  SBFullHashResult full_hash;
-  full_hash.hash = SBFullHashForString(url.host() + url.path());
-  std::vector<SBFullHashResult> full_hashes;
-  full_hashes.push_back(full_hash);
-
-  EXPECT_EQ(safe_browsing_util::GetUrlHashIndex(url, full_hashes), 0);
-
-  url = GURL("http://www.evil.com/okay_path.html");
-  EXPECT_EQ(safe_browsing_util::GetUrlHashIndex(url, full_hashes), -1);
-}
-
 TEST(SafeBrowsingUtilTest, ListIdListNameConversion) {
   std::string list_name;
   EXPECT_FALSE(safe_browsing_util::GetListName(safe_browsing_util::INVALID,
                                                &list_name));
   EXPECT_TRUE(safe_browsing_util::GetListName(safe_browsing_util::MALWARE,
                                               &list_name));
   EXPECT_EQ(list_name, std::string(safe_browsing_util::kMalwareList));
   EXPECT_EQ(safe_browsing_util::MALWARE,
             safe_browsing_util::GetListId(list_name));
 
@@ skipping 40 matching lines @@
   EXPECT_FALSE(SBFullHashEqual(kHash2, kHash1));
 
   EXPECT_FALSE(SBFullHashLess(kHash1, kHash2));
   EXPECT_TRUE(SBFullHashLess(kHash2, kHash1));
 
   EXPECT_FALSE(SBFullHashLess(kHash1, kHash1));
   EXPECT_FALSE(SBFullHashLess(kHash2, kHash2));
 }
 
 }  // namespace