huffman: Pure Haskell implementation of the Huffman encoding algorithm

[ bsd3, compression, data, library ] [ Propose Tags ]

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.

Modules

[Index]

Downloads

Maintainer's Corner

Package maintainers

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/mumux/huffman/issues/
Source repo head: hg clone http://bitbucket.org/mumux/huffman/
Uploaded by MaximeHenrion at 2010-03-14T14:36:56Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 2044 total (7 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]