@fragno-dev/workflows 0.0.1

package/dist/node/node_modules/.pnpm/iconv-lite@0.7.1/node_modules/iconv-lite/encodings/dbcs-codec.js

@@ -0,0 +1,367 @@
+import { __commonJS } from "../../../../../../_virtual/rolldown_runtime.js";
+import { require_safer } from "../../../../safer-buffer@2.1.2/node_modules/safer-buffer/safer.js";
+
+//#region ../../node_modules/.pnpm/iconv-lite@0.7.1/node_modules/iconv-lite/encodings/dbcs-codec.js
+var require_dbcs_codec = /* @__PURE__ */ __commonJS({ "../../node_modules/.pnpm/iconv-lite@0.7.1/node_modules/iconv-lite/encodings/dbcs-codec.js": ((exports) => {
+	var Buffer = require_safer().Buffer;
+	exports._dbcs = DBCSCodec;
+	var UNASSIGNED = -1;
+	var GB18030_CODE = -2;
+	var SEQ_START = -10;
+	var NODE_START = -1e3;
+	var UNASSIGNED_NODE = new Array(256);
+	var DEF_CHAR = -1;
+	for (var i = 0; i < 256; i++) UNASSIGNED_NODE[i] = UNASSIGNED;
+	function DBCSCodec(codecOptions, iconv) {
+		this.encodingName = codecOptions.encodingName;
+		if (!codecOptions) throw new Error("DBCS codec is called without the data.");
+		if (!codecOptions.table) throw new Error("Encoding '" + this.encodingName + "' has no data.");
+		var mappingTable = codecOptions.table();
+		this.decodeTables = [];
+		this.decodeTables[0] = UNASSIGNED_NODE.slice(0);
+		this.decodeTableSeq = [];
+		for (var i$1 = 0; i$1 < mappingTable.length; i$1++) this._addDecodeChunk(mappingTable[i$1]);
+		if (typeof codecOptions.gb18030 === "function") {
+			this.gb18030 = codecOptions.gb18030();
+			var commonThirdByteNodeIdx = this.decodeTables.length;
+			this.decodeTables.push(UNASSIGNED_NODE.slice(0));
+			var commonFourthByteNodeIdx = this.decodeTables.length;
+			this.decodeTables.push(UNASSIGNED_NODE.slice(0));
+			var firstByteNode = this.decodeTables[0];
+			for (var i$1 = 129; i$1 <= 254; i$1++) {
+				var secondByteNode = this.decodeTables[NODE_START - firstByteNode[i$1]];
+				for (var j = 48; j <= 57; j++) {
+					if (secondByteNode[j] === UNASSIGNED) secondByteNode[j] = NODE_START - commonThirdByteNodeIdx;
+					else if (secondByteNode[j] > NODE_START) throw new Error("gb18030 decode tables conflict at byte 2");
+					var thirdByteNode = this.decodeTables[NODE_START - secondByteNode[j]];
+					for (var k = 129; k <= 254; k++) {
+						if (thirdByteNode[k] === UNASSIGNED) thirdByteNode[k] = NODE_START - commonFourthByteNodeIdx;
+						else if (thirdByteNode[k] === NODE_START - commonFourthByteNodeIdx) continue;
+						else if (thirdByteNode[k] > NODE_START) throw new Error("gb18030 decode tables conflict at byte 3");
+						var fourthByteNode = this.decodeTables[NODE_START - thirdByteNode[k]];
+						for (var l = 48; l <= 57; l++) if (fourthByteNode[l] === UNASSIGNED) fourthByteNode[l] = GB18030_CODE;
+					}
+				}
+			}
+		}
+		this.defaultCharUnicode = iconv.defaultCharUnicode;
+		this.encodeTable = [];
+		this.encodeTableSeq = [];
+		var skipEncodeChars = {};
+		if (codecOptions.encodeSkipVals) for (var i$1 = 0; i$1 < codecOptions.encodeSkipVals.length; i$1++) {
+			var val = codecOptions.encodeSkipVals[i$1];
+			if (typeof val === "number") skipEncodeChars[val] = true;
+			else for (var j = val.from; j <= val.to; j++) skipEncodeChars[j] = true;
+		}
+		this._fillEncodeTable(0, 0, skipEncodeChars);
+		if (codecOptions.encodeAdd) {
+			for (var uChar in codecOptions.encodeAdd) if (Object.prototype.hasOwnProperty.call(codecOptions.encodeAdd, uChar)) this._setEncodeChar(uChar.charCodeAt(0), codecOptions.encodeAdd[uChar]);
+		}
+		this.defCharSB = this.encodeTable[0][iconv.defaultCharSingleByte.charCodeAt(0)];
+		if (this.defCharSB === UNASSIGNED) this.defCharSB = this.encodeTable[0]["?"];
+		if (this.defCharSB === UNASSIGNED) this.defCharSB = "?".charCodeAt(0);
+	}
+	DBCSCodec.prototype.encoder = DBCSEncoder;
+	DBCSCodec.prototype.decoder = DBCSDecoder;
+	DBCSCodec.prototype._getDecodeTrieNode = function(addr) {
+		var bytes = [];
+		for (; addr > 0; addr >>>= 8) bytes.push(addr & 255);
+		if (bytes.length == 0) bytes.push(0);
+		var node = this.decodeTables[0];
+		for (var i$1 = bytes.length - 1; i$1 > 0; i$1--) {
+			var val = node[bytes[i$1]];
+			if (val == UNASSIGNED) {
+				node[bytes[i$1]] = NODE_START - this.decodeTables.length;
+				this.decodeTables.push(node = UNASSIGNED_NODE.slice(0));
+			} else if (val <= NODE_START) node = this.decodeTables[NODE_START - val];
+			else throw new Error("Overwrite byte in " + this.encodingName + ", addr: " + addr.toString(16));
+		}
+		return node;
+	};
+	DBCSCodec.prototype._addDecodeChunk = function(chunk) {
+		var curAddr = parseInt(chunk[0], 16);
+		var writeTable = this._getDecodeTrieNode(curAddr);
+		curAddr = curAddr & 255;
+		for (var k = 1; k < chunk.length; k++) {
+			var part = chunk[k];
+			if (typeof part === "string") for (var l = 0; l < part.length;) {
+				var code = part.charCodeAt(l++);
+				if (code >= 55296 && code < 56320) {
+					var codeTrail = part.charCodeAt(l++);
+					if (codeTrail >= 56320 && codeTrail < 57344) writeTable[curAddr++] = 65536 + (code - 55296) * 1024 + (codeTrail - 56320);
+					else throw new Error("Incorrect surrogate pair in " + this.encodingName + " at chunk " + chunk[0]);
+				} else if (code > 4080 && code <= 4095) {
+					var len = 4095 - code + 2;
+					var seq = [];
+					for (var m = 0; m < len; m++) seq.push(part.charCodeAt(l++));
+					writeTable[curAddr++] = SEQ_START - this.decodeTableSeq.length;
+					this.decodeTableSeq.push(seq);
+				} else writeTable[curAddr++] = code;
+			}
+			else if (typeof part === "number") {
+				var charCode = writeTable[curAddr - 1] + 1;
+				for (var l = 0; l < part; l++) writeTable[curAddr++] = charCode++;
+			} else throw new Error("Incorrect type '" + typeof part + "' given in " + this.encodingName + " at chunk " + chunk[0]);
+		}
+		if (curAddr > 255) throw new Error("Incorrect chunk in " + this.encodingName + " at addr " + chunk[0] + ": too long" + curAddr);
+	};
+	DBCSCodec.prototype._getEncodeBucket = function(uCode) {
+		var high = uCode >> 8;
+		if (this.encodeTable[high] === void 0) this.encodeTable[high] = UNASSIGNED_NODE.slice(0);
+		return this.encodeTable[high];
+	};
+	DBCSCodec.prototype._setEncodeChar = function(uCode, dbcsCode) {
+		var bucket = this._getEncodeBucket(uCode);
+		var low = uCode & 255;
+		if (bucket[low] <= SEQ_START) this.encodeTableSeq[SEQ_START - bucket[low]][DEF_CHAR] = dbcsCode;
+		else if (bucket[low] == UNASSIGNED) bucket[low] = dbcsCode;
+	};
+	DBCSCodec.prototype._setEncodeSequence = function(seq, dbcsCode) {
+		var uCode = seq[0];
+		var bucket = this._getEncodeBucket(uCode);
+		var low = uCode & 255;
+		var node;
+		if (bucket[low] <= SEQ_START) node = this.encodeTableSeq[SEQ_START - bucket[low]];
+		else {
+			node = {};
+			if (bucket[low] !== UNASSIGNED) node[DEF_CHAR] = bucket[low];
+			bucket[low] = SEQ_START - this.encodeTableSeq.length;
+			this.encodeTableSeq.push(node);
+		}
+		for (var j = 1; j < seq.length - 1; j++) {
+			var oldVal = node[uCode];
+			if (typeof oldVal === "object") node = oldVal;
+			else {
+				node = node[uCode] = {};
+				if (oldVal !== void 0) node[DEF_CHAR] = oldVal;
+			}
+		}
+		uCode = seq[seq.length - 1];
+		node[uCode] = dbcsCode;
+	};
+	DBCSCodec.prototype._fillEncodeTable = function(nodeIdx, prefix, skipEncodeChars) {
+		var node = this.decodeTables[nodeIdx];
+		var hasValues = false;
+		var subNodeEmpty = {};
+		for (var i$1 = 0; i$1 < 256; i$1++) {
+			var uCode = node[i$1];
+			var mbCode = prefix + i$1;
+			if (skipEncodeChars[mbCode]) continue;
+			if (uCode >= 0) {
+				this._setEncodeChar(uCode, mbCode);
+				hasValues = true;
+			} else if (uCode <= NODE_START) {
+				var subNodeIdx = NODE_START - uCode;
+				if (!subNodeEmpty[subNodeIdx]) {
+					var newPrefix = mbCode << 8 >>> 0;
+					if (this._fillEncodeTable(subNodeIdx, newPrefix, skipEncodeChars)) hasValues = true;
+					else subNodeEmpty[subNodeIdx] = true;
+				}
+			} else if (uCode <= SEQ_START) {
+				this._setEncodeSequence(this.decodeTableSeq[SEQ_START - uCode], mbCode);
+				hasValues = true;
+			}
+		}
+		return hasValues;
+	};
+	function DBCSEncoder(options, codec) {
+		this.leadSurrogate = -1;
+		this.seqObj = void 0;
+		this.encodeTable = codec.encodeTable;
+		this.encodeTableSeq = codec.encodeTableSeq;
+		this.defaultCharSingleByte = codec.defCharSB;
+		this.gb18030 = codec.gb18030;
+	}
+	DBCSEncoder.prototype.write = function(str) {
+		var newBuf = Buffer.alloc(str.length * (this.gb18030 ? 4 : 3));
+		var leadSurrogate = this.leadSurrogate;
+		var seqObj = this.seqObj;
+		var nextChar = -1;
+		var i$1 = 0;
+		var j = 0;
+		while (true) {
+			if (nextChar === -1) {
+				if (i$1 == str.length) break;
+				var uCode = str.charCodeAt(i$1++);
+			} else {
+				var uCode = nextChar;
+				nextChar = -1;
+			}
+			if (uCode >= 55296 && uCode < 57344) if (uCode < 56320) if (leadSurrogate === -1) {
+				leadSurrogate = uCode;
+				continue;
+			} else {
+				leadSurrogate = uCode;
+				uCode = UNASSIGNED;
+			}
+			else if (leadSurrogate !== -1) {
+				uCode = 65536 + (leadSurrogate - 55296) * 1024 + (uCode - 56320);
+				leadSurrogate = -1;
+			} else uCode = UNASSIGNED;
+			else if (leadSurrogate !== -1) {
+				nextChar = uCode;
+				uCode = UNASSIGNED;
+				leadSurrogate = -1;
+			}
+			var dbcsCode = UNASSIGNED;
+			if (seqObj !== void 0 && uCode != UNASSIGNED) {
+				var resCode = seqObj[uCode];
+				if (typeof resCode === "object") {
+					seqObj = resCode;
+					continue;
+				} else if (typeof resCode === "number") dbcsCode = resCode;
+				else if (resCode == void 0) {
+					resCode = seqObj[DEF_CHAR];
+					if (resCode !== void 0) {
+						dbcsCode = resCode;
+						nextChar = uCode;
+					}
+				}
+				seqObj = void 0;
+			} else if (uCode >= 0) {
+				var subtable = this.encodeTable[uCode >> 8];
+				if (subtable !== void 0) dbcsCode = subtable[uCode & 255];
+				if (dbcsCode <= SEQ_START) {
+					seqObj = this.encodeTableSeq[SEQ_START - dbcsCode];
+					continue;
+				}
+				if (dbcsCode == UNASSIGNED && this.gb18030) {
+					var idx = findIdx(this.gb18030.uChars, uCode);
+					if (idx != -1) {
+						var dbcsCode = this.gb18030.gbChars[idx] + (uCode - this.gb18030.uChars[idx]);
+						newBuf[j++] = 129 + Math.floor(dbcsCode / 12600);
+						dbcsCode = dbcsCode % 12600;
+						newBuf[j++] = 48 + Math.floor(dbcsCode / 1260);
+						dbcsCode = dbcsCode % 1260;
+						newBuf[j++] = 129 + Math.floor(dbcsCode / 10);
+						dbcsCode = dbcsCode % 10;
+						newBuf[j++] = 48 + dbcsCode;
+						continue;
+					}
+				}
+			}
+			if (dbcsCode === UNASSIGNED) dbcsCode = this.defaultCharSingleByte;
+			if (dbcsCode < 256) newBuf[j++] = dbcsCode;
+			else if (dbcsCode < 65536) {
+				newBuf[j++] = dbcsCode >> 8;
+				newBuf[j++] = dbcsCode & 255;
+			} else if (dbcsCode < 16777216) {
+				newBuf[j++] = dbcsCode >> 16;
+				newBuf[j++] = dbcsCode >> 8 & 255;
+				newBuf[j++] = dbcsCode & 255;
+			} else {
+				newBuf[j++] = dbcsCode >>> 24;
+				newBuf[j++] = dbcsCode >>> 16 & 255;
+				newBuf[j++] = dbcsCode >>> 8 & 255;
+				newBuf[j++] = dbcsCode & 255;
+			}
+		}
+		this.seqObj = seqObj;
+		this.leadSurrogate = leadSurrogate;
+		return newBuf.slice(0, j);
+	};
+	DBCSEncoder.prototype.end = function() {
+		if (this.leadSurrogate === -1 && this.seqObj === void 0) return;
+		var newBuf = Buffer.alloc(10);
+		var j = 0;
+		if (this.seqObj) {
+			var dbcsCode = this.seqObj[DEF_CHAR];
+			if (dbcsCode !== void 0) if (dbcsCode < 256) newBuf[j++] = dbcsCode;
+			else {
+				newBuf[j++] = dbcsCode >> 8;
+				newBuf[j++] = dbcsCode & 255;
+			}
+			this.seqObj = void 0;
+		}
+		if (this.leadSurrogate !== -1) {
+			newBuf[j++] = this.defaultCharSingleByte;
+			this.leadSurrogate = -1;
+		}
+		return newBuf.slice(0, j);
+	};
+	DBCSEncoder.prototype.findIdx = findIdx;
+	function DBCSDecoder(options, codec) {
+		this.nodeIdx = 0;
+		this.prevBytes = [];
+		this.decodeTables = codec.decodeTables;
+		this.decodeTableSeq = codec.decodeTableSeq;
+		this.defaultCharUnicode = codec.defaultCharUnicode;
+		this.gb18030 = codec.gb18030;
+	}
+	DBCSDecoder.prototype.write = function(buf) {
+		var newBuf = Buffer.alloc(buf.length * 2);
+		var nodeIdx = this.nodeIdx;
+		var prevBytes = this.prevBytes;
+		var prevOffset = this.prevBytes.length;
+		var seqStart = -this.prevBytes.length;
+		var uCode;
+		for (var i$1 = 0, j = 0; i$1 < buf.length; i$1++) {
+			var curByte = i$1 >= 0 ? buf[i$1] : prevBytes[i$1 + prevOffset];
+			var uCode = this.decodeTables[nodeIdx][curByte];
+			if (uCode >= 0) {} else if (uCode === UNASSIGNED) {
+				uCode = this.defaultCharUnicode.charCodeAt(0);
+				i$1 = seqStart;
+			} else if (uCode === GB18030_CODE) {
+				if (i$1 >= 3) var ptr = (buf[i$1 - 3] - 129) * 12600 + (buf[i$1 - 2] - 48) * 1260 + (buf[i$1 - 1] - 129) * 10 + (curByte - 48);
+				else var ptr = (prevBytes[i$1 - 3 + prevOffset] - 129) * 12600 + ((i$1 - 2 >= 0 ? buf[i$1 - 2] : prevBytes[i$1 - 2 + prevOffset]) - 48) * 1260 + ((i$1 - 1 >= 0 ? buf[i$1 - 1] : prevBytes[i$1 - 1 + prevOffset]) - 129) * 10 + (curByte - 48);
+				var idx = findIdx(this.gb18030.gbChars, ptr);
+				uCode = this.gb18030.uChars[idx] + ptr - this.gb18030.gbChars[idx];
+			} else if (uCode <= NODE_START) {
+				nodeIdx = NODE_START - uCode;
+				continue;
+			} else if (uCode <= SEQ_START) {
+				var seq = this.decodeTableSeq[SEQ_START - uCode];
+				for (var k = 0; k < seq.length - 1; k++) {
+					uCode = seq[k];
+					newBuf[j++] = uCode & 255;
+					newBuf[j++] = uCode >> 8;
+				}
+				uCode = seq[seq.length - 1];
+			} else throw new Error("iconv-lite internal error: invalid decoding table value " + uCode + " at " + nodeIdx + "/" + curByte);
+			if (uCode >= 65536) {
+				uCode -= 65536;
+				var uCodeLead = 55296 | uCode >> 10;
+				newBuf[j++] = uCodeLead & 255;
+				newBuf[j++] = uCodeLead >> 8;
+				uCode = 56320 | uCode & 1023;
+			}
+			newBuf[j++] = uCode & 255;
+			newBuf[j++] = uCode >> 8;
+			nodeIdx = 0;
+			seqStart = i$1 + 1;
+		}
+		this.nodeIdx = nodeIdx;
+		this.prevBytes = seqStart >= 0 ? Array.prototype.slice.call(buf, seqStart) : prevBytes.slice(seqStart + prevOffset).concat(Array.prototype.slice.call(buf));
+		return newBuf.slice(0, j).toString("ucs2");
+	};
+	DBCSDecoder.prototype.end = function() {
+		var ret = "";
+		while (this.prevBytes.length > 0) {
+			ret += this.defaultCharUnicode;
+			var bytesArr = this.prevBytes.slice(1);
+			this.prevBytes = [];
+			this.nodeIdx = 0;
+			if (bytesArr.length > 0) ret += this.write(bytesArr);
+		}
+		this.prevBytes = [];
+		this.nodeIdx = 0;
+		return ret;
+	};
+	function findIdx(table, val) {
+		if (table[0] > val) return -1;
+		var l = 0;
+		var r = table.length;
+		while (l < r - 1) {
+			var mid = l + (r - l + 1 >> 1);
+			if (table[mid] <= val) l = mid;
+			else r = mid;
+		}
+		return l;
+	}
+}) });
+
+//#endregion
+export default require_dbcs_codec();
+
+export { require_dbcs_codec };
+//# sourceMappingURL=dbcs-codec.js.map

package/dist/node/node_modules/.pnpm/iconv-lite@0.7.1/node_modules/iconv-lite/encodings/dbcs-codec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dbcs-codec.js","names":["i"],"sources":["../../../../../../../../../../node_modules/.pnpm/iconv-lite@0.7.1/node_modules/iconv-lite/encodings/dbcs-codec.js"],"sourcesContent":["\"use strict\"\nvar Buffer = require(\"safer-buffer\").Buffer\n\n// Multibyte codec. In this scheme, a character is represented by 1 or more bytes.\n// Our codec supports UTF-16 surrogates, extensions for GB18030 and unicode sequences.\n// To save memory and loading time, we read table files only when requested.\n\nexports._dbcs = DBCSCodec\n\nvar UNASSIGNED = -1\nvar GB18030_CODE = -2\nvar SEQ_START = -10\nvar NODE_START = -1000\nvar UNASSIGNED_NODE = new Array(0x100)\nvar DEF_CHAR = -1\n\nfor (var i = 0; i < 0x100; i++) { UNASSIGNED_NODE[i] = UNASSIGNED }\n\n// Class DBCSCodec reads and initializes mapping tables.\nfunction DBCSCodec (codecOptions, iconv) {\n  this.encodingName = codecOptions.encodingName\n  if (!codecOptions) { throw new Error(\"DBCS codec is called without the data.\") }\n  if (!codecOptions.table) { throw new Error(\"Encoding '\" + this.encodingName + \"' has no data.\") }\n\n  // Load tables.\n  var mappingTable = codecOptions.table()\n\n  // Decode tables: MBCS -> Unicode.\n\n  // decodeTables is a trie, encoded as an array of arrays of integers. Internal arrays are trie nodes and all have len = 256.\n  // Trie root is decodeTables[0].\n  // Values: >=  0 -> unicode character code. can be > 0xFFFF\n  //         == UNASSIGNED -> unknown/unassigned sequence.\n  //         == GB18030_CODE -> this is the end of a GB18030 4-byte sequence.\n  //         <= NODE_START -> index of the next node in our trie to process next byte.\n  //         <= SEQ_START  -> index of the start of a character code sequence, in decodeTableSeq.\n  this.decodeTables = []\n  this.decodeTables[0] = UNASSIGNED_NODE.slice(0) // Create root node.\n\n  // Sometimes a MBCS char corresponds to a sequence of unicode chars. We store them as arrays of integers here.\n  this.decodeTableSeq = []\n\n  // Actual mapping tables consist of chunks. Use them to fill up decode tables.\n  for (var i = 0; i < mappingTable.length; i++) { this._addDecodeChunk(mappingTable[i]) }\n\n  // Load & create GB18030 tables when needed.\n  if (typeof codecOptions.gb18030 === \"function\") {\n    this.gb18030 = codecOptions.gb18030() // Load GB18030 ranges.\n\n    // Add GB18030 common decode nodes.\n    var commonThirdByteNodeIdx = this.decodeTables.length\n    this.decodeTables.push(UNASSIGNED_NODE.slice(0))\n\n    var commonFourthByteNodeIdx = this.decodeTables.length\n    this.decodeTables.push(UNASSIGNED_NODE.slice(0))\n\n    // Fill out the tree\n    var firstByteNode = this.decodeTables[0]\n    for (var i = 0x81; i <= 0xFE; i++) {\n      var secondByteNode = this.decodeTables[NODE_START - firstByteNode[i]]\n      for (var j = 0x30; j <= 0x39; j++) {\n        if (secondByteNode[j] === UNASSIGNED) {\n          secondByteNode[j] = NODE_START - commonThirdByteNodeIdx\n        } else if (secondByteNode[j] > NODE_START) {\n          throw new Error(\"gb18030 decode tables conflict at byte 2\")\n        }\n\n        var thirdByteNode = this.decodeTables[NODE_START - secondByteNode[j]]\n        for (var k = 0x81; k <= 0xFE; k++) {\n          if (thirdByteNode[k] === UNASSIGNED) {\n            thirdByteNode[k] = NODE_START - commonFourthByteNodeIdx\n          } else if (thirdByteNode[k] === NODE_START - commonFourthByteNodeIdx) {\n            continue\n          } else if (thirdByteNode[k] > NODE_START) {\n            throw new Error(\"gb18030 decode tables conflict at byte 3\")\n          }\n\n          var fourthByteNode = this.decodeTables[NODE_START - thirdByteNode[k]]\n          for (var l = 0x30; l <= 0x39; l++) {\n            if (fourthByteNode[l] === UNASSIGNED) { fourthByteNode[l] = GB18030_CODE }\n          }\n        }\n      }\n    }\n  }\n\n  this.defaultCharUnicode = iconv.defaultCharUnicode\n\n  // Encode tables: Unicode -> DBCS.\n\n  // `encodeTable` is array mapping from unicode char to encoded char. All its values are integers for performance.\n  // Because it can be sparse, it is represented as array of buckets by 256 chars each. Bucket can be null.\n  // Values: >=  0 -> it is a normal char. Write the value (if <=256 then 1 byte, if <=65536 then 2 bytes, etc.).\n  //         == UNASSIGNED -> no conversion found. Output a default char.\n  //         <= SEQ_START  -> it's an index in encodeTableSeq, see below. The character starts a sequence.\n  this.encodeTable = []\n\n  // `encodeTableSeq` is used when a sequence of unicode characters is encoded as a single code. We use a tree of\n  // objects where keys correspond to characters in sequence and leafs are the encoded dbcs values. A special DEF_CHAR key\n  // means end of sequence (needed when one sequence is a strict subsequence of another).\n  // Objects are kept separately from encodeTable to increase performance.\n  this.encodeTableSeq = []\n\n  // Some chars can be decoded, but need not be encoded.\n  var skipEncodeChars = {}\n  if (codecOptions.encodeSkipVals) {\n    for (var i = 0; i < codecOptions.encodeSkipVals.length; i++) {\n      var val = codecOptions.encodeSkipVals[i]\n      if (typeof val === \"number\") { skipEncodeChars[val] = true } else {\n        for (var j = val.from; j <= val.to; j++) { skipEncodeChars[j] = true }\n      }\n    }\n  }\n\n  // Use decode trie to recursively fill out encode tables.\n  this._fillEncodeTable(0, 0, skipEncodeChars)\n\n  // Add more encoding pairs when needed.\n  if (codecOptions.encodeAdd) {\n    for (var uChar in codecOptions.encodeAdd) {\n      if (Object.prototype.hasOwnProperty.call(codecOptions.encodeAdd, uChar)) { this._setEncodeChar(uChar.charCodeAt(0), codecOptions.encodeAdd[uChar]) }\n    }\n  }\n\n  this.defCharSB = this.encodeTable[0][iconv.defaultCharSingleByte.charCodeAt(0)]\n  if (this.defCharSB === UNASSIGNED) this.defCharSB = this.encodeTable[0][\"?\"]\n  if (this.defCharSB === UNASSIGNED) this.defCharSB = \"?\".charCodeAt(0)\n}\n\nDBCSCodec.prototype.encoder = DBCSEncoder\nDBCSCodec.prototype.decoder = DBCSDecoder\n\n// Decoder helpers\nDBCSCodec.prototype._getDecodeTrieNode = function (addr) {\n  var bytes = []\n  for (; addr > 0; addr >>>= 8) { bytes.push(addr & 0xFF) }\n  if (bytes.length == 0) { bytes.push(0) }\n\n  var node = this.decodeTables[0]\n  for (var i = bytes.length - 1; i > 0; i--) { // Traverse nodes deeper into the trie.\n    var val = node[bytes[i]]\n\n    if (val == UNASSIGNED) { // Create new node.\n      node[bytes[i]] = NODE_START - this.decodeTables.length\n      this.decodeTables.push(node = UNASSIGNED_NODE.slice(0))\n    } else if (val <= NODE_START) { // Existing node.\n      node = this.decodeTables[NODE_START - val]\n    } else { throw new Error(\"Overwrite byte in \" + this.encodingName + \", addr: \" + addr.toString(16)) }\n  }\n  return node\n}\n\nDBCSCodec.prototype._addDecodeChunk = function (chunk) {\n  // First element of chunk is the hex mbcs code where we start.\n  var curAddr = parseInt(chunk[0], 16)\n\n  // Choose the decoding node where we'll write our chars.\n  var writeTable = this._getDecodeTrieNode(curAddr)\n  curAddr = curAddr & 0xFF\n\n  // Write all other elements of the chunk to the table.\n  for (var k = 1; k < chunk.length; k++) {\n    var part = chunk[k]\n    if (typeof part === \"string\") { // String, write as-is.\n      for (var l = 0; l < part.length;) {\n        var code = part.charCodeAt(l++)\n        if (code >= 0xD800 && code < 0xDC00) { // Decode surrogate\n          var codeTrail = part.charCodeAt(l++)\n          if (codeTrail >= 0xDC00 && codeTrail < 0xE000) { writeTable[curAddr++] = 0x10000 + (code - 0xD800) * 0x400 + (codeTrail - 0xDC00) } else { throw new Error(\"Incorrect surrogate pair in \" + this.encodingName + \" at chunk \" + chunk[0]) }\n        } else if (code > 0x0FF0 && code <= 0x0FFF) { // Character sequence (our own encoding used)\n          var len = 0xFFF - code + 2\n          var seq = []\n          for (var m = 0; m < len; m++) { seq.push(part.charCodeAt(l++)) } // Simple variation: don't support surrogates or subsequences in seq.\n\n          writeTable[curAddr++] = SEQ_START - this.decodeTableSeq.length\n          this.decodeTableSeq.push(seq)\n        } else { writeTable[curAddr++] = code } // Basic char\n      }\n    } else if (typeof part === \"number\") { // Integer, meaning increasing sequence starting with prev character.\n      var charCode = writeTable[curAddr - 1] + 1\n      for (var l = 0; l < part; l++) { writeTable[curAddr++] = charCode++ }\n    } else { throw new Error(\"Incorrect type '\" + typeof part + \"' given in \" + this.encodingName + \" at chunk \" + chunk[0]) }\n  }\n  if (curAddr > 0xFF) { throw new Error(\"Incorrect chunk in \" + this.encodingName + \" at addr \" + chunk[0] + \": too long\" + curAddr) }\n}\n\n// Encoder helpers\nDBCSCodec.prototype._getEncodeBucket = function (uCode) {\n  var high = uCode >> 8 // This could be > 0xFF because of astral characters.\n  if (this.encodeTable[high] === undefined) {\n    this.encodeTable[high] = UNASSIGNED_NODE.slice(0)\n  } // Create bucket on demand.\n  return this.encodeTable[high]\n}\n\nDBCSCodec.prototype._setEncodeChar = function (uCode, dbcsCode) {\n  var bucket = this._getEncodeBucket(uCode)\n  var low = uCode & 0xFF\n  if (bucket[low] <= SEQ_START) { this.encodeTableSeq[SEQ_START - bucket[low]][DEF_CHAR] = dbcsCode } // There's already a sequence, set a single-char subsequence of it.\n  else if (bucket[low] == UNASSIGNED) { bucket[low] = dbcsCode }\n}\n\nDBCSCodec.prototype._setEncodeSequence = function (seq, dbcsCode) {\n  // Get the root of character tree according to first character of the sequence.\n  var uCode = seq[0]\n  var bucket = this._getEncodeBucket(uCode)\n  var low = uCode & 0xFF\n\n  var node\n  if (bucket[low] <= SEQ_START) {\n    // There's already a sequence with  - use it.\n    node = this.encodeTableSeq[SEQ_START - bucket[low]]\n  } else {\n    // There was no sequence object - allocate a new one.\n    node = {}\n    if (bucket[low] !== UNASSIGNED) node[DEF_CHAR] = bucket[low] // If a char was set before - make it a single-char subsequence.\n    bucket[low] = SEQ_START - this.encodeTableSeq.length\n    this.encodeTableSeq.push(node)\n  }\n\n  // Traverse the character tree, allocating new nodes as needed.\n  for (var j = 1; j < seq.length - 1; j++) {\n    var oldVal = node[uCode]\n    if (typeof oldVal === \"object\") { node = oldVal } else {\n      node = node[uCode] = {}\n      if (oldVal !== undefined) { node[DEF_CHAR] = oldVal }\n    }\n  }\n\n  // Set the leaf to given dbcsCode.\n  uCode = seq[seq.length - 1]\n  node[uCode] = dbcsCode\n}\n\nDBCSCodec.prototype._fillEncodeTable = function (nodeIdx, prefix, skipEncodeChars) {\n  var node = this.decodeTables[nodeIdx]\n  var hasValues = false\n  var subNodeEmpty = {}\n  for (var i = 0; i < 0x100; i++) {\n    var uCode = node[i]\n    var mbCode = prefix + i\n    if (skipEncodeChars[mbCode]) { continue }\n\n    if (uCode >= 0) {\n      this._setEncodeChar(uCode, mbCode)\n      hasValues = true\n    } else if (uCode <= NODE_START) {\n      var subNodeIdx = NODE_START - uCode\n      if (!subNodeEmpty[subNodeIdx]) {  // Skip empty subtrees (they are too large in gb18030).\n        var newPrefix = (mbCode << 8) >>> 0  // NOTE: '>>> 0' keeps 32-bit num positive.\n        if (this._fillEncodeTable(subNodeIdx, newPrefix, skipEncodeChars)) { hasValues = true } else { subNodeEmpty[subNodeIdx] = true }\n      }\n    } else if (uCode <= SEQ_START) {\n      this._setEncodeSequence(this.decodeTableSeq[SEQ_START - uCode], mbCode)\n      hasValues = true\n    }\n  }\n  return hasValues\n}\n\n// == Encoder ==================================================================\n\nfunction DBCSEncoder (options, codec) {\n  // Encoder state\n  this.leadSurrogate = -1\n  this.seqObj = undefined\n\n  // Static data\n  this.encodeTable = codec.encodeTable\n  this.encodeTableSeq = codec.encodeTableSeq\n  this.defaultCharSingleByte = codec.defCharSB\n  this.gb18030 = codec.gb18030\n}\n\nDBCSEncoder.prototype.write = function (str) {\n  var newBuf = Buffer.alloc(str.length * (this.gb18030 ? 4 : 3))\n  var leadSurrogate = this.leadSurrogate\n  var seqObj = this.seqObj\n  var nextChar = -1\n  var i = 0; var j = 0\n\n  while (true) {\n    // 0. Get next character.\n    if (nextChar === -1) {\n      if (i == str.length) break\n      var uCode = str.charCodeAt(i++)\n    } else {\n      var uCode = nextChar\n      nextChar = -1\n    }\n\n    // 1. Handle surrogates.\n    if (uCode >= 0xD800 && uCode < 0xE000) { // Char is one of surrogates.\n      if (uCode < 0xDC00) { // We've got lead surrogate.\n        if (leadSurrogate === -1) {\n          leadSurrogate = uCode\n          continue\n        } else {\n          leadSurrogate = uCode\n          // Double lead surrogate found.\n          uCode = UNASSIGNED\n        }\n      } else { // We've got trail surrogate.\n        if (leadSurrogate !== -1) {\n          uCode = 0x10000 + (leadSurrogate - 0xD800) * 0x400 + (uCode - 0xDC00)\n          leadSurrogate = -1\n        } else {\n          // Incomplete surrogate pair - only trail surrogate found.\n          uCode = UNASSIGNED\n        }\n      }\n    } else if (leadSurrogate !== -1) {\n      // Incomplete surrogate pair - only lead surrogate found.\n      nextChar = uCode; uCode = UNASSIGNED // Write an error, then current char.\n      leadSurrogate = -1\n    }\n\n    // 2. Convert uCode character.\n    var dbcsCode = UNASSIGNED\n    if (seqObj !== undefined && uCode != UNASSIGNED) { // We are in the middle of the sequence\n      var resCode = seqObj[uCode]\n      if (typeof resCode === \"object\") { // Sequence continues.\n        seqObj = resCode\n        continue\n      } else if (typeof resCode === \"number\") { // Sequence finished. Write it.\n        dbcsCode = resCode\n      } else if (resCode == undefined) { // Current character is not part of the sequence.\n        // Try default character for this sequence\n        resCode = seqObj[DEF_CHAR]\n        if (resCode !== undefined) {\n          dbcsCode = resCode // Found. Write it.\n          nextChar = uCode // Current character will be written too in the next iteration.\n        } else {\n          // TODO: What if we have no default? (resCode == undefined)\n          // Then, we should write first char of the sequence as-is and try the rest recursively.\n          // Didn't do it for now because no encoding has this situation yet.\n          // Currently, just skip the sequence and write current char.\n        }\n      }\n      seqObj = undefined\n    } else if (uCode >= 0) {  // Regular character\n      var subtable = this.encodeTable[uCode >> 8]\n      if (subtable !== undefined) { dbcsCode = subtable[uCode & 0xFF] }\n\n      if (dbcsCode <= SEQ_START) { // Sequence start\n        seqObj = this.encodeTableSeq[SEQ_START - dbcsCode]\n        continue\n      }\n\n      if (dbcsCode == UNASSIGNED && this.gb18030) {\n        // Use GB18030 algorithm to find character(s) to write.\n        var idx = findIdx(this.gb18030.uChars, uCode)\n        if (idx != -1) {\n          var dbcsCode = this.gb18030.gbChars[idx] + (uCode - this.gb18030.uChars[idx])\n          newBuf[j++] = 0x81 + Math.floor(dbcsCode / 12600); dbcsCode = dbcsCode % 12600\n          newBuf[j++] = 0x30 + Math.floor(dbcsCode / 1260); dbcsCode = dbcsCode % 1260\n          newBuf[j++] = 0x81 + Math.floor(dbcsCode / 10); dbcsCode = dbcsCode % 10\n          newBuf[j++] = 0x30 + dbcsCode\n          continue\n        }\n      }\n    }\n\n    // 3. Write dbcsCode character.\n    if (dbcsCode === UNASSIGNED) { dbcsCode = this.defaultCharSingleByte }\n\n    if (dbcsCode < 0x100) {\n      newBuf[j++] = dbcsCode\n    } else if (dbcsCode < 0x10000) {\n      newBuf[j++] = dbcsCode >> 8   // high byte\n      newBuf[j++] = dbcsCode & 0xFF // low byte\n    } else if (dbcsCode < 0x1000000) {\n      newBuf[j++] = dbcsCode >> 16\n      newBuf[j++] = (dbcsCode >> 8) & 0xFF\n      newBuf[j++] = dbcsCode & 0xFF\n    } else {\n      newBuf[j++] = dbcsCode >>> 24\n      newBuf[j++] = (dbcsCode >>> 16) & 0xFF\n      newBuf[j++] = (dbcsCode >>> 8) & 0xFF\n      newBuf[j++] = dbcsCode & 0xFF\n    }\n  }\n\n  this.seqObj = seqObj\n  this.leadSurrogate = leadSurrogate\n  return newBuf.slice(0, j)\n}\n\nDBCSEncoder.prototype.end = function () {\n  if (this.leadSurrogate === -1 && this.seqObj === undefined) { return } // All clean. Most often case.\n\n  var newBuf = Buffer.alloc(10); var j = 0\n\n  if (this.seqObj) { // We're in the sequence.\n    var dbcsCode = this.seqObj[DEF_CHAR]\n    if (dbcsCode !== undefined) { // Write beginning of the sequence.\n      if (dbcsCode < 0x100) {\n        newBuf[j++] = dbcsCode\n      } else {\n        newBuf[j++] = dbcsCode >> 8   // high byte\n        newBuf[j++] = dbcsCode & 0xFF // low byte\n      }\n    } else {\n      // See todo above.\n    }\n    this.seqObj = undefined\n  }\n\n  if (this.leadSurrogate !== -1) {\n    // Incomplete surrogate pair - only lead surrogate found.\n    newBuf[j++] = this.defaultCharSingleByte\n    this.leadSurrogate = -1\n  }\n\n  return newBuf.slice(0, j)\n}\n\n// Export for testing\nDBCSEncoder.prototype.findIdx = findIdx\n\n// == Decoder ==================================================================\n\nfunction DBCSDecoder (options, codec) {\n  // Decoder state\n  this.nodeIdx = 0\n  this.prevBytes = []\n\n  // Static data\n  this.decodeTables = codec.decodeTables\n  this.decodeTableSeq = codec.decodeTableSeq\n  this.defaultCharUnicode = codec.defaultCharUnicode\n  this.gb18030 = codec.gb18030\n}\n\nDBCSDecoder.prototype.write = function (buf) {\n  var newBuf = Buffer.alloc(buf.length * 2)\n  var nodeIdx = this.nodeIdx\n  var prevBytes = this.prevBytes; var prevOffset = this.prevBytes.length\n  var seqStart = -this.prevBytes.length // idx of the start of current parsed sequence.\n  var uCode\n\n  for (var i = 0, j = 0; i < buf.length; i++) {\n    var curByte = (i >= 0) ? buf[i] : prevBytes[i + prevOffset]\n\n    // Lookup in current trie node.\n    var uCode = this.decodeTables[nodeIdx][curByte]\n\n    if (uCode >= 0) {\n      // Normal character, just use it.\n    } else if (uCode === UNASSIGNED) { // Unknown char.\n      // TODO: Callback with seq.\n      uCode = this.defaultCharUnicode.charCodeAt(0)\n      i = seqStart // Skip one byte ('i' will be incremented by the for loop) and try to parse again.\n    } else if (uCode === GB18030_CODE) {\n      if (i >= 3) {\n        var ptr = (buf[i - 3] - 0x81) * 12600 + (buf[i - 2] - 0x30) * 1260 + (buf[i - 1] - 0x81) * 10 + (curByte - 0x30)\n      } else {\n        var ptr = (prevBytes[i - 3 + prevOffset] - 0x81) * 12600 +\n                          (((i - 2 >= 0) ? buf[i - 2] : prevBytes[i - 2 + prevOffset]) - 0x30) * 1260 +\n                          (((i - 1 >= 0) ? buf[i - 1] : prevBytes[i - 1 + prevOffset]) - 0x81) * 10 +\n                          (curByte - 0x30)\n      }\n      var idx = findIdx(this.gb18030.gbChars, ptr)\n      uCode = this.gb18030.uChars[idx] + ptr - this.gb18030.gbChars[idx]\n    } else if (uCode <= NODE_START) { // Go to next trie node.\n      nodeIdx = NODE_START - uCode\n      continue\n    } else if (uCode <= SEQ_START) { // Output a sequence of chars.\n      var seq = this.decodeTableSeq[SEQ_START - uCode]\n      for (var k = 0; k < seq.length - 1; k++) {\n        uCode = seq[k]\n        newBuf[j++] = uCode & 0xFF\n        newBuf[j++] = uCode >> 8\n      }\n      uCode = seq[seq.length - 1]\n    } else { throw new Error(\"iconv-lite internal error: invalid decoding table value \" + uCode + \" at \" + nodeIdx + \"/\" + curByte) }\n\n    // Write the character to buffer, handling higher planes using surrogate pair.\n    if (uCode >= 0x10000) {\n      uCode -= 0x10000\n      var uCodeLead = 0xD800 | (uCode >> 10)\n      newBuf[j++] = uCodeLead & 0xFF\n      newBuf[j++] = uCodeLead >> 8\n\n      uCode = 0xDC00 | (uCode & 0x3FF)\n    }\n    newBuf[j++] = uCode & 0xFF\n    newBuf[j++] = uCode >> 8\n\n    // Reset trie node.\n    nodeIdx = 0; seqStart = i + 1\n  }\n\n  this.nodeIdx = nodeIdx\n  this.prevBytes = (seqStart >= 0)\n    ? Array.prototype.slice.call(buf, seqStart)\n    : prevBytes.slice(seqStart + prevOffset).concat(Array.prototype.slice.call(buf))\n\n  return newBuf.slice(0, j).toString(\"ucs2\")\n}\n\nDBCSDecoder.prototype.end = function () {\n  var ret = \"\"\n\n  // Try to parse all remaining chars.\n  while (this.prevBytes.length > 0) {\n    // Skip 1 character in the buffer.\n    ret += this.defaultCharUnicode\n    var bytesArr = this.prevBytes.slice(1)\n\n    // Parse remaining as usual.\n    this.prevBytes = []\n    this.nodeIdx = 0\n    if (bytesArr.length > 0) { ret += this.write(bytesArr) }\n  }\n\n  this.prevBytes = []\n  this.nodeIdx = 0\n  return ret\n}\n\n// Binary search for GB18030. Returns largest i such that table[i] <= val.\nfunction findIdx (table, val) {\n  if (table[0] > val) { return -1 }\n\n  var l = 0; var r = table.length\n  while (l < r - 1) { // always table[l] <= val < table[r]\n    var mid = l + ((r - l + 1) >> 1)\n    if (table[mid] <= val) { l = mid } else { r = mid }\n  }\n  return l\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CACA,IAAI,yBAAiC;AAMrC,SAAQ,QAAQ;CAEhB,IAAI,aAAa;CACjB,IAAI,eAAe;CACnB,IAAI,YAAY;CAChB,IAAI,aAAa;CACjB,IAAI,kBAAkB,IAAI,MAAM,IAAM;CACtC,IAAI,WAAW;AAEf,MAAK,IAAI,IAAI,GAAG,IAAI,KAAO,IAAO,iBAAgB,KAAK;CAGvD,SAAS,UAAW,cAAc,OAAO;AACvC,OAAK,eAAe,aAAa;AACjC,MAAI,CAAC,aAAgB,OAAM,IAAI,MAAM,yCAAyC;AAC9E,MAAI,CAAC,aAAa,MAAS,OAAM,IAAI,MAAM,eAAe,KAAK,eAAe,iBAAiB;EAG/F,IAAI,eAAe,aAAa,OAAO;AAWvC,OAAK,eAAe,EAAE;AACtB,OAAK,aAAa,KAAK,gBAAgB,MAAM,EAAE;AAG/C,OAAK,iBAAiB,EAAE;AAGxB,OAAK,IAAIA,MAAI,GAAGA,MAAI,aAAa,QAAQ,MAAO,MAAK,gBAAgB,aAAaA,KAAG;AAGrF,MAAI,OAAO,aAAa,YAAY,YAAY;AAC9C,QAAK,UAAU,aAAa,SAAS;GAGrC,IAAI,yBAAyB,KAAK,aAAa;AAC/C,QAAK,aAAa,KAAK,gBAAgB,MAAM,EAAE,CAAC;GAEhD,IAAI,0BAA0B,KAAK,aAAa;AAChD,QAAK,aAAa,KAAK,gBAAgB,MAAM,EAAE,CAAC;GAGhD,IAAI,gBAAgB,KAAK,aAAa;AACtC,QAAK,IAAIA,MAAI,KAAMA,OAAK,KAAM,OAAK;IACjC,IAAI,iBAAiB,KAAK,aAAa,aAAa,cAAcA;AAClE,SAAK,IAAI,IAAI,IAAM,KAAK,IAAM,KAAK;AACjC,SAAI,eAAe,OAAO,WACxB,gBAAe,KAAK,aAAa;cACxB,eAAe,KAAK,WAC7B,OAAM,IAAI,MAAM,2CAA2C;KAG7D,IAAI,gBAAgB,KAAK,aAAa,aAAa,eAAe;AAClE,UAAK,IAAI,IAAI,KAAM,KAAK,KAAM,KAAK;AACjC,UAAI,cAAc,OAAO,WACvB,eAAc,KAAK,aAAa;eACvB,cAAc,OAAO,aAAa,wBAC3C;eACS,cAAc,KAAK,WAC5B,OAAM,IAAI,MAAM,2CAA2C;MAG7D,IAAI,iBAAiB,KAAK,aAAa,aAAa,cAAc;AAClE,WAAK,IAAI,IAAI,IAAM,KAAK,IAAM,IAC5B,KAAI,eAAe,OAAO,WAAc,gBAAe,KAAK;;;;;AAOtE,OAAK,qBAAqB,MAAM;AAShC,OAAK,cAAc,EAAE;AAMrB,OAAK,iBAAiB,EAAE;EAGxB,IAAI,kBAAkB,EAAE;AACxB,MAAI,aAAa,eACf,MAAK,IAAIA,MAAI,GAAGA,MAAI,aAAa,eAAe,QAAQ,OAAK;GAC3D,IAAI,MAAM,aAAa,eAAeA;AACtC,OAAI,OAAO,QAAQ,SAAY,iBAAgB,OAAO;OACpD,MAAK,IAAI,IAAI,IAAI,MAAM,KAAK,IAAI,IAAI,IAAO,iBAAgB,KAAK;;AAMtE,OAAK,iBAAiB,GAAG,GAAG,gBAAgB;AAG5C,MAAI,aAAa,WACf;QAAK,IAAI,SAAS,aAAa,UAC7B,KAAI,OAAO,UAAU,eAAe,KAAK,aAAa,WAAW,MAAM,CAAI,MAAK,eAAe,MAAM,WAAW,EAAE,EAAE,aAAa,UAAU,OAAO;;AAItJ,OAAK,YAAY,KAAK,YAAY,GAAG,MAAM,sBAAsB,WAAW,EAAE;AAC9E,MAAI,KAAK,cAAc,WAAY,MAAK,YAAY,KAAK,YAAY,GAAG;AACxE,MAAI,KAAK,cAAc,WAAY,MAAK,YAAY,IAAI,WAAW,EAAE;;AAGvE,WAAU,UAAU,UAAU;AAC9B,WAAU,UAAU,UAAU;AAG9B,WAAU,UAAU,qBAAqB,SAAU,MAAM;EACvD,IAAI,QAAQ,EAAE;AACd,SAAO,OAAO,GAAG,UAAU,EAAK,OAAM,KAAK,OAAO,IAAK;AACvD,MAAI,MAAM,UAAU,EAAK,OAAM,KAAK,EAAE;EAEtC,IAAI,OAAO,KAAK,aAAa;AAC7B,OAAK,IAAIA,MAAI,MAAM,SAAS,GAAGA,MAAI,GAAG,OAAK;GACzC,IAAI,MAAM,KAAK,MAAMA;AAErB,OAAI,OAAO,YAAY;AACrB,SAAK,MAAMA,QAAM,aAAa,KAAK,aAAa;AAChD,SAAK,aAAa,KAAK,OAAO,gBAAgB,MAAM,EAAE,CAAC;cAC9C,OAAO,WAChB,QAAO,KAAK,aAAa,aAAa;OAC/B,OAAM,IAAI,MAAM,uBAAuB,KAAK,eAAe,aAAa,KAAK,SAAS,GAAG,CAAC;;AAErG,SAAO;;AAGT,WAAU,UAAU,kBAAkB,SAAU,OAAO;EAErD,IAAI,UAAU,SAAS,MAAM,IAAI,GAAG;EAGpC,IAAI,aAAa,KAAK,mBAAmB,QAAQ;AACjD,YAAU,UAAU;AAGpB,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,IAAI,OAAO,MAAM;AACjB,OAAI,OAAO,SAAS,SAClB,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS;IAChC,IAAI,OAAO,KAAK,WAAW,IAAI;AAC/B,QAAI,QAAQ,SAAU,OAAO,OAAQ;KACnC,IAAI,YAAY,KAAK,WAAW,IAAI;AACpC,SAAI,aAAa,SAAU,YAAY,MAAU,YAAW,aAAa,SAAW,OAAO,SAAU,QAAS,YAAY;SAAiB,OAAM,IAAI,MAAM,iCAAiC,KAAK,eAAe,eAAe,MAAM,GAAG;eAC/N,OAAO,QAAU,QAAQ,MAAQ;KAC1C,IAAI,MAAM,OAAQ,OAAO;KACzB,IAAI,MAAM,EAAE;AACZ,UAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAO,KAAI,KAAK,KAAK,WAAW,IAAI,CAAC;AAE9D,gBAAW,aAAa,YAAY,KAAK,eAAe;AACxD,UAAK,eAAe,KAAK,IAAI;UACtB,YAAW,aAAa;;YAE1B,OAAO,SAAS,UAAU;IACnC,IAAI,WAAW,WAAW,UAAU,KAAK;AACzC,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,IAAO,YAAW,aAAa;SAClD,OAAM,IAAI,MAAM,qBAAqB,OAAO,OAAO,gBAAgB,KAAK,eAAe,eAAe,MAAM,GAAG;;AAE1H,MAAI,UAAU,IAAQ,OAAM,IAAI,MAAM,wBAAwB,KAAK,eAAe,cAAc,MAAM,KAAK,eAAe,QAAQ;;AAIpI,WAAU,UAAU,mBAAmB,SAAU,OAAO;EACtD,IAAI,OAAO,SAAS;AACpB,MAAI,KAAK,YAAY,UAAU,OAC7B,MAAK,YAAY,QAAQ,gBAAgB,MAAM,EAAE;AAEnD,SAAO,KAAK,YAAY;;AAG1B,WAAU,UAAU,iBAAiB,SAAU,OAAO,UAAU;EAC9D,IAAI,SAAS,KAAK,iBAAiB,MAAM;EACzC,IAAI,MAAM,QAAQ;AAClB,MAAI,OAAO,QAAQ,UAAa,MAAK,eAAe,YAAY,OAAO,MAAM,YAAY;WAChF,OAAO,QAAQ,WAAc,QAAO,OAAO;;AAGtD,WAAU,UAAU,qBAAqB,SAAU,KAAK,UAAU;EAEhE,IAAI,QAAQ,IAAI;EAChB,IAAI,SAAS,KAAK,iBAAiB,MAAM;EACzC,IAAI,MAAM,QAAQ;EAElB,IAAI;AACJ,MAAI,OAAO,QAAQ,UAEjB,QAAO,KAAK,eAAe,YAAY,OAAO;OACzC;AAEL,UAAO,EAAE;AACT,OAAI,OAAO,SAAS,WAAY,MAAK,YAAY,OAAO;AACxD,UAAO,OAAO,YAAY,KAAK,eAAe;AAC9C,QAAK,eAAe,KAAK,KAAK;;AAIhC,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,SAAS,GAAG,KAAK;GACvC,IAAI,SAAS,KAAK;AAClB,OAAI,OAAO,WAAW,SAAY,QAAO;QAAc;AACrD,WAAO,KAAK,SAAS,EAAE;AACvB,QAAI,WAAW,OAAa,MAAK,YAAY;;;AAKjD,UAAQ,IAAI,IAAI,SAAS;AACzB,OAAK,SAAS;;AAGhB,WAAU,UAAU,mBAAmB,SAAU,SAAS,QAAQ,iBAAiB;EACjF,IAAI,OAAO,KAAK,aAAa;EAC7B,IAAI,YAAY;EAChB,IAAI,eAAe,EAAE;AACrB,OAAK,IAAIA,MAAI,GAAGA,MAAI,KAAO,OAAK;GAC9B,IAAI,QAAQ,KAAKA;GACjB,IAAI,SAAS,SAASA;AACtB,OAAI,gBAAgB,QAAW;AAE/B,OAAI,SAAS,GAAG;AACd,SAAK,eAAe,OAAO,OAAO;AAClC,gBAAY;cACH,SAAS,YAAY;IAC9B,IAAI,aAAa,aAAa;AAC9B,QAAI,CAAC,aAAa,aAAa;KAC7B,IAAI,YAAa,UAAU,MAAO;AAClC,SAAI,KAAK,iBAAiB,YAAY,WAAW,gBAAgB,CAAI,aAAY;SAAc,cAAa,cAAc;;cAEnH,SAAS,WAAW;AAC7B,SAAK,mBAAmB,KAAK,eAAe,YAAY,QAAQ,OAAO;AACvE,gBAAY;;;AAGhB,SAAO;;CAKT,SAAS,YAAa,SAAS,OAAO;AAEpC,OAAK,gBAAgB;AACrB,OAAK,SAAS;AAGd,OAAK,cAAc,MAAM;AACzB,OAAK,iBAAiB,MAAM;AAC5B,OAAK,wBAAwB,MAAM;AACnC,OAAK,UAAU,MAAM;;AAGvB,aAAY,UAAU,QAAQ,SAAU,KAAK;EAC3C,IAAI,SAAS,OAAO,MAAM,IAAI,UAAU,KAAK,UAAU,IAAI,GAAG;EAC9D,IAAI,gBAAgB,KAAK;EACzB,IAAI,SAAS,KAAK;EAClB,IAAI,WAAW;EACf,IAAIA,MAAI;EAAG,IAAI,IAAI;AAEnB,SAAO,MAAM;AAEX,OAAI,aAAa,IAAI;AACnB,QAAIA,OAAK,IAAI,OAAQ;IACrB,IAAI,QAAQ,IAAI,WAAW,MAAI;UAC1B;IACL,IAAI,QAAQ;AACZ,eAAW;;AAIb,OAAI,SAAS,SAAU,QAAQ,MAC7B,KAAI,QAAQ,MACV,KAAI,kBAAkB,IAAI;AACxB,oBAAgB;AAChB;UACK;AACL,oBAAgB;AAEhB,YAAQ;;YAGN,kBAAkB,IAAI;AACxB,YAAQ,SAAW,gBAAgB,SAAU,QAAS,QAAQ;AAC9D,oBAAgB;SAGhB,SAAQ;YAGH,kBAAkB,IAAI;AAE/B,eAAW;AAAO,YAAQ;AAC1B,oBAAgB;;GAIlB,IAAI,WAAW;AACf,OAAI,WAAW,UAAa,SAAS,YAAY;IAC/C,IAAI,UAAU,OAAO;AACrB,QAAI,OAAO,YAAY,UAAU;AAC/B,cAAS;AACT;eACS,OAAO,YAAY,SAC5B,YAAW;aACF,WAAW,QAAW;AAE/B,eAAU,OAAO;AACjB,SAAI,YAAY,QAAW;AACzB,iBAAW;AACX,iBAAW;;;AAQf,aAAS;cACA,SAAS,GAAG;IACrB,IAAI,WAAW,KAAK,YAAY,SAAS;AACzC,QAAI,aAAa,OAAa,YAAW,SAAS,QAAQ;AAE1D,QAAI,YAAY,WAAW;AACzB,cAAS,KAAK,eAAe,YAAY;AACzC;;AAGF,QAAI,YAAY,cAAc,KAAK,SAAS;KAE1C,IAAI,MAAM,QAAQ,KAAK,QAAQ,QAAQ,MAAM;AAC7C,SAAI,OAAO,IAAI;MACb,IAAI,WAAW,KAAK,QAAQ,QAAQ,QAAQ,QAAQ,KAAK,QAAQ,OAAO;AACxE,aAAO,OAAO,MAAO,KAAK,MAAM,WAAW,MAAM;AAAE,iBAAW,WAAW;AACzE,aAAO,OAAO,KAAO,KAAK,MAAM,WAAW,KAAK;AAAE,iBAAW,WAAW;AACxE,aAAO,OAAO,MAAO,KAAK,MAAM,WAAW,GAAG;AAAE,iBAAW,WAAW;AACtE,aAAO,OAAO,KAAO;AACrB;;;;AAMN,OAAI,aAAa,WAAc,YAAW,KAAK;AAE/C,OAAI,WAAW,IACb,QAAO,OAAO;YACL,WAAW,OAAS;AAC7B,WAAO,OAAO,YAAY;AAC1B,WAAO,OAAO,WAAW;cAChB,WAAW,UAAW;AAC/B,WAAO,OAAO,YAAY;AAC1B,WAAO,OAAQ,YAAY,IAAK;AAChC,WAAO,OAAO,WAAW;UACpB;AACL,WAAO,OAAO,aAAa;AAC3B,WAAO,OAAQ,aAAa,KAAM;AAClC,WAAO,OAAQ,aAAa,IAAK;AACjC,WAAO,OAAO,WAAW;;;AAI7B,OAAK,SAAS;AACd,OAAK,gBAAgB;AACrB,SAAO,OAAO,MAAM,GAAG,EAAE;;AAG3B,aAAY,UAAU,MAAM,WAAY;AACtC,MAAI,KAAK,kBAAkB,MAAM,KAAK,WAAW,OAAa;EAE9D,IAAI,SAAS,OAAO,MAAM,GAAG;EAAE,IAAI,IAAI;AAEvC,MAAI,KAAK,QAAQ;GACf,IAAI,WAAW,KAAK,OAAO;AAC3B,OAAI,aAAa,OACf,KAAI,WAAW,IACb,QAAO,OAAO;QACT;AACL,WAAO,OAAO,YAAY;AAC1B,WAAO,OAAO,WAAW;;AAK7B,QAAK,SAAS;;AAGhB,MAAI,KAAK,kBAAkB,IAAI;AAE7B,UAAO,OAAO,KAAK;AACnB,QAAK,gBAAgB;;AAGvB,SAAO,OAAO,MAAM,GAAG,EAAE;;AAI3B,aAAY,UAAU,UAAU;CAIhC,SAAS,YAAa,SAAS,OAAO;AAEpC,OAAK,UAAU;AACf,OAAK,YAAY,EAAE;AAGnB,OAAK,eAAe,MAAM;AAC1B,OAAK,iBAAiB,MAAM;AAC5B,OAAK,qBAAqB,MAAM;AAChC,OAAK,UAAU,MAAM;;AAGvB,aAAY,UAAU,QAAQ,SAAU,KAAK;EAC3C,IAAI,SAAS,OAAO,MAAM,IAAI,SAAS,EAAE;EACzC,IAAI,UAAU,KAAK;EACnB,IAAI,YAAY,KAAK;EAAW,IAAI,aAAa,KAAK,UAAU;EAChE,IAAI,WAAW,CAAC,KAAK,UAAU;EAC/B,IAAI;AAEJ,OAAK,IAAIA,MAAI,GAAG,IAAI,GAAGA,MAAI,IAAI,QAAQ,OAAK;GAC1C,IAAI,UAAWA,OAAK,IAAK,IAAIA,OAAK,UAAUA,MAAI;GAGhD,IAAI,QAAQ,KAAK,aAAa,SAAS;AAEvC,OAAI,SAAS,GAAG,YAEL,UAAU,YAAY;AAE/B,YAAQ,KAAK,mBAAmB,WAAW,EAAE;AAC7C,UAAI;cACK,UAAU,cAAc;AACjC,QAAIA,OAAK,GACP,IAAI,OAAO,IAAIA,MAAI,KAAK,OAAQ,SAAS,IAAIA,MAAI,KAAK,MAAQ,QAAQ,IAAIA,MAAI,KAAK,OAAQ,MAAM,UAAU;SAE3G,IAAI,OAAO,UAAUA,MAAI,IAAI,cAAc,OAAQ,UAC9BA,MAAI,KAAK,IAAK,IAAIA,MAAI,KAAK,UAAUA,MAAI,IAAI,eAAe,MAAQ,SACpEA,MAAI,KAAK,IAAK,IAAIA,MAAI,KAAK,UAAUA,MAAI,IAAI,eAAe,OAAQ,MACtE,UAAU;IAE/B,IAAI,MAAM,QAAQ,KAAK,QAAQ,SAAS,IAAI;AAC5C,YAAQ,KAAK,QAAQ,OAAO,OAAO,MAAM,KAAK,QAAQ,QAAQ;cACrD,SAAS,YAAY;AAC9B,cAAU,aAAa;AACvB;cACS,SAAS,WAAW;IAC7B,IAAI,MAAM,KAAK,eAAe,YAAY;AAC1C,SAAK,IAAI,IAAI,GAAG,IAAI,IAAI,SAAS,GAAG,KAAK;AACvC,aAAQ,IAAI;AACZ,YAAO,OAAO,QAAQ;AACtB,YAAO,OAAO,SAAS;;AAEzB,YAAQ,IAAI,IAAI,SAAS;SAClB,OAAM,IAAI,MAAM,6DAA6D,QAAQ,SAAS,UAAU,MAAM,QAAQ;AAG/H,OAAI,SAAS,OAAS;AACpB,aAAS;IACT,IAAI,YAAY,QAAU,SAAS;AACnC,WAAO,OAAO,YAAY;AAC1B,WAAO,OAAO,aAAa;AAE3B,YAAQ,QAAU,QAAQ;;AAE5B,UAAO,OAAO,QAAQ;AACtB,UAAO,OAAO,SAAS;AAGvB,aAAU;AAAG,cAAWA,MAAI;;AAG9B,OAAK,UAAU;AACf,OAAK,YAAa,YAAY,IAC1B,MAAM,UAAU,MAAM,KAAK,KAAK,SAAS,GACzC,UAAU,MAAM,WAAW,WAAW,CAAC,OAAO,MAAM,UAAU,MAAM,KAAK,IAAI,CAAC;AAElF,SAAO,OAAO,MAAM,GAAG,EAAE,CAAC,SAAS,OAAO;;AAG5C,aAAY,UAAU,MAAM,WAAY;EACtC,IAAI,MAAM;AAGV,SAAO,KAAK,UAAU,SAAS,GAAG;AAEhC,UAAO,KAAK;GACZ,IAAI,WAAW,KAAK,UAAU,MAAM,EAAE;AAGtC,QAAK,YAAY,EAAE;AACnB,QAAK,UAAU;AACf,OAAI,SAAS,SAAS,EAAK,QAAO,KAAK,MAAM,SAAS;;AAGxD,OAAK,YAAY,EAAE;AACnB,OAAK,UAAU;AACf,SAAO;;CAIT,SAAS,QAAS,OAAO,KAAK;AAC5B,MAAI,MAAM,KAAK,IAAO,QAAO;EAE7B,IAAI,IAAI;EAAG,IAAI,IAAI,MAAM;AACzB,SAAO,IAAI,IAAI,GAAG;GAChB,IAAI,MAAM,KAAM,IAAI,IAAI,KAAM;AAC9B,OAAI,MAAM,QAAQ,IAAO,KAAI;OAAa,KAAI;;AAEhD,SAAO"}

package/dist/node/node_modules/.pnpm/iconv-lite@0.7.1/node_modules/iconv-lite/encodings/dbcs-data.js

@@ -0,0 +1,195 @@
+import { __commonJS } from "../../../../../../_virtual/rolldown_runtime.js";
+import { require_shiftjis } from "./tables/shiftjis.js";
+import { require_eucjp } from "./tables/eucjp.js";
+import { require_cp936 } from "./tables/cp936.js";
+import { require_gbk_added } from "./tables/gbk-added.js";
+import { require_gb18030_ranges } from "./tables/gb18030-ranges.js";
+import { require_cp949 } from "./tables/cp949.js";
+import { require_cp950 } from "./tables/cp950.js";
+import { require_big5_added } from "./tables/big5-added.js";
+
+//#region ../../node_modules/.pnpm/iconv-lite@0.7.1/node_modules/iconv-lite/encodings/dbcs-data.js
+var require_dbcs_data = /* @__PURE__ */ __commonJS({ "../../node_modules/.pnpm/iconv-lite@0.7.1/node_modules/iconv-lite/encodings/dbcs-data.js": ((exports, module) => {
+	module.exports = {
+		shiftjis: {
+			type: "_dbcs",
+			table: function() {
+				return require_shiftjis();
+			},
+			encodeAdd: {
+				"¥": 92,
+				"‾": 126
+			},
+			encodeSkipVals: [{
+				from: 60736,
+				to: 63808
+			}]
+		},
+		csshiftjis: "shiftjis",
+		mskanji: "shiftjis",
+		sjis: "shiftjis",
+		windows31j: "shiftjis",
+		ms31j: "shiftjis",
+		xsjis: "shiftjis",
+		windows932: "shiftjis",
+		ms932: "shiftjis",
+		932: "shiftjis",
+		cp932: "shiftjis",
+		eucjp: {
+			type: "_dbcs",
+			table: function() {
+				return require_eucjp();
+			},
+			encodeAdd: {
+				"¥": 92,
+				"‾": 126
+			}
+		},
+		gb2312: "cp936",
+		gb231280: "cp936",
+		gb23121980: "cp936",
+		csgb2312: "cp936",
+		csiso58gb231280: "cp936",
+		euccn: "cp936",
+		windows936: "cp936",
+		ms936: "cp936",
+		936: "cp936",
+		cp936: {
+			type: "_dbcs",
+			table: function() {
+				return require_cp936();
+			}
+		},
+		gbk: {
+			type: "_dbcs",
+			table: function() {
+				return require_cp936().concat(require_gbk_added());
+			}
+		},
+		xgbk: "gbk",
+		isoir58: "gbk",
+		gb18030: {
+			type: "_dbcs",
+			table: function() {
+				return require_cp936().concat(require_gbk_added());
+			},
+			gb18030: function() {
+				return require_gb18030_ranges();
+			},
+			encodeSkipVals: [128],
+			encodeAdd: { "€": 41699 }
+		},
+		chinese: "gb18030",
+		windows949: "cp949",
+		ms949: "cp949",
+		949: "cp949",
+		cp949: {
+			type: "_dbcs",
+			table: function() {
+				return require_cp949();
+			}
+		},
+		cseuckr: "cp949",
+		csksc56011987: "cp949",
+		euckr: "cp949",
+		isoir149: "cp949",
+		korean: "cp949",
+		ksc56011987: "cp949",
+		ksc56011989: "cp949",
+		ksc5601: "cp949",
+		windows950: "cp950",
+		ms950: "cp950",
+		950: "cp950",
+		cp950: {
+			type: "_dbcs",
+			table: function() {
+				return require_cp950();
+			}
+		},
+		big5: "big5hkscs",
+		big5hkscs: {
+			type: "_dbcs",
+			table: function() {
+				return require_cp950().concat(require_big5_added());
+			},
+			encodeSkipVals: [
+				36457,
+				36463,
+				36478,
+				36523,
+				36532,
+				36557,
+				36560,
+				36695,
+				36713,
+				36718,
+				36811,
+				36862,
+				36973,
+				36986,
+				37060,
+				37084,
+				37105,
+				37311,
+				37551,
+				37552,
+				37553,
+				37554,
+				37585,
+				37959,
+				38090,
+				38361,
+				38652,
+				39285,
+				39798,
+				39800,
+				39803,
+				39878,
+				39902,
+				39916,
+				39926,
+				40002,
+				40019,
+				40034,
+				40040,
+				40043,
+				40055,
+				40124,
+				40125,
+				40144,
+				40279,
+				40282,
+				40388,
+				40431,
+				40443,
+				40617,
+				40687,
+				40701,
+				40800,
+				40907,
+				41079,
+				41180,
+				41183,
+				36812,
+				37576,
+				38468,
+				38637,
+				41636,
+				41637,
+				41639,
+				41638,
+				41676,
+				41678
+			]
+		},
+		cnbig5: "big5hkscs",
+		csbig5: "big5hkscs",
+		xxbig5: "big5hkscs"
+	};
+}) });
+
+//#endregion
+export default require_dbcs_data();
+
+export { require_dbcs_data };
+//# sourceMappingURL=dbcs-data.js.map

package/dist/node/node_modules/.pnpm/iconv-lite@0.7.1/node_modules/iconv-lite/encodings/dbcs-data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dbcs-data.js","names":[],"sources":["../../../../../../../../../../node_modules/.pnpm/iconv-lite@0.7.1/node_modules/iconv-lite/encodings/dbcs-data.js"],"sourcesContent":["\"use strict\"\n\n// Description of supported double byte encodings and aliases.\n// Tables are not require()-d until they are needed to speed up library load.\n// require()-s are direct to support Browserify.\n\nmodule.exports = {\n\n  // == Japanese/ShiftJIS ====================================================\n  // All japanese encodings are based on JIS X set of standards:\n  // JIS X 0201 - Single-byte encoding of ASCII + ¥ + Kana chars at 0xA1-0xDF.\n  // JIS X 0208 - Main set of 6879 characters, placed in 94x94 plane, to be encoded by 2 bytes.\n  //              Has several variations in 1978, 1983, 1990 and 1997.\n  // JIS X 0212 - Supplementary plane of 6067 chars in 94x94 plane. 1990. Effectively dead.\n  // JIS X 0213 - Extension and modern replacement of 0208 and 0212. Total chars: 11233.\n  //              2 planes, first is superset of 0208, second - revised 0212.\n  //              Introduced in 2000, revised 2004. Some characters are in Unicode Plane 2 (0x2xxxx)\n\n  // Byte encodings are:\n  //  * Shift_JIS: Compatible with 0201, uses not defined chars in top half as lead bytes for double-byte\n  //               encoding of 0208. Lead byte ranges: 0x81-0x9F, 0xE0-0xEF; Trail byte ranges: 0x40-0x7E, 0x80-0x9E, 0x9F-0xFC.\n  //               Windows CP932 is a superset of Shift_JIS. Some companies added more chars, notably KDDI.\n  //  * EUC-JP:    Up to 3 bytes per character. Used mostly on *nixes.\n  //               0x00-0x7F       - lower part of 0201\n  //               0x8E, 0xA1-0xDF - upper part of 0201\n  //               (0xA1-0xFE)x2   - 0208 plane (94x94).\n  //               0x8F, (0xA1-0xFE)x2 - 0212 plane (94x94).\n  //  * JIS X 208: 7-bit, direct encoding of 0208. Byte ranges: 0x21-0x7E (94 values). Uncommon.\n  //               Used as-is in ISO2022 family.\n  //  * ISO2022-JP: Stateful encoding, with escape sequences to switch between ASCII,\n  //                0201-1976 Roman, 0208-1978, 0208-1983.\n  //  * ISO2022-JP-1: Adds esc seq for 0212-1990.\n  //  * ISO2022-JP-2: Adds esc seq for GB2313-1980, KSX1001-1992, ISO8859-1, ISO8859-7.\n  //  * ISO2022-JP-3: Adds esc seq for 0201-1976 Kana set, 0213-2000 Planes 1, 2.\n  //  * ISO2022-JP-2004: Adds 0213-2004 Plane 1.\n  //\n  // After JIS X 0213 appeared, Shift_JIS-2004, EUC-JISX0213 and ISO2022-JP-2004 followed, with just changing the planes.\n  //\n  // Overall, it seems that it's a mess :( http://www8.plala.or.jp/tkubota1/unicode-symbols-map2.html\n\n  shiftjis: {\n    type: \"_dbcs\",\n    table: function () { return require(\"./tables/shiftjis.json\") },\n    encodeAdd: { \"\\u00a5\": 0x5C, \"\\u203E\": 0x7E },\n    encodeSkipVals: [{ from: 0xED40, to: 0xF940 }]\n  },\n  csshiftjis: \"shiftjis\",\n  mskanji: \"shiftjis\",\n  sjis: \"shiftjis\",\n  windows31j: \"shiftjis\",\n  ms31j: \"shiftjis\",\n  xsjis: \"shiftjis\",\n  windows932: \"shiftjis\",\n  ms932: \"shiftjis\",\n  932: \"shiftjis\",\n  cp932: \"shiftjis\",\n\n  eucjp: {\n    type: \"_dbcs\",\n    table: function () { return require(\"./tables/eucjp.json\") },\n    encodeAdd: { \"\\u00a5\": 0x5C, \"\\u203E\": 0x7E }\n  },\n\n  // TODO: KDDI extension to Shift_JIS\n  // TODO: IBM CCSID 942 = CP932, but F0-F9 custom chars and other char changes.\n  // TODO: IBM CCSID 943 = Shift_JIS = CP932 with original Shift_JIS lower 128 chars.\n\n  // == Chinese/GBK ==========================================================\n  // http://en.wikipedia.org/wiki/GBK\n  // We mostly implement W3C recommendation: https://www.w3.org/TR/encoding/#gbk-encoder\n\n  // Oldest GB2312 (1981, ~7600 chars) is a subset of CP936\n  gb2312: \"cp936\",\n  gb231280: \"cp936\",\n  gb23121980: \"cp936\",\n  csgb2312: \"cp936\",\n  csiso58gb231280: \"cp936\",\n  euccn: \"cp936\",\n\n  // Microsoft's CP936 is a subset and approximation of GBK.\n  windows936: \"cp936\",\n  ms936: \"cp936\",\n  936: \"cp936\",\n  cp936: {\n    type: \"_dbcs\",\n    table: function () { return require(\"./tables/cp936.json\") }\n  },\n\n  // GBK (~22000 chars) is an extension of CP936 that added user-mapped chars and some other.\n  gbk: {\n    type: \"_dbcs\",\n    table: function () { return require(\"./tables/cp936.json\").concat(require(\"./tables/gbk-added.json\")) }\n  },\n  xgbk: \"gbk\",\n  isoir58: \"gbk\",\n\n  // GB18030 is an algorithmic extension of GBK.\n  // Main source: https://www.w3.org/TR/encoding/#gbk-encoder\n  // http://icu-project.org/docs/papers/gb18030.html\n  // http://source.icu-project.org/repos/icu/data/trunk/charset/data/xml/gb-18030-2000.xml\n  // http://www.khngai.com/chinese/charmap/tblgbk.php?page=0\n  gb18030: {\n    type: \"_dbcs\",\n    table: function () { return require(\"./tables/cp936.json\").concat(require(\"./tables/gbk-added.json\")) },\n    gb18030: function () { return require(\"./tables/gb18030-ranges.json\") },\n    encodeSkipVals: [0x80],\n    encodeAdd: { \"€\": 0xA2E3 }\n  },\n\n  chinese: \"gb18030\",\n\n  // == Korean ===============================================================\n  // EUC-KR, KS_C_5601 and KS X 1001 are exactly the same.\n  windows949: \"cp949\",\n  ms949: \"cp949\",\n  949: \"cp949\",\n  cp949: {\n    type: \"_dbcs\",\n    table: function () { return require(\"./tables/cp949.json\") }\n  },\n\n  cseuckr: \"cp949\",\n  csksc56011987: \"cp949\",\n  euckr: \"cp949\",\n  isoir149: \"cp949\",\n  korean: \"cp949\",\n  ksc56011987: \"cp949\",\n  ksc56011989: \"cp949\",\n  ksc5601: \"cp949\",\n\n  // == Big5/Taiwan/Hong Kong ================================================\n  // There are lots of tables for Big5 and cp950. Please see the following links for history:\n  // http://moztw.org/docs/big5/  http://www.haible.de/bruno/charsets/conversion-tables/Big5.html\n  // Variations, in roughly number of defined chars:\n  //  * Windows CP 950: Microsoft variant of Big5. Canonical: http://www.unicode.org/Public/MAPPINGS/VENDORS/MICSFT/WINDOWS/CP950.TXT\n  //  * Windows CP 951: Microsoft variant of Big5-HKSCS-2001. Seems to be never public. http://me.abelcheung.org/articles/research/what-is-cp951/\n  //  * Big5-2003 (Taiwan standard) almost superset of cp950.\n  //  * Unicode-at-on (UAO) / Mozilla 1.8. Falling out of use on the Web. Not supported by other browsers.\n  //  * Big5-HKSCS (-2001, -2004, -2008). Hong Kong standard.\n  //    many unicode code points moved from PUA to Supplementary plane (U+2XXXX) over the years.\n  //    Plus, it has 4 combining sequences.\n  //    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\n  //    because big5-hkscs is the only encoding to include astral characters in non-algorithmic way.\n  //    Implementations are not consistent within browsers; sometimes labeled as just big5.\n  //    MS Internet Explorer switches from big5 to big5-hkscs when a patch applied.\n  //    Great discussion & recap of what's going on https://bugzilla.mozilla.org/show_bug.cgi?id=912470#c31\n  //    In the encoder, it might make sense to support encoding old PUA mappings to Big5 bytes seq-s.\n  //    Official spec: http://www.ogcio.gov.hk/en/business/tech_promotion/ccli/terms/doc/2003cmp_2008.txt\n  //                   http://www.ogcio.gov.hk/tc/business/tech_promotion/ccli/terms/doc/hkscs-2008-big5-iso.txt\n  //\n  // Current understanding of how to deal with Big5(-HKSCS) is in the Encoding Standard, http://encoding.spec.whatwg.org/#big5-encoder\n  // Unicode mapping (http://www.unicode.org/Public/MAPPINGS/OBSOLETE/EASTASIA/OTHER/BIG5.TXT) is said to be wrong.\n\n  windows950: \"cp950\",\n  ms950: \"cp950\",\n  950: \"cp950\",\n  cp950: {\n    type: \"_dbcs\",\n    table: function () { return require(\"./tables/cp950.json\") }\n  },\n\n  // Big5 has many variations and is an extension of cp950. We use Encoding Standard's as a consensus.\n  big5: \"big5hkscs\",\n  big5hkscs: {\n    type: \"_dbcs\",\n    table: function () { return require(\"./tables/cp950.json\").concat(require(\"./tables/big5-added.json\")) },\n    encodeSkipVals: [\n      // Although Encoding Standard says we should avoid encoding to HKSCS area (See Step 1 of\n      // https://encoding.spec.whatwg.org/#index-big5-pointer), we still do it to increase compatibility with ICU.\n      // But if a single unicode point can be encoded both as HKSCS and regular Big5, we prefer the latter.\n      0x8e69, 0x8e6f, 0x8e7e, 0x8eab, 0x8eb4, 0x8ecd, 0x8ed0, 0x8f57, 0x8f69, 0x8f6e, 0x8fcb, 0x8ffe,\n      0x906d, 0x907a, 0x90c4, 0x90dc, 0x90f1, 0x91bf, 0x92af, 0x92b0, 0x92b1, 0x92b2, 0x92d1, 0x9447, 0x94ca,\n      0x95d9, 0x96fc, 0x9975, 0x9b76, 0x9b78, 0x9b7b, 0x9bc6, 0x9bde, 0x9bec, 0x9bf6, 0x9c42, 0x9c53, 0x9c62,\n      0x9c68, 0x9c6b, 0x9c77, 0x9cbc, 0x9cbd, 0x9cd0, 0x9d57, 0x9d5a, 0x9dc4, 0x9def, 0x9dfb, 0x9ea9, 0x9eef,\n      0x9efd, 0x9f60, 0x9fcb, 0xa077, 0xa0dc, 0xa0df, 0x8fcc, 0x92c8, 0x9644, 0x96ed,\n\n      // Step 2 of https://encoding.spec.whatwg.org/#index-big5-pointer: Use last pointer for U+2550, U+255E, U+2561, U+256A, U+5341, or U+5345\n      0xa2a4, 0xa2a5, 0xa2a7, 0xa2a6, 0xa2cc, 0xa2ce\n    ]\n  },\n\n  cnbig5: \"big5hkscs\",\n  csbig5: \"big5hkscs\",\n  xxbig5: \"big5hkscs\"\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;AAMA,QAAO,UAAU;EAkCf,UAAU;GACR,MAAM;GACN,OAAO,WAAY;AAAE;;GACrB,WAAW;IAAE,KAAU;IAAM,KAAU;IAAM;GAC7C,gBAAgB,CAAC;IAAE,MAAM;IAAQ,IAAI;IAAQ,CAAC;GAC/C;EACD,YAAY;EACZ,SAAS;EACT,MAAM;EACN,YAAY;EACZ,OAAO;EACP,OAAO;EACP,YAAY;EACZ,OAAO;EACP,KAAK;EACL,OAAO;EAEP,OAAO;GACL,MAAM;GACN,OAAO,WAAY;AAAE;;GACrB,WAAW;IAAE,KAAU;IAAM,KAAU;IAAM;GAC9C;EAWD,QAAQ;EACR,UAAU;EACV,YAAY;EACZ,UAAU;EACV,iBAAiB;EACjB,OAAO;EAGP,YAAY;EACZ,OAAO;EACP,KAAK;EACL,OAAO;GACL,MAAM;GACN,OAAO,WAAY;AAAE;;GACtB;EAGD,KAAK;GACH,MAAM;GACN,OAAO,WAAY;AAAE,2BAAsC,2BAA0C;;GACtG;EACD,MAAM;EACN,SAAS;EAOT,SAAS;GACP,MAAM;GACN,OAAO,WAAY;AAAE,2BAAsC,2BAA0C;;GACrG,SAAS,WAAY;AAAE;;GACvB,gBAAgB,CAAC,IAAK;GACtB,WAAW,EAAE,KAAK,OAAQ;GAC3B;EAED,SAAS;EAIT,YAAY;EACZ,OAAO;EACP,KAAK;EACL,OAAO;GACL,MAAM;GACN,OAAO,WAAY;AAAE;;GACtB;EAED,SAAS;EACT,eAAe;EACf,OAAO;EACP,UAAU;EACV,QAAQ;EACR,aAAa;EACb,aAAa;EACb,SAAS;EAyBT,YAAY;EACZ,OAAO;EACP,KAAK;EACL,OAAO;GACL,MAAM;GACN,OAAO,WAAY;AAAE;;GACtB;EAGD,MAAM;EACN,WAAW;GACT,MAAM;GACN,OAAO,WAAY;AAAE,2BAAsC,4BAA2C;;GACtG,gBAAgB;IAId;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IACxF;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAChG;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAChG;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAChG;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IAGxE;IAAQ;IAAQ;IAAQ;IAAQ;IAAQ;IACzC;GACF;EAED,QAAQ;EACR,QAAQ;EACR,QAAQ;EACT"}