Sync fork #3
Open
Sync fork #3
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
* convert byte to int in a loop once only * simplified comparison of byte arrays * enrolled version should be the fastest * some compareTo methods can be replaced by more simple and performant appropriate equals() method * avoid duplicate method call * closely related unnecessary local variable * checkstyle * comparison of reference is unnecessary * unnecessary local variable * condition covered by subsequent conditions * mismatch simplification * use long instead of byte[6] * avoid backward value conversion, when original is available * mismatch() has to return length of shorter array, when all elements are equal * bugfix: bytes are reordered * bugfix: low 6 bytes, not high ones * bugfix: two different conditions cannot be merged into one
* Skip unnecessary offset computations * Skip unnecessary offset computations for mappable bitmap
* advanceIfNeeded optimization * expected and actual value swap * cleanup mesh & warnings * temporary performance comparison removed * Update jmh/src/jmh/java/org/roaringbitmap/AdvanceIfNeededBenchmark.java Co-authored-by: Daniel Lemire <daniel@lemire.me> --------- Co-authored-by: Daniel Lemire <daniel@lemire.me>
* real iand between run and array container * faster run container iteration * real iandnot between array and run container * real iandnot between array and run mappable container
* avoid compute cardinality for run container using contains() instead * benchmark for optimized checkedAdd() * benchmark uses enums for testing scenarios
* use isEmpty() on bitmap instead of getCardinality() * not empty is correct
* skip use numberOfTrailingZeros() if value is equal to zero * replaceChildren() optimization for Node256 * use of toUnsignedInt() when values are not empty * replaceChildren() simplification for Node4 and Node16 * replaceChildren() optimization for Node48 * unintended import change * temporary benchmark removed
* benchmark for removal top values from bitmap * remove current value when iterating on bitmap works properly * use remove() to delete first K values
* Added unit test for expose batchiterator.advanceIfNext bug * Fix batchiterator's advanceIfNeeded to logic to handle run lengths of zero * Addressed comments
…n from array containers to bitmap (#683) * code deduplication in ior() for array containers * code deduplication when converting to bitmap from array containers * use ixor() instead of xor() to avoid cloning
…ap slice index (#693) * use isEmpty() on bitmap instead of getCardinality() * not empty is correct
* avoid compute cardinality for run container using contains() instead * benchmark for optimized checkedAdd() * benchmark uses enums for testing scenarios
* benchmark for removal top values from bitmap * remove current value when iterating on bitmap works properly * use remove() to delete first K values
* addOffset() optimized for array containers * avoid use of local variable for optimized version * use of local variable variant is the most performant * renamed methods due to their confusing overloading
* rangeMask simplification * rangeMask from number of slices simplification
* benchmark for deserialization mutable bitmaps * avoid long buffer duplication * avoid copy whole long array * avoid long buffer duplication
* select from right if index is in upper half of cardinality * skip zeroes * benchmark for select from both sides * bugfix * variable name correction
…ble-dip calculate the Node at a key in a single step
improve 64 bit clone
* avoid compute cardinality of run container within checkedRemove * Removed benchmark used for validating optimization --------- Co-authored-by: xtonik <xtonik@proton.me>
* escape the loop when container with higher key is found * Removed benchmark used for validating optimization --------- Co-authored-by: xtonik <xtonik@proton.me>
…operations for dense RoaringBitmaps (#813) * a two-level succinct data structure that provides constant-time rank operations for dense RoaringBitmaps * addressed the feedback from * addressed the feedback around the documentations --------- Co-authored-by: gerald.green <gerald.green@workday.com>
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
20 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
SUMMARY
Automated Checks
./gradlew testand made sure that my PR does not break any unit test../gradlew checkstyleMainor the equivalent and corrected the formatting warnings reported.