Lines Matching refs:symbol
738 /*ensure at least two present symbols. There should be at least one symbol
742 symbol, it'd give it the theoritical 0 bits but in practice zlib wants 1 bit*/
762 For every symbol, maxbitlen coins will be created*/
816 /*calculate the lenghts of each symbol, as the amount of times a coin of each symbol is used*/
833 /*Create the Huffman tree given the symbol frequencies*/
910 decode the symbol from the tree. The "readBitFromStream" code is inlined in
915 if(ct < codetree->numcodes) return ct; /*the symbol is decoded, return it*/
916 else treepos = ct - codetree->numcodes; /*symbol not yet decoded, instead move tree position*/
987 /*i is the current symbol we're reading in the part that contains the code lengths of lit/len and dist codes*/
1104 if(code_ll <= 255) /*literal symbol*/
1748 unsigned symbol = lz77_encoded.data[i];
1749 frequencies_ll.data[symbol]++;
1750 if(symbol > 256)
5983 case 54: return "repeat symbol in tree while there was no value symbol yet";
5998 case 64: return "the length of the END symbol 256 in the Huffman tree is 0";
