Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix javadoc issues #7

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Fix javadoc issues #7

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions src/com/skjegstad/utils/BloomFilter.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35,7 +35,7 @@
* http://blog.locut.us/2008/01/12/a-decent-stand-alone-java-bloom-filter-implementation/
*
* @param <E> Object type that is to be inserted into the Bloom filter, e.g. String or Integer.
* @author Magnus Skjegstad <[email protected]>
* @author Magnus Skjegstad &lt;[email protected]&gt;
*/
public class BloomFilter<E> implements Serializable {
private BitSet bitset;
Expand Down Expand Up @@ -231,7 +231,7 @@ public int hashCode() {
/**
* Calculates the expected probability of false positives based on
* the number of expected filter elements and the size of the Bloom filter.
* <br /><br />
* <br><br>
* The value returned by this method is the <i>expected</i> rate of false
* positives, assuming the number of inserted elements equals the number of
* expected elements. If the number of elements in the Bloom filter is less
Expand Down Expand Up @@ -269,8 +269,8 @@ public double getFalsePositiveProbability() {


/**
* Returns the value chosen for K.<br />
* <br />
* 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 of inserted elements.
*
Expand Down