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