1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
// 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 "components/rappor/byte_vector_utils.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace rappor {
TEST(BloomFilterTest, TinyFilter) {
BloomFilter filter(1u, 4u, 0u);
// Size is 1 and it's initially empty
EXPECT_EQ(1u, filter.bytes().size());
EXPECT_EQ(0x00, filter.bytes()[0]);
// "Test" has a self-collision, and only sets 3 bits.
filter.SetString("Test");
EXPECT_EQ(0x2a, filter.bytes()[0]);
// Setting the same value shouldn't change anything.
filter.SetString("Test");
EXPECT_EQ(0x2a, filter.bytes()[0]);
BloomFilter filter2(1u, 4u, 0u);
EXPECT_EQ(0x00, filter2.bytes()[0]);
filter2.SetString("Bar");
EXPECT_EQ(0xa8, filter2.bytes()[0]);
// The new string should replace the old one.
filter.SetString("Bar");
EXPECT_EQ(0xa8, filter.bytes()[0]);
}
TEST(BloomFilterTest, HugeFilter) {
// Create a 500 bit filter, and use a large seed offset to see if anything
// breaks.
BloomFilter filter(500u, 1u, 0xabdef123);
// Size is 500 and it's initially empty
EXPECT_EQ(500u, filter.bytes().size());
EXPECT_EQ(0, CountBits(filter.bytes()));
filter.SetString("Bar");
EXPECT_EQ(1, CountBits(filter.bytes()));
// Adding the same value shouldn't change anything.
filter.SetString("Bar");
EXPECT_EQ(1, CountBits(filter.bytes()));
}
} // namespace rappor
|
