Searched defs:maxbitlen (Results 1 - 2 of 2) sorted by relevance
/external/zopfli/src/zopflipng/lodepng/ |
H A D | lodepng_util.cpp | 310 int makeFromLengths(const std::vector<unsigned long>& bitlen, unsigned long maxbitlen) argument 313 std::vector<unsigned long> tree1d(numcodes), blcount(maxbitlen + 1, 0), nextcode(maxbitlen + 1, 0); 316 for(unsigned long bits = 1; bits <= maxbitlen; bits++)
|
H A D | lodepng.cpp | 491 unsigned maxbitlen; /*maximum number of bits a single code can get*/ member in struct:HuffmanTree 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 631 HuffmanTree_makeFromLengths(HuffmanTree* tree, const unsigned* bitlen, size_t numcodes, unsigned maxbitlen) argument 714 lodepng_huffman_code_lengths(unsigned* lengths, const unsigned* frequencies, size_t numcodes, unsigned maxbitlen) argument 834 HuffmanTree_makeFromFrequencies(HuffmanTree* tree, const unsigned* frequencies, size_t mincodes, size_t numcodes, unsigned maxbitlen) argument [all...] |
Completed in 362 milliseconds