Lzw optimizations #59
Open
Conversation
This file contains 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
added 5 commits
August 29, 2024 09:38
The codes are maintained in sequential order starting at zero. It is inefficient to store them in a map with the keys being Integer objects when they can be stored in an array and indexed directly. This saves on map lookups each time and removes the creation of excess Integer objects when primitives work. In addition, the values being stored as Integer[] was inefficient when byte[] is what is needed. These changes make this section of the code run over twice as fast in testing.
This improves the runtime of the entire lzw decompression by about 67% in testing.
Removed the heavy math equation done each time, to a simpler one done rarely. This give a performance boost to the entire LZW decoding method of about 50%.
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.
Optimized the code in the LZW decompression algorithm. In running of the unit tests, this allowed the decode method to preform about 5.6x faster than the old implementation.