cputils.js 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521
  1. /* cputils.js (C) 2013-present SheetJS -- http://sheetjs.com */
  2. /* vim: set ft=javascript: */
  3. /*jshint newcap: false */
  4. (function(root, factory) {
  5. /*jshint ignore:start */
  6. /*eslint-disable */
  7. "use strict";
  8. if(typeof cptable === "undefined") {
  9. if(typeof require !== "undefined"){
  10. var cpt = require('./cptable');
  11. if (typeof module !== 'undefined' && module.exports && typeof DO_NOT_EXPORT_CODEPAGE === 'undefined') module.exports = factory(cpt);
  12. else root.cptable = factory(cpt);
  13. } else throw new Error("cptable not found");
  14. } else cptable = factory(cptable);
  15. /*eslint-enable */
  16. /*jshint ignore:end */
  17. }(this, function(cpt){
  18. "use strict";
  19. /*global module, Buffer */
  20. var magic = {
  21. "1200":"utf16le",
  22. "1201":"utf16be",
  23. "12000":"utf32le",
  24. "12001":"utf32be",
  25. "16969":"utf64le",
  26. "20127":"ascii",
  27. "65000":"utf7",
  28. "65001":"utf8"
  29. };
  30. var sbcs_cache = [874,1250,1251,1252,1253,1254,1255,1256,10000];
  31. var dbcs_cache = [932,936,949,950];
  32. var magic_cache = [65001];
  33. var magic_decode = {};
  34. var magic_encode = {};
  35. var cpdcache = {};
  36. var cpecache = {};
  37. var sfcc = function sfcc(x) { return String.fromCharCode(x); };
  38. var cca = function cca(x) { return x.charCodeAt(0); };
  39. var has_buf = (typeof Buffer !== 'undefined');
  40. if(has_buf) {
  41. var mdl = 1024, mdb = new Buffer(mdl);
  42. var make_EE = function make_EE(E){
  43. var EE = new Buffer(65536);
  44. for(var i = 0; i < 65536;++i) EE[i] = 0;
  45. var keys = Object.keys(E), len = keys.length;
  46. for(var ee = 0, e = keys[ee]; ee < len; ++ee) {
  47. if(!(e = keys[ee])) continue;
  48. EE[e.charCodeAt(0)] = E[e];
  49. }
  50. return EE;
  51. };
  52. var sbcs_encode = function make_sbcs_encode(cp) {
  53. var EE = make_EE(cpt[cp].enc);
  54. return function sbcs_e(data, ofmt) {
  55. var len = data.length;
  56. var out, i=0, j=0, D=0, w=0;
  57. if(typeof data === 'string') {
  58. out = new Buffer(len);
  59. for(i = 0; i < len; ++i) out[i] = EE[data.charCodeAt(i)];
  60. } else if(Buffer.isBuffer(data)) {
  61. out = new Buffer(2*len);
  62. j = 0;
  63. for(i = 0; i < len; ++i) {
  64. D = data[i];
  65. if(D < 128) out[j++] = EE[D];
  66. else if(D < 224) { out[j++] = EE[((D&31)<<6)+(data[i+1]&63)]; ++i; }
  67. else if(D < 240) { out[j++] = EE[((D&15)<<12)+((data[i+1]&63)<<6)+(data[i+2]&63)]; i+=2; }
  68. else {
  69. w = ((D&7)<<18)+((data[i+1]&63)<<12)+((data[i+2]&63)<<6)+(data[i+3]&63); i+=3;
  70. if(w < 65536) out[j++] = EE[w];
  71. else { w -= 65536; out[j++] = EE[0xD800 + ((w>>10)&1023)]; out[j++] = EE[0xDC00 + (w&1023)]; }
  72. }
  73. }
  74. out = out.slice(0,j);
  75. } else {
  76. out = new Buffer(len);
  77. for(i = 0; i < len; ++i) out[i] = EE[data[i].charCodeAt(0)];
  78. }
  79. if(!ofmt || ofmt === 'buf') return out;
  80. if(ofmt !== 'arr') return out.toString('binary');
  81. return [].slice.call(out);
  82. };
  83. };
  84. var sbcs_decode = function make_sbcs_decode(cp) {
  85. var D = cpt[cp].dec;
  86. var DD = new Buffer(131072), d=0, c="";
  87. for(d=0;d<D.length;++d) {
  88. if(!(c=D[d])) continue;
  89. var w = c.charCodeAt(0);
  90. DD[2*d] = w&255; DD[2*d+1] = w>>8;
  91. }
  92. return function sbcs_d(data) {
  93. var len = data.length, i=0, j=0;
  94. if(2 * len > mdl) { mdl = 2 * len; mdb = new Buffer(mdl); }
  95. if(Buffer.isBuffer(data)) {
  96. for(i = 0; i < len; i++) {
  97. j = 2*data[i];
  98. mdb[2*i] = DD[j]; mdb[2*i+1] = DD[j+1];
  99. }
  100. } else if(typeof data === "string") {
  101. for(i = 0; i < len; i++) {
  102. j = 2*data.charCodeAt(i);
  103. mdb[2*i] = DD[j]; mdb[2*i+1] = DD[j+1];
  104. }
  105. } else {
  106. for(i = 0; i < len; i++) {
  107. j = 2*data[i];
  108. mdb[2*i] = DD[j]; mdb[2*i+1] = DD[j+1];
  109. }
  110. }
  111. return mdb.slice(0, 2 * len).toString('ucs2');
  112. };
  113. };
  114. var dbcs_encode = function make_dbcs_encode(cp) {
  115. var E = cpt[cp].enc;
  116. var EE = new Buffer(131072);
  117. for(var i = 0; i < 131072; ++i) EE[i] = 0;
  118. var keys = Object.keys(E);
  119. for(var ee = 0, e = keys[ee]; ee < keys.length; ++ee) {
  120. if(!(e = keys[ee])) continue;
  121. var f = e.charCodeAt(0);
  122. EE[2*f] = E[e] & 255; EE[2*f+1] = E[e]>>8;
  123. }
  124. return function dbcs_e(data, ofmt) {
  125. var len = data.length, out = new Buffer(2*len), i=0, j=0, jj=0, k=0, D=0;
  126. if(typeof data === 'string') {
  127. for(i = k = 0; i < len; ++i) {
  128. j = data.charCodeAt(i)*2;
  129. out[k++] = EE[j+1] || EE[j]; if(EE[j+1] > 0) out[k++] = EE[j];
  130. }
  131. out = out.slice(0,k);
  132. } else if(Buffer.isBuffer(data)) {
  133. for(i = k = 0; i < len; ++i) {
  134. D = data[i];
  135. if(D < 128) j = D;
  136. else if(D < 224) { j = ((D&31)<<6)+(data[i+1]&63); ++i; }
  137. else if(D < 240) { j = ((D&15)<<12)+((data[i+1]&63)<<6)+(data[i+2]&63); i+=2; }
  138. else { j = ((D&7)<<18)+((data[i+1]&63)<<12)+((data[i+2]&63)<<6)+(data[i+3]&63); i+=3; }
  139. if(j<65536) { j*=2; out[k++] = EE[j+1] || EE[j]; if(EE[j+1] > 0) out[k++] = EE[j]; }
  140. else { jj = j-65536;
  141. j=2*(0xD800 + ((jj>>10)&1023)); out[k++] = EE[j+1] || EE[j]; if(EE[j+1] > 0) out[k++] = EE[j];
  142. j=2*(0xDC00 + (jj&1023)); out[k++] = EE[j+1] || EE[j]; if(EE[j+1] > 0) out[k++] = EE[j];
  143. }
  144. }
  145. out = out.slice(0,k);
  146. } else {
  147. for(i = k = 0; i < len; i++) {
  148. j = data[i].charCodeAt(0)*2;
  149. out[k++] = EE[j+1] || EE[j]; if(EE[j+1] > 0) out[k++] = EE[j];
  150. }
  151. }
  152. if(!ofmt || ofmt === 'buf') return out;
  153. if(ofmt !== 'arr') return out.toString('binary');
  154. return [].slice.call(out);
  155. };
  156. };
  157. var dbcs_decode = function make_dbcs_decode(cp) {
  158. var D = cpt[cp].dec;
  159. var DD = new Buffer(131072), d=0, c, w=0, j=0, i=0;
  160. for(i = 0; i < 65536; ++i) { DD[2*i] = 0xFF; DD[2*i+1] = 0xFD;}
  161. for(d = 0; d < D.length; ++d) {
  162. if(!(c=D[d])) continue;
  163. w = c.charCodeAt(0);
  164. j = 2*d;
  165. DD[j] = w&255; DD[j+1] = w>>8;
  166. }
  167. return function dbcs_d(data) {
  168. var len = data.length, out = new Buffer(2*len), i=0, j=0, k=0;
  169. if(Buffer.isBuffer(data)) {
  170. for(i = 0; i < len; i++) {
  171. j = 2*data[i];
  172. if(DD[j]===0xFF && DD[j+1]===0xFD) { j=2*((data[i]<<8)+data[i+1]); ++i; }
  173. out[k++] = DD[j]; out[k++] = DD[j+1];
  174. }
  175. } else if(typeof data === "string") {
  176. for(i = 0; i < len; i++) {
  177. j = 2*data.charCodeAt(i);
  178. if(DD[j]===0xFF && DD[j+1]===0xFD) { j=2*((data.charCodeAt(i)<<8)+data.charCodeAt(i+1)); ++i; }
  179. out[k++] = DD[j]; out[k++] = DD[j+1];
  180. }
  181. } else {
  182. for(i = 0; i < len; i++) {
  183. j = 2*data[i];
  184. if(DD[j]===0xFF && DD[j+1]===0xFD) { j=2*((data[i]<<8)+data[i+1]); ++i; }
  185. out[k++] = DD[j]; out[k++] = DD[j+1];
  186. }
  187. }
  188. return out.slice(0,k).toString('ucs2');
  189. };
  190. };
  191. magic_decode[65001] = function utf8_d(data) {
  192. if(typeof data === "string") return utf8_d(data.split("").map(cca));
  193. var len = data.length, w = 0, ww = 0;
  194. if(4 * len > mdl) { mdl = 4 * len; mdb = new Buffer(mdl); }
  195. var i = 0;
  196. if(len >= 3 && data[0] == 0xEF) if(data[1] == 0xBB && data[2] == 0xBF) i = 3;
  197. for(var j = 1, k = 0, D = 0; i < len; i+=j) {
  198. j = 1; D = data[i];
  199. if(D < 128) w = D;
  200. else if(D < 224) { w=(D&31)*64+(data[i+1]&63); j=2; }
  201. else if(D < 240) { w=((D&15)<<12)+(data[i+1]&63)*64+(data[i+2]&63); j=3; }
  202. else { w=(D&7)*262144+((data[i+1]&63)<<12)+(data[i+2]&63)*64+(data[i+3]&63); j=4; }
  203. if(w < 65536) { mdb[k++] = w&255; mdb[k++] = w>>8; }
  204. else {
  205. w -= 65536; ww = 0xD800 + ((w>>10)&1023); w = 0xDC00 + (w&1023);
  206. mdb[k++] = ww&255; mdb[k++] = ww>>>8; mdb[k++] = w&255; mdb[k++] = (w>>>8)&255;
  207. }
  208. }
  209. return mdb.slice(0,k).toString('ucs2');
  210. };
  211. magic_encode[65001] = function utf8_e(data, ofmt) {
  212. if(has_buf && Buffer.isBuffer(data)) {
  213. if(!ofmt || ofmt === 'buf') return data;
  214. if(ofmt !== 'arr') return data.toString('binary');
  215. return [].slice.call(data);
  216. }
  217. var len = data.length, w = 0, ww = 0, j = 0;
  218. var direct = typeof data === "string";
  219. if(4 * len > mdl) { mdl = 4 * len; mdb = new Buffer(mdl); }
  220. for(var i = 0; i < len; ++i) {
  221. w = direct ? data.charCodeAt(i) : data[i].charCodeAt(0);
  222. if(w <= 0x007F) mdb[j++] = w;
  223. else if(w <= 0x07FF) {
  224. mdb[j++] = 192 + (w >> 6);
  225. mdb[j++] = 128 + (w&63);
  226. } else if(w >= 0xD800 && w <= 0xDFFF) {
  227. w -= 0xD800; ++i;
  228. ww = (direct ? data.charCodeAt(i) : data[i].charCodeAt(0)) - 0xDC00 + (w << 10);
  229. mdb[j++] = 240 + ((ww>>>18) & 0x07);
  230. mdb[j++] = 144 + ((ww>>>12) & 0x3F);
  231. mdb[j++] = 128 + ((ww>>>6) & 0x3F);
  232. mdb[j++] = 128 + (ww & 0x3F);
  233. } else {
  234. mdb[j++] = 224 + (w >> 12);
  235. mdb[j++] = 128 + ((w >> 6)&63);
  236. mdb[j++] = 128 + (w&63);
  237. }
  238. }
  239. if(!ofmt || ofmt === 'buf') return mdb.slice(0,j);
  240. if(ofmt !== 'arr') return mdb.slice(0,j).toString('binary');
  241. return [].slice.call(mdb, 0, j);
  242. };
  243. }
  244. var encache = function encache() {
  245. if(has_buf) {
  246. if(cpdcache[sbcs_cache[0]]) return;
  247. var i=0, s=0;
  248. for(i = 0; i < sbcs_cache.length; ++i) {
  249. s = sbcs_cache[i];
  250. if(cpt[s]) {
  251. cpdcache[s] = sbcs_decode(s);
  252. cpecache[s] = sbcs_encode(s);
  253. }
  254. }
  255. for(i = 0; i < dbcs_cache.length; ++i) {
  256. s = dbcs_cache[i];
  257. if(cpt[s]) {
  258. cpdcache[s] = dbcs_decode(s);
  259. cpecache[s] = dbcs_encode(s);
  260. }
  261. }
  262. for(i = 0; i < magic_cache.length; ++i) {
  263. s = magic_cache[i];
  264. if(magic_decode[s]) cpdcache[s] = magic_decode[s];
  265. if(magic_encode[s]) cpecache[s] = magic_encode[s];
  266. }
  267. }
  268. };
  269. var null_enc = function(data, ofmt) { void ofmt; return ""; };
  270. var cp_decache = function cp_decache(cp) { delete cpdcache[cp]; delete cpecache[cp]; };
  271. var decache = function decache() {
  272. if(has_buf) {
  273. if(!cpdcache[sbcs_cache[0]]) return;
  274. sbcs_cache.forEach(cp_decache);
  275. dbcs_cache.forEach(cp_decache);
  276. magic_cache.forEach(cp_decache);
  277. }
  278. last_enc = null_enc; last_cp = 0;
  279. };
  280. var cache = {
  281. encache: encache,
  282. decache: decache,
  283. sbcs: sbcs_cache,
  284. dbcs: dbcs_cache
  285. };
  286. encache();
  287. var BM = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
  288. var SetD = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'(),-./:?";
  289. var last_enc = null_enc, last_cp = 0;
  290. var encode = function encode(cp, data, ofmt) {
  291. if(cp === last_cp && last_enc) { return last_enc(data, ofmt); }
  292. if(cpecache[cp]) { last_enc = cpecache[last_cp=cp]; return last_enc(data, ofmt); }
  293. if(has_buf && Buffer.isBuffer(data)) data = data.toString('utf8');
  294. var len = data.length;
  295. var out = has_buf ? new Buffer(4*len) : [], w=0, i=0, j = 0, ww=0;
  296. var C = cpt[cp], E, M = "";
  297. var isstr = typeof data === 'string';
  298. if(C && (E=C.enc)) for(i = 0; i < len; ++i, ++j) {
  299. w = E[isstr? data.charAt(i) : data[i]];
  300. if(w > 255) {
  301. out[j] = w>>8;
  302. out[++j] = w&255;
  303. } else out[j] = w&255;
  304. }
  305. else if((M=magic[cp])) switch(M) {
  306. case "utf8":
  307. if(has_buf && isstr) { out = new Buffer(data, M); j = out.length; break; }
  308. for(i = 0; i < len; ++i, ++j) {
  309. w = isstr ? data.charCodeAt(i) : data[i].charCodeAt(0);
  310. if(w <= 0x007F) out[j] = w;
  311. else if(w <= 0x07FF) {
  312. out[j] = 192 + (w >> 6);
  313. out[++j] = 128 + (w&63);
  314. } else if(w >= 0xD800 && w <= 0xDFFF) {
  315. w -= 0xD800;
  316. ww = (isstr ? data.charCodeAt(++i) : data[++i].charCodeAt(0)) - 0xDC00 + (w << 10);
  317. out[j] = 240 + ((ww>>>18) & 0x07);
  318. out[++j] = 144 + ((ww>>>12) & 0x3F);
  319. out[++j] = 128 + ((ww>>>6) & 0x3F);
  320. out[++j] = 128 + (ww & 0x3F);
  321. } else {
  322. out[j] = 224 + (w >> 12);
  323. out[++j] = 128 + ((w >> 6)&63);
  324. out[++j] = 128 + (w&63);
  325. }
  326. }
  327. break;
  328. case "ascii":
  329. if(has_buf && typeof data === "string") { out = new Buffer(data, M); j = out.length; break; }
  330. for(i = 0; i < len; ++i, ++j) {
  331. w = isstr ? data.charCodeAt(i) : data[i].charCodeAt(0);
  332. if(w <= 0x007F) out[j] = w;
  333. else throw new Error("bad ascii " + w);
  334. }
  335. break;
  336. case "utf16le":
  337. if(has_buf && typeof data === "string") { out = new Buffer(data, M); j = out.length; break; }
  338. for(i = 0; i < len; ++i) {
  339. w = isstr ? data.charCodeAt(i) : data[i].charCodeAt(0);
  340. out[j++] = w&255;
  341. out[j++] = w>>8;
  342. }
  343. break;
  344. case "utf16be":
  345. for(i = 0; i < len; ++i) {
  346. w = isstr ? data.charCodeAt(i) : data[i].charCodeAt(0);
  347. out[j++] = w>>8;
  348. out[j++] = w&255;
  349. }
  350. break;
  351. case "utf32le":
  352. for(i = 0; i < len; ++i) {
  353. w = isstr ? data.charCodeAt(i) : data[i].charCodeAt(0);
  354. if(w >= 0xD800 && w <= 0xDFFF) w = 0x10000 + ((w - 0xD800) << 10) + (data[++i].charCodeAt(0) - 0xDC00);
  355. out[j++] = w&255; w >>= 8;
  356. out[j++] = w&255; w >>= 8;
  357. out[j++] = w&255; w >>= 8;
  358. out[j++] = w&255;
  359. }
  360. break;
  361. case "utf32be":
  362. for(i = 0; i < len; ++i) {
  363. w = isstr ? data.charCodeAt(i) : data[i].charCodeAt(0);
  364. if(w >= 0xD800 && w <= 0xDFFF) w = 0x10000 + ((w - 0xD800) << 10) + (data[++i].charCodeAt(0) - 0xDC00);
  365. out[j+3] = w&255; w >>= 8;
  366. out[j+2] = w&255; w >>= 8;
  367. out[j+1] = w&255; w >>= 8;
  368. out[j] = w&255;
  369. j+=4;
  370. }
  371. break;
  372. case "utf7":
  373. for(i = 0; i < len; i++) {
  374. var c = isstr ? data.charAt(i) : data[i].charAt(0);
  375. if(c === "+") { out[j++] = 0x2b; out[j++] = 0x2d; continue; }
  376. if(SetD.indexOf(c) > -1) { out[j++] = c.charCodeAt(0); continue; }
  377. var tt = encode(1201, c);
  378. out[j++] = 0x2b;
  379. out[j++] = BM.charCodeAt(tt[0]>>2);
  380. out[j++] = BM.charCodeAt(((tt[0]&0x03)<<4) + ((tt[1]||0)>>4));
  381. out[j++] = BM.charCodeAt(((tt[1]&0x0F)<<2) + ((tt[2]||0)>>6));
  382. out[j++] = 0x2d;
  383. }
  384. break;
  385. default: throw new Error("Unsupported magic: " + cp + " " + magic[cp]);
  386. }
  387. else throw new Error("Unrecognized CP: " + cp);
  388. out = out.slice(0,j);
  389. if(!has_buf) return (ofmt == 'str') ? (out).map(sfcc).join("") : out;
  390. if(!ofmt || ofmt === 'buf') return out;
  391. if(ofmt !== 'arr') return out.toString('binary');
  392. return [].slice.call(out);
  393. };
  394. var decode = function decode(cp, data) {
  395. var F; if((F=cpdcache[cp])) return F(data);
  396. if(typeof data === "string") return decode(cp, data.split("").map(cca));
  397. var len = data.length, out = new Array(len), s="", w=0, i=0, j=1, k=0, ww=0;
  398. var C = cpt[cp], D, M="";
  399. if(C && (D=C.dec)) {
  400. for(i = 0; i < len; i+=j) {
  401. j = 2;
  402. s = D[(data[i]<<8)+ data[i+1]];
  403. if(!s) {
  404. j = 1;
  405. s = D[data[i]];
  406. }
  407. if(!s) throw new Error('Unrecognized code: ' + data[i] + ' ' + data[i+j-1] + ' ' + i + ' ' + j + ' ' + D[data[i]]);
  408. out[k++] = s;
  409. }
  410. }
  411. else if((M=magic[cp])) switch(M) {
  412. case "utf8":
  413. if(len >= 3 && data[0] == 0xEF) if(data[1] == 0xBB && data[2] == 0xBF) i = 3;
  414. for(; i < len; i+=j) {
  415. j = 1;
  416. if(data[i] < 128) w = data[i];
  417. else if(data[i] < 224) { w=(data[i]&31)*64+(data[i+1]&63); j=2; }
  418. else if(data[i] < 240) { w=((data[i]&15)<<12)+(data[i+1]&63)*64+(data[i+2]&63); j=3; }
  419. else { w=(data[i]&7)*262144+((data[i+1]&63)<<12)+(data[i+2]&63)*64+(data[i+3]&63); j=4; }
  420. if(w < 65536) { out[k++] = String.fromCharCode(w); }
  421. else {
  422. w -= 65536; ww = 0xD800 + ((w>>10)&1023); w = 0xDC00 + (w&1023);
  423. out[k++] = String.fromCharCode(ww); out[k++] = String.fromCharCode(w);
  424. }
  425. }
  426. break;
  427. case "ascii":
  428. if(has_buf && Buffer.isBuffer(data)) return data.toString(M);
  429. for(i = 0; i < len; i++) out[i] = String.fromCharCode(data[i]);
  430. k = len; break;
  431. case "utf16le":
  432. if(len >= 2 && data[0] == 0xFF) if(data[1] == 0xFE) i = 2;
  433. if(has_buf && Buffer.isBuffer(data)) return data.toString(M);
  434. j = 2;
  435. for(; i+1 < len; i+=j) {
  436. out[k++] = String.fromCharCode((data[i+1]<<8) + data[i]);
  437. }
  438. break;
  439. case "utf16be":
  440. if(len >= 2 && data[0] == 0xFE) if(data[1] == 0xFF) i = 2;
  441. j = 2;
  442. for(; i+1 < len; i+=j) {
  443. out[k++] = String.fromCharCode((data[i]<<8) + data[i+1]);
  444. }
  445. break;
  446. case "utf32le":
  447. if(len >= 4 && data[0] == 0xFF) if(data[1] == 0xFE && data[2] === 0 && data[3] === 0) i = 4;
  448. j = 4;
  449. for(; i < len; i+=j) {
  450. w = (data[i+3]<<24) + (data[i+2]<<16) + (data[i+1]<<8) + (data[i]);
  451. if(w > 0xFFFF) {
  452. w -= 0x10000;
  453. out[k++] = String.fromCharCode(0xD800 + ((w >> 10) & 0x3FF));
  454. out[k++] = String.fromCharCode(0xDC00 + (w & 0x3FF));
  455. }
  456. else out[k++] = String.fromCharCode(w);
  457. }
  458. break;
  459. case "utf32be":
  460. if(len >= 4 && data[3] == 0xFF) if(data[2] == 0xFE && data[1] === 0 && data[0] === 0) i = 4;
  461. j = 4;
  462. for(; i < len; i+=j) {
  463. w = (data[i]<<24) + (data[i+1]<<16) + (data[i+2]<<8) + (data[i+3]);
  464. if(w > 0xFFFF) {
  465. w -= 0x10000;
  466. out[k++] = String.fromCharCode(0xD800 + ((w >> 10) & 0x3FF));
  467. out[k++] = String.fromCharCode(0xDC00 + (w & 0x3FF));
  468. }
  469. else out[k++] = String.fromCharCode(w);
  470. }
  471. break;
  472. case "utf7":
  473. if(len >= 4 && data[0] == 0x2B && data[1] == 0x2F && data[2] == 0x76) {
  474. if(len >= 5 && data[3] == 0x38 && data[4] == 0x2D) i = 5;
  475. else if(data[3] == 0x38 || data[3] == 0x39 || data[3] == 0x2B || data[3] == 0x2F) i = 4;
  476. }
  477. for(; i < len; i+=j) {
  478. if(data[i] !== 0x2b) { j=1; out[k++] = String.fromCharCode(data[i]); continue; }
  479. j=1;
  480. if(data[i+1] === 0x2d) { j = 2; out[k++] = "+"; continue; }
  481. // eslint-disable-next-line no-useless-escape
  482. while(String.fromCharCode(data[i+j]).match(/[A-Za-z0-9+\/]/)) j++;
  483. var dash = 0;
  484. if(data[i+j] === 0x2d) { ++j; dash=1; }
  485. var tt = [];
  486. var o64 = "";
  487. var c1=0, c2=0, c3=0;
  488. var e1=0, e2=0, e3=0, e4=0;
  489. for(var l = 1; l < j - dash;) {
  490. e1 = BM.indexOf(String.fromCharCode(data[i+l++]));
  491. e2 = BM.indexOf(String.fromCharCode(data[i+l++]));
  492. c1 = e1 << 2 | e2 >> 4;
  493. tt.push(c1);
  494. e3 = BM.indexOf(String.fromCharCode(data[i+l++]));
  495. if(e3 === -1) break;
  496. c2 = (e2 & 15) << 4 | e3 >> 2;
  497. tt.push(c2);
  498. e4 = BM.indexOf(String.fromCharCode(data[i+l++]));
  499. if(e4 === -1) break;
  500. c3 = (e3 & 3) << 6 | e4;
  501. if(e4 < 64) tt.push(c3);
  502. }
  503. o64 = decode(1201, tt);
  504. for(l = 0; l < o64.length; ++l) out[k++] = o64.charAt(l);
  505. }
  506. break;
  507. default: throw new Error("Unsupported magic: " + cp + " " + magic[cp]);
  508. }
  509. else throw new Error("Unrecognized CP: " + cp);
  510. return out.slice(0,k).join("");
  511. };
  512. var hascp = function hascp(cp) { return !!(cpt[cp] || magic[cp]); };
  513. cpt.utils = { decode: decode, encode: encode, hascp: hascp, magic: magic, cache:cache };
  514. return cpt;
  515. }));