Crates.io | packagemerge |
lib.rs | packagemerge |
version | 0.1.0 |
source | src |
created_at | 2016-03-14 19:54:56.869485 |
updated_at | 2016-03-14 19:54:56.869485 |
description | Implementation of the package-merge algorithm for data compression. It solves a problem similar to problem Huffman's algorithm solves: Computing a prefix-free code. But the package-merge algorithm does it while satisfying an additional constraint: a maximum code word length. |
homepage | https://github.com/sellibitze/packagemerge-rs |
repository | https://github.com/sellibitze/packagemerge-rs.git |
max_upload_size | |
id | 4450 |
size | 5,439 |
This is a Rust implementation of the package-merge algorithm. It's used to compute optimal length-limited prefix codes for data compression.