summaryrefslogtreecommitdiffstats
path: root/chrome/browser/safe_browsing
diff options
context:
space:
mode:
authordeanm@google.com <deanm@google.com@0039d316-1c4b-4281-b951-d872f2087c98>2008-10-02 15:11:22 +0000
committerdeanm@google.com <deanm@google.com@0039d316-1c4b-4281-b951-d872f2087c98>2008-10-02 15:11:22 +0000
commita4feef8f23c9aed533bcd8b35e594fe3cf300a23 (patch)
tree9ce681a0ae7b0a30d00b54cb8bccc3a3ad7562c6 /chrome/browser/safe_browsing
parent5f945e0f45394453602083b22206acb4cde3db4f (diff)
downloadchromium_src-a4feef8f23c9aed533bcd8b35e594fe3cf300a23.zip
chromium_src-a4feef8f23c9aed533bcd8b35e594fe3cf300a23.tar.gz
chromium_src-a4feef8f23c9aed533bcd8b35e594fe3cf300a23.tar.bz2
Port some more of chrome/ to Linux.
Original review: http://codereview.chromium.org/4247 Patch from Pawel Hajdan Jr. git-svn-id: svn://svn.chromium.org/chrome/trunk/src@2793 0039d316-1c4b-4281-b951-d872f2087c98
Diffstat (limited to 'chrome/browser/safe_browsing')
-rw-r--r--chrome/browser/safe_browsing/bloom_filter_unittest.cc9
1 files changed, 2 insertions, 7 deletions
diff --git a/chrome/browser/safe_browsing/bloom_filter_unittest.cc b/chrome/browser/safe_browsing/bloom_filter_unittest.cc
index bbbf8e4..edfefa9 100644
--- a/chrome/browser/safe_browsing/bloom_filter_unittest.cc
+++ b/chrome/browser/safe_browsing/bloom_filter_unittest.cc
@@ -12,7 +12,6 @@
#include "base/logging.h"
#include "base/rand_util.h"
#include "base/string_util.h"
-#include "base/win_util.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace {
@@ -24,19 +23,15 @@ uint32 GenHash() {
}
TEST(SafeBrowsing, BloomFilter) {
- // rand_util isn't random enough on Win2K, see bug 1076619.
- if (win_util::GetWinVersion() == win_util::WINVERSION_2000)
- return;
-
// Use a small number for unit test so it's not slow.
- int count = 1000;//100000;
+ uint32 count = 1000;
// Build up the bloom filter.
BloomFilter filter(count * 10);
typedef std::set<int> Values;
Values values;
- for (int i = 0; i < count; ++i) {
+ for (uint32 i = 0; i < count; ++i) {
uint32 value = GenHash();
values.insert(value);
filter.Insert(value);