huffman / huffman.cabal

Name:		huffman
Version:	1.0.1
License-File:	LICENSE
License:	BSD3
Author:		Maxime Henrion
Copyright:	2010, Maxime Henrion
Maintainer:	Maxime Henrion <mhenrion@gmail.com>
Bug-Reports:	http://bitbucket.org/mux/huffman/issues/
Category:	Data, Compression
Synopsis:	Pure Haskell implementation of the Huffman encoding algorithm
Description:
	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.
Build-Type:	Simple
Cabal-Version:	>= 1.6
Tested-with:	GHC ==6.12

Source-Repository head
  Type:			mercurial
  Location:		http://bitbucket.org/mux/huffman/

Library
  Build-Depends:	base >= 3 && < 5, containers, fingertree
  Exposed-Modules:	Data.Compression.Huffman
  GHC-Options:		-Wall -O2 -funbox-strict-fields
Tip: Filter by directory path e.g. /media app.js to search for public/media/app.js.
Tip: Use camelCasing e.g. ProjME to search for ProjectModifiedEvent.java.
Tip: Filter by extension type e.g. /repo .js to search for all .js files in the /repo directory.
Tip: Separate your search with spaces e.g. /ssh pom.xml to search for src/ssh/pom.xml.
Tip: Use ↑ and ↓ arrow keys to navigate and return to view the file.
Tip: You can also navigate files with Ctrl+j (next) and Ctrl+k (previous) and view the file with Ctrl+o.
Tip: You can also navigate files with Alt+j (next) and Alt+k (previous) and view the file with Alt+o.