This function is trying to find the string in history buffer, which matches with currently processed string the most. This function takes the most of compression time, so it defines deflate's performence the most. Precompiled binaries are in "Releases" section on GitHub.Īs I mentioned before, only the longest_match function was changed. ![]() Build instructions are available in README.md. C version compiled for 64-bit Intel platform slightly outperforms 32-bit version, so there's no reason to write Assembly version for it. There's also Assembly version for 32-bit Intel architecture, however C version produces exactly the same output, and works with nearly the same performance as Asm version. In my tests it works about 2.5-10x times faster than original method with neraly the same compression ratio (at keast it never compress worse than original zlib). ![]() This is an implementation of the fast deflate algorithm for zlib (to be exact, here is a new implementation of the longest_match function).
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |