Permalink
Browse files

preparing version 0.6.1

  • Loading branch information...
1 parent 137aaa2 commit 4d0efa35c8dbe597a1a787e5a0f221345b8ec48e @lemire committed Oct 19, 2012
View
@@ -1,3 +1,7 @@
+version 0.6.1 (October 18, 2012)
+ - Optimized the logical and operation and rewrote the logical or operation
+ - Sometimes we used the term "literal" and sometimes "dirty". We now use only the term "literal".
+
version 0.6.0 (October 15, 2012)
- Moved packages from javaewah to com.googlecode.javaewah (request by Eclipse)
View
2 TODO
@@ -1,7 +1,5 @@
TODO
-Sometimes the term "dirty word" is used, other times, we use "literal word". It should
-be more uniform.
@@ -27,17 +27,17 @@ public void add(final long newdata) {
}
/**
- * virtually add several dirty words.
+ * virtually add several literal words.
*
* @param data
- * the dirty words
+ * the literal words
* @param start
* the starting point in the array
* @param number
- * the number of dirty words to add
+ * the number of literal words to add
*/
// @Override : causes problems with Java 1.5
- public void addStreamOfDirtyWords(long[] data, int start, int number) {
+ public void addStreamOfLiteralWords(long[] data, int start, int number) {
for (int i = start; i < start + number; i++) {
add(data[i]);
}
@@ -62,17 +62,17 @@ public void addStreamOfEmptyWords(boolean v, long number) {
}
/**
- * virtually add several negated dirty words.
+ * virtually add several negated literal words.
*
* @param data
- * the dirty words
+ * the literal words
* @param start
* the starting point in the array
* @param number
- * the number of dirty words to add
+ * the number of literal words to add
*/
// @Override : causes problems with Java 1.5
- public void addStreamOfNegatedDirtyWords(long[] data, int start, int number) {
+ public void addStreamOfNegatedLiteralWords(long[] data, int start, int number) {
for (int i = start; i < start + number; i++) {
add(~data[i]);
}
@@ -25,16 +25,16 @@
public void add(final long newdata);
/**
- * if you have several dirty words to copy over, this might be faster.
+ * if you have several literal words to copy over, this might be faster.
*
* @param data
- * the dirty words
+ * the literal words
* @param start
* the starting point in the array
* @param number
- * the number of dirty words to add
+ * the number of literal words to add
*/
- public void addStreamOfDirtyWords(final long[] data, final int start,
+ public void addStreamOfLiteralWords(final long[] data, final int start,
final int number);
/**
@@ -49,16 +49,16 @@ public void addStreamOfDirtyWords(final long[] data, final int start,
public void addStreamOfEmptyWords(final boolean v, final long number);
/**
- * Like "addStreamOfDirtyWords" but negates the words being added.
+ * Like "addStreamOfLiteralWords" but negates the words being added.
*
* @param data
- * the dirty words
+ * the literal words
* @param start
* the starting point in the array
* @param number
- * the number of dirty words to add
+ * the number of literal words to add
*/
- public void addStreamOfNegatedDirtyWords(long[] data, final int start,
+ public void addStreamOfNegatedLiteralWords(long[] data, final int start,
final int number);
/**
@@ -49,7 +49,7 @@ public void discardFirstWords(long x) {
}
x -= this.RunningLength;
this.RunningLength = 0;
- this.dirtywordoffset += x;
+ this.literalwordoffset += x;
this.NumberOfLiteralWords -= x;
}
@@ -89,7 +89,7 @@ public void reset(final long a) {
this.NumberOfLiteralWords = (int) (a >>> (1 + RunningLengthWord.runninglengthbits));
this.RunningBit = (a & 1) != 0;
this.RunningLength = (int) ((a >>> 1) & RunningLengthWord.largestrunninglengthcount);
- this.dirtywordoffset = 0;
+ this.literalwordoffset = 0;
}
/**
@@ -148,8 +148,8 @@ public String toString() {
+ getNumberOfLiteralWords();
}
- /** how many dirty words have we read so far? */
- public int dirtywordoffset = 0;
+ /** how many literal words have we read so far? */
+ public int literalwordoffset = 0;
/** The Number of literal words. */
public int NumberOfLiteralWords;
Oops, something went wrong.

0 comments on commit 4d0efa3

Please sign in to comment.