Where do we start!|
There is definitely more compression available in the compressed form of the
table. I am thinking that the alphabet can be compressed more due to the fact
that I am not checking that all the symbols that exist can be used.
It annoys me that the compressed form of the table is that much slower than
the uncompressed version.
Also I know there are a couple of compressions I can make on the tree and I
will make the compressed version faster, probably not a fast as the uncompressed
The uncompressed table can be made a bit more efficient as the tree can be shortened
by using some of the unused entries in the tree. This should work in both the
symbol compressed and uncompressed trees.
More work, at the moment the starting alphabet is 255 chars, this should be changeable
it makes some sense to be able to vary the size of alphabet. Also would be nice to
be able to do a "huffman" style look-up, say for UTF-8 encoded strings.