public class BloomSHA1 extends Object
Modifier and Type | Class and Description |
---|---|
static class |
BloomSHA1.FilterKey
Store the (opaque) bloom filter offsets for reuse.
|
Constructor and Description |
---|
BloomSHA1()
Creates a filter of 2^20 bits with k defaulting to 8.
|
BloomSHA1(int m)
Creates a filter of 2^m bits, with the number of 'hash functions"
k defaulting to 8.
|
BloomSHA1(int m,
int k)
Creates a filter with 2^m bits and k 'hash functions', where
each hash function is portion of the 160-bit SHA1 hash.
|
Modifier and Type | Method and Description |
---|---|
int |
capacity() |
void |
clear()
Synchronized version
|
double |
falsePositives() |
double |
falsePositives(int n) |
BloomSHA1.FilterKey |
getFilterKey(byte[] b,
int offset,
int len)
Get the bloom filter offsets for reuse.
|
void |
insert(byte[] b)
Add a key to the set represented by the filter.
|
void |
insert(byte[] b,
int offset,
int len) |
void |
locked_insert(BloomSHA1.FilterKey fk)
Add the key to the filter.
|
void |
locked_insert(byte[] b) |
void |
locked_insert(byte[] b,
int offset,
int len) |
boolean |
locked_member(BloomSHA1.FilterKey fk)
Is the key in the filter.
|
boolean |
locked_member(byte[] b) |
boolean |
locked_member(byte[] b,
int offset,
int len) |
boolean |
member(byte[] b)
Is a key in the filter.
|
boolean |
member(byte[] b,
int offset,
int len) |
void |
release(BloomSHA1.FilterKey fk) |
int |
size()
Returns the number of keys which have been inserted.
|
public BloomSHA1(int m, int k)
m
- determines number of bits in filterk
- number of hash functionsx
See KeySelector for important restriction on max m and kpublic BloomSHA1(int m)
m
- determines size of filterpublic BloomSHA1()
public void clear()
public final int size()
public final int capacity()
public void insert(byte[] b)
b
- byte array representing a key (SHA1 digest)public void insert(byte[] b, int offset, int len)
public final void locked_insert(byte[] b)
public final void locked_insert(byte[] b, int offset, int len)
public final boolean locked_member(byte[] b)
public final boolean locked_member(byte[] b, int offset, int len)
public final boolean member(byte[] b)
b
- byte array representing a key (SHA1 digest)public final boolean member(byte[] b, int offset, int len)
public BloomSHA1.FilterKey getFilterKey(byte[] b, int offset, int len)
public void locked_insert(BloomSHA1.FilterKey fk)
public boolean locked_member(BloomSHA1.FilterKey fk)
public void release(BloomSHA1.FilterKey fk)
public final double falsePositives(int n)
n
- number of set memberspublic final double falsePositives()