Fast In-Memory Data Compression Algorithm (inline C/C++) 460+MB/s compress, 2800+MB/s decompress, ratio% better than LZ4, Snappy, and Zstd@-1
-
Updated
Nov 1, 2024 - C
Fast In-Memory Data Compression Algorithm (inline C/C++) 460+MB/s compress, 2800+MB/s decompress, ratio% better than LZ4, Snappy, and Zstd@-1
High-speed lossless data compression of 16 to 512 bytes--get better average compression than QuickLZ for 512-byte blocks. td512 maintains good compression down to 16-byte blocks.
A rust implementation of the quicklz compression algorithm.
Compress and decompress with QuickLz while keeping low the Garbage Collector
Add a description, image, and links to the quicklz topic page so that developers can more easily learn about it.
To associate your repository with the quicklz topic, visit your repo's landing page and select "manage topics."