Lines Matching refs:n
100 /******/ __w_pdfjs_require__.n = function(module) { function
2127 n = str.length,
2131 for (i = 2; i < n; i += 2) {
2135 for (i = 0; i < n; ++i) {
5694 var mapping, A, n, cb;
5702 n = 0;
5705 A.push(cb(nextItem, n++));
6340 var n = toInteger(count);
6341 if (n < 0 || n == Infinity) throw RangeError("Count can't be negative");
6343 for (; n > 0; (n >>>= 1) && (str += str)) {
6344 if (n & 1) res += str;
6518 __w_pdfjs_require__.n = function (module) {
6570 exports.ArrayBufferCopy = function (dest, destOffset, src, srcOffset, n) {
6571 new Uint8Array(dest).set(new Uint8Array(src, srcOffset, n), destOffset);
11678 for (var chunk = 0, n = this.numChunks; chunk < n; ++chunk) {
11882 value: function skip(n) {
11883 if (!n) {
11884 n = 1;
11887 this.pos += n;
14741 var n = entryRanges[1];
14743 if (!Number.isInteger(first) || !Number.isInteger(n)) {
14744 throw new _util.FormatError("Invalid XRef range fields: ".concat(first, ", ").concat(n));
14748 … throw new _util.FormatError("Invalid XRef entry fields length: ".concat(first, ", ").concat(n));
14751 for (i = streamState.entryNum; i < n; ++i) {
15211 var n = stream.dict.get('N');
15213 if (!Number.isInteger(first) || !Number.isInteger(n)) {
15227 for (i = 0; i < n; ++i) {
15242 for (i = 0; i < n; ++i) {
15966 var n = 10,
15983 var followingBytes = stream.peekBytes(n);
17201 skip: function Stream_skip(n) {
17202 if (!n) {
17203 n = 1;
17206 this.pos += n;
17359 skip: function DecodeStream_skip(n) {
17360 if (!n) {
17361 n = 1;
17364 this.pos += n;
17526 var n = lengths.length;
17530 for (i = 0; i < n; ++i) {
17540 for (var val = 0; val < n; ++val) {
17616 for (var n = bufferLength; n < end; ++n) {
17622 buffer[n] = b;
18014 n = chunk.length;
18015 var buffer = this.ensureBuffer(bufferLength + n);
18017 for (i = 0; i < n; i++) {
18204 var n = repeatHeader[0];
18206 if (n < 128) {
18207 buffer = this.ensureBuffer(bufferLength + n + 1);
18210 if (n > 0) {
18211 var source = this.str.getBytes(n);
18213 bufferLength += n;
18216 n = 257 - n;
18218 buffer = this.ensureBuffer(bufferLength + n + 1);
18220 for (var i = 0; i < n; i++) {
18262 LZWStream.prototype.readBits = function LZWStream_readBits(n) {
18266 while (bitsCached < n) {
18278 this.bitsCached = bitsCached -= n;
18281 return cachedData >>> bitsCached & (1 << n) - 1;
19119 _lookBits: function _lookBits(n) {
19122 while (this.inputBits < n) {
19128 return this.inputBuf << n - this.inputBits & 0xFFFF >> 16 - n;
19135 return this.inputBuf >> this.inputBits - n & 0xFFFF >> 16 - n;
19137 _eatBits: function _eatBits(n) {
19138 if ((this.inputBits -= n) < 0) {
22099 var n = 0;
22102 n = n << 1 | readBit();
22106 return n;
22114 var n = receive(length);
22116 if (n >= 1 << length - 1) {
22117 return n;
22120 return n + (-1 << length) + 1;
22293 var component, i, j, k, n;
22330 for (n = 0; n < mcuToRead; n++) {
22335 for (n = 0; n < mcuToRead; n++) {
24587 var k, n, nb;
24596 n = magnitude[position];
24598 if (n !== 0) {
24599 n = (n + magnitudeCorrection) * delta;
24602 n = -n;
24609 coefficients[pos] = n;
24611 coefficients[pos] = n * (1 << mb - nb);
25395 var j, n, current, next;
25404 for (n = len + 4; n--; j += 2) {
25411 for (n = len + 3; n--; j += 2) {
25415 if (n--) {
25427 for (n = len + 2; n--; j += 2) {
25431 if (n--) {
25443 for (n = len + 1; n--; j += 2) {
25447 if (n--) {
25460 for (n = len; n--; j += 2) {
25464 if (n--) {
25488 var j, n;
25490 for (j = offset, n = len + 1; n--; j += 2) {
25494 for (j = offset + 1, n = len; n--; j += 2) {
25570 n = data.length,
25576 var output = new Uint8Array(n);
25578 for (i = 0; i < n; ++i) {
25610 var i, j, n;
25617 n = paddedLength - 8;
25619 while (i < n) {
25769 function rotr(x, n) {
25770 return x >>> n | x << 32 - n;
25810 var i, j, n;
25817 n = paddedLength - 8;
25819 while (i < n) {
25978 var i, j, n;
25985 n = paddedLength - 16;
25987 while (i < n) {
26515 for (var n = 0; n < 4; ++n) {
26585 for (var n = 0; n < 4; ++n) {
26824 n;
26827 n = Math.min(32, password.length);
26829 for (; i < n; ++i) {
26840 for (j = 0, n = ownerPassword.length; j < n; ++j) {
26849 for (j = 0, n = fileId.length; j < n; ++j) {
26877 for (j = 0, n = fileId.length; j < n; ++j) {
26883 n = encryptionKey.length;
26884 var derivedKey = new Uint8Array(n),
26888 for (k = 0; k < n; ++k) {
26896 for (j = 0, n = checkData.length; j < n; ++j) {
26905 for (j = 0, n = checkData.length; j < n; ++j) {
26919 n;
26920 n = Math.min(32, password.length);
26922 for (; i < n; ++i) {
27073 n;
27075 for (i = 0, n = encryptionKey.length; i < n; ++i) {
33086 for (var i = 0, n = charProcKeys.length; i < n; ++i) {
33800 value: function addCodespaceRange(n, low, high) {
33801 this.codespaceRanges[n - 1].push(low, high);
33893 for (var n = 0, nn = codespaceRanges.length; n < nn; n++) {
33894 c = (c << 8 | str.charCodeAt(offset + n)) >>> 0;
33895 var codespaceRange = codespaceRanges[n];
33903 out.length = n + 1;
33948 function IdentityCMap(vertical, n) {
33956 _this.addCodespaceRange(n, 0, 0xffff);
34033 var n = 0;
34036 n = n << 8 | a[i];
34039 return n >>> 0;
34093 var n = 0;
34104 n = n << 7 | b & 0x7F;
34107 return n;
34110 var n = this.readNumber();
34111 return n & 1 ? ~(n >>> 1) : n >>> 1;
35408 for (var n = 0; n < length;) {
35409 var start = codes[n].fontCharCode;
35410 var codeIndices = [codes[n].glyphId];
35411 ++n;
35414 while (n < length && end + 1 === codes[n].fontCharCode) {
35415 codeIndices.push(codes[n].glyphId);
35417 ++n;
36539 n,
36557 n = data[i++];
36560 i += n;
36562 for (j = 0; j < n; j++) {
36567 n = data[i++];
36570 i += n * 2;
36572 for (j = 0; j < n; j++) {
36578 n = op - 0xB0 + 1;
36581 i += n;
36583 for (j = 0; j < n; j++) {
36588 n = op - 0xB8 + 1;
36591 i += n * 2;
36593 for (j = 0; j < n; j++) {
36700 n = stack.pop();
36702 if (!isNaN(n)) {
36703 stackDelta = -n * 2;
47405 var xa, xb, ya, yb, y1, y2, y3, n, subrCode;
47477 n = stack.pop();
47493 n += numSubrs < 1240 ? 107 : numSubrs < 33900 ? 1131 : 32768;
47494 subrCode = subrs[n];
47500 subrCode = font.subrs[n + font.subrsBias];
47723 n = stack.pop() + font.gsubrsBias;
47724 subrCode = font.gsubrs[n];
48942 readBits: function MeshStreamReader_readBits(n) {
48946 if (n === 32) {
48957 if (n === 8 && bufferLength === 0) {
48961 while (bufferLength < n) {
48966 bufferLength -= n;
53193 var n = IR[7];
53204 var k = n,
53234 for (j = 0; j < n; ++j) {
53253 var n = dict.get('N');
53261 return [CONSTRUCT_INTERPOLATED, c0, diff, n];
53269 var n = IR[3];
53272 var x = n === 1 ? src[srcOffset] : Math.pow(src[srcOffset], n);
53490 copy: function PostScriptStack_copy(n) {
53491 if (this.stack.length + n >= MAX_STACK_SIZE) {
53497 for (var i = stack.length - n, j = n - 1; j >= 0; j--, i++) {
53501 index: function PostScriptStack_index(n) {
53502 this.push(this.stack[this.stack.length - n - 1]);
53504 roll: function PostScriptStack_roll(n, p) {
53506 var l = stack.length - n;
53508 c = l + (p - Math.floor(p / n) * n),
54029 var n, j;
54111 n = num1.number;
54113 if (n < 0 || !Number.isInteger(n) || stack.length < n) {
54117 ast1 = stack[stack.length - n - 1];
54125 stack[stack.length - n - 1] = tmpVar;
54168 n = num1.number;
54170 if (n <= 0 || !Number.isInteger(n) || !Number.isInteger(j) || stack.length < n) {
54174 j = (j % n + n) % n;
54180 Array.prototype.push.apply(stack, stack.splice(stack.length - n, n - j));