Implement the FindLeastSignificantUnsetBit method
#73
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
TonyTroeff
added
documentation
TonyTroeff
commented
Aug 24, 2023
Member
Author
TonyTroeff
left a comment
TonyTroeff
left a comment
There was a problem hiding this comment.
I had no comments after self-reviewing my PR.
|
Kudos, SonarCloud Quality Gate passed! |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Pull Request Description
Implemented a method that should return the position of the least significant unset bit for a given
Bitmask.Motivation and Context
We have a similar method called
FindLeastSignificantSetBitthat allows us to find the position of the least significant set bit. However, the opposite is not achievable from outside of theBitmaskimplementation. That's why we decided to expose a new method that will guarantee optimal performance.Checklist