The huffman package
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.
Properties
| Versions | 1.0.0, 1.0.1 |
|---|---|
| Dependencies | base (≥3 & <5), containers, fingertree |
| License | BSD3 |
| 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 repository | hg clone http://bitbucket.org/mux/huffman/ |
| Upload date | Tue Feb 28 20:58:44 UTC 2012 |
| Uploaded by | MaximeHenrion |
| Built on | ghc-7.4 |
Modules
- Data
- Compression
Downloads
- huffman-1.0.1.tar.gz (Cabal source package)
- package description (included in the package)