-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathhuffman.cabal
29 lines (27 loc) · 941 Bytes
/
huffman.cabal
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
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