Lines Matching refs:t
119 for ( var i = this.t - 1; i >= 0; --i)
121 r.t = this.t;
127 this.t = 1;
134 this.t = 0;
163 this.t = 0;
175 this[this.t++] = x;
177 this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;
178 this[this.t++] = (x >> (this.DB - sh));
180 this[this.t - 1] |= x << sh;
188 this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;
198 while (this.t > 0 && this[this.t - 1] == c)
199 --this.t;
219 var km = (1 << k) - 1, d, m = false, r = "", i = this.t;
263 var i = this.t;
264 r = i - a.t;
275 var r = 1, t;
276 if ((t = x >>> 16) != 0) {
277 x = t;
280 if ((t = x >> 8) != 0) {
281 x = t;
284 if ((t = x >> 4) != 0) {
285 x = t;
288 if ((t = x >> 2) != 0) {
289 x = t;
292 if ((t = x >> 1) != 0) {
293 x = t;
301 if (this.t <= 0)
303 return this.DB * (this.t - 1)
304 + nbits(this[this.t - 1] ^ (this.s & this.DM));
310 for (i = this.t - 1; i >= 0; --i)
314 r.t = this.t + n;
320 for ( var i = n; i < this.t; ++i)
322 r.t = Math.max(this.t - n, 0);
332 for (i = this.t - 1; i >= 0; --i) {
339 r.t = this.t + ds + 1;
348 if (ds >= this.t) {
349 r.t = 0;
356 for ( var i = ds + 1; i < this.t; ++i) {
361 r[this.t - ds - 1] |= (this.s & bm) << cbs;
362 r.t = this.t - ds;
368 var i = 0, c = 0, m = Math.min(a.t, this.t);
374 if (a.t < this.t) {
376 while (i < this.t) {
384 while (i < a.t) {
396 r.t = i;
404 var i = x.t;
405 r.t = i + y.t;
408 for (i = 0; i < y.t; ++i)
409 r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);
419 var i = r.t = 2 * x.t;
422 for (i = 0; i < x.t - 1; ++i) {
424 if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {
425 r[i + x.t] -= x.DV;
426 r[i + x.t + 1] = 1;
429 if (r.t > 0)
430 r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);
439 if (pm.t <= 0)
442 if (pt.t < pm.t) {
452 var nsh = this.DB - nbits(pm[pm.t - 1]); // normalize modulus
460 var ys = y.t;
466 var i = r.t, j = i - ys, t = (q == null) ? nbi() : q;
467 y.dlShiftTo(j, t);
468 if (r.compareTo(t) >= 0) {
469 r[r.t++] = 1;
470 r.subTo(t, r);
472 BigInteger.ONE.dlShiftTo(ys, t);
473 t.subTo(y, y); // "negative" y so we can replace sub with am later
474 while (y.t < ys)
475 y[y.t++] = 0;
481 y.dlShiftTo(j, t);
482 r.subTo(t, r);
484 r.subTo(t, r);
492 r.t = ys;
551 if (this.t < 1)
574 this.mt2 = 2 * m.t;
580 x.abs().dlShiftTo(this.m.t, r);
597 while (x.t <= this.mt2)
599 x[x.t++] = 0;
600 for ( var i = 0; i < this.m.t; ++i) {
606 j = i + this.m.t;
607 x[j] += this.m.am(0, u0, x, i, 0, this.m.t);
615 x.drShiftTo(this.m.t, x);
640 return ((this.t > 0) ? (this[0] & 1) : this.s) == 0;
654 var t = r;
656 r2 = t;
711 var i, j, t;
717 t = this.S[i];
719 this.S[j] = t;
726 var t;
729 t = this.S[this.i];
731 this.S[this.j] = t;
732 return this.S[(t + this.S[this.i]) & 255];
775 var t; variable
780 for (t = 0; t < z.length; ++t)
781 rng_pool[rng_pptr++] = z.charCodeAt(t) & 255;
784 t = Math.floor(65536 * Math.random());
785 rng_pool[rng_pptr++] = t >>> 8;
786 rng_pool[rng_pptr++] = t & 255;