Skip to content

Commit

Permalink
moved jbit out to its own project
Browse files Browse the repository at this point in the history
  • Loading branch information
Kyle Burton committed Jun 3, 2011
1 parent 8b90f89 commit 1c00e30
Show file tree
Hide file tree
Showing 3 changed files with 23 additions and 42 deletions.
23 changes: 23 additions & 0 deletions jbit/README.textile
@@ -1,3 +1,6 @@
This has been moved out to it's own project: "JBit":https://github.com/kyleburton/jbit


h1. JBit

Bit set implementation to support arbitrariliy sized bit arrays natively in Java.
Expand Down Expand Up @@ -26,3 +29,23 @@ for use in Bloom filters with more than 2^32 bits - they are, by definition,
unable to set any bits above 2^32 which will result in a higher than expected
false positive rate for the filter, regardless of the number of hashes or making
the filter wider.



New thoughts...

Very Large (unbounded?) Java Bit Arrays

Instead of going all the way down to using byte arrays - why not use an array
of BitSets or BigIntegers? They already support all of the bit operations
that we want. The only work the wrapper library would have to do then is
bit-shifting work on the values being set.

The Interface / usage might look like:

// NB: for now all I care about is get/set because that's all I need for the
// bloom filter
public interface LargeBitSet {
public boolean get( BigInteger bit );
public void set( BigInteger bit );
}
27 changes: 0 additions & 27 deletions jbit/src/main/java/com/github/kyleburton/JBit.java

This file was deleted.

15 changes: 0 additions & 15 deletions jbit/src/test/java/com/github/kyleburton/JBitTest.java

This file was deleted.

0 comments on commit 1c00e30

Please sign in to comment.