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

  /external/zopfli/src/zopflipng/lodepng/
lodepng_util.cpp 322 tree2d.clear(); tree2d.resize(numcodes * 2, 32767); //32767 here means the tree2d isn't filled there yet
328 if(tree2d[2 * treepos + bit] == 32767) //not yet filled in
333 tree2d[2 * treepos + bit] = n;
339 tree2d[2 * treepos + bit] = ++nodefilled + numcodes;
343 else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get address value
349 unsigned long numcodes = (unsigned long)tree2d.size() / 2;
351 result = tree2d[2 * treepos + bit];
357 std::vector<unsigned long> tree2d; member in struct:lodepng::ExtractZlib::HuffmanTree
    [all...]
lodepng.cpp 488 unsigned* tree2d; member in struct:HuffmanTree
510 tree->tree2d = 0;
517 lodepng_free(tree->tree2d);
529 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned));
530 if(!tree->tree2d) return 83; /*alloc fail*/
533 convert tree1d[] to tree2d[][]. In the 2D array, a value of 32767 means
544 tree->tree2d[n] = 32767; /*32767 here means the tree2d isn't filled there yet*/
553 if(tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/
557 tree->tree2d[2 * treepos + bit] = n; /*put the current code in it*
    [all...]

Completed in 687 milliseconds