/* Minification failed. Returning unminified contents. (1306,30-31): run-time error JS1300: Strict-mode does not allow assignment to undefined variables: i (1306,63-64): run-time error JS1294: Strict-mode does not allow ++ or -- on certain objects: i */ /** @preserve * jsPDF - PDF Document creation from JavaScript * Version ${versionID} * CommitID ${commitID} * * Copyright (c) 2010-2014 James Hall , https://github.com/MrRio/jsPDF * 2010 Aaron Spike, https://github.com/acspike * 2012 Willow Systems Corporation, willow-systems.com * 2012 Pablo Hess, https://github.com/pablohess * 2012 Florian Jenett, https://github.com/fjenett * 2013 Warren Weckesser, https://github.com/warrenweckesser * 2013 Youssef Beddad, https://github.com/lifof * 2013 Lee Driscoll, https://github.com/lsdriscoll * 2013 Stefan Slonevskiy, https://github.com/stefslon * 2013 Jeremy Morel, https://github.com/jmorel * 2013 Christoph Hartmann, https://github.com/chris-rock * 2014 Juan Pablo Gaviria, https://github.com/juanpgaviria * 2014 James Makes, https://github.com/dollaruw * 2014 Diego Casorran, https://github.com/diegocr * 2014 Steven Spungin, https://github.com/Flamenco * 2014 Kenneth Glassey, https://github.com/Gavvers * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * * Contributor(s): * siefkenj, ahwolf, rickygu, Midnith, saintclair, eaparango, * kim3er, mfo, alnorth, Flamenco */ /** * Creates new jsPDF document object instance. * * @class * @param orientation One of "portrait" or "landscape" (or shortcuts "p" (Default), "l") * @param unit Measurement unit to be used when coordinates are specified. * One of "pt" (points), "mm" (Default), "cm", "in" * @param format One of 'pageFormats' as shown below, default: a4 * @returns {jsPDF} * @name jsPDF */ var jsPDF = (function (global) { 'use strict'; var pdfVersion = '1.3', pageFormats = { // Size in pt of various paper formats 'a0': [2383.94, 3370.39], 'a1': [1683.78, 2383.94], 'a2': [1190.55, 1683.78], 'a3': [841.89, 1190.55], 'a4': [595.28, 841.89], 'a5': [419.53, 595.28], 'a6': [297.64, 419.53], 'a7': [209.76, 297.64], 'a8': [147.40, 209.76], 'a9': [104.88, 147.40], 'a10': [73.70, 104.88], 'b0': [2834.65, 4008.19], 'b1': [2004.09, 2834.65], 'b2': [1417.32, 2004.09], 'b3': [1000.63, 1417.32], 'b4': [708.66, 1000.63], 'b5': [498.90, 708.66], 'b6': [354.33, 498.90], 'b7': [249.45, 354.33], 'b8': [175.75, 249.45], 'b9': [124.72, 175.75], 'b10': [87.87, 124.72], 'c0': [2599.37, 3676.54], 'c1': [1836.85, 2599.37], 'c2': [1298.27, 1836.85], 'c3': [918.43, 1298.27], 'c4': [649.13, 918.43], 'c5': [459.21, 649.13], 'c6': [323.15, 459.21], 'c7': [229.61, 323.15], 'c8': [161.57, 229.61], 'c9': [113.39, 161.57], 'c10': [79.37, 113.39], 'dl': [311.81, 623.62], 'letter': [612, 792], 'government-letter': [576, 756], 'legal': [612, 1008], 'junior-legal': [576, 360], 'ledger': [1224, 792], 'tabloid': [792, 1224], 'credit-card': [153, 243] }; /** * jsPDF's Internal PubSub Implementation. * See mrrio.github.io/jsPDF/doc/symbols/PubSub.html * Backward compatible rewritten on 2014 by * Diego Casorran, https://github.com/diegocr * * @class * @name PubSub */ function PubSub(context) { var topics = {}; this.subscribe = function (topic, callback, once) { if (typeof callback !== 'function') { return false; } if (!topics.hasOwnProperty(topic)) { topics[topic] = {}; } var id = Math.random().toString(35); topics[topic][id] = [callback, !!once]; return id; }; this.unsubscribe = function (token) { for (var topic in topics) { if (topics[topic][token]) { delete topics[topic][token]; return true; } } return false; }; this.publish = function (topic) { if (topics.hasOwnProperty(topic)) { var args = Array.prototype.slice.call(arguments, 1), idr = []; for (var id in topics[topic]) { var sub = topics[topic][id]; try { sub[0].apply(context, args); } catch (ex) { if (global.console) { console.error('jsPDF PubSub Error', ex.message, ex); } } if (sub[1]) idr.push(id); } if (idr.length) idr.forEach(this.unsubscribe); } }; } /** * @constructor * @private */ function jsPDF(orientation, unit, format, compressPdf) { var options = {}; if (typeof orientation === 'object') { options = orientation; orientation = options.orientation; unit = options.unit || unit; format = options.format || format; compressPdf = options.compress || options.compressPdf || compressPdf; } // Default options unit = unit || 'mm'; format = format || 'a4'; orientation = ('' + (orientation || 'P')).toLowerCase(); var format_as_string = ('' + format).toLowerCase(), compress = !!compressPdf && typeof Uint8Array === 'function', textColor = options.textColor || '0 g', drawColor = options.drawColor || '0 G', activeFontSize = options.fontSize || 16, lineHeightProportion = options.lineHeight || 1.15, lineWidth = options.lineWidth || 0.200025, // 2mm objectNumber = 2, // 'n' Current object number outToPages = !1, // switches where out() prints. outToPages true = push to pages obj. outToPages false = doc builder content offsets = [], // List of offsets. Activated and reset by buildDocument(). Pupulated by various calls buildDocument makes. fonts = {}, // collection of font objects, where key is fontKey - a dynamically created label for a given font. fontmap = {}, // mapping structure fontName > fontStyle > font key - performance layer. See addFont() activeFontKey, // will be string representing the KEY of the font as combination of fontName + fontStyle k, // Scale factor tmp, page = 0, currentPage, pages = [], pagesContext = [], // same index as pages and pagedim pagedim = [], content = [], additionalObjects = [], lineCapID = 0, lineJoinID = 0, content_length = 0, pageWidth, pageHeight, pageMode, zoomMode, layoutMode, documentProperties = { 'title': '', 'subject': '', 'author': '', 'keywords': '', 'creator': '' }, API = {}, events = new PubSub(API), ///////////////////// // Private functions ///////////////////// f2 = function (number) { return number.toFixed(2); // Ie, %.2f }, f3 = function (number) { return number.toFixed(3); // Ie, %.3f }, padd2 = function (number) { return ('0' + parseInt(number)).slice(-2); }, out = function (string) { if (outToPages) { /* set by beginPage */ pages[currentPage].push(string); } else { // +1 for '\n' that will be used to join 'content' content_length += string.length + 1; content.push(string); } }, newObject = function () { // Begin a new object objectNumber++; offsets[objectNumber] = content_length; out(objectNumber + ' 0 obj'); return objectNumber; }, // Does not output the object until after the pages have been output. // Returns an object containing the objectId and content. // All pages have been added so the object ID can be estimated to start right after. // This does not modify the current objectNumber; It must be updated after the newObjects are output. newAdditionalObject = function () { var objId = pages.length * 2 + 1; objId += additionalObjects.length; var obj = {objId: objId, content: ''}; additionalObjects.push(obj); return obj; }, // Does not output the object. The caller must call newObjectDeferredBegin(oid) before outputing any data newObjectDeferred = function () { objectNumber++; offsets[objectNumber] = function () { return content_length; }; return objectNumber; }, newObjectDeferredBegin = function (oid) { offsets[oid] = content_length; }, putStream = function (str) { out('stream'); out(str); out('endstream'); }, putPages = function () { var n, p, arr, i, deflater, adler32, adler32cs, wPt, hPt; adler32cs = global.adler32cs || jsPDF.adler32cs; if (compress && typeof adler32cs === 'undefined') { compress = false; } // outToPages = false as set in endDocument(). out() writes to content. for (n = 1; n <= page; n++) { newObject(); wPt = (pageWidth = pagedim[n].width) * k; hPt = (pageHeight = pagedim[n].height) * k; out('<>'); out('endobj'); // Page content p = pages[n].join('\n'); newObject(); if (compress) { arr = []; i = p.length; while (i--) { arr[i] = p.charCodeAt(i); } adler32 = adler32cs.from(p); deflater = new Deflater(6); deflater.append(new Uint8Array(arr)); p = deflater.flush(); arr = new Uint8Array(p.length + 6); arr.set(new Uint8Array([120, 156])), arr.set(p, 2); arr.set(new Uint8Array([adler32 & 0xFF, (adler32 >> 8) & 0xFF, (adler32 >> 16) & 0xFF, (adler32 >> 24) & 0xFF]), p.length + 2); p = String.fromCharCode.apply(null, arr); out('<>'); } else { out('<>'); } putStream(p); out('endobj'); } offsets[1] = content_length; out('1 0 obj'); out('<>'); out('endobj'); events.publish('postPutPages'); }, putFont = function (font) { font.objectNumber = newObject(); out('<>'); out('endobj'); }, putFonts = function () { for (var fontKey in fonts) { if (fonts.hasOwnProperty(fontKey)) { putFont(fonts[fontKey]); } } }, putXobjectDict = function () { // Loop through images, or other data objects events.publish('putXobjectDict'); }, putResourceDictionary = function () { out('/ProcSet [/PDF /Text /ImageB /ImageC /ImageI]'); out('/Font <<'); // Do this for each font, the '1' bit is the index of the font for (var fontKey in fonts) { if (fonts.hasOwnProperty(fontKey)) { out('/' + fontKey + ' ' + fonts[fontKey].objectNumber + ' 0 R'); } } out('>>'); out('/XObject <<'); putXobjectDict(); out('>>'); }, putResources = function () { putFonts(); events.publish('putResources'); // Resource dictionary offsets[2] = content_length; out('2 0 obj'); out('<<'); putResourceDictionary(); out('>>'); out('endobj'); events.publish('postPutResources'); }, putAdditionalObjects = function () { events.publish('putAdditionalObjects'); for (var i = 0; i < additionalObjects.length; i++) { var obj = additionalObjects[i]; offsets[obj.objId] = content_length; out(obj.objId + ' 0 obj'); out(obj.content); ; out('endobj'); } objectNumber += additionalObjects.length; events.publish('postPutAdditionalObjects'); }, addToFontDictionary = function (fontKey, fontName, fontStyle) { // this is mapping structure for quick font key lookup. // returns the KEY of the font (ex: "F1") for a given // pair of font name and type (ex: "Arial". "Italic") if (!fontmap.hasOwnProperty(fontName)) { fontmap[fontName] = {}; } fontmap[fontName][fontStyle] = fontKey; }, /** * FontObject describes a particular font as member of an instnace of jsPDF * * It's a collection of properties like 'id' (to be used in PDF stream), * 'fontName' (font's family name), 'fontStyle' (font's style variant label) * * @class * @public * @property id {String} PDF-document-instance-specific label assinged to the font. * @property PostScriptName {String} PDF specification full name for the font * @property encoding {Object} Encoding_name-to-Font_metrics_object mapping. * @name FontObject */ addFont = function (PostScriptName, fontName, fontStyle, encoding) { var fontKey = 'F' + (Object.keys(fonts).length + 1).toString(10), // This is FontObject font = fonts[fontKey] = { 'id': fontKey, 'PostScriptName': PostScriptName, 'fontName': fontName, 'fontStyle': fontStyle, 'encoding': encoding, 'metadata': {} }; addToFontDictionary(fontKey, fontName, fontStyle); events.publish('addFont', font); return fontKey; }, addFonts = function () { var HELVETICA = "helvetica", TIMES = "times", COURIER = "courier", NORMAL = "normal", BOLD = "bold", ITALIC = "italic", BOLD_ITALIC = "bolditalic", encoding = 'StandardEncoding', ZAPF = "zapfdingbats", standardFonts = [ ['Helvetica', HELVETICA, NORMAL], ['Helvetica-Bold', HELVETICA, BOLD], ['Helvetica-Oblique', HELVETICA, ITALIC], ['Helvetica-BoldOblique', HELVETICA, BOLD_ITALIC], ['Courier', COURIER, NORMAL], ['Courier-Bold', COURIER, BOLD], ['Courier-Oblique', COURIER, ITALIC], ['Courier-BoldOblique', COURIER, BOLD_ITALIC], ['Times-Roman', TIMES, NORMAL], ['Times-Bold', TIMES, BOLD], ['Times-Italic', TIMES, ITALIC], ['Times-BoldItalic', TIMES, BOLD_ITALIC], ['ZapfDingbats',ZAPF ] ]; for (var i = 0, l = standardFonts.length; i < l; i++) { var fontKey = addFont( standardFonts[i][0], standardFonts[i][1], standardFonts[i][2], encoding); // adding aliases for standard fonts, this time matching the capitalization var parts = standardFonts[i][0].split('-'); addToFontDictionary(fontKey, parts[0], parts[1] || ''); } events.publish('addFonts', {fonts: fonts, dictionary: fontmap}); }, SAFE = function __safeCall(fn) { fn.foo = function __safeCallWrapper() { try { return fn.apply(this, arguments); } catch (e) { var stack = e.stack || ''; if (~stack.indexOf(' at ')) stack = stack.split(" at ")[1]; var m = "Error in function " + stack.split("\n")[0].split('<')[0] + ": " + e.message; if (global.console) { global.console.error(m, e); if (global.alert) alert(m); } else { throw new Error(m); } } }; fn.foo.bar = fn; return fn.foo; }, to8bitStream = function (text, flags) { /** * PDF 1.3 spec: * "For text strings encoded in Unicode, the first two bytes must be 254 followed by * 255, representing the Unicode byte order marker, U+FEFF. (This sequence conflicts * with the PDFDocEncoding character sequence thorn ydieresis, which is unlikely * to be a meaningful beginning of a word or phrase.) The remainder of the * string consists of Unicode character codes, according to the UTF-16 encoding * specified in the Unicode standard, version 2.0. Commonly used Unicode values * are represented as 2 bytes per character, with the high-order byte appearing first * in the string." * * In other words, if there are chars in a string with char code above 255, we * recode the string to UCS2 BE - string doubles in length and BOM is prepended. * * HOWEVER! * Actual *content* (body) text (as opposed to strings used in document properties etc) * does NOT expect BOM. There, it is treated as a literal GID (Glyph ID) * * Because of Adobe's focus on "you subset your fonts!" you are not supposed to have * a font that maps directly Unicode (UCS2 / UTF16BE) code to font GID, but you could * fudge it with "Identity-H" encoding and custom CIDtoGID map that mimics Unicode * code page. There, however, all characters in the stream are treated as GIDs, * including BOM, which is the reason we need to skip BOM in content text (i.e. that * that is tied to a font). * * To signal this "special" PDFEscape / to8bitStream handling mode, * API.text() function sets (unless you overwrite it with manual values * given to API.text(.., flags) ) * flags.autoencode = true * flags.noBOM = true * * =================================================================================== * `flags` properties relied upon: * .sourceEncoding = string with encoding label. * "Unicode" by default. = encoding of the incoming text. * pass some non-existing encoding name * (ex: 'Do not touch my strings! I know what I am doing.') * to make encoding code skip the encoding step. * .outputEncoding = Either valid PDF encoding name * (must be supported by jsPDF font metrics, otherwise no encoding) * or a JS object, where key = sourceCharCode, value = outputCharCode * missing keys will be treated as: sourceCharCode === outputCharCode * .noBOM * See comment higher above for explanation for why this is important * .autoencode * See comment higher above for explanation for why this is important */ var i, l, sourceEncoding, encodingBlock, outputEncoding, newtext, isUnicode, ch, bch; flags = flags || {}; sourceEncoding = flags.sourceEncoding || 'Unicode'; outputEncoding = flags.outputEncoding; // This 'encoding' section relies on font metrics format // attached to font objects by, among others, // "Willow Systems' standard_font_metrics plugin" // see jspdf.plugin.standard_font_metrics.js for format // of the font.metadata.encoding Object. // It should be something like // .encoding = {'codePages':['WinANSI....'], 'WinANSI...':{code:code, ...}} // .widths = {0:width, code:width, ..., 'fof':divisor} // .kerning = {code:{previous_char_code:shift, ..., 'fof':-divisor},...} if ((flags.autoencode || outputEncoding) && fonts[activeFontKey].metadata && fonts[activeFontKey].metadata[sourceEncoding] && fonts[activeFontKey].metadata[sourceEncoding].encoding) { encodingBlock = fonts[activeFontKey].metadata[sourceEncoding].encoding; // each font has default encoding. Some have it clearly defined. if (!outputEncoding && fonts[activeFontKey].encoding) { outputEncoding = fonts[activeFontKey].encoding; } // Hmmm, the above did not work? Let's try again, in different place. if (!outputEncoding && encodingBlock.codePages) { outputEncoding = encodingBlock.codePages[0]; // let's say, first one is the default } if (typeof outputEncoding === 'string') { outputEncoding = encodingBlock[outputEncoding]; } // we want output encoding to be a JS Object, where // key = sourceEncoding's character code and // value = outputEncoding's character code. if (outputEncoding) { isUnicode = false; newtext = []; for (i = 0, l = text.length; i < l; i++) { ch = outputEncoding[text.charCodeAt(i)]; if (ch) { newtext.push( String.fromCharCode(ch)); } else { newtext.push( text[i]); } // since we are looping over chars anyway, might as well // check for residual unicodeness if (newtext[i].charCodeAt(0) >> 8) { /* more than 255 */ isUnicode = true; } } text = newtext.join(''); } } i = text.length; // isUnicode may be set to false above. Hence the triple-equal to undefined while (isUnicode === undefined && i !== 0) { if (text.charCodeAt(i - 1) >> 8) { /* more than 255 */ isUnicode = true; } i--; } if (!isUnicode) { return text; } newtext = flags.noBOM ? [] : [254, 255]; for (i = 0, l = text.length; i < l; i++) { ch = text.charCodeAt(i); bch = ch >> 8; // divide by 256 if (bch >> 8) { /* something left after dividing by 256 second time */ throw new Error("Character at position " + i + " of string '" + text + "' exceeds 16bits. Cannot be encoded into UCS-2 BE"); } newtext.push(bch); newtext.push(ch - (bch << 8)); } return String.fromCharCode.apply(undefined, newtext); }, pdfEscape = function (text, flags) { /** * Replace '/', '(', and ')' with pdf-safe versions * * Doing to8bitStream does NOT make this PDF display unicode text. For that * we also need to reference a unicode font and embed it - royal pain in the rear. * * There is still a benefit to to8bitStream - PDF simply cannot handle 16bit chars, * which JavaScript Strings are happy to provide. So, while we still cannot display * 2-byte characters property, at least CONDITIONALLY converting (entire string containing) * 16bit chars to (USC-2-BE) 2-bytes per char + BOM streams we ensure that entire PDF * is still parseable. * This will allow immediate support for unicode in document properties strings. */ return to8bitStream(text, flags).replace(/\\/g, '\\\\').replace(/\(/g, '\\(').replace(/\)/g, '\\)'); }, putInfo = function () { out('/Producer (jsPDF ' + jsPDF.version + ')'); for (var key in documentProperties) { if (documentProperties.hasOwnProperty(key) && documentProperties[key]) { out('/' + key.substr(0, 1).toUpperCase() + key.substr(1) + ' (' + pdfEscape(documentProperties[key]) + ')'); } } var created = new Date(), tzoffset = created.getTimezoneOffset(), tzsign = tzoffset < 0 ? '+' : '-', tzhour = Math.floor(Math.abs(tzoffset / 60)), tzmin = Math.abs(tzoffset % 60), tzstr = [tzsign, padd2(tzhour), "'", padd2(tzmin), "'"].join(''); out(['/CreationDate (D:', created.getFullYear(), padd2(created.getMonth() + 1), padd2(created.getDate()), padd2(created.getHours()), padd2(created.getMinutes()), padd2(created.getSeconds()), tzstr, ')'].join('')); }, putCatalog = function () { out('/Type /Catalog'); out('/Pages 1 0 R'); // PDF13ref Section 7.2.1 if (!zoomMode) zoomMode = 'fullwidth'; switch (zoomMode) { case 'fullwidth' : out('/OpenAction [3 0 R /FitH null]'); break; case 'fullheight' : out('/OpenAction [3 0 R /FitV null]'); break; case 'fullpage' : out('/OpenAction [3 0 R /Fit]'); break; case 'original' : out('/OpenAction [3 0 R /XYZ null null 1]'); break; default: var pcn = '' + zoomMode; if (pcn.substr(pcn.length - 1) === '%') zoomMode = parseInt(zoomMode) / 100; if (typeof zoomMode === 'number') { out('/OpenAction [3 0 R /XYZ null null ' + f2(zoomMode) + ']'); } } if (!layoutMode) layoutMode = 'continuous'; switch (layoutMode) { case 'continuous' : out('/PageLayout /OneColumn'); break; case 'single' : out('/PageLayout /SinglePage'); break; case 'two': case 'twoleft' : out('/PageLayout /TwoColumnLeft'); break; case 'tworight' : out('/PageLayout /TwoColumnRight'); break; } if (pageMode) { /** * A name object specifying how the document should be displayed when opened: * UseNone : Neither document outline nor thumbnail images visible -- DEFAULT * UseOutlines : Document outline visible * UseThumbs : Thumbnail images visible * FullScreen : Full-screen mode, with no menu bar, window controls, or any other window visible */ out('/PageMode /' + pageMode); } events.publish('putCatalog'); }, putTrailer = function () { out('/Size ' + (objectNumber + 1)); out('/Root ' + objectNumber + ' 0 R'); out('/Info ' + (objectNumber - 1) + ' 0 R'); }, beginPage = function (width, height) { // Dimensions are stored as user units and converted to points on output var orientation = typeof height === 'string' && height.toLowerCase(); if (typeof width === 'string') { var format = width.toLowerCase(); if (pageFormats.hasOwnProperty(format)) { width = pageFormats[format][0] / k; height = pageFormats[format][1] / k; } } if (Array.isArray(width)) { height = width[1]; width = width[0]; } if (orientation) { switch (orientation.substr(0, 1)) { case 'l': if (height > width) orientation = 's'; break; case 'p': if (width > height) orientation = 's'; break; } if (orientation === 's') { tmp = width; width = height; height = tmp; } } outToPages = true; pages[++page] = []; pagedim[page] = { width: Number(width) || pageWidth, height: Number(height) || pageHeight }; pagesContext[page] = {}; _setPage(page); }, _addPage = function () { beginPage.apply(this, arguments); // Set line width out(f2(lineWidth * k) + ' w'); // Set draw color out(drawColor); // resurrecting non-default line caps, joins if (lineCapID !== 0) { out(lineCapID + ' J'); } if (lineJoinID !== 0) { out(lineJoinID + ' j'); } events.publish('addPage', {pageNumber: page}); }, _deletePage = function (n) { if (n > 0 && n <= page) { pages.splice(n, 1); pagedim.splice(n, 1); page--; if (currentPage > page) { currentPage = page; } this.setPage(currentPage); } }, _setPage = function (n) { if (n > 0 && n <= page) { currentPage = n; pageWidth = pagedim[n].width; pageHeight = pagedim[n].height; } }, /** * Returns a document-specific font key - a label assigned to a * font name + font type combination at the time the font was added * to the font inventory. * * Font key is used as label for the desired font for a block of text * to be added to the PDF document stream. * @private * @function * @param fontName {String} can be undefined on "falthy" to indicate "use current" * @param fontStyle {String} can be undefined on "falthy" to indicate "use current" * @returns {String} Font key. */ getFont = function (fontName, fontStyle) { var key; fontName = fontName !== undefined ? fontName : fonts[activeFontKey].fontName; fontStyle = fontStyle !== undefined ? fontStyle : fonts[activeFontKey].fontStyle; if (fontName !== undefined){ fontName = fontName.toLowerCase(); } switch(fontName){ case 'sans-serif': case 'verdana': case 'arial': case 'helvetica': fontName = 'helvetica'; break; case 'fixed': case 'monospace': case 'terminal': case 'courier': fontName = 'courier'; break; case 'serif': case 'cursive': case 'fantasy': default: fontName = 'times'; break; } try { // get a string like 'F3' - the KEY corresponding tot he font + type combination. key = fontmap[fontName][fontStyle]; } catch (e) { } if (!key) { //throw new Error("Unable to look up font label for font '" + fontName + "', '" //+ fontStyle + "'. Refer to getFontList() for available fonts."); key = fontmap['times'][fontStyle]; if (key == null) { key = fontmap['times']['normal']; } } return key; }, buildDocument = function () { outToPages = false; // switches out() to content objectNumber = 2; content = []; offsets = []; additionalObjects = []; // Added for AcroForm events.publish('buildDocument'); // putHeader() out('%PDF-' + pdfVersion); putPages(); // Must happen after putPages // Modifies current object Id putAdditionalObjects(); putResources(); // Info newObject(); out('<<'); putInfo(); out('>>'); out('endobj'); // Catalog newObject(); out('<<'); putCatalog(); out('>>'); out('endobj'); // Cross-ref var o = content_length, i, p = "0000000000"; out('xref'); out('0 ' + (objectNumber + 1)); out(p + ' 65535 f '); for (i = 1; i <= objectNumber; i++) { var offset = offsets[i]; if (typeof offset === 'function') { out((p + offsets[i]()).slice(-10) + ' 00000 n '); } else { out((p + offsets[i]).slice(-10) + ' 00000 n '); } } // Trailer out('trailer'); out('<<'); putTrailer(); out('>>'); out('startxref'); out(o); out('%%EOF'); outToPages = true; return content.join('\n'); }, getStyle = function (style) { // see path-painting operators in PDF spec var op = 'S'; // stroke if (style === 'F') { op = 'f'; // fill } else if (style === 'FD' || style === 'DF') { op = 'B'; // both } else if (style === 'f' || style === 'f*' || style === 'B' || style === 'B*') { /* Allow direct use of these PDF path-painting operators: - f fill using nonzero winding number rule - f* fill using even-odd rule - B fill then stroke with fill using non-zero winding number rule - B* fill then stroke with fill using even-odd rule */ op = style; } return op; }, getArrayBuffer = function () { var data = buildDocument(), len = data.length, ab = new ArrayBuffer(len), u8 = new Uint8Array(ab); while (len--) u8[len] = data.charCodeAt(len); return ab; }, getBlob = function () { return new Blob([getArrayBuffer()], {type: "application/pdf"}); }, /** * Generates the PDF document. * * If `type` argument is undefined, output is raw body of resulting PDF returned as a string. * * @param {String} type A string identifying one of the possible output types. * @param {Object} options An object providing some additional signalling to PDF generator. * @function * @returns {jsPDF} * @methodOf jsPDF# * @name output */ output = SAFE(function (type, options) { var datauri = ('' + type).substr(0, 6) === 'dataur' ? 'data:application/pdf;base64,' + btoa(buildDocument()) : 0; switch (type) { case undefined: return buildDocument(); case 'save': if (navigator.getUserMedia) { if (global.URL === undefined || global.URL.createObjectURL === undefined) { return API.output('dataurlnewwindow'); } } saveAs(getBlob(), options); if (typeof saveAs.unload === 'function') { if (global.setTimeout) { setTimeout(saveAs.unload, 911); } } break; case 'arraybuffer': return getArrayBuffer(); case 'blob': return getBlob(); case 'bloburi': case 'bloburl': // User is responsible of calling revokeObjectURL return global.URL && global.URL.createObjectURL(getBlob()) || void 0; case 'datauristring': case 'dataurlstring': return datauri; case 'dataurlnewwindow': var nW = global.open(datauri); if (nW || typeof safari === "undefined") return nW; /* pass through */ case 'datauri': case 'dataurl': return global.document.location.href = datauri; default: throw new Error('Output type "' + type + '" is not supported.'); } // @TODO: Add different output options }); switch (unit) { case 'pt': k = 1; break; case 'mm': k = 72 / 25.4000508; break; case 'cm': k = 72 / 2.54000508; break; case 'in': k = 72; break; case 'px': k = 96 / 72; break; case 'pc': k = 12; break; case 'em': k = 12; break; case 'ex': k = 6; break; default: throw ('Invalid unit: ' + unit); } //--------------------------------------- // Public API /** * Object exposing internal API to plugins * @public */ API.internal = { 'pdfEscape': pdfEscape, 'getStyle': getStyle, /** * Returns {FontObject} describing a particular font. * @public * @function * @param fontName {String} (Optional) Font's family name * @param fontStyle {String} (Optional) Font's style variation name (Example:"Italic") * @returns {FontObject} */ 'getFont': function () { return fonts[getFont.apply(API, arguments)]; }, 'getFontSize': function () { return activeFontSize; }, 'getLineHeight': function () { return activeFontSize * lineHeightProportion; }, 'write': function (string1 /*, string2, string3, etc */) { out(arguments.length === 1 ? string1 : Array.prototype.join.call(arguments, ' ')); }, 'getCoordinateString': function (value) { return f2(value * k); }, 'getVerticalCoordinateString': function (value) { return f2((pageHeight - value) * k); }, 'collections': {}, 'newObject': newObject, 'newAdditionalObject': newAdditionalObject, 'newObjectDeferred': newObjectDeferred, 'newObjectDeferredBegin': newObjectDeferredBegin, 'putStream': putStream, 'events': events, // ratio that you use in multiplication of a given "size" number to arrive to 'point' // units of measurement. // scaleFactor is set at initialization of the document and calculated against the stated // default measurement units for the document. // If default is "mm", k is the number that will turn number in 'mm' into 'points' number. // through multiplication. 'scaleFactor': k, 'pageSize': { get width() { return pageWidth }, get height() { return pageHeight } }, 'output': function (type, options) { return output(type, options); }, 'getNumberOfPages': function () { return pages.length - 1; }, 'pages': pages, 'out': out, 'f2': f2, 'getPageInfo': function (pageNumberOneBased) { var objId = (pageNumberOneBased - 1) * 2 + 3; return {objId: objId, pageNumber: pageNumberOneBased, pageContext: pagesContext[pageNumberOneBased]}; }, 'getCurrentPageInfo': function () { var objId = (currentPage - 1) * 2 + 3; return {objId: objId, pageNumber: currentPage, pageContext: pagesContext[currentPage]}; }, 'getPDFVersion': function () { return pdfVersion; } }; /** * Adds (and transfers the focus to) new page to the PDF document. * @function * @returns {jsPDF} * * @methodOf jsPDF# * @name addPage */ API.addPage = function () { _addPage.apply(this, arguments); return this; }; API.setPage = function () { _setPage.apply(this, arguments); return this; }; API.insertPage = function (beforePage) { this.addPage(); this.movePage(currentPage, beforePage); return this; }; API.movePage = function (targetPage, beforePage) { if (targetPage > beforePage) { var tmpPages = pages[targetPage]; var tmpPagedim = pagedim[targetPage]; var tmpPagesContext = pagesContext[targetPage]; for (var i = targetPage; i > beforePage; i--) { pages[i] = pages[i - 1]; pagedim[i] = pagedim[i - 1]; pagesContext[i] = pagesContext[i - 1]; } pages[beforePage] = tmpPages; pagedim[beforePage] = tmpPagedim; pagesContext[beforePage] = tmpPagesContext; this.setPage(beforePage); } else if (targetPage < beforePage) { var tmpPages = pages[targetPage]; var tmpPagedim = pagedim[targetPage]; var tmpPagesContext = pagesContext[targetPage]; for (var i = targetPage; i < beforePage; i++) { pages[i] = pages[i + 1]; pagedim[i] = pagedim[i + 1]; pagesContext[i] = pagesContext[i + 1]; } pages[beforePage] = tmpPages; pagedim[beforePage] = tmpPagedim; pagesContext[beforePage] = tmpPagesContext; this.setPage(beforePage); } return this; }; API.deletePage = function () { _deletePage.apply(this, arguments); return this; }; API.setDisplayMode = function (zoom, layout, pmode) { zoomMode = zoom; layoutMode = layout; pageMode = pmode; return this; }, /** * Adds text to page. Supports adding multiline text when 'text' argument is an Array of Strings. * * @function * @param {String|Array} text String or array of strings to be added to the page. Each line is shifted one line down per font, spacing settings declared before this call. * @param {Number} x Coordinate (in units declared at inception of PDF document) against left edge of the page * @param {Number} y Coordinate (in units declared at inception of PDF document) against upper edge of the page * @param {Object} flags Collection of settings signalling how the text must be encoded. Defaults are sane. If you think you want to pass some flags, you likely can read the source. * @returns {jsPDF} * @methodOf jsPDF# * @name text */ API.text = function (text, x, y, flags, angle, align) { /** * Inserts something like this into PDF * BT * /F1 16 Tf % Font name + size * 16 TL % How many units down for next line in multiline text * 0 g % color * 28.35 813.54 Td % position * (line one) Tj * T* (line two) Tj * T* (line three) Tj * ET */ function ESC(s) { s = s.split("\t").join(Array(options.TabLen || 9).join(" ")); return pdfEscape(s, flags); } // Pre-August-2012 the order of arguments was function(x, y, text, flags) // in effort to make all calls have similar signature like // function(data, coordinates... , miscellaneous) // this method had its args flipped. // code below allows backward compatibility with old arg order. if (typeof text === 'number') { tmp = y; y = x; x = text; text = tmp; } // If there are any newlines in text, we assume // the user wanted to print multiple lines, so break the // text up into an array. If the text is already an array, // we assume the user knows what they are doing. // Convert text into an array anyway to simplify // later code. if (typeof text === 'string') { if (text.match(/[\n\r]/)) { text = text.split(/\r\n|\r|\n/g); } else { text = [text]; } } if (typeof angle === 'string') { align = angle; angle = null; } if (typeof flags === 'string') { align = flags; flags = null; } if (typeof flags === 'number') { angle = flags; flags = null; } var xtra = '', mode = 'Td', todo; if (angle) { angle *= (Math.PI / 180); var c = Math.cos(angle), s = Math.sin(angle); xtra = [f2(c), f2(s), f2(s * -1), f2(c), ''].join(" "); mode = 'Tm'; } flags = flags || {}; if (!('noBOM' in flags)) flags.noBOM = true; if (!('autoencode' in flags)) flags.autoencode = true; var strokeOption = ''; var pageContext = this.internal.getCurrentPageInfo().pageContext; if (true === flags.stroke) { if (pageContext.lastTextWasStroke !== true) { strokeOption = '1 Tr\n'; pageContext.lastTextWasStroke = true; } } else { if (pageContext.lastTextWasStroke) { strokeOption = '0 Tr\n'; } pageContext.lastTextWasStroke = false; } if (typeof this._runningPageHeight === 'undefined') { this._runningPageHeight = 0; } if (typeof text === 'string') { text = ESC(text); } else if (Object.prototype.toString.call(text) === '[object Array]') { // we don't want to destroy original text array, so cloning it var sa = text.concat(), da = [], len = sa.length; // we do array.join('text that must not be PDFescaped") // thus, pdfEscape each component separately while (len--) { da.push(ESC(sa.shift())); } var linesLeft = Math.ceil((pageHeight - y - this._runningPageHeight) * k / (activeFontSize * lineHeightProportion)); if (0 <= linesLeft && linesLeft < da.length + 1) { //todo = da.splice(linesLeft-1); } if (align) { var left, prevX, maxLineLength, leading = activeFontSize * lineHeightProportion, lineWidths = text.map(function (v) { return this.getStringUnitWidth(v) * activeFontSize / k; }, this); maxLineLength = Math.max.apply(Math, lineWidths); // The first line uses the "main" Td setting, // and the subsequent lines are offset by the // previous line's x coordinate. if (align === "center") { // The passed in x coordinate defines // the center point. left = x - maxLineLength / 2; x -= lineWidths[0] / 2; } else if (align === "right") { // The passed in x coordinate defines the // rightmost point of the text. left = x - maxLineLength; x -= lineWidths[0]; } else { throw new Error('Unrecognized alignment option, use "center" or "right".'); } prevX = x; text = da[0] + ") Tj\n"; for (i = 1, len = da.length; i < len; i++) { var delta = maxLineLength - lineWidths[i]; if (align === "center") delta /= 2; // T* = x-offset leading Td ( text ) text += ( ( left - prevX ) + delta ) + " -" + leading + " Td (" + da[i]; prevX = left + delta; if (i < len - 1) { text += ") Tj\n"; } } } else { text = da.join(") Tj\nT* ("); } } else { throw new Error('Type of text must be string or Array. "' + text + '" is not recognized.'); } // Using "'" ("go next line and render text" mark) would save space but would complicate our rendering code, templates // BT .. ET does NOT have default settings for Tf. You must state that explicitely every time for BT .. ET // if you want text transformation matrix (+ multiline) to work reliably (which reads sizes of things from font declarations) // Thus, there is NO useful, *reliable* concept of "default" font for a page. // The fact that "default" (reuse font used before) font worked before in basic cases is an accident // - readers dealing smartly with brokenness of jsPDF's markup. var curY; if (todo) { //this.addPage(); //this._runningPageHeight += y - (activeFontSize * 1.7 / k); //curY = f2(pageHeight - activeFontSize * 1.7 /k); } else { curY = f2((pageHeight - y) * k); } //curY = f2((pageHeight - (y - this._runningPageHeight)) * k); // if (curY < 0){ // console.log('auto page break'); // this.addPage(); // this._runningPageHeight = y - (activeFontSize * 1.7 / k); // curY = f2(pageHeight - activeFontSize * 1.7 /k); // } out( 'BT\n/' + activeFontKey + ' ' + activeFontSize + ' Tf\n' + // font face, style, size (activeFontSize * lineHeightProportion) + ' TL\n' + // line spacing strokeOption +// stroke option textColor + '\n' + xtra + f2(x * k) + ' ' + curY + ' ' + mode + '\n(' + text + ') Tj\nET'); if (todo) { //this.text( todo, x, activeFontSize * 1.7 / k); //this.text( todo, x, this._runningPageHeight + (activeFontSize * 1.7 / k)); this.text(todo, x, y);// + (activeFontSize * 1.7 / k)); } return this; }; API.lstext = function (text, x, y, spacing) { for (var i = 0, len = text.length; i < len; i++, x += spacing) this.text(text[i], x, y); }; API.line = function (x1, y1, x2, y2) { return this.lines([[x2 - x1, y2 - y1]], x1, y1); }; API.clip = function () { // By patrick-roberts, github.com/MrRio/jsPDF/issues/328 // Call .clip() after calling .rect() with a style argument of null out('W') // clip out('S') // stroke path; necessary for clip to work }; /** * Adds series of curves (straight lines or cubic bezier curves) to canvas, starting at `x`, `y` coordinates. * All data points in `lines` are relative to last line origin. * `x`, `y` become x1,y1 for first line / curve in the set. * For lines you only need to specify [x2, y2] - (ending point) vector against x1, y1 starting point. * For bezier curves you need to specify [x2,y2,x3,y3,x4,y4] - vectors to control points 1, 2, ending point. All vectors are against the start of the curve - x1,y1. * * @example .lines([[2,2],[-2,2],[1,1,2,2,3,3],[2,1]], 212,110, 10) // line, line, bezier curve, line * @param {Array} lines Array of *vector* shifts as pairs (lines) or sextets (cubic bezier curves). * @param {Number} x Coordinate (in units declared at inception of PDF document) against left edge of the page * @param {Number} y Coordinate (in units declared at inception of PDF document) against upper edge of the page * @param {Number} scale (Defaults to [1.0,1.0]) x,y Scaling factor for all vectors. Elements can be any floating number Sub-one makes drawing smaller. Over-one grows the drawing. Negative flips the direction. * @param {String} style A string specifying the painting style or null. Valid styles include: 'S' [default] - stroke, 'F' - fill, and 'DF' (or 'FD') - fill then stroke. A null value postpones setting the style so that a shape may be composed using multiple method calls. The last drawing method call used to define the shape should not have a null style argument. * @param {Boolean} closed If true, the path is closed with a straight line from the end of the last curve to the starting point. * @function * @returns {jsPDF} * @methodOf jsPDF# * @name lines */ API.lines = function (lines, x, y, scale, style, closed) { var scalex, scaley, i, l, leg, x2, y2, x3, y3, x4, y4; // Pre-August-2012 the order of arguments was function(x, y, lines, scale, style) // in effort to make all calls have similar signature like // function(content, coordinateX, coordinateY , miscellaneous) // this method had its args flipped. // code below allows backward compatibility with old arg order. if (typeof lines === 'number') { tmp = y; y = x; x = lines; lines = tmp; } scale = scale || [1, 1]; // starting point out(f3(x * k) + ' ' + f3((pageHeight - y) * k) + ' m '); scalex = scale[0]; scaley = scale[1]; l = lines.length; //, x2, y2 // bezier only. In page default measurement "units", *after* scaling //, x3, y3 // bezier only. In page default measurement "units", *after* scaling // ending point for all, lines and bezier. . In page default measurement "units", *after* scaling x4 = x; // last / ending point = starting point for first item. y4 = y; // last / ending point = starting point for first item. for (i = 0; i < l; i++) { leg = lines[i]; if (leg.length === 2) { // simple line x4 = leg[0] * scalex + x4; // here last x4 was prior ending point y4 = leg[1] * scaley + y4; // here last y4 was prior ending point out(f3(x4 * k) + ' ' + f3((pageHeight - y4) * k) + ' l'); } else { // bezier curve x2 = leg[0] * scalex + x4; // here last x4 is prior ending point y2 = leg[1] * scaley + y4; // here last y4 is prior ending point x3 = leg[2] * scalex + x4; // here last x4 is prior ending point y3 = leg[3] * scaley + y4; // here last y4 is prior ending point x4 = leg[4] * scalex + x4; // here last x4 was prior ending point y4 = leg[5] * scaley + y4; // here last y4 was prior ending point out( f3(x2 * k) + ' ' + f3((pageHeight - y2) * k) + ' ' + f3(x3 * k) + ' ' + f3((pageHeight - y3) * k) + ' ' + f3(x4 * k) + ' ' + f3((pageHeight - y4) * k) + ' c'); } } if (closed) { out(' h'); } // stroking / filling / both the path if (style !== null) { out(getStyle(style)); } return this; }; /** * Adds a rectangle to PDF * * @param {Number} x Coordinate (in units declared at inception of PDF document) against left edge of the page * @param {Number} y Coordinate (in units declared at inception of PDF document) against upper edge of the page * @param {Number} w Width (in units declared at inception of PDF document) * @param {Number} h Height (in units declared at inception of PDF document) * @param {String} style A string specifying the painting style or null. Valid styles include: 'S' [default] - stroke, 'F' - fill, and 'DF' (or 'FD') - fill then stroke. A null value postpones setting the style so that a shape may be composed using multiple method calls. The last drawing method call used to define the shape should not have a null style argument. * @function * @returns {jsPDF} * @methodOf jsPDF# * @name rect */ API.rect = function (x, y, w, h, style) { var op = getStyle(style); out([ f2(x * k), f2((pageHeight - y) * k), f2(w * k), f2(-h * k), 're' ].join(' ')); if (style !== null) { out(getStyle(style)); } return this; }; /** * Adds a triangle to PDF * * @param {Number} x1 Coordinate (in units declared at inception of PDF document) against left edge of the page * @param {Number} y1 Coordinate (in units declared at inception of PDF document) against upper edge of the page * @param {Number} x2 Coordinate (in units declared at inception of PDF document) against left edge of the page * @param {Number} y2 Coordinate (in units declared at inception of PDF document) against upper edge of the page * @param {Number} x3 Coordinate (in units declared at inception of PDF document) against left edge of the page * @param {Number} y3 Coordinate (in units declared at inception of PDF document) against upper edge of the page * @param {String} style A string specifying the painting style or null. Valid styles include: 'S' [default] - stroke, 'F' - fill, and 'DF' (or 'FD') - fill then stroke. A null value postpones setting the style so that a shape may be composed using multiple method calls. The last drawing method call used to define the shape should not have a null style argument. * @function * @returns {jsPDF} * @methodOf jsPDF# * @name triangle */ API.triangle = function (x1, y1, x2, y2, x3, y3, style) { this.lines( [ [x2 - x1, y2 - y1], // vector to point 2 [x3 - x2, y3 - y2], // vector to point 3 [x1 - x3, y1 - y3]// closing vector back to point 1 ], x1, y1, // start of path [1, 1], style, true); return this; }; /** * Adds a rectangle with rounded corners to PDF * * @param {Number} x Coordinate (in units declared at inception of PDF document) against left edge of the page * @param {Number} y Coordinate (in units declared at inception of PDF document) against upper edge of the page * @param {Number} w Width (in units declared at inception of PDF document) * @param {Number} h Height (in units declared at inception of PDF document) * @param {Number} rx Radius along x axis (in units declared at inception of PDF document) * @param {Number} rx Radius along y axis (in units declared at inception of PDF document) * @param {String} style A string specifying the painting style or null. Valid styles include: 'S' [default] - stroke, 'F' - fill, and 'DF' (or 'FD') - fill then stroke. A null value postpones setting the style so that a shape may be composed using multiple method calls. The last drawing method call used to define the shape should not have a null style argument. * @function * @returns {jsPDF} * @methodOf jsPDF# * @name roundedRect */ API.roundedRect = function (x, y, w, h, rx, ry, style) { var MyArc = 4 / 3 * (Math.SQRT2 - 1); this.lines( [ [(w - 2 * rx), 0], [(rx * MyArc), 0, rx, ry - (ry * MyArc), rx, ry], [0, (h - 2 * ry)], [0, (ry * MyArc), -(rx * MyArc), ry, -rx, ry], [(-w + 2 * rx), 0], [-(rx * MyArc), 0, -rx, -(ry * MyArc), -rx, -ry], [0, (-h + 2 * ry)], [0, -(ry * MyArc), (rx * MyArc), -ry, rx, -ry] ], x + rx, y, // start of path [1, 1], style); return this; }; /** * Adds an ellipse to PDF * * @param {Number} x Coordinate (in units declared at inception of PDF document) against left edge of the page * @param {Number} y Coordinate (in units declared at inception of PDF document) against upper edge of the page * @param {Number} rx Radius along x axis (in units declared at inception of PDF document) * @param {Number} rx Radius along y axis (in units declared at inception of PDF document) * @param {String} style A string specifying the painting style or null. Valid styles include: 'S' [default] - stroke, 'F' - fill, and 'DF' (or 'FD') - fill then stroke. A null value postpones setting the style so that a shape may be composed using multiple method calls. The last drawing method call used to define the shape should not have a null style argument. * @function * @returns {jsPDF} * @methodOf jsPDF# * @name ellipse */ API.ellipse = function (x, y, rx, ry, style) { var lx = 4 / 3 * (Math.SQRT2 - 1) * rx, ly = 4 / 3 * (Math.SQRT2 - 1) * ry; out([ f2((x + rx) * k), f2((pageHeight - y) * k), 'm', f2((x + rx) * k), f2((pageHeight - (y - ly)) * k), f2((x + lx) * k), f2((pageHeight - (y - ry)) * k), f2(x * k), f2((pageHeight - (y - ry)) * k), 'c' ].join(' ')); out([ f2((x - lx) * k), f2((pageHeight - (y - ry)) * k), f2((x - rx) * k), f2((pageHeight - (y - ly)) * k), f2((x - rx) * k), f2((pageHeight - y) * k), 'c' ].join(' ')); out([ f2((x - rx) * k), f2((pageHeight - (y + ly)) * k), f2((x - lx) * k), f2((pageHeight - (y + ry)) * k), f2(x * k), f2((pageHeight - (y + ry)) * k), 'c' ].join(' ')); out([ f2((x + lx) * k), f2((pageHeight - (y + ry)) * k), f2((x + rx) * k), f2((pageHeight - (y + ly)) * k), f2((x + rx) * k), f2((pageHeight - y) * k), 'c' ].join(' ')); if (style !== null) { out(getStyle(style)); } return this; }; /** * Adds an circle to PDF * * @param {Number} x Coordinate (in units declared at inception of PDF document) against left edge of the page * @param {Number} y Coordinate (in units declared at inception of PDF document) against upper edge of the page * @param {Number} r Radius (in units declared at inception of PDF document) * @param {String} style A string specifying the painting style or null. Valid styles include: 'S' [default] - stroke, 'F' - fill, and 'DF' (or 'FD') - fill then stroke. A null value postpones setting the style so that a shape may be composed using multiple method calls. The last drawing method call used to define the shape should not have a null style argument. * @function * @returns {jsPDF} * @methodOf jsPDF# * @name circle */ API.circle = function (x, y, r, style) { return this.ellipse(x, y, r, r, style); }; /** * Adds a properties to the PDF document * * @param {Object} A property_name-to-property_value object structure. * @function * @returns {jsPDF} * @methodOf jsPDF# * @name setProperties */ API.setProperties = function (properties) { // copying only those properties we can render. for (var property in documentProperties) { if (documentProperties.hasOwnProperty(property) && properties[property]) { documentProperties[property] = properties[property]; } } return this; }; /** * Sets font size for upcoming text elements. * * @param {Number} size Font size in points. * @function * @returns {jsPDF} * @methodOf jsPDF# * @name setFontSize */ API.setFontSize = function (size) { activeFontSize = size; return this; }; /** * Sets text font face, variant for upcoming text elements. * See output of jsPDF.getFontList() for possible font names, styles. * * @param {String} fontName Font name or family. Example: "times" * @param {String} fontStyle Font style or variant. Example: "italic" * @function * @returns {jsPDF} * @methodOf jsPDF# * @name setFont */ API.setFont = function (fontName, fontStyle) { activeFontKey = getFont(fontName, fontStyle); // if font is not found, the above line blows up and we never go further return this; }; /** * Switches font style or variant for upcoming text elements, * while keeping the font face or family same. * See output of jsPDF.getFontList() for possible font names, styles. * * @param {String} style Font style or variant. Example: "italic" * @function * @returns {jsPDF} * @methodOf jsPDF# * @name setFontStyle */ API.setFontStyle = API.setFontType = function (style) { activeFontKey = getFont(undefined, style); // if font is not found, the above line blows up and we never go further return this; }; /** * Returns an object - a tree of fontName to fontStyle relationships available to * active PDF document. * * @public * @function * @returns {Object} Like {'times':['normal', 'italic', ... ], 'arial':['normal', 'bold', ... ], ... } * @methodOf jsPDF# * @name getFontList */ API.getFontList = function () { // TODO: iterate over fonts array or return copy of fontmap instead in case more are ever added. var list = {}, fontName, fontStyle, tmp; for (fontName in fontmap) { if (fontmap.hasOwnProperty(fontName)) { list[fontName] = tmp = []; for (fontStyle in fontmap[fontName]) { if (fontmap[fontName].hasOwnProperty(fontStyle)) { tmp.push(fontStyle); } } } } return list; }; /** * Add a custom font. * * @param {String} Postscript name of the Font. Example: "Menlo-Regular" * @param {String} Name of font-family from @font-face definition. Example: "Menlo Regular" * @param {String} Font style. Example: "normal" * @function * @returns the {fontKey} (same as the internal method) * @methodOf jsPDF# * @name addFont */ API.addFont = function (postScriptName, fontName, fontStyle) { addFont(postScriptName, fontName, fontStyle, 'StandardEncoding'); }; /** * Sets line width for upcoming lines. * * @param {Number} width Line width (in units declared at inception of PDF document) * @function * @returns {jsPDF} * @methodOf jsPDF# * @name setLineWidth */ API.setLineWidth = function (width) { out((width * k).toFixed(2) + ' w'); return this; }; /** * Sets the stroke color for upcoming elements. * * Depending on the number of arguments given, Gray, RGB, or CMYK * color space is implied. * * When only ch1 is given, "Gray" color space is implied and it * must be a value in the range from 0.00 (solid black) to to 1.00 (white) * if values are communicated as String types, or in range from 0 (black) * to 255 (white) if communicated as Number type. * The RGB-like 0-255 range is provided for backward compatibility. * * When only ch1,ch2,ch3 are given, "RGB" color space is implied and each * value must be in the range from 0.00 (minimum intensity) to to 1.00 * (max intensity) if values are communicated as String types, or * from 0 (min intensity) to to 255 (max intensity) if values are communicated * as Number types. * The RGB-like 0-255 range is provided for backward compatibility. * * When ch1,ch2,ch3,ch4 are given, "CMYK" color space is implied and each * value must be a in the range from 0.00 (0% concentration) to to * 1.00 (100% concentration) * * Because JavaScript treats fixed point numbers badly (rounds to * floating point nearest to binary representation) it is highly advised to * communicate the fractional numbers as String types, not JavaScript Number type. * * @param {Number|String} ch1 Color channel value * @param {Number|String} ch2 Color channel value * @param {Number|String} ch3 Color channel value * @param {Number|String} ch4 Color channel value * * @function * @returns {jsPDF} * @methodOf jsPDF# * @name setDrawColor */ API.setDrawColor = function (ch1, ch2, ch3, ch4) { var color; if (ch2 === undefined || (ch4 === undefined && ch1 === ch2 === ch3)) { // Gray color space. if (typeof ch1 === 'string') { color = ch1 + ' G'; } else { color = f2(ch1 / 255) + ' G'; } } else if (ch4 === undefined) { // RGB if (typeof ch1 === 'string') { color = [ch1, ch2, ch3, 'RG'].join(' '); } else { color = [f2(ch1 / 255), f2(ch2 / 255), f2(ch3 / 255), 'RG'].join(' '); } } else { // CMYK if (typeof ch1 === 'string') { color = [ch1, ch2, ch3, ch4, 'K'].join(' '); } else { color = [f2(ch1), f2(ch2), f2(ch3), f2(ch4), 'K'].join(' '); } } out(color); return this; }; /** * Sets the fill color for upcoming elements. * * Depending on the number of arguments given, Gray, RGB, or CMYK * color space is implied. * * When only ch1 is given, "Gray" color space is implied and it * must be a value in the range from 0.00 (solid black) to to 1.00 (white) * if values are communicated as String types, or in range from 0 (black) * to 255 (white) if communicated as Number type. * The RGB-like 0-255 range is provided for backward compatibility. * * When only ch1,ch2,ch3 are given, "RGB" color space is implied and each * value must be in the range from 0.00 (minimum intensity) to to 1.00 * (max intensity) if values are communicated as String types, or * from 0 (min intensity) to to 255 (max intensity) if values are communicated * as Number types. * The RGB-like 0-255 range is provided for backward compatibility. * * When ch1,ch2,ch3,ch4 are given, "CMYK" color space is implied and each * value must be a in the range from 0.00 (0% concentration) to to * 1.00 (100% concentration) * * Because JavaScript treats fixed point numbers badly (rounds to * floating point nearest to binary representation) it is highly advised to * communicate the fractional numbers as String types, not JavaScript Number type. * * @param {Number|String} ch1 Color channel value * @param {Number|String} ch2 Color channel value * @param {Number|String} ch3 Color channel value * @param {Number|String} ch4 Color channel value * * @function * @returns {jsPDF} * @methodOf jsPDF# * @name setFillColor */ API.setFillColor = function (ch1, ch2, ch3, ch4) { var color; if (ch2 === undefined || (ch4 === undefined && ch1 === ch2 === ch3)) { // Gray color space. if (typeof ch1 === 'string') { color = ch1 + ' g'; } else { color = f2(ch1 / 255) + ' g'; } } else if (ch4 === undefined || typeof ch4 === 'object') { // RGB if (typeof ch1 === 'string') { color = [ch1, ch2, ch3, 'rg'].join(' '); } else { color = [f2(ch1 / 255), f2(ch2 / 255), f2(ch3 / 255), 'rg'].join(' '); } if (ch4 && ch4.a === 0) { //TODO Implement transparency. //WORKAROUND use white for now color = ['255', '255', '255', 'rg'].join(' '); } } else { // CMYK if (typeof ch1 === 'string') { color = [ch1, ch2, ch3, ch4, 'k'].join(' '); } else { color = [f2(ch1), f2(ch2), f2(ch3), f2(ch4), 'k'].join(' '); } } out(color); return this; }; /** * Sets the text color for upcoming elements. * If only one, first argument is given, * treats the value as gray-scale color value. * * @param {Number} r Red channel color value in range 0-255 or {String} r color value in hexadecimal, example: '#FFFFFF' * @param {Number} g Green channel color value in range 0-255 * @param {Number} b Blue channel color value in range 0-255 * @function * @returns {jsPDF} * @methodOf jsPDF# * @name setTextColor */ API.setTextColor = function (r, g, b) { if ((typeof r === 'string') && /^#[0-9A-Fa-f]{6}$/.test(r)) { var hex = parseInt(r.substr(1), 16); r = (hex >> 16) & 255; g = (hex >> 8) & 255; b = (hex & 255); } if ((r === 0 && g === 0 && b === 0) || (typeof g === 'undefined')) { textColor = f3(r / 255) + ' g'; } else { textColor = [f3(r / 255), f3(g / 255), f3(b / 255), 'rg'].join(' '); } return this; }; /** * Is an Object providing a mapping from human-readable to * integer flag values designating the varieties of line cap * and join styles. * * @returns {Object} * @fieldOf jsPDF# * @name CapJoinStyles */ API.CapJoinStyles = { 0: 0, 'butt': 0, 'but': 0, 'miter': 0, 1: 1, 'round': 1, 'rounded': 1, 'circle': 1, 2: 2, 'projecting': 2, 'project': 2, 'square': 2, 'bevel': 2 }; /** * Sets the line cap styles * See {jsPDF.CapJoinStyles} for variants * * @param {String|Number} style A string or number identifying the type of line cap * @function * @returns {jsPDF} * @methodOf jsPDF# * @name setLineCap */ API.setLineCap = function (style) { var id = this.CapJoinStyles[style]; if (id === undefined) { throw new Error("Line cap style of '" + style + "' is not recognized. See or extend .CapJoinStyles property for valid styles"); } lineCapID = id; out(id + ' J'); return this; }; /** * Sets the line join styles * See {jsPDF.CapJoinStyles} for variants * * @param {String|Number} style A string or number identifying the type of line join * @function * @returns {jsPDF} * @methodOf jsPDF# * @name setLineJoin */ API.setLineJoin = function (style) { var id = this.CapJoinStyles[style]; if (id === undefined) { throw new Error("Line join style of '" + style + "' is not recognized. See or extend .CapJoinStyles property for valid styles"); } lineJoinID = id; out(id + ' j'); return this; }; // Output is both an internal (for plugins) and external function API.output = output; /** * Saves as PDF document. An alias of jsPDF.output('save', 'filename.pdf') * @param {String} filename The filename including extension. * * @function * @returns {jsPDF} * @methodOf jsPDF# * @name save */ API.save = function (filename) { API.output('save', filename); }; // applying plugins (more methods) ON TOP of built-in API. // this is intentional as we allow plugins to override // built-ins for (var plugin in jsPDF.API) { if (jsPDF.API.hasOwnProperty(plugin)) { if (plugin === 'events' && jsPDF.API.events.length) { (function (events, newEvents) { // jsPDF.API.events is a JS Array of Arrays // where each Array is a pair of event name, handler // Events were added by plugins to the jsPDF instantiator. // These are always added to the new instance and some ran // during instantiation. var eventname, handler_and_args, i; for (i = newEvents.length - 1; i !== -1; i--) { // subscribe takes 3 args: 'topic', function, runonce_flag // if undefined, runonce is false. // users can attach callback directly, // or they can attach an array with [callback, runonce_flag] // that's what the "apply" magic is for below. eventname = newEvents[i][0]; handler_and_args = newEvents[i][1]; events.subscribe.apply( events, [eventname].concat( typeof handler_and_args === 'function' ? [handler_and_args] : handler_and_args)); } }(events, jsPDF.API.events)); } else { API[plugin] = jsPDF.API[plugin]; } } } ////////////////////////////////////////////////////// // continuing initialization of jsPDF Document object ////////////////////////////////////////////////////// // Add the first page automatically addFonts(); activeFontKey = 'F1'; _addPage(format, orientation); events.publish('initialized'); return API; } /** * jsPDF.API is a STATIC property of jsPDF class. * jsPDF.API is an object you can add methods and properties to. * The methods / properties you add will show up in new jsPDF objects. * * One property is prepopulated. It is the 'events' Object. Plugin authors can add topics, * callbacks to this object. These will be reassigned to all new instances of jsPDF. * Examples: * jsPDF.API.events['initialized'] = function(){ 'this' is API object } * jsPDF.API.events['addFont'] = function(added_font_object){ 'this' is API object } * * @static * @public * @memberOf jsPDF * @name API * * @example * jsPDF.API.mymethod = function(){ * // 'this' will be ref to internal API object. see jsPDF source * // , so you can refer to built-in methods like so: * // this.line(....) * // this.text(....) * } * var pdfdoc = new jsPDF() * pdfdoc.mymethod() // <- !!!!!! */ jsPDF.API = {events: []}; jsPDF.version = "1.0.0-trunk"; if (typeof define === 'function' && define.amd) { define('jsPDF', function () { return jsPDF; }); } else if (typeof module !== 'undefined' && module.exports) { module.exports = jsPDF; } else { global.jsPDF = jsPDF; } return jsPDF; }(typeof self !== "undefined" && self || typeof window !== "undefined" && window || this)); ; /*! @source http://purl.eligrey.com/github/FileSaver.js/blob/master/FileSaver.js */ var saveAs=saveAs||navigator.msSaveBlob&&navigator.msSaveBlob.bind(navigator)||function(a){"use strict";var b=a.document,c=function(){return a.URL||a.webkitURL||a},d=a.URL||a.webkitURL||a,e=b.createElementNS("http://www.w3.org/1999/xhtml","a"),f="download"in e,g=function(c){var d=b.createEvent("MouseEvents");return d.initMouseEvent("click",!0,!1,a,0,0,0,0,0,!1,!1,!1,!1,0,null),c.dispatchEvent(d)},h=a.webkitRequestFileSystem,i=a.requestFileSystem||h||a.mozRequestFileSystem,j=function(b){(a.setImmediate||a.setTimeout)(function(){throw b},0)},k="application/octet-stream",l=0,m=[],n=function(){for(var a=m.length;a--;){var b=m[a];"string"==typeof b?d.revokeObjectURL(b):b.remove()}m.length=0},o=function(a,b,c){b=[].concat(b);for(var d=b.length;d--;){var e=a["on"+b[d]];if("function"==typeof e)try{e.call(a,c||a)}catch(f){j(f)}}},p=function(b,d){var q,r,x,j=this,n=b.type,p=!1,s=function(){var a=c().createObjectURL(b);return m.push(a),a},t=function(){o(j,"writestart progress write writeend".split(" "))},u=function(){(p||!q)&&(q=s(b)),r&&(r.location.href=q),j.readyState=j.DONE,t()},v=function(a){return function(){return j.readyState!==j.DONE?a.apply(this,arguments):void 0}},w={create:!0,exclusive:!1};return j.readyState=j.INIT,d||(d="download"),f&&(q=s(b),e.href=q,e.download=d,g(e))?(j.readyState=j.DONE,t(),void 0):(a.chrome&&n&&n!==k&&(x=b.slice||b.webkitSlice,b=x.call(b,0,b.size,k),p=!0),h&&"download"!==d&&(d+=".download"),r=n===k||h?a:a.open(),i?(l+=b.size,i(a.TEMPORARY,l,v(function(a){a.root.getDirectory("saved",w,v(function(a){var c=function(){a.getFile(d,w,v(function(a){a.createWriter(v(function(c){c.onwriteend=function(b){r.location.href=a.toURL(),m.push(a),j.readyState=j.DONE,o(j,"writeend",b)},c.onerror=function(){var a=c.error;a.code!==a.ABORT_ERR&&u()},"writestart progress write abort".split(" ").forEach(function(a){c["on"+a]=j["on"+a]}),c.write(b),j.abort=function(){c.abort(),j.readyState=j.DONE},j.readyState=j.WRITING}),u)}),u)};a.getFile(d,{create:!1},v(function(a){a.remove(),c()}),v(function(a){a.code===a.NOT_FOUND_ERR?c():u()}))}),u)}),u),void 0):(u(),void 0))},q=p.prototype,r=function(a,b){return new p(a,b)};return q.abort=function(){var a=this;a.readyState=a.DONE,o(a,"abort")},q.readyState=q.INIT=0,q.WRITING=1,q.DONE=2,q.error=q.onwritestart=q.onprogress=q.onwrite=q.onabort=q.onerror=q.onwriteend=null,a.addEventListener("unload",n,!1),r}(self); ; /* Blob.js * A Blob implementation. * 2014-07-24 * * By Eli Grey, http://eligrey.com * By Devin Samarin, https://github.com/dsamarin * License: MIT * See https://github.com/eligrey/Blob.js/blob/master/LICENSE.md */ /*global self, unescape */ /*jslint bitwise: true, regexp: true, confusion: true, es5: true, vars: true, white: true, plusplus: true */ /*! @source http://purl.eligrey.com/github/Blob.js/blob/master/Blob.js */ (function (view) { "use strict"; view.URL = view.URL || view.webkitURL; if (view.Blob && view.URL) { try { new Blob; return; } catch (e) {} } // Internally we use a BlobBuilder implementation to base Blob off of // in order to support older browsers that only have BlobBuilder var BlobBuilder = view.BlobBuilder || view.WebKitBlobBuilder || view.MozBlobBuilder || (function(view) { var get_class = function(object) { return Object.prototype.toString.call(object).match(/^\[object\s(.*)\]$/)[1]; } , FakeBlobBuilder = function BlobBuilder() { this.data = []; } , FakeBlob = function Blob(data, type, encoding) { this.data = data; this.size = data.length; this.type = type; this.encoding = encoding; } , FBB_proto = FakeBlobBuilder.prototype , FB_proto = FakeBlob.prototype , FileReaderSync = view.FileReaderSync , FileException = function(type) { this.code = this[this.name = type]; } , file_ex_codes = ( "NOT_FOUND_ERR SECURITY_ERR ABORT_ERR NOT_READABLE_ERR ENCODING_ERR " + "NO_MODIFICATION_ALLOWED_ERR INVALID_STATE_ERR SYNTAX_ERR" ).split(" ") , file_ex_code = file_ex_codes.length , real_URL = view.URL || view.webkitURL || view , real_create_object_URL = real_URL.createObjectURL , real_revoke_object_URL = real_URL.revokeObjectURL , URL = real_URL , btoa = view.btoa , atob = view.atob , ArrayBuffer = view.ArrayBuffer , Uint8Array = view.Uint8Array , origin = /^[\w-]+:\/*\[?[\w\.:-]+\]?(?::[0-9]+)?/ ; FakeBlob.fake = FB_proto.fake = true; while (file_ex_code--) { FileException.prototype[file_ex_codes[file_ex_code]] = file_ex_code + 1; } // Polyfill URL if (!real_URL.createObjectURL) { URL = view.URL = function(uri) { var uri_info = document.createElementNS("http://www.w3.org/1999/xhtml", "a") , uri_origin ; uri_info.href = uri; if (!("origin" in uri_info)) { if (uri_info.protocol.toLowerCase() === "data:") { uri_info.origin = null; } else { uri_origin = uri.match(origin); uri_info.origin = uri_origin && uri_origin[1]; } } return uri_info; }; } URL.createObjectURL = function(blob) { var type = blob.type , data_URI_header ; if (type === null) { type = "application/octet-stream"; } if (blob instanceof FakeBlob) { data_URI_header = "data:" + type; if (blob.encoding === "base64") { return data_URI_header + ";base64," + blob.data; } else if (blob.encoding === "URI") { return data_URI_header + "," + decodeURIComponent(blob.data); } if (btoa) { return data_URI_header + ";base64," + btoa(blob.data); } else { return data_URI_header + "," + encodeURIComponent(blob.data); } } else if (real_create_object_URL) { return real_create_object_URL.call(real_URL, blob); } }; URL.revokeObjectURL = function(object_URL) { if (object_URL.substring(0, 5) !== "data:" && real_revoke_object_URL) { real_revoke_object_URL.call(real_URL, object_URL); } }; FBB_proto.append = function(data/*, endings*/) { var bb = this.data; // decode data to a binary string if (Uint8Array && (data instanceof ArrayBuffer || data instanceof Uint8Array)) { var str = "" , buf = new Uint8Array(data) , i = 0 , buf_len = buf.length ; for (; i < buf_len; i++) { str += String.fromCharCode(buf[i]); } bb.push(str); } else if (get_class(data) === "Blob" || get_class(data) === "File") { if (FileReaderSync) { var fr = new FileReaderSync; bb.push(fr.readAsBinaryString(data)); } else { // async FileReader won't work as BlobBuilder is sync throw new FileException("NOT_READABLE_ERR"); } } else if (data instanceof FakeBlob) { if (data.encoding === "base64" && atob) { bb.push(atob(data.data)); } else if (data.encoding === "URI") { bb.push(decodeURIComponent(data.data)); } else if (data.encoding === "raw") { bb.push(data.data); } } else { if (typeof data !== "string") { data += ""; // convert unsupported types to strings } // decode UTF-16 to binary string bb.push(unescape(encodeURIComponent(data))); } }; FBB_proto.getBlob = function(type) { if (!arguments.length) { type = null; } return new FakeBlob(this.data.join(""), type, "raw"); }; FBB_proto.toString = function() { return "[object BlobBuilder]"; }; FB_proto.slice = function(start, end, type) { var args = arguments.length; if (args < 3) { type = null; } return new FakeBlob( this.data.slice(start, args > 1 ? end : this.data.length) , type , this.encoding ); }; FB_proto.toString = function() { return "[object Blob]"; }; FB_proto.close = function() { this.size = 0; delete this.data; }; return FakeBlobBuilder; }(view)); view.Blob = function(blobParts, options) { var type = options ? (options.type || "") : ""; var builder = new BlobBuilder(); if (blobParts) { for (var i = 0, len = blobParts.length; i < len; i++) { if (Uint8Array && blobParts[i] instanceof Uint8Array) { builder.append(blobParts[i].buffer); } else { builder.append(blobParts[i]); } } } var blob = builder.getBlob(type); if (!blob.slice && blob.webkitSlice) { blob.slice = blob.webkitSlice; } return blob; }; var getPrototypeOf = Object.getPrototypeOf || function(object) { return object.__proto__; }; view.Blob.prototype = getPrototypeOf(new view.Blob()); }(typeof self !== "undefined" && self || typeof window !== "undefined" && window || this.content || this)); ; /* Copyright (c) 2013 Gildas Lormeau. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. The names of the authors may not be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT, INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ /* * This program is based on JZlib 1.0.2 ymnk, JCraft,Inc. * JZlib is based on zlib-1.1.3, so all credit should go authors * Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu) * and contributors of zlib. */ // Global var MAX_BITS = 15; var D_CODES = 30; var BL_CODES = 19; var LENGTH_CODES = 29; var LITERALS = 256; var L_CODES = (LITERALS + 1 + LENGTH_CODES); var HEAP_SIZE = (2 * L_CODES + 1); var END_BLOCK = 256; // Bit length codes must not exceed MAX_BL_BITS bits var MAX_BL_BITS = 7; // repeat previous bit length 3-6 times (2 bits of repeat count) var REP_3_6 = 16; // repeat a zero length 3-10 times (3 bits of repeat count) var REPZ_3_10 = 17; // repeat a zero length 11-138 times (7 bits of repeat count) var REPZ_11_138 = 18; // The lengths of the bit length codes are sent in order of decreasing // probability, to avoid transmitting the lengths for unused bit // length codes. var Buf_size = 8 * 2; // JZlib version : "1.0.2" var Z_DEFAULT_COMPRESSION = -1; // compression strategy var Z_FILTERED = 1; var Z_HUFFMAN_ONLY = 2; var Z_DEFAULT_STRATEGY = 0; var Z_NO_FLUSH = 0; var Z_PARTIAL_FLUSH = 1; var Z_FULL_FLUSH = 3; var Z_FINISH = 4; var Z_OK = 0; var Z_STREAM_END = 1; var Z_NEED_DICT = 2; var Z_STREAM_ERROR = -2; var Z_DATA_ERROR = -3; var Z_BUF_ERROR = -5; // Tree // see definition of array dist_code below var _dist_code = [ 0, 1, 2, 3, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 0, 0, 16, 17, 18, 18, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29 ]; function Tree() { 'use strict'; var that = this; // dyn_tree; // the dynamic tree // max_code; // largest code with non zero frequency // stat_desc; // the corresponding static tree // 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) { var tree = that.dyn_tree; var stree = that.stat_desc.static_tree; var extra = that.stat_desc.extra_bits; var base = that.stat_desc.extra_base; var max_length = that.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] = 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] * 2 + 1] + 1; if (bits > max_length) { bits = max_length; overflow++; } tree[n * 2 + 1] = bits; // We overwrite tree[n*2+1] which is no longer needed if (n > that.max_code) continue; // not a leaf node s.bl_count[bits]++; xbits = 0; if (n >= base) xbits = extra[n - base]; f = tree[n * 2]; s.opt_len += f * (bits + xbits); if (stree) s.static_len += f * (stree[n * 2 + 1] + xbits); } if (overflow === 0) return; // 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); for (bits = max_length; bits !== 0; bits--) { n = s.bl_count[bits]; while (n !== 0) { m = s.heap[--h]; if (m > that.max_code) continue; if (tree[m * 2 + 1] != bits) { s.opt_len += (bits - tree[m * 2 + 1]) * tree[m * 2]; tree[m * 2 + 1] = bits; } n--; } } } // 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, // the value to invert len // its bit length ) { var res = 0; do { res |= code & 1; code >>>= 1; res <<= 1; } while (--len > 0); return res >>> 1; } // 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, // the tree to decorate max_code, // largest code with non zero frequency bl_count // number of codes at each bit length ) { var next_code = []; // next code value for each // bit length var code = 0; // running code value var bits; // bit index var n; // code index var len; // 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<= 1; n--) s.pqdownheap(tree, n); // Construct the Huffman tree by repeatedly combining the least two // frequent nodes. node = elems; // next internal node of the tree do { // n = node of least frequency n = s.heap[1]; s.heap[1] = s.heap[s.heap_len--]; s.pqdownheap(tree, 1); m = s.heap[1]; // 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] = (tree[n * 2] + tree[m * 2]); s.depth[node] = Math.max(s.depth[n], s.depth[m]) + 1; tree[n * 2 + 1] = tree[m * 2 + 1] = node; // and insert the new node in the heap s.heap[1] = node++; s.pqdownheap(tree, 1); } while (s.heap_len >= 2); s.heap[--s.heap_max] = s.heap[1]; // At this point, the fields freq and dad are set. We can now // generate the bit lengths. gen_bitlen(s); // The field len is now set, we can generate the bit codes gen_codes(tree, that.max_code, s.bl_count); }; } Tree._length_code = [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28 ]; Tree.base_length = [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 20, 24, 28, 32, 40, 48, 56, 64, 80, 96, 112, 128, 160, 192, 224, 0 ]; Tree.base_dist = [ 0, 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 192, 256, 384, 512, 768, 1024, 1536, 2048, 3072, 4096, 6144, 8192, 12288, 16384, 24576 ]; // Mapping from a distance to a distance code. dist is the distance - 1 and // must not have side effects. _dist_code[256] and _dist_code[257] are never // used. Tree.d_code = function(dist) { return ((dist) < 256 ? _dist_code[dist] : _dist_code[256 + ((dist) >>> 7)]); }; // extra bits for each length code Tree.extra_lbits = [ 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 ]; // extra bits for each distance code Tree.extra_dbits = [ 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 ]; // extra bits for each bit length code Tree.extra_blbits = [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7 ]; Tree.bl_order = [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]; // StaticTree function StaticTree(static_tree, extra_bits, extra_base, elems, max_length) { var that = this; that.static_tree = static_tree; that.extra_bits = extra_bits; that.extra_base = extra_base; that.elems = elems; that.max_length = max_length; } StaticTree.static_ltree = [ 12, 8, 140, 8, 76, 8, 204, 8, 44, 8, 172, 8, 108, 8, 236, 8, 28, 8, 156, 8, 92, 8, 220, 8, 60, 8, 188, 8, 124, 8, 252, 8, 2, 8, 130, 8, 66, 8, 194, 8, 34, 8, 162, 8, 98, 8, 226, 8, 18, 8, 146, 8, 82, 8, 210, 8, 50, 8, 178, 8, 114, 8, 242, 8, 10, 8, 138, 8, 74, 8, 202, 8, 42, 8, 170, 8, 106, 8, 234, 8, 26, 8, 154, 8, 90, 8, 218, 8, 58, 8, 186, 8, 122, 8, 250, 8, 6, 8, 134, 8, 70, 8, 198, 8, 38, 8, 166, 8, 102, 8, 230, 8, 22, 8, 150, 8, 86, 8, 214, 8, 54, 8, 182, 8, 118, 8, 246, 8, 14, 8, 142, 8, 78, 8, 206, 8, 46, 8, 174, 8, 110, 8, 238, 8, 30, 8, 158, 8, 94, 8, 222, 8, 62, 8, 190, 8, 126, 8, 254, 8, 1, 8, 129, 8, 65, 8, 193, 8, 33, 8, 161, 8, 97, 8, 225, 8, 17, 8, 145, 8, 81, 8, 209, 8, 49, 8, 177, 8, 113, 8, 241, 8, 9, 8, 137, 8, 73, 8, 201, 8, 41, 8, 169, 8, 105, 8, 233, 8, 25, 8, 153, 8, 89, 8, 217, 8, 57, 8, 185, 8, 121, 8, 249, 8, 5, 8, 133, 8, 69, 8, 197, 8, 37, 8, 165, 8, 101, 8, 229, 8, 21, 8, 149, 8, 85, 8, 213, 8, 53, 8, 181, 8, 117, 8, 245, 8, 13, 8, 141, 8, 77, 8, 205, 8, 45, 8, 173, 8, 109, 8, 237, 8, 29, 8, 157, 8, 93, 8, 221, 8, 61, 8, 189, 8, 125, 8, 253, 8, 19, 9, 275, 9, 147, 9, 403, 9, 83, 9, 339, 9, 211, 9, 467, 9, 51, 9, 307, 9, 179, 9, 435, 9, 115, 9, 371, 9, 243, 9, 499, 9, 11, 9, 267, 9, 139, 9, 395, 9, 75, 9, 331, 9, 203, 9, 459, 9, 43, 9, 299, 9, 171, 9, 427, 9, 107, 9, 363, 9, 235, 9, 491, 9, 27, 9, 283, 9, 155, 9, 411, 9, 91, 9, 347, 9, 219, 9, 475, 9, 59, 9, 315, 9, 187, 9, 443, 9, 123, 9, 379, 9, 251, 9, 507, 9, 7, 9, 263, 9, 135, 9, 391, 9, 71, 9, 327, 9, 199, 9, 455, 9, 39, 9, 295, 9, 167, 9, 423, 9, 103, 9, 359, 9, 231, 9, 487, 9, 23, 9, 279, 9, 151, 9, 407, 9, 87, 9, 343, 9, 215, 9, 471, 9, 55, 9, 311, 9, 183, 9, 439, 9, 119, 9, 375, 9, 247, 9, 503, 9, 15, 9, 271, 9, 143, 9, 399, 9, 79, 9, 335, 9, 207, 9, 463, 9, 47, 9, 303, 9, 175, 9, 431, 9, 111, 9, 367, 9, 239, 9, 495, 9, 31, 9, 287, 9, 159, 9, 415, 9, 95, 9, 351, 9, 223, 9, 479, 9, 63, 9, 319, 9, 191, 9, 447, 9, 127, 9, 383, 9, 255, 9, 511, 9, 0, 7, 64, 7, 32, 7, 96, 7, 16, 7, 80, 7, 48, 7, 112, 7, 8, 7, 72, 7, 40, 7, 104, 7, 24, 7, 88, 7, 56, 7, 120, 7, 4, 7, 68, 7, 36, 7, 100, 7, 20, 7, 84, 7, 52, 7, 116, 7, 3, 8, 131, 8, 67, 8, 195, 8, 35, 8, 163, 8, 99, 8, 227, 8 ]; StaticTree.static_dtree = [ 0, 5, 16, 5, 8, 5, 24, 5, 4, 5, 20, 5, 12, 5, 28, 5, 2, 5, 18, 5, 10, 5, 26, 5, 6, 5, 22, 5, 14, 5, 30, 5, 1, 5, 17, 5, 9, 5, 25, 5, 5, 5, 21, 5, 13, 5, 29, 5, 3, 5, 19, 5, 11, 5, 27, 5, 7, 5, 23, 5 ]; StaticTree.static_l_desc = new StaticTree(StaticTree.static_ltree, Tree.extra_lbits, LITERALS + 1, L_CODES, MAX_BITS); StaticTree.static_d_desc = new StaticTree(StaticTree.static_dtree, Tree.extra_dbits, 0, D_CODES, MAX_BITS); StaticTree.static_bl_desc = new StaticTree(null, Tree.extra_blbits, 0, BL_CODES, MAX_BL_BITS); // Deflate var MAX_MEM_LEVEL = 9; var DEF_MEM_LEVEL = 8; function Config(good_length, max_lazy, nice_length, max_chain, func) { var that = this; that.good_length = good_length; that.max_lazy = max_lazy; that.nice_length = nice_length; that.max_chain = max_chain; that.func = func; } var STORED = 0; var FAST = 1; var SLOW = 2; var config_table = [ new Config(0, 0, 0, 0, STORED), new Config(4, 4, 8, 4, FAST), new Config(4, 5, 16, 8, FAST), new Config(4, 6, 32, 32, FAST), new Config(4, 4, 16, 16, SLOW), new Config(8, 16, 32, 32, SLOW), new Config(8, 16, 128, 128, SLOW), new Config(8, 32, 128, 256, SLOW), new Config(32, 128, 258, 1024, SLOW), new Config(32, 258, 258, 4096, SLOW) ]; var z_errmsg = [ "need dictionary", // Z_NEED_DICT // 2 "stream end", // Z_STREAM_END 1 "", // Z_OK 0 "", // Z_ERRNO (-1) "stream error", // Z_STREAM_ERROR (-2) "data error", // Z_DATA_ERROR (-3) "", // Z_MEM_ERROR (-4) "buffer error", // Z_BUF_ERROR (-5) "",// Z_VERSION_ERROR (-6) "" ]; // block not completed, need more input or more output var NeedMore = 0; // block flush performed var BlockDone = 1; // finish started, need only more output at next deflate var FinishStarted = 2; // finish done, accept no more input or output var FinishDone = 3; // preset dictionary flag in zlib header var PRESET_DICT = 0x20; var INIT_STATE = 42; var BUSY_STATE = 113; var FINISH_STATE = 666; // The deflate compression method var Z_DEFLATED = 8; var STORED_BLOCK = 0; var STATIC_TREES = 1; var DYN_TREES = 2; var MIN_MATCH = 3; var MAX_MATCH = 258; var MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1); function smaller(tree, n, m, depth) { var tn2 = tree[n * 2]; var tm2 = tree[m * 2]; return (tn2 < tm2 || (tn2 == tm2 && depth[n] <= depth[m])); } function Deflate() { var that = this; var strm; // pointer back to this zlib stream var status; // as the name implies // pending_buf; // output still pending var pending_buf_size; // size of pending_buf // pending_out; // next pending byte to output to the stream // pending; // nb of bytes in the pending buffer var method; // STORED (for zip only) or DEFLATED var last_flush; // value of flush param for previous deflate call var w_size; // LZ77 window size (32K by default) var w_bits; // log2(w_size) (8..16) var w_mask; // w_size - 1 var window; // 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. Also, it limits // the window size to 64K, which is quite useful on MSDOS. // To do: use the user input buffer as sliding window. var window_size; // Actual size of window: 2*wSize, except when the user input buffer // is directly used as sliding window. var prev; // 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. var head; // Heads of the hash chains or NIL. var ins_h; // hash index of string to be inserted var hash_size; // number of elements in hash table var hash_bits; // log2(hash_size) var hash_mask; // hash_size-1 // 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 var hash_shift; // Window position at the beginning of the current output block. Gets // negative when the window is moved backwards. var block_start; var match_length; // length of best match var prev_match; // previous match var match_available; // set if previous match exists var strstart; // start of string to insert var match_start; // start of matching string var lookahead; // number of valid bytes ahead in window // Length of the best match at previous step. Matches not greater than this // are discarded. This is used in the lazy match evaluation. var prev_length; // To speed up deflation, hash chains are never searched beyond this // length. A higher limit improves compression ratio but degrades the speed. var max_chain_length; // 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. var max_lazy_match; // 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. var level; // compression level (1..9) var strategy; // favor or force Huffman coding // Use a faster search when the previous match is longer than this var good_match; // Stop searching when current match exceeds this var nice_match; var dyn_ltree; // literal and length tree var dyn_dtree; // distance tree var bl_tree; // Huffman tree for bit lengths var l_desc = new Tree(); // desc for literal tree var d_desc = new Tree(); // desc for distance tree var bl_desc = new Tree(); // desc for bit length tree // that.heap_len; // number of elements in the heap // that.heap_max; // 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. // Depth of each subtree used as tie breaker for trees of equal frequency that.depth = []; var l_buf; // index for literals or lengths */ // 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 var lit_bufsize; var last_lit; // running index in l_buf // Buffer 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. var d_buf; // index of pendig_buf // that.opt_len; // bit length of current block with optimal trees // that.static_len; // bit length of current block with static trees var matches; // number of string matches in current block var last_eob_len; // bit length of EOB code for last block // Output buffer. bits are inserted starting at the bottom (least // significant bits). var bi_buf; // Number of valid bits in bi_buf. All bits above the last valid bit // are always zero. var bi_valid; // number of codes at each bit length for an optimal tree that.bl_count = []; // heap used to build the Huffman trees that.heap = []; dyn_ltree = []; dyn_dtree = []; bl_tree = []; function lm_init() { var i; window_size = 2 * w_size; head[hash_size - 1] = 0; for (i = 0; i < hash_size - 1; i++) { head[i] = 0; } // Set the default configuration parameters: max_lazy_match = config_table[level].max_lazy; good_match = config_table[level].good_length; nice_match = config_table[level].nice_length; max_chain_length = config_table[level].max_chain; strstart = 0; block_start = 0; lookahead = 0; match_length = prev_length = MIN_MATCH - 1; match_available = 0; ins_h = 0; } function init_block() { var i; // Initialize the trees. for (i = 0; i < L_CODES; i++) dyn_ltree[i * 2] = 0; for (i = 0; i < D_CODES; i++) dyn_dtree[i * 2] = 0; for (i = 0; i < BL_CODES; i++) bl_tree[i * 2] = 0; dyn_ltree[END_BLOCK * 2] = 1; that.opt_len = that.static_len = 0; last_lit = matches = 0; } // Initialize the tree data structures for a new zlib stream. function tr_init() { l_desc.dyn_tree = dyn_ltree; l_desc.stat_desc = StaticTree.static_l_desc; d_desc.dyn_tree = dyn_dtree; d_desc.stat_desc = StaticTree.static_d_desc; bl_desc.dyn_tree = bl_tree; bl_desc.stat_desc = StaticTree.static_bl_desc; bi_buf = 0; bi_valid = 0; last_eob_len = 8; // enough lookahead for inflate // Initialize the first block of the first file: init_block(); } // 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). that.pqdownheap = function(tree, // the tree to restore k // node to move down ) { var heap = that.heap; var v = heap[k]; var j = k << 1; // left son of k while (j <= that.heap_len) { // Set j to the smallest of the two sons: if (j < that.heap_len && smaller(tree, heap[j + 1], heap[j], that.depth)) { j++; } // Exit if v is smaller than both sons if (smaller(tree, v, heap[j], that.depth)) break; // Exchange v with the smallest son heap[k] = heap[j]; k = j; // And continue down the tree, setting j to the left son of k j <<= 1; } heap[k] = v; }; // Scan a literal or distance tree to determine the frequencies of the codes // in the bit length tree. function scan_tree(tree,// the tree to be scanned 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]; // 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] = 0xffff; // guard for (n = 0; n <= max_code; n++) { curlen = nextlen; nextlen = tree[(n + 1) * 2 + 1]; if (++count < max_count && curlen == nextlen) { continue; } else if (count < min_count) { bl_tree[curlen * 2] += count; } else if (curlen !== 0) { if (curlen != prevlen) bl_tree[curlen * 2]++; bl_tree[REP_3_6 * 2]++; } else if (count <= 10) { bl_tree[REPZ_3_10 * 2]++; } else { bl_tree[REPZ_11_138 * 2]++; } 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() { 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(dyn_ltree, l_desc.max_code); scan_tree(dyn_dtree, d_desc.max_code); // Build the bit length tree: bl_desc.build_tree(that); // 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 (bl_tree[Tree.bl_order[max_blindex] * 2 + 1] !== 0) break; } // Update opt_len to include the bit length tree and counts that.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; return max_blindex; } // Output a byte on the stream. // IN assertion: there is enough room in pending_buf. function put_byte(p) { that.pending_buf[that.pending++] = p; } function put_short(w) { put_byte(w & 0xff); put_byte((w >>> 8) & 0xff); } function putShortMSB(b) { put_byte((b >> 8) & 0xff); put_byte((b & 0xff) & 0xff); } function send_bits(value, length) { var val, len = length; if (bi_valid > Buf_size - len) { val = value; // bi_buf |= (val << bi_valid); bi_buf |= ((val << bi_valid) & 0xffff); put_short(bi_buf); bi_buf = val >>> (Buf_size - bi_valid); bi_valid += len - Buf_size; } else { // bi_buf |= (value) << bi_valid; bi_buf |= (((value) << bi_valid) & 0xffff); bi_valid += len; } } function send_code(c, tree) { var c2 = c * 2; send_bits(tree[c2] & 0xffff, tree[c2 + 1] & 0xffff); } // Send a literal or distance tree in compressed form, using the codes in // bl_tree. function send_tree(tree,// the tree to be sent 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]; // 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; } for (n = 0; n <= max_code; n++) { curlen = nextlen; nextlen = tree[(n + 1) * 2 + 1]; if (++count < max_count && curlen == nextlen) { continue; } else if (count < min_count) { do { send_code(curlen, bl_tree); } while (--count !== 0); } else if (curlen !== 0) { if (curlen != prevlen) { send_code(curlen, bl_tree); count--; } send_code(REP_3_6, bl_tree); send_bits(count - 3, 2); } else if (count <= 10) { send_code(REPZ_3_10, bl_tree); send_bits(count - 3, 3); } else { send_code(REPZ_11_138, bl_tree); send_bits(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; } } } // 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(lcodes, dcodes, blcodes) { var rank; // index in bl_order send_bits(lcodes - 257, 5); // not +255 as stated in appnote.txt send_bits(dcodes - 1, 5); send_bits(blcodes - 4, 4); // not -3 as stated in appnote.txt for (rank = 0; rank < blcodes; rank++) { send_bits(bl_tree[Tree.bl_order[rank] * 2 + 1], 3); } send_tree(dyn_ltree, lcodes - 1); // literal tree send_tree(dyn_dtree, dcodes - 1); // distance tree } // Flush the bit buffer, keeping at most 7 bits in it. function bi_flush() { if (bi_valid == 16) { put_short(bi_buf); bi_buf = 0; bi_valid = 0; } else if (bi_valid >= 8) { put_byte(bi_buf & 0xff); bi_buf >>>= 8; bi_valid -= 8; } } // Send one empty static block to give enough lookahead for inflate. // This takes 10 bits, of which 7 may remain in the bit buffer. // The current inflate code requires 9 bits of lookahead. If the // last two codes for the previous block (real code plus EOB) were coded // on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode // the last real code. In this case we send two empty static blocks instead // of one. (There are no problems if the previous block is stored or fixed.) // To simplify the code, we assume the worst case of last real code encoded // on one bit only. function _tr_align() { send_bits(STATIC_TREES << 1, 3); send_code(END_BLOCK, StaticTree.static_ltree); bi_flush(); // Of the 10 bits for the empty block, we have already sent // (10 - bi_valid) bits. The lookahead for the last real code (before // the EOB of the previous block) was thus at least one plus the length // of the EOB plus what we have just sent of the empty static block. if (1 + last_eob_len + 10 - bi_valid < 9) { send_bits(STATIC_TREES << 1, 3); send_code(END_BLOCK, StaticTree.static_ltree); bi_flush(); } last_eob_len = 7; } // Save the match info and tally the frequency counts. Return true if // the current block must be flushed. function _tr_tally(dist, // distance of matched string lc // match length-MIN_MATCH or unmatched char (if dist==0) ) { var out_length, in_length, dcode; that.pending_buf[d_buf + last_lit * 2] = (dist >>> 8) & 0xff; that.pending_buf[d_buf + last_lit * 2 + 1] = dist & 0xff; that.pending_buf[l_buf + last_lit] = lc & 0xff; last_lit++; if (dist === 0) { // lc is the unmatched char dyn_ltree[lc * 2]++; } else { matches++; // Here, lc is the match length - MIN_MATCH dist--; // dist = match distance - 1 dyn_ltree[(Tree._length_code[lc] + LITERALS + 1) * 2]++; dyn_dtree[Tree.d_code(dist) * 2]++; } if ((last_lit & 0x1fff) === 0 && level > 2) { // Compute an upper bound for the compressed length out_length = last_lit * 8; in_length = strstart - block_start; for (dcode = 0; dcode < D_CODES; dcode++) { out_length += dyn_dtree[dcode * 2] * (5 + Tree.extra_dbits[dcode]); } out_length >>>= 3; if ((matches < Math.floor(last_lit / 2)) && out_length < Math.floor(in_length / 2)) return true; } return (last_lit == 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. } // Send the block data compressed using the given Huffman trees function compress_block(ltree, dtree) { 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 (last_lit !== 0) { do { dist = ((that.pending_buf[d_buf + lx * 2] << 8) & 0xff00) | (that.pending_buf[d_buf + lx * 2 + 1] & 0xff); lc = (that.pending_buf[l_buf + lx]) & 0xff; lx++; if (dist === 0) { send_code(lc, ltree); // send a literal byte } else { // Here, lc is the match length - MIN_MATCH code = Tree._length_code[lc]; send_code(code + LITERALS + 1, ltree); // send the length // code extra = Tree.extra_lbits[code]; if (extra !== 0) { lc -= Tree.base_length[code]; send_bits(lc, extra); // send the extra length bits } dist--; // dist is now the match distance - 1 code = Tree.d_code(dist); send_code(code, dtree); // send the distance code extra = Tree.extra_dbits[code]; if (extra !== 0) { dist -= Tree.base_dist[code]; send_bits(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: } while (lx < last_lit); } send_code(END_BLOCK, ltree); last_eob_len = ltree[END_BLOCK * 2 + 1]; } // Flush the bit buffer and align the output on a byte boundary function bi_windup() { if (bi_valid > 8) { put_short(bi_buf); } else if (bi_valid > 0) { put_byte(bi_buf & 0xff); } bi_buf = 0; bi_valid = 0; } // Copy a stored block, storing first the length and its // one's complement if requested. function copy_block(buf, // the input data len, // its length header // true if block header must be written ) { bi_windup(); // align on byte boundary last_eob_len = 8; // enough lookahead for inflate if (header) { put_short(len); put_short(~len); } that.pending_buf.set(window.subarray(buf, buf + len), that.pending); that.pending += len; } // Send a stored block function _tr_stored_block(buf, // input block stored_len, // length of input block eof // true if this is the last block for a file ) { send_bits((STORED_BLOCK << 1) + (eof ? 1 : 0), 3); // send block type copy_block(buf, stored_len, true); // with header } // 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(buf, // input block, or NULL if too old stored_len, // length of input block eof // true 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 (level > 0) { // Construct the literal and distance trees l_desc.build_tree(that); d_desc.build_tree(that); // 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(); // Determine the best encoding. Compute first the block length in // bytes opt_lenb = (that.opt_len + 3 + 7) >>> 3; static_lenb = (that.static_len + 3 + 7) >>> 3; if (static_lenb <= opt_lenb) opt_lenb = static_lenb; } else { 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(buf, stored_len, eof); } else if (static_lenb == opt_lenb) { send_bits((STATIC_TREES << 1) + (eof ? 1 : 0), 3); compress_block(StaticTree.static_ltree, StaticTree.static_dtree); } else { send_bits((DYN_TREES << 1) + (eof ? 1 : 0), 3); send_all_trees(l_desc.max_code + 1, d_desc.max_code + 1, max_blindex + 1); compress_block(dyn_ltree, dyn_dtree); } // The above check is made mod 2^32, for files larger than 512 MB // and uLong implemented on 32 bits. init_block(); if (eof) { bi_windup(); } } function flush_block_only(eof) { _tr_flush_block(block_start >= 0 ? block_start : -1, strstart - block_start, eof); block_start = strstart; strm.flush_pending(); } // 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() { var n, m; var p; var more; // Amount of free space at the end of the window. do { more = (window_size - lookahead - strstart); // Deal with !@#$% 64K limit: if (more === 0 && strstart === 0 && lookahead === 0) { more = w_size; } else if (more == -1) { // Very unlikely, but possible on 16 bit machine if strstart == // 0 // and lookahead == 1 (input done one 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. } else if (strstart >= w_size + w_size - MIN_LOOKAHEAD) { window.set(window.subarray(w_size, w_size + w_size), 0); match_start -= w_size; strstart -= w_size; // we now have strstart >= MAX_DIST 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 = hash_size; p = n; do { m = (head[--p] & 0xffff); head[p] = (m >= w_size ? m - w_size : 0); } while (--n !== 0); n = w_size; p = n; do { m = (prev[--p] & 0xffff); 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 !== 0); more += w_size; } if (strm.avail_in === 0) return; // 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. n = strm.read_buf(window, strstart + lookahead, more); lookahead += n; // Initialize the hash value now that we have some input: if (lookahead >= MIN_MATCH) { ins_h = window[strstart] & 0xff; ins_h = (((ins_h) << hash_shift) ^ (window[strstart + 1] & 0xff)) & hash_mask; } // 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 (lookahead < MIN_LOOKAHEAD && strm.avail_in !== 0); } // 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(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; var max_start; if (max_block_size > pending_buf_size - 5) { max_block_size = pending_buf_size - 5; } // Copy as much as possible from input to output: while (true) { // Fill the window as much as possible: if (lookahead <= 1) { fill_window(); if (lookahead === 0 && flush == Z_NO_FLUSH) return NeedMore; if (lookahead === 0) break; // flush the current block } strstart += lookahead; lookahead = 0; // Emit a stored block if pending_buf will be full: max_start = block_start + max_block_size; if (strstart === 0 || strstart >= max_start) { // strstart === 0 is possible when wraparound on 16-bit machine lookahead = (strstart - max_start); strstart = max_start; flush_block_only(false); if (strm.avail_out === 0) return NeedMore; } // Flush if we may have to slide, otherwise block_start may become // negative and the data will be gone: if (strstart - block_start >= w_size - MIN_LOOKAHEAD) { flush_block_only(false); if (strm.avail_out === 0) return NeedMore; } } flush_block_only(flush == Z_FINISH); if (strm.avail_out === 0) return (flush == Z_FINISH) ? FinishStarted : NeedMore; return flush == Z_FINISH ? FinishDone : BlockDone; } function longest_match(cur_match) { var chain_length = max_chain_length; // max hash chain length var scan = strstart; // current string var match; // matched string var len; // length of current match var best_len = prev_length; // best match length so far var limit = strstart > (w_size - MIN_LOOKAHEAD) ? strstart - (w_size - MIN_LOOKAHEAD) : 0; var _nice_match = nice_match; // Stop when cur_match becomes <= limit. To simplify the code, // we prevent matches with the string of window index 0. var wmask = w_mask; var strend = strstart + MAX_MATCH; var scan_end1 = window[scan + best_len - 1]; var scan_end = window[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. // Do not waste too much time if we already have a good match: if (prev_length >= 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 > lookahead) _nice_match = lookahead; do { match = cur_match; // Skip to next match if the match length cannot increase // or if the match length is less than 2: if (window[match + best_len] != scan_end || window[match + best_len - 1] != scan_end1 || window[match] != window[scan] || window[++match] != window[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++; // We check for insufficient lookahead only every 8th comparison; // the 256th check will be made at strstart+258. do { } while (window[++scan] == window[++match] && window[++scan] == window[++match] && window[++scan] == window[++match] && window[++scan] == window[++match] && window[++scan] == window[++match] && window[++scan] == window[++match] && window[++scan] == window[++match] && window[++scan] == window[++match] && scan < strend); len = MAX_MATCH - (strend - scan); scan = strend - MAX_MATCH; if (len > best_len) { match_start = cur_match; best_len = len; if (len >= _nice_match) break; scan_end1 = window[scan + best_len - 1]; scan_end = window[scan + best_len]; } } while ((cur_match = (prev[cur_match & wmask] & 0xffff)) > limit && --chain_length !== 0); if (best_len <= lookahead) return best_len; return lookahead; } // 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(flush) { // short hash_head = 0; // head of the hash chain var hash_head = 0; // head of the hash chain var bflush; // set if current block must be flushed while (true) { // 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 (lookahead < MIN_LOOKAHEAD) { fill_window(); if (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) { return NeedMore; } if (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: if (lookahead >= MIN_MATCH) { ins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask; // prev[strstart&w_mask]=hash_head=head[ins_h]; hash_head = (head[ins_h] & 0xffff); prev[strstart & w_mask] = head[ins_h]; head[ins_h] = strstart; } // Find the longest match, discarding those <= prev_length. // At this point we have always match_length < MIN_MATCH if (hash_head !== 0 && ((strstart - hash_head) & 0xffff) <= 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). if (strategy != Z_HUFFMAN_ONLY) { match_length = longest_match(hash_head); } // longest_match() sets match_start } if (match_length >= MIN_MATCH) { // check_match(strstart, match_start, match_length); bflush = _tr_tally(strstart - match_start, match_length - MIN_MATCH); lookahead -= 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 (match_length <= max_lazy_match && lookahead >= MIN_MATCH) { match_length--; // string at strstart already in hash table do { strstart++; ins_h = ((ins_h << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask; // prev[strstart&w_mask]=hash_head=head[ins_h]; hash_head = (head[ins_h] & 0xffff); prev[strstart & w_mask] = head[ins_h]; head[ins_h] = strstart; // strstart never exceeds WSIZE-MAX_MATCH, so there are // always MIN_MATCH bytes ahead. } while (--match_length !== 0); strstart++; } else { strstart += match_length; match_length = 0; ins_h = window[strstart] & 0xff; ins_h = (((ins_h) << hash_shift) ^ (window[strstart + 1] & 0xff)) & hash_mask; // 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 bflush = _tr_tally(0, window[strstart] & 0xff); lookahead--; strstart++; } if (bflush) { flush_block_only(false); if (strm.avail_out === 0) return NeedMore; } } flush_block_only(flush == Z_FINISH); if (strm.avail_out === 0) { if (flush == Z_FINISH) return FinishStarted; else return NeedMore; } return flush == Z_FINISH ? FinishDone : BlockDone; } // 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(flush) { // short hash_head = 0; // head of hash chain var hash_head = 0; // head of hash chain var bflush; // set if current block must be flushed var max_insert; // Process the input block. while (true) { // 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 (lookahead < MIN_LOOKAHEAD) { fill_window(); if (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) { return NeedMore; } if (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: if (lookahead >= MIN_MATCH) { ins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask; // prev[strstart&w_mask]=hash_head=head[ins_h]; hash_head = (head[ins_h] & 0xffff); prev[strstart & w_mask] = head[ins_h]; head[ins_h] = strstart; } // Find the longest match, discarding those <= prev_length. prev_length = match_length; prev_match = match_start; match_length = MIN_MATCH - 1; if (hash_head !== 0 && prev_length < max_lazy_match && ((strstart - hash_head) & 0xffff) <= 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). if (strategy != Z_HUFFMAN_ONLY) { match_length = longest_match(hash_head); } // longest_match() sets match_start if (match_length <= 5 && (strategy == Z_FILTERED || (match_length == MIN_MATCH && strstart - match_start > 4096))) { // If prev_match is also MIN_MATCH, match_start is garbage // but we will ignore the current match anyway. 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 (prev_length >= MIN_MATCH && match_length <= prev_length) { max_insert = strstart + lookahead - MIN_MATCH; // Do not insert strings in hash table beyond this. // check_match(strstart-1, prev_match, prev_length); bflush = _tr_tally(strstart - 1 - prev_match, 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. lookahead -= prev_length - 1; prev_length -= 2; do { if (++strstart <= max_insert) { ins_h = (((ins_h) << hash_shift) ^ (window[(strstart) + (MIN_MATCH - 1)] & 0xff)) & hash_mask; // prev[strstart&w_mask]=hash_head=head[ins_h]; hash_head = (head[ins_h] & 0xffff); prev[strstart & w_mask] = head[ins_h]; head[ins_h] = strstart; } } while (--prev_length !== 0); match_available = 0; match_length = MIN_MATCH - 1; strstart++; if (bflush) { flush_block_only(false); if (strm.avail_out === 0) return NeedMore; } } else if (match_available !== 0) { // 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. bflush = _tr_tally(0, window[strstart - 1] & 0xff); if (bflush) { flush_block_only(false); } strstart++; lookahead--; if (strm.avail_out === 0) return NeedMore; } else { // There is no previous match to compare with, wait for // the next step to decide. match_available = 1; strstart++; lookahead--; } } if (match_available !== 0) { bflush = _tr_tally(0, window[strstart - 1] & 0xff); match_available = 0; } flush_block_only(flush == Z_FINISH); if (strm.avail_out === 0) { if (flush == Z_FINISH) return FinishStarted; else return NeedMore; } return flush == Z_FINISH ? FinishDone : BlockDone; } function deflateReset(strm) { strm.total_in = strm.total_out = 0; strm.msg = null; // that.pending = 0; that.pending_out = 0; status = BUSY_STATE; last_flush = Z_NO_FLUSH; tr_init(); lm_init(); return Z_OK; } that.deflateInit = function(strm, _level, bits, _method, memLevel, _strategy) { if (!_method) _method = Z_DEFLATED; if (!memLevel) memLevel = DEF_MEM_LEVEL; if (!_strategy) _strategy = Z_DEFAULT_STRATEGY; // byte[] my_version=ZLIB_VERSION; // // if (!version || version[0] != my_version[0] // || stream_size != sizeof(z_stream)) { // return Z_VERSION_ERROR; // } strm.msg = null; if (_level == Z_DEFAULT_COMPRESSION) _level = 6; if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || _method != Z_DEFLATED || bits < 9 || bits > 15 || _level < 0 || _level > 9 || _strategy < 0 || _strategy > Z_HUFFMAN_ONLY) { return Z_STREAM_ERROR; } strm.dstate = that; w_bits = bits; w_size = 1 << w_bits; w_mask = w_size - 1; hash_bits = memLevel + 7; hash_size = 1 << hash_bits; hash_mask = hash_size - 1; hash_shift = Math.floor((hash_bits + MIN_MATCH - 1) / MIN_MATCH); window = new Uint8Array(w_size * 2); prev = []; head = []; lit_bufsize = 1 << (memLevel + 6); // 16K elements by default // We overlay pending_buf and d_buf+l_buf. This works since the average // output size for (length,distance) codes is <= 24 bits. that.pending_buf = new Uint8Array(lit_bufsize * 4); pending_buf_size = lit_bufsize * 4; d_buf = Math.floor(lit_bufsize / 2); l_buf = (1 + 2) * lit_bufsize; level = _level; strategy = _strategy; method = _method & 0xff; return deflateReset(strm); }; that.deflateEnd = function() { if (status != INIT_STATE && status != BUSY_STATE && status != FINISH_STATE) { return Z_STREAM_ERROR; } // Deallocate in reverse order of allocations: that.pending_buf = null; head = null; prev = null; window = null; // free that.dstate = null; return status == BUSY_STATE ? Z_DATA_ERROR : Z_OK; }; that.deflateParams = function(strm, _level, _strategy) { var err = Z_OK; if (_level == Z_DEFAULT_COMPRESSION) { _level = 6; } if (_level < 0 || _level > 9 || _strategy < 0 || _strategy > Z_HUFFMAN_ONLY) { return Z_STREAM_ERROR; } if (config_table[level].func != config_table[_level].func && strm.total_in !== 0) { // Flush the last buffer: err = strm.deflate(Z_PARTIAL_FLUSH); } if (level != _level) { level = _level; max_lazy_match = config_table[level].max_lazy; good_match = config_table[level].good_length; nice_match = config_table[level].nice_length; max_chain_length = config_table[level].max_chain; } strategy = _strategy; return err; }; that.deflateSetDictionary = function(strm, dictionary, dictLength) { var length = dictLength; var n, index = 0; if (!dictionary || status != INIT_STATE) return Z_STREAM_ERROR; if (length < MIN_MATCH) return Z_OK; if (length > w_size - MIN_LOOKAHEAD) { length = w_size - MIN_LOOKAHEAD; index = dictLength - length; // use the tail of the dictionary } window.set(dictionary.subarray(index, index + length), 0); strstart = length; block_start = length; // Insert all strings in the hash table (except for the last two bytes). // s->lookahead stays null, so s->ins_h will be recomputed at the next // call of fill_window. ins_h = window[0] & 0xff; ins_h = (((ins_h) << hash_shift) ^ (window[1] & 0xff)) & hash_mask; for (n = 0; n <= length - MIN_MATCH; n++) { ins_h = (((ins_h) << hash_shift) ^ (window[(n) + (MIN_MATCH - 1)] & 0xff)) & hash_mask; prev[n & w_mask] = head[ins_h]; head[ins_h] = n; } return Z_OK; }; that.deflate = function(_strm, flush) { var i, header, level_flags, old_flush, bstate; if (flush > Z_FINISH || flush < 0) { return Z_STREAM_ERROR; } if (!_strm.next_out || (!_strm.next_in && _strm.avail_in !== 0) || (status == FINISH_STATE && flush != Z_FINISH)) { _strm.msg = z_errmsg[Z_NEED_DICT - (Z_STREAM_ERROR)]; return Z_STREAM_ERROR; } if (_strm.avail_out === 0) { _strm.msg = z_errmsg[Z_NEED_DICT - (Z_BUF_ERROR)]; return Z_BUF_ERROR; } strm = _strm; // just in case old_flush = last_flush; last_flush = flush; // Write the zlib header if (status == INIT_STATE) { header = (Z_DEFLATED + ((w_bits - 8) << 4)) << 8; level_flags = ((level - 1) & 0xff) >> 1; if (level_flags > 3) level_flags = 3; header |= (level_flags << 6); if (strstart !== 0) header |= PRESET_DICT; header += 31 - (header % 31); status = BUSY_STATE; putShortMSB(header); } // Flush as much pending output as possible if (that.pending !== 0) { strm.flush_pending(); if (strm.avail_out === 0) { // console.log(" 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: 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_BUFF_ERROR. } else if (strm.avail_in === 0 && flush <= old_flush && flush != Z_FINISH) { strm.msg = z_errmsg[Z_NEED_DICT - (Z_BUF_ERROR)]; return Z_BUF_ERROR; } // User must not provide more input after the first FINISH: if (status == FINISH_STATE && strm.avail_in !== 0) { _strm.msg = z_errmsg[Z_NEED_DICT - (Z_BUF_ERROR)]; return Z_BUF_ERROR; } // Start a new block or continue the current one. if (strm.avail_in !== 0 || lookahead !== 0 || (flush != Z_NO_FLUSH && status != FINISH_STATE)) { bstate = -1; switch (config_table[level].func) { case STORED: bstate = deflate_stored(flush); break; case FAST: bstate = deflate_fast(flush); break; case SLOW: bstate = deflate_slow(flush); break; default: } if (bstate == FinishStarted || bstate == FinishDone) { status = FINISH_STATE; } if (bstate == NeedMore || bstate == FinishStarted) { if (strm.avail_out === 0) { 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 == BlockDone) { if (flush == Z_PARTIAL_FLUSH) { _tr_align(); } else { // FULL_FLUSH or SYNC_FLUSH _tr_stored_block(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) { // state.head[s.hash_size-1]=0; for (i = 0; i < hash_size/*-1*/; i++) // forget history head[i] = 0; } } strm.flush_pending(); if (strm.avail_out === 0) { last_flush = -1; // avoid BUF_ERROR at next call, see above return Z_OK; } } } if (flush != Z_FINISH) return Z_OK; return Z_STREAM_END; }; } // ZStream function ZStream() { var that = this; that.next_in_index = 0; that.next_out_index = 0; // that.next_in; // next input byte that.avail_in = 0; // number of bytes available at next_in that.total_in = 0; // total nb of input bytes read so far // that.next_out; // next output byte should be put there that.avail_out = 0; // remaining free space at next_out that.total_out = 0; // total nb of bytes output so far // that.msg; // that.dstate; } ZStream.prototype = { deflateInit : function(level, bits) { var that = this; that.dstate = new Deflate(); if (!bits) bits = MAX_BITS; return that.dstate.deflateInit(that, level, bits); }, deflate : function(flush) { var that = this; if (!that.dstate) { return Z_STREAM_ERROR; } return that.dstate.deflate(that, flush); }, deflateEnd : function() { var that = this; if (!that.dstate) return Z_STREAM_ERROR; var ret = that.dstate.deflateEnd(); that.dstate = null; return ret; }, deflateParams : function(level, strategy) { var that = this; if (!that.dstate) return Z_STREAM_ERROR; return that.dstate.deflateParams(that, level, strategy); }, deflateSetDictionary : function(dictionary, dictLength) { var that = this; if (!that.dstate) return Z_STREAM_ERROR; return that.dstate.deflateSetDictionary(that, dictionary, dictLength); }, // Read a new buffer from the current input stream, update the // 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->next_in buffer and copying from it. // (See also flush_pending()). read_buf : function(buf, start, size) { var that = this; var len = that.avail_in; if (len > size) len = size; if (len === 0) return 0; that.avail_in -= len; buf.set(that.next_in.subarray(that.next_in_index, that.next_in_index + len), start); that.next_in_index += len; that.total_in += len; return len; }, // 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->next_out buffer and copying into it. // (See also read_buf()). flush_pending : function() { var that = this; var len = that.dstate.pending; if (len > that.avail_out) len = that.avail_out; if (len === 0) return; // if (that.dstate.pending_buf.length <= that.dstate.pending_out || that.next_out.length <= that.next_out_index // || that.dstate.pending_buf.length < (that.dstate.pending_out + len) || that.next_out.length < (that.next_out_index + // len)) { // console.log(that.dstate.pending_buf.length + ", " + that.dstate.pending_out + ", " + that.next_out.length + ", " + // that.next_out_index + ", " + len); // console.log("avail_out=" + that.avail_out); // } that.next_out.set(that.dstate.pending_buf.subarray(that.dstate.pending_out, that.dstate.pending_out + len), that.next_out_index); that.next_out_index += len; that.dstate.pending_out += len; that.total_out += len; that.avail_out -= len; that.dstate.pending -= len; if (that.dstate.pending === 0) { that.dstate.pending_out = 0; } } }; // Deflater function Deflater(level) { var that = this; var z = new ZStream(); var bufsize = 512; var flush = Z_NO_FLUSH; var buf = new Uint8Array(bufsize); if (typeof level == "undefined") level = Z_DEFAULT_COMPRESSION; z.deflateInit(level); z.next_out = buf; that.append = function(data, onprogress) { var err, buffers = [], lastIndex = 0, bufferIndex = 0, bufferSize = 0, array; if (!data.length) return; z.next_in_index = 0; z.next_in = data; z.avail_in = data.length; do { z.next_out_index = 0; z.avail_out = bufsize; err = z.deflate(flush); if (err != Z_OK) throw "deflating: " + z.msg; if (z.next_out_index) if (z.next_out_index == bufsize) buffers.push(new Uint8Array(buf)); else buffers.push(new Uint8Array(buf.subarray(0, z.next_out_index))); bufferSize += z.next_out_index; if (onprogress && z.next_in_index > 0 && z.next_in_index != lastIndex) { onprogress(z.next_in_index); lastIndex = z.next_in_index; } } while (z.avail_in > 0 || z.avail_out === 0); array = new Uint8Array(bufferSize); buffers.forEach(function(chunk) { array.set(chunk, bufferIndex); bufferIndex += chunk.length; }); return array; }; that.flush = function() { var err, buffers = [], bufferIndex = 0, bufferSize = 0, array; do { z.next_out_index = 0; z.avail_out = bufsize; err = z.deflate(Z_FINISH); if (err != Z_STREAM_END && err != Z_OK) throw "deflating: " + z.msg; if (bufsize - z.avail_out > 0) buffers.push(new Uint8Array(buf.subarray(0, z.next_out_index))); bufferSize += z.next_out_index; } while (z.avail_in > 0 || z.avail_out === 0); z.deflateEnd(); array = new Uint8Array(bufferSize); buffers.forEach(function(chunk) { array.set(chunk, bufferIndex); bufferIndex += chunk.length; }); return array; }; }; /* * Copyright (c) 2012 chick307 * * Licensed under the MIT License. * http://opensource.org/licenses/mit-license */ void function(global, callback) { if (typeof module === 'object') { module.exports = callback(); } else if (typeof define === 'function') { define(callback); } else { global.adler32cs = callback(); } }(this, function() { var _hasArrayBuffer = typeof ArrayBuffer === 'function' && typeof Uint8Array === 'function'; var _Buffer = null, _isBuffer = (function() { if (!_hasArrayBuffer) return function _isBuffer() { return false }; try { var buffer = require('buffer'); if (typeof buffer.Buffer === 'function') _Buffer = buffer.Buffer; } catch (error) {} return function _isBuffer(value) { return value instanceof ArrayBuffer || _Buffer !== null && value instanceof _Buffer; }; }()); var _utf8ToBinary = (function() { if (_Buffer !== null) { return function _utf8ToBinary(utf8String) { return new _Buffer(utf8String, 'utf8').toString('binary'); }; } else { return function _utf8ToBinary(utf8String) { return unescape(encodeURIComponent(utf8String)); }; } }()); var MOD = 65521; var _update = function _update(checksum, binaryString) { var a = checksum & 0xFFFF, b = checksum >>> 16; for (var i = 0, length = binaryString.length; i < length; i++) { a = (a + (binaryString.charCodeAt(i) & 0xFF)) % MOD; b = (b + a) % MOD; } return (b << 16 | a) >>> 0; }; var _updateUint8Array = function _updateUint8Array(checksum, uint8Array) { var a = checksum & 0xFFFF, b = checksum >>> 16; for (var i = 0, length = uint8Array.length, x; i < length; i++) { a = (a + uint8Array[i]) % MOD; b = (b + a) % MOD; } return (b << 16 | a) >>> 0 }; var exports = {}; var Adler32 = exports.Adler32 = (function() { var ctor = function Adler32(checksum) { if (!(this instanceof ctor)) { throw new TypeError( 'Constructor cannot called be as a function.'); } if (!isFinite(checksum = checksum == null ? 1 : +checksum)) { throw new Error( 'First arguments needs to be a finite number.'); } this.checksum = checksum >>> 0; }; var proto = ctor.prototype = {}; proto.constructor = ctor; ctor.from = function(from) { from.prototype = proto; return from; }(function from(binaryString) { if (!(this instanceof ctor)) { throw new TypeError( 'Constructor cannot called be as a function.'); } if (binaryString == null) throw new Error('First argument needs to be a string.'); this.checksum = _update(1, binaryString.toString()); }); ctor.fromUtf8 = function(fromUtf8) { fromUtf8.prototype = proto; return fromUtf8; }(function fromUtf8(utf8String) { if (!(this instanceof ctor)) { throw new TypeError( 'Constructor cannot called be as a function.'); } if (utf8String == null) throw new Error('First argument needs to be a string.'); var binaryString = _utf8ToBinary(utf8String.toString()); this.checksum = _update(1, binaryString); }); if (_hasArrayBuffer) { ctor.fromBuffer = function(fromBuffer) { fromBuffer.prototype = proto; return fromBuffer; }(function fromBuffer(buffer) { if (!(this instanceof ctor)) { throw new TypeError( 'Constructor cannot called be as a function.'); } if (!_isBuffer(buffer)) throw new Error('First argument needs to be ArrayBuffer.'); var array = new Uint8Array(buffer); return this.checksum = _updateUint8Array(1, array); }); } proto.update = function update(binaryString) { if (binaryString == null) throw new Error('First argument needs to be a string.'); binaryString = binaryString.toString(); return this.checksum = _update(this.checksum, binaryString); }; proto.updateUtf8 = function updateUtf8(utf8String) { if (utf8String == null) throw new Error('First argument needs to be a string.'); var binaryString = _utf8ToBinary(utf8String.toString()); return this.checksum = _update(this.checksum, binaryString); }; if (_hasArrayBuffer) { proto.updateBuffer = function updateBuffer(buffer) { if (!_isBuffer(buffer)) throw new Error('First argument needs to be ArrayBuffer.'); var array = new Uint8Array(buffer); return this.checksum = _updateUint8Array(this.checksum, array); }; } proto.clone = function clone() { return new Adler32(this.checksum); }; return ctor; }()); exports.from = function from(binaryString) { if (binaryString == null) throw new Error('First argument needs to be a string.'); return _update(1, binaryString.toString()); }; exports.fromUtf8 = function fromUtf8(utf8String) { if (utf8String == null) throw new Error('First argument needs to be a string.'); var binaryString = _utf8ToBinary(utf8String.toString()); return _update(1, binaryString); }; if (_hasArrayBuffer) { exports.fromBuffer = function fromBuffer(buffer) { if (!_isBuffer(buffer)) throw new Error('First argument need to be ArrayBuffer.'); var array = new Uint8Array(buffer); return _updateUint8Array(1, array); }; } return exports; }); ; /** @preserve jsPDF addImage plugin (JPEG only at this time) Copyright (c) 2012 https://github.com/siefkenj/ */ /** * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * ==================================================================== */ ;(function(jsPDFAPI) { 'use strict' var namespace = 'addImage_' // takes a string imgData containing the raw bytes of // a jpeg image and returns [width, height] // Algorithm from: http://www.64lines.com/jpeg-width-height var getJpegSize = function(imgData) { 'use strict' var width, height; // Verify we have a valid jpeg header 0xff,0xd8,0xff,0xe0,?,?,'J','F','I','F',0x00 if (!imgData.charCodeAt(0) === 0xff || !imgData.charCodeAt(1) === 0xd8 || !imgData.charCodeAt(2) === 0xff || !imgData.charCodeAt(3) === 0xe0 || !imgData.charCodeAt(6) === 'J'.charCodeAt(0) || !imgData.charCodeAt(7) === 'F'.charCodeAt(0) || !imgData.charCodeAt(8) === 'I'.charCodeAt(0) || !imgData.charCodeAt(9) === 'F'.charCodeAt(0) || !imgData.charCodeAt(10) === 0x00) { throw new Error('getJpegSize requires a binary jpeg file') } var blockLength = imgData.charCodeAt(4)*256 + imgData.charCodeAt(5); var i = 4, len = imgData.length; while ( i < len ) { i += blockLength; if (imgData.charCodeAt(i) !== 0xff) { throw new Error('getJpegSize could not find the size of the image'); } if (imgData.charCodeAt(i+1) === 0xc0) { height = imgData.charCodeAt(i+5)*256 + imgData.charCodeAt(i+6); width = imgData.charCodeAt(i+7)*256 + imgData.charCodeAt(i+8); return [width, height]; } else { i += 2; blockLength = imgData.charCodeAt(i)*256 + imgData.charCodeAt(i+1) } } } // Image functionality ported from pdf.js , putImage = function(img) { var objectNumber = this.internal.newObject() , out = this.internal.write , putStream = this.internal.putStream img['n'] = objectNumber out('<>'); } if ('trns' in img && img['trns'].constructor == Array) { var trns = ''; for ( var i = 0; i < img['trns'].length; i++) { trns += (img[trns][i] + ' ' + img['trns'][i] + ' '); out('/Mask [' + trns + ']'); } } if ('smask' in img) { out('/SMask ' + (objectNumber + 1) + ' 0 R'); } out('/Length ' + img['data'].length + '>>'); putStream(img['data']); out('endobj'); } , putResourcesCallback = function() { var images = this.internal.collections[namespace + 'images'] for ( var i in images ) { putImage.call(this, images[i]) } } , putXObjectsDictCallback = function(){ var images = this.internal.collections[namespace + 'images'] , out = this.internal.write , image for (var i in images) { image = images[i] out( '/I' + image['i'] , image['n'] , '0' , 'R' ) } } jsPDFAPI.addImage = function(imageData, format, x, y, w, h) { 'use strict' if (typeof imageData === 'object' && imageData.nodeType === 1) { var canvas = document.createElement('canvas'); canvas.width = imageData.clientWidth; canvas.height = imageData.clientHeight; var ctx = canvas.getContext('2d'); if (!ctx) { throw ('addImage requires canvas to be supported by browser.'); } ctx.drawImage(imageData, 0, 0, canvas.width, canvas.height); imageData = canvas.toDataURL('image/jpeg'); format = "JPEG"; } if (format.toUpperCase() !== 'JPEG') { throw new Error('addImage currently only supports format \'JPEG\', not \''+format+'\''); } var imageIndex , images = this.internal.collections[namespace + 'images'] , coord = this.internal.getCoordinateString , vcoord = this.internal.getVerticalCoordinateString; // Detect if the imageData is raw binary or Data URL if (imageData.substring(0, 23) === 'data:image/jpeg;base64,') { imageData = atob(imageData.replace('data:image/jpeg;base64,', '')); } if (images){ // this is NOT the first time this method is ran on this instance of jsPDF object. imageIndex = Object.keys ? Object.keys(images).length : (function(o){ var i = 0 for (var e in o){if(o.hasOwnProperty(e)){ i++ }} return i })(images) } else { // this is the first time this method is ran on this instance of jsPDF object. imageIndex = 0 this.internal.collections[namespace + 'images'] = images = {} this.internal.events.subscribe('putResources', putResourcesCallback) this.internal.events.subscribe('putXobjectDict', putXObjectsDictCallback) } var dims = getJpegSize(imageData); var info = { w : dims[0], h : dims[1], cs : 'DeviceRGB', bpc : 8, f : 'DCTDecode', i : imageIndex, data : imageData // n: objectNumber will be added by putImage code }; images[imageIndex] = info if (!w && !h) { w = -96; h = -96; } if (w < 0) { w = (-1) * info['w'] * 72 / w / this.internal.scaleFactor; } if (h < 0) { h = (-1) * info['h'] * 72 / h / this.internal.scaleFactor; } if (w === 0) { w = h * info['w'] / info['h']; } if (h === 0) { h = w * info['h'] / info['w']; } this.internal.write( 'q' , coord(w) , '0 0' , coord(h) // TODO: check if this should be shifted by vcoord , coord(x) , vcoord(y + h) , 'cm /I'+info['i'] , 'Do Q' ) return this } })(jsPDF.API) ; /** @preserve jsPDF fromHTML plugin. BETA stage. API subject to change. Needs browser, jQuery Copyright (c) 2012 2012 Willow Systems Corporation, willow-systems.com */ /* * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * ==================================================================== */ ;(function(jsPDFAPI) { 'use strict' if(!String.prototype.trim) { String.prototype.trim = function () { return this.replace(/^\s+|\s+$/g,''); }; } if(!String.prototype.trimLeft) { String.prototype.trimLeft = function () { return this.replace(/^\s+/g,''); }; } if(!String.prototype.trimRight) { String.prototype.trimRight = function () { return this.replace(/\s+$/g,''); }; } function PurgeWhiteSpace(array){ var i = 0, l = array.length, fragment , lTrimmed = false , rTrimmed = false while (!lTrimmed && i !== l) { fragment = array[i] = array[i].trimLeft() if (fragment) { // there is something left there. lTrimmed = true } ;i++; } i = l - 1 while (l && !rTrimmed && i !== -1) { fragment = array[i] = array[i].trimRight() if (fragment) { // there is something left there. rTrimmed = true } ;i--; } var r = /\s+$/g , trailingSpace = true // it's safe to assume we always trim start of display:block element's text. for (i = 0; i !== l; i++) { fragment = array[i].replace(/\s+/g, ' ') // if (l > 1) { // console.log(i, trailingSpace, fragment) // } if (trailingSpace) { fragment = fragment.trimLeft() } if (fragment) { // meaning, it was not reduced to "" // if it was, we don't want to clear trailingSpace flag. trailingSpace = r.test(fragment) } array[i] = fragment } return array } function Renderer(pdf, x, y, settings) { this.pdf = pdf this.x = x this.y = y this.settings = settings this.init() return this } Renderer.prototype.init = function(){ this.paragraph = { 'text': [] , 'style': [] } this.pdf.internal.write( 'q' ) } Renderer.prototype.dispose = function(){ this.pdf.internal.write( 'Q' // closes the 'q' in init() ) return { 'x':this.x, 'y':this.y // bottom left of last line. = upper left of what comes after us. // TODO: we cannot traverse pages yet, but need to figure out how to communicate that when we do. // TODO: add more stats: number of lines, paragraphs etc. } } Renderer.prototype.splitFragmentsIntoLines = function(fragments, styles){ var defaultFontSize = 12 // points , k = this.pdf.internal.scaleFactor // when multiplied by this, converts jsPDF instance units into 'points' // var widths = options.widths ? options.widths : this.internal.getFont().metadata.Unicode.widths // , kerning = options.kerning ? options.kerning : this.internal.getFont().metadata.Unicode.kerning , fontMetricsCache = {} , ff, fs , fontMetrics , fragment // string, element of `fragments` , style // object with properties with names similar to CSS. Holds pertinent style info for given fragment , fragmentSpecificMetrics // fontMetrics + some indent and sizing properties populated. We reuse it, hence the bother. , fragmentLength // fragment's length in jsPDF units , fragmentChopped // will be array - fragment split into "lines" , line = [] // array of pairs of arrays [t,s], where t is text string, and s is style object for that t. , lines = [line] // array of arrays of pairs of arrays , currentLineLength = 0 // in jsPDF instance units (inches, cm etc) , maxLineLength = this.settings.width // need to decide if this is the best way to know width of content. // this loop sorts text fragments (and associated style) // into lines. Some fragments will be chopped into smaller // fragments to be spread over multiple lines. while (fragments.length) { fragment = fragments.shift() style = styles.shift() // if not empty string if (fragment) { ff = style['font-family'] fs = style['font-style'] fontMetrics = fontMetricsCache[ff+fs] if (!fontMetrics) { fontMetrics = this.pdf.internal.getFont(ff, fs).metadata.Unicode fontMetricsCache[ff+fs] = fontMetrics } fragmentSpecificMetrics = { 'widths': fontMetrics.widths , 'kerning': fontMetrics.kerning // fontSize comes to us from CSS scraper as "proportion of normal" value // , hence the multiplication , 'fontSize': style['font-size'] * defaultFontSize // // these should not matter as we provide the metrics manually // // if we would not, we would need these: // , 'fontName': style.fontName // , 'fontStyle': style.fontStyle // this is setting for "indent first line of paragraph", but we abuse it // for continuing inline spans of text. Indent value = space in jsPDF instance units // (whatever user passed to 'new jsPDF(orientation, units, size) // already consumed on this line. May be zero, of course, for "start of line" // it's used only on chopper, ignored in all "sizing" code , 'textIndent': currentLineLength } // in user units (inch, cm etc.) fragmentLength = this.pdf.getStringUnitWidth( fragment , fragmentSpecificMetrics ) * fragmentSpecificMetrics.fontSize / k if (currentLineLength + fragmentLength > maxLineLength) { // whatever is already on the line + this new fragment // will be longer than max len for a line. // Hence, chopping fragment into lines: fragmentChopped = this.pdf.splitTextToSize( fragment , maxLineLength , fragmentSpecificMetrics ) line.push([fragmentChopped.shift(), style]) while (fragmentChopped.length){ line = [[fragmentChopped.shift(), style]] lines.push(line) } currentLineLength = this.pdf.getStringUnitWidth( // new line's first (and only) fragment's length is our new line length line[0][0] , fragmentSpecificMetrics ) * fragmentSpecificMetrics.fontSize / k } else { // nice, we can fit this fragment on current line. Less work for us... line.push([fragment, style]) currentLineLength += fragmentLength } } } return lines } Renderer.prototype.RenderTextFragment = function(text, style) { var defaultFontSize = 12 // , header = "/F1 16 Tf\n16 TL\n0 g" , font = this.pdf.internal.getFont(style['font-family'], style['font-style']) this.pdf.internal.write( '/' + font.id // font key , (defaultFontSize * style['font-size']).toFixed(2) // font size comes as float = proportion to normal. , 'Tf' // font def marker , '('+this.pdf.internal.pdfEscape(text)+') Tj' ) } Renderer.prototype.renderParagraph = function(){ var fragments = PurgeWhiteSpace( this.paragraph.text ) , styles = this.paragraph.style , blockstyle = this.paragraph.blockstyle , priorblockstype = this.paragraph.blockstyle || {} this.paragraph = {'text':[], 'style':[], 'blockstyle':{}, 'priorblockstyle':blockstyle} if (!fragments.join('').trim()) { /* if it's empty string */ return } // else there is something to draw var lines = this.splitFragmentsIntoLines(fragments, styles) , line // will be array of array pairs [[t,s],[t,s],[t,s]...] where t = text, s = style object , maxLineHeight , defaultFontSize = 12 , fontToUnitRatio = defaultFontSize / this.pdf.internal.scaleFactor // these will be in pdf instance units , paragraphspacing_before = ( // we only use margin-top potion that is larger than margin-bottom of previous elem // because CSS margins don't stack, they overlap. Math.max( ( blockstyle['margin-top'] || 0 ) - ( priorblockstype['margin-bottom'] || 0 ), 0 ) + ( blockstyle['padding-top'] || 0 ) ) * fontToUnitRatio , paragraphspacing_after = ( ( blockstyle['margin-bottom'] || 0 ) + ( blockstyle['padding-bottom'] || 0 ) ) * fontToUnitRatio , out = this.pdf.internal.write , i, l this.y += paragraphspacing_before out( 'q' // canning the scope , 'BT' // Begin Text // and this moves the text start to desired position. , this.pdf.internal.getCoordinateString(this.x) , this.pdf.internal.getVerticalCoordinateString(this.y) , 'Td' ) // looping through lines while (lines.length) { line = lines.shift() maxLineHeight = 0 for (i = 0, l = line.length; i !== l; i++) { if (line[i][0].trim()) { maxLineHeight = Math.max(maxLineHeight, line[i][1]['line-height'], line[i][1]['font-size']) } } // current coordinates are "top left" corner of text box. Text must start from "lower left" // so, lowering the current coord one line height. out( 0 , (-1 * defaultFontSize * maxLineHeight).toFixed(2) // shifting down a line in native `points' means reducing y coordinate , 'Td' // , (defaultFontSize * maxLineHeight).toFixed(2) // line height comes as float = proportion to normal. // , 'TL' // line height marker. Not sure we need it with "Td", but... ) for (i = 0, l = line.length; i !== l; i++) { if (line[i][0]) { this.RenderTextFragment(line[i][0], line[i][1]) } } // y is in user units (cm, inch etc) // maxLineHeight is ratio of defaultFontSize // defaultFontSize is in points always. // this.internal.scaleFactor is ratio of user unit to points. // Dividing by it converts points to user units. // vertical offset will be in user units. // this.y is in user units. this.y += maxLineHeight * fontToUnitRatio } out( 'ET' // End Text , 'Q' // restore scope ) this.y += paragraphspacing_after } Renderer.prototype.setBlockBoundary = function(){ this.renderParagraph() } Renderer.prototype.setBlockStyle = function(css){ this.paragraph.blockstyle = css } Renderer.prototype.addText = function(text, css){ this.paragraph.text.push(text) this.paragraph.style.push(css) } //===================== // these are DrillForContent and friends var FontNameDB = { 'helvetica':'helvetica' , 'sans-serif':'helvetica' , 'serif':'times' , 'times':'times' , 'times new roman':'times' , 'monospace':'courier' , 'courier':'courier' } , FontWeightMap = {"100":'normal',"200":'normal',"300":'normal',"400":'normal',"500":'bold',"600":'bold',"700":'bold',"800":'bold',"900":'bold',"normal":'normal',"bold":'bold',"bolder":'bold',"lighter":'normal'} , FontStyleMap = {'normal':'normal','italic':'italic','oblique':'italic'} , UnitedNumberMap = {'normal':1} function ResolveFont(css_font_family_string){ var name , parts = css_font_family_string.split(',') // yes, we don't care about , inside quotes , part = parts.shift() while (!name && part){ name = FontNameDB[ part.trim().toLowerCase() ] part = parts.shift() } return name } // return ratio to "normal" font size. in other words, it's fraction of 16 pixels. function ResolveUnitedNumber(css_line_height_string){ var undef , normal = 16.00 , value = UnitedNumberMap[css_line_height_string] if (value) { return value } // not in cache, ok. need to parse it. // Could it be a named value? // we will use Windows 94dpi sizing with CSS2 suggested 1.2 step ratio // where "normal" or "medium" is 16px // see: http://style.cleverchimp.com/font_size_intervals/altintervals.html value = ({ 'xx-small':9 , 'x-small':11 , 'small':13 , 'medium':16 , 'large':19 , 'x-large':23 , 'xx-large':28 , 'auto':0 })[css_line_height_string] if (value !== undef) { // caching, returning return UnitedNumberMap[css_line_height_string] = value / normal } // not in cache, ok. need to parse it. // is it int? if (value = parseFloat(css_line_height_string)) { // caching, returning return UnitedNumberMap[css_line_height_string] = value / normal } // must be a "united" value ('123em', '134px' etc.) // most browsers convert it to px so, only handling the px value = css_line_height_string.match( /([\d\.]+)(px)/ ) if (value.length === 3) { // caching, returning return UnitedNumberMap[css_line_height_string] = parseFloat( value[1] ) / normal } return UnitedNumberMap[css_line_height_string] = 1 } function GetCSS(element){ var $e = $(element) , css = {} , tmp css['font-family'] = ResolveFont( $e.css('font-family') ) || 'times' css['font-style'] = FontStyleMap [ $e.css('font-style') ] || 'normal' tmp = FontWeightMap[ $e.css('font-weight') ] || 'normal' if (tmp === 'bold') { if (css['font-style'] === 'normal') { css['font-style'] = tmp } else { css['font-style'] = tmp + css['font-style'] // jsPDF's default fonts have it as "bolditalic" } } css['font-size'] = ResolveUnitedNumber( $e.css('font-size') ) || 1 // ratio to "normal" size css['line-height'] = ResolveUnitedNumber( $e.css('line-height') ) || 1 // ratio to "normal" size css['display'] = $e.css('display') === 'inline' ? 'inline' : 'block' if (css['display'] === 'block'){ css['margin-top'] = ResolveUnitedNumber( $e.css('margin-top') ) || 0 css['margin-bottom'] = ResolveUnitedNumber( $e.css('margin-bottom') ) || 0 css['padding-top'] = ResolveUnitedNumber( $e.css('padding-top') ) || 0 css['padding-bottom'] = ResolveUnitedNumber( $e.css('padding-bottom') ) || 0 } return css } function elementHandledElsewhere(element, renderer, elementHandlers){ var isHandledElsewhere = false var i, l, t , handlers = elementHandlers['#'+element.id] if (handlers) { if (typeof handlers === 'function') { isHandledElsewhere = handlers(element, renderer) } else /* array */ { i = 0 l = handlers.length while (!isHandledElsewhere && i !== l){ isHandledElsewhere = handlers[i](element, renderer) ;i++; } } } handlers = elementHandlers[element.nodeName] if (!isHandledElsewhere && handlers) { if (typeof handlers === 'function') { isHandledElsewhere = handlers(element, renderer) } else /* array */ { i = 0 l = handlers.length while (!isHandledElsewhere && i !== l){ isHandledElsewhere = handlers[i](element, renderer) ;i++; } } } return isHandledElsewhere } function DrillForContent(element, renderer, elementHandlers){ var cns = element.childNodes , cn , fragmentCSS = GetCSS(element) , isBlock = fragmentCSS.display === 'block' if (isBlock) { renderer.setBlockBoundary() renderer.setBlockStyle(fragmentCSS) } for (var i = 0, l = cns.length; i < l ; i++){ cn = cns[i] if (typeof cn === 'object') { // Don't render the insides of script tags, they contain text nodes which then render if (cn.nodeType === 1 && cn.nodeName != 'SCRIPT') { if (!elementHandledElsewhere(cn, renderer, elementHandlers)) { DrillForContent(cn, renderer, elementHandlers) } } else if (cn.nodeType === 3){ renderer.addText( cn.nodeValue, fragmentCSS ) } } else if (typeof cn === 'string') { renderer.addText( cn, fragmentCSS ) } } if (isBlock) { renderer.setBlockBoundary() } } function process(pdf, element, x, y, settings) { // we operate on DOM elems. So HTML-formatted strings need to pushed into one if (typeof element === 'string') { element = (function(element) { var framename = "jsPDFhtmlText" + Date.now().toString() + (Math.random() * 1000).toFixed(0) , visuallyhidden = 'position: absolute !important;' + 'clip: rect(1px 1px 1px 1px); /* IE6, IE7 */' + 'clip: rect(1px, 1px, 1px, 1px);' + 'padding:0 !important;' + 'border:0 !important;' + 'height: 1px !important;' + 'width: 1px !important; ' + 'top:auto;' + 'left:-100px;' + 'overflow: hidden;' // TODO: clean up hidden div , $hiddendiv = $( '
' + '