Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Decompression implementation improvement ideas #15

Open
pfalcon opened this issue Jul 9, 2018 · 1 comment
Open

Decompression implementation improvement ideas #15

pfalcon opened this issue Jul 9, 2018 · 1 comment
Labels

Comments

@pfalcon
Copy link
Owner

pfalcon commented Jul 9, 2018

  • Distance tree can have only 30 valid codes (32 total if balanced Huffman tree is considered). That's unlike literal/length tree which can 286 valid, 288 total entries. Using the same structure for both types of trees, reserving space for 288 codes is thus not efficient. Using adhoc structure for distance tree can provide noticeable space savings.
@pfalcon
Copy link
Owner Author

pfalcon commented Sep 10, 2018

4c50ea3 proposes to de-inline TINF_PUT. While definitely beneficial for code size, performance impact should be assessed.

@pfalcon pfalcon added the triaged label May 9, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

1 participant