diff --git a/amcharts/plugins/export/libs/pdfmake/pdfmake.js b/amcharts/plugins/export/libs/pdfmake/pdfmake.js index ba1b927..9e132e3 100644 --- a/amcharts/plugins/export/libs/pdfmake/pdfmake.js +++ b/amcharts/plugins/export/libs/pdfmake/pdfmake.js @@ -21966,7 +21966,7 @@ return /******/ (function(modules) { // webpackBootstrap UnicodeTrie = __webpack_require__(17); - + base64 = __webpack_require__(19); @@ -22237,10 +22237,10 @@ return /******/ (function(modules) { // webpackBootstrap this.sourceIndex = 0; this.tag = 0; this.bitcount = 0; - + this.dest = dest; this.destLen = 0; - + this.ltree = new Tree(); /* dynamic length/symbol tree */ this.dtree = new Tree(); /* dynamic distance tree */ } @@ -22382,7 +22382,7 @@ return /******/ (function(modules) { // webpackBootstrap d.tag |= d.source[d.sourceIndex++] << d.bitcount; d.bitcount += 8; } - + var sum = 0, cur = 0, len = 0; var tag = d.tag; @@ -22395,7 +22395,7 @@ return /******/ (function(modules) { // webpackBootstrap sum += t.table[len]; cur -= t.table[len]; } while (cur >= 0); - + d.tag = tag; d.bitcount -= len; @@ -22506,7 +22506,7 @@ return /******/ (function(modules) { // webpackBootstrap function tinf_inflate_uncompressed_block(d) { var length, invlength; var i; - + /* unread from bitbuffer */ while (d.bitcount > 8) { d.sourceIndex--; @@ -22579,7 +22579,7 @@ return /******/ (function(modules) { // webpackBootstrap else return d.dest.subarray(0, d.destLen); } - + return d.dest; } @@ -29079,7 +29079,7 @@ return /******/ (function(modules) { // webpackBootstrap /* WEBPACK VAR INJECTION */(function(Buffer) {// Generated by CoffeeScript 1.12.1 /* - PDFReference - represents a reference to another object in the PDF object heirarchy + PDFReference - represents a reference to another object in the PDF object hierarchy By Devon Govett */ @@ -29835,7 +29835,7 @@ return /******/ (function(modules) { // webpackBootstrap function Zlib(mode) { if (mode < exports.DEFLATE || mode > exports.UNZIP) throw new TypeError("Bad argument"); - + this.mode = mode; this.init_done = false; this.write_in_progress = false; @@ -29853,18 +29853,18 @@ return /******/ (function(modules) { // webpackBootstrap this.memLevel = memLevel; this.strategy = strategy; // dictionary not supported. - + if (this.mode === exports.GZIP || this.mode === exports.GUNZIP) this.windowBits += 16; - + if (this.mode === exports.UNZIP) this.windowBits += 32; - + if (this.mode === exports.DEFLATERAW || this.mode === exports.INFLATERAW) this.windowBits = -this.windowBits; - + this.strm = new zstream(); - + switch (this.mode) { case exports.DEFLATE: case exports.GZIP: @@ -29890,12 +29890,12 @@ return /******/ (function(modules) { // webpackBootstrap default: throw new Error("Unknown mode " + this.mode); } - + if (status !== exports.Z_OK) { this._error(status); return; } - + this.write_in_progress = false; this.init_done = true; }; @@ -29907,31 +29907,31 @@ return /******/ (function(modules) { // webpackBootstrap Zlib.prototype._writeCheck = function() { if (!this.init_done) throw new Error("write before init"); - + if (this.mode === exports.NONE) throw new Error("already finalized"); - + if (this.write_in_progress) throw new Error("write already in progress"); - + if (this.pending_close) throw new Error("close is pending"); }; - Zlib.prototype.write = function(flush, input, in_off, in_len, out, out_off, out_len) { + Zlib.prototype.write = function(flush, input, in_off, in_len, out, out_off, out_len) { this._writeCheck(); this.write_in_progress = true; - + var self = this; process.nextTick(function() { self.write_in_progress = false; var res = self._write(flush, input, in_off, in_len, out, out_off, out_len); self.callback(res[0], res[1]); - + if (self.pending_close) self.close(); }); - + return this; }; @@ -29949,7 +29949,7 @@ return /******/ (function(modules) { // webpackBootstrap Zlib.prototype._write = function(flush, input, in_off, in_len, out, out_off, out_len) { this.write_in_progress = true; - + if (flush !== exports.Z_NO_FLUSH && flush !== exports.Z_PARTIAL_FLUSH && flush !== exports.Z_SYNC_FLUSH && @@ -29958,18 +29958,18 @@ return /******/ (function(modules) { // webpackBootstrap flush !== exports.Z_BLOCK) { throw new Error("Invalid flush value"); } - + if (input == null) { input = new Buffer(0); in_len = 0; in_off = 0; } - + if (out._set) out.set = out._set; else out.set = bufferSet; - + var strm = this.strm; strm.avail_in = in_len; strm.input = input; @@ -29977,7 +29977,7 @@ return /******/ (function(modules) { // webpackBootstrap strm.avail_out = out_len; strm.output = out; strm.next_out = out_off; - + switch (this.mode) { case exports.DEFLATE: case exports.GZIP: @@ -29993,11 +29993,11 @@ return /******/ (function(modules) { // webpackBootstrap default: throw new Error("Unknown mode " + this.mode); } - + if (status !== exports.Z_STREAM_END && status !== exports.Z_OK) { this._error(status); } - + this.write_in_progress = false; return [strm.avail_in, strm.avail_out]; }; @@ -30007,15 +30007,15 @@ return /******/ (function(modules) { // webpackBootstrap this.pending_close = true; return; } - + this.pending_close = false; - + if (this.mode === exports.DEFLATE || this.mode === exports.GZIP || this.mode === exports.DEFLATERAW) { zlib_deflate.deflateEnd(this.strm); } else { zlib_inflate.inflateEnd(this.strm); } - + this.mode = exports.NONE; }; @@ -30030,7 +30030,7 @@ return /******/ (function(modules) { // webpackBootstrap var status = zlib_inflate.inflateReset(this.strm); break; } - + if (status !== exports.Z_OK) { this._error(status); } @@ -30038,7 +30038,7 @@ return /******/ (function(modules) { // webpackBootstrap Zlib.prototype._error = function(status) { this.onerror(msg[status] + ': ' + this.strm.msg, status); - + this.write_in_progress = false; if (this.pending_close) this.close(); @@ -38151,7 +38151,7 @@ return /******/ (function(modules) { // webpackBootstrap this._fontSize = 12; this._font = null; this._registeredFonts = {}; - + }, font: function(src, family, size) { var cacheKey, font, id, ref; @@ -38729,7 +38729,7 @@ return /******/ (function(modules) { // webpackBootstrap }, // ISO (deprecated) - [], { // windows + [], { // windows 0x0436: 'af', 0x4009: 'en-IN', 0x0487: 'rw', 0x0432: 'tn', 0x041C: 'sq', 0x1809: 'en-IE', 0x0441: 'sw', 0x045B: 'si', 0x0484: 'gsw', 0x2009: 'en-JM', 0x0457: 'kok', 0x041B: 'sk', @@ -53146,7 +53146,7 @@ return /******/ (function(modules) { // webpackBootstrap fontkit.registerFormat(DFont); module.exports = fontkit; - + /* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(2).Buffer, __webpack_require__(36))) /***/ }), @@ -53494,7 +53494,7 @@ return /******/ (function(modules) { // webpackBootstrap var res = encoder.write(str); var trail = encoder.end(); - + return (trail && trail.length > 0) ? Buffer.concat([res, trail]) : res; } @@ -53534,7 +53534,7 @@ return /******/ (function(modules) { // webpackBootstrap iconv.getCodec = function getCodec(encoding) { if (!iconv.encodings) iconv.encodings = __webpack_require__(89); // Lazy load all encoding definitions. - + // Canonicalize encoding name: strip all non-alphanumeric chars and appended year. var enc = (''+encoding).toLowerCase().replace(/[^0-9a-z]|:\d{4}$/g, ""); @@ -53558,7 +53558,7 @@ return /******/ (function(modules) { // webpackBootstrap if (!codecOptions.encodingName) codecOptions.encodingName = enc; - + enc = codecDef.type; break; @@ -53697,7 +53697,7 @@ return /******/ (function(modules) { // webpackBootstrap __webpack_require__(97), ]; - // Put all encoding/alias/codec definitions to single object and export it. + // Put all encoding/alias/codec definitions to single object and export it. for (var i = 0; i < modules.length; i++) { var module = modules[i]; for (var enc in module) @@ -53850,7 +53850,7 @@ return /******/ (function(modules) { // webpackBootstrap } InternalDecoderCesu8.prototype.write = function(buf) { - var acc = this.acc, contBytes = this.contBytes, accBytes = this.accBytes, + var acc = this.acc, contBytes = this.contBytes, accBytes = this.accBytes, res = ''; for (var i = 0; i < buf.length; i++) { var curByte = buf[i]; @@ -54023,7 +54023,7 @@ return /******/ (function(modules) { // webpackBootstrap // Codec is not chosen yet. Accumulate initial bytes. this.initialBytes.push(buf); this.initialBytesLen += buf.length; - + if (this.initialBytesLen < 16) // We need more bytes to use space heuristic (see below) return ''; @@ -54118,8 +54118,8 @@ return /******/ (function(modules) { // webpackBootstrap // Naive implementation. // Non-direct chars are encoded as "+-"; single "+" char is encoded as "+-". return new Buffer(str.replace(nonDirectChars, function(chunk) { - return "+" + (chunk === '+' ? '' : - this.iconv.encode(chunk, 'utf16-be').toString('base64').replace(/=+$/, '')) + return "+" + (chunk === '+' ? '' : + this.iconv.encode(chunk, 'utf16-be').toString('base64').replace(/=+$/, '')) + "-"; }.bind(this))); } @@ -54141,7 +54141,7 @@ return /******/ (function(modules) { // webpackBootstrap for (var i = 0; i < 256; i++) base64Chars[i] = base64Regex.test(String.fromCharCode(i)); - var plusChar = '+'.charCodeAt(0), + var plusChar = '+'.charCodeAt(0), minusChar = '-'.charCodeAt(0), andChar = '&'.charCodeAt(0); @@ -54389,17 +54389,17 @@ return /******/ (function(modules) { // webpackBootstrap var Buffer = __webpack_require__(2).Buffer; // Single-byte codec. Needs a 'chars' string parameter that contains 256 or 128 chars that - // correspond to encoded bytes (if 128 - then lower half is ASCII). + // correspond to encoded bytes (if 128 - then lower half is ASCII). exports._sbcs = SBCSCodec; function SBCSCodec(codecOptions, iconv) { if (!codecOptions) throw new Error("SBCS codec is called without the data.") - + // Prepare char buffer for decoding. if (!codecOptions.chars || (codecOptions.chars.length !== 128 && codecOptions.chars.length !== 256)) throw new Error("Encoding '"+codecOptions.type+"' has incorrect 'chars' (must be of len 128 or 256)"); - + if (codecOptions.chars.length === 128) { var asciiString = ""; for (var i = 0; i < 128; i++) @@ -54408,7 +54408,7 @@ return /******/ (function(modules) { // webpackBootstrap } this.decodeBuf = new Buffer(codecOptions.chars, 'ucs2'); - + // Encoding buffer. var encodeBuf = new Buffer(65536); encodeBuf.fill(iconv.defaultCharSingleByte.charCodeAt(0)); @@ -54431,7 +54431,7 @@ return /******/ (function(modules) { // webpackBootstrap var buf = new Buffer(str.length); for (var i = 0; i < str.length; i++) buf[i] = this.encodeBuf[str.charCodeAt(i)]; - + return buf; } @@ -55135,7 +55135,7 @@ return /******/ (function(modules) { // webpackBootstrap this.decodeTables = []; this.decodeTables[0] = UNASSIGNED_NODE.slice(0); // Create root node. - // Sometimes a MBCS char corresponds to a sequence of unicode chars. We store them as arrays of integers here. + // Sometimes a MBCS char corresponds to a sequence of unicode chars. We store them as arrays of integers here. this.decodeTableSeq = []; // Actual mapping tables consist of chunks. Use them to fill up decode tables. @@ -55144,7 +55144,7 @@ return /******/ (function(modules) { // webpackBootstrap this.defaultCharUnicode = iconv.defaultCharUnicode; - + // Encode tables: Unicode -> DBCS. // `encodeTable` is array mapping from unicode char to encoded char. All its values are integers for performance. @@ -55153,7 +55153,7 @@ return /******/ (function(modules) { // webpackBootstrap // == UNASSIGNED -> no conversion found. Output a default char. // <= SEQ_START -> it's an index in encodeTableSeq, see below. The character starts a sequence. this.encodeTable = []; - + // `encodeTableSeq` is used when a sequence of unicode characters is encoded as a single code. We use a tree of // objects where keys correspond to characters in sequence and leafs are the encoded dbcs values. A special DEF_CHAR key // means end of sequence (needed when one sequence is a strict subsequence of another). @@ -55171,7 +55171,7 @@ return /******/ (function(modules) { // webpackBootstrap for (var j = val.from; j <= val.to; j++) skipEncodeChars[j] = true; } - + // Use decode trie to recursively fill out encode tables. this._fillEncodeTable(0, 0, skipEncodeChars); @@ -55208,7 +55208,7 @@ return /******/ (function(modules) { // webpackBootstrap thirdByteNode[i] = NODE_START - fourthByteNodeIdx; for (var i = 0x30; i <= 0x39; i++) fourthByteNode[i] = GB18030_CODE - } + } } DBCSCodec.prototype.encoder = DBCSEncoder; @@ -55273,7 +55273,7 @@ return /******/ (function(modules) { // webpackBootstrap else writeTable[curAddr++] = code; // Basic char } - } + } else if (typeof part === "number") { // Integer, meaning increasing sequence starting with prev character. var charCode = writeTable[curAddr - 1] + 1; for (var l = 0; l < part; l++) @@ -55304,7 +55304,7 @@ return /******/ (function(modules) { // webpackBootstrap } DBCSCodec.prototype._setEncodeSequence = function(seq, dbcsCode) { - + // Get the root of character tree according to first character of the sequence. var uCode = seq[0]; var bucket = this._getEncodeBucket(uCode); @@ -55365,7 +55365,7 @@ return /******/ (function(modules) { // webpackBootstrap // Encoder state this.leadSurrogate = -1; this.seqObj = undefined; - + // Static data this.encodeTable = codec.encodeTable; this.encodeTableSeq = codec.encodeTableSeq; @@ -55374,7 +55374,7 @@ return /******/ (function(modules) { // webpackBootstrap } DBCSEncoder.prototype.write = function(str) { - var newBuf = new Buffer(str.length * (this.gb18030 ? 4 : 3)), + var newBuf = new Buffer(str.length * (this.gb18030 ? 4 : 3)), leadSurrogate = this.leadSurrogate, seqObj = this.seqObj, nextChar = -1, i = 0, j = 0; @@ -55387,7 +55387,7 @@ return /******/ (function(modules) { // webpackBootstrap } else { var uCode = nextChar; - nextChar = -1; + nextChar = -1; } // 1. Handle surrogates. @@ -55409,7 +55409,7 @@ return /******/ (function(modules) { // webpackBootstrap // Incomplete surrogate pair - only trail surrogate found. uCode = UNASSIGNED; } - + } } else if (leadSurrogate !== -1) { @@ -55450,7 +55450,7 @@ return /******/ (function(modules) { // webpackBootstrap var subtable = this.encodeTable[uCode >> 8]; if (subtable !== undefined) dbcsCode = subtable[uCode & 0xFF]; - + if (dbcsCode <= SEQ_START) { // Sequence start seqObj = this.encodeTableSeq[SEQ_START-dbcsCode]; continue; @@ -55473,7 +55473,7 @@ return /******/ (function(modules) { // webpackBootstrap // 3. Write dbcsCode character. if (dbcsCode === UNASSIGNED) dbcsCode = this.defaultCharSingleByte; - + if (dbcsCode < 0x100) { newBuf[j++] = dbcsCode; } @@ -55520,7 +55520,7 @@ return /******/ (function(modules) { // webpackBootstrap newBuf[j++] = this.defaultCharSingleByte; this.leadSurrogate = -1; } - + return newBuf.slice(0, j); } @@ -55544,21 +55544,21 @@ return /******/ (function(modules) { // webpackBootstrap DBCSDecoder.prototype.write = function(buf) { var newBuf = new Buffer(buf.length*2), - nodeIdx = this.nodeIdx, + nodeIdx = this.nodeIdx, prevBuf = this.prevBuf, prevBufOffset = this.prevBuf.length, seqStart = -this.prevBuf.length, // idx of the start of current parsed sequence. uCode; if (prevBufOffset > 0) // Make prev buf overlap a little to make it easier to slice later. prevBuf = Buffer.concat([prevBuf, buf.slice(0, 10)]); - + for (var i = 0, j = 0; i < buf.length; i++) { var curByte = (i >= 0) ? buf[i] : prevBuf[i + prevBufOffset]; // Lookup in current trie node. var uCode = this.decodeTables[nodeIdx][curByte]; - if (uCode >= 0) { + if (uCode >= 0) { // Normal character, just use it. } else if (uCode === UNASSIGNED) { // Unknown char. @@ -55590,7 +55590,7 @@ return /******/ (function(modules) { // webpackBootstrap throw new Error("iconv-lite internal error: invalid decoding table value " + uCode + " at " + nodeIdx + "/" + curByte); // Write the character to buffer, handling higher planes using surrogate pair. - if (uCode > 0xFFFF) { + if (uCode > 0xFFFF) { uCode -= 0x10000; var uCodeLead = 0xD800 + Math.floor(uCode / 0x400); newBuf[j++] = uCodeLead & 0xFF; @@ -55659,11 +55659,11 @@ return /******/ (function(modules) { // webpackBootstrap // require()-s are direct to support Browserify. module.exports = { - + // == Japanese/ShiftJIS ==================================================== // All japanese encodings are based on JIS X set of standards: // JIS X 0201 - Single-byte encoding of ASCII + ¥ + Kana chars at 0xA1-0xDF. - // JIS X 0208 - Main set of 6879 characters, placed in 94x94 plane, to be encoded by 2 bytes. + // JIS X 0208 - Main set of 6879 characters, placed in 94x94 plane, to be encoded by 2 bytes. // Has several variations in 1978, 1983, 1990 and 1997. // JIS X 0212 - Supplementary plane of 6067 chars in 94x94 plane. 1990. Effectively dead. // JIS X 0213 - Extension and modern replacement of 0208 and 0212. Total chars: 11233. @@ -55681,7 +55681,7 @@ return /******/ (function(modules) { // webpackBootstrap // 0x8F, (0xA1-0xFE)x2 - 0212 plane (94x94). // * JIS X 208: 7-bit, direct encoding of 0208. Byte ranges: 0x21-0x7E (94 values). Uncommon. // Used as-is in ISO2022 family. - // * ISO2022-JP: Stateful encoding, with escape sequences to switch between ASCII, + // * ISO2022-JP: Stateful encoding, with escape sequences to switch between ASCII, // 0201-1976 Roman, 0208-1978, 0208-1983. // * ISO2022-JP-1: Adds esc seq for 0212-1990. // * ISO2022-JP-2: Adds esc seq for GB2313-1980, KSX1001-1992, ISO8859-1, ISO8859-7. @@ -55793,7 +55793,7 @@ return /******/ (function(modules) { // webpackBootstrap // * Windows CP 951: Microsoft variant of Big5-HKSCS-2001. Seems to be never public. http://me.abelcheung.org/articles/research/what-is-cp951/ // * Big5-2003 (Taiwan standard) almost superset of cp950. // * Unicode-at-on (UAO) / Mozilla 1.8. Falling out of use on the Web. Not supported by other browsers. - // * Big5-HKSCS (-2001, -2004, -2008). Hong Kong standard. + // * Big5-HKSCS (-2001, -2004, -2008). Hong Kong standard. // many unicode code points moved from PUA to Supplementary plane (U+2XXXX) over the years. // Plus, it has 4 combining sequences. // Seems that Mozilla refused to support it for 10 yrs. https://bugzilla.mozilla.org/show_bug.cgi?id=162431 https://bugzilla.mozilla.org/show_bug.cgi?id=310299 @@ -55804,7 +55804,7 @@ return /******/ (function(modules) { // webpackBootstrap // In the encoder, it might make sense to support encoding old PUA mappings to Big5 bytes seq-s. // Official spec: http://www.ogcio.gov.hk/en/business/tech_promotion/ccli/terms/doc/2003cmp_2008.txt // http://www.ogcio.gov.hk/tc/business/tech_promotion/ccli/terms/doc/hkscs-2008-big5-iso.txt - // + // // Current understanding of how to deal with Big5(-HKSCS) is in the Encoding Standard, http://encoding.spec.whatwg.org/#big5-encoder // Unicode mapping (http://www.unicode.org/Public/MAPPINGS/OBSOLETE/EASTASIA/OTHER/BIG5.TXT) is said to be wrong. @@ -64154,7 +64154,7 @@ return /******/ (function(modules) { // webpackBootstrap // == Exports ================================================================== module.exports = function(iconv) { - + // Additional Public API. iconv.encodeStream = function encodeStream(encoding, options) { return new IconvLiteEncoderStream(iconv.getEncoder(encoding, options), options); @@ -64249,7 +64249,7 @@ return /******/ (function(modules) { // webpackBootstrap IconvLiteDecoderStream.prototype._flush = function(done) { try { var res = this.conv.end(); - if (res && res.length) this.push(res, this.encoding); + if (res && res.length) this.push(res, this.encoding); done(); } catch (e) { @@ -64296,7 +64296,7 @@ return /******/ (function(modules) { // webpackBootstrap } var nodeNativeEncodings = { - 'hex': true, 'utf8': true, 'utf-8': true, 'ascii': true, 'binary': true, + 'hex': true, 'utf8': true, 'utf-8': true, 'ascii': true, 'binary': true, 'base64': true, 'ucs2': true, 'ucs-2': true, 'utf16le': true, 'utf-16le': true, }; @@ -65963,7 +65963,7 @@ return /******/ (function(modules) { // webpackBootstrap $export.B = 16; // bind $export.W = 32; // wrap $export.U = 64; // safe - $export.R = 128; // real proto method for `library` + $export.R = 128; // real proto method for `library` module.exports = $export; /***/ }), @@ -67125,7 +67125,7 @@ return /******/ (function(modules) { // webpackBootstrap /* 202 */ /***/ (function(module, exports) { - + /***/ }), /* 203 */ @@ -68797,7 +68797,7 @@ return /******/ (function(modules) { // webpackBootstrap }(); module.exports = StateMachine; - + /***/ }), /* 261 */ @@ -69963,17 +69963,17 @@ return /******/ (function(modules) { // webpackBootstrap if (br.readBits(1) === 0) { return 16; } - + n = br.readBits(3); if (n > 0) { return 17 + n; } - + n = br.readBits(3); if (n > 0) { return 8 + n; } - + return 17; } @@ -69998,32 +69998,32 @@ return /******/ (function(modules) { // webpackBootstrap } function DecodeMetaBlockLength(br) { - var out = new MetaBlockLength; + var out = new MetaBlockLength; var size_nibbles; var size_bytes; var i; - + out.input_end = br.readBits(1); if (out.input_end && br.readBits(1)) { return out; } - + size_nibbles = br.readBits(2) + 4; if (size_nibbles === 7) { out.is_metadata = true; - + if (br.readBits(1) !== 0) throw new Error('Invalid reserved bit'); - + size_bytes = br.readBits(2); if (size_bytes === 0) return out; - + for (i = 0; i < size_bytes; i++) { var next_byte = br.readBits(8); if (i + 1 === size_bytes && size_bytes > 1 && next_byte === 0) throw new Error('Invalid size byte'); - + out.meta_block_length |= next_byte << (i * 8); } } else { @@ -70031,24 +70031,24 @@ return /******/ (function(modules) { // webpackBootstrap var next_nibble = br.readBits(4); if (i + 1 === size_nibbles && size_nibbles > 4 && next_nibble === 0) throw new Error('Invalid size nibble'); - + out.meta_block_length |= next_nibble << (i * 4); } } - + ++out.meta_block_length; - + if (!out.input_end && !out.is_metadata) { out.is_uncompressed = br.readBits(1); } - + return out; } /* Decodes the next Huffman code from bit-stream. */ function ReadSymbol(table, index, br) { var start_index = index; - + var nbits; br.fillBitWindow(); index += (br.val_ >>> br.bit_pos_) & HUFFMAN_TABLE_MASK; @@ -70068,17 +70068,17 @@ return /******/ (function(modules) { // webpackBootstrap var repeat = 0; var repeat_code_len = 0; var space = 32768; - + var table = []; for (var i = 0; i < 32; i++) table.push(new HuffmanCode(0, 0)); - + BrotliBuildHuffmanTable(table, 0, 5, code_length_code_lengths, CODE_LENGTH_CODES); while (symbol < num_symbols && space > 0) { var p = 0; var code_len; - + br.readMoreInput(); br.fillBitWindow(); p += (br.val_ >>> br.bit_pos_) & 31; @@ -70113,12 +70113,12 @@ return /******/ (function(modules) { // webpackBootstrap if (symbol + repeat_delta > num_symbols) { throw new Error('[ReadHuffmanCodeLengths] symbol + repeat_delta > num_symbols'); } - + for (var x = 0; x < repeat_delta; x++) code_lengths[symbol + x] = repeat_code_len; - + symbol += repeat_delta; - + if (repeat_code_len !== 0) { space -= repeat_delta << (15 - repeat_code_len); } @@ -70127,7 +70127,7 @@ return /******/ (function(modules) { // webpackBootstrap if (space !== 0) { throw new Error("[ReadHuffmanCodeLengths] space = " + space); } - + for (; symbol < num_symbols; symbol++) code_lengths[symbol] = 0; } @@ -70136,9 +70136,9 @@ return /******/ (function(modules) { // webpackBootstrap var table_size = 0; var simple_code_or_skip; var code_lengths = new Uint8Array(alphabet_size); - + br.readMoreInput(); - + /* simple_code_or_skip is used as follows: 1 for simple code; 0 for no skipping, 2 skips 2 code lengths, 3 skips 3 code lengths */ @@ -70174,7 +70174,7 @@ return /******/ (function(modules) { // webpackBootstrap if (symbols[0] === symbols[1]) { throw new Error('[ReadHuffmanCode] invalid symbols'); } - + code_lengths[symbols[1]] = 1; break; case 4: @@ -70186,7 +70186,7 @@ return /******/ (function(modules) { // webpackBootstrap (symbols[2] === symbols[3])) { throw new Error('[ReadHuffmanCode] invalid symbols'); } - + if (br.readBits(1)) { code_lengths[symbols[2]] = 3; code_lengths[symbols[3]] = 3; @@ -70202,9 +70202,9 @@ return /******/ (function(modules) { // webpackBootstrap var num_codes = 0; /* Static Huffman code for the code length code lengths */ var huff = [ - new HuffmanCode(2, 0), new HuffmanCode(2, 4), new HuffmanCode(2, 3), new HuffmanCode(3, 2), + new HuffmanCode(2, 0), new HuffmanCode(2, 4), new HuffmanCode(2, 3), new HuffmanCode(3, 2), new HuffmanCode(2, 0), new HuffmanCode(2, 4), new HuffmanCode(2, 3), new HuffmanCode(4, 1), - new HuffmanCode(2, 0), new HuffmanCode(2, 4), new HuffmanCode(2, 3), new HuffmanCode(3, 2), + new HuffmanCode(2, 0), new HuffmanCode(2, 4), new HuffmanCode(2, 3), new HuffmanCode(3, 2), new HuffmanCode(2, 0), new HuffmanCode(2, 4), new HuffmanCode(2, 3), new HuffmanCode(4, 5) ]; for (i = simple_code_or_skip; i < CODE_LENGTH_CODES && space > 0; ++i) { @@ -70221,19 +70221,19 @@ return /******/ (function(modules) { // webpackBootstrap ++num_codes; } } - + if (!(num_codes === 1 || space === 0)) throw new Error('[ReadHuffmanCode] invalid num_codes or space'); - + ReadHuffmanCodeLengths(code_length_code_lengths, alphabet_size, code_lengths, br); } - + table_size = BrotliBuildHuffmanTable(tables, table, HUFFMAN_TABLE_BITS, code_lengths, alphabet_size); - + if (table_size === 0) { throw new Error("[ReadHuffmanCode] BuildHuffmanTable failed: "); } - + return table_size; } @@ -70281,7 +70281,7 @@ return /******/ (function(modules) { // webpackBootstrap function HuffmanTreeGroup(alphabet_size, num_htrees) { this.alphabet_size = alphabet_size; this.num_htrees = num_htrees; - this.codes = new Array(num_htrees + num_htrees * kMaxHuffmanTableSize[(alphabet_size + 31) >>> 5]); + this.codes = new Array(num_htrees + num_htrees * kMaxHuffmanTableSize[(alphabet_size + 31) >>> 5]); this.htrees = new Uint32Array(num_htrees); } @@ -70302,7 +70302,7 @@ return /******/ (function(modules) { // webpackBootstrap var max_run_length_prefix = 0; var table; var i; - + br.readMoreInput(); var num_htrees = out.num_htrees = DecodeVarLenUint8(br) + 1; @@ -70315,14 +70315,14 @@ return /******/ (function(modules) { // webpackBootstrap if (use_rle_for_zeros) { max_run_length_prefix = br.readBits(4) + 1; } - + table = []; for (i = 0; i < HUFFMAN_MAX_TABLE_SIZE; i++) { table[i] = new HuffmanCode(0, 0); } - + ReadHuffmanCode(num_htrees + max_run_length_prefix, table, 0, br); - + for (i = 0; i < context_map_size;) { var code; @@ -70348,7 +70348,7 @@ return /******/ (function(modules) { // webpackBootstrap if (br.readBits(1)) { InverseMoveToFrontTransform(context_map, context_map_size); } - + return out; } @@ -70409,7 +70409,7 @@ return /******/ (function(modules) { // webpackBootstrap var tail = BrotliBitReader.IBUF_MASK + 1 - br_pos; for (var x = 0; x < tail; x++) ringbuffer[rb_pos + x] = br.buf_[br_pos + x]; - + nbytes -= tail; rb_pos += tail; len -= tail; @@ -70418,7 +70418,7 @@ return /******/ (function(modules) { // webpackBootstrap for (var x = 0; x < nbytes; x++) ringbuffer[rb_pos + x] = br.buf_[br_pos + x]; - + rb_pos += nbytes; len -= nbytes; @@ -70426,7 +70426,7 @@ return /******/ (function(modules) { // webpackBootstrap ringbuffer to its beginning and flush the ringbuffer to the output. */ if (rb_pos >= rb_size) { output.write(ringbuffer, rb_size); - rb_pos -= rb_size; + rb_pos -= rb_size; for (var x = 0; x < rb_pos; x++) ringbuffer[x] = ringbuffer[rb_size + x]; } @@ -70474,20 +70474,20 @@ return /******/ (function(modules) { // webpackBootstrap function BrotliDecompressBuffer(buffer, output_size) { var input = new BrotliInput(buffer); - + if (output_size == null) { output_size = BrotliDecompressedSize(buffer); } - + var output_buffer = new Uint8Array(output_size); var output = new BrotliOutput(output_buffer); - + BrotliDecompress(input, output); - + if (output.pos < output.buffer.length) { output.buffer = output.buffer.subarray(0, output.pos); } - + return output.buffer; } @@ -70574,7 +70574,7 @@ return /******/ (function(modules) { // webpackBootstrap } br.readMoreInput(); - + var _out = DecodeMetaBlockLength(br); meta_block_remaining_len = _out.meta_block_length; if (pos + meta_block_remaining_len > output.buffer.length) { @@ -70582,26 +70582,26 @@ return /******/ (function(modules) { // webpackBootstrap var tmp = new Uint8Array( pos + meta_block_remaining_len ); tmp.set( output.buffer ); output.buffer = tmp; - } + } input_end = _out.input_end; is_uncompressed = _out.is_uncompressed; - + if (_out.is_metadata) { JumpToByteBoundary(br); - + for (; meta_block_remaining_len > 0; --meta_block_remaining_len) { br.readMoreInput(); /* Read one byte and ignore it. */ br.readBits(8); } - + continue; } - + if (meta_block_remaining_len === 0) { continue; } - + if (is_uncompressed) { br.bit_pos_ = (br.bit_pos_ + 7) & ~7; CopyUncompressedBlockToOutput(output, meta_block_remaining_len, pos, @@ -70609,7 +70609,7 @@ return /******/ (function(modules) { // webpackBootstrap pos += meta_block_remaining_len; continue; } - + for (i = 0; i < 3; ++i) { num_block_types[i] = DecodeVarLenUint8(br) + 1; if (num_block_types[i] >= 2) { @@ -70619,9 +70619,9 @@ return /******/ (function(modules) { // webpackBootstrap block_type_rb_index[i] = 1; } } - + br.readMoreInput(); - + distance_postfix_bits = br.readBits(2); num_direct_distance_codes = NUM_DISTANCE_SHORT_CODES + (br.readBits(4) << distance_postfix_bits); distance_postfix_mask = (1 << distance_postfix_bits) - 1; @@ -70632,15 +70632,15 @@ return /******/ (function(modules) { // webpackBootstrap br.readMoreInput(); context_modes[i] = (br.readBits(2) << 1); } - + var _o1 = DecodeContextMap(num_block_types[0] << kLiteralContextBits, br); num_literal_htrees = _o1.num_htrees; context_map = _o1.context_map; - + var _o2 = DecodeContextMap(num_block_types[2] << kDistanceContextBits, br); num_dist_htrees = _o2.num_htrees; dist_context_map = _o2.context_map; - + hgroup[0] = new HuffmanTreeGroup(kNumLiteralCodes, num_literal_htrees); hgroup[1] = new HuffmanTreeGroup(kNumInsertAndCopyCodes, num_block_types[1]); hgroup[2] = new HuffmanTreeGroup(num_distance_codes, num_dist_htrees); @@ -70670,7 +70670,7 @@ return /******/ (function(modules) { // webpackBootstrap var copy_dst; br.readMoreInput(); - + if (block_length[1] === 0) { DecodeBlockType(num_block_types[1], block_type_trees, 1, block_type, block_type_rb, @@ -70726,7 +70726,7 @@ return /******/ (function(modules) { // webpackBootstrap if (distance_code < 0) { var context; - + br.readMoreInput(); if (block_length[2] === 0) { DecodeBlockType(num_block_types[2], @@ -70788,7 +70788,7 @@ return /******/ (function(modules) { // webpackBootstrap meta_block_remaining_len -= len; if (copy_dst >= ringbuffer_end) { output.write(ringbuffer, ringbuffer_size); - + for (var _x = 0; _x < (copy_dst - ringbuffer_end); _x++) ringbuffer[_x] = ringbuffer[ringbuffer_end + _x]; } @@ -70853,10 +70853,10 @@ return /******/ (function(modules) { // webpackBootstrap if (this.pos + count > this.buffer.length) { count = this.buffer.length - this.pos; } - + for (var p = 0; p < count; p++) buf[i + p] = this.buffer[this.pos + p]; - + this.pos += count; return count; } @@ -70871,7 +70871,7 @@ return /******/ (function(modules) { // webpackBootstrap BrotliOutput.prototype.write = function(buf, count) { if (this.pos + count > this.buffer.length) throw new Error('Output buffer is not large enough'); - + this.buffer.set(buf.subarray(0, count), this.pos); this.pos += count; return count; @@ -70915,7 +70915,7 @@ return /******/ (function(modules) { // webpackBootstrap function BrotliBitReader(input) { this.buf_ = new Uint8Array(BROTLI_IBUF_SIZE); this.input_ = input; /* input callback */ - + this.reset(); } @@ -70929,13 +70929,13 @@ return /******/ (function(modules) { // webpackBootstrap this.bit_pos_ = 0; /* current bit-reading position in val_ */ this.bit_end_pos_ = 0; /* bit-reading end position from LSB of val_ */ this.eos_ = 0; /* input stream is finished */ - + this.readMoreInput(); for (var i = 0; i < 4; i++) { this.val_ |= this.buf_[this.pos_] << (8 * i); ++this.pos_; } - + return this.bit_end_pos_ > 0; }; @@ -70963,14 +70963,14 @@ return /******/ (function(modules) { // webpackBootstrap if (bytes_read < 0) { throw new Error('Unexpected end of input'); } - + if (bytes_read < BROTLI_READ_SIZE) { this.eos_ = 1; /* Store 32 bytes of zero after the stream end. */ for (var p = 0; p < 32; p++) this.buf_[dst + bytes_read + p] = 0; } - + if (dst === 0) { /* Copy the head of the ringbuffer to the slack region. */ for (var p = 0; p < 32; p++) @@ -70980,13 +70980,13 @@ return /******/ (function(modules) { // webpackBootstrap } else { this.buf_ptr_ = 0; } - + this.bit_end_pos_ += bytes_read << 3; } }; /* Guarantees that there are at least 24 bits in the buffer. */ - BrotliBitReader.prototype.fillBitWindow = function() { + BrotliBitReader.prototype.fillBitWindow = function() { while (this.bit_pos_ >= 8) { this.val_ >>>= 8; this.val_ |= this.buf_[this.pos_ & BROTLI_IBUF_MASK] << 24; @@ -71001,7 +71001,7 @@ return /******/ (function(modules) { // webpackBootstrap if (32 - this.bit_pos_ < n_bits) { this.fillBitWindow(); } - + var val = ((this.val_ >>> this.bit_pos_) & kBitMask[n_bits]); this.bit_pos_ += n_bits; return val; @@ -71060,10 +71060,10 @@ return /******/ (function(modules) { // webpackBootstrap var fs = __webpack_require__(56); /** - * The normal dictionary-data.js is quite large, which makes it - * unsuitable for browser usage. In order to make it smaller, + * The normal dictionary-data.js is quite large, which makes it + * unsuitable for browser usage. In order to make it smaller, * we read dictionary.bin, which is a compressed version of - * the dictionary, and on initial load, Brotli decompresses + * the dictionary, and on initial load, Brotli decompresses * it's own dictionary. 😜 */ exports.init = function() { @@ -71281,7 +71281,7 @@ return /******/ (function(modules) { // webpackBootstrap sorted[offset[code_lengths[symbol]]++] = symbol; } } - + table_bits = root_bits; table_size = 1 << table_bits; total_size = table_size; @@ -71291,7 +71291,7 @@ return /******/ (function(modules) { // webpackBootstrap for (key = 0; key < total_size; ++key) { root_table[table + key] = new HuffmanCode(0, sorted[0] & 0xffff); } - + return total_size; } @@ -71324,7 +71324,7 @@ return /******/ (function(modules) { // webpackBootstrap key = GetNextKey(key, len); } } - + return total_size; } @@ -71700,10 +71700,10 @@ return /******/ (function(modules) { // webpackBootstrap this.prefix = new Uint8Array(prefix.length); this.transform = transform; this.suffix = new Uint8Array(suffix.length); - + for (var i = 0; i < prefix.length; i++) this.prefix[i] = prefix.charCodeAt(i); - + for (var i = 0; i < suffix.length; i++) this.suffix[i] = suffix.charCodeAt(i); } @@ -71842,13 +71842,13 @@ return /******/ (function(modules) { // webpackBootstrap } return 1; } - + /* An overly simplified uppercasing model for utf-8. */ if (p[i] < 0xe0) { p[i + 1] ^= 32; return 2; } - + /* An arbitrary transform for three byte characters. */ p[i + 2] ^= 5; return 3; @@ -71862,29 +71862,29 @@ return /******/ (function(modules) { // webpackBootstrap var i = 0; var start_idx = idx; var uppercase; - + if (skip > len) { skip = len; } - + var prefix_pos = 0; while (prefix_pos < prefix.length) { dst[idx++] = prefix[prefix_pos++]; } - + word += skip; len -= skip; - + if (t <= kOmitLast9) { len -= t; } - + for (i = 0; i < len; i++) { dst[idx++] = BrotliDictionary.dictionary[word + i]; } - + uppercase = idx - len; - + if (t === kUppercaseFirst) { ToUpperCase(dst, uppercase); } else if (t === kUppercaseAll) { @@ -71894,12 +71894,12 @@ return /******/ (function(modules) { // webpackBootstrap len -= step; } } - + var suffix_pos = 0; while (suffix_pos < suffix.length) { dst[idx++] = suffix[suffix_pos++]; } - + return idx - start_idx; } @@ -73685,20 +73685,20 @@ return /******/ (function(modules) { // webpackBootstrap /* # MIT LICENSE # Copyright (c) 2011 Devon Govett - # - # Permission is hereby granted, free of charge, to any person obtaining a copy of this - # software and associated documentation files (the "Software"), to deal in the Software - # without restriction, including without limitation the rights to use, copy, modify, merge, - # publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons + # + # Permission is hereby granted, free of charge, to any person obtaining a copy of this + # software and associated documentation files (the "Software"), to deal in the Software + # without restriction, including without limitation the rights to use, copy, modify, merge, + # publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons # to whom the Software is furnished to do so, subject to the following conditions: - # - # The above copyright notice and this permission notice shall be included in all copies or + # + # The above copyright notice and this permission notice shall be included in all copies or # substantial portions of the Software. - # - # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING - # BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND - # NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, - # DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + # + # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + # BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + # NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + # DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, # OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ @@ -74621,4 +74621,4 @@ return /******/ (function(modules) { // webpackBootstrap /***/ }) /******/ ]) }); -; \ No newline at end of file +;