table2excel使用
原table2excel代码
/*
* 采用jquery模板插件——jQuery Boilerplate
*
* Made by QuJun
* 2017/01/10
*/
//table2excel.js
; (function ($, window, document, undefined) { var pluginName = "table2excel", rootPath = "http://" + window.location.host, currentElement = null , defaults = {
exclude: ".noExl", // 不导出excel 样式为.noExl(默认)
name: "Table2Excel",
islageruigrid: false, // 表格是否是ligerGrid
sheetName: "Sheet1",// sheetName
ligerui: {
isGetAll: false, // 是否获取ligerGrid全部数据(前提需配置isligerGrid:true) ,如果获取全部数据失败，则导出当前页表格数据
gridInstance:null // ligerGrid 对象 (如果为null,则获取当前页数据)
},
css: [ // css 样式
"/RefLib/css/ligerui_grid_export_excel.css"
],
}; // 构造函数
function Plugin(element, options) {
this.element = element;
// jQuery has an extend method which merges the contents of two or
// more objects, storing the result in the first object. The first object
// is generally empty as we don't want to alter the default options for
// future instances of the plugin
//
this.settings = $.extend({}, defaults, options);
this._defaults = defaults;
this._name = pluginName;
this.init();
} Plugin.prototype = {
init: function () {
var e = this; var utf8Heading = "<meta http-equiv=\"content-type\" content=\"application/vnd.ms-excel; charset=UTF-8\">"; e.template = {
head: "<html xmlns:o=\"urn:schemas-microsoft-com:office:office\" xmlns:x=\"urn:schemas-microsoft-com:office:excel\" xmlns=\"http://www.w3.org/TR/REC-html40\">" + utf8Heading + "<head><!--[if gte mso 9]><xml><x:ExcelWorkbook><x:ExcelWorksheets>",
sheet: {
head: "<x:ExcelWorksheet><x:Name>",
tail: "</x:Name><x:WorksheetOptions><x:DisplayGridlines/></x:WorksheetOptions></x:ExcelWorksheet>"
},
mid: "</x:ExcelWorksheets></x:ExcelWorkbook></xml><![endif]-->",
tail: "</head><body>",
table: {
head: "<table><tbody>",
tail: "</tbody></table>"
},
css: {
head: "<style>",
tail: "</style>"
},
foot: "</body></html>"
}; e.lagerui_template = { boby: {
head: "<table class = 'l-grid-table'>",
tail: "</table>",
}
}; e.tableRows = []; // 是否是lageruigrid 表格
if (e.settings.islageruigrid) {
// 是否获取全部数据
if (e.settings.ligerui.isGetAll) {
// lageruigrid 对象
var grid = e.settings.ligerui.gridInstance;
if (grid == null) {
e.gridToExcel();
} else {
grid.loadAllServerData(function (data) {
e.gridToExcelAll(grid, data);
}); } } else {
e.gridToExcel();
} } else {
// 导出当前节点下数据
$(e.element).children().each(function (i, o) {
var tempRows = ""; $(o).not(e.settings.exclude).each(function (i, o) {
tempRows += $(o).prop("outerHTML");
}); e.tableRows.push(tempRows);
}); e.tableToExcel(e.tableRows, e.settings.name, e.settings.sheetName);
} }, // 导出全部数据(ligerGrid)
gridToExcelAll: function (grid, data) {
var e = this; if (data == null) {
e.gridToExcel();
return;
} var g = $(e.element).parent().parent(); var title = $(g).find(".l-layout-header").text(); e.tableRows.push(e.lagerui_template.boby.head); var c = $(g).find(".l-grid2 .l-grid-header-table"); var columnCount = 0; $(c).find("tr").each(function (i, o) { var columns = ""; $(o).find("td:visible").each(function (i, o) { $(o).find("div").each(function (i, o) { columns += "<th>" + $(o).find("span").text() + "</th>"; }); columnCount++;
}); e.tableRows.push("<tr><th colspan = '" + (columnCount + 1) + "'>" + title + "</th></tr>"); e.tableRows.push("<tr>" + "<th></th>" + columns + "</tr>");
}); var cols = grid.getOptions().columns; var rows = data.Rows; for (var i = 0; i < rows.length; i++) { var info = ""; for (var j = 0; j < cols.length; j++) {
var h = cols[j].hide;
if (h) {
continue;
} var name = cols[j].name; var rowName = rows[i][name] == null ? "" : rows[i][name]; if (String(rowName).indexOf("/Date") != -1) {
rowName = e.ChangeDateFormat_Date(rowName);
} info += "<td>" + rowName + "</td>";
} e.tableRows.push("<tr>" + "<td>" + (i + 1) + "</td>" + info + "</tr>");
} e.tableToExcel(e.tableRows, e.settings.name, e.settings.sheetName); }, // 导出当前数据(ligerGrid)
gridToExcel: function () {
var e = this; var g = $(e.element).parent().parent(); var title = $(g).find(".l-layout-header").text(); e.tableRows.push(e.lagerui_template.boby.head); var c = $(g).find(".l-grid2 .l-grid-header-table"); var columnCount = 0; $(c).find("tr").each(function (i, o) { var columns = ""; $(o).find("td:visible").each(function (i, o) { $(o).find("div").each(function (i, o) { columns += "<th>" + $(o).find("span").text() + "</th>"; }); columnCount++;
}); e.tableRows.push("<tr><th colspan = '" + (columnCount + 1) + "'>" + title + "</th></tr>"); e.tableRows.push("<tr>" + "<th></th>" + columns + "</tr>");
}); var t = $(g).find(".l-grid2 .l-grid-body-table"); $(t).find("tr").each(function (i, o) { var info = ""; $(o).find("td:visible").each(function (i, o) { info += "<td>" + $(o).find("div").text() + "</td>";
}); e.tableRows.push("<tr>" + "<td>" + (i + 1) + "</td>" + info + "</tr>");
}); e.tableRows.push(e.lagerui_template.boby.tail); e.tableToExcel(e.tableRows, e.settings.name, e.settings.sheetName);
}, // 导出excel
tableToExcel: function (table, name, sheetName) {
var e = this, fullTemplate = "", i, link, a; e.uri = "data:application/vnd.ms-excel;base64,";
e.base64 = function (s) {
return window.btoa(unescape(encodeURIComponent(s)));
};
e.format = function (s, c) {
return s.replace(/{(\w+)}/g, function (m, p) {
return c[p];
});
}; sheetName = typeof sheetName === "undefined" ? "Sheet" : sheetName; e.ctx = {
worksheet: name || "Worksheet",
table: table,
sheetName: sheetName,
}; var fullTemplate = e.template.head; var css_boby = ""; var cssStyles = e.settings.css; // 添加css样式
if (cssStyles.length != 0) {
$.ajaxSettings.async = false;
css_boby = e.template.css.head;
for (var i = 0; i < cssStyles.length; i++) {
$.get(rootPath + cssStyles[i], function (result) {
css_boby += result;
});
}
css_boby += e.template.css.tail; $.ajaxSettings.async = true;//设置getJson异步
} //if ($.isArray(table)) {
// for (i in table) {
// //fullTemplate += e.template.sheet.head + "{worksheet" + i + "}" + e.template.sheet.tail;
// fullTemplate += e.template.sheet.head + sheetName + i + e.template.sheet.tail;
// }
//}
// 设置Excell sheet
fullTemplate += e.template.sheet.head + sheetName + e.template.sheet.tail; fullTemplate += e.template.mid + css_boby + e.template.tail; if ($.isArray(table)) {
for (i in table) {
//fullTemplate += e.template.table.head + "{table" + i + "}" + e.template.table.tail;
fullTemplate += "{table" + i + "}";
}
} fullTemplate += e.template.foot; for (i in table) {
e.ctx["table" + i] = table[i];
}
delete e.ctx.table; if ($.browser.msie || $.browser.version == "11.0") // If Internet Explorer
{
if (typeof Blob !== "undefined") {
// Must be replaced
for (var i in table) {
//var reg = eval("/{table[" + i + "]}/");
fullTemplate = fullTemplate.replace("{table" + i + "}", table[i]);
} //use blobs if we can
fullTemplate = [fullTemplate];
//convert to array
var blob1 = new Blob(fullTemplate, { type: "text/html" });
window.navigator.msSaveBlob(blob1, getFileName(e.settings));
} else { var iframe = e.AppendIframeToBoby();
iframeArea.document.open("text/html", "replace");
iframeArea.document.write(e.format(fullTemplate, e.ctx));
iframeArea.document.close();
//focus();
sa = iframeArea.document.execCommand("SaveAs", true, getFileName(e.settings));
} } else {
link = e.uri + e.base64(e.format(fullTemplate, e.ctx));
a = document.createElement("a");
a.download = getFileName(e.settings);
a.href = link; document.body.appendChild(a); a.click(); document.body.removeChild(a);
} return true;
}, // 添加iframe
AppendIframeToBoby: function () {
var iframe = document.createElement('iframe');
iframe.id = "iframeArea";
iframe.width = "200";
iframe.height = "200";
iframe.scrolling = "no";
iframe.frameBorder = "0";
iframe.style.display = "none";
document.body.appendChild(iframe);
return iframe;
}, ChangeDateFormat_Date: function (data) {
if (data != null) {
var date = new Date(parseInt(data.replace("/Date(", "").replace(")/", ""), 10));
var month = date.getMonth() + 1 < 10 ? "0" + (date.getMonth() + 1) : date.getMonth() + 1;
var currentDate = date.getDate() < 10 ? "0" + date.getDate() : date.getDate();
var dateStr = date.getFullYear() + "-" + month + "-" + currentDate;
if (dateStr == '1900-01-01') {
return "";
}
return dateStr;
}
return "";
}
}; function getFileName(settings) {
return (settings.filename ? settings.filename : "table2excel") +
(settings.fileext ? settings.fileext : ".xlsx");
} // 对构造函数的一个轻量级封装，
// 防止产生多个实例
$.fn[pluginName] = function (options) {
var e = this;
e.each(function () {
if (!$.data(e, "plugin_" + pluginName)) {
$.data(e, "plugin_" + pluginName, new Plugin(this, options));
}
}); // chain jQuery functions
return e;
}; })(jQuery, window, document);
原FileSaver.min代码
/*! @source http://purl.eligrey.com/github/FileSaver.js/blob/master/FileSaver.js */
var saveAs=saveAs||function(e){"use strict";if("undefined"==typeof navigator||!/MSIE [1-9]\./.test(navigator.userAgent)){var t=e.document,n=function(){return e.URL||e.webkitURL||e},o=t.createElementNS("http://www.w3.org/1999/xhtml","a"),r="download"in o,i=function(e){var t=new MouseEvent("click");e.dispatchEvent(t)},a=/Version\/[\d\.]+.*Safari/.test(navigator.userAgent),c=e.webkitRequestFileSystem,f=e.requestFileSystem||c||e.mozRequestFileSystem,u=function(t){(e.setImmediate||e.setTimeout)(function(){throw t},0)},d="application/octet-stream",s=0,l=4e4,v=function(e){var t=function(){"string"==typeof e?n().revokeObjectURL(e):e.remove()};setTimeout(t,l)},p=function(e,t,n){t=[].concat(t);for(var o=t.length;o--;){var r=e["on"+t[o]];if("function"==typeof r)try{r.call(e,n||e)}catch(i){u(i)}}},w=function(e){return/^\s*(?:text\/\S*|application\/xml|\S*\/\S*\+xml)\s*;.*charset\s*=\s*utf-8/i.test(e.type)?new Blob(["\ufeff",e],{type:e.type}):e},y=function(t,u,l){l||(t=w(t));var y,m,S,h=this,R=t.type,O=!1,g=function(){p(h,"writestart progress write writeend".split(" "))},b=function(){if(m&&a&&"undefined"!=typeof FileReader){var o=new FileReader;return o.onloadend=function(){var e=o.result;m.location.href="data:attachment/file"+e.slice(e.search(/[,;]/)),h.readyState=h.DONE,g()},o.readAsDataURL(t),void(h.readyState=h.INIT)}if((O||!y)&&(y=n().createObjectURL(t)),m)m.location.href=y;else{var r=e.open(y,"_blank");void 0===r&&a&&(e.location.href=y)}h.readyState=h.DONE,g(),v(y)},E=function(e){return function(){return h.readyState!==h.DONE?e.apply(this,arguments):void 0}},N={create:!0,exclusive:!1};return h.readyState=h.INIT,u||(u="download"),r?(y=n().createObjectURL(t),void setTimeout(function(){o.href=y,o.download=u,i(o),g(),v(y),h.readyState=h.DONE})):(e.chrome&&R&&R!==d&&(S=t.slice||t.webkitSlice,t=S.call(t,0,t.size,d),O=!0),c&&"download"!==u&&(u+=".download"),(R===d||c)&&(m=e),f?(s+=t.size,void f(e.TEMPORARY,s,E(function(e){e.root.getDirectory("saved",N,E(function(e){var n=function(){e.getFile(u,N,E(function(e){e.createWriter(E(function(n){n.onwriteend=function(t){m.location.href=e.toURL(),h.readyState=h.DONE,p(h,"writeend",t),v(e)},n.onerror=function(){var e=n.error;e.code!==e.ABORT_ERR&&b()},"writestart progress write abort".split(" ").forEach(function(e){n["on"+e]=h["on"+e]}),n.write(t),h.abort=function(){n.abort(),h.readyState=h.DONE},h.readyState=h.WRITING}),b)}),b)};e.getFile(u,{create:!1},E(function(e){e.remove(),n()}),E(function(e){e.code===e.NOT_FOUND_ERR?n():b()}))}),b)}),b)):void b())},m=y.prototype,S=function(e,t,n){return new y(e,t,n)};return"undefined"!=typeof navigator&&navigator.msSaveOrOpenBlob?function(e,t,n){return n||(e=w(e)),navigator.msSaveOrOpenBlob(e,t||"download")}:(m.abort=function(){var e=this;e.readyState=e.DONE,p(e,"abort")},m.readyState=m.INIT=0,m.WRITING=1,m.DONE=2,m.error=m.onwritestart=m.onprogress=m.onwrite=m.onabort=m.onerror=m.onwriteend=null,S)}}("undefined"!=typeof self&&self||"undefined"!=typeof window&&window||this.content);"undefined"!=typeof module&&module.exports?module.exports.saveAs=saveAs:"undefined"!=typeof define&&null!==define&&null!==define.amd&&define([],function(){return saveAs});
原tableexport代码
/*!
*
* tableexport.js
* tableExport() 导出excel
* 依赖 FileSaver.js(导出) , jszip.js(压缩) , xlsx.js(支持xlsx导出格式), table2excel.js(xls格式导出)
* xls格式, 默认加载ligerui_grid_export_excel.css 样式
* 2017/1/16 QuJun
*/ ; (function (window, undefined) { /*--- GLOBALS ---*/
var $ = window.jQuery; var settings; $.fn.tableExport = function (options) { var e = this; settings = $.extend({}, $.fn.tableExport.defaults, options),
rowD = $.fn.tableExport.rowDel,
// 该功能暂时不支持
ignoreRows = settings.ignoreRows instanceof Array ? settings.ignoreRows : [settings.ignoreRows],
ignoreCols = settings.ignoreCols instanceof Array ? settings.ignoreCols : [settings.ignoreCols]; var fileName = settings.fileName; var fileType = settings.fileType; // 不支持Blob 则使用 tableToExcel.js 导出excel 如果为xlsx格式 则改成xls格式
if (typeof Blob === "undefined") {
tableToExcel(e);
return;
} // xls格式 使用table2excel导出excel 需传入css样式
if (fileType == "xls") {
tableToExcel(e);
return;
} // 支持四种导出格式
exporters = {
xlsx: function (data, name) {
var mimeType = $.fn.tableExport.xlsx.mimeType,
fileExtension = $.fn.tableExport.xlsx.fileExtension;
export2file(data, mimeType, name, fileExtension, settings);
},
xls: function (data, name) { var mimeType = $.fn.tableExport.xls.mimeType,
fileExtension = $.fn.tableExport.xls.fileExtension;
export2file(getSeqData(data, $.fn.tableExport.xls.separator, $.fn.tableExport.rowDel), mimeType, name, fileExtension, settings);
},
csv: function (data, name) {
var mimeType = $.fn.tableExport.csv.mimeType,
fileExtension = $.fn.tableExport.csv.fileExtension;
export2file(getSeqData(data, $.fn.tableExport.csv.separator, $.fn.tableExport.rowDel), mimeType, name, fileExtension, settings);
},
txt: function (data, name) {
var mimeType = $.fn.tableExport.txt.mimeType,
fileExtension = $.fn.tableExport.txt.fileExtension;
export2file(getSeqData(data, $.fn.tableExport.txt.separator, $.fn.tableExport.rowDel), mimeType, name, fileExtension, settings);
}
} // 是否是lageruigrid 表格
if (settings.islageruigrid) {
// 是否获取全部数据
if (settings.ligerui.isGetAll) {
// lageruigrid 对象
var grid = settings.ligerui.gridInstance;
if (grid == null) {
exporters[fileType](ligerGridData(e), fileName);
} else {
//数据从前台传过来
if (settings.data != undefined && settings.data != null && settings.data != "") {
exporters[fileType](ligerGridAllData(e, grid, settings.data), fileName);
} else {
grid.loadAllServerData(function (data) {
exporters[fileType](ligerGridAllData(e, grid, data), fileName);
});
} } } else {
exporters[fileType](ligerGridData(e), fileName);
} } else {
// 导出当前节点下数据
exporters[fileType](getData(e), fileName);
} }; // Define the plugin default properties.
$.fn.tableExport.defaults = {
title: "",
exclude: ".noExl", // 不是xls格式： 只有加在table tr 或 td 上class 有效 xls格式;任意
fileType: "xlsx", // xls格式:导出使用table2excel.js (需传入css样式,否则无样式)
fileName: "Excel Document Name", // 文件名 同sheet名
islageruigrid: false, // 表格是否是ligerGrid (ligeruigrid 必须指定true,否则显示不正确)
ligerui: {
isGetAll: false, // 是否获取ligerGrid全部数据(前提需配置isligerGrid:true) ,如果获取全部数据失败，则导出当前页表格数据
gridInstance: null, // ligerGrid 对象 (如果为null,则获取当前页数据)
serialNumberWidth: "27", // 序号宽度
RenderColumns: {} // 自定义计算列{列名:{render:callback(回调方法 参数:data(该行数据) return: 计算结果)}}
},
isFrozenTitle: true, // 是否冻结标题 (只支持xlsx格式) 若tr中包含th标签 则视为标题行 , 若前台传入title, 则自动视为冻结行
// xls格式 样式 (如果xls格式并且是ligeruigrid 或者 浏览器不支持blob , 前台未传入css样式,则默认加载ligerui_grid_export_excel.css 样式 ，若路径改变则需重新指定 )
// xlsx格式 如果浏览器不支持blob,则自动转换xls格式,需传入css样式
css: [],
ignoreRows: null,// TODO
ignoreCols: null // TODO
}; $.fn.tableExport.charset = "charset=utf-8"; $.fn.tableExport.xlsx = {
defaultClass: "xlsx",
buttonContent: "Export to xlsx",
mimeType: "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet",
fileExtension: ".xlsx"
}; $.fn.tableExport.xls = {
defaultClass: "xls",
buttonContent: "Export to xls",
separator: "\t",
mimeType: "application/vnd.ms-excel",
fileExtension: ".xls"
}; $.fn.tableExport.csv = {
defaultClass: "csv",
buttonContent: "Export to csv",
separator: ",",
mimeType: "application/csv",
fileExtension: ".csv"
}; $.fn.tableExport.txt = {
defaultClass: "txt",
buttonContent: "Export to txt",
separator: " ",
mimeType: "text/plain",
fileExtension: ".txt"
}; $.fn.tableExport.titleHeight = "35"; $.fn.tableExport.defaultFileName = "myDownload"; $.fn.tableExport.defaultButton = "button-default"; $.fn.tableExport.bootstrap = ["btn", "btn-default", "btn-toolbar"]; $.fn.tableExport.rowDel = "\r\n"; $.fn.tableExport.entityMap = { "&": "&", "<": "<", ">": ">", "'": ''', "/": '/' }; // 获取table数据
function getData(e) { var data = []; var colsW = []; // 列宽
var rowsH = []; // 行高 var rowNum = 0; // 行号 var merges = []; // 合并信息 var frozenRows = 0; // 冻结行数 根据tr中是否包含th 若包含th 则该行冻结 var frozen = null; // 冻结信息 $(e).find("table").each(function (i, o) { $(o).find("tr").not(settings.exclude).each(function (i, o) { colsW = []; var colsIndex = 0; if (settings.title != "" && rowNum == 0) {
data[0] = [];
merges[0] = "";
rowsH.push({ wpx: $.fn.tableExport.titleHeight });
rowNum++;
frozenRows++;
} rowsH.push({ wpx: $(o).height() }); if (data[rowNum] == null) {
data[rowNum] = [];
} var len = $(o).find("th:visible").length; if (len > 0) {
frozenRows++;
} $(o).find("th:visible").not(settings.exclude).each(function (i, o) { var rowspan = $(o).attr("rowspan");
// 是否合并列
if (rowspan !== undefined && parseInt(rowspan) > 1) {
// 合并信息 ( s :起始单元格(c:列 , r: 行) e:结束单元格(同上))
merges.push({ s: { c: colsIndex, r: rowNum }, e: { c: colsIndex, r: rowNum + parseInt(rowspan) - 1 } }); for (var k = 1; k < rowspan; k++) { // 如果合并行 ， 则自动将行数据补全（如果合并两行 ， 则将下一行该列数据赋值为:"",保持每行数据数一致）
if (data[rowNum + k] == null) {
data[rowNum + k] = [];
}
// {}:st:样式 v:内容
data[rowNum + k][data[rowNum + k].length] = { st: '2', v: "" };
}
} var colspan = $(o).attr("colspan");
var w;
if (colspan !== undefined && parseInt(colspan) > 1) { merges.push({ s: { c: colsIndex, r: rowNum }, e: { c: colsIndex + parseInt(colspan) - 1, r: rowNum } }); for (var j = 0; j < colspan; j++) {
w = $(o).width() / colspan;
// 每一列宽度
colsW[colsW.length] = { wpx: w };
if (j == 0) {
data[rowNum][data[rowNum].length] = { st: '2', v: $.trim($.trim($(o).text())) };
} else {
data[rowNum][data[rowNum].length] = { st: '2', v: "" };
}
}
colsIndex += parseInt(colspan);
} else {
colsW[colsW.length] = { wpx: $(o).width() };
data[rowNum][data[rowNum].length] = { st: '2', v: $.trim($.trim($(o).text())) };
colsIndex++;
} });
$(o).find("td:visible").not(settings.exclude).each(function (i, o) { var rowspan = $(o).attr("rowspan"); if (rowspan !== undefined && parseInt(rowspan) > 1) { merges.push({ s: { c: colsIndex, r: rowNum }, e: { c: colsIndex, r: rowNum + parseInt(rowspan) - 1 } }); for (var k = 1; k < parseInt(rowspan) ; k++) { if (data[rowNum + k] == null) {
data[rowNum + k] = [];
} data[rowNum + k][data[rowNum + k].length] = { st: '1', v: "" };;
}
} var colspan = $(o).attr("colspan");
if (colspan !== undefined && parseInt(colspan) > 1) {
merges.push({ s: { c: colsIndex, r: rowNum }, e: { c: colsIndex + parseInt(colspan) - 1, r: rowNum } });
for (var j = 0; j < colspan; j++) {
w = $(o).width() / colspan;
colsW[colsW.length] = { wpx: w };
if (j == 0) {
data[rowNum][data[rowNum].length] = { st: '3', v: $.trim($.trim($(o).text())) };
} else {
data[rowNum][data[rowNum].length] = { st: '3', v: "" };
}
}
colsIndex += parseInt(colspan);
} else {
colsW[colsW.length] = { wpx: $(o).width() };
data[rowNum][data[rowNum].length] = { st: '3', v: $.trim($.trim($(o).text())) };
colsIndex++;
} }); if (settings.title != "" && i == 0) {
for (var k = 0; k < colsIndex; k++) {
if (k == 0) {
data[0][k] = { st: '4', v: settings.title };
} else {
data[0][k] = { st: '4', v: "" };
}
}
merges[0] = { s: { c: 0, r: 0 }, e: { c: colsIndex - 1, r: 0 } };
}
rowNum++;
});
}); if (frozenRows != 0 && settings.isFrozenTitle) {
frozen = { topLeftCell: { c: 0, r: frozenRows }, ySplit: frozenRows };
} var d = {
data: data,
colsW: colsW,
rowsH: rowsH,
merges: merges,
frozen: frozen
}
return d;
} // 导出当前数据(ligerGrid)
function ligerGridData(e) { var data = []; var colsW = []; var rowsH = []; var rowNum = 0; var merges = []; var g = $(e).parent().parent(); var title = $(g).find(".l-layout-header").text(); var c = $(g).find(".l-grid2 .l-grid-header-table"); var columnCount = 0; var colsIndex = 0; var frozenRows = 0; // 冻结行数 根据tr中是否包含th 若包含th 则该行冻结 var frozen = null; // 冻结信息 // 标题
$(c).find("tr").each(function (i, o) { colsW = []; colsIndex = 0; if (settings.title != "" && rowNum == 0) {
data[0] = [];
merges[0] = "";
rowsH.push({ wpx: $.fn.tableExport.titleHeight });
rowNum++;
frozenRows++;
} frozenRows++; rowsH.push({ wpx: $(o).height() }); if (data[rowNum] == null) {
data[rowNum] = [];
} // 第一个单元格
colsW[colsW.length] = { wpx: settings.ligerui.serialNumberWidth === undefined ? "27" : settings.ligerui.serialNumberWidth };
data[rowNum][data[rowNum].length] = { st: '2', v: "" };
colsIndex++; $(o).find("td:visible").each(function (i, o) { var rowspan = $(o).attr("rowspan"); if (rowspan !== undefined && parseInt(rowspan) > 1) { merges.push({ s: { c: colsIndex, r: rowNum }, e: { c: colsIndex, r: rowNum + parseInt(rowspan) - 1 } }); for (var k = 1; k < rowspan; k++) { if (data[rowNum + k] == null) {
data[rowNum + k] = [];
} data[rowNum + k][data[rowNum + k].length] = { st: '2', v: "" };
}
} var colspan = $(o).attr("colspan");
var w;
if (colspan !== undefined && parseInt(colspan) > 1) { merges.push({ s: { c: colsIndex, r: rowNum }, e: { c: colsIndex + parseInt(colspan) - 1, r: rowNum } }); for (var j = 0; j < colspan; j++) {
w = $(o).width() / colspan;
colsW[colsW.length] = { wpx: w };
if (j == 0) {
data[rowNum][data[rowNum].length] = { st: '2', v: $.trim($.trim($(o).text())) };
} else {
data[rowNum][data[rowNum].length] = { st: '2', v: "" };
}
}
colsIndex += parseInt(colspan);
} else {
colsW[colsW.length] = { wpx: $(o).width() };
data[rowNum][data[rowNum].length] = { st: '2', v: $.trim($.trim($(o).text())) };
colsIndex++;
}
}); if (settings.title != "" && i == 0) {
for (var k = 0; k < colsIndex; k++) {
if (k == 0) {
data[0][k] = { st: '4', v: settings.title };
} else {
data[0][k] = { st: '4', v: "" };
}
}
merges[0] = { s: { c: 0, r: 0 }, e: { c: colsIndex - 1, r: 0 } };
} rowNum++;
}); // 内容
var t = $(g).find(".l-grid2 .l-grid-body-table"); $(t).find("tr").each(function (i, o) { colsW = []; colsIndex = 0; rowsH.push({ wpx: $(o).height() }); if (data[rowNum] == null) {
data[rowNum] = [];
} // 序号
colsW[colsW.length] = { wpx: "27" };
data[rowNum][data[rowNum].length] = { st: '3', v: i + 1 };
colsIndex++; $(o).find("td:visible").each(function (i, o) { colsW[colsW.length] = { wpx: $(o).width() };
data[rowNum][data[rowNum].length] = { st: '3', v: $.trim($(o).text()) };
colsIndex++;
});
rowNum++;
}); if (frozenRows != 0 && settings.isFrozenTitle) {
frozen = { topLeftCell: { c: 0, r: frozenRows }, ySplit: frozenRows };
} var d = {
data: data,
colsW: colsW,
rowsH: rowsH,
merges: merges,
frozen: frozen
}
return d;
} // 导出全部数据(ligerGrid)
function ligerGridAllData(e, grid, dataSource) { if (dataSource == null) {
return ligerGridData(e);
} var data = []; var colsW = []; var rowsH = []; var rowNum = 0; var merges = []; var g = $(e).parent().parent(); var title = $(g).find(".l-layout-header").text(); var c = $(g).find(".l-grid2 .l-grid-header-table"); var columnCount = 0; var colsIndex = 0; var frozenRows = 0; // 冻结行数 根据tr中是否包含th 若包含th 则该行冻结 var frozen = null; // 冻结信息 // 标题
$(c).find("tr").each(function (i, o) { colsW = []; colsIndex = 0; if (settings.title != "" && rowNum == 0) {
data[0] = [];
merges[0] = "";
rowsH.push({ wpx: $.fn.tableExport.titleHeight });
rowNum++;
frozenRows++;
} frozenRows++; rowsH.push({ wpx: $(o).height() }); if (data[rowNum] == null) {
data[rowNum] = [];
} // 第一个单元格
colsW[colsW.length] = { wpx: settings.ligerui.serialNumberWidth === undefined ? 27 : settings.ligerui.serialNumberWidth };
data[rowNum][data[rowNum].length] = { st: '2', v: "" };
colsIndex++; $(o).find("td:visible").each(function (i, o) { var columnname = $(o).attr("columnname"); if (columnname !== undefined) { var rowspan = $(o).attr("rowspan"); if (rowspan !== undefined && parseInt(rowspan) > 1) { merges.push({ s: { c: colsIndex, r: rowNum }, e: { c: colsIndex, r: rowNum + parseInt(rowspan) - 1 } }); for (var k = 1; k < rowspan; k++) { if (data[rowNum + k] == null) {
data[rowNum + k] = [];
} data[rowNum + k][data[rowNum + k].length] = { st: '2', v: "" };
}
} var colspan = $(o).attr("colspan");
var w;
//var text = $.trim($(o).text());
//if (text === undefined || text == null || text == '') {
// text
//}
if (colspan !== undefined && parseInt(colspan) > 1) { merges.push({ s: { c: colsIndex, r: rowNum }, e: { c: colsIndex + parseInt(colspan) - 1, r: rowNum } }); for (var j = 0; j < colspan; j++) {
w = $(o).width() / colspan;
colsW[colsW.length] = { wpx: w };
if (j == 0) {
data[rowNum][data[rowNum].length] = { st: '2', v: $.trim($.trim($(o).text())) };
} else {
data[rowNum][data[rowNum].length] = { st: '2', v: "" };
}
}
colsIndex += parseInt(colspan);
} else {
colsW[colsW.length] = { wpx: $(o).width() };
data[rowNum][data[rowNum].length] = { st: '2', v: $.trim($.trim($(o).text())) };
colsIndex++;
}
}
}); if (settings.title != "" && i == 0) {
for (var k = 0; k < colsIndex; k++) {
if (k == 0) {
data[0][k] = { st: '4', v: settings.title };
} else {
data[0][k] = { st: '4', v: "" };
}
}
merges[0] = { s: { c: 0, r: 0 }, e: { c: colsIndex - 1, r: 0 } };
} rowNum++;
}); // 内容
//var cols = grid.getOptions().columns; var cols = grid.columns; var rows = dataSource.Rows; for (var i = 0; i < rows.length; i++) { colsIndex = 0; if (data[rowNum] == null) {
data[rowNum] = [];
} // 序号
data[rowNum][data[rowNum].length] = { st: '3', v: i + 1 };
colsIndex++; var info = ""; for (var j = 0; j < cols.length; j++) {
var h = cols[j].hide;
if (h) {
continue;
} var name = cols[j].name; if (name === undefined || name == "") {
continue;
} var rowName = getRowValue(rows[i], name); if (String(rowName).indexOf("/Date") != -1) {
rowName = ChangeDateFormat_Date(rowName);
} data[rowNum][data[rowNum].length] = { st: '3', v: rowName };
colsIndex++;
}
rowNum++;
} if (frozenRows != 0 && settings.isFrozenTitle) {
frozen = { topLeftCell: { c: 0, r: frozenRows }, ySplit: frozenRows };
} var d = {
data: data,
colsW: colsW,
rowsH: rowsH,
merges: merges,
frozen: frozen
}
return d; } function getRowValue(row, name) {
if (settings.ligerui.RenderColumns !== undefined
&& settings.ligerui.RenderColumns[name] !== undefined
&& settings.ligerui.RenderColumns[name].render !== undefined) {
return settings.ligerui.RenderColumns[name].render(row);
}
if (row[name] === undefined || row[name] == null) {
return "";
} else {
return row[name];
}
} // 分割数据 (用于cvs , txt , xls格式数据)
function getSeqData(data, seq1, seq2) {
if (data == null) {
return;
}
var d = data.data; var ar = [];
for (var i = 0; i < d.length; i++) {
var arr = [];
for (var j = 0; j < d[i].length; j++) {
arr.push(d[i][j].v);
}
ar.push(arr.join(seq1));
}
return ar.join(seq2);
} function tableToExcel(e) {
var css = [];
if (settings.islageruigrid && (settings.css === undefined || settings.css == null || settings.css.length == 0)) {
css = ["/RefLib/css/ligerui_grid_export_excel.css"];
} else {
css = settings.css;
} e.table2excel({
exclude: settings.exclude,
name: "Excel Document Name",
filename: settings.fileName,
sheetName: settings.fileName,
fileext: ".xls",
css: css,
islageruigrid: settings.islageruigrid,
ligerui: settings.ligerui
});
} function escapeHtml(string) {
return String(string).replace(/[&<>'\/]/g, function (s) {
return $.fn.tableExport.entityMap[s];
});
} function dateNum(v, date1904) {
if (date1904) v += 1462;
var epoch = Date.parse(v);
return (epoch - new Date(Date.UTC(1899, 11, 30))) / (24 * 60 * 60 * 1000);
} // 创建sheet页 (xlsx)
function createSheet(d, opts) {
var ws = {};
var cols = [];
var data = d.data;
var range = { s: { c: 10000000, r: 10000000 }, e: { c: 0, r: 0 } };
for (var R = 0; R != data.length; ++R) {
for (var C = 0; C != data[R].length; ++C) {
if (range.s.r > R) range.s.r = R;
if (range.s.c > C) range.s.c = C;
if (range.e.r < R) range.e.r = R;
if (range.e.c < C) range.e.c = C;
var cell = { v: data[R][C] };
if (cell.v == null) continue;
var cell_ref = XLSX.utils.encode_cell({ c: C, r: R }); //var reg = /^[+-]?(\d|[0-9]\d|\d)(.\d{1,2})?%$/; var reg = /^[+-]?((\d+\.?\d*)|(\d*\.\d+))\%$/; if (typeof cell.v.v === 'number' || !isNaN(Number(cell.v.v))) {
cell.v.t = 'n';
} else if (typeof cell.v.v === 'boolean') {
cell.v.t = 'b';
} else if (cell.v.v instanceof Date || !isNaN(Date.parse(cell.v.v))) {
cell.v.t = 's';
cell.v.z = XLSX.SSF._table[23];
//cell.v.v = dateNum(Date.parse(cell.v.v));
} else if (cell.v.v.match(reg) != null) {
cell.v.t = 'p';
}else {
cell.v.t = 's';
} ws[cell_ref] = cell.v; }
}
if (range.s.c < 10000000) ws['!ref'] = XLSX.utils.encode_range(range); ws['!cols'] = d.colsW;
ws['!rows'] = d.rowsH;
ws['!merges'] = d.merges;
if (d.frozen != null) {
ws['!frozen'] = d.frozen;
}
return ws;
} function Workbook() {
if (!(this instanceof Workbook)) return new Workbook();
this.SheetNames = [];
this.Sheets = {};
} function string2ArrayBuffer(s) {
var buf = new ArrayBuffer(s.length);
var view = new Uint8Array(buf);
for (var i = 0; i != s.length; ++i) view[i] = s.charCodeAt(i) & 0xFF;
return buf;
} function ChangeDateFormat_Date(data) {
if (data != null) {
var date = new Date(parseInt(data.replace("/Date(", "").replace(")/", ""), 10));
var month = date.getMonth() + 1 < 10 ? "0" + (date.getMonth() + 1) : date.getMonth() + 1;
var currentDate = date.getDate() < 10 ? "0" + date.getDate() : date.getDate();
var dateStr = date.getFullYear() + "-" + month + "-" + currentDate;
if (dateStr == '1900-01-01') {
return "";
}
return dateStr;
}
return "";
} function export2file(data, mime, name, extension, opts) {
if (extension === ".xlsx") {
var wb = new Workbook(),
ws = createSheet(data, opts); wb.SheetNames.push(name);
wb.Sheets[name] = ws; var wopts = { bookType: 'xlsx', bookSST: false, type: 'binary' },
wbout = XLSX.write(wb, wopts); data = string2ArrayBuffer(wbout);
} saveAs(new Blob([data],
{ type: mime + ";" + $.fn.tableExport.charset }),
name + extension);
} }(window));
原jszip上部分代码
/*! JSZip - A Javascript class for generating and reading zip files
<http://stuartk.com/jszip> (c) 2009-2014 Stuart Knightley <stuart [at] stuartk.com>
Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip/master/LICENSE.markdown. JSZip uses the library pako released under the MIT license :
https://github.com/nodeca/pako/blob/master/LICENSE
*/
!function (e) {
if ("object" == typeof exports && "undefined" != typeof module)
module.exports = e();
else if ("function" == typeof define && define.amd)
define([], e);
else {
var f; "undefined" != typeof window ? f = window : "undefined" != typeof global ? f = global : "undefined" != typeof self && (f = self), f.JSZip = e()
}
}(function () {
var define, module, exports;
return (
function e(t, n, r) {
function s(o, u) {
if (!n[o]) {
if (!t[o]) {
var a = typeof require == "function" && require;
if (!u && a) return a(o, !0);
if (i) return i(o, !0);
throw new Error("Cannot find module '" + o + "'")
}
var f = n[o] = { exports: {} }; t[o][0].call(f.exports, function (e) { var n = t[o][1][e]; return s(n ? n : e) }, f, f.exports, e, t, n, r)
} return n[o].exports
} var i = typeof require == "function" && require; for (var o = 0; o < r.length; o++) s(r[o]); return s
})({
1: [function (_dereq_, module, exports) {
'use strict';
// private property
var _keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="; // public method for encoding
exports.encode = function(input, utf8) {
var output = "";
var chr1, chr2, chr3, enc1, enc2, enc3, enc4;
var i = 0; while (i < input.length) { chr1 = input.charCodeAt(i++);
chr2 = input.charCodeAt(i++);
chr3 = input.charCodeAt(i++); enc1 = chr1 >> 2;
enc2 = ((chr1 & 3) << 4) | (chr2 >> 4);
enc3 = ((chr2 & 15) << 2) | (chr3 >> 6);
enc4 = chr3 & 63; if (isNaN(chr2)) {
enc3 = enc4 = 64;
}
else if (isNaN(chr3)) {
enc4 = 64;
} output = output + _keyStr.charAt(enc1) + _keyStr.charAt(enc2) + _keyStr.charAt(enc3) + _keyStr.charAt(enc4); } return output;
}; // public method for decoding
exports.decode = function(input, utf8) {
var output = "";
var chr1, chr2, chr3;
var enc1, enc2, enc3, enc4;
var i = 0; input = input.replace(/[^A-Za-z0-9\+\/\=]/g, ""); while (i < input.length) { enc1 = _keyStr.indexOf(input.charAt(i++));
enc2 = _keyStr.indexOf(input.charAt(i++));
enc3 = _keyStr.indexOf(input.charAt(i++));
enc4 = _keyStr.indexOf(input.charAt(i++)); chr1 = (enc1 << 2) | (enc2 >> 4);
chr2 = ((enc2 & 15) << 4) | (enc3 >> 2);
chr3 = ((enc3 & 3) << 6) | enc4; output = output + String.fromCharCode(chr1); if (enc3 != 64) {
output = output + String.fromCharCode(chr2);
}
if (enc4 != 64) {
output = output + String.fromCharCode(chr3);
} } return output; }; },{}],2:[function(_dereq_,module,exports){
'use strict';
function CompressedObject() {
this.compressedSize = 0;
this.uncompressedSize = 0;
this.crc32 = 0;
this.compressionMethod = null;
this.compressedContent = null;
} CompressedObject.prototype = {
/**
* Return the decompressed content in an unspecified format.
* The format will depend on the decompressor.
* @return {Object} the decompressed content.
*/
getContent: function() {
return null; // see implementation
},
/**
* Return the compressed content in an unspecified format.
* The format will depend on the compressed conten source.
* @return {Object} the compressed content.
*/
getCompressedContent: function() {
return null; // see implementation
}
};
module.exports = CompressedObject; },{}],3:[function(_dereq_,module,exports){
'use strict';
exports.STORE = {
magic: "\x00\x00",
compress: function(content) {
return content; // no compression
},
uncompress: function(content) {
return content; // no compression
},
compressInputType: null,
uncompressInputType: null
};
exports.DEFLATE = _dereq_('./flate'); },{"./flate":8}],4:[function(_dereq_,module,exports){
'use strict'; var utils = _dereq_('./utils'); var table = [
0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA,
0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3,
0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988,
0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91,
0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE,
0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7,
0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC,
0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5,
0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172,
0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B,
0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940,
0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59,
0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116,
0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F,
0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924,
0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D,
0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A,
0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433,
0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818,
0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01,
0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E,
0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457,
0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C,
0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65,
0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2,
0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB,
0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0,
0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9,
0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086,
0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F,
0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4,
0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD,
0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A,
0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683,
0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8,
0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1,
0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE,
0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7,
0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC,
0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5,
0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252,
0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B,
0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60,
0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79,
0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236,
0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F,
0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04,
0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D,
0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A,
0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713,
0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38,
0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21,
0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E,
0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777,
0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C,
0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45,
0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2,
0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB,
0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0,
0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9,
0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6,
0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF,
0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94,
0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D
]; /**
*
* Javascript crc32
* http://www.webtoolkit.info/
*
*/
module.exports = function crc32(input, crc) {
if (typeof input === "undefined" || !input.length) {
return 0;
} var isArray = utils.getTypeOf(input) !== "string"; if (typeof(crc) == "undefined") {
crc = 0;
}
var x = 0;
var y = 0;
var b = 0; crc = crc ^ (-1);
for (var i = 0, iTop = input.length; i < iTop; i++) {
b = isArray ? input[i] : input.charCodeAt(i);
y = (crc ^ b) & 0xFF;
x = table[y];
crc = (crc >>> 8) ^ x;
} return crc ^ (-1);
};
// vim: set shiftwidth=4 softtabstop=4: },{"./utils":21}],5:[function(_dereq_,module,exports){
'use strict';
var utils = _dereq_('./utils'); function DataReader(data) {
this.data = null; // type : see implementation
this.length = 0;
this.index = 0;
}
DataReader.prototype = {
/**
* Check that the offset will not go too far.
* @param {string} offset the additional offset to check.
* @throws {Error} an Error if the offset is out of bounds.
*/
checkOffset: function(offset) {
this.checkIndex(this.index + offset);
},
/**
* Check that the specifed index will not be too far.
* @param {string} newIndex the index to check.
* @throws {Error} an Error if the index is out of bounds.
*/
checkIndex: function(newIndex) {
if (this.length < newIndex || newIndex < 0) {
throw new Error("End of data reached (data length = " + this.length + ", asked index = " + (newIndex) + "). Corrupted zip ?");
}
},
/**
* Change the index.
* @param {number} newIndex The new index.
* @throws {Error} if the new index is out of the data.
*/
setIndex: function(newIndex) {
this.checkIndex(newIndex);
this.index = newIndex;
},
/**
* Skip the next n bytes.
* @param {number} n the number of bytes to skip.
* @throws {Error} if the new index is out of the data.
*/
skip: function(n) {
this.setIndex(this.index + n);
},
/**
* Get the byte at the specified index.
* @param {number} i the index to use.
* @return {number} a byte.
*/
byteAt: function(i) {
// see implementations
},
/**
* Get the next number with a given byte size.
* @param {number} size the number of bytes to read.
* @return {number} the corresponding number.
*/
readInt: function(size) {
var result = 0,
i;
this.checkOffset(size);
for (i = this.index + size - 1; i >= this.index; i--) {
result = (result << 8) + this.byteAt(i);
}
this.index += size;
return result;
},
/**
* Get the next string with a given byte size.
* @param {number} size the number of bytes to read.
* @return {string} the corresponding string.
*/
readString: function(size) {
return utils.transformTo("string", this.readData(size));
},
/**
* Get raw data without conversion, <size> bytes.
* @param {number} size the number of bytes to read.
* @return {Object} the raw data, implementation specific.
*/
readData: function(size) {
// see implementations
},
/**
* Find the last occurence of a zip signature (4 bytes).
* @param {string} sig the signature to find.
* @return {number} the index of the last occurence, -1 if not found.
*/
lastIndexOfSignature: function(sig) {
// see implementations
},
/**
* Get the next date.
* @return {Date} the date.
*/
readDate: function() {
var dostime = this.readInt(4);
return new Date(
((dostime >> 25) & 0x7f) + 1980, // year
((dostime >> 21) & 0x0f) - 1, // month
(dostime >> 16) & 0x1f, // day
(dostime >> 11) & 0x1f, // hour
(dostime >> 5) & 0x3f, // minute
(dostime & 0x1f) << 1); // second
}
};
module.exports = DataReader; },{"./utils":21}],6:[function(_dereq_,module,exports){
'use strict';
exports.base64 = false;
exports.binary = false;
exports.dir = false;
exports.createFolders = false;
exports.date = null;
exports.compression = null;
exports.comment = null; },{}],7:[function(_dereq_,module,exports){
'use strict';
var utils = _dereq_('./utils'); /**
* @deprecated
* This function will be removed in a future version without replacement.
*/
exports.string2binary = function(str) {
return utils.string2binary(str);
}; /**
* @deprecated
* This function will be removed in a future version without replacement.
*/
exports.string2Uint8Array = function(str) {
return utils.transformTo("uint8array", str);
}; /**
* @deprecated
* This function will be removed in a future version without replacement.
*/
exports.uint8Array2String = function(array) {
return utils.transformTo("string", array);
}; /**
* @deprecated
* This function will be removed in a future version without replacement.
*/
exports.string2Blob = function(str) {
var buffer = utils.transformTo("arraybuffer", str);
return utils.arrayBuffer2Blob(buffer);
}; /**
* @deprecated
* This function will be removed in a future version without replacement.
*/
exports.arrayBuffer2Blob = function(buffer) {
return utils.arrayBuffer2Blob(buffer);
}; /**
* @deprecated
* This function will be removed in a future version without replacement.
*/
exports.transformTo = function(outputType, input) {
return utils.transformTo(outputType, input);
}; /**
* @deprecated
* This function will be removed in a future version without replacement.
*/
exports.getTypeOf = function(input) {
return utils.getTypeOf(input);
}; /**
* @deprecated
* This function will be removed in a future version without replacement.
*/
exports.checkSupport = function(type) {
return utils.checkSupport(type);
}; /**
* @deprecated
* This value will be removed in a future version without replacement.
*/
exports.MAX_VALUE_16BITS = utils.MAX_VALUE_16BITS; /**
* @deprecated
* This value will be removed in a future version without replacement.
*/
exports.MAX_VALUE_32BITS = utils.MAX_VALUE_32BITS; /**
* @deprecated
* This function will be removed in a future version without replacement.
*/
exports.pretty = function(str) {
return utils.pretty(str);
}; /**
* @deprecated
* This function will be removed in a future version without replacement.
*/
exports.findCompression = function(compressionMethod) {
return utils.findCompression(compressionMethod);
}; /**
* @deprecated
* This function will be removed in a future version without replacement.
*/
exports.isRegExp = function (object) {
return utils.isRegExp(object);
}; },{"./utils":21}],8:[function(_dereq_,module,exports){
'use strict';
var USE_TYPEDARRAY = (typeof Uint8Array !== 'undefined') && (typeof Uint16Array !== 'undefined') && (typeof Uint32Array !== 'undefined'); var pako = _dereq_("pako");
exports.uncompressInputType = USE_TYPEDARRAY ? "uint8array" : "array";
exports.compressInputType = USE_TYPEDARRAY ? "uint8array" : "array"; exports.magic = "\x08\x00";
exports.compress = function(input) {
return pako.deflateRaw(input);
};
exports.uncompress = function(input) {
return pako.inflateRaw(input);
}; },{"pako":24}],9:[function(_dereq_,module,exports){
'use strict'; var base64 = _dereq_('./base64'); /**
Usage:
zip = new JSZip();
zip.file("hello.txt", "Hello, World!").file("tempfile", "nothing");
zip.folder("images").file("smile.gif", base64Data, {base64: true});
zip.file("Xmas.txt", "Ho ho ho !", {date : new Date("December 25, 2007 00:00:01")});
zip.remove("tempfile"); base64zip = zip.generate(); **/ /**
* Representation a of zip file in js
* @constructor
* @param {String=|ArrayBuffer=|Uint8Array=} data the data to load, if any (optional).
* @param {Object=} options the options for creating this objects (optional).
*/
function JSZip(data, options) {
// if this constructor is used without `new`, it adds `new` before itself:
if(!(this instanceof JSZip)) return new JSZip(data, options); // object containing the files :
// {
// "folder/" : {...},
// "folder/data.txt" : {...}
// }
this.files = {}; this.comment = null; // Where we are in the hierarchy
this.root = "";
if (data) {
this.load(data, options);
}
this.clone = function() {
var newObj = new JSZip();
for (var i in this) {
if (typeof this[i] !== "function") {
newObj[i] = this[i];
}
}
return newObj;
};
}
JSZip.prototype = _dereq_('./object');
JSZip.prototype.load = _dereq_('./load');
JSZip.support = _dereq_('./support');
JSZip.defaults = _dereq_('./defaults'); /**
* @deprecated
* This namespace will be removed in a future version without replacement.
*/
JSZip.utils = _dereq_('./deprecatedPublicUtils'); JSZip.base64 = {
/**
* @deprecated
* This method will be removed in a future version without replacement.
*/
encode : function(input) {
return base64.encode(input);
},
/**
* @deprecated
* This method will be removed in a future version without replacement.
*/
decode : function(input) {
return base64.decode(input);
}
};
JSZip.compressions = _dereq_('./compressions');
module.exports = JSZip; },{"./base64":1,"./compressions":3,"./defaults":6,"./deprecatedPublicUtils":7,"./load":10,"./object":13,"./support":17}],10:[function(_dereq_,module,exports){
'use strict';
var base64 = _dereq_('./base64');
var ZipEntries = _dereq_('./zipEntries');
module.exports = function(data, options) {
var files, zipEntries, i, input;
options = options || {};
if (options.base64) {
data = base64.decode(data);
} zipEntries = new ZipEntries(data, options);
files = zipEntries.files;
for (i = 0; i < files.length; i++) {
input = files[i];
this.file(input.fileName, input.decompressed, {
binary: true,
optimizedBinaryString: true,
date: input.date,
dir: input.dir,
comment : input.fileComment.length ? input.fileComment : null,
createFolders: options.createFolders
});
}
if (zipEntries.zipComment.length) {
this.comment = zipEntries.zipComment;
} return this;
}; },{"./base64":1,"./zipEntries":22}],11:[function(_dereq_,module,exports){
(function (Buffer){
'use strict';
module.exports = function(data, encoding){
return new Buffer(data, encoding);
};
module.exports.test = function(b){
return Buffer.isBuffer(b);
};
}).call(this,(typeof Buffer !== "undefined" ? Buffer : undefined))
},{}],12:[function(_dereq_,module,exports){
'use strict';
var Uint8ArrayReader = _dereq_('./uint8ArrayReader'); function NodeBufferReader(data) {
this.data = data;
this.length = this.data.length;
this.index = 0;
}
NodeBufferReader.prototype = new Uint8ArrayReader(); /**
* @see DataReader.readData
*/
NodeBufferReader.prototype.readData = function(size) {
this.checkOffset(size);
var result = this.data.slice(this.index, this.index + size);
this.index += size;
return result;
};
module.exports = NodeBufferReader; },{"./uint8ArrayReader":18}],13:[function(_dereq_,module,exports){
'use strict';
var support = _dereq_('./support');
var utils = _dereq_('./utils');
var crc32 = _dereq_('./crc32');
var signature = _dereq_('./signature');
var defaults = _dereq_('./defaults');
var base64 = _dereq_('./base64');
var compressions = _dereq_('./compressions');
var CompressedObject = _dereq_('./compressedObject');
var nodeBuffer = _dereq_('./nodeBuffer');
var utf8 = _dereq_('./utf8');
var StringWriter = _dereq_('./stringWriter');
var Uint8ArrayWriter = _dereq_('./uint8ArrayWriter'); /**
* Returns the raw data of a ZipObject, decompress the content if necessary.
* @param {ZipObject} file the file to use.
* @return {String|ArrayBuffer|Uint8Array|Buffer} the data.
*/
var getRawData = function(file) {
if (file._data instanceof CompressedObject) {
file._data = file._data.getContent();
file.options.binary = true;
file.options.base64 = false; if (utils.getTypeOf(file._data) === "uint8array") {
var copy = file._data;
// when reading an arraybuffer, the CompressedObject mechanism will keep it and subarray() a Uint8Array.
// if we request a file in the same format, we might get the same Uint8Array or its ArrayBuffer (the original zip file).
file._data = new Uint8Array(copy.length);
// with an empty Uint8Array, Opera fails with a "Offset larger than array size"
if (copy.length !== 0) {
file._data.set(copy, 0);
}
}
}
return file._data;
}; /**
* Returns the data of a ZipObject in a binary form. If the content is an unicode string, encode it.
* @param {ZipObject} file the file to use.
* @return {String|ArrayBuffer|Uint8Array|Buffer} the data.
*/
var getBinaryData = function(file) {
var result = getRawData(file),
type = utils.getTypeOf(result);
if (type === "string") {
if (!file.options.binary) {
// unicode text !
// unicode string => binary string is a painful process, check if we can avoid it.
if (support.nodebuffer) {
return nodeBuffer(result, "utf-8");
}
}
return file.asBinary();
}
return result;
}; /**
* Transform this._data into a string.
* @param {function} filter a function String -> String, applied if not null on the result.
* @return {String} the string representing this._data.
*/
var dataToString = function(asUTF8) {
var result = getRawData(this);
if (result === null || typeof result === "undefined") {
return "";
}
// if the data is a base64 string, we decode it before checking the encoding !
if (this.options.base64) {
result = base64.decode(result);
}
if (asUTF8 && this.options.binary) {
// JSZip.prototype.utf8decode supports arrays as input
// skip to array => string step, utf8decode will do it.
result = out.utf8decode(result);
}
else {
// no utf8 transformation, do the array => string step.
result = utils.transformTo("string", result);
} if (!asUTF8 && !this.options.binary) {
result = utils.transformTo("string", out.utf8encode(result));
}
return result;
};
/**
* A simple object representing a file in the zip file.
* @constructor
* @param {string} name the name of the file
* @param {String|ArrayBuffer|Uint8Array|Buffer} data the data
* @param {Object} options the options of the file
*/
var ZipObject = function(name, data, options) {
this.name = name;
this.dir = options.dir;
this.date = options.date;
this.comment = options.comment; this._data = data;
this.options = options; /*
* This object contains initial values for dir and date.
* With them, we can check if the user changed the deprecated metadata in
* `ZipObject#options` or not.
*/
this._initialMetadata = {
dir : options.dir,
date : options.date
};
}; ZipObject.prototype = {
/**
* Return the content as UTF8 string.
* @return {string} the UTF8 string.
*/
asText: function() {
return dataToString.call(this, true);
},
/**
* Returns the binary content.
* @return {string} the content as binary.
*/
asBinary: function() {
return dataToString.call(this, false);
},
/**
* Returns the content as a nodejs Buffer.
* @return {Buffer} the content as a Buffer.
*/
asNodeBuffer: function() {
var result = getBinaryData(this);
return utils.transformTo("nodebuffer", result);
},
/**
* Returns the content as an Uint8Array.
* @return {Uint8Array} the content as an Uint8Array.
*/
asUint8Array: function() {
var result = getBinaryData(this);
return utils.transformTo("uint8array", result);
},
/**
* Returns the content as an ArrayBuffer.
* @return {ArrayBuffer} the content as an ArrayBufer.
*/
asArrayBuffer: function() {
return this.asUint8Array().buffer;
}
}; /**
* Transform an integer into a string in hexadecimal.
* @private
* @param {number} dec the number to convert.
* @param {number} bytes the number of bytes to generate.
* @returns {string} the result.
*/
var decToHex = function(dec, bytes) {
var hex = "",
i;
for (i = 0; i < bytes; i++) {
hex += String.fromCharCode(dec & 0xff);
dec = dec >>> 8;
}
return hex;
}; /**
* Merge the objects passed as parameters into a new one.
* @private
* @param {...Object} var_args All objects to merge.
* @return {Object} a new object with the data of the others.
*/
var extend = function() {
var result = {}, i, attr;
for (i = 0; i < arguments.length; i++) { // arguments is not enumerable in some browsers
for (attr in arguments[i]) {
if (arguments[i].hasOwnProperty(attr) && typeof result[attr] === "undefined") {
result[attr] = arguments[i][attr];
}
}
}
return result;
}; /**
* Transforms the (incomplete) options from the user into the complete
* set of options to create a file.
* @private
* @param {Object} o the options from the user.
* @return {Object} the complete set of options.
*/
var prepareFileAttrs = function(o) {
o = o || {};
if (o.base64 === true && (o.binary === null || o.binary === undefined)) {
o.binary = true;
}
o = extend(o, defaults);
o.date = o.date || new Date();
if (o.compression !== null) o.compression = o.compression.toUpperCase(); return o;
}; /**
* Add a file in the current folder.
* @private
* @param {string} name the name of the file
* @param {String|ArrayBuffer|Uint8Array|Buffer} data the data of the file
* @param {Object} o the options of the file
* @return {Object} the new file.
*/
var fileAdd = function(name, data, o) {
// be sure sub folders exist
var dataType = utils.getTypeOf(data),
parent; o = prepareFileAttrs(o); if (o.createFolders && (parent = parentFolder(name))) {
folderAdd.call(this, parent, true);
} if (o.dir || data === null || typeof data === "undefined") {
o.base64 = false;
o.binary = false;
data = null;
}
else if (dataType === "string") {
if (o.binary && !o.base64) {
// optimizedBinaryString == true means that the file has already been filtered with a 0xFF mask
if (o.optimizedBinaryString !== true) {
// this is a string, not in a base64 format.
// Be sure that this is a correct "binary string"
data = utils.string2binary(data);
}
}
}
else { // arraybuffer, uint8array, ...
o.base64 = false;
o.binary = true; if (!dataType && !(data instanceof CompressedObject)) {
throw new Error("The data of '" + name + "' is in an unsupported format !");
} // special case : it's way easier to work with Uint8Array than with ArrayBuffer
if (dataType === "arraybuffer") {
data = utils.transformTo("uint8array", data);
}
} var object = new ZipObject(name, data, o);
this.files[name] = object;
return object;
}; /**
* Find the parent folder of the path.
* @private
* @param {string} path the path to use
* @return {string} the parent folder, or ""
*/
var parentFolder = function (path) {
if (path.slice(-1) == '/') {
path = path.substring(0, path.length - 1);
}
var lastSlash = path.lastIndexOf('/');
return (lastSlash > 0) ? path.substring(0, lastSlash) : "";
}; /**
* Add a (sub) folder in the current folder.
* @private
* @param {string} name the folder's name
* @param {boolean=} [createFolders] If true, automatically create sub
* folders. Defaults to false.
* @return {Object} the new folder.
*/
var folderAdd = function(name, createFolders) {
// Check the name ends with a /
if (name.slice(-1) != "/") {
name += "/"; // IE doesn't like substr(-1)
} createFolders = (typeof createFolders !== 'undefined') ? createFolders : false; // Does this folder already exist?
if (!this.files[name]) {
fileAdd.call(this, name, null, {
dir: true,
createFolders: createFolders
});
}
return this.files[name];
}; /**
* Generate a JSZip.CompressedObject for a given zipOject.
* @param {ZipObject} file the object to read.
* @param {JSZip.compression} compression the compression to use.
* @return {JSZip.CompressedObject} the compressed result.
*/
var generateCompressedObjectFrom = function(file, compression) {
var result = new CompressedObject(),
content; // the data has not been decompressed, we might reuse things !
if (file._data instanceof CompressedObject) {
result.uncompressedSize = file._data.uncompressedSize;
result.crc32 = file._data.crc32; if (result.uncompressedSize === 0 || file.dir) {
compression = compressions['STORE'];
result.compressedContent = "";
result.crc32 = 0;
}
else if (file._data.compressionMethod === compression.magic) {
result.compressedContent = file._data.getCompressedContent();
}
else {
content = file._data.getContent();
// need to decompress / recompress
result.compressedContent = compression.compress(utils.transformTo(compression.compressInputType, content));
}
}
else {
// have uncompressed data
content = getBinaryData(file);
if (!content || content.length === 0 || file.dir) {
compression = compressions['STORE'];
content = "";
}
result.uncompressedSize = content.length;
result.crc32 = crc32(content);
result.compressedContent = compression.compress(utils.transformTo(compression.compressInputType, content));
} result.compressedSize = result.compressedContent.length;
result.compressionMethod = compression.magic; return result;
}; /**
* Generate the various parts used in the construction of the final zip file.
* @param {string} name the file name.
* @param {ZipObject} file the file content.
* @param {JSZip.CompressedObject} compressedObject the compressed object.
* @param {number} offset the current offset from the start of the zip file.
* @return {object} the zip parts.
*/
var generateZipParts = function(name, file, compressedObject, offset) {
var data = compressedObject.compressedContent,
utfEncodedFileName = utils.transformTo("string", utf8.utf8encode(file.name)),
comment = file.comment || "",
utfEncodedComment = utils.transformTo("string", utf8.utf8encode(comment)),
useUTF8ForFileName = utfEncodedFileName.length !== file.name.length,
useUTF8ForComment = utfEncodedComment.length !== comment.length,
o = file.options,
dosTime,
dosDate,
extraFields = "",
unicodePathExtraField = "",
unicodeCommentExtraField = "",
dir, date; // handle the deprecated options.dir
if (file._initialMetadata.dir !== file.dir) {
dir = file.dir;
} else {
dir = o.dir;
} // handle the deprecated options.date
if(file._initialMetadata.date !== file.date) {
date = file.date;
} else {
date = o.date;
} // date
// @see http://www.delorie.com/djgpp/doc/rbinter/it/52/13.html
// @see http://www.delorie.com/djgpp/doc/rbinter/it/65/16.html
// @see http://www.delorie.com/djgpp/doc/rbinter/it/66/16.html dosTime = date.getHours();
dosTime = dosTime << 6;
dosTime = dosTime | date.getMinutes();
dosTime = dosTime << 5;
dosTime = dosTime | date.getSeconds() / 2; dosDate = date.getFullYear() - 1980;
dosDate = dosDate << 4;
dosDate = dosDate | (date.getMonth() + 1);
dosDate = dosDate << 5;
dosDate = dosDate | date.getDate(); if (useUTF8ForFileName) {
// set the unicode path extra field. unzip needs at least one extra
// field to correctly handle unicode path, so using the path is as good
// as any other information. This could improve the situation with
// other archive managers too.
// This field is usually used without the utf8 flag, with a non
// unicode path in the header (winrar, winzip). This helps (a bit)
// with the messy Windows' default compressed folders feature but
// breaks on p7zip which doesn't seek the unicode path extra field.
// So for now, UTF-8 everywhere !
unicodePathExtraField =
// Version
decToHex(1, 1) +
// NameCRC32
decToHex(crc32(utfEncodedFileName), 4) +
// UnicodeName
utfEncodedFileName; extraFields +=
// Info-ZIP Unicode Path Extra Field
"\x75\x70" +
// size
decToHex(unicodePathExtraField.length, 2) +
// content
unicodePathExtraField;
} if(useUTF8ForComment) { unicodeCommentExtraField =
// Version
decToHex(1, 1) +
// CommentCRC32
decToHex(this.crc32(utfEncodedComment), 4) +
// UnicodeName
utfEncodedComment; extraFields +=
// Info-ZIP Unicode Path Extra Field
"\x75\x63" +
// size
decToHex(unicodeCommentExtraField.length, 2) +
// content
unicodeCommentExtraField;
} var header = ""; // version needed to extract
header += "\x0A\x00";
// general purpose bit flag
// set bit 11 if utf8
header += (useUTF8ForFileName || useUTF8ForComment) ? "\x00\x08" : "\x00\x00";
// compression method
header += compressedObject.compressionMethod;
// last mod file time
header += decToHex(dosTime, 2);
// last mod file date
header += decToHex(dosDate, 2);
// crc-32
header += decToHex(compressedObject.crc32, 4);
// compressed size
header += decToHex(compressedObject.compressedSize, 4);
// uncompressed size
header += decToHex(compressedObject.uncompressedSize, 4);
// file name length
header += decToHex(utfEncodedFileName.length, 2);
// extra field length
header += decToHex(extraFields.length, 2); var fileRecord = signature.LOCAL_FILE_HEADER + header + utfEncodedFileName + extraFields; var dirRecord = signature.CENTRAL_FILE_HEADER +
// version made by (00: DOS)
"\x14\x00" +
// file header (common to file and central directory)
header +
// file comment length
decToHex(utfEncodedComment.length, 2) +
// disk number start
"\x00\x00" +
// internal file attributes TODO
"\x00\x00" +
// external file attributes
(dir === true ? "\x10\x00\x00\x00" : "\x00\x00\x00\x00") +
// relative offset of local header
decToHex(offset, 4) +
// file name
utfEncodedFileName +
// extra field
extraFields +
// file comment
utfEncodedComment; return {
fileRecord: fileRecord,
dirRecord: dirRecord,
compressedObject: compressedObject
};
}; // return the actual prototype of JSZip
var out = {
/**
* Read an existing zip and merge the data in the current JSZip object.
* The implementation is in jszip-load.js, don't forget to include it.
* @param {String|ArrayBuffer|Uint8Array|Buffer} stream The stream to load
* @param {Object} options Options for loading the stream.
* options.base64 : is the stream in base64 ? default : false
* @return {JSZip} the current JSZip object
*/
load: function(stream, options) {
throw new Error("Load method is not defined. Is the file jszip-load.js included ?");
}, /**
* Filter nested files/folders with the specified function.
* @param {Function} search the predicate to use :
* function (relativePath, file) {...}
* It takes 2 arguments : the relative path and the file.
* @return {Array} An array of matching elements.
*/
filter: function(search) {
var result = [],
filename, relativePath, file, fileClone;
for (filename in this.files) {
if (!this.files.hasOwnProperty(filename)) {
continue;
}
file = this.files[filename];
// return a new object, don't let the user mess with our internal objects :)
fileClone = new ZipObject(file.name, file._data, extend(file.options));
relativePath = filename.slice(this.root.length, filename.length);
if (filename.slice(0, this.root.length) === this.root && // the file is in the current root
search(relativePath, fileClone)) { // and the file matches the function
result.push(fileClone);
}
}
return result;
}, /**
* Add a file to the zip file, or search a file.
* @param {string|RegExp} name The name of the file to add (if data is defined),
* the name of the file to find (if no data) or a regex to match files.
* @param {String|ArrayBuffer|Uint8Array|Buffer} data The file data, either raw or base64 encoded
* @param {Object} o File options
* @return {JSZip|Object|Array} this JSZip object (when adding a file),
* a file (when searching by string) or an array of files (when searching by regex).
*/
file: function(name, data, o) {
if (arguments.length === 1) {
if (utils.isRegExp(name)) {
var regexp = name;
return this.filter(function(relativePath, file) {
return !file.dir && regexp.test(relativePath);
});
}
else { // text
return this.filter(function(relativePath, file) {
return !file.dir && relativePath === name;
})[0] || null;
}
}
else { // more than one argument : we have data !
name = this.root + name;
fileAdd.call(this, name, data, o);
}
return this;
}, /**
* Add a directory to the zip file, or search.
* @param {String|RegExp} arg The name of the directory to add, or a regex to search folders.
* @return {JSZip} an object with the new directory as the root, or an array containing matching folders.
*/
folder: function(arg) {
if (!arg) {
return this;
} if (utils.isRegExp(arg)) {
return this.filter(function(relativePath, file) {
return file.dir && arg.test(relativePath);
});
} // else, name is a new folder
var name = this.root + arg;
var newFolder = folderAdd.call(this, name); // Allow chaining by returning a new object with this folder as the root
var ret = this.clone();
ret.root = newFolder.name;
return ret;
}, /**
* Delete a file, or a directory and all sub-files, from the zip
* @param {string} name the name of the file to delete
* @return {JSZip} this JSZip object
*/
remove: function(name) {
name = this.root + name;
var file = this.files[name];
if (!file) {
// Look for any folders
if (name.slice(-1) != "/") {
name += "/";
}
file = this.files[name];
} if (file && !file.dir) {
// file
delete this.files[name];
} else {
// maybe a folder, delete recursively
var kids = this.filter(function(relativePath, file) {
return file.name.slice(0, name.length) === name;
});
for (var i = 0; i < kids.length; i++) {
delete this.files[kids[i].name];
}
} return this;
}, /**
* Generate the complete zip file
* @param {Object} options the options to generate the zip file :
* - base64, (deprecated, use type instead) true to generate base64.
* - compression, "STORE" by default.
* - type, "base64" by default. Values are : string, base64, uint8array, arraybuffer, blob.
* @return {String|Uint8Array|ArrayBuffer|Buffer|Blob} the zip file
*/
generate: function(options) {
options = extend(options || {}, {
base64: true,
compression: "STORE",
type: "base64",
comment: null
}); utils.checkSupport(options.type); var zipData = [],
localDirLength = 0,
centralDirLength = 0,
writer, i,
utfEncodedComment = utils.transformTo("string", this.utf8encode(options.comment || this.comment || "")); // first, generate all the zip parts.
for (var name in this.files) {
if (!this.files.hasOwnProperty(name)) {
continue;
}
var file = this.files[name]; var compressionName = file.options.compression || options.compression.toUpperCase();
var compression = compressions[compressionName];
if (!compression) {
throw new Error(compressionName + " is not a valid compression method !");
} var compressedObject = generateCompressedObjectFrom.call(this, file, compression); var zipPart = generateZipParts.call(this, name, file, compressedObject, localDirLength);
localDirLength += zipPart.fileRecord.length + compressedObject.compressedSize;
centralDirLength += zipPart.dirRecord.length;
zipData.push(zipPart);
} var dirEnd = ""; // end of central dir signature
dirEnd = signature.CENTRAL_DIRECTORY_END +
// number of this disk
"\x00\x00" +
// number of the disk with the start of the central directory
"\x00\x00" +
// total number of entries in the central directory on this disk
decToHex(zipData.length, 2) +
// total number of entries in the central directory
decToHex(zipData.length, 2) +
// size of the central directory 4 bytes
decToHex(centralDirLength, 4) +
// offset of start of central directory with respect to the starting disk number
decToHex(localDirLength, 4) +
// .ZIP file comment length
decToHex(utfEncodedComment.length, 2) +
// .ZIP file comment
utfEncodedComment; // we have all the parts (and the total length)
// time to create a writer !
var typeName = options.type.toLowerCase();
if(typeName==="uint8array"||typeName==="arraybuffer"||typeName==="blob"||typeName==="nodebuffer") {
writer = new Uint8ArrayWriter(localDirLength + centralDirLength + dirEnd.length);
}else{
writer = new StringWriter(localDirLength + centralDirLength + dirEnd.length);
} for (i = 0; i < zipData.length; i++) {
writer.append(zipData[i].fileRecord);
writer.append(zipData[i].compressedObject.compressedContent);
}
for (i = 0; i < zipData.length; i++) {
writer.append(zipData[i].dirRecord);
} writer.append(dirEnd); var zip = writer.finalize(); switch(options.type.toLowerCase()) {
// case "zip is an Uint8Array"
case "uint8array" :
case "arraybuffer" :
case "nodebuffer" :
return utils.transformTo(options.type.toLowerCase(), zip);
case "blob" :
return utils.arrayBuffer2Blob(utils.transformTo("arraybuffer", zip));
// case "zip is a string"
case "base64" :
return (options.base64) ? base64.encode(zip) : zip;
default : // case "string" :
return zip;
} }, /**
* @deprecated
* This method will be removed in a future version without replacement.
*/
crc32: function (input, crc) {
return crc32(input, crc);
}, /**
* @deprecated
* This method will be removed in a future version without replacement.
*/
utf8encode: function (string) {
return utils.transformTo("string", utf8.utf8encode(string));
}, /**
* @deprecated
* This method will be removed in a future version without replacement.
*/
utf8decode: function (input) {
return utf8.utf8decode(input);
}
};
module.exports = out; },{"./base64":1,"./compressedObject":2,"./compressions":3,"./crc32":4,"./defaults":6,"./nodeBuffer":11,"./signature":14,"./stringWriter":16,"./support":17,"./uint8ArrayWriter":19,"./utf8":20,"./utils":21}],14:[function(_dereq_,module,exports){
'use strict';
exports.LOCAL_FILE_HEADER = "PK\x03\x04";
exports.CENTRAL_FILE_HEADER = "PK\x01\x02";
exports.CENTRAL_DIRECTORY_END = "PK\x05\x06";
exports.ZIP64_CENTRAL_DIRECTORY_LOCATOR = "PK\x06\x07";
exports.ZIP64_CENTRAL_DIRECTORY_END = "PK\x06\x06";
exports.DATA_DESCRIPTOR = "PK\x07\x08"; },{}],15:[function(_dereq_,module,exports){
'use strict';
var DataReader = _dereq_('./dataReader');
var utils = _dereq_('./utils'); function StringReader(data, optimizedBinaryString) {
this.data = data;
if (!optimizedBinaryString) {
this.data = utils.string2binary(this.data);
}
this.length = this.data.length;
this.index = 0;
}
StringReader.prototype = new DataReader();
/**
* @see DataReader.byteAt
*/
StringReader.prototype.byteAt = function(i) {
return this.data.charCodeAt(i);
};
/**
* @see DataReader.lastIndexOfSignature
*/
StringReader.prototype.lastIndexOfSignature = function(sig) {
return this.data.lastIndexOf(sig);
};
/**
* @see DataReader.readData
*/
StringReader.prototype.readData = function(size) {
this.checkOffset(size);
// this will work because the constructor applied the "& 0xff" mask.
var result = this.data.slice(this.index, this.index + size);
this.index += size;
return result;
};
module.exports = StringReader; },{"./dataReader":5,"./utils":21}],16:[function(_dereq_,module,exports){
'use strict'; var utils = _dereq_('./utils'); /**
* An object to write any content to a string.
* @constructor
*/
var StringWriter = function() {
this.data = [];
};
StringWriter.prototype = {
/**
* Append any content to the current string.
* @param {Object} input the content to add.
*/
append: function(input) {
input = utils.transformTo("string", input);
this.data.push(input);
},
/**
* Finalize the construction an return the result.
* @return {string} the generated string.
*/
finalize: function() {
return this.data.join("");
}
}; module.exports = StringWriter; },{"./utils":21}],17:[function(_dereq_,module,exports){
(function (Buffer){
'use strict';
exports.base64 = true;
exports.array = true;
exports.string = true;
exports.arraybuffer = typeof ArrayBuffer !== "undefined" && typeof Uint8Array !== "undefined";
// contains true if JSZip can read/generate nodejs Buffer, false otherwise.
// Browserify will provide a Buffer implementation for browsers, which is
// an augmented Uint8Array (i.e., can be used as either Buffer or U8).
exports.nodebuffer = typeof Buffer !== "undefined";
// contains true if JSZip can read/generate Uint8Array, false otherwise.
exports.uint8array = typeof Uint8Array !== "undefined"; if (typeof ArrayBuffer === "undefined") {
exports.blob = false;
}
else {
var buffer = new ArrayBuffer(0);
try {
exports.blob = new Blob([buffer], {
type: "application/zip"
}).size === 0;
}
catch (e) {
try {
var Builder = window.BlobBuilder || window.WebKitBlobBuilder || window.MozBlobBuilder || window.MSBlobBuilder;
var builder = new Builder();
builder.append(buffer);
exports.blob = builder.getBlob('application/zip').size === 0;
}
catch (e) {
exports.blob = false;
}
}
} }).call(this,(typeof Buffer !== "undefined" ? Buffer : undefined))
},{}],18:[function(_dereq_,module,exports){
'use strict';
var DataReader = _dereq_('./dataReader'); function Uint8ArrayReader(data) {
if (data) {
this.data = data;
this.length = this.data.length;
this.index = 0;
}
}
Uint8ArrayReader.prototype = new DataReader();
/**
* @see DataReader.byteAt
*/
Uint8ArrayReader.prototype.byteAt = function(i) {
return this.data[i];
};
/**
* @see DataReader.lastIndexOfSignature
*/
Uint8ArrayReader.prototype.lastIndexOfSignature = function(sig) {
var sig0 = sig.charCodeAt(0),
sig1 = sig.charCodeAt(1),
sig2 = sig.charCodeAt(2),
sig3 = sig.charCodeAt(3);
for (var i = this.length - 4; i >= 0; --i) {
if (this.data[i] === sig0 && this.data[i + 1] === sig1 && this.data[i + 2] === sig2 && this.data[i + 3] === sig3) {
return i;
}
} return -1;
};
/**
* @see DataReader.readData
*/
Uint8ArrayReader.prototype.readData = function(size) {
this.checkOffset(size);
if(size === 0) {
// in IE10, when using subarray(idx, idx), we get the array [0x00] instead of [].
return new Uint8Array(0);
}
var result = this.data.subarray(this.index, this.index + size);
this.index += size;
return result;
};
module.exports = Uint8ArrayReader; },{"./dataReader":5}],19:[function(_dereq_,module,exports){
'use strict'; var utils = _dereq_('./utils'); /**
* An object to write any content to an Uint8Array.
* @constructor
* @param {number} length The length of the array.
*/
var Uint8ArrayWriter = function(length) {
this.data = new Uint8Array(length);
this.index = 0;
};
Uint8ArrayWriter.prototype = {
/**
* Append any content to the current array.
* @param {Object} input the content to add.
*/
append: function(input) {
if (input.length !== 0) {
// with an empty Uint8Array, Opera fails with a "Offset larger than array size"
input = utils.transformTo("uint8array", input);
this.data.set(input, this.index);
this.index += input.length;
}
},
/**
* Finalize the construction an return the result.
* @return {Uint8Array} the generated array.
*/
finalize: function() {
return this.data;
}
}; module.exports = Uint8ArrayWriter; },{"./utils":21}],20:[function(_dereq_,module,exports){
'use strict'; var utils = _dereq_('./utils');
var support = _dereq_('./support');
var nodeBuffer = _dereq_('./nodeBuffer'); /**
* The following functions come from pako, from pako/lib/utils/strings
* released under the MIT license, see pako https://github.com/nodeca/pako/
*/ // Table with utf8 lengths (calculated by first byte of sequence)
// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,
// because max possible codepoint is 0x10ffff
var _utf8len = new Array(256);
for (var i=0; i<256; i++) {
_utf8len[i] = (i >= 252 ? 6 : i >= 248 ? 5 : i >= 240 ? 4 : i >= 224 ? 3 : i >= 192 ? 2 : 1);
}
_utf8len[254]=_utf8len[254]=1; // Invalid sequence start // convert string to array (typed, when possible)
var string2buf = function (str) {
var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0; // count binary size
for (m_pos = 0; m_pos < str_len; m_pos++) {
c = str.charCodeAt(m_pos);
if ((c & 0xfc00) === 0xd800 && (m_pos+1 < str_len)) {
c2 = str.charCodeAt(m_pos+1);
if ((c2 & 0xfc00) === 0xdc00) {
c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);
m_pos++;
}
}
buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;
} // allocate buffer
if (support.uint8array) {
buf = new Uint8Array(buf_len);
} else {
buf = new Array(buf_len);
} // convert
for (i=0, m_pos = 0; i < buf_len; m_pos++) {
c = str.charCodeAt(m_pos);
if ((c & 0xfc00) === 0xd800 && (m_pos+1 < str_len)) {
c2 = str.charCodeAt(m_pos+1);
if ((c2 & 0xfc00) === 0xdc00) {
c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);
m_pos++;
}
}
if (c < 0x80) {
/* one byte */
buf[i++] = c;
} else if (c < 0x800) {
/* two bytes */
buf[i++] = 0xC0 | (c >>> 6);
buf[i++] = 0x80 | (c & 0x3f);
} else if (c < 0x10000) {
/* three bytes */
buf[i++] = 0xE0 | (c >>> 12);
buf[i++] = 0x80 | (c >>> 6 & 0x3f);
buf[i++] = 0x80 | (c & 0x3f);
} else {
/* four bytes */
buf[i++] = 0xf0 | (c >>> 18);
buf[i++] = 0x80 | (c >>> 12 & 0x3f);
buf[i++] = 0x80 | (c >>> 6 & 0x3f);
buf[i++] = 0x80 | (c & 0x3f);
}
} return buf;
}; // Calculate max possible position in utf8 buffer,
// that will not break sequence. If that's not possible
// - (very small limits) return max size as is.
//
// buf[] - utf8 bytes array
// max - length limit (mandatory);
var utf8border = function(buf, max) {
var pos; max = max || buf.length;
if (max > buf.length) { max = buf.length; } // go back from last position, until start of sequence found
pos = max-1;
while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; } // Fuckup - very small and broken sequence,
// return max, because we should return something anyway.
if (pos < 0) { return max; } // If we came to start of buffer - that means vuffer is too small,
// return max too.
if (pos === 0) { return max; } return (pos + _utf8len[buf[pos]] > max) ? pos : max;
}; // convert array to string
var buf2string = function (buf) {
var str, i, out, c, c_len;
var len = buf.length; // Reserve max possible length (2 words per char)
// NB: by unknown reasons, Array is significantly faster for
// String.fromCharCode.apply than Uint16Array.
var utf16buf = new Array(len*2); for (out=0, i=0; i<len;) {
c = buf[i++];
// quick process ascii
if (c < 0x80) { utf16buf[out++] = c; continue; } c_len = _utf8len[c];
// skip 5 & 6 byte codes
if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len-1; continue; } // apply mask on first byte
c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;
// join the rest
while (c_len > 1 && i < len) {
c = (c << 6) | (buf[i++] & 0x3f);
c_len--;
} // terminated by end of string?
if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; } if (c < 0x10000) {
utf16buf[out++] = c;
} else {
c -= 0x10000;
utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);
utf16buf[out++] = 0xdc00 | (c & 0x3ff);
}
} // shrinkBuf(utf16buf, out)
if (utf16buf.length !== out) {
if(utf16buf.subarray) {
utf16buf = utf16buf.subarray(0, out);
} else {
utf16buf.length = out;
}
} // return String.fromCharCode.apply(null, utf16buf);
return utils.applyFromCharCode(utf16buf);
}; // That's all for the pako functions. /**
* Transform a javascript string into an array (typed if possible) of bytes,
* UTF-8 encoded.
* @param {String} str the string to encode
* @return {Array|Uint8Array|Buffer} the UTF-8 encoded string.
*/
exports.utf8encode = function utf8encode(str) {
if (support.nodebuffer) {
return nodeBuffer(str, "utf-8");
} return string2buf(str);
}; /**
* Transform a bytes array (or a representation) representing an UTF-8 encoded
* string into a javascript string.
* @param {Array|Uint8Array|Buffer} buf the data de decode
* @return {String} the decoded string.
*/
exports.utf8decode = function utf8decode(buf) {
if (support.nodebuffer) {
return utils.transformTo("nodebuffer", buf).toString("utf-8");
} buf = utils.transformTo(support.uint8array ? "uint8array" : "array", buf); // return buf2string(buf);
// Chrome prefers to work with "small" chunks of data
// for the method buf2string.
// Firefox and Chrome has their own shortcut, IE doesn't seem to really care.
var result = [], k = 0, len = buf.length, chunk = 65536;
while (k < len) {
var nextBoundary = utf8border(buf, Math.min(k + chunk, len));
if (support.uint8array) {
result.push(buf2string(buf.subarray(k, nextBoundary)));
} else {
result.push(buf2string(buf.slice(k, nextBoundary)));
}
k = nextBoundary;
}
return result.join(""); };
// vim: set shiftwidth=4 softtabstop=4: },{"./nodeBuffer":11,"./support":17,"./utils":21}],21:[function(_dereq_,module,exports){
'use strict';
var support = _dereq_('./support');
var compressions = _dereq_('./compressions');
var nodeBuffer = _dereq_('./nodeBuffer');
/**
* Convert a string to a "binary string" : a string containing only char codes between 0 and 255.
* @param {string} str the string to transform.
* @return {String} the binary string.
*/
exports.string2binary = function(str) {
var result = "";
for (var i = 0; i < str.length; i++) {
result += String.fromCharCode(str.charCodeAt(i) & 0xff);
}
return result;
};
exports.arrayBuffer2Blob = function(buffer) {
exports.checkSupport("blob"); try {
// Blob constructor
return new Blob([buffer], {
type: "application/zip"
});
}
catch (e) { try {
// deprecated, browser only, old way
var Builder = window.BlobBuilder || window.WebKitBlobBuilder || window.MozBlobBuilder || window.MSBlobBuilder;
var builder = new Builder();
builder.append(buffer);
return builder.getBlob('application/zip');
}
catch (e) { // well, fuck ?!
throw new Error("Bug : can't construct the Blob.");
}
} };
/**
* The identity function.
* @param {Object} input the input.
* @return {Object} the same input.
*/
function identity(input) {
return input;
} /**
* Fill in an array with a string.
* @param {String} str the string to use.
* @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to fill in (will be mutated).
* @return {Array|ArrayBuffer|Uint8Array|Buffer} the updated array.
*/
function stringToArrayLike(str, array) {
for (var i = 0; i < str.length; ++i) {
array[i] = str.charCodeAt(i) & 0xFF;
}
return array;
} /**
* Transform an array-like object to a string.
* @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to transform.
* @return {String} the result.
*/
function arrayLikeToString(array) {
// Performances notes :
// --------------------
// String.fromCharCode.apply(null, array) is the fastest, see
// see http://jsperf.com/converting-a-uint8array-to-a-string/2
// but the stack is limited (and we can get huge arrays !).
//
// result += String.fromCharCode(array[i]); generate too many strings !
//
// This code is inspired by http://jsperf.com/arraybuffer-to-string-apply-performance/2
var chunk = 65536;
var result = [],
len = array.length,
type = exports.getTypeOf(array),
k = 0,
canUseApply = true;
try {
switch(type) {
case "uint8array":
String.fromCharCode.apply(null, new Uint8Array(0));
break;
case "nodebuffer":
String.fromCharCode.apply(null, nodeBuffer(0));
break;
}
} catch(e) {
canUseApply = false;
} // no apply : slow and painful algorithm
// default browser on android 4.*
if (!canUseApply) {
var resultStr = "";
for(var i = 0; i < array.length;i++) {
resultStr += String.fromCharCode(array[i]);
}
return resultStr;
}
while (k < len && chunk > 1) {
try {
if (type === "array" || type === "nodebuffer") {
result.push(String.fromCharCode.apply(null, array.slice(k, Math.min(k + chunk, len))));
}
else {
result.push(String.fromCharCode.apply(null, array.subarray(k, Math.min(k + chunk, len))));
}
k += chunk;
}
catch (e) {
chunk = Math.floor(chunk / 2);
}
}
return result.join("");
} exports.applyFromCharCode = arrayLikeToString; /**
* Copy the data from an array-like to an other array-like.
* @param {Array|ArrayBuffer|Uint8Array|Buffer} arrayFrom the origin array.
* @param {Array|ArrayBuffer|Uint8Array|Buffer} arrayTo the destination array which will be mutated.
* @return {Array|ArrayBuffer|Uint8Array|Buffer} the updated destination array.
*/
function arrayLikeToArrayLike(arrayFrom, arrayTo) {
for (var i = 0; i < arrayFrom.length; i++) {
arrayTo[i] = arrayFrom[i];
}
return arrayTo;
} // a matrix containing functions to transform everything into everything.
var transform = {}; // string to ?
transform["string"] = {
"string": identity,
"array": function(input) {
return stringToArrayLike(input, new Array(input.length));
},
"arraybuffer": function(input) {
return transform["string"]["uint8array"](input).buffer;
},
"uint8array": function(input) {
return stringToArrayLike(input, new Uint8Array(input.length));
},
"nodebuffer": function(input) {
return stringToArrayLike(input, nodeBuffer(input.length));
}
}; // array to ?
transform["array"] = {
"string": arrayLikeToString,
"array": identity,
"arraybuffer": function(input) {
return (new Uint8Array(input)).buffer;
},
"uint8array": function(input) {
return new Uint8Array(input);
},
"nodebuffer": function(input) {
return nodeBuffer(input);
}
}; // arraybuffer to ?
transform["arraybuffer"] = {
"string": function(input) {
return arrayLikeToString(new Uint8Array(input));
},
"array": function(input) {
return arrayLikeToArrayLike(new Uint8Array(input), new Array(input.byteLength));
},
"arraybuffer": identity,
"uint8array": function(input) {
return new Uint8Array(input);
},
"nodebuffer": function(input) {
return nodeBuffer(new Uint8Array(input));
}
}; // uint8array to ?
transform["uint8array"] = {
"string": arrayLikeToString,
"array": function(input) {
return arrayLikeToArrayLike(input, new Array(input.length));
},
"arraybuffer": function(input) {
return input.buffer;
},
"uint8array": identity,
"nodebuffer": function(input) {
return nodeBuffer(input);
}
}; // nodebuffer to ?
transform["nodebuffer"] = {
"string": arrayLikeToString,
"array": function(input) {
return arrayLikeToArrayLike(input, new Array(input.length));
},
"arraybuffer": function(input) {
return transform["nodebuffer"]["uint8array"](input).buffer;
},
"uint8array": function(input) {
return arrayLikeToArrayLike(input, new Uint8Array(input.length));
},
"nodebuffer": identity
}; /**
* Transform an input into any type.
* The supported output type are : string, array, uint8array, arraybuffer, nodebuffer.
* If no output type is specified, the unmodified input will be returned.
* @param {String} outputType the output type.
* @param {String|Array|ArrayBuffer|Uint8Array|Buffer} input the input to convert.
* @throws {Error} an Error if the browser doesn't support the requested output type.
*/
exports.transformTo = function(outputType, input) {
if (!input) {
// undefined, null, etc
// an empty string won't harm.
input = "";
}
if (!outputType) {
return input;
}
exports.checkSupport(outputType);
var inputType = exports.getTypeOf(input);
var result = transform[inputType][outputType](input);
return result;
}; /**
* Return the type of the input.
* The type will be in a format valid for JSZip.utils.transformTo : string, array, uint8array, arraybuffer.
* @param {Object} input the input to identify.
* @return {String} the (lowercase) type of the input.
*/
exports.getTypeOf = function(input) {
if (typeof input === "string") {
return "string";
}
if (Object.prototype.toString.call(input) === "[object Array]") {
return "array";
}
if (support.nodebuffer && nodeBuffer.test(input)) {
return "nodebuffer";
}
if (support.uint8array && input instanceof Uint8Array) {
return "uint8array";
}
if (support.arraybuffer && input instanceof ArrayBuffer) {
return "arraybuffer";
}
}; /**
* Throw an exception if the type is not supported.
* @param {String} type the type to check.
* @throws {Error} an Error if the browser doesn't support the requested type.
*/
exports.checkSupport = function(type) {
var supported = support[type.toLowerCase()];
if (!supported) {
throw new Error(type + " is not supported by this browser");
}
};
exports.MAX_VALUE_16BITS = 65535;
exports.MAX_VALUE_32BITS = -1; // well, "\xFF\xFF\xFF\xFF\xFF\xFF\xFF\xFF" is parsed as -1 /**
* Prettify a string read as binary.
* @param {string} str the string to prettify.
* @return {string} a pretty string.
*/
exports.pretty = function(str) {
var res = '',
code, i;
for (i = 0; i < (str || "").length; i++) {
code = str.charCodeAt(i);
res += '\\x' + (code < 16 ? "0" : "") + code.toString(16).toUpperCase();
}
return res;
}; /**
* Find a compression registered in JSZip.
* @param {string} compressionMethod the method magic to find.
* @return {Object|null} the JSZip compression object, null if none found.
*/
exports.findCompression = function(compressionMethod) {
for (var method in compressions) {
if (!compressions.hasOwnProperty(method)) {
continue;
}
if (compressions[method].magic === compressionMethod) {
return compressions[method];
}
}
return null;
};
/**
* Cross-window, cross-Node-context regular expression detection
* @param {Object} object Anything
* @return {Boolean} true if the object is a regular expression,
* false otherwise
*/
exports.isRegExp = function (object) {
return Object.prototype.toString.call(object) === "[object RegExp]";
}; },{"./compressions":3,"./nodeBuffer":11,"./support":17}],22:[function(_dereq_,module,exports){
'use strict';
var StringReader = _dereq_('./stringReader');
var NodeBufferReader = _dereq_('./nodeBufferReader');
var Uint8ArrayReader = _dereq_('./uint8ArrayReader');
var utils = _dereq_('./utils');
var sig = _dereq_('./signature');
var ZipEntry = _dereq_('./zipEntry');
var support = _dereq_('./support');
var jszipProto = _dereq_('./object');
// class ZipEntries {{{
/**
* All the entries in the zip file.
* @constructor
* @param {String|ArrayBuffer|Uint8Array} data the binary stream to load.
* @param {Object} loadOptions Options for loading the stream.
*/
function ZipEntries(data, loadOptions) {
this.files = [];
this.loadOptions = loadOptions;
if (data) {
this.load(data);
}
}
ZipEntries.prototype = {
/**
* Check that the reader is on the speficied signature.
* @param {string} expectedSignature the expected signature.
* @throws {Error} if it is an other signature.
*/
checkSignature: function(expectedSignature) {
var signature = this.reader.readString(4);
if (signature !== expectedSignature) {
throw new Error("Corrupted zip or bug : unexpected signature " + "(" + utils.pretty(signature) + ", expected " + utils.pretty(expectedSignature) + ")");
}
},
/**
* Read the end of the central directory.
*/
readBlockEndOfCentral: function() {
this.diskNumber = this.reader.readInt(2);
this.diskWithCentralDirStart = this.reader.readInt(2);
this.centralDirRecordsOnThisDisk = this.reader.readInt(2);
this.centralDirRecords = this.reader.readInt(2);
this.centralDirSize = this.reader.readInt(4);
this.centralDirOffset = this.reader.readInt(4); this.zipCommentLength = this.reader.readInt(2);
// warning : the encoding depends of the system locale
// On a linux machine with LANG=en_US.utf8, this field is utf8 encoded.
// On a windows machine, this field is encoded with the localized windows code page.
this.zipComment = this.reader.readString(this.zipCommentLength);
// To get consistent behavior with the generation part, we will assume that
// this is utf8 encoded.
this.zipComment = jszipProto.utf8decode(this.zipComment);
},
/**
* Read the end of the Zip 64 central directory.
* Not merged with the method readEndOfCentral :
* The end of central can coexist with its Zip64 brother,
* I don't want to read the wrong number of bytes !
*/
readBlockZip64EndOfCentral: function() {
this.zip64EndOfCentralSize = this.reader.readInt(8);
this.versionMadeBy = this.reader.readString(2);
this.versionNeeded = this.reader.readInt(2);
this.diskNumber = this.reader.readInt(4);
this.diskWithCentralDirStart = this.reader.readInt(4);
this.centralDirRecordsOnThisDisk = this.reader.readInt(8);
this.centralDirRecords = this.reader.readInt(8);
this.centralDirSize = this.reader.readInt(8);
this.centralDirOffset = this.reader.readInt(8); this.zip64ExtensibleData = {};
var extraDataSize = this.zip64EndOfCentralSize - 44,
index = 0,
extraFieldId,
extraFieldLength,
extraFieldValue;
while (index < extraDataSize) {
extraFieldId = this.reader.readInt(2);
extraFieldLength = this.reader.readInt(4);
extraFieldValue = this.reader.readString(extraFieldLength);
this.zip64ExtensibleData[extraFieldId] = {
id: extraFieldId,
length: extraFieldLength,
value: extraFieldValue
};
}
},
/**
* Read the end of the Zip 64 central directory locator.
*/
readBlockZip64EndOfCentralLocator: function() {
this.diskWithZip64CentralDirStart = this.reader.readInt(4);
this.relativeOffsetEndOfZip64CentralDir = this.reader.readInt(8);
this.disksCount = this.reader.readInt(4);
if (this.disksCount > 1) {
throw new Error("Multi-volumes zip are not supported");
}
},
/**
* Read the local files, based on the offset read in the central part.
*/
readLocalFiles: function() {
var i, file;
for (i = 0; i < this.files.length; i++) {
file = this.files[i];
this.reader.setIndex(file.localHeaderOffset);
this.checkSignature(sig.LOCAL_FILE_HEADER);
file.readLocalPart(this.reader);
file.handleUTF8();
}
},
/**
* Read the central directory.
*/
readCentralDir: function() {
var file; this.reader.setIndex(this.centralDirOffset);
while (this.reader.readString(4) === sig.CENTRAL_FILE_HEADER) {
file = new ZipEntry({
zip64: this.zip64
}, this.loadOptions);
file.readCentralPart(this.reader);
this.files.push(file);
}
},
/**
* Read the end of central directory.
*/
readEndOfCentral: function() {
var offset = this.reader.lastIndexOfSignature(sig.CENTRAL_DIRECTORY_END);
if (offset === -1) {
throw new Error("Corrupted zip : can't find end of central directory");
}
this.reader.setIndex(offset);
this.checkSignature(sig.CENTRAL_DIRECTORY_END);
this.readBlockEndOfCentral(); /* extract from the zip spec :
4) If one of the fields in the end of central directory
record is too small to hold required data, the field
should be set to -1 (0xFFFF or 0xFFFFFFFF) and the
ZIP64 format record should be created.
5) The end of central directory record and the
Zip64 end of central directory locator record must
reside on the same disk when splitting or spanning
an archive.
*/
if (this.diskNumber === utils.MAX_VALUE_16BITS || this.diskWithCentralDirStart === utils.MAX_VALUE_16BITS || this.centralDirRecordsOnThisDisk === utils.MAX_VALUE_16BITS || this.centralDirRecords === utils.MAX_VALUE_16BITS || this.centralDirSize === utils.MAX_VALUE_32BITS || this.centralDirOffset === utils.MAX_VALUE_32BITS) {
this.zip64 = true; /*
Warning : the zip64 extension is supported, but ONLY if the 64bits integer read from
the zip file can fit into a 32bits integer. This cannot be solved : Javascript represents
all numbers as 64-bit double precision IEEE 754 floating point numbers.
So, we have 53bits for integers and bitwise operations treat everything as 32bits.
see https://developer.mozilla.org/en-US/docs/JavaScript/Reference/Operators/Bitwise_Operators
and http://www.ecma-international.org/publications/files/ECMA-ST/ECMA-262.pdf section 8.5
*/ // should look for a zip64 EOCD locator
offset = this.reader.lastIndexOfSignature(sig.ZIP64_CENTRAL_DIRECTORY_LOCATOR);
if (offset === -1) {
throw new Error("Corrupted zip : can't find the ZIP64 end of central directory locator");
}
this.reader.setIndex(offset);
this.checkSignature(sig.ZIP64_CENTRAL_DIRECTORY_LOCATOR);
this.readBlockZip64EndOfCentralLocator(); // now the zip64 EOCD record
this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir);
this.checkSignature(sig.ZIP64_CENTRAL_DIRECTORY_END);
this.readBlockZip64EndOfCentral();
}
},
prepareReader: function(data) {
var type = utils.getTypeOf(data);
if (type === "string" && !support.uint8array) {
this.reader = new StringReader(data, this.loadOptions.optimizedBinaryString);
}
else if (type === "nodebuffer") {
this.reader = new NodeBufferReader(data);
}
else {
this.reader = new Uint8ArrayReader(utils.transformTo("uint8array", data));
}
},
/**
* Read a zip file and create ZipEntries.
* @param {String|ArrayBuffer|Uint8Array|Buffer} data the binary string representing a zip file.
*/
load: function(data) {
this.prepareReader(data);
this.readEndOfCentral();
this.readCentralDir();
this.readLocalFiles();
}
};
// }}} end of ZipEntries
module.exports = ZipEntries; },{"./nodeBufferReader":12,"./object":13,"./signature":14,"./stringReader":15,"./support":17,"./uint8ArrayReader":18,"./utils":21,"./zipEntry":23}],23:[function(_dereq_,module,exports){
'use strict';
var StringReader = _dereq_('./stringReader');
var utils = _dereq_('./utils');
var CompressedObject = _dereq_('./compressedObject');
var jszipProto = _dereq_('./object');
// class ZipEntry {{{
/**
* An entry in the zip file.
* @constructor
* @param {Object} options Options of the current file.
* @param {Object} loadOptions Options for loading the stream.
*/
function ZipEntry(options, loadOptions) {
this.options = options;
this.loadOptions = loadOptions;
}
ZipEntry.prototype = {
/**
* say if the file is encrypted.
* @return {boolean} true if the file is encrypted, false otherwise.
*/
isEncrypted: function() {
// bit 1 is set
return (this.bitFlag & 0x0001) === 0x0001;
},
/**
* say if the file has utf-8 filename/comment.
* @return {boolean} true if the filename/comment is in utf-8, false otherwise.
*/
useUTF8: function() {
// bit 11 is set
return (this.bitFlag & 0x0800) === 0x0800;
},
/**
* Prepare the function used to generate the compressed content from this ZipFile.
* @param {DataReader} reader the reader to use.
* @param {number} from the offset from where we should read the data.
* @param {number} length the length of the data to read.
* @return {Function} the callback to get the compressed content (the type depends of the DataReader class).
*/
prepareCompressedContent: function(reader, from, length) {
return function() {
var previousIndex = reader.index;
reader.setIndex(from);
var compressedFileData = reader.readData(length);
reader.setIndex(previousIndex); return compressedFileData;
};
},
/**
* Prepare the function used to generate the uncompressed content from this ZipFile.
* @param {DataReader} reader the reader to use.
* @param {number} from the offset from where we should read the data.
* @param {number} length the length of the data to read.
* @param {JSZip.compression} compression the compression used on this file.
* @param {number} uncompressedSize the uncompressed size to expect.
* @return {Function} the callback to get the uncompressed content (the type depends of the DataReader class).
*/
prepareContent: function(reader, from, length, compression, uncompressedSize) {
return function() { var compressedFileData = utils.transformTo(compression.uncompressInputType, this.getCompressedContent());
var uncompressedFileData = compression.uncompress(compressedFileData); if (uncompressedFileData.length !== uncompressedSize) {
throw new Error("Bug : uncompressed data size mismatch");
} return uncompressedFileData;
};
},
/**
* Read the local part of a zip file and add the info in this object.
* @param {DataReader} reader the reader to use.
*/
readLocalPart: function(reader) {
var compression, localExtraFieldsLength; // we already know everything from the central dir !
// If the central dir data are false, we are doomed.
// On the bright side, the local part is scary : zip64, data descriptors, both, etc.
// The less data we get here, the more reliable this should be.
// Let's skip the whole header and dash to the data !
reader.skip(22);
// in some zip created on windows, the filename stored in the central dir contains \ instead of /.
// Strangely, the filename here is OK.
// I would love to treat these zip files as corrupted (see http://www.info-zip.org/FAQ.html#backslashes
// or APPNOTE#4.4.17.1, "All slashes MUST be forward slashes '/'") but there are a lot of bad zip generators...
// Search "unzip mismatching "local" filename continuing with "central" filename version" on
// the internet.
//
// I think I see the logic here : the central directory is used to display
// content and the local directory is used to extract the files. Mixing / and \
// may be used to display \ to windows users and use / when extracting the files.
// Unfortunately, this lead also to some issues : http://seclists.org/fulldisclosure/2009/Sep/394
this.fileNameLength = reader.readInt(2);
localExtraFieldsLength = reader.readInt(2); // can't be sure this will be the same as the central dir
this.fileName = reader.readString(this.fileNameLength);
reader.skip(localExtraFieldsLength); if (this.compressedSize == -1 || this.uncompressedSize == -1) {
throw new Error("Bug or corrupted zip : didn't get enough informations from the central directory " + "(compressedSize == -1 || uncompressedSize == -1)");
} compression = utils.findCompression(this.compressionMethod);
if (compression === null) { // no compression found
throw new Error("Corrupted zip : compression " + utils.pretty(this.compressionMethod) + " unknown (inner file : " + this.fileName + ")");
}
this.decompressed = new CompressedObject();
this.decompressed.compressedSize = this.compressedSize;
this.decompressed.uncompressedSize = this.uncompressedSize;
this.decompressed.crc32 = this.crc32;
this.decompressed.compressionMethod = this.compressionMethod;
this.decompressed.getCompressedContent = this.prepareCompressedContent(reader, reader.index, this.compressedSize, compression);
this.decompressed.getContent = this.prepareContent(reader, reader.index, this.compressedSize, compression, this.uncompressedSize); // we need to compute the crc32...
if (this.loadOptions.checkCRC32) {
this.decompressed = utils.transformTo("string", this.decompressed.getContent());
if (jszipProto.crc32(this.decompressed) !== this.crc32) {
throw new Error("Corrupted zip : CRC32 mismatch");
}
}
}, /**
* Read the central part of a zip file and add the info in this object.
* @param {DataReader} reader the reader to use.
*/
readCentralPart: function(reader) {
this.versionMadeBy = reader.readString(2);
this.versionNeeded = reader.readInt(2);
this.bitFlag = reader.readInt(2);
this.compressionMethod = reader.readString(2);
this.date = reader.readDate();
this.crc32 = reader.readInt(4);
this.compressedSize = reader.readInt(4);
this.uncompressedSize = reader.readInt(4);
this.fileNameLength = reader.readInt(2);
this.extraFieldsLength = reader.readInt(2);
this.fileCommentLength = reader.readInt(2);
this.diskNumberStart = reader.readInt(2);
this.internalFileAttributes = reader.readInt(2);
this.externalFileAttributes = reader.readInt(4);
this.localHeaderOffset = reader.readInt(4); if (this.isEncrypted()) {
throw new Error("Encrypted zip are not supported");
} this.fileName = reader.readString(this.fileNameLength);
this.readExtraFields(reader);
this.parseZIP64ExtraField(reader);
this.fileComment = reader.readString(this.fileCommentLength); // warning, this is true only for zip with madeBy == DOS (plateform dependent feature)
this.dir = this.externalFileAttributes & 0x00000010 ? true : false;
},
/**
* Parse the ZIP64 extra field and merge the info in the current ZipEntry.
* @param {DataReader} reader the reader to use.
*/
parseZIP64ExtraField: function(reader) { if (!this.extraFields[0x0001]) {
return;
} // should be something, preparing the extra reader
var extraReader = new StringReader(this.extraFields[0x0001].value); // I really hope that these 64bits integer can fit in 32 bits integer, because js
// won't let us have more.
if (this.uncompressedSize === utils.MAX_VALUE_32BITS) {
this.uncompressedSize = extraReader.readInt(8);
}
if (this.compressedSize === utils.MAX_VALUE_32BITS) {
this.compressedSize = extraReader.readInt(8);
}
if (this.localHeaderOffset === utils.MAX_VALUE_32BITS) {
this.localHeaderOffset = extraReader.readInt(8);
}
if (this.diskNumberStart === utils.MAX_VALUE_32BITS) {
this.diskNumberStart = extraReader.readInt(4);
}
},
/**
* Read the central part of a zip file and add the info in this object.
* @param {DataReader} reader the reader to use.
*/
readExtraFields: function(reader) {
var start = reader.index,
extraFieldId,
extraFieldLength,
extraFieldValue; this.extraFields = this.extraFields || {}; while (reader.index < start + this.extraFieldsLength) {
extraFieldId = reader.readInt(2);
extraFieldLength = reader.readInt(2);
extraFieldValue = reader.readString(extraFieldLength); this.extraFields[extraFieldId] = {
id: extraFieldId,
length: extraFieldLength,
value: extraFieldValue
};
}
},
/**
* Apply an UTF8 transformation if needed.
*/
handleUTF8: function() {
if (this.useUTF8()) {
this.fileName = jszipProto.utf8decode(this.fileName);
this.fileComment = jszipProto.utf8decode(this.fileComment);
} else {
var upath = this.findExtraFieldUnicodePath();
if (upath !== null) {
this.fileName = upath;
}
var ucomment = this.findExtraFieldUnicodeComment();
if (ucomment !== null) {
this.fileComment = ucomment;
}
}
}, /**
* Find the unicode path declared in the extra field, if any.
* @return {String} the unicode path, null otherwise.
*/
findExtraFieldUnicodePath: function() {
var upathField = this.extraFields[0x7075];
if (upathField) {
var extraReader = new StringReader(upathField.value); // wrong version
if (extraReader.readInt(1) !== 1) {
return null;
} // the crc of the filename changed, this field is out of date.
if (jszipProto.crc32(this.fileName) !== extraReader.readInt(4)) {
return null;
} return jszipProto.utf8decode(extraReader.readString(upathField.length - 5));
}
return null;
}, /**
* Find the unicode comment declared in the extra field, if any.
* @return {String} the unicode comment, null otherwise.
*/
findExtraFieldUnicodeComment: function() {
var ucommentField = this.extraFields[0x6375];
if (ucommentField) {
var extraReader = new StringReader(ucommentField.value); // wrong version
if (extraReader.readInt(1) !== 1) {
return null;
} // the crc of the comment changed, this field is out of date.
if (jszipProto.crc32(this.fileComment) !== extraReader.readInt(4)) {
return null;
} return jszipProto.utf8decode(extraReader.readString(ucommentField.length - 5));
}
return null;
}
};
module.exports = ZipEntry; },{"./compressedObject":2,"./object":13,"./stringReader":15,"./utils":21}],24:[function(_dereq_,module,exports){
// Top level file is just a mixin of submodules & constants
'use strict'; var assign = _dereq_('./lib/utils/common').assign; var deflate = _dereq_('./lib/deflate');
var inflate = _dereq_('./lib/inflate');
var constants = _dereq_('./lib/zlib/constants'); var pako = {}; assign(pako, deflate, inflate, constants); module.exports = pako;
},{"./lib/deflate":25,"./lib/inflate":26,"./lib/utils/common":27,"./lib/zlib/constants":30}],25:[function(_dereq_,module,exports){
'use strict'; var zlib_deflate = _dereq_('./zlib/deflate.js');
var utils = _dereq_('./utils/common');
var strings = _dereq_('./utils/strings');
var msg = _dereq_('./zlib/messages');
var zstream = _dereq_('./zlib/zstream'); /* Public constants ==========================================================*/
/* ===========================================================================*/ var Z_NO_FLUSH = 0;
var Z_FINISH = 4; var Z_OK = 0;
var Z_STREAM_END = 1; var Z_DEFAULT_COMPRESSION = -1; var Z_DEFAULT_STRATEGY = 0; var Z_DEFLATED = 8; /* ===========================================================================*/ /**
* class Deflate
*
* Generic JS-style wrapper for zlib calls. If you don't need
* streaming behaviour - use more simple functions: [[deflate]],
* [[deflateRaw]] and [[gzip]].
**/ /* internal
* Deflate.chunks -> Array
*
* Chunks of output data, if [[Deflate#onData]] not overriden.
**/ /**
* Deflate.result -> Uint8Array|Array
*
* Compressed result, generated by default [[Deflate#onData]]
* and [[Deflate#onEnd]] handlers. Filled after you push last chunk
* (call [[Deflate#push]] with `Z_FINISH` / `true` param).
**/ /**
* Deflate.err -> Number
*
* Error code after deflate finished. 0 (Z_OK) on success.
* You will not need it in real life, because deflate errors
* are possible only on wrong options or bad `onData` / `onEnd`
* custom handlers.
**/ /**
* Deflate.msg -> String
*
* Error message, if [[Deflate.err]] != 0
**/ /**
* new Deflate(options)
* - options (Object): zlib deflate options.
*
* Creates new deflator instance with specified params. Throws exception
* on bad params. Supported options:
*
* - `level`
* - `windowBits`
* - `memLevel`
* - `strategy`
*
* [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
* for more information on these.
*
* Additional options, for internal needs:
*
* - `chunkSize` - size of generated data chunks (16K by default)
* - `raw` (Boolean) - do raw deflate
* - `gzip` (Boolean) - create gzip wrapper
* - `to` (String) - if equal to 'string', then result will be "binary string"
* (each char code [0..255])
* - `header` (Object) - custom header for gzip
* - `text` (Boolean) - true if compressed data believed to be text
* - `time` (Number) - modification time, unix timestamp
* - `os` (Number) - operation system code
* - `extra` (Array) - array of bytes with extra data (max 65536)
* - `name` (String) - file name (binary string)
* - `comment` (String) - comment (binary string)
* - `hcrc` (Boolean) - true if header crc should be added
*
* ##### Example:
*
* ```javascript
* var pako = require('pako')
* , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])
* , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);
*
* var deflate = new pako.Deflate({ level: 3});
*
* deflate.push(chunk1, false);
* deflate.push(chunk2, true); // true -> last chunk
*
* if (deflate.err) { throw new Error(deflate.err); }
*
* console.log(deflate.result);
* ```
**/
var Deflate = function(options) { this.options = utils.assign({
level: Z_DEFAULT_COMPRESSION,
method: Z_DEFLATED,
chunkSize: 16384,
windowBits: 15,
memLevel: 8,
strategy: Z_DEFAULT_STRATEGY,
to: ''
}, options || {}); var opt = this.options; if (opt.raw && (opt.windowBits > 0)) {
opt.windowBits = -opt.windowBits;
} else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {
opt.windowBits += 16;
} this.err = 0; // error code, if happens (0 = Z_OK)
this.msg = ''; // error message
this.ended = false; // used to avoid multiple onEnd() calls
this.chunks = []; // chunks of compressed data this.strm = new zstream();
this.strm.avail_out = 0; var status = zlib_deflate.deflateInit2(
this.strm,
opt.level,
opt.method,
opt.windowBits,
opt.memLevel,
opt.strategy
); if (status !== Z_OK) {
throw new Error(msg[status]);
} if (opt.header) {
zlib_deflate.deflateSetHeader(this.strm, opt.header);
}
}; /**
* Deflate#push(data[, mode]) -> Boolean
* - data (Uint8Array|Array|String): input data. Strings will be converted to
* utf8 byte sequence.
* - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.
* See constants. Skipped or `false` means Z_NO_FLUSH, `true` meansh Z_FINISH.
*
* Sends input data to deflate pipe, generating [[Deflate#onData]] calls with
* new compressed chunks. Returns `true` on success. The last data block must have
* mode Z_FINISH (or `true`). That flush internal pending buffers and call
* [[Deflate#onEnd]].
*
* On fail call [[Deflate#onEnd]] with error code and return false.
*
* We strongly recommend to use `Uint8Array` on input for best speed (output
* array format is detected automatically). Also, don't skip last param and always
* use the same type in your code (boolean or number). That will improve JS speed.
*
* For regular `Array`-s make sure all elements are [0..255].
*
* ##### Example
*
* ```javascript
* push(chunk, false); // push one of data chunks
* ...
* push(chunk, true); // push last chunk
* ```
**/
Deflate.prototype.push = function(data, mode) {
var strm = this.strm;
var chunkSize = this.options.chunkSize;
var status, _mode; if (this.ended) { return false; } _mode = (mode === ~~mode) ? mode : ((mode === true) ? Z_FINISH : Z_NO_FLUSH); // Convert data if needed
if (typeof data === 'string') {
// If we need to compress text, change encoding to utf8.
strm.input = strings.string2buf(data);
} else {
strm.input = data;
} strm.next_in = 0;
strm.avail_in = strm.input.length; do {
if (strm.avail_out === 0) {
strm.output = new utils.Buf8(chunkSize);
strm.next_out = 0;
strm.avail_out = chunkSize;
}
status = zlib_deflate.deflate(strm, _mode); /* no bad return value */ if (status !== Z_STREAM_END && status !== Z_OK) {
this.onEnd(status);
this.ended = true;
return false;
}
if (strm.avail_out === 0 || (strm.avail_in === 0 && _mode === Z_FINISH)) {
if (this.options.to === 'string') {
this.onData(strings.buf2binstring(utils.shrinkBuf(strm.output, strm.next_out)));
} else {
this.onData(utils.shrinkBuf(strm.output, strm.next_out));
}
}
} while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== Z_STREAM_END); // Finalize on the last chunk.
if (_mode === Z_FINISH) {
status = zlib_deflate.deflateEnd(this.strm);
this.onEnd(status);
this.ended = true;
return status === Z_OK;
} return true;
}; /**
* Deflate#onData(chunk) -> Void
* - chunk (Uint8Array|Array|String): ouput data. Type of array depends
* on js engine support. When string output requested, each chunk
* will be string.
*
* By default, stores data blocks in `chunks[]` property and glue
* those in `onEnd`. Override this handler, if you need another behaviour.
**/
Deflate.prototype.onData = function(chunk) {
this.chunks.push(chunk);
}; /**
* Deflate#onEnd(status) -> Void
* - status (Number): deflate status. 0 (Z_OK) on success,
* other if not.
*
* Called once after you tell deflate that input stream complete
* or error happenned. By default - join collected chunks,
* free memory and fill `results` / `err` properties.
**/
Deflate.prototype.onEnd = function(status) {
// On success - join
if (status === Z_OK) {
if (this.options.to === 'string') {
this.result = this.chunks.join('');
} else {
this.result = utils.flattenChunks(this.chunks);
}
}
this.chunks = [];
this.err = status;
this.msg = this.strm.msg;
}; /**
* deflate(data[, options]) -> Uint8Array|Array|String
* - data (Uint8Array|Array|String): input data to compress.
* - options (Object): zlib deflate options.
*
* Compress `data` with deflate alrorythm and `options`.
*
* Supported options are:
*
* - level
* - windowBits
* - memLevel
* - strategy
*
* [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
* for more information on these.
*
* Sugar (options):
*
* - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify
* negative windowBits implicitly.
* - `to` (String) - if equal to 'string', then result will be "binary string"
* (each char code [0..255])
*
* ##### Example:
*
* ```javascript
* var pako = require('pako')
* , data = Uint8Array([1,2,3,4,5,6,7,8,9]);
*
* console.log(pako.deflate(data));
* ```
**/
function deflate(input, options) {
var deflator = new Deflate(options); deflator.push(input, true); // That will never happens, if you don't cheat with options :)
if (deflator.err) { throw deflator.msg; } return deflator.result;
} /**
* deflateRaw(data[, options]) -> Uint8Array|Array|String
* - data (Uint8Array|Array|String): input data to compress.
* - options (Object): zlib deflate options.
*
* The same as [[deflate]], but creates raw data, without wrapper
* (header and adler32 crc).
**/
function deflateRaw(input, options) {
options = options || {};
options.raw = true;
return deflate(input, options);
} /**
* gzip(data[, options]) -> Uint8Array|Array|String
* - data (Uint8Array|Array|String): input data to compress.
* - options (Object): zlib deflate options.
*
* The same as [[deflate]], but create gzip wrapper instead of
* deflate one.
**/
function gzip(input, options) {
options = options || {};
options.gzip = true;
return deflate(input, options);
} exports.Deflate = Deflate;
exports.deflate = deflate;
exports.deflateRaw = deflateRaw;
exports.gzip = gzip;
},{"./utils/common":27,"./utils/strings":28,"./zlib/deflate.js":32,"./zlib/messages":37,"./zlib/zstream":39}],26:[function(_dereq_,module,exports){
'use strict'; var zlib_inflate = _dereq_('./zlib/inflate.js');
var utils = _dereq_('./utils/common');
var strings = _dereq_('./utils/strings');
var c = _dereq_('./zlib/constants');
var msg = _dereq_('./zlib/messages');
var zstream = _dereq_('./zlib/zstream');
var gzheader = _dereq_('./zlib/gzheader'); /**
* class Inflate
*
* Generic JS-style wrapper for zlib calls. If you don't need
* streaming behaviour - use more simple functions: [[inflate]]
* and [[inflateRaw]].
**/ /* internal
* inflate.chunks -> Array
*
* Chunks of output data, if [[Inflate#onData]] not overriden.
**/ /**
* Inflate.result -> Uint8Array|Array|String
*
* Uncompressed result, generated by default [[Inflate#onData]]
* and [[Inflate#onEnd]] handlers. Filled after you push last chunk
* (call [[Inflate#push]] with `Z_FINISH` / `true` param).
**/ /**
* Inflate.err -> Number
*
* Error code after inflate finished. 0 (Z_OK) on success.
* Should be checked if broken data possible.
**/ /**
* Inflate.msg -> String
*
* Error message, if [[Inflate.err]] != 0
**/ /**
* new Inflate(options)
* - options (Object): zlib inflate options.
*
* Creates new inflator instance with specified params. Throws exception
* on bad params. Supported options:
*
* - `windowBits`
*
* [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
* for more information on these.
*
* Additional options, for internal needs:
*
* - `chunkSize` - size of generated data chunks (16K by default)
* - `raw` (Boolean) - do raw inflate
* - `to` (String) - if equal to 'string', then result will be converted
* from utf8 to utf16 (javascript) string. When string output requested,
* chunk length can differ from `chunkSize`, depending on content.
*
* By default, when no options set, autodetect deflate/gzip data format via
* wrapper header.
*
* ##### Example:
*
* ```javascript
* var pako = require('pako')
* , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])
* , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);
*
* var inflate = new pako.Inflate({ level: 3});
*
* inflate.push(chunk1, false);
* inflate.push(chunk2, true); // true -> last chunk
*
* if (inflate.err) { throw new Error(inflate.err); }
*
* console.log(inflate.result);
* ```
**/
var Inflate = function(options) { this.options = utils.assign({
chunkSize: 16384,
windowBits: 0,
to: ''
}, options || {}); var opt = this.options; // Force window size for `raw` data, if not set directly,
// because we have no header for autodetect.
if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {
opt.windowBits = -opt.windowBits;
if (opt.windowBits === 0) { opt.windowBits = -15; }
} // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate
if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&
!(options && options.windowBits)) {
opt.windowBits += 32;
} // Gzip header has no info about windows size, we can do autodetect only
// for deflate. So, if window size not set, force it to max when gzip possible
if ((opt.windowBits > 15) && (opt.windowBits < 48)) {
// bit 3 (16) -> gzipped data
// bit 4 (32) -> autodetect gzip/deflate
if ((opt.windowBits & 15) === 0) {
opt.windowBits |= 15;
}
} this.err = 0; // error code, if happens (0 = Z_OK)
this.msg = ''; // error message
this.ended = false; // used to avoid multiple onEnd() calls
this.chunks = []; // chunks of compressed data this.strm = new zstream();
this.strm.avail_out = 0; var status = zlib_inflate.inflateInit2(
this.strm,
opt.windowBits
); if (status !== c.Z_OK) {
throw new Error(msg[status]);
} this.header = new gzheader(); zlib_inflate.inflateGetHeader(this.strm, this.header);
}; /**
* Inflate#push(data[, mode]) -> Boolean
* - data (Uint8Array|Array|String): input data
* - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.
* See constants. Skipped or `false` means Z_NO_FLUSH, `true` meansh Z_FINISH.
*
* Sends input data to inflate pipe, generating [[Inflate#onData]] calls with
* new output chunks. Returns `true` on success. The last data block must have
* mode Z_FINISH (or `true`). That flush internal pending buffers and call
* [[Inflate#onEnd]].
*
* On fail call [[Inflate#onEnd]] with error code and return false.
*
* We strongly recommend to use `Uint8Array` on input for best speed (output
* format is detected automatically). Also, don't skip last param and always
* use the same type in your code (boolean or number). That will improve JS speed.
*
* For regular `Array`-s make sure all elements are [0..255].
*
* ##### Example
*
* ```javascript
* push(chunk, false); // push one of data chunks
* ...
* push(chunk, true); // push last chunk
* ```
**/
Inflate.prototype.push = function(data, mode) {
var strm = this.strm;
var chunkSize = this.options.chunkSize;
var status, _mode;
var next_out_utf8, tail, utf8str; if (this.ended) { return false; }
_mode = (mode === ~~mode) ? mode : ((mode === true) ? c.Z_FINISH : c.Z_NO_FLUSH); // Convert data if needed
if (typeof data === 'string') {
// Only binary strings can be decompressed on practice
strm.input = strings.binstring2buf(data);
} else {
strm.input = data;
} strm.next_in = 0;
strm.avail_in = strm.input.length; do {
if (strm.avail_out === 0) {
strm.output = new utils.Buf8(chunkSize);
strm.next_out = 0;
strm.avail_out = chunkSize;
} status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH); /* no bad return value */ if (status !== c.Z_STREAM_END && status !== c.Z_OK) {
this.onEnd(status);
this.ended = true;
return false;
} if (strm.next_out) {
if (strm.avail_out === 0 || status === c.Z_STREAM_END || (strm.avail_in === 0 && _mode === c.Z_FINISH)) { if (this.options.to === 'string') { next_out_utf8 = strings.utf8border(strm.output, strm.next_out); tail = strm.next_out - next_out_utf8;
utf8str = strings.buf2string(strm.output, next_out_utf8); // move tail
strm.next_out = tail;
strm.avail_out = chunkSize - tail;
if (tail) { utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0); } this.onData(utf8str); } else {
this.onData(utils.shrinkBuf(strm.output, strm.next_out));
}
}
}
} while ((strm.avail_in > 0) && status !== c.Z_STREAM_END); if (status === c.Z_STREAM_END) {
_mode = c.Z_FINISH;
}
// Finalize on the last chunk.
if (_mode === c.Z_FINISH) {
status = zlib_inflate.inflateEnd(this.strm);
this.onEnd(status);
this.ended = true;
return status === c.Z_OK;
} return true;
}; /**
* Inflate#onData(chunk) -> Void
* - chunk (Uint8Array|Array|String): ouput data. Type of array depends
* on js engine support. When string output requested, each chunk
* will be string.
*
* By default, stores data blocks in `chunks[]` property and glue
* those in `onEnd`. Override this handler, if you need another behaviour.
**/
Inflate.prototype.onData = function(chunk) {
this.chunks.push(chunk);
}; /**
* Inflate#onEnd(status) -> Void
* - status (Number): inflate status. 0 (Z_OK) on success,
* other if not.
*
* Called once after you tell inflate that input stream complete
* or error happenned. By default - join collected chunks,
* free memory and fill `results` / `err` properties.
**/
Inflate.prototype.onEnd = function(status) {
// On success - join
if (status === c.Z_OK) {
if (this.options.to === 'string') {
// Glue & convert here, until we teach pako to send
// utf8 alligned strings to onData
this.result = this.chunks.join('');
} else {
this.result = utils.flattenChunks(this.chunks);
}
}
this.chunks = [];
this.err = status;
this.msg = this.strm.msg;
}; /**
* inflate(data[, options]) -> Uint8Array|Array|String
* - data (Uint8Array|Array|String): input data to decompress.
* - options (Object): zlib inflate options.
*
* Decompress `data` with inflate/ungzip and `options`. Autodetect
* format via wrapper header by default. That's why we don't provide
* separate `ungzip` method.
*
* Supported options are:
*
* - windowBits
*
* [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
* for more information.
*
* Sugar (options):
*
* - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify
* negative windowBits implicitly.
* - `to` (String) - if equal to 'string', then result will be converted
* from utf8 to utf16 (javascript) string. When string output requested,
* chunk length can differ from `chunkSize`, depending on content.
*
*
* ##### Example:
*
* ```javascript
* var pako = require('pako')
* , input = pako.deflate([1,2,3,4,5,6,7,8,9])
* , output;
*
* try {
* output = pako.inflate(input);
* } catch (err)
* console.log(err);
* }
* ```
**/
function inflate(input, options) {
var inflator = new Inflate(options); inflator.push(input, true); // That will never happens, if you don't cheat with options :)
if (inflator.err) { throw inflator.msg; } return inflator.result;
} /**
* inflateRaw(data[, options]) -> Uint8Array|Array|String
* - data (Uint8Array|Array|String): input data to decompress.
* - options (Object): zlib inflate options.
*
* The same as [[inflate]], but creates raw data, without wrapper
* (header and adler32 crc).
**/
function inflateRaw(input, options) {
options = options || {};
options.raw = true;
return inflate(input, options);
} /**
* ungzip(data[, options]) -> Uint8Array|Array|String
* - data (Uint8Array|Array|String): input data to decompress.
* - options (Object): zlib inflate options.
*
* Just shortcut to [[inflate]], because it autodetects format
* by header.content. Done for convenience.
**/ exports.Inflate = Inflate;
exports.inflate = inflate;
exports.inflateRaw = inflateRaw;
exports.ungzip = inflate; },{"./utils/common":27,"./utils/strings":28,"./zlib/constants":30,"./zlib/gzheader":33,"./zlib/inflate.js":35,"./zlib/messages":37,"./zlib/zstream":39}],27:[function(_dereq_,module,exports){
'use strict'; var TYPED_OK = (typeof Uint8Array !== 'undefined') &&
(typeof Uint16Array !== 'undefined') &&
(typeof Int32Array !== 'undefined'); exports.assign = function (obj /*from1, from2, from3, ...*/) {
var sources = Array.prototype.slice.call(arguments, 1);
while (sources.length) {
var source = sources.shift();
if (!source) { continue; } if (typeof(source) !== 'object') {
throw new TypeError(source + 'must be non-object');
} for (var p in source) {
if (source.hasOwnProperty(p)) {
obj[p] = source[p];
}
}
} return obj;
}; // reduce buffer size, avoiding mem copy
exports.shrinkBuf = function (buf, size) {
if (buf.length === size) { return buf; }
if (buf.subarray) { return buf.subarray(0, size); }
buf.length = size;
return buf;
}; var fnTyped = {
arraySet: function (dest, src, src_offs, len, dest_offs) {
if (src.subarray && dest.subarray) {
dest.set(src.subarray(src_offs, src_offs+len), dest_offs);
return;
}
// Fallback to ordinary array
for(var i=0; i<len; i++) {
dest[dest_offs + i] = src[src_offs + i];
}
},
// Join array of chunks to single array.
flattenChunks: function(chunks) {
var i, l, len, pos, chunk, result; // calculate data length
len = 0;
for (i=0, l=chunks.length; i<l; i++) {
len += chunks[i].length;
} // join chunks
result = new Uint8Array(len);
pos = 0;
for (i=0, l=chunks.length; i<l; i++) {
chunk = chunks[i];
result.set(chunk, pos);
pos += chunk.length;
} return result;
}
}; var fnUntyped = {
arraySet: function (dest, src, src_offs, len, dest_offs) {
for(var i=0; i<len; i++) {
dest[dest_offs + i] = src[src_offs + i];
}
},
// Join array of chunks to single array.
flattenChunks: function(chunks) {
return [].concat.apply([], chunks);
}
}; // Enable/Disable typed arrays use, for testing
//
exports.setTyped = function (on) {
if (on) {
exports.Buf8 = Uint8Array;
exports.Buf16 = Uint16Array;
exports.Buf32 = Int32Array;
exports.assign(exports, fnTyped);
} else {
exports.Buf8 = Array;
exports.Buf16 = Array;
exports.Buf32 = Array;
exports.assign(exports, fnUntyped);
}
}; exports.setTyped(TYPED_OK);
},{}],28:[function(_dereq_,module,exports){
// String encode/decode helpers
'use strict'; var utils = _dereq_('./common'); // Quick check if we can use fast array to bin string conversion
//
// - apply(Array) can fail on Android 2.2
// - apply(Uint8Array) can fail on iOS 5.1 Safary
//
var STR_APPLY_OK = true;
var STR_APPLY_UIA_OK = true; try { String.fromCharCode.apply(null, [0]); } catch(__) { STR_APPLY_OK = false; }
try { String.fromCharCode.apply(null, new Uint8Array(1)); } catch(__) { STR_APPLY_UIA_OK = false; } // Table with utf8 lengths (calculated by first byte of sequence)
// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,
// because max possible codepoint is 0x10ffff
var _utf8len = new utils.Buf8(256);
for (var i=0; i<256; i++) {
_utf8len[i] = (i >= 252 ? 6 : i >= 248 ? 5 : i >= 240 ? 4 : i >= 224 ? 3 : i >= 192 ? 2 : 1);
}
_utf8len[254]=_utf8len[254]=1; // Invalid sequence start // convert string to array (typed, when possible)
exports.string2buf = function (str) {
var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0; // count binary size
for (m_pos = 0; m_pos < str_len; m_pos++) {
c = str.charCodeAt(m_pos);
if ((c & 0xfc00) === 0xd800 && (m_pos+1 < str_len)) {
c2 = str.charCodeAt(m_pos+1);
if ((c2 & 0xfc00) === 0xdc00) {
c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);
m_pos++;
}
}
buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;
} // allocate buffer
buf = new utils.Buf8(buf_len); // convert
for (i=0, m_pos = 0; i < buf_len; m_pos++) {
c = str.charCodeAt(m_pos);
if ((c & 0xfc00) === 0xd800 && (m_pos+1 < str_len)) {
c2 = str.charCodeAt(m_pos+1);
if ((c2 & 0xfc00) === 0xdc00) {
c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);
m_pos++;
}
}
if (c < 0x80) {
/* one byte */
buf[i++] = c;
} else if (c < 0x800) {
/* two bytes */
buf[i++] = 0xC0 | (c >>> 6);
buf[i++] = 0x80 | (c & 0x3f);
} else if (c < 0x10000) {
/* three bytes */
buf[i++] = 0xE0 | (c >>> 12);
buf[i++] = 0x80 | (c >>> 6 & 0x3f);
buf[i++] = 0x80 | (c & 0x3f);
} else {
/* four bytes */
buf[i++] = 0xf0 | (c >>> 18);
buf[i++] = 0x80 | (c >>> 12 & 0x3f);
buf[i++] = 0x80 | (c >>> 6 & 0x3f);
buf[i++] = 0x80 | (c & 0x3f);
}
} return buf;
}; // Helper (used in 2 places)
function buf2binstring(buf, len) {
// use fallback for big arrays to avoid stack overflow
if (len < 65537) {
if ((buf.subarray && STR_APPLY_UIA_OK) || (!buf.subarray && STR_APPLY_OK)) {
return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));
}
} var result = '';
for(var i=0; i < len; i++) {
result += String.fromCharCode(buf[i]);
}
return result;
} // Convert byte array to binary string
exports.buf2binstring = function(buf) {
return buf2binstring(buf, buf.length);
}; // Convert binary string (typed, when possible)
exports.binstring2buf = function(str) {
var buf = new utils.Buf8(str.length);
for(var i=0, len=buf.length; i < len; i++) {
buf[i] = str.charCodeAt(i);
}
return buf;
}; // convert array to string
exports.buf2string = function (buf, max) {
var i, out, c, c_len;
var len = max || buf.length; // Reserve max possible length (2 words per char)
// NB: by unknown reasons, Array is significantly faster for
// String.fromCharCode.apply than Uint16Array.
var utf16buf = new Array(len*2); for (out=0, i=0; i<len;) {
c = buf[i++];
// quick process ascii
if (c < 0x80) { utf16buf[out++] = c; continue; } c_len = _utf8len[c];
// skip 5 & 6 byte codes
if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len-1; continue; } // apply mask on first byte
c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;
// join the rest
while (c_len > 1 && i < len) {
c = (c << 6) | (buf[i++] & 0x3f);
c_len--;
} // terminated by end of string?
if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; } if (c < 0x10000) {
utf16buf[out++] = c;
} else {
c -= 0x10000;
utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);
utf16buf[out++] = 0xdc00 | (c & 0x3ff);
}
} return buf2binstring(utf16buf, out);
}; // Calculate max possible position in utf8 buffer,
// that will not break sequence. If that's not possible
// - (very small limits) return max size as is.
//
// buf[] - utf8 bytes array
// max - length limit (mandatory);
exports.utf8border = function(buf, max) {
var pos; max = max || buf.length;
if (max > buf.length) { max = buf.length; } // go back from last position, until start of sequence found
pos = max-1;
while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; } // Fuckup - very small and broken sequence,
// return max, because we should return something anyway.
if (pos < 0) { return max; } // If we came to start of buffer - that means vuffer is too small,
// return max too.
if (pos === 0) { return max; } return (pos + _utf8len[buf[pos]] > max) ? pos : max;
}; },{"./common":27}],29:[function(_dereq_,module,exports){
'use strict'; // Note: adler32 takes 12% for level 0 and 2% for level 6.
// It doesn't worth to make additional optimizationa as in original.
// Small size is preferable. function adler32(adler, buf, len, pos) {
var s1 = (adler & 0xffff) |0
, s2 = ((adler >>> 16) & 0xffff) |0
, n = 0; while (len !== 0) {
// Set limit ~ twice less than 5552, to keep
// s2 in 31-bits, because we force signed ints.
// in other case %= will fail.
n = len > 2000 ? 2000 : len;
len -= n; do {
s1 = (s1 + buf[pos++]) |0;
s2 = (s2 + s1) |0;
} while (--n); s1 %= 65521;
s2 %= 65521;
} return (s1 | (s2 << 16)) |0;
} module.exports = adler32;
},{}],30:[function(_dereq_,module,exports){
module.exports = { /* Allowed flush values; see deflate() and inflate() below for details */
Z_NO_FLUSH: 0,
Z_PARTIAL_FLUSH: 1,
Z_SYNC_FLUSH: 2,
Z_FULL_FLUSH: 3,
Z_FINISH: 4,
Z_BLOCK: 5,
Z_TREES: 6, /* Return codes for the compression/decompression functions. Negative values
* are errors, positive values are used for special but normal events.
*/
Z_OK: 0,
Z_STREAM_END: 1,
Z_NEED_DICT: 2,
Z_ERRNO: -1,
Z_STREAM_ERROR: -2,
Z_DATA_ERROR: -3,
//Z_MEM_ERROR: -4,
Z_BUF_ERROR: -5,
//Z_VERSION_ERROR: -6, /* compression levels */
Z_NO_COMPRESSION: 0,
Z_BEST_SPEED: 1,
Z_BEST_COMPRESSION: 9,
Z_DEFAULT_COMPRESSION: -1, Z_FILTERED: 1,
Z_HUFFMAN_ONLY: 2,
Z_RLE: 3,
Z_FIXED: 4,
Z_DEFAULT_STRATEGY: 0, /* Possible values of the data_type field (though see inflate()) */
Z_BINARY: 0,
Z_TEXT: 1,
//Z_ASCII: 1, // = Z_TEXT (deprecated)
Z_UNKNOWN: 2, /* The deflate compression method */
Z_DEFLATED: 8
//Z_NULL: null // Use -1 or null inline, depending on var type
};
},{}],31:[function(_dereq_,module,exports){
'use strict'; // Note: we can't get significant speed boost here.
// So write code to minimize size - no pregenerated tables
// and array tools dependencies. // Use ordinary array, since untyped makes no boost here
function makeTable() {
var c, table = []; for(var n =0; n < 256; n++){
c = n;
for(var k =0; k < 8; k++){
c = ((c&1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));
}
table[n] = c;
} return table;
} // Create table on load. Just 255 signed longs. Not a problem.
var crcTable = makeTable(); function crc32(crc, buf, len, pos) {
var t = crcTable
, end = pos + len; crc = crc ^ (-1); for (var i = pos; i < end; i++ ) {
crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];
} return (crc ^ (-1)); // >>> 0;
} module.exports = crc32;
},{}],32:[function(_dereq_,module,exports){
'use strict'; var utils = _dereq_('../utils/common');
var trees = _dereq_('./trees');
var adler32 = _dereq_('./adler32');
var crc32 = _dereq_('./crc32');
var msg = _dereq_('./messages'); /* Public constants ==========================================================*/
/* ===========================================================================*/ /* Allowed flush values; see deflate() and inflate() below for details */
var Z_NO_FLUSH = 0;
var Z_PARTIAL_FLUSH = 1;
//var Z_SYNC_FLUSH = 2;
var Z_FULL_FLUSH = 3;
var Z_FINISH = 4;
var Z_BLOCK = 5;
//var Z_TREES = 6; /* Return codes for the compression/decompression functions. Negative values
* are errors, positive values are used for special but normal events.
*/
var Z_OK = 0;
var Z_STREAM_END = 1;
//var Z_NEED_DICT = 2;
//var Z_ERRNO = -1;
var Z_STREAM_ERROR = -2;
var Z_DATA_ERROR = -3;
//var Z_MEM_ERROR = -4;
var Z_BUF_ERROR = -5;
//var Z_VERSION_ERROR = -6; /* compression levels */
//var Z_NO_COMPRESSION = 0;
//var Z_BEST_SPEED = 1;
//var Z_BEST_COMPRESSION = 9;
var Z_DEFAULT_COMPRESSION = -1; var Z_FILTERED = 1;
var Z_HUFFMAN_ONLY = 2;
var Z_RLE = 3;
var Z_FIXED = 4;
var Z_DEFAULT_STRATEGY = 0; /* Possible values of the data_type field (though see inflate()) */
//var Z_BINARY = 0;
//var Z_TEXT = 1;
//var Z_ASCII = 1; // = Z_TEXT
var Z_UNKNOWN = 2; /* The deflate compression method */
var Z_DEFLATED = 8; /*============================================================================*/ var MAX_MEM_LEVEL = 9;
/* Maximum value for memLevel in deflateInit2 */
var MAX_WBITS = 15;
/* 32K LZ77 window */
var DEF_MEM_LEVEL = 8; var LENGTH_CODES = 29;
/* number of length codes, not counting the special END_BLOCK code */
var LITERALS = 256;
/* number of literal bytes 0..255 */
var L_CODES = LITERALS + 1 + LENGTH_CODES;
/* number of Literal or Length codes, including the END_BLOCK code */
var D_CODES = 30;
/* number of distance codes */
var BL_CODES = 19;
/* number of codes used to transfer the bit lengths */
var HEAP_SIZE = 2*L_CODES + 1;
/* maximum heap size */
var MAX_BITS = 15;
/* All codes must not exceed MAX_BITS bits */ var MIN_MATCH = 3;
var MAX_MATCH = 258;
var MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1); var PRESET_DICT = 0x20; var INIT_STATE = 42;
var EXTRA_STATE = 69;
var NAME_STATE = 73;
var COMMENT_STATE = 91;
var HCRC_STATE = 103;
var BUSY_STATE = 113;
var FINISH_STATE = 666; var BS_NEED_MORE = 1; /* block not completed, need more input or more output */
var BS_BLOCK_DONE = 2; /* block flush performed */
var BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */
var BS_FINISH_DONE = 4; /* finish done, accept no more input or output */ var OS_CODE = 0x03; // Unix :) . Don't detect, use this default. function err(strm, errorCode) {
strm.msg = msg[errorCode];
return errorCode;
} function rank(f) {
return ((f) << 1) - ((f) > 4 ? 9 : 0);
} function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } } /* =========================================================================
* Flush as much pending output as possible. All deflate() output goes
* through this function so some applications may wish to modify it
* to avoid allocating a large strm->output buffer and copying into it.
* (See also read_buf()).
*/
function flush_pending(strm) {
var s = strm.state; //_tr_flush_bits(s);
var len = s.pending;
if (len > strm.avail_out) {
len = strm.avail_out;
}
if (len === 0) { return; } utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);
strm.next_out += len;
s.pending_out += len;
strm.total_out += len;
strm.avail_out -= len;
s.pending -= len;
if (s.pending === 0) {
s.pending_out = 0;
}
} function flush_block_only (s, last) {
trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);
s.block_start = s.strstart;
flush_pending(s.strm);
} function put_byte(s, b) {
s.pending_buf[s.pending++] = b;
} /* =========================================================================
* Put a short in the pending buffer. The 16-bit value is put in MSB order.
* IN assertion: the stream state is correct and there is enough room in
* pending_buf.
*/
function putShortMSB(s, b) {
// put_byte(s, (Byte)(b >> 8));
// put_byte(s, (Byte)(b & 0xff));
s.pending_buf[s.pending++] = (b >>> 8) & 0xff;
s.pending_buf[s.pending++] = b & 0xff;
} /* ===========================================================================
* Read a new buffer from the current input stream, update the adler32
* and total number of bytes read. All deflate() input goes through
* this function so some applications may wish to modify it to avoid
* allocating a large strm->input buffer and copying from it.
* (See also flush_pending()).
*/
function read_buf(strm, buf, start, size) {
var len = strm.avail_in; if (len > size) { len = size; }
if (len === 0) { return 0; } strm.avail_in -= len; utils.arraySet(buf, strm.input, strm.next_in, len, start);
if (strm.state.wrap === 1) {
strm.adler = adler32(strm.adler, buf, len, start);
} else if (strm.state.wrap === 2) {
strm.adler = crc32(strm.adler, buf, len, start);
} strm.next_in += len;
strm.total_in += len; return len;
}
中部分代码
/* ===========================================================================
* Set match_start to the longest match starting at the given string and
* return its length. Matches shorter or equal to prev_length are discarded,
* in which case the result is equal to prev_length and match_start is
* garbage.
* IN assertions: cur_match is the head of the hash chain for the current
* string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
* OUT assertion: the match length is not greater than s->lookahead.
*/
function longest_match(s, cur_match) {
var chain_length = s.max_chain_length; /* max hash chain length */
var scan = s.strstart; /* current string */
var match; /* matched string */
var len; /* length of current match */
var best_len = s.prev_length; /* best match length so far */
var nice_match = s.nice_match; /* stop if match long enough */
var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?
s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/; var _win = s.window; // shortcut var wmask = s.w_mask;
var prev = s.prev; /* Stop when cur_match becomes <= limit. To simplify the code,
* we prevent matches with the string of window index 0.
*/ var strend = s.strstart + MAX_MATCH;
var scan_end1 = _win[scan + best_len - 1];
var scan_end = _win[scan + best_len]; /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
* It is easy to get rid of this optimization if necessary.
*/
// Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); /* Do not waste too much time if we already have a good match: */
if (s.prev_length >= s.good_match) {
chain_length >>= 2;
}
/* Do not look for matches beyond the end of the input. This is necessary
* to make deflate deterministic.
*/
if (nice_match > s.lookahead) { nice_match = s.lookahead; } // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); do {
// Assert(cur_match < s->strstart, "no future");
match = cur_match; /* Skip to next match if the match length cannot increase
* or if the match length is less than 2. Note that the checks below
* for insufficient lookahead only occur occasionally for performance
* reasons. Therefore uninitialized memory will be accessed, and
* conditional jumps will be made that depend on those values.
* However the length of the match is limited to the lookahead, so
* the output of deflate is not affected by the uninitialized values.
*/ if (_win[match + best_len] !== scan_end ||
_win[match + best_len - 1] !== scan_end1 ||
_win[match] !== _win[scan] ||
_win[++match] !== _win[scan + 1]) {
continue;
} /* The check at best_len-1 can be removed because it will be made
* again later. (This heuristic is not always a win.)
* It is not necessary to compare scan[2] and match[2] since they
* are always equal when the other bytes match, given that
* the hash keys are equal and that HASH_BITS >= 8.
*/
scan += 2;
match++;
// Assert(*scan == *match, "match[2]?"); /* We check for insufficient lookahead only every 8th comparison;
* the 256th check will be made at strstart+258.
*/
do {
/*jshint noempty:false*/
} while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
scan < strend); // Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); len = MAX_MATCH - (strend - scan);
scan = strend - MAX_MATCH; if (len > best_len) {
s.match_start = cur_match;
best_len = len;
if (len >= nice_match) {
break;
}
scan_end1 = _win[scan + best_len - 1];
scan_end = _win[scan + best_len];
}
} while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0); if (best_len <= s.lookahead) {
return best_len;
}
return s.lookahead;
} /* ===========================================================================
* Fill the window when the lookahead becomes insufficient.
* Updates strstart and lookahead.
*
* IN assertion: lookahead < MIN_LOOKAHEAD
* OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
* At least one byte has been read, or avail_in == 0; reads are
* performed for at least two bytes (required for the zip translate_eol
* option -- not supported here).
*/
function fill_window(s) {
var _w_size = s.w_size;
var p, n, m, more, str; //Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); do {
more = s.window_size - s.lookahead - s.strstart; // JS ints have 32 bit, block below not needed
/* Deal with !@#$% 64K limit: */
//if (sizeof(int) <= 2) {
// if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
// more = wsize;
//
// } else if (more == (unsigned)(-1)) {
// /* Very unlikely, but possible on 16 bit machine if
// * strstart == 0 && lookahead == 1 (input done a byte at time)
// */
// more--;
// }
//} /* If the window is almost full and there is insufficient lookahead,
* move the upper half to the lower one to make room in the upper half.
*/
if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) { utils.arraySet(s.window, s.window, _w_size, _w_size, 0);
s.match_start -= _w_size;
s.strstart -= _w_size;
/* we now have strstart >= MAX_DIST */
s.block_start -= _w_size; /* Slide the hash table (could be avoided with 32 bit values
at the expense of memory usage). We slide even when level == 0
to keep the hash table consistent if we switch back to level > 0
later. (Using level 0 permanently is not an optimal usage of
zlib, so we don't care about this pathological case.)
*/ n = s.hash_size;
p = n;
do {
m = s.head[--p];
s.head[p] = (m >= _w_size ? m - _w_size : 0);
} while (--n); n = _w_size;
p = n;
do {
m = s.prev[--p];
s.prev[p] = (m >= _w_size ? m - _w_size : 0);
/* If n is not on any hash chain, prev[n] is garbage but
* its value will never be used.
*/
} while (--n); more += _w_size;
}
if (s.strm.avail_in === 0) {
break;
} /* If there was no sliding:
* strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
* more == window_size - lookahead - strstart
* => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
* => more >= window_size - 2*WSIZE + 2
* In the BIG_MEM or MMAP case (not yet supported),
* window_size == input_size + MIN_LOOKAHEAD &&
* strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
* Otherwise, window_size == 2*WSIZE so more >= 2.
* If there was sliding, more >= WSIZE. So in all cases, more >= 2.
*/
//Assert(more >= 2, "more < 2");
n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);
s.lookahead += n; /* Initialize the hash value now that we have some input: */
if (s.lookahead + s.insert >= MIN_MATCH) {
str = s.strstart - s.insert;
s.ins_h = s.window[str]; /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */
s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;
//#if MIN_MATCH != 3
// Call update_hash() MIN_MATCH-3 more times
//#endif
while (s.insert) {
/* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */
s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH-1]) & s.hash_mask; s.prev[str & s.w_mask] = s.head[s.ins_h];
s.head[s.ins_h] = str;
str++;
s.insert--;
if (s.lookahead + s.insert < MIN_MATCH) {
break;
}
}
}
/* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
* but this is not important since only literal bytes will be emitted.
*/ } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0); /* If the WIN_INIT bytes after the end of the current data have never been
* written, then zero those bytes in order to avoid memory check reports of
* the use of uninitialized (or uninitialised as Julian writes) bytes by
* the longest match routines. Update the high water mark for the next
* time through here. WIN_INIT is set to MAX_MATCH since the longest match
* routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.
*/
// if (s.high_water < s.window_size) {
// var curr = s.strstart + s.lookahead;
// var init = 0;
//
// if (s.high_water < curr) {
// /* Previous high water mark below current data -- zero WIN_INIT
// * bytes or up to end of window, whichever is less.
// */
// init = s.window_size - curr;
// if (init > WIN_INIT)
// init = WIN_INIT;
// zmemzero(s->window + curr, (unsigned)init);
// s->high_water = curr + init;
// }
// else if (s->high_water < (ulg)curr + WIN_INIT) {
// /* High water mark at or above current data, but below current data
// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up
// * to end of window, whichever is less.
// */
// init = (ulg)curr + WIN_INIT - s->high_water;
// if (init > s->window_size - s->high_water)
// init = s->window_size - s->high_water;
// zmemzero(s->window + s->high_water, (unsigned)init);
// s->high_water += init;
// }
// }
//
// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
// "not enough room for search");
} /* ===========================================================================
* Copy without compression as much as possible from the input stream, return
* the current block state.
* This function does not insert new strings in the dictionary since
* uncompressible data is probably not useful. This function is used
* only for the level=0 compression option.
* NOTE: this function should be optimized to avoid extra copying from
* window to pending_buf.
*/
function deflate_stored(s, flush) {
/* Stored blocks are limited to 0xffff bytes, pending_buf is limited
* to pending_buf_size, and each stored block has a 5 byte header:
*/
var max_block_size = 0xffff; if (max_block_size > s.pending_buf_size - 5) {
max_block_size = s.pending_buf_size - 5;
} /* Copy as much as possible from input to output: */
for (;;) {
/* Fill the window as much as possible: */
if (s.lookahead <= 1) { //Assert(s->strstart < s->w_size+MAX_DIST(s) ||
// s->block_start >= (long)s->w_size, "slide too late");
// if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||
// s.block_start >= s.w_size)) {
// throw new Error("slide too late");
// } fill_window(s);
if (s.lookahead === 0 && flush === Z_NO_FLUSH) {
return BS_NEED_MORE;
} if (s.lookahead === 0) {
break;
}
/* flush the current block */
}
//Assert(s->block_start >= 0L, "block gone");
// if (s.block_start < 0) throw new Error("block gone"); s.strstart += s.lookahead;
s.lookahead = 0; /* Emit a stored block if pending_buf will be full: */
var max_start = s.block_start + max_block_size; if (s.strstart === 0 || s.strstart >= max_start) {
/* strstart == 0 is possible when wraparound on 16-bit machine */
s.lookahead = s.strstart - max_start;
s.strstart = max_start;
/*** FLUSH_BLOCK(s, 0); ***/
flush_block_only(s, false);
if (s.strm.avail_out === 0) {
return BS_NEED_MORE;
}
/***/ }
/* Flush if we may have to slide, otherwise block_start may become
* negative and the data will be gone:
*/
if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {
/*** FLUSH_BLOCK(s, 0); ***/
flush_block_only(s, false);
if (s.strm.avail_out === 0) {
return BS_NEED_MORE;
}
/***/
}
} s.insert = 0; if (flush === Z_FINISH) {
/*** FLUSH_BLOCK(s, 1); ***/
flush_block_only(s, true);
if (s.strm.avail_out === 0) {
return BS_FINISH_STARTED;
}
/***/
return BS_FINISH_DONE;
} if (s.strstart > s.block_start) {
/*** FLUSH_BLOCK(s, 0); ***/
flush_block_only(s, false);
if (s.strm.avail_out === 0) {
return BS_NEED_MORE;
}
/***/
} return BS_NEED_MORE;
} /* ===========================================================================
* Compress as much as possible from the input stream, return the current
* block state.
* This function does not perform lazy evaluation of matches and inserts
* new strings in the dictionary only for unmatched strings or for short
* matches. It is used only for the fast compression options.
*/
function deflate_fast(s, flush) {
var hash_head; /* head of the hash chain */
var bflush; /* set if current block must be flushed */ for (;;) {
/* Make sure that we always have enough lookahead, except
* at the end of the input file. We need MAX_MATCH bytes
* for the next match, plus MIN_MATCH bytes to insert the
* string following the next match.
*/
if (s.lookahead < MIN_LOOKAHEAD) {
fill_window(s);
if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {
return BS_NEED_MORE;
}
if (s.lookahead === 0) {
break; /* flush the current block */
}
} /* Insert the string window[strstart .. strstart+2] in the
* dictionary, and set hash_head to the head of the hash chain:
*/
hash_head = 0/*NIL*/;
if (s.lookahead >= MIN_MATCH) {
/*** INSERT_STRING(s, s.strstart, hash_head); ***/
s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
s.head[s.ins_h] = s.strstart;
/***/
} /* Find the longest match, discarding those <= prev_length.
* At this point we have always match_length < MIN_MATCH
*/
if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {
/* To simplify the code, we prevent matches with the string
* of window index 0 (in particular we have to avoid a match
* of the string with itself at the start of the input file).
*/
s.match_length = longest_match(s, hash_head);
/* longest_match() sets match_start */
}
if (s.match_length >= MIN_MATCH) {
// check_match(s, s.strstart, s.match_start, s.match_length); // for debug only /*** _tr_tally_dist(s, s.strstart - s.match_start,
s.match_length - MIN_MATCH, bflush); ***/
bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH); s.lookahead -= s.match_length; /* Insert new strings in the hash table only if the match length
* is not too large. This saves time but degrades compression.
*/
if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {
s.match_length--; /* string at strstart already in table */
do {
s.strstart++;
/*** INSERT_STRING(s, s.strstart, hash_head); ***/
s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
s.head[s.ins_h] = s.strstart;
/***/
/* strstart never exceeds WSIZE-MAX_MATCH, so there are
* always MIN_MATCH bytes ahead.
*/
} while (--s.match_length !== 0);
s.strstart++;
} else
{
s.strstart += s.match_length;
s.match_length = 0;
s.ins_h = s.window[s.strstart];
/* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */
s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask; //#if MIN_MATCH != 3
// Call UPDATE_HASH() MIN_MATCH-3 more times
//#endif
/* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
* matter since it will be recomputed at next deflate call.
*/
}
} else {
/* No match, output a literal byte */
//Tracevv((stderr,"%c", s.window[s.strstart]));
/*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
bflush = trees._tr_tally(s, 0, s.window[s.strstart]); s.lookahead--;
s.strstart++;
}
if (bflush) {
/*** FLUSH_BLOCK(s, 0); ***/
flush_block_only(s, false);
if (s.strm.avail_out === 0) {
return BS_NEED_MORE;
}
/***/
}
}
s.insert = ((s.strstart < (MIN_MATCH-1)) ? s.strstart : MIN_MATCH-1);
if (flush === Z_FINISH) {
/*** FLUSH_BLOCK(s, 1); ***/
flush_block_only(s, true);
if (s.strm.avail_out === 0) {
return BS_FINISH_STARTED;
}
/***/
return BS_FINISH_DONE;
}
if (s.last_lit) {
/*** FLUSH_BLOCK(s, 0); ***/
flush_block_only(s, false);
if (s.strm.avail_out === 0) {
return BS_NEED_MORE;
}
/***/
}
return BS_BLOCK_DONE;
} /* ===========================================================================
* Same as above, but achieves better compression. We use a lazy
* evaluation for matches: a match is finally adopted only if there is
* no better match at the next window position.
*/
function deflate_slow(s, flush) {
var hash_head; /* head of hash chain */
var bflush; /* set if current block must be flushed */ var max_insert; /* Process the input block. */
for (;;) {
/* Make sure that we always have enough lookahead, except
* at the end of the input file. We need MAX_MATCH bytes
* for the next match, plus MIN_MATCH bytes to insert the
* string following the next match.
*/
if (s.lookahead < MIN_LOOKAHEAD) {
fill_window(s);
if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {
return BS_NEED_MORE;
}
if (s.lookahead === 0) { break; } /* flush the current block */
} /* Insert the string window[strstart .. strstart+2] in the
* dictionary, and set hash_head to the head of the hash chain:
*/
hash_head = 0/*NIL*/;
if (s.lookahead >= MIN_MATCH) {
/*** INSERT_STRING(s, s.strstart, hash_head); ***/
s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
s.head[s.ins_h] = s.strstart;
/***/
} /* Find the longest match, discarding those <= prev_length.
*/
s.prev_length = s.match_length;
s.prev_match = s.match_start;
s.match_length = MIN_MATCH-1; if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&
s.strstart - hash_head <= (s.w_size-MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {
/* To simplify the code, we prevent matches with the string
* of window index 0 (in particular we have to avoid a match
* of the string with itself at the start of the input file).
*/
s.match_length = longest_match(s, hash_head);
/* longest_match() sets match_start */ if (s.match_length <= 5 &&
(s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) { /* If prev_match is also MIN_MATCH, match_start is garbage
* but we will ignore the current match anyway.
*/
s.match_length = MIN_MATCH-1;
}
}
/* If there was a match at the previous step and the current
* match is not better, output the previous match:
*/
if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {
max_insert = s.strstart + s.lookahead - MIN_MATCH;
/* Do not insert strings in hash table beyond this. */ //check_match(s, s.strstart-1, s.prev_match, s.prev_length); /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,
s.prev_length - MIN_MATCH, bflush);***/
bflush = trees._tr_tally(s, s.strstart - 1- s.prev_match, s.prev_length - MIN_MATCH);
/* Insert in hash table all strings up to the end of the match.
* strstart-1 and strstart are already inserted. If there is not
* enough lookahead, the last two strings are not inserted in
* the hash table.
*/
s.lookahead -= s.prev_length-1;
s.prev_length -= 2;
do {
if (++s.strstart <= max_insert) {
/*** INSERT_STRING(s, s.strstart, hash_head); ***/
s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
s.head[s.ins_h] = s.strstart;
/***/
}
} while (--s.prev_length !== 0);
s.match_available = 0;
s.match_length = MIN_MATCH-1;
s.strstart++; if (bflush) {
/*** FLUSH_BLOCK(s, 0); ***/
flush_block_only(s, false);
if (s.strm.avail_out === 0) {
return BS_NEED_MORE;
}
/***/
} } else if (s.match_available) {
/* If there was no match at the previous position, output a
* single literal. If there was a match but the current match
* is longer, truncate the previous match to a single literal.
*/
//Tracevv((stderr,"%c", s->window[s->strstart-1]));
/*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/
bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]); if (bflush) {
/*** FLUSH_BLOCK_ONLY(s, 0) ***/
flush_block_only(s, false);
/***/
}
s.strstart++;
s.lookahead--;
if (s.strm.avail_out === 0) {
return BS_NEED_MORE;
}
} else {
/* There is no previous match to compare with, wait for
* the next step to decide.
*/
s.match_available = 1;
s.strstart++;
s.lookahead--;
}
}
//Assert (flush != Z_NO_FLUSH, "no flush?");
if (s.match_available) {
//Tracevv((stderr,"%c", s->window[s->strstart-1]));
/*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/
bflush = trees._tr_tally(s, 0, s.window[s.strstart-1]); s.match_available = 0;
}
s.insert = s.strstart < MIN_MATCH-1 ? s.strstart : MIN_MATCH-1;
if (flush === Z_FINISH) {
/*** FLUSH_BLOCK(s, 1); ***/
flush_block_only(s, true);
if (s.strm.avail_out === 0) {
return BS_FINISH_STARTED;
}
/***/
return BS_FINISH_DONE;
}
if (s.last_lit) {
/*** FLUSH_BLOCK(s, 0); ***/
flush_block_only(s, false);
if (s.strm.avail_out === 0) {
return BS_NEED_MORE;
}
/***/
} return BS_BLOCK_DONE;
} /* ===========================================================================
* For Z_RLE, simply look for runs of bytes, generate matches only of distance
* one. Do not maintain a hash table. (It will be regenerated if this run of
* deflate switches away from Z_RLE.)
*/
function deflate_rle(s, flush) {
var bflush; /* set if current block must be flushed */
var prev; /* byte at distance one to match */
var scan, strend; /* scan goes up to strend for length of run */ var _win = s.window; for (;;) {
/* Make sure that we always have enough lookahead, except
* at the end of the input file. We need MAX_MATCH bytes
* for the longest run, plus one for the unrolled loop.
*/
if (s.lookahead <= MAX_MATCH) {
fill_window(s);
if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {
return BS_NEED_MORE;
}
if (s.lookahead === 0) { break; } /* flush the current block */
} /* See how many times the previous byte repeats */
s.match_length = 0;
if (s.lookahead >= MIN_MATCH && s.strstart > 0) {
scan = s.strstart - 1;
prev = _win[scan];
if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {
strend = s.strstart + MAX_MATCH;
do {
/*jshint noempty:false*/
} while (prev === _win[++scan] && prev === _win[++scan] &&
prev === _win[++scan] && prev === _win[++scan] &&
prev === _win[++scan] && prev === _win[++scan] &&
prev === _win[++scan] && prev === _win[++scan] &&
scan < strend);
s.match_length = MAX_MATCH - (strend - scan);
if (s.match_length > s.lookahead) {
s.match_length = s.lookahead;
}
}
//Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan");
} /* Emit match if have run of MIN_MATCH or longer, else emit literal */
if (s.match_length >= MIN_MATCH) {
//check_match(s, s.strstart, s.strstart - 1, s.match_length); /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/
bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH); s.lookahead -= s.match_length;
s.strstart += s.match_length;
s.match_length = 0;
} else {
/* No match, output a literal byte */
//Tracevv((stderr,"%c", s->window[s->strstart]));
/*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
bflush = trees._tr_tally(s, 0, s.window[s.strstart]); s.lookahead--;
s.strstart++;
}
if (bflush) {
/*** FLUSH_BLOCK(s, 0); ***/
flush_block_only(s, false);
if (s.strm.avail_out === 0) {
return BS_NEED_MORE;
}
/***/
}
}
s.insert = 0;
if (flush === Z_FINISH) {
/*** FLUSH_BLOCK(s, 1); ***/
flush_block_only(s, true);
if (s.strm.avail_out === 0) {
return BS_FINISH_STARTED;
}
/***/
return BS_FINISH_DONE;
}
if (s.last_lit) {
/*** FLUSH_BLOCK(s, 0); ***/
flush_block_only(s, false);
if (s.strm.avail_out === 0) {
return BS_NEED_MORE;
}
/***/
}
return BS_BLOCK_DONE;
} /* ===========================================================================
* For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table.
* (It will be regenerated if this run of deflate switches away from Huffman.)
*/
function deflate_huff(s, flush) {
var bflush; /* set if current block must be flushed */ for (;;) {
/* Make sure that we have a literal to write. */
if (s.lookahead === 0) {
fill_window(s);
if (s.lookahead === 0) {
if (flush === Z_NO_FLUSH) {
return BS_NEED_MORE;
}
break; /* flush the current block */
}
} /* Output a literal byte */
s.match_length = 0;
//Tracevv((stderr,"%c", s->window[s->strstart]));
/*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
bflush = trees._tr_tally(s, 0, s.window[s.strstart]);
s.lookahead--;
s.strstart++;
if (bflush) {
/*** FLUSH_BLOCK(s, 0); ***/
flush_block_only(s, false);
if (s.strm.avail_out === 0) {
return BS_NEED_MORE;
}
/***/
}
}
s.insert = 0;
if (flush === Z_FINISH) {
/*** FLUSH_BLOCK(s, 1); ***/
flush_block_only(s, true);
if (s.strm.avail_out === 0) {
return BS_FINISH_STARTED;
}
/***/
return BS_FINISH_DONE;
}
if (s.last_lit) {
/*** FLUSH_BLOCK(s, 0); ***/
flush_block_only(s, false);
if (s.strm.avail_out === 0) {
return BS_NEED_MORE;
}
/***/
}
return BS_BLOCK_DONE;
} /* Values for max_lazy_match, good_match and max_chain_length, depending on
* the desired pack level (0..9). The values given below have been tuned to
* exclude worst case performance for pathological files. Better values may be
* found for specific files.
*/
var Config = function (good_length, max_lazy, nice_length, max_chain, func) {
this.good_length = good_length;
this.max_lazy = max_lazy;
this.nice_length = nice_length;
this.max_chain = max_chain;
this.func = func;
}; var configuration_table; configuration_table = [
/* good lazy nice chain */
new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */
new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */
new Config(4, 5, 16, 8, deflate_fast), /* 2 */
new Config(4, 6, 32, 32, deflate_fast), /* 3 */ new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */
new Config(8, 16, 32, 32, deflate_slow), /* 5 */
new Config(8, 16, 128, 128, deflate_slow), /* 6 */
new Config(8, 32, 128, 256, deflate_slow), /* 7 */
new Config(32, 128, 258, 1024, deflate_slow), /* 8 */
new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */
]; /* ===========================================================================
* Initialize the "longest match" routines for a new zlib stream
*/
function lm_init(s) {
s.window_size = 2 * s.w_size; /*** CLEAR_HASH(s); ***/
zero(s.head); // Fill with NIL (= 0); /* Set the default configuration parameters:
*/
s.max_lazy_match = configuration_table[s.level].max_lazy;
s.good_match = configuration_table[s.level].good_length;
s.nice_match = configuration_table[s.level].nice_length;
s.max_chain_length = configuration_table[s.level].max_chain; s.strstart = 0;
s.block_start = 0;
s.lookahead = 0;
s.insert = 0;
s.match_length = s.prev_length = MIN_MATCH - 1;
s.match_available = 0;
s.ins_h = 0;
} function DeflateState() {
this.strm = null; /* pointer back to this zlib stream */
this.status = 0; /* as the name implies */
this.pending_buf = null; /* output still pending */
this.pending_buf_size = 0; /* size of pending_buf */
this.pending_out = 0; /* next pending byte to output to the stream */
this.pending = 0; /* nb of bytes in the pending buffer */
this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */
this.gzhead = null; /* gzip header information to write */
this.gzindex = 0; /* where in extra, name, or comment */
this.method = Z_DEFLATED; /* can only be DEFLATED */
this.last_flush = -1; /* value of flush param for previous deflate call */ this.w_size = 0; /* LZ77 window size (32K by default) */
this.w_bits = 0; /* log2(w_size) (8..16) */
this.w_mask = 0; /* w_size - 1 */ this.window = null;
/* Sliding window. Input bytes are read into the second half of the window,
* and move to the first half later to keep a dictionary of at least wSize
* bytes. With this organization, matches are limited to a distance of
* wSize-MAX_MATCH bytes, but this ensures that IO is always
* performed with a length multiple of the block size.
*/ this.window_size = 0;
/* Actual size of window: 2*wSize, except when the user input buffer
* is directly used as sliding window.
*/ this.prev = null;
/* Link to older string with same hash index. To limit the size of this
* array to 64K, this link is maintained only for the last 32K strings.
* An index in this array is thus a window index modulo 32K.
*/ this.head = null; /* Heads of the hash chains or NIL. */ this.ins_h = 0; /* hash index of string to be inserted */
this.hash_size = 0; /* number of elements in hash table */
this.hash_bits = 0; /* log2(hash_size) */
this.hash_mask = 0; /* hash_size-1 */ this.hash_shift = 0;
/* Number of bits by which ins_h must be shifted at each input
* step. It must be such that after MIN_MATCH steps, the oldest
* byte no longer takes part in the hash key, that is:
* hash_shift * MIN_MATCH >= hash_bits
*/ this.block_start = 0;
/* Window position at the beginning of the current output block. Gets
* negative when the window is moved backwards.
*/ this.match_length = 0; /* length of best match */
this.prev_match = 0; /* previous match */
this.match_available = 0; /* set if previous match exists */
this.strstart = 0; /* start of string to insert */
this.match_start = 0; /* start of matching string */
this.lookahead = 0; /* number of valid bytes ahead in window */ this.prev_length = 0;
/* Length of the best match at previous step. Matches not greater than this
* are discarded. This is used in the lazy match evaluation.
*/ this.max_chain_length = 0;
/* To speed up deflation, hash chains are never searched beyond this
* length. A higher limit improves compression ratio but degrades the
* speed.
*/ this.max_lazy_match = 0;
/* Attempt to find a better match only when the current match is strictly
* smaller than this value. This mechanism is used only for compression
* levels >= 4.
*/
// That's alias to max_lazy_match, don't use directly
//this.max_insert_length = 0;
/* Insert new strings in the hash table only if the match length is not
* greater than this length. This saves time but degrades compression.
* max_insert_length is used only for compression levels <= 3.
*/ this.level = 0; /* compression level (1..9) */
this.strategy = 0; /* favor or force Huffman coding*/ this.good_match = 0;
/* Use a faster search when the previous match is longer than this */ this.nice_match = 0; /* Stop searching when current match exceeds this */ /* used by trees.c: */ /* Didn't use ct_data typedef below to suppress compiler warning */ // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
// struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
// struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ // Use flat array of DOUBLE size, with interleaved fata,
// because JS does not support effective
this.dyn_ltree = new utils.Buf16(HEAP_SIZE * 2);
this.dyn_dtree = new utils.Buf16((2*D_CODES+1) * 2);
this.bl_tree = new utils.Buf16((2*BL_CODES+1) * 2);
zero(this.dyn_ltree);
zero(this.dyn_dtree);
zero(this.bl_tree); this.l_desc = null; /* desc. for literal tree */
this.d_desc = null; /* desc. for distance tree */
this.bl_desc = null; /* desc. for bit length tree */ //ush bl_count[MAX_BITS+1];
this.bl_count = new utils.Buf16(MAX_BITS+1);
/* number of codes at each bit length for an optimal tree */ //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
this.heap = new utils.Buf16(2*L_CODES+1); /* heap used to build the Huffman trees */
zero(this.heap); this.heap_len = 0; /* number of elements in the heap */
this.heap_max = 0; /* element of largest frequency */
/* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
* The same heap array is used to build all trees.
*/ this.depth = new utils.Buf16(2*L_CODES+1); //uch depth[2*L_CODES+1];
zero(this.depth);
/* Depth of each subtree used as tie breaker for trees of equal frequency
*/ this.l_buf = 0; /* buffer index for literals or lengths */ this.lit_bufsize = 0;
/* Size of match buffer for literals/lengths. There are 4 reasons for
* limiting lit_bufsize to 64K:
* - frequencies can be kept in 16 bit counters
* - if compression is not successful for the first block, all input
* data is still in the window so we can still emit a stored block even
* when input comes from standard input. (This can also be done for
* all blocks if lit_bufsize is not greater than 32K.)
* - if compression is not successful for a file smaller than 64K, we can
* even emit a stored file instead of a stored block (saving 5 bytes).
* This is applicable only for zip (not gzip or zlib).
* - creating new Huffman trees less frequently may not provide fast
* adaptation to changes in the input data statistics. (Take for
* example a binary file with poorly compressible code followed by
* a highly compressible string table.) Smaller buffer sizes give
* fast adaptation but have of course the overhead of transmitting
* trees more frequently.
* - I can't count above 4
*/ this.last_lit = 0; /* running index in l_buf */ this.d_buf = 0;
/* Buffer index for distances. To simplify the code, d_buf and l_buf have
* the same number of elements. To use different lengths, an extra flag
* array would be necessary.
*/ this.opt_len = 0; /* bit length of current block with optimal trees */
this.static_len = 0; /* bit length of current block with static trees */
this.matches = 0; /* number of string matches in current block */
this.insert = 0; /* bytes at end of window left to insert */ this.bi_buf = 0;
/* Output buffer. bits are inserted starting at the bottom (least
* significant bits).
*/
this.bi_valid = 0;
/* Number of valid bits in bi_buf. All bits above the last valid bit
* are always zero.
*/ // Used for window memory init. We safely ignore it for JS. That makes
// sense only for pointers and memory check tools.
//this.high_water = 0;
/* High water mark offset in window for initialized bytes -- bytes above
* this are set to zero in order to avoid memory check warnings when
* longest match routines access bytes past the input. This is then
* updated to the new high water mark.
*/
} function deflateResetKeep(strm) {
var s; if (!strm || !strm.state) {
return err(strm, Z_STREAM_ERROR);
} strm.total_in = strm.total_out = 0;
strm.data_type = Z_UNKNOWN; s = strm.state;
s.pending = 0;
s.pending_out = 0; if (s.wrap < 0) {
s.wrap = -s.wrap;
/* was made negative by deflate(..., Z_FINISH); */
}
s.status = (s.wrap ? INIT_STATE : BUSY_STATE);
strm.adler = (s.wrap === 2) ?
0 // crc32(0, Z_NULL, 0)
:
1; // adler32(0, Z_NULL, 0)
s.last_flush = Z_NO_FLUSH;
trees._tr_init(s);
return Z_OK;
} function deflateReset(strm) {
var ret = deflateResetKeep(strm);
if (ret === Z_OK) {
lm_init(strm.state);
}
return ret;
} function deflateSetHeader(strm, head) {
if (!strm || !strm.state) { return Z_STREAM_ERROR; }
if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }
strm.state.gzhead = head;
return Z_OK;
} function deflateInit2(strm, level, method, windowBits, memLevel, strategy) {
if (!strm) { // === Z_NULL
return Z_STREAM_ERROR;
}
var wrap = 1; if (level === Z_DEFAULT_COMPRESSION) {
level = 6;
} if (windowBits < 0) { /* suppress zlib wrapper */
wrap = 0;
windowBits = -windowBits;
} else if (windowBits > 15) {
wrap = 2; /* write gzip wrapper instead */
windowBits -= 16;
} if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||
windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||
strategy < 0 || strategy > Z_FIXED) {
return err(strm, Z_STREAM_ERROR);
} if (windowBits === 8) {
windowBits = 9;
}
/* until 256-byte window bug fixed */ var s = new DeflateState(); strm.state = s;
s.strm = strm; s.wrap = wrap;
s.gzhead = null;
s.w_bits = windowBits;
s.w_size = 1 << s.w_bits;
s.w_mask = s.w_size - 1; s.hash_bits = memLevel + 7;
s.hash_size = 1 << s.hash_bits;
s.hash_mask = s.hash_size - 1;
s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH); s.window = new utils.Buf8(s.w_size * 2);
s.head = new utils.Buf16(s.hash_size);
s.prev = new utils.Buf16(s.w_size); // Don't need mem init magic for JS.
//s.high_water = 0; /* nothing written to s->window yet */ s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */ s.pending_buf_size = s.lit_bufsize * 4;
s.pending_buf = new utils.Buf8(s.pending_buf_size); s.d_buf = s.lit_bufsize >> 1;
s.l_buf = (1 + 2) * s.lit_bufsize; s.level = level;
s.strategy = strategy;
s.method = method; return deflateReset(strm);
} function deflateInit(strm, level) {
return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);
} function deflate(strm, flush) {
var old_flush, s;
var beg, val; // for gzip header write only if (!strm || !strm.state ||
flush > Z_BLOCK || flush < 0) {
return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;
} s = strm.state; if (!strm.output ||
(!strm.input && strm.avail_in !== 0) ||
(s.status === FINISH_STATE && flush !== Z_FINISH)) {
return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);
} s.strm = strm; /* just in case */
old_flush = s.last_flush;
s.last_flush = flush; /* Write the header */
if (s.status === INIT_STATE) { if (s.wrap === 2) { // GZIP header
strm.adler = 0; //crc32(0L, Z_NULL, 0);
put_byte(s, 31);
put_byte(s, 139);
put_byte(s, 8);
if (!s.gzhead) { // s->gzhead == Z_NULL
put_byte(s, 0);
put_byte(s, 0);
put_byte(s, 0);
put_byte(s, 0);
put_byte(s, 0);
put_byte(s, s.level === 9 ? 2 :
(s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?
4 : 0));
put_byte(s, OS_CODE);
s.status = BUSY_STATE;
}
else {
put_byte(s, (s.gzhead.text ? 1 : 0) +
(s.gzhead.hcrc ? 2 : 0) +
(!s.gzhead.extra ? 0 : 4) +
(!s.gzhead.name ? 0 : 8) +
(!s.gzhead.comment ? 0 : 16)
);
put_byte(s, s.gzhead.time & 0xff);
put_byte(s, (s.gzhead.time >> 8) & 0xff);
put_byte(s, (s.gzhead.time >> 16) & 0xff);
put_byte(s, (s.gzhead.time >> 24) & 0xff);
put_byte(s, s.level === 9 ? 2 :
(s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?
4 : 0));
put_byte(s, s.gzhead.os & 0xff);
if (s.gzhead.extra && s.gzhead.extra.length) {
put_byte(s, s.gzhead.extra.length & 0xff);
put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);
}
if (s.gzhead.hcrc) {
strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);
}
s.gzindex = 0;
s.status = EXTRA_STATE;
}
}
else // DEFLATE header
{
var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;
var level_flags = -1; if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {
level_flags = 0;
} else if (s.level < 6) {
level_flags = 1;
} else if (s.level === 6) {
level_flags = 2;
} else {
level_flags = 3;
}
header |= (level_flags << 6);
if (s.strstart !== 0) { header |= PRESET_DICT; }
header += 31 - (header % 31); s.status = BUSY_STATE;
putShortMSB(s, header); /* Save the adler32 of the preset dictionary: */
if (s.strstart !== 0) {
putShortMSB(s, strm.adler >>> 16);
putShortMSB(s, strm.adler & 0xffff);
}
strm.adler = 1; // adler32(0L, Z_NULL, 0);
}
} //#ifdef GZIP
if (s.status === EXTRA_STATE) {
if (s.gzhead.extra/* != Z_NULL*/) {
beg = s.pending; /* start of bytes to update crc */ while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {
if (s.pending === s.pending_buf_size) {
if (s.gzhead.hcrc && s.pending > beg) {
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
}
flush_pending(strm);
beg = s.pending;
if (s.pending === s.pending_buf_size) {
break;
}
}
put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);
s.gzindex++;
}
if (s.gzhead.hcrc && s.pending > beg) {
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
}
if (s.gzindex === s.gzhead.extra.length) {
s.gzindex = 0;
s.status = NAME_STATE;
}
}
else {
s.status = NAME_STATE;
}
}
if (s.status === NAME_STATE) {
if (s.gzhead.name/* != Z_NULL*/) {
beg = s.pending; /* start of bytes to update crc */
//int val; do {
if (s.pending === s.pending_buf_size) {
if (s.gzhead.hcrc && s.pending > beg) {
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
}
flush_pending(strm);
beg = s.pending;
if (s.pending === s.pending_buf_size) {
val = 1;
break;
}
}
// JS specific: little magic to add zero terminator to end of string
if (s.gzindex < s.gzhead.name.length) {
val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;
} else {
val = 0;
}
put_byte(s, val);
} while (val !== 0); if (s.gzhead.hcrc && s.pending > beg){
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
}
if (val === 0) {
s.gzindex = 0;
s.status = COMMENT_STATE;
}
}
else {
s.status = COMMENT_STATE;
}
}
if (s.status === COMMENT_STATE) {
if (s.gzhead.comment/* != Z_NULL*/) {
beg = s.pending; /* start of bytes to update crc */
//int val; do {
if (s.pending === s.pending_buf_size) {
if (s.gzhead.hcrc && s.pending > beg) {
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
}
flush_pending(strm);
beg = s.pending;
if (s.pending === s.pending_buf_size) {
val = 1;
break;
}
}
// JS specific: little magic to add zero terminator to end of string
if (s.gzindex < s.gzhead.comment.length) {
val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;
} else {
val = 0;
}
put_byte(s, val);
} while (val !== 0); if (s.gzhead.hcrc && s.pending > beg) {
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
}
if (val === 0) {
s.status = HCRC_STATE;
}
}
else {
s.status = HCRC_STATE;
}
}
if (s.status === HCRC_STATE) {
if (s.gzhead.hcrc) {
if (s.pending + 2 > s.pending_buf_size) {
flush_pending(strm);
}
if (s.pending + 2 <= s.pending_buf_size) {
put_byte(s, strm.adler & 0xff);
put_byte(s, (strm.adler >> 8) & 0xff);
strm.adler = 0; //crc32(0L, Z_NULL, 0);
s.status = BUSY_STATE;
}
}
else {
s.status = BUSY_STATE;
}
}
//#endif /* Flush as much pending output as possible */
if (s.pending !== 0) {
flush_pending(strm);
if (strm.avail_out === 0) {
/* Since avail_out is 0, deflate will be called again with
* more output space, but possibly with both pending and
* avail_in equal to zero. There won't be anything to do,
* but this is not an error situation so make sure we
* return OK instead of BUF_ERROR at next call of deflate:
*/
s.last_flush = -1;
return Z_OK;
} /* Make sure there is something to do and avoid duplicate consecutive
* flushes. For repeated and useless calls with Z_FINISH, we keep
* returning Z_STREAM_END instead of Z_BUF_ERROR.
*/
} else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&
flush !== Z_FINISH) {
return err(strm, Z_BUF_ERROR);
} /* User must not provide more input after the first FINISH: */
if (s.status === FINISH_STATE && strm.avail_in !== 0) {
return err(strm, Z_BUF_ERROR);
} /* Start a new block or continue the current one.
*/
if (strm.avail_in !== 0 || s.lookahead !== 0 ||
(flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {
var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :
(s.strategy === Z_RLE ? deflate_rle(s, flush) :
configuration_table[s.level].func(s, flush)); if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {
s.status = FINISH_STATE;
}
if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {
if (strm.avail_out === 0) {
s.last_flush = -1;
/* avoid BUF_ERROR next call, see above */
}
return Z_OK;
/* If flush != Z_NO_FLUSH && avail_out == 0, the next call
* of deflate should use the same flush parameter to make sure
* that the flush is complete. So we don't have to output an
* empty block here, this will be done at next call. This also
* ensures that for a very small output buffer, we emit at most
* one empty block.
*/
}
if (bstate === BS_BLOCK_DONE) {
if (flush === Z_PARTIAL_FLUSH) {
trees._tr_align(s);
}
else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */ trees._tr_stored_block(s, 0, 0, false);
/* For a full flush, this empty block will be recognized
* as a special marker by inflate_sync().
*/
if (flush === Z_FULL_FLUSH) {
/*** CLEAR_HASH(s); ***/ /* forget history */
zero(s.head); // Fill with NIL (= 0); if (s.lookahead === 0) {
s.strstart = 0;
s.block_start = 0;
s.insert = 0;
}
}
}
flush_pending(strm);
if (strm.avail_out === 0) {
s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */
return Z_OK;
}
}
}
//Assert(strm->avail_out > 0, "bug2");
//if (strm.avail_out <= 0) { throw new Error("bug2");} if (flush !== Z_FINISH) { return Z_OK; }
if (s.wrap <= 0) { return Z_STREAM_END; } /* Write the trailer */
if (s.wrap === 2) {
put_byte(s, strm.adler & 0xff);
put_byte(s, (strm.adler >> 8) & 0xff);
put_byte(s, (strm.adler >> 16) & 0xff);
put_byte(s, (strm.adler >> 24) & 0xff);
put_byte(s, strm.total_in & 0xff);
put_byte(s, (strm.total_in >> 8) & 0xff);
put_byte(s, (strm.total_in >> 16) & 0xff);
put_byte(s, (strm.total_in >> 24) & 0xff);
}
else
{
putShortMSB(s, strm.adler >>> 16);
putShortMSB(s, strm.adler & 0xffff);
} flush_pending(strm);
/* If avail_out is zero, the application will call deflate again
* to flush the rest.
*/
if (s.wrap > 0) { s.wrap = -s.wrap; }
/* write the trailer only once! */
return s.pending !== 0 ? Z_OK : Z_STREAM_END;
} function deflateEnd(strm) {
var status; if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {
return Z_STREAM_ERROR;
} status = strm.state.status;
if (status !== INIT_STATE &&
status !== EXTRA_STATE &&
status !== NAME_STATE &&
status !== COMMENT_STATE &&
status !== HCRC_STATE &&
status !== BUSY_STATE &&
status !== FINISH_STATE
) {
return err(strm, Z_STREAM_ERROR);
} strm.state = null; return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;
} /* =========================================================================
* Copy the source state to the destination state
*/
//function deflateCopy(dest, source) {
//
//} exports.deflateInit = deflateInit;
exports.deflateInit2 = deflateInit2;
exports.deflateReset = deflateReset;
exports.deflateResetKeep = deflateResetKeep;
exports.deflateSetHeader = deflateSetHeader;
exports.deflate = deflate;
exports.deflateEnd = deflateEnd;
exports.deflateInfo = 'pako deflate (from Nodeca project)'; /* Not implemented
exports.deflateBound = deflateBound;
exports.deflateCopy = deflateCopy;
exports.deflateSetDictionary = deflateSetDictionary;
exports.deflateParams = deflateParams;
exports.deflatePending = deflatePending;
exports.deflatePrime = deflatePrime;
exports.deflateTune = deflateTune;
*/
},{"../utils/common":27,"./adler32":29,"./crc32":31,"./messages":37,"./trees":38}],33:[function(_dereq_,module,exports){
'use strict'; function GZheader() {
/* true if compressed data believed to be text */
this.text = 0;
/* modification time */
this.time = 0;
/* extra flags (not used when writing a gzip file) */
this.xflags = 0;
/* operating system */
this.os = 0;
/* pointer to extra field or Z_NULL if none */
this.extra = null;
/* extra field length (valid if extra != Z_NULL) */
this.extra_len = 0; // Actually, we don't need it in JS,
// but leave for few code modifications //
// Setup limits is not necessary because in js we should not preallocate memory
// for inflate use constant limit in 65536 bytes
// /* space at extra (only when reading header) */
// this.extra_max = 0;
/* pointer to zero-terminated file name or Z_NULL */
this.name = '';
/* space at name (only when reading header) */
// this.name_max = 0;
/* pointer to zero-terminated comment or Z_NULL */
this.comment = '';
/* space at comment (only when reading header) */
// this.comm_max = 0;
/* true if there was or will be a header crc */
this.hcrc = 0;
/* true when done reading gzip header (not used when writing a gzip file) */
this.done = false;
} module.exports = GZheader;
},{}],34:[function(_dereq_,module,exports){
'use strict'; // See state defs from inflate.js
var BAD = 30; /* got a data error -- remain here until reset */
var TYPE = 12; /* i: waiting for type bits, including last-flag bit */ /*
Decode literal, length, and distance codes and write out the resulting
literal and match bytes until either not enough input or output is
available, an end-of-block is encountered, or a data error is encountered.
When large enough input and output buffers are supplied to inflate(), for
example, a 16K input buffer and a 64K output buffer, more than 95% of the
inflate execution time is spent in this routine. Entry assumptions: state.mode === LEN
strm.avail_in >= 6
strm.avail_out >= 258
start >= strm.avail_out
state.bits < 8 On return, state.mode is one of: LEN -- ran out of enough output space or enough available input
TYPE -- reached end of block code, inflate() to interpret next block
BAD -- error in block data Notes: - The maximum input bits used by a length/distance pair is 15 bits for the
length code, 5 bits for the length extra, 15 bits for the distance code,
and 13 bits for the distance extra. This totals 48 bits, or six bytes.
Therefore if strm.avail_in >= 6, then there is enough input to avoid
checking for available input while decoding. - The maximum bytes that a single length/distance pair can output is 258
bytes, which is the maximum length that can be coded. inflate_fast()
requires strm.avail_out >= 258 for each loop to avoid checking for
output space.
*/
module.exports = function inflate_fast(strm, start) {
var state;
var _in; /* local strm.input */
var last; /* have enough input while in < last */
var _out; /* local strm.output */
var beg; /* inflate()'s initial strm.output */
var end; /* while out < end, enough space available */
//#ifdef INFLATE_STRICT
var dmax; /* maximum distance from zlib header */
//#endif
var wsize; /* window size or zero if not using window */
var whave; /* valid bytes in the window */
var wnext; /* window write index */
var window; /* allocated sliding window, if wsize != 0 */
var hold; /* local strm.hold */
var bits; /* local strm.bits */
var lcode; /* local strm.lencode */
var dcode; /* local strm.distcode */
var lmask; /* mask for first level of length codes */
var dmask; /* mask for first level of distance codes */
var here; /* retrieved table entry */
var op; /* code bits, operation, extra bits, or */
/* window position, window bytes to copy */
var len; /* match length, unused bytes */
var dist; /* match distance */
var from; /* where to copy match from */
var from_source; var input, output; // JS specific, because we have no pointers /* copy state to local variables */
state = strm.state;
//here = state.here;
_in = strm.next_in;
input = strm.input;
last = _in + (strm.avail_in - 5);
_out = strm.next_out;
output = strm.output;
beg = _out - (start - strm.avail_out);
end = _out + (strm.avail_out - 257);
//#ifdef INFLATE_STRICT
dmax = state.dmax;
//#endif
wsize = state.wsize;
whave = state.whave;
wnext = state.wnext;
window = state.window;
hold = state.hold;
bits = state.bits;
lcode = state.lencode;
dcode = state.distcode;
lmask = (1 << state.lenbits) - 1;
dmask = (1 << state.distbits) - 1; /* decode literals and length/distances until end-of-block or not enough
input data or output space */ top:
do {
if (bits < 15) {
hold += input[_in++] << bits;
bits += 8;
hold += input[_in++] << bits;
bits += 8;
} here = lcode[hold & lmask]; dolen:
for (;;) { // Goto emulation
op = here >>> 24/*here.bits*/;
hold >>>= op;
bits -= op;
op = (here >>> 16) & 0xff/*here.op*/;
if (op === 0) { /* literal */
//Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
// "inflate: literal '%c'\n" :
// "inflate: literal 0x%02x\n", here.val));
output[_out++] = here & 0xffff/*here.val*/;
}
else if (op & 16) { /* length base */
len = here & 0xffff/*here.val*/;
op &= 15; /* number of extra bits */
if (op) {
if (bits < op) {
hold += input[_in++] << bits;
bits += 8;
}
len += hold & ((1 << op) - 1);
hold >>>= op;
bits -= op;
}
//Tracevv((stderr, "inflate: length %u\n", len));
if (bits < 15) {
hold += input[_in++] << bits;
bits += 8;
hold += input[_in++] << bits;
bits += 8;
}
here = dcode[hold & dmask]; dodist:
for (;;) { // goto emulation
op = here >>> 24/*here.bits*/;
hold >>>= op;
bits -= op;
op = (here >>> 16) & 0xff/*here.op*/; if (op & 16) { /* distance base */
dist = here & 0xffff/*here.val*/;
op &= 15; /* number of extra bits */
if (bits < op) {
hold += input[_in++] << bits;
bits += 8;
if (bits < op) {
hold += input[_in++] << bits;
bits += 8;
}
}
dist += hold & ((1 << op) - 1);
//#ifdef INFLATE_STRICT
if (dist > dmax) {
strm.msg = 'invalid distance too far back';
state.mode = BAD;
break top;
}
//#endif
hold >>>= op;
bits -= op;
//Tracevv((stderr, "inflate: distance %u\n", dist));
op = _out - beg; /* max distance in output */
if (dist > op) { /* see if copy from window */
op = dist - op; /* distance back in window */
if (op > whave) {
if (state.sane) {
strm.msg = 'invalid distance too far back';
state.mode = BAD;
break top;
} // (!) This block is disabled in zlib defailts,
// don't enable it for binary compatibility
//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
// if (len <= op - whave) {
// do {
// output[_out++] = 0;
// } while (--len);
// continue top;
// }
// len -= op - whave;
// do {
// output[_out++] = 0;
// } while (--op > whave);
// if (op === 0) {
// from = _out - dist;
// do {
// output[_out++] = output[from++];
// } while (--len);
// continue top;
// }
//#endif
}
from = 0; // window index
from_source = window;
if (wnext === 0) { /* very common case */
from += wsize - op;
if (op < len) { /* some from window */
len -= op;
do {
output[_out++] = window[from++];
} while (--op);
from = _out - dist; /* rest from output */
from_source = output;
}
}
else if (wnext < op) { /* wrap around window */
from += wsize + wnext - op;
op -= wnext;
if (op < len) { /* some from end of window */
len -= op;
do {
output[_out++] = window[from++];
} while (--op);
from = 0;
if (wnext < len) { /* some from start of window */
op = wnext;
len -= op;
do {
output[_out++] = window[from++];
} while (--op);
from = _out - dist; /* rest from output */
from_source = output;
}
}
}
else { /* contiguous in window */
from += wnext - op;
if (op < len) { /* some from window */
len -= op;
do {
output[_out++] = window[from++];
} while (--op);
from = _out - dist; /* rest from output */
from_source = output;
}
}
while (len > 2) {
output[_out++] = from_source[from++];
output[_out++] = from_source[from++];
output[_out++] = from_source[from++];
len -= 3;
}
if (len) {
output[_out++] = from_source[from++];
if (len > 1) {
output[_out++] = from_source[from++];
}
}
}
else {
from = _out - dist; /* copy direct from output */
do { /* minimum length is three */
output[_out++] = output[from++];
output[_out++] = output[from++];
output[_out++] = output[from++];
len -= 3;
} while (len > 2);
if (len) {
output[_out++] = output[from++];
if (len > 1) {
output[_out++] = output[from++];
}
}
}
}
else if ((op & 64) === 0) { /* 2nd level distance code */
here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];
continue dodist;
}
else {
strm.msg = 'invalid distance code';
state.mode = BAD;
break top;
} break; // need to emulate goto via "continue"
}
}
else if ((op & 64) === 0) { /* 2nd level length code */
here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];
continue dolen;
}
else if (op & 32) { /* end-of-block */
//Tracevv((stderr, "inflate: end of block\n"));
state.mode = TYPE;
break top;
}
else {
strm.msg = 'invalid literal/length code';
state.mode = BAD;
break top;
} break; // need to emulate goto via "continue"
}
} while (_in < last && _out < end); /* return unused bytes (on entry, bits < 8, so in won't go too far back) */
len = bits >> 3;
_in -= len;
bits -= len << 3;
hold &= (1 << bits) - 1; /* update state and return */
strm.next_in = _in;
strm.next_out = _out;
strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));
strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));
state.hold = hold;
state.bits = bits;
return;
};
下部分代码
},{}],35:[function(_dereq_,module,exports){
'use strict';
var utils = _dereq_('../utils/common');
var adler32 = _dereq_('./adler32');
var crc32 = _dereq_('./crc32');
var inflate_fast = _dereq_('./inffast');
var inflate_table = _dereq_('./inftrees');
var CODES = 0;
var LENS = 1;
var DISTS = 2;
/* Public constants ==========================================================*/
/* ===========================================================================*/
/* Allowed flush values; see deflate() and inflate() below for details */
//var Z_NO_FLUSH = 0;
//var Z_PARTIAL_FLUSH = 1;
//var Z_SYNC_FLUSH = 2;
//var Z_FULL_FLUSH = 3;
var Z_FINISH = 4;
var Z_BLOCK = 5;
var Z_TREES = 6;
/* Return codes for the compression/decompression functions. Negative values
* are errors, positive values are used for special but normal events.
*/
var Z_OK = 0;
var Z_STREAM_END = 1;
var Z_NEED_DICT = 2;
//var Z_ERRNO = -1;
var Z_STREAM_ERROR = -2;
var Z_DATA_ERROR = -3;
var Z_MEM_ERROR = -4;
var Z_BUF_ERROR = -5;
//var Z_VERSION_ERROR = -6;
/* The deflate compression method */
var Z_DEFLATED = 8;
/* STATES ====================================================================*/
/* ===========================================================================*/
var HEAD = 1; /* i: waiting for magic header */
var FLAGS = 2; /* i: waiting for method and flags (gzip) */
var TIME = 3; /* i: waiting for modification time (gzip) */
var OS = 4; /* i: waiting for extra flags and operating system (gzip) */
var EXLEN = 5; /* i: waiting for extra length (gzip) */
var EXTRA = 6; /* i: waiting for extra bytes (gzip) */
var NAME = 7; /* i: waiting for end of file name (gzip) */
var COMMENT = 8; /* i: waiting for end of comment (gzip) */
var HCRC = 9; /* i: waiting for header crc (gzip) */
var DICTID = 10; /* i: waiting for dictionary check value */
var DICT = 11; /* waiting for inflateSetDictionary() call */
var TYPE = 12; /* i: waiting for type bits, including last-flag bit */
var TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */
var STORED = 14; /* i: waiting for stored size (length and complement) */
var COPY_ = 15; /* i/o: same as COPY below, but only first time in */
var COPY = 16; /* i/o: waiting for input or output to copy stored block */
var TABLE = 17; /* i: waiting for dynamic block table lengths */
var LENLENS = 18; /* i: waiting for code length code lengths */
var CODELENS = 19; /* i: waiting for length/lit and distance code lengths */
var LEN_ = 20; /* i: same as LEN below, but only first time in */
var LEN = 21; /* i: waiting for length/lit/eob code */
var LENEXT = 22; /* i: waiting for length extra bits */
var DIST = 23; /* i: waiting for distance code */
var DISTEXT = 24; /* i: waiting for distance extra bits */
var MATCH = 25; /* o: waiting for output space to copy string */
var LIT = 26; /* o: waiting for output space to write literal */
var CHECK = 27; /* i: waiting for 32-bit check value */
var LENGTH = 28; /* i: waiting for 32-bit length (gzip) */
var DONE = 29; /* finished check, done -- remain here until reset */
var BAD = 30; /* got a data error -- remain here until reset */
var MEM = 31; /* got an inflate() memory error -- remain here until reset */
var SYNC = 32; /* looking for synchronization bytes to restart inflate() */
/* ===========================================================================*/
var ENOUGH_LENS = 852;
var ENOUGH_DISTS = 592;
//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);
var MAX_WBITS = 15;
/* 32K LZ77 window */
var DEF_WBITS = MAX_WBITS;
function ZSWAP32(q) {
return (((q >>> 24) & 0xff) +
((q >>> 8) & 0xff00) +
((q & 0xff00) << 8) +
((q & 0xff) << 24));
}
function InflateState() {
this.mode = 0; /* current inflate mode */
this.last = false; /* true if processing last block */
this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */
this.havedict = false; /* true if dictionary provided */
this.flags = 0; /* gzip header method and flags (0 if zlib) */
this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */
this.check = 0; /* protected copy of check value */
this.total = 0; /* protected copy of output count */
// TODO: may be {}
this.head = null; /* where to save gzip header information */
/* sliding window */
this.wbits = 0; /* log base 2 of requested window size */
this.wsize = 0; /* window size or zero if not using window */
this.whave = 0; /* valid bytes in the window */
this.wnext = 0; /* window write index */
this.window = null; /* allocated sliding window, if needed */
/* bit accumulator */
this.hold = 0; /* input bit accumulator */
this.bits = 0; /* number of bits in "in" */
/* for string and stored block copying */
this.length = 0; /* literal or length of data to copy */
this.offset = 0; /* distance back to copy string from */
/* for table and code decoding */
this.extra = 0; /* extra bits needed */
/* fixed and dynamic code tables */
this.lencode = null; /* starting table for length/literal codes */
this.distcode = null; /* starting table for distance codes */
this.lenbits = 0; /* index bits for lencode */
this.distbits = 0; /* index bits for distcode */
/* dynamic table building */
this.ncode = 0; /* number of code length code lengths */
this.nlen = 0; /* number of length code lengths */
this.ndist = 0; /* number of distance code lengths */
this.have = 0; /* number of code lengths in lens[] */
this.next = null; /* next available space in codes[] */
this.lens = new utils.Buf16(320); /* temporary storage for code lengths */
this.work = new utils.Buf16(288); /* work area for code table building */
/*
because we don't have pointers in js, we use lencode and distcode directly
as buffers so we don't need codes
*/
//this.codes = new utils.Buf32(ENOUGH); /* space for code tables */
this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */
this.distdyn = null; /* dynamic table for distance codes (JS specific) */
this.sane = 0; /* if false, allow invalid distance too far */
this.back = 0; /* bits back of last unprocessed length/lit */
this.was = 0; /* initial length of match */
}
function inflateResetKeep(strm) {
var state;
if (!strm || !strm.state) { return Z_STREAM_ERROR; }
state = strm.state;
strm.total_in = strm.total_out = state.total = 0;
strm.msg = ''; /*Z_NULL*/
if (state.wrap) { /* to support ill-conceived Java test suite */
strm.adler = state.wrap & 1;
}
state.mode = HEAD;
state.last = 0;
state.havedict = 0;
state.dmax = 32768;
state.head = null/*Z_NULL*/;
state.hold = 0;
state.bits = 0;
//state.lencode = state.distcode = state.next = state.codes;
state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);
state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);
state.sane = 1;
state.back = -1;
//Tracev((stderr, "inflate: reset\n"));
return Z_OK;
}
function inflateReset(strm) {
var state;
if (!strm || !strm.state) { return Z_STREAM_ERROR; }
state = strm.state;
state.wsize = 0;
state.whave = 0;
state.wnext = 0;
return inflateResetKeep(strm);
}
function inflateReset2(strm, windowBits) {
var wrap;
var state;
/* get the state */
if (!strm || !strm.state) { return Z_STREAM_ERROR; }
state = strm.state;
/* extract wrap request from windowBits parameter */
if (windowBits < 0) {
wrap = 0;
windowBits = -windowBits;
}
else {
wrap = (windowBits >> 4) + 1;
if (windowBits < 48) {
windowBits &= 15;
}
}
/* set number of window bits, free window if different */
if (windowBits && (windowBits < 8 || windowBits > 15)) {
return Z_STREAM_ERROR;
}
if (state.window !== null && state.wbits !== windowBits) {
state.window = null;
}
/* update state and reset the rest of it */
state.wrap = wrap;
state.wbits = windowBits;
return inflateReset(strm);
}
function inflateInit2(strm, windowBits) {
var ret;
var state;
if (!strm) { return Z_STREAM_ERROR; }
//strm.msg = Z_NULL; /* in case we return an error */
state = new InflateState();
//if (state === Z_NULL) return Z_MEM_ERROR;
//Tracev((stderr, "inflate: allocated\n"));
strm.state = state;
state.window = null/*Z_NULL*/;
ret = inflateReset2(strm, windowBits);
if (ret !== Z_OK) {
strm.state = null/*Z_NULL*/;
}
return ret;
}
function inflateInit(strm) {
return inflateInit2(strm, DEF_WBITS);
}
/*
Return state with length and distance decoding tables and index sizes set to
fixed code decoding. Normally this returns fixed tables from inffixed.h.
If BUILDFIXED is defined, then instead this routine builds the tables the
first time it's called, and returns those tables the first time and
thereafter. This reduces the size of the code by about 2K bytes, in
exchange for a little execution time. However, BUILDFIXED should not be
used for threaded applications, since the rewriting of the tables and virgin
may not be thread-safe.
*/
var virgin = true;
var lenfix, distfix; // We have no pointers in JS, so keep tables separate
function fixedtables(state) {
/* build fixed huffman tables if first call (may not be thread safe) */
if (virgin) {
var sym;
lenfix = new utils.Buf32(512);
distfix = new utils.Buf32(32);
/* literal/length table */
sym = 0;
while (sym < 144) { state.lens[sym++] = 8; }
while (sym < 256) { state.lens[sym++] = 9; }
while (sym < 280) { state.lens[sym++] = 7; }
while (sym < 288) { state.lens[sym++] = 8; }
inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, {bits: 9});
/* distance table */
sym = 0;
while (sym < 32) { state.lens[sym++] = 5; }
inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, {bits: 5});
/* do this just once */
virgin = false;
}
state.lencode = lenfix;
state.lenbits = 9;
state.distcode = distfix;
state.distbits = 5;
}
/*
Update the window with the last wsize (normally 32K) bytes written before
returning. If window does not exist yet, create it. This is only called
when a window is already in use, or when output has been written during this
inflate call, but the end of the deflate stream has not been reached yet.
It is also called to create a window for dictionary data when a dictionary
is loaded.
Providing output buffers larger than 32K to inflate() should provide a speed
advantage, since only the last 32K of output is copied to the sliding window
upon return from inflate(), and since all distances after the first 32K of
output will fall in the output data, making match copies simpler and faster.
The advantage may be dependent on the size of the processor's data caches.
*/
function updatewindow(strm, src, end, copy) {
var dist;
var state = strm.state;
/* if it hasn't been done already, allocate space for the window */
if (state.window === null) {
state.wsize = 1 << state.wbits;
state.wnext = 0;
state.whave = 0;
state.window = new utils.Buf8(state.wsize);
}
/* copy state->wsize or less output bytes into the circular window */
if (copy >= state.wsize) {
utils.arraySet(state.window,src, end - state.wsize, state.wsize, 0);
state.wnext = 0;
state.whave = state.wsize;
}
else {
dist = state.wsize - state.wnext;
if (dist > copy) {
dist = copy;
}
//zmemcpy(state->window + state->wnext, end - copy, dist);
utils.arraySet(state.window,src, end - copy, dist, state.wnext);
copy -= dist;
if (copy) {
//zmemcpy(state->window, end - copy, copy);
utils.arraySet(state.window,src, end - copy, copy, 0);
state.wnext = copy;
state.whave = state.wsize;
}
else {
state.wnext += dist;
if (state.wnext === state.wsize) { state.wnext = 0; }
if (state.whave < state.wsize) { state.whave += dist; }
}
}
return 0;
}
function inflate(strm, flush) {
var state;
var input, output; // input/output buffers
var next; /* next input INDEX */
var put; /* next output INDEX */
var have, left; /* available input and output */
var hold; /* bit buffer */
var bits; /* bits in bit buffer */
var _in, _out; /* save starting available input and output */
var copy; /* number of stored or match bytes to copy */
var from; /* where to copy match bytes from */
var from_source;
var here = 0; /* current decoding table entry */
var here_bits, here_op, here_val; // paked "here" denormalized (JS specific)
//var last; /* parent table entry */
var last_bits, last_op, last_val; // paked "last" denormalized (JS specific)
var len; /* length to copy for repeats, bits to drop */
var ret; /* return code */
var hbuf = new utils.Buf8(4); /* buffer for gzip header crc calculation */
var opts;
var n; // temporary var for NEED_BITS
var order = /* permutation of code lengths */
[16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
if (!strm || !strm.state || !strm.output ||
(!strm.input && strm.avail_in !== 0)) {
return Z_STREAM_ERROR;
}
state = strm.state;
if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */
//--- LOAD() ---
put = strm.next_out;
output = strm.output;
left = strm.avail_out;
next = strm.next_in;
input = strm.input;
have = strm.avail_in;
hold = state.hold;
bits = state.bits;
//---
_in = have;
_out = left;
ret = Z_OK;
inf_leave: // goto emulation
for (;;) {
switch (state.mode) {
case HEAD:
if (state.wrap === 0) {
state.mode = TYPEDO;
break;
}
//=== NEEDBITS(16);
while (bits < 16) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */
state.check = 0/*crc32(0L, Z_NULL, 0)*/;
//=== CRC2(state.check, hold);
hbuf[0] = hold & 0xff;
hbuf[1] = (hold >>> 8) & 0xff;
state.check = crc32(state.check, hbuf, 2, 0);
//===//
//=== INITBITS();
hold = 0;
bits = 0;
//===//
state.mode = FLAGS;
break;
}
state.flags = 0; /* expect zlib header */
if (state.head) {
state.head.done = false;
}
if (!(state.wrap & 1) || /* check if zlib header allowed */
(((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {
strm.msg = 'incorrect header check';
state.mode = BAD;
break;
}
if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {
strm.msg = 'unknown compression method';
state.mode = BAD;
break;
}
//--- DROPBITS(4) ---//
hold >>>= 4;
bits -= 4;
//---//
len = (hold & 0x0f)/*BITS(4)*/ + 8;
if (state.wbits === 0) {
state.wbits = len;
}
else if (len > state.wbits) {
strm.msg = 'invalid window size';
state.mode = BAD;
break;
}
state.dmax = 1 << len;
//Tracev((stderr, "inflate: zlib header ok\n"));
strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;
state.mode = hold & 0x200 ? DICTID : TYPE;
//=== INITBITS();
hold = 0;
bits = 0;
//===//
break;
case FLAGS:
//=== NEEDBITS(16); */
while (bits < 16) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
state.flags = hold;
if ((state.flags & 0xff) !== Z_DEFLATED) {
strm.msg = 'unknown compression method';
state.mode = BAD;
break;
}
if (state.flags & 0xe000) {
strm.msg = 'unknown header flags set';
state.mode = BAD;
break;
}
if (state.head) {
state.head.text = ((hold >> 8) & 1);
}
if (state.flags & 0x0200) {
//=== CRC2(state.check, hold);
hbuf[0] = hold & 0xff;
hbuf[1] = (hold >>> 8) & 0xff;
state.check = crc32(state.check, hbuf, 2, 0);
//===//
}
//=== INITBITS();
hold = 0;
bits = 0;
//===//
state.mode = TIME;
/* falls through */
case TIME:
//=== NEEDBITS(32); */
while (bits < 32) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
if (state.head) {
state.head.time = hold;
}
if (state.flags & 0x0200) {
//=== CRC4(state.check, hold)
hbuf[0] = hold & 0xff;
hbuf[1] = (hold >>> 8) & 0xff;
hbuf[2] = (hold >>> 16) & 0xff;
hbuf[3] = (hold >>> 24) & 0xff;
state.check = crc32(state.check, hbuf, 4, 0);
//===
}
//=== INITBITS();
hold = 0;
bits = 0;
//===//
state.mode = OS;
/* falls through */
case OS:
//=== NEEDBITS(16); */
while (bits < 16) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
if (state.head) {
state.head.xflags = (hold & 0xff);
state.head.os = (hold >> 8);
}
if (state.flags & 0x0200) {
//=== CRC2(state.check, hold);
hbuf[0] = hold & 0xff;
hbuf[1] = (hold >>> 8) & 0xff;
state.check = crc32(state.check, hbuf, 2, 0);
//===//
}
//=== INITBITS();
hold = 0;
bits = 0;
//===//
state.mode = EXLEN;
/* falls through */
case EXLEN:
if (state.flags & 0x0400) {
//=== NEEDBITS(16); */
while (bits < 16) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
state.length = hold;
if (state.head) {
state.head.extra_len = hold;
}
if (state.flags & 0x0200) {
//=== CRC2(state.check, hold);
hbuf[0] = hold & 0xff;
hbuf[1] = (hold >>> 8) & 0xff;
state.check = crc32(state.check, hbuf, 2, 0);
//===//
}
//=== INITBITS();
hold = 0;
bits = 0;
//===//
}
else if (state.head) {
state.head.extra = null/*Z_NULL*/;
}
state.mode = EXTRA;
/* falls through */
case EXTRA:
if (state.flags & 0x0400) {
copy = state.length;
if (copy > have) { copy = have; }
if (copy) {
if (state.head) {
len = state.head.extra_len - state.length;
if (!state.head.extra) {
// Use untyped array for more conveniend processing later
state.head.extra = new Array(state.head.extra_len);
}
utils.arraySet(
state.head.extra,
input,
next,
// extra field is limited to 65536 bytes
// - no need for additional size check
copy,
/*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
len
);
//zmemcpy(state.head.extra + len, next,
// len + copy > state.head.extra_max ?
// state.head.extra_max - len : copy);
}
if (state.flags & 0x0200) {
state.check = crc32(state.check, input, copy, next);
}
have -= copy;
next += copy;
state.length -= copy;
}
if (state.length) { break inf_leave; }
}
state.length = 0;
state.mode = NAME;
/* falls through */
case NAME:
if (state.flags & 0x0800) {
if (have === 0) { break inf_leave; }
copy = 0;
do {
// TODO: 2 or 1 bytes?
len = input[next + copy++];
/* use constant limit because in js we should not preallocate memory */
if (state.head && len &&
(state.length < 65536 /*state.head.name_max*/)) {
state.head.name += String.fromCharCode(len);
}
} while (len && copy < have);
if (state.flags & 0x0200) {
state.check = crc32(state.check, input, copy, next);
}
have -= copy;
next += copy;
if (len) { break inf_leave; }
}
else if (state.head) {
state.head.name = null;
}
state.length = 0;
state.mode = COMMENT;
/* falls through */
case COMMENT:
if (state.flags & 0x1000) {
if (have === 0) { break inf_leave; }
copy = 0;
do {
len = input[next + copy++];
/* use constant limit because in js we should not preallocate memory */
if (state.head && len &&
(state.length < 65536 /*state.head.comm_max*/)) {
state.head.comment += String.fromCharCode(len);
}
} while (len && copy < have);
if (state.flags & 0x0200) {
state.check = crc32(state.check, input, copy, next);
}
have -= copy;
next += copy;
if (len) { break inf_leave; }
}
else if (state.head) {
state.head.comment = null;
}
state.mode = HCRC;
/* falls through */
case HCRC:
if (state.flags & 0x0200) {
//=== NEEDBITS(16); */
while (bits < 16) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
if (hold !== (state.check & 0xffff)) {
strm.msg = 'header crc mismatch';
state.mode = BAD;
break;
}
//=== INITBITS();
hold = 0;
bits = 0;
//===//
}
if (state.head) {
state.head.hcrc = ((state.flags >> 9) & 1);
state.head.done = true;
}
strm.adler = state.check = 0 /*crc32(0L, Z_NULL, 0)*/;
state.mode = TYPE;
break;
case DICTID:
//=== NEEDBITS(32); */
while (bits < 32) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
strm.adler = state.check = ZSWAP32(hold);
//=== INITBITS();
hold = 0;
bits = 0;
//===//
state.mode = DICT;
/* falls through */
case DICT:
if (state.havedict === 0) {
//--- RESTORE() ---
strm.next_out = put;
strm.avail_out = left;
strm.next_in = next;
strm.avail_in = have;
state.hold = hold;
state.bits = bits;
//---
return Z_NEED_DICT;
}
strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;
state.mode = TYPE;
/* falls through */
case TYPE:
if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }
/* falls through */
case TYPEDO:
if (state.last) {
//--- BYTEBITS() ---//
hold >>>= bits & 7;
bits -= bits & 7;
//---//
state.mode = CHECK;
break;
}
//=== NEEDBITS(3); */
while (bits < 3) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
state.last = (hold & 0x01)/*BITS(1)*/;
//--- DROPBITS(1) ---//
hold >>>= 1;
bits -= 1;
//---//
switch ((hold & 0x03)/*BITS(2)*/) {
case 0: /* stored block */
//Tracev((stderr, "inflate: stored block%s\n",
// state.last ? " (last)" : ""));
state.mode = STORED;
break;
case 1: /* fixed block */
fixedtables(state);
//Tracev((stderr, "inflate: fixed codes block%s\n",
// state.last ? " (last)" : ""));
state.mode = LEN_; /* decode codes */
if (flush === Z_TREES) {
//--- DROPBITS(2) ---//
hold >>>= 2;
bits -= 2;
//---//
break inf_leave;
}
break;
case 2: /* dynamic block */
//Tracev((stderr, "inflate: dynamic codes block%s\n",
// state.last ? " (last)" : ""));
state.mode = TABLE;
break;
case 3:
strm.msg = 'invalid block type';
state.mode = BAD;
}
//--- DROPBITS(2) ---//
hold >>>= 2;
bits -= 2;
//---//
break;
case STORED:
//--- BYTEBITS() ---// /* go to byte boundary */
hold >>>= bits & 7;
bits -= bits & 7;
//---//
//=== NEEDBITS(32); */
while (bits < 32) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {
strm.msg = 'invalid stored block lengths';
state.mode = BAD;
break;
}
state.length = hold & 0xffff;
//Tracev((stderr, "inflate: stored length %u\n",
// state.length));
//=== INITBITS();
hold = 0;
bits = 0;
//===//
state.mode = COPY_;
if (flush === Z_TREES) { break inf_leave; }
/* falls through */
case COPY_:
state.mode = COPY;
/* falls through */
case COPY:
copy = state.length;
if (copy) {
if (copy > have) { copy = have; }
if (copy > left) { copy = left; }
if (copy === 0) { break inf_leave; }
//--- zmemcpy(put, next, copy); ---
utils.arraySet(output, input, next, copy, put);
//---//
have -= copy;
next += copy;
left -= copy;
put += copy;
state.length -= copy;
break;
}
//Tracev((stderr, "inflate: stored end\n"));
state.mode = TYPE;
break;
case TABLE:
//=== NEEDBITS(14); */
while (bits < 14) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;
//--- DROPBITS(5) ---//
hold >>>= 5;
bits -= 5;
//---//
state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;
//--- DROPBITS(5) ---//
hold >>>= 5;
bits -= 5;
//---//
state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;
//--- DROPBITS(4) ---//
hold >>>= 4;
bits -= 4;
//---//
//#ifndef PKZIP_BUG_WORKAROUND
if (state.nlen > 286 || state.ndist > 30) {
strm.msg = 'too many length or distance symbols';
state.mode = BAD;
break;
}
//#endif
//Tracev((stderr, "inflate: table sizes ok\n"));
state.have = 0;
state.mode = LENLENS;
/* falls through */
case LENLENS:
while (state.have < state.ncode) {
//=== NEEDBITS(3);
while (bits < 3) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);
//--- DROPBITS(3) ---//
hold >>>= 3;
bits -= 3;
//---//
}
while (state.have < 19) {
state.lens[order[state.have++]] = 0;
}
// We have separate tables & no pointers. 2 commented lines below not needed.
//state.next = state.codes;
//state.lencode = state.next;
// Switch to use dynamic table
state.lencode = state.lendyn;
state.lenbits = 7;
opts = {bits: state.lenbits};
ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);
state.lenbits = opts.bits;
if (ret) {
strm.msg = 'invalid code lengths set';
state.mode = BAD;
break;
}
//Tracev((stderr, "inflate: code lengths ok\n"));
state.have = 0;
state.mode = CODELENS;
/* falls through */
case CODELENS:
while (state.have < state.nlen + state.ndist) {
for (;;) {
here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/
here_bits = here >>> 24;
here_op = (here >>> 16) & 0xff;
here_val = here & 0xffff;
if ((here_bits) <= bits) { break; }
//--- PULLBYTE() ---//
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
//---//
}
if (here_val < 16) {
//--- DROPBITS(here.bits) ---//
hold >>>= here_bits;
bits -= here_bits;
//---//
state.lens[state.have++] = here_val;
}
else {
if (here_val === 16) {
//=== NEEDBITS(here.bits + 2);
n = here_bits + 2;
while (bits < n) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
//--- DROPBITS(here.bits) ---//
hold >>>= here_bits;
bits -= here_bits;
//---//
if (state.have === 0) {
strm.msg = 'invalid bit length repeat';
state.mode = BAD;
break;
}
len = state.lens[state.have - 1];
copy = 3 + (hold & 0x03);//BITS(2);
//--- DROPBITS(2) ---//
hold >>>= 2;
bits -= 2;
//---//
}
else if (here_val === 17) {
//=== NEEDBITS(here.bits + 3);
n = here_bits + 3;
while (bits < n) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
//--- DROPBITS(here.bits) ---//
hold >>>= here_bits;
bits -= here_bits;
//---//
len = 0;
copy = 3 + (hold & 0x07);//BITS(3);
//--- DROPBITS(3) ---//
hold >>>= 3;
bits -= 3;
//---//
}
else {
//=== NEEDBITS(here.bits + 7);
n = here_bits + 7;
while (bits < n) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
//--- DROPBITS(here.bits) ---//
hold >>>= here_bits;
bits -= here_bits;
//---//
len = 0;
copy = 11 + (hold & 0x7f);//BITS(7);
//--- DROPBITS(7) ---//
hold >>>= 7;
bits -= 7;
//---//
}
if (state.have + copy > state.nlen + state.ndist) {
strm.msg = 'invalid bit length repeat';
state.mode = BAD;
break;
}
while (copy--) {
state.lens[state.have++] = len;
}
}
}
/* handle error breaks in while */
if (state.mode === BAD) { break; }
/* check for end-of-block code (better have one) */
if (state.lens[256] === 0) {
strm.msg = 'invalid code -- missing end-of-block';
state.mode = BAD;
break;
}
/* build code tables -- note: do not change the lenbits or distbits
values here (9 and 6) without reading the comments in inftrees.h
concerning the ENOUGH constants, which depend on those values */
state.lenbits = 9;
opts = {bits: state.lenbits};
ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);
// We have separate tables & no pointers. 2 commented lines below not needed.
// state.next_index = opts.table_index;
state.lenbits = opts.bits;
// state.lencode = state.next;
if (ret) {
strm.msg = 'invalid literal/lengths set';
state.mode = BAD;
break;
}
state.distbits = 6;
//state.distcode.copy(state.codes);
// Switch to use dynamic table
state.distcode = state.distdyn;
opts = {bits: state.distbits};
ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);
// We have separate tables & no pointers. 2 commented lines below not needed.
// state.next_index = opts.table_index;
state.distbits = opts.bits;
// state.distcode = state.next;
if (ret) {
strm.msg = 'invalid distances set';
state.mode = BAD;
break;
}
//Tracev((stderr, 'inflate: codes ok\n'));
state.mode = LEN_;
if (flush === Z_TREES) { break inf_leave; }
/* falls through */
case LEN_:
state.mode = LEN;
/* falls through */
case LEN:
if (have >= 6 && left >= 258) {
//--- RESTORE() ---
strm.next_out = put;
strm.avail_out = left;
strm.next_in = next;
strm.avail_in = have;
state.hold = hold;
state.bits = bits;
//---
inflate_fast(strm, _out);
//--- LOAD() ---
put = strm.next_out;
output = strm.output;
left = strm.avail_out;
next = strm.next_in;
input = strm.input;
have = strm.avail_in;
hold = state.hold;
bits = state.bits;
//---
if (state.mode === TYPE) {
state.back = -1;
}
break;
}
state.back = 0;
for (;;) {
here = state.lencode[hold & ((1 << state.lenbits) -1)]; /*BITS(state.lenbits)*/
here_bits = here >>> 24;
here_op = (here >>> 16) & 0xff;
here_val = here & 0xffff;
if (here_bits <= bits) { break; }
//--- PULLBYTE() ---//
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
//---//
}
if (here_op && (here_op & 0xf0) === 0) {
last_bits = here_bits;
last_op = here_op;
last_val = here_val;
for (;;) {
here = state.lencode[last_val +
((hold & ((1 << (last_bits + last_op)) -1))/*BITS(last.bits + last.op)*/ >> last_bits)];
here_bits = here >>> 24;
here_op = (here >>> 16) & 0xff;
here_val = here & 0xffff;
if ((last_bits + here_bits) <= bits) { break; }
//--- PULLBYTE() ---//
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
//---//
}
//--- DROPBITS(last.bits) ---//
hold >>>= last_bits;
bits -= last_bits;
//---//
state.back += last_bits;
}
//--- DROPBITS(here.bits) ---//
hold >>>= here_bits;
bits -= here_bits;
//---//
state.back += here_bits;
state.length = here_val;
if (here_op === 0) {
//Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
// "inflate: literal '%c'\n" :
// "inflate: literal 0x%02x\n", here.val));
state.mode = LIT;
break;
}
if (here_op & 32) {
//Tracevv((stderr, "inflate: end of block\n"));
state.back = -1;
state.mode = TYPE;
break;
}
if (here_op & 64) {
strm.msg = 'invalid literal/length code';
state.mode = BAD;
break;
}
state.extra = here_op & 15;
state.mode = LENEXT;
/* falls through */
case LENEXT:
if (state.extra) {
//=== NEEDBITS(state.extra);
n = state.extra;
while (bits < n) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
state.length += hold & ((1 << state.extra) -1)/*BITS(state.extra)*/;
//--- DROPBITS(state.extra) ---//
hold >>>= state.extra;
bits -= state.extra;
//---//
state.back += state.extra;
}
//Tracevv((stderr, "inflate: length %u\n", state.length));
state.was = state.length;
state.mode = DIST;
/* falls through */
case DIST:
for (;;) {
here = state.distcode[hold & ((1 << state.distbits) -1)];/*BITS(state.distbits)*/
here_bits = here >>> 24;
here_op = (here >>> 16) & 0xff;
here_val = here & 0xffff;
if ((here_bits) <= bits) { break; }
//--- PULLBYTE() ---//
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
//---//
}
if ((here_op & 0xf0) === 0) {
last_bits = here_bits;
last_op = here_op;
last_val = here_val;
for (;;) {
here = state.distcode[last_val +
((hold & ((1 << (last_bits + last_op)) -1))/*BITS(last.bits + last.op)*/ >> last_bits)];
here_bits = here >>> 24;
here_op = (here >>> 16) & 0xff;
here_val = here & 0xffff;
if ((last_bits + here_bits) <= bits) { break; }
//--- PULLBYTE() ---//
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
//---//
}
//--- DROPBITS(last.bits) ---//
hold >>>= last_bits;
bits -= last_bits;
//---//
state.back += last_bits;
}
//--- DROPBITS(here.bits) ---//
hold >>>= here_bits;
bits -= here_bits;
//---//
state.back += here_bits;
if (here_op & 64) {
strm.msg = 'invalid distance code';
state.mode = BAD;
break;
}
state.offset = here_val;
state.extra = (here_op) & 15;
state.mode = DISTEXT;
/* falls through */
case DISTEXT:
if (state.extra) {
//=== NEEDBITS(state.extra);
n = state.extra;
while (bits < n) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
state.offset += hold & ((1 << state.extra) -1)/*BITS(state.extra)*/;
//--- DROPBITS(state.extra) ---//
hold >>>= state.extra;
bits -= state.extra;
//---//
state.back += state.extra;
}
//#ifdef INFLATE_STRICT
if (state.offset > state.dmax) {
strm.msg = 'invalid distance too far back';
state.mode = BAD;
break;
}
//#endif
//Tracevv((stderr, "inflate: distance %u\n", state.offset));
state.mode = MATCH;
/* falls through */
case MATCH:
if (left === 0) { break inf_leave; }
copy = _out - left;
if (state.offset > copy) { /* copy from window */
copy = state.offset - copy;
if (copy > state.whave) {
if (state.sane) {
strm.msg = 'invalid distance too far back';
state.mode = BAD;
break;
}
// (!) This block is disabled in zlib defailts,
// don't enable it for binary compatibility
//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
// Trace((stderr, "inflate.c too far\n"));
// copy -= state.whave;
// if (copy > state.length) { copy = state.length; }
// if (copy > left) { copy = left; }
// left -= copy;
// state.length -= copy;
// do {
// output[put++] = 0;
// } while (--copy);
// if (state.length === 0) { state.mode = LEN; }
// break;
//#endif
}
if (copy > state.wnext) {
copy -= state.wnext;
from = state.wsize - copy;
}
else {
from = state.wnext - copy;
}
if (copy > state.length) { copy = state.length; }
from_source = state.window;
}
else { /* copy from output */
from_source = output;
from = put - state.offset;
copy = state.length;
}
if (copy > left) { copy = left; }
left -= copy;
state.length -= copy;
do {
output[put++] = from_source[from++];
} while (--copy);
if (state.length === 0) { state.mode = LEN; }
break;
case LIT:
if (left === 0) { break inf_leave; }
output[put++] = state.length;
left--;
state.mode = LEN;
break;
case CHECK:
if (state.wrap) {
//=== NEEDBITS(32);
while (bits < 32) {
if (have === 0) { break inf_leave; }
have--;
// Use '|' insdead of '+' to make sure that result is signed
hold |= input[next++] << bits;
bits += 8;
}
//===//
_out -= left;
strm.total_out += _out;
state.total += _out;
if (_out) {
strm.adler = state.check =
/*UPDATE(state.check, put - _out, _out);*/
(state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out));
}
_out = left;
// NB: crc32 stored as signed 32-bit int, ZSWAP32 returns signed too
if ((state.flags ? hold : ZSWAP32(hold)) !== state.check) {
strm.msg = 'incorrect data check';
state.mode = BAD;
break;
}
//=== INITBITS();
hold = 0;
bits = 0;
//===//
//Tracev((stderr, "inflate: check matches trailer\n"));
}
state.mode = LENGTH;
/* falls through */
case LENGTH:
if (state.wrap && state.flags) {
//=== NEEDBITS(32);
while (bits < 32) {
if (have === 0) { break inf_leave; }
have--;
hold += input[next++] << bits;
bits += 8;
}
//===//
if (hold !== (state.total & 0xffffffff)) {
strm.msg = 'incorrect length check';
state.mode = BAD;
break;
}
//=== INITBITS();
hold = 0;
bits = 0;
//===//
//Tracev((stderr, "inflate: length matches trailer\n"));
}
state.mode = DONE;
/* falls through */
case DONE:
ret = Z_STREAM_END;
break inf_leave;
case BAD:
ret = Z_DATA_ERROR;
break inf_leave;
case MEM:
return Z_MEM_ERROR;
case SYNC:
/* falls through */
default:
return Z_STREAM_ERROR;
}
}
// inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave"
/*
Return from inflate(), updating the total counts and the check value.
If there was no progress during the inflate() call, return a buffer
error. Call updatewindow() to create and/or update the window state.
Note: a memory error from inflate() is non-recoverable.
*/
//--- RESTORE() ---
strm.next_out = put;
strm.avail_out = left;
strm.next_in = next;
strm.avail_in = have;
state.hold = hold;
state.bits = bits;
//---
if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&
(state.mode < CHECK || flush !== Z_FINISH))) {
if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {
state.mode = MEM;
return Z_MEM_ERROR;
}
}
_in -= strm.avail_in;
_out -= strm.avail_out;
strm.total_in += _in;
strm.total_out += _out;
state.total += _out;
if (state.wrap && _out) {
strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
(state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out));
}
strm.data_type = state.bits + (state.last ? 64 : 0) +
(state.mode === TYPE ? 128 : 0) +
(state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);
if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {
ret = Z_BUF_ERROR;
}
return ret;
}
function inflateEnd(strm) {
if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {
return Z_STREAM_ERROR;
}
var state = strm.state;
if (state.window) {
state.window = null;
}
strm.state = null;
return Z_OK;
}
function inflateGetHeader(strm, head) {
var state;
/* check state */
if (!strm || !strm.state) { return Z_STREAM_ERROR; }
state = strm.state;
if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }
/* save header structure */
state.head = head;
head.done = false;
return Z_OK;
}
exports.inflateReset = inflateReset;
exports.inflateReset2 = inflateReset2;
exports.inflateResetKeep = inflateResetKeep;
exports.inflateInit = inflateInit;
exports.inflateInit2 = inflateInit2;
exports.inflate = inflate;
exports.inflateEnd = inflateEnd;
exports.inflateGetHeader = inflateGetHeader;
exports.inflateInfo = 'pako inflate (from Nodeca project)';
/* Not implemented
exports.inflateCopy = inflateCopy;
exports.inflateGetDictionary = inflateGetDictionary;
exports.inflateMark = inflateMark;
exports.inflatePrime = inflatePrime;
exports.inflateSetDictionary = inflateSetDictionary;
exports.inflateSync = inflateSync;
exports.inflateSyncPoint = inflateSyncPoint;
exports.inflateUndermine = inflateUndermine;
*/
},{"../utils/common":27,"./adler32":29,"./crc32":31,"./inffast":34,"./inftrees":36}],36:[function(_dereq_,module,exports){
'use strict';
var utils = _dereq_('../utils/common');
var MAXBITS = 15;
var ENOUGH_LENS = 852;
var ENOUGH_DISTS = 592;
//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);
var CODES = 0;
var LENS = 1;
var DISTS = 2;
var lbase = [ /* Length codes 257..285 base */
3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0
];
var lext = [ /* Length codes 257..285 extra */
16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,
19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78
];
var dbase = [ /* Distance codes 0..29 base */
1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
8193, 12289, 16385, 24577, 0, 0
];
var dext = [ /* Distance codes 0..29 extra */
16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,
23, 23, 24, 24, 25, 25, 26, 26, 27, 27,
28, 28, 29, 29, 64, 64
];
module.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)
{
var bits = opts.bits;
//here = opts.here; /* table entry for duplication */
var len = 0; /* a code's length in bits */
var sym = 0; /* index of code symbols */
var min = 0, max = 0; /* minimum and maximum code lengths */
var root = 0; /* number of index bits for root table */
var curr = 0; /* number of index bits for current table */
var drop = 0; /* code bits to drop for sub-table */
var left = 0; /* number of prefix codes available */
var used = 0; /* code entries in table used */
var huff = 0; /* Huffman code */
var incr; /* for incrementing code, index */
var fill; /* index for replicating entries */
var low; /* low bits for current root entry */
var mask; /* mask for low root bits */
var next; /* next available space in table */
var base = null; /* base value table to use */
var base_index = 0;
// var shoextra; /* extra bits table to use */
var end; /* use base and extra for symbol > end */
var count = new utils.Buf16(MAXBITS+1); //[MAXBITS+1]; /* number of codes of each length */
var offs = new utils.Buf16(MAXBITS+1); //[MAXBITS+1]; /* offsets in table for each length */
var extra = null;
var extra_index = 0;
var here_bits, here_op, here_val;
/*
Process a set of code lengths to create a canonical Huffman code. The
code lengths are lens[0..codes-1]. Each length corresponds to the
symbols 0..codes-1. The Huffman code is generated by first sorting the
symbols by length from short to long, and retaining the symbol order
for codes with equal lengths. Then the code starts with all zero bits
for the first code of the shortest length, and the codes are integer
increments for the same length, and zeros are appended as the length
increases. For the deflate format, these bits are stored backwards
from their more natural integer increment ordering, and so when the
decoding tables are built in the large loop below, the integer codes
are incremented backwards.
This routine assumes, but does not check, that all of the entries in
lens[] are in the range 0..MAXBITS. The caller must assure this.
1..MAXBITS is interpreted as that code length. zero means that that
symbol does not occur in this code.
The codes are sorted by computing a count of codes for each length,
creating from that a table of starting indices for each length in the
sorted table, and then entering the symbols in order in the sorted
table. The sorted table is work[], with that space being provided by
the caller.
The length counts are used for other purposes as well, i.e. finding
the minimum and maximum length codes, determining if there are any
codes at all, checking for a valid set of lengths, and looking ahead
at length counts to determine sub-table sizes when building the
decoding tables.
*/
/* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
for (len = 0; len <= MAXBITS; len++) {
count[len] = 0;
}
for (sym = 0; sym < codes; sym++) {
count[lens[lens_index + sym]]++;
}
/* bound code lengths, force root to be within code lengths */
root = bits;
for (max = MAXBITS; max >= 1; max--) {
if (count[max] !== 0) { break; }
}
if (root > max) {
root = max;
}
if (max === 0) { /* no symbols to code at all */
//table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */
//table.bits[opts.table_index] = 1; //here.bits = (var char)1;
//table.val[opts.table_index++] = 0; //here.val = (var short)0;
table[table_index++] = (1 << 24) | (64 << 16) | 0;
//table.op[opts.table_index] = 64;
//table.bits[opts.table_index] = 1;
//table.val[opts.table_index++] = 0;
table[table_index++] = (1 << 24) | (64 << 16) | 0;
opts.bits = 1;
return 0; /* no symbols, but wait for decoding to report error */
}
for (min = 1; min < max; min++) {
if (count[min] !== 0) { break; }
}
if (root < min) {
root = min;
}
/* check for an over-subscribed or incomplete set of lengths */
left = 1;
for (len = 1; len <= MAXBITS; len++) {
left <<= 1;
left -= count[len];
if (left < 0) {
return -1;
} /* over-subscribed */
}
if (left > 0 && (type === CODES || max !== 1)) {
return -1; /* incomplete set */
}
/* generate offsets into symbol table for each length for sorting */
offs[1] = 0;
for (len = 1; len < MAXBITS; len++) {
offs[len + 1] = offs[len] + count[len];
}
/* sort symbols by length, by symbol order within each length */
for (sym = 0; sym < codes; sym++) {
if (lens[lens_index + sym] !== 0) {
work[offs[lens[lens_index + sym]]++] = sym;
}
}
/*
Create and fill in decoding tables. In this loop, the table being
filled is at next and has curr index bits. The code being used is huff
with length len. That code is converted to an index by dropping drop
bits off of the bottom. For codes where len is less than drop + curr,
those top drop + curr - len bits are incremented through all values to
fill the table with replicated entries.
root is the number of index bits for the root table. When len exceeds
root, sub-tables are created pointed to by the root entry with an index
of the low root bits of huff. This is saved in low to check for when a
new sub-table should be started. drop is zero when the root table is
being filled, and drop is root when sub-tables are being filled.
When a new sub-table is needed, it is necessary to look ahead in the
code lengths to determine what size sub-table is needed. The length
counts are used for this, and so count[] is decremented as codes are
entered in the tables.
used keeps track of how many table entries have been allocated from the
provided *table space. It is checked for LENS and DIST tables against
the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in
the initial root table size constants. See the comments in inftrees.h
for more information.
sym increments through all symbols, and the loop terminates when
all codes of length max, i.e. all codes, have been processed. This
routine permits incomplete codes, so another loop after this one fills
in the rest of the decoding tables with invalid code markers.
*/
/* set up for code type */
// poor man optimization - use if-else instead of switch,
// to avoid deopts in old v8
if (type === CODES) {
base = extra = work; /* dummy value--not used */
end = 19;
} else if (type === LENS) {
base = lbase;
base_index -= 257;
extra = lext;
extra_index -= 257;
end = 256;
} else { /* DISTS */
base = dbase;
extra = dext;
end = -1;
}
/* initialize opts for loop */
huff = 0; /* starting code */
sym = 0; /* starting code symbol */
len = min; /* starting code length */
next = table_index; /* current table to fill in */
curr = root; /* current table index bits */
drop = 0; /* current bits to drop from code for index */
low = -1; /* trigger new sub-table when len > root */
used = 1 << root; /* use root table entries */
mask = used - 1; /* mask for comparing low */
/* check available table space */
if ((type === LENS && used > ENOUGH_LENS) ||
(type === DISTS && used > ENOUGH_DISTS)) {
return 1;
}
var i=0;
/* process all codes and make table entries */
for (;;) {
i++;
/* create table entry */
here_bits = len - drop;
if (work[sym] < end) {
here_op = 0;
here_val = work[sym];
}
else if (work[sym] > end) {
here_op = extra[extra_index + work[sym]];
here_val = base[base_index + work[sym]];
}
else {
here_op = 32 + 64; /* end of block */
here_val = 0;
}
/* replicate for those indices with low len bits equal to huff */
incr = 1 << (len - drop);
fill = 1 << curr;
min = fill; /* save offset to next table */
do {
fill -= incr;
table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;
} while (fill !== 0);
/* backwards increment the len-bit code huff */
incr = 1 << (len - 1);
while (huff & incr) {
incr >>= 1;
}
if (incr !== 0) {
huff &= incr - 1;
huff += incr;
} else {
huff = 0;
}
/* go to next symbol, update count, len */
sym++;
if (--count[len] === 0) {
if (len === max) { break; }
len = lens[lens_index + work[sym]];
}
/* create new sub-table if needed */
if (len > root && (huff & mask) !== low) {
/* if first time, transition to sub-tables */
if (drop === 0) {
drop = root;
}
/* increment past last table */
next += min; /* here min is 1 << curr */
/* determine length of next table */
curr = len - drop;
left = 1 << curr;
while (curr + drop < max) {
left -= count[curr + drop];
if (left <= 0) { break; }
curr++;
left <<= 1;
}
/* check for enough space */
used += 1 << curr;
if ((type === LENS && used > ENOUGH_LENS) ||
(type === DISTS && used > ENOUGH_DISTS)) {
return 1;
}
/* point entry in root table to sub-table */
low = huff & mask;
/*table.op[low] = curr;
table.bits[low] = root;
table.val[low] = next - opts.table_index;*/
table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;
}
}
/* fill in remaining table entry if code is incomplete (guaranteed to have
at most one remaining entry, since if the code is incomplete, the
maximum code length that was allowed to get this far is one bit) */
if (huff !== 0) {
//table.op[next + huff] = 64; /* invalid code marker */
//table.bits[next + huff] = len - drop;
//table.val[next + huff] = 0;
table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;
}
/* set return parameters */
//opts.table_index += used;
opts.bits = root;
return 0;
};
},{"../utils/common":27}],37:[function(_dereq_,module,exports){
'use strict';
module.exports = {
'2': 'need dictionary', /* Z_NEED_DICT 2 */
'1': 'stream end', /* Z_STREAM_END 1 */
'0': '', /* Z_OK 0 */
'-1': 'file error', /* Z_ERRNO (-1) */
'-2': 'stream error', /* Z_STREAM_ERROR (-2) */
'-3': 'data error', /* Z_DATA_ERROR (-3) */
'-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */
'-5': 'buffer error', /* Z_BUF_ERROR (-5) */
'-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */
};
},{}],38:[function(_dereq_,module,exports){
'use strict';
var utils = _dereq_('../utils/common');
/* Public constants ==========================================================*/
/* ===========================================================================*/
//var Z_FILTERED = 1;
//var Z_HUFFMAN_ONLY = 2;
//var Z_RLE = 3;
var Z_FIXED = 4;
//var Z_DEFAULT_STRATEGY = 0;
/* Possible values of the data_type field (though see inflate()) */
var Z_BINARY = 0;
var Z_TEXT = 1;
//var Z_ASCII = 1; // = Z_TEXT
var Z_UNKNOWN = 2;
/*============================================================================*/
function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }
// From zutil.h
var STORED_BLOCK = 0;
var STATIC_TREES = 1;
var DYN_TREES = 2;
/* The three kinds of block type */
var MIN_MATCH = 3;
var MAX_MATCH = 258;
/* The minimum and maximum match lengths */
// From deflate.h
/* ===========================================================================
* Internal compression state.
*/
var LENGTH_CODES = 29;
/* number of length codes, not counting the special END_BLOCK code */
var LITERALS = 256;
/* number of literal bytes 0..255 */
var L_CODES = LITERALS + 1 + LENGTH_CODES;
/* number of Literal or Length codes, including the END_BLOCK code */
var D_CODES = 30;
/* number of distance codes */
var BL_CODES = 19;
/* number of codes used to transfer the bit lengths */
var HEAP_SIZE = 2*L_CODES + 1;
/* maximum heap size */
var MAX_BITS = 15;
/* All codes must not exceed MAX_BITS bits */
var Buf_size = 16;
/* size of bit buffer in bi_buf */
/* ===========================================================================
* Constants
*/
var MAX_BL_BITS = 7;
/* Bit length codes must not exceed MAX_BL_BITS bits */
var END_BLOCK = 256;
/* end of block literal code */
var REP_3_6 = 16;
/* repeat previous bit length 3-6 times (2 bits of repeat count) */
var REPZ_3_10 = 17;
/* repeat a zero length 3-10 times (3 bits of repeat count) */
var REPZ_11_138 = 18;
/* repeat a zero length 11-138 times (7 bits of repeat count) */
var extra_lbits = /* extra bits for each length code */
[0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0];
var extra_dbits = /* extra bits for each distance code */
[0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13];
var extra_blbits = /* extra bits for each bit length code */
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7];
var bl_order =
[16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];
/* The lengths of the bit length codes are sent in order of decreasing
* probability, to avoid transmitting the lengths for unused bit length codes.
*/
/* ===========================================================================
* Local data. These are initialized only once.
*/
// We pre-fill arrays with 0 to avoid uninitialized gaps
var DIST_CODE_LEN = 512; /* see definition of array dist_code below */
// !!!! Use flat array insdead of structure, Freq = i*2, Len = i*2+1
var static_ltree = new Array((L_CODES+2) * 2);
zero(static_ltree);
/* The static literal tree. Since the bit lengths are imposed, there is no
* need for the L_CODES extra codes used during heap construction. However
* The codes 286 and 287 are needed to build a canonical tree (see _tr_init
* below).
*/
var static_dtree = new Array(D_CODES * 2);
zero(static_dtree);
/* The static distance tree. (Actually a trivial tree since all codes use
* 5 bits.)
*/
var _dist_code = new Array(DIST_CODE_LEN);
zero(_dist_code);
/* Distance codes. The first 256 values correspond to the distances
* 3 .. 258, the last 256 values correspond to the top 8 bits of
* the 15 bit distances.
*/
var _length_code = new Array(MAX_MATCH-MIN_MATCH+1);
zero(_length_code);
/* length code for each normalized match length (0 == MIN_MATCH) */
var base_length = new Array(LENGTH_CODES);
zero(base_length);
/* First normalized length for each code (0 = MIN_MATCH) */
var base_dist = new Array(D_CODES);
zero(base_dist);
/* First normalized distance for each code (0 = distance of 1) */
var StaticTreeDesc = function (static_tree, extra_bits, extra_base, elems, max_length) {
this.static_tree = static_tree; /* static tree or NULL */
this.extra_bits = extra_bits; /* extra bits for each code or NULL */
this.extra_base = extra_base; /* base index for extra_bits */
this.elems = elems; /* max number of elements in the tree */
this.max_length = max_length; /* max bit length for the codes */
// show if `static_tree` has data or dummy - needed for monomorphic objects
this.has_stree = static_tree && static_tree.length;
};
var static_l_desc;
var static_d_desc;
var static_bl_desc;
var TreeDesc = function(dyn_tree, stat_desc) {
this.dyn_tree = dyn_tree; /* the dynamic tree */
this.max_code = 0; /* largest code with non zero frequency */
this.stat_desc = stat_desc; /* the corresponding static tree */
};
function d_code(dist) {
return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];
}
/* ===========================================================================
* Output a short LSB first on the stream.
* IN assertion: there is enough room in pendingBuf.
*/
function put_short (s, w) {
// put_byte(s, (uch)((w) & 0xff));
// put_byte(s, (uch)((ush)(w) >> 8));
s.pending_buf[s.pending++] = (w) & 0xff;
s.pending_buf[s.pending++] = (w >>> 8) & 0xff;
}
/* ===========================================================================
* Send a value on a given number of bits.
* IN assertion: length <= 16 and value fits in length bits.
*/
function send_bits(s, value, length) {
if (s.bi_valid > (Buf_size - length)) {
s.bi_buf |= (value << s.bi_valid) & 0xffff;
put_short(s, s.bi_buf);
s.bi_buf = value >> (Buf_size - s.bi_valid);
s.bi_valid += length - Buf_size;
} else {
s.bi_buf |= (value << s.bi_valid) & 0xffff;
s.bi_valid += length;
}
}
function send_code(s, c, tree) {
send_bits(s, tree[c*2]/*.Code*/, tree[c*2 + 1]/*.Len*/);
}
/* ===========================================================================
* Reverse the first len bits of a code, using straightforward code (a faster
* method would use a table)
* IN assertion: 1 <= len <= 15
*/
function bi_reverse(code, len) {
var res = 0;
do {
res |= code & 1;
code >>>= 1;
res <<= 1;
} while (--len > 0);
return res >>> 1;
}
/* ===========================================================================
* Flush the bit buffer, keeping at most 7 bits in it.
*/
function bi_flush(s) {
if (s.bi_valid === 16) {
put_short(s, s.bi_buf);
s.bi_buf = 0;
s.bi_valid = 0;
} else if (s.bi_valid >= 8) {
s.pending_buf[s.pending++] = s.bi_buf & 0xff;
s.bi_buf >>= 8;
s.bi_valid -= 8;
}
}
/* ===========================================================================
* Compute the optimal bit lengths for a tree and update the total bit length
* for the current block.
* IN assertion: the fields freq and dad are set, heap[heap_max] and
* above are the tree nodes sorted by increasing frequency.
* OUT assertions: the field len is set to the optimal bit length, the
* array bl_count contains the frequencies for each bit length.
* The length opt_len is updated; static_len is also updated if stree is
* not null.
*/
function gen_bitlen(s, desc)
// deflate_state *s;
// tree_desc *desc; /* the tree descriptor */
{
var tree = desc.dyn_tree;
var max_code = desc.max_code;
var stree = desc.stat_desc.static_tree;
var has_stree = desc.stat_desc.has_stree;
var extra = desc.stat_desc.extra_bits;
var base = desc.stat_desc.extra_base;
var max_length = desc.stat_desc.max_length;
var h; /* heap index */
var n, m; /* iterate over the tree elements */
var bits; /* bit length */
var xbits; /* extra bits */
var f; /* frequency */
var overflow = 0; /* number of elements with bit length too large */
for (bits = 0; bits <= MAX_BITS; bits++) {
s.bl_count[bits] = 0;
}
/* In a first pass, compute the optimal bit lengths (which may
* overflow in the case of the bit length tree).
*/
tree[s.heap[s.heap_max]*2 + 1]/*.Len*/ = 0; /* root of the heap */
for (h = s.heap_max+1; h < HEAP_SIZE; h++) {
n = s.heap[h];
bits = tree[tree[n*2 +1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;
if (bits > max_length) {
bits = max_length;
overflow++;
}
tree[n*2 + 1]/*.Len*/ = bits;
/* We overwrite tree[n].Dad which is no longer needed */
if (n > max_code) { continue; } /* not a leaf node */
s.bl_count[bits]++;
xbits = 0;
if (n >= base) {
xbits = extra[n-base];
}
f = tree[n * 2]/*.Freq*/;
s.opt_len += f * (bits + xbits);
if (has_stree) {
s.static_len += f * (stree[n*2 + 1]/*.Len*/ + xbits);
}
}
if (overflow === 0) { return; }
// Trace((stderr,"\nbit length overflow\n"));
/* This happens for example on obj2 and pic of the Calgary corpus */
/* Find the first bit length which could increase: */
do {
bits = max_length-1;
while (s.bl_count[bits] === 0) { bits--; }
s.bl_count[bits]--; /* move one leaf down the tree */
s.bl_count[bits+1] += 2; /* move one overflow item as its brother */
s.bl_count[max_length]--;
/* The brother of the overflow item also moves one step up,
* but this does not affect bl_count[max_length]
*/
overflow -= 2;
} while (overflow > 0);
/* Now recompute all bit lengths, scanning in increasing frequency.
* h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
* lengths instead of fixing only the wrong ones. This idea is taken
* from 'ar' written by Haruhiko Okumura.)
*/
for (bits = max_length; bits !== 0; bits--) {
n = s.bl_count[bits];
while (n !== 0) {
m = s.heap[--h];
if (m > max_code) { continue; }
if (tree[m*2 + 1]/*.Len*/ !== bits) {
// Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
s.opt_len += (bits - tree[m*2 + 1]/*.Len*/)*tree[m*2]/*.Freq*/;
tree[m*2 + 1]/*.Len*/ = bits;
}
n--;
}
}
}
/* ===========================================================================
* Generate the codes for a given tree and bit counts (which need not be
* optimal).
* IN assertion: the array bl_count contains the bit length statistics for
* the given tree and the field len is set for all tree elements.
* OUT assertion: the field code is set for all tree elements of non
* zero code length.
*/
function gen_codes(tree, max_code, bl_count)
// ct_data *tree; /* the tree to decorate */
// int max_code; /* largest code with non zero frequency */
// ushf *bl_count; /* number of codes at each bit length */
{
var next_code = new Array(MAX_BITS+1); /* next code value for each bit length */
var code = 0; /* running code value */
var bits; /* bit index */
var n; /* code index */
/* The distribution counts are first used to generate the code values
* without bit reversal.
*/
for (bits = 1; bits <= MAX_BITS; bits++) {
next_code[bits] = code = (code + bl_count[bits-1]) << 1;
}
/* Check that the bit counts in bl_count are consistent. The last code
* must be all ones.
*/
//Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
// "inconsistent bit counts");
//Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
for (n = 0; n <= max_code; n++) {
var len = tree[n*2 + 1]/*.Len*/;
if (len === 0) { continue; }
/* Now reverse the bits */
tree[n*2]/*.Code*/ = bi_reverse(next_code[len]++, len);
//Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
// n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
}
}
/* ===========================================================================
* Initialize the various 'constant' tables.
*/
function tr_static_init() {
var n; /* iterates over tree elements */
var bits; /* bit counter */
var length; /* length value */
var code; /* code value */
var dist; /* distance index */
var bl_count = new Array(MAX_BITS+1);
/* number of codes at each bit length for an optimal tree */
// do check in _tr_init()
//if (static_init_done) return;
/* For some embedded targets, global variables are not initialized: */
/*#ifdef NO_INIT_GLOBAL_POINTERS
static_l_desc.static_tree = static_ltree;
static_l_desc.extra_bits = extra_lbits;
static_d_desc.static_tree = static_dtree;
static_d_desc.extra_bits = extra_dbits;
static_bl_desc.extra_bits = extra_blbits;
#endif*/
/* Initialize the mapping length (0..255) -> length code (0..28) */
length = 0;
for (code = 0; code < LENGTH_CODES-1; code++) {
base_length[code] = length;
for (n = 0; n < (1<<extra_lbits[code]); n++) {
_length_code[length++] = code;
}
}
//Assert (length == 256, "tr_static_init: length != 256");
/* Note that the length 255 (match length 258) can be represented
* in two different ways: code 284 + 5 bits or code 285, so we
* overwrite length_code[255] to use the best encoding:
*/
_length_code[length-1] = code;
/* Initialize the mapping dist (0..32K) -> dist code (0..29) */
dist = 0;
for (code = 0 ; code < 16; code++) {
base_dist[code] = dist;
for (n = 0; n < (1<<extra_dbits[code]); n++) {
_dist_code[dist++] = code;
}
}
//Assert (dist == 256, "tr_static_init: dist != 256");
dist >>= 7; /* from now on, all distances are divided by 128 */
for ( ; code < D_CODES; code++) {
base_dist[code] = dist << 7;
for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {
_dist_code[256 + dist++] = code;
}
}
//Assert (dist == 256, "tr_static_init: 256+dist != 512");
/* Construct the codes of the static literal tree */
for (bits = 0; bits <= MAX_BITS; bits++) {
bl_count[bits] = 0;
}
n = 0;
while (n <= 143) {
static_ltree[n*2 + 1]/*.Len*/ = 8;
n++;
bl_count[8]++;
}
while (n <= 255) {
static_ltree[n*2 + 1]/*.Len*/ = 9;
n++;
bl_count[9]++;
}
while (n <= 279) {
static_ltree[n*2 + 1]/*.Len*/ = 7;
n++;
bl_count[7]++;
}
while (n <= 287) {
static_ltree[n*2 + 1]/*.Len*/ = 8;
n++;
bl_count[8]++;
}
/* Codes 286 and 287 do not exist, but we must include them in the
* tree construction to get a canonical Huffman tree (longest code
* all ones)
*/
gen_codes(static_ltree, L_CODES+1, bl_count);
/* The static distance tree is trivial: */
for (n = 0; n < D_CODES; n++) {
static_dtree[n*2 + 1]/*.Len*/ = 5;
static_dtree[n*2]/*.Code*/ = bi_reverse(n, 5);
}
// Now data ready and we can init static trees
static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS);
static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS);
static_bl_desc =new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS);
//static_init_done = true;
}
/* ===========================================================================
* Initialize a new block.
*/
function init_block(s) {
var n; /* iterates over tree elements */
/* Initialize the trees. */
for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n*2]/*.Freq*/ = 0; }
for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n*2]/*.Freq*/ = 0; }
for (n = 0; n < BL_CODES; n++) { s.bl_tree[n*2]/*.Freq*/ = 0; }
s.dyn_ltree[END_BLOCK*2]/*.Freq*/ = 1;
s.opt_len = s.static_len = 0;
s.last_lit = s.matches = 0;
}
/* ===========================================================================
* Flush the bit buffer and align the output on a byte boundary
*/
function bi_windup(s)
{
if (s.bi_valid > 8) {
put_short(s, s.bi_buf);
} else if (s.bi_valid > 0) {
//put_byte(s, (Byte)s->bi_buf);
s.pending_buf[s.pending++] = s.bi_buf;
}
s.bi_buf = 0;
s.bi_valid = 0;
}
/* ===========================================================================
* Copy a stored block, storing first the length and its
* one's complement if requested.
*/
function copy_block(s, buf, len, header)
//DeflateState *s;
//charf *buf; /* the input data */
//unsigned len; /* its length */
//int header; /* true if block header must be written */
{
bi_windup(s); /* align on byte boundary */
if (header) {
put_short(s, len);
put_short(s, ~len);
}
// while (len--) {
// put_byte(s, *buf++);
// }
utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);
s.pending += len;
}
/* ===========================================================================
* Compares to subtrees, using the tree depth as tie breaker when
* the subtrees have equal frequency. This minimizes the worst case length.
*/
function smaller(tree, n, m, depth) {
var _n2 = n*2;
var _m2 = m*2;
return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||
(tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));
}
/* ===========================================================================
* Restore the heap property by moving down the tree starting at node k,
* exchanging a node with the smallest of its two sons if necessary, stopping
* when the heap property is re-established (each father smaller than its
* two sons).
*/
function pqdownheap(s, tree, k)
// deflate_state *s;
// ct_data *tree; /* the tree to restore */
// int k; /* node to move down */
{
var v = s.heap[k];
var j = k << 1; /* left son of k */
while (j <= s.heap_len) {
/* Set j to the smallest of the two sons: */
if (j < s.heap_len &&
smaller(tree, s.heap[j+1], s.heap[j], s.depth)) {
j++;
}
/* Exit if v is smaller than both sons */
if (smaller(tree, v, s.heap[j], s.depth)) { break; }
/* Exchange v with the smallest son */
s.heap[k] = s.heap[j];
k = j;
/* And continue down the tree, setting j to the left son of k */
j <<= 1;
}
s.heap[k] = v;
}
// inlined manually
// var SMALLEST = 1;
/* ===========================================================================
* Send the block data compressed using the given Huffman trees
*/
function compress_block(s, ltree, dtree)
// deflate_state *s;
// const ct_data *ltree; /* literal tree */
// const ct_data *dtree; /* distance tree */
{
var dist; /* distance of matched string */
var lc; /* match length or unmatched char (if dist == 0) */
var lx = 0; /* running index in l_buf */
var code; /* the code to send */
var extra; /* number of extra bits to send */
if (s.last_lit !== 0) {
do {
dist = (s.pending_buf[s.d_buf + lx*2] << 8) | (s.pending_buf[s.d_buf + lx*2 + 1]);
lc = s.pending_buf[s.l_buf + lx];
lx++;
if (dist === 0) {
send_code(s, lc, ltree); /* send a literal byte */
//Tracecv(isgraph(lc), (stderr," '%c' ", lc));
} else {
/* Here, lc is the match length - MIN_MATCH */
code = _length_code[lc];
send_code(s, code+LITERALS+1, ltree); /* send the length code */
extra = extra_lbits[code];
if (extra !== 0) {
lc -= base_length[code];
send_bits(s, lc, extra); /* send the extra length bits */
}
dist--; /* dist is now the match distance - 1 */
code = d_code(dist);
//Assert (code < D_CODES, "bad d_code");
send_code(s, code, dtree); /* send the distance code */
extra = extra_dbits[code];
if (extra !== 0) {
dist -= base_dist[code];
send_bits(s, dist, extra); /* send the extra distance bits */
}
} /* literal or match pair ? */
/* Check that the overlay between pending_buf and d_buf+l_buf is ok: */
//Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,
// "pendingBuf overflow");
} while (lx < s.last_lit);
}
send_code(s, END_BLOCK, ltree);
}
/* ===========================================================================
* Construct one Huffman tree and assigns the code bit strings and lengths.
* Update the total bit length for the current block.
* IN assertion: the field freq is set for all tree elements.
* OUT assertions: the fields len and code are set to the optimal bit length
* and corresponding code. The length opt_len is updated; static_len is
* also updated if stree is not null. The field max_code is set.
*/
function build_tree(s, desc)
// deflate_state *s;
// tree_desc *desc; /* the tree descriptor */
{
var tree = desc.dyn_tree;
var stree = desc.stat_desc.static_tree;
var has_stree = desc.stat_desc.has_stree;
var elems = desc.stat_desc.elems;
var n, m; /* iterate over heap elements */
var max_code = -1; /* largest code with non zero frequency */
var node; /* new node being created */
/* Construct the initial heap, with least frequent element in
* heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
* heap[0] is not used.
*/
s.heap_len = 0;
s.heap_max = HEAP_SIZE;
for (n = 0; n < elems; n++) {
if (tree[n * 2]/*.Freq*/ !== 0) {
s.heap[++s.heap_len] = max_code = n;
s.depth[n] = 0;
} else {
tree[n*2 + 1]/*.Len*/ = 0;
}
}
/* The pkzip format requires that at least one distance code exists,
* and that at least one bit should be sent even if there is only one
* possible code. So to avoid special checks later on we force at least
* two codes of non zero frequency.
*/
while (s.heap_len < 2) {
node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);
tree[node * 2]/*.Freq*/ = 1;
s.depth[node] = 0;
s.opt_len--;
if (has_stree) {
s.static_len -= stree[node*2 + 1]/*.Len*/;
}
/* node is 0 or 1 so it does not have extra bits */
}
desc.max_code = max_code;
/* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
* establish sub-heaps of increasing lengths:
*/
for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }
/* Construct the Huffman tree by repeatedly combining the least two
* frequent nodes.
*/
node = elems; /* next internal node of the tree */
do {
//pqremove(s, tree, n); /* n = node of least frequency */
/*** pqremove ***/
n = s.heap[1/*SMALLEST*/];
s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];
pqdownheap(s, tree, 1/*SMALLEST*/);
/***/
m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */
s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */
s.heap[--s.heap_max] = m;
/* Create a new node father of n and m */
tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;
s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;
tree[n*2 + 1]/*.Dad*/ = tree[m*2 + 1]/*.Dad*/ = node;
/* and insert the new node in the heap */
s.heap[1/*SMALLEST*/] = node++;
pqdownheap(s, tree, 1/*SMALLEST*/);
} while (s.heap_len >= 2);
s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];
/* At this point, the fields freq and dad are set. We can now
* generate the bit lengths.
*/
gen_bitlen(s, desc);
/* The field len is now set, we can generate the bit codes */
gen_codes(tree, max_code, s.bl_count);
}
/* ===========================================================================
* Scan a literal or distance tree to determine the frequencies of the codes
* in the bit length tree.
*/
function scan_tree(s, tree, max_code)
// deflate_state *s;
// ct_data *tree; /* the tree to be scanned */
// int max_code; /* and its largest code of non zero frequency */
{
var n; /* iterates over all tree elements */
var prevlen = -1; /* last emitted length */
var curlen; /* length of current code */
var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */
var count = 0; /* repeat count of the current code */
var max_count = 7; /* max repeat count */
var min_count = 4; /* min repeat count */
if (nextlen === 0) {
max_count = 138;
min_count = 3;
}
tree[(max_code+1)*2 + 1]/*.Len*/ = 0xffff; /* guard */
for (n = 0; n <= max_code; n++) {
curlen = nextlen;
nextlen = tree[(n+1)*2 + 1]/*.Len*/;
if (++count < max_count && curlen === nextlen) {
continue;
} else if (count < min_count) {
s.bl_tree[curlen * 2]/*.Freq*/ += count;
} else if (curlen !== 0) {
if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }
s.bl_tree[REP_3_6*2]/*.Freq*/++;
} else if (count <= 10) {
s.bl_tree[REPZ_3_10*2]/*.Freq*/++;
} else {
s.bl_tree[REPZ_11_138*2]/*.Freq*/++;
}
count = 0;
prevlen = curlen;
if (nextlen === 0) {
max_count = 138;
min_count = 3;
} else if (curlen === nextlen) {
max_count = 6;
min_count = 3;
} else {
max_count = 7;
min_count = 4;
}
}
}
/* ===========================================================================
* Send a literal or distance tree in compressed form, using the codes in
* bl_tree.
*/
function send_tree(s, tree, max_code)
// deflate_state *s;
// ct_data *tree; /* the tree to be scanned */
// int max_code; /* and its largest code of non zero frequency */
{
var n; /* iterates over all tree elements */
var prevlen = -1; /* last emitted length */
var curlen; /* length of current code */
var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */
var count = 0; /* repeat count of the current code */
var max_count = 7; /* max repeat count */
var min_count = 4; /* min repeat count */
/* tree[max_code+1].Len = -1; */ /* guard already set */
if (nextlen === 0) {
max_count = 138;
min_count = 3;
}
for (n = 0; n <= max_code; n++) {
curlen = nextlen;
nextlen = tree[(n+1)*2 + 1]/*.Len*/;
if (++count < max_count && curlen === nextlen) {
continue;
} else if (count < min_count) {
do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);
} else if (curlen !== 0) {
if (curlen !== prevlen) {
send_code(s, curlen, s.bl_tree);
count--;
}
//Assert(count >= 3 && count <= 6, " 3_6?");
send_code(s, REP_3_6, s.bl_tree);
send_bits(s, count-3, 2);
} else if (count <= 10) {
send_code(s, REPZ_3_10, s.bl_tree);
send_bits(s, count-3, 3);
} else {
send_code(s, REPZ_11_138, s.bl_tree);
send_bits(s, count-11, 7);
}
count = 0;
prevlen = curlen;
if (nextlen === 0) {
max_count = 138;
min_count = 3;
} else if (curlen === nextlen) {
max_count = 6;
min_count = 3;
} else {
max_count = 7;
min_count = 4;
}
}
}
/* ===========================================================================
* Construct the Huffman tree for the bit lengths and return the index in
* bl_order of the last bit length code to send.
*/
function build_bl_tree(s) {
var max_blindex; /* index of last bit length code of non zero freq */
/* Determine the bit length frequencies for literal and distance trees */
scan_tree(s, s.dyn_ltree, s.l_desc.max_code);
scan_tree(s, s.dyn_dtree, s.d_desc.max_code);
/* Build the bit length tree: */
build_tree(s, s.bl_desc);
/* opt_len now includes the length of the tree representations, except
* the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
*/
/* Determine the number of bit length codes to send. The pkzip format
* requires that at least 4 bit length codes be sent. (appnote.txt says
* 3 but the actual value used is 4.)
*/
for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
if (s.bl_tree[bl_order[max_blindex]*2 + 1]/*.Len*/ !== 0) {
break;
}
}
/* Update opt_len to include the bit length tree and counts */
s.opt_len += 3*(max_blindex+1) + 5+5+4;
//Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",
// s->opt_len, s->static_len));
return max_blindex;
}
/* ===========================================================================
* Send the header for a block using dynamic Huffman trees: the counts, the
* lengths of the bit length codes, the literal tree and the distance tree.
* IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
*/
function send_all_trees(s, lcodes, dcodes, blcodes)
// deflate_state *s;
// int lcodes, dcodes, blcodes; /* number of codes for each tree */
{
var rank; /* index in bl_order */
//Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
//Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
// "too many codes");
//Tracev((stderr, "\nbl counts: "));
send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */
send_bits(s, dcodes-1, 5);
send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
for (rank = 0; rank < blcodes; rank++) {
//Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);
}
//Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent));
send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */
//Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent));
send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */
//Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));
}
/* ===========================================================================
* Check if the data type is TEXT or BINARY, using the following algorithm:
* - TEXT if the two conditions below are satisfied:
* a) There are no non-portable control characters belonging to the
* "black list" (0..6, 14..25, 28..31).
* b) There is at least one printable character belonging to the
* "white list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).
* - BINARY otherwise.
* - The following partially-portable control characters form a
* "gray list" that is ignored in this detection algorithm:
* (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).
* IN assertion: the fields Freq of dyn_ltree are set.
*/
function detect_data_type(s) {
/* black_mask is the bit mask of black-listed bytes
* set bits 0..6, 14..25, and 28..31
* 0xf3ffc07f = binary 11110011111111111100000001111111
*/
var black_mask = 0xf3ffc07f;
var n;
/* Check for non-textual ("black-listed") bytes. */
for (n = 0; n <= 31; n++, black_mask >>>= 1) {
if ((black_mask & 1) && (s.dyn_ltree[n*2]/*.Freq*/ !== 0)) {
return Z_BINARY;
}
}
/* Check for textual ("white-listed") bytes. */
if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||
s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {
return Z_TEXT;
}
for (n = 32; n < LITERALS; n++) {
if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {
return Z_TEXT;
}
}
/* There are no "black-listed" or "white-listed" bytes:
* this stream either is empty or has tolerated ("gray-listed") bytes only.
*/
return Z_BINARY;
}
var static_init_done = false;
/* ===========================================================================
* Initialize the tree data structures for a new zlib stream.
*/
function _tr_init(s)
{
if (!static_init_done) {
tr_static_init();
static_init_done = true;
}
s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);
s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);
s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);
s.bi_buf = 0;
s.bi_valid = 0;
/* Initialize the first block of the first file: */
init_block(s);
}
/* ===========================================================================
* Send a stored block
*/
function _tr_stored_block(s, buf, stored_len, last)
//DeflateState *s;
//charf *buf; /* input block */
//ulg stored_len; /* length of input block */
//int last; /* one if this is the last block for a file */
{
send_bits(s, (STORED_BLOCK<<1)+(last ? 1 : 0), 3); /* send block type */
copy_block(s, buf, stored_len, true); /* with header */
}
/* ===========================================================================
* Send one empty static block to give enough lookahead for inflate.
* This takes 10 bits, of which 7 may remain in the bit buffer.
*/
function _tr_align(s) {
send_bits(s, STATIC_TREES<<1, 3);
send_code(s, END_BLOCK, static_ltree);
bi_flush(s);
}
/* ===========================================================================
* Determine the best encoding for the current block: dynamic trees, static
* trees or store, and output the encoded block to the zip file.
*/
function _tr_flush_block(s, buf, stored_len, last)
//DeflateState *s;
//charf *buf; /* input block, or NULL if too old */
//ulg stored_len; /* length of input block */
//int last; /* one if this is the last block for a file */
{
var opt_lenb, static_lenb; /* opt_len and static_len in bytes */
var max_blindex = 0; /* index of last bit length code of non zero freq */
/* Build the Huffman trees unless a stored block is forced */
if (s.level > 0) {
/* Check if the file is binary or text */
if (s.strm.data_type === Z_UNKNOWN) {
s.strm.data_type = detect_data_type(s);
}
/* Construct the literal and distance trees */
build_tree(s, s.l_desc);
// Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len,
// s->static_len));
build_tree(s, s.d_desc);
// Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len,
// s->static_len));
/* At this point, opt_len and static_len are the total bit lengths of
* the compressed block data, excluding the tree representations.
*/
/* Build the bit length tree for the above two trees, and get the index
* in bl_order of the last bit length code to send.
*/
max_blindex = build_bl_tree(s);
/* Determine the best encoding. Compute the block lengths in bytes. */
opt_lenb = (s.opt_len+3+7) >>> 3;
static_lenb = (s.static_len+3+7) >>> 3;
// Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ",
// opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,
// s->last_lit));
if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }
} else {
// Assert(buf != (char*)0, "lost buf");
opt_lenb = static_lenb = stored_len + 5; /* force a stored block */
}
if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {
/* 4: two words for the lengths */
/* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
* Otherwise we can't have processed more than WSIZE input bytes since
* the last block flush, because compression would have been
* successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
* transform a block into a stored block.
*/
_tr_stored_block(s, buf, stored_len, last);
} else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {
send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);
compress_block(s, static_ltree, static_dtree);
} else {
send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);
send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);
compress_block(s, s.dyn_ltree, s.dyn_dtree);
}
// Assert (s->compressed_len == s->bits_sent, "bad compressed size");
/* The above check is made mod 2^32, for files larger than 512 MB
* and uLong implemented on 32 bits.
*/
init_block(s);
if (last) {
bi_windup(s);
}
// Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3,
// s->compressed_len-7*last));
}
/* ===========================================================================
* Save the match info and tally the frequency counts. Return true if
* the current block must be flushed.
*/
function _tr_tally(s, dist, lc)
// deflate_state *s;
// unsigned dist; /* distance of matched string */
// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
{
//var out_length, in_length, dcode;
s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff;
s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;
s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;
s.last_lit++;
if (dist === 0) {
/* lc is the unmatched char */
s.dyn_ltree[lc*2]/*.Freq*/++;
} else {
s.matches++;
/* Here, lc is the match length - MIN_MATCH */
dist--; /* dist = match distance - 1 */
//Assert((ush)dist < (ush)MAX_DIST(s) &&
// (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
// (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
s.dyn_ltree[(_length_code[lc]+LITERALS+1) * 2]/*.Freq*/++;
s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;
}
// (!) This block is disabled in zlib defailts,
// don't enable it for binary compatibility
//#ifdef TRUNCATE_BLOCK
// /* Try to guess if it is profitable to stop the current block here */
// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {
// /* Compute an upper bound for the compressed length */
// out_length = s.last_lit*8;
// in_length = s.strstart - s.block_start;
//
// for (dcode = 0; dcode < D_CODES; dcode++) {
// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);
// }
// out_length >>>= 3;
// //Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ",
// // s->last_lit, in_length, out_length,
// // 100L - out_length*100L/in_length));
// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {
// return true;
// }
// }
//#endif
return (s.last_lit === s.lit_bufsize-1);
/* We avoid equality with lit_bufsize because of wraparound at 64K
* on 16 bit machines and because stored blocks are restricted to
* 64K-1 bytes.
*/
}
exports._tr_init = _tr_init;
exports._tr_stored_block = _tr_stored_block;
exports._tr_flush_block = _tr_flush_block;
exports._tr_tally = _tr_tally;
exports._tr_align = _tr_align;
},{"../utils/common":27}],39:[function(_dereq_,module,exports){
'use strict';
function ZStream() {
/* next input byte */
this.input = null; // JS specific, because we have no pointers
this.next_in = 0;
/* number of bytes available at input */
this.avail_in = 0;
/* total number of input bytes read so far */
this.total_in = 0;
/* next output byte should be put there */
this.output = null; // JS specific, because we have no pointers
this.next_out = 0;
/* remaining free space at output */
this.avail_out = 0;
/* total number of bytes output so far */
this.total_out = 0;
/* last error message, NULL if no error */
this.msg = ''/*Z_NULL*/;
/* not visible by applications */
this.state = null;
/* best guess about the data type: binary or text */
this.data_type = 2/*Z_UNKNOWN*/;
/* adler32 value of the uncompressed data */
this.adler = 0;
}
module.exports = ZStream;
},{}]},{},[9])
(9)
});
原xlsx.js 上部分代码
/*
* xlsx.js
* 2017/01/16 QuJun
*/ var XLSX = {};
(function make_xlsx(XLSX) {
XLSX.version = '0.8.1';
var current_codepage = 1200, current_cptable;
if (typeof module !== "undefined" && typeof require !== 'undefined') {
if (typeof cptable === 'undefined') cptable = require('./dist/cpexcel');
current_cptable = cptable[current_codepage];
}
function reset_cp() { set_cp(1200); }
var set_cp = function (cp) { current_codepage = cp; }; function char_codes(data) { var o = []; for (var i = 0, len = data.length; i < len; ++i) o[i] = data.charCodeAt(i); return o; }
var debom_xml = function (data) { return data; }; var _getchar = function _gc1(x) { return String.fromCharCode(x); };
if (typeof cptable !== 'undefined') {
set_cp = function (cp) { current_codepage = cp; current_cptable = cptable[cp]; };
debom_xml = function (data) {
if (data.charCodeAt(0) === 0xFF && data.charCodeAt(1) === 0xFE) { return cptable.utils.decode(1200, char_codes(data.substr(2))); }
return data;
};
_getchar = function _gc2(x) {
if (current_codepage === 1200) return String.fromCharCode(x);
return cptable.utils.decode(current_codepage, [x & 255, x >> 8])[0];
};
}
var Base64 = (function make_b64() {
var map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
return {
encode: function (input, utf8) {
var o = "";
var c1, c2, c3, e1, e2, e3, e4;
for (var i = 0; i < input.length;) {
c1 = input.charCodeAt(i++);
c2 = input.charCodeAt(i++);
c3 = input.charCodeAt(i++);
e1 = c1 >> 2;
e2 = (c1 & 3) << 4 | c2 >> 4;
e3 = (c2 & 15) << 2 | c3 >> 6;
e4 = c3 & 63;
if (isNaN(c2)) { e3 = e4 = 64; }
else if (isNaN(c3)) { e4 = 64; }
o += map.charAt(e1) + map.charAt(e2) + map.charAt(e3) + map.charAt(e4);
}
return o;
},
decode: function b64_decode(input, utf8) {
var o = "";
var c1, c2, c3;
var e1, e2, e3, e4;
input = input.replace(/[^A-Za-z0-9\+\/\=]/g, "");
for (var i = 0; i < input.length;) {
e1 = map.indexOf(input.charAt(i++));
e2 = map.indexOf(input.charAt(i++));
e3 = map.indexOf(input.charAt(i++));
e4 = map.indexOf(input.charAt(i++));
c1 = e1 << 2 | e2 >> 4;
c2 = (e2 & 15) << 4 | e3 >> 2;
c3 = (e3 & 3) << 6 | e4;
o += String.fromCharCode(c1);
if (e3 != 64) { o += String.fromCharCode(c2); }
if (e4 != 64) { o += String.fromCharCode(c3); }
}
return o;
}
};
})();
var has_buf = (typeof Buffer !== 'undefined'); function new_raw_buf(len) {
/* jshint -W056 */
return new (has_buf ? Buffer : Array)(len);
/* jshint +W056 */
} function s2a(s) {
if (has_buf) return new Buffer(s, "binary");
return s.split("").map(function (x) { return x.charCodeAt(0) & 0xff; });
} var bconcat = function (bufs) { return [].concat.apply([], bufs); }; var chr0 = /\u0000/g, chr1 = /[\u0001-\u0006]/;
/* ssf.js (C) 2013-2014 SheetJS -- http://sheetjs.com */
/*jshint -W041 */
var SSF = {};
var make_ssf = function make_ssf(SSF) {
SSF.version = '0.8.1';
function _strrev(x) { var o = "", i = x.length - 1; while (i >= 0) o += x.charAt(i--); return o; }
function fill(c, l) { var o = ""; while (o.length < l) o += c; return o; }
function pad0(v, d) { var t = "" + v; return t.length >= d ? t : fill('0', d - t.length) + t; }
function pad_(v, d) { var t = "" + v; return t.length >= d ? t : fill(' ', d - t.length) + t; }
function rpad_(v, d) { var t = "" + v; return t.length >= d ? t : t + fill(' ', d - t.length); }
function pad0r1(v, d) { var t = "" + Math.round(v); return t.length >= d ? t : fill('0', d - t.length) + t; }
function pad0r2(v, d) { var t = "" + v; return t.length >= d ? t : fill('0', d - t.length) + t; }
var p2_32 = Math.pow(2, 32);
function pad0r(v, d) { if (v > p2_32 || v < -p2_32) return pad0r1(v, d); var i = Math.round(v); return pad0r2(i, d); }
function isgeneral(s, i) { return s.length >= 7 + i && (s.charCodeAt(i) | 32) === 103 && (s.charCodeAt(i + 1) | 32) === 101 && (s.charCodeAt(i + 2) | 32) === 110 && (s.charCodeAt(i + 3) | 32) === 101 && (s.charCodeAt(i + 4) | 32) === 114 && (s.charCodeAt(i + 5) | 32) === 97 && (s.charCodeAt(i + 6) | 32) === 108; }
/* Options */
var opts_fmt = [
["date1904", 0],
["output", ""],
["WTF", false]
];
function fixopts(o) {
for (var y = 0; y != opts_fmt.length; ++y) if (o[opts_fmt[y][0]] === undefined) o[opts_fmt[y][0]] = opts_fmt[y][1];
}
SSF.opts = opts_fmt;
var table_fmt = {
0: 'General',
1: '0',
2: '0.00',
3: '#,##0',
4: '#,##0.00',
5: '#0.00',
9: '0%',
10: '0.0%',
11: '0.00E+00',
12: '# ?/?',
13: '# ??/??',
14: 'm/d/yy',
15: 'd-mmm-yy',
16: 'd-mmm',
17: 'mmm-yy',
18: 'h:mm AM/PM',
19: 'h:mm:ss AM/PM',
20: 'h:mm',
21: 'h:mm:ss',
22: 'm/d/yy h:mm',
23: 'yyyy-mm-dd',
37: '#,##0 ;(#,##0)',
38: '#,##0 ;[Red](#,##0)',
39: '#,##0.00;(#,##0.00)',
40: '#,##0.00;[Red](#,##0.00)',
45: 'mm:ss',
46: '[h]:mm:ss',
47: 'mmss.0',
48: '##0.0E+0',
49: '@',
56: '"上午/下午 "hh"時"mm"分"ss"秒 "',
65535: 'General'
};
var days = [
['Sun', 'Sunday'],
['Mon', 'Monday'],
['Tue', 'Tuesday'],
['Wed', 'Wednesday'],
['Thu', 'Thursday'],
['Fri', 'Friday'],
['Sat', 'Saturday']
];
var months = [
['J', 'Jan', 'January'],
['F', 'Feb', 'February'],
['M', 'Mar', 'March'],
['A', 'Apr', 'April'],
['M', 'May', 'May'],
['J', 'Jun', 'June'],
['J', 'Jul', 'July'],
['A', 'Aug', 'August'],
['S', 'Sep', 'September'],
['O', 'Oct', 'October'],
['N', 'Nov', 'November'],
['D', 'Dec', 'December']
];
function frac(x, D, mixed) {
var sgn = x < 0 ? -1 : 1;
var B = x * sgn;
var P_2 = 0, P_1 = 1, P = 0;
var Q_2 = 1, Q_1 = 0, Q = 0;
var A = Math.floor(B);
while (Q_1 < D) {
A = Math.floor(B);
P = A * P_1 + P_2;
Q = A * Q_1 + Q_2;
if ((B - A) < 0.0000000005) break;
B = 1 / (B - A);
P_2 = P_1; P_1 = P;
Q_2 = Q_1; Q_1 = Q;
}
if (Q > D) { Q = Q_1; P = P_1; }
if (Q > D) { Q = Q_2; P = P_2; }
if (!mixed) return [0, sgn * P, Q];
if (Q === 0) throw "Unexpected state: " + P + " " + P_1 + " " + P_2 + " " + Q + " " + Q_1 + " " + Q_2;
var q = Math.floor(sgn * P / Q);
return [q, sgn * P - q * Q, Q];
}
function general_fmt_int(v, opts) { return "" + v; }
SSF._general_int = general_fmt_int;
var general_fmt_num = (function make_general_fmt_num() {
var gnr1 = /\.(\d*[1-9])0+$/, gnr2 = /\.0*$/, gnr4 = /\.(\d*[1-9])0+/, gnr5 = /\.0*[Ee]/, gnr6 = /(E[+-])(\d)$/;
function gfn2(v) {
var w = (v < 0 ? 12 : 11);
var o = gfn5(v.toFixed(12)); if (o.length <= w) return o;
o = v.toPrecision(10); if (o.length <= w) return o;
return v.toExponential(5);
}
function gfn3(v) {
var o = v.toFixed(11).replace(gnr1, ".$1");
if (o.length > (v < 0 ? 12 : 11)) o = v.toPrecision(6);
return o;
}
function gfn4(o) {
for (var i = 0; i != o.length; ++i) if ((o.charCodeAt(i) | 0x20) === 101) return o.replace(gnr4, ".$1").replace(gnr5, "E").replace("e", "E").replace(gnr6, "$10$2");
return o;
}
function gfn5(o) {
//for(var i = 0; i != o.length; ++i) if(o.charCodeAt(i) === 46) return o.replace(gnr2,"").replace(gnr1,".$1");
//return o;
return o.indexOf(".") > -1 ? o.replace(gnr2, "").replace(gnr1, ".$1") : o;
}
return function general_fmt_num(v, opts) {
var V = Math.floor(Math.log(Math.abs(v)) * Math.LOG10E), o;
if (V >= -4 && V <= -1) o = v.toPrecision(10 + V);
else if (Math.abs(V) <= 9) o = gfn2(v);
else if (V === 10) o = v.toFixed(10).substr(0, 12);
else o = gfn3(v);
return gfn5(gfn4(o));
};
})();
SSF._general_num = general_fmt_num;
function general_fmt(v, opts) {
switch (typeof v) {
case 'string': return v;
case 'boolean': return v ? "TRUE" : "FALSE";
case 'number': return (v | 0) === v ? general_fmt_int(v, opts) : general_fmt_num(v, opts);
}
throw new Error("unsupported value in General format: " + v);
}
SSF._general = general_fmt;
function fix_hijri(date, o) { return 0; }
function parse_date_code(v, opts, b2) {
if (v > 2958465 || v < 0) return null;
var date = (v | 0), time = Math.floor(86400 * (v - date)), dow = 0;
var dout = [];
var out = { D: date, T: time, u: 86400 * (v - date) - time, y: 0, m: 0, d: 0, H: 0, M: 0, S: 0, q: 0 };
if (Math.abs(out.u) < 1e-6) out.u = 0;
fixopts(opts != null ? opts : (opts = []));
if (opts.date1904) date += 1462;
if (out.u > 0.999) {
out.u = 0;
if (++time == 86400) { time = 0; ++date; }
}
if (date === 60) { dout = b2 ? [1317, 10, 29] : [1900, 2, 29]; dow = 3; }
else if (date === 0) { dout = b2 ? [1317, 8, 29] : [1900, 1, 0]; dow = 6; }
else {
if (date > 60)--date;
/* 1 = Jan 1 1900 */
var d = new Date(1900, 0, 1);
d.setDate(d.getDate() + date - 1);
dout = [d.getFullYear(), d.getMonth() + 1, d.getDate()];
dow = d.getDay();
if (date < 60) dow = (dow + 6) % 7;
if (b2) dow = fix_hijri(d, dout);
}
out.y = dout[0]; out.m = dout[1]; out.d = dout[2];
out.S = time % 60; time = Math.floor(time / 60);
out.M = time % 60; time = Math.floor(time / 60);
out.H = time;
out.q = dow;
return out;
}
SSF.parse_date_code = parse_date_code;
/*jshint -W086 */
function write_date(type, fmt, val, ss0) {
var o = "", ss = 0, tt = 0, y = val.y, out, outl = 0;
switch (type) {
case 98: /* 'b' buddhist year */
y = val.y + 543;
/* falls through */
case 121: /* 'y' year */
switch (fmt.length) {
case 1: case 2: out = y % 100; outl = 2; break;
default: out = y % 10000; outl = 4; break;
} break;
case 109: /* 'm' month */
switch (fmt.length) {
case 1: case 2: out = val.m; outl = fmt.length; break;
case 3: return months[val.m - 1][1];
case 5: return months[val.m - 1][0];
default: return months[val.m - 1][2];
} break;
case 100: /* 'd' day */
switch (fmt.length) {
case 1: case 2: out = val.d; outl = fmt.length; break;
case 3: return days[val.q][0];
default: return days[val.q][1];
} break;
case 104: /* 'h' 12-hour */
switch (fmt.length) {
case 1: case 2: out = 1 + (val.H + 11) % 12; outl = fmt.length; break;
default: throw 'bad hour format: ' + fmt;
} break;
case 72: /* 'H' 24-hour */
switch (fmt.length) {
case 1: case 2: out = val.H; outl = fmt.length; break;
default: throw 'bad hour format: ' + fmt;
} break;
case 77: /* 'M' minutes */
switch (fmt.length) {
case 1: case 2: out = val.M; outl = fmt.length; break;
default: throw 'bad minute format: ' + fmt;
} break;
case 115: /* 's' seconds */
if (val.u === 0) switch (fmt) {
case 's': case 'ss': return pad0(val.S, fmt.length);
case '.0': case '.00': case '.000':
}
switch (fmt) {
case 's': case 'ss': case '.0': case '.00': case '.000':
if (ss0 >= 2) tt = ss0 === 3 ? 1000 : 100;
else tt = ss0 === 1 ? 10 : 1;
ss = Math.round((tt) * (val.S + val.u));
if (ss >= 60 * tt) ss = 0;
if (fmt === 's') return ss === 0 ? "0" : "" + ss / tt;
o = pad0(ss, 2 + ss0);
if (fmt === 'ss') return o.substr(0, 2);
return "." + o.substr(2, fmt.length - 1);
default: throw 'bad second format: ' + fmt;
}
case 90: /* 'Z' absolute time */
switch (fmt) {
case '[h]': case '[hh]': out = val.D * 24 + val.H; break;
case '[m]': case '[mm]': out = (val.D * 24 + val.H) * 60 + val.M; break;
case '[s]': case '[ss]': out = ((val.D * 24 + val.H) * 60 + val.M) * 60 + Math.round(val.S + val.u); break;
default: throw 'bad abstime format: ' + fmt;
} outl = fmt.length === 3 ? 1 : 2; break;
case 101: /* 'e' era */
out = y; outl = 1;
}
if (outl > 0) return pad0(out, outl); else return "";
}
/*jshint +W086 */
function commaify(s) {
if (s.length <= 3) return s;
var j = (s.length % 3), o = s.substr(0, j);
for (; j != s.length; j += 3) o += (o.length > 0 ? "," : "") + s.substr(j, 3);
return o;
}
var write_num = (function make_write_num() {
var pct1 = /%/g;
function write_num_pct(type, fmt, val) {
var sfmt = fmt.replace(pct1, ""), mul = fmt.length - sfmt.length;
return write_num(type, sfmt, val * Math.pow(10, 2 * mul)) + fill("%", mul);
}
function write_num_cm(type, fmt, val) {
var idx = fmt.length - 1;
while (fmt.charCodeAt(idx - 1) === 44)--idx;
return write_num(type, fmt.substr(0, idx), val / Math.pow(10, 3 * (fmt.length - idx)));
}
function write_num_exp(fmt, val) {
var o;
var idx = fmt.indexOf("E") - fmt.indexOf(".") - 1;
if (fmt.match(/^#+0.0E\+0$/)) {
var period = fmt.indexOf("."); if (period === -1) period = fmt.indexOf('E');
var ee = Math.floor(Math.log(Math.abs(val)) * Math.LOG10E) % period;
if (ee < 0) ee += period;
o = (val / Math.pow(10, ee)).toPrecision(idx + 1 + (period + ee) % period);
if (o.indexOf("e") === -1) {
var fakee = Math.floor(Math.log(Math.abs(val)) * Math.LOG10E);
if (o.indexOf(".") === -1) o = o[0] + "." + o.substr(1) + "E+" + (fakee - o.length + ee);
else o += "E+" + (fakee - ee);
while (o.substr(0, 2) === "0.") {
o = o[0] + o.substr(2, period) + "." + o.substr(2 + period);
o = o.replace(/^0+([1-9])/, "$1").replace(/^0+\./, "0.");
}
o = o.replace(/\+-/, "-");
}
o = o.replace(/^([+-]?)(\d*)\.(\d*)[Ee]/, function ($$, $1, $2, $3) { return $1 + $2 + $3.substr(0, (period + ee) % period) + "." + $3.substr(ee) + "E"; });
} else o = val.toExponential(idx);
if (fmt.match(/E\+00$/) && o.match(/e[+-]\d$/)) o = o.substr(0, o.length - 1) + "0" + o[o.length - 1];
if (fmt.match(/E\-/) && o.match(/e\+/)) o = o.replace(/e\+/, "e");
return o.replace("e", "E");
}
var frac1 = /# (\?+)( ?)\/( ?)(\d+)/;
function write_num_f1(r, aval, sign) {
var den = parseInt(r[4]), rr = Math.round(aval * den), base = Math.floor(rr / den);
var myn = (rr - base * den), myd = den;
return sign + (base === 0 ? "" : "" + base) + " " + (myn === 0 ? fill(" ", r[1].length + 1 + r[4].length) : pad_(myn, r[1].length) + r[2] + "/" + r[3] + pad0(myd, r[4].length));
}
function write_num_f2(r, aval, sign) {
return sign + (aval === 0 ? "" : "" + aval) + fill(" ", r[1].length + 2 + r[4].length);
}
var dec1 = /^#*0*\.(0+)/;
var closeparen = /\).*[0#]/;
var phone = /\(###\) ###\\?-####/;
function hashq(str) {
var o = "", cc;
for (var i = 0; i != str.length; ++i) switch ((cc = str.charCodeAt(i))) {
case 35: break;
case 63: o += " "; break;
case 48: o += "0"; break;
default: o += String.fromCharCode(cc);
}
return o;
}
function rnd(val, d) { var dd = Math.pow(10, d); return "" + (Math.round(val * dd) / dd); }
function dec(val, d) { return Math.round((val - Math.floor(val)) * Math.pow(10, d)); }
function flr(val) { if (val < 2147483647 && val > -2147483648) return "" + (val >= 0 ? (val | 0) : (val - 1 | 0)); return "" + Math.floor(val); }
function write_num_flt(type, fmt, val) {
if (type.charCodeAt(0) === 40 && !fmt.match(closeparen)) {
var ffmt = fmt.replace(/\( */, "").replace(/ \)/, "").replace(/\)/, "");
if (val >= 0) return write_num_flt('n', ffmt, val);
return '(' + write_num_flt('n', ffmt, -val) + ')';
}
if (fmt.charCodeAt(fmt.length - 1) === 44) return write_num_cm(type, fmt, val);
if (fmt.indexOf('%') !== -1) return write_num_pct(type, fmt, val);
if (fmt.indexOf('E') !== -1) return write_num_exp(fmt, val);
if (fmt.charCodeAt(0) === 36) return "$" + write_num_flt(type, fmt.substr(fmt[1] == ' ' ? 2 : 1), val);
var o, oo;
var r, ri, ff, aval = Math.abs(val), sign = val < 0 ? "-" : "";
if (fmt.match(/^00+$/)) return sign + pad0r(aval, fmt.length);
if (fmt.match(/^[#?]+$/)) {
o = pad0r(val, 0); if (o === "0") o = "";
return o.length > fmt.length ? o : hashq(fmt.substr(0, fmt.length - o.length)) + o;
}
if ((r = fmt.match(frac1)) !== null) return write_num_f1(r, aval, sign);
if (fmt.match(/^#+0+$/) !== null) return sign + pad0r(aval, fmt.length - fmt.indexOf("0"));
if ((r = fmt.match(dec1)) !== null) {
o = rnd(val, r[1].length).replace(/^([^\.]+)$/, "$1." + r[1]).replace(/\.$/, "." + r[1]).replace(/\.(\d*)$/, function ($$, $1) { return "." + $1 + fill("0", r[1].length - $1.length); });
return fmt.indexOf("0.") !== -1 ? o : o.replace(/^0\./, ".");
}
fmt = fmt.replace(/^#+([0.])/, "$1");
if ((r = fmt.match(/^(0*)\.(#*)$/)) !== null) {
return sign + rnd(aval, r[2].length).replace(/\.(\d*[1-9])0*$/, ".$1").replace(/^(-?\d*)$/, "$1.").replace(/^0\./, r[1].length ? "0." : ".");
}
if ((r = fmt.match(/^#,##0(\.?)$/)) !== null) return sign + commaify(pad0r(aval, 0));
if ((r = fmt.match(/^#,##0\.([#0]*0)$/)) !== null) {
return val < 0 ? "-" + write_num_flt(type, fmt, -val) : commaify("" + (Math.floor(val))) + "." + pad0(dec(val, r[1].length), r[1].length);
}
if ((r = fmt.match(/^#,#*,#0/)) !== null) return write_num_flt(type, fmt.replace(/^#,#*,/, ""), val);
if ((r = fmt.match(/^([0#]+)(\\?-([0#]+))+$/)) !== null) {
o = _strrev(write_num_flt(type, fmt.replace(/[\\-]/g, ""), val));
ri = 0;
return _strrev(_strrev(fmt.replace(/\\/g, "")).replace(/[0#]/g, function (x) { return ri < o.length ? o[ri++] : x === '0' ? '0' : ""; }));
}
if (fmt.match(phone) !== null) {
o = write_num_flt(type, "##########", val);
return "(" + o.substr(0, 3) + ") " + o.substr(3, 3) + "-" + o.substr(6);
}
var oa = "";
if ((r = fmt.match(/^([#0?]+)( ?)\/( ?)([#0?]+)/)) !== null) {
ri = Math.min(r[4].length, 7);
ff = frac(aval, Math.pow(10, ri) - 1, false);
o = "" + sign;
oa = write_num("n", r[1], ff[1]);
if (oa[oa.length - 1] == " ") oa = oa.substr(0, oa.length - 1) + "0";
o += oa + r[2] + "/" + r[3];
oa = rpad_(ff[2], ri);
if (oa.length < r[4].length) oa = hashq(r[4].substr(r[4].length - oa.length)) + oa;
o += oa;
return o;
}
if ((r = fmt.match(/^# ([#0?]+)( ?)\/( ?)([#0?]+)/)) !== null) {
ri = Math.min(Math.max(r[1].length, r[4].length), 7);
ff = frac(aval, Math.pow(10, ri) - 1, true);
return sign + (ff[0] || (ff[1] ? "" : "0")) + " " + (ff[1] ? pad_(ff[1], ri) + r[2] + "/" + r[3] + rpad_(ff[2], ri) : fill(" ", 2 * ri + 1 + r[2].length + r[3].length));
}
if ((r = fmt.match(/^[#0?]+$/)) !== null) {
o = pad0r(val, 0);
if (fmt.length <= o.length) return o;
return hashq(fmt.substr(0, fmt.length - o.length)) + o;
}
if ((r = fmt.match(/^([#0?]+)\.([#0]+)$/)) !== null) {
o = "" + val.toFixed(Math.min(r[2].length, 10)).replace(/([^0])0+$/, "$1");
ri = o.indexOf(".");
var lres = fmt.indexOf(".") - ri, rres = fmt.length - o.length - lres;
return hashq(fmt.substr(0, lres) + o + fmt.substr(fmt.length - rres));
}
if ((r = fmt.match(/^00,000\.([#0]*0)$/)) !== null) {
ri = dec(val, r[1].length);
return val < 0 ? "-" + write_num_flt(type, fmt, -val) : commaify(flr(val)).replace(/^\d,\d{3}$/, "0$&").replace(/^\d*$/, function ($$) { return "00," + ($$.length < 3 ? pad0(0, 3 - $$.length) : "") + $$; }) + "." + pad0(ri, r[1].length);
}
switch (fmt) {
case "#,###": var x = commaify(pad0r(aval, 0)); return x !== "0" ? sign + x : "";
default:
}
throw new Error("unsupported format |" + fmt + "|");
}
function write_num_cm2(type, fmt, val) {
var idx = fmt.length - 1;
while (fmt.charCodeAt(idx - 1) === 44)--idx;
return write_num(type, fmt.substr(0, idx), val / Math.pow(10, 3 * (fmt.length - idx)));
}
function write_num_pct2(type, fmt, val) {
var sfmt = fmt.replace(pct1, ""), mul = fmt.length - sfmt.length;
return write_num(type, sfmt, val * Math.pow(10, 2 * mul)) + fill("%", mul);
}
function write_num_exp2(fmt, val) {
var o;
var idx = fmt.indexOf("E") - fmt.indexOf(".") - 1;
if (fmt.match(/^#+0.0E\+0$/)) {
var period = fmt.indexOf("."); if (period === -1) period = fmt.indexOf('E');
var ee = Math.floor(Math.log(Math.abs(val)) * Math.LOG10E) % period;
if (ee < 0) ee += period;
o = (val / Math.pow(10, ee)).toPrecision(idx + 1 + (period + ee) % period);
if (!o.match(/[Ee]/)) {
var fakee = Math.floor(Math.log(Math.abs(val)) * Math.LOG10E);
if (o.indexOf(".") === -1) o = o[0] + "." + o.substr(1) + "E+" + (fakee - o.length + ee);
else o += "E+" + (fakee - ee);
o = o.replace(/\+-/, "-");
}
o = o.replace(/^([+-]?)(\d*)\.(\d*)[Ee]/, function ($$, $1, $2, $3) { return $1 + $2 + $3.substr(0, (period + ee) % period) + "." + $3.substr(ee) + "E"; });
} else o = val.toExponential(idx);
if (fmt.match(/E\+00$/) && o.match(/e[+-]\d$/)) o = o.substr(0, o.length - 1) + "0" + o[o.length - 1];
if (fmt.match(/E\-/) && o.match(/e\+/)) o = o.replace(/e\+/, "e");
return o.replace("e", "E");
}
function write_num_int(type, fmt, val) {
if (type.charCodeAt(0) === 40 && !fmt.match(closeparen)) {
var ffmt = fmt.replace(/\( */, "").replace(/ \)/, "").replace(/\)/, "");
if (val >= 0) return write_num_int('n', ffmt, val);
return '(' + write_num_int('n', ffmt, -val) + ')';
}
if (fmt.charCodeAt(fmt.length - 1) === 44) return write_num_cm2(type, fmt, val);
if (fmt.indexOf('%') !== -1) return write_num_pct2(type, fmt, val);
if (fmt.indexOf('E') !== -1) return write_num_exp2(fmt, val);
if (fmt.charCodeAt(0) === 36) return "$" + write_num_int(type, fmt.substr(fmt[1] == ' ' ? 2 : 1), val);
var o;
var r, ri, ff, aval = Math.abs(val), sign = val < 0 ? "-" : "";
if (fmt.match(/^00+$/)) return sign + pad0(aval, fmt.length);
if (fmt.match(/^[#?]+$/)) {
o = ("" + val); if (val === 0) o = "";
return o.length > fmt.length ? o : hashq(fmt.substr(0, fmt.length - o.length)) + o;
}
if ((r = fmt.match(frac1)) !== null) return write_num_f2(r, aval, sign);
if (fmt.match(/^#+0+$/) !== null) return sign + pad0(aval, fmt.length - fmt.indexOf("0"));
if ((r = fmt.match(dec1)) !== null) {
o = ("" + val).replace(/^([^\.]+)$/, "$1." + r[1]).replace(/\.$/, "." + r[1]).replace(/\.(\d*)$/, function ($$, $1) { return "." + $1 + fill("0", r[1].length - $1.length); });
return fmt.indexOf("0.") !== -1 ? o : o.replace(/^0\./, ".");
}
fmt = fmt.replace(/^#+([0.])/, "$1");
if ((r = fmt.match(/^(0*)\.(#*)$/)) !== null) {
return sign + ("" + aval).replace(/\.(\d*[1-9])0*$/, ".$1").replace(/^(-?\d*)$/, "$1.").replace(/^0\./, r[1].length ? "0." : ".");
}
if ((r = fmt.match(/^#,##0(\.?)$/)) !== null) return sign + commaify(("" + aval));
if ((r = fmt.match(/^#,##0\.([#0]*0)$/)) !== null) {
return val < 0 ? "-" + write_num_int(type, fmt, -val) : commaify(("" + val)) + "." + fill('0', r[1].length);
}
if ((r = fmt.match(/^#,#*,#0/)) !== null) return write_num_int(type, fmt.replace(/^#,#*,/, ""), val);
if ((r = fmt.match(/^([0#]+)(\\?-([0#]+))+$/)) !== null) {
o = _strrev(write_num_int(type, fmt.replace(/[\\-]/g, ""), val));
ri = 0;
return _strrev(_strrev(fmt.replace(/\\/g, "")).replace(/[0#]/g, function (x) { return ri < o.length ? o[ri++] : x === '0' ? '0' : ""; }));
}
if (fmt.match(phone) !== null) {
o = write_num_int(type, "##########", val);
return "(" + o.substr(0, 3) + ") " + o.substr(3, 3) + "-" + o.substr(6);
}
var oa = "";
if ((r = fmt.match(/^([#0?]+)( ?)\/( ?)([#0?]+)/)) !== null) {
ri = Math.min(r[4].length, 7);
ff = frac(aval, Math.pow(10, ri) - 1, false);
o = "" + sign;
oa = write_num("n", r[1], ff[1]);
if (oa[oa.length - 1] == " ") oa = oa.substr(0, oa.length - 1) + "0";
o += oa + r[2] + "/" + r[3];
oa = rpad_(ff[2], ri);
if (oa.length < r[4].length) oa = hashq(r[4].substr(r[4].length - oa.length)) + oa;
o += oa;
return o;
}
if ((r = fmt.match(/^# ([#0?]+)( ?)\/( ?)([#0?]+)/)) !== null) {
ri = Math.min(Math.max(r[1].length, r[4].length), 7);
ff = frac(aval, Math.pow(10, ri) - 1, true);
return sign + (ff[0] || (ff[1] ? "" : "0")) + " " + (ff[1] ? pad_(ff[1], ri) + r[2] + "/" + r[3] + rpad_(ff[2], ri) : fill(" ", 2 * ri + 1 + r[2].length + r[3].length));
}
if ((r = fmt.match(/^[#0?]+$/)) !== null) {
o = "" + val;
if (fmt.length <= o.length) return o;
return hashq(fmt.substr(0, fmt.length - o.length)) + o;
}
if ((r = fmt.match(/^([#0]+)\.([#0]+)$/)) !== null) {
o = "" + val.toFixed(Math.min(r[2].length, 10)).replace(/([^0])0+$/, "$1");
ri = o.indexOf(".");
var lres = fmt.indexOf(".") - ri, rres = fmt.length - o.length - lres;
return hashq(fmt.substr(0, lres) + o + fmt.substr(fmt.length - rres));
}
if ((r = fmt.match(/^00,000\.([#0]*0)$/)) !== null) {
return val < 0 ? "-" + write_num_int(type, fmt, -val) : commaify("" + val).replace(/^\d,\d{3}$/, "0$&").replace(/^\d*$/, function ($$) { return "00," + ($$.length < 3 ? pad0(0, 3 - $$.length) : "") + $$; }) + "." + pad0(0, r[1].length);
}
switch (fmt) {
case "#,###": var x = commaify("" + aval); return x !== "0" ? sign + x : "";
default:
}
throw new Error("unsupported format |" + fmt + "|");
}
return function write_num(type, fmt, val) {
return (val | 0) === val ? write_num_int(type, fmt, val) : write_num_flt(type, fmt, val);
};
})();
function split_fmt(fmt) {
var out = [];
var in_str = false, cc;
for (var i = 0, j = 0; i < fmt.length; ++i) switch ((cc = fmt.charCodeAt(i))) {
case 34: /* '"' */
in_str = !in_str; break;
case 95: case 42: case 92: /* '_' '*' '\\' */
++i; break;
case 59: /* ';' */
out[out.length] = fmt.substr(j, i - j);
j = i + 1;
}
out[out.length] = fmt.substr(j);
if (in_str === true) throw new Error("Format |" + fmt + "| unterminated string ");
return out;
}
SSF._split = split_fmt;
var abstime = /\[[HhMmSs]*\]/;
function eval_fmt(fmt, v, opts, flen) {
var out = [], o = "", i = 0, c = "", lst = 't', q, dt, j, cc;
var hr = 'H';
/* Tokenize */
while (i < fmt.length) {
switch ((c = fmt[i])) {
case 'G': /* General */
if (!isgeneral(fmt, i)) throw new Error('unrecognized character ' + c + ' in ' + fmt);
out[out.length] = { t: 'G', v: 'General' }; i += 7; break;
case '"': /* Literal text */
for (o = ""; (cc = fmt.charCodeAt(++i)) !== 34 && i < fmt.length;) o += String.fromCharCode(cc);
out[out.length] = { t: 't', v: o }; ++i; break;
case '\\': var w = fmt[++i], t = (w === "(" || w === ")") ? w : 't';
out[out.length] = { t: t, v: w }; ++i; break;
case '_': out[out.length] = { t: 't', v: " " }; i += 2; break;
case '@': /* Text Placeholder */
out[out.length] = { t: 'T', v: v }; ++i; break;
case 'B': case 'b':
if (fmt[i + 1] === "1" || fmt[i + 1] === "2") {
if (dt == null) { dt = parse_date_code(v, opts, fmt[i + 1] === "2"); if (dt == null) return ""; }
out[out.length] = { t: 'X', v: fmt.substr(i, 2) }; lst = c; i += 2; break;
}
/* falls through */
case 'M': case 'D': case 'Y': case 'H': case 'S': case 'E':
c = c.toLowerCase();
/* falls through */
case 'm': case 'd': case 'y': case 'h': case 's': case 'e': case 'g':
if (v < 0) return "";
if (dt == null) { dt = parse_date_code(v, opts); if (dt == null) return ""; }
o = c; while (++i < fmt.length && fmt[i].toLowerCase() === c) o += c;
if (c === 'm' && lst.toLowerCase() === 'h') c = 'M'; /* m = minute */
if (c === 'h') c = hr;
out[out.length] = { t: c, v: o }; lst = c; break;
case 'A':
q = { t: c, v: "A" };
if (dt == null) dt = parse_date_code(v, opts);
if (fmt.substr(i, 3) === "A/P") { if (dt != null) q.v = dt.H >= 12 ? "P" : "A"; q.t = 'T'; hr = 'h'; i += 3; }
else if (fmt.substr(i, 5) === "AM/PM") { if (dt != null) q.v = dt.H >= 12 ? "PM" : "AM"; q.t = 'T'; i += 5; hr = 'h'; }
else { q.t = "t"; ++i; }
if (dt == null && q.t === 'T') return "";
out[out.length] = q; lst = c; break;
case '[':
o = c;
while (fmt[i++] !== ']' && i < fmt.length) o += fmt[i];
if (o.substr(-1) !== ']') throw 'unterminated "[" block: |' + o + '|';
if (o.match(abstime)) {
if (dt == null) { dt = parse_date_code(v, opts); if (dt == null) return ""; }
out[out.length] = { t: 'Z', v: o.toLowerCase() };
} else { o = ""; }
break;
/* Numbers */
case '.':
if (dt != null) {
o = c; while ((c = fmt[++i]) === "0") o += c;
out[out.length] = { t: 's', v: o }; break;
}
/* falls through */
case '0': case '#':
o = c; while ("0#?.,E+-%".indexOf(c = fmt[++i]) > -1 || c == '\\' && fmt[i + 1] == "-" && "0#".indexOf(fmt[i + 2]) > -1) o += c;
out[out.length] = { t: 'n', v: o }; break;
case '?':
o = c; while (fmt[++i] === c) o += c;
q = { t: c, v: o }; out[out.length] = q; lst = c; break;
case '*': ++i; if (fmt[i] == ' ' || fmt[i] == '*')++i; break; // **
case '(': case ')': out[out.length] = { t: (flen === 1 ? 't' : c), v: c }; ++i; break;
case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9':
o = c; while ("0123456789".indexOf(fmt[++i]) > -1) o += fmt[i];
out[out.length] = { t: 'D', v: o }; break;
case ' ': out[out.length] = { t: c, v: c }; ++i; break;
default:
if (",$-+/():!^&'~{}<>=€acfijklopqrtuvwxz".indexOf(c) === -1) throw new Error('unrecognized character ' + c + ' in ' + fmt);
out[out.length] = { t: 't', v: c }; ++i; break;
}
}
var bt = 0, ss0 = 0, ssm;
for (i = out.length - 1, lst = 't'; i >= 0; --i) {
switch (out[i].t) {
case 'h': case 'H': out[i].t = hr; lst = 'h'; if (bt < 1) bt = 1; break;
case 's':
if ((ssm = out[i].v.match(/\.0+$/))) ss0 = Math.max(ss0, ssm[0].length - 1);
if (bt < 3) bt = 3;
/* falls through */
case 'd': case 'y': case 'M': case 'e': lst = out[i].t; break;
case 'm': if (lst === 's') { out[i].t = 'M'; if (bt < 2) bt = 2; } break;
case 'X': if (out[i].v === "B2");
break;
case 'Z':
if (bt < 1 && out[i].v.match(/[Hh]/)) bt = 1;
if (bt < 2 && out[i].v.match(/[Mm]/)) bt = 2;
if (bt < 3 && out[i].v.match(/[Ss]/)) bt = 3;
}
}
switch (bt) {
case 0: break;
case 1:
if (dt.u >= 0.5) { dt.u = 0; ++dt.S; }
if (dt.S >= 60) { dt.S = 0; ++dt.M; }
if (dt.M >= 60) { dt.M = 0; ++dt.H; }
break;
case 2:
if (dt.u >= 0.5) { dt.u = 0; ++dt.S; }
if (dt.S >= 60) { dt.S = 0; ++dt.M; }
break;
}
/* replace fields */
var nstr = "", jj;
for (i = 0; i < out.length; ++i) {
switch (out[i].t) {
case 't': case 'T': case ' ': case 'D': break;
case 'X': out[i] = undefined; break;
case 'd': case 'm': case 'y': case 'h': case 'H': case 'M': case 's': case 'e': case 'b': case 'Z':
out[i].v = write_date(out[i].t.charCodeAt(0), out[i].v, dt, ss0);
out[i].t = 't'; break;
case 'n': case '(': case '?':
jj = i + 1;
while (out[jj] != null && (
(c = out[jj].t) === "?" || c === "D" ||
(c === " " || c === "t") && out[jj + 1] != null && (out[jj + 1].t === '?' || out[jj + 1].t === "t" && out[jj + 1].v === '/') ||
out[i].t === '(' && (c === ' ' || c === 'n' || c === ')') ||
c === 't' && (out[jj].v === '/' || '$€'.indexOf(out[jj].v) > -1 || out[jj].v === ' ' && out[jj + 1] != null && out[jj + 1].t == '?')
)) {
out[i].v += out[jj].v;
out[jj] = undefined; ++jj;
}
nstr += out[i].v;
i = jj - 1; break;
case 'G': out[i].t = 't'; out[i].v = general_fmt(v, opts); break;
}
}
var vv = "", myv, ostr;
if (nstr.length > 0) {
myv = (v < 0 && nstr.charCodeAt(0) === 45 ? -v : v); /* '-' */
ostr = write_num(nstr.charCodeAt(0) === 40 ? '(' : 'n', nstr, myv); /* '(' */
jj = ostr.length - 1;
var decpt = out.length;
for (i = 0; i < out.length; ++i) if (out[i] != null && out[i].v.indexOf(".") > -1) { decpt = i; break; }
var lasti = out.length;
if (decpt === out.length && ostr.indexOf("E") === -1) {
for (i = out.length - 1; i >= 0; --i) {
if (out[i] == null || 'n?('.indexOf(out[i].t) === -1) continue;
if (jj >= out[i].v.length - 1) { jj -= out[i].v.length; out[i].v = ostr.substr(jj + 1, out[i].v.length); }
else if (jj < 0) out[i].v = "";
else { out[i].v = ostr.substr(0, jj + 1); jj = -1; }
out[i].t = 't';
lasti = i;
}
if (jj >= 0 && lasti < out.length) out[lasti].v = ostr.substr(0, jj + 1) + out[lasti].v;
}
else if (decpt !== out.length && ostr.indexOf("E") === -1) {
jj = ostr.indexOf(".") - 1;
for (i = decpt; i >= 0; --i) {
if (out[i] == null || 'n?('.indexOf(out[i].t) === -1) continue;
j = out[i].v.indexOf(".") > -1 && i === decpt ? out[i].v.indexOf(".") - 1 : out[i].v.length - 1;
vv = out[i].v.substr(j + 1);
for (; j >= 0; --j) {
if (jj >= 0 && (out[i].v[j] === "0" || out[i].v[j] === "#")) vv = ostr[jj--] + vv;
}
out[i].v = vv;
out[i].t = 't';
lasti = i;
}
if (jj >= 0 && lasti < out.length) out[lasti].v = ostr.substr(0, jj + 1) + out[lasti].v;
jj = ostr.indexOf(".") + 1;
for (i = decpt; i < out.length; ++i) {
if (out[i] == null || 'n?('.indexOf(out[i].t) === -1 && i !== decpt) continue;
j = out[i].v.indexOf(".") > -1 && i === decpt ? out[i].v.indexOf(".") + 1 : 0;
vv = out[i].v.substr(0, j);
for (; j < out[i].v.length; ++j) {
if (jj < ostr.length) vv += ostr[jj++];
}
out[i].v = vv;
out[i].t = 't';
lasti = i;
}
}
}
for (i = 0; i < out.length; ++i) if (out[i] != null && 'n(?'.indexOf(out[i].t) > -1) {
myv = (flen > 1 && v < 0 && i > 0 && out[i - 1].v === "-" ? -v : v);
out[i].v = write_num(out[i].t, out[i].v, myv);
out[i].t = 't';
}
var retval = "";
for (i = 0; i !== out.length; ++i) if (out[i] != null) retval += out[i].v;
return retval;
}
SSF._eval = eval_fmt;
var cfregex = /\[[=<>]/;
var cfregex2 = /\[([=<>]*)(-?\d+\.?\d*)\]/;
function chkcond(v, rr) {
if (rr == null) return false;
var thresh = parseFloat(rr[2]);
switch (rr[1]) {
case "=": if (v == thresh) return true; break;
case ">": if (v > thresh) return true; break;
case "<": if (v < thresh) return true; break;
case "<>": if (v != thresh) return true; break;
case ">=": if (v >= thresh) return true; break;
case "<=": if (v <= thresh) return true; break;
}
return false;
}
function choose_fmt(f, v) {
var fmt = split_fmt(f);
var l = fmt.length, lat = fmt[l - 1].indexOf("@");
if (l < 4 && lat > -1)--l;
if (fmt.length > 4) throw "cannot find right format for |" + fmt + "|";
if (typeof v !== "number") return [4, fmt.length === 4 || lat > -1 ? fmt[fmt.length - 1] : "@"];
switch (fmt.length) {
case 1: fmt = lat > -1 ? ["General", "General", "General", fmt[0]] : [fmt[0], fmt[0], fmt[0], "@"]; break;
case 2: fmt = lat > -1 ? [fmt[0], fmt[0], fmt[0], fmt[1]] : [fmt[0], fmt[1], fmt[0], "@"]; break;
case 3: fmt = lat > -1 ? [fmt[0], fmt[1], fmt[0], fmt[2]] : [fmt[0], fmt[1], fmt[2], "@"]; break;
case 4: break;
}
var ff = v > 0 ? fmt[0] : v < 0 ? fmt[1] : fmt[2];
if (fmt[0].indexOf("[") === -1 && fmt[1].indexOf("[") === -1) return [l, ff];
if (fmt[0].match(cfregex) != null || fmt[1].match(cfregex) != null) {
var m1 = fmt[0].match(cfregex2);
var m2 = fmt[1].match(cfregex2);
return chkcond(v, m1) ? [l, fmt[0]] : chkcond(v, m2) ? [l, fmt[1]] : [l, fmt[m1 != null && m2 != null ? 2 : 1]];
}
return [l, ff];
}
function format(fmt, v, o) {
fixopts(o != null ? o : (o = []));
var sfmt = "";
switch (typeof fmt) {
case "string": sfmt = fmt; break;
case "number": sfmt = (o.table != null ? o.table : table_fmt)[fmt]; break;
}
if (isgeneral(sfmt, 0)) return general_fmt(v, o);
var f = choose_fmt(sfmt, v);
if (isgeneral(f[1])) return general_fmt(v, o);
if (v === true) v = "TRUE"; else if (v === false) v = "FALSE";
else if (v === "" || v == null) return "";
return eval_fmt(f[1], v, o, f[0]);
}
SSF._table = table_fmt;
SSF.load = function load_entry(fmt, idx) { table_fmt[idx] = fmt; };
SSF.format = format;
SSF.get_table = function get_table() { return table_fmt; };
SSF.load_table = function load_table(tbl) { for (var i = 0; i != 0x0188; ++i) if (tbl[i] !== undefined) SSF.load(tbl[i], i); };
};
make_ssf(SSF);
/* map from xlml named formats to SSF TODO: localize */
var XLMLFormatMap = {
"General Number": "General",
"General Date": SSF._table[22],
"Long Date": "dddd, mmmm dd, yyyy",
"Medium Date": SSF._table[15],
"Short Date": SSF._table[14],
"Long Time": SSF._table[19],
"Medium Time": SSF._table[18],
"Short Time": SSF._table[20],
"Currency": '"$"#,##0.00_);[Red]\\("$"#,##0.00\\)',
"Fixed": SSF._table[2],
"Standard": SSF._table[4],
"Percent": SSF._table[10],
"Scientific": SSF._table[11],
"Yes/No": '"Yes";"Yes";"No";@',
"True/False": '"True";"True";"False";@',
"On/Off": '"Yes";"Yes";"No";@'
}; var DO_NOT_EXPORT_CFB = true;
/* cfb.js (C) 2013-2014 SheetJS -- http://sheetjs.com */
/* vim: set ts=2: */
/*jshint eqnull:true */ /* [MS-CFB] v20130118 */
var CFB = (function _CFB() {
var exports = {};
exports.version = '0.10.2';
function parse(file) {
var mver = 3; // major version
var ssz = 512; // sector size
var nmfs = 0; // number of mini FAT sectors
var ndfs = 0; // number of DIFAT sectors
var dir_start = 0; // first directory sector location
var minifat_start = 0; // first mini FAT sector location
var difat_start = 0; // first mini FAT sector location var fat_addrs = []; // locations of FAT sectors /* [MS-CFB] 2.2 Compound File Header */
var blob = file.slice(0, 512);
prep_blob(blob, 0); /* major version */
var mv = check_get_mver(blob);
mver = mv[0];
switch (mver) {
case 3: ssz = 512; break; case 4: ssz = 4096; break;
default: throw "Major Version: Expected 3 or 4 saw " + mver;
} /* reprocess header */
if (ssz !== 512) { blob = file.slice(0, ssz); prep_blob(blob, 28 /* blob.l */); }
/* Save header for final object */
var header = file.slice(0, ssz); check_shifts(blob, mver); // Number of Directory Sectors
var nds = blob.read_shift(4, 'i');
if (mver === 3 && nds !== 0) throw '# Directory Sectors: Expected 0 saw ' + nds; // Number of FAT Sectors
//var nfs = blob.read_shift(4, 'i');
blob.l += 4; // First Directory Sector Location
dir_start = blob.read_shift(4, 'i'); // Transaction Signature
blob.l += 4; // Mini Stream Cutoff Size
blob.chk('00100000', 'Mini Stream Cutoff Size: '); // First Mini FAT Sector Location
minifat_start = blob.read_shift(4, 'i'); // Number of Mini FAT Sectors
nmfs = blob.read_shift(4, 'i'); // First DIFAT sector location
difat_start = blob.read_shift(4, 'i'); // Number of DIFAT Sectors
ndfs = blob.read_shift(4, 'i'); // Grab FAT Sector Locations
for (var q, j = 0; j < 109; ++j) { /* 109 = (512 - blob.l)>>>2; */
q = blob.read_shift(4, 'i');
if (q < 0) break;
fat_addrs[j] = q;
} /** Break the file up into sectors */
var sectors = sectorify(file, ssz); sleuth_fat(difat_start, ndfs, sectors, ssz, fat_addrs); /** Chains */
var sector_list = make_sector_list(sectors, dir_start, fat_addrs, ssz); sector_list[dir_start].name = "!Directory";
if (nmfs > 0 && minifat_start !== ENDOFCHAIN) sector_list[minifat_start].name = "!MiniFAT";
sector_list[fat_addrs[0]].name = "!FAT";
sector_list.fat_addrs = fat_addrs;
sector_list.ssz = ssz; /* [MS-CFB] 2.6.1 Compound File Directory Entry */
var files = {}, Paths = [], FileIndex = [], FullPaths = [], FullPathDir = {};
read_directory(dir_start, sector_list, sectors, Paths, nmfs, files, FileIndex); build_full_paths(FileIndex, FullPathDir, FullPaths, Paths); var root_name = Paths.shift();
Paths.root = root_name; /* [MS-CFB] 2.6.4 (Unicode 3.0.1 case conversion) */
var find_path = make_find_path(FullPaths, Paths, FileIndex, files, root_name); return {
raw: { header: header, sectors: sectors },
FileIndex: FileIndex,
FullPaths: FullPaths,
FullPathDir: FullPathDir,
find: find_path
};
} // parse /* [MS-CFB] 2.2 Compound File Header -- read up to major version */
function check_get_mver(blob) {
// header signature 8
blob.chk(HEADER_SIGNATURE, 'Header Signature: '); // clsid 16
blob.chk(HEADER_CLSID, 'CLSID: '); // minor version 2
var mver = blob.read_shift(2, 'u'); return [blob.read_shift(2, 'u'), mver];
}
function check_shifts(blob, mver) {
var shift = 0x09; // Byte Order
blob.chk('feff', 'Byte Order: '); // Sector Shift
switch ((shift = blob.read_shift(2))) {
case 0x09: if (mver !== 3) throw 'MajorVersion/SectorShift Mismatch'; break;
case 0x0c: if (mver !== 4) throw 'MajorVersion/SectorShift Mismatch'; break;
default: throw 'Sector Shift: Expected 9 or 12 saw ' + shift;
} // Mini Sector Shift
blob.chk('0600', 'Mini Sector Shift: '); // Reserved
blob.chk('000000000000', 'Reserved: ');
} /** Break the file up into sectors */
function sectorify(file, ssz) {
var nsectors = Math.ceil(file.length / ssz) - 1;
var sectors = new Array(nsectors);
for (var i = 1; i < nsectors; ++i) sectors[i - 1] = file.slice(i * ssz, (i + 1) * ssz);
sectors[nsectors - 1] = file.slice(nsectors * ssz);
return sectors;
} /* [MS-CFB] 2.6.4 Red-Black Tree */
function build_full_paths(FI, FPD, FP, Paths) {
var i = 0, L = 0, R = 0, C = 0, j = 0, pl = Paths.length;
var dad = new Array(pl), q = new Array(pl); for (; i < pl; ++i) { dad[i] = q[i] = i; FP[i] = Paths[i]; } for (; j < q.length; ++j) {
i = q[j];
L = FI[i].L; R = FI[i].R; C = FI[i].C;
if (dad[i] === i) {
if (L !== -1 /*NOSTREAM*/ && dad[L] !== L) dad[i] = dad[L];
if (R !== -1 && dad[R] !== R) dad[i] = dad[R];
}
if (C !== -1 /*NOSTREAM*/) dad[C] = i;
if (L !== -1) { dad[L] = dad[i]; q.push(L); }
if (R !== -1) { dad[R] = dad[i]; q.push(R); }
}
for (i = 1; i !== pl; ++i) if (dad[i] === i) {
if (R !== -1 /*NOSTREAM*/ && dad[R] !== R) dad[i] = dad[R];
else if (L !== -1 && dad[L] !== L) dad[i] = dad[L];
} for (i = 1; i < pl; ++i) {
if (FI[i].type === 0 /* unknown */) continue;
j = dad[i];
if (j === 0) FP[i] = FP[0] + "/" + FP[i];
else while (j !== 0) {
FP[i] = FP[j] + "/" + FP[i];
j = dad[j];
}
dad[i] = 0;
} FP[0] += "/";
for (i = 1; i < pl; ++i) {
if (FI[i].type !== 2 /* stream */) FP[i] += "/";
FPD[FP[i]] = FI[i];
}
} /* [MS-CFB] 2.6.4 */
function make_find_path(FullPaths, Paths, FileIndex, files, root_name) {
var UCFullPaths = new Array(FullPaths.length);
var UCPaths = new Array(Paths.length), i;
for (i = 0; i < FullPaths.length; ++i) UCFullPaths[i] = FullPaths[i].toUpperCase().replace(chr0, '').replace(chr1, '!');
for (i = 0; i < Paths.length; ++i) UCPaths[i] = Paths[i].toUpperCase().replace(chr0, '').replace(chr1, '!');
return function find_path(path) {
var k;
if (path.charCodeAt(0) === 47 /* "/" */) { k = true; path = root_name + path; }
else k = path.indexOf("/") !== -1;
var UCPath = path.toUpperCase().replace(chr0, '').replace(chr1, '!');
var w = k === true ? UCFullPaths.indexOf(UCPath) : UCPaths.indexOf(UCPath);
if (w === -1) return null;
return k === true ? FileIndex[w] : files[Paths[w]];
};
} /** Chase down the rest of the DIFAT chain to build a comprehensive list
DIFAT chains by storing the next sector number as the last 32 bytes */
function sleuth_fat(idx, cnt, sectors, ssz, fat_addrs) {
var q;
if (idx === ENDOFCHAIN) {
if (cnt !== 0) throw "DIFAT chain shorter than expected";
} else if (idx !== -1 /*FREESECT*/) {
var sector = sectors[idx], m = (ssz >>> 2) - 1;
for (var i = 0; i < m; ++i) {
if ((q = __readInt32LE(sector, i * 4)) === ENDOFCHAIN) break;
fat_addrs.push(q);
}
sleuth_fat(__readInt32LE(sector, ssz - 4), cnt - 1, sectors, ssz, fat_addrs);
}
} /** Follow the linked list of sectors for a given starting point */
function get_sector_list(sectors, start, fat_addrs, ssz, chkd) {
var sl = sectors.length;
var buf, buf_chain;
if (!chkd) chkd = new Array(sl);
var modulus = ssz - 1, j, jj;
buf = [];
buf_chain = [];
for (j = start; j >= 0;) {
chkd[j] = true;
buf[buf.length] = j;
buf_chain.push(sectors[j]);
var addr = fat_addrs[Math.floor(j * 4 / ssz)];
jj = ((j * 4) & modulus);
if (ssz < 4 + jj) throw "FAT boundary crossed: " + j + " 4 " + ssz;
j = __readInt32LE(sectors[addr], jj);
}
return { nodes: buf, data: __toBuffer([buf_chain]) };
} /** Chase down the sector linked lists */
function make_sector_list(sectors, dir_start, fat_addrs, ssz) {
var sl = sectors.length, sector_list = new Array(sl);
var chkd = new Array(sl), buf, buf_chain;
var modulus = ssz - 1, i, j, k, jj;
for (i = 0; i < sl; ++i) {
buf = [];
k = (i + dir_start); if (k >= sl) k -= sl;
if (chkd[k] === true) continue;
buf_chain = [];
for (j = k; j >= 0;) {
chkd[j] = true;
buf[buf.length] = j;
buf_chain.push(sectors[j]);
var addr = fat_addrs[Math.floor(j * 4 / ssz)];
jj = ((j * 4) & modulus);
if (ssz < 4 + jj) throw "FAT boundary crossed: " + j + " 4 " + ssz;
j = __readInt32LE(sectors[addr], jj);
}
sector_list[k] = { nodes: buf, data: __toBuffer([buf_chain]) };
}
return sector_list;
} /* [MS-CFB] 2.6.1 Compound File Directory Entry */
function read_directory(dir_start, sector_list, sectors, Paths, nmfs, files, FileIndex) {
var blob;
var minifat_store = 0, pl = (Paths.length ? 2 : 0);
var sector = sector_list[dir_start].data;
var i = 0, namelen = 0, name, o, ctime, mtime;
for (; i < sector.length; i += 128) {
blob = sector.slice(i, i + 128);
prep_blob(blob, 64);
namelen = blob.read_shift(2);
if (namelen === 0) continue;
name = __utf16le(blob, 0, namelen - pl);
Paths.push(name);
o = {
name: name,
type: blob.read_shift(1),
color: blob.read_shift(1),
L: blob.read_shift(4, 'i'),
R: blob.read_shift(4, 'i'),
C: blob.read_shift(4, 'i'),
clsid: blob.read_shift(16),
state: blob.read_shift(4, 'i')
};
ctime = blob.read_shift(2) + blob.read_shift(2) + blob.read_shift(2) + blob.read_shift(2);
if (ctime !== 0) {
o.ctime = ctime; o.ct = read_date(blob, blob.l - 8);
}
mtime = blob.read_shift(2) + blob.read_shift(2) + blob.read_shift(2) + blob.read_shift(2);
if (mtime !== 0) {
o.mtime = mtime; o.mt = read_date(blob, blob.l - 8);
}
o.start = blob.read_shift(4, 'i');
o.size = blob.read_shift(4, 'i');
if (o.type === 5) { /* root */
minifat_store = o.start;
if (nmfs > 0 && minifat_store !== ENDOFCHAIN) sector_list[minifat_store].name = "!StreamData";
/*minifat_size = o.size;*/
} else if (o.size >= 4096 /* MSCSZ */) {
o.storage = 'fat';
if (sector_list[o.start] === undefined) sector_list[o.start] = get_sector_list(sectors, o.start, sector_list.fat_addrs, sector_list.ssz);
sector_list[o.start].name = o.name;
o.content = sector_list[o.start].data.slice(0, o.size);
prep_blob(o.content, 0);
} else {
o.storage = 'minifat';
if (minifat_store !== ENDOFCHAIN && o.start !== ENDOFCHAIN) {
o.content = sector_list[minifat_store].data.slice(o.start * MSSZ, o.start * MSSZ + o.size);
prep_blob(o.content, 0);
}
}
files[name] = o;
FileIndex.push(o);
}
} function read_date(blob, offset) {
return new Date((((__readUInt32LE(blob, offset + 4) / 1e7) * Math.pow(2, 32) + __readUInt32LE(blob, offset) / 1e7) - 11644473600) * 1000);
} var fs;
function readFileSync(filename, options) {
if (fs === undefined) fs = require('fs');
return parse(fs.readFileSync(filename), options);
} function readSync(blob, options) {
switch (options !== undefined && options.type !== undefined ? options.type : "base64") {
case "file": return readFileSync(blob, options);
case "base64": return parse(s2a(Base64.decode(blob)), options);
case "binary": return parse(s2a(blob), options);
}
return parse(blob);
} /** CFB Constants */
var MSSZ = 64; /* Mini Sector Size = 1<<6 */
//var MSCSZ = 4096; /* Mini Stream Cutoff Size */
/* 2.1 Compound File Sector Numbers and Types */
var ENDOFCHAIN = -2;
/* 2.2 Compound File Header */
var HEADER_SIGNATURE = 'd0cf11e0a1b11ae1';
var HEADER_CLSID = '00000000000000000000000000000000';
var consts = {
/* 2.1 Compund File Sector Numbers and Types */
MAXREGSECT: -6,
DIFSECT: -4,
FATSECT: -3,
ENDOFCHAIN: ENDOFCHAIN,
FREESECT: -1,
/* 2.2 Compound File Header */
HEADER_SIGNATURE: HEADER_SIGNATURE,
HEADER_MINOR_VERSION: '3e00',
MAXREGSID: -6,
NOSTREAM: -1,
HEADER_CLSID: HEADER_CLSID,
/* 2.6.1 Compound File Directory Entry */
EntryTypes: ['unknown', 'storage', 'stream', 'lockbytes', 'property', 'root']
}; exports.read = readSync;
exports.parse = parse;
exports.utils = {
ReadShift: ReadShift,
CheckField: CheckField,
prep_blob: prep_blob,
bconcat: bconcat,
consts: consts
}; return exports;
})(); if (typeof require !== 'undefined' && typeof module !== 'undefined' && typeof DO_NOT_EXPORT_CFB === 'undefined') { module.exports = CFB; }
function isval(x) {
return x !== undefined && x !== null;
} function keys(o) { return Object.keys(o); } function evert_key(obj, key) {
var o = [], K = keys(obj);
for (var i = 0; i !== K.length; ++i) o[obj[K[i]][key]] = K[i];
return o;
} function evert(obj) {
var o = [], K = keys(obj);
for (var i = 0; i !== K.length; ++i) o[obj[K[i]]] = K[i];
return o;
} function evert_num(obj) {
var o = [], K = keys(obj);
for (var i = 0; i !== K.length; ++i) o[obj[K[i]]] = parseInt(K[i], 10);
return o;
} function evert_arr(obj) {
var o = [], K = keys(obj);
for (var i = 0; i !== K.length; ++i) {
if (o[obj[K[i]]] == null) o[obj[K[i]]] = [];
o[obj[K[i]]].push(K[i]);
}
return o;
} /* TODO: date1904 logic */
function datenum(v, date1904) {
if (date1904) v += 1462;
var epoch = Date.parse(v);
return (epoch + 2209161600000) / (24 * 60 * 60 * 1000);
} function cc2str(arr) {
var o = "";
for (var i = 0; i != arr.length; ++i) o += String.fromCharCode(arr[i]);
return o;
} function getdata(data) {
if (!data) return null;
if (data.name.substr(-4) === ".bin") {
if (data.data) return char_codes(data.data);
if (data.asNodeBuffer && has_buf) return data.asNodeBuffer();
if (data._data && data._data.getContent) return Array.prototype.slice.call(data._data.getContent());
} else {
if (data.data) return data.name.substr(-4) !== ".bin" ? debom_xml(data.data) : char_codes(data.data);
if (data.asNodeBuffer && has_buf) return debom_xml(data.asNodeBuffer().toString('binary'));
if (data.asBinary) return debom_xml(data.asBinary());
if (data._data && data._data.getContent) return debom_xml(cc2str(Array.prototype.slice.call(data._data.getContent(), 0)));
}
return null;
} function safegetzipfile(zip, file) {
var f = file; if (zip.files[f]) return zip.files[f];
f = file.toLowerCase(); if (zip.files[f]) return zip.files[f];
f = f.replace(/\//g, '\\'); if (zip.files[f]) return zip.files[f];
return null;
} function getzipfile(zip, file) {
var o = safegetzipfile(zip, file);
if (o == null) throw new Error("Cannot find file " + file + " in zip");
return o;
} function getzipdata(zip, file, safe) {
if (!safe) return getdata(getzipfile(zip, file));
if (!file) return null;
try { return getzipdata(zip, file); } catch (e) { return null; }
} var _fs, jszip;
if (typeof JSZip !== 'undefined') jszip = JSZip;
if (typeof exports !== 'undefined') {
if (typeof module !== 'undefined' && module.exports) {
if (has_buf && typeof jszip === 'undefined') jszip = require('js' + 'zip');
if (typeof jszip === 'undefined') jszip = require('./js' + 'zip').JSZip;
_fs = require('f' + 's');
}
}
var attregexg = /([\w:]+)=((?:")([^"]*)(?:")|(?:')([^']*)(?:'))/g;
var tagregex = /<[^>]*>/g;
var nsregex = /<\w*:/, nsregex2 = /<(\/?)\w+:/;
function parsexmltag(tag, skip_root) {
var z = [];
var eq = 0, c = 0;
for (; eq !== tag.length; ++eq) if ((c = tag.charCodeAt(eq)) === 32 || c === 10 || c === 13) break;
if (!skip_root) z[0] = tag.substr(0, eq);
if (eq === tag.length) return z;
var m = tag.match(attregexg), j = 0, w = "", v = "", i = 0, q = "", cc = "";
if (m) for (i = 0; i != m.length; ++i) {
cc = m[i];
for (c = 0; c != cc.length; ++c) if (cc.charCodeAt(c) === 61) break;
q = cc.substr(0, c); v = cc.substring(c + 2, cc.length - 1);
for (j = 0; j != q.length; ++j) if (q.charCodeAt(j) === 58) break;
if (j === q.length) z[q] = v;
else z[(j === 5 && q.substr(0, 5) === "xmlns" ? "xmlns" : "") + q.substr(j + 1)] = v;
}
return z;
}
function strip_ns(x) { return x.replace(nsregex2, "<$1"); } var encodings = {
'"': '"',
''': "'",
'>': '>',
'<': '<',
'&': '&'
};
var rencoding = evert(encodings);
var rencstr = "&<>'\"".split(""); // TODO: CP remap (need to read file version to determine OS)
var unescapexml = (function () {
var encregex = /&[a-z]*;/g, coderegex = /_x([\da-fA-F]+)_/g;
return function unescapexml(text) {
var s = text + '';
return s.replace(encregex, function ($$) { return encodings[$$]; }).replace(coderegex, function (m, c) { return String.fromCharCode(parseInt(c, 16)); });
};
})(); var decregex = /[&<>'"]/g, charegex = /[\u0000-\u0008\u000b-\u001f]/g;
function escapexml(text) {
var s = text + '';
return s.replace(decregex, function (y) { return rencoding[y]; }).replace(charegex, function (s) { return "_x" + ("000" + s.charCodeAt(0).toString(16)).substr(-4) + "_"; });
} /* TODO: handle codepages */
var xlml_fixstr = (function () {
var entregex = /&#(\d+);/g;
function entrepl($$, $1) { return String.fromCharCode(parseInt($1, 10)); }
return function xlml_fixstr(str) { return str.replace(entregex, entrepl); };
})(); function parsexmlbool(value, tag) {
switch (value) {
case '1': case 'true': case 'TRUE': return true;
/* case '0': case 'false': case 'FALSE':*/
default: return false;
}
} var utf8read = function utf8reada(orig) {
var out = "", i = 0, c = 0, d = 0, e = 0, f = 0, w = 0;
while (i < orig.length) {
c = orig.charCodeAt(i++);
if (c < 128) { out += String.fromCharCode(c); continue; }
d = orig.charCodeAt(i++);
if (c > 191 && c < 224) { out += String.fromCharCode(((c & 31) << 6) | (d & 63)); continue; }
e = orig.charCodeAt(i++);
if (c < 240) { out += String.fromCharCode(((c & 15) << 12) | ((d & 63) << 6) | (e & 63)); continue; }
f = orig.charCodeAt(i++);
w = (((c & 7) << 18) | ((d & 63) << 12) | ((e & 63) << 6) | (f & 63)) - 65536;
out += String.fromCharCode(0xD800 + ((w >>> 10) & 1023));
out += String.fromCharCode(0xDC00 + (w & 1023));
}
return out;
}; if (has_buf) {
var utf8readb = function utf8readb(data) {
var out = new Buffer(2 * data.length), w, i, j = 1, k = 0, ww = 0, c;
for (i = 0; i < data.length; i += j) {
j = 1;
if ((c = data.charCodeAt(i)) < 128) w = c;
else if (c < 224) { w = (c & 31) * 64 + (data.charCodeAt(i + 1) & 63); j = 2; }
else if (c < 240) { w = (c & 15) * 4096 + (data.charCodeAt(i + 1) & 63) * 64 + (data.charCodeAt(i + 2) & 63); j = 3; }
else {
j = 4;
w = (c & 7) * 262144 + (data.charCodeAt(i + 1) & 63) * 4096 + (data.charCodeAt(i + 2) & 63) * 64 + (data.charCodeAt(i + 3) & 63);
w -= 65536; ww = 0xD800 + ((w >>> 10) & 1023); w = 0xDC00 + (w & 1023);
}
if (ww !== 0) { out[k++] = ww & 255; out[k++] = ww >>> 8; ww = 0; }
out[k++] = w % 256; out[k++] = w >>> 8;
}
out.length = k;
return out.toString('ucs2');
};
var corpus = "foo bar baz\u00e2\u0098\u0083\u00f0\u009f\u008d\u00a3";
if (utf8read(corpus) == utf8readb(corpus)) utf8read = utf8readb;
var utf8readc = function utf8readc(data) { return Buffer(data, 'binary').toString('utf8'); };
if (utf8read(corpus) == utf8readc(corpus)) utf8read = utf8readc;
} // matches <foo>...</foo> extracts content
var matchtag = (function () {
var mtcache = {};
return function matchtag(f, g) {
var t = f + "|" + g;
if (mtcache[t] !== undefined) return mtcache[t];
return (mtcache[t] = new RegExp('<(?:\\w+:)?' + f + '(?: xml:space="preserve")?(?:[^>]*)>([^\u2603]*)</(?:\\w+:)?' + f + '>', (g || "")));
};
})(); var vtregex = (function () {
var vt_cache = {};
return function vt_regex(bt) {
if (vt_cache[bt] !== undefined) return vt_cache[bt];
return (vt_cache[bt] = new RegExp("<vt:" + bt + ">(.*?)</vt:" + bt + ">", 'g'));
};
})();
var vtvregex = /<\/?vt:variant>/g, vtmregex = /<vt:([^>]*)>(.*)</;
function parseVector(data) {
var h = parsexmltag(data); var matches = data.match(vtregex(h.baseType)) || [];
if (matches.length != h.size) throw "unexpected vector length " + matches.length + " != " + h.size;
var res = [];
matches.forEach(function (x) {
var v = x.replace(vtvregex, "").match(vtmregex);
res.push({ v: v[2], t: v[1] });
});
return res;
} var wtregex = /(^\s|\s$|\n)/;
function writetag(f, g) { return '<' + f + (g.match(wtregex) ? ' xml:space="preserve"' : "") + '>' + g + '</' + f + '>'; } function wxt_helper(h) {
return keys(h).map(function (k) { return " " + k + '="' + h[k] + '"'; }).join("");
}
function writextag(f, g, h) {
var a = '<' + f + (isval(h) ? wxt_helper(h) : "");
var b = (isval(g) ? (g.match(wtregex) ? ' xml:space="preserve"' : "") + '>' + g + '</' + f : "/");
return '<' + f + (isval(h) ? wxt_helper(h) : "") + (isval(g) ? (g.match(wtregex) ? ' xml:space="preserve"' : "") + '>' + g + '</' + f : "/") + '>';
} function write_w3cdtf(d, t) { try { return d.toISOString().replace(/\.\d*/, ""); } catch (e) { if (t) throw e; } } function write_vt(s) {
switch (typeof s) {
case 'string': return writextag('vt:lpwstr', s);
case 'number': return writextag((s | 0) == s ? 'vt:i4' : 'vt:r8', String(s));
case 'boolean': return writextag('vt:bool', s ? 'true' : 'false');
}
if (s instanceof Date) return writextag('vt:filetime', write_w3cdtf(s));
throw new Error("Unable to serialize " + s);
} var XML_HEADER = '<?xml version="1.0" encoding="UTF-8" standalone="yes"?>\r\n';
var XMLNS = {
'dc': 'http://purl.org/dc/elements/1.1/',
'dcterms': 'http://purl.org/dc/terms/',
'dcmitype': 'http://purl.org/dc/dcmitype/',
'mx': 'http://schemas.microsoft.com/office/mac/excel/2008/main',
'r': 'http://schemas.openxmlformats.org/officeDocument/2006/relationships',
'sjs': 'http://schemas.openxmlformats.org/package/2006/sheetjs/core-properties',
'vt': 'http://schemas.openxmlformats.org/officeDocument/2006/docPropsVTypes',
'xsi': 'http://www.w3.org/2001/XMLSchema-instance',
'xsd': 'http://www.w3.org/2001/XMLSchema'
}; XMLNS.main = [
'http://schemas.openxmlformats.org/spreadsheetml/2006/main',
'http://purl.oclc.org/ooxml/spreadsheetml/main',
'http://schemas.microsoft.com/office/excel/2006/main',
'http://schemas.microsoft.com/office/excel/2006/2'
]; function readIEEE754(buf, idx, isLE, nl, ml) {
if (isLE === undefined) isLE = true;
if (!nl) nl = 8;
if (!ml && nl === 8) ml = 52;
var e, m, el = nl * 8 - ml - 1, eMax = (1 << el) - 1, eBias = eMax >> 1;
var bits = -7, d = isLE ? -1 : 1, i = isLE ? (nl - 1) : 0, s = buf[idx + i]; i += d;
e = s & ((1 << (-bits)) - 1); s >>>= (-bits); bits += el;
for (; bits > 0; e = e * 256 + buf[idx + i], i += d, bits -= 8);
m = e & ((1 << (-bits)) - 1); e >>>= (-bits); bits += ml;
for (; bits > 0; m = m * 256 + buf[idx + i], i += d, bits -= 8);
if (e === eMax) return m ? NaN : ((s ? -1 : 1) * Infinity);
else if (e === 0) e = 1 - eBias;
else { m = m + Math.pow(2, ml); e = e - eBias; }
return (s ? -1 : 1) * m * Math.pow(2, e - ml);
} var __toBuffer, ___toBuffer;
__toBuffer = ___toBuffer = function toBuffer_(bufs) { var x = []; for (var i = 0; i < bufs[0].length; ++i) { x.push.apply(x, bufs[0][i]); } return x; };
var __utf16le, ___utf16le;
__utf16le = ___utf16le = function utf16le_(b, s, e) { var ss = []; for (var i = s; i < e; i += 2) ss.push(String.fromCharCode(__readUInt16LE(b, i))); return ss.join(""); };
var __hexlify, ___hexlify;
__hexlify = ___hexlify = function hexlify_(b, s, l) { return b.slice(s, (s + l)).map(function (x) { return (x < 16 ? "0" : "") + x.toString(16); }).join(""); };
var __utf8, ___utf8;
__utf8 = ___utf8 = function (b, s, e) { var ss = []; for (var i = s; i < e; i++) ss.push(String.fromCharCode(__readUInt8(b, i))); return ss.join(""); };
var __lpstr, ___lpstr;
__lpstr = ___lpstr = function lpstr_(b, i) { var len = __readUInt32LE(b, i); return len > 0 ? __utf8(b, i + 4, i + 4 + len - 1) : ""; };
var __lpwstr, ___lpwstr;
__lpwstr = ___lpwstr = function lpwstr_(b, i) { var len = 2 * __readUInt32LE(b, i); return len > 0 ? __utf8(b, i + 4, i + 4 + len - 1) : ""; };
var __double, ___double;
__double = ___double = function (b, idx) { return readIEEE754(b, idx); }; var is_buf = function is_buf_a(a) { return Array.isArray(a); };
if (has_buf) {
__utf16le = function utf16le_b(b, s, e) { if (!Buffer.isBuffer(b)) return ___utf16le(b, s, e); return b.toString('utf16le', s, e); };
__hexlify = function (b, s, l) { return Buffer.isBuffer(b) ? b.toString('hex', s, s + l) : ___hexlify(b, s, l); };
__lpstr = function lpstr_b(b, i) { if (!Buffer.isBuffer(b)) return ___lpstr(b, i); var len = b.readUInt32LE(i); return len > 0 ? b.toString('utf8', i + 4, i + 4 + len - 1) : ""; };
__lpwstr = function lpwstr_b(b, i) { if (!Buffer.isBuffer(b)) return ___lpwstr(b, i); var len = 2 * b.readUInt32LE(i); return b.toString('utf16le', i + 4, i + 4 + len - 1); };
__utf8 = function utf8_b(s, e) { return this.toString('utf8', s, e); };
__toBuffer = function (bufs) { return (bufs[0].length > 0 && Buffer.isBuffer(bufs[0][0])) ? Buffer.concat(bufs[0]) : ___toBuffer(bufs); };
bconcat = function (bufs) { return Buffer.isBuffer(bufs[0]) ? Buffer.concat(bufs) : [].concat.apply([], bufs); };
__double = function double_(b, i) { if (Buffer.isBuffer(b)) return b.readDoubleLE(i); return ___double(b, i); };
is_buf = function is_buf_b(a) { return Buffer.isBuffer(a) || Array.isArray(a); };
} /* from js-xls */
if (typeof cptable !== 'undefined') {
__utf16le = function (b, s, e) { return cptable.utils.decode(1200, b.slice(s, e)); };
__utf8 = function (b, s, e) { return cptable.utils.decode(65001, b.slice(s, e)); };
__lpstr = function (b, i) { var len = __readUInt32LE(b, i); return len > 0 ? cptable.utils.decode(current_codepage, b.slice(i + 4, i + 4 + len - 1)) : ""; };
__lpwstr = function (b, i) { var len = 2 * __readUInt32LE(b, i); return len > 0 ? cptable.utils.decode(1200, b.slice(i + 4, i + 4 + len - 1)) : ""; };
} var __readUInt8 = function (b, idx) { return b[idx]; };
var __readUInt16LE = function (b, idx) { return b[idx + 1] * (1 << 8) + b[idx]; };
var __readInt16LE = function (b, idx) { var u = b[idx + 1] * (1 << 8) + b[idx]; return (u < 0x8000) ? u : (0xffff - u + 1) * -1; };
var __readUInt32LE = function (b, idx) { return b[idx + 3] * (1 << 24) + (b[idx + 2] << 16) + (b[idx + 1] << 8) + b[idx]; };
var __readInt32LE = function (b, idx) { return (b[idx + 3] << 24) | (b[idx + 2] << 16) | (b[idx + 1] << 8) | b[idx]; }; var ___unhexlify = function (s) { return s.match(/../g).map(function (x) { return parseInt(x, 16); }); };
var __unhexlify = typeof Buffer !== "undefined" ? function (s) { return Buffer.isBuffer(s) ? new Buffer(s, 'hex') : ___unhexlify(s); } : ___unhexlify; function ReadShift(size, t) {
var o = "", oI, oR, oo = [], w, vv, i, loc;
switch (t) {
case 'dbcs':
loc = this.l;
if (has_buf && Buffer.isBuffer(this)) o = this.slice(this.l, this.l + 2 * size).toString("utf16le");
else for (i = 0; i != size; ++i) { o += String.fromCharCode(__readUInt16LE(this, loc)); loc += 2; }
size *= 2;
break; case 'utf8': o = __utf8(this, this.l, this.l + size); break;
case 'utf16le': size *= 2; o = __utf16le(this, this.l, this.l + size); break; /* [MS-OLEDS] 2.1.4 LengthPrefixedAnsiString */
case 'lpstr': o = __lpstr(this, this.l); size = 5 + o.length; break;
/* [MS-OLEDS] 2.1.5 LengthPrefixedUnicodeString */
case 'lpwstr': o = __lpwstr(this, this.l); size = 5 + o.length; if (o[o.length - 1] == '\u0000') size += 2; break; case 'cstr': size = 0; o = "";
while ((w = __readUInt8(this, this.l + size++)) !== 0) oo.push(_getchar(w));
o = oo.join(""); break;
case 'wstr': size = 0; o = "";
while ((w = __readUInt16LE(this, this.l + size)) !== 0) { oo.push(_getchar(w)); size += 2; }
size += 2; o = oo.join(""); break; /* sbcs and dbcs support continue records in the SST way TODO codepages */
case 'dbcs-cont': o = ""; loc = this.l;
for (i = 0; i != size; ++i) {
if (this.lens && this.lens.indexOf(loc) !== -1) {
w = __readUInt8(this, loc);
this.l = loc + 1;
vv = ReadShift.call(this, size - i, w ? 'dbcs-cont' : 'sbcs-cont');
return oo.join("") + vv;
}
oo.push(_getchar(__readUInt16LE(this, loc)));
loc += 2;
} o = oo.join(""); size *= 2; break; case 'sbcs-cont': o = ""; loc = this.l;
for (i = 0; i != size; ++i) {
if (this.lens && this.lens.indexOf(loc) !== -1) {
w = __readUInt8(this, loc);
this.l = loc + 1;
vv = ReadShift.call(this, size - i, w ? 'dbcs-cont' : 'sbcs-cont');
return oo.join("") + vv;
}
oo.push(_getchar(__readUInt8(this, loc)));
loc += 1;
} o = oo.join(""); break; default:
switch (size) {
case 1: oI = __readUInt8(this, this.l); this.l++; return oI;
case 2: oI = (t === 'i' ? __readInt16LE : __readUInt16LE)(this, this.l); this.l += 2; return oI;
case 4:
if (t === 'i' || (this[this.l + 3] & 0x80) === 0) { oI = __readInt32LE(this, this.l); this.l += 4; return oI; }
else { oR = __readUInt32LE(this, this.l); this.l += 4; return oR; } break;
case 8: if (t === 'f') { oR = __double(this, this.l); this.l += 8; return oR; }
/* falls through */
case 16: o = __hexlify(this, this.l, size); break;
}
}
this.l += size; return o;
} function WriteShift(t, val, f) {
var size, i;
if (f === 'dbcs') {
for (i = 0; i != val.length; ++i) this.writeUInt16LE(val.charCodeAt(i), this.l + 2 * i);
size = 2 * val.length;
} else switch (t) {
case 1: size = 1; this[this.l] = val & 255; break;
case 3: size = 3; this[this.l + 2] = val & 255; val >>>= 8; this[this.l + 1] = val & 255; val >>>= 8; this[this.l] = val & 255; break;
case 4: size = 4; this.writeUInt32LE(val, this.l); break;
case 8: size = 8; if (f === 'f') { this.writeDoubleLE(val, this.l); break; }
/* falls through */
case 16: break;
case -4: size = 4; this.writeInt32LE(val, this.l); break;
}
this.l += size; return this;
} function CheckField(hexstr, fld) {
var m = __hexlify(this, this.l, hexstr.length >> 1);
if (m !== hexstr) throw fld + 'Expected ' + hexstr + ' saw ' + m;
this.l += hexstr.length >> 1;
} function prep_blob(blob, pos) {
blob.l = pos;
blob.read_shift = ReadShift;
blob.chk = CheckField;
blob.write_shift = WriteShift;
} function parsenoop(blob, length) { blob.l += length; } function writenoop(blob, length) { blob.l += length; } function new_buf(sz) {
var o = new_raw_buf(sz);
prep_blob(o, 0);
return o;
} /* [MS-XLSB] 2.1.4 Record */
function recordhopper(data, cb, opts) {
var tmpbyte, cntbyte, length;
prep_blob(data, data.l || 0);
while (data.l < data.length) {
var RT = data.read_shift(1);
if (RT & 0x80) RT = (RT & 0x7F) + ((data.read_shift(1) & 0x7F) << 7);
var R = XLSBRecordEnum[RT] || XLSBRecordEnum[0xFFFF];
tmpbyte = data.read_shift(1);
length = tmpbyte & 0x7F;
for (cntbyte = 1; cntbyte < 4 && (tmpbyte & 0x80) ; ++cntbyte) length += ((tmpbyte = data.read_shift(1)) & 0x7F) << (7 * cntbyte);
var d = R.f(data, length, opts);
if (cb(d, R, RT)) return;
}
} /* control buffer usage for fixed-length buffers */
function buf_array() {
var bufs = [], blksz = 2048;
var newblk = function ba_newblk(sz) {
var o = new_buf(sz);
prep_blob(o, 0);
return o;
}; var curbuf = newblk(blksz); var endbuf = function ba_endbuf() {
curbuf.length = curbuf.l;
if (curbuf.length > 0) bufs.push(curbuf);
curbuf = null;
}; var next = function ba_next(sz) {
if (sz < curbuf.length - curbuf.l) return curbuf;
endbuf();
return (curbuf = newblk(Math.max(sz + 1, blksz)));
}; var end = function ba_end() {
endbuf();
return __toBuffer([bufs]);
}; var push = function ba_push(buf) { endbuf(); curbuf = buf; next(blksz); }; return { next: next, push: push, end: end, _bufs: bufs };
} function write_record(ba, type, payload, length) {
var t = evert_RE[type], l;
if (!length) length = XLSBRecordEnum[t].p || (payload || []).length || 0;
l = 1 + (t >= 0x80 ? 1 : 0) + 1 + length;
if (length >= 0x80)++l; if (length >= 0x4000)++l; if (length >= 0x200000)++l;
var o = ba.next(l);
if (t <= 0x7F) o.write_shift(1, t);
else {
o.write_shift(1, (t & 0x7F) + 0x80);
o.write_shift(1, (t >> 7));
}
for (var i = 0; i != 4; ++i) {
if (length >= 0x80) { o.write_shift(1, (length & 0x7F) + 0x80); length >>= 7; }
else { o.write_shift(1, length); break; }
}
if (length > 0 && is_buf(payload)) ba.push(payload);
}
/* XLS ranges enforced */
function shift_cell_xls(cell, tgt) {
if (tgt.s) {
if (cell.cRel) cell.c += tgt.s.c;
if (cell.rRel) cell.r += tgt.s.r;
} else {
cell.c += tgt.c;
cell.r += tgt.r;
}
cell.cRel = cell.rRel = 0;
while (cell.c >= 0x100) cell.c -= 0x100;
while (cell.r >= 0x10000) cell.r -= 0x10000;
return cell;
} function shift_range_xls(cell, range) {
cell.s = shift_cell_xls(cell.s, range.s);
cell.e = shift_cell_xls(cell.e, range.s);
return cell;
} var OFFCRYPTO = {};
var make_offcrypto = function (O, _crypto) {
var crypto;
if (typeof _crypto !== 'undefined') crypto = _crypto;
else if (typeof require !== 'undefined') {
try { crypto = require('cry' + 'pto'); }
catch (e) { crypto = null; }
} O.rc4 = function (key, data) {
var S = new Array(256);
var c = 0, i = 0, j = 0, t = 0;
for (i = 0; i != 256; ++i) S[i] = i;
for (i = 0; i != 256; ++i) {
j = (j + S[i] + (key[i % key.length]).charCodeAt(0)) & 255;
t = S[i]; S[i] = S[j]; S[j] = t;
}
i = j = 0; out = Buffer(data.length);
for (c = 0; c != data.length; ++c) {
i = (i + 1) & 255;
j = (j + S[i]) % 256;
t = S[i]; S[i] = S[j]; S[j] = t;
out[c] = (data[c] ^ S[(S[i] + S[j]) & 255]);
}
return out;
}; if (crypto) {
O.md5 = function (hex) { return crypto.createHash('md5').update(hex).digest('hex'); };
} else {
O.md5 = function (hex) { throw "unimplemented"; };
}
};
make_offcrypto(OFFCRYPTO, typeof crypto !== "undefined" ? crypto : undefined); /* [MS-XLSB] 2.5.143 */
function parse_StrRun(data, length) {
return { ich: data.read_shift(2), ifnt: data.read_shift(2) };
} /* [MS-XLSB] 2.1.7.121 */
function parse_RichStr(data, length) {
var start = data.l;
var flags = data.read_shift(1);
var str = parse_XLWideString(data);
var rgsStrRun = [];
var z = { t: str, h: str };
if ((flags & 1) !== 0) { /* fRichStr */
/* TODO: formatted string */
var dwSizeStrRun = data.read_shift(4);
for (var i = 0; i != dwSizeStrRun; ++i) rgsStrRun.push(parse_StrRun(data));
z.r = rgsStrRun;
}
else z.r = "<t>" + escapexml(str) + "</t>";
if ((flags & 2) !== 0) { /* fExtStr */
/* TODO: phonetic string */
}
data.l = start + length;
return z;
}
function write_RichStr(str, o) {
/* TODO: formatted string */
if (o == null) o = new_buf(5 + 2 * str.t.length);
o.write_shift(1, 0);
write_XLWideString(str.t, o);
return o;
} /* [MS-XLSB] 2.5.9 */
function parse_XLSBCell(data) {
var col = data.read_shift(4);
var iStyleRef = data.read_shift(2);
iStyleRef += data.read_shift(1) << 16;
var fPhShow = data.read_shift(1);
return { c: col, iStyleRef: iStyleRef };
}
function write_XLSBCell(cell, o) {
if (o == null) o = new_buf(8);
o.write_shift(-4, cell.c);
o.write_shift(3, cell.iStyleRef === undefined ? cell.iStyleRef : cell.s);
o.write_shift(1, 0); /* fPhShow */
return o;
} /* [MS-XLSB] 2.5.21 */
function parse_XLSBCodeName(data, length) { return parse_XLWideString(data, length); } /* [MS-XLSB] 2.5.166 */
function parse_XLNullableWideString(data) {
var cchCharacters = data.read_shift(4);
return cchCharacters === 0 || cchCharacters === 0xFFFFFFFF ? "" : data.read_shift(cchCharacters, 'dbcs');
}
function write_XLNullableWideString(data, o) {
if (!o) o = new_buf(127);
o.write_shift(4, data.length > 0 ? data.length : 0xFFFFFFFF);
if (data.length > 0) o.write_shift(0, data, 'dbcs');
return o;
} /* [MS-XLSB] 2.5.168 */
function parse_XLWideString(data) {
var cchCharacters = data.read_shift(4);
return cchCharacters === 0 ? "" : data.read_shift(cchCharacters, 'dbcs');
}
function write_XLWideString(data, o) {
if (o == null) o = new_buf(4 + 2 * data.length);
o.write_shift(4, data.length);
if (data.length > 0) o.write_shift(0, data, 'dbcs');
return o;
} /* [MS-XLSB] 2.5.114 */
var parse_RelID = parse_XLNullableWideString;
var write_RelID = write_XLNullableWideString; /* [MS-XLSB] 2.5.122 */
/* [MS-XLS] 2.5.217 */
function parse_RkNumber(data) {
var b = data.slice(data.l, data.l + 4);
var fX100 = b[0] & 1, fInt = b[0] & 2;
data.l += 4;
b[0] &= 0xFC; // b[0] &= ~3;
var RK = fInt === 0 ? __double([0, 0, 0, 0, b[0], b[1], b[2], b[3]], 0) : __readInt32LE(b, 0) >> 2;
return fX100 ? RK / 100 : RK;
} /* [MS-XLSB] 2.5.153 */
function parse_UncheckedRfX(data) {
var cell = { s: {}, e: {} };
cell.s.r = data.read_shift(4);
cell.e.r = data.read_shift(4);
cell.s.c = data.read_shift(4);
cell.e.c = data.read_shift(4);
return cell;
} function write_UncheckedRfX(r, o) {
if (!o) o = new_buf(16);
o.write_shift(4, r.s.r);
o.write_shift(4, r.e.r);
o.write_shift(4, r.s.c);
o.write_shift(4, r.e.c);
return o;
} /* [MS-XLSB] 2.5.171 */
/* [MS-XLS] 2.5.342 */
function parse_Xnum(data, length) { return data.read_shift(8, 'f'); }
function write_Xnum(data, o) { return (o || new_buf(8)).write_shift(8, 'f', data); } /* [MS-XLSB] 2.5.198.2 */
var BErr = {
0x00: "#NULL!",
0x07: "#DIV/0!",
0x0F: "#VALUE!",
0x17: "#REF!",
0x1D: "#NAME?",
0x24: "#NUM!",
0x2A: "#N/A",
0x2B: "#GETTING_DATA",
0xFF: "#WTF?"
};
var RBErr = evert_num(BErr); /* [MS-XLSB] 2.4.321 BrtColor */
function parse_BrtColor(data, length) {
var out = {};
var d = data.read_shift(1);
out.fValidRGB = d & 1;
out.xColorType = d >>> 1;
out.index = data.read_shift(1);
out.nTintAndShade = data.read_shift(2, 'i');
out.bRed = data.read_shift(1);
out.bGreen = data.read_shift(1);
out.bBlue = data.read_shift(1);
out.bAlpha = data.read_shift(1);
} /* [MS-XLSB] 2.5.52 */
function parse_FontFlags(data, length) {
var d = data.read_shift(1);
data.l++;
var out = {
fItalic: d & 0x2,
fStrikeout: d & 0x8,
fOutline: d & 0x10,
fShadow: d & 0x20,
fCondense: d & 0x40,
fExtend: d & 0x80
};
return out;
}
/* [MS-OLEPS] 2.2 PropertyType */
{
var VT_EMPTY = 0x0000;
var VT_NULL = 0x0001;
var VT_I2 = 0x0002;
var VT_I4 = 0x0003;
var VT_R4 = 0x0004;
var VT_R8 = 0x0005;
var VT_CY = 0x0006;
var VT_DATE = 0x0007;
var VT_BSTR = 0x0008;
var VT_ERROR = 0x000A;
var VT_BOOL = 0x000B;
var VT_VARIANT = 0x000C;
var VT_DECIMAL = 0x000E;
var VT_I1 = 0x0010;
var VT_UI1 = 0x0011;
var VT_UI2 = 0x0012;
var VT_UI4 = 0x0013;
var VT_I8 = 0x0014;
var VT_UI8 = 0x0015;
var VT_INT = 0x0016;
var VT_UINT = 0x0017;
var VT_LPSTR = 0x001E;
var VT_LPWSTR = 0x001F;
var VT_FILETIME = 0x0040;
var VT_BLOB = 0x0041;
var VT_STREAM = 0x0042;
var VT_STORAGE = 0x0043;
var VT_STREAMED_Object = 0x0044;
var VT_STORED_Object = 0x0045;
var VT_BLOB_Object = 0x0046;
var VT_CF = 0x0047;
var VT_CLSID = 0x0048;
var VT_VERSIONED_STREAM = 0x0049;
var VT_VECTOR = 0x1000;
var VT_ARRAY = 0x2000; var VT_STRING = 0x0050; // 2.3.3.1.11 VtString
var VT_USTR = 0x0051; // 2.3.3.1.12 VtUnalignedString
var VT_CUSTOM = [VT_STRING, VT_USTR];
} /* [MS-OSHARED] 2.3.3.2.2.1 Document Summary Information PIDDSI */
var DocSummaryPIDDSI = {
0x01: { n: 'CodePage', t: VT_I2 },
0x02: { n: 'Category', t: VT_STRING },
0x03: { n: 'PresentationFormat', t: VT_STRING },
0x04: { n: 'ByteCount', t: VT_I4 },
0x05: { n: 'LineCount', t: VT_I4 },
0x06: { n: 'ParagraphCount', t: VT_I4 },
0x07: { n: 'SlideCount', t: VT_I4 },
0x08: { n: 'NoteCount', t: VT_I4 },
0x09: { n: 'HiddenCount', t: VT_I4 },
0x0a: { n: 'MultimediaClipCount', t: VT_I4 },
0x0b: { n: 'Scale', t: VT_BOOL },
0x0c: { n: 'HeadingPair', t: VT_VECTOR | VT_VARIANT },
0x0d: { n: 'DocParts', t: VT_VECTOR | VT_LPSTR },
0x0e: { n: 'Manager', t: VT_STRING },
0x0f: { n: 'Company', t: VT_STRING },
0x10: { n: 'LinksDirty', t: VT_BOOL },
0x11: { n: 'CharacterCount', t: VT_I4 },
0x13: { n: 'SharedDoc', t: VT_BOOL },
0x16: { n: 'HLinksChanged', t: VT_BOOL },
0x17: { n: 'AppVersion', t: VT_I4, p: 'version' },
0x1A: { n: 'ContentType', t: VT_STRING },
0x1B: { n: 'ContentStatus', t: VT_STRING },
0x1C: { n: 'Language', t: VT_STRING },
0x1D: { n: 'Version', t: VT_STRING },
0xFF: {}
}; /* [MS-OSHARED] 2.3.3.2.1.1 Summary Information Property Set PIDSI */
var SummaryPIDSI = {
0x01: { n: 'CodePage', t: VT_I2 },
0x02: { n: 'Title', t: VT_STRING },
0x03: { n: 'Subject', t: VT_STRING },
0x04: { n: 'Author', t: VT_STRING },
0x05: { n: 'Keywords', t: VT_STRING },
0x06: { n: 'Comments', t: VT_STRING },
0x07: { n: 'Template', t: VT_STRING },
0x08: { n: 'LastAuthor', t: VT_STRING },
0x09: { n: 'RevNumber', t: VT_STRING },
0x0A: { n: 'EditTime', t: VT_FILETIME },
0x0B: { n: 'LastPrinted', t: VT_FILETIME },
0x0C: { n: 'CreatedDate', t: VT_FILETIME },
0x0D: { n: 'ModifiedDate', t: VT_FILETIME },
0x0E: { n: 'PageCount', t: VT_I4 },
0x0F: { n: 'WordCount', t: VT_I4 },
0x10: { n: 'CharCount', t: VT_I4 },
0x11: { n: 'Thumbnail', t: VT_CF },
0x12: { n: 'ApplicationName', t: VT_LPSTR },
0x13: { n: 'DocumentSecurity', t: VT_I4 },
0xFF: {}
}; /* [MS-OLEPS] 2.18 */
var SpecialProperties = {
0x80000000: { n: 'Locale', t: VT_UI4 },
0x80000003: { n: 'Behavior', t: VT_UI4 },
0x72627262: {}
}; (function () {
for (var y in SpecialProperties) if (SpecialProperties.hasOwnProperty(y))
DocSummaryPIDDSI[y] = SummaryPIDSI[y] = SpecialProperties[y];
})(); /* [MS-XLS] 2.4.63 Country/Region codes */
var CountryEnum = {
0x0001: "US", // United States
0x0002: "CA", // Canada
0x0003: "", // Latin America (except Brazil)
0x0007: "RU", // Russia
0x0014: "EG", // Egypt
0x001E: "GR", // Greece
0x001F: "NL", // Netherlands
0x0020: "BE", // Belgium
0x0021: "FR", // France
0x0022: "ES", // Spain
0x0024: "HU", // Hungary
0x0027: "IT", // Italy
0x0029: "CH", // Switzerland
0x002B: "AT", // Austria
0x002C: "GB", // United Kingdom
0x002D: "DK", // Denmark
0x002E: "SE", // Sweden
0x002F: "NO", // Norway
0x0030: "PL", // Poland
0x0031: "DE", // Germany
0x0034: "MX", // Mexico
0x0037: "BR", // Brazil
0x003d: "AU", // Australia
0x0040: "NZ", // New Zealand
0x0042: "TH", // Thailand
0x0051: "JP", // Japan
0x0052: "KR", // Korea
0x0054: "VN", // Viet Nam
0x0056: "CN", // China
0x005A: "TR", // Turkey
0x0069: "JS", // Ramastan
0x00D5: "DZ", // Algeria
0x00D8: "MA", // Morocco
0x00DA: "LY", // Libya
0x015F: "PT", // Portugal
0x0162: "IS", // Iceland
0x0166: "FI", // Finland
0x01A4: "CZ", // Czech Republic
0x0376: "TW", // Taiwan
0x03C1: "LB", // Lebanon
0x03C2: "JO", // Jordan
0x03C3: "SY", // Syria
0x03C4: "IQ", // Iraq
0x03C5: "KW", // Kuwait
0x03C6: "SA", // Saudi Arabia
0x03CB: "AE", // United Arab Emirates
0x03CC: "IL", // Israel
0x03CE: "QA", // Qatar
0x03D5: "IR", // Iran
0xFFFF: "US" // United States
}; /* [MS-XLS] 2.5.127 */
var XLSFillPattern = [
null,
'solid',
'mediumGray',
'darkGray',
'lightGray',
'darkHorizontal',
'darkVertical',
'darkDown',
'darkUp',
'darkGrid',
'darkTrellis',
'lightHorizontal',
'lightVertical',
'lightDown',
'lightUp',
'lightGrid',
'lightTrellis',
'gray125',
'gray0625'
]; function rgbify(arr) { return arr.map(function (x) { return [(x >> 16) & 255, (x >> 8) & 255, x & 255]; }); } /* [MS-XLS] 2.5.161 */
var XLSIcv = rgbify([
/* Color Constants */
0x000000,
0xFFFFFF,
0xFF0000,
0x00FF00,
0x0000FF,
0xFFFF00,
0xFF00FF,
0x00FFFF, /* Defaults */
0x000000,
0xFFFFFF,
0xFF0000,
0x00FF00,
0x0000FF,
0xFFFF00,
0xFF00FF,
0x00FFFF, 0x800000,
0x008000,
0x000080,
0x808000,
0x800080,
0x008080,
0xC0C0C0,
0x808080,
0x9999FF,
0x993366,
0xFFFFCC,
0xCCFFFF,
0x660066,
0xFF8080,
0x0066CC,
0xCCCCFF, 0x000080,
0xFF00FF,
0xFFFF00,
0x00FFFF,
0x800080,
0x800000,
0x008080,
0x0000FF,
0x00CCFF,
0xCCFFFF,
0xCCFFCC,
0xFFFF99,
0x99CCFF,
0xFF99CC,
0xCC99FF,
0xFFCC99, 0x3366FF,
0x33CCCC,
0x99CC00,
0xFFCC00,
0xFF9900,
0xFF6600,
0x666699,
0x969696,
0x003366,
0x339966,
0x003300,
0x333300,
0x993300,
0x993366,
0x333399,
0x333333, /* Sheet */
0xFFFFFF,
0x000000
]); /* Parts enumerated in OPC spec, MS-XLSB and MS-XLSX */
/* 12.3 Part Summary <SpreadsheetML> */
/* 14.2 Part Summary <DrawingML> */
/* [MS-XLSX] 2.1 Part Enumerations */
/* [MS-XLSB] 2.1.7 Part Enumeration */
var ct2type = {
/* Workbook */
"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet.main+xml": "workbooks", /* Worksheet */
"application/vnd.ms-excel.binIndexWs": "TODO", /* Binary Index */ /* Chartsheet */
"application/vnd.ms-excel.chartsheet": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.chartsheet+xml": "TODO", /* Dialogsheet */
"application/vnd.ms-excel.dialogsheet": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.dialogsheet+xml": "TODO", /* Macrosheet */
"application/vnd.ms-excel.macrosheet": "TODO",
"application/vnd.ms-excel.macrosheet+xml": "TODO",
"application/vnd.ms-excel.intlmacrosheet": "TODO",
"application/vnd.ms-excel.binIndexMs": "TODO", /* Binary Index */ /* File Properties */
"application/vnd.openxmlformats-package.core-properties+xml": "coreprops",
"application/vnd.openxmlformats-officedocument.custom-properties+xml": "custprops",
"application/vnd.openxmlformats-officedocument.extended-properties+xml": "extprops", /* Custom Data Properties */
"application/vnd.openxmlformats-officedocument.customXmlProperties+xml": "TODO", /* Comments */
"application/vnd.ms-excel.comments": "comments",
"application/vnd.openxmlformats-officedocument.spreadsheetml.comments+xml": "comments", /* PivotTable */
"application/vnd.ms-excel.pivotTable": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.pivotTable+xml": "TODO", /* Calculation Chain */
"application/vnd.ms-excel.calcChain": "calcchains",
"application/vnd.openxmlformats-officedocument.spreadsheetml.calcChain+xml": "calcchains", /* Printer Settings */
"application/vnd.openxmlformats-officedocument.spreadsheetml.printerSettings": "TODO", /* ActiveX */
"application/vnd.ms-office.activeX": "TODO",
"application/vnd.ms-office.activeX+xml": "TODO", /* Custom Toolbars */
"application/vnd.ms-excel.attachedToolbars": "TODO", /* External Data Connections */
"application/vnd.ms-excel.connections": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.connections+xml": "TODO", /* External Links */
"application/vnd.ms-excel.externalLink": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.externalLink+xml": "TODO", /* Metadata */
"application/vnd.ms-excel.sheetMetadata": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.sheetMetadata+xml": "TODO", /* PivotCache */
"application/vnd.ms-excel.pivotCacheDefinition": "TODO",
"application/vnd.ms-excel.pivotCacheRecords": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.pivotCacheDefinition+xml": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.pivotCacheRecords+xml": "TODO", /* Query Table */
"application/vnd.ms-excel.queryTable": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.queryTable+xml": "TODO", /* Shared Workbook */
"application/vnd.ms-excel.userNames": "TODO",
"application/vnd.ms-excel.revisionHeaders": "TODO",
"application/vnd.ms-excel.revisionLog": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.revisionHeaders+xml": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.revisionLog+xml": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.userNames+xml": "TODO", /* Single Cell Table */
"application/vnd.ms-excel.tableSingleCells": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.tableSingleCells+xml": "TODO", /* Slicer */
"application/vnd.ms-excel.slicer": "TODO",
"application/vnd.ms-excel.slicerCache": "TODO",
"application/vnd.ms-excel.slicer+xml": "TODO",
"application/vnd.ms-excel.slicerCache+xml": "TODO", /* Sort Map */
"application/vnd.ms-excel.wsSortMap": "TODO", /* Table */
"application/vnd.ms-excel.table": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.table+xml": "TODO", /* Themes */
"application/vnd.openxmlformats-officedocument.theme+xml": "themes", /* Timeline */
"application/vnd.ms-excel.Timeline+xml": "TODO", /* verify */
"application/vnd.ms-excel.TimelineCache+xml": "TODO", /* verify */ /* VBA */
"application/vnd.ms-office.vbaProject": "vba",
"application/vnd.ms-office.vbaProjectSignature": "vba", /* Volatile Dependencies */
"application/vnd.ms-office.volatileDependencies": "TODO",
"application/vnd.openxmlformats-officedocument.spreadsheetml.volatileDependencies+xml": "TODO", /* Control Properties */
"application/vnd.ms-excel.controlproperties+xml": "TODO", /* Data Model */
"application/vnd.openxmlformats-officedocument.model+data": "TODO", /* Survey */
"application/vnd.ms-excel.Survey+xml": "TODO", /* Drawing */
"application/vnd.openxmlformats-officedocument.drawing+xml": "TODO",
"application/vnd.openxmlformats-officedocument.drawingml.chart+xml": "TODO",
"application/vnd.openxmlformats-officedocument.drawingml.chartshapes+xml": "TODO",
"application/vnd.openxmlformats-officedocument.drawingml.diagramColors+xml": "TODO",
"application/vnd.openxmlformats-officedocument.drawingml.diagramData+xml": "TODO",
"application/vnd.openxmlformats-officedocument.drawingml.diagramLayout+xml": "TODO",
"application/vnd.openxmlformats-officedocument.drawingml.diagramStyle+xml": "TODO", /* VML */
"application/vnd.openxmlformats-officedocument.vmlDrawing": "TODO", "application/vnd.openxmlformats-package.relationships+xml": "rels",
"application/vnd.openxmlformats-officedocument.oleObject": "TODO", "sheet": "js"
}; var CT_LIST = (function () {
var o = {
workbooks: {
xlsx: "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet.main+xml",
xlsm: "application/vnd.ms-excel.sheet.macroEnabled.main+xml",
xlsb: "application/vnd.ms-excel.sheet.binary.macroEnabled.main",
xltx: "application/vnd.openxmlformats-officedocument.spreadsheetml.template.main+xml"
},
strs: { /* Shared Strings */
xlsx: "application/vnd.openxmlformats-officedocument.spreadsheetml.sharedStrings+xml",
xlsb: "application/vnd.ms-excel.sharedStrings"
},
sheets: {
xlsx: "application/vnd.openxmlformats-officedocument.spreadsheetml.worksheet+xml",
xlsb: "application/vnd.ms-excel.worksheet"
},
styles: {/* Styles */
xlsx: "application/vnd.openxmlformats-officedocument.spreadsheetml.styles+xml",
xlsb: "application/vnd.ms-excel.styles"
}
};
keys(o).forEach(function (k) { if (!o[k].xlsm) o[k].xlsm = o[k].xlsx; });
keys(o).forEach(function (k) { keys(o[k]).forEach(function (v) { ct2type[o[k][v]] = k; }); });
return o;
})(); var type2ct = evert_arr(ct2type); XMLNS.CT = 'http://schemas.openxmlformats.org/package/2006/content-types'; function parse_ct(data, opts) {
var ctext = {};
if (!data || !data.match) return data;
var ct = {
workbooks: [], sheets: [], calcchains: [], themes: [], styles: [],
coreprops: [], extprops: [], custprops: [], strs: [], comments: [], vba: [],
TODO: [], rels: [], xmlns: ""
};
(data.match(tagregex) || []).forEach(function (x) {
var y = parsexmltag(x);
switch (y[0].replace(nsregex, "<")) {
case '<?xml': break;
case '<Types': ct.xmlns = y['xmlns' + (y[0].match(/<(\w+):/) || ["", ""])[1]]; break;
case '<Default': ctext[y.Extension] = y.ContentType; break;
case '<Override':
if (ct[ct2type[y.ContentType]] !== undefined) ct[ct2type[y.ContentType]].push(y.PartName);
else if (opts.WTF) console.error(y);
break;
}
});
if (ct.xmlns !== XMLNS.CT) throw new Error("Unknown Namespace: " + ct.xmlns);
ct.calcchain = ct.calcchains.length > 0 ? ct.calcchains[0] : "";
ct.sst = ct.strs.length > 0 ? ct.strs[0] : "";
ct.style = ct.styles.length > 0 ? ct.styles[0] : "";
ct.defaults = ctext;
delete ct.calcchains;
return ct;
} var CTYPE_XML_ROOT = writextag('Types', null, {
'xmlns': XMLNS.CT,
'xmlns:xsd': XMLNS.xsd,
'xmlns:xsi': XMLNS.xsi
}); var CTYPE_DEFAULTS = [
['xml', 'application/xml'],
['bin', 'application/vnd.ms-excel.sheet.binary.macroEnabled.main'],
['rels', type2ct.rels[0]]
].map(function (x) {
return writextag('Default', null, { 'Extension': x[0], 'ContentType': x[1] });
}); function write_ct(ct, opts) {
var o = [], v;
o[o.length] = (XML_HEADER);
o[o.length] = (CTYPE_XML_ROOT);
o = o.concat(CTYPE_DEFAULTS);
var f1 = function (w) {
if (ct[w] && ct[w].length > 0) {
v = ct[w][0];
o[o.length] = (writextag('Override', null, {
'PartName': (v[0] == '/' ? "" : "/") + v,
'ContentType': CT_LIST[w][opts.bookType || 'xlsx']
}));
}
};
var f2 = function (w) {
ct[w].forEach(function (v) {
o[o.length] = (writextag('Override', null, {
'PartName': (v[0] == '/' ? "" : "/") + v,
'ContentType': CT_LIST[w][opts.bookType || 'xlsx']
}));
});
};
var f3 = function (t) {
(ct[t] || []).forEach(function (v) {
o[o.length] = (writextag('Override', null, {
'PartName': (v[0] == '/' ? "" : "/") + v,
'ContentType': type2ct[t][0]
}));
});
};
f1('workbooks');
f2('sheets');
f3('themes');
['strs', 'styles'].forEach(f1);
['coreprops', 'extprops', 'custprops'].forEach(f3);
if (o.length > 2) { o[o.length] = ('</Types>'); o[1] = o[1].replace("/>", ">"); }
return o.join("");
}
/* 9.3.2 OPC Relationships Markup */
var RELS = {
WB: "http://schemas.openxmlformats.org/officeDocument/2006/relationships/officeDocument",
SHEET: "http://sheetjs.openxmlformats.org/officeDocument/2006/relationships/officeDocument"
}; function parse_rels(data, currentFilePath) {
if (!data) return data;
if (currentFilePath.charAt(0) !== '/') {
currentFilePath = '/' + currentFilePath;
}
var rels = {};
var hash = {};
var resolveRelativePathIntoAbsolute = function (to) {
var toksFrom = currentFilePath.split('/');
toksFrom.pop(); // folder path
var toksTo = to.split('/');
var reversed = [];
while (toksTo.length !== 0) {
var tokTo = toksTo.shift();
if (tokTo === '..') {
toksFrom.pop();
} else if (tokTo !== '.') {
toksFrom.push(tokTo);
}
}
return toksFrom.join('/');
}; data.match(tagregex).forEach(function (x) {
var y = parsexmltag(x);
/* 9.3.2.2 OPC_Relationships */
if (y[0] === '<Relationship') {
var rel = {}; rel.Type = y.Type; rel.Target = y.Target; rel.Id = y.Id; rel.TargetMode = y.TargetMode;
var canonictarget = y.TargetMode === 'External' ? y.Target : resolveRelativePathIntoAbsolute(y.Target);
rels[canonictarget] = rel;
hash[y.Id] = rel;
}
});
rels["!id"] = hash;
return rels;
} XMLNS.RELS = 'http://schemas.openxmlformats.org/package/2006/relationships'; var RELS_ROOT = writextag('Relationships', null, {
//'xmlns:ns0': XMLNS.RELS,
'xmlns': XMLNS.RELS
}); /* TODO */
function write_rels(rels) {
var o = [];
o[o.length] = (XML_HEADER);
o[o.length] = (RELS_ROOT);
keys(rels['!id']).forEach(function (rid) {
var rel = rels['!id'][rid];
o[o.length] = (writextag('Relationship', null, rel));
});
if (o.length > 2) { o[o.length] = ('</Relationships>'); o[1] = o[1].replace("/>", ">"); }
return o.join("");
}
/* ECMA-376 Part II 11.1 Core Properties Part */
/* [MS-OSHARED] 2.3.3.2.[1-2].1 (PIDSI/PIDDSI) */
var CORE_PROPS = [
["cp:category", "Category"],
["cp:contentStatus", "ContentStatus"],
["cp:keywords", "Keywords"],
["cp:lastModifiedBy", "LastAuthor"],
["cp:lastPrinted", "LastPrinted"],
["cp:revision", "RevNumber"],
["cp:version", "Version"],
["dc:creator", "Author"],
["dc:description", "Comments"],
["dc:identifier", "Identifier"],
["dc:language", "Language"],
["dc:subject", "Subject"],
["dc:title", "Title"],
["dcterms:created", "CreatedDate", 'date'],
["dcterms:modified", "ModifiedDate", 'date']
]; XMLNS.CORE_PROPS = "http://schemas.openxmlformats.org/package/2006/metadata/core-properties";
RELS.CORE_PROPS = 'http://schemas.openxmlformats.org/package/2006/relationships/metadata/core-properties'; var CORE_PROPS_REGEX = (function () {
var r = new Array(CORE_PROPS.length);
for (var i = 0; i < CORE_PROPS.length; ++i) {
var f = CORE_PROPS[i];
var g = "(?:" + f[0].substr(0, f[0].indexOf(":")) + ":)" + f[0].substr(f[0].indexOf(":") + 1);
r[i] = new RegExp("<" + g + "[^>]*>(.*)<\/" + g + ">");
}
return r;
})(); function parse_core_props(data) {
var p = {}; for (var i = 0; i < CORE_PROPS.length; ++i) {
var f = CORE_PROPS[i], cur = data.match(CORE_PROPS_REGEX[i]);
if (cur != null && cur.length > 0) p[f[1]] = cur[1];
if (f[2] === 'date' && p[f[1]]) p[f[1]] = new Date(p[f[1]]);
} return p;
} var CORE_PROPS_XML_ROOT = writextag('cp:coreProperties', null, {
//'xmlns': XMLNS.CORE_PROPS,
'xmlns:cp': XMLNS.CORE_PROPS,
'xmlns:dc': XMLNS.dc,
'xmlns:dcterms': XMLNS.dcterms,
'xmlns:dcmitype': XMLNS.dcmitype,
'xmlns:xsi': XMLNS.xsi
}); function cp_doit(f, g, h, o, p) {
if (p[f] != null || g == null || g === "") return;
p[f] = g;
o[o.length] = (h ? writextag(f, g, h) : writetag(f, g));
} function write_core_props(cp, opts) {
var o = [XML_HEADER, CORE_PROPS_XML_ROOT], p = {};
if (!cp) return o.join(""); if (cp.CreatedDate != null) cp_doit("dcterms:created", typeof cp.CreatedDate === "string" ? cp.CreatedDate : write_w3cdtf(cp.CreatedDate, opts.WTF), { "xsi:type": "dcterms:W3CDTF" }, o, p);
if (cp.ModifiedDate != null) cp_doit("dcterms:modified", typeof cp.ModifiedDate === "string" ? cp.ModifiedDate : write_w3cdtf(cp.ModifiedDate, opts.WTF), { "xsi:type": "dcterms:W3CDTF" }, o, p); for (var i = 0; i != CORE_PROPS.length; ++i) { var f = CORE_PROPS[i]; cp_doit(f[0], cp[f[1]], null, o, p); }
if (o.length > 2) { o[o.length] = ('</cp:coreProperties>'); o[1] = o[1].replace("/>", ">"); }
return o.join("");
}
/* 15.2.12.3 Extended File Properties Part */
/* [MS-OSHARED] 2.3.3.2.[1-2].1 (PIDSI/PIDDSI) */
var EXT_PROPS = [
["Application", "Application", "string"],
["AppVersion", "AppVersion", "string"],
["Company", "Company", "string"],
["DocSecurity", "DocSecurity", "string"],
["Manager", "Manager", "string"],
["HyperlinksChanged", "HyperlinksChanged", "bool"],
["SharedDoc", "SharedDoc", "bool"],
["LinksUpToDate", "LinksUpToDate", "bool"],
["ScaleCrop", "ScaleCrop", "bool"],
["HeadingPairs", "HeadingPairs", "raw"],
["TitlesOfParts", "TitlesOfParts", "raw"]
]; XMLNS.EXT_PROPS = "http://schemas.openxmlformats.org/officeDocument/2006/extended-properties";
RELS.EXT_PROPS = 'http://schemas.openxmlformats.org/officeDocument/2006/relationships/extended-properties'; function parse_ext_props(data, p) {
var q = {}; if (!p) p = {}; EXT_PROPS.forEach(function (f) {
switch (f[2]) {
case "string": p[f[1]] = (data.match(matchtag(f[0])) || [])[1]; break;
case "bool": p[f[1]] = (data.match(matchtag(f[0])) || [])[1] === "true"; break;
case "raw":
var cur = data.match(new RegExp("<" + f[0] + "[^>]*>(.*)<\/" + f[0] + ">"));
if (cur && cur.length > 0) q[f[1]] = cur[1];
break;
}
}); if (q.HeadingPairs && q.TitlesOfParts) {
var v = parseVector(q.HeadingPairs);
var j = 0, widx = 0;
for (var i = 0; i !== v.length; ++i) {
switch (v[i].v) {
case "Worksheets": widx = j; p.Worksheets = +(v[++i].v); break;
case "Named Ranges": ++i; break; // TODO: Handle Named Ranges
}
}
var parts = parseVector(q.TitlesOfParts).map(function (x) { return utf8read(x.v); });
p.SheetNames = parts.slice(widx, widx + p.Worksheets);
}
return p;
} var EXT_PROPS_XML_ROOT = writextag('Properties', null, {
'xmlns': XMLNS.EXT_PROPS,
'xmlns:vt': XMLNS.vt
}); function write_ext_props(cp, opts) {
var o = [], p = {}, W = writextag;
if (!cp) cp = {};
cp.Application = "SheetJS";
o[o.length] = (XML_HEADER);
o[o.length] = (EXT_PROPS_XML_ROOT); EXT_PROPS.forEach(function (f) {
if (cp[f[1]] === undefined) return;
var v;
switch (f[2]) {
case 'string': v = cp[f[1]]; break;
case 'bool': v = cp[f[1]] ? 'true' : 'false'; break;
}
if (v !== undefined) o[o.length] = (W(f[0], v));
}); /* TODO: HeadingPairs, TitlesOfParts */
o[o.length] = (W('HeadingPairs', W('vt:vector', W('vt:variant', '<vt:lpstr>Worksheets</vt:lpstr>') + W('vt:variant', W('vt:i4', String(cp.Worksheets))), { size: 2, baseType: "variant" })));
o[o.length] = (W('TitlesOfParts', W('vt:vector', cp.SheetNames.map(function (s) { return "<vt:lpstr>" + s + "</vt:lpstr>"; }).join(""), { size: cp.Worksheets, baseType: "lpstr" })));
if (o.length > 2) { o[o.length] = ('</Properties>'); o[1] = o[1].replace("/>", ">"); }
return o.join("");
}
/* 15.2.12.2 Custom File Properties Part */
XMLNS.CUST_PROPS = "http://schemas.openxmlformats.org/officeDocument/2006/custom-properties";
RELS.CUST_PROPS = 'http://schemas.openxmlformats.org/officeDocument/2006/relationships/custom-properties'; var custregex = /<[^>]+>[^<]*/g;
function parse_cust_props(data, opts) {
var p = {}, name;
var m = data.match(custregex);
if (m) for (var i = 0; i != m.length; ++i) {
var x = m[i], y = parsexmltag(x);
switch (y[0]) {
case '<?xml': break;
case '<Properties':
if (y.xmlns !== XMLNS.CUST_PROPS) throw "unrecognized xmlns " + y.xmlns;
if (y.xmlnsvt && y.xmlnsvt !== XMLNS.vt) throw "unrecognized vt " + y.xmlnsvt;
break;
case '<property': name = y.name; break;
case '</property>': name = null; break;
default: if (x.indexOf('<vt:') === 0) {
var toks = x.split('>');
var type = toks[0].substring(4), text = toks[1];
/* 22.4.2.32 (CT_Variant). Omit the binary types from 22.4 (Variant Types) */
switch (type) {
case 'lpstr': case 'lpwstr': case 'bstr': case 'lpwstr':
p[name] = unescapexml(text);
break;
case 'bool':
p[name] = parsexmlbool(text, '<vt:bool>');
break;
case 'i1': case 'i2': case 'i4': case 'i8': case 'int': case 'uint':
p[name] = parseInt(text, 10);
break;
case 'r4': case 'r8': case 'decimal':
p[name] = parseFloat(text);
break;
case 'filetime': case 'date':
p[name] = new Date(text);
break;
case 'cy': case 'error':
p[name] = unescapexml(text);
break;
default:
if (typeof console !== 'undefined') console.warn('Unexpected', x, type, toks);
}
} else if (x.substr(0, 2) === "</") {
} else if (opts.WTF) throw new Error(x);
}
}
return p;
} var CUST_PROPS_XML_ROOT = writextag('Properties', null, {
'xmlns': XMLNS.CUST_PROPS,
'xmlns:vt': XMLNS.vt
}); function write_cust_props(cp, opts) {
var o = [XML_HEADER, CUST_PROPS_XML_ROOT];
if (!cp) return o.join("");
var pid = 1;
keys(cp).forEach(function custprop(k) {
++pid;
o[o.length] = (writextag('property', write_vt(cp[k]), {
'fmtid': '{D5CDD505-2E9C-101B-9397-08002B2CF9AE}',
'pid': pid,
'name': k
}));
});
if (o.length > 2) { o[o.length] = '</Properties>'; o[1] = o[1].replace("/>", ">"); }
return o.join("");
}
function xlml_set_prop(Props, tag, val) {
/* TODO: Normalize the properties */
switch (tag) {
case 'Description': tag = 'Comments'; break;
}
Props[tag] = val;
} /* [MS-DTYP] 2.3.3 FILETIME */
/* [MS-OLEDS] 2.1.3 FILETIME (Packet Version) */
/* [MS-OLEPS] 2.8 FILETIME (Packet Version) */
function parse_FILETIME(blob) {
var dwLowDateTime = blob.read_shift(4), dwHighDateTime = blob.read_shift(4);
return new Date(((dwHighDateTime / 1e7 * Math.pow(2, 32) + dwLowDateTime / 1e7) - 11644473600) * 1000).toISOString().replace(/\.000/, "");
} /* [MS-OSHARED] 2.3.3.1.4 Lpstr */
function parse_lpstr(blob, type, pad) {
var str = blob.read_shift(0, 'lpstr');
if (pad) blob.l += (4 - ((str.length + 1) & 3)) & 3;
return str;
} /* [MS-OSHARED] 2.3.3.1.6 Lpwstr */
function parse_lpwstr(blob, type, pad) {
var str = blob.read_shift(0, 'lpwstr');
if (pad) blob.l += (4 - ((str.length + 1) & 3)) & 3;
return str;
} /* [MS-OSHARED] 2.3.3.1.11 VtString */
/* [MS-OSHARED] 2.3.3.1.12 VtUnalignedString */
function parse_VtStringBase(blob, stringType, pad) {
if (stringType === 0x1F /*VT_LPWSTR*/) return parse_lpwstr(blob);
return parse_lpstr(blob, stringType, pad);
} function parse_VtString(blob, t, pad) { return parse_VtStringBase(blob, t, pad === false ? 0 : 4); }
function parse_VtUnalignedString(blob, t) { if (!t) throw new Error("dafuq?"); return parse_VtStringBase(blob, t, 0); } /* [MS-OSHARED] 2.3.3.1.9 VtVecUnalignedLpstrValue */
function parse_VtVecUnalignedLpstrValue(blob) {
var length = blob.read_shift(4);
var ret = [];
for (var i = 0; i != length; ++i) ret[i] = blob.read_shift(0, 'lpstr');
return ret;
} /* [MS-OSHARED] 2.3.3.1.10 VtVecUnalignedLpstr */
function parse_VtVecUnalignedLpstr(blob) {
return parse_VtVecUnalignedLpstrValue(blob);
} /* [MS-OSHARED] 2.3.3.1.13 VtHeadingPair */
function parse_VtHeadingPair(blob) {
var headingString = parse_TypedPropertyValue(blob, VT_USTR);
var headerParts = parse_TypedPropertyValue(blob, VT_I4);
return [headingString, headerParts];
} /* [MS-OSHARED] 2.3.3.1.14 VtVecHeadingPairValue */
function parse_VtVecHeadingPairValue(blob) {
var cElements = blob.read_shift(4);
var out = [];
for (var i = 0; i != cElements / 2; ++i) out.push(parse_VtHeadingPair(blob));
return out;
} /* [MS-OSHARED] 2.3.3.1.15 VtVecHeadingPair */
function parse_VtVecHeadingPair(blob) {
// NOTE: When invoked, wType & padding were already consumed
return parse_VtVecHeadingPairValue(blob);
} /* [MS-OLEPS] 2.18.1 Dictionary (uses 2.17, 2.16) */
function parse_dictionary(blob, CodePage) {
var cnt = blob.read_shift(4);
var dict = {};
for (var j = 0; j != cnt; ++j) {
var pid = blob.read_shift(4);
var len = blob.read_shift(4);
dict[pid] = blob.read_shift(len, (CodePage === 0x4B0 ? 'utf16le' : 'utf8')).replace(chr0, '').replace(chr1, '!');
}
if (blob.l & 3) blob.l = (blob.l >> 2 + 1) << 2;
return dict;
} /* [MS-OLEPS] 2.9 BLOB */
function parse_BLOB(blob) {
var size = blob.read_shift(4);
var bytes = blob.slice(blob.l, blob.l + size);
if (size & 3 > 0) blob.l += (4 - (size & 3)) & 3;
return bytes;
} /* [MS-OLEPS] 2.11 ClipboardData */
function parse_ClipboardData(blob) {
// TODO
var o = {};
o.Size = blob.read_shift(4);
//o.Format = blob.read_shift(4);
blob.l += o.Size;
return o;
} /* [MS-OLEPS] 2.14 Vector and Array Property Types */
function parse_VtVector(blob, cb) {
/* [MS-OLEPS] 2.14.2 VectorHeader */
/* var Length = blob.read_shift(4);
var o = [];
for(var i = 0; i != Length; ++i) {
o.push(cb(blob));
}
return o;*/
} /* [MS-OLEPS] 2.15 TypedPropertyValue */
function parse_TypedPropertyValue(blob, type, _opts) {
var t = blob.read_shift(2), ret, opts = _opts || {};
blob.l += 2;
if (type !== VT_VARIANT)
if (t !== type && VT_CUSTOM.indexOf(type) === -1) throw new Error('Expected type ' + type + ' saw ' + t);
switch (type === VT_VARIANT ? t : type) {
case 0x02 /*VT_I2*/: ret = blob.read_shift(2, 'i'); if (!opts.raw) blob.l += 2; return ret;
case 0x03 /*VT_I4*/: ret = blob.read_shift(4, 'i'); return ret;
case 0x0B /*VT_BOOL*/: return blob.read_shift(4) !== 0x0;
case 0x13 /*VT_UI4*/: ret = blob.read_shift(4); return ret;
case 0x1E /*VT_LPSTR*/: return parse_lpstr(blob, t, 4).replace(chr0, '');
case 0x1F /*VT_LPWSTR*/: return parse_lpwstr(blob);
case 0x40 /*VT_FILETIME*/: return parse_FILETIME(blob);
case 0x41 /*VT_BLOB*/: return parse_BLOB(blob);
case 0x47 /*VT_CF*/: return parse_ClipboardData(blob);
case 0x50 /*VT_STRING*/: return parse_VtString(blob, t, !opts.raw && 4).replace(chr0, '');
case 0x51 /*VT_USTR*/: return parse_VtUnalignedString(blob, t, 4).replace(chr0, '');
case 0x100C /*VT_VECTOR|VT_VARIANT*/: return parse_VtVecHeadingPair(blob);
case 0x101E /*VT_LPSTR*/: return parse_VtVecUnalignedLpstr(blob);
default: throw new Error("TypedPropertyValue unrecognized type " + type + " " + t);
}
}
/* [MS-OLEPS] 2.14.2 VectorHeader */
/*function parse_VTVectorVariant(blob) {
var Length = blob.read_shift(4); if(Length & 1 !== 0) throw new Error("VectorHeader Length=" + Length + " must be even");
var o = [];
for(var i = 0; i != Length; ++i) {
o.push(parse_TypedPropertyValue(blob, VT_VARIANT));
}
return o;
}*/ /* [MS-OLEPS] 2.20 PropertySet */
function parse_PropertySet(blob, PIDSI) {
var start_addr = blob.l;
var size = blob.read_shift(4);
var NumProps = blob.read_shift(4);
var Props = [], i = 0;
var CodePage = 0;
var Dictionary = -1, DictObj;
for (i = 0; i != NumProps; ++i) {
var PropID = blob.read_shift(4);
var Offset = blob.read_shift(4);
Props[i] = [PropID, Offset + start_addr];
}
var PropH = {};
for (i = 0; i != NumProps; ++i) {
if (blob.l !== Props[i][1]) {
var fail = true;
if (i > 0 && PIDSI) switch (PIDSI[Props[i - 1][0]].t) {
case 0x02 /*VT_I2*/: if (blob.l + 2 === Props[i][1]) { blob.l += 2; fail = false; } break;
case 0x50 /*VT_STRING*/: if (blob.l <= Props[i][1]) { blob.l = Props[i][1]; fail = false; } break;
case 0x100C /*VT_VECTOR|VT_VARIANT*/: if (blob.l <= Props[i][1]) { blob.l = Props[i][1]; fail = false; } break;
}
if (!PIDSI && blob.l <= Props[i][1]) { fail = false; blob.l = Props[i][1]; }
if (fail) throw new Error("Read Error: Expected address " + Props[i][1] + ' at ' + blob.l + ' :' + i);
}
if (PIDSI) {
var piddsi = PIDSI[Props[i][0]];
PropH[piddsi.n] = parse_TypedPropertyValue(blob, piddsi.t, { raw: true });
if (piddsi.p === 'version') PropH[piddsi.n] = String(PropH[piddsi.n] >> 16) + "." + String(PropH[piddsi.n] & 0xFFFF);
if (piddsi.n == "CodePage") switch (PropH[piddsi.n]) {
case 0: PropH[piddsi.n] = 1252;
/* falls through */
case 10000: // OSX Roman
case 1252: // Windows Latin case 874: // SB Windows Thai
case 1250: // SB Windows Central Europe
case 1251: // SB Windows Cyrillic
case 1253: // SB Windows Greek
case 1254: // SB Windows Turkish
case 1255: // SB Windows Hebrew
case 1256: // SB Windows Arabic
case 1257: // SB Windows Baltic
case 1258: // SB Windows Vietnam case 932: // DB Windows Japanese Shift-JIS
case 936: // DB Windows Simplified Chinese GBK
case 949: // DB Windows Korean
case 950: // DB Windows Traditional Chinese Big5 case 1200: // UTF16LE
case 1201: // UTF16BE
case 65000: case -536: // UTF-7
case 65001: case -535: // UTF-8
set_cp(CodePage = PropH[piddsi.n]); break;
default: throw new Error("Unsupported CodePage: " + PropH[piddsi.n]);
}
} else {
if (Props[i][0] === 0x1) {
CodePage = PropH.CodePage = parse_TypedPropertyValue(blob, VT_I2);
set_cp(CodePage);
if (Dictionary !== -1) {
var oldpos = blob.l;
blob.l = Props[Dictionary][1];
DictObj = parse_dictionary(blob, CodePage);
blob.l = oldpos;
}
} else if (Props[i][0] === 0) {
if (CodePage === 0) { Dictionary = i; blob.l = Props[i + 1][1]; continue; }
DictObj = parse_dictionary(blob, CodePage);
} else {
var name = DictObj[Props[i][0]];
var val;
/* [MS-OSHARED] 2.3.3.2.3.1.2 + PROPVARIANT */
switch (blob[blob.l]) {
case 0x41 /*VT_BLOB*/: blob.l += 4; val = parse_BLOB(blob); break;
case 0x1E /*VT_LPSTR*/: blob.l += 4; val = parse_VtString(blob, blob[blob.l - 4]); break;
case 0x1F /*VT_LPWSTR*/: blob.l += 4; val = parse_VtString(blob, blob[blob.l - 4]); break;
case 0x03 /*VT_I4*/: blob.l += 4; val = blob.read_shift(4, 'i'); break;
case 0x13 /*VT_UI4*/: blob.l += 4; val = blob.read_shift(4); break;
case 0x05 /*VT_R8*/: blob.l += 4; val = blob.read_shift(8, 'f'); break;
case 0x0B /*VT_BOOL*/: blob.l += 4; val = parsebool(blob, 4); break;
case 0x40 /*VT_FILETIME*/: blob.l += 4; val = new Date(parse_FILETIME(blob)); break;
default: throw new Error("unparsed value: " + blob[blob.l]);
}
PropH[name] = val;
}
}
}
blob.l = start_addr + size; /* step ahead to skip padding */
return PropH;
} /* [MS-OLEPS] 2.21 PropertySetStream */
function parse_PropertySetStream(file, PIDSI) {
var blob = file.content;
prep_blob(blob, 0); var NumSets, FMTID0, FMTID1, Offset0, Offset1;
blob.chk('feff', 'Byte Order: '); var vers = blob.read_shift(2); // TODO: check version
var SystemIdentifier = blob.read_shift(4);
blob.chk(CFB.utils.consts.HEADER_CLSID, 'CLSID: ');
NumSets = blob.read_shift(4);
if (NumSets !== 1 && NumSets !== 2) throw "Unrecognized #Sets: " + NumSets;
FMTID0 = blob.read_shift(16); Offset0 = blob.read_shift(4); if (NumSets === 1 && Offset0 !== blob.l) throw "Length mismatch";
else if (NumSets === 2) { FMTID1 = blob.read_shift(16); Offset1 = blob.read_shift(4); }
var PSet0 = parse_PropertySet(blob, PIDSI); var rval = { SystemIdentifier: SystemIdentifier };
for (var y in PSet0) rval[y] = PSet0[y];
//rval.blob = blob;
rval.FMTID = FMTID0;
//rval.PSet0 = PSet0;
if (NumSets === 1) return rval;
if (blob.l !== Offset1) throw "Length mismatch 2: " + blob.l + " !== " + Offset1;
var PSet1;
try { PSet1 = parse_PropertySet(blob, null); } catch (e) { }
for (y in PSet1) rval[y] = PSet1[y];
rval.FMTID = [FMTID0, FMTID1]; // TODO: verify FMTID0/1
return rval;
} function parsenoop2(blob, length) { blob.read_shift(length); return null; } function parslurp(blob, length, cb) {
var arr = [], target = blob.l + length;
while (blob.l < target) arr.push(cb(blob, target - blob.l));
if (target !== blob.l) throw new Error("Slurp error");
return arr;
} function parslurp2(blob, length, cb) {
var arr = [], target = blob.l + length, len = blob.read_shift(2);
while (len-- !== 0) arr.push(cb(blob, target - blob.l));
if (target !== blob.l) throw new Error("Slurp error");
return arr;
} function parsebool(blob, length) { return blob.read_shift(length) === 0x1; } function parseuint16(blob) { return blob.read_shift(2, 'u'); }
function parseuint16a(blob, length) { return parslurp(blob, length, parseuint16); } /* --- 2.5 Structures --- */ /* [MS-XLS] 2.5.14 Boolean */
var parse_Boolean = parsebool; /* [MS-XLS] 2.5.10 Bes (boolean or error) */
function parse_Bes(blob) {
var v = blob.read_shift(1), t = blob.read_shift(1);
return t === 0x01 ? v : v === 0x01;
} /* [MS-XLS] 2.5.240 ShortXLUnicodeString */
function parse_ShortXLUnicodeString(blob, length, opts) {
var cch = blob.read_shift(1);
var width = 1, encoding = 'sbcs-cont';
var cp = current_codepage;
if (opts && opts.biff >= 8) current_codepage = 1200;
if (opts === undefined || opts.biff !== 5) {
var fHighByte = blob.read_shift(1);
if (fHighByte) { width = 2; encoding = 'dbcs-cont'; }
}
var o = cch ? blob.read_shift(cch, encoding) : "";
current_codepage = cp;
return o;
} /* 2.5.293 XLUnicodeRichExtendedString */
function parse_XLUnicodeRichExtendedString(blob) {
var cp = current_codepage;
current_codepage = 1200;
var cch = blob.read_shift(2), flags = blob.read_shift(1);
var fHighByte = flags & 0x1, fExtSt = flags & 0x4, fRichSt = flags & 0x8;
var width = 1 + (flags & 0x1); // 0x0 -> utf8, 0x1 -> dbcs
var cRun, cbExtRst;
var z = {};
if (fRichSt) cRun = blob.read_shift(2);
if (fExtSt) cbExtRst = blob.read_shift(4);
var encoding = (flags & 0x1) ? 'dbcs-cont' : 'sbcs-cont';
var msg = cch === 0 ? "" : blob.read_shift(cch, encoding);
if (fRichSt) blob.l += 4 * cRun; //TODO: parse this
if (fExtSt) blob.l += cbExtRst; //TODO: parse this
z.t = msg;
if (!fRichSt) { z.raw = "<t>" + z.t + "</t>"; z.r = z.t; }
current_codepage = cp;
return z;
} /* 2.5.296 XLUnicodeStringNoCch */
function parse_XLUnicodeStringNoCch(blob, cch, opts) {
var retval;
var fHighByte = blob.read_shift(1);
if (fHighByte === 0) { retval = blob.read_shift(cch, 'sbcs-cont'); }
else { retval = blob.read_shift(cch, 'dbcs-cont'); }
return retval;
} /* 2.5.294 XLUnicodeString */
function parse_XLUnicodeString(blob, length, opts) {
var cch = blob.read_shift(opts !== undefined && opts.biff > 0 && opts.biff < 8 ? 1 : 2);
if (cch === 0) { blob.l++; return ""; }
return parse_XLUnicodeStringNoCch(blob, cch, opts);
}
/* BIFF5 override */
function parse_XLUnicodeString2(blob, length, opts) {
if (opts.biff !== 5 && opts.biff !== 2) return parse_XLUnicodeString(blob, length, opts);
var cch = blob.read_shift(1);
if (cch === 0) { blob.l++; return ""; }
return blob.read_shift(cch, 'sbcs-cont');
} /* [MS-XLS] 2.5.61 ControlInfo */
var parse_ControlInfo = parsenoop; /* [MS-OSHARED] 2.3.7.6 URLMoniker TODO: flags */
var parse_URLMoniker = function (blob, length) {
var len = blob.read_shift(4), start = blob.l;
var extra = false;
if (len > 24) {
/* look ahead */
blob.l += len - 24;
if (blob.read_shift(16) === "795881f43b1d7f48af2c825dc4852763") extra = true;
blob.l = start;
}
var url = blob.read_shift((extra ? len - 24 : len) >> 1, 'utf16le').replace(chr0, "");
if (extra) blob.l += 24;
return url;
}; /* [MS-OSHARED] 2.3.7.8 FileMoniker TODO: all fields */
var parse_FileMoniker = function (blob, length) {
var cAnti = blob.read_shift(2);
var ansiLength = blob.read_shift(4);
var ansiPath = blob.read_shift(ansiLength, 'cstr');
var endServer = blob.read_shift(2);
var versionNumber = blob.read_shift(2);
var cbUnicodePathSize = blob.read_shift(4);
if (cbUnicodePathSize === 0) return ansiPath.replace(/\\/g, "/");
var cbUnicodePathBytes = blob.read_shift(4);
var usKeyValue = blob.read_shift(2);
var unicodePath = blob.read_shift(cbUnicodePathBytes >> 1, 'utf16le').replace(chr0, "");
return unicodePath;
}; /* [MS-OSHARED] 2.3.7.2 HyperlinkMoniker TODO: all the monikers */
var parse_HyperlinkMoniker = function (blob, length) {
var clsid = blob.read_shift(16); length -= 16;
switch (clsid) {
case "e0c9ea79f9bace118c8200aa004ba90b": return parse_URLMoniker(blob, length);
case "0303000000000000c000000000000046": return parse_FileMoniker(blob, length);
default: throw "unsupported moniker " + clsid;
}
}; /* [MS-OSHARED] 2.3.7.9 HyperlinkString */
var parse_HyperlinkString = function (blob, length) {
var len = blob.read_shift(4);
var o = blob.read_shift(len, 'utf16le').replace(chr0, "");
return o;
}; /* [MS-OSHARED] 2.3.7.1 Hyperlink Object TODO: unify params with XLSX */
var parse_Hyperlink = function (blob, length) {
var end = blob.l + length;
var sVer = blob.read_shift(4);
if (sVer !== 2) throw new Error("Unrecognized streamVersion: " + sVer);
var flags = blob.read_shift(2);
blob.l += 2;
var displayName, targetFrameName, moniker, oleMoniker, location, guid, fileTime;
if (flags & 0x0010) displayName = parse_HyperlinkString(blob, end - blob.l);
if (flags & 0x0080) targetFrameName = parse_HyperlinkString(blob, end - blob.l);
if ((flags & 0x0101) === 0x0101) moniker = parse_HyperlinkString(blob, end - blob.l);
if ((flags & 0x0101) === 0x0001) oleMoniker = parse_HyperlinkMoniker(blob, end - blob.l);
if (flags & 0x0008) location = parse_HyperlinkString(blob, end - blob.l);
if (flags & 0x0020) guid = blob.read_shift(16);
if (flags & 0x0040) fileTime = parse_FILETIME(blob, 8);
blob.l = end;
var target = (targetFrameName || moniker || oleMoniker);
if (location) target += "#" + location;
return { Target: target };
}; /* 2.5.178 LongRGBA */
function parse_LongRGBA(blob, length) { var r = blob.read_shift(1), g = blob.read_shift(1), b = blob.read_shift(1), a = blob.read_shift(1); return [r, g, b, a]; } /* 2.5.177 LongRGB */
function parse_LongRGB(blob, length) { var x = parse_LongRGBA(blob, length); x[3] = 0; return x; } /* --- MS-XLS --- */ /* 2.5.19 */
function parse_XLSCell(blob, length) {
var rw = blob.read_shift(2); // 0-indexed
var col = blob.read_shift(2);
var ixfe = blob.read_shift(2);
return { r: rw, c: col, ixfe: ixfe };
} /* 2.5.134 */
function parse_frtHeader(blob) {
var rt = blob.read_shift(2);
var flags = blob.read_shift(2); // TODO: parse these flags
blob.l += 8;
return { type: rt, flags: flags };
} function parse_OptXLUnicodeString(blob, length, opts) { return length === 0 ? "" : parse_XLUnicodeString2(blob, length, opts); } /* 2.5.158 */
var HIDEOBJENUM = ['SHOWALL', 'SHOWPLACEHOLDER', 'HIDEALL'];
var parse_HideObjEnum = parseuint16; /* 2.5.344 */
function parse_XTI(blob, length) {
var iSupBook = blob.read_shift(2), itabFirst = blob.read_shift(2, 'i'), itabLast = blob.read_shift(2, 'i');
return [iSupBook, itabFirst, itabLast];
} /* 2.5.218 */
function parse_RkRec(blob, length) {
var ixfe = blob.read_shift(2);
var RK = parse_RkNumber(blob);
//console.log("::", ixfe, RK,";;");
return [ixfe, RK];
} /* 2.5.1 */
function parse_AddinUdf(blob, length) {
blob.l += 4; length -= 4;
var l = blob.l + length;
var udfName = parse_ShortXLUnicodeString(blob, length);
var cb = blob.read_shift(2);
l -= blob.l;
if (cb !== l) throw "Malformed AddinUdf: padding = " + l + " != " + cb;
blob.l += cb;
return udfName;
} /* 2.5.209 TODO: Check sizes */
function parse_Ref8U(blob, length) {
var rwFirst = blob.read_shift(2);
var rwLast = blob.read_shift(2);
var colFirst = blob.read_shift(2);
var colLast = blob.read_shift(2);
return { s: { c: colFirst, r: rwFirst }, e: { c: colLast, r: rwLast } };
} /* 2.5.211 */
function parse_RefU(blob, length) {
var rwFirst = blob.read_shift(2);
var rwLast = blob.read_shift(2);
var colFirst = blob.read_shift(1);
var colLast = blob.read_shift(1);
return { s: { c: colFirst, r: rwFirst }, e: { c: colLast, r: rwLast } };
} /* 2.5.207 */
var parse_Ref = parse_RefU; /* 2.5.143 */
function parse_FtCmo(blob, length) {
blob.l += 4;
var ot = blob.read_shift(2);
var id = blob.read_shift(2);
var flags = blob.read_shift(2);
blob.l += 12;
return [id, ot, flags];
} /* 2.5.149 */
function parse_FtNts(blob, length) {
var out = {};
blob.l += 4;
blob.l += 16; // GUID TODO
out.fSharedNote = blob.read_shift(2);
blob.l += 4;
return out;
} /* 2.5.142 */
function parse_FtCf(blob, length) {
var out = {};
blob.l += 4;
blob.cf = blob.read_shift(2);
return out;
} /* 2.5.140 - 2.5.154 and friends */
var FtTab = {
0x15: parse_FtCmo,
0x13: parsenoop, /* FtLbsData */
0x12: function (blob, length) { blob.l += 12; }, /* FtCblsData */
0x11: function (blob, length) { blob.l += 8; }, /* FtRboData */
0x10: parsenoop, /* FtEdoData */
0x0F: parsenoop, /* FtGboData */
0x0D: parse_FtNts, /* FtNts */
0x0C: function (blob, length) { blob.l += 24; }, /* FtSbs */
0x0B: function (blob, length) { blob.l += 10; }, /* FtRbo */
0x0A: function (blob, length) { blob.l += 16; }, /* FtCbls */
0x09: parsenoop, /* FtPictFmla */
0x08: function (blob, length) { blob.l += 6; }, /* FtPioGrbit */
0x07: parse_FtCf, /* FtCf */
0x06: function (blob, length) { blob.l += 6; }, /* FtGmo */
0x04: parsenoop, /* FtMacro */
0x00: function (blob, length) { blob.l += 4; } /* FtEnding */
};
function parse_FtArray(blob, length, ot) {
var s = blob.l;
var fts = [];
while (blob.l < s + length) {
var ft = blob.read_shift(2);
blob.l -= 2;
try {
fts.push(FtTab[ft](blob, s + length - blob.l));
} catch (e) { blob.l = s + length; return fts; }
}
if (blob.l != s + length) blob.l = s + length; //throw "bad Object Ft-sequence";
return fts;
} /* 2.5.129 */
var parse_FontIndex = parseuint16; /* --- 2.4 Records --- */ /* 2.4.21 */
function parse_BOF(blob, length) {
var o = {};
o.BIFFVer = blob.read_shift(2); length -= 2;
switch (o.BIFFVer) {
case 0x0600: /* BIFF8 */
case 0x0500: /* BIFF5 */
case 0x0002: case 0x0007: /* BIFF2 */
break;
default: throw "Unexpected BIFF Ver " + o.BIFFVer;
}
blob.read_shift(length);
return o;
} /* 2.4.146 */
function parse_InterfaceHdr(blob, length) {
if (length === 0) return 0x04b0;
var q;
if ((q = blob.read_shift(2)) !== 0x04b0) throw 'InterfaceHdr codePage ' + q;
return 0x04b0;
} /* 2.4.349 */
function parse_WriteAccess(blob, length, opts) {
if (opts.enc) { blob.l += length; return ""; }
var l = blob.l;
// TODO: make sure XLUnicodeString doesnt overrun
var UserName = parse_XLUnicodeString(blob, 0, opts);
blob.read_shift(length + l - blob.l);
return UserName;
} /* 2.4.28 */
function parse_BoundSheet8(blob, length, opts) {
var pos = blob.read_shift(4);
var hidden = blob.read_shift(1) >> 6;
var dt = blob.read_shift(1);
switch (dt) {
case 0: dt = 'Worksheet'; break;
case 1: dt = 'Macrosheet'; break;
case 2: dt = 'Chartsheet'; break;
case 6: dt = 'VBAModule'; break;
}
var name = parse_ShortXLUnicodeString(blob, 0, opts);
if (name.length === 0) name = "Sheet1";
return { pos: pos, hs: hidden, dt: dt, name: name };
} /* 2.4.265 TODO */
function parse_SST(blob, length) {
var cnt = blob.read_shift(4);
var ucnt = blob.read_shift(4);
var strs = [];
for (var i = 0; i != ucnt; ++i) {
strs.push(parse_XLUnicodeRichExtendedString(blob));
}
strs.Count = cnt; strs.Unique = ucnt;
return strs;
} /* 2.4.107 */
function parse_ExtSST(blob, length) {
var extsst = {};
extsst.dsst = blob.read_shift(2);
blob.l += length - 2;
return extsst;
} /* 2.4.221 TODO*/
function parse_Row(blob, length) {
var rw = blob.read_shift(2), col = blob.read_shift(2), Col = blob.read_shift(2), rht = blob.read_shift(2);
blob.read_shift(4); // reserved(2), unused(2)
var flags = blob.read_shift(1); // various flags
blob.read_shift(1); // reserved
blob.read_shift(2); //ixfe, other flags
return { r: rw, c: col, cnt: Col - col };
} /* 2.4.125 */
function parse_ForceFullCalculation(blob, length) {
var header = parse_frtHeader(blob);
if (header.type != 0x08A3) throw "Invalid Future Record " + header.type;
var fullcalc = blob.read_shift(4);
return fullcalc !== 0x0;
} var parse_CompressPictures = parsenoop2; /* 2.4.55 Not interesting */ /* 2.4.215 rt */
function parse_RecalcId(blob, length) {
blob.read_shift(2);
return blob.read_shift(4);
} /* 2.4.87 */
function parse_DefaultRowHeight(blob, length) {
var f = blob.read_shift(2), miyRw;
miyRw = blob.read_shift(2); // flags & 0x02 -> hidden, else empty
var fl = { Unsynced: f & 1, DyZero: (f & 2) >> 1, ExAsc: (f & 4) >> 2, ExDsc: (f & 8) >> 3 };
return [fl, miyRw];
} /* 2.4.345 TODO */
function parse_Window1(blob, length) {
var xWn = blob.read_shift(2), yWn = blob.read_shift(2), dxWn = blob.read_shift(2), dyWn = blob.read_shift(2);
var flags = blob.read_shift(2), iTabCur = blob.read_shift(2), iTabFirst = blob.read_shift(2);
var ctabSel = blob.read_shift(2), wTabRatio = blob.read_shift(2);
return {
Pos: [xWn, yWn], Dim: [dxWn, dyWn], Flags: flags, CurTab: iTabCur,
FirstTab: iTabFirst, Selected: ctabSel, TabRatio: wTabRatio
};
} /* 2.4.122 TODO */
function parse_Font(blob, length, opts) {
blob.l += 14;
var name = parse_ShortXLUnicodeString(blob, 0, opts);
return name;
} /* 2.4.149 */
function parse_LabelSst(blob, length) {
var cell = parse_XLSCell(blob);
cell.isst = blob.read_shift(4);
return cell;
} /* 2.4.148 */
function parse_Label(blob, length, opts) {
var cell = parse_XLSCell(blob, 6);
var str = parse_XLUnicodeString(blob, length - 6, opts);
cell.val = str;
return cell;
} /* 2.4.126 Number Formats */
function parse_Format(blob, length, opts) {
var ifmt = blob.read_shift(2);
var fmtstr = parse_XLUnicodeString2(blob, 0, opts);
return [ifmt, fmtstr];
} /* 2.4.90 */
function parse_Dimensions(blob, length) {
var w = length === 10 ? 2 : 4;
var r = blob.read_shift(w), R = blob.read_shift(w),
c = blob.read_shift(2), C = blob.read_shift(2);
blob.l += 2;
return { s: { r: r, c: c }, e: { r: R, c: C } };
} /* 2.4.220 */
function parse_RK(blob, length) {
var rw = blob.read_shift(2), col = blob.read_shift(2);
var rkrec = parse_RkRec(blob);
return { r: rw, c: col, ixfe: rkrec[0], rknum: rkrec[1] };
} /* 2.4.175 */
function parse_MulRk(blob, length) {
var target = blob.l + length - 2;
var rw = blob.read_shift(2), col = blob.read_shift(2);
var rkrecs = [];
while (blob.l < target) rkrecs.push(parse_RkRec(blob));
if (blob.l !== target) throw "MulRK read error";
var lastcol = blob.read_shift(2);
if (rkrecs.length != lastcol - col + 1) throw "MulRK length mismatch";
return { r: rw, c: col, C: lastcol, rkrec: rkrecs };
} /* 2.5.20 2.5.249 TODO */
function parse_CellStyleXF(blob, length, style) {
var o = {};
var a = blob.read_shift(4), b = blob.read_shift(4);
var c = blob.read_shift(4), d = blob.read_shift(2);
o.patternType = XLSFillPattern[c >> 26];
o.icvFore = d & 0x7F;
o.icvBack = (d >> 7) & 0x7F;
return o;
}
function parse_CellXF(blob, length) { return parse_CellStyleXF(blob, length, 0); }
function parse_StyleXF(blob, length) { return parse_CellStyleXF(blob, length, 1); } /* 2.4.353 TODO: actually do this right */
function parse_XF(blob, length) {
var o = {};
o.ifnt = blob.read_shift(2); o.ifmt = blob.read_shift(2); o.flags = blob.read_shift(2);
o.fStyle = (o.flags >> 2) & 0x01;
length -= 6;
o.data = parse_CellStyleXF(blob, length, o.fStyle);
return o;
} /* 2.4.134 */
function parse_Guts(blob, length) {
blob.l += 4;
var out = [blob.read_shift(2), blob.read_shift(2)];
if (out[0] !== 0) out[0]--;
if (out[1] !== 0) out[1]--;
if (out[0] > 7 || out[1] > 7) throw "Bad Gutters: " + out;
return out;
} /* 2.4.24 */
function parse_BoolErr(blob, length) {
var cell = parse_XLSCell(blob, 6);
var val = parse_Bes(blob, 2);
cell.val = val;
cell.t = (val === true || val === false) ? 'b' : 'e';
return cell;
} /* 2.4.180 Number */
function parse_Number(blob, length) {
var cell = parse_XLSCell(blob, 6);
var xnum = parse_Xnum(blob, 8);
cell.val = xnum;
return cell;
} var parse_XLHeaderFooter = parse_OptXLUnicodeString; // TODO: parse 2.4.136 /* 2.4.271 */
function parse_SupBook(blob, length, opts) {
var end = blob.l + length;
var ctab = blob.read_shift(2);
var cch = blob.read_shift(2);
var virtPath;
if (cch >= 0x01 && cch <= 0xff) virtPath = parse_XLUnicodeStringNoCch(blob, cch);
var rgst = blob.read_shift(end - blob.l);
opts.sbcch = cch;
return [cch, ctab, virtPath, rgst];
} /* 2.4.105 TODO */
function parse_ExternName(blob, length, opts) {
var flags = blob.read_shift(2);
var body;
var o = {
fBuiltIn: flags & 0x01,
fWantAdvise: (flags >>> 1) & 0x01,
fWantPict: (flags >>> 2) & 0x01,
fOle: (flags >>> 3) & 0x01,
fOleLink: (flags >>> 4) & 0x01,
cf: (flags >>> 5) & 0x3FF,
fIcon: flags >>> 15 & 0x01
};
if (opts.sbcch === 0x3A01) body = parse_AddinUdf(blob, length - 2);
//else throw new Error("unsupported SupBook cch: " + opts.sbcch);
o.body = body || blob.read_shift(length - 2);
return o;
} /* 2.4.150 TODO */
function parse_Lbl(blob, length, opts) {
if (opts.biff < 8) return parse_Label(blob, length, opts);
var target = blob.l + length;
var flags = blob.read_shift(2);
var chKey = blob.read_shift(1);
var cch = blob.read_shift(1);
var cce = blob.read_shift(2);
blob.l += 2;
var itab = blob.read_shift(2);
blob.l += 4;
var name = parse_XLUnicodeStringNoCch(blob, cch, opts);
var rgce = parse_NameParsedFormula(blob, target - blob.l, opts, cce);
return {
chKey: chKey,
Name: name,
rgce: rgce
};
} /* 2.4.106 TODO: verify supbook manipulation */
function parse_ExternSheet(blob, length, opts) {
if (opts.biff < 8) return parse_ShortXLUnicodeString(blob, length, opts);
var o = parslurp2(blob, length, parse_XTI);
var oo = [];
if (opts.sbcch === 0x0401) {
for (var i = 0; i != o.length; ++i) oo.push(opts.snames[o[i][1]]);
return oo;
}
else return o;
} /* 2.4.260 */
function parse_ShrFmla(blob, length, opts) {
var ref = parse_RefU(blob, 6);
blob.l++;
var cUse = blob.read_shift(1);
length -= 8;
return [parse_SharedParsedFormula(blob, length, opts), cUse];
} /* 2.4.4 TODO */
function parse_Array(blob, length, opts) {
var ref = parse_Ref(blob, 6);
blob.l += 6; length -= 12; /* TODO: fAlwaysCalc */
return [ref, parse_ArrayParsedFormula(blob, length, opts, ref)];
} /* 2.4.173 */
function parse_MTRSettings(blob, length) {
var fMTREnabled = blob.read_shift(4) !== 0x00;
var fUserSetThreadCount = blob.read_shift(4) !== 0x00;
var cUserThreadCount = blob.read_shift(4);
return [fMTREnabled, fUserSetThreadCount, cUserThreadCount];
} /* 2.5.186 TODO: BIFF5 */
function parse_NoteSh(blob, length, opts) {
if (opts.biff < 8) return;
var row = blob.read_shift(2), col = blob.read_shift(2);
var flags = blob.read_shift(2), idObj = blob.read_shift(2);
var stAuthor = parse_XLUnicodeString2(blob, 0, opts);
if (opts.biff < 8) blob.read_shift(1);
return [{ r: row, c: col }, stAuthor, idObj, flags];
} /* 2.4.179 */
function parse_Note(blob, length, opts) {
/* TODO: Support revisions */
return parse_NoteSh(blob, length, opts);
} /* 2.4.168 */
function parse_MergeCells(blob, length) {
var merges = [];
var cmcs = blob.read_shift(2);
while (cmcs--) merges.push(parse_Ref8U(blob, length));
return merges;
} /* 2.4.181 TODO: parse all the things! */
function parse_Obj(blob, length) {
var cmo = parse_FtCmo(blob, 22); // id, ot, flags
var fts = parse_FtArray(blob, length - 22, cmo[1]);
return { cmo: cmo, ft: fts };
} /* 2.4.329 TODO: parse properly */
function parse_TxO(blob, length, opts) {
var s = blob.l;
try {
blob.l += 4;
var ot = (opts.lastobj || { cmo: [0, 0] }).cmo[1];
var controlInfo;
if ([0, 5, 7, 11, 12, 14].indexOf(ot) == -1) blob.l += 6;
else controlInfo = parse_ControlInfo(blob, 6, opts);
var cchText = blob.read_shift(2);
var cbRuns = blob.read_shift(2);
var ifntEmpty = parse_FontIndex(blob, 2);
var len = blob.read_shift(2);
blob.l += len;
//var fmla = parse_ObjFmla(blob, s + length - blob.l); var texts = "";
for (var i = 1; i < blob.lens.length - 1; ++i) {
if (blob.l - s != blob.lens[i]) throw "TxO: bad continue record";
var hdr = blob[blob.l];
var t = parse_XLUnicodeStringNoCch(blob, blob.lens[i + 1] - blob.lens[i] - 1);
texts += t;
if (texts.length >= (hdr ? cchText : 2 * cchText)) break;
}
if (texts.length !== cchText && texts.length !== cchText * 2) {
throw "cchText: " + cchText + " != " + texts.length;
} blob.l = s + length;
/* 2.5.272 TxORuns */
// var rgTxoRuns = [];
// for(var j = 0; j != cbRuns/8-1; ++j) blob.l += 8;
// var cchText2 = blob.read_shift(2);
// if(cchText2 !== cchText) throw "TxOLastRun mismatch: " + cchText2 + " " + cchText;
// blob.l += 6;
// if(s + length != blob.l) throw "TxO " + (s + length) + ", at " + blob.l;
return { t: texts };
} catch (e) { blob.l = s + length; return { t: texts || "" }; }
} /* 2.4.140 */
var parse_HLink = function (blob, length) {
var ref = parse_Ref8U(blob, 8);
blob.l += 16; /* CLSID */
var hlink = parse_Hyperlink(blob, length - 24);
return [ref, hlink];
}; /* 2.4.141 */
var parse_HLinkTooltip = function (blob, length) {
var end = blob.l + length;
blob.read_shift(2);
var ref = parse_Ref8U(blob, 8);
var wzTooltip = blob.read_shift((length - 10) / 2, 'dbcs-cont');
wzTooltip = wzTooltip.replace(chr0, "");
return [ref, wzTooltip];
}; /* 2.4.63 */
function parse_Country(blob, length) {
var o = [], d;
d = blob.read_shift(2); o[0] = CountryEnum[d] || d;
d = blob.read_shift(2); o[1] = CountryEnum[d] || d;
return o;
} /* 2.4.50 ClrtClient */
function parse_ClrtClient(blob, length) {
var ccv = blob.read_shift(2);
var o = [];
while (ccv-- > 0) o.push(parse_LongRGB(blob, 8));
return o;
} /* 2.4.188 */
function parse_Palette(blob, length) {
var ccv = blob.read_shift(2);
var o = [];
while (ccv-- > 0) o.push(parse_LongRGB(blob, 8));
return o;
} /* 2.4.354 */
function parse_XFCRC(blob, length) {
blob.l += 2;
var o = { cxfs: 0, crc: 0 };
o.cxfs = blob.read_shift(2);
o.crc = blob.read_shift(4);
return o;
} var parse_Style = parsenoop;
var parse_StyleExt = parsenoop; var parse_ColInfo = parsenoop; var parse_Window2 = parsenoop; var parse_Backup = parsebool; /* 2.4.14 */
var parse_Blank = parse_XLSCell; /* 2.4.20 Just the cell */
var parse_BottomMargin = parse_Xnum; /* 2.4.27 */
var parse_BuiltInFnGroupCount = parseuint16; /* 2.4.30 0x0E or 0x10 but excel 2011 generates 0x11? */
var parse_CalcCount = parseuint16; /* 2.4.31 #Iterations */
var parse_CalcDelta = parse_Xnum; /* 2.4.32 */
var parse_CalcIter = parsebool; /* 2.4.33 1=iterative calc */
var parse_CalcMode = parseuint16; /* 2.4.34 0=manual, 1=auto (def), 2=table */
var parse_CalcPrecision = parsebool; /* 2.4.35 */
var parse_CalcRefMode = parsenoop2; /* 2.4.36 */
var parse_CalcSaveRecalc = parsebool; /* 2.4.37 */
var parse_CodePage = parseuint16; /* 2.4.52 */
var parse_Compat12 = parsebool; /* 2.4.54 true = no compatibility check */
var parse_Date1904 = parsebool; /* 2.4.77 - 1=1904,0=1900 */
var parse_DefColWidth = parseuint16; /* 2.4.89 */
var parse_DSF = parsenoop2; /* 2.4.94 -- MUST be ignored */
var parse_EntExU2 = parsenoop2; /* 2.4.102 -- Explicitly says to ignore */
var parse_EOF = parsenoop2; /* 2.4.103 */
var parse_Excel9File = parsenoop2; /* 2.4.104 -- Optional and unused */
var parse_FeatHdr = parsenoop2; /* 2.4.112 */
var parse_FontX = parseuint16; /* 2.4.123 */
var parse_Footer = parse_XLHeaderFooter; /* 2.4.124 */
var parse_GridSet = parseuint16; /* 2.4.132, =1 */
var parse_HCenter = parsebool; /* 2.4.135 sheet centered horizontal on print */
var parse_Header = parse_XLHeaderFooter; /* 2.4.136 */
var parse_HideObj = parse_HideObjEnum; /* 2.4.139 */
var parse_InterfaceEnd = parsenoop2; /* 2.4.145 -- noop */
var parse_LeftMargin = parse_Xnum; /* 2.4.151 */
var parse_Mms = parsenoop2; /* 2.4.169 -- Explicitly says to ignore */
var parse_ObjProtect = parsebool; /* 2.4.183 -- must be 1 if present */
var parse_Password = parseuint16; /* 2.4.191 */
var parse_PrintGrid = parsebool; /* 2.4.202 */
var parse_PrintRowCol = parsebool; /* 2.4.203 */
var parse_PrintSize = parseuint16; /* 2.4.204 0:3 */
var parse_Prot4Rev = parsebool; /* 2.4.205 */
var parse_Prot4RevPass = parseuint16; /* 2.4.206 */
var parse_Protect = parsebool; /* 2.4.207 */
var parse_RefreshAll = parsebool; /* 2.4.217 -- must be 0 if not template */
var parse_RightMargin = parse_Xnum; /* 2.4.219 */
var parse_RRTabId = parseuint16a; /* 2.4.241 */
var parse_ScenarioProtect = parsebool; /* 2.4.245 */
var parse_Scl = parseuint16a; /* 2.4.247 num, den */
var parse_String = parse_XLUnicodeString; /* 2.4.268 */
var parse_SxBool = parsebool; /* 2.4.274 */
var parse_TopMargin = parse_Xnum; /* 2.4.328 */
var parse_UsesELFs = parsebool; /* 2.4.337 -- should be 0 */
var parse_VCenter = parsebool; /* 2.4.342 */
var parse_WinProtect = parsebool; /* 2.4.347 */
var parse_WriteProtect = parsenoop; /* 2.4.350 empty record */ /* ---- */
var parse_VerticalPageBreaks = parsenoop;
var parse_HorizontalPageBreaks = parsenoop;
var parse_Selection = parsenoop;
var parse_Continue = parsenoop;
var parse_Pane = parsenoop;
var parse_Pls = parsenoop;
var parse_DCon = parsenoop;
var parse_DConRef = parsenoop;
var parse_DConName = parsenoop;
var parse_XCT = parsenoop;
var parse_CRN = parsenoop;
var parse_FileSharing = parsenoop;
var parse_Uncalced = parsenoop;
var parse_Template = parsenoop;
var parse_Intl = parsenoop;
var parse_WsBool = parsenoop;
var parse_Sort = parsenoop;
var parse_Sync = parsenoop;
var parse_LPr = parsenoop;
var parse_DxGCol = parsenoop;
var parse_FnGroupName = parsenoop;
var parse_FilterMode = parsenoop;
var parse_AutoFilterInfo = parsenoop;
var parse_AutoFilter = parsenoop;
var parse_Setup = parsenoop;
var parse_ScenMan = parsenoop;
var parse_SCENARIO = parsenoop;
var parse_SxView = parsenoop;
var parse_Sxvd = parsenoop;
var parse_SXVI = parsenoop;
var parse_SxIvd = parsenoop;
var parse_SXLI = parsenoop;
var parse_SXPI = parsenoop;
var parse_DocRoute = parsenoop;
var parse_RecipName = parsenoop;
var parse_MulBlank = parsenoop;
var parse_SXDI = parsenoop;
var parse_SXDB = parsenoop;
var parse_SXFDB = parsenoop;
var parse_SXDBB = parsenoop;
var parse_SXNum = parsenoop;
var parse_SxErr = parsenoop;
var parse_SXInt = parsenoop;
var parse_SXString = parsenoop;
var parse_SXDtr = parsenoop;
var parse_SxNil = parsenoop;
var parse_SXTbl = parsenoop;
var parse_SXTBRGIITM = parsenoop;
var parse_SxTbpg = parsenoop;
var parse_ObProj = parsenoop;
var parse_SXStreamID = parsenoop;
var parse_DBCell = parsenoop;
var parse_SXRng = parsenoop;
var parse_SxIsxoper = parsenoop;
var parse_BookBool = parsenoop;
var parse_DbOrParamQry = parsenoop;
var parse_OleObjectSize = parsenoop;
var parse_SXVS = parsenoop;
var parse_BkHim = parsenoop;
var parse_MsoDrawingGroup = parsenoop;
var parse_MsoDrawing = parsenoop;
var parse_MsoDrawingSelection = parsenoop;
var parse_PhoneticInfo = parsenoop;
var parse_SxRule = parsenoop;
var parse_SXEx = parsenoop;
var parse_SxFilt = parsenoop;
var parse_SxDXF = parsenoop;
var parse_SxItm = parsenoop;
var parse_SxName = parsenoop;
var parse_SxSelect = parsenoop;
var parse_SXPair = parsenoop;
var parse_SxFmla = parsenoop;
var parse_SxFormat = parsenoop;
var parse_SXVDEx = parsenoop;
var parse_SXFormula = parsenoop;
var parse_SXDBEx = parsenoop;
var parse_RRDInsDel = parsenoop;
var parse_RRDHead = parsenoop;
var parse_RRDChgCell = parsenoop;
var parse_RRDRenSheet = parsenoop;
var parse_RRSort = parsenoop;
var parse_RRDMove = parsenoop;
var parse_RRFormat = parsenoop;
var parse_RRAutoFmt = parsenoop;
var parse_RRInsertSh = parsenoop;
var parse_RRDMoveBegin = parsenoop;
var parse_RRDMoveEnd = parsenoop;
var parse_RRDInsDelBegin = parsenoop;
var parse_RRDInsDelEnd = parsenoop;
var parse_RRDConflict = parsenoop;
var parse_RRDDefName = parsenoop;
var parse_RRDRstEtxp = parsenoop;
var parse_LRng = parsenoop;
var parse_CUsr = parsenoop;
var parse_CbUsr = parsenoop;
var parse_UsrInfo = parsenoop;
var parse_UsrExcl = parsenoop;
var parse_FileLock = parsenoop;
var parse_RRDInfo = parsenoop;
var parse_BCUsrs = parsenoop;
var parse_UsrChk = parsenoop;
var parse_UserBView = parsenoop;
var parse_UserSViewBegin = parsenoop; // overloaded
var parse_UserSViewEnd = parsenoop;
var parse_RRDUserView = parsenoop;
var parse_Qsi = parsenoop;
var parse_CondFmt = parsenoop;
var parse_CF = parsenoop;
var parse_DVal = parsenoop;
var parse_DConBin = parsenoop;
var parse_Lel = parsenoop;
var parse_XLSCodeName = parse_XLUnicodeString;
var parse_SXFDBType = parsenoop;
var parse_ObNoMacros = parsenoop;
var parse_Dv = parsenoop;
var parse_Index = parsenoop;
var parse_Table = parsenoop;
var parse_BigName = parsenoop;
var parse_ContinueBigName = parsenoop;
var parse_WebPub = parsenoop;
var parse_QsiSXTag = parsenoop;
var parse_DBQueryExt = parsenoop;
var parse_ExtString = parsenoop;
var parse_TxtQry = parsenoop;
var parse_Qsir = parsenoop;
var parse_Qsif = parsenoop;
var parse_RRDTQSIF = parsenoop;
var parse_OleDbConn = parsenoop;
var parse_WOpt = parsenoop;
var parse_SXViewEx = parsenoop;
var parse_SXTH = parsenoop;
var parse_SXPIEx = parsenoop;
var parse_SXVDTEx = parsenoop;
var parse_SXViewEx9 = parsenoop;
var parse_ContinueFrt = parsenoop;
var parse_RealTimeData = parsenoop;
var parse_ChartFrtInfo = parsenoop;
var parse_FrtWrapper = parsenoop;
var parse_StartBlock = parsenoop;
var parse_EndBlock = parsenoop;
var parse_StartObject = parsenoop;
var parse_EndObject = parsenoop;
var parse_CatLab = parsenoop;
var parse_YMult = parsenoop;
var parse_SXViewLink = parsenoop;
var parse_PivotChartBits = parsenoop;
var parse_FrtFontList = parsenoop;
var parse_SheetExt = parsenoop;
var parse_BookExt = parsenoop;
var parse_SXAddl = parsenoop;
var parse_CrErr = parsenoop;
var parse_HFPicture = parsenoop;
var parse_Feat = parsenoop;
var parse_DataLabExt = parsenoop;
var parse_DataLabExtContents = parsenoop;
var parse_CellWatch = parsenoop;
var parse_FeatHdr11 = parsenoop;
var parse_Feature11 = parsenoop;
var parse_DropDownObjIds = parsenoop;
var parse_ContinueFrt11 = parsenoop;
var parse_DConn = parsenoop;
var parse_List12 = parsenoop;
var parse_Feature12 = parsenoop;
var parse_CondFmt12 = parsenoop;
var parse_CF12 = parsenoop;
var parse_CFEx = parsenoop;
var parse_AutoFilter12 = parsenoop;
var parse_ContinueFrt12 = parsenoop;
var parse_MDTInfo = parsenoop;
var parse_MDXStr = parsenoop;
var parse_MDXTuple = parsenoop;
var parse_MDXSet = parsenoop;
var parse_MDXProp = parsenoop;
var parse_MDXKPI = parsenoop;
var parse_MDB = parsenoop;
var parse_PLV = parsenoop;
var parse_DXF = parsenoop;
var parse_TableStyles = parsenoop;
var parse_TableStyle = parsenoop;
var parse_TableStyleElement = parsenoop;
var parse_NamePublish = parsenoop;
var parse_NameCmt = parsenoop;
var parse_SortData = parsenoop;
var parse_GUIDTypeLib = parsenoop;
var parse_FnGrp12 = parsenoop;
var parse_NameFnGrp12 = parsenoop;
var parse_HeaderFooter = parsenoop;
var parse_CrtLayout12 = parsenoop;
var parse_CrtMlFrt = parsenoop;
var parse_CrtMlFrtContinue = parsenoop;
var parse_ShapePropsStream = parsenoop;
var parse_TextPropsStream = parsenoop;
var parse_RichTextStream = parsenoop;
var parse_CrtLayout12A = parsenoop;
var parse_Units = parsenoop;
var parse_Chart = parsenoop;
var parse_Series = parsenoop;
var parse_DataFormat = parsenoop;
var parse_LineFormat = parsenoop;
var parse_MarkerFormat = parsenoop;
var parse_AreaFormat = parsenoop;
var parse_PieFormat = parsenoop;
var parse_AttachedLabel = parsenoop;
var parse_SeriesText = parsenoop;
var parse_ChartFormat = parsenoop;
var parse_Legend = parsenoop;
var parse_SeriesList = parsenoop;
var parse_Bar = parsenoop;
var parse_Line = parsenoop;
var parse_Pie = parsenoop;
var parse_Area = parsenoop;
var parse_Scatter = parsenoop;
var parse_CrtLine = parsenoop;
var parse_Axis = parsenoop;
var parse_Tick = parsenoop;
var parse_ValueRange = parsenoop;
var parse_CatSerRange = parsenoop;
var parse_AxisLine = parsenoop;
var parse_CrtLink = parsenoop;
var parse_DefaultText = parsenoop;
var parse_Text = parsenoop;
var parse_ObjectLink = parsenoop;
var parse_Frame = parsenoop;
var parse_Begin = parsenoop;
var parse_End = parsenoop;
var parse_PlotArea = parsenoop;
var parse_Chart3d = parsenoop;
var parse_PicF = parsenoop;
var parse_DropBar = parsenoop;
var parse_Radar = parsenoop;
var parse_Surf = parsenoop;
var parse_RadarArea = parsenoop;
var parse_AxisParent = parsenoop;
var parse_LegendException = parsenoop;
var parse_ShtProps = parsenoop;
var parse_SerToCrt = parsenoop;
var parse_AxesUsed = parsenoop;
var parse_SBaseRef = parsenoop;
var parse_SerParent = parsenoop;
var parse_SerAuxTrend = parsenoop;
var parse_IFmtRecord = parsenoop;
var parse_Pos = parsenoop;
var parse_AlRuns = parsenoop;
var parse_BRAI = parsenoop;
var parse_SerAuxErrBar = parsenoop;
var parse_SerFmt = parsenoop;
var parse_Chart3DBarShape = parsenoop;
var parse_Fbi = parsenoop;
var parse_BopPop = parsenoop;
var parse_AxcExt = parsenoop;
var parse_Dat = parsenoop;
var parse_PlotGrowth = parsenoop;
var parse_SIIndex = parsenoop;
var parse_GelFrame = parsenoop;
var parse_BopPopCustom = parsenoop;
var parse_Fbi2 = parsenoop;
中部分代码
/* --- Specific to versions before BIFF8 --- */
function parse_BIFF5String(blob) {
var len = blob.read_shift(1);
return blob.read_shift(len, 'sbcs-cont');
} /* BIFF2_??? where ??? is the name from [XLS] */
function parse_BIFF2STR(blob, length, opts) {
var cell = parse_XLSCell(blob, 6);
++blob.l;
var str = parse_XLUnicodeString2(blob, length - 7, opts);
cell.val = str;
return cell;
} function parse_BIFF2NUM(blob, length, opts) {
var cell = parse_XLSCell(blob, 6);
++blob.l;
var num = parse_Xnum(blob, 8);
cell.val = num;
return cell;
} /* 18.4.1 charset to codepage mapping */
var CS2CP = {
0: 1252, /* ANSI */
1: 65001, /* DEFAULT */
2: 65001, /* SYMBOL */
77: 10000, /* MAC */
128: 932, /* SHIFTJIS */
129: 949, /* HANGUL */
130: 1361, /* JOHAB */
134: 936, /* GB2312 */
136: 950, /* CHINESEBIG5 */
161: 1253, /* GREEK */
162: 1254, /* TURKISH */
163: 1258, /* VIETNAMESE */
177: 1255, /* HEBREW */
178: 1256, /* ARABIC */
186: 1257, /* BALTIC */
204: 1251, /* RUSSIAN */
222: 874, /* THAI */
238: 1250, /* EASTEUROPE */
255: 1252, /* OEM */
69: 6969 /* MISC */
}; /* Parse a list of <r> tags */
var parse_rs = (function parse_rs_factory() {
var tregex = matchtag("t"), rpregex = matchtag("rPr"), rregex = /<r>/g, rend = /<\/r>/, nlregex = /\r\n/g;
/* 18.4.7 rPr CT_RPrElt */
var parse_rpr = function parse_rpr(rpr, intro, outro) {
var font = {}, cp = 65001;
var m = rpr.match(tagregex), i = 0;
if (m) for (; i != m.length; ++i) {
var y = parsexmltag(m[i]);
switch (y[0]) {
/* 18.8.12 condense CT_BooleanProperty */
/* ** not required . */
case '<condense': break;
/* 18.8.17 extend CT_BooleanProperty */
/* ** not required . */
case '<extend': break;
/* 18.8.36 shadow CT_BooleanProperty */
/* ** not required . */
case '<shadow':
/* falls through */
case '<shadow/>': break; /* 18.4.1 charset CT_IntProperty TODO */
case '<charset':
if (y.val == '1') break;
cp = CS2CP[parseInt(y.val, 10)];
break; /* 18.4.2 outline CT_BooleanProperty TODO */
case '<outline':
/* falls through */
case '<outline/>': break; /* 18.4.5 rFont CT_FontName */
case '<rFont': font.name = y.val; break; /* 18.4.11 sz CT_FontSize */
case '<sz': font.sz = y.val; break; /* 18.4.10 strike CT_BooleanProperty */
case '<strike':
if (!y.val) break;
/* falls through */
case '<strike/>': font.strike = 1; break;
case '</strike>': break; /* 18.4.13 u CT_UnderlineProperty */
case '<u':
if (!y.val) break;
/* falls through */
case '<u/>': font.u = 1; break;
case '</u>': break; /* 18.8.2 b */
case '<b':
if (!y.val) break;
/* falls through */
case '<b/>': font.b = 1; break;
case '</b>': break; /* 18.8.26 i */
case '<i':
if (!y.val) break;
/* falls through */
case '<i/>': font.i = 1; break;
case '</i>': break; /* 18.3.1.15 color CT_Color TODO: tint, theme, auto, indexed */
case '<color':
if (y.rgb) font.color = y.rgb.substr(2, 6);
break; /* 18.8.18 family ST_FontFamily */
case '<family': font.family = y.val; break; /* 18.4.14 vertAlign CT_VerticalAlignFontProperty TODO */
case '<vertAlign': break; /* 18.8.35 scheme CT_FontScheme TODO */
case '<scheme': break; default:
if (y[0].charCodeAt(1) !== 47) throw 'Unrecognized rich format ' + y[0];
}
}
/* TODO: These should be generated styles, not inline */
var style = [];
if (font.b) style.push("font-weight: bold;");
if (font.i) style.push("font-style: italic;");
intro.push('<span style="' + style.join("") + '">');
outro.push("</span>");
return cp;
}; /* 18.4.4 r CT_RElt */
function parse_r(r) {
var terms = [[], "", []];
/* 18.4.12 t ST_Xstring */
var t = r.match(tregex), cp = 65001;
if (!isval(t)) return "";
terms[1] = t[1]; var rpr = r.match(rpregex);
if (isval(rpr)) cp = parse_rpr(rpr[1], terms[0], terms[2]); return terms[0].join("") + terms[1].replace(nlregex, '<br/>') + terms[2].join("");
}
return function parse_rs(rs) {
return rs.replace(rregex, "").split(rend).map(parse_r).join("");
};
})(); /* 18.4.8 si CT_Rst */
var sitregex = /<t[^>]*>([^<]*)<\/t>/g, sirregex = /<r>/;
function parse_si(x, opts) {
var html = opts ? opts.cellHTML : true;
var z = {};
if (!x) return null;
var y;
/* 18.4.12 t ST_Xstring (Plaintext String) */
if (x.charCodeAt(1) === 116) {
z.t = utf8read(unescapexml(x.substr(x.indexOf(">") + 1).split(/<\/t>/)[0]));
z.r = x;
if (html) z.h = z.t;
}
/* 18.4.4 r CT_RElt (Rich Text Run) */
else if ((y = x.match(sirregex))) {
z.r = x;
z.t = utf8read(unescapexml(x.match(sitregex).join("").replace(tagregex, "")));
if (html) z.h = parse_rs(x);
}
/* 18.4.3 phoneticPr CT_PhoneticPr (TODO: needed for Asian support) */
/* 18.4.6 rPh CT_PhoneticRun (TODO: needed for Asian support) */
return z;
} /* 18.4 Shared String Table */
var sstr0 = /<sst([^>]*)>([\s\S]*)<\/sst>/;
var sstr1 = /<(?:si|sstItem)>/g;
var sstr2 = /<\/(?:si|sstItem)>/;
function parse_sst_xml(data, opts) {
var s = [], ss;
/* 18.4.9 sst CT_Sst */
var sst = data.match(sstr0);
if (isval(sst)) {
ss = sst[2].replace(sstr1, "").split(sstr2);
for (var i = 0; i != ss.length; ++i) {
var o = parse_si(ss[i], opts);
if (o != null) s[s.length] = o;
}
sst = parsexmltag(sst[1]); s.Count = sst.count; s.Unique = sst.uniqueCount;
}
return s;
} RELS.SST = "http://schemas.openxmlformats.org/officeDocument/2006/relationships/sharedStrings";
var straywsregex = /^\s|\s$|[\t\n\r]/;
function write_sst_xml(sst, opts) {
if (!opts.bookSST) return "";
var o = [XML_HEADER];
o[o.length] = (writextag('sst', null, {
xmlns: XMLNS.main[0],
count: sst.Count,
uniqueCount: sst.Unique
}));
for (var i = 0; i != sst.length; ++i) {
if (sst[i] == null) continue;
var s = sst[i];
var sitag = "<si>";
if (s.r) sitag += s.r;
else {
sitag += "<t";
if (s.t.match(straywsregex)) sitag += ' xml:space="preserve"';
sitag += ">" + escapexml(s.t) + "</t>";
}
sitag += "</si>";
o[o.length] = (sitag);
}
if (o.length > 2) { o[o.length] = ('</sst>'); o[1] = o[1].replace("/>", ">"); }
return o.join("");
}
/* [MS-XLSB] 2.4.219 BrtBeginSst */
function parse_BrtBeginSst(data, length) {
return [data.read_shift(4), data.read_shift(4)];
} /* [MS-XLSB] 2.1.7.45 Shared Strings */
function parse_sst_bin(data, opts) {
var s = [];
var pass = false;
recordhopper(data, function hopper_sst(val, R, RT) {
switch (R.n) {
case 'BrtBeginSst': s.Count = val[0]; s.Unique = val[1]; break;
case 'BrtSSTItem': s.push(val); break;
case 'BrtEndSst': return true;
/* TODO: produce a test case with a future record */
case 'BrtFRTBegin': pass = true; break;
case 'BrtFRTEnd': pass = false; break;
default: if (!pass || opts.WTF) throw new Error("Unexpected record " + RT + " " + R.n);
}
});
return s;
} function write_BrtBeginSst(sst, o) {
if (!o) o = new_buf(8);
o.write_shift(4, sst.Count);
o.write_shift(4, sst.Unique);
return o;
} var write_BrtSSTItem = write_RichStr; function write_sst_bin(sst, opts) {
var ba = buf_array();
write_record(ba, "BrtBeginSst", write_BrtBeginSst(sst));
for (var i = 0; i < sst.length; ++i) write_record(ba, "BrtSSTItem", write_BrtSSTItem(sst[i]));
write_record(ba, "BrtEndSst");
return ba.end();
}
function _JS2ANSI(str) { if (typeof cptable !== 'undefined') return cptable.utils.encode(1252, str); return str.split("").map(function (x) { return x.charCodeAt(0); }); } /* [MS-OFFCRYPTO] 2.1.4 Version */
function parse_Version(blob, length) {
var o = {};
o.Major = blob.read_shift(2);
o.Minor = blob.read_shift(2);
return o;
}
/* [MS-OFFCRYPTO] 2.3.2 Encryption Header */
function parse_EncryptionHeader(blob, length) {
var o = {};
o.Flags = blob.read_shift(4); // Check if SizeExtra is 0x00000000
var tmp = blob.read_shift(4);
if (tmp !== 0) throw 'Unrecognized SizeExtra: ' + tmp; o.AlgID = blob.read_shift(4);
switch (o.AlgID) {
case 0: case 0x6801: case 0x660E: case 0x660F: case 0x6610: break;
default: throw 'Unrecognized encryption algorithm: ' + o.AlgID;
}
parsenoop(blob, length - 12);
return o;
} /* [MS-OFFCRYPTO] 2.3.3 Encryption Verifier */
function parse_EncryptionVerifier(blob, length) {
return parsenoop(blob, length);
}
/* [MS-OFFCRYPTO] 2.3.5.1 RC4 CryptoAPI Encryption Header */
function parse_RC4CryptoHeader(blob, length) {
var o = {};
var vers = o.EncryptionVersionInfo = parse_Version(blob, 4); length -= 4;
if (vers.Minor != 2) throw 'unrecognized minor version code: ' + vers.Minor;
if (vers.Major > 4 || vers.Major < 2) throw 'unrecognized major version code: ' + vers.Major;
o.Flags = blob.read_shift(4); length -= 4;
var sz = blob.read_shift(4); length -= 4;
o.EncryptionHeader = parse_EncryptionHeader(blob, sz); length -= sz;
o.EncryptionVerifier = parse_EncryptionVerifier(blob, length);
return o;
}
/* [MS-OFFCRYPTO] 2.3.6.1 RC4 Encryption Header */
function parse_RC4Header(blob, length) {
var o = {};
var vers = o.EncryptionVersionInfo = parse_Version(blob, 4); length -= 4;
if (vers.Major != 1 || vers.Minor != 1) throw 'unrecognized version code ' + vers.Major + ' : ' + vers.Minor;
o.Salt = blob.read_shift(16);
o.EncryptedVerifier = blob.read_shift(16);
o.EncryptedVerifierHash = blob.read_shift(16);
return o;
} /* [MS-OFFCRYPTO] 2.3.7.1 Binary Document Password Verifier Derivation */
function crypto_CreatePasswordVerifier_Method1(Password) {
var Verifier = 0x0000, PasswordArray;
var PasswordDecoded = _JS2ANSI(Password);
var len = PasswordDecoded.length + 1, i, PasswordByte;
var Intermediate1, Intermediate2, Intermediate3;
PasswordArray = new_raw_buf(len);
PasswordArray[0] = PasswordDecoded.length;
for (i = 1; i != len; ++i) PasswordArray[i] = PasswordDecoded[i - 1];
for (i = len - 1; i >= 0; --i) {
PasswordByte = PasswordArray[i];
Intermediate1 = ((Verifier & 0x4000) === 0x0000) ? 0 : 1;
Intermediate2 = (Verifier << 1) & 0x7FFF;
Intermediate3 = Intermediate1 | Intermediate2;
Verifier = Intermediate3 ^ PasswordByte;
}
return Verifier ^ 0xCE4B;
} /* [MS-OFFCRYPTO] 2.3.7.2 Binary Document XOR Array Initialization */
var crypto_CreateXorArray_Method1 = (function () {
var PadArray = [0xBB, 0xFF, 0xFF, 0xBA, 0xFF, 0xFF, 0xB9, 0x80, 0x00, 0xBE, 0x0F, 0x00, 0xBF, 0x0F, 0x00];
var InitialCode = [0xE1F0, 0x1D0F, 0xCC9C, 0x84C0, 0x110C, 0x0E10, 0xF1CE, 0x313E, 0x1872, 0xE139, 0xD40F, 0x84F9, 0x280C, 0xA96A, 0x4EC3];
var XorMatrix = [0xAEFC, 0x4DD9, 0x9BB2, 0x2745, 0x4E8A, 0x9D14, 0x2A09, 0x7B61, 0xF6C2, 0xFDA5, 0xEB6B, 0xC6F7, 0x9DCF, 0x2BBF, 0x4563, 0x8AC6, 0x05AD, 0x0B5A, 0x16B4, 0x2D68, 0x5AD0, 0x0375, 0x06EA, 0x0DD4, 0x1BA8, 0x3750, 0x6EA0, 0xDD40, 0xD849, 0xA0B3, 0x5147, 0xA28E, 0x553D, 0xAA7A, 0x44D5, 0x6F45, 0xDE8A, 0xAD35, 0x4A4B, 0x9496, 0x390D, 0x721A, 0xEB23, 0xC667, 0x9CEF, 0x29FF, 0x53FE, 0xA7FC, 0x5FD9, 0x47D3, 0x8FA6, 0x0F6D, 0x1EDA, 0x3DB4, 0x7B68, 0xF6D0, 0xB861, 0x60E3, 0xC1C6, 0x93AD, 0x377B, 0x6EF6, 0xDDEC, 0x45A0, 0x8B40, 0x06A1, 0x0D42, 0x1A84, 0x3508, 0x6A10, 0xAA51, 0x4483, 0x8906, 0x022D, 0x045A, 0x08B4, 0x1168, 0x76B4, 0xED68, 0xCAF1, 0x85C3, 0x1BA7, 0x374E, 0x6E9C, 0x3730, 0x6E60, 0xDCC0, 0xA9A1, 0x4363, 0x86C6, 0x1DAD, 0x3331, 0x6662, 0xCCC4, 0x89A9, 0x0373, 0x06E6, 0x0DCC, 0x1021, 0x2042, 0x4084, 0x8108, 0x1231, 0x2462, 0x48C4];
var Ror = function (Byte) { return ((Byte / 2) | (Byte * 128)) & 0xFF; };
var XorRor = function (byte1, byte2) { return Ror(byte1 ^ byte2); };
var CreateXorKey_Method1 = function (Password) {
var XorKey = InitialCode[Password.length - 1];
var CurrentElement = 0x68;
for (var i = Password.length - 1; i >= 0; --i) {
var Char = Password[i];
for (var j = 0; j != 7; ++j) {
if (Char & 0x40) XorKey ^= XorMatrix[CurrentElement];
Char *= 2; --CurrentElement;
}
}
return XorKey;
};
return function (password) {
var Password = _JS2ANSI(password);
var XorKey = CreateXorKey_Method1(Password);
var Index = Password.length;
var ObfuscationArray = new_raw_buf(16);
for (var i = 0; i != 16; ++i) ObfuscationArray[i] = 0x00;
var Temp, PasswordLastChar, PadIndex;
if ((Index & 1) === 1) {
Temp = XorKey >> 8;
ObfuscationArray[Index] = XorRor(PadArray[0], Temp);
--Index;
Temp = XorKey & 0xFF;
PasswordLastChar = Password[Password.length - 1];
ObfuscationArray[Index] = XorRor(PasswordLastChar, Temp);
}
while (Index > 0) {
--Index;
Temp = XorKey >> 8;
ObfuscationArray[Index] = XorRor(Password[Index], Temp);
--Index;
Temp = XorKey & 0xFF;
ObfuscationArray[Index] = XorRor(Password[Index], Temp);
}
Index = 15;
PadIndex = 15 - Password.length;
while (PadIndex > 0) {
Temp = XorKey >> 8;
ObfuscationArray[Index] = XorRor(PadArray[PadIndex], Temp);
--Index;
--PadIndex;
Temp = XorKey & 0xFF;
ObfuscationArray[Index] = XorRor(Password[Index], Temp);
--Index;
--PadIndex;
}
return ObfuscationArray;
};
})(); /* [MS-OFFCRYPTO] 2.3.7.3 Binary Document XOR Data Transformation Method 1 */
var crypto_DecryptData_Method1 = function (password, Data, XorArrayIndex, XorArray, O) {
/* If XorArray is set, use it; if O is not set, make changes in-place */
if (!O) O = Data;
if (!XorArray) XorArray = crypto_CreateXorArray_Method1(password);
var Index, Value;
for (Index = 0; Index != Data.length; ++Index) {
Value = Data[Index];
Value ^= XorArray[XorArrayIndex];
Value = ((Value >> 5) | (Value << 3)) & 0xFF;
O[Index] = Value;
++XorArrayIndex;
}
return [O, XorArrayIndex, XorArray];
}; var crypto_MakeXorDecryptor = function (password) {
var XorArrayIndex = 0, XorArray = crypto_CreateXorArray_Method1(password);
return function (Data) {
var O = crypto_DecryptData_Method1(null, Data, XorArrayIndex, XorArray);
XorArrayIndex = O[1];
return O[0];
};
}; /* 2.5.343 */
function parse_XORObfuscation(blob, length, opts, out) {
var o = { key: parseuint16(blob), verificationBytes: parseuint16(blob) };
if (opts.password) o.verifier = crypto_CreatePasswordVerifier_Method1(opts.password);
out.valid = o.verificationBytes === o.verifier;
if (out.valid) out.insitu_decrypt = crypto_MakeXorDecryptor(opts.password);
return o;
} /* 2.4.117 */
function parse_FilePassHeader(blob, length, oo) {
var o = oo || {}; o.Info = blob.read_shift(2); blob.l -= 2;
if (o.Info === 1) o.Data = parse_RC4Header(blob, length);
else o.Data = parse_RC4CryptoHeader(blob, length);
return o;
}
function parse_FilePass(blob, length, opts) {
var o = { Type: blob.read_shift(2) }; /* wEncryptionType */
if (o.Type) parse_FilePassHeader(blob, length - 2, o);
else parse_XORObfuscation(blob, length - 2, opts, o);
return o;
} function hex2RGB(h) {
var o = h.substr(h[0] === "#" ? 1 : 0, 6);
return [parseInt(o.substr(0, 2), 16), parseInt(o.substr(0, 2), 16), parseInt(o.substr(0, 2), 16)];
}
function rgb2Hex(rgb) {
for (var i = 0, o = 1; i != 3; ++i) o = o * 256 + (rgb[i] > 255 ? 255 : rgb[i] < 0 ? 0 : rgb[i]);
return o.toString(16).toUpperCase().substr(1);
} function rgb2HSL(rgb) {
var R = rgb[0] / 255, G = rgb[1] / 255, B = rgb[2] / 255;
var M = Math.max(R, G, B), m = Math.min(R, G, B), C = M - m;
if (C === 0) return [0, 0, R]; var H6 = 0, S = 0, L2 = (M + m);
S = C / (L2 > 1 ? 2 - L2 : L2);
switch (M) {
case R: H6 = ((G - B) / C + 6) % 6; break;
case G: H6 = ((B - R) / C + 2); break;
case B: H6 = ((R - G) / C + 4); break;
}
return [H6 / 6, S, L2 / 2];
} function hsl2RGB(hsl) {
var H = hsl[0], S = hsl[1], L = hsl[2];
var C = S * 2 * (L < 0.5 ? L : 1 - L), m = L - C / 2;
var rgb = [m, m, m], h6 = 6 * H; var X;
if (S !== 0) switch (h6 | 0) {
case 0: case 6: X = C * h6; rgb[0] += C; rgb[1] += X; break;
case 1: X = C * (2 - h6); rgb[0] += X; rgb[1] += C; break;
case 2: X = C * (h6 - 2); rgb[1] += C; rgb[2] += X; break;
case 3: X = C * (4 - h6); rgb[1] += X; rgb[2] += C; break;
case 4: X = C * (h6 - 4); rgb[2] += C; rgb[0] += X; break;
case 5: X = C * (6 - h6); rgb[2] += X; rgb[0] += C; break;
}
for (var i = 0; i != 3; ++i) rgb[i] = Math.round(rgb[i] * 255);
return rgb;
} /* 18.8.3 bgColor tint algorithm */
function rgb_tint(hex, tint) {
if (tint === 0) return hex;
var hsl = rgb2HSL(hex2RGB(hex));
if (tint < 0) hsl[2] = hsl[2] * (1 + tint);
else hsl[2] = 1 - (1 - hsl[2]) * (1 - tint);
return rgb2Hex(hsl2RGB(hsl));
} /* 18.3.1.13 width calculations */
var DEF_MDW = 7, MAX_MDW = 15, MIN_MDW = 1, MDW = DEF_MDW;
function width2px(width) { return ((width + ((128 / MDW) | 0) / 256) * MDW) | 0; }
function px2char(px) { return (((px - 5) / MDW * 100 + 0.5) | 0) / 100; }
function char2width(chr) { return (((chr * MDW + 5) / MDW * 256) | 0) / 256; }
function cycle_width(collw) { return char2width(px2char(width2px(collw))); }
function find_mdw(collw, coll) {
if (cycle_width(collw) != collw) {
for (MDW = DEF_MDW; MDW > MIN_MDW; --MDW) if (cycle_width(collw) === collw) break;
if (MDW === MIN_MDW) for (MDW = DEF_MDW + 1; MDW < MAX_MDW; ++MDW) if (cycle_width(collw) === collw) break;
if (MDW === MAX_MDW) MDW = DEF_MDW;
}
} /* [MS-EXSPXML3] 2.4.54 ST_enmPattern */
var XLMLPatternTypeMap = {
"None": "none",
"Solid": "solid",
"Gray50": "mediumGray",
"Gray75": "darkGray",
"Gray25": "lightGray",
"HorzStripe": "darkHorizontal",
"VertStripe": "darkVertical",
"ReverseDiagStripe": "darkDown",
"DiagStripe": "darkUp",
"DiagCross": "darkGrid",
"ThickDiagCross": "darkTrellis",
"ThinHorzStripe": "lightHorizontal",
"ThinVertStripe": "lightVertical",
"ThinReverseDiagStripe": "lightDown",
"ThinHorzCross": "lightGrid"
}; var styles = {}; // shared styles var themes = {}; // shared themes /* 18.8.21 fills CT_Fills */
function parse_fills(t, opts) {
styles.Fills = [];
var fill = {};
t[0].match(tagregex).forEach(function (x) {
var y = parsexmltag(x);
switch (y[0]) {
case '<fills': case '<fills>': case '</fills>': break; /* 18.8.20 fill CT_Fill */
case '<fill>': break;
case '</fill>': styles.Fills.push(fill); fill = {}; break; /* 18.8.32 patternFill CT_PatternFill */
case '<patternFill':
if (y.patternType) fill.patternType = y.patternType;
break;
case '<patternFill/>': case '</patternFill>': break; /* 18.8.3 bgColor CT_Color */
case '<bgColor':
if (!fill.bgColor) fill.bgColor = {};
if (y.indexed) fill.bgColor.indexed = parseInt(y.indexed, 10);
if (y.theme) fill.bgColor.theme = parseInt(y.theme, 10);
if (y.tint) fill.bgColor.tint = parseFloat(y.tint);
/* Excel uses ARGB strings */
if (y.rgb) fill.bgColor.rgb = y.rgb.substring(y.rgb.length - 6);
break;
case '<bgColor/>': case '</bgColor>': break; /* 18.8.19 fgColor CT_Color */
case '<fgColor':
if (!fill.fgColor) fill.fgColor = {};
if (y.theme) fill.fgColor.theme = parseInt(y.theme, 10);
if (y.tint) fill.fgColor.tint = parseFloat(y.tint);
/* Excel uses ARGB strings */
if (y.rgb) fill.fgColor.rgb = y.rgb.substring(y.rgb.length - 6);
break;
case '<fgColor/>': case '</fgColor>': break; default: if (opts.WTF) throw 'unrecognized ' + y[0] + ' in fills';
}
});
} /* 18.8.31 numFmts CT_NumFmts */
function parse_numFmts(t, opts) {
styles.NumberFmt = [];
var k = keys(SSF._table);
for (var i = 0; i < k.length; ++i) styles.NumberFmt[k[i]] = SSF._table[k[i]];
var m = t[0].match(tagregex);
for (i = 0; i < m.length; ++i) {
var y = parsexmltag(m[i]);
switch (y[0]) {
case '<numFmts': case '</numFmts>': case '<numFmts/>': case '<numFmts>': break;
case '<numFmt': {
var f = unescapexml(utf8read(y.formatCode)), j = parseInt(y.numFmtId, 10);
styles.NumberFmt[j] = f; if (j > 0) SSF.load(f, j);
} break;
default: if (opts.WTF) throw 'unrecognized ' + y[0] + ' in numFmts';
}
}
} function write_numFmts(NF, opts) {
var o = ["<numFmts>"];
//[[5, 8], [23, 26], [41, 44], [63, 66], [164, 392]].forEach(function (r) {
// for (var i = r[0]; i <= r[1]; ++i) if (NF[i] !== undefined) o[o.length] = (writextag('numFmt', null, { numFmtId: i, formatCode: escapexml(NF[i]) }));
//});
//for (var i = 0; i < NF.length; i++) {
// if (NF[i] !== undefined)
// o[o.length] = (writextag('numFmt', null, { numFmtId: i, formatCode: escapexml(NF[i]) }));
//}
[[1, 5], [9, 23], [37, 40], [45, 49], [56, 56]].forEach(function (r) {
for (var i = r[0]; i <= r[1]; ++i) if (NF[i] !== undefined) o[o.length] = (writextag('numFmt', null, { numFmtId: i, formatCode: escapexml(NF[i]) }));
});
if (o.length === 1) return "";
o[o.length] = ("</numFmts>");
o[0] = writextag('numFmts', null, { count: o.length - 2 }).replace("/>", ">");
return o.join("");
} /* 18.8.10 cellXfs CT_CellXfs */
function parse_cellXfs(t, opts) {
styles.CellXf = [];
t[0].match(tagregex).forEach(function (x) {
var y = parsexmltag(x);
switch (y[0]) {
case '<cellXfs': case '<cellXfs>': case '<cellXfs/>': case '</cellXfs>': break; /* 18.8.45 xf CT_Xf */
case '<xf': delete y[0];
if (y.numFmtId) y.numFmtId = parseInt(y.numFmtId, 10);
if (y.fillId) y.fillId = parseInt(y.fillId, 10);
styles.CellXf.push(y); break;
case '</xf>': break; /* 18.8.1 alignment CT_CellAlignment */
case '<alignment': case '<alignment/>': break; /* 18.8.33 protection CT_CellProtection */
case '<protection': case '</protection>': case '<protection/>': break; case '<extLst': case '</extLst>': break;
case '<ext': break;
default: if (opts.WTF) throw 'unrecognized ' + y[0] + ' in cellXfs';
}
});
} function write_cellXfs(cellXfs) {
var o = [];
var len = 0;
o[o.length] = (writextag('cellXfs', null));
cellXfs.forEach(function (c) {
o[o.length] = (writextag('xf', null, c)).replace("/>", ">");
o[o.length] = (writextag('alignment', null, c["alignment"]));
o[o.length] = ("</xf>");
len++;
});
o[o.length] = ("</cellXfs>");
if (len === 0) return "";
o[0] = writextag('cellXfs', null, { count: len }).replace("/>", ">");
return o.join("");
} /* 18.8 Styles CT_Stylesheet*/
var parse_sty_xml = (function make_pstyx() {
var numFmtRegex = /<numFmts([^>]*)>.*<\/numFmts>/;
var cellXfRegex = /<cellXfs([^>]*)>.*<\/cellXfs>/;
var fillsRegex = /<fills([^>]*)>.*<\/fills>/; return function parse_sty_xml(data, opts) {
/* 18.8.39 styleSheet CT_Stylesheet */
var t; /* numFmts CT_NumFmts ? */
if ((t = data.match(numFmtRegex))) parse_numFmts(t, opts); /* fonts CT_Fonts ? */
/*if((t=data.match(/<fonts([^>]*)>.*<\/fonts>/))) parse_fonts(t, opts);*/ /* fills CT_Fills */
if ((t = data.match(fillsRegex))) parse_fills(t, opts); /* borders CT_Borders ? */
/* cellStyleXfs CT_CellStyleXfs ? */ /* cellXfs CT_CellXfs ? */
if ((t = data.match(cellXfRegex))) parse_cellXfs(t, opts); /* dxfs CT_Dxfs ? */
/* tableStyles CT_TableStyles ? */
/* colors CT_Colors ? */
/* extLst CT_ExtensionList ? */ return styles;
};
})(); var STYLES_XML_ROOT = writextag('styleSheet', null, {
'xmlns': XMLNS.main[0],
'xmlns:vt': XMLNS.vt
}); RELS.STY = "http://schemas.openxmlformats.org/officeDocument/2006/relationships/styles"; // 定义样式
function write_sty_xml(wb, opts) {
var o = [XML_HEADER, STYLES_XML_ROOT], w; if ((w = write_numFmts(wb.SSF)) != null) o[o.length] = w; o[o.length] = ('<fonts count="7"><font><sz val="11.0"/><color indexed="8"/><name val="宋体"/><family val="2"/><scheme val="minor"/><charset val="1"/></font>');
o[o.length] = ('<font><name val="Microsoft YaHei UI"/><sz val="17.0"/><color rgb="2A87C6"/><u val="none"/></font>');
o[o.length] = ('<font><b/><name val="Microsoft YaHei UI"/><sz val="12.0"/><color rgb="2C4D79"/><u val="none"/></font>');
o[o.length] = ('<font><name val="Microsoft YaHei UI"/><sz val="9.0"/><color rgb="d71345"/><u val="none"/></font>');
o[o.length] = ('<font><name val="Microsoft YaHei UI"/><sz val="9.0"/><color rgb="333333"/><u val="none"/></font>');
o[o.length] = ('<font><name val="Microsoft YaHei UI"/><sz val="9.0"/><color rgb="2C4D79"/></font>');//<b/>
o[o.length] = ('<font><name val="Microsoft YaHei"/><sz val="9.0"/><u val="none"/></font></fonts>');
o[o.length] = ('<fills count="13"><fill><patternFill patternType="none"/></fill>');
o[o.length] = ('<fill><patternFill patternType="darkGray"/></fill>');
o[o.length] = ('<fill><patternFill patternType="solid"><fgColor rgb="D6E3EF"/></patternFill></fill>');
o[o.length] = ('<fill><patternFill patternType="solid"><fgColor rgb="D6E3EF"/></patternFill></fill>');
o[o.length] = ('<fill><patternFill patternType="solid"><fgColor rgb="EBF7FC"/><bgColor rgb="EBF7FC"/></patternFill></fill>');
o[o.length] = ('<fill><patternFill patternType="solid"><fgColor rgb="B8E3E4"/></patternFill></fill>');
o[o.length] = ('<fill><patternFill patternType="solid"><fgColor rgb="B8E3E4"/><bgColor rgb="B8E3E4"/></patternFill></fill>');
o[o.length] = ('<fill><patternFill patternType="solid"><fgColor rgb="DCF2F0"/></patternFill></fill>');
o[o.length] = ('<fill><patternFill patternType="solid"><fgColor rgb="DCF2F0"/><bgColor rgb="DCF2F0"/></patternFill></fill>');
o[o.length] = ('<fill><patternFill patternType="solid"><fgColor rgb="FFFFFF"/></patternFill></fill>');
o[o.length] = ('<fill><patternFill patternType="solid"><fgColor rgb="FFFFFF"/><bgColor rgb="FFFFFF"/></patternFill></fill>');
o[o.length] = ('<fill><patternFill patternType="solid"><fgColor rgb="FAFAFA"/></patternFill></fill>');
o[o.length] = ('<fill><patternFill patternType="solid"><fgColor rgb="FAFAFA"/><bgColor rgb="FAFAFA"/></patternFill></fill></fills>');
o[o.length] = ('<borders count="40">');
o[o.length] = ('<border><left/><right/><top/><bottom/><diagonal/></border>');
o[o.length] = ('<border/><border><bottom style="thick"/></border>');
o[o.length] = ('<border><left style="thin"><color rgb="A3C0E8"/></left><right style="thin"><color rgb="A3C0E8"/></right><top style="thin"><color rgb="A3C0E8"/></top><bottom style="thin"><color rgb="A3C0E8"/></bottom></border>');
o[o.length] = ('<border><left><color rgb="000000"/></left><top><color rgb="000000"/></top><bottom style="thick"/></border>');
o[o.length] = ('<border><left style="thin"><color rgb="95D3F4"/></left><right style="thin"><color rgb="95D3F4"/></right><top style="thin"><color rgb="95D3F4"/></top><bottom style="thin"><color rgb="95D3F4"/></bottom></border>');
o[o.length] = ('<border><left style="thin"><color rgb="95D3F4"/></left><right style="thin"><color rgb="95D3F4"/></right><top style="thin"><color rgb="95D3F4"/></top><bottom style="thin"><color rgb="95D3F4"/></bottom></border>');
o[o.length] = ('<border><top><color rgb="000000"/></top></border>');
o[o.length] = ('<border><left><color rgb="000000"/></left><top><color rgb="000000"/></top></border>');
o[o.length] = ('<border><left><color rgb="000000"/></left><top><color rgb="000000"/></top><bottom><color rgb="000000"/></bottom></border>');
o[o.length] = ('<border><left><color rgb="000000"/></left><right><color rgb="000000"/></right><top><color rgb="000000"/></top><bottom><color rgb="000000"/></bottom></border>');
o[o.length] = ('<border><top style="thin"/></border>');
o[o.length] = ('<border><left style="thin"/><top style="thin"/></border>');
o[o.length] = ('<border><left style="thin"/><top style="thin"/><bottom style="thin"/></border>');
o[o.length] = ('<border><left style="thin"/><right style="thin"/><top style="thin"/><bottom style="thin"/></border>');
o[o.length] = ('<border><left style="thin"/><right style="thin"/><top style="thin"><color rgb="B8E3E4"/></top><bottom style="thin"/></border>');
o[o.length] = ('<border><left style="thin"><color rgb="B8E3E4"/></left><right style="thin"/><top style="thin"><color rgb="B8E3E4"/></top><bottom style="thin"/></border>');
o[o.length] = ('<border><left style="thin"><color rgb="B8E3E4"/></left><right style="thin"/><top style="thin"><color rgb="B8E3E4"/></top><bottom style="thin"><color rgb="B8E3E4"/></bottom></border>');
o[o.length] = ('<border><left style="thin"><color rgb="B8E3E4"/></left><right style="thin"><color rgb="B8E3E4"/></right><top style="thin"><color rgb="B8E3E4"/></top><bottom style="thin"><color rgb="B8E3E4"/></bottom></border>');
o[o.length] = ('<border><left style="thin"/><right style="thin"/><top style="thin"><color rgb="A4DAED"/></top><bottom style="thin"/></border>');
o[o.length] = ('<border><left style="thin"><color rgb="A4DAED"/></left><right style="thin"/><top style="thin"><color rgb="A4DAED"/></top><bottom style="thin"/></border>');
o[o.length] = ('<border><left style="thin"><color rgb="A4DAED"/></left><right style="thin"/><top style="thin"><color rgb="A4DAED"/></top><bottom style="thin"><color rgb="A4DAED"/></bottom></border>');
o[o.length] = ('<border><left style="thin"><color rgb="A4DAED"/></left><right style="thin"><color rgb="A4DAED"/></right><top style="thin"><color rgb="A4DAED"/></top><bottom style="thin"><color rgb="A4DAED"/></bottom></border>');
o[o.length] = ('<border><left style="thin"/><right style="thin"/><top style="thin"/></border><border><left style="thin"/><right style="thin"/><top style="thin"><color rgb="96CCD9"/></top></border>');
o[o.length] = ('<border><left style="thin"><color rgb="96CCD9"/></left><right style="thin"/><top style="thin"><color rgb="96CCD9"/></top></border>');
o[o.length] = ('<border><left style="thin"><color rgb="96CCD9"/></left><right style="thin"/><top style="thin"><color rgb="96CCD9"/></top><bottom><color rgb="000000"/></bottom></border>');
o[o.length] = ('<border><left style="thin"><color rgb="96CCD9"/></left><right style="thin"><color rgb="96CCD9"/></right><top style="thin"><color rgb="96CCD9"/></top><bottom><color rgb="000000"/></bottom></border>');
o[o.length] = ('<border><left style="thin"/></border><border><left style="thin"/><right style="thin"/></border><border><left style="thin"/><right style="thin"/><top><color rgb="000000"/></top></border>');
o[o.length] = ('<border><left style="thin"><color rgb="96CCD9"/></left><right style="thin"/><top><color rgb="000000"/></top></border>');
o[o.length] = ('<border><left style="thin"><color rgb="96CCD9"/></left><right style="thin"/><top><color rgb="000000"/></top><bottom><color rgb="000000"/></bottom></border>');
o[o.length] = ('<border><left style="thin"><color rgb="96CCD9"/></left><right style="thin"><color rgb="96CCD9"/></right><top><color rgb="000000"/></top><bottom><color rgb="000000"/></bottom></border>');
o[o.length] = ('<border><left style="thin"/><bottom style="thin"/></border><border><left style="thin"/><right style="thin"/><bottom style="thin"/></border>');
o[o.length] = ('<border><left style="thin"/><right style="thin"/><top><color rgb="000000"/></top><bottom style="thin"/></border>');
o[o.length] = ('<border><left style="thin"><color rgb="96CCD9"/></left><right style="thin"/><top><color rgb="000000"/></top><bottom style="thin"/></border>');
o[o.length] = ('<border><left style="thin"><color rgb="96CCD9"/></left><right style="thin"/><top><color rgb="000000"/></top><bottom style="thin"><color rgb="96CCD9"/></bottom></border>');
o[o.length] = ('<border><left style="thin"><color rgb="96CCD9"/></left><right style="thin"><color rgb="96CCD9"/></right><top><color rgb="000000"/></top><bottom style="thin"><color rgb="96CCD9"/></bottom></border>');
o[o.length] = ('</borders>');
o[o.length] = ('<cellStyleXfs count="1"><xf numFmtId="0" fontId="0" fillId="0" borderId="0"/></cellStyleXfs>');
if ((w = write_cellXfs(opts.cellXfs))) o[o.length] = (w);
//o[o.length] = ('<cellStyles count="1"><cellStyle name="Normal" xfId="0" builtinId="0"/></cellStyles>');
//o[o.length] = ('<dxfs count="0"/>');
//o[o.length] = ('<tableStyles count="0" defaultTableStyle="TableStyleMedium9" defaultPivotStyle="PivotStyleMedium4"/>'); if (o.length > 2) { o[o.length] = ('</styleSheet>'); o[1] = o[1].replace("/>", ">"); }
return o.join("");
}
/* [MS-XLSB] 2.4.651 BrtFmt */
function parse_BrtFmt(data, length) {
var ifmt = data.read_shift(2);
var stFmtCode = parse_XLWideString(data, length - 2);
return [ifmt, stFmtCode];
} /* [MS-XLSB] 2.4.653 BrtFont TODO */
function parse_BrtFont(data, length) {
var out = { flags: {} };
out.dyHeight = data.read_shift(2);
out.grbit = parse_FontFlags(data, 2);
out.bls = data.read_shift(2);
out.sss = data.read_shift(2);
out.uls = data.read_shift(1);
out.bFamily = data.read_shift(1);
out.bCharSet = data.read_shift(1);
data.l++;
out.brtColor = parse_BrtColor(data, 8);
out.bFontScheme = data.read_shift(1);
out.name = parse_XLWideString(data, length - 21); out.flags.Bold = out.bls === 0x02BC;
out.flags.Italic = out.grbit.fItalic;
out.flags.Strikeout = out.grbit.fStrikeout;
out.flags.Outline = out.grbit.fOutline;
out.flags.Shadow = out.grbit.fShadow;
out.flags.Condense = out.grbit.fCondense;
out.flags.Extend = out.grbit.fExtend;
out.flags.Sub = out.sss & 0x2;
out.flags.Sup = out.sss & 0x1;
return out;
} /* [MS-XLSB] 2.4.816 BrtXF */
function parse_BrtXF(data, length) {
var ixfeParent = data.read_shift(2);
var ifmt = data.read_shift(2);
parsenoop(data, length - 4);
return { ixfe: ixfeParent, ifmt: ifmt };
} /* [MS-XLSB] 2.1.7.50 Styles */
function parse_sty_bin(data, opts) {
styles.NumberFmt = [];
for (var y in SSF._table) styles.NumberFmt[y] = SSF._table[y]; styles.CellXf = [];
var state = ""; /* TODO: this should be a stack */
var pass = false;
recordhopper(data, function hopper_sty(val, R, RT) {
switch (R.n) {
case 'BrtFmt':
styles.NumberFmt[val[0]] = val[1]; SSF.load(val[1], val[0]);
break;
case 'BrtFont': break; /* TODO */
case 'BrtKnownFonts': break; /* TODO */
case 'BrtFill': break; /* TODO */
case 'BrtBorder': break; /* TODO */
case 'BrtXF':
if (state === "CELLXFS") {
styles.CellXf.push(val);
}
break; /* TODO */
case 'BrtStyle': break; /* TODO */
case 'BrtDXF': break; /* TODO */
case 'BrtMRUColor': break; /* TODO */
case 'BrtIndexedColor': break; /* TODO */
case 'BrtBeginStyleSheet': break;
case 'BrtEndStyleSheet': break;
case 'BrtBeginTableStyle': break;
case 'BrtTableStyleElement': break;
case 'BrtEndTableStyle': break;
case 'BrtBeginFmts': state = "FMTS"; break;
case 'BrtEndFmts': state = ""; break;
case 'BrtBeginFonts': state = "FONTS"; break;
case 'BrtEndFonts': state = ""; break;
case 'BrtACBegin': state = "ACFONTS"; break;
case 'BrtACEnd': state = ""; break;
case 'BrtBeginFills': state = "FILLS"; break;
case 'BrtEndFills': state = ""; break;
case 'BrtBeginBorders': state = "BORDERS"; break;
case 'BrtEndBorders': state = ""; break;
case 'BrtBeginCellStyleXFs': state = "CELLSTYLEXFS"; break;
case 'BrtEndCellStyleXFs': state = ""; break;
case 'BrtBeginCellXFs': state = "CELLXFS"; break;
case 'BrtEndCellXFs': state = ""; break;
case 'BrtBeginStyles': state = "STYLES"; break;
case 'BrtEndStyles': state = ""; break;
case 'BrtBeginDXFs': state = "DXFS"; break;
case 'BrtEndDXFs': state = ""; break;
case 'BrtBeginTableStyles': state = "TABLESTYLES"; break;
case 'BrtEndTableStyles': state = ""; break;
case 'BrtBeginColorPalette': state = "COLORPALETTE"; break;
case 'BrtEndColorPalette': state = ""; break;
case 'BrtBeginIndexedColors': state = "INDEXEDCOLORS"; break;
case 'BrtEndIndexedColors': state = ""; break;
case 'BrtBeginMRUColors': state = "MRUCOLORS"; break;
case 'BrtEndMRUColors': state = ""; break;
case 'BrtFRTBegin': pass = true; break;
case 'BrtFRTEnd': pass = false; break;
case 'BrtBeginStyleSheetExt14': break;
case 'BrtBeginSlicerStyles': break;
case 'BrtEndSlicerStyles': break;
case 'BrtBeginTimelineStylesheetExt15': break;
case 'BrtEndTimelineStylesheetExt15': break;
case 'BrtBeginTimelineStyles': break;
case 'BrtEndTimelineStyles': break;
case 'BrtEndStyleSheetExt14': break;
default: if (!pass || opts.WTF) throw new Error("Unexpected record " + RT + " " + R.n);
}
});
return styles;
} /* [MS-XLSB] 2.1.7.50 Styles */
function write_sty_bin(data, opts) {
var ba = buf_array();
write_record(ba, "BrtBeginStyleSheet");
/* [FMTS] */
/* [FONTS] */
/* [FILLS] */
/* [BORDERS] */
/* CELLSTYLEXFS */
/* CELLXFS*/
/* STYLES */
/* DXFS */
/* TABLESTYLES */
/* [COLORPALETTE] */
/* FRTSTYLESHEET*/
write_record(ba, "BrtEndStyleSheet");
return ba.end();
}
RELS.THEME = "http://schemas.openxmlformats.org/officeDocument/2006/relationships/theme"; /* 20.1.6.2 clrScheme CT_ColorScheme */
function parse_clrScheme(t, opts) {
themes.themeElements.clrScheme = [];
var color = {};
t[0].match(tagregex).forEach(function (x) {
var y = parsexmltag(x);
switch (y[0]) {
case '<a:clrScheme': case '</a:clrScheme>': break; /* 20.1.2.3.32 srgbClr CT_SRgbColor */
case '<a:srgbClr': color.rgb = y.val; break; /* 20.1.2.3.33 sysClr CT_SystemColor */
case '<a:sysClr': color.rgb = y.lastClr; break; /* 20.1.4.1.9 dk1 (Dark 1) */
case '<a:dk1>':
case '</a:dk1>':
/* 20.1.4.1.10 dk2 (Dark 2) */
case '<a:dk2>':
case '</a:dk2>':
/* 20.1.4.1.22 lt1 (Light 1) */
case '<a:lt1>':
case '</a:lt1>':
/* 20.1.4.1.23 lt2 (Light 2) */
case '<a:lt2>':
case '</a:lt2>':
/* 20.1.4.1.1 accent1 (Accent 1) */
case '<a:accent1>':
case '</a:accent1>':
/* 20.1.4.1.2 accent2 (Accent 2) */
case '<a:accent2>':
case '</a:accent2>':
/* 20.1.4.1.3 accent3 (Accent 3) */
case '<a:accent3>':
case '</a:accent3>':
/* 20.1.4.1.4 accent4 (Accent 4) */
case '<a:accent4>':
case '</a:accent4>':
/* 20.1.4.1.5 accent5 (Accent 5) */
case '<a:accent5>':
case '</a:accent5>':
/* 20.1.4.1.6 accent6 (Accent 6) */
case '<a:accent6>':
case '</a:accent6>':
/* 20.1.4.1.19 hlink (Hyperlink) */
case '<a:hlink>':
case '</a:hlink>':
/* 20.1.4.1.15 folHlink (Followed Hyperlink) */
case '<a:folHlink>':
case '</a:folHlink>':
if (y[0][1] === '/') {
themes.themeElements.clrScheme.push(color);
color = {};
} else {
color.name = y[0].substring(3, y[0].length - 1);
}
break; default: if (opts.WTF) throw 'unrecognized ' + y[0] + ' in clrScheme';
}
});
} /* 20.1.4.1.18 fontScheme CT_FontScheme */
function parse_fontScheme(t, opts) { } /* 20.1.4.1.15 fmtScheme CT_StyleMatrix */
function parse_fmtScheme(t, opts) { } var clrsregex = /<a:clrScheme([^>]*)>[^\u2603]*<\/a:clrScheme>/;
var fntsregex = /<a:fontScheme([^>]*)>[^\u2603]*<\/a:fontScheme>/;
var fmtsregex = /<a:fmtScheme([^>]*)>[^\u2603]*<\/a:fmtScheme>/; /* 20.1.6.10 themeElements CT_BaseStyles */
function parse_themeElements(data, opts) {
themes.themeElements = {}; var t; [
/* clrScheme CT_ColorScheme */
['clrScheme', clrsregex, parse_clrScheme],
/* fontScheme CT_FontScheme */
['fontScheme', fntsregex, parse_fontScheme],
/* fmtScheme CT_StyleMatrix */
['fmtScheme', fmtsregex, parse_fmtScheme]
].forEach(function (m) {
if (!(t = data.match(m[1]))) throw m[0] + ' not found in themeElements';
m[2](t, opts);
});
} var themeltregex = /<a:themeElements([^>]*)>[^\u2603]*<\/a:themeElements>/; /* 14.2.7 Theme Part */
function parse_theme_xml(data, opts) {
/* 20.1.6.9 theme CT_OfficeStyleSheet */
if (!data || data.length === 0) return themes; var t; /* themeElements CT_BaseStyles */
if (!(t = data.match(themeltregex))) throw 'themeElements not found in theme';
parse_themeElements(t[0], opts); return themes;
} function write_theme() { return '<?xml version="1.0" encoding="UTF-8" standalone="yes"?>\n<a:theme xmlns:a="http://schemas.openxmlformats.org/drawingml/2006/main" name="Office Theme"><a:themeElements><a:clrScheme name="Office"><a:dk1><a:sysClr val="windowText" lastClr="000000"/></a:dk1><a:lt1><a:sysClr val="window" lastClr="FFFFFF"/></a:lt1><a:dk2><a:srgbClr val="1F497D"/></a:dk2><a:lt2><a:srgbClr val="EEECE1"/></a:lt2><a:accent1><a:srgbClr val="4F81BD"/></a:accent1><a:accent2><a:srgbClr val="C0504D"/></a:accent2><a:accent3><a:srgbClr val="9BBB59"/></a:accent3><a:accent4><a:srgbClr val="8064A2"/></a:accent4><a:accent5><a:srgbClr val="4BACC6"/></a:accent5><a:accent6><a:srgbClr val="F79646"/></a:accent6><a:hlink><a:srgbClr val="0000FF"/></a:hlink><a:folHlink><a:srgbClr val="800080"/></a:folHlink></a:clrScheme><a:fontScheme name="Office"><a:majorFont><a:latin typeface="Cambria"/><a:ea typeface=""/><a:cs typeface=""/><a:font script="Jpan" typeface="ＭＳ Ｐゴシック"/><a:font script="Hang" typeface="맑은 고딕"/><a:font script="Hans" typeface="宋体"/><a:font script="Hant" typeface="新細明體"/><a:font script="Arab" typeface="Times New Roman"/><a:font script="Hebr" typeface="Times New Roman"/><a:font script="Thai" typeface="Tahoma"/><a:font script="Ethi" typeface="Nyala"/><a:font script="Beng" typeface="Vrinda"/><a:font script="Gujr" typeface="Shruti"/><a:font script="Khmr" typeface="MoolBoran"/><a:font script="Knda" typeface="Tunga"/><a:font script="Guru" typeface="Raavi"/><a:font script="Cans" typeface="Euphemia"/><a:font script="Cher" typeface="Plantagenet Cherokee"/><a:font script="Yiii" typeface="Microsoft Yi Baiti"/><a:font script="Tibt" typeface="Microsoft Himalaya"/><a:font script="Thaa" typeface="MV Boli"/><a:font script="Deva" typeface="Mangal"/><a:font script="Telu" typeface="Gautami"/><a:font script="Taml" typeface="Latha"/><a:font script="Syrc" typeface="Estrangelo Edessa"/><a:font script="Orya" typeface="Kalinga"/><a:font script="Mlym" typeface="Kartika"/><a:font script="Laoo" typeface="DokChampa"/><a:font script="Sinh" typeface="Iskoola Pota"/><a:font script="Mong" typeface="Mongolian Baiti"/><a:font script="Viet" typeface="Times New Roman"/><a:font script="Uigh" typeface="Microsoft Uighur"/><a:font script="Geor" typeface="Sylfaen"/></a:majorFont><a:minorFont><a:latin typeface="Calibri"/><a:ea typeface=""/><a:cs typeface=""/><a:font script="Jpan" typeface="ＭＳ Ｐゴシック"/><a:font script="Hang" typeface="맑은 고딕"/><a:font script="Hans" typeface="宋体"/><a:font script="Hant" typeface="新細明體"/><a:font script="Arab" typeface="Arial"/><a:font script="Hebr" typeface="Arial"/><a:font script="Thai" typeface="Tahoma"/><a:font script="Ethi" typeface="Nyala"/><a:font script="Beng" typeface="Vrinda"/><a:font script="Gujr" typeface="Shruti"/><a:font script="Khmr" typeface="DaunPenh"/><a:font script="Knda" typeface="Tunga"/><a:font script="Guru" typeface="Raavi"/><a:font script="Cans" typeface="Euphemia"/><a:font script="Cher" typeface="Plantagenet Cherokee"/><a:font script="Yiii" typeface="Microsoft Yi Baiti"/><a:font script="Tibt" typeface="Microsoft Himalaya"/><a:font script="Thaa" typeface="MV Boli"/><a:font script="Deva" typeface="Mangal"/><a:font script="Telu" typeface="Gautami"/><a:font script="Taml" typeface="Latha"/><a:font script="Syrc" typeface="Estrangelo Edessa"/><a:font script="Orya" typeface="Kalinga"/><a:font script="Mlym" typeface="Kartika"/><a:font script="Laoo" typeface="DokChampa"/><a:font script="Sinh" typeface="Iskoola Pota"/><a:font script="Mong" typeface="Mongolian Baiti"/><a:font script="Viet" typeface="Arial"/><a:font script="Uigh" typeface="Microsoft Uighur"/><a:font script="Geor" typeface="Sylfaen"/></a:minorFont></a:fontScheme><a:fmtScheme name="Office"><a:fillStyleLst><a:solidFill><a:schemeClr val="phClr"/></a:solidFill><a:gradFill rotWithShape="1"><a:gsLst><a:gs pos="0"><a:schemeClr val="phClr"><a:tint val="50000"/><a:satMod val="300000"/></a:schemeClr></a:gs><a:gs pos="35000"><a:schemeClr val="phClr"><a:tint val="37000"/><a:satMod val="300000"/></a:schemeClr></a:gs><a:gs pos="100000"><a:schemeClr val="phClr"><a:tint val="15000"/><a:satMod val="350000"/></a:schemeClr></a:gs></a:gsLst><a:lin ang="16200000" scaled="1"/></a:gradFill><a:gradFill rotWithShape="1"><a:gsLst><a:gs pos="0"><a:schemeClr val="phClr"><a:tint val="100000"/><a:shade val="100000"/><a:satMod val="130000"/></a:schemeClr></a:gs><a:gs pos="100000"><a:schemeClr val="phClr"><a:tint val="50000"/><a:shade val="100000"/><a:satMod val="350000"/></a:schemeClr></a:gs></a:gsLst><a:lin ang="16200000" scaled="0"/></a:gradFill></a:fillStyleLst><a:lnStyleLst><a:ln w="9525" cap="flat" cmpd="sng" algn="ctr"><a:solidFill><a:schemeClr val="phClr"><a:shade val="95000"/><a:satMod val="105000"/></a:schemeClr></a:solidFill><a:prstDash val="solid"/></a:ln><a:ln w="25400" cap="flat" cmpd="sng" algn="ctr"><a:solidFill><a:schemeClr val="phClr"/></a:solidFill><a:prstDash val="solid"/></a:ln><a:ln w="38100" cap="flat" cmpd="sng" algn="ctr"><a:solidFill><a:schemeClr val="phClr"/></a:solidFill><a:prstDash val="solid"/></a:ln></a:lnStyleLst><a:effectStyleLst><a:effectStyle><a:effectLst><a:outerShdw blurRad="40000" dist="20000" dir="5400000" rotWithShape="0"><a:srgbClr val="000000"><a:alpha val="38000"/></a:srgbClr></a:outerShdw></a:effectLst></a:effectStyle><a:effectStyle><a:effectLst><a:outerShdw blurRad="40000" dist="23000" dir="5400000" rotWithShape="0"><a:srgbClr val="000000"><a:alpha val="35000"/></a:srgbClr></a:outerShdw></a:effectLst></a:effectStyle><a:effectStyle><a:effectLst><a:outerShdw blurRad="40000" dist="23000" dir="5400000" rotWithShape="0"><a:srgbClr val="000000"><a:alpha val="35000"/></a:srgbClr></a:outerShdw></a:effectLst><a:scene3d><a:camera prst="orthographicFront"><a:rot lat="0" lon="0" rev="0"/></a:camera><a:lightRig rig="threePt" dir="t"><a:rot lat="0" lon="0" rev="1200000"/></a:lightRig></a:scene3d><a:sp3d><a:bevelT w="63500" h="25400"/></a:sp3d></a:effectStyle></a:effectStyleLst><a:bgFillStyleLst><a:solidFill><a:schemeClr val="phClr"/></a:solidFill><a:gradFill rotWithShape="1"><a:gsLst><a:gs pos="0"><a:schemeClr val="phClr"><a:tint val="40000"/><a:satMod val="350000"/></a:schemeClr></a:gs><a:gs pos="40000"><a:schemeClr val="phClr"><a:tint val="45000"/><a:shade val="99000"/><a:satMod val="350000"/></a:schemeClr></a:gs><a:gs pos="100000"><a:schemeClr val="phClr"><a:shade val="20000"/><a:satMod val="255000"/></a:schemeClr></a:gs></a:gsLst><a:path path="circle"><a:fillToRect l="50000" t="-80000" r="50000" b="180000"/></a:path></a:gradFill><a:gradFill rotWithShape="1"><a:gsLst><a:gs pos="0"><a:schemeClr val="phClr"><a:tint val="80000"/><a:satMod val="300000"/></a:schemeClr></a:gs><a:gs pos="100000"><a:schemeClr val="phClr"><a:shade val="30000"/><a:satMod val="200000"/></a:schemeClr></a:gs></a:gsLst><a:path path="circle"><a:fillToRect l="50000" t="50000" r="50000" b="50000"/></a:path></a:gradFill></a:bgFillStyleLst></a:fmtScheme></a:themeElements><a:objectDefaults><a:spDef><a:spPr/><a:bodyPr/><a:lstStyle/><a:style><a:lnRef idx="1"><a:schemeClr val="accent1"/></a:lnRef><a:fillRef idx="3"><a:schemeClr val="accent1"/></a:fillRef><a:effectRef idx="2"><a:schemeClr val="accent1"/></a:effectRef><a:fontRef idx="minor"><a:schemeClr val="lt1"/></a:fontRef></a:style></a:spDef><a:lnDef><a:spPr/><a:bodyPr/><a:lstStyle/><a:style><a:lnRef idx="2"><a:schemeClr val="accent1"/></a:lnRef><a:fillRef idx="0"><a:schemeClr val="accent1"/></a:fillRef><a:effectRef idx="1"><a:schemeClr val="accent1"/></a:effectRef><a:fontRef idx="minor"><a:schemeClr val="tx1"/></a:fontRef></a:style></a:lnDef></a:objectDefaults><a:extraClrSchemeLst/></a:theme>'; }
/* [MS-XLS] 2.4.326 TODO: payload is a zip file */
function parse_Theme(blob, length) {
var dwThemeVersion = blob.read_shift(4);
if (dwThemeVersion === 124226) return;
blob.l += length - 4;
} /* 2.5.49 */
function parse_ColorTheme(blob, length) { return blob.read_shift(4); } /* 2.5.155 */
function parse_FullColorExt(blob, length) {
var o = {};
o.xclrType = blob.read_shift(2);
o.nTintShade = blob.read_shift(2);
switch (o.xclrType) {
case 0: blob.l += 4; break;
case 1: o.xclrValue = parse_IcvXF(blob, 4); break;
case 2: o.xclrValue = parse_LongRGBA(blob, 4); break;
case 3: o.xclrValue = parse_ColorTheme(blob, 4); break;
case 4: blob.l += 4; break;
}
blob.l += 8;
return o;
} /* 2.5.164 TODO: read 7 bits*/
function parse_IcvXF(blob, length) {
return parsenoop(blob, length);
} /* 2.5.280 */
function parse_XFExtGradient(blob, length) {
return parsenoop(blob, length);
} /* 2.5.108 */
function parse_ExtProp(blob, length) {
var extType = blob.read_shift(2);
var cb = blob.read_shift(2);
var o = [extType];
switch (extType) {
case 0x04: case 0x05: case 0x07: case 0x08:
case 0x09: case 0x0A: case 0x0B: case 0x0D:
o[1] = parse_FullColorExt(blob, cb); break;
case 0x06: o[1] = parse_XFExtGradient(blob, cb); break;
case 0x0E: case 0x0F: o[1] = blob.read_shift(cb === 5 ? 1 : 2); break;
default: throw new Error("Unrecognized ExtProp type: " + extType + " " + cb);
}
return o;
} /* 2.4.355 */
function parse_XFExt(blob, length) {
var end = blob.l + length;
blob.l += 2;
var ixfe = blob.read_shift(2);
blob.l += 2;
var cexts = blob.read_shift(2);
var ext = [];
while (cexts-- > 0) ext.push(parse_ExtProp(blob, end - blob.l));
return { ixfe: ixfe, ext: ext };
} /* xf is an XF, see parse_XFExt for xfext */
function update_xfext(xf, xfext) {
xfext.forEach(function (xfe) {
switch (xfe[0]) { /* 2.5.108 extPropData */
case 0x04: break; /* foreground color */
case 0x05: break; /* background color */
case 0x07: case 0x08: case 0x09: case 0x0a: break;
case 0x0d: break; /* text color */
case 0x0e: break; /* font scheme */
default: throw "bafuq" + xfe[0].toString(16);
}
});
} /* 18.6 Calculation Chain */
function parse_cc_xml(data, opts) {
var d = [];
var l = 0, i = 1;
(data.match(tagregex) || []).forEach(function (x) {
var y = parsexmltag(x);
switch (y[0]) {
case '<?xml': break;
/* 18.6.2 calcChain CT_CalcChain 1 */
case '<calcChain': case '<calcChain>': case '</calcChain>': break;
/* 18.6.1 c CT_CalcCell 1 */
case '<c': delete y[0]; if (y.i) i = y.i; else y.i = i; d.push(y); break;
}
});
return d;
} function write_cc_xml(data, opts) { }
/* [MS-XLSB] 2.6.4.1 */
function parse_BrtCalcChainItem$(data, length) {
var out = {};
out.i = data.read_shift(4);
var cell = {};
cell.r = data.read_shift(4);
cell.c = data.read_shift(4);
out.r = encode_cell(cell);
var flags = data.read_shift(1);
if (flags & 0x2) out.l = '1';
if (flags & 0x8) out.a = '1';
return out;
} /* 18.6 Calculation Chain */
function parse_cc_bin(data, opts) {
var out = [];
var pass = false;
recordhopper(data, function hopper_cc(val, R, RT) {
switch (R.n) {
case 'BrtCalcChainItem$': out.push(val); break;
case 'BrtBeginCalcChain$': break;
case 'BrtEndCalcChain$': break;
default: if (!pass || opts.WTF) throw new Error("Unexpected record " + RT + " " + R.n);
}
});
return out;
} function write_cc_bin(data, opts) { } function parse_comments(zip, dirComments, sheets, sheetRels, opts) {
for (var i = 0; i != dirComments.length; ++i) {
var canonicalpath = dirComments[i];
var comments = parse_cmnt(getzipdata(zip, canonicalpath.replace(/^\//, ''), true), canonicalpath, opts);
if (!comments || !comments.length) continue;
// find the sheets targeted by these comments
var sheetNames = keys(sheets);
for (var j = 0; j != sheetNames.length; ++j) {
var sheetName = sheetNames[j];
var rels = sheetRels[sheetName];
if (rels) {
var rel = rels[canonicalpath];
if (rel) insertCommentsIntoSheet(sheetName, sheets[sheetName], comments);
}
}
}
} function insertCommentsIntoSheet(sheetName, sheet, comments) {
comments.forEach(function (comment) {
var cell = sheet[comment.ref];
if (!cell) {
cell = {};
sheet[comment.ref] = cell;
var range = safe_decode_range(sheet["!ref"] || "BDWGO1000001:A1");
var thisCell = decode_cell(comment.ref);
if (range.s.r > thisCell.r) range.s.r = thisCell.r;
if (range.e.r < thisCell.r) range.e.r = thisCell.r;
if (range.s.c > thisCell.c) range.s.c = thisCell.c;
if (range.e.c < thisCell.c) range.e.c = thisCell.c;
var encoded = encode_range(range);
if (encoded !== sheet["!ref"]) sheet["!ref"] = encoded;
} if (!cell.c) cell.c = [];
var o = { a: comment.author, t: comment.t, r: comment.r };
if (comment.h) o.h = comment.h;
cell.c.push(o);
});
} /* 18.7.3 CT_Comment */
function parse_comments_xml(data, opts) {
if (data.match(/<(?:\w+:)?comments *\/>/)) return [];
var authors = [];
var commentList = [];
data.match(/<(?:\w+:)?authors>([^\u2603]*)<\/(?:\w+:)?authors>/)[1].split(/<\/\w*:?author>/).forEach(function (x) {
if (x === "" || x.trim() === "") return;
authors.push(x.match(/<(?:\w+:)?author[^>]*>(.*)/)[1]);
});
(data.match(/<(?:\w+:)?commentList>([^\u2603]*)<\/(?:\w+:)?commentList>/) || ["", ""])[1].split(/<\/\w*:?comment>/).forEach(function (x, index) {
if (x === "" || x.trim() === "") return;
var y = parsexmltag(x.match(/<(?:\w+:)?comment[^>]*>/)[0]);
var comment = { author: y.authorId && authors[y.authorId] ? authors[y.authorId] : undefined, ref: y.ref, guid: y.guid };
var cell = decode_cell(y.ref);
if (opts.sheetRows && opts.sheetRows <= cell.r) return;
var textMatch = x.match(/<text>([^\u2603]*)<\/text>/);
if (!textMatch || !textMatch[1]) return; // a comment may contain an empty text tag.
var rt = parse_si(textMatch[1]);
comment.r = rt.r;
comment.t = rt.t;
if (opts.cellHTML) comment.h = rt.h;
commentList.push(comment);
});
return commentList;
} function write_comments_xml(data, opts) { }
/* [MS-XLSB] 2.4.28 BrtBeginComment */
function parse_BrtBeginComment(data, length) {
var out = {};
out.iauthor = data.read_shift(4);
var rfx = parse_UncheckedRfX(data, 16);
out.rfx = rfx.s;
out.ref = encode_cell(rfx.s);
data.l += 16; /*var guid = parse_GUID(data); */
return out;
} /* [MS-XLSB] 2.4.324 BrtCommentAuthor */
var parse_BrtCommentAuthor = parse_XLWideString; /* [MS-XLSB] 2.4.325 BrtCommentText */
var parse_BrtCommentText = parse_RichStr; /* [MS-XLSB] 2.1.7.8 Comments */
function parse_comments_bin(data, opts) {
var out = [];
var authors = [];
var c = {};
var pass = false;
recordhopper(data, function hopper_cmnt(val, R, RT) {
switch (R.n) {
case 'BrtCommentAuthor': authors.push(val); break;
case 'BrtBeginComment': c = val; break;
case 'BrtCommentText': c.t = val.t; c.h = val.h; c.r = val.r; break;
case 'BrtEndComment':
c.author = authors[c.iauthor];
delete c.iauthor;
if (opts.sheetRows && opts.sheetRows <= c.rfx.r) break;
delete c.rfx; out.push(c); break;
case 'BrtBeginComments': break;
case 'BrtEndComments': break;
case 'BrtBeginCommentAuthors': break;
case 'BrtEndCommentAuthors': break;
case 'BrtBeginCommentList': break;
case 'BrtEndCommentList': break;
default: if (!pass || opts.WTF) throw new Error("Unexpected record " + RT + " " + R.n);
}
});
return out;
} function write_comments_bin(data, opts) { }
/* TODO: it will be useful to parse the function str */
var rc_to_a1 = (function () {
var rcregex = /(^|[^A-Za-z])R(\[?)(-?\d+|)\]?C(\[?)(-?\d+|)\]?/g;
var rcbase;
function rcfunc($$, $1, $2, $3, $4, $5) {
var R = $3.length > 0 ? parseInt($3, 10) | 0 : 0, C = $5.length > 0 ? parseInt($5, 10) | 0 : 0;
if (C < 0 && $4.length === 0) C = 0;
if ($4.length > 0) C += rcbase.c;
if ($2.length > 0) R += rcbase.r;
return $1 + encode_col(C) + encode_row(R);
}
return function rc_to_a1(fstr, base) {
rcbase = base;
return fstr.replace(rcregex, rcfunc);
};
})(); /* --- formula references point to MS-XLS --- */
/* Small helpers */
function parseread(l) { return function (blob, length) { blob.l += l; return; }; }
function parseread1(blob, length) { blob.l += 1; return; } /* Rgce Helpers */ /* 2.5.51 */
function parse_ColRelU(blob, length) {
var c = blob.read_shift(2);
return [c & 0x3FFF, (c >> 14) & 1, (c >> 15) & 1];
} /* 2.5.198.105 */
function parse_RgceArea(blob, length) {
var r = blob.read_shift(2), R = blob.read_shift(2);
var c = parse_ColRelU(blob, 2);
var C = parse_ColRelU(blob, 2);
return { s: { r: r, c: c[0], cRel: c[1], rRel: c[2] }, e: { r: R, c: C[0], cRel: C[1], rRel: C[2] } };
} /* 2.5.198.105 TODO */
function parse_RgceAreaRel(blob, length) {
var r = blob.read_shift(2), R = blob.read_shift(2);
var c = parse_ColRelU(blob, 2);
var C = parse_ColRelU(blob, 2);
return { s: { r: r, c: c[0], cRel: c[1], rRel: c[2] }, e: { r: R, c: C[0], cRel: C[1], rRel: C[2] } };
} /* 2.5.198.109 */
function parse_RgceLoc(blob, length) {
var r = blob.read_shift(2);
var c = parse_ColRelU(blob, 2);
return { r: r, c: c[0], cRel: c[1], rRel: c[2] };
} /* 2.5.198.111 */
function parse_RgceLocRel(blob, length) {
var r = blob.read_shift(2);
var cl = blob.read_shift(2);
var cRel = (cl & 0x8000) >> 15, rRel = (cl & 0x4000) >> 14;
cl &= 0x3FFF;
if (cRel !== 0) while (cl >= 0x100) cl -= 0x100;
return { r: r, c: cl, cRel: cRel, rRel: rRel };
} /* Ptg Tokens */ /* 2.5.198.27 */
function parse_PtgArea(blob, length) {
var type = (blob[blob.l++] & 0x60) >> 5;
var area = parse_RgceArea(blob, 8);
return [type, area];
} /* 2.5.198.28 */
function parse_PtgArea3d(blob, length) {
var type = (blob[blob.l++] & 0x60) >> 5;
var ixti = blob.read_shift(2);
var area = parse_RgceArea(blob, 8);
return [type, ixti, area];
} /* 2.5.198.29 */
function parse_PtgAreaErr(blob, length) {
var type = (blob[blob.l++] & 0x60) >> 5;
blob.l += 8;
return [type];
}
/* 2.5.198.30 */
function parse_PtgAreaErr3d(blob, length) {
var type = (blob[blob.l++] & 0x60) >> 5;
var ixti = blob.read_shift(2);
blob.l += 8;
return [type, ixti];
} /* 2.5.198.31 */
function parse_PtgAreaN(blob, length) {
var type = (blob[blob.l++] & 0x60) >> 5;
var area = parse_RgceAreaRel(blob, 8);
return [type, area];
} /* 2.5.198.32 -- ignore this and look in PtgExtraArray for shape + values */
function parse_PtgArray(blob, length) {
var type = (blob[blob.l++] & 0x60) >> 5;
blob.l += 7;
return [type];
} /* 2.5.198.33 */
function parse_PtgAttrBaxcel(blob, length) {
var bitSemi = blob[blob.l + 1] & 0x01; /* 1 = volatile */
var bitBaxcel = 1;
blob.l += 4;
return [bitSemi, bitBaxcel];
} /* 2.5.198.34 */
function parse_PtgAttrChoose(blob, length) {
blob.l += 2;
var offset = blob.read_shift(2);
var o = [];
/* offset is 1 less than the number of elements */
for (var i = 0; i <= offset; ++i) o.push(blob.read_shift(2));
return o;
} /* 2.5.198.35 */
function parse_PtgAttrGoto(blob, length) {
var bitGoto = (blob[blob.l + 1] & 0xFF) ? 1 : 0;
blob.l += 2;
return [bitGoto, blob.read_shift(2)];
} /* 2.5.198.36 */
function parse_PtgAttrIf(blob, length) {
var bitIf = (blob[blob.l + 1] & 0xFF) ? 1 : 0;
blob.l += 2;
return [bitIf, blob.read_shift(2)];
} /* 2.5.198.37 */
function parse_PtgAttrSemi(blob, length) {
var bitSemi = (blob[blob.l + 1] & 0xFF) ? 1 : 0;
blob.l += 4;
return [bitSemi];
} /* 2.5.198.40 (used by PtgAttrSpace and PtgAttrSpaceSemi) */
function parse_PtgAttrSpaceType(blob, length) {
var type = blob.read_shift(1), cch = blob.read_shift(1);
return [type, cch];
} /* 2.5.198.38 */
function parse_PtgAttrSpace(blob, length) {
blob.read_shift(2);
return parse_PtgAttrSpaceType(blob, 2);
} /* 2.5.198.39 */
function parse_PtgAttrSpaceSemi(blob, length) {
blob.read_shift(2);
return parse_PtgAttrSpaceType(blob, 2);
} /* 2.5.198.84 TODO */
function parse_PtgRef(blob, length) {
var ptg = blob[blob.l] & 0x1F;
var type = (blob[blob.l] & 0x60) >> 5;
blob.l += 1;
var loc = parse_RgceLoc(blob, 4);
return [type, loc];
} /* 2.5.198.88 TODO */
function parse_PtgRefN(blob, length) {
var ptg = blob[blob.l] & 0x1F;
var type = (blob[blob.l] & 0x60) >> 5;
blob.l += 1;
var loc = parse_RgceLocRel(blob, 4);
return [type, loc];
} /* 2.5.198.85 TODO */
function parse_PtgRef3d(blob, length) {
var ptg = blob[blob.l] & 0x1F;
var type = (blob[blob.l] & 0x60) >> 5;
blob.l += 1;
var ixti = blob.read_shift(2); // XtiIndex
var loc = parse_RgceLoc(blob, 4);
return [type, ixti, loc];
} /* 2.5.198.62 TODO */
function parse_PtgFunc(blob, length) {
var ptg = blob[blob.l] & 0x1F;
var type = (blob[blob.l] & 0x60) >> 5;
blob.l += 1;
var iftab = blob.read_shift(2);
return [FtabArgc[iftab], Ftab[iftab]];
}
/* 2.5.198.63 TODO */
function parse_PtgFuncVar(blob, length) {
blob.l++;
var cparams = blob.read_shift(1), tab = parsetab(blob);
return [cparams, (tab[0] === 0 ? Ftab : Cetab)[tab[1]]];
} function parsetab(blob, length) {
return [blob[blob.l + 1] >> 7, blob.read_shift(2) & 0x7FFF];
} /* 2.5.198.41 */
var parse_PtgAttrSum = parseread(4);
/* 2.5.198.43 */
var parse_PtgConcat = parseread1; /* 2.5.198.58 */
function parse_PtgExp(blob, length) {
blob.l++;
var row = blob.read_shift(2);
var col = blob.read_shift(2);
return [row, col];
} /* 2.5.198.57 */
function parse_PtgErr(blob, length) { blob.l++; return BErr[blob.read_shift(1)]; } /* 2.5.198.66 TODO */
function parse_PtgInt(blob, length) { blob.l++; return blob.read_shift(2); } /* 2.5.198.42 */
function parse_PtgBool(blob, length) { blob.l++; return blob.read_shift(1) !== 0; } /* 2.5.198.79 */
function parse_PtgNum(blob, length) { blob.l++; return parse_Xnum(blob, 8); } /* 2.5.198.89 */
function parse_PtgStr(blob, length) { blob.l++; return parse_ShortXLUnicodeString(blob); } /* 2.5.192.112 + 2.5.192.11{3,4,5,6,7} */
function parse_SerAr(blob) {
var val = [];
switch ((val[0] = blob.read_shift(1))) {
/* 2.5.192.113 */
case 0x04: /* SerBool -- boolean */
val[1] = parsebool(blob, 1) ? 'TRUE' : 'FALSE';
blob.l += 7; break;
/* 2.5.192.114 */
case 0x10: /* SerErr -- error */
val[1] = BErr[blob[blob.l]];
blob.l += 8; break;
/* 2.5.192.115 */
case 0x00: /* SerNil -- honestly, I'm not sure how to reproduce this */
blob.l += 8; break;
/* 2.5.192.116 */
case 0x01: /* SerNum -- Xnum */
val[1] = parse_Xnum(blob, 8); break;
/* 2.5.192.117 */
case 0x02: /* SerStr -- XLUnicodeString (<256 chars) */
val[1] = parse_XLUnicodeString(blob); break;
// default: throw "Bad SerAr: " + val[0]; /* Unreachable */
}
return val;
} /* 2.5.198.61 */
function parse_PtgExtraMem(blob, cce) {
var count = blob.read_shift(2);
var out = [];
for (var i = 0; i != count; ++i) out.push(parse_Ref8U(blob, 8));
return out;
} /* 2.5.198.59 */
function parse_PtgExtraArray(blob) {
var cols = 1 + blob.read_shift(1); //DColByteU
var rows = 1 + blob.read_shift(2); //DRw
for (var i = 0, o = []; i != rows && (o[i] = []) ; ++i)
for (var j = 0; j != cols; ++j) o[i][j] = parse_SerAr(blob);
return o;
} /* 2.5.198.76 */
function parse_PtgName(blob, length) {
var type = (blob.read_shift(1) >>> 5) & 0x03;
var nameindex = blob.read_shift(4);
return [type, 0, nameindex];
} /* 2.5.198.77 */
function parse_PtgNameX(blob, length) {
var type = (blob.read_shift(1) >>> 5) & 0x03;
var ixti = blob.read_shift(2); // XtiIndex
var nameindex = blob.read_shift(4);
return [type, ixti, nameindex];
} /* 2.5.198.70 */
function parse_PtgMemArea(blob, length) {
var type = (blob.read_shift(1) >>> 5) & 0x03;
blob.l += 4;
var cce = blob.read_shift(2);
return [type, cce];
} /* 2.5.198.72 */
function parse_PtgMemFunc(blob, length) {
var type = (blob.read_shift(1) >>> 5) & 0x03;
var cce = blob.read_shift(2);
return [type, cce];
} /* 2.5.198.86 */
function parse_PtgRefErr(blob, length) {
var type = (blob.read_shift(1) >>> 5) & 0x03;
blob.l += 4;
return [type];
} /* 2.5.198.26 */
var parse_PtgAdd = parseread1;
/* 2.5.198.45 */
var parse_PtgDiv = parseread1;
/* 2.5.198.56 */
var parse_PtgEq = parseread1;
/* 2.5.198.64 */
var parse_PtgGe = parseread1;
/* 2.5.198.65 */
var parse_PtgGt = parseread1;
/* 2.5.198.67 */
var parse_PtgIsect = parseread1;
/* 2.5.198.68 */
var parse_PtgLe = parseread1;
/* 2.5.198.69 */
var parse_PtgLt = parseread1;
/* 2.5.198.74 */
var parse_PtgMissArg = parseread1;
/* 2.5.198.75 */
var parse_PtgMul = parseread1;
/* 2.5.198.78 */
var parse_PtgNe = parseread1;
/* 2.5.198.80 */
var parse_PtgParen = parseread1;
/* 2.5.198.81 */
var parse_PtgPercent = parseread1;
/* 2.5.198.82 */
var parse_PtgPower = parseread1;
/* 2.5.198.83 */
var parse_PtgRange = parseread1;
/* 2.5.198.90 */
var parse_PtgSub = parseread1;
/* 2.5.198.93 */
var parse_PtgUminus = parseread1;
/* 2.5.198.94 */
var parse_PtgUnion = parseread1;
/* 2.5.198.95 */
var parse_PtgUplus = parseread1; /* 2.5.198.71 */
var parse_PtgMemErr = parsenoop;
/* 2.5.198.73 */
var parse_PtgMemNoMem = parsenoop;
/* 2.5.198.87 */
var parse_PtgRefErr3d = parsenoop;
/* 2.5.198.92 */
var parse_PtgTbl = parsenoop; /* 2.5.198.25 */
var PtgTypes = {
0x01: { n: 'PtgExp', f: parse_PtgExp },
0x02: { n: 'PtgTbl', f: parse_PtgTbl },
0x03: { n: 'PtgAdd', f: parse_PtgAdd },
0x04: { n: 'PtgSub', f: parse_PtgSub },
0x05: { n: 'PtgMul', f: parse_PtgMul },
0x06: { n: 'PtgDiv', f: parse_PtgDiv },
0x07: { n: 'PtgPower', f: parse_PtgPower },
0x08: { n: 'PtgConcat', f: parse_PtgConcat },
0x09: { n: 'PtgLt', f: parse_PtgLt },
0x0A: { n: 'PtgLe', f: parse_PtgLe },
0x0B: { n: 'PtgEq', f: parse_PtgEq },
0x0C: { n: 'PtgGe', f: parse_PtgGe },
0x0D: { n: 'PtgGt', f: parse_PtgGt },
0x0E: { n: 'PtgNe', f: parse_PtgNe },
0x0F: { n: 'PtgIsect', f: parse_PtgIsect },
0x10: { n: 'PtgUnion', f: parse_PtgUnion },
0x11: { n: 'PtgRange', f: parse_PtgRange },
0x12: { n: 'PtgUplus', f: parse_PtgUplus },
0x13: { n: 'PtgUminus', f: parse_PtgUminus },
0x14: { n: 'PtgPercent', f: parse_PtgPercent },
0x15: { n: 'PtgParen', f: parse_PtgParen },
0x16: { n: 'PtgMissArg', f: parse_PtgMissArg },
0x17: { n: 'PtgStr', f: parse_PtgStr },
0x1C: { n: 'PtgErr', f: parse_PtgErr },
0x1D: { n: 'PtgBool', f: parse_PtgBool },
0x1E: { n: 'PtgInt', f: parse_PtgInt },
0x1F: { n: 'PtgNum', f: parse_PtgNum },
0x20: { n: 'PtgArray', f: parse_PtgArray },
0x21: { n: 'PtgFunc', f: parse_PtgFunc },
0x22: { n: 'PtgFuncVar', f: parse_PtgFuncVar },
0x23: { n: 'PtgName', f: parse_PtgName },
0x24: { n: 'PtgRef', f: parse_PtgRef },
0x25: { n: 'PtgArea', f: parse_PtgArea },
0x26: { n: 'PtgMemArea', f: parse_PtgMemArea },
0x27: { n: 'PtgMemErr', f: parse_PtgMemErr },
0x28: { n: 'PtgMemNoMem', f: parse_PtgMemNoMem },
0x29: { n: 'PtgMemFunc', f: parse_PtgMemFunc },
0x2A: { n: 'PtgRefErr', f: parse_PtgRefErr },
0x2B: { n: 'PtgAreaErr', f: parse_PtgAreaErr },
0x2C: { n: 'PtgRefN', f: parse_PtgRefN },
0x2D: { n: 'PtgAreaN', f: parse_PtgAreaN },
0x39: { n: 'PtgNameX', f: parse_PtgNameX },
0x3A: { n: 'PtgRef3d', f: parse_PtgRef3d },
0x3B: { n: 'PtgArea3d', f: parse_PtgArea3d },
0x3C: { n: 'PtgRefErr3d', f: parse_PtgRefErr3d },
0x3D: { n: 'PtgAreaErr3d', f: parse_PtgAreaErr3d },
0xFF: {}
};
/* These are duplicated in the PtgTypes table */
var PtgDupes = {
0x40: 0x20, 0x60: 0x20,
0x41: 0x21, 0x61: 0x21,
0x42: 0x22, 0x62: 0x22,
0x43: 0x23, 0x63: 0x23,
0x44: 0x24, 0x64: 0x24,
0x45: 0x25, 0x65: 0x25,
0x46: 0x26, 0x66: 0x26,
0x47: 0x27, 0x67: 0x27,
0x48: 0x28, 0x68: 0x28,
0x49: 0x29, 0x69: 0x29,
0x4A: 0x2A, 0x6A: 0x2A,
0x4B: 0x2B, 0x6B: 0x2B,
0x4C: 0x2C, 0x6C: 0x2C,
0x4D: 0x2D, 0x6D: 0x2D,
0x59: 0x39, 0x79: 0x39,
0x5A: 0x3A, 0x7A: 0x3A,
0x5B: 0x3B, 0x7B: 0x3B,
0x5C: 0x3C, 0x7C: 0x3C,
0x5D: 0x3D, 0x7D: 0x3D
};
(function () { for (var y in PtgDupes) PtgTypes[y] = PtgTypes[PtgDupes[y]]; })(); var Ptg18 = {};
var Ptg19 = {
0x01: { n: 'PtgAttrSemi', f: parse_PtgAttrSemi },
0x02: { n: 'PtgAttrIf', f: parse_PtgAttrIf },
0x04: { n: 'PtgAttrChoose', f: parse_PtgAttrChoose },
0x08: { n: 'PtgAttrGoto', f: parse_PtgAttrGoto },
0x10: { n: 'PtgAttrSum', f: parse_PtgAttrSum },
0x20: { n: 'PtgAttrBaxcel', f: parse_PtgAttrBaxcel },
0x40: { n: 'PtgAttrSpace', f: parse_PtgAttrSpace },
0x41: { n: 'PtgAttrSpaceSemi', f: parse_PtgAttrSpaceSemi },
0xFF: {}
}; /* 2.4.127 TODO */
function parse_Formula(blob, length, opts) {
var cell = parse_XLSCell(blob, 6);
var val = parse_FormulaValue(blob, 8);
var flags = blob.read_shift(1);
blob.read_shift(1);
var chn = blob.read_shift(4);
var cbf = "";
if (opts.biff === 5) blob.l += length - 20;
else cbf = parse_XLSCellParsedFormula(blob, length - 20, opts);
return { cell: cell, val: val[0], formula: cbf, shared: (flags >> 3) & 1, tt: val[1] };
} /* 2.5.133 TODO: how to emit empty strings? */
function parse_FormulaValue(blob) {
var b;
if (__readUInt16LE(blob, blob.l + 6) !== 0xFFFF) return [parse_Xnum(blob), 'n'];
switch (blob[blob.l]) {
case 0x00: blob.l += 8; return ["String", 's'];
case 0x01: b = blob[blob.l + 2] === 0x1; blob.l += 8; return [b, 'b'];
case 0x02: b = blob[blob.l + 2]; blob.l += 8; return [b, 'e'];
case 0x03: blob.l += 8; return ["", 's'];
}
} /* 2.5.198.103 */
function parse_RgbExtra(blob, length, rgce, opts) {
if (opts.biff < 8) return parsenoop(blob, length);
var target = blob.l + length;
var o = [];
for (var i = 0; i !== rgce.length; ++i) {
switch (rgce[i][0]) {
case 'PtgArray': /* PtgArray -> PtgExtraArray */
rgce[i][1] = parse_PtgExtraArray(blob);
o.push(rgce[i][1]);
break;
case 'PtgMemArea': /* PtgMemArea -> PtgExtraMem */
rgce[i][2] = parse_PtgExtraMem(blob, rgce[i][1]);
o.push(rgce[i][2]);
break;
default: break;
}
}
length = target - blob.l;
if (length !== 0) o.push(parsenoop(blob, length));
return o;
} /* 2.5.198.21 */
function parse_NameParsedFormula(blob, length, opts, cce) {
var target = blob.l + length;
var rgce = parse_Rgce(blob, cce);
var rgcb;
if (target !== blob.l) rgcb = parse_RgbExtra(blob, target - blob.l, rgce, opts);
return [rgce, rgcb];
} /* 2.5.198.3 TODO */
function parse_XLSCellParsedFormula(blob, length, opts) {
var target = blob.l + length;
var rgcb, cce = blob.read_shift(2); // length of rgce
if (cce == 0xFFFF) return [[], parsenoop(blob, length - 2)];
var rgce = parse_Rgce(blob, cce);
if (length !== cce + 2) rgcb = parse_RgbExtra(blob, length - cce - 2, rgce, opts);
return [rgce, rgcb];
} /* 2.5.198.118 TODO */
function parse_SharedParsedFormula(blob, length, opts) {
var target = blob.l + length;
var rgcb, cce = blob.read_shift(2); // length of rgce
var rgce = parse_Rgce(blob, cce);
if (cce == 0xFFFF) return [[], parsenoop(blob, length - 2)];
if (length !== cce + 2) rgcb = parse_RgbExtra(blob, target - cce - 2, rgce, opts);
return [rgce, rgcb];
} /* 2.5.198.1 TODO */
function parse_ArrayParsedFormula(blob, length, opts, ref) {
var target = blob.l + length;
var rgcb, cce = blob.read_shift(2); // length of rgce
if (cce == 0xFFFF) return [[], parsenoop(blob, length - 2)];
var rgce = parse_Rgce(blob, cce);
if (length !== cce + 2) rgcb = parse_RgbExtra(blob, target - cce - 2, rgce, opts);
return [rgce, rgcb];
} /* 2.5.198.104 */
function parse_Rgce(blob, length) {
var target = blob.l + length;
var R, id, ptgs = [];
while (target != blob.l) {
length = target - blob.l;
id = blob[blob.l];
R = PtgTypes[id];
//console.log("ptg", id, R)
if (id === 0x18 || id === 0x19) {
id = blob[blob.l + 1];
R = (id === 0x18 ? Ptg18 : Ptg19)[id];
}
if (!R || !R.f) { ptgs.push(parsenoop(blob, length)); }
else { ptgs.push([R.n, R.f(blob, length)]); }
}
return ptgs;
} function mapper(x) { return x.map(function f2(y) { return y[1]; }).join(","); } /* 2.2.2 + Magic TODO */
function stringify_formula(formula, range, cell, supbooks, opts) {
if (opts !== undefined && opts.biff === 5) return "BIFF5??";
var _range = range !== undefined ? range : { s: { c: 0, r: 0 } };
var stack = [], e1, e2, type, c, ixti, nameidx, r;
if (!formula[0] || !formula[0][0]) return "";
//console.log("--",cell,formula[0])
for (var ff = 0, fflen = formula[0].length; ff < fflen; ++ff) {
var f = formula[0][ff];
//console.log("++",f, stack)
switch (f[0]) {
/* 2.2.2.1 Unary Operator Tokens */
/* 2.5.198.93 */
case 'PtgUminus': stack.push("-" + stack.pop()); break;
/* 2.5.198.95 */
case 'PtgUplus': stack.push("+" + stack.pop()); break;
/* 2.5.198.81 */
case 'PtgPercent': stack.push(stack.pop() + "%"); break; /* 2.2.2.1 Binary Value Operator Token */
/* 2.5.198.26 */
case 'PtgAdd':
e1 = stack.pop(); e2 = stack.pop();
stack.push(e2 + "+" + e1);
break;
/* 2.5.198.90 */
case 'PtgSub':
e1 = stack.pop(); e2 = stack.pop();
stack.push(e2 + "-" + e1);
break;
/* 2.5.198.75 */
case 'PtgMul':
e1 = stack.pop(); e2 = stack.pop();
stack.push(e2 + "*" + e1);
break;
/* 2.5.198.45 */
case 'PtgDiv':
e1 = stack.pop(); e2 = stack.pop();
stack.push(e2 + "/" + e1);
break;
/* 2.5.198.82 */
case 'PtgPower':
e1 = stack.pop(); e2 = stack.pop();
stack.push(e2 + "^" + e1);
break;
/* 2.5.198.43 */
case 'PtgConcat':
e1 = stack.pop(); e2 = stack.pop();
stack.push(e2 + "&" + e1);
break;
/* 2.5.198.69 */
case 'PtgLt':
e1 = stack.pop(); e2 = stack.pop();
stack.push(e2 + "<" + e1);
break;
/* 2.5.198.68 */
case 'PtgLe':
e1 = stack.pop(); e2 = stack.pop();
stack.push(e2 + "<=" + e1);
break;
/* 2.5.198.56 */
case 'PtgEq':
e1 = stack.pop(); e2 = stack.pop();
stack.push(e2 + "=" + e1);
break;
/* 2.5.198.64 */
case 'PtgGe':
e1 = stack.pop(); e2 = stack.pop();
stack.push(e2 + ">=" + e1);
break;
/* 2.5.198.65 */
case 'PtgGt':
e1 = stack.pop(); e2 = stack.pop();
stack.push(e2 + ">" + e1);
break;
/* 2.5.198.78 */
case 'PtgNe':
e1 = stack.pop(); e2 = stack.pop();
stack.push(e2 + "<>" + e1);
break; /* 2.2.2.1 Binary Reference Operator Token */
/* 2.5.198.67 */
case 'PtgIsect':
e1 = stack.pop(); e2 = stack.pop();
stack.push(e2 + " " + e1);
break;
case 'PtgUnion':
e1 = stack.pop(); e2 = stack.pop();
stack.push(e2 + "," + e1);
break;
case 'PtgRange': break; /* 2.2.2.3 Control Tokens "can be ignored" */
/* 2.5.198.34 */
case 'PtgAttrChoose': break;
/* 2.5.198.35 */
case 'PtgAttrGoto': break;
/* 2.5.198.36 */
case 'PtgAttrIf': break; /* 2.5.198.84 */
case 'PtgRef':
type = f[1][0]; c = shift_cell_xls(decode_cell(encode_cell(f[1][1])), _range);
stack.push(encode_cell(c));
break;
/* 2.5.198.88 */
case 'PtgRefN':
type = f[1][0]; c = shift_cell_xls(decode_cell(encode_cell(f[1][1])), cell);
stack.push(encode_cell(c));
break;
case 'PtgRef3d': // TODO: lots of stuff
type = f[1][0]; ixti = f[1][1]; c = shift_cell_xls(f[1][2], _range);
stack.push(supbooks[1][ixti + 1] + "!" + encode_cell(c));
break; /* Function Call */
/* 2.5.198.62 */
case 'PtgFunc':
/* 2.5.198.63 */
case 'PtgFuncVar':
/* f[1] = [argc, func] */
var argc = f[1][0], func = f[1][1];
if (!argc) argc = 0;
var args = stack.slice(-argc);
stack.length -= argc;
if (func === 'User') func = args.shift();
stack.push(func + "(" + args.join(",") + ")");
break; /* 2.5.198.42 */
case 'PtgBool': stack.push(f[1] ? "TRUE" : "FALSE"); break;
/* 2.5.198.66 */
case 'PtgInt': stack.push(f[1]); break;
/* 2.5.198.79 TODO: precision? */
case 'PtgNum': stack.push(String(f[1])); break;
/* 2.5.198.89 */
case 'PtgStr': stack.push('"' + f[1] + '"'); break;
/* 2.5.198.57 */
case 'PtgErr': stack.push(f[1]); break;
/* 2.5.198.27 TODO: fixed points */
case 'PtgArea':
type = f[1][0]; r = shift_range_xls(f[1][1], _range);
stack.push(encode_range(r));
break;
/* 2.5.198.28 */
case 'PtgArea3d': // TODO: lots of stuff
type = f[1][0]; ixti = f[1][1]; r = f[1][2];
stack.push(supbooks[1][ixti + 1] + "!" + encode_range(r));
break;
/* 2.5.198.41 */
case 'PtgAttrSum':
stack.push("SUM(" + stack.pop() + ")");
break; /* Expression Prefixes */
/* 2.5.198.37 */
case 'PtgAttrSemi': break; /* 2.5.97.60 TODO: do something different for revisions */
case 'PtgName':
/* f[1] = type, 0, nameindex */
nameidx = f[1][2];
var lbl = supbooks[0][nameidx];
var name = lbl.Name;
if (name in XLSXFutureFunctions) name = XLSXFutureFunctions[name];
stack.push(name);
break; /* 2.5.97.61 TODO: do something different for revisions */
case 'PtgNameX':
/* f[1] = type, ixti, nameindex */
var bookidx = f[1][1]; nameidx = f[1][2]; var externbook;
/* TODO: Properly handle missing values */
if (supbooks[bookidx + 1]) externbook = supbooks[bookidx + 1][nameidx];
else if (supbooks[bookidx - 1]) externbook = supbooks[bookidx - 1][nameidx];
if (!externbook) externbook = { body: "??NAMEX??" };
stack.push(externbook.body);
break; /* 2.2.2.4 Display Tokens */
/* 2.5.198.80 */
case 'PtgParen': stack.push('(' + stack.pop() + ')'); break; /* 2.5.198.86 */
case 'PtgRefErr': stack.push('#REF!'); break; /* */
/* 2.5.198.58 TODO */
case 'PtgExp':
c = { c: f[1][1], r: f[1][0] };
var q = { c: cell.c, r: cell.r };
if (supbooks.sharedf[encode_cell(c)]) {
var parsedf = (supbooks.sharedf[encode_cell(c)]);
stack.push(stringify_formula(parsedf, _range, q, supbooks, opts));
}
else {
var fnd = false;
for (e1 = 0; e1 != supbooks.arrayf.length; ++e1) {
/* TODO: should be something like range_has */
e2 = supbooks.arrayf[e1];
if (c.c < e2[0].s.c || c.c > e2[0].e.c) continue;
if (c.r < e2[0].s.r || c.r > e2[0].e.r) continue;
stack.push(stringify_formula(e2[1], _range, q, supbooks, opts));
}
if (!fnd) stack.push(f[1]);
}
break; /* 2.5.198.32 TODO */
case 'PtgArray':
stack.push("{" + f[1].map(mapper).join(";") + "}");
break; /* 2.2.2.5 Mem Tokens */
/* 2.5.198.70 TODO: confirm this is a non-display */
case 'PtgMemArea':
//stack.push("(" + f[2].map(encode_range).join(",") + ")");
break; /* 2.5.198.38 TODO */
case 'PtgAttrSpace': break; /* 2.5.198.92 TODO */
case 'PtgTbl': break; /* 2.5.198.71 */
case 'PtgMemErr': break; /* 2.5.198.74 */
case 'PtgMissArg':
stack.push("");
break; /* 2.5.198.29 TODO */
case 'PtgAreaErr': break; /* 2.5.198.31 TODO */
case 'PtgAreaN': stack.push(""); break; /* 2.5.198.87 TODO */
case 'PtgRefErr3d': break; /* 2.5.198.72 TODO */
case 'PtgMemFunc': break; default: throw 'Unrecognized Formula Token: ' + f;
}
//console.log("::",f, stack)
}
//console.log("--",stack);
return stack[0];
} /* [MS-XLSB] 2.5.97.4 CellParsedFormula TODO: use similar logic to js-xls */
function parse_XLSBCellParsedFormula(data, length) {
var cce = data.read_shift(4);
return parsenoop(data, length - 4);
}
/* [MS-XLS] 2.5.198.44 */
var PtgDataType = {
0x1: "REFERENCE", // reference to range
0x2: "VALUE", // single value
0x3: "ARRAY" // array of values
}; /* [MS-XLS] 2.5.198.4 */
var Cetab = {
0x0000: 'BEEP',
0x0001: 'OPEN',
0x0002: 'OPEN.LINKS',
0x0003: 'CLOSE.ALL',
0x0004: 'SAVE',
0x0005: 'SAVE.AS',
0x0006: 'FILE.DELETE',
0x0007: 'PAGE.SETUP',
0x0008: 'PRINT',
0x0009: 'PRINTER.SETUP',
0x000A: 'QUIT',
0x000B: 'NEW.WINDOW',
0x000C: 'ARRANGE.ALL',
0x000D: 'WINDOW.SIZE',
0x000E: 'WINDOW.MOVE',
0x000F: 'FULL',
0x0010: 'CLOSE',
0x0011: 'RUN',
0x0016: 'SET.PRINT.AREA',
0x0017: 'SET.PRINT.TITLES',
0x0018: 'SET.PAGE.BREAK',
0x0019: 'REMOVE.PAGE.BREAK',
0x001A: 'FONT',
0x001B: 'DISPLAY',
0x001C: 'PROTECT.DOCUMENT',
0x001D: 'PRECISION',
0x001E: 'A1.R1C1',
0x001F: 'CALCULATE.NOW',
0x0020: 'CALCULATION',
0x0022: 'DATA.FIND',
0x0023: 'EXTRACT',
0x0024: 'DATA.DELETE',
0x0025: 'SET.DATABASE',
0x0026: 'SET.CRITERIA',
0x0027: 'SORT',
0x0028: 'DATA.SERIES',
0x0029: 'TABLE',
0x002A: 'FORMAT.NUMBER',
0x002B: 'ALIGNMENT',
0x002C: 'STYLE',
0x002D: 'BORDER',
0x002E: 'CELL.PROTECTION',
0x002F: 'COLUMN.WIDTH',
0x0030: 'UNDO',
0x0031: 'CUT',
0x0032: 'COPY',
0x0033: 'PASTE',
0x0034: 'CLEAR',
0x0035: 'PASTE.SPECIAL',
0x0036: 'EDIT.DELETE',
0x0037: 'INSERT',
0x0038: 'FILL.RIGHT',
0x0039: 'FILL.DOWN',
0x003D: 'DEFINE.NAME',
0x003E: 'CREATE.NAMES',
0x003F: 'FORMULA.GOTO',
0x0040: 'FORMULA.FIND',
0x0041: 'SELECT.LAST.CELL',
0x0042: 'SHOW.ACTIVE.CELL',
0x0043: 'GALLERY.AREA',
0x0044: 'GALLERY.BAR',
0x0045: 'GALLERY.COLUMN',
0x0046: 'GALLERY.LINE',
0x0047: 'GALLERY.PIE',
0x0048: 'GALLERY.SCATTER',
0x0049: 'COMBINATION',
0x004A: 'PREFERRED',
0x004B: 'ADD.OVERLAY',
0x004C: 'GRIDLINES',
0x004D: 'SET.PREFERRED',
0x004E: 'AXES',
0x004F: 'LEGEND',
0x0050: 'ATTACH.TEXT',
0x0051: 'ADD.ARROW',
0x0052: 'SELECT.CHART',
0x0053: 'SELECT.PLOT.AREA',
0x0054: 'PATTERNS',
0x0055: 'MAIN.CHART',
0x0056: 'OVERLAY',
0x0057: 'SCALE',
0x0058: 'FORMAT.LEGEND',
0x0059: 'FORMAT.TEXT',
0x005A: 'EDIT.REPEAT',
0x005B: 'PARSE',
0x005C: 'JUSTIFY',
0x005D: 'HIDE',
0x005E: 'UNHIDE',
0x005F: 'WORKSPACE',
0x0060: 'FORMULA',
0x0061: 'FORMULA.FILL',
0x0062: 'FORMULA.ARRAY',
0x0063: 'DATA.FIND.NEXT',
0x0064: 'DATA.FIND.PREV',
0x0065: 'FORMULA.FIND.NEXT',
0x0066: 'FORMULA.FIND.PREV',
0x0067: 'ACTIVATE',
0x0068: 'ACTIVATE.NEXT',
0x0069: 'ACTIVATE.PREV',
0x006A: 'UNLOCKED.NEXT',
0x006B: 'UNLOCKED.PREV',
0x006C: 'COPY.PICTURE',
0x006D: 'SELECT',
0x006E: 'DELETE.NAME',
0x006F: 'DELETE.FORMAT',
0x0070: 'VLINE',
0x0071: 'HLINE',
0x0072: 'VPAGE',
0x0073: 'HPAGE',
0x0074: 'VSCROLL',
0x0075: 'HSCROLL',
0x0076: 'ALERT',
0x0077: 'NEW',
0x0078: 'CANCEL.COPY',
0x0079: 'SHOW.CLIPBOARD',
0x007A: 'MESSAGE',
0x007C: 'PASTE.LINK',
0x007D: 'APP.ACTIVATE',
0x007E: 'DELETE.ARROW',
0x007F: 'ROW.HEIGHT',
0x0080: 'FORMAT.MOVE',
0x0081: 'FORMAT.SIZE',
0x0082: 'FORMULA.REPLACE',
0x0083: 'SEND.KEYS',
0x0084: 'SELECT.SPECIAL',
0x0085: 'APPLY.NAMES',
0x0086: 'REPLACE.FONT',
0x0087: 'FREEZE.PANES',
0x0088: 'SHOW.INFO',
0x0089: 'SPLIT',
0x008A: 'ON.WINDOW',
0x008B: 'ON.DATA',
0x008C: 'DISABLE.INPUT',
0x008E: 'OUTLINE',
0x008F: 'LIST.NAMES',
0x0090: 'FILE.CLOSE',
0x0091: 'SAVE.WORKBOOK',
0x0092: 'DATA.FORM',
0x0093: 'COPY.CHART',
0x0094: 'ON.TIME',
0x0095: 'WAIT',
0x0096: 'FORMAT.FONT',
0x0097: 'FILL.UP',
0x0098: 'FILL.LEFT',
0x0099: 'DELETE.OVERLAY',
0x009B: 'SHORT.MENUS',
0x009F: 'SET.UPDATE.STATUS',
0x00A1: 'COLOR.PALETTE',
0x00A2: 'DELETE.STYLE',
0x00A3: 'WINDOW.RESTORE',
0x00A4: 'WINDOW.MAXIMIZE',
0x00A6: 'CHANGE.LINK',
0x00A7: 'CALCULATE.DOCUMENT',
0x00A8: 'ON.KEY',
0x00A9: 'APP.RESTORE',
0x00AA: 'APP.MOVE',
0x00AB: 'APP.SIZE',
0x00AC: 'APP.MINIMIZE',
0x00AD: 'APP.MAXIMIZE',
0x00AE: 'BRING.TO.FRONT',
0x00AF: 'SEND.TO.BACK',
0x00B9: 'MAIN.CHART.TYPE',
0x00BA: 'OVERLAY.CHART.TYPE',
0x00BB: 'SELECT.END',
0x00BC: 'OPEN.MAIL',
0x00BD: 'SEND.MAIL',
0x00BE: 'STANDARD.FONT',
0x00BF: 'CONSOLIDATE',
0x00C0: 'SORT.SPECIAL',
0x00C1: 'GALLERY.3D.AREA',
0x00C2: 'GALLERY.3D.COLUMN',
0x00C3: 'GALLERY.3D.LINE',
0x00C4: 'GALLERY.3D.PIE',
0x00C5: 'VIEW.3D',
0x00C6: 'GOAL.SEEK',
0x00C7: 'WORKGROUP',
0x00C8: 'FILL.GROUP',
0x00C9: 'UPDATE.LINK',
0x00CA: 'PROMOTE',
0x00CB: 'DEMOTE',
0x00CC: 'SHOW.DETAIL',
0x00CE: 'UNGROUP',
0x00CF: 'OBJECT.PROPERTIES',
0x00D0: 'SAVE.NEW.OBJECT',
0x00D1: 'SHARE',
0x00D2: 'SHARE.NAME',
0x00D3: 'DUPLICATE',
0x00D4: 'APPLY.STYLE',
0x00D5: 'ASSIGN.TO.OBJECT',
0x00D6: 'OBJECT.PROTECTION',
0x00D7: 'HIDE.OBJECT',
0x00D8: 'SET.EXTRACT',
0x00D9: 'CREATE.PUBLISHER',
0x00DA: 'SUBSCRIBE.TO',
0x00DB: 'ATTRIBUTES',
0x00DC: 'SHOW.TOOLBAR',
0x00DE: 'PRINT.PREVIEW',
0x00DF: 'EDIT.COLOR',
0x00E0: 'SHOW.LEVELS',
0x00E1: 'FORMAT.MAIN',
0x00E2: 'FORMAT.OVERLAY',
0x00E3: 'ON.RECALC',
0x00E4: 'EDIT.SERIES',
0x00E5: 'DEFINE.STYLE',
0x00F0: 'LINE.PRINT',
0x00F3: 'ENTER.DATA',
0x00F9: 'GALLERY.RADAR',
0x00FA: 'MERGE.STYLES',
0x00FB: 'EDITION.OPTIONS',
0x00FC: 'PASTE.PICTURE',
0x00FD: 'PASTE.PICTURE.LINK',
0x00FE: 'SPELLING',
0x0100: 'ZOOM',
0x0103: 'INSERT.OBJECT',
0x0104: 'WINDOW.MINIMIZE',
0x0109: 'SOUND.NOTE',
0x010A: 'SOUND.PLAY',
0x010B: 'FORMAT.SHAPE',
0x010C: 'EXTEND.POLYGON',
0x010D: 'FORMAT.AUTO',
0x0110: 'GALLERY.3D.BAR',
0x0111: 'GALLERY.3D.SURFACE',
0x0112: 'FILL.AUTO',
0x0114: 'CUSTOMIZE.TOOLBAR',
0x0115: 'ADD.TOOL',
0x0116: 'EDIT.OBJECT',
0x0117: 'ON.DOUBLECLICK',
0x0118: 'ON.ENTRY',
0x0119: 'WORKBOOK.ADD',
0x011A: 'WORKBOOK.MOVE',
0x011B: 'WORKBOOK.COPY',
0x011C: 'WORKBOOK.OPTIONS',
0x011D: 'SAVE.WORKSPACE',
0x0120: 'CHART.WIZARD',
0x0121: 'DELETE.TOOL',
0x0122: 'MOVE.TOOL',
0x0123: 'WORKBOOK.SELECT',
0x0124: 'WORKBOOK.ACTIVATE',
0x0125: 'ASSIGN.TO.TOOL',
0x0127: 'COPY.TOOL',
0x0128: 'RESET.TOOL',
0x0129: 'CONSTRAIN.NUMERIC',
0x012A: 'PASTE.TOOL',
0x012E: 'WORKBOOK.NEW',
0x0131: 'SCENARIO.CELLS',
0x0132: 'SCENARIO.DELETE',
0x0133: 'SCENARIO.ADD',
0x0134: 'SCENARIO.EDIT',
0x0135: 'SCENARIO.SHOW',
0x0136: 'SCENARIO.SHOW.NEXT',
0x0137: 'SCENARIO.SUMMARY',
0x0138: 'PIVOT.TABLE.WIZARD',
0x0139: 'PIVOT.FIELD.PROPERTIES',
0x013A: 'PIVOT.FIELD',
0x013B: 'PIVOT.ITEM',
0x013C: 'PIVOT.ADD.FIELDS',
0x013E: 'OPTIONS.CALCULATION',
0x013F: 'OPTIONS.EDIT',
0x0140: 'OPTIONS.VIEW',
0x0141: 'ADDIN.MANAGER',
0x0142: 'MENU.EDITOR',
0x0143: 'ATTACH.TOOLBARS',
0x0144: 'VBAActivate',
0x0145: 'OPTIONS.CHART',
0x0148: 'VBA.INSERT.FILE',
0x014A: 'VBA.PROCEDURE.DEFINITION',
0x0150: 'ROUTING.SLIP',
0x0152: 'ROUTE.DOCUMENT',
0x0153: 'MAIL.LOGON',
0x0156: 'INSERT.PICTURE',
0x0157: 'EDIT.TOOL',
0x0158: 'GALLERY.DOUGHNUT',
0x015E: 'CHART.TREND',
0x0160: 'PIVOT.ITEM.PROPERTIES',
0x0162: 'WORKBOOK.INSERT',
0x0163: 'OPTIONS.TRANSITION',
0x0164: 'OPTIONS.GENERAL',
0x0172: 'FILTER.ADVANCED',
0x0175: 'MAIL.ADD.MAILER',
0x0176: 'MAIL.DELETE.MAILER',
0x0177: 'MAIL.REPLY',
0x0178: 'MAIL.REPLY.ALL',
0x0179: 'MAIL.FORWARD',
0x017A: 'MAIL.NEXT.LETTER',
0x017B: 'DATA.LABEL',
0x017C: 'INSERT.TITLE',
0x017D: 'FONT.PROPERTIES',
0x017E: 'MACRO.OPTIONS',
0x017F: 'WORKBOOK.HIDE',
0x0180: 'WORKBOOK.UNHIDE',
0x0181: 'WORKBOOK.DELETE',
0x0182: 'WORKBOOK.NAME',
0x0184: 'GALLERY.CUSTOM',
0x0186: 'ADD.CHART.AUTOFORMAT',
0x0187: 'DELETE.CHART.AUTOFORMAT',
0x0188: 'CHART.ADD.DATA',
0x0189: 'AUTO.OUTLINE',
0x018A: 'TAB.ORDER',
0x018B: 'SHOW.DIALOG',
0x018C: 'SELECT.ALL',
0x018D: 'UNGROUP.SHEETS',
0x018E: 'SUBTOTAL.CREATE',
0x018F: 'SUBTOTAL.REMOVE',
0x0190: 'RENAME.OBJECT',
0x019C: 'WORKBOOK.SCROLL',
0x019D: 'WORKBOOK.NEXT',
0x019E: 'WORKBOOK.PREV',
0x019F: 'WORKBOOK.TAB.SPLIT',
0x01A0: 'FULL.SCREEN',
0x01A1: 'WORKBOOK.PROTECT',
0x01A4: 'SCROLLBAR.PROPERTIES',
0x01A5: 'PIVOT.SHOW.PAGES',
0x01A6: 'TEXT.TO.COLUMNS',
0x01A7: 'FORMAT.CHARTTYPE',
0x01A8: 'LINK.FORMAT',
0x01A9: 'TRACER.DISPLAY',
0x01AE: 'TRACER.NAVIGATE',
0x01AF: 'TRACER.CLEAR',
0x01B0: 'TRACER.ERROR',
0x01B1: 'PIVOT.FIELD.GROUP',
0x01B2: 'PIVOT.FIELD.UNGROUP',
0x01B3: 'CHECKBOX.PROPERTIES',
0x01B4: 'LABEL.PROPERTIES',
0x01B5: 'LISTBOX.PROPERTIES',
0x01B6: 'EDITBOX.PROPERTIES',
0x01B7: 'PIVOT.REFRESH',
0x01B8: 'LINK.COMBO',
0x01B9: 'OPEN.TEXT',
0x01BA: 'HIDE.DIALOG',
0x01BB: 'SET.DIALOG.FOCUS',
0x01BC: 'ENABLE.OBJECT',
0x01BD: 'PUSHBUTTON.PROPERTIES',
0x01BE: 'SET.DIALOG.DEFAULT',
0x01BF: 'FILTER',
0x01C0: 'FILTER.SHOW.ALL',
0x01C1: 'CLEAR.OUTLINE',
0x01C2: 'FUNCTION.WIZARD',
0x01C3: 'ADD.LIST.ITEM',
0x01C4: 'SET.LIST.ITEM',
0x01C5: 'REMOVE.LIST.ITEM',
0x01C6: 'SELECT.LIST.ITEM',
0x01C7: 'SET.CONTROL.VALUE',
0x01C8: 'SAVE.COPY.AS',
0x01CA: 'OPTIONS.LISTS.ADD',
0x01CB: 'OPTIONS.LISTS.DELETE',
0x01CC: 'SERIES.AXES',
0x01CD: 'SERIES.X',
0x01CE: 'SERIES.Y',
0x01CF: 'ERRORBAR.X',
0x01D0: 'ERRORBAR.Y',
0x01D1: 'FORMAT.CHART',
0x01D2: 'SERIES.ORDER',
0x01D3: 'MAIL.LOGOFF',
0x01D4: 'CLEAR.ROUTING.SLIP',
0x01D5: 'APP.ACTIVATE.MICROSOFT',
0x01D6: 'MAIL.EDIT.MAILER',
0x01D7: 'ON.SHEET',
0x01D8: 'STANDARD.WIDTH',
0x01D9: 'SCENARIO.MERGE',
0x01DA: 'SUMMARY.INFO',
0x01DB: 'FIND.FILE',
0x01DC: 'ACTIVE.CELL.FONT',
0x01DD: 'ENABLE.TIPWIZARD',
0x01DE: 'VBA.MAKE.ADDIN',
0x01E0: 'INSERTDATATABLE',
0x01E1: 'WORKGROUP.OPTIONS',
0x01E2: 'MAIL.SEND.MAILER',
0x01E5: 'AUTOCORRECT',
0x01E9: 'POST.DOCUMENT',
0x01EB: 'PICKLIST',
0x01ED: 'VIEW.SHOW',
0x01EE: 'VIEW.DEFINE',
0x01EF: 'VIEW.DELETE',
0x01FD: 'SHEET.BACKGROUND',
0x01FE: 'INSERT.MAP.OBJECT',
0x01FF: 'OPTIONS.MENONO',
0x0205: 'MSOCHECKS',
0x0206: 'NORMAL',
0x0207: 'LAYOUT',
0x0208: 'RM.PRINT.AREA',
0x0209: 'CLEAR.PRINT.AREA',
0x020A: 'ADD.PRINT.AREA',
0x020B: 'MOVE.BRK',
0x0221: 'HIDECURR.NOTE',
0x0222: 'HIDEALL.NOTES',
0x0223: 'DELETE.NOTE',
0x0224: 'TRAVERSE.NOTES',
0x0225: 'ACTIVATE.NOTES',
0x026C: 'PROTECT.REVISIONS',
0x026D: 'UNPROTECT.REVISIONS',
0x0287: 'OPTIONS.ME',
0x028D: 'WEB.PUBLISH',
0x029B: 'NEWWEBQUERY',
0x02A1: 'PIVOT.TABLE.CHART',
0x02F1: 'OPTIONS.SAVE',
0x02F3: 'OPTIONS.SPELL',
0x0328: 'HIDEALL.INKANNOTS'
}; /* [MS-XLS] 2.5.198.17 */
var Ftab = {
0x0000: 'COUNT',
0x0001: 'IF',
0x0002: 'ISNA',
0x0003: 'ISERROR',
0x0004: 'SUM',
0x0005: 'AVERAGE',
0x0006: 'MIN',
0x0007: 'MAX',
0x0008: 'ROW',
0x0009: 'COLUMN',
0x000A: 'NA',
0x000B: 'NPV',
0x000C: 'STDEV',
0x000D: 'DOLLAR',
0x000E: 'FIXED',
0x000F: 'SIN',
0x0010: 'COS',
0x0011: 'TAN',
0x0012: 'ATAN',
0x0013: 'PI',
0x0014: 'SQRT',
0x0015: 'EXP',
0x0016: 'LN',
0x0017: 'LOG10',
0x0018: 'ABS',
0x0019: 'INT',
0x001A: 'SIGN',
0x001B: 'ROUND',
0x001C: 'LOOKUP',
0x001D: 'INDEX',
0x001E: 'REPT',
0x001F: 'MID',
0x0020: 'LEN',
0x0021: 'VALUE',
0x0022: 'TRUE',
0x0023: 'FALSE',
0x0024: 'AND',
0x0025: 'OR',
0x0026: 'NOT',
0x0027: 'MOD',
0x0028: 'DCOUNT',
0x0029: 'DSUM',
0x002A: 'DAVERAGE',
0x002B: 'DMIN',
0x002C: 'DMAX',
0x002D: 'DSTDEV',
0x002E: 'VAR',
0x002F: 'DVAR',
0x0030: 'TEXT',
0x0031: 'LINEST',
0x0032: 'TREND',
0x0033: 'LOGEST',
0x0034: 'GROWTH',
0x0035: 'GOTO',
0x0036: 'HALT',
0x0037: 'RETURN',
0x0038: 'PV',
0x0039: 'FV',
0x003A: 'NPER',
0x003B: 'PMT',
0x003C: 'RATE',
0x003D: 'MIRR',
0x003E: 'IRR',
0x003F: 'RAND',
0x0040: 'MATCH',
0x0041: 'DATE',
0x0042: 'TIME',
0x0043: 'DAY',
0x0044: 'MONTH',
0x0045: 'YEAR',
0x0046: 'WEEKDAY',
0x0047: 'HOUR',
0x0048: 'MINUTE',
0x0049: 'SECOND',
0x004A: 'NOW',
0x004B: 'AREAS',
0x004C: 'ROWS',
0x004D: 'COLUMNS',
0x004E: 'OFFSET',
0x004F: 'ABSREF',
0x0050: 'RELREF',
0x0051: 'ARGUMENT',
0x0052: 'SEARCH',
0x0053: 'TRANSPOSE',
0x0054: 'ERROR',
0x0055: 'STEP',
0x0056: 'TYPE',
0x0057: 'ECHO',
0x0058: 'SET.NAME',
0x0059: 'CALLER',
0x005A: 'DEREF',
0x005B: 'WINDOWS',
0x005C: 'SERIES',
0x005D: 'DOCUMENTS',
0x005E: 'ACTIVE.CELL',
0x005F: 'SELECTION',
0x0060: 'RESULT',
0x0061: 'ATAN2',
0x0062: 'ASIN',
0x0063: 'ACOS',
0x0064: 'CHOOSE',
0x0065: 'HLOOKUP',
0x0066: 'VLOOKUP',
0x0067: 'LINKS',
0x0068: 'INPUT',
0x0069: 'ISREF',
0x006A: 'GET.FORMULA',
0x006B: 'GET.NAME',
0x006C: 'SET.VALUE',
0x006D: 'LOG',
0x006E: 'EXEC',
0x006F: 'CHAR',
0x0070: 'LOWER',
0x0071: 'UPPER',
0x0072: 'PROPER',
0x0073: 'LEFT',
0x0074: 'RIGHT',
0x0075: 'EXACT',
0x0076: 'TRIM',
0x0077: 'REPLACE',
0x0078: 'SUBSTITUTE',
0x0079: 'CODE',
0x007A: 'NAMES',
0x007B: 'DIRECTORY',
0x007C: 'FIND',
0x007D: 'CELL',
0x007E: 'ISERR',
0x007F: 'ISTEXT',
0x0080: 'ISNUMBER',
0x0081: 'ISBLANK',
0x0082: 'T',
0x0083: 'N',
0x0084: 'FOPEN',
0x0085: 'FCLOSE',
0x0086: 'FSIZE',
0x0087: 'FREADLN',
0x0088: 'FREAD',
0x0089: 'FWRITELN',
0x008A: 'FWRITE',
0x008B: 'FPOS',
0x008C: 'DATEVALUE',
0x008D: 'TIMEVALUE',
0x008E: 'SLN',
0x008F: 'SYD',
0x0090: 'DDB',
0x0091: 'GET.DEF',
0x0092: 'REFTEXT',
0x0093: 'TEXTREF',
0x0094: 'INDIRECT',
0x0095: 'REGISTER',
0x0096: 'CALL',
0x0097: 'ADD.BAR',
0x0098: 'ADD.MENU',
0x0099: 'ADD.COMMAND',
0x009A: 'ENABLE.COMMAND',
0x009B: 'CHECK.COMMAND',
0x009C: 'RENAME.COMMAND',
0x009D: 'SHOW.BAR',
0x009E: 'DELETE.MENU',
0x009F: 'DELETE.COMMAND',
0x00A0: 'GET.CHART.ITEM',
0x00A1: 'DIALOG.BOX',
0x00A2: 'CLEAN',
0x00A3: 'MDETERM',
0x00A4: 'MINVERSE',
0x00A5: 'MMULT',
0x00A6: 'FILES',
0x00A7: 'IPMT',
0x00A8: 'PPMT',
0x00A9: 'COUNTA',
0x00AA: 'CANCEL.KEY',
0x00AB: 'FOR',
0x00AC: 'WHILE',
0x00AD: 'BREAK',
0x00AE: 'NEXT',
0x00AF: 'INITIATE',
0x00B0: 'REQUEST',
0x00B1: 'POKE',
0x00B2: 'EXECUTE',
0x00B3: 'TERMINATE',
0x00B4: 'RESTART',
0x00B5: 'HELP',
0x00B6: 'GET.BAR',
0x00B7: 'PRODUCT',
0x00B8: 'FACT',
0x00B9: 'GET.CELL',
0x00BA: 'GET.WORKSPACE',
0x00BB: 'GET.WINDOW',
0x00BC: 'GET.DOCUMENT',
0x00BD: 'DPRODUCT',
0x00BE: 'ISNONTEXT',
0x00BF: 'GET.NOTE',
0x00C0: 'NOTE',
0x00C1: 'STDEVP',
0x00C2: 'VARP',
0x00C3: 'DSTDEVP',
0x00C4: 'DVARP',
0x00C5: 'TRUNC',
0x00C6: 'ISLOGICAL',
0x00C7: 'DCOUNTA',
0x00C8: 'DELETE.BAR',
0x00C9: 'UNREGISTER',
0x00CC: 'USDOLLAR',
0x00CD: 'FINDB',
0x00CE: 'SEARCHB',
0x00CF: 'REPLACEB',
0x00D0: 'LEFTB',
0x00D1: 'RIGHTB',
0x00D2: 'MIDB',
0x00D3: 'LENB',
0x00D4: 'ROUNDUP',
0x00D5: 'ROUNDDOWN',
0x00D6: 'ASC',
0x00D7: 'DBCS',
0x00D8: 'RANK',
0x00DB: 'ADDRESS',
0x00DC: 'DAYS360',
0x00DD: 'TODAY',
0x00DE: 'VDB',
0x00DF: 'ELSE',
0x00E0: 'ELSE.IF',
0x00E1: 'END.IF',
0x00E2: 'FOR.CELL',
0x00E3: 'MEDIAN',
0x00E4: 'SUMPRODUCT',
0x00E5: 'SINH',
0x00E6: 'COSH',
0x00E7: 'TANH',
0x00E8: 'ASINH',
0x00E9: 'ACOSH',
0x00EA: 'ATANH',
0x00EB: 'DGET',
0x00EC: 'CREATE.OBJECT',
0x00ED: 'VOLATILE',
0x00EE: 'LAST.ERROR',
0x00EF: 'CUSTOM.UNDO',
0x00F0: 'CUSTOM.REPEAT',
0x00F1: 'FORMULA.CONVERT',
0x00F2: 'GET.LINK.INFO',
0x00F3: 'TEXT.BOX',
0x00F4: 'INFO',
0x00F5: 'GROUP',
0x00F6: 'GET.OBJECT',
0x00F7: 'DB',
0x00F8: 'PAUSE',
0x00FB: 'RESUME',
0x00FC: 'FREQUENCY',
0x00FD: 'ADD.TOOLBAR',
0x00FE: 'DELETE.TOOLBAR',
0x00FF: 'User',
0x0100: 'RESET.TOOLBAR',
0x0101: 'EVALUATE',
0x0102: 'GET.TOOLBAR',
0x0103: 'GET.TOOL',
0x0104: 'SPELLING.CHECK',
0x0105: 'ERROR.TYPE',
0x0106: 'APP.TITLE',
0x0107: 'WINDOW.TITLE',
0x0108: 'SAVE.TOOLBAR',
0x0109: 'ENABLE.TOOL',
0x010A: 'PRESS.TOOL',
0x010B: 'REGISTER.ID',
0x010C: 'GET.WORKBOOK',
0x010D: 'AVEDEV',
0x010E: 'BETADIST',
0x010F: 'GAMMALN',
0x0110: 'BETAINV',
0x0111: 'BINOMDIST',
0x0112: 'CHIDIST',
0x0113: 'CHIINV',
0x0114: 'COMBIN',
0x0115: 'CONFIDENCE',
0x0116: 'CRITBINOM',
0x0117: 'EVEN',
0x0118: 'EXPONDIST',
0x0119: 'FDIST',
0x011A: 'FINV',
0x011B: 'FISHER',
0x011C: 'FISHERINV',
0x011D: 'FLOOR',
0x011E: 'GAMMADIST',
0x011F: 'GAMMAINV',
0x0120: 'CEILING',
0x0121: 'HYPGEOMDIST',
0x0122: 'LOGNORMDIST',
0x0123: 'LOGINV',
0x0124: 'NEGBINOMDIST',
0x0125: 'NORMDIST',
0x0126: 'NORMSDIST',
0x0127: 'NORMINV',
0x0128: 'NORMSINV',
0x0129: 'STANDARDIZE',
0x012A: 'ODD',
0x012B: 'PERMUT',
0x012C: 'POISSON',
0x012D: 'TDIST',
0x012E: 'WEIBULL',
0x012F: 'SUMXMY2',
0x0130: 'SUMX2MY2',
0x0131: 'SUMX2PY2',
0x0132: 'CHITEST',
0x0133: 'CORREL',
0x0134: 'COVAR',
0x0135: 'FORECAST',
0x0136: 'FTEST',
0x0137: 'INTERCEPT',
0x0138: 'PEARSON',
0x0139: 'RSQ',
0x013A: 'STEYX',
0x013B: 'SLOPE',
0x013C: 'TTEST',
0x013D: 'PROB',
0x013E: 'DEVSQ',
0x013F: 'GEOMEAN',
0x0140: 'HARMEAN',
0x0141: 'SUMSQ',
0x0142: 'KURT',
0x0143: 'SKEW',
0x0144: 'ZTEST',
0x0145: 'LARGE',
0x0146: 'SMALL',
0x0147: 'QUARTILE',
0x0148: 'PERCENTILE',
0x0149: 'PERCENTRANK',
0x014A: 'MODE',
0x014B: 'TRIMMEAN',
0x014C: 'TINV',
0x014E: 'MOVIE.COMMAND',
0x014F: 'GET.MOVIE',
0x0150: 'CONCATENATE',
0x0151: 'POWER',
0x0152: 'PIVOT.ADD.DATA',
0x0153: 'GET.PIVOT.TABLE',
0x0154: 'GET.PIVOT.FIELD',
0x0155: 'GET.PIVOT.ITEM',
0x0156: 'RADIANS',
0x0157: 'DEGREES',
0x0158: 'SUBTOTAL',
0x0159: 'SUMIF',
0x015A: 'COUNTIF',
0x015B: 'COUNTBLANK',
0x015C: 'SCENARIO.GET',
0x015D: 'OPTIONS.LISTS.GET',
0x015E: 'ISPMT',
0x015F: 'DATEDIF',
0x0160: 'DATESTRING',
0x0161: 'NUMBERSTRING',
0x0162: 'ROMAN',
0x0163: 'OPEN.DIALOG',
0x0164: 'SAVE.DIALOG',
0x0165: 'VIEW.GET',
0x0166: 'GETPIVOTDATA',
0x0167: 'HYPERLINK',
0x0168: 'PHONETIC',
0x0169: 'AVERAGEA',
0x016A: 'MAXA',
0x016B: 'MINA',
0x016C: 'STDEVPA',
0x016D: 'VARPA',
0x016E: 'STDEVA',
0x016F: 'VARA',
0x0170: 'BAHTTEXT',
0x0171: 'THAIDAYOFWEEK',
0x0172: 'THAIDIGIT',
0x0173: 'THAIMONTHOFYEAR',
0x0174: 'THAINUMSOUND',
0x0175: 'THAINUMSTRING',
0x0176: 'THAISTRINGLENGTH',
0x0177: 'ISTHAIDIGIT',
0x0178: 'ROUNDBAHTDOWN',
0x0179: 'ROUNDBAHTUP',
0x017A: 'THAIYEAR',
0x017B: 'RTD'
};
var FtabArgc = {
0x0002: 1, /* ISNA */
0x0003: 1, /* ISERROR */
0x000F: 1, /* SIN */
0x0010: 1, /* COS */
0x0011: 1, /* TAN */
0x0012: 1, /* ATAN */
0x0014: 1, /* SQRT */
0x0015: 1, /* EXP */
0x0016: 1, /* LN */
0x0017: 1, /* LOG10 */
0x0018: 1, /* ABS */
0x0019: 1, /* INT */
0x001A: 1, /* SIGN */
0x001B: 2, /* ROUND */
0x001E: 2, /* REPT */
0x001F: 3, /* MID */
0x0020: 1, /* LEN */
0x0021: 1, /* VALUE */
0x0026: 1, /* NOT */
0x0027: 2, /* MOD */
0x0028: 3, /* DCOUNT */
0x0029: 3, /* DSUM */
0x002A: 3, /* DAVERAGE */
0x002B: 3, /* DMIN */
0x002C: 3, /* DMAX */
0x002D: 3, /* DSTDEV */
0x002F: 3, /* DVAR */
0x0030: 2, /* TEXT */
0x0035: 1, /* GOTO */
0x003D: 3, /* MIRR */
0x0041: 3, /* DATE */
0x0042: 3, /* TIME */
0x0043: 1, /* DAY */
0x0044: 1, /* MONTH */
0x0045: 1, /* YEAR */
0x0047: 1, /* HOUR */
0x0048: 1, /* MINUTE */
0x0049: 1, /* SECOND */
0x004B: 1, /* AREAS */
0x004C: 1, /* ROWS */
0x004D: 1, /* COLUMNS */
0x004F: 2, /* ABSREF */
0x0050: 2, /* RELREF */
0x0053: 1, /* TRANSPOSE */
0x0056: 1, /* TYPE */
0x005A: 1, /* DEREF */
0x0061: 2, /* ATAN2 */
0x0062: 1, /* ASIN */
0x0063: 1, /* ACOS */
0x0069: 1, /* ISREF */
0x006F: 1, /* CHAR */
0x0070: 1, /* LOWER */
0x0071: 1, /* UPPER */
0x0072: 1, /* PROPER */
0x0075: 2, /* EXACT */
0x0076: 1, /* TRIM */
0x0077: 4, /* REPLACE */
0x0079: 1, /* CODE */
0x007E: 1, /* ISERR */
0x007F: 1, /* ISTEXT */
0x0080: 1, /* ISNUMBER */
0x0081: 1, /* ISBLANK */
0x0082: 1, /* T */
0x0083: 1, /* N */
0x0085: 1, /* FCLOSE */
0x0086: 1, /* FSIZE */
0x0087: 1, /* FREADLN */
0x0088: 2, /* FREAD */
0x0089: 2, /* FWRITELN */
0x008A: 2, /* FWRITE */
0x008C: 1, /* DATEVALUE */
0x008D: 1, /* TIMEVALUE */
0x008E: 3, /* SLN */
0x008F: 4, /* SYD */
0x00A2: 1, /* CLEAN */
0x00A3: 1, /* MDETERM */
0x00A4: 1, /* MINVERSE */
0x00A5: 2, /* MMULT */
0x00AC: 1, /* WHILE */
0x00AF: 2, /* INITIATE */
0x00B0: 2, /* REQUEST */
0x00B1: 3, /* POKE */
0x00B2: 2, /* EXECUTE */
0x00B3: 1, /* TERMINATE */
0x00B8: 1, /* FACT */
0x00BD: 3, /* DPRODUCT */
0x00BE: 1, /* ISNONTEXT */
0x00C3: 3, /* DSTDEVP */
0x00C4: 3, /* DVARP */
0x00C6: 1, /* ISLOGICAL */
0x00C7: 3, /* DCOUNTA */
0x00C9: 1, /* UNREGISTER */
0x00CF: 4, /* REPLACEB */
0x00D2: 3, /* MIDB */
0x00D3: 1, /* LENB */
0x00D4: 2, /* ROUNDUP */
0x00D5: 2, /* ROUNDDOWN */
0x00D6: 1, /* ASC */
0x00D7: 1, /* DBCS */
0x00E5: 1, /* SINH */
0x00E6: 1, /* COSH */
0x00E7: 1, /* TANH */
0x00E8: 1, /* ASINH */
0x00E9: 1, /* ACOSH */
0x00EA: 1, /* ATANH */
0x00EB: 3, /* DGET */
0x00F4: 1, /* INFO */
0x00FC: 2, /* FREQUENCY */
0x0101: 1, /* EVALUATE */
0x0105: 1, /* ERROR.TYPE */
0x010F: 1, /* GAMMALN */
0x0111: 4, /* BINOMDIST */
0x0112: 2, /* CHIDIST */
0x0113: 2, /* CHIINV */
0x0114: 2, /* COMBIN */
0x0115: 3, /* CONFIDENCE */
0x0116: 3, /* CRITBINOM */
0x0117: 1, /* EVEN */
0x0118: 3, /* EXPONDIST */
0x0119: 3, /* FDIST */
0x011A: 3, /* FINV */
0x011B: 1, /* FISHER */
0x011C: 1, /* FISHERINV */
0x011D: 2, /* FLOOR */
0x011E: 4, /* GAMMADIST */
0x011F: 3, /* GAMMAINV */
0x0120: 2, /* CEILING */
0x0121: 4, /* HYPGEOMDIST */
0x0122: 3, /* LOGNORMDIST */
0x0123: 3, /* LOGINV */
0x0124: 3, /* NEGBINOMDIST */
0x0125: 4, /* NORMDIST */
0x0126: 1, /* NORMSDIST */
0x0127: 3, /* NORMINV */
0x0128: 1, /* NORMSINV */
0x0129: 3, /* STANDARDIZE */
0x012A: 1, /* ODD */
0x012B: 2, /* PERMUT */
0x012C: 3, /* POISSON */
0x012D: 3, /* TDIST */
0x012E: 4, /* WEIBULL */
0x012F: 2, /* SUMXMY2 */
0x0130: 2, /* SUMX2MY2 */
0x0131: 2, /* SUMX2PY2 */
0x0132: 2, /* CHITEST */
0x0133: 2, /* CORREL */
0x0134: 2, /* COVAR */
0x0135: 3, /* FORECAST */
0x0136: 2, /* FTEST */
0x0137: 2, /* INTERCEPT */
0x0138: 2, /* PEARSON */
0x0139: 2, /* RSQ */
0x013A: 2, /* STEYX */
0x013B: 2, /* SLOPE */
0x013C: 4, /* TTEST */
0x0145: 2, /* LARGE */
0x0146: 2, /* SMALL */
0x0147: 2, /* QUARTILE */
0x0148: 2, /* PERCENTILE */
0x014B: 2, /* TRIMMEAN */
0x014C: 2, /* TINV */
0x0151: 2, /* POWER */
0x0156: 1, /* RADIANS */
0x0157: 1, /* DEGREES */
0x015A: 2, /* COUNTIF */
0x015B: 1, /* COUNTBLANK */
0x015E: 4, /* ISPMT */
0x015F: 3, /* DATEDIF */
0x0160: 1, /* DATESTRING */
0x0161: 2, /* NUMBERSTRING */
0x0168: 1, /* PHONETIC */
0x0170: 1, /* BAHTTEXT */
0x0171: 1, /* THAIDAYOFWEEK */
0x0172: 1, /* THAIDIGIT */
0x0173: 1, /* THAIMONTHOFYEAR */
0x0174: 1, /* THAINUMSOUND */
0x0175: 1, /* THAINUMSTRING */
0x0176: 1, /* THAISTRINGLENGTH */
0x0177: 1, /* ISTHAIDIGIT */
0x0178: 1, /* ROUNDBAHTDOWN */
0x0179: 1, /* ROUNDBAHTUP */
0x017A: 1, /* THAIYEAR */
0xFFFF: 0
};
/* [MS-XLSX] 2.2.3 Functions */
var XLSXFutureFunctions = {
"_xlfn.ACOT": "ACOT",
"_xlfn.ACOTH": "ACOTH",
"_xlfn.AGGREGATE": "AGGREGATE",
"_xlfn.ARABIC": "ARABIC",
"_xlfn.AVERAGEIF": "AVERAGEIF",
"_xlfn.AVERAGEIFS": "AVERAGEIFS",
"_xlfn.BASE": "BASE",
"_xlfn.BETA.DIST": "BETA.DIST",
"_xlfn.BETA.INV": "BETA.INV",
"_xlfn.BINOM.DIST": "BINOM.DIST",
"_xlfn.BINOM.DIST.RANGE": "BINOM.DIST.RANGE",
"_xlfn.BINOM.INV": "BINOM.INV",
"_xlfn.BITAND": "BITAND",
"_xlfn.BITLSHIFT": "BITLSHIFT",
"_xlfn.BITOR": "BITOR",
"_xlfn.BITRSHIFT": "BITRSHIFT",
"_xlfn.BITXOR": "BITXOR",
"_xlfn.CEILING.MATH": "CEILING.MATH",
"_xlfn.CEILING.PRECISE": "CEILING.PRECISE",
"_xlfn.CHISQ.DIST": "CHISQ.DIST",
"_xlfn.CHISQ.DIST.RT": "CHISQ.DIST.RT",
"_xlfn.CHISQ.INV": "CHISQ.INV",
"_xlfn.CHISQ.INV.RT": "CHISQ.INV.RT",
"_xlfn.CHISQ.TEST": "CHISQ.TEST",
"_xlfn.COMBINA": "COMBINA",
"_xlfn.CONFIDENCE.NORM": "CONFIDENCE.NORM",
"_xlfn.CONFIDENCE.T": "CONFIDENCE.T",
"_xlfn.COT": "COT",
"_xlfn.COTH": "COTH",
"_xlfn.COUNTIFS": "COUNTIFS",
"_xlfn.COVARIANCE.P": "COVARIANCE.P",
"_xlfn.COVARIANCE.S": "COVARIANCE.S",
"_xlfn.CSC": "CSC",
"_xlfn.CSCH": "CSCH",
"_xlfn.DAYS": "DAYS",
"_xlfn.DECIMAL": "DECIMAL",
"_xlfn.ECMA.CEILING": "ECMA.CEILING",
"_xlfn.ERF.PRECISE": "ERF.PRECISE",
"_xlfn.ERFC.PRECISE": "ERFC.PRECISE",
"_xlfn.EXPON.DIST": "EXPON.DIST",
"_xlfn.F.DIST": "F.DIST",
"_xlfn.F.DIST.RT": "F.DIST.RT",
"_xlfn.F.INV": "F.INV",
"_xlfn.F.INV.RT": "F.INV.RT",
"_xlfn.F.TEST": "F.TEST",
"_xlfn.FILTERXML": "FILTERXML",
"_xlfn.FLOOR.MATH": "FLOOR.MATH",
"_xlfn.FLOOR.PRECISE": "FLOOR.PRECISE",
"_xlfn.FORMULATEXT": "FORMULATEXT",
"_xlfn.GAMMA": "GAMMA",
"_xlfn.GAMMA.DIST": "GAMMA.DIST",
"_xlfn.GAMMA.INV": "GAMMA.INV",
"_xlfn.GAMMALN.PRECISE": "GAMMALN.PRECISE",
"_xlfn.GAUSS": "GAUSS",
"_xlfn.HYPGEOM.DIST": "HYPGEOM.DIST",
"_xlfn.IFNA": "IFNA",
"_xlfn.IFERROR": "IFERROR",
"_xlfn.IMCOSH": "IMCOSH",
"_xlfn.IMCOT": "IMCOT",
"_xlfn.IMCSC": "IMCSC",
"_xlfn.IMCSCH": "IMCSCH",
"_xlfn.IMSEC": "IMSEC",
"_xlfn.IMSECH": "IMSECH",
"_xlfn.IMSINH": "IMSINH",
"_xlfn.IMTAN": "IMTAN",
"_xlfn.ISFORMULA": "ISFORMULA",
"_xlfn.ISO.CEILING": "ISO.CEILING",
"_xlfn.ISOWEEKNUM": "ISOWEEKNUM",
"_xlfn.LOGNORM.DIST": "LOGNORM.DIST",
"_xlfn.LOGNORM.INV": "LOGNORM.INV",
"_xlfn.MODE.MULT": "MODE.MULT",
"_xlfn.MODE.SNGL": "MODE.SNGL",
"_xlfn.MUNIT": "MUNIT",
"_xlfn.NEGBINOM.DIST": "NEGBINOM.DIST",
"_xlfn.NETWORKDAYS.INTL": "NETWORKDAYS.INTL",
"_xlfn.NIGBINOM": "NIGBINOM",
"_xlfn.NORM.DIST": "NORM.DIST",
"_xlfn.NORM.INV": "NORM.INV",
"_xlfn.NORM.S.DIST": "NORM.S.DIST",
"_xlfn.NORM.S.INV": "NORM.S.INV",
"_xlfn.NUMBERVALUE": "NUMBERVALUE",
"_xlfn.PDURATION": "PDURATION",
"_xlfn.PERCENTILE.EXC": "PERCENTILE.EXC",
"_xlfn.PERCENTILE.INC": "PERCENTILE.INC",
"_xlfn.PERCENTRANK.EXC": "PERCENTRANK.EXC",
"_xlfn.PERCENTRANK.INC": "PERCENTRANK.INC",
"_xlfn.PERMUTATIONA": "PERMUTATIONA",
"_xlfn.PHI": "PHI",
"_xlfn.POISSON.DIST": "POISSON.DIST",
"_xlfn.QUARTILE.EXC": "QUARTILE.EXC",
"_xlfn.QUARTILE.INC": "QUARTILE.INC",
"_xlfn.QUERYSTRING": "QUERYSTRING",
"_xlfn.RANK.AVG": "RANK.AVG",
"_xlfn.RANK.EQ": "RANK.EQ",
"_xlfn.RRI": "RRI",
"_xlfn.SEC": "SEC",
"_xlfn.SECH": "SECH",
"_xlfn.SHEET": "SHEET",
"_xlfn.SHEETS": "SHEETS",
"_xlfn.SKEW.P": "SKEW.P",
"_xlfn.STDEV.P": "STDEV.P",
"_xlfn.STDEV.S": "STDEV.S",
"_xlfn.SUMIFS": "SUMIFS",
"_xlfn.T.DIST": "T.DIST",
"_xlfn.T.DIST.2T": "T.DIST.2T",
"_xlfn.T.DIST.RT": "T.DIST.RT",
"_xlfn.T.INV": "T.INV",
"_xlfn.T.INV.2T": "T.INV.2T",
"_xlfn.T.TEST": "T.TEST",
"_xlfn.UNICHAR": "UNICHAR",
"_xlfn.UNICODE": "UNICODE",
"_xlfn.VAR.P": "VAR.P",
"_xlfn.VAR.S": "VAR.S",
"_xlfn.WEBSERVICE": "WEBSERVICE",
"_xlfn.WEIBULL.DIST": "WEIBULL.DIST",
"_xlfn.WORKDAY.INTL": "WORKDAY.INTL",
"_xlfn.XOR": "XOR",
"_xlfn.Z.TEST": "Z.TEST"
}; var strs = {}; // shared strings
var _ssfopts = {}; // spreadsheet formatting options RELS.WS = "http://schemas.openxmlformats.org/officeDocument/2006/relationships/worksheet"; function get_sst_id(sst, str) {
for (var i = 0, len = sst.length; i < len; ++i) if (sst[i].t === str) { sst.Count++; return i; }
sst[len] = { t: str }; sst.Count++; sst.Unique++; return len;
} function get_cell_style(styles, cell, opts) {
var z = opts.revssf[cell.z != null ? cell.z : "General"]; if (styles[cell.st].numFmtId == z) {
return cell.st;
} var len = styles.length; styles[len] = {
numFmtId: z,
fontId: styles[cell.st].fontId,
fillId: styles[cell.st].fillId,
borderId: styles[cell.st].borderId,
xfId: styles[cell.st].xfId,
applyFont: styles[cell.st].applyFont,
applyBorder: styles[cell.st].applyBorder,
applyFill: styles[cell.st].applyFill,
alignment: styles[cell.st].alignment
}; //for (var i = 0, len = styles.length; i != len; ++i) {
// if (styles[i].numFmtId === z) {
// return i;
// }
//} return len;
} function safe_format(p, fmtid, fillid, opts) {
try {
if (p.t === 'e') p.w = p.w || BErr[p.v];
else if (fmtid === 0) {
if (p.t === 'n') {
if ((p.v | 0) === p.v) p.w = SSF._general_int(p.v, _ssfopts);
else p.w = SSF._general_num(p.v, _ssfopts);
}
else if (p.t === 'd') {
var dd = datenum(p.v);
if ((dd | 0) === dd) p.w = SSF._general_int(dd, _ssfopts);
else p.w = SSF._general_num(dd, _ssfopts);
}
else if (p.v === undefined) return "";
else p.w = SSF._general(p.v, _ssfopts);
}
else if (p.t === 'd') p.w = SSF.format(fmtid, datenum(p.v), _ssfopts);
else p.w = SSF.format(fmtid, p.v, _ssfopts);
if (opts.cellNF) p.z = SSF._table[fmtid];
} catch (e) { if (opts.WTF) throw e; }
if (fillid) try {
p.s = styles.Fills[fillid];
if (p.s.fgColor && p.s.fgColor.theme) {
p.s.fgColor.rgb = rgb_tint(themes.themeElements.clrScheme[p.s.fgColor.theme].rgb, p.s.fgColor.tint || 0);
if (opts.WTF) p.s.fgColor.raw_rgb = themes.themeElements.clrScheme[p.s.fgColor.theme].rgb;
}
if (p.s.bgColor && p.s.bgColor.theme) {
p.s.bgColor.rgb = rgb_tint(themes.themeElements.clrScheme[p.s.bgColor.theme].rgb, p.s.bgColor.tint || 0);
if (opts.WTF) p.s.bgColor.raw_rgb = themes.themeElements.clrScheme[p.s.bgColor.theme].rgb;
}
} catch (e) { if (opts.WTF) throw e; }
}
function parse_ws_xml_dim(ws, s) {
var d = safe_decode_range(s);
if (d.s.r <= d.e.r && d.s.c <= d.e.c && d.s.r >= 0 && d.s.c >= 0) ws["!ref"] = encode_range(d);
}
var mergecregex = /<mergeCell ref="[A-Z0-9:]+"\s*\/>/g;
var sheetdataregex = /<(?:\w+:)?sheetData>([^\u2603]*)<\/(?:\w+:)?sheetData>/;
var hlinkregex = /<hyperlink[^>]*\/>/g;
var dimregex = /"(\w*:\w*)"/;
var colregex = /<col[^>]*\/>/g;
/* 18.3 Worksheets */
function parse_ws_xml(data, opts, rels) {
if (!data) return data;
/* 18.3.1.99 worksheet CT_Worksheet */
var s = {}; /* 18.3.1.35 dimension CT_SheetDimension ? */
var ridx = data.indexOf("<dimension");
if (ridx > 0) {
var ref = data.substr(ridx, 50).match(dimregex);
if (ref != null) parse_ws_xml_dim(s, ref[1]);
} /* 18.3.1.55 mergeCells CT_MergeCells */
var mergecells = [];
if (data.indexOf("</mergeCells>") !== -1) {
var merges = data.match(mergecregex);
for (ridx = 0; ridx != merges.length; ++ridx)
mergecells[ridx] = safe_decode_range(merges[ridx].substr(merges[ridx].indexOf("\"") + 1));
} /* 18.3.1.17 cols CT_Cols */
var columns = [];
if (opts.cellStyles && data.indexOf("</cols>") !== -1) {
/* 18.3.1.13 col CT_Col */
var cols = data.match(colregex);
parse_ws_xml_cols(columns, cols);
} var refguess = { s: { r: 1000000, c: 1000000 }, e: { r: 0, c: 0 } }; /* 18.3.1.80 sheetData CT_SheetData ? */
var mtch = data.match(sheetdataregex);
if (mtch) parse_ws_xml_data(mtch[1], s, opts, refguess); /* 18.3.1.48 hyperlinks CT_Hyperlinks */
if (data.indexOf("</hyperlinks>") !== -1) parse_ws_xml_hlinks(s, data.match(hlinkregex), rels); if (!s["!ref"] && refguess.e.c >= refguess.s.c && refguess.e.r >= refguess.s.r) s["!ref"] = encode_range(refguess);
if (opts.sheetRows > 0 && s["!ref"]) {
var tmpref = safe_decode_range(s["!ref"]);
if (opts.sheetRows < +tmpref.e.r) {
tmpref.e.r = opts.sheetRows - 1;
if (tmpref.e.r > refguess.e.r) tmpref.e.r = refguess.e.r;
if (tmpref.e.r < tmpref.s.r) tmpref.s.r = tmpref.e.r;
if (tmpref.e.c > refguess.e.c) tmpref.e.c = refguess.e.c;
if (tmpref.e.c < tmpref.s.c) tmpref.s.c = tmpref.e.c;
s["!fullref"] = s["!ref"];
s["!ref"] = encode_range(tmpref);
}
}
if (mergecells.length > 0) s["!merges"] = mergecells;
if (columns.length > 0) s["!cols"] = columns;
return s;
} function write_ws_xml_merges(merges) {
if (merges.length == 0) return "";
var o = '<mergeCells count="' + merges.length + '">';
for (var i = 0; i != merges.length; ++i) o += '<mergeCell ref="' + encode_range(merges[i].s, merges[i].e) + '"/>';
return o + '</mergeCells>';
} function parse_ws_xml_hlinks(s, data, rels) {
for (var i = 0; i != data.length; ++i) {
var val = parsexmltag(data[i], true);
if (!val.ref) return;
var rel = rels ? rels['!id'][val.id] : null;
if (rel) {
val.Target = rel.Target;
if (val.location) val.Target += "#" + val.location;
val.Rel = rel;
} else {
val.Target = val.location;
rel = { Target: val.location, TargetMode: 'Internal' };
val.Rel = rel;
}
var rng = safe_decode_range(val.ref);
for (var R = rng.s.r; R <= rng.e.r; ++R) for (var C = rng.s.c; C <= rng.e.c; ++C) {
var addr = encode_cell({ c: C, r: R });
if (!s[addr]) s[addr] = { t: "stub", v: undefined };
s[addr].l = val;
}
}
} function parse_ws_xml_cols(columns, cols) {
var seencol = false;
for (var coli = 0; coli != cols.length; ++coli) {
var coll = parsexmltag(cols[coli], true);
var colm = parseInt(coll.min, 10) - 1, colM = parseInt(coll.max, 10) - 1;
delete coll.min; delete coll.max;
if (!seencol && coll.width) { seencol = true; find_mdw(+coll.width, coll); }
if (coll.width) {
coll.wpx = width2px(+coll.width);
coll.wch = px2char(coll.wpx);
coll.MDW = MDW;
}
while (colm <= colM) columns[colm++] = coll;
}
} function write_ws_xml_frozen(ws, frozen) {
var o = ["<sheetViews><sheetView workbookViewId=\"0\" tabSelected=\"true\">"], col, width;
var n = encode_cell(frozen.topLeftCell)
var p = {
ySplit: frozen.ySplit,
activePane:"bottomLeft",
state: "frozen",
topLeftCell: n
};
o[o.length] = writextag('pane', null, p);
var selection = { pane: "bottomLeft" };
o[o.length] = writextag('selection', null, selection);
o[o.length] = "</sheetView>";
o[o.length] = "</sheetViews>";
return o.join("");
} function write_ws_xml_cols(ws, cols) {
var o = ["<cols>"], col, width;
for (var i = 0; i != cols.length; ++i) {
if (!(col = cols[i])) continue;
var p = { min: i + 1, max: i + 1 };
/* wch (chars), wpx (pixels) */
width = -1;
if (col.wpx) width = px2char(col.wpx);
else if (col.wch) width = col.wch;
if (width > -1) { p.width = char2width(width); p.customWidth = true; }
o[o.length] = (writextag('col', null, p));
}
o[o.length] = "</cols>";
return o.join("");
} function write_ws_xml_cell(cell, ref, ws, opts, idx, wb) {
if (cell.v === undefined) return "";
var vv = "";
var oldt = cell.t, oldv = cell.v;
switch (cell.t) {
case 'b': vv = cell.v ? "1" : "0"; break;
case 'n': vv = '' + cell.v; break;
case 'e': vv = BErr[cell.v]; break;
case 'd':
if (opts.cellDates) vv = new Date(cell.v).toISOString();
else {
cell.t = 'n';
vv = '' + (cell.v = datenum(cell.v));
if (typeof cell.z === 'undefined') cell.z = SSF._table[14];
}
break;
case 'p':
cell.t = 'n';
vv = Number(cell.v.substring(0, cell.v.length - 1)) / 100;
if (typeof cell.z === 'undefined') cell.z = SSF._table[10];
break;
default: vv = cell.v; break;
}
var v = writetag('v', escapexml(vv)), o = { r: ref };
/* TODO: cell style */
var os = get_cell_style(opts.cellXfs, cell, opts);
//if (os !== 0) o.s = os;
//opts.cellXfs[cell.st].NumberFmt = z;
o.s = os;
switch (cell.t) {
case 'n': o.t = "n";break;
case 'd': o.t = "d"; break;
case 'b': o.t = "b"; break;
case 'e': o.t = "e"; break;
default:
if (opts.bookSST) {
v = writetag('v', '' + get_sst_id(opts.Strings, cell.v));
o.t = "s"; break;
}
o.t = "str"; break;
}
if (cell.t != oldt) { cell.t = oldt; cell.v = oldv; }
return writextag('c', v, o);
} var parse_ws_xml_data = (function parse_ws_xml_data_factory() {
var cellregex = /<(?:\w+:)?c[ >]/, rowregex = /<\/(?:\w+:)?row>/;
var rregex = /r=["']([^"']*)["']/, isregex = /<is>([\S\s]*?)<\/is>/;
var match_v = matchtag("v"), match_f = matchtag("f"); return function parse_ws_xml_data(sdata, s, opts, guess) {
var ri = 0, x = "", cells = [], cref = [], idx = 0, i = 0, cc = 0, d = "", p;
var tag, tagr = 0, tagc = 0;
var sstr;
var fmtid = 0, fillid = 0, do_format = Array.isArray(styles.CellXf), cf;
for (var marr = sdata.split(rowregex), mt = 0, marrlen = marr.length; mt != marrlen; ++mt) {
x = marr[mt].trim();
var xlen = x.length;
if (xlen === 0) continue; /* 18.3.1.73 row CT_Row */
for (ri = 0; ri < xlen; ++ri) if (x.charCodeAt(ri) === 62) break; ++ri;
tag = parsexmltag(x.substr(0, ri), true);
/* SpreadSheetGear uses implicit r/c */
tagr = typeof tag.r !== 'undefined' ? parseInt(tag.r, 10) : tagr + 1; tagc = -1;
if (opts.sheetRows && opts.sheetRows < tagr) continue;
if (guess.s.r > tagr - 1) guess.s.r = tagr - 1;
if (guess.e.r < tagr - 1) guess.e.r = tagr - 1; /* 18.3.1.4 c CT_Cell */
cells = x.substr(ri).split(cellregex);
for (ri = typeof tag.r === 'undefined' ? 0 : 1; ri != cells.length; ++ri) {
x = cells[ri].trim();
if (x.length === 0) continue;
cref = x.match(rregex); idx = ri; i = 0; cc = 0;
x = "<c " + (x.substr(0, 1) == "<" ? ">" : "") + x;
if (cref !== null && cref.length === 2) {
idx = 0; d = cref[1];
for (i = 0; i != d.length; ++i) {
if ((cc = d.charCodeAt(i) - 64) < 1 || cc > 26) break;
idx = 26 * idx + cc;
}
--idx;
tagc = idx;
} else ++tagc;
for (i = 0; i != x.length; ++i) if (x.charCodeAt(i) === 62) break; ++i;
tag = parsexmltag(x.substr(0, i), true);
if (!tag.r) tag.r = utils.encode_cell({ r: tagr - 1, c: tagc });
d = x.substr(i);
p = { t: "" }; if ((cref = d.match(match_v)) !== null && cref[1] !== '') p.v = unescapexml(cref[1]);
if (opts.cellFormula && (cref = d.match(match_f)) !== null) p.f = unescapexml(cref[1]); /* SCHEMA IS ACTUALLY INCORRECT HERE. IF A CELL HAS NO T, EMIT "" */
if (tag.t === undefined && p.v === undefined) {
if (!opts.sheetStubs) continue;
p.t = "stub";
}
else p.t = tag.t || "n";
if (guess.s.c > idx) guess.s.c = idx;
if (guess.e.c < idx) guess.e.c = idx;
/* 18.18.11 t ST_CellType */
switch (p.t) {
case 'n': p.v = parseFloat(p.v); break;
case 's':
sstr = strs[parseInt(p.v, 10)];
p.v = sstr.t;
p.r = sstr.r;
if (opts.cellHTML) p.h = sstr.h;
break;
case 'str':
p.t = "s";
p.v = (p.v != null) ? utf8read(p.v) : '';
if (opts.cellHTML) p.h = p.v;
break;
case 'inlineStr':
cref = d.match(isregex);
p.t = 's';
if (cref !== null) { sstr = parse_si(cref[1]); p.v = sstr.t; } else p.v = "";
break; // inline string
case 'b': p.v = parsexmlbool(p.v); break;
case 'd':
if (!opts.cellDates) { p.v = datenum(p.v); p.t = 'n'; }
break;
/* error string in .v, number in .v */
case 'e': p.w = p.v; p.v = RBErr[p.v]; break;
}
/* formatting */
fmtid = fillid = 0;
if (do_format && tag.s !== undefined) {
cf = styles.CellXf[tag.s];
if (cf != null) {
if (cf.numFmtId != null) fmtid = cf.numFmtId;
if (opts.cellStyles && cf.fillId != null) fillid = cf.fillId;
}
}
safe_format(p, fmtid, fillid, opts);
s[tag.r] = p;
}
}
};
})(); function write_ws_xml_data(ws, opts, idx, wb) {
var o = [], r = [], range = safe_decode_range(ws['!ref']), cell, ref, rr = "", cols = [], R, C;
for (C = range.s.c; C <= range.e.c; ++C) cols[C] = encode_col(C);
for (R = range.s.r; R <= range.e.r; ++R) {
r = [];
rr = encode_row(R);
for (C = range.s.c; C <= range.e.c; ++C) {
ref = cols[C] + rr;
if (ws[ref] === undefined) continue;
if ((cell = write_ws_xml_cell(ws[ref], ref, ws, opts, idx, wb)) != null) r.push(cell);
}
if (r.length > 0)
if (ws['!rows'] !== undefined && ws['!rows'].length > 0) {
if (ws['!rows'][rr - 1] !== undefined) {
o[o.length] = (writextag('row', r.join(""), { r: rr, customHeight: "true", ht: ws['!rows'][rr - 1].wpx }));
} else {
o[o.length] = (writextag('row', r.join(""), { r: rr, customHeight: "true", ht: "25" }));
}
} else {
o[o.length] = (writextag('row', r.join(""), { r: rr, customHeight: "true", ht: "25" }));
}
}
return o.join("");
} var WS_XML_ROOT = writextag('worksheet', null, {
'xmlns': XMLNS.main[0],
'xmlns:r': XMLNS.r
}); function write_ws_xml(idx, opts, wb) {
var o = [XML_HEADER, WS_XML_ROOT];
var s = wb.SheetNames[idx], sidx = 0, rdata = "";
var ws = wb.Sheets[s];
if (ws === undefined) ws = {};
var ref = ws['!ref']; if (ref === undefined) ref = 'A1';
o[o.length] = (writextag('dimension', null, { 'ref': ref })); if (ws['!frozen'] !== undefined)
o[o.length] = (write_ws_xml_frozen(ws, ws['!frozen'])); if (ws['!cols'] !== undefined && ws['!cols'].length > 0)
o[o.length] = (write_ws_xml_cols(ws, ws['!cols']));
o[sidx = o.length] = '<sheetData/>';
if (ws['!ref'] !== undefined) {
rdata = write_ws_xml_data(ws, opts, idx, wb);
if (rdata.length > 0) o[o.length] = (rdata);
}
if (o.length > sidx + 1) { o[o.length] = ('</sheetData>'); o[sidx] = o[sidx].replace("/>", ">"); } if (ws['!merges'] !== undefined && ws['!merges'].length > 0) o[o.length] = (write_ws_xml_merges(ws['!merges'])); if (o.length > 2) { o[o.length] = ('</worksheet>'); o[1] = o[1].replace("/>", ">"); }
return o.join("");
} /* [MS-XLSB] 2.4.718 BrtRowHdr */
function parse_BrtRowHdr(data, length) {
var z = [];
z.r = data.read_shift(4);
data.l += length - 4;
return z;
} /* [MS-XLSB] 2.4.812 BrtWsDim */
var parse_BrtWsDim = parse_UncheckedRfX;
var write_BrtWsDim = write_UncheckedRfX; /* [MS-XLSB] 2.4.815 BrtWsProp */
function parse_BrtWsProp(data, length) {
var z = {};
/* TODO: pull flags */
data.l += 19;
z.name = parse_XLSBCodeName(data, length - 19);
return z;
} /* [MS-XLSB] 2.4.303 BrtCellBlank */
function parse_BrtCellBlank(data, length) {
var cell = parse_XLSBCell(data);
return [cell];
}
function write_BrtCellBlank(cell, val, o) {
if (o == null) o = new_buf(8);
return write_XLSBCell(val, o);
} /* [MS-XLSB] 2.4.304 BrtCellBool */
function parse_BrtCellBool(data, length) {
var cell = parse_XLSBCell(data);
var fBool = data.read_shift(1);
return [cell, fBool, 'b'];
} /* [MS-XLSB] 2.4.305 BrtCellError */
function parse_BrtCellError(data, length) {
var cell = parse_XLSBCell(data);
var fBool = data.read_shift(1);
return [cell, fBool, 'e'];
} /* [MS-XLSB] 2.4.308 BrtCellIsst */
function parse_BrtCellIsst(data, length) {
var cell = parse_XLSBCell(data);
var isst = data.read_shift(4);
return [cell, isst, 's'];
} /* [MS-XLSB] 2.4.310 BrtCellReal */
function parse_BrtCellReal(data, length) {
var cell = parse_XLSBCell(data);
var value = parse_Xnum(data);
return [cell, value, 'n'];
} /* [MS-XLSB] 2.4.311 BrtCellRk */
function parse_BrtCellRk(data, length) {
var cell = parse_XLSBCell(data);
var value = parse_RkNumber(data);
return [cell, value, 'n'];
} /* [MS-XLSB] 2.4.314 BrtCellSt */
function parse_BrtCellSt(data, length) {
var cell = parse_XLSBCell(data);
var value = parse_XLWideString(data);
return [cell, value, 'str'];
} /* [MS-XLSB] 2.4.647 BrtFmlaBool */
function parse_BrtFmlaBool(data, length, opts) {
var cell = parse_XLSBCell(data);
var value = data.read_shift(1);
var o = [cell, value, 'b'];
if (opts.cellFormula) {
var formula = parse_XLSBCellParsedFormula(data, length - 9);
o[3] = ""; /* TODO */
}
else data.l += length - 9;
return o;
} /* [MS-XLSB] 2.4.648 BrtFmlaError */
function parse_BrtFmlaError(data, length, opts) {
var cell = parse_XLSBCell(data);
var value = data.read_shift(1);
var o = [cell, value, 'e'];
if (opts.cellFormula) {
var formula = parse_XLSBCellParsedFormula(data, length - 9);
o[3] = ""; /* TODO */
}
else data.l += length - 9;
return o;
} /* [MS-XLSB] 2.4.649 BrtFmlaNum */
function parse_BrtFmlaNum(data, length, opts) {
var cell = parse_XLSBCell(data);
var value = parse_Xnum(data);
var o = [cell, value, 'n'];
if (opts.cellFormula) {
var formula = parse_XLSBCellParsedFormula(data, length - 16);
o[3] = ""; /* TODO */
}
else data.l += length - 16;
return o;
} /* [MS-XLSB] 2.4.650 BrtFmlaString */
function parse_BrtFmlaString(data, length, opts) {
var start = data.l;
var cell = parse_XLSBCell(data);
var value = parse_XLWideString(data);
var o = [cell, value, 'str'];
if (opts.cellFormula) {
var formula = parse_XLSBCellParsedFormula(data, start + length - data.l);
}
else data.l = start + length;
return o;
} /* [MS-XLSB] 2.4.676 BrtMergeCell */
var parse_BrtMergeCell = parse_UncheckedRfX; /* [MS-XLSB] 2.4.656 BrtHLink */
function parse_BrtHLink(data, length, opts) {
var end = data.l + length;
var rfx = parse_UncheckedRfX(data, 16);
var relId = parse_XLNullableWideString(data);
var loc = parse_XLWideString(data);
var tooltip = parse_XLWideString(data);
var display = parse_XLWideString(data);
data.l = end;
return { rfx: rfx, relId: relId, loc: loc, tooltip: tooltip, display: display };
} /* [MS-XLSB] 2.1.7.61 Worksheet */
function parse_ws_bin(data, opts, rels) {
if (!data) return data;
if (!rels) rels = { '!id': {} };
var s = {}; var ref;
var refguess = { s: { r: 1000000, c: 1000000 }, e: { r: 0, c: 0 } }; var pass = false, end = false;
var row, p, cf, R, C, addr, sstr, rr;
var mergecells = [];
recordhopper(data, function ws_parse(val, R) {
if (end) return;
switch (R.n) {
case 'BrtWsDim': ref = val; break;
case 'BrtRowHdr':
row = val;
if (opts.sheetRows && opts.sheetRows <= row.r) end = true;
rr = encode_row(row.r);
break; case 'BrtFmlaBool':
case 'BrtFmlaError':
case 'BrtFmlaNum':
case 'BrtFmlaString':
case 'BrtCellBool':
case 'BrtCellError':
case 'BrtCellIsst':
case 'BrtCellReal':
case 'BrtCellRk':
case 'BrtCellSt':
p = { t: val[2] };
switch (val[2]) {
case 'n': p.v = val[1]; break;
case 's': sstr = strs[val[1]]; p.v = sstr.t; p.r = sstr.r; break;
case 'b': p.v = val[1] ? true : false; break;
case 'e': p.v = val[1]; p.w = BErr[p.v]; break;
case 'str': p.t = 's'; p.v = utf8read(val[1]); break;
}
if (opts.cellFormula && val.length > 3) p.f = val[3];
if ((cf = styles.CellXf[val[0].iStyleRef])) safe_format(p, cf.ifmt, null, opts);
s[encode_col(C = val[0].c) + rr] = p;
if (refguess.s.r > row.r) refguess.s.r = row.r;
if (refguess.s.c > C) refguess.s.c = C;
if (refguess.e.r < row.r) refguess.e.r = row.r;
if (refguess.e.c < C) refguess.e.c = C;
break; case 'BrtCellBlank': if (!opts.sheetStubs) break;
p = { t: 's', v: undefined };
s[encode_col(C = val[0].c) + rr] = p;
if (refguess.s.r > row.r) refguess.s.r = row.r;
if (refguess.s.c > C) refguess.s.c = C;
if (refguess.e.r < row.r) refguess.e.r = row.r;
if (refguess.e.c < C) refguess.e.c = C;
break; /* Merge Cells */
case 'BrtBeginMergeCells': break;
case 'BrtEndMergeCells': break;
case 'BrtMergeCell': mergecells.push(val); break; case 'BrtHLink':
var rel = rels['!id'][val.relId];
if (rel) {
val.Target = rel.Target;
if (val.loc) val.Target += "#" + val.loc;
val.Rel = rel;
}
for (R = val.rfx.s.r; R <= val.rfx.e.r; ++R) for (C = val.rfx.s.c; C <= val.rfx.e.c; ++C) {
addr = encode_cell({ c: C, r: R });
if (!s[addr]) s[addr] = { t: 's', v: undefined };
s[addr].l = val;
}
break; case 'BrtArrFmla': break; // TODO
case 'BrtShrFmla': break; // TODO
case 'BrtBeginSheet': break;
case 'BrtWsProp': break; // TODO
case 'BrtSheetCalcProp': break; // TODO
case 'BrtBeginWsViews': break; // TODO
case 'BrtBeginWsView': break; // TODO
case 'BrtPane': break; // TODO
case 'BrtSel': break; // TODO
case 'BrtEndWsView': break; // TODO
case 'BrtEndWsViews': break; // TODO
case 'BrtACBegin': break; // TODO
case 'BrtRwDescent': break; // TODO
case 'BrtACEnd': break; // TODO
case 'BrtWsFmtInfoEx14': break; // TODO
case 'BrtWsFmtInfo': break; // TODO
case 'BrtBeginColInfos': break; // TODO
case 'BrtColInfo': break; // TODO
case 'BrtEndColInfos': break; // TODO
case 'BrtBeginSheetData': break; // TODO
case 'BrtEndSheetData': break; // TODO
case 'BrtSheetProtection': break; // TODO
case 'BrtPrintOptions': break; // TODO
case 'BrtMargins': break; // TODO
case 'BrtPageSetup': break; // TODO
case 'BrtFRTBegin': pass = true; break;
case 'BrtFRTEnd': pass = false; break;
case 'BrtEndSheet': break; // TODO
case 'BrtDrawing': break; // TODO
case 'BrtLegacyDrawing': break; // TODO
case 'BrtLegacyDrawingHF': break; // TODO
case 'BrtPhoneticInfo': break; // TODO
case 'BrtBeginHeaderFooter': break; // TODO
case 'BrtEndHeaderFooter': break; // TODO
case 'BrtBrk': break; // TODO
case 'BrtBeginRwBrk': break; // TODO
case 'BrtEndRwBrk': break; // TODO
case 'BrtBeginColBrk': break; // TODO
case 'BrtEndColBrk': break; // TODO
case 'BrtBeginUserShViews': break; // TODO
case 'BrtBeginUserShView': break; // TODO
case 'BrtEndUserShView': break; // TODO
case 'BrtEndUserShViews': break; // TODO
case 'BrtBkHim': break; // TODO
case 'BrtBeginOleObjects': break; // TODO
case 'BrtOleObject': break; // TODO
case 'BrtEndOleObjects': break; // TODO
case 'BrtBeginListParts': break; // TODO
case 'BrtListPart': break; // TODO
case 'BrtEndListParts': break; // TODO
case 'BrtBeginSortState': break; // TODO
case 'BrtBeginSortCond': break; // TODO
case 'BrtEndSortCond': break; // TODO
case 'BrtEndSortState': break; // TODO
case 'BrtBeginConditionalFormatting': break; // TODO
case 'BrtEndConditionalFormatting': break; // TODO
case 'BrtBeginCFRule': break; // TODO
case 'BrtEndCFRule': break; // TODO
case 'BrtBeginDVals': break; // TODO
case 'BrtDVal': break; // TODO
case 'BrtEndDVals': break; // TODO
case 'BrtRangeProtection': break; // TODO
case 'BrtBeginDCon': break; // TODO
case 'BrtEndDCon': break; // TODO
case 'BrtBeginDRefs': break;
case 'BrtDRef': break;
case 'BrtEndDRefs': break; /* ActiveX */
case 'BrtBeginActiveXControls': break;
case 'BrtActiveX': break;
case 'BrtEndActiveXControls': break; /* AutoFilter */
case 'BrtBeginAFilter': break;
case 'BrtEndAFilter': break;
case 'BrtBeginFilterColumn': break;
case 'BrtBeginFilters': break;
case 'BrtFilter': break;
case 'BrtEndFilters': break;
case 'BrtEndFilterColumn': break;
case 'BrtDynamicFilter': break;
case 'BrtTop10Filter': break;
case 'BrtBeginCustomFilters': break;
case 'BrtCustomFilter': break;
case 'BrtEndCustomFilters': break; /* Smart Tags */
case 'BrtBeginSmartTags': break;
case 'BrtBeginCellSmartTags': break;
case 'BrtBeginCellSmartTag': break;
case 'BrtCellSmartTagProperty': break;
case 'BrtEndCellSmartTag': break;
case 'BrtEndCellSmartTags': break;
case 'BrtEndSmartTags': break; /* Cell Watch */
case 'BrtBeginCellWatches': break;
case 'BrtCellWatch': break;
case 'BrtEndCellWatches': break; /* Table */
case 'BrtTable': break; /* Ignore Cell Errors */
case 'BrtBeginCellIgnoreECs': break;
case 'BrtCellIgnoreEC': break;
case 'BrtEndCellIgnoreECs': break; default: if (!pass || opts.WTF) throw new Error("Unexpected record " + R.n);
}
}, opts);
if (!s["!ref"] && (refguess.s.r < 1000000 || ref.e.r > 0 || ref.e.c > 0 || ref.s.r > 0 || ref.s.c > 0)) s["!ref"] = encode_range(ref);
if (opts.sheetRows && s["!ref"]) {
var tmpref = safe_decode_range(s["!ref"]);
if (opts.sheetRows < +tmpref.e.r) {
tmpref.e.r = opts.sheetRows - 1;
if (tmpref.e.r > refguess.e.r) tmpref.e.r = refguess.e.r;
if (tmpref.e.r < tmpref.s.r) tmpref.s.r = tmpref.e.r;
if (tmpref.e.c > refguess.e.c) tmpref.e.c = refguess.e.c;
if (tmpref.e.c < tmpref.s.c) tmpref.s.c = tmpref.e.c;
s["!fullref"] = s["!ref"];
s["!ref"] = encode_range(tmpref);
}
}
if (mergecells.length > 0) s["!merges"] = mergecells;
return s;
}
后部分代码
/* TODO: something useful -- this is a stub */
function write_ws_bin_cell(ba, cell, R, C, opts) {
if (cell.v === undefined) return "";
var vv = "";
switch (cell.t) {
case 'b': vv = cell.v ? "1" : "0"; break;
case 'n': case 'e': vv = '' + cell.v; break;
default: vv = cell.v; break;
}
var o = { r: R, c: C };
/* TODO: cell style */
o.s = get_cell_style(opts.cellXfs, cell, opts);
switch (cell.t) {
case 's': case 'str':
if (opts.bookSST) {
vv = get_sst_id(opts.Strings, cell.v);
o.t = "s"; break;
}
o.t = "str"; break;
case 'n': break;
case 'b': o.t = "b"; break;
case 'e': o.t = "e"; break;
}
write_record(ba, "BrtCellBlank", write_BrtCellBlank(cell, o));
} function write_CELLTABLE(ba, ws, idx, opts, wb) {
var range = safe_decode_range(ws['!ref'] || "A1"), ref, rr = "", cols = [];
write_record(ba, 'BrtBeginSheetData');
for (var R = range.s.r; R <= range.e.r; ++R) {
rr = encode_row(R);
/* [ACCELLTABLE] */
/* BrtRowHdr */
for (var C = range.s.c; C <= range.e.c; ++C) {
/* *16384CELL */
if (R === range.s.r) cols[C] = encode_col(C);
ref = cols[C] + rr;
if (!ws[ref]) continue;
/* write cell */
write_ws_bin_cell(ba, ws[ref], R, C, opts);
}
}
write_record(ba, 'BrtEndSheetData');
} function write_ws_bin(idx, opts, wb) {
var ba = buf_array();
var s = wb.SheetNames[idx], ws = wb.Sheets[s] || {};
var r = safe_decode_range(ws['!ref'] || "A1");
write_record(ba, "BrtBeginSheet");
/* [BrtWsProp] */
write_record(ba, "BrtWsDim", write_BrtWsDim(r));
/* [WSVIEWS2] */
/* [WSFMTINFO] */
/* *COLINFOS */
write_CELLTABLE(ba, ws, idx, opts, wb);
/* [BrtSheetCalcProp] */
/* [[BrtSheetProtectionIso] BrtSheetProtection] */
/* *([BrtRangeProtectionIso] BrtRangeProtection) */
/* [SCENMAN] */
/* [AUTOFILTER] */
/* [SORTSTATE] */
/* [DCON] */
/* [USERSHVIEWS] */
/* [MERGECELLS] */
/* [BrtPhoneticInfo] */
/* *CONDITIONALFORMATTING */
/* [DVALS] */
/* *BrtHLink */
/* [BrtPrintOptions] */
/* [BrtMargins] */
/* [BrtPageSetup] */
/* [HEADERFOOTER] */
/* [RWBRK] */
/* [COLBRK] */
/* *BrtBigName */
/* [CELLWATCHES] */
/* [IGNOREECS] */
/* [SMARTTAGS] */
/* [BrtDrawing] */
/* [BrtLegacyDrawing] */
/* [BrtLegacyDrawingHF] */
/* [BrtBkHim] */
/* [OLEOBJECTS] */
/* [ACTIVEXCONTROLS] */
/* [WEBPUBITEMS] */
/* [LISTPARTS] */
/* FRTWORKSHEET */
write_record(ba, "BrtEndSheet");
return ba.end();
}
/* 18.2.28 (CT_WorkbookProtection) Defaults */
var WBPropsDef = [
['allowRefreshQuery', '0'],
['autoCompressPictures', '1'],
['backupFile', '0'],
['checkCompatibility', '0'],
['codeName', ''],
['date1904', '0'],
['dateCompatibility', '1'],
//['defaultThemeVersion', '0'],
['filterPrivacy', '0'],
['hidePivotFieldList', '0'],
['promptedSolutions', '0'],
['publishItems', '0'],
['refreshAllConnections', false],
['saveExternalLinkValues', '1'],
['showBorderUnselectedTables', '1'],
['showInkAnnotation', '1'],
['showObjects', 'all'],
['showPivotChartFilter', '0']
//['updateLinks', 'userSet']
]; /* 18.2.30 (CT_BookView) Defaults */
var WBViewDef = [
['activeTab', '0'],
['autoFilterDateGrouping', '1'],
['firstSheet', '0'],
['minimized', '0'],
['showHorizontalScroll', '1'],
['showSheetTabs', '1'],
['showVerticalScroll', '1'],
['tabRatio', '600'],
['visibility', 'visible']
//window{Height,Width}, {x,y}Window
]; /* 18.2.19 (CT_Sheet) Defaults */
var SheetDef = [
['state', 'visible']
]; /* 18.2.2 (CT_CalcPr) Defaults */
var CalcPrDef = [
['calcCompleted', 'true'],
['calcMode', 'auto'],
['calcOnSave', 'true'],
['concurrentCalc', 'true'],
['fullCalcOnLoad', 'false'],
['fullPrecision', 'true'],
['iterate', 'false'],
['iterateCount', '100'],
['iterateDelta', '0.001'],
['refMode', 'A1']
]; /* 18.2.3 (CT_CustomWorkbookView) Defaults */
var CustomWBViewDef = [
['autoUpdate', 'false'],
['changesSavedWin', 'false'],
['includeHiddenRowCol', 'true'],
['includePrintSettings', 'true'],
['maximized', 'false'],
['minimized', 'false'],
['onlySync', 'false'],
['personalView', 'false'],
['showComments', 'commIndicator'],
['showFormulaBar', 'true'],
['showHorizontalScroll', 'true'],
['showObjects', 'all'],
['showSheetTabs', 'true'],
['showStatusbar', 'true'],
['showVerticalScroll', 'true'],
['tabRatio', '600'],
['xWindow', '0'],
['yWindow', '0']
]; function push_defaults_array(target, defaults) {
for (var j = 0; j != target.length; ++j) {
var w = target[j];
for (var i = 0; i != defaults.length; ++i) {
var z = defaults[i];
if (w[z[0]] == null) w[z[0]] = z[1];
}
}
}
function push_defaults(target, defaults) {
for (var i = 0; i != defaults.length; ++i) {
var z = defaults[i];
if (target[z[0]] == null) target[z[0]] = z[1];
}
} function parse_wb_defaults(wb) {
push_defaults(wb.WBProps, WBPropsDef);
push_defaults(wb.CalcPr, CalcPrDef); push_defaults_array(wb.WBView, WBViewDef);
push_defaults_array(wb.Sheets, SheetDef); _ssfopts.date1904 = parsexmlbool(wb.WBProps.date1904, 'date1904');
}
/* 18.2 Workbook */
var wbnsregex = /<\w+:workbook/;
function parse_wb_xml(data, opts) {
var wb = { AppVersion: {}, WBProps: {}, WBView: [], Sheets: [], CalcPr: {}, xmlns: "" };
var pass = false, xmlns = "xmlns";
data.match(tagregex).forEach(function xml_wb(x) {
var y = parsexmltag(x);
switch (strip_ns(y[0])) {
case '<?xml': break; /* 18.2.27 workbook CT_Workbook 1 */
case '<workbook':
if (x.match(wbnsregex)) xmlns = "xmlns" + x.match(/<(\w+):/)[1];
wb.xmlns = y[xmlns];
break;
case '</workbook>': break; /* 18.2.13 fileVersion CT_FileVersion ? */
case '<fileVersion': delete y[0]; wb.AppVersion = y; break;
case '<fileVersion/>': break; /* 18.2.12 fileSharing CT_FileSharing ? */
case '<fileSharing': case '<fileSharing/>': break; /* 18.2.28 workbookPr CT_WorkbookPr ? */
case '<workbookPr': delete y[0]; wb.WBProps = y; break;
case '<workbookPr/>': delete y[0]; wb.WBProps = y; break; /* 18.2.29 workbookProtection CT_WorkbookProtection ? */
case '<workbookProtection': break;
case '<workbookProtection/>': break; /* 18.2.1 bookViews CT_BookViews ? */
case '<bookViews>': case '</bookViews>': break;
/* 18.2.30 workbookView CT_BookView + */
case '<workbookView': delete y[0]; wb.WBView.push(y); break; /* 18.2.20 sheets CT_Sheets 1 */
case '<sheets>': case '</sheets>': break; // aggregate sheet
/* 18.2.19 sheet CT_Sheet + */
case '<sheet': delete y[0]; y.name = utf8read(y.name); wb.Sheets.push(y); break; /* 18.2.15 functionGroups CT_FunctionGroups ? */
case '<functionGroups': case '<functionGroups/>': break;
/* 18.2.14 functionGroup CT_FunctionGroup + */
case '<functionGroup': break; /* 18.2.9 externalReferences CT_ExternalReferences ? */
case '<externalReferences': case '</externalReferences>': case '<externalReferences>': break;
/* 18.2.8 externalReference CT_ExternalReference + */
case '<externalReference': break; /* 18.2.6 definedNames CT_DefinedNames ? */
case '<definedNames/>': break;
case '<definedNames>': case '<definedNames': pass = true; break;
case '</definedNames>': pass = false; break;
/* 18.2.5 definedName CT_DefinedName + */
case '<definedName': case '<definedName/>': case '</definedName>': break; /* 18.2.2 calcPr CT_CalcPr ? */
case '<calcPr': delete y[0]; wb.CalcPr = y; break;
case '<calcPr/>': delete y[0]; wb.CalcPr = y; break; /* 18.2.16 oleSize CT_OleSize ? (ref required) */
case '<oleSize': break; /* 18.2.4 customWorkbookViews CT_CustomWorkbookViews ? */
case '<customWorkbookViews>': case '</customWorkbookViews>': case '<customWorkbookViews': break;
/* 18.2.3 customWorkbookView CT_CustomWorkbookView + */
case '<customWorkbookView': case '</customWorkbookView>': break; /* 18.2.18 pivotCaches CT_PivotCaches ? */
case '<pivotCaches>': case '</pivotCaches>': case '<pivotCaches': break;
/* 18.2.17 pivotCache CT_PivotCache ? */
case '<pivotCache': break; /* 18.2.21 smartTagPr CT_SmartTagPr ? */
case '<smartTagPr': case '<smartTagPr/>': break; /* 18.2.23 smartTagTypes CT_SmartTagTypes ? */
case '<smartTagTypes': case '<smartTagTypes>': case '</smartTagTypes>': break;
/* 18.2.22 smartTagType CT_SmartTagType ? */
case '<smartTagType': break; /* 18.2.24 webPublishing CT_WebPublishing ? */
case '<webPublishing': case '<webPublishing/>': break; /* 18.2.11 fileRecoveryPr CT_FileRecoveryPr ? */
case '<fileRecoveryPr': case '<fileRecoveryPr/>': break; /* 18.2.26 webPublishObjects CT_WebPublishObjects ? */
case '<webPublishObjects>': case '<webPublishObjects': case '</webPublishObjects>': break;
/* 18.2.25 webPublishObject CT_WebPublishObject ? */
case '<webPublishObject': break; /* 18.2.10 extLst CT_ExtensionList ? */
case '<extLst>': case '</extLst>': case '<extLst/>': break;
/* 18.2.7 ext CT_Extension + */
case '<ext': pass = true; break; //TODO: check with versions of excel
case '</ext>': pass = false; break; /* Others */
case '<ArchID': break;
case '<AlternateContent': pass = true; break;
case '</AlternateContent>': pass = false; break; default: if (!pass && opts.WTF) throw 'unrecognized ' + y[0] + ' in workbook';
}
});
if (XMLNS.main.indexOf(wb.xmlns) === -1) throw new Error("Unknown Namespace: " + wb.xmlns); parse_wb_defaults(wb); return wb;
} var WB_XML_ROOT = writextag('workbook', null, {
'xmlns': XMLNS.main[0],
//'xmlns:mx': XMLNS.mx,
//'xmlns:s': XMLNS.main[0],
'xmlns:r': XMLNS.r
}); function safe1904(wb) {
/* TODO: store date1904 somewhere else */
try { return parsexmlbool(wb.Workbook.WBProps.date1904) ? "true" : "false"; } catch (e) { return "false"; }
} function write_wb_xml(wb, opts) {
var o = [XML_HEADER];
o[o.length] = WB_XML_ROOT;
o[o.length] = (writextag('workbookPr', null, { date1904: safe1904(wb) }));
o[o.length] = "<sheets>";
for (var i = 0; i != wb.SheetNames.length; ++i)
o[o.length] = (writextag('sheet', null, { name: wb.SheetNames[i].substr(0, 31), sheetId: "" + (i + 1), "r:id": "rId" + (i + 1) }));
o[o.length] = "</sheets>";
if (o.length > 2) { o[o.length] = '</workbook>'; o[1] = o[1].replace("/>", ">"); }
return o.join("");
}
/* [MS-XLSB] 2.4.301 BrtBundleSh */
function parse_BrtBundleSh(data, length) {
var z = {};
z.hsState = data.read_shift(4); //ST_SheetState
z.iTabID = data.read_shift(4);
z.strRelID = parse_RelID(data, length - 8);
z.name = parse_XLWideString(data);
return z;
}
function write_BrtBundleSh(data, o) {
if (!o) o = new_buf(127);
o.write_shift(4, data.hsState);
o.write_shift(4, data.iTabID);
write_RelID(data.strRelID, o);
write_XLWideString(data.name.substr(0, 31), o);
return o;
} /* [MS-XLSB] 2.4.807 BrtWbProp */
function parse_BrtWbProp(data, length) {
data.read_shift(4);
var dwThemeVersion = data.read_shift(4);
var strName = (length > 8) ? parse_XLWideString(data) : "";
return [dwThemeVersion, strName];
}
function write_BrtWbProp(data, o) {
if (!o) o = new_buf(8);
o.write_shift(4, 0);
o.write_shift(4, 0);
return o;
} function parse_BrtFRTArchID$(data, length) {
var o = {};
data.read_shift(4);
o.ArchID = data.read_shift(4);
data.l += length - 8;
return o;
} /* [MS-XLSB] 2.1.7.60 Workbook */
function parse_wb_bin(data, opts) {
var wb = { AppVersion: {}, WBProps: {}, WBView: [], Sheets: [], CalcPr: {}, xmlns: "" };
var pass = false, z; recordhopper(data, function hopper_wb(val, R) {
switch (R.n) {
case 'BrtBundleSh': wb.Sheets.push(val); break; case 'BrtBeginBook': break;
case 'BrtFileVersion': break;
case 'BrtWbProp': break;
case 'BrtACBegin': break;
case 'BrtAbsPath15': break;
case 'BrtACEnd': break;
case 'BrtWbFactoid': break;
/*case 'BrtBookProtectionIso': break;*/
case 'BrtBookProtection': break;
case 'BrtBeginBookViews': break;
case 'BrtBookView': break;
case 'BrtEndBookViews': break;
case 'BrtBeginBundleShs': break;
case 'BrtEndBundleShs': break;
case 'BrtBeginFnGroup': break;
case 'BrtEndFnGroup': break;
case 'BrtBeginExternals': break;
case 'BrtSupSelf': break;
case 'BrtSupBookSrc': break;
case 'BrtExternSheet': break;
case 'BrtEndExternals': break;
case 'BrtName': break;
case 'BrtCalcProp': break;
case 'BrtUserBookView': break;
case 'BrtBeginPivotCacheIDs': break;
case 'BrtBeginPivotCacheID': break;
case 'BrtEndPivotCacheID': break;
case 'BrtEndPivotCacheIDs': break;
case 'BrtWebOpt': break;
case 'BrtFileRecover': break;
case 'BrtFileSharing': break;
/*case 'BrtBeginWebPubItems': break;
case 'BrtBeginWebPubItem': break;
case 'BrtEndWebPubItem': break;
case 'BrtEndWebPubItems': break;*/ /* Smart Tags */
case 'BrtBeginSmartTagTypes': break;
case 'BrtSmartTagType': break;
case 'BrtEndSmartTagTypes': break; case 'BrtFRTBegin': pass = true; break;
case 'BrtFRTArchID$': break;
case 'BrtWorkBookPr15': break;
case 'BrtFRTEnd': pass = false; break;
case 'BrtEndBook': break;
default: if (!pass || opts.WTF) throw new Error("Unexpected record " + R.n);
}
}); parse_wb_defaults(wb); return wb;
} /* [MS-XLSB] 2.1.7.60 Workbook */
function write_BUNDLESHS(ba, wb, opts) {
write_record(ba, "BrtBeginBundleShs");
for (var idx = 0; idx != wb.SheetNames.length; ++idx) {
var d = { hsState: 0, iTabID: idx + 1, strRelID: 'rId' + (idx + 1), name: wb.SheetNames[idx] };
write_record(ba, "BrtBundleSh", write_BrtBundleSh(d));
}
write_record(ba, "BrtEndBundleShs");
} /* [MS-XLSB] 2.4.643 BrtFileVersion */
function write_BrtFileVersion(data, o) {
if (!o) o = new_buf(127);
for (var i = 0; i != 4; ++i) o.write_shift(4, 0);
write_XLWideString("SheetJS", o);
write_XLWideString(XLSX.version, o);
write_XLWideString(XLSX.version, o);
write_XLWideString("7262", o);
o.length = o.l;
return o;
} /* [MS-XLSB] 2.1.7.60 Workbook */
function write_BOOKVIEWS(ba, wb, opts) {
write_record(ba, "BrtBeginBookViews");
/* 1*(BrtBookView *FRT) */
write_record(ba, "BrtEndBookViews");
} /* [MS-XLSB] 2.4.302 BrtCalcProp */
function write_BrtCalcProp(data, o) {
if (!o) o = new_buf(26);
o.write_shift(4, 0); /* force recalc */
o.write_shift(4, 1);
o.write_shift(4, 0);
write_Xnum(0, o);
o.write_shift(-4, 1023);
o.write_shift(1, 0x33);
o.write_shift(1, 0x00);
return o;
} function write_BrtFileRecover(data, o) {
if (!o) o = new_buf(1);
o.write_shift(1, 0);
return o;
} /* [MS-XLSB] 2.1.7.60 Workbook */
function write_wb_bin(wb, opts) {
var ba = buf_array();
write_record(ba, "BrtBeginBook");
write_record(ba, "BrtFileVersion", write_BrtFileVersion());
/* [[BrtFileSharingIso] BrtFileSharing] */
write_record(ba, "BrtWbProp", write_BrtWbProp());
/* [ACABSPATH] */
/* [[BrtBookProtectionIso] BrtBookProtection] */
write_BOOKVIEWS(ba, wb, opts);
write_BUNDLESHS(ba, wb, opts);
/* [FNGROUP] */
/* [EXTERNALS] */
/* *BrtName */
write_record(ba, "BrtCalcProp", write_BrtCalcProp());
/* [BrtOleSize] */
/* *(BrtUserBookView *FRT) */
/* [PIVOTCACHEIDS] */
/* [BrtWbFactoid] */
/* [SMARTTAGTYPES] */
/* [BrtWebOpt] */
write_record(ba, "BrtFileRecover", write_BrtFileRecover());
/* [WEBPUBITEMS] */
/* [CRERRS] */
/* FRTWORKBOOK */
write_record(ba, "BrtEndBook"); return ba.end();
}
function parse_wb(data, name, opts) {
return (name.substr(-4) === ".bin" ? parse_wb_bin : parse_wb_xml)(data, opts);
} function parse_ws(data, name, opts, rels) {
return (name.substr(-4) === ".bin" ? parse_ws_bin : parse_ws_xml)(data, opts, rels);
} function parse_sty(data, name, opts) {
return (name.substr(-4) === ".bin" ? parse_sty_bin : parse_sty_xml)(data, opts);
} function parse_theme(data, name, opts) {
return parse_theme_xml(data, opts);
} function parse_sst(data, name, opts) {
return (name.substr(-4) === ".bin" ? parse_sst_bin : parse_sst_xml)(data, opts);
} function parse_cmnt(data, name, opts) {
return (name.substr(-4) === ".bin" ? parse_comments_bin : parse_comments_xml)(data, opts);
} function parse_cc(data, name, opts) {
return (name.substr(-4) === ".bin" ? parse_cc_bin : parse_cc_xml)(data, opts);
} function write_wb(wb, name, opts) {
return (name.substr(-4) === ".bin" ? write_wb_bin : write_wb_xml)(wb, opts);
} function write_ws(data, name, opts, wb) {
return (name.substr(-4) === ".bin" ? write_ws_bin : write_ws_xml)(data, opts, wb);
} function write_sty(data, name, opts) {
return (name.substr(-4) === ".bin" ? write_sty_bin : write_sty_xml)(data, opts);
} function write_sst(data, name, opts) {
return (name.substr(-4) === ".bin" ? write_sst_bin : write_sst_xml)(data, opts);
}
/*
function write_cmnt(data, name, opts) {
return (name.substr(-4)===".bin" ? write_comments_bin : write_comments_xml)(data, opts);
} function write_cc(data, name, opts) {
return (name.substr(-4)===".bin" ? write_cc_bin : write_cc_xml)(data, opts);
}
*/
var attregexg2 = /([\w:]+)=((?:")([^"]*)(?:")|(?:')([^']*)(?:'))/g;
var attregex2 = /([\w:]+)=((?:")(?:[^"]*)(?:")|(?:')(?:[^']*)(?:'))/;
var _chr = function (c) { return String.fromCharCode(c); };
function xlml_parsexmltag(tag, skip_root) {
var words = tag.split(/\s+/);
var z = []; if (!skip_root) z[0] = words[0];
if (words.length === 1) return z;
var m = tag.match(attregexg2), y, j, w, i;
if (m) for (i = 0; i != m.length; ++i) {
y = m[i].match(attregex2);
if ((j = y[1].indexOf(":")) === -1) z[y[1]] = y[2].substr(1, y[2].length - 2);
else {
if (y[1].substr(0, 6) === "xmlns:") w = "xmlns" + y[1].substr(6);
else w = y[1].substr(j + 1);
z[w] = y[2].substr(1, y[2].length - 2);
}
}
return z;
}
function xlml_parsexmltagobj(tag) {
var words = tag.split(/\s+/);
var z = {};
if (words.length === 1) return z;
var m = tag.match(attregexg2), y, j, w, i;
if (m) for (i = 0; i != m.length; ++i) {
y = m[i].match(attregex2);
if ((j = y[1].indexOf(":")) === -1) z[y[1]] = y[2].substr(1, y[2].length - 2);
else {
if (y[1].substr(0, 6) === "xmlns:") w = "xmlns" + y[1].substr(6);
else w = y[1].substr(j + 1);
z[w] = y[2].substr(1, y[2].length - 2);
}
}
return z;
} // ---- function xlml_format(format, value) {
var fmt = XLMLFormatMap[format] || unescapexml(format);
if (fmt === "General") return SSF._general(value);
return SSF.format(fmt, value);
} function xlml_set_custprop(Custprops, Rn, cp, val) {
switch ((cp[0].match(/dt:dt="([\w.]+)"/) || ["", ""])[1]) {
case "boolean": val = parsexmlbool(val); break;
case "i2": case "int": val = parseInt(val, 10); break;
case "r4": case "float": val = parseFloat(val); break;
case "date": case "dateTime.tz": val = new Date(val); break;
case "i8": case "string": case "fixed": case "uuid": case "bin.base64": break;
default: throw "bad custprop:" + cp[0];
}
Custprops[unescapexml(Rn[3])] = val;
} function safe_format_xlml(cell, nf, o) {
try {
if (cell.t === 'e') { cell.w = cell.w || BErr[cell.v]; }
else if (nf === "General") {
if (cell.t === 'n') {
if ((cell.v | 0) === cell.v) cell.w = SSF._general_int(cell.v);
else cell.w = SSF._general_num(cell.v);
}
else cell.w = SSF._general(cell.v);
}
else cell.w = xlml_format(nf || "General", cell.v);
if (o.cellNF) cell.z = XLMLFormatMap[nf] || nf || "General";
} catch (e) { if (o.WTF) throw e; }
} function process_style_xlml(styles, stag, opts) {
if (opts.cellStyles) {
if (stag.Interior) {
var I = stag.Interior;
if (I.Pattern) I.patternType = XLMLPatternTypeMap[I.Pattern] || I.Pattern;
}
}
styles[stag.ID] = stag;
} /* TODO: there must exist some form of OSP-blessed spec */
function parse_xlml_data(xml, ss, data, cell, base, styles, csty, row, o) {
var nf = "General", sid = cell.StyleID, S = {}; o = o || {};
var interiors = [];
if (sid === undefined && row) sid = row.StyleID;
if (sid === undefined && csty) sid = csty.StyleID;
while (styles[sid] !== undefined) {
if (styles[sid].nf) nf = styles[sid].nf;
if (styles[sid].Interior) interiors.push(styles[sid].Interior);
if (!styles[sid].Parent) break;
sid = styles[sid].Parent;
}
switch (data.Type) {
case 'Boolean':
cell.t = 'b';
cell.v = parsexmlbool(xml);
break;
case 'String':
cell.t = 's'; cell.r = xlml_fixstr(unescapexml(xml));
cell.v = xml.indexOf("<") > -1 ? ss : cell.r;
break;
case 'DateTime':
cell.v = (Date.parse(xml) - new Date(Date.UTC(1899, 11, 30))) / (24 * 60 * 60 * 1000);
if (cell.v !== cell.v) cell.v = unescapexml(xml);
else if (cell.v >= 1 && cell.v < 60) cell.v = cell.v - 1;
if (!nf || nf == "General") nf = "yyyy-mm-dd";
/* falls through */
case 'Number':
if (cell.v === undefined) cell.v = +xml;
if (!cell.t) cell.t = 'n';
break;
case 'Error': cell.t = 'e'; cell.v = RBErr[xml]; cell.w = xml; break;
default: cell.t = 's'; cell.v = xlml_fixstr(ss); break;
}
safe_format_xlml(cell, nf, o);
if (o.cellFormula != null && cell.Formula) {
cell.f = rc_to_a1(unescapexml(cell.Formula), base);
cell.Formula = undefined;
}
if (o.cellStyles) {
interiors.forEach(function (x) {
if (!S.patternType && x.patternType) S.patternType = x.patternType;
});
cell.s = S;
}
cell.ixfe = cell.StyleID !== undefined ? cell.StyleID : 'Default';
} function xlml_clean_comment(comment) {
comment.t = comment.v;
comment.v = comment.w = comment.ixfe = undefined;
} function xlml_normalize(d) {
if (has_buf && Buffer.isBuffer(d)) return d.toString('utf8');
if (typeof d === 'string') return d;
throw "badf";
} /* TODO: Everything */
var xlmlregex = /<(\/?)([a-z0-9]*:|)(\w+)[^>]*>/mg;
function parse_xlml_xml(d, opts) {
var str = xlml_normalize(d);
var Rn;
var state = [], tmp;
var sheets = {}, sheetnames = [], cursheet = {}, sheetname = "";
var table = {}, cell = {}, row = {}, dtag, didx;
var c = 0, r = 0;
var refguess = { s: { r: 1000000, c: 1000000 }, e: { r: 0, c: 0 } };
var styles = {}, stag = {};
var ss = "", fidx = 0;
var mergecells = [];
var Props = {}, Custprops = {}, pidx = 0, cp = {};
var comments = [], comment = {};
var cstys = [], csty;
xlmlregex.lastIndex = 0;
while ((Rn = xlmlregex.exec(str))) switch (Rn[3]) {
case 'Data':
if (state[state.length - 1][1]) break;
if (Rn[1] === '/') parse_xlml_data(str.slice(didx, Rn.index), ss, dtag, state[state.length - 1][0] == "Comment" ? comment : cell, { c: c, r: r }, styles, cstys[c], row, opts);
else { ss = ""; dtag = xlml_parsexmltag(Rn[0]); didx = Rn.index + Rn[0].length; }
break;
case 'Cell':
if (Rn[1] === '/') {
if (comments.length > 0) cell.c = comments;
if ((!opts.sheetRows || opts.sheetRows > r) && cell.v !== undefined) cursheet[encode_col(c) + encode_row(r)] = cell;
if (cell.HRef) {
cell.l = { Target: cell.HRef, tooltip: cell.HRefScreenTip };
cell.HRef = cell.HRefScreenTip = undefined;
}
if (cell.MergeAcross || cell.MergeDown) {
var cc = c + (parseInt(cell.MergeAcross, 10) | 0);
var rr = r + (parseInt(cell.MergeDown, 10) | 0);
mergecells.push({ s: { c: c, r: r }, e: { c: cc, r: rr } });
}
++c;
if (cell.MergeAcross) c += +cell.MergeAcross;
} else {
cell = xlml_parsexmltagobj(Rn[0]);
if (cell.Index) c = +cell.Index - 1;
if (c < refguess.s.c) refguess.s.c = c;
if (c > refguess.e.c) refguess.e.c = c;
if (Rn[0].substr(-2) === "/>")++c;
comments = [];
}
break;
case 'Row':
if (Rn[1] === '/' || Rn[0].substr(-2) === "/>") {
if (r < refguess.s.r) refguess.s.r = r;
if (r > refguess.e.r) refguess.e.r = r;
if (Rn[0].substr(-2) === "/>") {
row = xlml_parsexmltag(Rn[0]);
if (row.Index) r = +row.Index - 1;
}
c = 0; ++r;
} else {
row = xlml_parsexmltag(Rn[0]);
if (row.Index) r = +row.Index - 1;
}
break;
case 'Worksheet': /* TODO: read range from FullRows/FullColumns */
if (Rn[1] === '/') {
if ((tmp = state.pop())[0] !== Rn[3]) throw "Bad state: " + tmp;
sheetnames.push(sheetname);
if (refguess.s.r <= refguess.e.r && refguess.s.c <= refguess.e.c) cursheet["!ref"] = encode_range(refguess);
if (mergecells.length) cursheet["!merges"] = mergecells;
sheets[sheetname] = cursheet;
} else {
refguess = { s: { r: 1000000, c: 1000000 }, e: { r: 0, c: 0 } };
r = c = 0;
state.push([Rn[3], false]);
tmp = xlml_parsexmltag(Rn[0]);
sheetname = tmp.Name;
cursheet = {};
mergecells = [];
}
break;
case 'Table':
if (Rn[1] === '/') { if ((tmp = state.pop())[0] !== Rn[3]) throw "Bad state: " + tmp; }
else if (Rn[0].slice(-2) == "/>") break;
else {
table = xlml_parsexmltag(Rn[0]);
state.push([Rn[3], false]);
cstys = [];
}
break; case 'Style':
if (Rn[1] === '/') process_style_xlml(styles, stag, opts);
else stag = xlml_parsexmltag(Rn[0]);
break; case 'NumberFormat':
stag.nf = xlml_parsexmltag(Rn[0]).Format || "General";
break; case 'Column':
if (state[state.length - 1][0] !== 'Table') break;
csty = xlml_parsexmltag(Rn[0]);
cstys[(csty.Index - 1 || cstys.length)] = csty;
for (var i = 0; i < +csty.Span; ++i) cstys[cstys.length] = csty;
break; case 'NamedRange': break;
case 'NamedCell': break;
case 'B': break;
case 'I': break;
case 'U': break;
case 'S': break;
case 'Sub': break;
case 'Sup': break;
case 'Span': break;
case 'Border': break;
case 'Alignment': break;
case 'Borders': break;
case 'Font':
if (Rn[0].substr(-2) === "/>") break;
else if (Rn[1] === "/") ss += str.slice(fidx, Rn.index);
else fidx = Rn.index + Rn[0].length;
break;
case 'Interior':
if (!opts.cellStyles) break;
stag.Interior = xlml_parsexmltag(Rn[0]);
break;
case 'Protection': break; case 'Author':
case 'Title':
case 'Description':
case 'Created':
case 'Keywords':
case 'Subject':
case 'Category':
case 'Company':
case 'LastAuthor':
case 'LastSaved':
case 'LastPrinted':
case 'Version':
case 'Revision':
case 'TotalTime':
case 'HyperlinkBase':
case 'Manager':
if (Rn[0].substr(-2) === "/>") break;
else if (Rn[1] === "/") xlml_set_prop(Props, Rn[3], str.slice(pidx, Rn.index));
else pidx = Rn.index + Rn[0].length;
break;
case 'Paragraphs': break; case 'Styles':
case 'Workbook':
if (Rn[1] === '/') { if ((tmp = state.pop())[0] !== Rn[3]) throw "Bad state: " + tmp; }
else state.push([Rn[3], false]);
break; case 'Comment':
if (Rn[1] === '/') {
if ((tmp = state.pop())[0] !== Rn[3]) throw "Bad state: " + tmp;
xlml_clean_comment(comment);
comments.push(comment);
} else {
state.push([Rn[3], false]);
tmp = xlml_parsexmltag(Rn[0]);
comment = { a: tmp.Author };
}
break; case 'Name': break; case 'ComponentOptions':
case 'DocumentProperties':
case 'CustomDocumentProperties':
case 'OfficeDocumentSettings':
case 'PivotTable':
case 'PivotCache':
case 'Names':
case 'MapInfo':
case 'PageBreaks':
case 'QueryTable':
case 'DataValidation':
case 'AutoFilter':
case 'Sorting':
case 'Schema':
case 'data':
case 'ConditionalFormatting':
case 'SmartTagType':
case 'SmartTags':
case 'ExcelWorkbook':
case 'WorkbookOptions':
case 'WorksheetOptions':
if (Rn[1] === '/') { if ((tmp = state.pop())[0] !== Rn[3]) throw "Bad state: " + tmp; }
else if (Rn[0].charAt(Rn[0].length - 2) !== '/') state.push([Rn[3], true]);
break; default:
var seen = true;
switch (state[state.length - 1][0]) {
/* OfficeDocumentSettings */
case 'OfficeDocumentSettings': switch (Rn[3]) {
case 'AllowPNG': break;
case 'RemovePersonalInformation': break;
case 'DownloadComponents': break;
case 'LocationOfComponents': break;
case 'Colors': break;
case 'Color': break;
case 'Index': break;
case 'RGB': break;
case 'PixelsPerInch': break;
case 'TargetScreenSize': break;
case 'ReadOnlyRecommended': break;
default: seen = false;
} break; /* ComponentOptions */
case 'ComponentOptions': switch (Rn[3]) {
case 'Toolbar': break;
case 'HideOfficeLogo': break;
case 'SpreadsheetAutoFit': break;
case 'Label': break;
case 'Caption': break;
case 'MaxHeight': break;
case 'MaxWidth': break;
case 'NextSheetNumber': break;
default: seen = false;
} break; /* ExcelWorkbook */
case 'ExcelWorkbook': switch (Rn[3]) {
case 'WindowHeight': break;
case 'WindowWidth': break;
case 'WindowTopX': break;
case 'WindowTopY': break;
case 'TabRatio': break;
case 'ProtectStructure': break;
case 'ProtectWindows': break;
case 'ActiveSheet': break;
case 'DisplayInkNotes': break;
case 'FirstVisibleSheet': break;
case 'SupBook': break;
case 'SheetName': break;
case 'SheetIndex': break;
case 'SheetIndexFirst': break;
case 'SheetIndexLast': break;
case 'Dll': break;
case 'AcceptLabelsInFormulas': break;
case 'DoNotSaveLinkValues': break;
case 'Date1904': break;
case 'Iteration': break;
case 'MaxIterations': break;
case 'MaxChange': break;
case 'Path': break;
case 'Xct': break;
case 'Count': break;
case 'SelectedSheets': break;
case 'Calculation': break;
case 'Uncalced': break;
case 'StartupPrompt': break;
case 'Crn': break;
case 'ExternName': break;
case 'Formula': break;
case 'ColFirst': break;
case 'ColLast': break;
case 'WantAdvise': break;
case 'Boolean': break;
case 'Error': break;
case 'Text': break;
case 'OLE': break;
case 'NoAutoRecover': break;
case 'PublishObjects': break;
case 'DoNotCalculateBeforeSave': break;
case 'Number': break;
case 'RefModeR1C1': break;
case 'EmbedSaveSmartTags': break;
default: seen = false;
} break; /* WorkbookOptions */
case 'WorkbookOptions': switch (Rn[3]) {
case 'OWCVersion': break;
case 'Height': break;
case 'Width': break;
default: seen = false;
} break; /* WorksheetOptions */
case 'WorksheetOptions': switch (Rn[3]) {
case 'Unsynced': break;
case 'Visible': break;
case 'Print': break;
case 'Panes': break;
case 'Scale': break;
case 'Pane': break;
case 'Number': break;
case 'Layout': break;
case 'Header': break;
case 'Footer': break;
case 'PageSetup': break;
case 'PageMargins': break;
case 'Selected': break;
case 'ProtectObjects': break;
case 'EnableSelection': break;
case 'ProtectScenarios': break;
case 'ValidPrinterInfo': break;
case 'HorizontalResolution': break;
case 'VerticalResolution': break;
case 'NumberofCopies': break;
case 'ActiveRow': break;
case 'ActiveCol': break;
case 'ActivePane': break;
case 'TopRowVisible': break;
case 'TopRowBottomPane': break;
case 'LeftColumnVisible': break;
case 'LeftColumnRightPane': break;
case 'FitToPage': break;
case 'RangeSelection': break;
case 'PaperSizeIndex': break;
case 'PageLayoutZoom': break;
case 'PageBreakZoom': break;
case 'FilterOn': break;
case 'DoNotDisplayGridlines': break;
case 'SplitHorizontal': break;
case 'SplitVertical': break;
case 'FreezePanes': break;
case 'FrozenNoSplit': break;
case 'FitWidth': break;
case 'FitHeight': break;
case 'CommentsLayout': break;
case 'Zoom': break;
case 'LeftToRight': break;
case 'Gridlines': break;
case 'AllowSort': break;
case 'AllowFilter': break;
case 'AllowInsertRows': break;
case 'AllowDeleteRows': break;
case 'AllowInsertCols': break;
case 'AllowDeleteCols': break;
case 'AllowInsertHyperlinks': break;
case 'AllowFormatCells': break;
case 'AllowSizeCols': break;
case 'AllowSizeRows': break;
case 'NoSummaryRowsBelowDetail': break;
case 'TabColorIndex': break;
case 'DoNotDisplayHeadings': break;
case 'ShowPageLayoutZoom': break;
case 'NoSummaryColumnsRightDetail': break;
case 'BlackAndWhite': break;
case 'DoNotDisplayZeros': break;
case 'DisplayPageBreak': break;
case 'RowColHeadings': break;
case 'DoNotDisplayOutline': break;
case 'NoOrientation': break;
case 'AllowUsePivotTables': break;
case 'ZeroHeight': break;
case 'ViewableRange': break;
case 'Selection': break;
case 'ProtectContents': break;
default: seen = false;
} break; /* PivotTable */
case 'PivotTable': case 'PivotCache': switch (Rn[3]) {
case 'ImmediateItemsOnDrop': break;
case 'ShowPageMultipleItemLabel': break;
case 'CompactRowIndent': break;
case 'Location': break;
case 'PivotField': break;
case 'Orientation': break;
case 'LayoutForm': break;
case 'LayoutSubtotalLocation': break;
case 'LayoutCompactRow': break;
case 'Position': break;
case 'PivotItem': break;
case 'DataType': break;
case 'DataField': break;
case 'SourceName': break;
case 'ParentField': break;
case 'PTLineItems': break;
case 'PTLineItem': break;
case 'CountOfSameItems': break;
case 'Item': break;
case 'ItemType': break;
case 'PTSource': break;
case 'CacheIndex': break;
case 'ConsolidationReference': break;
case 'FileName': break;
case 'Reference': break;
case 'NoColumnGrand': break;
case 'NoRowGrand': break;
case 'BlankLineAfterItems': break;
case 'Hidden': break;
case 'Subtotal': break;
case 'BaseField': break;
case 'MapChildItems': break;
case 'Function': break;
case 'RefreshOnFileOpen': break;
case 'PrintSetTitles': break;
case 'MergeLabels': break;
case 'DefaultVersion': break;
case 'RefreshName': break;
case 'RefreshDate': break;
case 'RefreshDateCopy': break;
case 'VersionLastRefresh': break;
case 'VersionLastUpdate': break;
case 'VersionUpdateableMin': break;
case 'VersionRefreshableMin': break;
case 'Calculation': break;
default: seen = false;
} break; /* PageBreaks */
case 'PageBreaks': switch (Rn[3]) {
case 'ColBreaks': break;
case 'ColBreak': break;
case 'RowBreaks': break;
case 'RowBreak': break;
case 'ColStart': break;
case 'ColEnd': break;
case 'RowEnd': break;
default: seen = false;
} break; /* AutoFilter */
case 'AutoFilter': switch (Rn[3]) {
case 'AutoFilterColumn': break;
case 'AutoFilterCondition': break;
case 'AutoFilterAnd': break;
case 'AutoFilterOr': break;
default: seen = false;
} break; /* QueryTable */
case 'QueryTable': switch (Rn[3]) {
case 'Id': break;
case 'AutoFormatFont': break;
case 'AutoFormatPattern': break;
case 'QuerySource': break;
case 'QueryType': break;
case 'EnableRedirections': break;
case 'RefreshedInXl9': break;
case 'URLString': break;
case 'HTMLTables': break;
case 'Connection': break;
case 'CommandText': break;
case 'RefreshInfo': break;
case 'NoTitles': break;
case 'NextId': break;
case 'ColumnInfo': break;
case 'OverwriteCells': break;
case 'DoNotPromptForFile': break;
case 'TextWizardSettings': break;
case 'Source': break;
case 'Number': break;
case 'Decimal': break;
case 'ThousandSeparator': break;
case 'TrailingMinusNumbers': break;
case 'FormatSettings': break;
case 'FieldType': break;
case 'Delimiters': break;
case 'Tab': break;
case 'Comma': break;
case 'AutoFormatName': break;
case 'VersionLastEdit': break;
case 'VersionLastRefresh': break;
default: seen = false;
} break; /* Sorting */
case 'Sorting':
/* ConditionalFormatting */
case 'ConditionalFormatting':
/* DataValidation */
case 'DataValidation': switch (Rn[3]) {
case 'Range': break;
case 'Type': break;
case 'Min': break;
case 'Max': break;
case 'Sort': break;
case 'Descending': break;
case 'Order': break;
case 'CaseSensitive': break;
case 'Value': break;
case 'ErrorStyle': break;
case 'ErrorMessage': break;
case 'ErrorTitle': break;
case 'CellRangeList': break;
case 'InputMessage': break;
case 'InputTitle': break;
case 'ComboHide': break;
case 'InputHide': break;
case 'Condition': break;
case 'Qualifier': break;
case 'UseBlank': break;
case 'Value1': break;
case 'Value2': break;
case 'Format': break;
default: seen = false;
} break; /* MapInfo (schema) */
case 'MapInfo': case 'Schema': case 'data': switch (Rn[3]) {
case 'Map': break;
case 'Entry': break;
case 'Range': break;
case 'XPath': break;
case 'Field': break;
case 'XSDType': break;
case 'FilterOn': break;
case 'Aggregate': break;
case 'ElementType': break;
case 'AttributeType': break;
/* These are from xsd (XML Schema Definition) */
case 'schema':
case 'element':
case 'complexType':
case 'datatype':
case 'all':
case 'attribute':
case 'extends': break; case 'row': break;
default: seen = false;
} break; /* SmartTags (can be anything) */
case 'SmartTags': break; default: seen = false; break;
}
if (seen) break;
/* CustomDocumentProperties */
if (!state[state.length - 1][1]) throw 'Unrecognized tag: ' + Rn[3] + "|" + state.join("|");
if (state[state.length - 1][0] === 'CustomDocumentProperties') {
if (Rn[0].substr(-2) === "/>") break;
else if (Rn[1] === "/") xlml_set_custprop(Custprops, Rn, cp, str.slice(pidx, Rn.index));
else { cp = Rn; pidx = Rn.index + Rn[0].length; }
break;
}
if (opts.WTF) throw 'Unrecognized tag: ' + Rn[3] + "|" + state.join("|");
}
var out = {};
if (!opts.bookSheets && !opts.bookProps) out.Sheets = sheets;
out.SheetNames = sheetnames;
out.SSF = SSF.get_table();
out.Props = Props;
out.Custprops = Custprops;
return out;
} function parse_xlml(data, opts) {
fix_read_opts(opts = opts || {});
switch (opts.type || "base64") {
case "base64": return parse_xlml_xml(Base64.decode(data), opts);
case "binary": case "buffer": case "file": return parse_xlml_xml(data, opts);
case "array": return parse_xlml_xml(data.map(_chr).join(""), opts);
}
} function write_xlml(wb, opts) { } /* [MS-OLEDS] 2.3.8 CompObjStream */
function parse_compobj(obj) {
var v = {};
var o = obj.content; /* [MS-OLEDS] 2.3.7 CompObjHeader -- All fields MUST be ignored */
var l = 28, m;
m = __lpstr(o, l);
l += 4 + __readUInt32LE(o, l);
v.UserType = m; /* [MS-OLEDS] 2.3.1 ClipboardFormatOrAnsiString */
m = __readUInt32LE(o, l); l += 4;
switch (m) {
case 0x00000000: break;
case 0xffffffff: case 0xfffffffe: l += 4; break;
default:
if (m > 0x190) throw new Error("Unsupported Clipboard: " + m.toString(16));
l += m;
} m = __lpstr(o, l); l += m.length === 0 ? 0 : 5 + m.length; v.Reserved1 = m; if ((m = __readUInt32LE(o, l)) !== 0x71b2e9f4) return v;
throw "Unsupported Unicode Extension";
} /* 2.4.58 Continue logic */
function slurp(R, blob, length, opts) {
var l = length;
var bufs = [];
var d = blob.slice(blob.l, blob.l + l);
if (opts && opts.enc && opts.enc.insitu_decrypt) switch (R.n) {
case 'BOF': case 'FilePass': case 'FileLock': case 'InterfaceHdr': case 'RRDInfo': case 'RRDHead': case 'UsrExcl': break;
default:
if (d.length === 0) break;
opts.enc.insitu_decrypt(d);
}
bufs.push(d);
blob.l += l;
var next = (XLSRecordEnum[__readUInt16LE(blob, blob.l)]);
while (next != null && next.n === 'Continue') {
l = __readUInt16LE(blob, blob.l + 2);
bufs.push(blob.slice(blob.l + 4, blob.l + 4 + l));
blob.l += 4 + l;
next = (XLSRecordEnum[__readUInt16LE(blob, blob.l)]);
}
var b = bconcat(bufs);
prep_blob(b, 0);
var ll = 0; b.lens = [];
for (var j = 0; j < bufs.length; ++j) { b.lens.push(ll); ll += bufs[j].length; }
return R.f(b, b.length, opts);
} function safe_format_xf(p, opts, date1904) {
if (!p.XF) return;
try {
var fmtid = p.XF.ifmt || 0;
if (p.t === 'e') { p.w = p.w || BErr[p.v]; }
else if (fmtid === 0) {
if (p.t === 'n') {
if ((p.v | 0) === p.v) p.w = SSF._general_int(p.v);
else p.w = SSF._general_num(p.v);
}
else p.w = SSF._general(p.v);
}
else p.w = SSF.format(fmtid, p.v, { date1904: date1904 || false });
if (opts.cellNF) p.z = SSF._table[fmtid];
} catch (e) { if (opts.WTF) throw e; }
} function make_cell(val, ixfe, t) {
return { v: val, ixfe: ixfe, t: t };
} // 2.3.2
function parse_workbook(blob, options) {
var wb = { opts: {} };
var Sheets = {};
var out = {};
var Directory = {};
var found_sheet = false;
var range = {};
var last_formula = null;
var sst = [];
var cur_sheet = "";
var Preamble = {};
var lastcell, last_cell, cc, cmnt, rng, rngC, rngR;
var shared_formulae = {};
var array_formulae = []; /* TODO: something more clever */
var temp_val;
var country;
var cell_valid = true;
var XFs = []; /* XF records */
var palette = [];
var get_rgb = function getrgb(icv) {
if (icv < 8) return XLSIcv[icv];
if (icv < 64) return palette[icv - 8] || XLSIcv[icv];
return XLSIcv[icv];
};
var process_cell_style = function pcs(cell, line) {
var xfd = line.XF.data;
if (!xfd || !xfd.patternType) return;
line.s = {};
line.s.patternType = xfd.patternType;
var t;
if ((t = rgb2Hex(get_rgb(xfd.icvFore)))) { line.s.fgColor = { rgb: t }; }
if ((t = rgb2Hex(get_rgb(xfd.icvBack)))) { line.s.bgColor = { rgb: t }; }
};
var addcell = function addcell(cell, line, options) {
if (!cell_valid) return;
if (options.cellStyles && line.XF && line.XF.data) process_cell_style(cell, line);
lastcell = cell;
last_cell = encode_cell(cell);
if (range.s) {
if (cell.r < range.s.r) range.s.r = cell.r;
if (cell.c < range.s.c) range.s.c = cell.c;
}
if (range.e) {
if (cell.r + 1 > range.e.r) range.e.r = cell.r + 1;
if (cell.c + 1 > range.e.c) range.e.c = cell.c + 1;
}
if (options.sheetRows && lastcell.r >= options.sheetRows) cell_valid = false;
else out[last_cell] = line;
};
var opts = {
enc: false, // encrypted
sbcch: 0, // cch in the preceding SupBook
snames: [], // sheetnames
sharedf: shared_formulae, // shared formulae by address
arrayf: array_formulae, // array formulae array
rrtabid: [], // RRTabId
lastuser: "", // Last User from WriteAccess
biff: 8, // BIFF version
codepage: 0, // CP from CodePage record
winlocked: 0, // fLockWn from WinProtect
wtf: false
};
if (options.password) opts.password = options.password;
var mergecells = [];
var objects = [];
var supbooks = [[]]; // 1-indexed, will hold extern names
var sbc = 0, sbci = 0, sbcli = 0;
supbooks.SheetNames = opts.snames;
supbooks.sharedf = opts.sharedf;
supbooks.arrayf = opts.arrayf;
var last_Rn = '';
var file_depth = 0; /* TODO: make a real stack */ /* explicit override for some broken writers */
opts.codepage = 1200;
set_cp(1200); while (blob.l < blob.length - 1) {
var s = blob.l;
var RecordType = blob.read_shift(2);
if (RecordType === 0 && last_Rn === 'EOF') break;
var length = (blob.l === blob.length ? 0 : blob.read_shift(2)), y;
var R = XLSRecordEnum[RecordType];
if (R && R.f) {
if (options.bookSheets) {
if (last_Rn === 'BoundSheet8' && R.n !== 'BoundSheet8') break;
}
last_Rn = R.n;
if (R.r === 2 || R.r == 12) {
var rt = blob.read_shift(2); length -= 2;
if (!opts.enc && rt !== RecordType) throw "rt mismatch";
if (R.r == 12) { blob.l += 10; length -= 10; } // skip FRT
}
//console.error(R,blob.l,length,blob.length);
var val;
if (R.n === 'EOF') val = R.f(blob, length, opts);
else val = slurp(R, blob, length, opts);
var Rn = R.n;
/* BIFF5 overrides */
if (opts.biff === 5 || opts.biff === 2) switch (Rn) {
case 'Lbl': Rn = 'Label'; break;
}
/* nested switch statements to workaround V8 128 limit */
switch (Rn) {
/* Workbook Options */
case 'Date1904': wb.opts.Date1904 = val; break;
case 'WriteProtect': wb.opts.WriteProtect = true; break;
case 'FilePass':
if (!opts.enc) blob.l = 0;
opts.enc = val;
if (opts.WTF) console.error(val);
if (!options.password) throw new Error("File is password-protected");
if (val.Type !== 0) throw new Error("Encryption scheme unsupported");
if (!val.valid) throw new Error("Password is incorrect");
break;
case 'WriteAccess': opts.lastuser = val; break;
case 'FileSharing': break; //TODO
case 'CodePage':
/* overrides based on test cases */
if (val === 0x5212) val = 1200;
else if (val === 0x8001) val = 1252;
opts.codepage = val;
set_cp(val);
break;
case 'RRTabId': opts.rrtabid = val; break;
case 'WinProtect': opts.winlocked = val; break;
case 'Template': break; // TODO
case 'RefreshAll': wb.opts.RefreshAll = val; break;
case 'BookBool': break; // TODO
case 'UsesELFs': /* if(val) console.error("Unsupported ELFs"); */ break;
case 'MTRSettings': {
if (val[0] && val[1]) throw "Unsupported threads: " + val;
} break; // TODO: actually support threads
case 'CalcCount': wb.opts.CalcCount = val; break;
case 'CalcDelta': wb.opts.CalcDelta = val; break;
case 'CalcIter': wb.opts.CalcIter = val; break;
case 'CalcMode': wb.opts.CalcMode = val; break;
case 'CalcPrecision': wb.opts.CalcPrecision = val; break;
case 'CalcSaveRecalc': wb.opts.CalcSaveRecalc = val; break;
case 'CalcRefMode': opts.CalcRefMode = val; break; // TODO: implement R1C1
case 'Uncalced': break;
case 'ForceFullCalculation': wb.opts.FullCalc = val; break;
case 'WsBool': break; // TODO
case 'XF': XFs.push(val); break;
case 'ExtSST': break; // TODO
case 'BookExt': break; // TODO
case 'RichTextStream': break;
case 'BkHim': break; case 'SupBook': supbooks[++sbc] = [val]; sbci = 0; break;
case 'ExternName': supbooks[sbc][++sbci] = val; break;
case 'Index': break; // TODO
case 'Lbl': supbooks[0][++sbcli] = val; break;
case 'ExternSheet': supbooks[sbc] = supbooks[sbc].concat(val); sbci += val.length; break; case 'Protect': out["!protect"] = val; break; /* for sheet or book */
case 'Password': if (val !== 0 && opts.WTF) console.error("Password verifier: " + val); break;
case 'Prot4Rev': case 'Prot4RevPass': break; /*TODO: Revision Control*/ case 'BoundSheet8': {
Directory[val.pos] = val;
opts.snames.push(val.name);
} break;
case 'EOF': {
if (--file_depth) break;
if (range.e) {
out["!range"] = range;
if (range.e.r > 0 && range.e.c > 0) {
range.e.r--; range.e.c--;
out["!ref"] = encode_range(range);
range.e.r++; range.e.c++;
}
if (mergecells.length > 0) out["!merges"] = mergecells;
if (objects.length > 0) out["!objects"] = objects;
}
if (cur_sheet === "") Preamble = out; else Sheets[cur_sheet] = out;
out = {};
} break;
case 'BOF': {
if (opts.biff !== 8);
else if (val.BIFFVer === 0x0500) opts.biff = 5;
else if (val.BIFFVer === 0x0002) opts.biff = 2;
else if (val.BIFFVer === 0x0007) opts.biff = 2;
if (file_depth++) break;
cell_valid = true;
out = {};
if (opts.biff === 2) {
if (cur_sheet === "") cur_sheet = "Sheet1";
range = { s: { r: 0, c: 0 }, e: { r: 0, c: 0 } };
}
else cur_sheet = (Directory[s] || { name: "" }).name;
mergecells = [];
objects = [];
} break;
case 'Number': case 'BIFF2NUM': {
temp_val = { ixfe: val.ixfe, XF: XFs[val.ixfe], v: val.val, t: 'n' };
if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);
addcell({ c: val.c, r: val.r }, temp_val, options);
} break;
case 'BoolErr': {
temp_val = { ixfe: val.ixfe, XF: XFs[val.ixfe], v: val.val, t: val.t };
if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);
addcell({ c: val.c, r: val.r }, temp_val, options);
} break;
case 'RK': {
temp_val = { ixfe: val.ixfe, XF: XFs[val.ixfe], v: val.rknum, t: 'n' };
if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);
addcell({ c: val.c, r: val.r }, temp_val, options);
} break;
case 'MulRk': {
for (var j = val.c; j <= val.C; ++j) {
var ixfe = val.rkrec[j - val.c][0];
temp_val = { ixfe: ixfe, XF: XFs[ixfe], v: val.rkrec[j - val.c][1], t: 'n' };
if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);
addcell({ c: j, r: val.r }, temp_val, options);
}
} break;
case 'Formula': {
switch (val.val) {
case 'String': last_formula = val; break;
case 'Array Formula': throw "Array Formula unsupported";
default:
temp_val = { v: val.val, ixfe: val.cell.ixfe, t: val.tt };
temp_val.XF = XFs[temp_val.ixfe];
if (options.cellFormula) temp_val.f = "=" + stringify_formula(val.formula, range, val.cell, supbooks, opts);
if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);
addcell(val.cell, temp_val, options);
last_formula = val;
}
} break;
case 'String': {
if (last_formula) {
last_formula.val = val;
temp_val = { v: last_formula.val, ixfe: last_formula.cell.ixfe, t: 's' };
temp_val.XF = XFs[temp_val.ixfe];
if (options.cellFormula) temp_val.f = "=" + stringify_formula(last_formula.formula, range, last_formula.cell, supbooks, opts);
if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);
addcell(last_formula.cell, temp_val, options);
last_formula = null;
}
} break;
case 'Array': {
array_formulae.push(val);
} break;
case 'ShrFmla': {
if (!cell_valid) break;
//if(options.cellFormula) out[last_cell].f = stringify_formula(val[0], range, lastcell, supbooks, opts);
/* TODO: capture range */
shared_formulae[encode_cell(last_formula.cell)] = val[0];
} break;
case 'LabelSst':
//temp_val={v:sst[val.isst].t, ixfe:val.ixfe, t:'s'};
temp_val = make_cell(sst[val.isst].t, val.ixfe, 's');
temp_val.XF = XFs[temp_val.ixfe];
if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);
addcell({ c: val.c, r: val.r }, temp_val, options);
break;
case 'Label': case 'BIFF2STR':
/* Some writers erroneously write Label */
temp_val = make_cell(val.val, val.ixfe, 's');
temp_val.XF = XFs[temp_val.ixfe];
if (temp_val.XF) safe_format_xf(temp_val, options, wb.opts.Date1904);
addcell({ c: val.c, r: val.r }, temp_val, options);
break;
case 'Dimensions': {
if (file_depth === 1) range = val; /* TODO: stack */
} break;
case 'SST': {
sst = val;
} break;
case 'Format': { /* val = [id, fmt] */
SSF.load(val[1], val[0]);
} break; case 'MergeCells': mergecells = mergecells.concat(val); break; case 'Obj': objects[val.cmo[0]] = opts.lastobj = val; break;
case 'TxO': opts.lastobj.TxO = val; break; case 'HLink': {
for (rngR = val[0].s.r; rngR <= val[0].e.r; ++rngR)
for (rngC = val[0].s.c; rngC <= val[0].e.c; ++rngC)
if (out[encode_cell({ c: rngC, r: rngR })])
out[encode_cell({ c: rngC, r: rngR })].l = val[1];
} break;
case 'HLinkTooltip': {
for (rngR = val[0].s.r; rngR <= val[0].e.r; ++rngR)
for (rngC = val[0].s.c; rngC <= val[0].e.c; ++rngC)
if (out[encode_cell({ c: rngC, r: rngR })])
out[encode_cell({ c: rngC, r: rngR })].l.tooltip = val[1];
} break; /* Comments */
case 'Note': {
if (opts.biff <= 5 && opts.biff >= 2) break; /* TODO: BIFF5 */
cc = out[encode_cell(val[0])];
var noteobj = objects[val[2]];
if (!cc) break;
if (!cc.c) cc.c = [];
cmnt = { a: val[1], t: noteobj.TxO.t };
cc.c.push(cmnt);
} break; default: switch (R.n) { /* nested */
case 'ClrtClient': break;
case 'XFExt': update_xfext(XFs[val.ixfe], val.ext); break; case 'NameCmt': break;
case 'Header': break; // TODO
case 'Footer': break; // TODO
case 'HCenter': break; // TODO
case 'VCenter': break; // TODO
case 'Pls': break; // TODO
case 'Setup': break; // TODO
case 'DefColWidth': break; // TODO
case 'GCW': break;
case 'LHRecord': break;
case 'ColInfo': break; // TODO
case 'Row': break; // TODO
case 'DBCell': break; // TODO
case 'MulBlank': break; // TODO
case 'EntExU2': break; // TODO
case 'SxView': break; // TODO
case 'Sxvd': break; // TODO
case 'SXVI': break; // TODO
case 'SXVDEx': break; // TODO
case 'SxIvd': break; // TODO
case 'SXDI': break; // TODO
case 'SXLI': break; // TODO
case 'SXEx': break; // TODO
case 'QsiSXTag': break; // TODO
case 'Selection': break;
case 'Feat': break;
case 'FeatHdr': case 'FeatHdr11': break;
case 'Feature11': case 'Feature12': case 'List12': break;
case 'Blank': break;
case 'Country': country = val; break;
case 'RecalcId': break;
case 'DefaultRowHeight': case 'DxGCol': break; // TODO: htmlify
case 'Fbi': case 'Fbi2': case 'GelFrame': break;
case 'Font': break; // TODO
case 'XFCRC': break; // TODO
case 'Style': break; // TODO
case 'StyleExt': break; // TODO
case 'Palette': palette = val; break; // TODO
case 'Theme': break; // TODO
/* Protection */
case 'ScenarioProtect': break;
case 'ObjProtect': break; /* Conditional Formatting */
case 'CondFmt12': break; /* Table */
case 'Table': break; // TODO
case 'TableStyles': break; // TODO
case 'TableStyle': break; // TODO
case 'TableStyleElement': break; // TODO /* PivotTable */
case 'SXStreamID': break; // TODO
case 'SXVS': break; // TODO
case 'DConRef': break; // TODO
case 'SXAddl': break; // TODO
case 'DConBin': break; // TODO
case 'DConName': break; // TODO
case 'SXPI': break; // TODO
case 'SxFormat': break; // TODO
case 'SxSelect': break; // TODO
case 'SxRule': break; // TODO
case 'SxFilt': break; // TODO
case 'SxItm': break; // TODO
case 'SxDXF': break; // TODO /* Scenario Manager */
case 'ScenMan': break; /* Data Consolidation */
case 'DCon': break; /* Watched Cell */
case 'CellWatch': break; /* Print Settings */
case 'PrintRowCol': break;
case 'PrintGrid': break;
case 'PrintSize': break; case 'XCT': break;
case 'CRN': break; case 'Scl': {
//console.log("Zoom Level:", val[0]/val[1],val);
} break;
case 'SheetExt': { } break;
case 'SheetExtOptional': { } break; /* VBA */
case 'ObNoMacros': { } break;
case 'ObProj': { } break;
case 'CodeName': { } break;
case 'GUIDTypeLib': { } break; case 'WOpt': break; // TODO: WTF?
case 'PhoneticInfo': break; case 'OleObjectSize': break; /* Differential Formatting */
case 'DXF': case 'DXFN': case 'DXFN12': case 'DXFN12List': case 'DXFN12NoCB': break; /* Data Validation */
case 'Dv': case 'DVal': break; /* Data Series */
case 'BRAI': case 'Series': case 'SeriesText': break; /* Data Connection */
case 'DConn': break;
case 'DbOrParamQry': break;
case 'DBQueryExt': break; /* Formatting */
case 'IFmtRecord': break;
case 'CondFmt': case 'CF': case 'CF12': case 'CFEx': break; /* Explicitly Ignored */
case 'Excel9File': break;
case 'Units': break;
case 'InterfaceHdr': case 'Mms': case 'InterfaceEnd': case 'DSF': case 'BuiltInFnGroupCount':
/* View Stuff */
case 'Window1': case 'Window2': case 'HideObj': case 'GridSet': case 'Guts':
case 'UserBView': case 'UserSViewBegin': case 'UserSViewEnd':
case 'Pane': break;
default: switch (R.n) { /* nested */
/* Chart */
case 'Dat':
case 'Begin': case 'End':
case 'StartBlock': case 'EndBlock':
case 'Frame': case 'Area':
case 'Axis': case 'AxisLine': case 'Tick': break;
case 'AxesUsed':
case 'CrtLayout12': case 'CrtLayout12A': case 'CrtLink': case 'CrtLine': case 'CrtMlFrt': case 'CrtMlFrtContinue': break;
case 'LineFormat': case 'AreaFormat':
case 'Chart': case 'Chart3d': case 'Chart3DBarShape': case 'ChartFormat': case 'ChartFrtInfo': break;
case 'PlotArea': case 'PlotGrowth': break;
case 'SeriesList': case 'SerParent': case 'SerAuxTrend': break;
case 'DataFormat': case 'SerToCrt': case 'FontX': break;
case 'CatSerRange': case 'AxcExt': case 'SerFmt': break;
case 'ShtProps': break;
case 'DefaultText': case 'Text': case 'CatLab': break;
case 'DataLabExtContents': break;
case 'Legend': case 'LegendException': break;
case 'Pie': case 'Scatter': break;
case 'PieFormat': case 'MarkerFormat': break;
case 'StartObject': case 'EndObject': break;
case 'AlRuns': case 'ObjectLink': break;
case 'SIIndex': break;
case 'AttachedLabel': case 'YMult': break; /* Chart Group */
case 'Line': case 'Bar': break;
case 'Surf': break; /* Axis Group */
case 'AxisParent': break;
case 'Pos': break;
case 'ValueRange': break; /* Pivot Chart */
case 'SXViewEx9': break; // TODO
case 'SXViewLink': break;
case 'PivotChartBits': break;
case 'SBaseRef': break;
case 'TextPropsStream': break; /* Chart Misc */
case 'LnExt': break;
case 'MkrExt': break;
case 'CrtCoopt': break; /* Query Table */
case 'Qsi': case 'Qsif': case 'Qsir': case 'QsiSXTag': break;
case 'TxtQry': break; /* Filter */
case 'FilterMode': break;
case 'AutoFilter': case 'AutoFilterInfo': break;
case 'AutoFilter12': break;
case 'DropDownObjIds': break;
case 'Sort': break;
case 'SortData': break; /* Drawing */
case 'ShapePropsStream': break;
case 'MsoDrawing': case 'MsoDrawingGroup': case 'MsoDrawingSelection': break;
case 'ImData': break;
/* Pub Stuff */
case 'WebPub': case 'AutoWebPub': /* Print Stuff */
case 'RightMargin': case 'LeftMargin': case 'TopMargin': case 'BottomMargin':
case 'HeaderFooter': case 'HFPicture': case 'PLV':
case 'HorizontalPageBreaks': case 'VerticalPageBreaks':
/* Behavioral */
case 'Backup': case 'CompressPictures': case 'Compat12': break; /* Should not Happen */
case 'Continue': case 'ContinueFrt12': break; /* Future Records */
case 'FrtFontList': case 'FrtWrapper': break; /* BIFF5 records */
case 'ExternCount': break;
case 'RString': break;
case 'TabIdConf': case 'Radar': case 'RadarArea': case 'DropBar': case 'Intl': case 'CoordList': case 'SerAuxErrBar': break; default: switch (R.n) { /* nested */
/* Miscellaneous */
case 'SCENARIO': case 'DConBin': case 'PicF': case 'DataLabExt':
case 'Lel': case 'BopPop': case 'BopPopCustom': case 'RealTimeData':
case 'Name': break;
default: if (options.WTF) throw 'Unrecognized Record ' + R.n;
}
}
}
}
} else blob.l += length;
}
var sheetnamesraw = opts.biff === 2 ? ['Sheet1'] : Object.keys(Directory).sort(function (a, b) { return Number(a) - Number(b); }).map(function (x) { return Directory[x].name; });
var sheetnames = sheetnamesraw.slice();
wb.Directory = sheetnamesraw;
wb.SheetNames = sheetnamesraw;
if (!options.bookSheets) wb.Sheets = Sheets;
wb.Preamble = Preamble;
wb.Strings = sst;
wb.SSF = SSF.get_table();
if (opts.enc) wb.Encryption = opts.enc;
wb.Metadata = {};
if (country !== undefined) wb.Metadata.Country = country;
return wb;
} function parse_xlscfb(cfb, options) {
if (!options) options = {};
fix_read_opts(options);
reset_cp();
var CompObj, Summary, Workbook;
if (cfb.find) {
CompObj = cfb.find('!CompObj');
Summary = cfb.find('!SummaryInformation');
Workbook = cfb.find('/Workbook');
} else {
prep_blob(cfb, 0);
Workbook = { content: cfb };
} if (!Workbook) Workbook = cfb.find('/Book');
var CompObjP, SummaryP, WorkbookP; if (CompObj) CompObjP = parse_compobj(CompObj);
if (options.bookProps && !options.bookSheets) WorkbookP = {};
else {
if (Workbook) WorkbookP = parse_workbook(Workbook.content, options, !!Workbook.find);
else throw new Error("Cannot find Workbook stream");
} if (cfb.find) parse_props(cfb); var props = {};
for (var y in cfb.Summary) props[y] = cfb.Summary[y];
for (y in cfb.DocSummary) props[y] = cfb.DocSummary[y];
WorkbookP.Props = WorkbookP.Custprops = props; /* TODO: split up properties */
if (options.bookFiles) WorkbookP.cfb = cfb;
WorkbookP.CompObjP = CompObjP;
return WorkbookP;
} /* TODO: WTF */
function parse_props(cfb) {
/* [MS-OSHARED] 2.3.3.2.2 Document Summary Information Property Set */
var DSI = cfb.find('!DocumentSummaryInformation');
if (DSI) try { cfb.DocSummary = parse_PropertySetStream(DSI, DocSummaryPIDDSI); } catch (e) { } /* [MS-OSHARED] 2.3.3.2.1 Summary Information Property Set*/
var SI = cfb.find('!SummaryInformation');
if (SI) try { cfb.Summary = parse_PropertySetStream(SI, SummaryPIDSI); } catch (e) { }
} /* [MS-XLSB] 2.3 Record Enumeration */
var XLSBRecordEnum = {
0x0000: { n: "BrtRowHdr", f: parse_BrtRowHdr },
0x0001: { n: "BrtCellBlank", f: parse_BrtCellBlank },
0x0002: { n: "BrtCellRk", f: parse_BrtCellRk },
0x0003: { n: "BrtCellError", f: parse_BrtCellError },
0x0004: { n: "BrtCellBool", f: parse_BrtCellBool },
0x0005: { n: "BrtCellReal", f: parse_BrtCellReal },
0x0006: { n: "BrtCellSt", f: parse_BrtCellSt },
0x0007: { n: "BrtCellIsst", f: parse_BrtCellIsst },
0x0008: { n: "BrtFmlaString", f: parse_BrtFmlaString },
0x0009: { n: "BrtFmlaNum", f: parse_BrtFmlaNum },
0x000A: { n: "BrtFmlaBool", f: parse_BrtFmlaBool },
0x000B: { n: "BrtFmlaError", f: parse_BrtFmlaError },
0x0010: { n: "BrtFRTArchID$", f: parse_BrtFRTArchID$ },
0x0013: { n: "BrtSSTItem", f: parse_RichStr },
0x0014: { n: "BrtPCDIMissing", f: parsenoop },
0x0015: { n: "BrtPCDINumber", f: parsenoop },
0x0016: { n: "BrtPCDIBoolean", f: parsenoop },
0x0017: { n: "BrtPCDIError", f: parsenoop },
0x0018: { n: "BrtPCDIString", f: parsenoop },
0x0019: { n: "BrtPCDIDatetime", f: parsenoop },
0x001A: { n: "BrtPCDIIndex", f: parsenoop },
0x001B: { n: "BrtPCDIAMissing", f: parsenoop },
0x001C: { n: "BrtPCDIANumber", f: parsenoop },
0x001D: { n: "BrtPCDIABoolean", f: parsenoop },
0x001E: { n: "BrtPCDIAError", f: parsenoop },
0x001F: { n: "BrtPCDIAString", f: parsenoop },
0x0020: { n: "BrtPCDIADatetime", f: parsenoop },
0x0021: { n: "BrtPCRRecord", f: parsenoop },
0x0022: { n: "BrtPCRRecordDt", f: parsenoop },
0x0023: { n: "BrtFRTBegin", f: parsenoop },
0x0024: { n: "BrtFRTEnd", f: parsenoop },
0x0025: { n: "BrtACBegin", f: parsenoop },
0x0026: { n: "BrtACEnd", f: parsenoop },
0x0027: { n: "BrtName", f: parsenoop },
0x0028: { n: "BrtIndexRowBlock", f: parsenoop },
0x002A: { n: "BrtIndexBlock", f: parsenoop },
0x002B: { n: "BrtFont", f: parse_BrtFont },
0x002C: { n: "BrtFmt", f: parse_BrtFmt },
0x002D: { n: "BrtFill", f: parsenoop },
0x002E: { n: "BrtBorder", f: parsenoop },
0x002F: { n: "BrtXF", f: parse_BrtXF },
0x0030: { n: "BrtStyle", f: parsenoop },
0x0031: { n: "BrtCellMeta", f: parsenoop },
0x0032: { n: "BrtValueMeta", f: parsenoop },
0x0033: { n: "BrtMdb", f: parsenoop },
0x0034: { n: "BrtBeginFmd", f: parsenoop },
0x0035: { n: "BrtEndFmd", f: parsenoop },
0x0036: { n: "BrtBeginMdx", f: parsenoop },
0x0037: { n: "BrtEndMdx", f: parsenoop },
0x0038: { n: "BrtBeginMdxTuple", f: parsenoop },
0x0039: { n: "BrtEndMdxTuple", f: parsenoop },
0x003A: { n: "BrtMdxMbrIstr", f: parsenoop },
0x003B: { n: "BrtStr", f: parsenoop },
0x003C: { n: "BrtColInfo", f: parsenoop },
0x003E: { n: "BrtCellRString", f: parsenoop },
0x003F: { n: "BrtCalcChainItem$", f: parse_BrtCalcChainItem$ },
0x0040: { n: "BrtDVal", f: parsenoop },
0x0041: { n: "BrtSxvcellNum", f: parsenoop },
0x0042: { n: "BrtSxvcellStr", f: parsenoop },
0x0043: { n: "BrtSxvcellBool", f: parsenoop },
0x0044: { n: "BrtSxvcellErr", f: parsenoop },
0x0045: { n: "BrtSxvcellDate", f: parsenoop },
0x0046: { n: "BrtSxvcellNil", f: parsenoop },
0x0080: { n: "BrtFileVersion", f: parsenoop },
0x0081: { n: "BrtBeginSheet", f: parsenoop },
0x0082: { n: "BrtEndSheet", f: parsenoop },
0x0083: { n: "BrtBeginBook", f: parsenoop, p: 0 },
0x0084: { n: "BrtEndBook", f: parsenoop },
0x0085: { n: "BrtBeginWsViews", f: parsenoop },
0x0086: { n: "BrtEndWsViews", f: parsenoop },
0x0087: { n: "BrtBeginBookViews", f: parsenoop },
0x0088: { n: "BrtEndBookViews", f: parsenoop },
0x0089: { n: "BrtBeginWsView", f: parsenoop },
0x008A: { n: "BrtEndWsView", f: parsenoop },
0x008B: { n: "BrtBeginCsViews", f: parsenoop },
0x008C: { n: "BrtEndCsViews", f: parsenoop },
0x008D: { n: "BrtBeginCsView", f: parsenoop },
0x008E: { n: "BrtEndCsView", f: parsenoop },
0x008F: { n: "BrtBeginBundleShs", f: parsenoop },
0x0090: { n: "BrtEndBundleShs", f: parsenoop },
0x0091: { n: "BrtBeginSheetData", f: parsenoop },
0x0092: { n: "BrtEndSheetData", f: parsenoop },
0x0093: { n: "BrtWsProp", f: parse_BrtWsProp },
0x0094: { n: "BrtWsDim", f: parse_BrtWsDim, p: 16 },
0x0097: { n: "BrtPane", f: parsenoop },
0x0098: { n: "BrtSel", f: parsenoop },
0x0099: { n: "BrtWbProp", f: parse_BrtWbProp },
0x009A: { n: "BrtWbFactoid", f: parsenoop },
0x009B: { n: "BrtFileRecover", f: parsenoop },
0x009C: { n: "BrtBundleSh", f: parse_BrtBundleSh },
0x009D: { n: "BrtCalcProp", f: parsenoop },
0x009E: { n: "BrtBookView", f: parsenoop },
0x009F: { n: "BrtBeginSst", f: parse_BrtBeginSst },
0x00A0: { n: "BrtEndSst", f: parsenoop },
0x00A1: { n: "BrtBeginAFilter", f: parsenoop },
0x00A2: { n: "BrtEndAFilter", f: parsenoop },
0x00A3: { n: "BrtBeginFilterColumn", f: parsenoop },
0x00A4: { n: "BrtEndFilterColumn", f: parsenoop },
0x00A5: { n: "BrtBeginFilters", f: parsenoop },
0x00A6: { n: "BrtEndFilters", f: parsenoop },
0x00A7: { n: "BrtFilter", f: parsenoop },
0x00A8: { n: "BrtColorFilter", f: parsenoop },
0x00A9: { n: "BrtIconFilter", f: parsenoop },
0x00AA: { n: "BrtTop10Filter", f: parsenoop },
0x00AB: { n: "BrtDynamicFilter", f: parsenoop },
0x00AC: { n: "BrtBeginCustomFilters", f: parsenoop },
0x00AD: { n: "BrtEndCustomFilters", f: parsenoop },
0x00AE: { n: "BrtCustomFilter", f: parsenoop },
0x00AF: { n: "BrtAFilterDateGroupItem", f: parsenoop },
0x00B0: { n: "BrtMergeCell", f: parse_BrtMergeCell },
0x00B1: { n: "BrtBeginMergeCells", f: parsenoop },
0x00B2: { n: "BrtEndMergeCells", f: parsenoop },
0x00B3: { n: "BrtBeginPivotCacheDef", f: parsenoop },
0x00B4: { n: "BrtEndPivotCacheDef", f: parsenoop },
0x00B5: { n: "BrtBeginPCDFields", f: parsenoop },
0x00B6: { n: "BrtEndPCDFields", f: parsenoop },
0x00B7: { n: "BrtBeginPCDField", f: parsenoop },
0x00B8: { n: "BrtEndPCDField", f: parsenoop },
0x00B9: { n: "BrtBeginPCDSource", f: parsenoop },
0x00BA: { n: "BrtEndPCDSource", f: parsenoop },
0x00BB: { n: "BrtBeginPCDSRange", f: parsenoop },
0x00BC: { n: "BrtEndPCDSRange", f: parsenoop },
0x00BD: { n: "BrtBeginPCDFAtbl", f: parsenoop },
0x00BE: { n: "BrtEndPCDFAtbl", f: parsenoop },
0x00BF: { n: "BrtBeginPCDIRun", f: parsenoop },
0x00C0: { n: "BrtEndPCDIRun", f: parsenoop },
0x00C1: { n: "BrtBeginPivotCacheRecords", f: parsenoop },
0x00C2: { n: "BrtEndPivotCacheRecords", f: parsenoop },
0x00C3: { n: "BrtBeginPCDHierarchies", f: parsenoop },
0x00C4: { n: "BrtEndPCDHierarchies", f: parsenoop },
0x00C5: { n: "BrtBeginPCDHierarchy", f: parsenoop },
0x00C6: { n: "BrtEndPCDHierarchy", f: parsenoop },
0x00C7: { n: "BrtBeginPCDHFieldsUsage", f: parsenoop },
0x00C8: { n: "BrtEndPCDHFieldsUsage", f: parsenoop },
0x00C9: { n: "BrtBeginExtConnection", f: parsenoop },
0x00CA: { n: "BrtEndExtConnection", f: parsenoop },
0x00CB: { n: "BrtBeginECDbProps", f: parsenoop },
0x00CC: { n: "BrtEndECDbProps", f: parsenoop },
0x00CD: { n: "BrtBeginECOlapProps", f: parsenoop },
0x00CE: { n: "BrtEndECOlapProps", f: parsenoop },
0x00CF: { n: "BrtBeginPCDSConsol", f: parsenoop },
0x00D0: { n: "BrtEndPCDSConsol", f: parsenoop },
0x00D1: { n: "BrtBeginPCDSCPages", f: parsenoop },
0x00D2: { n: "BrtEndPCDSCPages", f: parsenoop },
0x00D3: { n: "BrtBeginPCDSCPage", f: parsenoop },
0x00D4: { n: "BrtEndPCDSCPage", f: parsenoop },
0x00D5: { n: "BrtBeginPCDSCPItem", f: parsenoop },
0x00D6: { n: "BrtEndPCDSCPItem", f: parsenoop },
0x00D7: { n: "BrtBeginPCDSCSets", f: parsenoop },
0x00D8: { n: "BrtEndPCDSCSets", f: parsenoop },
0x00D9: { n: "BrtBeginPCDSCSet", f: parsenoop },
0x00DA: { n: "BrtEndPCDSCSet", f: parsenoop },
0x00DB: { n: "BrtBeginPCDFGroup", f: parsenoop },
0x00DC: { n: "BrtEndPCDFGroup", f: parsenoop },
0x00DD: { n: "BrtBeginPCDFGItems", f: parsenoop },
0x00DE: { n: "BrtEndPCDFGItems", f: parsenoop },
0x00DF: { n: "BrtBeginPCDFGRange", f: parsenoop },
0x00E0: { n: "BrtEndPCDFGRange", f: parsenoop },
0x00E1: { n: "BrtBeginPCDFGDiscrete", f: parsenoop },
0x00E2: { n: "BrtEndPCDFGDiscrete", f: parsenoop },
0x00E3: { n: "BrtBeginPCDSDTupleCache", f: parsenoop },
0x00E4: { n: "BrtEndPCDSDTupleCache", f: parsenoop },
0x00E5: { n: "BrtBeginPCDSDTCEntries", f: parsenoop },
0x00E6: { n: "BrtEndPCDSDTCEntries", f: parsenoop },
0x00E7: { n: "BrtBeginPCDSDTCEMembers", f: parsenoop },
0x00E8: { n: "BrtEndPCDSDTCEMembers", f: parsenoop },
0x00E9: { n: "BrtBeginPCDSDTCEMember", f: parsenoop },
0x00EA: { n: "BrtEndPCDSDTCEMember", f: parsenoop },
0x00EB: { n: "BrtBeginPCDSDTCQueries", f: parsenoop },
0x00EC: { n: "BrtEndPCDSDTCQueries", f: parsenoop },
0x00ED: { n: "BrtBeginPCDSDTCQuery", f: parsenoop },
0x00EE: { n: "BrtEndPCDSDTCQuery", f: parsenoop },
0x00EF: { n: "BrtBeginPCDSDTCSets", f: parsenoop },
0x00F0: { n: "BrtEndPCDSDTCSets", f: parsenoop },
0x00F1: { n: "BrtBeginPCDSDTCSet", f: parsenoop },
0x00F2: { n: "BrtEndPCDSDTCSet", f: parsenoop },
0x00F3: { n: "BrtBeginPCDCalcItems", f: parsenoop },
0x00F4: { n: "BrtEndPCDCalcItems", f: parsenoop },
0x00F5: { n: "BrtBeginPCDCalcItem", f: parsenoop },
0x00F6: { n: "BrtEndPCDCalcItem", f: parsenoop },
0x00F7: { n: "BrtBeginPRule", f: parsenoop },
0x00F8: { n: "BrtEndPRule", f: parsenoop },
0x00F9: { n: "BrtBeginPRFilters", f: parsenoop },
0x00FA: { n: "BrtEndPRFilters", f: parsenoop },
0x00FB: { n: "BrtBeginPRFilter", f: parsenoop },
0x00FC: { n: "BrtEndPRFilter", f: parsenoop },
0x00FD: { n: "BrtBeginPNames", f: parsenoop },
0x00FE: { n: "BrtEndPNames", f: parsenoop },
0x00FF: { n: "BrtBeginPName", f: parsenoop },
0x0100: { n: "BrtEndPName", f: parsenoop },
0x0101: { n: "BrtBeginPNPairs", f: parsenoop },
0x0102: { n: "BrtEndPNPairs", f: parsenoop },
0x0103: { n: "BrtBeginPNPair", f: parsenoop },
0x0104: { n: "BrtEndPNPair", f: parsenoop },
0x0105: { n: "BrtBeginECWebProps", f: parsenoop },
0x0106: { n: "BrtEndECWebProps", f: parsenoop },
0x0107: { n: "BrtBeginEcWpTables", f: parsenoop },
0x0108: { n: "BrtEndECWPTables", f: parsenoop },
0x0109: { n: "BrtBeginECParams", f: parsenoop },
0x010A: { n: "BrtEndECParams", f: parsenoop },
0x010B: { n: "BrtBeginECParam", f: parsenoop },
0x010C: { n: "BrtEndECParam", f: parsenoop },
0x010D: { n: "BrtBeginPCDKPIs", f: parsenoop },
0x010E: { n: "BrtEndPCDKPIs", f: parsenoop },
0x010F: { n: "BrtBeginPCDKPI", f: parsenoop },
0x0110: { n: "BrtEndPCDKPI", f: parsenoop },
0x0111: { n: "BrtBeginDims", f: parsenoop },
0x0112: { n: "BrtEndDims", f: parsenoop },
0x0113: { n: "BrtBeginDim", f: parsenoop },
0x0114: { n: "BrtEndDim", f: parsenoop },
0x0115: { n: "BrtIndexPartEnd", f: parsenoop },
0x0116: { n: "BrtBeginStyleSheet", f: parsenoop },
0x0117: { n: "BrtEndStyleSheet", f: parsenoop },
0x0118: { n: "BrtBeginSXView", f: parsenoop },
0x0119: { n: "BrtEndSXVI", f: parsenoop },
0x011A: { n: "BrtBeginSXVI", f: parsenoop },
0x011B: { n: "BrtBeginSXVIs", f: parsenoop },
0x011C: { n: "BrtEndSXVIs", f: parsenoop },
0x011D: { n: "BrtBeginSXVD", f: parsenoop },
0x011E: { n: "BrtEndSXVD", f: parsenoop },
0x011F: { n: "BrtBeginSXVDs", f: parsenoop },
0x0120: { n: "BrtEndSXVDs", f: parsenoop },
0x0121: { n: "BrtBeginSXPI", f: parsenoop },
0x0122: { n: "BrtEndSXPI", f: parsenoop },
0x0123: { n: "BrtBeginSXPIs", f: parsenoop },
0x0124: { n: "BrtEndSXPIs", f: parsenoop },
0x0125: { n: "BrtBeginSXDI", f: parsenoop },
0x0126: { n: "BrtEndSXDI", f: parsenoop },
0x0127: { n: "BrtBeginSXDIs", f: parsenoop },
0x0128: { n: "BrtEndSXDIs", f: parsenoop },
0x0129: { n: "BrtBeginSXLI", f: parsenoop },
0x012A: { n: "BrtEndSXLI", f: parsenoop },
0x012B: { n: "BrtBeginSXLIRws", f: parsenoop },
0x012C: { n: "BrtEndSXLIRws", f: parsenoop },
0x012D: { n: "BrtBeginSXLICols", f: parsenoop },
0x012E: { n: "BrtEndSXLICols", f: parsenoop },
0x012F: { n: "BrtBeginSXFormat", f: parsenoop },
0x0130: { n: "BrtEndSXFormat", f: parsenoop },
0x0131: { n: "BrtBeginSXFormats", f: parsenoop },
0x0132: { n: "BrtEndSxFormats", f: parsenoop },
0x0133: { n: "BrtBeginSxSelect", f: parsenoop },
0x0134: { n: "BrtEndSxSelect", f: parsenoop },
0x0135: { n: "BrtBeginISXVDRws", f: parsenoop },
0x0136: { n: "BrtEndISXVDRws", f: parsenoop },
0x0137: { n: "BrtBeginISXVDCols", f: parsenoop },
0x0138: { n: "BrtEndISXVDCols", f: parsenoop },
0x0139: { n: "BrtEndSXLocation", f: parsenoop },
0x013A: { n: "BrtBeginSXLocation", f: parsenoop },
0x013B: { n: "BrtEndSXView", f: parsenoop },
0x013C: { n: "BrtBeginSXTHs", f: parsenoop },
0x013D: { n: "BrtEndSXTHs", f: parsenoop },
0x013E: { n: "BrtBeginSXTH", f: parsenoop },
0x013F: { n: "BrtEndSXTH", f: parsenoop },
0x0140: { n: "BrtBeginISXTHRws", f: parsenoop },
0x0141: { n: "BrtEndISXTHRws", f: parsenoop },
0x0142: { n: "BrtBeginISXTHCols", f: parsenoop },
0x0143: { n: "BrtEndISXTHCols", f: parsenoop },
0x0144: { n: "BrtBeginSXTDMPS", f: parsenoop },
0x0145: { n: "BrtEndSXTDMPs", f: parsenoop },
0x0146: { n: "BrtBeginSXTDMP", f: parsenoop },
0x0147: { n: "BrtEndSXTDMP", f: parsenoop },
0x0148: { n: "BrtBeginSXTHItems", f: parsenoop },
0x0149: { n: "BrtEndSXTHItems", f: parsenoop },
0x014A: { n: "BrtBeginSXTHItem", f: parsenoop },
0x014B: { n: "BrtEndSXTHItem", f: parsenoop },
0x014C: { n: "BrtBeginMetadata", f: parsenoop },
0x014D: { n: "BrtEndMetadata", f: parsenoop },
0x014E: { n: "BrtBeginEsmdtinfo", f: parsenoop },
0x014F: { n: "BrtMdtinfo", f: parsenoop },
0x0150: { n: "BrtEndEsmdtinfo", f: parsenoop },
0x0151: { n: "BrtBeginEsmdb", f: parsenoop },
0x0152: { n: "BrtEndEsmdb", f: parsenoop },
0x0153: { n: "BrtBeginEsfmd", f: parsenoop },
0x0154: { n: "BrtEndEsfmd", f: parsenoop },
0x0155: { n: "BrtBeginSingleCells", f: parsenoop },
0x0156: { n: "BrtEndSingleCells", f: parsenoop },
0x0157: { n: "BrtBeginList", f: parsenoop },
0x0158: { n: "BrtEndList", f: parsenoop },
0x0159: { n: "BrtBeginListCols", f: parsenoop },
0x015A: { n: "BrtEndListCols", f: parsenoop },
0x015B: { n: "BrtBeginListCol", f: parsenoop },
0x015C: { n: "BrtEndListCol", f: parsenoop },
0x015D: { n: "BrtBeginListXmlCPr", f: parsenoop },
0x015E: { n: "BrtEndListXmlCPr", f: parsenoop },
0x015F: { n: "BrtListCCFmla", f: parsenoop },
0x0160: { n: "BrtListTrFmla", f: parsenoop },
0x0161: { n: "BrtBeginExternals", f: parsenoop },
0x0162: { n: "BrtEndExternals", f: parsenoop },
0x0163: { n: "BrtSupBookSrc", f: parsenoop },
0x0165: { n: "BrtSupSelf", f: parsenoop },
0x0166: { n: "BrtSupSame", f: parsenoop },
0x0167: { n: "BrtSupTabs", f: parsenoop },
0x0168: { n: "BrtBeginSupBook", f: parsenoop },
0x0169: { n: "BrtPlaceholderName", f: parsenoop },
0x016A: { n: "BrtExternSheet", f: parsenoop },
0x016B: { n: "BrtExternTableStart", f: parsenoop },
0x016C: { n: "BrtExternTableEnd", f: parsenoop },
0x016E: { n: "BrtExternRowHdr", f: parsenoop },
0x016F: { n: "BrtExternCellBlank", f: parsenoop },
0x0170: { n: "BrtExternCellReal", f: parsenoop },
0x0171: { n: "BrtExternCellBool", f: parsenoop },
0x0172: { n: "BrtExternCellError", f: parsenoop },
0x0173: { n: "BrtExternCellString", f: parsenoop },
0x0174: { n: "BrtBeginEsmdx", f: parsenoop },
0x0175: { n: "BrtEndEsmdx", f: parsenoop },
0x0176: { n: "BrtBeginMdxSet", f: parsenoop },
0x0177: { n: "BrtEndMdxSet", f: parsenoop },
0x0178: { n: "BrtBeginMdxMbrProp", f: parsenoop },
0x0179: { n: "BrtEndMdxMbrProp", f: parsenoop },
0x017A: { n: "BrtBeginMdxKPI", f: parsenoop },
0x017B: { n: "BrtEndMdxKPI", f: parsenoop },
0x017C: { n: "BrtBeginEsstr", f: parsenoop },
0x017D: { n: "BrtEndEsstr", f: parsenoop },
0x017E: { n: "BrtBeginPRFItem", f: parsenoop },
0x017F: { n: "BrtEndPRFItem", f: parsenoop },
0x0180: { n: "BrtBeginPivotCacheIDs", f: parsenoop },
0x0181: { n: "BrtEndPivotCacheIDs", f: parsenoop },
0x0182: { n: "BrtBeginPivotCacheID", f: parsenoop },
0x0183: { n: "BrtEndPivotCacheID", f: parsenoop },
0x0184: { n: "BrtBeginISXVIs", f: parsenoop },
0x0185: { n: "BrtEndISXVIs", f: parsenoop },
0x0186: { n: "BrtBeginColInfos", f: parsenoop },
0x0187: { n: "BrtEndColInfos", f: parsenoop },
0x0188: { n: "BrtBeginRwBrk", f: parsenoop },
0x0189: { n: "BrtEndRwBrk", f: parsenoop },
0x018A: { n: "BrtBeginColBrk", f: parsenoop },
0x018B: { n: "BrtEndColBrk", f: parsenoop },
0x018C: { n: "BrtBrk", f: parsenoop },
0x018D: { n: "BrtUserBookView", f: parsenoop },
0x018E: { n: "BrtInfo", f: parsenoop },
0x018F: { n: "BrtCUsr", f: parsenoop },
0x0190: { n: "BrtUsr", f: parsenoop },
0x0191: { n: "BrtBeginUsers", f: parsenoop },
0x0193: { n: "BrtEOF", f: parsenoop },
0x0194: { n: "BrtUCR", f: parsenoop },
0x0195: { n: "BrtRRInsDel", f: parsenoop },
0x0196: { n: "BrtRREndInsDel", f: parsenoop },
0x0197: { n: "BrtRRMove", f: parsenoop },
0x0198: { n: "BrtRREndMove", f: parsenoop },
0x0199: { n: "BrtRRChgCell", f: parsenoop },
0x019A: { n: "BrtRREndChgCell", f: parsenoop },
0x019B: { n: "BrtRRHeader", f: parsenoop },
0x019C: { n: "BrtRRUserView", f: parsenoop },
0x019D: { n: "BrtRRRenSheet", f: parsenoop },
0x019E: { n: "BrtRRInsertSh", f: parsenoop },
0x019F: { n: "BrtRRDefName", f: parsenoop },
0x01A0: { n: "BrtRRNote", f: parsenoop },
0x01A1: { n: "BrtRRConflict", f: parsenoop },
0x01A2: { n: "BrtRRTQSIF", f: parsenoop },
0x01A3: { n: "BrtRRFormat", f: parsenoop },
0x01A4: { n: "BrtRREndFormat", f: parsenoop },
0x01A5: { n: "BrtRRAutoFmt", f: parsenoop },
0x01A6: { n: "BrtBeginUserShViews", f: parsenoop },
0x01A7: { n: "BrtBeginUserShView", f: parsenoop },
0x01A8: { n: "BrtEndUserShView", f: parsenoop },
0x01A9: { n: "BrtEndUserShViews", f: parsenoop },
0x01AA: { n: "BrtArrFmla", f: parsenoop },
0x01AB: { n: "BrtShrFmla", f: parsenoop },
0x01AC: { n: "BrtTable", f: parsenoop },
0x01AD: { n: "BrtBeginExtConnections", f: parsenoop },
0x01AE: { n: "BrtEndExtConnections", f: parsenoop },
0x01AF: { n: "BrtBeginPCDCalcMems", f: parsenoop },
0x01B0: { n: "BrtEndPCDCalcMems", f: parsenoop },
0x01B1: { n: "BrtBeginPCDCalcMem", f: parsenoop },
0x01B2: { n: "BrtEndPCDCalcMem", f: parsenoop },
0x01B3: { n: "BrtBeginPCDHGLevels", f: parsenoop },
0x01B4: { n: "BrtEndPCDHGLevels", f: parsenoop },
0x01B5: { n: "BrtBeginPCDHGLevel", f: parsenoop },
0x01B6: { n: "BrtEndPCDHGLevel", f: parsenoop },
0x01B7: { n: "BrtBeginPCDHGLGroups", f: parsenoop },
0x01B8: { n: "BrtEndPCDHGLGroups", f: parsenoop },
0x01B9: { n: "BrtBeginPCDHGLGroup", f: parsenoop },
0x01BA: { n: "BrtEndPCDHGLGroup", f: parsenoop },
0x01BB: { n: "BrtBeginPCDHGLGMembers", f: parsenoop },
0x01BC: { n: "BrtEndPCDHGLGMembers", f: parsenoop },
0x01BD: { n: "BrtBeginPCDHGLGMember", f: parsenoop },
0x01BE: { n: "BrtEndPCDHGLGMember", f: parsenoop },
0x01BF: { n: "BrtBeginQSI", f: parsenoop },
0x01C0: { n: "BrtEndQSI", f: parsenoop },
0x01C1: { n: "BrtBeginQSIR", f: parsenoop },
0x01C2: { n: "BrtEndQSIR", f: parsenoop },
0x01C3: { n: "BrtBeginDeletedNames", f: parsenoop },
0x01C4: { n: "BrtEndDeletedNames", f: parsenoop },
0x01C5: { n: "BrtBeginDeletedName", f: parsenoop },
0x01C6: { n: "BrtEndDeletedName", f: parsenoop },
0x01C7: { n: "BrtBeginQSIFs", f: parsenoop },
0x01C8: { n: "BrtEndQSIFs", f: parsenoop },
0x01C9: { n: "BrtBeginQSIF", f: parsenoop },
0x01CA: { n: "BrtEndQSIF", f: parsenoop },
0x01CB: { n: "BrtBeginAutoSortScope", f: parsenoop },
0x01CC: { n: "BrtEndAutoSortScope", f: parsenoop },
0x01CD: { n: "BrtBeginConditionalFormatting", f: parsenoop },
0x01CE: { n: "BrtEndConditionalFormatting", f: parsenoop },
0x01CF: { n: "BrtBeginCFRule", f: parsenoop },
0x01D0: { n: "BrtEndCFRule", f: parsenoop },
0x01D1: { n: "BrtBeginIconSet", f: parsenoop },
0x01D2: { n: "BrtEndIconSet", f: parsenoop },
0x01D3: { n: "BrtBeginDatabar", f: parsenoop },
0x01D4: { n: "BrtEndDatabar", f: parsenoop },
0x01D5: { n: "BrtBeginColorScale", f: parsenoop },
0x01D6: { n: "BrtEndColorScale", f: parsenoop },
0x01D7: { n: "BrtCFVO", f: parsenoop },
0x01D8: { n: "BrtExternValueMeta", f: parsenoop },
0x01D9: { n: "BrtBeginColorPalette", f: parsenoop },
0x01DA: { n: "BrtEndColorPalette", f: parsenoop },
0x01DB: { n: "BrtIndexedColor", f: parsenoop },
0x01DC: { n: "BrtMargins", f: parsenoop },
0x01DD: { n: "BrtPrintOptions", f: parsenoop },
0x01DE: { n: "BrtPageSetup", f: parsenoop },
0x01DF: { n: "BrtBeginHeaderFooter", f: parsenoop },
0x01E0: { n: "BrtEndHeaderFooter", f: parsenoop },
0x01E1: { n: "BrtBeginSXCrtFormat", f: parsenoop },
0x01E2: { n: "BrtEndSXCrtFormat", f: parsenoop },
0x01E3: { n: "BrtBeginSXCrtFormats", f: parsenoop },
0x01E4: { n: "BrtEndSXCrtFormats", f: parsenoop },
0x01E5: { n: "BrtWsFmtInfo", f: parsenoop },
0x01E6: { n: "BrtBeginMgs", f: parsenoop },
0x01E7: { n: "BrtEndMGs", f: parsenoop },
0x01E8: { n: "BrtBeginMGMaps", f: parsenoop },
0x01E9: { n: "BrtEndMGMaps", f: parsenoop },
0x01EA: { n: "BrtBeginMG", f: parsenoop },
0x01EB: { n: "BrtEndMG", f: parsenoop },
0x01EC: { n: "BrtBeginMap", f: parsenoop },
0x01ED: { n: "BrtEndMap", f: parsenoop },
0x01EE: { n: "BrtHLink", f: parse_BrtHLink },
0x01EF: { n: "BrtBeginDCon", f: parsenoop },
0x01F0: { n: "BrtEndDCon", f: parsenoop },
0x01F1: { n: "BrtBeginDRefs", f: parsenoop },
0x01F2: { n: "BrtEndDRefs", f: parsenoop },
0x01F3: { n: "BrtDRef", f: parsenoop },
0x01F4: { n: "BrtBeginScenMan", f: parsenoop },
0x01F5: { n: "BrtEndScenMan", f: parsenoop },
0x01F6: { n: "BrtBeginSct", f: parsenoop },
0x01F7: { n: "BrtEndSct", f: parsenoop },
0x01F8: { n: "BrtSlc", f: parsenoop },
0x01F9: { n: "BrtBeginDXFs", f: parsenoop },
0x01FA: { n: "BrtEndDXFs", f: parsenoop },
0x01FB: { n: "BrtDXF", f: parsenoop },
0x01FC: { n: "BrtBeginTableStyles", f: parsenoop },
0x01FD: { n: "BrtEndTableStyles", f: parsenoop },
0x01FE: { n: "BrtBeginTableStyle", f: parsenoop },
0x01FF: { n: "BrtEndTableStyle", f: parsenoop },
0x0200: { n: "BrtTableStyleElement", f: parsenoop },
0x0201: { n: "BrtTableStyleClient", f: parsenoop },
0x0202: { n: "BrtBeginVolDeps", f: parsenoop },
0x0203: { n: "BrtEndVolDeps", f: parsenoop },
0x0204: { n: "BrtBeginVolType", f: parsenoop },
0x0205: { n: "BrtEndVolType", f: parsenoop },
0x0206: { n: "BrtBeginVolMain", f: parsenoop },
0x0207: { n: "BrtEndVolMain", f: parsenoop },
0x0208: { n: "BrtBeginVolTopic", f: parsenoop },
0x0209: { n: "BrtEndVolTopic", f: parsenoop },
0x020A: { n: "BrtVolSubtopic", f: parsenoop },
0x020B: { n: "BrtVolRef", f: parsenoop },
0x020C: { n: "BrtVolNum", f: parsenoop },
0x020D: { n: "BrtVolErr", f: parsenoop },
0x020E: { n: "BrtVolStr", f: parsenoop },
0x020F: { n: "BrtVolBool", f: parsenoop },
0x0210: { n: "BrtBeginCalcChain$", f: parsenoop },
0x0211: { n: "BrtEndCalcChain$", f: parsenoop },
0x0212: { n: "BrtBeginSortState", f: parsenoop },
0x0213: { n: "BrtEndSortState", f: parsenoop },
0x0214: { n: "BrtBeginSortCond", f: parsenoop },
0x0215: { n: "BrtEndSortCond", f: parsenoop },
0x0216: { n: "BrtBookProtection", f: parsenoop },
0x0217: { n: "BrtSheetProtection", f: parsenoop },
0x0218: { n: "BrtRangeProtection", f: parsenoop },
0x0219: { n: "BrtPhoneticInfo", f: parsenoop },
0x021A: { n: "BrtBeginECTxtWiz", f: parsenoop },
0x021B: { n: "BrtEndECTxtWiz", f: parsenoop },
0x021C: { n: "BrtBeginECTWFldInfoLst", f: parsenoop },
0x021D: { n: "BrtEndECTWFldInfoLst", f: parsenoop },
0x021E: { n: "BrtBeginECTwFldInfo", f: parsenoop },
0x0224: { n: "BrtFileSharing", f: parsenoop },
0x0225: { n: "BrtOleSize", f: parsenoop },
0x0226: { n: "BrtDrawing", f: parsenoop },
0x0227: { n: "BrtLegacyDrawing", f: parsenoop },
0x0228: { n: "BrtLegacyDrawingHF", f: parsenoop },
0x0229: { n: "BrtWebOpt", f: parsenoop },
0x022A: { n: "BrtBeginWebPubItems", f: parsenoop },
0x022B: { n: "BrtEndWebPubItems", f: parsenoop },
0x022C: { n: "BrtBeginWebPubItem", f: parsenoop },
0x022D: { n: "BrtEndWebPubItem", f: parsenoop },
0x022E: { n: "BrtBeginSXCondFmt", f: parsenoop },
0x022F: { n: "BrtEndSXCondFmt", f: parsenoop },
0x0230: { n: "BrtBeginSXCondFmts", f: parsenoop },
0x0231: { n: "BrtEndSXCondFmts", f: parsenoop },
0x0232: { n: "BrtBkHim", f: parsenoop },
0x0234: { n: "BrtColor", f: parsenoop },
0x0235: { n: "BrtBeginIndexedColors", f: parsenoop },
0x0236: { n: "BrtEndIndexedColors", f: parsenoop },
0x0239: { n: "BrtBeginMRUColors", f: parsenoop },
0x023A: { n: "BrtEndMRUColors", f: parsenoop },
0x023C: { n: "BrtMRUColor", f: parsenoop },
0x023D: { n: "BrtBeginDVals", f: parsenoop },
0x023E: { n: "BrtEndDVals", f: parsenoop },
0x0241: { n: "BrtSupNameStart", f: parsenoop },
0x0242: { n: "BrtSupNameValueStart", f: parsenoop },
0x0243: { n: "BrtSupNameValueEnd", f: parsenoop },
0x0244: { n: "BrtSupNameNum", f: parsenoop },
0x0245: { n: "BrtSupNameErr", f: parsenoop },
0x0246: { n: "BrtSupNameSt", f: parsenoop },
0x0247: { n: "BrtSupNameNil", f: parsenoop },
0x0248: { n: "BrtSupNameBool", f: parsenoop },
0x0249: { n: "BrtSupNameFmla", f: parsenoop },
0x024A: { n: "BrtSupNameBits", f: parsenoop },
0x024B: { n: "BrtSupNameEnd", f: parsenoop },
0x024C: { n: "BrtEndSupBook", f: parsenoop },
0x024D: { n: "BrtCellSmartTagProperty", f: parsenoop },
0x024E: { n: "BrtBeginCellSmartTag", f: parsenoop },
0x024F: { n: "BrtEndCellSmartTag", f: parsenoop },
0x0250: { n: "BrtBeginCellSmartTags", f: parsenoop },
0x0251: { n: "BrtEndCellSmartTags", f: parsenoop },
0x0252: { n: "BrtBeginSmartTags", f: parsenoop },
0x0253: { n: "BrtEndSmartTags", f: parsenoop },
0x0254: { n: "BrtSmartTagType", f: parsenoop },
0x0255: { n: "BrtBeginSmartTagTypes", f: parsenoop },
0x0256: { n: "BrtEndSmartTagTypes", f: parsenoop },
0x0257: { n: "BrtBeginSXFilters", f: parsenoop },
0x0258: { n: "BrtEndSXFilters", f: parsenoop },
0x0259: { n: "BrtBeginSXFILTER", f: parsenoop },
0x025A: { n: "BrtEndSXFilter", f: parsenoop },
0x025B: { n: "BrtBeginFills", f: parsenoop },
0x025C: { n: "BrtEndFills", f: parsenoop },
0x025D: { n: "BrtBeginCellWatches", f: parsenoop },
0x025E: { n: "BrtEndCellWatches", f: parsenoop },
0x025F: { n: "BrtCellWatch", f: parsenoop },
0x0260: { n: "BrtBeginCRErrs", f: parsenoop },
0x0261: { n: "BrtEndCRErrs", f: parsenoop },
0x0262: { n: "BrtCrashRecErr", f: parsenoop },
0x0263: { n: "BrtBeginFonts", f: parsenoop },
0x0264: { n: "BrtEndFonts", f: parsenoop },
0x0265: { n: "BrtBeginBorders", f: parsenoop },
0x0266: { n: "BrtEndBorders", f: parsenoop },
0x0267: { n: "BrtBeginFmts", f: parsenoop },
0x0268: { n: "BrtEndFmts", f: parsenoop },
0x0269: { n: "BrtBeginCellXFs", f: parsenoop },
0x026A: { n: "BrtEndCellXFs", f: parsenoop },
0x026B: { n: "BrtBeginStyles", f: parsenoop },
0x026C: { n: "BrtEndStyles", f: parsenoop },
0x0271: { n: "BrtBigName", f: parsenoop },
0x0272: { n: "BrtBeginCellStyleXFs", f: parsenoop },
0x0273: { n: "BrtEndCellStyleXFs", f: parsenoop },
0x0274: { n: "BrtBeginComments", f: parsenoop },
0x0275: { n: "BrtEndComments", f: parsenoop },
0x0276: { n: "BrtBeginCommentAuthors", f: parsenoop },
0x0277: { n: "BrtEndCommentAuthors", f: parsenoop },
0x0278: { n: "BrtCommentAuthor", f: parse_BrtCommentAuthor },
0x0279: { n: "BrtBeginCommentList", f: parsenoop },
0x027A: { n: "BrtEndCommentList", f: parsenoop },
0x027B: { n: "BrtBeginComment", f: parse_BrtBeginComment },
0x027C: { n: "BrtEndComment", f: parsenoop },
0x027D: { n: "BrtCommentText", f: parse_BrtCommentText },
0x027E: { n: "BrtBeginOleObjects", f: parsenoop },
0x027F: { n: "BrtOleObject", f: parsenoop },
0x0280: { n: "BrtEndOleObjects", f: parsenoop },
0x0281: { n: "BrtBeginSxrules", f: parsenoop },
0x0282: { n: "BrtEndSxRules", f: parsenoop },
0x0283: { n: "BrtBeginActiveXControls", f: parsenoop },
0x0284: { n: "BrtActiveX", f: parsenoop },
0x0285: { n: "BrtEndActiveXControls", f: parsenoop },
0x0286: { n: "BrtBeginPCDSDTCEMembersSortBy", f: parsenoop },
0x0288: { n: "BrtBeginCellIgnoreECs", f: parsenoop },
0x0289: { n: "BrtCellIgnoreEC", f: parsenoop },
0x028A: { n: "BrtEndCellIgnoreECs", f: parsenoop },
0x028B: { n: "BrtCsProp", f: parsenoop },
0x028C: { n: "BrtCsPageSetup", f: parsenoop },
0x028D: { n: "BrtBeginUserCsViews", f: parsenoop },
0x028E: { n: "BrtEndUserCsViews", f: parsenoop },
0x028F: { n: "BrtBeginUserCsView", f: parsenoop },
0x0290: { n: "BrtEndUserCsView", f: parsenoop },
0x0291: { n: "BrtBeginPcdSFCIEntries", f: parsenoop },
0x0292: { n: "BrtEndPCDSFCIEntries", f: parsenoop },
0x0293: { n: "BrtPCDSFCIEntry", f: parsenoop },
0x0294: { n: "BrtBeginListParts", f: parsenoop },
0x0295: { n: "BrtListPart", f: parsenoop },
0x0296: { n: "BrtEndListParts", f: parsenoop },
0x0297: { n: "BrtSheetCalcProp", f: parsenoop },
0x0298: { n: "BrtBeginFnGroup", f: parsenoop },
0x0299: { n: "BrtFnGroup", f: parsenoop },
0x029A: { n: "BrtEndFnGroup", f: parsenoop },
0x029B: { n: "BrtSupAddin", f: parsenoop },
0x029C: { n: "BrtSXTDMPOrder", f: parsenoop },
0x029D: { n: "BrtCsProtection", f: parsenoop },
0x029F: { n: "BrtBeginWsSortMap", f: parsenoop },
0x02A0: { n: "BrtEndWsSortMap", f: parsenoop },
0x02A1: { n: "BrtBeginRRSort", f: parsenoop },
0x02A2: { n: "BrtEndRRSort", f: parsenoop },
0x02A3: { n: "BrtRRSortItem", f: parsenoop },
0x02A4: { n: "BrtFileSharingIso", f: parsenoop },
0x02A5: { n: "BrtBookProtectionIso", f: parsenoop },
0x02A6: { n: "BrtSheetProtectionIso", f: parsenoop },
0x02A7: { n: "BrtCsProtectionIso", f: parsenoop },
0x02A8: { n: "BrtRangeProtectionIso", f: parsenoop },
0x0400: { n: "BrtRwDescent", f: parsenoop },
0x0401: { n: "BrtKnownFonts", f: parsenoop },
0x0402: { n: "BrtBeginSXTupleSet", f: parsenoop },
0x0403: { n: "BrtEndSXTupleSet", f: parsenoop },
0x0404: { n: "BrtBeginSXTupleSetHeader", f: parsenoop },
0x0405: { n: "BrtEndSXTupleSetHeader", f: parsenoop },
0x0406: { n: "BrtSXTupleSetHeaderItem", f: parsenoop },
0x0407: { n: "BrtBeginSXTupleSetData", f: parsenoop },
0x0408: { n: "BrtEndSXTupleSetData", f: parsenoop },
0x0409: { n: "BrtBeginSXTupleSetRow", f: parsenoop },
0x040A: { n: "BrtEndSXTupleSetRow", f: parsenoop },
0x040B: { n: "BrtSXTupleSetRowItem", f: parsenoop },
0x040C: { n: "BrtNameExt", f: parsenoop },
0x040D: { n: "BrtPCDH14", f: parsenoop },
0x040E: { n: "BrtBeginPCDCalcMem14", f: parsenoop },
0x040F: { n: "BrtEndPCDCalcMem14", f: parsenoop },
0x0410: { n: "BrtSXTH14", f: parsenoop },
0x0411: { n: "BrtBeginSparklineGroup", f: parsenoop },
0x0412: { n: "BrtEndSparklineGroup", f: parsenoop },
0x0413: { n: "BrtSparkline", f: parsenoop },
0x0414: { n: "BrtSXDI14", f: parsenoop },
0x0415: { n: "BrtWsFmtInfoEx14", f: parsenoop },
0x0416: { n: "BrtBeginConditionalFormatting14", f: parsenoop },
0x0417: { n: "BrtEndConditionalFormatting14", f: parsenoop },
0x0418: { n: "BrtBeginCFRule14", f: parsenoop },
0x0419: { n: "BrtEndCFRule14", f: parsenoop },
0x041A: { n: "BrtCFVO14", f: parsenoop },
0x041B: { n: "BrtBeginDatabar14", f: parsenoop },
0x041C: { n: "BrtBeginIconSet14", f: parsenoop },
0x041D: { n: "BrtDVal14", f: parsenoop },
0x041E: { n: "BrtBeginDVals14", f: parsenoop },
0x041F: { n: "BrtColor14", f: parsenoop },
0x0420: { n: "BrtBeginSparklines", f: parsenoop },
0x0421: { n: "BrtEndSparklines", f: parsenoop },
0x0422: { n: "BrtBeginSparklineGroups", f: parsenoop },
0x0423: { n: "BrtEndSparklineGroups", f: parsenoop },
0x0425: { n: "BrtSXVD14", f: parsenoop },
0x0426: { n: "BrtBeginSxview14", f: parsenoop },
0x0427: { n: "BrtEndSxview14", f: parsenoop },
0x042A: { n: "BrtBeginPCD14", f: parsenoop },
0x042B: { n: "BrtEndPCD14", f: parsenoop },
0x042C: { n: "BrtBeginExtConn14", f: parsenoop },
0x042D: { n: "BrtEndExtConn14", f: parsenoop },
0x042E: { n: "BrtBeginSlicerCacheIDs", f: parsenoop },
0x042F: { n: "BrtEndSlicerCacheIDs", f: parsenoop },
0x0430: { n: "BrtBeginSlicerCacheID", f: parsenoop },
0x0431: { n: "BrtEndSlicerCacheID", f: parsenoop },
0x0433: { n: "BrtBeginSlicerCache", f: parsenoop },
0x0434: { n: "BrtEndSlicerCache", f: parsenoop },
0x0435: { n: "BrtBeginSlicerCacheDef", f: parsenoop },
0x0436: { n: "BrtEndSlicerCacheDef", f: parsenoop },
0x0437: { n: "BrtBeginSlicersEx", f: parsenoop },
0x0438: { n: "BrtEndSlicersEx", f: parsenoop },
0x0439: { n: "BrtBeginSlicerEx", f: parsenoop },
0x043A: { n: "BrtEndSlicerEx", f: parsenoop },
0x043B: { n: "BrtBeginSlicer", f: parsenoop },
0x043C: { n: "BrtEndSlicer", f: parsenoop },
0x043D: { n: "BrtSlicerCachePivotTables", f: parsenoop },
0x043E: { n: "BrtBeginSlicerCacheOlapImpl", f: parsenoop },
0x043F: { n: "BrtEndSlicerCacheOlapImpl", f: parsenoop },
0x0440: { n: "BrtBeginSlicerCacheLevelsData", f: parsenoop },
0x0441: { n: "BrtEndSlicerCacheLevelsData", f: parsenoop },
0x0442: { n: "BrtBeginSlicerCacheLevelData", f: parsenoop },
0x0443: { n: "BrtEndSlicerCacheLevelData", f: parsenoop },
0x0444: { n: "BrtBeginSlicerCacheSiRanges", f: parsenoop },
0x0445: { n: "BrtEndSlicerCacheSiRanges", f: parsenoop },
0x0446: { n: "BrtBeginSlicerCacheSiRange", f: parsenoop },
0x0447: { n: "BrtEndSlicerCacheSiRange", f: parsenoop },
0x0448: { n: "BrtSlicerCacheOlapItem", f: parsenoop },
0x0449: { n: "BrtBeginSlicerCacheSelections", f: parsenoop },
0x044A: { n: "BrtSlicerCacheSelection", f: parsenoop },
0x044B: { n: "BrtEndSlicerCacheSelections", f: parsenoop },
0x044C: { n: "BrtBeginSlicerCacheNative", f: parsenoop },
0x044D: { n: "BrtEndSlicerCacheNative", f: parsenoop },
0x044E: { n: "BrtSlicerCacheNativeItem", f: parsenoop },
0x044F: { n: "BrtRangeProtection14", f: parsenoop },
0x0450: { n: "BrtRangeProtectionIso14", f: parsenoop },
0x0451: { n: "BrtCellIgnoreEC14", f: parsenoop },
0x0457: { n: "BrtList14", f: parsenoop },
0x0458: { n: "BrtCFIcon", f: parsenoop },
0x0459: { n: "BrtBeginSlicerCachesPivotCacheIDs", f: parsenoop },
0x045A: { n: "BrtEndSlicerCachesPivotCacheIDs", f: parsenoop },
0x045B: { n: "BrtBeginSlicers", f: parsenoop },
0x045C: { n: "BrtEndSlicers", f: parsenoop },
0x045D: { n: "BrtWbProp14", f: parsenoop },
0x045E: { n: "BrtBeginSXEdit", f: parsenoop },
0x045F: { n: "BrtEndSXEdit", f: parsenoop },
0x0460: { n: "BrtBeginSXEdits", f: parsenoop },
0x0461: { n: "BrtEndSXEdits", f: parsenoop },
0x0462: { n: "BrtBeginSXChange", f: parsenoop },
0x0463: { n: "BrtEndSXChange", f: parsenoop },
0x0464: { n: "BrtBeginSXChanges", f: parsenoop },
0x0465: { n: "BrtEndSXChanges", f: parsenoop },
0x0466: { n: "BrtSXTupleItems", f: parsenoop },
0x0468: { n: "BrtBeginSlicerStyle", f: parsenoop },
0x0469: { n: "BrtEndSlicerStyle", f: parsenoop },
0x046A: { n: "BrtSlicerStyleElement", f: parsenoop },
0x046B: { n: "BrtBeginStyleSheetExt14", f: parsenoop },
0x046C: { n: "BrtEndStyleSheetExt14", f: parsenoop },
0x046D: { n: "BrtBeginSlicerCachesPivotCacheID", f: parsenoop },
0x046E: { n: "BrtEndSlicerCachesPivotCacheID", f: parsenoop },
0x046F: { n: "BrtBeginConditionalFormattings", f: parsenoop },
0x0470: { n: "BrtEndConditionalFormattings", f: parsenoop },
0x0471: { n: "BrtBeginPCDCalcMemExt", f: parsenoop },
0x0472: { n: "BrtEndPCDCalcMemExt", f: parsenoop },
0x0473: { n: "BrtBeginPCDCalcMemsExt", f: parsenoop },
0x0474: { n: "BrtEndPCDCalcMemsExt", f: parsenoop },
0x0475: { n: "BrtPCDField14", f: parsenoop },
0x0476: { n: "BrtBeginSlicerStyles", f: parsenoop },
0x0477: { n: "BrtEndSlicerStyles", f: parsenoop },
0x0478: { n: "BrtBeginSlicerStyleElements", f: parsenoop },
0x0479: { n: "BrtEndSlicerStyleElements", f: parsenoop },
0x047A: { n: "BrtCFRuleExt", f: parsenoop },
0x047B: { n: "BrtBeginSXCondFmt14", f: parsenoop },
0x047C: { n: "BrtEndSXCondFmt14", f: parsenoop },
0x047D: { n: "BrtBeginSXCondFmts14", f: parsenoop },
0x047E: { n: "BrtEndSXCondFmts14", f: parsenoop },
0x0480: { n: "BrtBeginSortCond14", f: parsenoop },
0x0481: { n: "BrtEndSortCond14", f: parsenoop },
0x0482: { n: "BrtEndDVals14", f: parsenoop },
0x0483: { n: "BrtEndIconSet14", f: parsenoop },
0x0484: { n: "BrtEndDatabar14", f: parsenoop },
0x0485: { n: "BrtBeginColorScale14", f: parsenoop },
0x0486: { n: "BrtEndColorScale14", f: parsenoop },
0x0487: { n: "BrtBeginSxrules14", f: parsenoop },
0x0488: { n: "BrtEndSxrules14", f: parsenoop },
0x0489: { n: "BrtBeginPRule14", f: parsenoop },
0x048A: { n: "BrtEndPRule14", f: parsenoop },
0x048B: { n: "BrtBeginPRFilters14", f: parsenoop },
0x048C: { n: "BrtEndPRFilters14", f: parsenoop },
0x048D: { n: "BrtBeginPRFilter14", f: parsenoop },
0x048E: { n: "BrtEndPRFilter14", f: parsenoop },
0x048F: { n: "BrtBeginPRFItem14", f: parsenoop },
0x0490: { n: "BrtEndPRFItem14", f: parsenoop },
0x0491: { n: "BrtBeginCellIgnoreECs14", f: parsenoop },
0x0492: { n: "BrtEndCellIgnoreECs14", f: parsenoop },
0x0493: { n: "BrtDxf14", f: parsenoop },
0x0494: { n: "BrtBeginDxF14s", f: parsenoop },
0x0495: { n: "BrtEndDxf14s", f: parsenoop },
0x0499: { n: "BrtFilter14", f: parsenoop },
0x049A: { n: "BrtBeginCustomFilters14", f: parsenoop },
0x049C: { n: "BrtCustomFilter14", f: parsenoop },
0x049D: { n: "BrtIconFilter14", f: parsenoop },
0x049E: { n: "BrtPivotCacheConnectionName", f: parsenoop },
0x0800: { n: "BrtBeginDecoupledPivotCacheIDs", f: parsenoop },
0x0801: { n: "BrtEndDecoupledPivotCacheIDs", f: parsenoop },
0x0802: { n: "BrtDecoupledPivotCacheID", f: parsenoop },
0x0803: { n: "BrtBeginPivotTableRefs", f: parsenoop },
0x0804: { n: "BrtEndPivotTableRefs", f: parsenoop },
0x0805: { n: "BrtPivotTableRef", f: parsenoop },
0x0806: { n: "BrtSlicerCacheBookPivotTables", f: parsenoop },
0x0807: { n: "BrtBeginSxvcells", f: parsenoop },
0x0808: { n: "BrtEndSxvcells", f: parsenoop },
0x0809: { n: "BrtBeginSxRow", f: parsenoop },
0x080A: { n: "BrtEndSxRow", f: parsenoop },
0x080C: { n: "BrtPcdCalcMem15", f: parsenoop },
0x0813: { n: "BrtQsi15", f: parsenoop },
0x0814: { n: "BrtBeginWebExtensions", f: parsenoop },
0x0815: { n: "BrtEndWebExtensions", f: parsenoop },
0x0816: { n: "BrtWebExtension", f: parsenoop },
0x0817: { n: "BrtAbsPath15", f: parsenoop },
0x0818: { n: "BrtBeginPivotTableUISettings", f: parsenoop },
0x0819: { n: "BrtEndPivotTableUISettings", f: parsenoop },
0x081B: { n: "BrtTableSlicerCacheIDs", f: parsenoop },
0x081C: { n: "BrtTableSlicerCacheID", f: parsenoop },
0x081D: { n: "BrtBeginTableSlicerCache", f: parsenoop },
0x081E: { n: "BrtEndTableSlicerCache", f: parsenoop },
0x081F: { n: "BrtSxFilter15", f: parsenoop },
0x0820: { n: "BrtBeginTimelineCachePivotCacheIDs", f: parsenoop },
0x0821: { n: "BrtEndTimelineCachePivotCacheIDs", f: parsenoop },
0x0822: { n: "BrtTimelineCachePivotCacheID", f: parsenoop },
0x0823: { n: "BrtBeginTimelineCacheIDs", f: parsenoop },
0x0824: { n: "BrtEndTimelineCacheIDs", f: parsenoop },
0x0825: { n: "BrtBeginTimelineCacheID", f: parsenoop },
0x0826: { n: "BrtEndTimelineCacheID", f: parsenoop },
0x0827: { n: "BrtBeginTimelinesEx", f: parsenoop },
0x0828: { n: "BrtEndTimelinesEx", f: parsenoop },
0x0829: { n: "BrtBeginTimelineEx", f: parsenoop },
0x082A: { n: "BrtEndTimelineEx", f: parsenoop },
0x082B: { n: "BrtWorkBookPr15", f: parsenoop },
0x082C: { n: "BrtPCDH15", f: parsenoop },
0x082D: { n: "BrtBeginTimelineStyle", f: parsenoop },
0x082E: { n: "BrtEndTimelineStyle", f: parsenoop },
0x082F: { n: "BrtTimelineStyleElement", f: parsenoop },
0x0830: { n: "BrtBeginTimelineStylesheetExt15", f: parsenoop },
0x0831: { n: "BrtEndTimelineStylesheetExt15", f: parsenoop },
0x0832: { n: "BrtBeginTimelineStyles", f: parsenoop },
0x0833: { n: "BrtEndTimelineStyles", f: parsenoop },
0x0834: { n: "BrtBeginTimelineStyleElements", f: parsenoop },
0x0835: { n: "BrtEndTimelineStyleElements", f: parsenoop },
0x0836: { n: "BrtDxf15", f: parsenoop },
0x0837: { n: "BrtBeginDxfs15", f: parsenoop },
0x0838: { n: "brtEndDxfs15", f: parsenoop },
0x0839: { n: "BrtSlicerCacheHideItemsWithNoData", f: parsenoop },
0x083A: { n: "BrtBeginItemUniqueNames", f: parsenoop },
0x083B: { n: "BrtEndItemUniqueNames", f: parsenoop },
0x083C: { n: "BrtItemUniqueName", f: parsenoop },
0x083D: { n: "BrtBeginExtConn15", f: parsenoop },
0x083E: { n: "BrtEndExtConn15", f: parsenoop },
0x083F: { n: "BrtBeginOledbPr15", f: parsenoop },
0x0840: { n: "BrtEndOledbPr15", f: parsenoop },
0x0841: { n: "BrtBeginDataFeedPr15", f: parsenoop },
0x0842: { n: "BrtEndDataFeedPr15", f: parsenoop },
0x0843: { n: "BrtTextPr15", f: parsenoop },
0x0844: { n: "BrtRangePr15", f: parsenoop },
0x0845: { n: "BrtDbCommand15", f: parsenoop },
0x0846: { n: "BrtBeginDbTables15", f: parsenoop },
0x0847: { n: "BrtEndDbTables15", f: parsenoop },
0x0848: { n: "BrtDbTable15", f: parsenoop },
0x0849: { n: "BrtBeginDataModel", f: parsenoop },
0x084A: { n: "BrtEndDataModel", f: parsenoop },
0x084B: { n: "BrtBeginModelTables", f: parsenoop },
0x084C: { n: "BrtEndModelTables", f: parsenoop },
0x084D: { n: "BrtModelTable", f: parsenoop },
0x084E: { n: "BrtBeginModelRelationships", f: parsenoop },
0x084F: { n: "BrtEndModelRelationships", f: parsenoop },
0x0850: { n: "BrtModelRelationship", f: parsenoop },
0x0851: { n: "BrtBeginECTxtWiz15", f: parsenoop },
0x0852: { n: "BrtEndECTxtWiz15", f: parsenoop },
0x0853: { n: "BrtBeginECTWFldInfoLst15", f: parsenoop },
0x0854: { n: "BrtEndECTWFldInfoLst15", f: parsenoop },
0x0855: { n: "BrtBeginECTWFldInfo15", f: parsenoop },
0x0856: { n: "BrtFieldListActiveItem", f: parsenoop },
0x0857: { n: "BrtPivotCacheIdVersion", f: parsenoop },
0x0858: { n: "BrtSXDI15", f: parsenoop },
0xFFFF: { n: "", f: parsenoop }
}; var evert_RE = evert_key(XLSBRecordEnum, 'n'); /* [MS-XLS] 2.3 Record Enumeration */
var XLSRecordEnum = {
0x0003: { n: "BIFF2NUM", f: parse_BIFF2NUM },
0x0004: { n: "BIFF2STR", f: parse_BIFF2STR },
0x0006: { n: "Formula", f: parse_Formula },
0x0009: { n: 'BOF', f: parse_BOF },
0x000a: { n: 'EOF', f: parse_EOF },
0x000c: { n: "CalcCount", f: parse_CalcCount },
0x000d: { n: "CalcMode", f: parse_CalcMode },
0x000e: { n: "CalcPrecision", f: parse_CalcPrecision },
0x000f: { n: "CalcRefMode", f: parse_CalcRefMode },
0x0010: { n: "CalcDelta", f: parse_CalcDelta },
0x0011: { n: "CalcIter", f: parse_CalcIter },
0x0012: { n: "Protect", f: parse_Protect },
0x0013: { n: "Password", f: parse_Password },
0x0014: { n: "Header", f: parse_Header },
0x0015: { n: "Footer", f: parse_Footer },
0x0017: { n: "ExternSheet", f: parse_ExternSheet },
0x0018: { n: "Lbl", f: parse_Lbl },
0x0019: { n: "WinProtect", f: parse_WinProtect },
0x001a: { n: "VerticalPageBreaks", f: parse_VerticalPageBreaks },
0x001b: { n: "HorizontalPageBreaks", f: parse_HorizontalPageBreaks },
0x001c: { n: "Note", f: parse_Note },
0x001d: { n: "Selection", f: parse_Selection },
0x0022: { n: "Date1904", f: parse_Date1904 },
0x0023: { n: "ExternName", f: parse_ExternName },
0x0026: { n: "LeftMargin", f: parse_LeftMargin },
0x0027: { n: "RightMargin", f: parse_RightMargin },
0x0028: { n: "TopMargin", f: parse_TopMargin },
0x0029: { n: "BottomMargin", f: parse_BottomMargin },
0x002a: { n: "PrintRowCol", f: parse_PrintRowCol },
0x002b: { n: "PrintGrid", f: parse_PrintGrid },
0x002f: { n: "FilePass", f: parse_FilePass },
0x0031: { n: "Font", f: parse_Font },
0x0033: { n: "PrintSize", f: parse_PrintSize },
0x003c: { n: "Continue", f: parse_Continue },
0x003d: { n: "Window1", f: parse_Window1 },
0x0040: { n: "Backup", f: parse_Backup },
0x0041: { n: "Pane", f: parse_Pane },
0x0042: { n: 'CodePage', f: parse_CodePage },
0x004d: { n: "Pls", f: parse_Pls },
0x0050: { n: "DCon", f: parse_DCon },
0x0051: { n: "DConRef", f: parse_DConRef },
0x0052: { n: "DConName", f: parse_DConName },
0x0055: { n: "DefColWidth", f: parse_DefColWidth },
0x0059: { n: "XCT", f: parse_XCT },
0x005a: { n: "CRN", f: parse_CRN },
0x005b: { n: "FileSharing", f: parse_FileSharing },
0x005c: { n: 'WriteAccess', f: parse_WriteAccess },
0x005d: { n: "Obj", f: parse_Obj },
0x005e: { n: "Uncalced", f: parse_Uncalced },
0x005f: { n: "CalcSaveRecalc", f: parse_CalcSaveRecalc },
0x0060: { n: "Template", f: parse_Template },
0x0061: { n: "Intl", f: parse_Intl },
0x0063: { n: "ObjProtect", f: parse_ObjProtect },
0x007d: { n: "ColInfo", f: parse_ColInfo },
0x0080: { n: "Guts", f: parse_Guts },
0x0081: { n: "WsBool", f: parse_WsBool },
0x0082: { n: "GridSet", f: parse_GridSet },
0x0083: { n: "HCenter", f: parse_HCenter },
0x0084: { n: "VCenter", f: parse_VCenter },
0x0085: { n: 'BoundSheet8', f: parse_BoundSheet8 },
0x0086: { n: "WriteProtect", f: parse_WriteProtect },
0x008c: { n: "Country", f: parse_Country },
0x008d: { n: "HideObj", f: parse_HideObj },
0x0090: { n: "Sort", f: parse_Sort },
0x0092: { n: "Palette", f: parse_Palette },
0x0097: { n: "Sync", f: parse_Sync },
0x0098: { n: "LPr", f: parse_LPr },
0x0099: { n: "DxGCol", f: parse_DxGCol },
0x009a: { n: "FnGroupName", f: parse_FnGroupName },
0x009b: { n: "FilterMode", f: parse_FilterMode },
0x009c: { n: "BuiltInFnGroupCount", f: parse_BuiltInFnGroupCount },
0x009d: { n: "AutoFilterInfo", f: parse_AutoFilterInfo },
0x009e: { n: "AutoFilter", f: parse_AutoFilter },
0x00a0: { n: "Scl", f: parse_Scl },
0x00a1: { n: "Setup", f: parse_Setup },
0x00ae: { n: "ScenMan", f: parse_ScenMan },
0x00af: { n: "SCENARIO", f: parse_SCENARIO },
0x00b0: { n: "SxView", f: parse_SxView },
0x00b1: { n: "Sxvd", f: parse_Sxvd },
0x00b2: { n: "SXVI", f: parse_SXVI },
0x00b4: { n: "SxIvd", f: parse_SxIvd },
0x00b5: { n: "SXLI", f: parse_SXLI },
0x00b6: { n: "SXPI", f: parse_SXPI },
0x00b8: { n: "DocRoute", f: parse_DocRoute },
0x00b9: { n: "RecipName", f: parse_RecipName },
0x00bd: { n: "MulRk", f: parse_MulRk },
0x00be: { n: "MulBlank", f: parse_MulBlank },
0x00c1: { n: 'Mms', f: parse_Mms },
0x00c5: { n: "SXDI", f: parse_SXDI },
0x00c6: { n: "SXDB", f: parse_SXDB },
0x00c7: { n: "SXFDB", f: parse_SXFDB },
0x00c8: { n: "SXDBB", f: parse_SXDBB },
0x00c9: { n: "SXNum", f: parse_SXNum },
0x00ca: { n: "SxBool", f: parse_SxBool },
0x00cb: { n: "SxErr", f: parse_SxErr },
0x00cc: { n: "SXInt", f: parse_SXInt },
0x00cd: { n: "SXString", f: parse_SXString },
0x00ce: { n: "SXDtr", f: parse_SXDtr },
0x00cf: { n: "SxNil", f: parse_SxNil },
0x00d0: { n: "SXTbl", f: parse_SXTbl },
0x00d1: { n: "SXTBRGIITM", f: parse_SXTBRGIITM },
0x00d2: { n: "SxTbpg", f: parse_SxTbpg },
0x00d3: { n: "ObProj", f: parse_ObProj },
0x00d5: { n: "SXStreamID", f: parse_SXStreamID },
0x00d7: { n: "DBCell", f: parse_DBCell },
0x00d8: { n: "SXRng", f: parse_SXRng },
0x00d9: { n: "SxIsxoper", f: parse_SxIsxoper },
0x00da: { n: "BookBool", f: parse_BookBool },
0x00dc: { n: "DbOrParamQry", f: parse_DbOrParamQry },
0x00dd: { n: "ScenarioProtect", f: parse_ScenarioProtect },
0x00de: { n: "OleObjectSize", f: parse_OleObjectSize },
0x00e0: { n: "XF", f: parse_XF },
0x00e1: { n: 'InterfaceHdr', f: parse_InterfaceHdr },
0x00e2: { n: 'InterfaceEnd', f: parse_InterfaceEnd },
0x00e3: { n: "SXVS", f: parse_SXVS },
0x00e5: { n: "MergeCells", f: parse_MergeCells },
0x00e9: { n: "BkHim", f: parse_BkHim },
0x00eb: { n: "MsoDrawingGroup", f: parse_MsoDrawingGroup },
0x00ec: { n: "MsoDrawing", f: parse_MsoDrawing },
0x00ed: { n: "MsoDrawingSelection", f: parse_MsoDrawingSelection },
0x00ef: { n: "PhoneticInfo", f: parse_PhoneticInfo },
0x00f0: { n: "SxRule", f: parse_SxRule },
0x00f1: { n: "SXEx", f: parse_SXEx },
0x00f2: { n: "SxFilt", f: parse_SxFilt },
0x00f4: { n: "SxDXF", f: parse_SxDXF },
0x00f5: { n: "SxItm", f: parse_SxItm },
0x00f6: { n: "SxName", f: parse_SxName },
0x00f7: { n: "SxSelect", f: parse_SxSelect },
0x00f8: { n: "SXPair", f: parse_SXPair },
0x00f9: { n: "SxFmla", f: parse_SxFmla },
0x00fb: { n: "SxFormat", f: parse_SxFormat },
0x00fc: { n: "SST", f: parse_SST },
0x00fd: { n: "LabelSst", f: parse_LabelSst },
0x00ff: { n: "ExtSST", f: parse_ExtSST },
0x0100: { n: "SXVDEx", f: parse_SXVDEx },
0x0103: { n: "SXFormula", f: parse_SXFormula },
0x0122: { n: "SXDBEx", f: parse_SXDBEx },
0x0137: { n: "RRDInsDel", f: parse_RRDInsDel },
0x0138: { n: "RRDHead", f: parse_RRDHead },
0x013b: { n: "RRDChgCell", f: parse_RRDChgCell },
0x013d: { n: "RRTabId", f: parse_RRTabId },
0x013e: { n: "RRDRenSheet", f: parse_RRDRenSheet },
0x013f: { n: "RRSort", f: parse_RRSort },
0x0140: { n: "RRDMove", f: parse_RRDMove },
0x014a: { n: "RRFormat", f: parse_RRFormat },
0x014b: { n: "RRAutoFmt", f: parse_RRAutoFmt },
0x014d: { n: "RRInsertSh", f: parse_RRInsertSh },
0x014e: { n: "RRDMoveBegin", f: parse_RRDMoveBegin },
0x014f: { n: "RRDMoveEnd", f: parse_RRDMoveEnd },
0x0150: { n: "RRDInsDelBegin", f: parse_RRDInsDelBegin },
0x0151: { n: "RRDInsDelEnd", f: parse_RRDInsDelEnd },
0x0152: { n: "RRDConflict", f: parse_RRDConflict },
0x0153: { n: "RRDDefName", f: parse_RRDDefName },
0x0154: { n: "RRDRstEtxp", f: parse_RRDRstEtxp },
0x015f: { n: "LRng", f: parse_LRng },
0x0160: { n: "UsesELFs", f: parse_UsesELFs },
0x0161: { n: "DSF", f: parse_DSF },
0x0191: { n: "CUsr", f: parse_CUsr },
0x0192: { n: "CbUsr", f: parse_CbUsr },
0x0193: { n: "UsrInfo", f: parse_UsrInfo },
0x0194: { n: "UsrExcl", f: parse_UsrExcl },
0x0195: { n: "FileLock", f: parse_FileLock },
0x0196: { n: "RRDInfo", f: parse_RRDInfo },
0x0197: { n: "BCUsrs", f: parse_BCUsrs },
0x0198: { n: "UsrChk", f: parse_UsrChk },
0x01a9: { n: "UserBView", f: parse_UserBView },
0x01aa: { n: "UserSViewBegin", f: parse_UserSViewBegin },
0x01ab: { n: "UserSViewEnd", f: parse_UserSViewEnd },
0x01ac: { n: "RRDUserView", f: parse_RRDUserView },
0x01ad: { n: "Qsi", f: parse_Qsi },
0x01ae: { n: "SupBook", f: parse_SupBook },
0x01af: { n: "Prot4Rev", f: parse_Prot4Rev },
0x01b0: { n: "CondFmt", f: parse_CondFmt },
0x01b1: { n: "CF", f: parse_CF },
0x01b2: { n: "DVal", f: parse_DVal },
0x01b5: { n: "DConBin", f: parse_DConBin },
0x01b6: { n: "TxO", f: parse_TxO },
0x01b7: { n: "RefreshAll", f: parse_RefreshAll },
0x01b8: { n: "HLink", f: parse_HLink },
0x01b9: { n: "Lel", f: parse_Lel },
0x01ba: { n: "CodeName", f: parse_XLSCodeName },
0x01bb: { n: "SXFDBType", f: parse_SXFDBType },
0x01bc: { n: "Prot4RevPass", f: parse_Prot4RevPass },
0x01bd: { n: "ObNoMacros", f: parse_ObNoMacros },
0x01be: { n: "Dv", f: parse_Dv },
0x01c0: { n: "Excel9File", f: parse_Excel9File },
0x01c1: { n: "RecalcId", f: parse_RecalcId, r: 2 },
0x01c2: { n: "EntExU2", f: parse_EntExU2 },
0x0200: { n: "Dimensions", f: parse_Dimensions },
0x0201: { n: "Blank", f: parse_Blank },
0x0203: { n: "Number", f: parse_Number },
0x0204: { n: "Label", f: parse_Label },
0x0205: { n: "BoolErr", f: parse_BoolErr },
0x0207: { n: "String", f: parse_String },
0x0208: { n: 'Row', f: parse_Row },
0x020b: { n: "Index", f: parse_Index },
0x0221: { n: "Array", f: parse_Array },
0x0225: { n: "DefaultRowHeight", f: parse_DefaultRowHeight },
0x0236: { n: "Table", f: parse_Table },
0x023e: { n: "Window2", f: parse_Window2 },
0x027e: { n: "RK", f: parse_RK },
0x0293: { n: "Style", f: parse_Style },
0x0418: { n: "BigName", f: parse_BigName },
0x041e: { n: "Format", f: parse_Format },
0x043c: { n: "ContinueBigName", f: parse_ContinueBigName },
0x04bc: { n: "ShrFmla", f: parse_ShrFmla },
0x0800: { n: "HLinkTooltip", f: parse_HLinkTooltip },
0x0801: { n: "WebPub", f: parse_WebPub },
0x0802: { n: "QsiSXTag", f: parse_QsiSXTag },
0x0803: { n: "DBQueryExt", f: parse_DBQueryExt },
0x0804: { n: "ExtString", f: parse_ExtString },
0x0805: { n: "TxtQry", f: parse_TxtQry },
0x0806: { n: "Qsir", f: parse_Qsir },
0x0807: { n: "Qsif", f: parse_Qsif },
0x0808: { n: "RRDTQSIF", f: parse_RRDTQSIF },
0x0809: { n: 'BOF', f: parse_BOF },
0x080a: { n: "OleDbConn", f: parse_OleDbConn },
0x080b: { n: "WOpt", f: parse_WOpt },
0x080c: { n: "SXViewEx", f: parse_SXViewEx },
0x080d: { n: "SXTH", f: parse_SXTH },
0x080e: { n: "SXPIEx", f: parse_SXPIEx },
0x080f: { n: "SXVDTEx", f: parse_SXVDTEx },
0x0810: { n: "SXViewEx9", f: parse_SXViewEx9 },
0x0812: { n: "ContinueFrt", f: parse_ContinueFrt },
0x0813: { n: "RealTimeData", f: parse_RealTimeData },
0x0850: { n: "ChartFrtInfo", f: parse_ChartFrtInfo },
0x0851: { n: "FrtWrapper", f: parse_FrtWrapper },
0x0852: { n: "StartBlock", f: parse_StartBlock },
0x0853: { n: "EndBlock", f: parse_EndBlock },
0x0854: { n: "StartObject", f: parse_StartObject },
0x0855: { n: "EndObject", f: parse_EndObject },
0x0856: { n: "CatLab", f: parse_CatLab },
0x0857: { n: "YMult", f: parse_YMult },
0x0858: { n: "SXViewLink", f: parse_SXViewLink },
0x0859: { n: "PivotChartBits", f: parse_PivotChartBits },
0x085a: { n: "FrtFontList", f: parse_FrtFontList },
0x0862: { n: "SheetExt", f: parse_SheetExt },
0x0863: { n: "BookExt", f: parse_BookExt, r: 12 },
0x0864: { n: "SXAddl", f: parse_SXAddl },
0x0865: { n: "CrErr", f: parse_CrErr },
0x0866: { n: "HFPicture", f: parse_HFPicture },
0x0867: { n: 'FeatHdr', f: parse_FeatHdr },
0x0868: { n: "Feat", f: parse_Feat },
0x086a: { n: "DataLabExt", f: parse_DataLabExt },
0x086b: { n: "DataLabExtContents", f: parse_DataLabExtContents },
0x086c: { n: "CellWatch", f: parse_CellWatch },
0x0871: { n: "FeatHdr11", f: parse_FeatHdr11 },
0x0872: { n: "Feature11", f: parse_Feature11 },
0x0874: { n: "DropDownObjIds", f: parse_DropDownObjIds },
0x0875: { n: "ContinueFrt11", f: parse_ContinueFrt11 },
0x0876: { n: "DConn", f: parse_DConn },
0x0877: { n: "List12", f: parse_List12 },
0x0878: { n: "Feature12", f: parse_Feature12 },
0x0879: { n: "CondFmt12", f: parse_CondFmt12 },
0x087a: { n: "CF12", f: parse_CF12 },
0x087b: { n: "CFEx", f: parse_CFEx },
0x087c: { n: "XFCRC", f: parse_XFCRC, r: 12 },
0x087d: { n: "XFExt", f: parse_XFExt, r: 12 },
0x087e: { n: "AutoFilter12", f: parse_AutoFilter12 },
0x087f: { n: "ContinueFrt12", f: parse_ContinueFrt12 },
0x0884: { n: "MDTInfo", f: parse_MDTInfo },
0x0885: { n: "MDXStr", f: parse_MDXStr },
0x0886: { n: "MDXTuple", f: parse_MDXTuple },
0x0887: { n: "MDXSet", f: parse_MDXSet },
0x0888: { n: "MDXProp", f: parse_MDXProp },
0x0889: { n: "MDXKPI", f: parse_MDXKPI },
0x088a: { n: "MDB", f: parse_MDB },
0x088b: { n: "PLV", f: parse_PLV },
0x088c: { n: "Compat12", f: parse_Compat12, r: 12 },
0x088d: { n: "DXF", f: parse_DXF },
0x088e: { n: "TableStyles", f: parse_TableStyles, r: 12 },
0x088f: { n: "TableStyle", f: parse_TableStyle },
0x0890: { n: "TableStyleElement", f: parse_TableStyleElement },
0x0892: { n: "StyleExt", f: parse_StyleExt },
0x0893: { n: "NamePublish", f: parse_NamePublish },
0x0894: { n: "NameCmt", f: parse_NameCmt },
0x0895: { n: "SortData", f: parse_SortData },
0x0896: { n: "Theme", f: parse_Theme, r: 12 },
0x0897: { n: "GUIDTypeLib", f: parse_GUIDTypeLib },
0x0898: { n: "FnGrp12", f: parse_FnGrp12 },
0x0899: { n: "NameFnGrp12", f: parse_NameFnGrp12 },
0x089a: { n: "MTRSettings", f: parse_MTRSettings, r: 12 },
0x089b: { n: "CompressPictures", f: parse_CompressPictures },
0x089c: { n: "HeaderFooter", f: parse_HeaderFooter },
0x089d: { n: "CrtLayout12", f: parse_CrtLayout12 },
0x089e: { n: "CrtMlFrt", f: parse_CrtMlFrt },
0x089f: { n: "CrtMlFrtContinue", f: parse_CrtMlFrtContinue },
0x08a3: { n: "ForceFullCalculation", f: parse_ForceFullCalculation },
0x08a4: { n: "ShapePropsStream", f: parse_ShapePropsStream },
0x08a5: { n: "TextPropsStream", f: parse_TextPropsStream },
0x08a6: { n: "RichTextStream", f: parse_RichTextStream },
0x08a7: { n: "CrtLayout12A", f: parse_CrtLayout12A },
0x1001: { n: "Units", f: parse_Units },
0x1002: { n: "Chart", f: parse_Chart },
0x1003: { n: "Series", f: parse_Series },
0x1006: { n: "DataFormat", f: parse_DataFormat },
0x1007: { n: "LineFormat", f: parse_LineFormat },
0x1009: { n: "MarkerFormat", f: parse_MarkerFormat },
0x100a: { n: "AreaFormat", f: parse_AreaFormat },
0x100b: { n: "PieFormat", f: parse_PieFormat },
0x100c: { n: "AttachedLabel", f: parse_AttachedLabel },
0x100d: { n: "SeriesText", f: parse_SeriesText },
0x1014: { n: "ChartFormat", f: parse_ChartFormat },
0x1015: { n: "Legend", f: parse_Legend },
0x1016: { n: "SeriesList", f: parse_SeriesList },
0x1017: { n: "Bar", f: parse_Bar },
0x1018: { n: "Line", f: parse_Line },
0x1019: { n: "Pie", f: parse_Pie },
0x101a: { n: "Area", f: parse_Area },
0x101b: { n: "Scatter", f: parse_Scatter },
0x101c: { n: "CrtLine", f: parse_CrtLine },
0x101d: { n: "Axis", f: parse_Axis },
0x101e: { n: "Tick", f: parse_Tick },
0x101f: { n: "ValueRange", f: parse_ValueRange },
0x1020: { n: "CatSerRange", f: parse_CatSerRange },
0x1021: { n: "AxisLine", f: parse_AxisLine },
0x1022: { n: "CrtLink", f: parse_CrtLink },
0x1024: { n: "DefaultText", f: parse_DefaultText },
0x1025: { n: "Text", f: parse_Text },
0x1026: { n: "FontX", f: parse_FontX },
0x1027: { n: "ObjectLink", f: parse_ObjectLink },
0x1032: { n: "Frame", f: parse_Frame },
0x1033: { n: "Begin", f: parse_Begin },
0x1034: { n: "End", f: parse_End },
0x1035: { n: "PlotArea", f: parse_PlotArea },
0x103a: { n: "Chart3d", f: parse_Chart3d },
0x103c: { n: "PicF", f: parse_PicF },
0x103d: { n: "DropBar", f: parse_DropBar },
0x103e: { n: "Radar", f: parse_Radar },
0x103f: { n: "Surf", f: parse_Surf },
0x1040: { n: "RadarArea", f: parse_RadarArea },
0x1041: { n: "AxisParent", f: parse_AxisParent },
0x1043: { n: "LegendException", f: parse_LegendException },
0x1044: { n: "ShtProps", f: parse_ShtProps },
0x1045: { n: "SerToCrt", f: parse_SerToCrt },
0x1046: { n: "AxesUsed", f: parse_AxesUsed },
0x1048: { n: "SBaseRef", f: parse_SBaseRef },
0x104a: { n: "SerParent", f: parse_SerParent },
0x104b: { n: "SerAuxTrend", f: parse_SerAuxTrend },
0x104e: { n: "IFmtRecord", f: parse_IFmtRecord },
0x104f: { n: "Pos", f: parse_Pos },
0x1050: { n: "AlRuns", f: parse_AlRuns },
0x1051: { n: "BRAI", f: parse_BRAI },
0x105b: { n: "SerAuxErrBar", f: parse_SerAuxErrBar },
0x105c: { n: "ClrtClient", f: parse_ClrtClient },
0x105d: { n: "SerFmt", f: parse_SerFmt },
0x105f: { n: "Chart3DBarShape", f: parse_Chart3DBarShape },
0x1060: { n: "Fbi", f: parse_Fbi },
0x1061: { n: "BopPop", f: parse_BopPop },
0x1062: { n: "AxcExt", f: parse_AxcExt },
0x1063: { n: "Dat", f: parse_Dat },
0x1064: { n: "PlotGrowth", f: parse_PlotGrowth },
0x1065: { n: "SIIndex", f: parse_SIIndex },
0x1066: { n: "GelFrame", f: parse_GelFrame },
0x1067: { n: "BopPopCustom", f: parse_BopPopCustom },
0x1068: { n: "Fbi2", f: parse_Fbi2 }, /* These are specified in an older version of the spec */
0x0016: { n: "ExternCount", f: parsenoop },
0x007e: { n: "RK", f: parsenoop }, /* Not necessarily same as 0x027e */
0x007f: { n: "ImData", f: parsenoop },
0x0087: { n: "Addin", f: parsenoop },
0x0088: { n: "Edg", f: parsenoop },
0x0089: { n: "Pub", f: parsenoop },
0x0091: { n: "Sub", f: parsenoop },
0x0094: { n: "LHRecord", f: parsenoop },
0x0095: { n: "LHNGraph", f: parsenoop },
0x0096: { n: "Sound", f: parsenoop },
0x00a9: { n: "CoordList", f: parsenoop },
0x00ab: { n: "GCW", f: parsenoop },
0x00bc: { n: "ShrFmla", f: parsenoop }, /* Not necessarily same as 0x04bc */
0x00c2: { n: "AddMenu", f: parsenoop },
0x00c3: { n: "DelMenu", f: parsenoop },
0x00d6: { n: "RString", f: parsenoop },
0x00df: { n: "UDDesc", f: parsenoop },
0x00ea: { n: "TabIdConf", f: parsenoop },
0x0162: { n: "XL5Modify", f: parsenoop },
0x01a5: { n: "FileSharing2", f: parsenoop },
0x0218: { n: "Name", f: parsenoop },
0x0223: { n: "ExternName", f: parse_ExternName },
0x0231: { n: "Font", f: parsenoop },
0x0406: { n: "Formula", f: parse_Formula },
0x086d: { n: "FeatInfo", f: parsenoop },
0x0873: { n: "FeatInfo11", f: parsenoop },
0x0881: { n: "SXAddl12", f: parsenoop },
0x08c0: { n: "AutoWebPub", f: parsenoop },
0x08c1: { n: "ListObj", f: parsenoop },
0x08c2: { n: "ListField", f: parsenoop },
0x08c3: { n: "ListDV", f: parsenoop },
0x08c4: { n: "ListCondFmt", f: parsenoop },
0x08c5: { n: "ListCF", f: parsenoop },
0x08c6: { n: "FMQry", f: parsenoop },
0x08c7: { n: "FMSQry", f: parsenoop },
0x08c8: { n: "PLV", f: parsenoop }, /* supposedly PLV for Excel 11 */
0x08c9: { n: "LnExt", f: parsenoop },
0x08ca: { n: "MkrExt", f: parsenoop },
0x08cb: { n: "CrtCoopt", f: parsenoop }, 0x0000: {}
}; /* Helper function to call out to ODS parser */
function parse_ods(zip, opts) {
if (typeof module !== "undefined" && typeof require !== 'undefined' && typeof ODS === 'undefined') ODS = require('./od' + 's');
if (typeof ODS === 'undefined' || !ODS.parse_ods) throw new Error("Unsupported ODS");
return ODS.parse_ods(zip, opts);
}
function fix_opts_func(defaults) {
return function fix_opts(opts) {
for (var i = 0; i != defaults.length; ++i) {
var d = defaults[i];
if (opts[d[0]] === undefined) opts[d[0]] = d[1];
if (d[2] === 'n') opts[d[0]] = Number(opts[d[0]]);
}
};
} var fix_read_opts = fix_opts_func([
['cellNF', false], /* emit cell number format string as .z */
['cellHTML', true], /* emit html string as .h */
['cellFormula', true], /* emit formulae as .f */
['cellStyles', false], /* emits style/theme as .s */
['cellDates', false], /* emit date cells with type `d` */ ['sheetStubs', false], /* emit empty cells */
['sheetRows', 0, 'n'], /* read n rows (0 = read all rows) */ ['bookDeps', false], /* parse calculation chains */
['bookSheets', false], /* only try to get sheet names (no Sheets) */
['bookProps', false], /* only try to get properties (no Sheets) */
['bookFiles', false], /* include raw file structure (keys, files, cfb) */
['bookVBA', false], /* include vba raw data (vbaraw) */ ['password', ''], /* password */
['WTF', false] /* WTF mode (throws errors) */
]); var fix_write_opts = fix_opts_func([
['cellDates', false], /* write date cells with type `d` */ ['bookSST', false], /* Generate Shared String Table */ ['bookType', 'xlsx'], /* Type of workbook (xlsx/m/b) */ ['WTF', false] /* WTF mode (throws errors) */
]);
function safe_parse_wbrels(wbrels, sheets) {
if (!wbrels) return 0;
try {
wbrels = sheets.map(function pwbr(w) { return [w.name, wbrels['!id'][w.id].Target]; });
} catch (e) { return null; }
return !wbrels || wbrels.length === 0 ? null : wbrels;
} function safe_parse_ws(zip, path, relsPath, sheet, sheetRels, sheets, opts) {
try {
sheetRels[sheet] = parse_rels(getzipdata(zip, relsPath, true), path);
sheets[sheet] = parse_ws(getzipdata(zip, path), path, opts, sheetRels[sheet]);
} catch (e) { if (opts.WTF) throw e; }
} var nodirs = function nodirs(x) { return x.substr(-1) != '/'; };
function parse_zip(zip, opts) {
make_ssf(SSF);
opts = opts || {};
fix_read_opts(opts);
reset_cp(); /* OpenDocument Part 3 Section 2.2.1 OpenDocument Package */
if (safegetzipfile(zip, 'META-INF/manifest.xml')) return parse_ods(zip, opts); var entries = keys(zip.files).filter(nodirs).sort();
var dir = parse_ct(getzipdata(zip, '[Content_Types].xml'), opts);
var xlsb = false;
var sheets, binname;
if (dir.workbooks.length === 0) {
binname = "xl/workbook.xml";
if (getzipdata(zip, binname, true)) dir.workbooks.push(binname);
}
if (dir.workbooks.length === 0) {
binname = "xl/workbook.bin";
if (!getzipfile(zip, binname, true)) throw new Error("Could not find workbook");
dir.workbooks.push(binname);
xlsb = true;
}
if (dir.workbooks[0].substr(-3) == "bin") xlsb = true;
if (xlsb) set_cp(1200); if (!opts.bookSheets && !opts.bookProps) {
strs = [];
if (dir.sst) strs = parse_sst(getzipdata(zip, dir.sst.replace(/^\//, '')), dir.sst, opts); styles = {};
if (dir.style) styles = parse_sty(getzipdata(zip, dir.style.replace(/^\//, '')), dir.style, opts); themes = {};
if (opts.cellStyles && dir.themes.length) themes = parse_theme(getzipdata(zip, dir.themes[0].replace(/^\//, ''), true), dir.themes[0], opts);
} var wb = parse_wb(getzipdata(zip, dir.workbooks[0].replace(/^\//, '')), dir.workbooks[0], opts); var props = {}, propdata = ""; if (dir.coreprops.length !== 0) {
propdata = getzipdata(zip, dir.coreprops[0].replace(/^\//, ''), true);
if (propdata) props = parse_core_props(propdata);
if (dir.extprops.length !== 0) {
propdata = getzipdata(zip, dir.extprops[0].replace(/^\//, ''), true);
if (propdata) parse_ext_props(propdata, props);
}
} var custprops = {};
if (!opts.bookSheets || opts.bookProps) {
if (dir.custprops.length !== 0) {
propdata = getzipdata(zip, dir.custprops[0].replace(/^\//, ''), true);
if (propdata) custprops = parse_cust_props(propdata, opts);
}
} var out = {};
if (opts.bookSheets || opts.bookProps) {
if (props.Worksheets && props.SheetNames.length > 0) sheets = props.SheetNames;
else if (wb.Sheets) sheets = wb.Sheets.map(function pluck(x) { return x.name; });
if (opts.bookProps) { out.Props = props; out.Custprops = custprops; }
if (typeof sheets !== 'undefined') out.SheetNames = sheets;
if (opts.bookSheets ? out.SheetNames : opts.bookProps) return out;
}
sheets = {}; var deps = {};
if (opts.bookDeps && dir.calcchain) deps = parse_cc(getzipdata(zip, dir.calcchain.replace(/^\//, '')), dir.calcchain, opts); var i = 0;
var sheetRels = {};
var path, relsPath;
if (!props.Worksheets) {
var wbsheets = wb.Sheets;
props.Worksheets = wbsheets.length;
props.SheetNames = [];
for (var j = 0; j != wbsheets.length; ++j) {
props.SheetNames[j] = wbsheets[j].name;
}
} var wbext = xlsb ? "bin" : "xml";
var wbrelsfile = 'xl/_rels/workbook.' + wbext + '.rels';
var wbrels = parse_rels(getzipdata(zip, wbrelsfile, true), wbrelsfile);
if (wbrels) wbrels = safe_parse_wbrels(wbrels, wb.Sheets);
/* Numbers iOS hack */
var nmode = (getzipdata(zip, "xl/worksheets/sheet.xml", true)) ? 1 : 0;
for (i = 0; i != props.Worksheets; ++i) {
if (wbrels) path = 'xl/' + (wbrels[i][1]).replace(/[\/]?xl\//, "");
else {
path = 'xl/worksheets/sheet' + (i + 1 - nmode) + "." + wbext;
path = path.replace(/sheet0\./, "sheet.");
}
relsPath = path.replace(/^(.*)(\/)([^\/]*)$/, "$1/_rels/$3.rels");
safe_parse_ws(zip, path, relsPath, props.SheetNames[i], sheetRels, sheets, opts);
} if (dir.comments) parse_comments(zip, dir.comments, sheets, sheetRels, opts); out = {
Directory: dir,
Workbook: wb,
Props: props,
Custprops: custprops,
Deps: deps,
Sheets: sheets,
SheetNames: props.SheetNames,
Strings: strs,
Styles: styles,
Themes: themes,
SSF: SSF.get_table()
};
if (opts.bookFiles) {
out.keys = entries;
out.files = zip.files;
}
if (opts.bookVBA) {
if (dir.vba.length > 0) out.vbaraw = getzipdata(zip, dir.vba[0], true);
else if (dir.defaults.bin === 'application/vnd.ms-office.vbaProject') out.vbaraw = getzipdata(zip, 'xl/vbaProject.bin', true);
}
return out;
}
function add_rels(rels, rId, f, type, relobj) {
if (!relobj) relobj = {};
if (!rels['!id']) rels['!id'] = {};
relobj.Id = 'rId' + rId;
relobj.Type = type;
relobj.Target = f;
if (rels['!id'][relobj.Id]) throw new Error("Cannot rewrite rId " + rId);
rels['!id'][relobj.Id] = relobj;
rels[('/' + relobj.Target).replace("//", "/")] = relobj;
} function write_zip(wb, opts) {
if (wb && !wb.SSF) {
wb.SSF = SSF.get_table();
}
if (wb && wb.SSF) {
make_ssf(SSF); SSF.load_table(wb.SSF);
opts.revssf = evert_num(wb.SSF); opts.revssf[wb.SSF[65535]] = 0;
}
opts.rels = {}; opts.wbrels = {};
opts.Strings = []; opts.Strings.Count = 0; opts.Strings.Unique = 0;
var wbext = opts.bookType == "xlsb" ? "bin" : "xml";
var ct = {
workbooks: [], sheets: [], calcchains: [], themes: [], styles: [],
coreprops: [], extprops: [], custprops: [], strs: [], comments: [], vba: [],
TODO: [], rels: [], xmlns: ""
};
fix_write_opts(opts = opts || {});
var zip = new jszip();
var f = "", rId = 0; // 创建样式
opts.cellXfs = [{
numFmtId: 0,
fontId: 0,
fillId: 6,
borderId: 0,
xfId: 0
}, {
numFmtId: 0,
fontId: 6,
fillId: 6,
borderId: 5,
xfId: 0,
applyFont: true,
applyBorder: true,
applyFill: true,
alignment: {
wrapText: true,
textRotation: 0,
horizontal: "center",
vertical:"center",
indent:"0"
}
},{ // 标题样式
numFmtId: 0,
fontId:5,
fillId: 3,
borderId: 3,
xfId: 0,
applyFont: true,
applyBorder: true,
applyFill: true,
alignment: {
wrapText: true,
textRotation: 0,
horizontal: "center",
vertical:"center",
indent:"0"
}
},
{ // 内容样式
numFmtId: 0,
fontId: 6,
fillId: 0,
borderId: 3,
xfId: 0,
applyFont: true,
applyBorder: true,
applyFill: true,
alignment: {
wrapText: true,
textRotation: 0,
horizontal: "center",
vertical: "center",
indent: "0"
}
},
{//标题
numFmtId: 0,
fontId: 2,
fillId: 2,
borderId: 3,
xfId: 0,
applyFont: true,
applyBorder: true,
applyFill: true,
alignment: {
wrapText: true,
textRotation: 0,
horizontal: "center",
vertical: "center",
indent: "0"
}
}
];
//get_cell_style(opts.cellXfs, {}, { revssf: { "General":0 } }); f = "docProps/core.xml";
zip.file(f, write_core_props(wb.Props, opts));
ct.coreprops.push(f);
add_rels(opts.rels, 2, f, RELS.CORE_PROPS); f = "docProps/app.xml";
if (!wb.Props) wb.Props = {};
wb.Props.SheetNames = wb.SheetNames;
wb.Props.Worksheets = wb.SheetNames.length;
zip.file(f, write_ext_props(wb.Props, opts));
ct.extprops.push(f);
add_rels(opts.rels, 3, f, RELS.EXT_PROPS); if (wb.Custprops !== wb.Props && keys(wb.Custprops || {}).length > 0) {
f = "docProps/custom.xml";
zip.file(f, write_cust_props(wb.Custprops, opts));
ct.custprops.push(f);
add_rels(opts.rels, 4, f, RELS.CUST_PROPS);
} f = "xl/workbook." + wbext;
zip.file(f, write_wb(wb, f, opts));
ct.workbooks.push(f);
add_rels(opts.rels, 1, f, RELS.WB); for (rId = 1; rId <= wb.SheetNames.length; ++rId) {
f = "xl/worksheets/sheet" + rId + "." + wbext;
zip.file(f, write_ws(rId - 1, f, opts, wb));
ct.sheets.push(f);
add_rels(opts.wbrels, rId, "worksheets/sheet" + rId + "." + wbext, RELS.WS);
} if (opts.Strings != null && opts.Strings.length > 0) {
f = "xl/sharedStrings." + wbext;
zip.file(f, write_sst(opts.Strings, f, opts));
ct.strs.push(f);
add_rels(opts.wbrels, ++rId, "sharedStrings." + wbext, RELS.SST);
} /* TODO: something more intelligent with themes */ f = "xl/theme/theme1.xml";
zip.file(f, write_theme());
ct.themes.push(f);
add_rels(opts.wbrels, ++rId, "theme/theme1.xml", RELS.THEME); /* TODO: something more intelligent with styles */ f = "xl/styles." + wbext;
zip.file(f, write_sty(wb, f, opts));
ct.styles.push(f);
add_rels(opts.wbrels, ++rId, "styles." + wbext, RELS.STY); zip.file("[Content_Types].xml", write_ct(ct, opts));
zip.file('_rels/.rels', write_rels(opts.rels));
zip.file('xl/_rels/workbook.' + wbext + '.rels', write_rels(opts.wbrels));
return zip;
}
function firstbyte(f, o) {
switch ((o || {}).type || "base64") {
case 'buffer': return f[0];
case 'base64': return Base64.decode(f.substr(0, 12)).charCodeAt(0);
case 'binary': return f.charCodeAt(0);
case 'array': return f[0];
default: throw new Error("Unrecognized type " + o.type);
}
} function read_zip(data, opts) {
var zip, d = data;
var o = opts || {};
if (!o.type) o.type = (has_buf && Buffer.isBuffer(data)) ? "buffer" : "base64";
switch (o.type) {
case "base64": zip = new jszip(d, { base64: true }); break;
case "binary": case "array": zip = new jszip(d, { base64: false }); break;
case "buffer": zip = new jszip(d); break;
case "file": zip = new jszip(d = _fs.readFileSync(data)); break;
default: throw new Error("Unrecognized type " + o.type);
}
return parse_zip(zip, o);
} function readSync(data, opts) {
var zip, d = data, isfile = false, n;
var o = opts || {};
if (!o.type) o.type = (has_buf && Buffer.isBuffer(data)) ? "buffer" : "base64";
if (o.type == "file") { isfile = true; o.type = "buffer"; d = _fs.readFileSync(data); }
switch ((n = firstbyte(d, o))) {
case 0xD0:
if (isfile) o.type = "file";
return parse_xlscfb(CFB.read(data, o), o);
case 0x09: return parse_xlscfb(s2a(o.type === 'base64' ? Base64.decode(data) : data), o);
case 0x3C: return parse_xlml(d, o);
case 0x50:
if (isfile) o.type = "file";
return read_zip(data, opts);
default: throw new Error("Unsupported file " + n);
}
} function readFileSync(data, opts) {
var o = opts || {}; o.type = 'file';
return readSync(data, o);
}
function write_zip_type(wb, opts) {
var o = opts || {};
var z = write_zip(wb, o);
switch (o.type) {
case "base64":
return z.generate({ type: "base64" });
case "binary":
return z.generate({ type: "string" });
case "buffer":
return z.generate({ type: "nodebuffer" });
case "file": return _fs.writeFileSync(o.file, z.generate({ type: "nodebuffer" }));
default: throw new Error("Unrecognized type " + o.type);
}
} function writeSync(wb, opts) {
var o = opts || {};
switch (o.bookType) {
case 'xml': return write_xlml(wb, o);
default: return write_zip_type(wb, o);
}
} function writeFileSync(wb, filename, opts) {
var o = opts || {}; o.type = 'file';
o.file = filename;
switch (o.file.substr(-5).toLowerCase()) {
case '.xlsx': o.bookType = 'xlsx'; break;
case '.xlsm': o.bookType = 'xlsm'; break;
case '.xlsb': o.bookType = 'xlsb'; break;
default: switch (o.file.substr(-4).toLowerCase()) {
case '.xls': o.bookType = 'xls'; break;
case '.xml': o.bookType = 'xml'; break;
}
}
return writeSync(wb, o);
} function decode_row(rowstr) { return parseInt(unfix_row(rowstr), 10) - 1; }
function encode_row(row) { return "" + (row + 1); }
function fix_row(cstr) { return cstr.replace(/([A-Z]|^)(\d+)$/, "$1$$$2"); }
function unfix_row(cstr) { return cstr.replace(/\$(\d+)$/, "$1"); } function decode_col(colstr) { var c = unfix_col(colstr), d = 0, i = 0; for (; i !== c.length; ++i) d = 26 * d + c.charCodeAt(i) - 64; return d - 1; }
function encode_col(col) { var s = ""; for (++col; col; col = Math.floor((col - 1) / 26)) s = String.fromCharCode(((col - 1) % 26) + 65) + s; return s; }
function fix_col(cstr) { return cstr.replace(/^([A-Z])/, "$$$1"); }
function unfix_col(cstr) { return cstr.replace(/^\$([A-Z])/, "$1"); } function split_cell(cstr) { return cstr.replace(/(\$?[A-Z]*)(\$?\d*)/, "$1,$2").split(","); }
function decode_cell(cstr) { var splt = split_cell(cstr); return { c: decode_col(splt[0]), r: decode_row(splt[1]) }; }
function encode_cell(cell) { return encode_col(cell.c) + encode_row(cell.r); }
function fix_cell(cstr) { return fix_col(fix_row(cstr)); }
function unfix_cell(cstr) { return unfix_col(unfix_row(cstr)); }
function decode_range(range) { var x = range.split(":").map(decode_cell); return { s: x[0], e: x[x.length - 1] }; }
function encode_range(cs, ce) {
if (ce === undefined || typeof ce === 'number') return encode_range(cs.s, cs.e);
if (typeof cs !== 'string') cs = encode_cell(cs); if (typeof ce !== 'string') ce = encode_cell(ce);
return cs == ce ? cs : cs + ":" + ce;
} function safe_decode_range(range) {
var o = { s: { c: 0, r: 0 }, e: { c: 0, r: 0 } };
var idx = 0, i = 0, cc = 0;
var len = range.length;
for (idx = 0; i < len; ++i) {
if ((cc = range.charCodeAt(i) - 64) < 1 || cc > 26) break;
idx = 26 * idx + cc;
}
o.s.c = --idx; for (idx = 0; i < len; ++i) {
if ((cc = range.charCodeAt(i) - 48) < 0 || cc > 9) break;
idx = 10 * idx + cc;
}
o.s.r = --idx; if (i === len || range.charCodeAt(++i) === 58) { o.e.c = o.s.c; o.e.r = o.s.r; return o; } for (idx = 0; i != len; ++i) {
if ((cc = range.charCodeAt(i) - 64) < 1 || cc > 26) break;
idx = 26 * idx + cc;
}
o.e.c = --idx; for (idx = 0; i != len; ++i) {
if ((cc = range.charCodeAt(i) - 48) < 0 || cc > 9) break;
idx = 10 * idx + cc;
}
o.e.r = --idx;
return o;
} function safe_format_cell(cell, v) {
if (cell.z !== undefined) try { return (cell.w = SSF.format(cell.z, v)); } catch (e) { }
if (!cell.XF) return v;
try { return (cell.w = SSF.format(cell.XF.ifmt || 0, v)); } catch (e) { return '' + v; }
} function format_cell(cell, v) {
if (cell == null || cell.t == null) return "";
if (cell.w !== undefined) return cell.w;
if (v === undefined) return safe_format_cell(cell, cell.v);
return safe_format_cell(cell, v);
} function sheet_to_json(sheet, opts) {
var val, row, range, header = 0, offset = 1, r, hdr = [], isempty, R, C, v;
var o = opts != null ? opts : {};
var raw = o.raw;
if (sheet == null || sheet["!ref"] == null) return [];
range = o.range !== undefined ? o.range : sheet["!ref"];
if (o.header === 1) header = 1;
else if (o.header === "A") header = 2;
else if (Array.isArray(o.header)) header = 3;
switch (typeof range) {
case 'string': r = safe_decode_range(range); break;
case 'number': r = safe_decode_range(sheet["!ref"]); r.s.r = range; break;
default: r = range;
}
if (header > 0) offset = 0;
var rr = encode_row(r.s.r);
var cols = new Array(r.e.c - r.s.c + 1);
var out = new Array(r.e.r - r.s.r - offset + 1);
var outi = 0;
for (C = r.s.c; C <= r.e.c; ++C) {
cols[C] = encode_col(C);
val = sheet[cols[C] + rr];
switch (header) {
case 1: hdr[C] = C; break;
case 2: hdr[C] = cols[C]; break;
case 3: hdr[C] = o.header[C - r.s.c]; break;
default:
if (val === undefined) continue;
hdr[C] = format_cell(val);
}
} for (R = r.s.r + offset; R <= r.e.r; ++R) {
rr = encode_row(R);
isempty = true;
if (header === 1) row = [];
else {
row = {};
if (Object.defineProperty) Object.defineProperty(row, '__rowNum__', { value: R, enumerable: false });
else row.__rowNum__ = R;
}
for (C = r.s.c; C <= r.e.c; ++C) {
val = sheet[cols[C] + rr];
if (val === undefined || val.t === undefined) continue;
v = val.v;
switch (val.t) {
case 'e': continue;
case 's': break;
case 'b': case 'n': break;
default: throw 'unrecognized type ' + val.t;
}
if (v !== undefined) {
row[hdr[C]] = raw ? v : format_cell(val, v);
isempty = false;
}
}
if (isempty === false || header === 1) out[outi++] = row;
}
out.length = outi;
return out;
} function sheet_to_row_object_array(sheet, opts) { return sheet_to_json(sheet, opts != null ? opts : {}); } function sheet_to_csv(sheet, opts) {
var out = "", txt = "", qreg = /"/g;
var o = opts == null ? {} : opts;
if (sheet == null || sheet["!ref"] == null) return "";
var r = safe_decode_range(sheet["!ref"]);
var FS = o.FS !== undefined ? o.FS : ",", fs = FS.charCodeAt(0);
var RS = o.RS !== undefined ? o.RS : "\n", rs = RS.charCodeAt(0);
var row = "", rr = "", cols = [];
var i = 0, cc = 0, val;
var R = 0, C = 0;
for (C = r.s.c; C <= r.e.c; ++C) cols[C] = encode_col(C);
for (R = r.s.r; R <= r.e.r; ++R) {
row = "";
rr = encode_row(R);
for (C = r.s.c; C <= r.e.c; ++C) {
val = sheet[cols[C] + rr];
txt = val !== undefined ? '' + format_cell(val) : "";
for (i = 0, cc = 0; i !== txt.length; ++i) if ((cc = txt.charCodeAt(i)) === fs || cc === rs || cc === 34) {
txt = "\"" + txt.replace(qreg, '""') + "\""; break;
}
row += (C === r.s.c ? "" : FS) + txt;
}
out += row + RS;
}
return out;
}
var make_csv = sheet_to_csv; function sheet_to_formulae(sheet) {
var cmds, y = "", x, val = "";
if (sheet == null || sheet["!ref"] == null) return "";
var r = safe_decode_range(sheet['!ref']), rr = "", cols = [], C;
cmds = new Array((r.e.r - r.s.r + 1) * (r.e.c - r.s.c + 1));
var i = 0;
for (C = r.s.c; C <= r.e.c; ++C) cols[C] = encode_col(C);
for (var R = r.s.r; R <= r.e.r; ++R) {
rr = encode_row(R);
for (C = r.s.c; C <= r.e.c; ++C) {
y = cols[C] + rr;
x = sheet[y];
val = "";
if (x === undefined) continue;
if (x.f != null) val = x.f;
else if (x.w !== undefined) val = "'" + x.w;
else if (x.v === undefined) continue;
else val = "" + x.v;
cmds[i++] = y + "=" + val;
}
}
cmds.length = i;
return cmds;
} var utils = {
encode_col: encode_col,
encode_row: encode_row,
encode_cell: encode_cell,
encode_range: encode_range,
decode_col: decode_col,
decode_row: decode_row,
split_cell: split_cell,
decode_cell: decode_cell,
decode_range: decode_range,
format_cell: format_cell,
get_formulae: sheet_to_formulae,
make_csv: sheet_to_csv,
make_json: sheet_to_json,
make_formulae: sheet_to_formulae,
sheet_to_csv: sheet_to_csv,
sheet_to_json: sheet_to_json,
sheet_to_formulae: sheet_to_formulae,
sheet_to_row_object_array: sheet_to_row_object_array
};
XLSX.parse_xlscfb = parse_xlscfb;
XLSX.parse_zip = parse_zip;
XLSX.read = readSync; //xlsread
XLSX.readFile = readFileSync; //readFile
XLSX.readFileSync = readFileSync;
XLSX.write = writeSync;
XLSX.writeFile = writeFileSync;
XLSX.writeFileSync = writeFileSync;
XLSX.utils = utils;
XLSX.CFB = CFB;
XLSX.SSF = SSF;
})(typeof exports !== 'undefined' ? exports : XLSX);
var XLS = XLSX;
引入jq，引入之前的js
用法
<script src="../../Script/tableToExcel/table2excel.js"></script>
<script src="../../Script/tableToExcel/FileSaver.min.js"></script>
<script src="../../Script/tableToExcel/tableexport.js"></script>
<script src="../../Script/tableToExcel/jszip.js"></script>
<script src="../../Script/tableToExcel/xlsx.js"></script> //导出excel
var gridExport = function () {
$("#grid").tableExport({
title: "团体客流",
fileName: "团体客流",
islageruigrid: false
});
table2excel使用的更多相关文章
- jquery.table2excel，将HTML的table标签数据导出成excel
<!DOCTYPE> <html> <head> <meta http-equiv="Content-Type" content=&quo ...
- 报表生成(POI,jquery.table2excel.js，Echarts)
最近公司要弄个报表相关的功能,话不多说,先上图 前一种是POI 生成的,后一种是Echarts生成的.报表我想大家都不陌生,基本上在公司业务中都会使用到.先说说POI,jquery.table2exc ...
- js操作table表格导出数据到excel方法
js导出excel资料很少,网上也找了很多,基本都不能用,要么只能是IE用,还必须要权限,这是非常不好的.后来到github上找到table2excel.js,虽然可以用,但仍然对IE支持不够,也算不 ...
- 非常简单的数据，支持excel表格下载功能
<%@ page language="java" import="java.util.*" pageEncoding="utf-8"% ...
- 将HTML表格导出到EXCEL，兼容Firefox，支持中文
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/ ...
- table导出到excel的两种方法
1. 用table2excel 的js文件,这种方法没有IE兼容性 需要在文件中导入 <script type="text/javascript" src="< ...
- js excel 列表导出
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/ ...
- jquery 导出Excel表格
仅在 table 中应用过!适用于导出简单的excel <script type="text/javascript" src="jquery.table2excel ...
- 将html table 转成 excel
package com.sun.office.excel; /** * 跨行元素元数据 * */ public class CrossRangeCellMeta { public CrossRange ...
随机推荐
- Java中volatile关键字解析
一.内存模型的相关概念 大家都知道,计算机在执行程序时,每条指令都是在CPU中执行的,而执行指令过程中,势必涉及到数据的读取和写入.由于程序运行过程中的临时数据是存放在主存(物理内存)当中的,这时就存 ...
- 环境部署（四）：Linux下查看JDK安装路径
在安装好Git.JDK和jenkins之后,就需要在jenkins中进行对应的设置,比如在全局工具配置模块,需要写入JDK的安装路径. 这篇博客,介绍几种常见的在Linux中查看JDK路径的方法... ...
- Java关键字(四)——final
对于Java中的 final 关键字,我们首先可以从字面意思上去理解,百度翻译显示如下: 也就是说 final 英文意思表示是最后的,不可更改的.那么对应在 Java 中也是表达这样的意思,可以用 f ...
- vue2.0之axios使用详解
axios 基于 Promise 的 HTTP 请求客户端,可同时在浏览器和 node.js 中使用 功能特性 在浏览器中发送 XMLHttpRequests 请求 在 node.js 中发送 htt ...
- hdu 2063 给男女匹配 (匈牙利算法）
来源:http://acm.hdu.edu.cn/showproblem.php?pid=2063 题意: 有k个组合a,b组合,代表a愿意与b坐过山车,共m个女生 n个男生,问有多少个满意的匹配 题 ...
- UITableView加载数据，没有数据，没有网络界面处理
https://blog.csdn.net/chmod_r_755/article/details/53231461 俗话说的好,傻逼的APP都是相似的,牛逼的APP各有各的牛逼...但是UITabl ...
- DOM节点左右移动
闲来没事写了个小demo,原本是回答别人博问的,有人比我更快的给出了链接,想想半途而废也不好,就写完了,写个博文记录一下(效果是按照我自己来的,可能和最早别人问的不太一样,反正无关紧要啦) 直接上co ...
- Linux 典型应用之Mysql
Mysql 的安装及连接 删除默认安装的 mariadb数据库 yum remove mariadb-libs.x86_64 mysql源下载的网址 https://dev.mysql.com/dow ...
- Jeecg-Boot Spring Boot
Jeecg-Boot 1.0 发布,企业级快速开发平台 - 开源中国https://www.oschina.net/news/104889/jeecg-boot-1-0-released
- asp.net mvc Dateset读取Excel数据
//处理Excel //读取Excel [NonAction] public static DataSet ExcelToDS(string Path) { //根据情况选择合适的连接字符,参考msd ...