huffman: Pure Haskell implementation of the Huffman encoding algorithm
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
Warnings:
- [option-o2] 'ghc-options: -O2' is rarely needed. Check that it is giving a real benefit and not just imposing longer compile times on your users.
- [missing-upper-bounds] On library, these packages miss upper bounds: - containers - fingertree Please add them. There is more information at https://pvp.haskell.org/
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, 1.0.2, 1.0.2 |
|---|---|
| Change log | None available |
| Dependencies | base (>=3 && <5), containers, fingertree [details] |
| License | BSD-2-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 2025-09-28T17:34:52Z |
Modules
[Index] [Quick Jump]
- Data
- Compression
Downloads
- huffman-1.0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees