Lines Matching refs:q
29941 var q = this.clone();
29949 for (i = 0; !q.isZero(); i++) {
29950 b = q.andln(0xff);
29951 q.iushrn(8);
29955 for (i = 0; !q.isZero(); i++) {
29956 b = q.andln(0xff);
29957 q.iushrn(8);
31367 for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {
31369 res = res.mul(q);
31511 var q = 1 << r; // Fast case: bit is much higher than all existing words
31516 return !!(w & q);
31692 var q;
31695 q = new BN(null);
31696 q.length = m + 1;
31697 q.words = new Array(q.length);
31699 for (var i = 0; i < q.length; i++) {
31700 q.words[i] = 0;
31709 if (q) {
31710 q.words[m] = 1;
31733 if (q) {
31734 q.words[j] = qj;
31738 if (q) {
31739 q.strip();
31749 div: q || null,
32136 var q = 1 << r; // Fast case: bit is much higher than all existing words
32141 this.words[s] |= q;
32146 var carry = q;
32707 var q = this.m.subn(1);
32710 while (!q.isZero() && q.andln(1) === 0) {
32712 q.iushrn(1);
32715 assert(!q.isZero());
32728 var c = this.pow(z, q);
32729 var r = this.pow(a, q.addn(1).iushrn(1));
32730 var t = this.pow(a, q);
35055 for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {
35057 res = res.mul(q);
35199 var q = 1 << r; // Fast case: bit is much higher than all existing words
35204 return !!(w & q);
35380 var q;
35383 q = new BN(null);
35384 q.length = m + 1;
35385 q.words = new Array(q.length);
35387 for (var i = 0; i < q.length; i++) {
35388 q.words[i] = 0;
35397 if (q) {
35398 q.words[m] = 1;
35421 if (q) {
35422 q.words[j] = qj;
35426 if (q) {
35427 q._strip();
35438 div: q || null,
35836 var q = 1 << r; // Fast case: bit is much higher than all existing words
35841 this.words[s] |= q;
35846 var carry = q;
36410 var q = this.m.subn(1);
36413 while (!q.isZero() && q.andln(1) === 0) {
36415 q.iushrn(1);
36418 assert(!q.isZero());
36431 var c = this.pow(z, q);
36432 var r = this.pow(a, q.addn(1).iushrn(1));
36433 var t = this.pow(a, q);
38087 var q = priv.prime2;
38093 h.imul(q);
38453 var q = priv.params.q;
38457 var H = bits2int(hash, q).mod(q);
38459 var kv = getKey(x, q, hash, algo);
38462 k = makeKey(q, kv, algo);
38463 r = makeR(g, k, p, q);
38464 s = k.invm(q).imul(H.add(x.mul(r))).mod(q);
38487 function getKey(x, q, hash, algo) {
38490 if (x.length < q.byteLength()) {
38491 var zeros = Buffer.alloc(q.byteLength() - x.length);
38496 var hbits = bits2octets(hash, q);
38510 function bits2int(obits, q) {
38512 var shift = (obits.length << 3) - q.bitLength();
38517 function bits2octets(bits, q) {
38518 bits = bits2int(bits, q);
38519 bits = bits.mod(q);
38522 if (out.length < q.byteLength()) {
38523 var zeros = Buffer.alloc(q.byteLength() - out.length);
38530 function makeKey(q, kv, algo) {
38537 while (t.length * 8 < q.bitLength()) {
38542 k = bits2int(t, q);
38545 } while (k.cmp(q) !== -1);
38550 function makeR(g, k, p, q) {
38551 return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q);
38630 var q = pub.data.q;
38636 checkValue(s, q);
38637 checkValue(r, q);
38639 var w = s.invm(q);
38640 …ntp).redPow(new BN(hash).mul(w).mod(q)).fromRed().mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromR…
38644 function checkValue(b, q) {
38646 if (b.cmp(q) >= q) throw new Error('invalid sig');
46687 var q = v.div(u);
46688 r = v.sub(q.mul(u));
46689 x = x2.sub(q.mul(x1));
46690 var y = y2.sub(q.mul(y1));
62739 for (var q = 0; q < 256; q++) {
62740 _utf8len[q] = q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1;
65951 function zswap32(q) {
65952 return (q >>> 24 & 0xff) + (q >>> 8 & 0xff00) + ((q & 0xff00) << 8) + ((q & 0xff) << 24);
75895 this.q = null;
76526 this.q = c;
76534 var q = this.q;
76536 if (this.captureToChar(q)) {
76537 this.text += String.fromCodePoint(q);
76538 this.q = null;
76559 this.q = c;
76565 var q = this.q;
76567 if (this.captureToChar(q)) {
76568 this.text += String.fromCodePoint(q);
76570 this.q = null;
77095 this.q = SPACE;
77097 this.q = c;
77105 …var c = this.captureTo([this.q, QUESTION]); // The question mark character is not valid inside any…
77345 this.q = c;
77358 var q = this.q,
77364 case q:
77367 this.q = null;
82729 function md5cmn(q, a, b, x, s, t) {
82730 return safeAdd(bitRotateLeft(safeAdd(safeAdd(a, q), safeAdd(x, t)), s), b);