Adds an object to the Bloom filter. The output from the object's toString() method is used as input to the hash functions. @param element is an eleme

Returns the value chosen for K.<br /> <br /> K is the optimal number of hash functions based on the size of the Bloom filter and the expected number o

Returns true if the element could have been inserted into the Bloom filter. Use getFalsePositiveProbability() to calculate the probability of this bei

Calculates a hash code for this class. @return hash code representing the contents of an instance of this class.

Generates a digest based on the contents of a String. @param val specifies the input data. @param charset specifies the encoding of the input data. @

Generates digests based on the contents of an array of bytes and splits the result into 4-byte int's and store them in an array. The digest function i

Compares the contents of two instances to see if they are equal. @param obj is the object to compare to. @return True if the contents of the objects

Calculates the expected probability of false positives based on the number of expected filter elements and the size of the Bloom filter. <br /><br />

Sets all bits to false in the Bloom filter.

Read a single bit from the Bloom filter. @param bit the bit to read. @return true if the bit is set, false if it is not.

Set a single bit in the Bloom filter. @param bit is the bit to set. @param value If true, the bit is set. If false, the bit is cleared.

Returns the number of bits in the Bloom filter. Use count() to retrieve the number of inserted elements. @return the size of the bitset used by the B

Adds all elements from a Collection to the Bloom filter. @param c Collection of elements.

Returns the number of elements added to the Bloom filter after it was constructed or after clear() was called. @return number of elements added to th

Returns true if all the elements of a Collection could have been inserted into the Bloom filter. Use getFalsePositiveProbability() to calculate the pr

Get expected number of bits per element when the Bloom filter is full. This value is set by the constructor when the Bloom filter is created. See also

Returns the expected number of elements to be inserted into the filter. This value is the same value as the one passed to the constructor. @return ex

Calculate the probability of a false positive given the specified number of inserted elements. @param numberOfElements number of inserted elements. @

Constructs an empty Bloom filter. The total length of the Bloom filter will be c n. @param c is the number of bits used per element. @param n is the

Return the bit set used to store the Bloom filter. @return bit set representing the Bloom filter.

Get actual number of bits per element based on the number of elements that have currently been inserted and the length of the Bloom filter. See also g

Test of add method, of class BloomFilter. @throws Exception

Test of addAll method, of class BloomFilter. @throws Exception

Test of clear method, of class BloomFilter.

Test of contains method, of class BloomFilter. @throws Exception

Test of containsAll method, of class BloomFilter. @throws Exception

Test of contains method, of class BloomFilter.

Test of contains method, of class BloomFilter.

Test of count method, of class BloomFilter.

Test of createHash method, of class BloomFilter. @throws Exception

Test of createHash method, of class BloomFilter. @throws UnsupportedEncodingException

Test of createHash method, of class BloomFilter. @throws UnsupportedEncodingException

Test of equals method, of class BloomFilter. @throws UnsupportedEncodingException

Test of expectedFalsePositiveProbability method, of class BloomFilter.

Test error rate @throws UnsupportedEncodingException

Test of getBit method, of class BloomFilter.

Test for correct k

Test of hashCode method, of class BloomFilter. @throws UnsupportedEncodingException

Test of setBit method, of class BloomFilter.

Test of size method, of class BloomFilter.