feat: Implement GetElementsInRange for IntSet #4
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.
Adds a new public method
GetElementsInRange(int firstElement, int lastElement)to theIntSetclass. This method allows you to enumerate integers from the set that fall within the specified range[min(first, last), max(first, last)].The enumeration direction (ascending or descending) is determined by the order of
firstElementandlastElement.Key changes include:
TraverseRootCardsDirectional,TraverseCardLevelDirectional,TraverseByteLevelDirectional,ProcessBytesDirectional).GetEnumerator()was updated to use the new ascending directional traversal logic, ensuring consistency.GetElementsInRangeto skip blocks of numbers that are outside the target range, using a newGetBlockRangehelper.IntSetTests.csto cover various scenarios, including empty sets, ascending/descending ranges, edge cases, gaps in data, negative numbers, and int.MinValue/MaxValue.