Lines Matching defs:bit
326 unsigned long bit = (tree1d[n] >> (bitlen[n] - i - 1)) & 1;
328 if(tree2d[2 * treepos + bit] == 32767) //not yet filled in
332 //last bit
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
347 int decode(bool& decoded, unsigned long& result, size_t& treepos, unsigned long bit) const
351 result = tree2d[2 * treepos + bit];
362 size_t bp = 0, pos = 0; //bit pointer and byte pointer
369 if(bp >> 3 >= in.size()) { error = 52; return; } //error, bit pointer will jump past memory
413 if(bp >> 3 >= inlength - 2) { error = 49; return; } //the bit pointer is or will go past the memory
433 if(bp >> 3 >= inlength) { error = 50; return; } //error, bit pointer jumps past memory
446 if(bp >> 3 >= inlength) { error = 50; return; } //error, bit pointer jumps past memory
457 if(bp >> 3 >= inlength) { error = 50; return; } //error, bit pointer jumps past memory
507 if((bp >> 3) >= inlength) { error = 51; return; } //error, bit pointer will jump past memory
512 if((bp >> 3) >= inlength) { error = 51; return; } //error, bit pointer will jump past memory
538 if(p >= inlength - 4) { error = 52; return; } //error, bit pointer will jump past memory
637 void setBitOfReversedStream(size_t& bitp, unsigned char* bits, unsigned long bit)
639 bits[bitp >> 3] |= (bit << (7 - (bitp & 0x7))); bitp++;
