huffman: Pure Haskell implementation of the Huffman encoding algorithm
A simple and pure Haskell implementation of the Huffman encoding algorithm.
The huffman function provides the original O(n log n) algorithm
implemented with a priority queue. If the input symbols are sorted
by probability, the O(n) huffmanSorted function can be used instead.
Downloads
- huffman-1.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 1.0.0, 1.0.1 |
|---|---|
| Dependencies | base (>=3 && <5), containers, fingertree [details] |
| License | BSD-3-Clause |
| Copyright | 2010, Maxime Henrion |
| Author | Maxime Henrion |
| Maintainer | Maxime Henrion <mhenrion@gmail.com> |
| Category | Data, Compression |
| Bug tracker | http://bitbucket.org/mux/huffman/issues/ |
| Source repo | head: hg clone http://bitbucket.org/mux/huffman/ |
| Uploaded | by MaximeHenrion at 2012-02-28T20:58:44Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 2044 total (8 in the last 30 days) |
| Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |