312       unsigned long numcodes = (unsigned long)(bitlen.size()), treepos = 0, nodefilled = 0;  in makeFromLengths()  local
327         if(treepos > numcodes - 2) return 55;  in makeFromLengths()
328         if(tree2d[2 * treepos + bit] == 32767) //not yet filled in  in makeFromLengths()
333             tree2d[2 * treepos + bit] = n;  in makeFromLengths()
334             treepos = 0;  in makeFromLengths()
339             tree2d[2 * treepos + bit] = ++nodefilled + numcodes;  in makeFromLengths()
340             treepos = nodefilled;  in makeFromLengths()
343 …else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get addre…  in makeFromLengths()
347     int decode(bool& decoded, unsigned long& result, size_t& treepos, unsigned long bit) const  in decode()
350       if(treepos >= numcodes) return 11; //error: you appeared outside the codetree  in decode()
351       result = tree2d[2 * treepos + bit];  in decode()
353       treepos = decoded ? 0 : result - numcodes;  in decode()
398     for(size_t treepos = 0;;)  in huffmanDecodeSymbol()  local
401       error = codetree.decode(decoded, ct, treepos, readBitFromStream(bp, in));  in huffmanDecodeSymbol()