Lines Matching refs:maxbitlen
491 unsigned maxbitlen; /*maximum number of bits a single code can get*/
499 std::cout << "tree. length: " << tree->numcodes << " maxbitlen: " << tree->maxbitlen << std::endl;
584 numcodes, lengths and maxbitlen must already be filled in correctly. return
599 if(!uivector_resizev(&blcount, tree->maxbitlen + 1, 0)
600 || !uivector_resizev(&nextcode, tree->maxbitlen + 1, 0))
608 for(bits = 1; bits <= tree->maxbitlen; bits++)
628 by Deflate. maxbitlen is the maximum bits that a code in the tree can have.
632 size_t numcodes, unsigned maxbitlen)
639 tree->maxbitlen = maxbitlen;
715 size_t numcodes, unsigned maxbitlen)
762 For every symbol, maxbitlen coins will be created*/
783 for(j = 1; j <= maxbitlen && !error; j++) /*each of the remaining rows*/
805 if(j < maxbitlen)
835 size_t mincodes, size_t numcodes, unsigned maxbitlen)
839 tree->maxbitlen = maxbitlen;
846 error = lodepng_huffman_code_lengths(tree->lengths, frequencies, numcodes, maxbitlen);
