Lines Matching defs:DB
86 BigInteger.prototype.DB = dbits;
153 else if(sh+k > this.DB) {
154 this[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;
155 this[this.t++] = (x>>(this.DB-sh));
160 if(sh >= this.DB) sh -= this.DB;
164 if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;
187 var p = this.DB-(i*this.DB)%k;
189 if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }
193 d |= this[--i]>>(p+=this.DB-k);
197 if(p <= 0) { p += this.DB; --i; }
237 return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));
240 // (protected) r = this << n*DB
249 // (protected) r = this >> n*DB
258 var bs = n%this.DB;
259 var cbs = this.DB-bs;
261 var ds = Math.floor(n/this.DB), c = (this.s<<bs)&this.DM, i;
276 var ds = Math.floor(n/this.DB);
278 var bs = n%this.DB;
279 var cbs = this.DB-bs;
297 c >>= this.DB;
304 c >>= this.DB;
313 c >>= this.DB;
367 var nsh = this.DB-nbits(pm[pm.t-1]); // normalize modulus
428 // (protected) return "-1/this % 2^DB"; useful for Mont. reduction
447 // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints
459 this.um = (1<<(m.DB-15))-1;
584 // assumes 16 < DB < 32
585 return ((this[1]&((1<<(32-this.DB))-1))<<this.DB)|this[0];
591 // (public) return value as short (assumes DB>=16)
595 function bnpChunkSize(r) { return Math.floor(Math.LN2*this.DB/Math.log(r)); }
676 var p = this.DB-(i*this.DB)%8, d, k = 0;
678 if(p < this.DB && (d = this[i]>>p) != (this.s&this.DM)>>p)
679 r[k++] = d|(this.s<<(this.DB-p));
683 d |= this[--i]>>(p+=this.DB-8);
687 if(p <= 0) { p += this.DB; --i; }
773 if(this[i] != 0) return i*this.DB+lbit(this[i]);
774 if(this.s < 0) return this.t*this.DB;
794 var j = Math.floor(n/this.DB);
796 return((this[j]&(1<<(n%this.DB)))!=0);
821 c >>= this.DB;
828 c >>= this.DB;
837 c >>= this.DB;
1008 if(j > 0) w |= e[j-1]>>(this.DB+i-k1);
1013 if((i -= n) < 0) { i += this.DB; --j; }
1026 if(--i < 0) { i = this.DB-1; --j; }