Donde? Done.

Donde?

Donde.

Methods to calculate the entropy of a table Symbol/Frequency and a method to calculate the number of bits needed to encode uncompressed Symbols from the table.

Moved everithing that was not table related from HuffTables

The tree transforms a string sequence of bits to the correct sequence of symbols.

Transforms a string of symbols to a string of the bits.

Huffman tree done, from hash table with Symbol/Frequency it creates a tree and you gan generate the Symbol/Code from it as a hash table also.

Merge pull request #1 from AdriaValls/HomePC

Merge branch 'master' into HomePC

HomePc version

Started HuffTree, it will store a list of nodes as a tree a table with the sequences of each symbol and a starting node. The tree will be created from a HashMap, it will have methods to get the symbol/sequence table and one to get the string from a bit sequence.

Initial commit