Decision Workspace
compress-huffman-rs vs minimum_redundancy vs rice-golomb
Side-by-side comparison of Rust crates
43
compress-huffman-rs
experimentalv0.1.0
Huffman coding compression library: frequency table construction, Huffman tree building, canonical code generation, and encode/decode with comprehensive edge-case handling.
58
minimum_redundancy
growingv0.3.4
The library to encode and decode data with binary or non-binary Huffman coding.
42
rice-golomb
experimentalv0.2.0
A small Rust library for Rice-Golomb coding, a form of entropy coding used in lossless compression.
Core Metrics
| compress-huffman-rs | minimum_redundancy | rice-golomb | |
|---|---|---|---|
| Health Score | 43 | 58 | 42 |
| Total Downloads | 24 | 271.6K | 52 |
| 30d Downloads | 0 | 0 | 0 |
| Dependents | 0 | 37 | 0 |
| Releases | 1 | 13 | 3 |
| Last Updated | 124d ago | 31d ago | 52d ago |
| Age | 4m | 4y 7m | 1m |
Health Breakdown
compress-huffman-rs
Maintenance
7
Quality
15
Community
6
Popularity
2
Documentation
13
minimum_redundancy
Maintenance
15
Quality
14
Community
10
Popularity
6
Documentation
13
rice-golomb
Maintenance
11
Quality
13
Community
6
Popularity
2
Documentation
10
Technical Details
| compress-huffman-rs | minimum_redundancy | rice-golomb | |
|---|---|---|---|
| Version | 0.1.0 | 0.3.4 | 0.2.0 |
| Stable (≥1.0) | ✗ No | ✗ No | ✗ No |
| License | MIT OR Apache-2.0 | MIT OR Apache-2.0 | MIT |
| Dependencies | 0 | 5 | 5 |
| Crate Size | 8KB | 17KB | 13KB |
| Features | 0 | 0 | 0 |
| Yanked % | 0.0% | 0.0% | 0.0% |
| Edition | 2021 | 2021 | 2024 |
| MSRV | — | — | — |
| Owners | 1 | 1 | 1 |
Links
Quick Verdict
- •minimum_redundancy leads with a health score of 58/100, but none of the options score above 80.