1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
compress.py:
Demonstrates how Huffman codes can be used to efficiently
compress and uncompress files (text or binary).
Given an input file, calculates the number of occurrences for each
character; from those frequencies, a Huffman tree is build.
Also allows encoding and decoding of a file, see -h option.
decodetree.py:
Demonstrates how to use the `decodetree` object, and how much speedup
may be achieved when using very large prefix codes.
decoding.py:
This example demonstrates how much faster bitarray's decoing is as
opposed to traversing the Huffman tree using Python.
huffman.py:
Library containing useful functionality for working with Huffman trees
and codes.
|
