| Index: components/rappor/bloom_filter.cc
|
| diff --git a/components/rappor/bloom_filter.cc b/components/rappor/bloom_filter.cc
|
| new file mode 100644
|
| index 0000000000000000000000000000000000000000..0b447b764466d9162c3f703f0cf2296a25684cc5
|
| --- /dev/null
|
| +++ b/components/rappor/bloom_filter.cc
|
| @@ -0,0 +1,43 @@
|
| +// 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 "components/rappor/bloom_filter.h"
|
| +
|
| +#include "base/logging.h"
|
| +#include "third_party/smhasher/src/MurmurHash3.h"
|
| +
|
| +namespace {
|
| +
|
| +uint32_t MurmurHash3String(const std::string& str, uint32_t seed) {
|
| + uint32_t output = 0;
|
| + // This function is optimized for x86_32, but should work on any platform.
|
| + MurmurHash3_x86_32(str.data(), str.size(), seed, &output);
|
| + return output;
|
| +}
|
| +
|
| +} // namespace
|
| +
|
| +namespace rappor {
|
| +
|
| +BloomFilter::BloomFilter(uint32_t bytes_size,
|
| + uint32_t hash_function_count,
|
| + uint32_t hash_seed_offset)
|
| + : bytes_(bytes_size),
|
| + hash_function_count_(hash_function_count),
|
| + hash_seed_offset_(hash_seed_offset) {
|
| + DCHECK_GT(bytes_size, 0u);
|
| +}
|
| +
|
| +BloomFilter::~BloomFilter() {}
|
| +
|
| +void BloomFilter::AddString(const std::string& str) {
|
| + for (size_t i = 0; i < hash_function_count_; ++i) {
|
| + uint32_t index = MurmurHash3String(str, hash_seed_offset_ + i);
|
| + uint32_t byte_index = (index / 8) % bytes_.size();
|
| + uint32_t bit_index = index % 8;
|
| + bytes_[byte_index] |= 1 << bit_index;
|
| + }
|
| +}
|
| +
|
| +} // namespace rappor
|
|
|