Generalise shifts used in remove/add to work with multiple bits at a time#8
Merged
Conversation
added 4 commits
April 27, 2021 00:46
This will be useful for inserting multiple elements at once when overriding default AbstractList methods.
it now checks every element when it is removed (as it should)
Similarly to insertInLong it now works with any number of bits (<= BITS_PER_LONG) instead of one. Will be useful in removeRange for sure
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
These methods will be useful for implementing more efficient versions of AbstractList defaults
And a few test improvements