HomeSort by relevance Sort by last modified time
    Searched refs:numcodes (Results 1 - 3 of 3) sorted by null

  /external/zopfli/src/zopflipng/lodepng/
lodepng_util.cpp 312 unsigned long numcodes = (unsigned long)(bitlen.size()), treepos = 0, nodefilled = 0; local
313 std::vector<unsigned long> tree1d(numcodes), blcount(maxbitlen + 1, 0), nextcode(maxbitlen + 1, 0);
315 for(unsigned long bits = 0; bits < numcodes; bits++) blcount[bitlen[bits]]++;
321 for(unsigned long n = 0; n < numcodes; n++) if(bitlen[n] != 0) tree1d[n] = nextcode[bitlen[n]]++;
322 tree2d.clear(); tree2d.resize(numcodes * 2, 32767); //32767 here means the tree2d isn't filled there yet
323 for(unsigned long n = 0; n < numcodes; n++) //the codes
327 if(treepos > numcodes - 2) return 55;
338 //addresses are encoded as values > numcodes
339 tree2d[2 * treepos + bit] = ++nodefilled + numcodes;
343 else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get address valu
349 unsigned long numcodes = (unsigned long)tree2d.size() \/ 2; local
483 size_t numcodes = 0, numlit = 0, numlen = 0; \/\/for logging local
    [all...]
lodepng.cpp 492 unsigned numcodes; /*number of symbols in the alphabet = number of codes*/ member in struct:HuffmanTree
499 std::cout << "tree. length: " << tree->numcodes << " maxbitlen: " << tree->maxbitlen << std::endl;
526 unsigned treepos = 0; /*position in the tree (1 of the numcodes columns)*/
529 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned));
534 uninited, a value >= numcodes is an address to another bit, a value < numcodes
542 for(n = 0; n < tree->numcodes * 2; n++)
547 for(n = 0; n < tree->numcodes; n++) /*the codes*/
552 if(treepos > tree->numcodes - 2) return 55; /*oversubscribed, see comment in lodepng_error_text*/
565 /*addresses encoded with numcodes added to it*
    [all...]
lodepng.h     [all...]

Completed in 79 milliseconds