Lines Matching refs:r
1 …r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)re… argument
2658 value: function setTLBR(t, l, b, r, s) {
2675 left: Math.min(l, r),
2677 right: Math.max(l, r),
3641 var r = worksheet.getRow(row + count++);
3645 var cell = r.getCell(col + j);
3652 var r = worksheet.getRow(row + count++);
3654 var cell = r.getCell(col + j);
3698 var r = worksheet.getRow(row + count++);
3700 var cell = r.getCell(col + j);
3706 var r = worksheet.getRow(row + count++);
3708 var cell = r.getCell(col + j);
4492 this._rows.forEach(function (r) {
4493 if (r) {
4494 r.splice(start, count);
4530 value: function findRow(r) {
4531 return this._rows[r - 1];
4542 value: function getRow(r) {
4543 var row = this._rows[r - 1];
4546 row = this._rows[r - 1] = new Row(this, r);
4801 value: function findCell(r, c) {
4802 var address = colCache.getAddress(r, c);
4809 value: function getCell(r, c) {
4810 var address = colCache.getAddress(r, c);
4947 for (var r = top; r <= bottom; r++) {
4950 this.getCell(r, c).value = {
4954 result: getResult(r, c)
4958 this.getCell(r, c).value = isShared ? {
4960 result: getResult(r, c)
4961 } : getResult(r, c);
5847 getAddress: function getAddress(r, c) {
5849 var address = this.n2l(c) + r;
5853 return this.decodeAddress(r);
7447 var r = this._rollbacks.pop();
7449 if (this._xml.length > r.xml) {
7450 this._xml.splice(r.xml, this._xml.length - r.xml);
7453 if (this._stack.length > r.stack) {
7454 this._stack.splice(r.stack, this._stack.length - r.stack);
7457 this.leaf = r.leaf;
7458 this.open = r.open;
9488 var r = Math.floor(anchor.right);
9489 var rf = Math.floor((anchor.right - r) * 68);
9492 return [l, lf, t, tf, r, rf, b, bf];
9501 var r = l + 2;
9505 return [l, lf, t, tf, r, rf, b, bf];
13299 address: node.attributes.r
17828 number: parseInt(node.attributes.r, 10),
18890 function nextRid(r) {
18891 return "rId".concat(r.length + 1);
19832 r: new RichTextXform(),
19847 var r = this.map.r;
19849 r.render(xmlStream, text);
20149 r: new RichTextXform(),
20166 _this2.map.r.render(xmlStream, text);
25591 rows.forEach(function (r) {
25592 _this2.push(Buffer.from(r, 'utf8'));
25618 rows.forEach(function (r) {
25619 _this3.push(Buffer.from(r, 'utf8'));
29624 var r = 0;
29629 r <<= 4; // 'a' - 'f'
29632 r |= c - 49 + 0xa; // 'A' - 'F'
29634 r |= c - 17 + 0xa; // '0' - '9'
29636 r |= c & 0xf;
29640 return r;
29679 var r = 0;
29684 r *= mul; // 'a'
29687 r += c - 49 + 0xa; // 'A'
29689 r += c - 17 + 0xa; // '0' - '9'
29691 r += c;
29695 return r;
29756 var r = new BN(null);
29757 this.copy(r);
29758 return r;
29876 var r = c.modn(groupBase).toString(base);
29880 out = zeros[groupSize - r.length] + r + out;
29882 out = r + out;
29976 var r = 0;
29979 r += 13;
29984 r += 7;
29989 r += 4;
29994 r += 2;
29998 return r + t;
30006 var r = 0;
30009 r += 13;
30014 r += 7;
30019 r += 4;
30024 r += 2;
30029 r++;
30032 return r;
30059 var r = 0;
30064 r += b;
30068 return r;
30265 var r; // negative + positive
30269 r = this.isub(num);
30274 r = this.isub(num);
30276 return r._normSign();
30293 r = (a.words[i] | 0) + (b.words[i] | 0) + carry;
30294 this.words[i] = r & 0x3ffffff;
30295 carry = r >>> 26;
30299 r = (a.words[i] | 0) + carry;
30300 this.words[i] = r & 0x3ffffff;
30301 carry = r >>> 26;
30343 var r = this.iadd(num);
30345 return r._normSign(); // -this - num = -(this + num)
30377 r = (a.words[i] | 0) - (b.words[i] | 0) + carry;
30378 carry = r >> 26;
30379 this.words[i] = r & 0x3ffffff;
30383 r = (a.words[i] | 0) + carry;
30384 carry = r >> 26;
30385 this.words[i] = r & 0x3ffffff;
30417 var r = a * b;
30418 var lo = r & 0x3ffffff;
30419 var carry = r / 0x4000000 | 0;
30433 r = a * b + rword;
30434 ncarry += r / 0x4000000 | 0;
30435 rword = r & 0x3ffffff;
31070 var r = a * b;
31071 var lo = r & 0x3ffffff;
31072 ncarry = ncarry + (r / 0x4000000 | 0) | 0;
31379 var r = bits % 26;
31380 var s = (bits - r) / 26;
31381 var carryMask = 0x3ffffff >>> 26 - r << 26 - r;
31384 if (r !== 0) {
31389 var c = (this.words[i] | 0) - newCarry << r;
31391 carry = newCarry >>> 26 - r;
31434 var r = bits % 26;
31435 var s = Math.min((bits - r) / 26, this.length);
31436 var mask = 0x3ffffff ^ 0x3ffffff >>> r << r;
31465 this.words[i] = carry << 26 - r | word >>> r;
31509 var r = bit % 26;
31510 var s = (bit - r) / 26;
31511 var q = 1 << r; // Fast case: bit is much higher than all existing words
31522 var r = bits % 26;
31523 var s = (bits - r) / 26;
31530 if (r !== 0) {
31536 if (r !== 0) {
31537 var mask = 0x3ffffff ^ 0x3ffffff >>> r << r;
32096 var r = a.cmp(b);
32098 if (r < 0) {
32103 } else if (r === 0 || b.cmpn(1) === 0) {
32134 var r = bit % 26;
32135 var s = (bit - r) / 26;
32136 var q = 1 << r; // Fast case: bit is much higher than all existing words
32413 var r = num;
32417 this.split(r, this.tmp);
32418 r = this.imulK(r);
32419 r = r.iadd(this.tmp);
32420 rlen = r.bitLength();
32423 var cmp = rlen < this.n ? -1 : r.ucmp(this.p);
32426 r.words[0] = 0;
32427 r.length = 1;
32429 r.isub(this.p);
32431 if (r.strip !== undefined) {
32433 r.strip();
32436 r._strip();
32440 return r;
32729 var r = this.pow(a, q.addn(1).iushrn(1));
32742 r = r.redMul(b);
32748 return r;
32814 var r = num.umod(this.m);
32815 return r === num ? r.clone() : r;
32839 this.r = new BN(1).iushln(this.shift);
32840 this.r2 = this.imod(this.r.sqr());
32841 this.rinv = this.r._invmp(this.m);
32842 this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);
32843 this.minv = this.minv.umod(this.r);
32844 this.minv = this.r.sub(this.minv);
32854 var r = this.imod(num.mul(this.rinv));
32855 r.red = null;
32856 return r;
33214 var r = 0;
33220 r <<= 4;
33231 r |= b;
33236 return r;
33275 var r = 0;
33281 r *= mul; // 'a'
33292 r += b;
33295 return r;
33367 var r = new BN(null);
33368 this.copy(r);
33369 return r;
33499 var r = c.modrn(groupBase).toString(base);
33503 out = zeros[groupSize - r.length] + r + out;
33505 out = r + out;
33660 var r = 0;
33663 r += 13;
33668 r += 7;
33673 r += 4;
33678 r += 2;
33682 return r + t;
33690 var r = 0;
33693 r += 13;
33698 r += 7;
33703 r += 4;
33708 r += 2;
33713 r++;
33716 return r;
33743 var r = 0;
33748 r += b;
33752 return r;
33949 var r; // negative + positive
33953 r = this.isub(num);
33958 r = this.isub(num);
33960 return r._normSign();
33977 r = (a.words[i] | 0) + (b.words[i] | 0) + carry;
33978 this.words[i] = r & 0x3ffffff;
33979 carry = r >>> 26;
33983 r = (a.words[i] | 0) + carry;
33984 this.words[i] = r & 0x3ffffff;
33985 carry = r >>> 26;
34027 var r = this.iadd(num);
34029 return r._normSign(); // -this - num = -(this + num)
34061 r = (a.words[i] | 0) - (b.words[i] | 0) + carry;
34062 carry = r >> 26;
34063 this.words[i] = r & 0x3ffffff;
34067 r = (a.words[i] | 0) + carry;
34068 carry = r >> 26;
34069 this.words[i] = r & 0x3ffffff;
34101 var r = a * b;
34102 var lo = r & 0x3ffffff;
34103 var carry = r / 0x4000000 | 0;
34117 r = a * b + rword;
34118 ncarry += r / 0x4000000 | 0;
34119 rword = r & 0x3ffffff;
34754 var r = a * b;
34755 var lo = r & 0x3ffffff;
34756 ncarry = ncarry + (r / 0x4000000 | 0) | 0;
35067 var r = bits % 26;
35068 var s = (bits - r) / 26;
35069 var carryMask = 0x3ffffff >>> 26 - r << 26 - r;
35072 if (r !== 0) {
35077 var c = (this.words[i] | 0) - newCarry << r;
35079 carry = newCarry >>> 26 - r;
35122 var r = bits % 26;
35123 var s = Math.min((bits - r) / 26, this.length);
35124 var mask = 0x3ffffff ^ 0x3ffffff >>> r << r;
35153 this.words[i] = carry << 26 - r | word >>> r;
35197 var r = bit % 26;
35198 var s = (bit - r) / 26;
35199 var q = 1 << r; // Fast case: bit is much higher than all existing words
35210 var r = bits % 26;
35211 var s = (bits - r) / 26;
35218 if (r !== 0) {
35224 if (r !== 0) {
35225 var mask = 0x3ffffff ^ 0x3ffffff >>> r << r;
35796 var r = a.cmp(b);
35798 if (r < 0) {
35803 } else if (r === 0 || b.cmpn(1) === 0) {
35834 var r = bit % 26;
35835 var s = (bit - r) / 26;
35836 var q = 1 << r; // Fast case: bit is much higher than all existing words
36115 var r = num;
36119 this.split(r, this.tmp);
36120 r = this.imulK(r);
36121 r = r.iadd(this.tmp);
36122 rlen = r.bitLength();
36125 var cmp = rlen < this.n ? -1 : r.ucmp(this.p);
36128 r.words[0] = 0;
36129 r.length = 1;
36131 r.isub(this.p);
36133 if (r.strip !== undefined) {
36135 r.strip();
36138 r._strip();
36142 return r;
36432 var r = this.pow(a, q.addn(1).iushrn(1));
36445 r = r.redMul(b);
36451 return r;
36517 var r = num.umod(this.m);
36518 return r === num ? r.clone() : r;
36542 this.r = new BN(1).iushln(this.shift);
36543 this.r2 = this.imod(this.r.sqr());
36544 this.rinv = this.r._invmp(this.m);
36545 this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);
36546 this.minv = this.minv.umod(this.r);
36547 this.minv = this.r.sub(this.minv);
36557 var r = this.imod(num.mul(this.rinv));
36558 r.red = null;
36559 return r;
36611 var r;
36614 if (!r) r = new Rand(null);
36615 return r.generate(len);
38070 var r = getr(priv);
38071 var blinder = r.toRed(bn.mont(priv.modulus)).redPow(new bn(priv.publicExponent)).fromRed();
38074 unblinder: r.invm(priv.modulus)
38102 var r = new bn(randomBytes(len));
38104 while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2)) {
38105 r = new bn(randomBytes(len));
38108 return r;
38455 var r = new BN(0);
38463 r = makeR(g, k, p, q);
38464 s = k.invm(q).imul(H.add(x.mul(r))).mod(q);
38468 r = new BN(0);
38472 return toDER(r, s);
38475 function toDER(r, s) {
38476 r = r.toArray();
38479 if (r[0] & 0x80) r = [0].concat(r);
38481 var total = r.length + s.length + 4;
38482 var res = [0x30, total, 0x02, r.length];
38483 res = res.concat(r, [0x02, s.length], s);
38635 var r = unpacked.r;
38637 checkValue(r, q);
38640 …var v = g.toRed(montp).redPow(new BN(hash).mul(w).mod(q)).fromRed().mul(y.toRed(montp).redPow(r.mu…
38641 return v.cmp(r) === 0;
43033 reject: function reject(r) {
43035 capability.reject.call(undefined, r);
44016 r = "hour",
44026 var r = String(t);
44027 return !r || r.length >= e ? t : "" + Array(e + 1 - r.length).join(n) + t;
44034 r = Math.floor(n / 60),
44036 return (e <= 0 ? "+" : "-") + d(r, 2, "0") + ":" + d(i, 2, "0");
44040 var r = 12 * (n.year() - e.year()) + (n.month() - e.month()),
44041 i = e.add(r, u),
44043 a = e.add(r + (s ? -1 : 1), u);
44044 return +(-(r + (n - i) / (s ? i - a : a - i)) || 0);
44056 h: r,
44081 var r;
44083 if ("string" == typeof t) M[t] && (r = t), e && (M[t] = e, r = t);else {
44085 M[i] = t, r = i;
44087 return !n && r && (y = r), r || !n && y;
44119 var r = e.match(h);
44121 if (r) {
44122 var i = r[2] - 1 || 0,
44123 s = (r[7] || "0").substring(0, 3);
44124 … ? new Date(Date.UTC(r[1], i, r[3] || 1, r[4] || 0, r[5] || 0, r[6] || 0, s)) : new Date(r[1], i, …
44182 case r:
44200 …d + "Date", h[f] = d + "Date", h[u] = d + "Month", h[o] = d + "FullYear", h[r] = d + "Hours", h[n]…
44228 var $ = (f = {}, f[n] = 6e4, f[r] = 36e5, f[e] = 1e3, f)[c] || 1,
44238 r = g.z(this),
44245 h = function h(t, r, i, s) {
44246 return t && (t[r] || t(e, n)) || i[r].substr(0, s);
44252 var r = t < 12 ? "AM" : "PM";
44253 return n ? r.toLowerCase() : r;
44279 Z: r
44283 return e || l[t] || r.replace(":", "");
44294 … c[u] = M, c[a] = M / 3, c[s] = (y - l) / 6048e5, c[i] = (y - l) / 864e5, c[r] = y / 36e5, c[n] = …
44302 r = D(t, e, !0);
44303 return r && (n.$L = r), n;
44318 …return v.prototype = p, [["$ms", t], ["$s", e], ["$m", n], ["$H", r], ["$W", i], ["$M", u], ["$y",…
44342 r = /\d\d?/,
44374 s: [r, i("seconds")],
44375 ss: [r, i("seconds")],
44376 m: [r, i("minutes")],
44377 mm: [r, i("minutes")],
44378 H: [r, i("hours")],
44379 h: [r, i("hours")],
44380 HH: [r, i("hours")],
44381 hh: [r, i("hours")],
44382 D: [r, i("day")],
44386 r = e.match(/\d+/);
44387 if (this.day = r[0], n) for (var o = 1; o <= 31; o += 1) {
44391 M: [r, i("month")],
44415 var f = function f(t, n, r) {
44418 for (var n = t.match(e), r = n.length, o = 0; o < r; o += 1) {
44430 for (var e = {}, o = 0, i = 0; o < r; o += 1) {
44469 …return l ? new Date(Date.UTC(p, y, v, D, M, g, Y + 60 * l.offset * 1e3)) : r ? new Date(Date.UTC(p…
44475 return function (e, n, r) {
44491 …u && (c = s[2]), h || (t = c ? r.Ls[c] : this.$locale()), this.$d = f(n, a, o), this.init(), c && …
44494 var v = r.apply(this, s);
44562 var r = n.format;
44565 return r.call(this, i);
44858 var r = utils.readUInt32BE(inp, inOff + 4); // Initial Permutation
44860 utils.ip(l, r, state.tmp, 0);
44862 r = state.tmp[1];
44863 …if (this.type === 'encrypt') this._encrypt(state, l, r, state.tmp, 0);else this._decrypt(state, l,…
44865 r = state.tmp[1];
44867 utils.writeUInt32BE(out, r, outOff + 4);
44892 var r = rStart; // Apply f() x16 times
44898 utils.expand(r, state.tmp, 0);
44903 var t = r;
44904 r = (l ^ f) >>> 0;
44909 utils.rip(r, l, out, off);
44914 var r = lStart; // Apply f() x16 times
44926 l = (r ^ f) >>> 0;
44927 r = t;
44931 utils.rip(l, r, out, off);
45151 exports.expand = function expand(r, out, off) {
45154 outL = (r & 1) << 5 | r >>> 27;
45158 outL |= r >>> i & 0x3f;
45162 outR |= r >>> i & 0x3f;
45166 outR |= (r & 0x1f) << 1 | r >>> 31;
45993 var r = this;
45996 r = r.dbl();
45999 return r;
46683 var r;
46688 r = v.sub(q.mul(u));
46692 if (!a1 && r.cmp(aprxSqrt) < 0) {
46695 a1 = r.neg();
46701 prevR = r;
46703 u = r;
46710 a2 = r.neg();
47072 var r = s1.redSub(s2);
47075 if (r.cmpn(0) !== 0) return this.curve.jpoint(null, null, null);else return this.dbl();
47081 var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);
47082 var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));
47099 var r = s1.redSub(s2);
47102 if (r.cmpn(0) !== 0) return this.curve.jpoint(null, null, null);else return this.dbl();
47108 var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);
47109 var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));
47120 var r = this;
47123 r = r.dbl();
47126 return r;
47674 var r = kpX.umod(this.n);
47675 if (r.cmpn(0) === 0) continue;
47676 var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));
47679 …var recoveryParam = (kp.getY().isOdd() ? 1 : 0) | (kpX.cmp(r) !== 0 ? 2 : 0); // Use complement of…
47687 r: r,
47699 var r = signature.r;
47701 if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0) return false;
47706 var u2 = sinv.mul(r).umod(this.n);
47711 return p.getX().umod(this.n).cmp(r) === 0;
47721 return p.eqXToP(r);
47729 var r = signature.r;
47734 …if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey) throw new Error('Unable to find se…
47736 …if (isSecondKey) r = this.curve.pointFromX(r.add(this.curve.n), isYOdd);else r = this.curve.pointF…
47737 var rInv = signature.r.invm(n);
47742 return this.g.mulAdd(s1, r, s2);
47891 assert(options.r && options.s, 'Signature without r or s');
47892 this.r = new BN(options.r, 16);
47976 var r = data.slice(p.place, rlen + p.place);
47995 if (r[0] === 0) {
47996 if (r[1] & 0x80) {
47997 r = r.slice(1);
48013 this.r = new BN(r);
48036 var r = this.r.toArray();
48039 if (r[0] & 0x80) r = [0].concat(r); // Pad values
48042 r = rmPadding(r);
48050 constructLength(arr, r.length);
48051 arr = arr.concat(r);
48099 var r = this.hashInt(key.messagePrefix(), message);
48100 var R = this.g.mul(r);
48103 var S = r.add(s_).umod(this.curve.n);
49385 var r = msg.length % this._delta8;
49386 this.pending = msg.slice(msg.length - r, msg.length);
49388 msg = utils.join32(msg, 0, msg.length - r, this.endian);
49541 var T = sum32(rotl32(sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)), s[j]), E);
49579 var r = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9,…
49933 var r = xh & yh ^ ~xh & zh;
49934 if (r < 0) r += 0x100000000;
49935 return r;
49939 var r = xl & yl ^ ~xl & zl;
49940 if (r < 0) r += 0x100000000;
49941 return r;
49945 var r = xh & yh ^ xh & zh ^ yh & zh;
49946 if (r < 0) r += 0x100000000;
49947 return r;
49951 var r = xl & yl ^ xl & zl ^ yl & zl;
49952 if (r < 0) r += 0x100000000;
49953 return r;
49962 var r = c0_hi ^ c1_hi ^ c2_hi;
49963 if (r < 0) r += 0x100000000;
49964 return r;
49973 var r = c0_lo ^ c1_lo ^ c2_lo;
49974 if (r < 0) r += 0x100000000;
49975 return r;
49983 var r = c0_hi ^ c1_hi ^ c2_hi;
49984 if (r < 0) r += 0x100000000;
49985 return r;
49993 var r = c0_lo ^ c1_lo ^ c2_lo;
49994 if (r < 0) r += 0x100000000;
49995 return r;
50002 var r = c0_hi ^ c1_hi ^ c2_hi;
50003 if (r < 0) r += 0x100000000;
50004 return r;
50011 var r = c0_lo ^ c1_lo ^ c2_lo;
50012 if (r < 0) r += 0x100000000;
50013 return r;
50021 var r = c0_hi ^ c1_hi ^ c2_hi;
50022 if (r < 0) r += 0x100000000;
50023 return r;
50031 var r = c0_lo ^ c1_lo ^ c2_lo;
50032 if (r < 0) r += 0x100000000;
50033 return r;
50360 var r = al << 32 - num | ah >>> num;
50361 return r >>> 0;
50367 var r = ah << 32 - num | al >>> num;
50368 return r >>> 0;
50380 var r = ah << 32 - num | al >>> num;
50381 return r >>> 0;
61687 assert.equal = function assertEqual(l, r, msg) {
61688 if (l != r) throw new Error(msg || 'Assertion failed: ' + l + ' != ' + r);
70050 …ED[\n\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\n\r]+([0-9A-z\n\r+/=]+)[\n\r]+/m;
81439 var r;
81443 r = this.fillLast(buf);
81444 if (r === undefined) return '';
81451 if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i);
81452 return r || '';
81543 var r = utf8CheckExtraBytes(this, buf, p);
81544 if (r !== undefined) return r;
81570 var r = buf && buf.length ? this.write(buf) : '';
81571 if (this.lastNeed) return r + "\uFFFD";
81572 return r;
81581 var r = buf.toString('utf16le', i);
81583 if (r) {
81584 var c = r.charCodeAt(r.length - 1);
81591 return r.slice(0, -1);
81595 return r;
81607 var r = buf && buf.length ? this.write(buf) : '';
81611 return r + this.lastChar.toString('utf16le', 0, end);
81614 return r;
81634 var r = buf && buf.length ? this.write(buf) : '';
81635 if (this.lastNeed) return r + this.lastChar.toString('base64', 0, 3 - this.lastNeed);
81636 return r;