success 301551 slava-huffman-implementation 2009-01-24T03:32:52Z 2009-01-24T03:32:53Z What this project is:a learning experience practice writing C code learning to create something that is actually useful What has been done:the compression is half done the code builds a balanced tree from a file What has not been done:decompression is completely absent for compression, the dictionary builder is not implemented (the last major part before it can be used) The problems with the code:header files contain code that has to be compiled the dictionary builder will have to be aware of the nodes (tree needs to have move left/right functions) I have decided to follow the old Linux versioning scheme. Even version denotes that some major function is done and the odd version indicates that the next major function is being worked on. FUTURE MILESTONES:version 0.2 - Compression is fully done version 0.4 - Decompression is complete version 0.6 - File spec is complete and implemented version 0.8 - command line arguments spec is complete and implemented version 1.0 - There are no problems with 0.8 http://code.google.com/p/slava-huffman-implementation slava-huffman-implementation 0 0 gpl3_or_later GNU General Public License 3 or later