Searched refs:tree2d (Results 1 – 2 of 2) sorted by relevance
322 …tree2d.clear(); tree2d.resize(numcodes * 2, 32767); //32767 here means the tree2d isn't filled the… in makeFromLengths()328 if(tree2d[2 * treepos + bit] == 32767) //not yet filled in in makeFromLengths()333 tree2d[2 * treepos + bit] = n; in makeFromLengths()339 tree2d[2 * treepos + bit] = ++nodefilled + numcodes; in makeFromLengths()343 …else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get addre… in makeFromLengths()349 unsigned long numcodes = (unsigned long)tree2d.size() / 2; in decode()351 result = tree2d[2 * treepos + bit]; in decode()357 std::vector<unsigned long> tree2d; member
488 unsigned* tree2d; member510 tree->tree2d = 0; in HuffmanTree_init()517 lodepng_free(tree->tree2d); in HuffmanTree_cleanup()529 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned)); in HuffmanTree_make2DTree()530 if(!tree->tree2d) return 83; /*alloc fail*/ in HuffmanTree_make2DTree()544 tree->tree2d[n] = 32767; /*32767 here means the tree2d isn't filled there yet*/ in HuffmanTree_make2DTree()553 if(tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()557 tree->tree2d[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()566 tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes; in HuffmanTree_make2DTree()570 else treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()[all …]