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

  /external/zopfli/src/zopflipng/lodepng/
lodepng_util.cpp 313 std::vector<unsigned long> tree1d(numcodes), blcount(maxbitlen + 1, 0), nextcode(maxbitlen + 1, 0);
321 for(unsigned long n = 0; n < numcodes; n++) if(bitlen[n] != 0) tree1d[n] = nextcode[bitlen[n]]++;
326 unsigned long bit = (tree1d[n] >> (bitlen[n] - i - 1)) & 1;
lodepng.cpp 489 unsigned* tree1d; member in struct:HuffmanTree
500 for(size_t i = 0; i < tree->tree1d.size; i++)
503 std::cout << i << " " << tree->tree1d.data[i] << " " << tree->lengths.data[i] << std::endl;
511 tree->tree1d = 0;
518 lodepng_free(tree->tree1d);
533 convert tree1d[] to tree2d[][]. In the 2D array, a value of 32767 means
551 unsigned char bit = (unsigned char)((tree->tree1d[n] >> (tree->lengths[n] - i - 1)) & 1);
596 tree->tree1d = (unsigned*)lodepng_malloc(tree->numcodes * sizeof(unsigned));
597 if(!tree->tree1d) error = 83; /*alloc fail*/
615 if(tree->lengths[n] != 0) tree->tree1d[n] = nextcode.data[tree->lengths[n]]++
    [all...]

Completed in 979 milliseconds