Searched refs:numcodes (Results 1 – 2 of 2) sorted by relevance
660 unsigned numcodes; /*number of symbols in the alphabet = number of codes*/ member698 for(i = 0; i < tree->numcodes; i++) { in HuffmanTree_makeTable()736 for(i = 0; i < tree->numcodes; ++i) { in HuffmanTree_makeTable()815 tree->codes = (unsigned*)lodepng_malloc(tree->numcodes * sizeof(unsigned)); in HuffmanTree_makeFromLengths2()823 for(bits = 0; bits != tree->numcodes; ++bits) ++blcount[tree->lengths[bits]]; in HuffmanTree_makeFromLengths2()829 for(n = 0; n != tree->numcodes; ++n) { in HuffmanTree_makeFromLengths2()851 size_t numcodes, unsigned maxbitlen) { in HuffmanTree_makeFromLengths() argument853 tree->lengths = (unsigned*)lodepng_malloc(numcodes * sizeof(unsigned)); in HuffmanTree_makeFromLengths()855 for(i = 0; i != numcodes; ++i) tree->lengths[i] = bitlen[i]; in HuffmanTree_makeFromLengths()856 tree->numcodes = (unsigned)numcodes; /*number of symbols*/ in HuffmanTree_makeFromLengths()[all …]
963 size_t numcodes, unsigned maxbitlen);
