Lines Matching refs:n
1 …n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return… argument
3096 var n = this._cells.length;
3098 for (var i = 1; i <= n; i++) {
4283 …n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.con…
4451 var n = this._columns.length + 1;
4453 while (n <= c) {
4454 this._columns.push(new Column(this, n++));
4769 var n = this._rows.length;
4771 for (var i = 1; i <= n; i++) {
5201 var n = rows.length;
5203 while (n > 0 && rows[n - 1] === undefined) {
5204 n--;
5207 return n;
5660 …n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.con…
5682 _level: function _level(n) {
5683 if (n <= 26) {
5687 if (n <= 26 * 26) {
5699 var n = 1;
5706 while (n <= 26) {
5707 c = this._dictionary[n - 1];
5708 this._n2l[n] = c;
5709 this._l2n[c] = n;
5710 n++;
5717 n = 27;
5719 while (n <= 26 + 26 * 26) {
5720 v = n - (26 + 1);
5724 this._n2l[n] = c;
5725 this._l2n[c] = n;
5726 n++;
5733 n = 26 + 26 * 26 + 1;
5735 while (n <= 16384) {
5736 v = n - (26 * 26 + 26 + 1);
5741 this._n2l[n] = c;
5742 this._l2n[c] = n;
5743 n++;
5760 n2l: function n2l(n) {
5761 if (n < 1 || n > 16384) {
5762 throw new Error("".concat(n, " is out of bounds. Excel supports columns from 1 to 16384"));
5765 if (!this._n2l[n]) {
5766 this._fill(this._level(n));
5769 return this._n2l[n];
7911 …n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] };…
7913 …n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.con…
8037 if ((_step2 = _iterator2.n()).done) {
8712 var n = value !== undefined ? model[name] = parseInt(value, 10) : dflt;
8714 if (n !== undefined) {
8715 model[name] = n;
14082 …n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.con…
14294 …n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.con…
15140 …n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.con…
31192 FFTM.prototype.guessLen13b = function guessLen13b(n, m) {
31193 var N = Math.max(m, n) | 1;
32399 this.n = this.p.bitLength();
32400 this.k = new BN(1).iushln(this.n).isub(this.p);
32406 tmp.words = new Array(Math.ceil(this.n / 13));
32421 } while (rlen > this.n);
32423 var cmp = rlen < this.n ? -1 : r.ucmp(this.p);
32444 input.iushrn(this.n, 0, out);
34878 FFTM.prototype.guessLen13b = function guessLen13b(n, m) {
34879 var N = Math.max(m, n) | 1;
36101 this.n = this.p.bitLength();
36102 this.k = new BN(1).iushln(this.n).isub(this.p);
36108 tmp.words = new Array(Math.ceil(this.n / 13));
36123 } while (rlen > this.n);
36125 var cmp = rlen < this.n ? -1 : r.ucmp(this.p);
36146 input.iushrn(this.n, 0, out);
36629 Rand.prototype._rand = function _rand(n) {
36630 if (this.rand.getBytes) return this.rand.getBytes(n);
36631 var res = new Uint8Array(n);
36643 Rand.prototype._rand = function _rand(n) {
36644 var arr = new Uint8Array(n);
36650 Rand.prototype._rand = function _rand(n) {
36651 var arr = new Uint8Array(n);
36669 Rand.prototype._rand = function _rand(n) {
36670 return crypto.randomBytes(n);
39284 function swap(b, n, m) {
39285 var i = b[n];
39286 b[n] = b[m];
40411 function toHex(n) {
40412 if (n < 16) return '0' + n.toString(16);
40413 return n.toString(16);
44015 n = "minute",
44025 d = function d(t, e, n) {
44027 return !r || r.length >= e ? t : "" + Array(e + 1 - r.length).join(n) + t;
44033 n = Math.abs(e),
44034 r = Math.floor(n / 60),
44035 i = n % 60;
44038 m: function t(e, n) {
44039 if (e.date() < n.date()) return -t(n, e);
44040 var r = 12 * (n.year() - e.year()) + (n.month() - e.month()),
44042 s = n - i < 0,
44044 return +(-(r + (n - i) / (s ? i - a : a - i)) || 0);
44057 m: n,
44080 D = function D(t, e, n) {
44087 return !n && r && (y = r), r || !n && y;
44091 var n = "object" == _typeof(e) ? e : {};
44092 return n.date = t, n.args = arguments, new S(n);
44113 n = t.utc;
44124 …return n ? new Date(Date.UTC(r[1], i, r[3] || 1, r[4] || 0, r[5] || 0, r[6] || 0, s)) : new Date(r…
44138 var n = v(t);
44139 return this.startOf(e) <= n && n <= this.endOf(e);
44144 }, $.$g = function (t, e, n) {
44145 return g.u(t) ? this[e] : this.set(n, t);
44155 var n = g.w(h.$u ? Date.UTC(h.$y, e, t) : new Date(h.$y, e, t), h);
44156 return c ? n : n.endOf(i);
44185 case n:
44200 … + "Date", h[u] = d + "Month", h[o] = d + "FullYear", h[r] = d + "Hours", h[n] = d + "Minutes", h[…
44220 var n = v(h);
44221 return g.w(n.date(n.date() + Math.round(e * t)), h);
44228 var $ = (f = {}, f[n] = 6e4, f[r] = 36e5, f[e] = 1e3, f)[c] || 1,
44237 var n = t || "YYYY-MM-DDTHH:mm:ssZ",
44246 return t && (t[r] || t(e, n)) || i[r].substr(0, s);
44251 $ = i.meridiem || function (t, e, n) {
44253 return n ? r.toLowerCase() : r;
44282 return n.replace(c, function (t, e) {
44294 … M / 3, c[s] = (y - l) / 6048e5, c[i] = (y - l) / 864e5, c[r] = y / 36e5, c[n] = y / 6e4, c[e] = y…
44301 var n = this.clone(),
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",…
44341 n = /\d\d/,
44351 var e, n;
44352 …{})).offset = (e = t.match(/([+-]|\d\d)/g), 0 === (n = 60 * e[1] + +e[2]) ? 0 : "+" === e[0] ? -n …
44355 var n = t[e];
44356 return n && (n.indexOf ? n : n.s.concat(n.f));
44368 SS: [n, function (t) {
44383 DD: [n, i("day")],
44385 var n = t.ordinal,
44387 if (this.day = r[0], n) for (var o = 1; o <= 31; o += 1) {
44388 n(o).replace(/\[|\]/g, "") === e && (this.day = o);
44392 MM: [n, i("month")],
44395 n = (a("monthsShort") || e.map(function (t) {
44398 if (n < 1) throw new Error();
44399 this.month = n % 12 || n;
44407 YY: [n, function (t) {
44415 var f = function f(t, n, r) {
44418 for (var n = t.match(e), r = n.length, o = 0; o < r; o += 1) {
44419 var i = n[o],
44423 n[o] = f ? {
44431 var s = n[o];
44445 var n = t.hours;
44446 e ? n < 12 && (t.hours += 12) : 12 === n && (t.hours = 0), delete t.afternoon;
44450 }(n)(t),
44475 return function (e, n, r) {
44476 var o = n.prototype,
44480 var n = e.date,
44491 ….Ls[c] : this.$locale()), this.$d = f(n, a, o), this.init(), c && !0 !== c && (this.$L = this.loca…
44519 n = i.prototype;
44526 }, n.utc = function () {
44531 }, n.local = function () {
44537 var u = n.parse;
44539 n.parse = function (t) {
44543 var o = n.init;
44545 n.init = function () {
44552 var f = n.utcOffset;
44554 n.utcOffset = function (t, i) {
44557 var n = Math.abs(t) <= 16 ? 60 * t : t,
44559 …return i ? (u.$offset = n, u.$u = 0 === t, u) : (0 !== t ? (u = this.local().add(n + s, "minute"))…
44562 var r = n.format;
44563 n.format = function (t) {
44566 }, n.valueOf = function () {
44569 }, n.isUTC = function () {
44571 }, n.toISOString = function () {
44573 }, n.toString = function () {
44576 var a = n.toDate;
44578 n.toDate = function (t) {
44582 var c = n.diff;
44584 n.diff = function (t, i, s) {
44585 var n = this.local(),
44587 return c.call(n, u, i, s);
45661 this.n = conf.n && new BN(conf.n, 16);
45668 this._bitLength = this.n ? this.n.bitLength() : 0; // Generalized Greg Maxwell's trick
45670 var adjustCount = this.n && this.p.div(this.n);
45676 this.redN = this.n.toRed(this.red);
46368 xc.iadd(this.curve.n);
46598 …if (!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1) return; // Compute beta and lambda,…
46617 var lambdas = this._getEndoRoots(this.n);
46663 var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2)); // 3.74
46667 var v = this.n.clone();
46744 var c1 = v2.b.mul(k).divRound(this.n);
46745 var c2 = v1.b.neg().mul(k).divRound(this.n);
47388 xc.iadd(this.curve.n);
47421 this.n = this.curve.n;
47424 assert(this.g.mul(this.n).isInfinity(), 'Invalid curve, G*N != O');
47451 n: 'ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831',
47462 n: 'ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d',
47473 n: 'ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551',
47484 …n: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 ' + 'f4372ddf 581a0db2 48b0a77a…
47495 …n: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' + 'ffffffff ffffffff fffffffa 51868783…
47506 n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',
47519 n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',
47539 n: 'ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141',
47590 this.n = this.curve.n;
47591 this.nh = this.n.ushrn(1);
47595 this.g.precompute(options.curve.n.bitLength() + 1); // Hash for function for DRBG
47623 nonce: this.n.toArray()
47625 var bytes = this.n.byteLength();
47626 var ns2 = this.n.sub(new BN(2));
47637 var delta = msg.byteLength() * 8 - this.n.bitLength();
47639 if (!truncOnly && msg.cmp(this.n) >= 0) return msg.sub(this.n);else return msg;
47652 var bytes = this.n.byteLength();
47665 var ns1 = this.n.sub(new BN(1));
47668 var k = options.k ? options.k(iter) : new BN(drbg.generate(this.n.byteLength()));
47674 var r = kpX.umod(this.n);
47676 var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));
47677 s = s.umod(this.n);
47682 s = this.n.sub(s);
47701 if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0) return false;
47702 if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0) return false; // Validate signature
47704 var sinv = s.invm(this.n);
47705 var u1 = sinv.mul(msg).umod(this.n);
47706 var u2 = sinv.mul(r).umod(this.n);
47711 return p.getX().umod(this.n).cmp(r) === 0;
47727 var n = this.n;
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);
47738 var s1 = n.sub(e).mul(rInv).umod(n);
47739 var s2 = s.mul(rInv).umod(n); // 1.6.1 Compute Q = r^-1 (sR - eG)
47810 if (!pub.mul(this.ec.curve.n).isInfinity()) return {
47840 this.priv = this.priv.umod(this.ec.curve.n);
48083 this.g.precompute(curve.n.bitLength() + 1);
48085 this.encodingLength = Math.ceil(curve.n.bitLength() / 8);
48103 var S = r.add(s_).umod(this.curve.n);
48135 return utils.intFromLE(hash.digest()).umod(this.curve.n);
48630 EventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {
48631 …if (typeof n !== 'number' || n < 0 || isNaN(n)) throw new TypeError('"n" argument must be a positi…
48632 this._maxListeners = n;
49021 for (var i = index, k = i + 1, n = list.length; k < n; i += 1, k += 1) {
49028 function arrayClone(arr, n) {
49029 var copy = new Array(n);
49031 for (var i = 0; i < n; ++i) {
50942 for (var n = 0; n < 256; n++) {
50943 c = n;
50949 table[n] = c;
52617 skip: function skip(n) {
52618 this.setIndex(this.index + n);
55913 function baseTimes(n, iteratee) {
55915 result = Array(n);
55917 while (++index < n) {
58480 function baseTimes(n, iteratee) {
58482 result = Array(n);
58484 while (++index < n) {
61550 function rotl(x, n) {
61551 return x << n | x >>> 32 - n;
61589 MillerRabin.prototype._randbelow = function _randbelow(n) {
61590 var len = n.bitLength();
61596 } while (a.cmp(n) >= 0);
61607 MillerRabin.prototype.test = function test(n, k, cb) {
61608 var len = n.bitLength();
61609 var red = bn.mont(n);
61613 var n1 = n.subn(1);
61617 var d = n.shrn(s);
61640 MillerRabin.prototype.getDivisor = function getDivisor(n, k) {
61641 var len = n.bitLength();
61642 var red = bn.mont(n);
61646 var n1 = n.subn(1);
61650 var d = n.shrn(s);
61656 var g = n.gcd(a);
61663 if (x.cmp(rone) === 0) return x.fromRed().subn(1).gcd(n);
61669 return x.fromRed().subn(1).gcd(n);
62958 n = 0;
62964 n = len > 2000 ? 2000 : len;
62965 len -= n;
62970 } while (--n);
63074 for (var n = 0; n < 256; n++) {
63075 c = n;
63081 table[n] = c;
63476 var p, n, m, more, str; //Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead");
63512 n = s.hash_size;
63513 p = n;
63518 } while (--n);
63520 n = _w_size;
63521 p = n;
63529 } while (--n);
63551 n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);
63552 s.lookahead += n;
65139 var str, n;
65206 n = s.lookahead - (MIN_MATCH - 1);
65214 } while (--n);
66379 var n; // temporary var for NEED_BITS
67138 n = here_bits + 2;
67140 while (bits < n) {
67169 n = here_bits + 3;
67171 while (bits < n) {
67194 n = here_bits + 7;
67196 while (bits < n) {
67418 n = state.extra;
67420 while (bits < n) {
67525 n = state.extra;
67527 while (bits < n) {
68663 var n, m;
68692 n = s.heap[h];
68693 bits = tree[tree[n * 2 + 1]
68704 tree[n * 2 + 1]
68709 if (n > max_code) {
68718 if (n >= base) {
68719 xbits = extra[n - base];
68722 f = tree[n * 2]
68728 s.static_len += f * (stree[n * 2 + 1]
68771 n = s.bl_count[bits];
68773 while (n !== 0) {
68794 n--;
68821 var n;
68839 for (n = 0; n <= max_code; n++) {
68840 var len = tree[n * 2 + 1]
68850 tree[n * 2]
68862 var n;
68899 for (n = 0; n < 1 << extra_lbits[code]; n++) {
68918 for (n = 0; n < 1 << extra_dbits[code]; n++) {
68930 for (n = 0; n < 1 << extra_dbits[code] - 7; n++) {
68942 n = 0;
68944 while (n <= 143) {
68945 static_ltree[n * 2 + 1]
68948 n++;
68952 while (n <= 255) {
68953 static_ltree[n * 2 + 1]
68956 n++;
68960 while (n <= 279) {
68961 static_ltree[n * 2 + 1]
68964 n++;
68968 while (n <= 287) {
68969 static_ltree[n * 2 + 1]
68972 n++;
68984 for (n = 0; n < D_CODES; n++) {
68985 static_dtree[n * 2 + 1]
68988 static_dtree[n * 2]
68990 = bi_reverse(n, 5);
69004 var n;
69009 for (n = 0; n < L_CODES; n++) {
69010 s.dyn_ltree[n * 2]
69015 for (n = 0; n < D_CODES; n++) {
69016 s.dyn_dtree[n * 2]
69021 for (n = 0; n < BL_CODES; n++) {
69022 s.bl_tree[n * 2]
69080 function smaller(tree, n, m, depth) {
69081 var _n2 = n * 2;
69093 && depth[n] <= depth[m];
69228 var n, m;
69245 for (n = 0; n < elems; n++) {
69246 if (tree[n * 2]
69249 s.heap[++s.heap_len] = max_code = n;
69250 s.depth[n] = 0;
69252 tree[n * 2 + 1]
69286 for (n = s.heap_len >> 1
69288 ; n >= 1; n--) {
69289 pqdownheap(s, tree, n);
69303 n = s.heap[1
69319 s.heap[--s.heap_max] = n;
69327 = tree[n * 2]
69332 s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;
69333 tree[n * 2 + 1]
69370 var n;
69403 for (n = 0; n <= max_code; n++) {
69405 nextlen = tree[(n + 1) * 2 + 1]
69452 var n;
69484 for (n = 0; n <= max_code; n++) {
69486 nextlen = tree[(n + 1) * 2 + 1]
69630 var n;
69633 for (n = 0; n <= 31; n++, black_mask >>>= 1) {
69634 if (black_mask & 1 && s.dyn_ltree[n * 2]
69653 for (n = 32; n < LITERALS; n++) {
69654 if (s.dyn_ltree[n * 2]
70050 …ED[\n\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\n\r]+([0-9A-z\n\r+/=]+)[\n\r]+/m;
71971 function computeNewHighWaterMark(n) {
71972 if (n >= MAX_HWM) {
71974 n = MAX_HWM;
71978 n--;
71979 n |= n >>> 1;
71980 n |= n >>> 2;
71981 n |= n >>> 4;
71982 n |= n >>> 8;
71983 n |= n >>> 16;
71984 n++;
71987 return n;
71992 function howMuchToRead(n, state) {
71993 if (n <= 0 || state.length === 0 && state.ended) return 0;
71996 if (n !== n) {
72002 if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);
72003 if (n <= state.length) return n; // Don't have enough
72014 Readable.prototype.read = function (n) {
72015 debug('read', n);
72016 n = parseInt(n, 10);
72018 var nOrig = n;
72019 …if (n !== 0) state.emittedReadable = false; // if we're doing read(0) to trigger a readable event,…
72023 …if (n === 0 && state.needReadable && ((state.highWaterMark !== 0 ? state.length >= state.highWater…
72029 n = howMuchToRead(n, state); // if we've ended, and we're now clear, then finish it up.
72031 if (n === 0 && state.ended) {
72061 if (state.length === 0 || state.length - n < state.highWaterMark) {
72083 if (!state.reading) n = howMuchToRead(nOrig, state);
72087 if (n > 0) ret = fromList(n, state);else ret = null;
72091 n = 0;
72093 state.length -= n;
72102 if (nOrig !== n && state.ended) endReadable(this);
72226 Readable.prototype._read = function (n) {
72610 for (var n = 0; n < kProxyEvents.length; n++) {
72611 stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n]));
72616 this._read = function (n) {
72617 debug('wrapped _read', n);
72685 function fromList(n, state) {
72689 if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) {
72695 ret = state.buffer.consume(n, state.decoder);
72921 Transform.prototype._read = function (n) {
74027 value: function concat(n) {
74029 var ret = Buffer.allocUnsafe(n >>> 0);
74044 value: function consume(n, hasStrings) {
74047 if (n < this.head.data.length) {
74049 ret = this.head.data.slice(0, n);
74050 this.head.data = this.head.data.slice(n);
74051 } else if (n === this.head.data.length) {
74056 ret = hasStrings ? this._getString(n) : this._getBuffer(n);
74069 value: function _getString(n) {
74073 n -= ret.length;
74077 var nb = n > str.length ? str.length : n;
74078 if (nb === str.length) ret += str;else ret += str.slice(0, n);
74079 n -= nb;
74081 if (n === 0) {
74102 value: function _getBuffer(n) {
74103 var ret = Buffer.allocUnsafe(n);
74107 n -= p.data.length;
74111 var nb = n > buf.length ? buf.length : n;
74112 buf.copy(ret, ret.length - n, 0, nb);
74113 n -= nb;
74115 if (n === 0) {
75366 function rotl(x, n) {
75367 return x << n | x >>> 32 - n;
75557 …n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] };…
75571 …n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.con…
77879 for (_iterator.s(); !(_step = _iterator.n()).done;) {
77931 for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
79510 function computeNewHighWaterMark(n) {
79511 if (n >= MAX_HWM) {
79512 n = MAX_HWM;
79516 n--;
79517 n |= n >>> 1;
79518 n |= n >>> 2;
79519 n |= n >>> 4;
79520 n |= n >>> 8;
79521 n |= n >>> 16;
79522 n++;
79525 return n;
79530 function howMuchToRead(n, state) {
79531 if (n <= 0 || state.length === 0 && state.ended) return 0;
79534 if (n !== n) {
79540 if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);
79541 if (n <= state.length) return n; // Don't have enough
79552 Readable.prototype.read = function (n) {
79553 debug('read', n);
79554 n = parseInt(n, 10);
79556 var nOrig = n;
79557 …if (n !== 0) state.emittedReadable = false; // if we're doing read(0) to trigger a readable event,…
79561 if (n === 0 && state.needReadable && (state.length >= state.highWaterMark || state.ended)) {
79567 n = howMuchToRead(n, state); // if we've ended, and we're now clear, then finish it up.
79569 if (n === 0 && state.ended) {
79599 if (state.length === 0 || state.length - n < state.highWaterMark) {
79621 if (!state.reading) n = howMuchToRead(nOrig, state);
79625 if (n > 0) ret = fromList(n, state);else ret = null;
79629 n = 0;
79631 state.length -= n;
79639 if (nOrig !== n && state.ended) endReadable(this);
79713 Readable.prototype._read = function (n) {
80045 for (var n = 0; n < kProxyEvents.length; n++) {
80046 stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n]));
80051 this._read = function (n) {
80052 debug('wrapped _read', n);
80078 function fromList(n, state) {
80082 if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) {
80088 ret = fromListPartial(n, state.buffer, state.decoder);
80096 function fromListPartial(n, list, hasStrings) {
80099 if (n < list.head.data.length) {
80101 ret = list.head.data.slice(0, n);
80102 list.head.data = list.head.data.slice(n);
80103 } else if (n === list.head.data.length) {
80108 ret = hasStrings ? copyFromBufferString(n, list) : copyFromBuffer(n, list);
80118 function copyFromBufferString(n, list) {
80122 n -= ret.length;
80126 var nb = n > str.length ? str.length : n;
80127 if (nb === str.length) ret += str;else ret += str.slice(0, n);
80128 n -= nb;
80130 if (n === 0) {
80152 function copyFromBuffer(n, list) {
80153 var ret = Buffer.allocUnsafe(n);
80157 n -= p.data.length;
80161 var nb = n > buf.length ? buf.length : n;
80162 buf.copy(ret, ret.length - n, 0, nb);
80163 n -= nb;
80165 if (n === 0) {
80386 Transform.prototype._read = function (n) {
81172 BufferList.prototype.concat = function concat(n) {
81175 var ret = Buffer.allocUnsafe(n >>> 0);
81618 var n = (buf.length - i) % 3;
81619 if (n === 0) return buf.toString('base64', i);
81620 this.lastNeed = 3 - n;
81623 if (n === 1) {
81630 return buf.toString('base64', i, buf.length - n);
82135 var n = value.name ? ': ' + value.name : '';
82136 base = ' [Function' + n + ']';
82390 function pad(n) {
82391 return n < 10 ? '0' + n.toString(10) : n.toString(10);
82871 function ROTL(x, n) {
82872 return x << n | x >>> 32 - n;
83101 for (var n = 0; n < 6; ++n) {
83102 b[i + n] = node[n];