Lines Matching refs:len
4289 …arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0…
5662 …arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0…
7915 …arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0…
9686 var len = Object.keys(position).length;
9687 this.model.editAs = POSITION_TYPE[len];
14084 …arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0…
14296 …arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0…
15146 …arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0…
29625 var len = Math.min(str.length, end);
29627 for (var i = start; i < len; i++) {
29680 var len = Math.min(str.length, end);
29682 for (var i = start; i < len; i++) {
30411 var len = self.length + num.length | 0;
30412 out.length = len;
30413 len = len - 1 | 0; // Peel one iteration (compiler can't do it, because of code complexity)
30422 for (var k = 1; k < len; k++) {
31101 var len = this.length + num.length;
31105 } else if (len < 63) {
31107 } else if (len < 1024) {
31234 FFTM.prototype.convert13b = function convert13b(ws, len, rws, N) {
31237 for (var i = 0; i < len; i++) {
31246 for (i = 2 * len; i < N; ++i) {
31636 var len = num.length + shift;
31639 this._expand(len);
32914 for (var i = 0, len = code.length; i < len; ++i) {
32925 var len = b64.length;
32927 if (len % 4 > 0) {
32934 if (validLen === -1) validLen = len;
32935 var placeHoldersLen = validLen === len ? 0 : 4 - validLen % 4;
32959 var len = placeHoldersLen > 0 ? validLen - 4 : validLen;
32962 for (i = 0; i < len; i += 4) {
33001 var len = uint8.length;
33002 var extraBytes = len % 3; // if we have 1 byte left, pad 2 bytes
33008 for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {
33014 tmp = uint8[len - 1];
33017 tmp = (uint8[len - 2] << 8) + uint8[len - 1];
33215 var len = Math.min(str.length, end);
33218 for (var i = start; i < len; i++) {
33277 var len = Math.min(str.length, end);
33279 for (var i = start; i < len; i++) {
34095 var len = self.length + num.length | 0;
34096 out.length = len;
34097 len = len - 1 | 0; // Peel one iteration (compiler can't do it, because of code complexity)
34106 for (var k = 1; k < len; k++) {
34787 var len = this.length + num.length;
34791 } else if (len < 63) {
34793 } else if (len < 1024) {
34920 FFTM.prototype.convert13b = function convert13b(ws, len, rws, N) {
34923 for (var i = 0; i < len; i++) {
34932 for (i = 2 * len; i < N; ++i) {
35324 var len = num.length + shift;
35327 this._expand(len);
36613 module.exports = function rand(len) {
36615 return r.generate(len);
36624 Rand.prototype.generate = function generate(len) {
36625 return this._rand(len);
36689 var len = buf.length / 4 | 0;
36690 var out = new Array(len);
36692 for (var i = 0; i < len; i++) {
36913 var len = Math.min(a.length, b.length);
36915 for (var i = 0; i < len; ++i) {
36929 var len = iv.length;
36930 var toPad = len % 16;
36939 var ivBits = len * 8;
37272 var len = 16 - this.cache.length;
37273 var padBuff = Buffer.allocUnsafe(len);
37276 while (++i < len) {
37277 padBuff.writeUInt8(len, i);
37408 var len = iv.length;
37411 while (len--) {
37412 item = iv.readUInt8(len);
37415 iv.writeUInt8(0, len);
37418 iv.writeUInt8(item, len);
37454 var len = data.length;
37456 self._cache = self._cache.slice(len);
37463 var len;
37472 len = self._cache.length;
37473 out = Buffer.concat([out, encryptStart(self, data.slice(0, len), decrypt)]);
37474 data = data.slice(len);
37492 var len = 8;
37496 while (++i < len) {
37508 var len = buffer.length;
37513 while (++i < len) {
37521 var len = chunk.length;
37522 var out = Buffer.allocUnsafe(len);
37525 while (++i < len) {
37546 var len = chunk.length;
37547 var out = Buffer.allocUnsafe(len);
37550 while (++i < len) {
38080 var len = priv.modulus.byteLength();
38095 return new Buffer(m2.imul(blinds.unblinder).umod(priv.modulus).toArray(false, len));
38101 var len = priv.modulus.byteLength();
38102 var r = new bn(randomBytes(len));
38105 r = new bn(randomBytes(len));
38423 var len = priv.modulus.byteLength();
38426 while (hash.length + pad.length + 1 < len) {
38587 var len = pub.modulus.byteLength();
38591 while (hash.length + pad.length + 2 < len) {
38609 len = Math.min(sig.length, pad.length);
38613 while (++i < len) {
39020 var len = checked(obj.length) | 0;
39021 var buf = createBuffer(len);
39027 obj.copy(buf, 0, 0, len);
39079 for (var i = 0, len = Math.min(x, y); i < len; ++i) {
39165 var len = string.length;
39167 if (!mustMatch && len === 0) return 0; // Use a for loop to avoid recursion
39176 return len;
39186 return len * 2;
39189 return len >>> 1;
39291 var len = this.length;
39293 if (len % 2 !== 0) {
39297 for (var i = 0; i < len; i += 2) {
39305 var len = this.length;
39307 if (len % 4 !== 0) {
39311 for (var i = 0; i < len; i += 4) {
39320 var len = this.length;
39322 if (len % 8 !== 0) {
39326 for (var i = 0; i < len; i += 8) {
39407 var len = Math.min(x, y);
39411 for (var i = 0; i < len; ++i) {
39787 var len = codePoints.length;
39789 if (len <= MAX_ARGUMENTS_LENGTH) {
39797 while (i < len) {
39827 var len = buf.length;
39829 if (!end || end < 0 || end > len) end = len;
39851 var len = this.length;
39853 end = end === undefined ? len : ~~end;
39856 start += len;
39858 } else if (start > len) {
39859 start = len;
39863 end += len;
39865 } else if (end > len) {
39866 end = len;
40305 var len = end - start;
40312 for (var i = len - 1; i >= 0; --i) {
40319 return len;
40378 var len = bytes.length;
40380 if (len === 0) {
40385 this[i + start] = bytes[i % len];
43710 function formatReturnValue(bn, enc, len) {
43717 if (len && buf.length < len) {
43718 var zeros = new Buffer(len - buf.length);
45135 var len = pc2table.length >>> 1;
45137 for (var i = 0; i < len; i++) {
45142 for (var i = len; i < pc2table.length; i++) {
45762 BaseCurve.prototype._wnafMulAdd = function _wnafMulAdd(defW, points, coeffs, len, jacobianResult) {
45769 for (var i = 0; i < len; i++) {
45779 for (var i = len - 1; i >= 1; i -= 2) {
45854 for (var j = 0; j < len; j++) {
45868 for (var j = 0; j < len; j++) {
45877 for (var i = 0; i < len; i++) {
45904 var len = this.p.byteLength(); // uncompressed, hybrid-odd, hybrid-even
45906 …if ((bytes[0] === 0x04 || bytes[0] === 0x06 || bytes[0] === 0x07) && bytes.length - 1 === 2 * len)…
45908 var res = this.point(bytes.slice(1, 1 + len), bytes.slice(1 + len, 1 + 2 * len));
45910 } else if ((bytes[0] === 0x02 || bytes[0] === 0x03) && bytes.length - 1 === len) {
45911 return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 0x03);
45922 var len = this.curve.p.byteLength();
45923 var x = this.getX().toArray('be', len);
45925 return [0x04].concat(x, this.getY().toArray('be', len));
47935 var len = buf.length - 1;
47937 while (!buf[i] && !(buf[i + 1] & 0x80) && i < len) {
47956 var len = getLength(data, p);
47958 if (len === false) {
47962 if (len + p.place !== data.length) {
48019 function constructLength(arr, len) {
48020 if (len < 0x80) {
48021 arr.push(len);
48025 var octets = 1 + (Math.log(len) / Math.LN2 >>> 3);
48029 arr.push(len >>> (octets << 3) & 0xff);
48032 arr.push(len);
48652 var len = handler.length;
48653 var listeners = arrayClone(handler, len);
48655 for (var i = 0; i < len; ++i) {
48663 var len = handler.length;
48664 var listeners = arrayClone(handler, len);
48666 for (var i = 0; i < len; ++i) {
48674 var len = handler.length;
48675 var listeners = arrayClone(handler, len);
48677 for (var i = 0; i < len; ++i) {
48685 var len = handler.length;
48686 var listeners = arrayClone(handler, len);
48688 for (var i = 0; i < len; ++i) {
48696 var len = handler.length;
48697 var listeners = arrayClone(handler, len);
48699 for (var i = 0; i < len; ++i) {
48706 var er, handler, len, args, i, events;
48729 len = arguments.length;
48731 switch (len) {
48751 args = new Array(len - 1);
48753 for (i = 1; i < len; i++) {
49405 var len = this.pendingTotal;
49407 var k = bytes - (len + this.padLength) % bytes;
49416 len <<= 3;
49427 res[i++] = len >>> 24 & 0xff;
49428 res[i++] = len >>> 16 & 0xff;
49429 res[i++] = len >>> 8 & 0xff;
49430 res[i++] = len & 0xff;
49432 res[i++] = len & 0xff;
49433 res[i++] = len >>> 8 & 0xff;
49434 res[i++] = len >>> 16 & 0xff;
49435 res[i++] = len >>> 24 & 0xff;
50212 var len = end - start;
50213 assert(len % 4 === 0);
50214 var res = new Array(len / 4);
50463 HmacDRBG.prototype.generate = function generate(len, enc, add, addEnc) {
50481 while (temp.length < len) {
50486 var res = temp.slice(0, len);
50638 var len = queue.length;
50640 while (len) {
50645 while (++i < len) {
50649 len = queue.length;
50745 len = input.length,
50746 remainingBytes = len;
50750 remainingBytes = len - i;
50754 chr2 = i < len ? input.charCodeAt(i++) : 0;
50755 chr3 = i < len ? input.charCodeAt(i++) : 0;
50758 chr2 = i < len ? input[i++] : 0;
50759 chr3 = i < len ? input[i++] : 0;
50958 function crc32(crc, buf, len, pos) {
50960 end = pos + len;
50982 function crc32str(crc, str, len, pos) {
50984 end = pos + len;
53789 var len = buf.length; // Reserve max possible length (2 words per char)
53793 var utf16buf = new Array(len * 2);
53795 for (out = 0, i = 0; i < len;) {
53814 while (c_len > 1 && i < len) {
54081 len = array.length; // shortcut
54083 if (len <= chunk) {
54087 while (k < len) {
54089 result.push(String.fromCharCode.apply(null, array.slice(k, Math.min(k + chunk, len))));
54091 result.push(String.fromCharCode.apply(null, array.subarray(k, Math.min(k + chunk, len))));
55362 var len = self.queue.length;
55364 while (++i < len) {
55376 var len = self.queue.length;
55378 while (++i < len) {
55469 var len = iterable.length;
55472 if (!len) {
55476 var values = new Array(len);
55481 while (++i < len) {
55498 if (++resolved === len && !called) {
55515 var len = iterable.length;
55518 if (!len) {
55525 while (++i < len) {
61590 var len = n.bitLength();
61591 var min_bytes = Math.ceil(len / 8); // Generage random bytes until a number less than n is found.
61608 var len = n.bitLength();
61611 if (!k) k = Math.max(1, len / 48 | 0); // Find d and s, (n - 1) = (2 ^ s) * d;
61641 var len = n.bitLength();
61644 if (!k) k = Math.max(1, len / 48 | 0); // Find d and s, (n - 1) = (2 ^ s) * d;
62645 arraySet: function arraySet(dest, src, src_offs, len, dest_offs) {
62647 dest.set(src.subarray(src_offs, src_offs + len), dest_offs);
62652 for (var i = 0; i < len; i++) {
62658 var i, l, len, pos, chunk, result; // calculate data length
62660 len = 0;
62663 len += chunks[i].length;
62667 result = new Uint8Array(len);
62680 arraySet: function arraySet(dest, src, src_offs, len, dest_offs) {
62681 for (var i = 0; i < len; i++) {
62810 function buf2binstring(buf, len) {
62814 if (len < 65534) {
62816 return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));
62822 for (var i = 0; i < len; i++) {
62838 for (var i = 0, len = buf.length; i < len; i++) {
62848 var len = max || buf.length; // Reserve max possible length (2 words per char)
62852 var utf16buf = new Array(len * 2);
62854 for (out = 0, i = 0; i < len;) {
62873 while (c_len > 1 && i < len) {
62955 function adler32(adler, buf, len, pos) {
62960 while (len !== 0) {
62964 n = len > 2000 ? 2000 : len;
62965 len -= n;
63090 function crc32(crc, buf, len, pos) {
63092 end = pos + len;
63245 var len = buf.length;
63247 while (--len >= 0) {
63248 buf[len] = 0;
63262 var len = s.pending;
63264 if (len > strm.avail_out) {
63265 len = strm.avail_out;
63268 if (len === 0) {
63272 utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);
63273 strm.next_out += len;
63274 s.pending_out += len;
63275 strm.total_out += len;
63276 strm.avail_out -= len;
63277 s.pending -= len;
63317 var len = strm.avail_in;
63319 if (len > size) {
63320 len = size;
63323 if (len === 0) {
63327 strm.avail_in -= len; // zmemcpy(buf, strm->next_in, len);
63329 utils.arraySet(buf, strm.input, strm.next_in, len, start);
63332 strm.adler = adler32(strm.adler, buf, len, start);
63334 strm.adler = crc32(strm.adler, buf, len, start);
63337 strm.next_in += len;
63338 strm.total_in += len;
63339 return len;
63362 var len;
63440 len = MAX_MATCH - (strend - scan);
63443 if (len > best_len) {
63445 best_len = len;
63447 if (len >= nice_match) {
65448 var len;
65518 len = here & 0xffff
65530 len += hold & (1 << op) - 1;
65631 if (op < len) {
65633 len -= op;
65649 if (op < len) {
65651 len -= op;
65659 if (wnext < len) {
65662 len -= op;
65678 if (op < len) {
65680 len -= op;
65693 while (len > 2) {
65697 len -= 3;
65700 if (len) {
65703 if (len > 1) {
65716 len -= 3;
65717 } while (len > 2);
65719 if (len) {
65722 if (len > 1) {
65764 len = bits >> 3;
65765 _in -= len;
65766 bits -= len << 3;
66369 var len;
66479 len = (hold & 0x0f) +
66484 state.wbits = len;
66485 } else if (len > state.wbits) {
66491 state.dmax = 1 << len; //Tracev((stderr, "inflate: zlib header ok\n"));
66666 len = state.head.extra_len - state.length;
66677 len); //zmemcpy(state.head.extra + len, next,
66711 len = input[next + copy++];
66714 if (state.head && len && state.length < 65536
66717 state.head.name += String.fromCharCode(len);
66719 } while (len && copy < have);
66728 if (len) {
66749 len = input[next + copy++];
66752 if (state.head && len && state.length < 65536
66755 state.head.comment += String.fromCharCode(len);
66757 } while (len && copy < have);
66766 if (len) {
67161 len = state.lens[state.have - 1];
67186 len = 0;
67211 len = 0;
67226 state.lens[state.have++] = len;
67931 var len = 0;
68019 for (len = 0; len <= MAXBITS; len++) {
68020 count[len] = 0;
68070 for (len = 1; len <= MAXBITS; len++) {
68072 left -= count[len];
68090 for (len = 1; len < MAXBITS; len++) {
68091 offs[len + 1] = offs[len] + count[len];
68159 len = min;
68190 here_bits = len - drop;
68207 incr = 1 << len - drop;
68219 incr = 1 << len - 1;
68236 if (--count[len] === 0) {
68237 if (len === max) {
68241 len = lens[lens_index + work[sym]];
68246 if (len > root && (huff & mask) !== low) {
68259 curr = len - drop;
68300 table[next + huff] = len - drop << 24 | 64 << 16 | 0;
68402 var len = buf.length;
68404 while (--len >= 0) {
68405 buf[len] = 0;
68611 function bi_reverse(code, len) {
68618 } while (--len > 0);
68840 var len = tree[n * 2 + 1]
68844 if (len === 0) {
68852 …= bi_reverse(next_code[len]++, len); //Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %…
69055 function copy_block(s, buf, len, header) //DeflateState *s;
69064 put_short(s, len);
69065 put_short(s, ~len);
69071 utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);
69072 s.pending += len;
70546 var len = arguments.length;
70549 switch (len) {
70570 args = new Array(len - 1);
70710 var len = queue.length;
70712 while (len) {
70716 while (++queueIndex < len) {
70723 len = queue.length;
70818 module.exports = function (seed, len) {
70823 while (t.length < len) {
70828 return t.slice(0, len);
70962 var len = a.length;
70966 len = Math.min(a.length, b.length);
70971 while (++i < len) {
71072 function nonZero(len) {
71073 var out = Buffer.allocUnsafe(len);
71075 var cache = randomBytes(len * 2);
71079 while (i < len) {
71081 cache = randomBytes(len * 2);
71112 var len = a.length;
71115 while (++i < len) {
71347 var len = expected.length;
71352 if (len > 2) {
71353 …"one of ".concat(thing, " ").concat(expected.slice(0, len - 1).join(', '), ", or ") + expected[len…
71354 } else if (len === 2) {
72212 var len = state.length;
72215 if (len === state.length) // didn't get any data, stop spinning.
72400 var len = state.pipesCount;
72405 for (var i = 0; i < len; i++) {
73328 var len = state.objectMode ? 1 : chunk.length;
73329 state.length += len;
73352 doWrite(stream, state, false, len, chunk, encoding, cb);
73358 function doWrite(stream, state, writev, len, chunk, encoding, cb) {
73359 state.writelen = len;
73479 var len = state.objectMode ? 1 : chunk.length;
73480 doWrite(stream, state, false, len, chunk, encoding, cb);
75577 …arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0…
79697 var len = state.length;
79702 if (len === state.length) // didn't get any data, stop spinning.
79703 break;else len = state.length;
79893 var len = state.pipesCount;
79898 for (var i = 0; i < len; i++) {
80794 var len = state.objectMode ? 1 : chunk.length;
80795 state.length += len;
80818 doWrite(stream, state, false, len, chunk, encoding, cb);
80824 function doWrite(stream, state, writev, len, chunk, encoding, cb) {
80825 state.writelen = len;
80946 var len = state.objectMode ? 1 : chunk.length;
80947 doWrite(stream, state, false, len, chunk, encoding, cb);
81885 var len = args.length;
81888 if (i >= len) return x;
81909 for (var x = args[i]; i < len; x = args[++i]) {
82599 function wordsToMd5(x, len) {
82601 x[len >> 5] |= 0x80 << len % 32;
82602 x[getOutputLength(len) - 1] = len;