-
Notifications
You must be signed in to change notification settings - Fork 184
/
Copy pathBloomFilter.cs
405 lines (359 loc) · 11.4 KB
/
BloomFilter.cs
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
// --------------------------------------------------------------------------------------------------------------------
// <copyright file="BloomFilter.cs" company="pzcast">
// (C) 2015 pzcast. All rights reserved.
// </copyright>
// <summary>
// The bloom filter.
// </summary>
// --------------------------------------------------------------------------------------------------------------------
namespace SimpleCrawler
{
using System;
using System.Collections;
/// <summary>
/// The bloom filter.
/// </summary>
/// <typeparam name="T">
/// The generic type.
/// </typeparam>
public class BloomFilter<T>
{
#region Fields
/// <summary>
/// The get hash secondary.
/// </summary>
private readonly HashFunction getHashSecondary;
/// <summary>
/// The hash bits.
/// </summary>
private readonly BitArray hashBits;
/// <summary>
/// The hash function count.
/// </summary>
private readonly int hashFunctionCount;
#endregion
#region Constructors and Destructors
/// <summary>
/// Initializes a new instance of the <see cref="BloomFilter{T}"/> class.
/// </summary>
/// <param name="capacity">
/// The capacity.
/// </param>
public BloomFilter(int capacity)
: this(capacity, null)
{
}
/// <summary>
/// Initializes a new instance of the <see cref="BloomFilter{T}"/> class.
/// </summary>
/// <param name="capacity">
/// The capacity.
/// </param>
/// <param name="errorRate">
/// The error rate.
/// </param>
public BloomFilter(int capacity, int errorRate)
: this(capacity, errorRate, null)
{
}
/// <summary>
/// Initializes a new instance of the <see cref="BloomFilter{T}"/> class.
/// </summary>
/// <param name="capacity">
/// The capacity.
/// </param>
/// <param name="hashFunction">
/// The hash function.
/// </param>
public BloomFilter(int capacity, HashFunction hashFunction)
: this(capacity, BestErrorRate(capacity), hashFunction)
{
}
/// <summary>
/// Initializes a new instance of the <see cref="BloomFilter{T}"/> class.
/// </summary>
/// <param name="capacity">
/// The capacity.
/// </param>
/// <param name="errorRate">
/// The error rate.
/// </param>
/// <param name="hashFunction">
/// The hash function.
/// </param>
public BloomFilter(int capacity, float errorRate, HashFunction hashFunction)
: this(capacity, errorRate, hashFunction, BestM(capacity, errorRate), BestK(capacity, errorRate))
{
}
/// <summary>
/// Initializes a new instance of the <see cref="BloomFilter{T}"/> class.
/// </summary>
/// <param name="capacity">
/// The capacity.
/// </param>
/// <param name="errorRate">
/// The error rate.
/// </param>
/// <param name="hashFunction">
/// The hash function.
/// </param>
/// <param name="m">
/// The m.
/// </param>
/// <param name="k">
/// The k.
/// </param>
public BloomFilter(int capacity, float errorRate, HashFunction hashFunction, int m, int k)
{
if (capacity < 1)
{
throw new ArgumentOutOfRangeException("capacity", capacity, "capacity must be > 0");
}
if (errorRate >= 1 || errorRate <= 0)
{
throw new ArgumentOutOfRangeException(
"errorRate",
errorRate,
string.Format("errorRate must be between 0 and 1, exclusive. Was {0}", errorRate));
}
if (m < 1)
{
throw new ArgumentOutOfRangeException(
string.Format(
"The provided capacity and errorRate values would result in an array of length > int.MaxValue. Please reduce either of these values. Capacity: {0}, Error rate: {1}",
capacity,
errorRate));
}
if (hashFunction == null)
{
if (typeof(T) == typeof(string))
{
this.getHashSecondary = HashString;
}
else if (typeof(T) == typeof(int))
{
this.getHashSecondary = HashInt32;
}
else
{
throw new ArgumentNullException(
"hashFunction",
"Please provide a hash function for your type T, when T is not a string or int.");
}
}
else
{
this.getHashSecondary = hashFunction;
}
this.hashFunctionCount = k;
this.hashBits = new BitArray(m);
}
#endregion
#region Delegates
/// <summary>
/// The hash function.
/// </summary>
/// <param name="input">
/// The input.
/// </param>
/// <returns>
/// The <see cref="int"/>.
/// </returns>
public delegate int HashFunction(T input);
#endregion
#region Public Properties
/// <summary>
/// Gets the truthiness.
/// </summary>
public double Truthiness
{
get
{
return (double)this.TrueBits() / this.hashBits.Count;
}
}
#endregion
#region Public Methods and Operators
/// <summary>
/// The add.
/// </summary>
/// <param name="item">
/// The item.
/// </param>
public void Add(T item)
{
int primaryHash = item.GetHashCode();
int secondaryHash = this.getHashSecondary(item);
for (int i = 0; i < this.hashFunctionCount; i++)
{
int hash = this.ComputeHash(primaryHash, secondaryHash, i);
this.hashBits[hash] = true;
}
}
/// <summary>
/// The contains.
/// </summary>
/// <param name="item">
/// The item.
/// </param>
/// <returns>
/// The <see cref="bool"/>.
/// </returns>
public bool Contains(T item)
{
int primaryHash = item.GetHashCode();
int secondaryHash = this.getHashSecondary(item);
for (int i = 0; i < this.hashFunctionCount; i++)
{
int hash = this.ComputeHash(primaryHash, secondaryHash, i);
if (this.hashBits[hash] == false)
{
return false;
}
}
return true;
}
#endregion
#region Methods
/// <summary>
/// The best error rate.
/// </summary>
/// <param name="capacity">
/// The capacity.
/// </param>
/// <returns>
/// The <see cref="float"/>.
/// </returns>
private static float BestErrorRate(int capacity)
{
var c = (float)(1.0 / capacity);
if (Math.Abs(c) > 0)
{
return c;
}
double y = int.MaxValue / (double)capacity;
return (float)Math.Pow(0.6185, y);
}
/// <summary>
/// The best k.
/// </summary>
/// <param name="capacity">
/// The capacity.
/// </param>
/// <param name="errorRate">
/// The error rate.
/// </param>
/// <returns>
/// The <see cref="int"/>.
/// </returns>
private static int BestK(int capacity, float errorRate)
{
return (int)Math.Round(Math.Log(2.0) * BestM(capacity, errorRate) / capacity);
}
/// <summary>
/// The best m.
/// </summary>
/// <param name="capacity">
/// The capacity.
/// </param>
/// <param name="errorRate">
/// The error rate.
/// </param>
/// <returns>
/// The <see cref="int"/>.
/// </returns>
private static int BestM(int capacity, float errorRate)
{
return (int)Math.Ceiling(capacity * Math.Log(errorRate, 1.0 / Math.Pow(2, Math.Log(2.0))));
}
/// <summary>
/// The hash int 32.
/// </summary>
/// <param name="input">
/// The input.
/// </param>
/// <returns>
/// The <see cref="int"/>.
/// </returns>
private static int HashInt32(T input)
{
var x = input as uint?;
unchecked
{
x = ~x + (x << 15);
x = x ^ (x >> 12);
x = x + (x << 2);
x = x ^ (x >> 4);
x = x * 2057;
x = x ^ (x >> 16);
return (int)x;
}
}
/// <summary>
/// The hash string.
/// </summary>
/// <param name="input">
/// The input.
/// </param>
/// <returns>
/// The <see cref="int"/>.
/// </returns>
private static int HashString(T input)
{
var str = input as string;
int hash = 0;
if (str != null)
{
for (int i = 0; i < str.Length; i++)
{
hash += str[i];
hash += hash << 10;
hash ^= hash >> 6;
}
hash += hash << 3;
hash ^= hash >> 11;
hash += hash << 15;
}
return hash;
}
/// <summary>
/// The compute hash.
/// </summary>
/// <param name="primaryHash">
/// The primary hash.
/// </param>
/// <param name="secondaryHash">
/// The secondary hash.
/// </param>
/// <param name="i">
/// The i.
/// </param>
/// <returns>
/// The <see cref="int"/>.
/// </returns>
private int ComputeHash(int primaryHash, int secondaryHash, int i)
{
int resultingHash = (primaryHash + (i * secondaryHash)) % this.hashBits.Count;
return Math.Abs(resultingHash);
}
/// <summary>
/// The true bits.
/// </summary>
/// <returns>
/// The <see cref="int"/>.
/// </returns>
private int TrueBits()
{
int output = 0;
foreach (bool bit in this.hashBits)
{
if (bit)
{
output++;
}
}
return output;
}
#endregion
}
}