Lines Matching defs:DV
88 BigInteger.prototype.DV = (1<<dbits);
119 // (protected) set from integer value x, -DV <= x < DV
124 else if(x < -1) this[0] = x+this.DV;
318 if(c < -1) r[i++] = this.DV+c;
344 if((r[i+x.t]+=x.am(i+1,2*x[i],r,2*i+1,c,x.t-i-1)) >= x.DV) {
345 r[i+x.t] -= x.DV;
446 // last step - calculate inverse mod DV directly;
448 y = (y*(2-x*y%this.DV))%this.DV; // y == 1/x mod 2^dbits
449 // we really want the negative inverse, and -DV < y < DV
450 return (y>0)?this.DV-y:-y;
485 // faster way of calculating u0 = x[i]*mp mod DV
492 while(x[j] >= x.DV) { x[j] -= x.DV; x[++j]++; }
579 if(this.t == 1) return this[0]-this.DV;
594 // (protected) return x s.t. r^x < DV
843 else if(c < -1) r[i++] = this.DV+c;
873 // (protected) this *= n, this >= 0, 1 < n < DV
885 while(this[w] >= this.DV) {
886 this[w] -= this.DV;
1063 var d = this.DV%n, r = (this.s<0)?n-1:0;