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

multiple huffman tree #5

Open
da0ka opened this issue Jul 24, 2021 · 1 comment
Open

multiple huffman tree #5

da0ka opened this issue Jul 24, 2021 · 1 comment

Comments

@da0ka
Copy link

da0ka commented Jul 24, 2021

How about use 2 huffman trees? One used for dictionary, and for packed data. Of course, it hurts speed.

@kapenga
Copy link
Owner

kapenga commented Jul 26, 2021

I don't think it would help compression. Storing a tree gives probably more overhead than gaining on the nodes.
I however made some uncommitted changes to the tree generation to avoid leaves that are only used for the tree itself. The result is that the tree is slightly smaller and compression itself improves too.
In the future I will commit these changes to github.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants