example.c [code] | An example of use of the library HuffwordLib.a; here the file "example.dat" is first compressed and then decompressed. The result is compared to the input file in order to check if any error occurred. Then the decompression of a piece of the original text is performed |
huffw.c [code] | The Huffword byte-aligned and tagged compression algorithm. Here every codeword is derived from a Huffman tree of fanout 128, by appending to each group of 7-bits a tagging bit which is 1 for the first group and 0 for the others. The program allows to choose two distinct parsing rules for the dictionary formation. For details see [deMoura, Navarro, Ziviani, Baeza-Yates, ACM Trans Info Syst, 2000] |
HuffwordLib.c [code] | Library of C procedures for canonical huffword (de)compression and its manipulation. The Library exports a set of C functions that allow to access and process all of its constitutent parts: dictionary, codewords, tokens, etc. etc |
HuffwordLib.h [code] | Interface of C Library processing |