Bound Tribonacci allocations for malformed lengths - #106
Closed
krotname wants to merge 1 commit into
Closed
Conversation
Owner
Author
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.
Motivation
TribonacciSequence.tribonacciimplementation to reject negative or excessively largenbefore allocating the result array, preventing crashes (NegativeArraySizeException/ArrayIndexOutOfBoundsException) and OutOfMemoryError for malformed inputs.Description
MAX_SEQUENCE_LENGTH = 1_000_000and validaten(0 <= n <= MAX_SEQUENCE_LENGTH) insrc/main/java/kyu6/TribonacciSequence.java, and add a regression case insrc/test/java/kyu6/TribonacciSequenceTest.javathat assertsInteger.MAX_VALUEis rejected without allocation.Testing
mvn -q -Dtest=kyu6.TribonacciSequenceTest testandmvn -q test, and ranmvn -q -DskipTests checkstyle:check, all of which completed successfully.Codex Task