Searched refs:tree1d (Results 1 – 2 of 2) sorted by relevance
313 …std::vector<unsigned long> tree1d(numcodes), blcount(maxbitlen + 1, 0), nextcode(maxbitlen + 1, 0); in makeFromLengths() local321 … for(unsigned long n = 0; n < numcodes; n++) if(bitlen[n] != 0) tree1d[n] = nextcode[bitlen[n]]++; in makeFromLengths()326 unsigned long bit = (tree1d[n] >> (bitlen[n] - i - 1)) & 1; in makeFromLengths()
489 unsigned* tree1d; member511 tree->tree1d = 0; in HuffmanTree_init()518 lodepng_free(tree->tree1d); in HuffmanTree_cleanup()551 unsigned char bit = (unsigned char)((tree->tree1d[n] >> (tree->lengths[n] - i - 1)) & 1); in HuffmanTree_make2DTree()596 tree->tree1d = (unsigned*)lodepng_malloc(tree->numcodes * sizeof(unsigned)); in HuffmanTree_makeFromLengths2()597 if(!tree->tree1d) error = 83; /*alloc fail*/ in HuffmanTree_makeFromLengths2()615 if(tree->lengths[n] != 0) tree->tree1d[n] = nextcode.data[tree->lengths[n]]++; in HuffmanTree_makeFromLengths2()853 return tree->tree1d[index]; in HuffmanTree_getCode()