init

.gitignore

+# Created by .ignore support plugin (hsz.mobi)
+### Node template
+# Logs
+logs
+*.log
+npm-debug.log*
+yarn-debug.log*
+yarn-error.log*
+lerna-debug.log*
+
+# Diagnostic reports (https://nodejs.org/api/report.html)
+report.[0-9]*.[0-9]*.[0-9]*.[0-9]*.json
+
+# Runtime data
+pids
+*.pid
+*.seed
+*.pid.lock
+
+# Directory for instrumented libs generated by jscoverage/JSCover
+lib-cov
+
+# Coverage directory used by tools like istanbul
+coverage
+*.lcov
+
+# nyc test coverage
+.nyc_output
+
+# Grunt intermediate storage (https://gruntjs.com/creating-plugins#storing-task-files)
+.grunt
+
+# Bower dependency directory (https://bower.io/)
+bower_components
+
+# node-waf configuration
+.lock-wscript
+
+# Compiled binary addons (https://nodejs.org/api/addons.html)
+build/Release
+
+# Dependency directories
+node_modules/
+jspm_packages/
+
+# TypeScript v1 declaration files
+typings/
+
+# TypeScript cache
+*.tsbuildinfo
+
+# Optional npm cache directory
+.npm
+
+# Optional eslint cache
+.eslintcache
+
+# Optional REPL history
+.node_repl_history
+
+# Output of 'npm pack'
+*.tgz
+
+# Yarn Integrity file
+.yarn-integrity
+
+# dotenv environment variables file
+.env
+.env.test
+
+# parcel-bundler cache (https://parceljs.org/)
+.cache
+
+# next.js build output
+.next
+
+# nuxt.js build output
+.nuxt
+
+# vuepress build output
+.vuepress/dist
+
+# Serverless directories
+.serverless/
+
+# FuseBox cache
+.fusebox/
+
+# DynamoDB Local files
+.dynamodb/
+
+/debug/
+/dist/

manifest.json

+{"id":"svga","url":"svga.bbb584f45f3ee647d0611653cb854c5d5bb8fb47.js"}
\ No newline at end of file

oss.config.js

+
+module.exports = {
+	region: 'oss-cn-hangzhou',
+	id: 'LTAI4Fw25WcfcGv7FvcHoiHK',
+	secret: 'NZk1NtT9J5HFaAolNbtQdzTzLLvLYm',
+	bucket: 'duiba',
+	output: '/editor/zeroing/libs'
+};

package.json

+{
+  "name": "renderingengine-svga",
+  "version": "1.0.0",
+  "main": "index.js",
+  "license": "MIT",
+  "devDependencies": {
+    "rollup-plugin-commonjs": "^10.1.0",
+    "rollup-plugin-node-resolve": "^5. 2.0",
+    "rollup-plugin-progress": "^1.1.1",
+    "rollup-plugin-typescript": "^1.0.1",
+    "rollup-plugin-uglify": "^6.0.4"
+  },
+  "dependencies": {
+    "protobufjs": "^6.8.8",
+    "tslib": "^1.10.0",
+    "typescript": "^3.7.3"
+  },
+  "scripts": {
+    "declare": "node scripts/declare.js src/svga/index.ts",
+    "rollup": "rollup -c -o dist/svga.js",
+    "rollup:prod": "rollup -c -o dist/svga.js --environment BUILD:production",
+    "rollup:debug": "rollup -c -m ",
+    "preprocess": "node scripts/pre-process.js svga dist/svga.js",
+    "build": "rm -rf dist&&yarn rollup:prod && yarn preprocess && ali-oss-publish -c oss.config.js -e dist",
+    "build:debug": "rm -rf dist&&yarn rollup && yarn preprocess && ali-oss-publish -c oss.config.js -e dist"
+  }
+}

rollup.config.js

+/**
+ * Created by rockyl on 2018/11/16.
+ */
+
+const resolve = require('rollup-plugin-node-resolve');
+const commonjs = require('rollup-plugin-commonjs');
+const progress = require('rollup-plugin-progress');
+const typescript = require('rollup-plugin-typescript');
+const {uglify} = require('rollup-plugin-uglify');
+
+const options = {
+	input: 'src/index.ts',
+	output: [
+		{
+			file: `debug/engine-svga.js`,
+			format: 'umd',
+			name: 'svga',
+			globals: {
+				tslib: 'tslib'
+			},
+		}
+	],
+	plugins: [
+		progress(),
+		resolve({}),
+		typescript({
+			//useTsconfigDeclarationDir: true,
+		}),
+		commonjs(),
+	],
+	external: ['tslib'],
+};
+
+if(process.env.BUILD === 'production'){
+	options.plugins.push(uglify({}));
+}
+
+export default options;

scripts/declare.js

+/**
+ * Created by rockyl on 2020-01-11.
+ */
+
+const fs = require('fs');
+const ts = require("typescript");
+
+const regLine = /(export|declare)((?!from).)*/g;
+
+function compile(fileNames, options) {
+	const host = ts.createCompilerHost(options);
+	const exports = [];
+	host.writeFile = (fileName, fileContent) => {
+		console.log(fileName);
+		const result = fileContent.match(regLine);
+		for (let line of result) {
+			if(line.match(/export (default)? \w+;/)){
+				continue;
+			}
+			if(line.endsWith(';')){
+				if(!line.startsWith('_') && !line.startsWith('export default function')){
+					exports.push(line);
+				}
+			}else {
+				if(line.endsWith('{')){
+					let start = fileContent.indexOf(line);
+					const block = fileContent.substring(start, fileContent.indexOf('\n}', start) + 2);
+					if(!block.startsWith('_')){
+						exports.push(block);
+					}
+				}
+			}
+		}
+	};
+
+	const program = ts.createProgram(fileNames, options, host);
+	program.emit();
+
+	let allExports = exports.join('\n\n')
+		.replace(/export default _default;/g, '')
+		.replace(/export declare/g, 'export ')
+		.replace(/export default/g, 'export ')
+		.replace(/declare /g, 'export ')
+	;
+
+	const content = `
+declare module svga{
+${allExports}
+}
+`;
+
+	fs.writeFileSync('debug/svga.d.ts', content);
+}
+
+compile(process.argv.slice(2), {
+	allowJs: true,
+	declaration: true,
+	emitDeclarationOnly: true,
+});

scripts/pre-process.js

+/**
+ * Created by rockyl on 2019-11-22.
+ */
+
+const crypto = require('crypto');
+const fs = require('fs');
+const path = require('path');
+
+const [_, __, id, fileName] = process.argv;
+
+const stream = fs.createReadStream(fileName);
+const fsHash = crypto.createHash('sha1');
+
+stream.on('data', function (d) {
+	fsHash.update(d);
+});
+
+stream.on('end', function () {
+	const md5 = fsHash.digest('hex');
+
+	loadComplete(md5);
+});
+
+function loadComplete(md5) {
+	const extIndex = fileName.lastIndexOf('.');
+	const newFileName = fileName.substr(0, extIndex + 1) + md5 + fileName.substr(extIndex);
+	fs.renameSync(fileName, newFileName);
+
+	let manifest = {
+		id,
+		url: path.basename(newFileName),
+	};
+
+	fs.writeFileSync('manifest.json', JSON.stringify(manifest));
+}

src/index.ts

+
+export * from "./svga/index";
\ No newline at end of file

src/svga/MovieClip.ts

+import {VideoEntity} from "./VideoEntity";
+
+const {Container, Texture, Sprite, Event, GlobalPro, TextureCache, RAD_TO_DEG, RENDERER_TYPE, DrawAllToCanvas, Button, TextField, Matrix} = engine;
+
+/**
+ * 用于播放动画
+ * 帧数监听，已ued给的文件为主，不做补间增加帧数，
+ * 暂无setImage,setText再加
+ * 暂时无矢量图和遮罩解析
+ * 暂不支持加快播放，
+ * 暂不支持loops循环次数
+ * 考虑是否支持加快播放，如果能加速，中间帧数监听会出问题
+ * 考虑是否帧率锁步，同上问题,锁步后会可能失效currentFrame判断
+ * s.addEventListener(Event.ENTER_FRAME, func = (e) => {
+ *      //这个判断如果只希望执行一次得多加一个条件isInTimeFrame为true，或者及时移除
+ *      if (e.target.currentFrame == 66&&e.target.isInTimeFrame) {
+ *         e.target.removeEventListener(Event.ENTER_FRAME, func);
+ *    }
+ * });
+ * 锁步时的每帧监听，用>或<判断，及时移除
+ * @class MovieClip
+ * @since 1.0.0
+ * @public
+ * @extends Container
+ */
+export class MovieClip extends Container {
+
+	/**
+	 * 锁步将按时间间隔来执行动画
+	 */
+	public lockStep: boolean = false;
+
+	/**
+	 * mc的当前帧,从1开始
+	 * @property currentFrame
+	 * @public
+	 * @since 1.0.0
+	 * @type {number}
+	 * @default 1
+	 * @readonly
+	 */
+	public get currentFrame(): number {
+		return this._curFrame;
+	}
+
+	/**
+	 * @property _curFrame
+	 * @type {number}
+	 * @private
+	 * @since 2.0.0
+	 * @default 1
+	 */
+	private _curFrame: number = 1;
+
+	/**
+	 * 当前动画是否处于播放状态
+	 * @property isPlaying
+	 * @readOnly
+	 * @public
+	 * @since 1.0.0
+	 * @type {boolean}
+	 * @default true
+	 * @readonly
+	 */
+	public get isPlaying(): boolean {
+		return this._isPlaying;
+	}
+
+	/**
+	 * @property _isPlaying
+	 * @type {boolean}
+	 * @private
+	 * @since 2.0.0
+	 * @default true
+	 */
+	private _isPlaying: boolean = false;
+
+	/**
+	 * 动画的播放方向,是顺着播还是在倒着播
+	 * @property isFront
+	 * @public
+	 * @since 1.0.0
+	 * @type {boolean}
+	 * @default true
+	 * @readonly
+	 */
+	get isFront(): boolean {
+		return this._isFront;
+	}
+
+	/**
+	 * @property _isFront
+	 * @type {boolean}
+	 * @private
+	 * @default true
+	 */
+	private _isFront: boolean = true;
+
+	/**
+	 * 当前动画的总帧数
+	 * @property totalFrames
+	 * @public
+	 * @since 1.0.0
+	 * @type {number}
+	 * @default 1
+	 * @readonly
+	 */
+	public totalFrames: number;
+
+	loops: number = 0;
+	/**
+	 * 所有textures缓存
+	 */
+	private textures = {};
+
+	/**
+	 * 锁步的时间间隔，按fps定,毫秒
+	 */
+	private timeInterval;
+
+	/**
+	 * 前提引擎按60设置
+	 */
+	private deltaFrame: number;
+	/**
+	 * 中间帧计时
+	 */
+	private frameCount: number = 0;
+
+	/**
+	 * 构造函数
+	 * @method MovieClip
+	 * @public
+	 * @since 1.0.0
+	 */
+	public constructor(mv?: VideoEntity) {
+		super();
+		let s: any = this;
+		s._instanceType = "MovieClip";
+		//初始化
+		if (mv) {
+			s.init(mv);
+		} else {
+			s.totalFrames = 0;
+		}
+	}
+
+	/**
+	 * 可以手动用init，
+	 * @param mv
+	 */
+	init(mv: VideoEntity) {
+		if (mv.instanceType == "VideoEntity") {
+			//记录基本信息，fps，每秒输出帧数，frames，总帧数，videoSize暂时不管
+			//如果fps小于60怎么处理。update时怎么处理
+			this.timeInterval = 1000 / mv.FPS;
+			this.startTime = Date.now();
+			this.startFrame = 1;
+			this.totalFrames = mv.frames
+			//间隔帧数，
+			this.deltaFrame = 60 / mv.FPS;
+			this.frameCount = this.deltaFrame;
+			this._curFrame = 1;
+
+			//考虑是否要加遮罩，用videoSize，暂时不用，为了性能
+			// var mask = new Graphics();
+			// mask.beginFill(0xffffff, 1);
+			// mask.drawRect(0, 0, mv.videoSize.width, mv.videoSize.height);
+			// mask.endFill();
+			// this.mask = mask;
+
+			//缓存所有图片
+			const images = mv.images;
+			if (mv.hasBeenCached) {
+				//如已被缓存，则直接取了赋值
+				for (var keyName in images) {
+
+					this.textures[keyName] = TextureCache[keyName];
+				}
+				this.initChildren(mv.sprites)
+			} else {
+				/*if (GlobalPro.stageRenderType == RENDERER_TYPE.WEBGL) {
+					//缓存成一张canvas，考虑要不要把所有资源搞成图集
+					DrawAllToCanvas(images, (t) => {
+						this.textures = t;
+						this.initChildren(mv.sprites)
+						//缓存
+						for (var key in this.textures) {
+							Texture.addToCache(this.textures[key], key)
+						}
+						mv.hasBeenCached = true;
+					})
+				} else {*/
+					//canvas直接缓存
+					for (var key in images) {
+						var bitmap = images[key];
+						// let imgTag = document.createElement('img');
+						let imgTag = new Image();
+						let backCanvas;
+						if (bitmap.indexOf("iVBO") === 0 || bitmap.indexOf("/9j/2w") === 0) {
+							imgTag.src = 'data:image/png;base64,' + bitmap;
+						} else {
+							imgTag.src = bitmap;
+							//这里有问题，再说
+							// if (frames[0] && frames[0].layout) {
+							//     backCanvas = document.createElement('canvas');
+							//     backCanvas.width = frames[0].layout.width
+							//     backCanvas.height = frames[0].layout.height
+							//     imgTag.onload = function () {
+							//         backCanvas.getContext('2d').drawImage(imgTag, 0, 0, frames[0].layout.width, frames[0].layout.height)
+							//     }
+							// }
+						}
+						this.textures[key] = Texture.from(backCanvas || imgTag);
+						Texture.addToCache(this.textures[key], key)
+					}
+					mv.hasBeenCached = true;
+					this.initChildren(mv.sprites)
+				//}
+			}
+
+		}
+	}
+
+	private initChildren(sprites) {
+		for (var i = 0, len = sprites.length; i < len; i++) {
+			var ele = sprites[i];
+			if (ele.imageKey) {
+				var child
+				var splitArr = ele.imageKey.split("_");
+				//start_btn
+				if (splitArr[1] && splitArr[1] == "btn") {
+					//如果是按钮,
+					child = new Button(this.textures[ele.imageKey]);
+					//去掉frames，保留单帧数据，
+					this.resetTransform(child, ele.frames[0].transform)
+					//存下指向start，
+					this[splitArr[0]] = child;
+				}
+				//需标记的带动画的，有动画矩阵，不能通过基础属性修改，最好已适配，否则单独导出，不放布局
+				else if (splitArr[1] && splitArr[1] == "spr") {
+					child = new Sprite(this.textures[ele.imageKey]);
+					//直接赋值矩阵，实际有位置操作时，直接去掉frames属性，就不会被更新，如要还原，需临时记录
+					if (ele.frames.length > 1) {
+						child["frames"] = ele.frames;
+						child.transform.localMatrix.copy(ele.frames[0].transform);
+						child.transform._parentID = -1;
+					} else {
+						this.resetTransform(child, ele.frames[0].transform)
+					}
+					this[splitArr[0]] = child;
+				}
+				//文本
+				else if (splitArr[1] && splitArr[1] == "text") {
+					//内容没法改，暂时用XXX代替，因为
+					child = new TextField();
+					child.text = "xxxx";
+					child.size = splitArr[2] ? parseInt(splitArr[2]) : 20;//字号
+					child.fillColor = splitArr[3] ? "#" + splitArr[3] : "#000000"//颜色
+					child.textAlign = splitArr[4] || "center"//水平对齐方式
+					child.textWidth = this.textures[ele.imageKey].width //假设已经加载
+					// child.border = true;
+					//直接赋值矩阵
+					child["frames"] = ele.frames;
+					child.transform.localMatrix.copy(ele.frames[0].transform);
+					child.transform._parentID = -1;
+					this[splitArr[0]] = child;
+					//如果有动画，不能通过基础属性修改位置，文案最好已适配
+				}
+				//一般不需要标记的
+				else {
+					child = new Sprite(this.textures[ele.imageKey]);
+					//直接赋值矩阵
+					child["frames"] = ele.frames;
+					child.transform.localMatrix.copy(ele.frames[0].transform);
+					child.transform._parentID = -1;
+				}
+				this.addChild(child);
+				//透明度处理
+				if (ele.frames[0].alpha < 0.05) {
+					child.visible = false;
+				} else {
+					child.alpha = ele.frames[0].alpha;
+				}
+				//记录一个源数据
+				child["framesOri"] = ele.frames;
+				//记录一个源imageKey
+				child["imageKey"] = ele.imageKey;
+			}
+		}
+	}
+
+	/**
+	 * 用基础属性重置
+	 * @param display
+	 * @param transform
+	 */
+	private resetTransform(display, transform) {
+		display.x = transform.tx;
+		display.y = transform.ty;
+		display.scaleX = transform.a;
+		display.scaleY = transform.d;
+		display.rotation = Math.round(Math.atan2(transform.b, transform.a) * RAD_TO_DEG);
+	}
+
+	/**
+	 * 用基础属性重置所有的待frame的children
+	 * @param frameIndex 帧 1到total
+	 */
+	public resetTransformAll(frameIndex: number) {
+		if (frameIndex > this.totalFrames) frameIndex = this.totalFrames;
+		if (frameIndex <= 0) frameIndex = 1;
+		for (var i = 0; i < this.children.length; i++) {
+			let child = this.children[i];
+			if (child["frames"] && child["frames"][frameIndex - 1]) {
+				this.resetTransform(child, child["frames"][frameIndex - 1].transform)
+			}
+		}
+
+	}
+
+	/**
+	 *
+	 * @param imagekey 对应的imagekey
+	 * @param imageUrl 图片路径，以后考虑支持多种形式
+	 */
+	setImage(imagekey, imageUrl: string) {
+		if (!this.textures[imagekey]) return
+		let texture = this.textures[imagekey]
+		var width = texture.width;
+		var height = texture.height;
+		let image = new Image();
+		var self = this;
+		image.onload = function () {
+			let newTexture: Texture
+			if (image.width == width && image.height == height) {
+				newTexture = Texture.from(image);
+			} else {
+				var canvas = document.createElement("canvas");
+				canvas.width = width;
+				canvas.height = height;
+				var ctx = canvas.getContext("2d")
+				//适配绘制,为了全部显示在canvas中
+				var scaleCan = width / height;
+				var scale = image.width / image.height;
+				if (scaleCan > scale) {
+					//定高
+					ctx.drawImage(image, 0, 0, image.width, image.height
+						, (width - scale * height) / 2, 0, scale * height, height)
+				} else {
+					//定宽
+					ctx.drawImage(image, 0, 0, image.width, image.height
+						, 0, (height - width / scale) / 2, width, width / scale)
+				}
+				newTexture = Texture.fromCanvas(canvas)
+			}
+			//修改textures指向
+			// self.textures[imagekey]=Texture.fromCanvas(canvas)
+			//修改相应sprite
+			for (var i = 0; i < self.children.length; i++) {
+				let child = self.children[i]
+				//texture相等
+				if (child["imageKey"] == imagekey) {
+					child.texture = newTexture
+				}
+			}
+		}
+		image.src = imageUrl;
+	}
+
+	/**
+	 * 调用止方法将停止当前帧
+	 * @method stop
+	 * @public
+	 * @since 1.0.0
+	 */
+	public stop(): void {
+		let s = this;
+		s._isPlaying = false;
+	}
+
+	/**
+	 * 将播放头向后移一帧并停在下一帧,如果本身在最后一帧则不做任何反应
+	 * @method nextFrame
+	 * @since 1.0.0
+	 * @public
+	 */
+	public nextFrame(): void {
+		let s = this;
+		if (s._curFrame < s.totalFrames) {
+			s._curFrame++;
+		}
+		s._isPlaying = false;
+	}
+
+	/**
+	 * 将播放头向前移一帧并停在下一帧,如果本身在第一帧则不做任何反应
+	 * @method prevFrame
+	 * @since 1.0.0
+	 * @public
+	 */
+	public prevFrame(): void {
+		let s = this;
+		if (s._curFrame > 1) {
+			s._curFrame--;
+		}
+		s._isPlaying = false;
+	}
+
+	/**
+	 * 将播放头跳转到指定帧并停在那一帧,如果本身在第一帧则不做任何反应
+	 * @method gotoAndStop
+	 * @public
+	 * @since 1.0.0
+	 * @param {number} frameIndex 批定帧的帧数或指定帧的标签名
+	 */
+	public gotoAndStop(frameIndex: number): void {
+		let s: any = this;
+		s._isPlaying = false;
+		if (frameIndex > s.totalFrames) {
+			frameIndex = s.totalFrames;
+		}
+		if (frameIndex < 1) {
+			frameIndex = 1;
+		}
+		s._curFrame = <number>frameIndex;
+	}
+
+	/**
+	 * 如果当前时间轴停在某一帧,调用此方法将继续播放.
+	 * @method play
+	 * @public
+	 * @since 1.0.0
+	 */
+	public play(isFront: boolean = true, loop = true): void {
+		let s = this;
+		if(loop){
+			s.frameCount = s.deltaFrame;
+			s.startTime = Date.now();
+			s.startFrame = s._curFrame;
+			s._isPlaying = true;
+			s._isFront = isFront;
+		}else{
+			this.startAniRange();
+		}
+	}
+
+	/**
+	 * @property _lastFrame
+	 * @type {number}
+	 * @private
+	 * @default 0
+	 */
+	private _lastFrame: number = 0;
+
+	/**
+	 * 刚执行到的帧数，用于帧监听时判断用，刚好执行到当前帧，而不是之前保留的状态
+	 * 不是60fps的videoItem的中间有几帧curFrame会不变，判断只执行一次监听时会出错，刚好动画满帧60fps时就无所谓
+	 */
+	public get isInTimeFrame(): boolean {
+		//相等时就是刚开始的curFrame
+		return this.frameCount == this.deltaFrame;
+	}
+
+
+	/**
+	 * 将播放头跳转到指定帧并从那一帧开始继续播放
+	 * @method gotoAndPlay
+	 * @public
+	 * @since 1.0.0
+	 * @param {number} frameIndex 批定帧的帧数或指定帧的标签名
+	 * @param {boolean} isFront 跳到指定帧后是向前播放, 还是向后播放.不设置些参数将默认向前播放
+	 */
+	public gotoAndPlay(frameIndex: number, isFront: boolean = true): void {
+		let s: any = this;
+		s._isFront = isFront;
+		s._isPlaying = true;
+		if (frameIndex > s.totalFrames) {
+			frameIndex = s.totalFrames;
+		}
+		if (frameIndex < 1) {
+			frameIndex = 1;
+		}
+		s.frameCount = s.deltaFrame;
+		s.startTime = Date.now();
+		s._curFrame = <number>frameIndex;
+		s.startFrame = s._curFrame;
+	}
+
+	/**
+	 * 优先级最高，会覆盖
+	 * @param beginFrame 默认1
+	 * @param endFrame 默认 this.totalFrames
+	 * @param loops 默认1 0
+	 */
+	public startAniRange(
+		beginFrame: number = 1,
+		endFrame: number = this.totalFrames,
+		loops: number = 1,
+		callback?: Function
+	) {
+		if (beginFrame < 1) {
+			beginFrame = 1;
+		}
+		if (beginFrame > this.totalFrames) {
+			beginFrame = this.totalFrames;
+		}
+		if (endFrame < 1) {
+			endFrame = 1;
+		}
+		if (endFrame > this.totalFrames) {
+			endFrame = this.totalFrames;
+		}
+		if (beginFrame === endFrame) {
+			this.gotoAndStop(beginFrame)
+			//如果相等
+			return
+		} else if (beginFrame < endFrame) {
+			this._isFront = true;
+
+		} else {
+			this._isFront = false;
+			var temp = beginFrame;
+			beginFrame = endFrame;
+			endFrame = temp;
+		}
+		this._curFrame = beginFrame;
+		//赋值count最大
+		this.frameCount = this.deltaFrame;
+		this.startTime = Date.now();
+		this.startFrame = this._curFrame;
+		this._isPlaying = true;
+		let func;
+		let loopCount = loops ? (loops + 0.5 >> 0) : Infinity;
+		this.addEventListener(Event.ENTER_FRAME, func = (e) => {
+			if (e.target._isFront) {
+				//用大于等于可以避免锁步时出现的问题
+				if (e.target.currentFrame >= endFrame || e.target._endMark) {
+					loopCount--;
+					if (loopCount <= 0) {
+						e.target.gotoAndStop(endFrame);
+						e.target.removeEventListener(Event.ENTER_FRAME, func);
+						callback && callback();
+					} else {
+						e.target.gotoAndPlay(beginFrame);
+					}
+				}
+			} else {
+				if (e.target.currentFrame <= beginFrame || e.target._endMark) {
+					loopCount--
+					if (loopCount <= 0) {
+						e.target.gotoAndStop(beginFrame);
+						e.target.removeEventListener(Event.ENTER_FRAME, func);
+						callback && callback();
+					} else {
+						e.target.gotoAndPlay(endFrame, false);
+					}
+				}
+			}
+		})
+
+	}
+
+	/**
+	 * 开始时间，每次有play的时候就需要重置now
+	 * 锁步思想，设置开始时间，后面每帧实际时间与开始时间相减，得到当前帧数
+	 *
+	 */
+	private startTime: number;
+	/**
+	 * 开始时的frame
+	 */
+	private startFrame: number;
+
+	/**
+	 * 与startFrame相间隔的帧数量，绝对值
+	 */
+	private lastDeltaFrame: number
+	/**
+	 * 锁步时的每次end的标识
+	 */
+	private _endMark: boolean
+
+	commonDeltaTime = 1000 / 60;
+
+	updateFrame() {
+		var s = this;
+		//1帧的时候也有相应的frameCount，无用，return
+		if (s.totalFrames == 0 || s.totalFrames == 1) return;
+		let isNeedUpdate = false;
+		if (s._lastFrame != s._curFrame) {
+			//帧不相等
+			isNeedUpdate = true;
+			s._lastFrame = s._curFrame;
+
+			//锁步的时候
+			s.startTime = Date.now();
+			s.startFrame = s._curFrame;
+
+			s._endMark = false;
+		} else {
+			if (s._isPlaying) {
+				if (s.lockStep) {
+					isNeedUpdate = s.getCurFrameWhenLockStep();
+				} else {
+					if (--s.frameCount == 0) {
+						s.frameCount = s.deltaFrame;
+						isNeedUpdate = true;
+						if (s._isFront) {
+							s._curFrame++;
+							if (s._curFrame > s.totalFrames) {
+								s._curFrame = 1;
+							}
+						} else {
+							s._curFrame--;
+							if (s._curFrame < 1) {
+								s._curFrame = s.totalFrames;
+							}
+						}
+						s._lastFrame = s._curFrame;
+					}
+				}
+			}
+		}
+		//如果需要更新
+		if (isNeedUpdate) {
+			//对每个child还原对应的transform，alpha为0的默认visible设为false,避免计算
+			for (var i = 0, len = s.children.length; i < len; i++) {
+				var child = s.children[i]
+				//只修改动画加入的child，不修改手动加入的，,所以想要修改动画中的元素属性，直接去掉frames属性，将不会执行动画
+				if (child["frames"] && child["frames"][s._curFrame - 1]) {
+					var frame = child["frames"][s._curFrame - 1];
+					//layout不晓得干嘛用，暂不管
+					if (frame.alpha < 0.05) {
+						child.visible = false;
+					} else {
+						child.visible = true;
+						child.alpha = frame.alpha;
+						//先判断transform是否相等
+						if (!Matrix.isEqual(child.transform.localMatrix, frame.transform)) {
+							child.transform.localMatrix.copy(frame.transform)
+							child.transform._parentID = -1;
+						}
+					}
+				}
+			}
+			//事件播放结束监听
+			if (!s.lockStep) {
+				if (((s._curFrame == 1 && !s._isFront) || (s._curFrame == s.totalFrames && s._isFront)) && s.hasEventListener(Event.END_FRAME)) {
+					s.dispatchEvent(Event.END_FRAME, {
+						frameIndex: s._curFrame,
+						frameName: "endFrame"
+					});
+				}
+			} else {
+				//锁步的时候另外判断
+				if (s._endMark && s.hasEventListener(Event.END_FRAME)) {
+					s.dispatchEvent(Event.END_FRAME, {
+						frameIndex: s._curFrame,
+						frameName: "endFrame"
+					});
+				}
+			}
+		}
+
+	}
+
+	private getCurFrameWhenLockStep() {
+		var dateNow = Date.now()
+		//相差
+		var deltaFrame = ((dateNow - this.startTime) / this.timeInterval) >> 0;
+		//间隔帧数与上一帧一致，就不执行
+		if (deltaFrame == this.lastDeltaFrame) {
+			//设置不等
+			this.frameCount = 0;
+			return false
+		}
+		this._endMark = false;
+		//相等，刚好执行切换
+		this.frameCount = this.deltaFrame;
+		this.lastDeltaFrame = deltaFrame
+		if (this._isFront) {
+			//取余数
+			this._curFrame = (this.startFrame + deltaFrame) % this.totalFrames;
+			if (this._curFrame == 0) {
+				this._curFrame = this.totalFrames;
+				this._endMark = true;
+			}
+			//当上一帧大于_curFrame,并且上一帧不是totalFrames时，说明跳过了最后一帧
+			else if (this._lastFrame > this._curFrame &&
+				this._lastFrame != this.totalFrames) {
+				this._endMark = true;
+			}
+		} else {
+			this._curFrame = (this.startFrame - deltaFrame) % this.totalFrames;
+			if (this._curFrame == 0) {
+				this._curFrame = this.totalFrames;
+			} else if (this._curFrame < 0) {
+				this._curFrame += this.totalFrames;
+			}
+			if (this._curFrame == 1) {
+				this._endMark = true;
+			}
+			//当上一帧小于_curFrame,并且上一帧不是1时，说明跳过了第一帧
+			else if (this._lastFrame < this._curFrame &&
+				this._lastFrame != 1) {
+				this._endMark = true;
+			}
+		}
+		this._lastFrame = this._curFrame;
+		return true
+	}
+
+	/**
+	 * 重写刷新
+	 * @method update
+	 * @public
+	 * @since 1.0.0
+	 */
+	public update(deltaTime: number): void {
+		let s: any = this;
+		//更新帧数据
+		this.updateFrame();
+		super.update(deltaTime);
+	}
+
+
+	public destroy(): void {
+		//todo-清除相应的数据引用
+
+		super.destroy();
+	}
+}

src/svga/VideoEntity.ts

+import {SpriteEntity} from './spriteEntity'
+import {ProtoMovieEntity} from "./proto";
+
+const {HashObject} = engine;
+
+export class VideoEntity extends HashObject {
+
+	/**
+	 * SVGA 文件版本
+	 */
+	version = "";
+
+	/**
+	 * 影片尺寸
+	 */
+	videoSize = {
+		width: 0.0,
+		height: 0.0,
+	};
+
+	/**
+	 * 帧率
+	 */
+	FPS = 20;
+
+	/**
+	 * 帧数
+	 */
+	frames = 0;
+
+	/**
+	 * Bitmaps
+	 */
+	images = {};
+
+	/**
+	 * 图片是否已被缓存，缓存全局，注意名字覆盖
+	 */
+	hasBeenCached: boolean = false;
+
+	/**
+	 * SpriteEntity[]
+	 */
+	sprites: SpriteEntity[] = []
+
+	/**
+	 * AudioEntity[]
+	 */
+	audios = []
+
+	constructor(spec, images) {
+		super();
+		this._instanceType = "VideoEntity";
+
+		if (typeof spec === "object" && spec.$type == ProtoMovieEntity) {
+			if (typeof spec.params === "object") {
+				this.version = spec.ver;
+				this.videoSize.width = spec.params.viewBoxWidth || 0.0;
+				this.videoSize.height = spec.params.viewBoxHeight || 0.0;
+				this.FPS = spec.params.fps || 20;
+				this.frames = spec.params.frames || 0;
+			}
+			this.resetSprites(spec)
+			this.audios = spec.audios
+		} else if (spec) {
+			if (spec.movie) {
+				if (spec.movie.viewBox) {
+					this.videoSize.width = parseFloat(spec.movie.viewBox.width) || 0.0;
+					this.videoSize.height = parseFloat(spec.movie.viewBox.height) || 0.0;
+				}
+				this.version = spec.ver;
+				this.FPS = parseInt(spec.movie.fps) || 20;
+				this.frames = parseInt(spec.movie.frames) || 0;
+			}
+			this.resetSprites(spec)
+		}
+		if (images) {
+			this.images = images
+		}
+	}
+
+	resetSprites(spec) {
+		if (spec.sprites instanceof Array) {
+			this.sprites = spec.sprites.map((obj) => {
+				return new SpriteEntity(obj)
+			})
+		}
+	}
+
+	destroy() {
+
+	}
+}
\ No newline at end of file

src/svga/bezierPath.ts

+export class BezierPath {
+
+	_d;
+	_transform;
+	_styles;
+	_shape;
+
+	constructor(d?, transform?, styles?) {
+		this._d = d;
+		this._transform = transform;
+		this._styles = styles;
+	}
+
+}
\ No newline at end of file

src/svga/ellipsePath.ts

+import {BezierPath} from './bezierPath'
+
+export class EllipsePath extends BezierPath {
+
+	_x;
+	_y;
+	_radiusX;
+	_radiusY;
+	_transform;
+	_styles;
+
+	constructor(x, y, radiusX, radiusY, transform, styles) {
+		super();
+		this._x = x;
+		this._y = y;
+		this._radiusX = radiusX;
+		this._radiusY = radiusY;
+		this._transform = transform;
+		this._styles = styles;
+	}
+
+}
\ No newline at end of file

src/svga/frameEntity.ts

+import {BezierPath} from './bezierPath'
+
+export class FrameEntity {
+
+	alpha = 0.0;
+
+	transform = {
+		a: 1.0,
+		b: 0.0,
+		c: 0.0,
+		d: 1.0,
+		tx: 0.0,
+		ty: 0.0,
+	};
+
+	layout = {
+		x: 0.0,
+		y: 0.0,
+		width: 0.0,
+		height: 0.0,
+	}
+
+	nx = 0.0;
+
+	ny = 0.0;
+
+	/**
+	 * BezierPath
+	 */
+	maskPath = null;
+
+	/**
+	 * Object[]
+	 */
+	shapes = [];
+
+	constructor(spec) {
+		this.alpha = parseFloat(spec.alpha) || 0.0;
+		if (spec.layout) {
+			this.layout.x = parseFloat(spec.layout.x) || 0.0;
+			this.layout.y = parseFloat(spec.layout.y) || 0.0;
+			this.layout.width = parseFloat(spec.layout.width) || 0.0;
+			this.layout.height = parseFloat(spec.layout.height) || 0.0;
+		}
+		if (spec.transform) {
+			this.transform.a = parseFloat(spec.transform.a) || 1.0;
+			this.transform.b = parseFloat(spec.transform.b) || 0.0;
+			this.transform.c = parseFloat(spec.transform.c) || 0.0;
+			this.transform.d = parseFloat(spec.transform.d) || 1.0;
+			this.transform.tx = parseFloat(spec.transform.tx) || 0.0;
+			this.transform.ty = parseFloat(spec.transform.ty) || 0.0;
+		}
+		if (spec.clipPath && spec.clipPath.length > 0) {
+			this.maskPath = new BezierPath(spec.clipPath, undefined, {fill: "#000000"});
+		}
+		if (spec.shapes) {
+			if (spec.shapes instanceof Array) {
+				spec.shapes.forEach(shape => {
+					shape.pathArgs = shape.args;
+					switch (shape.type) {
+						case 0:
+							shape.type = "shape";
+							shape.pathArgs = shape.shape;
+							break;
+						case 1:
+							shape.type = "rect";
+							shape.pathArgs = shape.rect;
+							break;
+						case 2:
+							shape.type = "ellipse";
+							shape.pathArgs = shape.ellipse;
+							break;
+						case 3:
+							shape.type = "keep";
+							break;
+					}
+					if (shape.styles) {
+						if (shape.styles.fill) {
+							if (typeof shape.styles.fill["r"] === "number") shape.styles.fill[0] = shape.styles.fill["r"];
+							if (typeof shape.styles.fill["g"] === "number") shape.styles.fill[1] = shape.styles.fill["g"];
+							if (typeof shape.styles.fill["b"] === "number") shape.styles.fill[2] = shape.styles.fill["b"];
+							if (typeof shape.styles.fill["a"] === "number") shape.styles.fill[3] = shape.styles.fill["a"];
+						}
+						if (shape.styles.stroke) {
+							if (typeof shape.styles.stroke["r"] === "number") shape.styles.stroke[0] = shape.styles.stroke["r"];
+							if (typeof shape.styles.stroke["g"] === "number") shape.styles.stroke[1] = shape.styles.stroke["g"];
+							if (typeof shape.styles.stroke["b"] === "number") shape.styles.stroke[2] = shape.styles.stroke["b"];
+							if (typeof shape.styles.stroke["a"] === "number") shape.styles.stroke[3] = shape.styles.stroke["a"];
+						}
+						let lineDash = shape.styles.lineDash || []
+						if (shape.styles.lineDashI > 0) {
+							lineDash.push(shape.styles.lineDashI)
+						}
+						if (shape.styles.lineDashII > 0) {
+							if (lineDash.length < 1) {
+								lineDash.push(0)
+							}
+							lineDash.push(shape.styles.lineDashII)
+							lineDash.push(0)
+						}
+						if (shape.styles.lineDashIII > 0) {
+							if (lineDash.length < 2) {
+								lineDash.push(0);
+								lineDash.push(0);
+							}
+							lineDash[2] = shape.styles.lineDashIII
+						}
+						shape.styles.lineDash = lineDash
+
+						switch (shape.styles.lineJoin) {
+							case 0:
+								shape.styles.lineJoin = "miter";
+								break;
+							case 1:
+								shape.styles.lineJoin = "round";
+								break;
+							case 2:
+								shape.styles.lineJoin = "bevel";
+								break;
+						}
+
+						switch (shape.styles.lineCap) {
+							case 0:
+								shape.styles.lineCap = "butt";
+								break;
+							case 1:
+								shape.styles.lineCap = "round";
+								break;
+							case 2:
+								shape.styles.lineCap = "square";
+								break;
+						}
+					}
+				})
+			}
+			if (spec.shapes[0] && spec.shapes[0].type === "keep") {
+				this.shapes = FrameEntity.lastShapes;
+			} else {
+				this.shapes = spec.shapes
+				FrameEntity.lastShapes = spec.shapes;
+			}
+		}
+		let llx = this.transform.a * this.layout.x + this.transform.c * this.layout.y + this.transform.tx;
+		let lrx = this.transform.a * (this.layout.x + this.layout.width) + this.transform.c * this.layout.y + this.transform.tx;
+		let lbx = this.transform.a * this.layout.x + this.transform.c * (this.layout.y + this.layout.height) + this.transform.tx;
+		let rbx = this.transform.a * (this.layout.x + this.layout.width) + this.transform.c * (this.layout.y + this.layout.height) + this.transform.tx;
+		let lly = this.transform.b * this.layout.x + this.transform.d * this.layout.y + this.transform.ty;
+		let lry = this.transform.b * (this.layout.x + this.layout.width) + this.transform.d * this.layout.y + this.transform.ty;
+		let lby = this.transform.b * this.layout.x + this.transform.d * (this.layout.y + this.layout.height) + this.transform.ty;
+		let rby = this.transform.b * (this.layout.x + this.layout.width) + this.transform.d * (this.layout.y + this.layout.height) + this.transform.ty;
+		this.nx = Math.min(Math.min(lbx, rbx), Math.min(llx, lrx));
+		this.ny = Math.min(Math.min(lby, rby), Math.min(lly, lry));
+	}
+
+	static lastShapes
+}
\ No newline at end of file

src/svga/index.ts

+export {VideoEntity} from "./VideoEntity";
+export {Parser} from "./parser";
+export {MovieClip} from "./MovieClip";
+
+export * from "./svga-wrapper";
+
+import './svga-wrapper'

src/svga/mockWorker.ts

+/**
+ * 删除了很多东西，需要webgl3d项目中看
+ */
+
+
+import {ProtoMovieEntity} from "./proto";
+import {utils} from './pako/utils/common';
+import inflate from "./pako/inflate";
+
+const pako = {}
+utils.assign(pako, inflate);
+
+const Uint8ToString = function (u8a) {
+	var CHUNK_SZ = 0x8000;
+	var c = [];
+	for (var i = 0; i < u8a.length; i += CHUNK_SZ) {
+		c.push(String.fromCharCode.apply(null, u8a.subarray(i, i + CHUNK_SZ)));
+	}
+	return c.join("");
+}
+
+const actions = {
+
+	loadAssets: (url, cb, failure) => {
+
+		const req = new XMLHttpRequest()
+		req.open("GET", url, true);
+		req.responseType = "arraybuffer"
+		req.onloadend = () => {
+			actions.load_viaProto(req.response, cb, failure);
+		}
+		req.send()
+
+	},
+
+	load_viaProto: (arraybuffer, cb, failure) => {
+		try {
+			const inflatedData = pako["inflate"](arraybuffer);
+			const movieData = ProtoMovieEntity.decode(inflatedData);
+			let images = {};
+			actions._loadImages(images, undefined, movieData, function () {
+				movieData["ver"] = "2.0";
+				cb({
+					movie: movieData,
+					images,
+				})
+			})
+		} catch (err) {
+			failure && failure(err);
+			console.error(err);
+			throw err;
+		}
+	},
+
+	_loadImages: function (images, zip, movieData, imagesLoadedBlock) {
+		if (typeof movieData === "object" && movieData.$type == ProtoMovieEntity) {
+			var finished = true;
+			if (!zip) {
+				for (const key in movieData.images) {
+					if (movieData.images.hasOwnProperty(key)) {
+						const element = movieData.images[key];
+						const value = Uint8ToString(element);
+						images[key] = btoa(value)
+					}
+				}
+			} else {
+				for (const key in movieData.images) {
+					if (movieData.images.hasOwnProperty(key)) {
+						const element = movieData.images[key];
+						const value = Uint8ToString(element);
+						if (images.hasOwnProperty(key)) {
+							continue;
+						}
+						finished = false;
+						zip.file(value + ".png").async("base64").then(function (data) {
+							images[key] = data;
+							actions._loadImages(images, zip, movieData, imagesLoadedBlock);
+						}.bind(this))
+						break;
+					}
+				}
+			}
+			finished && imagesLoadedBlock.call(this)
+		} else {
+			var finished = true;
+			for (var key in movieData.images) {
+				if (movieData.images.hasOwnProperty(key)) {
+					var element = movieData.images[key];
+					if (images.hasOwnProperty(key)) {
+						continue;
+					}
+					finished = false;
+					zip.file(element + ".png").async("base64").then(function (data) {
+						images[key] = data;
+						actions._loadImages(images, zip, movieData, imagesLoadedBlock);
+					}.bind(this))
+					break;
+				}
+			}
+			finished && imagesLoadedBlock.call(this)
+		}
+	},
+}
+
+export default (data, cb, failure) => {
+	actions['loadAssets'](data, cb, failure);
+}

src/svga/pako/inflate.ts

+'use strict';
+
+import {strings} from "./utils/strings"
+import {utils} from "./utils/common"
+import zlib_inflate from './zlib/inflate';
+
+import c from './zlib/constants';
+import msg from './zlib/messages';
+import ZStream from './zlib/zstream';
+import GZheader from './zlib/gzheader';
+
+var toString = Object.prototype.toString;
+
+/**
+ * class Inflate
+ *
+ * Generic JS-style wrapper for zlib calls. If you don't need
+ * streaming behaviour - use more simple functions: [[inflate]]
+ * and [[inflateRaw]].
+ **/
+
+/* internal
+ * inflate.chunks -> Array
+ *
+ * Chunks of output data, if [[Inflate#onData]] not overridden.
+ **/
+
+/**
+ * Inflate.result -> Uint8Array|Array|String
+ *
+ * Uncompressed result, generated by default [[Inflate#onData]]
+ * and [[Inflate#onEnd]] handlers. Filled after you push last chunk
+ * (call [[Inflate#push]] with `Z_FINISH` / `true` param) or if you
+ * push a chunk with explicit flush (call [[Inflate#push]] with
+ * `Z_SYNC_FLUSH` param).
+ **/
+
+/**
+ * Inflate.err -> Number
+ *
+ * Error code after inflate finished. 0 (Z_OK) on success.
+ * Should be checked if broken data possible.
+ **/
+
+/**
+ * Inflate.msg -> String
+ *
+ * Error message, if [[Inflate.err]] != 0
+ **/
+
+
+/**
+ * new Inflate(options)
+ * - options (Object): zlib inflate options.
+ *
+ * Creates new inflator instance with specified params. Throws exception
+ * on bad params. Supported options:
+ *
+ * - `windowBits`
+ * - `dictionary`
+ *
+ * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
+ * for more information on these.
+ *
+ * Additional options, for internal needs:
+ *
+ * - `chunkSize` - size of generated data chunks (16K by default)
+ * - `raw` (Boolean) - do raw inflate
+ * - `to` (String) - if equal to 'string', then result will be converted
+ *   from utf8 to utf16 (javascript) string. When string output requested,
+ *   chunk length can differ from `chunkSize`, depending on content.
+ *
+ * By default, when no options set, autodetect deflate/gzip data format via
+ * wrapper header.
+ *
+ * ##### Example:
+ *
+ * ```javascript
+ * var pako = require('pako')
+ *   , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])
+ *   , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);
+ *
+ * var inflate = new pako.Inflate({ level: 3});
+ *
+ * inflate.push(chunk1, false);
+ * inflate.push(chunk2, true);  // true -> last chunk
+ *
+ * if (inflate.err) { throw new Error(inflate.err); }
+ *
+ * console.log(inflate.result);
+ * ```
+ **/
+function Inflate(options) {
+	// if (!(this instanceof Inflate)) return new Inflate(options);
+
+	this.options = utils.assign({
+		chunkSize: 16384,
+		windowBits: 0,
+		to: ''
+	}, options || {});
+
+	var opt = this.options;
+
+	// Force window size for `raw` data, if not set directly,
+	// because we have no header for autodetect.
+	if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {
+		opt.windowBits = -opt.windowBits;
+		if (opt.windowBits === 0) {
+			opt.windowBits = -15;
+		}
+	}
+
+	// If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate
+	if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&
+		!(options && options.windowBits)) {
+		opt.windowBits += 32;
+	}
+
+	// Gzip header has no info about windows size, we can do autodetect only
+	// for deflate. So, if window size not set, force it to max when gzip possible
+	if ((opt.windowBits > 15) && (opt.windowBits < 48)) {
+		// bit 3 (16) -> gzipped data
+		// bit 4 (32) -> autodetect gzip/deflate
+		if ((opt.windowBits & 15) === 0) {
+			opt.windowBits |= 15;
+		}
+	}
+
+	this.err = 0;      // error code, if happens (0 = Z_OK)
+	this.msg = '';     // error message
+	this.ended = false;  // used to avoid multiple onEnd() calls
+	this.chunks = [];     // chunks of compressed data
+
+	this.strm = new ZStream();
+	this.strm.avail_out = 0;
+
+	var status = zlib_inflate.inflateInit2(
+		this.strm,
+		opt.windowBits
+	);
+
+	if (status !== c.Z_OK) {
+		throw new Error(msg[status]);
+	}
+
+	this.header = new GZheader();
+
+	zlib_inflate.inflateGetHeader(this.strm, this.header);
+
+	// Setup dictionary
+	if (opt.dictionary) {
+		// Convert data if needed
+		if (typeof opt.dictionary === 'string') {
+			opt.dictionary = strings.string2buf(opt.dictionary);
+		} else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {
+			opt.dictionary = new Uint8Array(opt.dictionary);
+		}
+		if (opt.raw) { //In raw mode we need to set the dictionary early
+			status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);
+			if (status !== c.Z_OK) {
+				throw new Error(msg[status]);
+			}
+		}
+	}
+}
+
+/**
+ * Inflate#push(data[, mode]) -> Boolean
+ * - data (Uint8Array|Array|ArrayBuffer|String): input data
+ * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.
+ *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.
+ *
+ * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with
+ * new output chunks. Returns `true` on success. The last data block must have
+ * mode Z_FINISH (or `true`). That will flush internal pending buffers and call
+ * [[Inflate#onEnd]]. For interim explicit flushes (without ending the stream) you
+ * can use mode Z_SYNC_FLUSH, keeping the decompression context.
+ *
+ * On fail call [[Inflate#onEnd]] with error code and return false.
+ *
+ * We strongly recommend to use `Uint8Array` on input for best speed (output
+ * format is detected automatically). Also, don't skip last param and always
+ * use the same type in your code (boolean or number). That will improve JS speed.
+ *
+ * For regular `Array`-s make sure all elements are [0..255].
+ *
+ * ##### Example
+ *
+ * ```javascript
+ * push(chunk, false); // push one of data chunks
+ * ...
+ * push(chunk, true);  // push last chunk
+ * ```
+ **/
+Inflate.prototype.push = function (data, mode) {
+	var strm = this.strm;
+	var chunkSize = this.options.chunkSize;
+	var dictionary = this.options.dictionary;
+	var status, _mode;
+	var next_out_utf8, tail, utf8str;
+
+	// Flag to properly process Z_BUF_ERROR on testing inflate call
+	// when we check that all output data was flushed.
+	var allowBufError = false;
+
+	if (this.ended) {
+		return false;
+	}
+	_mode = (mode === ~~mode) ? mode : ((mode === true) ? c.Z_FINISH : c.Z_NO_FLUSH);
+
+	// Convert data if needed
+	if (typeof data === 'string') {
+		// Only binary strings can be decompressed on practice
+		strm.input = strings.binstring2buf(data);
+	} else if (toString.call(data) === '[object ArrayBuffer]') {
+		strm.input = new Uint8Array(data);
+	} else {
+		strm.input = data;
+	}
+
+	strm.next_in = 0;
+	strm.avail_in = strm.input.length;
+
+	do {
+		if (strm.avail_out === 0) {
+			strm.output = new utils.Buf8(chunkSize);
+			strm.next_out = 0;
+			strm.avail_out = chunkSize;
+		}
+
+		status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH);    /* no bad return value */
+
+		if (status === c.Z_NEED_DICT && dictionary) {
+			status = zlib_inflate.inflateSetDictionary(this.strm, dictionary);
+		}
+
+		if (status === c.Z_BUF_ERROR && allowBufError === true) {
+			status = c.Z_OK;
+			allowBufError = false;
+		}
+
+		if (status !== c.Z_STREAM_END && status !== c.Z_OK) {
+			this.onEnd(status);
+			this.ended = true;
+			return false;
+		}
+
+		if (strm.next_out) {
+			if (strm.avail_out === 0 || status === c.Z_STREAM_END || (strm.avail_in === 0 && (_mode === c.Z_FINISH || _mode === c.Z_SYNC_FLUSH))) {
+
+				if (this.options.to === 'string') {
+
+					next_out_utf8 = strings.utf8border(strm.output, strm.next_out);
+
+					tail = strm.next_out - next_out_utf8;
+					utf8str = strings.buf2string(strm.output, next_out_utf8);
+
+					// move tail
+					strm.next_out = tail;
+					strm.avail_out = chunkSize - tail;
+					if (tail) {
+						utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0);
+					}
+
+					this.onData(utf8str);
+
+				} else {
+					this.onData(utils.shrinkBuf(strm.output, strm.next_out));
+				}
+			}
+		}
+
+		// When no more input data, we should check that internal inflate buffers
+		// are flushed. The only way to do it when avail_out = 0 - run one more
+		// inflate pass. But if output data not exists, inflate return Z_BUF_ERROR.
+		// Here we set flag to process this error properly.
+		//
+		// NOTE. Deflate does not return error in this case and does not needs such
+		// logic.
+		if (strm.avail_in === 0 && strm.avail_out === 0) {
+			allowBufError = true;
+		}
+
+	} while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== c.Z_STREAM_END);
+
+	if (status === c.Z_STREAM_END) {
+		_mode = c.Z_FINISH;
+	}
+
+	// Finalize on the last chunk.
+	if (_mode === c.Z_FINISH) {
+		status = zlib_inflate.inflateEnd(this.strm);
+		this.onEnd(status);
+		this.ended = true;
+		return status === c.Z_OK;
+	}
+
+	// callback interim results if Z_SYNC_FLUSH.
+	if (_mode === c.Z_SYNC_FLUSH) {
+		this.onEnd(c.Z_OK);
+		strm.avail_out = 0;
+		return true;
+	}
+
+	return true;
+};
+
+
+/**
+ * Inflate#onData(chunk) -> Void
+ * - chunk (Uint8Array|Array|String): output data. Type of array depends
+ *   on js engine support. When string output requested, each chunk
+ *   will be string.
+ *
+ * By default, stores data blocks in `chunks[]` property and glue
+ * those in `onEnd`. Override this handler, if you need another behaviour.
+ **/
+Inflate.prototype.onData = function (chunk) {
+	this.chunks.push(chunk);
+};
+
+
+/**
+ * Inflate#onEnd(status) -> Void
+ * - status (Number): inflate status. 0 (Z_OK) on success,
+ *   other if not.
+ *
+ * Called either after you tell inflate that the input stream is
+ * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)
+ * or if an error happened. By default - join collected chunks,
+ * free memory and fill `results` / `err` properties.
+ **/
+Inflate.prototype.onEnd = function (status) {
+	// On success - join
+	if (status === c.Z_OK) {
+		if (this.options.to === 'string') {
+			// Glue & convert here, until we teach pako to send
+			// utf8 aligned strings to onData
+			this.result = this.chunks.join('');
+		} else {
+			this.result = utils.flattenChunks(this.chunks);
+		}
+	}
+	this.chunks = [];
+	this.err = status;
+	this.msg = this.strm.msg;
+};
+
+
+/**
+ * inflate(data[, options]) -> Uint8Array|Array|String
+ * - data (Uint8Array|Array|String): input data to decompress.
+ * - options (Object): zlib inflate options.
+ *
+ * Decompress `data` with inflate/ungzip and `options`. Autodetect
+ * format via wrapper header by default. That's why we don't provide
+ * separate `ungzip` method.
+ *
+ * Supported options are:
+ *
+ * - windowBits
+ *
+ * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
+ * for more information.
+ *
+ * Sugar (options):
+ *
+ * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify
+ *   negative windowBits implicitly.
+ * - `to` (String) - if equal to 'string', then result will be converted
+ *   from utf8 to utf16 (javascript) string. When string output requested,
+ *   chunk length can differ from `chunkSize`, depending on content.
+ *
+ *
+ * ##### Example:
+ *
+ * ```javascript
+ * var pako = require('pako')
+ *   , input = pako.deflate([1,2,3,4,5,6,7,8,9])
+ *   , output;
+ *
+ * try {
+ *   output = pako.inflate(input);
+ * } catch (err)
+ *   console.log(err);
+ * }
+ * ```
+ **/
+function inflate(input, options) {
+	var inflator = new Inflate(options);
+
+	inflator.push(input, true);
+
+	// That will never happens, if you don't cheat with options :)
+	if (inflator.err) {
+		throw inflator.msg || msg[inflator.err];
+	}
+
+	return inflator.result;
+}
+
+
+/**
+ * inflateRaw(data[, options]) -> Uint8Array|Array|String
+ * - data (Uint8Array|Array|String): input data to decompress.
+ * - options (Object): zlib inflate options.
+ *
+ * The same as [[inflate]], but creates raw data, without wrapper
+ * (header and adler32 crc).
+ **/
+function inflateRaw(input, options) {
+	options = options || {};
+	options.raw = true;
+	return inflate(input, options);
+}
+
+
+/**
+ * ungzip(data[, options]) -> Uint8Array|Array|String
+ * - data (Uint8Array|Array|String): input data to decompress.
+ * - options (Object): zlib inflate options.
+ *
+ * Just shortcut to [[inflate]], because it autodetects format
+ * by header.content. Done for convenience.
+ **/
+
+
+// exports.Inflate = Inflate;
+// exports.inflate = inflate;
+// exports.inflateRaw = inflateRaw;
+// exports.ungzip  = inflate;
+
+export default {inflate}

src/svga/pako/utils/common.ts

+'use strict';
+
+
+var TYPED_OK = (typeof Uint8Array !== 'undefined') &&
+	(typeof Uint16Array !== 'undefined') &&
+	(typeof Int32Array !== 'undefined');
+
+function _has(obj, key) {
+	return Object.prototype.hasOwnProperty.call(obj, key);
+}
+
+function assign(obj, objO) {
+	// var sources = Array.prototype.slice.call(arguments, 1);
+	// while (sources.length) {
+	//   var source = sources.shift();
+	//   if (!source) { continue; }
+
+	//   if (typeof source !== 'object') {
+	//     throw new TypeError(source + 'must be non-object');
+	//   }
+
+	//   for (var p in source) {
+	//     if (_has(source, p)) {
+	//       obj[p] = source[p];
+	//     }
+	//   }
+	// }
+	for (var p in objO) {
+		if (_has(objO, p)) {
+			obj[p] = objO[p];
+		}
+	}
+
+	return obj;
+};
+
+
+// reduce buffer size, avoiding mem copy
+function shrinkBuf(buf, size) {
+	if (buf.length === size) {
+		return buf;
+	}
+	if (buf.subarray) {
+		return buf.subarray(0, size);
+	}
+	buf.length = size;
+	return buf;
+};
+
+
+var fnTyped = {
+	arraySet: function (dest, src, src_offs, len, dest_offs) {
+		if (src.subarray && dest.subarray) {
+			dest.set(src.subarray(src_offs, src_offs + len), dest_offs);
+			return;
+		}
+		// Fallback to ordinary array
+		for (var i = 0; i < len; i++) {
+			dest[dest_offs + i] = src[src_offs + i];
+		}
+	},
+	// Join array of chunks to single array.
+	flattenChunks: function (chunks) {
+		var i, l, len, pos, chunk, result;
+
+		// calculate data length
+		len = 0;
+		for (i = 0, l = chunks.length; i < l; i++) {
+			len += chunks[i].length;
+		}
+
+		// join chunks
+		result = new Uint8Array(len);
+		pos = 0;
+		for (i = 0, l = chunks.length; i < l; i++) {
+			chunk = chunks[i];
+			result.set(chunk, pos);
+			pos += chunk.length;
+		}
+
+		return result;
+	}
+};
+
+var fnUntyped = {
+	arraySet: function (dest, src, src_offs, len, dest_offs) {
+		for (var i = 0; i < len; i++) {
+			dest[dest_offs + i] = src[src_offs + i];
+		}
+	},
+	// Join array of chunks to single array.
+	flattenChunks: function (chunks) {
+		return [].concat.apply([], chunks);
+	}
+};
+
+
+// Enable/Disable typed arrays use, for testing
+let Buf8, Buf16, Buf32, arraySet, flattenChunks
+
+if (TYPED_OK) {
+	Buf8 = Uint8Array;
+	Buf16 = Uint16Array;
+	Buf32 = Int32Array;
+	arraySet = fnTyped.arraySet;
+	flattenChunks = fnTyped.flattenChunks
+} else {
+	Buf8 = Array;
+	Buf16 = Array;
+	Buf32 = Array;
+	arraySet = fnUntyped.arraySet;
+	flattenChunks = fnUntyped.flattenChunks
+}
+
+
+export const utils = {
+	assign,
+	shrinkBuf,
+	Buf8,
+	Buf16,
+	Buf32,
+	arraySet,
+	flattenChunks
+};

src/svga/pako/utils/strings.ts

+// String encode/decode helpers
+'use strict';
+
+import {utils} from "./common"
+
+// Quick check if we can use fast array to bin string conversion
+//
+// - apply(Array) can fail on Android 2.2
+// - apply(Uint8Array) can fail on iOS 5.1 Safari
+//
+var STR_APPLY_OK = true;
+var STR_APPLY_UIA_OK = true;
+
+try {
+	String.fromCharCode.apply(null, [0]);
+} catch (__) {
+	STR_APPLY_OK = false;
+}
+try {
+	String.fromCharCode.apply(null, new Uint8Array(1));
+} catch (__) {
+	STR_APPLY_UIA_OK = false;
+}
+
+
+// Table with utf8 lengths (calculated by first byte of sequence)
+// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,
+// because max possible codepoint is 0x10ffff
+var _utf8len = new utils.Buf8(256);
+for (var q = 0; q < 256; q++) {
+	_utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);
+}
+_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start
+
+
+// convert string to array (typed, when possible)
+function string2buf(str) {
+	var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;
+
+	// count binary size
+	for (m_pos = 0; m_pos < str_len; m_pos++) {
+		c = str.charCodeAt(m_pos);
+		if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {
+			c2 = str.charCodeAt(m_pos + 1);
+			if ((c2 & 0xfc00) === 0xdc00) {
+				c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);
+				m_pos++;
+			}
+		}
+		buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;
+	}
+
+	// allocate buffer
+	buf = new utils.Buf8(buf_len);
+
+	// convert
+	for (i = 0, m_pos = 0; i < buf_len; m_pos++) {
+		c = str.charCodeAt(m_pos);
+		if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {
+			c2 = str.charCodeAt(m_pos + 1);
+			if ((c2 & 0xfc00) === 0xdc00) {
+				c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);
+				m_pos++;
+			}
+		}
+		if (c < 0x80) {
+			/* one byte */
+			buf[i++] = c;
+		} else if (c < 0x800) {
+			/* two bytes */
+			buf[i++] = 0xC0 | (c >>> 6);
+			buf[i++] = 0x80 | (c & 0x3f);
+		} else if (c < 0x10000) {
+			/* three bytes */
+			buf[i++] = 0xE0 | (c >>> 12);
+			buf[i++] = 0x80 | (c >>> 6 & 0x3f);
+			buf[i++] = 0x80 | (c & 0x3f);
+		} else {
+			/* four bytes */
+			buf[i++] = 0xf0 | (c >>> 18);
+			buf[i++] = 0x80 | (c >>> 12 & 0x3f);
+			buf[i++] = 0x80 | (c >>> 6 & 0x3f);
+			buf[i++] = 0x80 | (c & 0x3f);
+		}
+	}
+
+	return buf;
+};
+
+// Helper (used in 2 places)
+function buf2binstring(buf, len?) {
+	// On Chrome, the arguments in a function call that are allowed is `65534`.
+	// If the length of the buffer is smaller than that, we can use this optimization,
+	// otherwise we will take a slower path.
+	len = len || buf.length;
+	if (len < 65534) {
+		if ((buf.subarray && STR_APPLY_UIA_OK) || (!buf.subarray && STR_APPLY_OK)) {
+			return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));
+		}
+	}
+
+	var result = '';
+	for (var i = 0; i < len; i++) {
+		result += String.fromCharCode(buf[i]);
+	}
+	return result;
+}
+
+// Convert binary string (typed, when possible)
+function binstring2buf(str) {
+	var buf = new utils.Buf8(str.length);
+	for (var i = 0, len = buf.length; i < len; i++) {
+		buf[i] = str.charCodeAt(i);
+	}
+	return buf;
+};
+
+
+// convert array to string
+function buf2string(buf, max) {
+	var i, out, c, c_len;
+	var len = max || buf.length;
+
+	// Reserve max possible length (2 words per char)
+	// NB: by unknown reasons, Array is significantly faster for
+	//     String.fromCharCode.apply than Uint16Array.
+	var utf16buf = new Array(len * 2);
+
+	for (out = 0, i = 0; i < len;) {
+		c = buf[i++];
+		// quick process ascii
+		if (c < 0x80) {
+			utf16buf[out++] = c;
+			continue;
+		}
+
+		c_len = _utf8len[c];
+		// skip 5 & 6 byte codes
+		if (c_len > 4) {
+			utf16buf[out++] = 0xfffd;
+			i += c_len - 1;
+			continue;
+		}
+
+		// apply mask on first byte
+		c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;
+		// join the rest
+		while (c_len > 1 && i < len) {
+			c = (c << 6) | (buf[i++] & 0x3f);
+			c_len--;
+		}
+
+		// terminated by end of string?
+		if (c_len > 1) {
+			utf16buf[out++] = 0xfffd;
+			continue;
+		}
+
+		if (c < 0x10000) {
+			utf16buf[out++] = c;
+		} else {
+			c -= 0x10000;
+			utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);
+			utf16buf[out++] = 0xdc00 | (c & 0x3ff);
+		}
+	}
+
+	return buf2binstring(utf16buf, out);
+};
+
+
+// Calculate max possible position in utf8 buffer,
+// that will not break sequence. If that's not possible
+// - (very small limits) return max size as is.
+//
+// buf[] - utf8 bytes array
+// max   - length limit (mandatory);
+function utf8border(buf, max) {
+	var pos;
+
+	max = max || buf.length;
+	if (max > buf.length) {
+		max = buf.length;
+	}
+
+	// go back from last position, until start of sequence found
+	pos = max - 1;
+	while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) {
+		pos--;
+	}
+
+	// Very small and broken sequence,
+	// return max, because we should return something anyway.
+	if (pos < 0) {
+		return max;
+	}
+
+	// If we came to start of buffer - that means buffer is too small,
+	// return max too.
+	if (pos === 0) {
+		return max;
+	}
+
+	return (pos + _utf8len[buf[pos]] > max) ? pos : max;
+};
+
+export const strings = {
+	utf8border,
+	buf2string,
+	binstring2buf,
+	buf2binstring,
+	string2buf
+}

src/svga/pako/zlib/adler32.ts

+'use strict';
+
+// Note: adler32 takes 12% for level 0 and 2% for level 6.
+// It isn't worth it to make additional optimizations as in original.
+// Small size is preferable.
+
+// (C) 1995-2013 Jean-loup Gailly and Mark Adler
+// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+//
+// This software is provided 'as-is', without any express or implied
+// warranty. In no event will the authors be held liable for any damages
+// arising from the use of this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+// 1. The origin of this software must not be misrepresented; you must not
+//   claim that you wrote the original software. If you use this software
+//   in a product, an acknowledgment in the product documentation would be
+//   appreciated but is not required.
+// 2. Altered source versions must be plainly marked as such, and must not be
+//   misrepresented as being the original software.
+// 3. This notice may not be removed or altered from any source distribution.
+
+function adler32(adler, buf, len, pos) {
+	var s1 = (adler & 0xffff) | 0,
+		s2 = ((adler >>> 16) & 0xffff) | 0,
+		n = 0;
+
+	while (len !== 0) {
+		// Set limit ~ twice less than 5552, to keep
+		// s2 in 31-bits, because we force signed ints.
+		// in other case %= will fail.
+		n = len > 2000 ? 2000 : len;
+		len -= n;
+
+		do {
+			s1 = (s1 + buf[pos++]) | 0;
+			s2 = (s2 + s1) | 0;
+		} while (--n);
+
+		s1 %= 65521;
+		s2 %= 65521;
+	}
+
+	return (s1 | (s2 << 16)) | 0;
+}
+
+
+export default adler32;

src/svga/pako/zlib/constants.ts

+'use strict';
+
+// (C) 1995-2013 Jean-loup Gailly and Mark Adler
+// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+//
+// This software is provided 'as-is', without any express or implied
+// warranty. In no event will the authors be held liable for any damages
+// arising from the use of this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+// 1. The origin of this software must not be misrepresented; you must not
+//   claim that you wrote the original software. If you use this software
+//   in a product, an acknowledgment in the product documentation would be
+//   appreciated but is not required.
+// 2. Altered source versions must be plainly marked as such, and must not be
+//   misrepresented as being the original software.
+// 3. This notice may not be removed or altered from any source distribution.
+
+export default {
+
+	/* Allowed flush values; see deflate() and inflate() below for details */
+	Z_NO_FLUSH: 0,
+	Z_PARTIAL_FLUSH: 1,
+	Z_SYNC_FLUSH: 2,
+	Z_FULL_FLUSH: 3,
+	Z_FINISH: 4,
+	Z_BLOCK: 5,
+	Z_TREES: 6,
+
+	/* Return codes for the compression/decompression functions. Negative values
+	* are errors, positive values are used for special but normal events.
+	*/
+	Z_OK: 0,
+	Z_STREAM_END: 1,
+	Z_NEED_DICT: 2,
+	Z_ERRNO: -1,
+	Z_STREAM_ERROR: -2,
+	Z_DATA_ERROR: -3,
+	//Z_MEM_ERROR:     -4,
+	Z_BUF_ERROR: -5,
+	//Z_VERSION_ERROR: -6,
+
+	/* compression levels */
+	Z_NO_COMPRESSION: 0,
+	Z_BEST_SPEED: 1,
+	Z_BEST_COMPRESSION: 9,
+	Z_DEFAULT_COMPRESSION: -1,
+
+
+	Z_FILTERED: 1,
+	Z_HUFFMAN_ONLY: 2,
+	Z_RLE: 3,
+	Z_FIXED: 4,
+	Z_DEFAULT_STRATEGY: 0,
+
+	/* Possible values of the data_type field (though see inflate()) */
+	Z_BINARY: 0,
+	Z_TEXT: 1,
+	//Z_ASCII:                1, // = Z_TEXT (deprecated)
+	Z_UNKNOWN: 2,
+
+	/* The deflate compression method */
+	Z_DEFLATED: 8
+	//Z_NULL:                 null // Use -1 or null inline, depending on var type
+};

src/svga/pako/zlib/crc32.ts

+'use strict';
+
+// Note: we can't get significant speed boost here.
+// So write code to minimize size - no pregenerated tables
+// and array tools dependencies.
+
+// (C) 1995-2013 Jean-loup Gailly and Mark Adler
+// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+//
+// This software is provided 'as-is', without any express or implied
+// warranty. In no event will the authors be held liable for any damages
+// arising from the use of this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+// 1. The origin of this software must not be misrepresented; you must not
+//   claim that you wrote the original software. If you use this software
+//   in a product, an acknowledgment in the product documentation would be
+//   appreciated but is not required.
+// 2. Altered source versions must be plainly marked as such, and must not be
+//   misrepresented as being the original software.
+// 3. This notice may not be removed or altered from any source distribution.
+
+// Use ordinary array, since untyped makes no boost here
+function makeTable() {
+	var c, table = [];
+
+	for (var n = 0; n < 256; n++) {
+		c = n;
+		for (var k = 0; k < 8; k++) {
+			c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));
+		}
+		table[n] = c;
+	}
+
+	return table;
+}
+
+// Create table on load. Just 255 signed longs. Not a problem.
+var crcTable = makeTable();
+
+
+function crc32(crc, buf, len, pos) {
+	var t = crcTable,
+		end = pos + len;
+
+	crc ^= -1;
+
+	for (var i = pos; i < end; i++) {
+		crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];
+	}
+
+	return (crc ^ (-1)); // >>> 0;
+}
+
+
+export default crc32;

src/svga/pako/zlib/deflate.ts

+'use strict';
+
+// (C) 1995-2013 Jean-loup Gailly and Mark Adler
+// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+//
+// This software is provided 'as-is', without any express or implied
+// warranty. In no event will the authors be held liable for any damages
+// arising from the use of this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+// 1. The origin of this software must not be misrepresented; you must not
+//   claim that you wrote the original software. If you use this software
+//   in a product, an acknowledgment in the product documentation would be
+//   appreciated but is not required.
+// 2. Altered source versions must be plainly marked as such, and must not be
+//   misrepresented as being the original software.
+// 3. This notice may not be removed or altered from any source distribution.
+
+import {utils} from '../utils/common';
+
+import trees from './trees';
+import adler32 from './adler32';
+import crc32 from './crc32';
+import msg from './messages';
+
+/* Public constants ==========================================================*/
+/* ===========================================================================*/
+
+
+/* Allowed flush values; see deflate() and inflate() below for details */
+var Z_NO_FLUSH = 0;
+var Z_PARTIAL_FLUSH = 1;
+//var Z_SYNC_FLUSH    = 2;
+var Z_FULL_FLUSH = 3;
+var Z_FINISH = 4;
+var Z_BLOCK = 5;
+//var Z_TREES         = 6;
+
+
+/* Return codes for the compression/decompression functions. Negative values
+ * are errors, positive values are used for special but normal events.
+ */
+var Z_OK = 0;
+var Z_STREAM_END = 1;
+//var Z_NEED_DICT     = 2;
+//var Z_ERRNO         = -1;
+var Z_STREAM_ERROR = -2;
+var Z_DATA_ERROR = -3;
+//var Z_MEM_ERROR     = -4;
+var Z_BUF_ERROR = -5;
+//var Z_VERSION_ERROR = -6;
+
+
+/* compression levels */
+//var Z_NO_COMPRESSION      = 0;
+//var Z_BEST_SPEED          = 1;
+//var Z_BEST_COMPRESSION    = 9;
+var Z_DEFAULT_COMPRESSION = -1;
+
+
+var Z_FILTERED = 1;
+var Z_HUFFMAN_ONLY = 2;
+var Z_RLE = 3;
+var Z_FIXED = 4;
+var Z_DEFAULT_STRATEGY = 0;
+
+/* Possible values of the data_type field (though see inflate()) */
+//var Z_BINARY              = 0;
+//var Z_TEXT                = 1;
+//var Z_ASCII               = 1; // = Z_TEXT
+var Z_UNKNOWN = 2;
+
+
+/* The deflate compression method */
+var Z_DEFLATED = 8;
+
+/*============================================================================*/
+
+
+var MAX_MEM_LEVEL = 9;
+/* Maximum value for memLevel in deflateInit2 */
+var MAX_WBITS = 15;
+/* 32K LZ77 window */
+var DEF_MEM_LEVEL = 8;
+
+
+var LENGTH_CODES = 29;
+/* number of length codes, not counting the special END_BLOCK code */
+var LITERALS = 256;
+/* number of literal bytes 0..255 */
+var L_CODES = LITERALS + 1 + LENGTH_CODES;
+/* number of Literal or Length codes, including the END_BLOCK code */
+var D_CODES = 30;
+/* number of distance codes */
+var BL_CODES = 19;
+/* number of codes used to transfer the bit lengths */
+var HEAP_SIZE = 2 * L_CODES + 1;
+/* maximum heap size */
+var MAX_BITS = 15;
+/* All codes must not exceed MAX_BITS bits */
+
+var MIN_MATCH = 3;
+var MAX_MATCH = 258;
+var MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);
+
+var PRESET_DICT = 0x20;
+
+var INIT_STATE = 42;
+var EXTRA_STATE = 69;
+var NAME_STATE = 73;
+var COMMENT_STATE = 91;
+var HCRC_STATE = 103;
+var BUSY_STATE = 113;
+var FINISH_STATE = 666;
+
+var BS_NEED_MORE = 1; /* block not completed, need more input or more output */
+var BS_BLOCK_DONE = 2; /* block flush performed */
+var BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */
+var BS_FINISH_DONE = 4; /* finish done, accept no more input or output */
+
+var OS_CODE = 0x03; // Unix :) . Don't detect, use this default.
+
+function err(strm, errorCode) {
+	strm.msg = msg[errorCode];
+	return errorCode;
+}
+
+function rank(f) {
+	return ((f) << 1) - ((f) > 4 ? 9 : 0);
+}
+
+function zero(buf) {
+	var len = buf.length;
+	while (--len >= 0) {
+		buf[len] = 0;
+	}
+}
+
+
+/* =========================================================================
+ * Flush as much pending output as possible. All deflate() output goes
+ * through this function so some applications may wish to modify it
+ * to avoid allocating a large strm->output buffer and copying into it.
+ * (See also read_buf()).
+ */
+function flush_pending(strm) {
+	var s = strm.state;
+
+	//_tr_flush_bits(s);
+	var len = s.pending;
+	if (len > strm.avail_out) {
+		len = strm.avail_out;
+	}
+	if (len === 0) {
+		return;
+	}
+
+	utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);
+	strm.next_out += len;
+	s.pending_out += len;
+	strm.total_out += len;
+	strm.avail_out -= len;
+	s.pending -= len;
+	if (s.pending === 0) {
+		s.pending_out = 0;
+	}
+}
+
+
+function flush_block_only(s, last) {
+	trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);
+	s.block_start = s.strstart;
+	flush_pending(s.strm);
+}
+
+
+function put_byte(s, b) {
+	s.pending_buf[s.pending++] = b;
+}
+
+
+/* =========================================================================
+ * Put a short in the pending buffer. The 16-bit value is put in MSB order.
+ * IN assertion: the stream state is correct and there is enough room in
+ * pending_buf.
+ */
+function putShortMSB(s, b) {
+	//  put_byte(s, (Byte)(b >> 8));
+	//  put_byte(s, (Byte)(b & 0xff));
+	s.pending_buf[s.pending++] = (b >>> 8) & 0xff;
+	s.pending_buf[s.pending++] = b & 0xff;
+}
+
+
+/* ===========================================================================
+ * Read a new buffer from the current input stream, update the adler32
+ * and total number of bytes read.  All deflate() input goes through
+ * this function so some applications may wish to modify it to avoid
+ * allocating a large strm->input buffer and copying from it.
+ * (See also flush_pending()).
+ */
+function read_buf(strm, buf, start, size) {
+	var len = strm.avail_in;
+
+	if (len > size) {
+		len = size;
+	}
+	if (len === 0) {
+		return 0;
+	}
+
+	strm.avail_in -= len;
+
+	// zmemcpy(buf, strm->next_in, len);
+	utils.arraySet(buf, strm.input, strm.next_in, len, start);
+	if (strm.state.wrap === 1) {
+		strm.adler = adler32(strm.adler, buf, len, start);
+	} else if (strm.state.wrap === 2) {
+		strm.adler = crc32(strm.adler, buf, len, start);
+	}
+
+	strm.next_in += len;
+	strm.total_in += len;
+
+	return len;
+}
+
+
+/* ===========================================================================
+ * Set match_start to the longest match starting at the given string and
+ * return its length. Matches shorter or equal to prev_length are discarded,
+ * in which case the result is equal to prev_length and match_start is
+ * garbage.
+ * IN assertions: cur_match is the head of the hash chain for the current
+ *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
+ * OUT assertion: the match length is not greater than s->lookahead.
+ */
+function longest_match(s, cur_match) {
+	var chain_length = s.max_chain_length;      /* max hash chain length */
+	var scan = s.strstart; /* current string */
+	var match;                       /* matched string */
+	var len;                           /* length of current match */
+	var best_len = s.prev_length;              /* best match length so far */
+	var nice_match = s.nice_match;             /* stop if match long enough */
+	var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?
+		s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;
+
+	var _win = s.window; // shortcut
+
+	var wmask = s.w_mask;
+	var prev = s.prev;
+
+	/* Stop when cur_match becomes <= limit. To simplify the code,
+	 * we prevent matches with the string of window index 0.
+	 */
+
+	var strend = s.strstart + MAX_MATCH;
+	var scan_end1 = _win[scan + best_len - 1];
+	var scan_end = _win[scan + best_len];
+
+	/* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
+	 * It is easy to get rid of this optimization if necessary.
+	 */
+	// Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
+
+	/* Do not waste too much time if we already have a good match: */
+	if (s.prev_length >= s.good_match) {
+		chain_length >>= 2;
+	}
+	/* Do not look for matches beyond the end of the input. This is necessary
+	 * to make deflate deterministic.
+	 */
+	if (nice_match > s.lookahead) {
+		nice_match = s.lookahead;
+	}
+
+	// Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
+
+	do {
+		// Assert(cur_match < s->strstart, "no future");
+		match = cur_match;
+
+		/* Skip to next match if the match length cannot increase
+		 * or if the match length is less than 2.  Note that the checks below
+		 * for insufficient lookahead only occur occasionally for performance
+		 * reasons.  Therefore uninitialized memory will be accessed, and
+		 * conditional jumps will be made that depend on those values.
+		 * However the length of the match is limited to the lookahead, so
+		 * the output of deflate is not affected by the uninitialized values.
+		 */
+
+		if (_win[match + best_len] !== scan_end ||
+			_win[match + best_len - 1] !== scan_end1 ||
+			_win[match] !== _win[scan] ||
+			_win[++match] !== _win[scan + 1]) {
+			continue;
+		}
+
+		/* The check at best_len-1 can be removed because it will be made
+		 * again later. (This heuristic is not always a win.)
+		 * It is not necessary to compare scan[2] and match[2] since they
+		 * are always equal when the other bytes match, given that
+		 * the hash keys are equal and that HASH_BITS >= 8.
+		 */
+		scan += 2;
+		match++;
+		// Assert(*scan == *match, "match[2]?");
+
+		/* We check for insufficient lookahead only every 8th comparison;
+		 * the 256th check will be made at strstart+258.
+		 */
+		do {
+			/*jshint noempty:false*/
+		} while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
+		_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
+		_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
+		_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
+		scan < strend);
+
+		// Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
+
+		len = MAX_MATCH - (strend - scan);
+		scan = strend - MAX_MATCH;
+
+		if (len > best_len) {
+			s.match_start = cur_match;
+			best_len = len;
+			if (len >= nice_match) {
+				break;
+			}
+			scan_end1 = _win[scan + best_len - 1];
+			scan_end = _win[scan + best_len];
+		}
+	} while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);
+
+	if (best_len <= s.lookahead) {
+		return best_len;
+	}
+	return s.lookahead;
+}
+
+
+/* ===========================================================================
+ * Fill the window when the lookahead becomes insufficient.
+ * Updates strstart and lookahead.
+ *
+ * IN assertion: lookahead < MIN_LOOKAHEAD
+ * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
+ *    At least one byte has been read, or avail_in == 0; reads are
+ *    performed for at least two bytes (required for the zip translate_eol
+ *    option -- not supported here).
+ */
+function fill_window(s) {
+	var _w_size = s.w_size;
+	var p, n, m, more, str;
+
+	//Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead");
+
+	do {
+		more = s.window_size - s.lookahead - s.strstart;
+
+		// JS ints have 32 bit, block below not needed
+		/* Deal with !@#$% 64K limit: */
+		//if (sizeof(int) <= 2) {
+		//    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
+		//        more = wsize;
+		//
+		//  } else if (more == (unsigned)(-1)) {
+		//        /* Very unlikely, but possible on 16 bit machine if
+		//         * strstart == 0 && lookahead == 1 (input done a byte at time)
+		//         */
+		//        more--;
+		//    }
+		//}
+
+
+		/* If the window is almost full and there is insufficient lookahead,
+		 * move the upper half to the lower one to make room in the upper half.
+		 */
+		if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {
+
+			utils.arraySet(s.window, s.window, _w_size, _w_size, 0);
+			s.match_start -= _w_size;
+			s.strstart -= _w_size;
+			/* we now have strstart >= MAX_DIST */
+			s.block_start -= _w_size;
+
+			/* Slide the hash table (could be avoided with 32 bit values
+			 at the expense of memory usage). We slide even when level == 0
+			 to keep the hash table consistent if we switch back to level > 0
+			 later. (Using level 0 permanently is not an optimal usage of
+			 zlib, so we don't care about this pathological case.)
+			 */
+
+			n = s.hash_size;
+			p = n;
+			do {
+				m = s.head[--p];
+				s.head[p] = (m >= _w_size ? m - _w_size : 0);
+			} while (--n);
+
+			n = _w_size;
+			p = n;
+			do {
+				m = s.prev[--p];
+				s.prev[p] = (m >= _w_size ? m - _w_size : 0);
+				/* If n is not on any hash chain, prev[n] is garbage but
+				 * its value will never be used.
+				 */
+			} while (--n);
+
+			more += _w_size;
+		}
+		if (s.strm.avail_in === 0) {
+			break;
+		}
+
+		/* If there was no sliding:
+		 *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
+		 *    more == window_size - lookahead - strstart
+		 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
+		 * => more >= window_size - 2*WSIZE + 2
+		 * In the BIG_MEM or MMAP case (not yet supported),
+		 *   window_size == input_size + MIN_LOOKAHEAD  &&
+		 *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
+		 * Otherwise, window_size == 2*WSIZE so more >= 2.
+		 * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
+		 */
+		//Assert(more >= 2, "more < 2");
+		n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);
+		s.lookahead += n;
+
+		/* Initialize the hash value now that we have some input: */
+		if (s.lookahead + s.insert >= MIN_MATCH) {
+			str = s.strstart - s.insert;
+			s.ins_h = s.window[str];
+
+			/* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */
+			s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;
+			//#if MIN_MATCH != 3
+			//        Call update_hash() MIN_MATCH-3 more times
+			//#endif
+			while (s.insert) {
+				/* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */
+				s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;
+
+				s.prev[str & s.w_mask] = s.head[s.ins_h];
+				s.head[s.ins_h] = str;
+				str++;
+				s.insert--;
+				if (s.lookahead + s.insert < MIN_MATCH) {
+					break;
+				}
+			}
+		}
+		/* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
+		 * but this is not important since only literal bytes will be emitted.
+		 */
+
+	} while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);
+
+	/* If the WIN_INIT bytes after the end of the current data have never been
+	 * written, then zero those bytes in order to avoid memory check reports of
+	 * the use of uninitialized (or uninitialised as Julian writes) bytes by
+	 * the longest match routines.  Update the high water mark for the next
+	 * time through here.  WIN_INIT is set to MAX_MATCH since the longest match
+	 * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.
+	 */
+	//  if (s.high_water < s.window_size) {
+	//    var curr = s.strstart + s.lookahead;
+	//    var init = 0;
+	//
+	//    if (s.high_water < curr) {
+	//      /* Previous high water mark below current data -- zero WIN_INIT
+	//       * bytes or up to end of window, whichever is less.
+	//       */
+	//      init = s.window_size - curr;
+	//      if (init > WIN_INIT)
+	//        init = WIN_INIT;
+	//      zmemzero(s->window + curr, (unsigned)init);
+	//      s->high_water = curr + init;
+	//    }
+	//    else if (s->high_water < (ulg)curr + WIN_INIT) {
+	//      /* High water mark at or above current data, but below current data
+	//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up
+	//       * to end of window, whichever is less.
+	//       */
+	//      init = (ulg)curr + WIN_INIT - s->high_water;
+	//      if (init > s->window_size - s->high_water)
+	//        init = s->window_size - s->high_water;
+	//      zmemzero(s->window + s->high_water, (unsigned)init);
+	//      s->high_water += init;
+	//    }
+	//  }
+	//
+	//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
+	//    "not enough room for search");
+}
+
+/* ===========================================================================
+ * Copy without compression as much as possible from the input stream, return
+ * the current block state.
+ * This function does not insert new strings in the dictionary since
+ * uncompressible data is probably not useful. This function is used
+ * only for the level=0 compression option.
+ * NOTE: this function should be optimized to avoid extra copying from
+ * window to pending_buf.
+ */
+function deflate_stored(s, flush) {
+	/* Stored blocks are limited to 0xffff bytes, pending_buf is limited
+	 * to pending_buf_size, and each stored block has a 5 byte header:
+	 */
+	var max_block_size = 0xffff;
+
+	if (max_block_size > s.pending_buf_size - 5) {
+		max_block_size = s.pending_buf_size - 5;
+	}
+
+	/* Copy as much as possible from input to output: */
+	for (; ;) {
+		/* Fill the window as much as possible: */
+		if (s.lookahead <= 1) {
+
+			//Assert(s->strstart < s->w_size+MAX_DIST(s) ||
+			//  s->block_start >= (long)s->w_size, "slide too late");
+			//      if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||
+			//        s.block_start >= s.w_size)) {
+			//        throw  new Error("slide too late");
+			//      }
+
+			fill_window(s);
+			if (s.lookahead === 0 && flush === Z_NO_FLUSH) {
+				return BS_NEED_MORE;
+			}
+
+			if (s.lookahead === 0) {
+				break;
+			}
+			/* flush the current block */
+		}
+		//Assert(s->block_start >= 0L, "block gone");
+		//    if (s.block_start < 0) throw new Error("block gone");
+
+		s.strstart += s.lookahead;
+		s.lookahead = 0;
+
+		/* Emit a stored block if pending_buf will be full: */
+		var max_start = s.block_start + max_block_size;
+
+		if (s.strstart === 0 || s.strstart >= max_start) {
+			/* strstart == 0 is possible when wraparound on 16-bit machine */
+			s.lookahead = s.strstart - max_start;
+			s.strstart = max_start;
+			/*** FLUSH_BLOCK(s, 0); ***/
+			flush_block_only(s, false);
+			if (s.strm.avail_out === 0) {
+				return BS_NEED_MORE;
+			}
+			/***/
+
+
+		}
+		/* Flush if we may have to slide, otherwise block_start may become
+		 * negative and the data will be gone:
+		 */
+		if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {
+			/*** FLUSH_BLOCK(s, 0); ***/
+			flush_block_only(s, false);
+			if (s.strm.avail_out === 0) {
+				return BS_NEED_MORE;
+			}
+			/***/
+		}
+	}
+
+	s.insert = 0;
+
+	if (flush === Z_FINISH) {
+		/*** FLUSH_BLOCK(s, 1); ***/
+		flush_block_only(s, true);
+		if (s.strm.avail_out === 0) {
+			return BS_FINISH_STARTED;
+		}
+		/***/
+		return BS_FINISH_DONE;
+	}
+
+	if (s.strstart > s.block_start) {
+		/*** FLUSH_BLOCK(s, 0); ***/
+		flush_block_only(s, false);
+		if (s.strm.avail_out === 0) {
+			return BS_NEED_MORE;
+		}
+		/***/
+	}
+
+	return BS_NEED_MORE;
+}
+
+/* ===========================================================================
+ * Compress as much as possible from the input stream, return the current
+ * block state.
+ * This function does not perform lazy evaluation of matches and inserts
+ * new strings in the dictionary only for unmatched strings or for short
+ * matches. It is used only for the fast compression options.
+ */
+function deflate_fast(s, flush) {
+	var hash_head;        /* head of the hash chain */
+	var bflush;           /* set if current block must be flushed */
+
+	for (; ;) {
+		/* Make sure that we always have enough lookahead, except
+		 * at the end of the input file. We need MAX_MATCH bytes
+		 * for the next match, plus MIN_MATCH bytes to insert the
+		 * string following the next match.
+		 */
+		if (s.lookahead < MIN_LOOKAHEAD) {
+			fill_window(s);
+			if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {
+				return BS_NEED_MORE;
+			}
+			if (s.lookahead === 0) {
+				break; /* flush the current block */
+			}
+		}
+
+		/* Insert the string window[strstart .. strstart+2] in the
+		 * dictionary, and set hash_head to the head of the hash chain:
+		 */
+		hash_head = 0/*NIL*/;
+		if (s.lookahead >= MIN_MATCH) {
+			/*** INSERT_STRING(s, s.strstart, hash_head); ***/
+			s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
+			hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
+			s.head[s.ins_h] = s.strstart;
+			/***/
+		}
+
+		/* Find the longest match, discarding those <= prev_length.
+		 * At this point we have always match_length < MIN_MATCH
+		 */
+		if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {
+			/* To simplify the code, we prevent matches with the string
+			 * of window index 0 (in particular we have to avoid a match
+			 * of the string with itself at the start of the input file).
+			 */
+			s.match_length = longest_match(s, hash_head);
+			/* longest_match() sets match_start */
+		}
+		if (s.match_length >= MIN_MATCH) {
+			// check_match(s, s.strstart, s.match_start, s.match_length); // for debug only
+
+			/*** _tr_tally_dist(s, s.strstart - s.match_start,
+			 s.match_length - MIN_MATCH, bflush); ***/
+			bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);
+
+			s.lookahead -= s.match_length;
+
+			/* Insert new strings in the hash table only if the match length
+			 * is not too large. This saves time but degrades compression.
+			 */
+			if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {
+				s.match_length--; /* string at strstart already in table */
+				do {
+					s.strstart++;
+					/*** INSERT_STRING(s, s.strstart, hash_head); ***/
+					s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
+					hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
+					s.head[s.ins_h] = s.strstart;
+					/***/
+					/* strstart never exceeds WSIZE-MAX_MATCH, so there are
+					 * always MIN_MATCH bytes ahead.
+					 */
+				} while (--s.match_length !== 0);
+				s.strstart++;
+			} else {
+				s.strstart += s.match_length;
+				s.match_length = 0;
+				s.ins_h = s.window[s.strstart];
+				/* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */
+				s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;
+
+				//#if MIN_MATCH != 3
+				//                Call UPDATE_HASH() MIN_MATCH-3 more times
+				//#endif
+				/* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
+				 * matter since it will be recomputed at next deflate call.
+				 */
+			}
+		} else {
+			/* No match, output a literal byte */
+			//Tracevv((stderr,"%c", s.window[s.strstart]));
+			/*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
+			bflush = trees._tr_tally(s, 0, s.window[s.strstart]);
+
+			s.lookahead--;
+			s.strstart++;
+		}
+		if (bflush) {
+			/*** FLUSH_BLOCK(s, 0); ***/
+			flush_block_only(s, false);
+			if (s.strm.avail_out === 0) {
+				return BS_NEED_MORE;
+			}
+			/***/
+		}
+	}
+	s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);
+	if (flush === Z_FINISH) {
+		/*** FLUSH_BLOCK(s, 1); ***/
+		flush_block_only(s, true);
+		if (s.strm.avail_out === 0) {
+			return BS_FINISH_STARTED;
+		}
+		/***/
+		return BS_FINISH_DONE;
+	}
+	if (s.last_lit) {
+		/*** FLUSH_BLOCK(s, 0); ***/
+		flush_block_only(s, false);
+		if (s.strm.avail_out === 0) {
+			return BS_NEED_MORE;
+		}
+		/***/
+	}
+	return BS_BLOCK_DONE;
+}
+
+/* ===========================================================================
+ * Same as above, but achieves better compression. We use a lazy
+ * evaluation for matches: a match is finally adopted only if there is
+ * no better match at the next window position.
+ */
+function deflate_slow(s, flush) {
+	var hash_head;          /* head of hash chain */
+	var bflush;              /* set if current block must be flushed */
+
+	var max_insert;
+
+	/* Process the input block. */
+	for (; ;) {
+		/* Make sure that we always have enough lookahead, except
+		 * at the end of the input file. We need MAX_MATCH bytes
+		 * for the next match, plus MIN_MATCH bytes to insert the
+		 * string following the next match.
+		 */
+		if (s.lookahead < MIN_LOOKAHEAD) {
+			fill_window(s);
+			if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {
+				return BS_NEED_MORE;
+			}
+			if (s.lookahead === 0) {
+				break;
+			} /* flush the current block */
+		}
+
+		/* Insert the string window[strstart .. strstart+2] in the
+		 * dictionary, and set hash_head to the head of the hash chain:
+		 */
+		hash_head = 0/*NIL*/;
+		if (s.lookahead >= MIN_MATCH) {
+			/*** INSERT_STRING(s, s.strstart, hash_head); ***/
+			s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
+			hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
+			s.head[s.ins_h] = s.strstart;
+			/***/
+		}
+
+		/* Find the longest match, discarding those <= prev_length.
+		 */
+		s.prev_length = s.match_length;
+		s.prev_match = s.match_start;
+		s.match_length = MIN_MATCH - 1;
+
+		if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&
+			s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {
+			/* To simplify the code, we prevent matches with the string
+			 * of window index 0 (in particular we have to avoid a match
+			 * of the string with itself at the start of the input file).
+			 */
+			s.match_length = longest_match(s, hash_head);
+			/* longest_match() sets match_start */
+
+			if (s.match_length <= 5 &&
+				(s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {
+
+				/* If prev_match is also MIN_MATCH, match_start is garbage
+				 * but we will ignore the current match anyway.
+				 */
+				s.match_length = MIN_MATCH - 1;
+			}
+		}
+		/* If there was a match at the previous step and the current
+		 * match is not better, output the previous match:
+		 */
+		if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {
+			max_insert = s.strstart + s.lookahead - MIN_MATCH;
+			/* Do not insert strings in hash table beyond this. */
+
+			//check_match(s, s.strstart-1, s.prev_match, s.prev_length);
+
+			/***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,
+			 s.prev_length - MIN_MATCH, bflush);***/
+			bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);
+			/* Insert in hash table all strings up to the end of the match.
+			 * strstart-1 and strstart are already inserted. If there is not
+			 * enough lookahead, the last two strings are not inserted in
+			 * the hash table.
+			 */
+			s.lookahead -= s.prev_length - 1;
+			s.prev_length -= 2;
+			do {
+				if (++s.strstart <= max_insert) {
+					/*** INSERT_STRING(s, s.strstart, hash_head); ***/
+					s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
+					hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
+					s.head[s.ins_h] = s.strstart;
+					/***/
+				}
+			} while (--s.prev_length !== 0);
+			s.match_available = 0;
+			s.match_length = MIN_MATCH - 1;
+			s.strstart++;
+
+			if (bflush) {
+				/*** FLUSH_BLOCK(s, 0); ***/
+				flush_block_only(s, false);
+				if (s.strm.avail_out === 0) {
+					return BS_NEED_MORE;
+				}
+				/***/
+			}
+
+		} else if (s.match_available) {
+			/* If there was no match at the previous position, output a
+			 * single literal. If there was a match but the current match
+			 * is longer, truncate the previous match to a single literal.
+			 */
+			//Tracevv((stderr,"%c", s->window[s->strstart-1]));
+			/*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/
+			bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);
+
+			if (bflush) {
+				/*** FLUSH_BLOCK_ONLY(s, 0) ***/
+				flush_block_only(s, false);
+				/***/
+			}
+			s.strstart++;
+			s.lookahead--;
+			if (s.strm.avail_out === 0) {
+				return BS_NEED_MORE;
+			}
+		} else {
+			/* There is no previous match to compare with, wait for
+			 * the next step to decide.
+			 */
+			s.match_available = 1;
+			s.strstart++;
+			s.lookahead--;
+		}
+	}
+	//Assert (flush != Z_NO_FLUSH, "no flush?");
+	if (s.match_available) {
+		//Tracevv((stderr,"%c", s->window[s->strstart-1]));
+		/*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/
+		bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);
+
+		s.match_available = 0;
+	}
+	s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;
+	if (flush === Z_FINISH) {
+		/*** FLUSH_BLOCK(s, 1); ***/
+		flush_block_only(s, true);
+		if (s.strm.avail_out === 0) {
+			return BS_FINISH_STARTED;
+		}
+		/***/
+		return BS_FINISH_DONE;
+	}
+	if (s.last_lit) {
+		/*** FLUSH_BLOCK(s, 0); ***/
+		flush_block_only(s, false);
+		if (s.strm.avail_out === 0) {
+			return BS_NEED_MORE;
+		}
+		/***/
+	}
+
+	return BS_BLOCK_DONE;
+}
+
+
+/* ===========================================================================
+ * For Z_RLE, simply look for runs of bytes, generate matches only of distance
+ * one.  Do not maintain a hash table.  (It will be regenerated if this run of
+ * deflate switches away from Z_RLE.)
+ */
+function deflate_rle(s, flush) {
+	var bflush;            /* set if current block must be flushed */
+	var prev;              /* byte at distance one to match */
+	var scan, strend;      /* scan goes up to strend for length of run */
+
+	var _win = s.window;
+
+	for (; ;) {
+		/* Make sure that we always have enough lookahead, except
+		 * at the end of the input file. We need MAX_MATCH bytes
+		 * for the longest run, plus one for the unrolled loop.
+		 */
+		if (s.lookahead <= MAX_MATCH) {
+			fill_window(s);
+			if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {
+				return BS_NEED_MORE;
+			}
+			if (s.lookahead === 0) {
+				break;
+			} /* flush the current block */
+		}
+
+		/* See how many times the previous byte repeats */
+		s.match_length = 0;
+		if (s.lookahead >= MIN_MATCH && s.strstart > 0) {
+			scan = s.strstart - 1;
+			prev = _win[scan];
+			if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {
+				strend = s.strstart + MAX_MATCH;
+				do {
+					/*jshint noempty:false*/
+				} while (prev === _win[++scan] && prev === _win[++scan] &&
+				prev === _win[++scan] && prev === _win[++scan] &&
+				prev === _win[++scan] && prev === _win[++scan] &&
+				prev === _win[++scan] && prev === _win[++scan] &&
+				scan < strend);
+				s.match_length = MAX_MATCH - (strend - scan);
+				if (s.match_length > s.lookahead) {
+					s.match_length = s.lookahead;
+				}
+			}
+			//Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan");
+		}
+
+		/* Emit match if have run of MIN_MATCH or longer, else emit literal */
+		if (s.match_length >= MIN_MATCH) {
+			//check_match(s, s.strstart, s.strstart - 1, s.match_length);
+
+			/*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/
+			bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);
+
+			s.lookahead -= s.match_length;
+			s.strstart += s.match_length;
+			s.match_length = 0;
+		} else {
+			/* No match, output a literal byte */
+			//Tracevv((stderr,"%c", s->window[s->strstart]));
+			/*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
+			bflush = trees._tr_tally(s, 0, s.window[s.strstart]);
+
+			s.lookahead--;
+			s.strstart++;
+		}
+		if (bflush) {
+			/*** FLUSH_BLOCK(s, 0); ***/
+			flush_block_only(s, false);
+			if (s.strm.avail_out === 0) {
+				return BS_NEED_MORE;
+			}
+			/***/
+		}
+	}
+	s.insert = 0;
+	if (flush === Z_FINISH) {
+		/*** FLUSH_BLOCK(s, 1); ***/
+		flush_block_only(s, true);
+		if (s.strm.avail_out === 0) {
+			return BS_FINISH_STARTED;
+		}
+		/***/
+		return BS_FINISH_DONE;
+	}
+	if (s.last_lit) {
+		/*** FLUSH_BLOCK(s, 0); ***/
+		flush_block_only(s, false);
+		if (s.strm.avail_out === 0) {
+			return BS_NEED_MORE;
+		}
+		/***/
+	}
+	return BS_BLOCK_DONE;
+}
+
+/* ===========================================================================
+ * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.
+ * (It will be regenerated if this run of deflate switches away from Huffman.)
+ */
+function deflate_huff(s, flush) {
+	var bflush;             /* set if current block must be flushed */
+
+	for (; ;) {
+		/* Make sure that we have a literal to write. */
+		if (s.lookahead === 0) {
+			fill_window(s);
+			if (s.lookahead === 0) {
+				if (flush === Z_NO_FLUSH) {
+					return BS_NEED_MORE;
+				}
+				break;      /* flush the current block */
+			}
+		}
+
+		/* Output a literal byte */
+		s.match_length = 0;
+		//Tracevv((stderr,"%c", s->window[s->strstart]));
+		/*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
+		bflush = trees._tr_tally(s, 0, s.window[s.strstart]);
+		s.lookahead--;
+		s.strstart++;
+		if (bflush) {
+			/*** FLUSH_BLOCK(s, 0); ***/
+			flush_block_only(s, false);
+			if (s.strm.avail_out === 0) {
+				return BS_NEED_MORE;
+			}
+			/***/
+		}
+	}
+	s.insert = 0;
+	if (flush === Z_FINISH) {
+		/*** FLUSH_BLOCK(s, 1); ***/
+		flush_block_only(s, true);
+		if (s.strm.avail_out === 0) {
+			return BS_FINISH_STARTED;
+		}
+		/***/
+		return BS_FINISH_DONE;
+	}
+	if (s.last_lit) {
+		/*** FLUSH_BLOCK(s, 0); ***/
+		flush_block_only(s, false);
+		if (s.strm.avail_out === 0) {
+			return BS_NEED_MORE;
+		}
+		/***/
+	}
+	return BS_BLOCK_DONE;
+}
+
+/* Values for max_lazy_match, good_match and max_chain_length, depending on
+ * the desired pack level (0..9). The values given below have been tuned to
+ * exclude worst case performance for pathological files. Better values may be
+ * found for specific files.
+ */
+function Config(good_length, max_lazy, nice_length, max_chain, func) {
+	this.good_length = good_length;
+	this.max_lazy = max_lazy;
+	this.nice_length = nice_length;
+	this.max_chain = max_chain;
+	this.func = func;
+}
+
+var configuration_table;
+
+configuration_table = [
+	/*      good lazy nice chain */
+	new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */
+	new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */
+	new Config(4, 5, 16, 8, deflate_fast),           /* 2 */
+	new Config(4, 6, 32, 32, deflate_fast),          /* 3 */
+
+	new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */
+	new Config(8, 16, 32, 32, deflate_slow),         /* 5 */
+	new Config(8, 16, 128, 128, deflate_slow),       /* 6 */
+	new Config(8, 32, 128, 256, deflate_slow),       /* 7 */
+	new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */
+	new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */
+];
+
+
+/* ===========================================================================
+ * Initialize the "longest match" routines for a new zlib stream
+ */
+function lm_init(s) {
+	s.window_size = 2 * s.w_size;
+
+	/*** CLEAR_HASH(s); ***/
+	zero(s.head); // Fill with NIL (= 0);
+
+	/* Set the default configuration parameters:
+	 */
+	s.max_lazy_match = configuration_table[s.level].max_lazy;
+	s.good_match = configuration_table[s.level].good_length;
+	s.nice_match = configuration_table[s.level].nice_length;
+	s.max_chain_length = configuration_table[s.level].max_chain;
+
+	s.strstart = 0;
+	s.block_start = 0;
+	s.lookahead = 0;
+	s.insert = 0;
+	s.match_length = s.prev_length = MIN_MATCH - 1;
+	s.match_available = 0;
+	s.ins_h = 0;
+}
+
+
+function DeflateState() {
+	this.strm = null;            /* pointer back to this zlib stream */
+	this.status = 0;            /* as the name implies */
+	this.pending_buf = null;      /* output still pending */
+	this.pending_buf_size = 0;  /* size of pending_buf */
+	this.pending_out = 0;       /* next pending byte to output to the stream */
+	this.pending = 0;           /* nb of bytes in the pending buffer */
+	this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */
+	this.gzhead = null;         /* gzip header information to write */
+	this.gzindex = 0;           /* where in extra, name, or comment */
+	this.method = Z_DEFLATED; /* can only be DEFLATED */
+	this.last_flush = -1;   /* value of flush param for previous deflate call */
+
+	this.w_size = 0;  /* LZ77 window size (32K by default) */
+	this.w_bits = 0;  /* log2(w_size)  (8..16) */
+	this.w_mask = 0;  /* w_size - 1 */
+
+	this.window = null;
+	/* Sliding window. Input bytes are read into the second half of the window,
+	 * and move to the first half later to keep a dictionary of at least wSize
+	 * bytes. With this organization, matches are limited to a distance of
+	 * wSize-MAX_MATCH bytes, but this ensures that IO is always
+	 * performed with a length multiple of the block size.
+	 */
+
+	this.window_size = 0;
+	/* Actual size of window: 2*wSize, except when the user input buffer
+	 * is directly used as sliding window.
+	 */
+
+	this.prev = null;
+	/* Link to older string with same hash index. To limit the size of this
+	 * array to 64K, this link is maintained only for the last 32K strings.
+	 * An index in this array is thus a window index modulo 32K.
+	 */
+
+	this.head = null;   /* Heads of the hash chains or NIL. */
+
+	this.ins_h = 0;       /* hash index of string to be inserted */
+	this.hash_size = 0;   /* number of elements in hash table */
+	this.hash_bits = 0;   /* log2(hash_size) */
+	this.hash_mask = 0;   /* hash_size-1 */
+
+	this.hash_shift = 0;
+	/* Number of bits by which ins_h must be shifted at each input
+	 * step. It must be such that after MIN_MATCH steps, the oldest
+	 * byte no longer takes part in the hash key, that is:
+	 *   hash_shift * MIN_MATCH >= hash_bits
+	 */
+
+	this.block_start = 0;
+	/* Window position at the beginning of the current output block. Gets
+	 * negative when the window is moved backwards.
+	 */
+
+	this.match_length = 0;      /* length of best match */
+	this.prev_match = 0;        /* previous match */
+	this.match_available = 0;   /* set if previous match exists */
+	this.strstart = 0;          /* start of string to insert */
+	this.match_start = 0;       /* start of matching string */
+	this.lookahead = 0;         /* number of valid bytes ahead in window */
+
+	this.prev_length = 0;
+	/* Length of the best match at previous step. Matches not greater than this
+	 * are discarded. This is used in the lazy match evaluation.
+	 */
+
+	this.max_chain_length = 0;
+	/* To speed up deflation, hash chains are never searched beyond this
+	 * length.  A higher limit improves compression ratio but degrades the
+	 * speed.
+	 */
+
+	this.max_lazy_match = 0;
+	/* Attempt to find a better match only when the current match is strictly
+	 * smaller than this value. This mechanism is used only for compression
+	 * levels >= 4.
+	 */
+	// That's alias to max_lazy_match, don't use directly
+	//this.max_insert_length = 0;
+	/* Insert new strings in the hash table only if the match length is not
+	 * greater than this length. This saves time but degrades compression.
+	 * max_insert_length is used only for compression levels <= 3.
+	 */
+
+	this.level = 0;     /* compression level (1..9) */
+	this.strategy = 0;  /* favor or force Huffman coding*/
+
+	this.good_match = 0;
+	/* Use a faster search when the previous match is longer than this */
+
+	this.nice_match = 0; /* Stop searching when current match exceeds this */
+
+	/* used by trees.c: */
+
+	/* Didn't use ct_data typedef below to suppress compiler warning */
+
+	// struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */
+	// struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
+	// struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */
+
+	// Use flat array of DOUBLE size, with interleaved fata,
+	// because JS does not support effective
+	this.dyn_ltree = new utils.Buf16(HEAP_SIZE * 2);
+	this.dyn_dtree = new utils.Buf16((2 * D_CODES + 1) * 2);
+	this.bl_tree = new utils.Buf16((2 * BL_CODES + 1) * 2);
+	zero(this.dyn_ltree);
+	zero(this.dyn_dtree);
+	zero(this.bl_tree);
+
+	this.l_desc = null;         /* desc. for literal tree */
+	this.d_desc = null;         /* desc. for distance tree */
+	this.bl_desc = null;         /* desc. for bit length tree */
+
+	//ush bl_count[MAX_BITS+1];
+	this.bl_count = new utils.Buf16(MAX_BITS + 1);
+	/* number of codes at each bit length for an optimal tree */
+
+	//int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */
+	this.heap = new utils.Buf16(2 * L_CODES + 1);  /* heap used to build the Huffman trees */
+	zero(this.heap);
+
+	this.heap_len = 0;               /* number of elements in the heap */
+	this.heap_max = 0;               /* element of largest frequency */
+	/* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
+	 * The same heap array is used to build all trees.
+	 */
+
+	this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1];
+	zero(this.depth);
+	/* Depth of each subtree used as tie breaker for trees of equal frequency
+	 */
+
+	this.l_buf = 0;          /* buffer index for literals or lengths */
+
+	this.lit_bufsize = 0;
+	/* Size of match buffer for literals/lengths.  There are 4 reasons for
+	 * limiting lit_bufsize to 64K:
+	 *   - frequencies can be kept in 16 bit counters
+	 *   - if compression is not successful for the first block, all input
+	 *     data is still in the window so we can still emit a stored block even
+	 *     when input comes from standard input.  (This can also be done for
+	 *     all blocks if lit_bufsize is not greater than 32K.)
+	 *   - if compression is not successful for a file smaller than 64K, we can
+	 *     even emit a stored file instead of a stored block (saving 5 bytes).
+	 *     This is applicable only for zip (not gzip or zlib).
+	 *   - creating new Huffman trees less frequently may not provide fast
+	 *     adaptation to changes in the input data statistics. (Take for
+	 *     example a binary file with poorly compressible code followed by
+	 *     a highly compressible string table.) Smaller buffer sizes give
+	 *     fast adaptation but have of course the overhead of transmitting
+	 *     trees more frequently.
+	 *   - I can't count above 4
+	 */
+
+	this.last_lit = 0;      /* running index in l_buf */
+
+	this.d_buf = 0;
+	/* Buffer index for distances. To simplify the code, d_buf and l_buf have
+	 * the same number of elements. To use different lengths, an extra flag
+	 * array would be necessary.
+	 */
+
+	this.opt_len = 0;       /* bit length of current block with optimal trees */
+	this.static_len = 0;    /* bit length of current block with static trees */
+	this.matches = 0;       /* number of string matches in current block */
+	this.insert = 0;        /* bytes at end of window left to insert */
+
+
+	this.bi_buf = 0;
+	/* Output buffer. bits are inserted starting at the bottom (least
+	 * significant bits).
+	 */
+	this.bi_valid = 0;
+	/* Number of valid bits in bi_buf.  All bits above the last valid bit
+	 * are always zero.
+	 */
+
+	// Used for window memory init. We safely ignore it for JS. That makes
+	// sense only for pointers and memory check tools.
+	//this.high_water = 0;
+	/* High water mark offset in window for initialized bytes -- bytes above
+	 * this are set to zero in order to avoid memory check warnings when
+	 * longest match routines access bytes past the input.  This is then
+	 * updated to the new high water mark.
+	 */
+}
+
+
+function deflateResetKeep(strm) {
+	var s;
+
+	if (!strm || !strm.state) {
+		return err(strm, Z_STREAM_ERROR);
+	}
+
+	strm.total_in = strm.total_out = 0;
+	strm.data_type = Z_UNKNOWN;
+
+	s = strm.state;
+	s.pending = 0;
+	s.pending_out = 0;
+
+	if (s.wrap < 0) {
+		s.wrap = -s.wrap;
+		/* was made negative by deflate(..., Z_FINISH); */
+	}
+	s.status = (s.wrap ? INIT_STATE : BUSY_STATE);
+	strm.adler = (s.wrap === 2) ?
+		0  // crc32(0, Z_NULL, 0)
+		:
+		1; // adler32(0, Z_NULL, 0)
+	s.last_flush = Z_NO_FLUSH;
+	trees._tr_init(s);
+	return Z_OK;
+}
+
+
+function deflateReset(strm) {
+	var ret = deflateResetKeep(strm);
+	if (ret === Z_OK) {
+		lm_init(strm.state);
+	}
+	return ret;
+}
+
+
+function deflateSetHeader(strm, head) {
+	if (!strm || !strm.state) {
+		return Z_STREAM_ERROR;
+	}
+	if (strm.state.wrap !== 2) {
+		return Z_STREAM_ERROR;
+	}
+	strm.state.gzhead = head;
+	return Z_OK;
+}
+
+
+function deflateInit2(strm, level, method, windowBits, memLevel, strategy) {
+	if (!strm) { // === Z_NULL
+		return Z_STREAM_ERROR;
+	}
+	var wrap = 1;
+
+	if (level === Z_DEFAULT_COMPRESSION) {
+		level = 6;
+	}
+
+	if (windowBits < 0) { /* suppress zlib wrapper */
+		wrap = 0;
+		windowBits = -windowBits;
+	} else if (windowBits > 15) {
+		wrap = 2;           /* write gzip wrapper instead */
+		windowBits -= 16;
+	}
+
+
+	if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||
+		windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||
+		strategy < 0 || strategy > Z_FIXED) {
+		return err(strm, Z_STREAM_ERROR);
+	}
+
+
+	if (windowBits === 8) {
+		windowBits = 9;
+	}
+	/* until 256-byte window bug fixed */
+
+	var s = new DeflateState();
+
+	strm.state = s;
+	s.strm = strm;
+
+	s.wrap = wrap;
+	s.gzhead = null;
+	s.w_bits = windowBits;
+	s.w_size = 1 << s.w_bits;
+	s.w_mask = s.w_size - 1;
+
+	s.hash_bits = memLevel + 7;
+	s.hash_size = 1 << s.hash_bits;
+	s.hash_mask = s.hash_size - 1;
+	s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);
+
+	s.window = new utils.Buf8(s.w_size * 2);
+	s.head = new utils.Buf16(s.hash_size);
+	s.prev = new utils.Buf16(s.w_size);
+
+	// Don't need mem init magic for JS.
+	//s.high_water = 0;  /* nothing written to s->window yet */
+
+	s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */
+
+	s.pending_buf_size = s.lit_bufsize * 4;
+
+	//overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
+	//s->pending_buf = (uchf *) overlay;
+	s.pending_buf = new utils.Buf8(s.pending_buf_size);
+
+	// It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)
+	//s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
+	s.d_buf = 1 * s.lit_bufsize;
+
+	//s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
+	s.l_buf = (1 + 2) * s.lit_bufsize;
+
+	s.level = level;
+	s.strategy = strategy;
+	s.method = method;
+
+	return deflateReset(strm);
+}
+
+function deflateInit(strm, level) {
+	return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);
+}
+
+
+function deflate(strm, flush) {
+	var old_flush, s;
+	var beg, val; // for gzip header write only
+
+	if (!strm || !strm.state ||
+		flush > Z_BLOCK || flush < 0) {
+		return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;
+	}
+
+	s = strm.state;
+
+	if (!strm.output ||
+		(!strm.input && strm.avail_in !== 0) ||
+		(s.status === FINISH_STATE && flush !== Z_FINISH)) {
+		return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);
+	}
+
+	s.strm = strm; /* just in case */
+	old_flush = s.last_flush;
+	s.last_flush = flush;
+
+	/* Write the header */
+	if (s.status === INIT_STATE) {
+
+		if (s.wrap === 2) { // GZIP header
+			strm.adler = 0;  //crc32(0L, Z_NULL, 0);
+			put_byte(s, 31);
+			put_byte(s, 139);
+			put_byte(s, 8);
+			if (!s.gzhead) { // s->gzhead == Z_NULL
+				put_byte(s, 0);
+				put_byte(s, 0);
+				put_byte(s, 0);
+				put_byte(s, 0);
+				put_byte(s, 0);
+				put_byte(s, s.level === 9 ? 2 :
+					(s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?
+						4 : 0));
+				put_byte(s, OS_CODE);
+				s.status = BUSY_STATE;
+			} else {
+				put_byte(s, (s.gzhead.text ? 1 : 0) +
+					(s.gzhead.hcrc ? 2 : 0) +
+					(!s.gzhead.extra ? 0 : 4) +
+					(!s.gzhead.name ? 0 : 8) +
+					(!s.gzhead.comment ? 0 : 16)
+				);
+				put_byte(s, s.gzhead.time & 0xff);
+				put_byte(s, (s.gzhead.time >> 8) & 0xff);
+				put_byte(s, (s.gzhead.time >> 16) & 0xff);
+				put_byte(s, (s.gzhead.time >> 24) & 0xff);
+				put_byte(s, s.level === 9 ? 2 :
+					(s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?
+						4 : 0));
+				put_byte(s, s.gzhead.os & 0xff);
+				if (s.gzhead.extra && s.gzhead.extra.length) {
+					put_byte(s, s.gzhead.extra.length & 0xff);
+					put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);
+				}
+				if (s.gzhead.hcrc) {
+					strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);
+				}
+				s.gzindex = 0;
+				s.status = EXTRA_STATE;
+			}
+		} else // DEFLATE header
+		{
+			var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;
+			var level_flags = -1;
+
+			if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {
+				level_flags = 0;
+			} else if (s.level < 6) {
+				level_flags = 1;
+			} else if (s.level === 6) {
+				level_flags = 2;
+			} else {
+				level_flags = 3;
+			}
+			header |= (level_flags << 6);
+			if (s.strstart !== 0) {
+				header |= PRESET_DICT;
+			}
+			header += 31 - (header % 31);
+
+			s.status = BUSY_STATE;
+			putShortMSB(s, header);
+
+			/* Save the adler32 of the preset dictionary: */
+			if (s.strstart !== 0) {
+				putShortMSB(s, strm.adler >>> 16);
+				putShortMSB(s, strm.adler & 0xffff);
+			}
+			strm.adler = 1; // adler32(0L, Z_NULL, 0);
+		}
+	}
+
+	//#ifdef GZIP
+	if (s.status === EXTRA_STATE) {
+		if (s.gzhead.extra/* != Z_NULL*/) {
+			beg = s.pending;  /* start of bytes to update crc */
+
+			while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {
+				if (s.pending === s.pending_buf_size) {
+					if (s.gzhead.hcrc && s.pending > beg) {
+						strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
+					}
+					flush_pending(strm);
+					beg = s.pending;
+					if (s.pending === s.pending_buf_size) {
+						break;
+					}
+				}
+				put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);
+				s.gzindex++;
+			}
+			if (s.gzhead.hcrc && s.pending > beg) {
+				strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
+			}
+			if (s.gzindex === s.gzhead.extra.length) {
+				s.gzindex = 0;
+				s.status = NAME_STATE;
+			}
+		} else {
+			s.status = NAME_STATE;
+		}
+	}
+	if (s.status === NAME_STATE) {
+		if (s.gzhead.name/* != Z_NULL*/) {
+			beg = s.pending;  /* start of bytes to update crc */
+			//int val;
+
+			do {
+				if (s.pending === s.pending_buf_size) {
+					if (s.gzhead.hcrc && s.pending > beg) {
+						strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
+					}
+					flush_pending(strm);
+					beg = s.pending;
+					if (s.pending === s.pending_buf_size) {
+						val = 1;
+						break;
+					}
+				}
+				// JS specific: little magic to add zero terminator to end of string
+				if (s.gzindex < s.gzhead.name.length) {
+					val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;
+				} else {
+					val = 0;
+				}
+				put_byte(s, val);
+			} while (val !== 0);
+
+			if (s.gzhead.hcrc && s.pending > beg) {
+				strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
+			}
+			if (val === 0) {
+				s.gzindex = 0;
+				s.status = COMMENT_STATE;
+			}
+		} else {
+			s.status = COMMENT_STATE;
+		}
+	}
+	if (s.status === COMMENT_STATE) {
+		if (s.gzhead.comment/* != Z_NULL*/) {
+			beg = s.pending;  /* start of bytes to update crc */
+			//int val;
+
+			do {
+				if (s.pending === s.pending_buf_size) {
+					if (s.gzhead.hcrc && s.pending > beg) {
+						strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
+					}
+					flush_pending(strm);
+					beg = s.pending;
+					if (s.pending === s.pending_buf_size) {
+						val = 1;
+						break;
+					}
+				}
+				// JS specific: little magic to add zero terminator to end of string
+				if (s.gzindex < s.gzhead.comment.length) {
+					val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;
+				} else {
+					val = 0;
+				}
+				put_byte(s, val);
+			} while (val !== 0);
+
+			if (s.gzhead.hcrc && s.pending > beg) {
+				strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
+			}
+			if (val === 0) {
+				s.status = HCRC_STATE;
+			}
+		} else {
+			s.status = HCRC_STATE;
+		}
+	}
+	if (s.status === HCRC_STATE) {
+		if (s.gzhead.hcrc) {
+			if (s.pending + 2 > s.pending_buf_size) {
+				flush_pending(strm);
+			}
+			if (s.pending + 2 <= s.pending_buf_size) {
+				put_byte(s, strm.adler & 0xff);
+				put_byte(s, (strm.adler >> 8) & 0xff);
+				strm.adler = 0; //crc32(0L, Z_NULL, 0);
+				s.status = BUSY_STATE;
+			}
+		} else {
+			s.status = BUSY_STATE;
+		}
+	}
+	//#endif
+
+	/* Flush as much pending output as possible */
+	if (s.pending !== 0) {
+		flush_pending(strm);
+		if (strm.avail_out === 0) {
+			/* Since avail_out is 0, deflate will be called again with
+			 * more output space, but possibly with both pending and
+			 * avail_in equal to zero. There won't be anything to do,
+			 * but this is not an error situation so make sure we
+			 * return OK instead of BUF_ERROR at next call of deflate:
+			 */
+			s.last_flush = -1;
+			return Z_OK;
+		}
+
+		/* Make sure there is something to do and avoid duplicate consecutive
+		 * flushes. For repeated and useless calls with Z_FINISH, we keep
+		 * returning Z_STREAM_END instead of Z_BUF_ERROR.
+		 */
+	} else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&
+		flush !== Z_FINISH) {
+		return err(strm, Z_BUF_ERROR);
+	}
+
+	/* User must not provide more input after the first FINISH: */
+	if (s.status === FINISH_STATE && strm.avail_in !== 0) {
+		return err(strm, Z_BUF_ERROR);
+	}
+
+	/* Start a new block or continue the current one.
+	 */
+	if (strm.avail_in !== 0 || s.lookahead !== 0 ||
+		(flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {
+		var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :
+			(s.strategy === Z_RLE ? deflate_rle(s, flush) :
+				configuration_table[s.level].func(s, flush));
+
+		if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {
+			s.status = FINISH_STATE;
+		}
+		if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {
+			if (strm.avail_out === 0) {
+				s.last_flush = -1;
+				/* avoid BUF_ERROR next call, see above */
+			}
+			return Z_OK;
+			/* If flush != Z_NO_FLUSH && avail_out == 0, the next call
+			 * of deflate should use the same flush parameter to make sure
+			 * that the flush is complete. So we don't have to output an
+			 * empty block here, this will be done at next call. This also
+			 * ensures that for a very small output buffer, we emit at most
+			 * one empty block.
+			 */
+		}
+		if (bstate === BS_BLOCK_DONE) {
+			if (flush === Z_PARTIAL_FLUSH) {
+				trees._tr_align(s);
+			} else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */
+
+				trees._tr_stored_block(s, 0, 0, false);
+				/* For a full flush, this empty block will be recognized
+				 * as a special marker by inflate_sync().
+				 */
+				if (flush === Z_FULL_FLUSH) {
+					/*** CLEAR_HASH(s); ***/             /* forget history */
+					zero(s.head); // Fill with NIL (= 0);
+
+					if (s.lookahead === 0) {
+						s.strstart = 0;
+						s.block_start = 0;
+						s.insert = 0;
+					}
+				}
+			}
+			flush_pending(strm);
+			if (strm.avail_out === 0) {
+				s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */
+				return Z_OK;
+			}
+		}
+	}
+	//Assert(strm->avail_out > 0, "bug2");
+	//if (strm.avail_out <= 0) { throw new Error("bug2");}
+
+	if (flush !== Z_FINISH) {
+		return Z_OK;
+	}
+	if (s.wrap <= 0) {
+		return Z_STREAM_END;
+	}
+
+	/* Write the trailer */
+	if (s.wrap === 2) {
+		put_byte(s, strm.adler & 0xff);
+		put_byte(s, (strm.adler >> 8) & 0xff);
+		put_byte(s, (strm.adler >> 16) & 0xff);
+		put_byte(s, (strm.adler >> 24) & 0xff);
+		put_byte(s, strm.total_in & 0xff);
+		put_byte(s, (strm.total_in >> 8) & 0xff);
+		put_byte(s, (strm.total_in >> 16) & 0xff);
+		put_byte(s, (strm.total_in >> 24) & 0xff);
+	} else {
+		putShortMSB(s, strm.adler >>> 16);
+		putShortMSB(s, strm.adler & 0xffff);
+	}
+
+	flush_pending(strm);
+	/* If avail_out is zero, the application will call deflate again
+	 * to flush the rest.
+	 */
+	if (s.wrap > 0) {
+		s.wrap = -s.wrap;
+	}
+	/* write the trailer only once! */
+	return s.pending !== 0 ? Z_OK : Z_STREAM_END;
+}
+
+function deflateEnd(strm) {
+	var status;
+
+	if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {
+		return Z_STREAM_ERROR;
+	}
+
+	status = strm.state.status;
+	if (status !== INIT_STATE &&
+		status !== EXTRA_STATE &&
+		status !== NAME_STATE &&
+		status !== COMMENT_STATE &&
+		status !== HCRC_STATE &&
+		status !== BUSY_STATE &&
+		status !== FINISH_STATE
+	) {
+		return err(strm, Z_STREAM_ERROR);
+	}
+
+	strm.state = null;
+
+	return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;
+}
+
+
+/* =========================================================================
+ * Initializes the compression dictionary from the given byte
+ * sequence without producing any compressed output.
+ */
+function deflateSetDictionary(strm, dictionary) {
+	var dictLength = dictionary.length;
+
+	var s;
+	var str, n;
+	var wrap;
+	var avail;
+	var next;
+	var input;
+	var tmpDict;
+
+	if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {
+		return Z_STREAM_ERROR;
+	}
+
+	s = strm.state;
+	wrap = s.wrap;
+
+	if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {
+		return Z_STREAM_ERROR;
+	}
+
+	/* when using zlib wrappers, compute Adler-32 for provided dictionary */
+	if (wrap === 1) {
+		/* adler32(strm->adler, dictionary, dictLength); */
+		strm.adler = adler32(strm.adler, dictionary, dictLength, 0);
+	}
+
+	s.wrap = 0;   /* avoid computing Adler-32 in read_buf */
+
+	/* if dictionary would fill window, just replace the history */
+	if (dictLength >= s.w_size) {
+		if (wrap === 0) {            /* already empty otherwise */
+			/*** CLEAR_HASH(s); ***/
+			zero(s.head); // Fill with NIL (= 0);
+			s.strstart = 0;
+			s.block_start = 0;
+			s.insert = 0;
+		}
+		/* use the tail */
+		// dictionary = dictionary.slice(dictLength - s.w_size);
+		tmpDict = new utils.Buf8(s.w_size);
+		utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);
+		dictionary = tmpDict;
+		dictLength = s.w_size;
+	}
+	/* insert dictionary into window and hash */
+	avail = strm.avail_in;
+	next = strm.next_in;
+	input = strm.input;
+	strm.avail_in = dictLength;
+	strm.next_in = 0;
+	strm.input = dictionary;
+	fill_window(s);
+	while (s.lookahead >= MIN_MATCH) {
+		str = s.strstart;
+		n = s.lookahead - (MIN_MATCH - 1);
+		do {
+			/* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */
+			s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;
+
+			s.prev[str & s.w_mask] = s.head[s.ins_h];
+
+			s.head[s.ins_h] = str;
+			str++;
+		} while (--n);
+		s.strstart = str;
+		s.lookahead = MIN_MATCH - 1;
+		fill_window(s);
+	}
+	s.strstart += s.lookahead;
+	s.block_start = s.strstart;
+	s.insert = s.lookahead;
+	s.lookahead = 0;
+	s.match_length = s.prev_length = MIN_MATCH - 1;
+	s.match_available = 0;
+	strm.next_in = next;
+	strm.input = input;
+	strm.avail_in = avail;
+	s.wrap = wrap;
+	return Z_OK;
+}
+
+const deflateInfo = 'pako deflate (from Nodeca project)';
+
+export default {
+	deflateInit,
+	deflateInit2,
+	deflateReset,
+	deflateResetKeep,
+	deflateSetHeader,
+	deflate,
+	deflateEnd,
+	deflateSetDictionary,
+	deflateInfo
+}
+
+

src/svga/pako/zlib/gzheader.ts

+'use strict';
+
+// (C) 1995-2013 Jean-loup Gailly and Mark Adler
+// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+//
+// This software is provided 'as-is', without any express or implied
+// warranty. In no event will the authors be held liable for any damages
+// arising from the use of this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+// 1. The origin of this software must not be misrepresented; you must not
+//   claim that you wrote the original software. If you use this software
+//   in a product, an acknowledgment in the product documentation would be
+//   appreciated but is not required.
+// 2. Altered source versions must be plainly marked as such, and must not be
+//   misrepresented as being the original software.
+// 3. This notice may not be removed or altered from any source distribution.
+
+function GZheader() {
+	/* true if compressed data believed to be text */
+	this.text = 0;
+	/* modification time */
+	this.time = 0;
+	/* extra flags (not used when writing a gzip file) */
+	this.xflags = 0;
+	/* operating system */
+	this.os = 0;
+	/* pointer to extra field or Z_NULL if none */
+	this.extra = null;
+	/* extra field length (valid if extra != Z_NULL) */
+	this.extra_len = 0; // Actually, we don't need it in JS,
+                      // but leave for few code modifications
+
+	//
+	// Setup limits is not necessary because in js we should not preallocate memory
+	// for inflate use constant limit in 65536 bytes
+	//
+
+	/* space at extra (only when reading header) */
+	// this.extra_max  = 0;
+	/* pointer to zero-terminated file name or Z_NULL */
+	this.name = '';
+	/* space at name (only when reading header) */
+	// this.name_max   = 0;
+	/* pointer to zero-terminated comment or Z_NULL */
+	this.comment = '';
+	/* space at comment (only when reading header) */
+	// this.comm_max   = 0;
+	/* true if there was or will be a header crc */
+	this.hcrc = 0;
+	/* true when done reading gzip header (not used when writing a gzip file) */
+	this.done = false;
+}
+
+export default GZheader;

src/svga/pako/zlib/inffast.ts

+'use strict';
+
+// (C) 1995-2013 Jean-loup Gailly and Mark Adler
+// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+//
+// This software is provided 'as-is', without any express or implied
+// warranty. In no event will the authors be held liable for any damages
+// arising from the use of this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+// 1. The origin of this software must not be misrepresented; you must not
+//   claim that you wrote the original software. If you use this software
+//   in a product, an acknowledgment in the product documentation would be
+//   appreciated but is not required.
+// 2. Altered source versions must be plainly marked as such, and must not be
+//   misrepresented as being the original software.
+// 3. This notice may not be removed or altered from any source distribution.
+
+// See state defs from inflate.js
+var BAD = 30;       /* got a data error -- remain here until reset */
+var TYPE = 12;      /* i: waiting for type bits, including last-flag bit */
+
+/*
+   Decode literal, length, and distance codes and write out the resulting
+   literal and match bytes until either not enough input or output is
+   available, an end-of-block is encountered, or a data error is encountered.
+   When large enough input and output buffers are supplied to inflate(), for
+   example, a 16K input buffer and a 64K output buffer, more than 95% of the
+   inflate execution time is spent in this routine.
+
+   Entry assumptions:
+
+        state.mode === LEN
+        strm.avail_in >= 6
+        strm.avail_out >= 258
+        start >= strm.avail_out
+        state.bits < 8
+
+   On return, state.mode is one of:
+
+        LEN -- ran out of enough output space or enough available input
+        TYPE -- reached end of block code, inflate() to interpret next block
+        BAD -- error in block data
+
+   Notes:
+
+    - The maximum input bits used by a length/distance pair is 15 bits for the
+      length code, 5 bits for the length extra, 15 bits for the distance code,
+      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.
+      Therefore if strm.avail_in >= 6, then there is enough input to avoid
+      checking for available input while decoding.
+
+    - The maximum bytes that a single length/distance pair can output is 258
+      bytes, which is the maximum length that can be coded.  inflate_fast()
+      requires strm.avail_out >= 258 for each loop to avoid checking for
+      output space.
+ */
+export default function inflate_fast(strm, start) {
+	var state;
+	var _in;                    /* local strm.input */
+	var last;                   /* have enough input while in < last */
+	var _out;                   /* local strm.output */
+	var beg;                    /* inflate()'s initial strm.output */
+	var end;                    /* while out < end, enough space available */
+//#ifdef INFLATE_STRICT
+	var dmax;                   /* maximum distance from zlib header */
+//#endif
+	var wsize;                  /* window size or zero if not using window */
+	var whave;                  /* valid bytes in the window */
+	var wnext;                  /* window write index */
+	// Use `s_window` instead `window`, avoid conflict with instrumentation tools
+	var s_window;               /* allocated sliding window, if wsize != 0 */
+	var hold;                   /* local strm.hold */
+	var bits;                   /* local strm.bits */
+	var lcode;                  /* local strm.lencode */
+	var dcode;                  /* local strm.distcode */
+	var lmask;                  /* mask for first level of length codes */
+	var dmask;                  /* mask for first level of distance codes */
+	var here;                   /* retrieved table entry */
+	var op;                     /* code bits, operation, extra bits, or */
+	/*  window position, window bytes to copy */
+	var len;                    /* match length, unused bytes */
+	var dist;                   /* match distance */
+	var from;                   /* where to copy match from */
+	var from_source;
+
+
+	var input, output; // JS specific, because we have no pointers
+
+	/* copy state to local variables */
+	state = strm.state;
+	//here = state.here;
+	_in = strm.next_in;
+	input = strm.input;
+	last = _in + (strm.avail_in - 5);
+	_out = strm.next_out;
+	output = strm.output;
+	beg = _out - (start - strm.avail_out);
+	end = _out + (strm.avail_out - 257);
+//#ifdef INFLATE_STRICT
+	dmax = state.dmax;
+//#endif
+	wsize = state.wsize;
+	whave = state.whave;
+	wnext = state.wnext;
+	s_window = state.window;
+	hold = state.hold;
+	bits = state.bits;
+	lcode = state.lencode;
+	dcode = state.distcode;
+	lmask = (1 << state.lenbits) - 1;
+	dmask = (1 << state.distbits) - 1;
+
+
+	/* decode literals and length/distances until end-of-block or not enough
+		 input data or output space */
+
+	top:
+		do {
+			if (bits < 15) {
+				hold += input[_in++] << bits;
+				bits += 8;
+				hold += input[_in++] << bits;
+				bits += 8;
+			}
+
+			here = lcode[hold & lmask];
+
+			dolen:
+				for (; ;) { // Goto emulation
+					op = here >>> 24/*here.bits*/;
+					hold >>>= op;
+					bits -= op;
+					op = (here >>> 16) & 0xff/*here.op*/;
+					if (op === 0) {                          /* literal */
+						//Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
+						//        "inflate:         literal '%c'\n" :
+						//        "inflate:         literal 0x%02x\n", here.val));
+						output[_out++] = here & 0xffff/*here.val*/;
+					} else if (op & 16) {                     /* length base */
+						len = here & 0xffff/*here.val*/;
+						op &= 15;                           /* number of extra bits */
+						if (op) {
+							if (bits < op) {
+								hold += input[_in++] << bits;
+								bits += 8;
+							}
+							len += hold & ((1 << op) - 1);
+							hold >>>= op;
+							bits -= op;
+						}
+						//Tracevv((stderr, "inflate:         length %u\n", len));
+						if (bits < 15) {
+							hold += input[_in++] << bits;
+							bits += 8;
+							hold += input[_in++] << bits;
+							bits += 8;
+						}
+						here = dcode[hold & dmask];
+
+						dodist:
+							for (; ;) { // goto emulation
+								op = here >>> 24/*here.bits*/;
+								hold >>>= op;
+								bits -= op;
+								op = (here >>> 16) & 0xff/*here.op*/;
+
+								if (op & 16) {                      /* distance base */
+									dist = here & 0xffff/*here.val*/;
+									op &= 15;                       /* number of extra bits */
+									if (bits < op) {
+										hold += input[_in++] << bits;
+										bits += 8;
+										if (bits < op) {
+											hold += input[_in++] << bits;
+											bits += 8;
+										}
+									}
+									dist += hold & ((1 << op) - 1);
+//#ifdef INFLATE_STRICT
+									if (dist > dmax) {
+										strm.msg = 'invalid distance too far back';
+										state.mode = BAD;
+										break top;
+									}
+//#endif
+									hold >>>= op;
+									bits -= op;
+									//Tracevv((stderr, "inflate:         distance %u\n", dist));
+									op = _out - beg;                /* max distance in output */
+									if (dist > op) {                /* see if copy from window */
+										op = dist - op;               /* distance back in window */
+										if (op > whave) {
+											if (state.sane) {
+												strm.msg = 'invalid distance too far back';
+												state.mode = BAD;
+												break top;
+											}
+
+// (!) This block is disabled in zlib defaults,
+// don't enable it for binary compatibility
+//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
+//                if (len <= op - whave) {
+//                  do {
+//                    output[_out++] = 0;
+//                  } while (--len);
+//                  continue top;
+//                }
+//                len -= op - whave;
+//                do {
+//                  output[_out++] = 0;
+//                } while (--op > whave);
+//                if (op === 0) {
+//                  from = _out - dist;
+//                  do {
+//                    output[_out++] = output[from++];
+//                  } while (--len);
+//                  continue top;
+//                }
+//#endif
+										}
+										from = 0; // window index
+										from_source = s_window;
+										if (wnext === 0) {           /* very common case */
+											from += wsize - op;
+											if (op < len) {         /* some from window */
+												len -= op;
+												do {
+													output[_out++] = s_window[from++];
+												} while (--op);
+												from = _out - dist;  /* rest from output */
+												from_source = output;
+											}
+										} else if (wnext < op) {      /* wrap around window */
+											from += wsize + wnext - op;
+											op -= wnext;
+											if (op < len) {         /* some from end of window */
+												len -= op;
+												do {
+													output[_out++] = s_window[from++];
+												} while (--op);
+												from = 0;
+												if (wnext < len) {  /* some from start of window */
+													op = wnext;
+													len -= op;
+													do {
+														output[_out++] = s_window[from++];
+													} while (--op);
+													from = _out - dist;      /* rest from output */
+													from_source = output;
+												}
+											}
+										} else {                      /* contiguous in window */
+											from += wnext - op;
+											if (op < len) {         /* some from window */
+												len -= op;
+												do {
+													output[_out++] = s_window[from++];
+												} while (--op);
+												from = _out - dist;  /* rest from output */
+												from_source = output;
+											}
+										}
+										while (len > 2) {
+											output[_out++] = from_source[from++];
+											output[_out++] = from_source[from++];
+											output[_out++] = from_source[from++];
+											len -= 3;
+										}
+										if (len) {
+											output[_out++] = from_source[from++];
+											if (len > 1) {
+												output[_out++] = from_source[from++];
+											}
+										}
+									} else {
+										from = _out - dist;          /* copy direct from output */
+										do {                        /* minimum length is three */
+											output[_out++] = output[from++];
+											output[_out++] = output[from++];
+											output[_out++] = output[from++];
+											len -= 3;
+										} while (len > 2);
+										if (len) {
+											output[_out++] = output[from++];
+											if (len > 1) {
+												output[_out++] = output[from++];
+											}
+										}
+									}
+								} else if ((op & 64) === 0) {          /* 2nd level distance code */
+									here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];
+									continue dodist;
+								} else {
+									strm.msg = 'invalid distance code';
+									state.mode = BAD;
+									break top;
+								}
+
+								break; // need to emulate goto via "continue"
+							}
+					} else if ((op & 64) === 0) {              /* 2nd level length code */
+						here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];
+						continue dolen;
+					} else if (op & 32) {                     /* end-of-block */
+						//Tracevv((stderr, "inflate:         end of block\n"));
+						state.mode = TYPE;
+						break top;
+					} else {
+						strm.msg = 'invalid literal/length code';
+						state.mode = BAD;
+						break top;
+					}
+
+					break; // need to emulate goto via "continue"
+				}
+		} while (_in < last && _out < end);
+
+	/* return unused bytes (on entry, bits < 8, so in won't go too far back) */
+	len = bits >> 3;
+	_in -= len;
+	bits -= len << 3;
+	hold &= (1 << bits) - 1;
+
+	/* update state and return */
+	strm.next_in = _in;
+	strm.next_out = _out;
+	strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));
+	strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));
+	state.hold = hold;
+	state.bits = bits;
+	return;
+};

src/svga/pako/zlib/inflate.ts

+'use strict';
+
+// (C) 1995-2013 Jean-loup Gailly and Mark Adler
+// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+//
+// This software is provided 'as-is', without any express or implied
+// warranty. In no event will the authors be held liable for any damages
+// arising from the use of this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+// 1. The origin of this software must not be misrepresented; you must not
+//   claim that you wrote the original software. If you use this software
+//   in a product, an acknowledgment in the product documentation would be
+//   appreciated but is not required.
+// 2. Altered source versions must be plainly marked as such, and must not be
+//   misrepresented as being the original software.
+// 3. This notice may not be removed or altered from any source distribution.
+
+import {utils} from '../utils/common';
+import adler32 from "./adler32"
+
+import crc32 from './crc32';
+import inflate_fast from './inffast';
+import inflate_table from './inftrees';
+
+var CODES = 0;
+var LENS = 1;
+var DISTS = 2;
+
+/* Public constants ==========================================================*/
+/* ===========================================================================*/
+
+
+/* Allowed flush values; see deflate() and inflate() below for details */
+//var Z_NO_FLUSH      = 0;
+//var Z_PARTIAL_FLUSH = 1;
+//var Z_SYNC_FLUSH    = 2;
+//var Z_FULL_FLUSH    = 3;
+var Z_FINISH = 4;
+var Z_BLOCK = 5;
+var Z_TREES = 6;
+
+
+/* Return codes for the compression/decompression functions. Negative values
+ * are errors, positive values are used for special but normal events.
+ */
+var Z_OK = 0;
+var Z_STREAM_END = 1;
+var Z_NEED_DICT = 2;
+//var Z_ERRNO         = -1;
+var Z_STREAM_ERROR = -2;
+var Z_DATA_ERROR = -3;
+var Z_MEM_ERROR = -4;
+var Z_BUF_ERROR = -5;
+//var Z_VERSION_ERROR = -6;
+
+/* The deflate compression method */
+var Z_DEFLATED = 8;
+
+
+/* STATES ====================================================================*/
+/* ===========================================================================*/
+
+
+var HEAD = 1;       /* i: waiting for magic header */
+var FLAGS = 2;      /* i: waiting for method and flags (gzip) */
+var TIME = 3;       /* i: waiting for modification time (gzip) */
+var OS = 4;         /* i: waiting for extra flags and operating system (gzip) */
+var EXLEN = 5;      /* i: waiting for extra length (gzip) */
+var EXTRA = 6;      /* i: waiting for extra bytes (gzip) */
+var NAME = 7;       /* i: waiting for end of file name (gzip) */
+var COMMENT = 8;    /* i: waiting for end of comment (gzip) */
+var HCRC = 9;       /* i: waiting for header crc (gzip) */
+var DICTID = 10;    /* i: waiting for dictionary check value */
+var DICT = 11;      /* waiting for inflateSetDictionary() call */
+var TYPE = 12;      /* i: waiting for type bits, including last-flag bit */
+var TYPEDO = 13;    /* i: same, but skip check to exit inflate on new block */
+var STORED = 14;    /* i: waiting for stored size (length and complement) */
+var COPY_ = 15;     /* i/o: same as COPY below, but only first time in */
+var COPY = 16;      /* i/o: waiting for input or output to copy stored block */
+var TABLE = 17;     /* i: waiting for dynamic block table lengths */
+var LENLENS = 18;   /* i: waiting for code length code lengths */
+var CODELENS = 19;  /* i: waiting for length/lit and distance code lengths */
+var LEN_ = 20;      /* i: same as LEN below, but only first time in */
+var LEN = 21;       /* i: waiting for length/lit/eob code */
+var LENEXT = 22;    /* i: waiting for length extra bits */
+var DIST = 23;      /* i: waiting for distance code */
+var DISTEXT = 24;   /* i: waiting for distance extra bits */
+var MATCH = 25;     /* o: waiting for output space to copy string */
+var LIT = 26;       /* o: waiting for output space to write literal */
+var CHECK = 27;     /* i: waiting for 32-bit check value */
+var LENGTH = 28;    /* i: waiting for 32-bit length (gzip) */
+var DONE = 29;      /* finished check, done -- remain here until reset */
+var BAD = 30;       /* got a data error -- remain here until reset */
+var MEM = 31;       /* got an inflate() memory error -- remain here until reset */
+var SYNC = 32;      /* looking for synchronization bytes to restart inflate() */
+
+/* ===========================================================================*/
+
+
+var ENOUGH_LENS = 852;
+var ENOUGH_DISTS = 592;
+//var ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);
+
+var MAX_WBITS = 15;
+/* 32K LZ77 window */
+var DEF_WBITS = MAX_WBITS;
+
+
+function zswap32(q) {
+	return (((q >>> 24) & 0xff) +
+		((q >>> 8) & 0xff00) +
+		((q & 0xff00) << 8) +
+		((q & 0xff) << 24));
+}
+
+
+function InflateState() {
+	this.mode = 0;             /* current inflate mode */
+	this.last = false;          /* true if processing last block */
+	this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */
+	this.havedict = false;      /* true if dictionary provided */
+	this.flags = 0;             /* gzip header method and flags (0 if zlib) */
+	this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */
+	this.check = 0;             /* protected copy of check value */
+	this.total = 0;             /* protected copy of output count */
+	// TODO: may be {}
+	this.head = null;           /* where to save gzip header information */
+
+	/* sliding window */
+	this.wbits = 0;             /* log base 2 of requested window size */
+	this.wsize = 0;             /* window size or zero if not using window */
+	this.whave = 0;             /* valid bytes in the window */
+	this.wnext = 0;             /* window write index */
+	this.window = null;         /* allocated sliding window, if needed */
+
+	/* bit accumulator */
+	this.hold = 0;              /* input bit accumulator */
+	this.bits = 0;              /* number of bits in "in" */
+
+	/* for string and stored block copying */
+	this.length = 0;            /* literal or length of data to copy */
+	this.offset = 0;            /* distance back to copy string from */
+
+	/* for table and code decoding */
+	this.extra = 0;             /* extra bits needed */
+
+	/* fixed and dynamic code tables */
+	this.lencode = null;          /* starting table for length/literal codes */
+	this.distcode = null;         /* starting table for distance codes */
+	this.lenbits = 0;           /* index bits for lencode */
+	this.distbits = 0;          /* index bits for distcode */
+
+	/* dynamic table building */
+	this.ncode = 0;             /* number of code length code lengths */
+	this.nlen = 0;              /* number of length code lengths */
+	this.ndist = 0;             /* number of distance code lengths */
+	this.have = 0;              /* number of code lengths in lens[] */
+	this.next = null;              /* next available space in codes[] */
+
+	this.lens = new utils.Buf16(320); /* temporary storage for code lengths */
+	this.work = new utils.Buf16(288); /* work area for code table building */
+
+	/*
+	 because we don't have pointers in js, we use lencode and distcode directly
+	 as buffers so we don't need codes
+	*/
+	//this.codes = new utils.Buf32(ENOUGH);       /* space for code tables */
+	this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */
+	this.distdyn = null;             /* dynamic table for distance codes (JS specific) */
+	this.sane = 0;                   /* if false, allow invalid distance too far */
+	this.back = 0;                   /* bits back of last unprocessed length/lit */
+	this.was = 0;                    /* initial length of match */
+}
+
+function inflateResetKeep(strm) {
+	var state;
+
+	if (!strm || !strm.state) {
+		return Z_STREAM_ERROR;
+	}
+	state = strm.state;
+	strm.total_in = strm.total_out = state.total = 0;
+	strm.msg = ''; /*Z_NULL*/
+	if (state.wrap) {       /* to support ill-conceived Java test suite */
+		strm.adler = state.wrap & 1;
+	}
+	state.mode = HEAD;
+	state.last = 0;
+	state.havedict = 0;
+	state.dmax = 32768;
+	state.head = null/*Z_NULL*/;
+	state.hold = 0;
+	state.bits = 0;
+	//state.lencode = state.distcode = state.next = state.codes;
+	state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);
+	state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);
+
+	state.sane = 1;
+	state.back = -1;
+	//Tracev((stderr, "inflate: reset\n"));
+	return Z_OK;
+}
+
+function inflateReset(strm) {
+	var state;
+
+	if (!strm || !strm.state) {
+		return Z_STREAM_ERROR;
+	}
+	state = strm.state;
+	state.wsize = 0;
+	state.whave = 0;
+	state.wnext = 0;
+	return inflateResetKeep(strm);
+
+}
+
+function inflateReset2(strm, windowBits) {
+	var wrap;
+	var state;
+
+	/* get the state */
+	if (!strm || !strm.state) {
+		return Z_STREAM_ERROR;
+	}
+	state = strm.state;
+
+	/* extract wrap request from windowBits parameter */
+	if (windowBits < 0) {
+		wrap = 0;
+		windowBits = -windowBits;
+	} else {
+		wrap = (windowBits >> 4) + 1;
+		if (windowBits < 48) {
+			windowBits &= 15;
+		}
+	}
+
+	/* set number of window bits, free window if different */
+	if (windowBits && (windowBits < 8 || windowBits > 15)) {
+		return Z_STREAM_ERROR;
+	}
+	if (state.window !== null && state.wbits !== windowBits) {
+		state.window = null;
+	}
+
+	/* update state and reset the rest of it */
+	state.wrap = wrap;
+	state.wbits = windowBits;
+	return inflateReset(strm);
+}
+
+function inflateInit2(strm, windowBits) {
+	var ret;
+	var state;
+
+	if (!strm) {
+		return Z_STREAM_ERROR;
+	}
+	//strm.msg = Z_NULL;                 /* in case we return an error */
+
+	state = new InflateState();
+
+	//if (state === Z_NULL) return Z_MEM_ERROR;
+	//Tracev((stderr, "inflate: allocated\n"));
+	strm.state = state;
+	state.window = null/*Z_NULL*/;
+	ret = inflateReset2(strm, windowBits);
+	if (ret !== Z_OK) {
+		strm.state = null/*Z_NULL*/;
+	}
+	return ret;
+}
+
+function inflateInit(strm) {
+	return inflateInit2(strm, DEF_WBITS);
+}
+
+
+/*
+ Return state with length and distance decoding tables and index sizes set to
+ fixed code decoding.  Normally this returns fixed tables from inffixed.h.
+ If BUILDFIXED is defined, then instead this routine builds the tables the
+ first time it's called, and returns those tables the first time and
+ thereafter.  This reduces the size of the code by about 2K bytes, in
+ exchange for a little execution time.  However, BUILDFIXED should not be
+ used for threaded applications, since the rewriting of the tables and virgin
+ may not be thread-safe.
+ */
+var virgin = true;
+
+var lenfix, distfix; // We have no pointers in JS, so keep tables separate
+
+function fixedtables(state) {
+	/* build fixed huffman tables if first call (may not be thread safe) */
+	if (virgin) {
+		var sym;
+
+		lenfix = new utils.Buf32(512);
+		distfix = new utils.Buf32(32);
+
+		/* literal/length table */
+		sym = 0;
+		while (sym < 144) {
+			state.lens[sym++] = 8;
+		}
+		while (sym < 256) {
+			state.lens[sym++] = 9;
+		}
+		while (sym < 280) {
+			state.lens[sym++] = 7;
+		}
+		while (sym < 288) {
+			state.lens[sym++] = 8;
+		}
+
+		inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, {bits: 9});
+
+		/* distance table */
+		sym = 0;
+		while (sym < 32) {
+			state.lens[sym++] = 5;
+		}
+
+		inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, {bits: 5});
+
+		/* do this just once */
+		virgin = false;
+	}
+
+	state.lencode = lenfix;
+	state.lenbits = 9;
+	state.distcode = distfix;
+	state.distbits = 5;
+}
+
+
+/*
+ Update the window with the last wsize (normally 32K) bytes written before
+ returning.  If window does not exist yet, create it.  This is only called
+ when a window is already in use, or when output has been written during this
+ inflate call, but the end of the deflate stream has not been reached yet.
+ It is also called to create a window for dictionary data when a dictionary
+ is loaded.
+
+ Providing output buffers larger than 32K to inflate() should provide a speed
+ advantage, since only the last 32K of output is copied to the sliding window
+ upon return from inflate(), and since all distances after the first 32K of
+ output will fall in the output data, making match copies simpler and faster.
+ The advantage may be dependent on the size of the processor's data caches.
+ */
+function updatewindow(strm, src, end, copy) {
+	var dist;
+	var state = strm.state;
+
+	/* if it hasn't been done already, allocate space for the window */
+	if (state.window === null) {
+		state.wsize = 1 << state.wbits;
+		state.wnext = 0;
+		state.whave = 0;
+
+		state.window = new utils.Buf8(state.wsize);
+	}
+
+	/* copy state->wsize or less output bytes into the circular window */
+	if (copy >= state.wsize) {
+		utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0);
+		state.wnext = 0;
+		state.whave = state.wsize;
+	} else {
+		dist = state.wsize - state.wnext;
+		if (dist > copy) {
+			dist = copy;
+		}
+		//zmemcpy(state->window + state->wnext, end - copy, dist);
+		utils.arraySet(state.window, src, end - copy, dist, state.wnext);
+		copy -= dist;
+		if (copy) {
+			//zmemcpy(state->window, end - copy, copy);
+			utils.arraySet(state.window, src, end - copy, copy, 0);
+			state.wnext = copy;
+			state.whave = state.wsize;
+		} else {
+			state.wnext += dist;
+			if (state.wnext === state.wsize) {
+				state.wnext = 0;
+			}
+			if (state.whave < state.wsize) {
+				state.whave += dist;
+			}
+		}
+	}
+	return 0;
+}
+
+function inflate(strm, flush) {
+	var state;
+	var input, output;          // input/output buffers
+	var next;                   /* next input INDEX */
+	var put;                    /* next output INDEX */
+	var have, left;             /* available input and output */
+	var hold;                   /* bit buffer */
+	var bits;                   /* bits in bit buffer */
+	var _in, _out;              /* save starting available input and output */
+	var copy;                   /* number of stored or match bytes to copy */
+	var from;                   /* where to copy match bytes from */
+	var from_source;
+	var here = 0;               /* current decoding table entry */
+	var here_bits, here_op, here_val; // paked "here" denormalized (JS specific)
+	//var last;                   /* parent table entry */
+	var last_bits, last_op, last_val; // paked "last" denormalized (JS specific)
+	var len;                    /* length to copy for repeats, bits to drop */
+	var ret;                    /* return code */
+	var hbuf = new utils.Buf8(4);    /* buffer for gzip header crc calculation */
+	var opts;
+
+	var n; // temporary var for NEED_BITS
+
+	var order = /* permutation of code lengths */
+		[16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+
+
+	if (!strm || !strm.state || !strm.output ||
+		(!strm.input && strm.avail_in !== 0)) {
+		return Z_STREAM_ERROR;
+	}
+
+	state = strm.state;
+	if (state.mode === TYPE) {
+		state.mode = TYPEDO;
+	}    /* skip check */
+
+
+	//--- LOAD() ---
+	put = strm.next_out;
+	output = strm.output;
+	left = strm.avail_out;
+	next = strm.next_in;
+	input = strm.input;
+	have = strm.avail_in;
+	hold = state.hold;
+	bits = state.bits;
+	//---
+
+	_in = have;
+	_out = left;
+	ret = Z_OK;
+
+	inf_leave: // goto emulation
+		for (; ;) {
+			switch (state.mode) {
+				case HEAD:
+					if (state.wrap === 0) {
+						state.mode = TYPEDO;
+						break;
+					}
+					//=== NEEDBITS(16);
+					while (bits < 16) {
+						if (have === 0) {
+							break inf_leave;
+						}
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					//===//
+					if ((state.wrap & 2) && hold === 0x8b1f) {  /* gzip header */
+						state.check = 0/*crc32(0L, Z_NULL, 0)*/;
+						//=== CRC2(state.check, hold);
+						hbuf[0] = hold & 0xff;
+						hbuf[1] = (hold >>> 8) & 0xff;
+						state.check = crc32(state.check, hbuf, 2, 0);
+						//===//
+
+						//=== INITBITS();
+						hold = 0;
+						bits = 0;
+						//===//
+						state.mode = FLAGS;
+						break;
+					}
+					state.flags = 0;           /* expect zlib header */
+					if (state.head) {
+						state.head.done = false;
+					}
+					if (!(state.wrap & 1) ||   /* check if zlib header allowed */
+						(((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {
+						strm.msg = 'incorrect header check';
+						state.mode = BAD;
+						break;
+					}
+					if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {
+						strm.msg = 'unknown compression method';
+						state.mode = BAD;
+						break;
+					}
+					//--- DROPBITS(4) ---//
+					hold >>>= 4;
+					bits -= 4;
+					//---//
+					len = (hold & 0x0f)/*BITS(4)*/ + 8;
+					if (state.wbits === 0) {
+						state.wbits = len;
+					} else if (len > state.wbits) {
+						strm.msg = 'invalid window size';
+						state.mode = BAD;
+						break;
+					}
+					state.dmax = 1 << len;
+					//Tracev((stderr, "inflate:   zlib header ok\n"));
+					strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;
+					state.mode = hold & 0x200 ? DICTID : TYPE;
+					//=== INITBITS();
+					hold = 0;
+					bits = 0;
+					//===//
+					break;
+				case FLAGS:
+					//=== NEEDBITS(16); */
+					while (bits < 16) {
+						if (have === 0) {
+							break inf_leave;
+						}
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					//===//
+					state.flags = hold;
+					if ((state.flags & 0xff) !== Z_DEFLATED) {
+						strm.msg = 'unknown compression method';
+						state.mode = BAD;
+						break;
+					}
+					if (state.flags & 0xe000) {
+						strm.msg = 'unknown header flags set';
+						state.mode = BAD;
+						break;
+					}
+					if (state.head) {
+						state.head.text = ((hold >> 8) & 1);
+					}
+					if (state.flags & 0x0200) {
+						//=== CRC2(state.check, hold);
+						hbuf[0] = hold & 0xff;
+						hbuf[1] = (hold >>> 8) & 0xff;
+						state.check = crc32(state.check, hbuf, 2, 0);
+						//===//
+					}
+					//=== INITBITS();
+					hold = 0;
+					bits = 0;
+					//===//
+					state.mode = TIME;
+				/* falls through */
+				case TIME:
+					//=== NEEDBITS(32); */
+					while (bits < 32) {
+						if (have === 0) {
+							break inf_leave;
+						}
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					//===//
+					if (state.head) {
+						state.head.time = hold;
+					}
+					if (state.flags & 0x0200) {
+						//=== CRC4(state.check, hold)
+						hbuf[0] = hold & 0xff;
+						hbuf[1] = (hold >>> 8) & 0xff;
+						hbuf[2] = (hold >>> 16) & 0xff;
+						hbuf[3] = (hold >>> 24) & 0xff;
+						state.check = crc32(state.check, hbuf, 4, 0);
+						//===
+					}
+					//=== INITBITS();
+					hold = 0;
+					bits = 0;
+					//===//
+					state.mode = OS;
+				/* falls through */
+				case OS:
+					//=== NEEDBITS(16); */
+					while (bits < 16) {
+						if (have === 0) {
+							break inf_leave;
+						}
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					//===//
+					if (state.head) {
+						state.head.xflags = (hold & 0xff);
+						state.head.os = (hold >> 8);
+					}
+					if (state.flags & 0x0200) {
+						//=== CRC2(state.check, hold);
+						hbuf[0] = hold & 0xff;
+						hbuf[1] = (hold >>> 8) & 0xff;
+						state.check = crc32(state.check, hbuf, 2, 0);
+						//===//
+					}
+					//=== INITBITS();
+					hold = 0;
+					bits = 0;
+					//===//
+					state.mode = EXLEN;
+				/* falls through */
+				case EXLEN:
+					if (state.flags & 0x0400) {
+						//=== NEEDBITS(16); */
+						while (bits < 16) {
+							if (have === 0) {
+								break inf_leave;
+							}
+							have--;
+							hold += input[next++] << bits;
+							bits += 8;
+						}
+						//===//
+						state.length = hold;
+						if (state.head) {
+							state.head.extra_len = hold;
+						}
+						if (state.flags & 0x0200) {
+							//=== CRC2(state.check, hold);
+							hbuf[0] = hold & 0xff;
+							hbuf[1] = (hold >>> 8) & 0xff;
+							state.check = crc32(state.check, hbuf, 2, 0);
+							//===//
+						}
+						//=== INITBITS();
+						hold = 0;
+						bits = 0;
+						//===//
+					} else if (state.head) {
+						state.head.extra = null/*Z_NULL*/;
+					}
+					state.mode = EXTRA;
+				/* falls through */
+				case EXTRA:
+					if (state.flags & 0x0400) {
+						copy = state.length;
+						if (copy > have) {
+							copy = have;
+						}
+						if (copy) {
+							if (state.head) {
+								len = state.head.extra_len - state.length;
+								if (!state.head.extra) {
+									// Use untyped array for more convenient processing later
+									state.head.extra = new Array(state.head.extra_len);
+								}
+								utils.arraySet(
+									state.head.extra,
+									input,
+									next,
+									// extra field is limited to 65536 bytes
+									// - no need for additional size check
+									copy,
+									/*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
+									len
+								);
+								//zmemcpy(state.head.extra + len, next,
+								//        len + copy > state.head.extra_max ?
+								//        state.head.extra_max - len : copy);
+							}
+							if (state.flags & 0x0200) {
+								state.check = crc32(state.check, input, copy, next);
+							}
+							have -= copy;
+							next += copy;
+							state.length -= copy;
+						}
+						if (state.length) {
+							break inf_leave;
+						}
+					}
+					state.length = 0;
+					state.mode = NAME;
+				/* falls through */
+				case NAME:
+					if (state.flags & 0x0800) {
+						if (have === 0) {
+							break inf_leave;
+						}
+						copy = 0;
+						do {
+							// TODO: 2 or 1 bytes?
+							len = input[next + copy++];
+							/* use constant limit because in js we should not preallocate memory */
+							if (state.head && len &&
+								(state.length < 65536 /*state.head.name_max*/)) {
+								state.head.name += String.fromCharCode(len);
+							}
+						} while (len && copy < have);
+
+						if (state.flags & 0x0200) {
+							state.check = crc32(state.check, input, copy, next);
+						}
+						have -= copy;
+						next += copy;
+						if (len) {
+							break inf_leave;
+						}
+					} else if (state.head) {
+						state.head.name = null;
+					}
+					state.length = 0;
+					state.mode = COMMENT;
+				/* falls through */
+				case COMMENT:
+					if (state.flags & 0x1000) {
+						if (have === 0) {
+							break inf_leave;
+						}
+						copy = 0;
+						do {
+							len = input[next + copy++];
+							/* use constant limit because in js we should not preallocate memory */
+							if (state.head && len &&
+								(state.length < 65536 /*state.head.comm_max*/)) {
+								state.head.comment += String.fromCharCode(len);
+							}
+						} while (len && copy < have);
+						if (state.flags & 0x0200) {
+							state.check = crc32(state.check, input, copy, next);
+						}
+						have -= copy;
+						next += copy;
+						if (len) {
+							break inf_leave;
+						}
+					} else if (state.head) {
+						state.head.comment = null;
+					}
+					state.mode = HCRC;
+				/* falls through */
+				case HCRC:
+					if (state.flags & 0x0200) {
+						//=== NEEDBITS(16); */
+						while (bits < 16) {
+							if (have === 0) {
+								break inf_leave;
+							}
+							have--;
+							hold += input[next++] << bits;
+							bits += 8;
+						}
+						//===//
+						if (hold !== (state.check & 0xffff)) {
+							strm.msg = 'header crc mismatch';
+							state.mode = BAD;
+							break;
+						}
+						//=== INITBITS();
+						hold = 0;
+						bits = 0;
+						//===//
+					}
+					if (state.head) {
+						state.head.hcrc = ((state.flags >> 9) & 1);
+						state.head.done = true;
+					}
+					strm.adler = state.check = 0;
+					state.mode = TYPE;
+					break;
+				case DICTID:
+					//=== NEEDBITS(32); */
+					while (bits < 32) {
+						if (have === 0) {
+							break inf_leave;
+						}
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					//===//
+					strm.adler = state.check = zswap32(hold);
+					//=== INITBITS();
+					hold = 0;
+					bits = 0;
+					//===//
+					state.mode = DICT;
+				/* falls through */
+				case DICT:
+					if (state.havedict === 0) {
+						//--- RESTORE() ---
+						strm.next_out = put;
+						strm.avail_out = left;
+						strm.next_in = next;
+						strm.avail_in = have;
+						state.hold = hold;
+						state.bits = bits;
+						//---
+						return Z_NEED_DICT;
+					}
+					strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;
+					state.mode = TYPE;
+				/* falls through */
+				case TYPE:
+					if (flush === Z_BLOCK || flush === Z_TREES) {
+						break inf_leave;
+					}
+				/* falls through */
+				case TYPEDO:
+					if (state.last) {
+						//--- BYTEBITS() ---//
+						hold >>>= bits & 7;
+						bits -= bits & 7;
+						//---//
+						state.mode = CHECK;
+						break;
+					}
+					//=== NEEDBITS(3); */
+					while (bits < 3) {
+						if (have === 0) {
+							break inf_leave;
+						}
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					//===//
+					state.last = (hold & 0x01)/*BITS(1)*/;
+					//--- DROPBITS(1) ---//
+					hold >>>= 1;
+					bits -= 1;
+					//---//
+
+					switch ((hold & 0x03)/*BITS(2)*/) {
+						case 0:                             /* stored block */
+							//Tracev((stderr, "inflate:     stored block%s\n",
+							//        state.last ? " (last)" : ""));
+							state.mode = STORED;
+							break;
+						case 1:                             /* fixed block */
+							fixedtables(state);
+							//Tracev((stderr, "inflate:     fixed codes block%s\n",
+							//        state.last ? " (last)" : ""));
+							state.mode = LEN_;             /* decode codes */
+							if (flush === Z_TREES) {
+								//--- DROPBITS(2) ---//
+								hold >>>= 2;
+								bits -= 2;
+								//---//
+								break inf_leave;
+							}
+							break;
+						case 2:                             /* dynamic block */
+							//Tracev((stderr, "inflate:     dynamic codes block%s\n",
+							//        state.last ? " (last)" : ""));
+							state.mode = TABLE;
+							break;
+						case 3:
+							strm.msg = 'invalid block type';
+							state.mode = BAD;
+					}
+					//--- DROPBITS(2) ---//
+					hold >>>= 2;
+					bits -= 2;
+					//---//
+					break;
+				case STORED:
+					//--- BYTEBITS() ---// /* go to byte boundary */
+					hold >>>= bits & 7;
+					bits -= bits & 7;
+					//---//
+					//=== NEEDBITS(32); */
+					while (bits < 32) {
+						if (have === 0) {
+							break inf_leave;
+						}
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					//===//
+					if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {
+						strm.msg = 'invalid stored block lengths';
+						state.mode = BAD;
+						break;
+					}
+					state.length = hold & 0xffff;
+					//Tracev((stderr, "inflate:       stored length %u\n",
+					//        state.length));
+					//=== INITBITS();
+					hold = 0;
+					bits = 0;
+					//===//
+					state.mode = COPY_;
+					if (flush === Z_TREES) {
+						break inf_leave;
+					}
+				/* falls through */
+				case COPY_:
+					state.mode = COPY;
+				/* falls through */
+				case COPY:
+					copy = state.length;
+					if (copy) {
+						if (copy > have) {
+							copy = have;
+						}
+						if (copy > left) {
+							copy = left;
+						}
+						if (copy === 0) {
+							break inf_leave;
+						}
+						//--- zmemcpy(put, next, copy); ---
+						utils.arraySet(output, input, next, copy, put);
+						//---//
+						have -= copy;
+						next += copy;
+						left -= copy;
+						put += copy;
+						state.length -= copy;
+						break;
+					}
+					//Tracev((stderr, "inflate:       stored end\n"));
+					state.mode = TYPE;
+					break;
+				case TABLE:
+					//=== NEEDBITS(14); */
+					while (bits < 14) {
+						if (have === 0) {
+							break inf_leave;
+						}
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					//===//
+					state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;
+					//--- DROPBITS(5) ---//
+					hold >>>= 5;
+					bits -= 5;
+					//---//
+					state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;
+					//--- DROPBITS(5) ---//
+					hold >>>= 5;
+					bits -= 5;
+					//---//
+					state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;
+					//--- DROPBITS(4) ---//
+					hold >>>= 4;
+					bits -= 4;
+					//---//
+					//#ifndef PKZIP_BUG_WORKAROUND
+					if (state.nlen > 286 || state.ndist > 30) {
+						strm.msg = 'too many length or distance symbols';
+						state.mode = BAD;
+						break;
+					}
+					//#endif
+					//Tracev((stderr, "inflate:       table sizes ok\n"));
+					state.have = 0;
+					state.mode = LENLENS;
+				/* falls through */
+				case LENLENS:
+					while (state.have < state.ncode) {
+						//=== NEEDBITS(3);
+						while (bits < 3) {
+							if (have === 0) {
+								break inf_leave;
+							}
+							have--;
+							hold += input[next++] << bits;
+							bits += 8;
+						}
+						//===//
+						state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);
+						//--- DROPBITS(3) ---//
+						hold >>>= 3;
+						bits -= 3;
+						//---//
+					}
+					while (state.have < 19) {
+						state.lens[order[state.have++]] = 0;
+					}
+					// We have separate tables & no pointers. 2 commented lines below not needed.
+					//state.next = state.codes;
+					//state.lencode = state.next;
+					// Switch to use dynamic table
+					state.lencode = state.lendyn;
+					state.lenbits = 7;
+
+					opts = {bits: state.lenbits};
+					ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);
+					state.lenbits = opts.bits;
+
+					if (ret) {
+						strm.msg = 'invalid code lengths set';
+						state.mode = BAD;
+						break;
+					}
+					//Tracev((stderr, "inflate:       code lengths ok\n"));
+					state.have = 0;
+					state.mode = CODELENS;
+				/* falls through */
+				case CODELENS:
+					while (state.have < state.nlen + state.ndist) {
+						for (; ;) {
+							here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/
+							here_bits = here >>> 24;
+							here_op = (here >>> 16) & 0xff;
+							here_val = here & 0xffff;
+
+							if ((here_bits) <= bits) {
+								break;
+							}
+							//--- PULLBYTE() ---//
+							if (have === 0) {
+								break inf_leave;
+							}
+							have--;
+							hold += input[next++] << bits;
+							bits += 8;
+							//---//
+						}
+						if (here_val < 16) {
+							//--- DROPBITS(here.bits) ---//
+							hold >>>= here_bits;
+							bits -= here_bits;
+							//---//
+							state.lens[state.have++] = here_val;
+						} else {
+							if (here_val === 16) {
+								//=== NEEDBITS(here.bits + 2);
+								n = here_bits + 2;
+								while (bits < n) {
+									if (have === 0) {
+										break inf_leave;
+									}
+									have--;
+									hold += input[next++] << bits;
+									bits += 8;
+								}
+								//===//
+								//--- DROPBITS(here.bits) ---//
+								hold >>>= here_bits;
+								bits -= here_bits;
+								//---//
+								if (state.have === 0) {
+									strm.msg = 'invalid bit length repeat';
+									state.mode = BAD;
+									break;
+								}
+								len = state.lens[state.have - 1];
+								copy = 3 + (hold & 0x03);//BITS(2);
+								//--- DROPBITS(2) ---//
+								hold >>>= 2;
+								bits -= 2;
+								//---//
+							} else if (here_val === 17) {
+								//=== NEEDBITS(here.bits + 3);
+								n = here_bits + 3;
+								while (bits < n) {
+									if (have === 0) {
+										break inf_leave;
+									}
+									have--;
+									hold += input[next++] << bits;
+									bits += 8;
+								}
+								//===//
+								//--- DROPBITS(here.bits) ---//
+								hold >>>= here_bits;
+								bits -= here_bits;
+								//---//
+								len = 0;
+								copy = 3 + (hold & 0x07);//BITS(3);
+								//--- DROPBITS(3) ---//
+								hold >>>= 3;
+								bits -= 3;
+								//---//
+							} else {
+								//=== NEEDBITS(here.bits + 7);
+								n = here_bits + 7;
+								while (bits < n) {
+									if (have === 0) {
+										break inf_leave;
+									}
+									have--;
+									hold += input[next++] << bits;
+									bits += 8;
+								}
+								//===//
+								//--- DROPBITS(here.bits) ---//
+								hold >>>= here_bits;
+								bits -= here_bits;
+								//---//
+								len = 0;
+								copy = 11 + (hold & 0x7f);//BITS(7);
+								//--- DROPBITS(7) ---//
+								hold >>>= 7;
+								bits -= 7;
+								//---//
+							}
+							if (state.have + copy > state.nlen + state.ndist) {
+								strm.msg = 'invalid bit length repeat';
+								state.mode = BAD;
+								break;
+							}
+							while (copy--) {
+								state.lens[state.have++] = len;
+							}
+						}
+					}
+
+					/* handle error breaks in while */
+					if (state.mode === BAD) {
+						break;
+					}
+
+					/* check for end-of-block code (better have one) */
+					if (state.lens[256] === 0) {
+						strm.msg = 'invalid code -- missing end-of-block';
+						state.mode = BAD;
+						break;
+					}
+
+					/* build code tables -- note: do not change the lenbits or distbits
+						 values here (9 and 6) without reading the comments in inftrees.h
+						 concerning the ENOUGH constants, which depend on those values */
+					state.lenbits = 9;
+
+					opts = {bits: state.lenbits};
+					ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);
+					// We have separate tables & no pointers. 2 commented lines below not needed.
+					// state.next_index = opts.table_index;
+					state.lenbits = opts.bits;
+					// state.lencode = state.next;
+
+					if (ret) {
+						strm.msg = 'invalid literal/lengths set';
+						state.mode = BAD;
+						break;
+					}
+
+					state.distbits = 6;
+					//state.distcode.copy(state.codes);
+					// Switch to use dynamic table
+					state.distcode = state.distdyn;
+					opts = {bits: state.distbits};
+					ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);
+					// We have separate tables & no pointers. 2 commented lines below not needed.
+					// state.next_index = opts.table_index;
+					state.distbits = opts.bits;
+					// state.distcode = state.next;
+
+					if (ret) {
+						strm.msg = 'invalid distances set';
+						state.mode = BAD;
+						break;
+					}
+					//Tracev((stderr, 'inflate:       codes ok\n'));
+					state.mode = LEN_;
+					if (flush === Z_TREES) {
+						break inf_leave;
+					}
+				/* falls through */
+				case LEN_:
+					state.mode = LEN;
+				/* falls through */
+				case LEN:
+					if (have >= 6 && left >= 258) {
+						//--- RESTORE() ---
+						strm.next_out = put;
+						strm.avail_out = left;
+						strm.next_in = next;
+						strm.avail_in = have;
+						state.hold = hold;
+						state.bits = bits;
+						//---
+						inflate_fast(strm, _out);
+						//--- LOAD() ---
+						put = strm.next_out;
+						output = strm.output;
+						left = strm.avail_out;
+						next = strm.next_in;
+						input = strm.input;
+						have = strm.avail_in;
+						hold = state.hold;
+						bits = state.bits;
+						//---
+
+						if (state.mode === TYPE) {
+							state.back = -1;
+						}
+						break;
+					}
+					state.back = 0;
+					for (; ;) {
+						here = state.lencode[hold & ((1 << state.lenbits) - 1)];  /*BITS(state.lenbits)*/
+						here_bits = here >>> 24;
+						here_op = (here >>> 16) & 0xff;
+						here_val = here & 0xffff;
+
+						if (here_bits <= bits) {
+							break;
+						}
+						//--- PULLBYTE() ---//
+						if (have === 0) {
+							break inf_leave;
+						}
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+						//---//
+					}
+					if (here_op && (here_op & 0xf0) === 0) {
+						last_bits = here_bits;
+						last_op = here_op;
+						last_val = here_val;
+						for (; ;) {
+							here = state.lencode[last_val +
+							((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];
+							here_bits = here >>> 24;
+							here_op = (here >>> 16) & 0xff;
+							here_val = here & 0xffff;
+
+							if ((last_bits + here_bits) <= bits) {
+								break;
+							}
+							//--- PULLBYTE() ---//
+							if (have === 0) {
+								break inf_leave;
+							}
+							have--;
+							hold += input[next++] << bits;
+							bits += 8;
+							//---//
+						}
+						//--- DROPBITS(last.bits) ---//
+						hold >>>= last_bits;
+						bits -= last_bits;
+						//---//
+						state.back += last_bits;
+					}
+					//--- DROPBITS(here.bits) ---//
+					hold >>>= here_bits;
+					bits -= here_bits;
+					//---//
+					state.back += here_bits;
+					state.length = here_val;
+					if (here_op === 0) {
+						//Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
+						//        "inflate:         literal '%c'\n" :
+						//        "inflate:         literal 0x%02x\n", here.val));
+						state.mode = LIT;
+						break;
+					}
+					if (here_op & 32) {
+						//Tracevv((stderr, "inflate:         end of block\n"));
+						state.back = -1;
+						state.mode = TYPE;
+						break;
+					}
+					if (here_op & 64) {
+						strm.msg = 'invalid literal/length code';
+						state.mode = BAD;
+						break;
+					}
+					state.extra = here_op & 15;
+					state.mode = LENEXT;
+				/* falls through */
+				case LENEXT:
+					if (state.extra) {
+						//=== NEEDBITS(state.extra);
+						n = state.extra;
+						while (bits < n) {
+							if (have === 0) {
+								break inf_leave;
+							}
+							have--;
+							hold += input[next++] << bits;
+							bits += 8;
+						}
+						//===//
+						state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;
+						//--- DROPBITS(state.extra) ---//
+						hold >>>= state.extra;
+						bits -= state.extra;
+						//---//
+						state.back += state.extra;
+					}
+					//Tracevv((stderr, "inflate:         length %u\n", state.length));
+					state.was = state.length;
+					state.mode = DIST;
+				/* falls through */
+				case DIST:
+					for (; ;) {
+						here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/
+						here_bits = here >>> 24;
+						here_op = (here >>> 16) & 0xff;
+						here_val = here & 0xffff;
+
+						if ((here_bits) <= bits) {
+							break;
+						}
+						//--- PULLBYTE() ---//
+						if (have === 0) {
+							break inf_leave;
+						}
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+						//---//
+					}
+					if ((here_op & 0xf0) === 0) {
+						last_bits = here_bits;
+						last_op = here_op;
+						last_val = here_val;
+						for (; ;) {
+							here = state.distcode[last_val +
+							((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];
+							here_bits = here >>> 24;
+							here_op = (here >>> 16) & 0xff;
+							here_val = here & 0xffff;
+
+							if ((last_bits + here_bits) <= bits) {
+								break;
+							}
+							//--- PULLBYTE() ---//
+							if (have === 0) {
+								break inf_leave;
+							}
+							have--;
+							hold += input[next++] << bits;
+							bits += 8;
+							//---//
+						}
+						//--- DROPBITS(last.bits) ---//
+						hold >>>= last_bits;
+						bits -= last_bits;
+						//---//
+						state.back += last_bits;
+					}
+					//--- DROPBITS(here.bits) ---//
+					hold >>>= here_bits;
+					bits -= here_bits;
+					//---//
+					state.back += here_bits;
+					if (here_op & 64) {
+						strm.msg = 'invalid distance code';
+						state.mode = BAD;
+						break;
+					}
+					state.offset = here_val;
+					state.extra = (here_op) & 15;
+					state.mode = DISTEXT;
+				/* falls through */
+				case DISTEXT:
+					if (state.extra) {
+						//=== NEEDBITS(state.extra);
+						n = state.extra;
+						while (bits < n) {
+							if (have === 0) {
+								break inf_leave;
+							}
+							have--;
+							hold += input[next++] << bits;
+							bits += 8;
+						}
+						//===//
+						state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;
+						//--- DROPBITS(state.extra) ---//
+						hold >>>= state.extra;
+						bits -= state.extra;
+						//---//
+						state.back += state.extra;
+					}
+					//#ifdef INFLATE_STRICT
+					if (state.offset > state.dmax) {
+						strm.msg = 'invalid distance too far back';
+						state.mode = BAD;
+						break;
+					}
+					//#endif
+					//Tracevv((stderr, "inflate:         distance %u\n", state.offset));
+					state.mode = MATCH;
+				/* falls through */
+				case MATCH:
+					if (left === 0) {
+						break inf_leave;
+					}
+					copy = _out - left;
+					if (state.offset > copy) {         /* copy from window */
+						copy = state.offset - copy;
+						if (copy > state.whave) {
+							if (state.sane) {
+								strm.msg = 'invalid distance too far back';
+								state.mode = BAD;
+								break;
+							}
+							// (!) This block is disabled in zlib defaults,
+							// don't enable it for binary compatibility
+							//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
+							//          Trace((stderr, "inflate.c too far\n"));
+							//          copy -= state.whave;
+							//          if (copy > state.length) { copy = state.length; }
+							//          if (copy > left) { copy = left; }
+							//          left -= copy;
+							//          state.length -= copy;
+							//          do {
+							//            output[put++] = 0;
+							//          } while (--copy);
+							//          if (state.length === 0) { state.mode = LEN; }
+							//          break;
+							//#endif
+						}
+						if (copy > state.wnext) {
+							copy -= state.wnext;
+							from = state.wsize - copy;
+						} else {
+							from = state.wnext - copy;
+						}
+						if (copy > state.length) {
+							copy = state.length;
+						}
+						from_source = state.window;
+					} else {                              /* copy from output */
+						from_source = output;
+						from = put - state.offset;
+						copy = state.length;
+					}
+					if (copy > left) {
+						copy = left;
+					}
+					left -= copy;
+					state.length -= copy;
+					do {
+						output[put++] = from_source[from++];
+					} while (--copy);
+					if (state.length === 0) {
+						state.mode = LEN;
+					}
+					break;
+				case LIT:
+					if (left === 0) {
+						break inf_leave;
+					}
+					output[put++] = state.length;
+					left--;
+					state.mode = LEN;
+					break;
+				case CHECK:
+					if (state.wrap) {
+						//=== NEEDBITS(32);
+						while (bits < 32) {
+							if (have === 0) {
+								break inf_leave;
+							}
+							have--;
+							// Use '|' instead of '+' to make sure that result is signed
+							hold |= input[next++] << bits;
+							bits += 8;
+						}
+						//===//
+						_out -= left;
+						strm.total_out += _out;
+						state.total += _out;
+						if (_out) {
+							strm.adler = state.check =
+								/*UPDATE(state.check, put - _out, _out);*/
+								(state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out));
+
+						}
+						_out = left;
+						// NB: crc32 stored as signed 32-bit int, zswap32 returns signed too
+						if ((state.flags ? hold : zswap32(hold)) !== state.check) {
+							strm.msg = 'incorrect data check';
+							state.mode = BAD;
+							break;
+						}
+						//=== INITBITS();
+						hold = 0;
+						bits = 0;
+						//===//
+						//Tracev((stderr, "inflate:   check matches trailer\n"));
+					}
+					state.mode = LENGTH;
+				/* falls through */
+				case LENGTH:
+					if (state.wrap && state.flags) {
+						//=== NEEDBITS(32);
+						while (bits < 32) {
+							if (have === 0) {
+								break inf_leave;
+							}
+							have--;
+							hold += input[next++] << bits;
+							bits += 8;
+						}
+						//===//
+						if (hold !== (state.total & 0xffffffff)) {
+							strm.msg = 'incorrect length check';
+							state.mode = BAD;
+							break;
+						}
+						//=== INITBITS();
+						hold = 0;
+						bits = 0;
+						//===//
+						//Tracev((stderr, "inflate:   length matches trailer\n"));
+					}
+					state.mode = DONE;
+				/* falls through */
+				case DONE:
+					ret = Z_STREAM_END;
+					break inf_leave;
+				case BAD:
+					ret = Z_DATA_ERROR;
+					break inf_leave;
+				case MEM:
+					return Z_MEM_ERROR;
+				case SYNC:
+				/* falls through */
+				default:
+					return Z_STREAM_ERROR;
+			}
+		}
+
+	// inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave"
+
+	/*
+		 Return from inflate(), updating the total counts and the check value.
+		 If there was no progress during the inflate() call, return a buffer
+		 error.  Call updatewindow() to create and/or update the window state.
+		 Note: a memory error from inflate() is non-recoverable.
+	 */
+
+	//--- RESTORE() ---
+	strm.next_out = put;
+	strm.avail_out = left;
+	strm.next_in = next;
+	strm.avail_in = have;
+	state.hold = hold;
+	state.bits = bits;
+	//---
+
+	if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&
+		(state.mode < CHECK || flush !== Z_FINISH))) {
+		if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {
+			state.mode = MEM;
+			return Z_MEM_ERROR;
+		}
+	}
+	_in -= strm.avail_in;
+	_out -= strm.avail_out;
+	strm.total_in += _in;
+	strm.total_out += _out;
+	state.total += _out;
+	if (state.wrap && _out) {
+		strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
+			(state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out));
+	}
+	strm.data_type = state.bits + (state.last ? 64 : 0) +
+		(state.mode === TYPE ? 128 : 0) +
+		(state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);
+	if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {
+		ret = Z_BUF_ERROR;
+	}
+	return ret;
+}
+
+function inflateEnd(strm) {
+
+	if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {
+		return Z_STREAM_ERROR;
+	}
+
+	var state = strm.state;
+	if (state.window) {
+		state.window = null;
+	}
+	strm.state = null;
+	return Z_OK;
+}
+
+function inflateGetHeader(strm, head) {
+	var state;
+
+	/* check state */
+	if (!strm || !strm.state) {
+		return Z_STREAM_ERROR;
+	}
+	state = strm.state;
+	if ((state.wrap & 2) === 0) {
+		return Z_STREAM_ERROR;
+	}
+
+	/* save header structure */
+	state.head = head;
+	head.done = false;
+	return Z_OK;
+}
+
+function inflateSetDictionary(strm, dictionary) {
+	var dictLength = dictionary.length;
+
+	var state;
+	var dictid;
+	var ret;
+
+	/* check state */
+	if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) {
+		return Z_STREAM_ERROR;
+	}
+	state = strm.state;
+
+	if (state.wrap !== 0 && state.mode !== DICT) {
+		return Z_STREAM_ERROR;
+	}
+
+	/* check for correct dictionary identifier */
+	if (state.mode === DICT) {
+		dictid = 1; /* adler32(0, null, 0)*/
+		/* dictid = adler32(dictid, dictionary, dictLength); */
+		dictid = adler32(dictid, dictionary, dictLength, 0);
+		if (dictid !== state.check) {
+			return Z_DATA_ERROR;
+		}
+	}
+	/* copy dictionary to window using updatewindow(), which will amend the
+	 existing dictionary if appropriate */
+	ret = updatewindow(strm, dictionary, dictLength, dictLength);
+	if (ret) {
+		state.mode = MEM;
+		return Z_MEM_ERROR;
+	}
+	state.havedict = 1;
+	// Tracev((stderr, "inflate:   dictionary set\n"));
+	return Z_OK;
+}
+
+const inflateInfo = 'pako inflate (from Nodeca project)';
+export default {
+	inflateReset,
+	inflateReset2,
+	inflateResetKeep,
+	inflateInit,
+	inflateInit2,
+	inflate,
+	inflateEnd,
+	inflateGetHeader,
+	inflateSetDictionary,
+	inflateInfo,
+}
+
+

src/svga/pako/zlib/inftrees.ts

+'use strict';
+
+// (C) 1995-2013 Jean-loup Gailly and Mark Adler
+// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+//
+// This software is provided 'as-is', without any express or implied
+// warranty. In no event will the authors be held liable for any damages
+// arising from the use of this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+// 1. The origin of this software must not be misrepresented; you must not
+//   claim that you wrote the original software. If you use this software
+//   in a product, an acknowledgment in the product documentation would be
+//   appreciated but is not required.
+// 2. Altered source versions must be plainly marked as such, and must not be
+//   misrepresented as being the original software.
+// 3. This notice may not be removed or altered from any source distribution.
+
+import {utils} from '../utils/common';
+
+var MAXBITS = 15;
+var ENOUGH_LENS = 852;
+var ENOUGH_DISTS = 592;
+//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);
+
+var CODES = 0;
+var LENS = 1;
+var DISTS = 2;
+
+var lbase = [ /* Length codes 257..285 base */
+	3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
+	35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0
+];
+
+var lext = [ /* Length codes 257..285 extra */
+	16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,
+	19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78
+];
+
+var dbase = [ /* Distance codes 0..29 base */
+	1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
+	257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
+	8193, 12289, 16385, 24577, 0, 0
+];
+
+var dext = [ /* Distance codes 0..29 extra */
+	16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,
+	23, 23, 24, 24, 25, 25, 26, 26, 27, 27,
+	28, 28, 29, 29, 64, 64
+];
+
+export default function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts) {
+	var bits = opts.bits;
+	//here = opts.here; /* table entry for duplication */
+
+	var len = 0;               /* a code's length in bits */
+	var sym = 0;               /* index of code symbols */
+	var min = 0, max = 0;          /* minimum and maximum code lengths */
+	var root = 0;              /* number of index bits for root table */
+	var curr = 0;              /* number of index bits for current table */
+	var drop = 0;              /* code bits to drop for sub-table */
+	var left = 0;                   /* number of prefix codes available */
+	var used = 0;              /* code entries in table used */
+	var huff = 0;              /* Huffman code */
+	var incr;              /* for incrementing code, index */
+	var fill;              /* index for replicating entries */
+	var low;               /* low bits for current root entry */
+	var mask;              /* mask for low root bits */
+	var next;             /* next available space in table */
+	var base = null;     /* base value table to use */
+	var base_index = 0;
+	//  var shoextra;    /* extra bits table to use */
+	var end;                    /* use base and extra for symbol > end */
+	var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */
+	var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */
+	var extra = null;
+	var extra_index = 0;
+
+	var here_bits, here_op, here_val;
+
+	/*
+	 Process a set of code lengths to create a canonical Huffman code.  The
+	 code lengths are lens[0..codes-1].  Each length corresponds to the
+	 symbols 0..codes-1.  The Huffman code is generated by first sorting the
+	 symbols by length from short to long, and retaining the symbol order
+	 for codes with equal lengths.  Then the code starts with all zero bits
+	 for the first code of the shortest length, and the codes are integer
+	 increments for the same length, and zeros are appended as the length
+	 increases.  For the deflate format, these bits are stored backwards
+	 from their more natural integer increment ordering, and so when the
+	 decoding tables are built in the large loop below, the integer codes
+	 are incremented backwards.
+
+	 This routine assumes, but does not check, that all of the entries in
+	 lens[] are in the range 0..MAXBITS.  The caller must assure this.
+	 1..MAXBITS is interpreted as that code length.  zero means that that
+	 symbol does not occur in this code.
+
+	 The codes are sorted by computing a count of codes for each length,
+	 creating from that a table of starting indices for each length in the
+	 sorted table, and then entering the symbols in order in the sorted
+	 table.  The sorted table is work[], with that space being provided by
+	 the caller.
+
+	 The length counts are used for other purposes as well, i.e. finding
+	 the minimum and maximum length codes, determining if there are any
+	 codes at all, checking for a valid set of lengths, and looking ahead
+	 at length counts to determine sub-table sizes when building the
+	 decoding tables.
+	 */
+
+	/* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
+	for (len = 0; len <= MAXBITS; len++) {
+		count[len] = 0;
+	}
+	for (sym = 0; sym < codes; sym++) {
+		count[lens[lens_index + sym]]++;
+	}
+
+	/* bound code lengths, force root to be within code lengths */
+	root = bits;
+	for (max = MAXBITS; max >= 1; max--) {
+		if (count[max] !== 0) {
+			break;
+		}
+	}
+	if (root > max) {
+		root = max;
+	}
+	if (max === 0) {                     /* no symbols to code at all */
+		//table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */
+		//table.bits[opts.table_index] = 1;   //here.bits = (var char)1;
+		//table.val[opts.table_index++] = 0;   //here.val = (var short)0;
+		table[table_index++] = (1 << 24) | (64 << 16) | 0;
+
+
+		//table.op[opts.table_index] = 64;
+		//table.bits[opts.table_index] = 1;
+		//table.val[opts.table_index++] = 0;
+		table[table_index++] = (1 << 24) | (64 << 16) | 0;
+
+		opts.bits = 1;
+		return 0;     /* no symbols, but wait for decoding to report error */
+	}
+	for (min = 1; min < max; min++) {
+		if (count[min] !== 0) {
+			break;
+		}
+	}
+	if (root < min) {
+		root = min;
+	}
+
+	/* check for an over-subscribed or incomplete set of lengths */
+	left = 1;
+	for (len = 1; len <= MAXBITS; len++) {
+		left <<= 1;
+		left -= count[len];
+		if (left < 0) {
+			return -1;
+		}        /* over-subscribed */
+	}
+	if (left > 0 && (type === CODES || max !== 1)) {
+		return -1;                      /* incomplete set */
+	}
+
+	/* generate offsets into symbol table for each length for sorting */
+	offs[1] = 0;
+	for (len = 1; len < MAXBITS; len++) {
+		offs[len + 1] = offs[len] + count[len];
+	}
+
+	/* sort symbols by length, by symbol order within each length */
+	for (sym = 0; sym < codes; sym++) {
+		if (lens[lens_index + sym] !== 0) {
+			work[offs[lens[lens_index + sym]]++] = sym;
+		}
+	}
+
+	/*
+	 Create and fill in decoding tables.  In this loop, the table being
+	 filled is at next and has curr index bits.  The code being used is huff
+	 with length len.  That code is converted to an index by dropping drop
+	 bits off of the bottom.  For codes where len is less than drop + curr,
+	 those top drop + curr - len bits are incremented through all values to
+	 fill the table with replicated entries.
+
+	 root is the number of index bits for the root table.  When len exceeds
+	 root, sub-tables are created pointed to by the root entry with an index
+	 of the low root bits of huff.  This is saved in low to check for when a
+	 new sub-table should be started.  drop is zero when the root table is
+	 being filled, and drop is root when sub-tables are being filled.
+
+	 When a new sub-table is needed, it is necessary to look ahead in the
+	 code lengths to determine what size sub-table is needed.  The length
+	 counts are used for this, and so count[] is decremented as codes are
+	 entered in the tables.
+
+	 used keeps track of how many table entries have been allocated from the
+	 provided *table space.  It is checked for LENS and DIST tables against
+	 the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in
+	 the initial root table size constants.  See the comments in inftrees.h
+	 for more information.
+
+	 sym increments through all symbols, and the loop terminates when
+	 all codes of length max, i.e. all codes, have been processed.  This
+	 routine permits incomplete codes, so another loop after this one fills
+	 in the rest of the decoding tables with invalid code markers.
+	 */
+
+	/* set up for code type */
+	// poor man optimization - use if-else instead of switch,
+	// to avoid deopts in old v8
+	if (type === CODES) {
+		base = extra = work;    /* dummy value--not used */
+		end = 19;
+
+	} else if (type === LENS) {
+		base = lbase;
+		base_index -= 257;
+		extra = lext;
+		extra_index -= 257;
+		end = 256;
+
+	} else {                    /* DISTS */
+		base = dbase;
+		extra = dext;
+		end = -1;
+	}
+
+	/* initialize opts for loop */
+	huff = 0;                   /* starting code */
+	sym = 0;                    /* starting code symbol */
+	len = min;                  /* starting code length */
+	next = table_index;              /* current table to fill in */
+	curr = root;                /* current table index bits */
+	drop = 0;                   /* current bits to drop from code for index */
+	low = -1;                   /* trigger new sub-table when len > root */
+	used = 1 << root;          /* use root table entries */
+	mask = used - 1;            /* mask for comparing low */
+
+	/* check available table space */
+	if ((type === LENS && used > ENOUGH_LENS) ||
+		(type === DISTS && used > ENOUGH_DISTS)) {
+		return 1;
+	}
+
+	/* process all codes and make table entries */
+	for (; ;) {
+		/* create table entry */
+		here_bits = len - drop;
+		if (work[sym] < end) {
+			here_op = 0;
+			here_val = work[sym];
+		} else if (work[sym] > end) {
+			here_op = extra[extra_index + work[sym]];
+			here_val = base[base_index + work[sym]];
+		} else {
+			here_op = 32 + 64;         /* end of block */
+			here_val = 0;
+		}
+
+		/* replicate for those indices with low len bits equal to huff */
+		incr = 1 << (len - drop);
+		fill = 1 << curr;
+		min = fill;                 /* save offset to next table */
+		do {
+			fill -= incr;
+			table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val | 0;
+		} while (fill !== 0);
+
+		/* backwards increment the len-bit code huff */
+		incr = 1 << (len - 1);
+		while (huff & incr) {
+			incr >>= 1;
+		}
+		if (incr !== 0) {
+			huff &= incr - 1;
+			huff += incr;
+		} else {
+			huff = 0;
+		}
+
+		/* go to next symbol, update count, len */
+		sym++;
+		if (--count[len] === 0) {
+			if (len === max) {
+				break;
+			}
+			len = lens[lens_index + work[sym]];
+		}
+
+		/* create new sub-table if needed */
+		if (len > root && (huff & mask) !== low) {
+			/* if first time, transition to sub-tables */
+			if (drop === 0) {
+				drop = root;
+			}
+
+			/* increment past last table */
+			next += min;            /* here min is 1 << curr */
+
+			/* determine length of next table */
+			curr = len - drop;
+			left = 1 << curr;
+			while (curr + drop < max) {
+				left -= count[curr + drop];
+				if (left <= 0) {
+					break;
+				}
+				curr++;
+				left <<= 1;
+			}
+
+			/* check for enough space */
+			used += 1 << curr;
+			if ((type === LENS && used > ENOUGH_LENS) ||
+				(type === DISTS && used > ENOUGH_DISTS)) {
+				return 1;
+			}
+
+			/* point entry in root table to sub-table */
+			low = huff & mask;
+			/*table.op[low] = curr;
+			table.bits[low] = root;
+			table.val[low] = next - opts.table_index;*/
+			table[low] = (root << 24) | (curr << 16) | (next - table_index) | 0;
+		}
+	}
+
+	/* fill in remaining table entry if code is incomplete (guaranteed to have
+	 at most one remaining entry, since if the code is incomplete, the
+	 maximum code length that was allowed to get this far is one bit) */
+	if (huff !== 0) {
+		//table.op[next + huff] = 64;            /* invalid code marker */
+		//table.bits[next + huff] = len - drop;
+		//table.val[next + huff] = 0;
+		table[next + huff] = ((len - drop) << 24) | (64 << 16) | 0;
+	}
+
+	/* set return parameters */
+	//opts.table_index += used;
+	opts.bits = root;
+	return 0;
+};

src/svga/pako/zlib/messages.ts

+'use strict';
+
+// (C) 1995-2013 Jean-loup Gailly and Mark Adler
+// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+//
+// This software is provided 'as-is', without any express or implied
+// warranty. In no event will the authors be held liable for any damages
+// arising from the use of this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+// 1. The origin of this software must not be misrepresented; you must not
+//   claim that you wrote the original software. If you use this software
+//   in a product, an acknowledgment in the product documentation would be
+//   appreciated but is not required.
+// 2. Altered source versions must be plainly marked as such, and must not be
+//   misrepresented as being the original software.
+// 3. This notice may not be removed or altered from any source distribution.
+
+export default {
+	2: 'need dictionary',     /* Z_NEED_DICT       2  */
+	1: 'stream end',          /* Z_STREAM_END      1  */
+	0: '',                    /* Z_OK              0  */
+	'-1': 'file error',          /* Z_ERRNO         (-1) */
+	'-2': 'stream error',        /* Z_STREAM_ERROR  (-2) */
+	'-3': 'data error',          /* Z_DATA_ERROR    (-3) */
+	'-4': 'insufficient memory', /* Z_MEM_ERROR     (-4) */
+	'-5': 'buffer error',        /* Z_BUF_ERROR     (-5) */
+	'-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */
+};

src/svga/pako/zlib/trees.ts

+'use strict';
+
+// (C) 1995-2013 Jean-loup Gailly and Mark Adler
+// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+//
+// This software is provided 'as-is', without any express or implied
+// warranty. In no event will the authors be held liable for any damages
+// arising from the use of this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+// 1. The origin of this software must not be misrepresented; you must not
+//   claim that you wrote the original software. If you use this software
+//   in a product, an acknowledgment in the product documentation would be
+//   appreciated but is not required.
+// 2. Altered source versions must be plainly marked as such, and must not be
+//   misrepresented as being the original software.
+// 3. This notice may not be removed or altered from any source distribution.
+
+/* eslint-disable space-unary-ops */
+
+import {utils} from '../utils/common';
+
+/* Public constants ==========================================================*/
+/* ===========================================================================*/
+
+
+//var Z_FILTERED          = 1;
+//var Z_HUFFMAN_ONLY      = 2;
+//var Z_RLE               = 3;
+var Z_FIXED = 4;
+//var Z_DEFAULT_STRATEGY  = 0;
+
+/* Possible values of the data_type field (though see inflate()) */
+var Z_BINARY = 0;
+var Z_TEXT = 1;
+//var Z_ASCII             = 1; // = Z_TEXT
+var Z_UNKNOWN = 2;
+
+/*============================================================================*/
+
+
+function zero(buf) {
+	var len = buf.length;
+	while (--len >= 0) {
+		buf[len] = 0;
+	}
+}
+
+// From zutil.h
+
+var STORED_BLOCK = 0;
+var STATIC_TREES = 1;
+var DYN_TREES = 2;
+/* The three kinds of block type */
+
+var MIN_MATCH = 3;
+var MAX_MATCH = 258;
+/* The minimum and maximum match lengths */
+
+// From deflate.h
+/* ===========================================================================
+ * Internal compression state.
+ */
+
+var LENGTH_CODES = 29;
+/* number of length codes, not counting the special END_BLOCK code */
+
+var LITERALS = 256;
+/* number of literal bytes 0..255 */
+
+var L_CODES = LITERALS + 1 + LENGTH_CODES;
+/* number of Literal or Length codes, including the END_BLOCK code */
+
+var D_CODES = 30;
+/* number of distance codes */
+
+var BL_CODES = 19;
+/* number of codes used to transfer the bit lengths */
+
+var HEAP_SIZE = 2 * L_CODES + 1;
+/* maximum heap size */
+
+var MAX_BITS = 15;
+/* All codes must not exceed MAX_BITS bits */
+
+var Buf_size = 16;
+/* size of bit buffer in bi_buf */
+
+
+/* ===========================================================================
+ * Constants
+ */
+
+var MAX_BL_BITS = 7;
+/* Bit length codes must not exceed MAX_BL_BITS bits */
+
+var END_BLOCK = 256;
+/* end of block literal code */
+
+var REP_3_6 = 16;
+/* repeat previous bit length 3-6 times (2 bits of repeat count) */
+
+var REPZ_3_10 = 17;
+/* repeat a zero length 3-10 times  (3 bits of repeat count) */
+
+var REPZ_11_138 = 18;
+/* repeat a zero length 11-138 times  (7 bits of repeat count) */
+
+/* eslint-disable comma-spacing,array-bracket-spacing */
+var extra_lbits =   /* extra bits for each length code */
+	[0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0];
+
+var extra_dbits =   /* extra bits for each distance code */
+	[0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13];
+
+var extra_blbits =  /* extra bits for each bit length code */
+	[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7];
+
+var bl_order =
+	[16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+/* eslint-enable comma-spacing,array-bracket-spacing */
+
+/* The lengths of the bit length codes are sent in order of decreasing
+ * probability, to avoid transmitting the lengths for unused bit length codes.
+ */
+
+/* ===========================================================================
+ * Local data. These are initialized only once.
+ */
+
+// We pre-fill arrays with 0 to avoid uninitialized gaps
+
+var DIST_CODE_LEN = 512; /* see definition of array dist_code below */
+
+// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1
+var static_ltree = new Array((L_CODES + 2) * 2);
+zero(static_ltree);
+/* The static literal tree. Since the bit lengths are imposed, there is no
+ * need for the L_CODES extra codes used during heap construction. However
+ * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
+ * below).
+ */
+
+var static_dtree = new Array(D_CODES * 2);
+zero(static_dtree);
+/* The static distance tree. (Actually a trivial tree since all codes use
+ * 5 bits.)
+ */
+
+var _dist_code = new Array(DIST_CODE_LEN);
+zero(_dist_code);
+/* Distance codes. The first 256 values correspond to the distances
+ * 3 .. 258, the last 256 values correspond to the top 8 bits of
+ * the 15 bit distances.
+ */
+
+var _length_code = new Array(MAX_MATCH - MIN_MATCH + 1);
+zero(_length_code);
+/* length code for each normalized match length (0 == MIN_MATCH) */
+
+var base_length = new Array(LENGTH_CODES);
+zero(base_length);
+/* First normalized length for each code (0 = MIN_MATCH) */
+
+var base_dist = new Array(D_CODES);
+zero(base_dist);
+
+/* First normalized distance for each code (0 = distance of 1) */
+
+
+function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {
+
+	this.static_tree = static_tree;  /* static tree or NULL */
+	this.extra_bits = extra_bits;   /* extra bits for each code or NULL */
+	this.extra_base = extra_base;   /* base index for extra_bits */
+	this.elems = elems;        /* max number of elements in the tree */
+	this.max_length = max_length;   /* max bit length for the codes */
+
+	// show if `static_tree` has data or dummy - needed for monomorphic objects
+	this.has_stree = static_tree && static_tree.length;
+}
+
+
+var static_l_desc;
+var static_d_desc;
+var static_bl_desc;
+
+
+function TreeDesc(dyn_tree, stat_desc) {
+	this.dyn_tree = dyn_tree;     /* the dynamic tree */
+	this.max_code = 0;            /* largest code with non zero frequency */
+	this.stat_desc = stat_desc;   /* the corresponding static tree */
+}
+
+
+function d_code(dist) {
+	return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];
+}
+
+
+/* ===========================================================================
+ * Output a short LSB first on the stream.
+ * IN assertion: there is enough room in pendingBuf.
+ */
+function put_short(s, w) {
+//    put_byte(s, (uch)((w) & 0xff));
+//    put_byte(s, (uch)((ush)(w) >> 8));
+	s.pending_buf[s.pending++] = (w) & 0xff;
+	s.pending_buf[s.pending++] = (w >>> 8) & 0xff;
+}
+
+
+/* ===========================================================================
+ * Send a value on a given number of bits.
+ * IN assertion: length <= 16 and value fits in length bits.
+ */
+function send_bits(s, value, length) {
+	if (s.bi_valid > (Buf_size - length)) {
+		s.bi_buf |= (value << s.bi_valid) & 0xffff;
+		put_short(s, s.bi_buf);
+		s.bi_buf = value >> (Buf_size - s.bi_valid);
+		s.bi_valid += length - Buf_size;
+	} else {
+		s.bi_buf |= (value << s.bi_valid) & 0xffff;
+		s.bi_valid += length;
+	}
+}
+
+
+function send_code(s, c, tree) {
+	send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);
+}
+
+
+/* ===========================================================================
+ * Reverse the first len bits of a code, using straightforward code (a faster
+ * method would use a table)
+ * IN assertion: 1 <= len <= 15
+ */
+function bi_reverse(code, len) {
+	var res = 0;
+	do {
+		res |= code & 1;
+		code >>>= 1;
+		res <<= 1;
+	} while (--len > 0);
+	return res >>> 1;
+}
+
+
+/* ===========================================================================
+ * Flush the bit buffer, keeping at most 7 bits in it.
+ */
+function bi_flush(s) {
+	if (s.bi_valid === 16) {
+		put_short(s, s.bi_buf);
+		s.bi_buf = 0;
+		s.bi_valid = 0;
+
+	} else if (s.bi_valid >= 8) {
+		s.pending_buf[s.pending++] = s.bi_buf & 0xff;
+		s.bi_buf >>= 8;
+		s.bi_valid -= 8;
+	}
+}
+
+
+/* ===========================================================================
+ * Compute the optimal bit lengths for a tree and update the total bit length
+ * for the current block.
+ * IN assertion: the fields freq and dad are set, heap[heap_max] and
+ *    above are the tree nodes sorted by increasing frequency.
+ * OUT assertions: the field len is set to the optimal bit length, the
+ *     array bl_count contains the frequencies for each bit length.
+ *     The length opt_len is updated; static_len is also updated if stree is
+ *     not null.
+ */
+function gen_bitlen(s, desc)
+//    deflate_state *s;
+//    tree_desc *desc;    /* the tree descriptor */
+{
+	var tree = desc.dyn_tree;
+	var max_code = desc.max_code;
+	var stree = desc.stat_desc.static_tree;
+	var has_stree = desc.stat_desc.has_stree;
+	var extra = desc.stat_desc.extra_bits;
+	var base = desc.stat_desc.extra_base;
+	var max_length = desc.stat_desc.max_length;
+	var h;              /* heap index */
+	var n, m;           /* iterate over the tree elements */
+	var bits;           /* bit length */
+	var xbits;          /* extra bits */
+	var f;              /* frequency */
+	var overflow = 0;   /* number of elements with bit length too large */
+
+	for (bits = 0; bits <= MAX_BITS; bits++) {
+		s.bl_count[bits] = 0;
+	}
+
+	/* In a first pass, compute the optimal bit lengths (which may
+	 * overflow in the case of the bit length tree).
+	 */
+	tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */
+
+	for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {
+		n = s.heap[h];
+		bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;
+		if (bits > max_length) {
+			bits = max_length;
+			overflow++;
+		}
+		tree[n * 2 + 1]/*.Len*/ = bits;
+		/* We overwrite tree[n].Dad which is no longer needed */
+
+		if (n > max_code) {
+			continue;
+		} /* not a leaf node */
+
+		s.bl_count[bits]++;
+		xbits = 0;
+		if (n >= base) {
+			xbits = extra[n - base];
+		}
+		f = tree[n * 2]/*.Freq*/;
+		s.opt_len += f * (bits + xbits);
+		if (has_stree) {
+			s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);
+		}
+	}
+	if (overflow === 0) {
+		return;
+	}
+
+	// Trace((stderr,"\nbit length overflow\n"));
+	/* This happens for example on obj2 and pic of the Calgary corpus */
+
+	/* Find the first bit length which could increase: */
+	do {
+		bits = max_length - 1;
+		while (s.bl_count[bits] === 0) {
+			bits--;
+		}
+		s.bl_count[bits]--;      /* move one leaf down the tree */
+		s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */
+		s.bl_count[max_length]--;
+		/* The brother of the overflow item also moves one step up,
+		 * but this does not affect bl_count[max_length]
+		 */
+		overflow -= 2;
+	} while (overflow > 0);
+
+	/* Now recompute all bit lengths, scanning in increasing frequency.
+	 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
+	 * lengths instead of fixing only the wrong ones. This idea is taken
+	 * from 'ar' written by Haruhiko Okumura.)
+	 */
+	for (bits = max_length; bits !== 0; bits--) {
+		n = s.bl_count[bits];
+		while (n !== 0) {
+			m = s.heap[--h];
+			if (m > max_code) {
+				continue;
+			}
+			if (tree[m * 2 + 1]/*.Len*/ !== bits) {
+				// Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
+				s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;
+				tree[m * 2 + 1]/*.Len*/ = bits;
+			}
+			n--;
+		}
+	}
+}
+
+
+/* ===========================================================================
+ * Generate the codes for a given tree and bit counts (which need not be
+ * optimal).
+ * IN assertion: the array bl_count contains the bit length statistics for
+ * the given tree and the field len is set for all tree elements.
+ * OUT assertion: the field code is set for all tree elements of non
+ *     zero code length.
+ */
+function gen_codes(tree, max_code, bl_count)
+//    ct_data *tree;             /* the tree to decorate */
+//    int max_code;              /* largest code with non zero frequency */
+//    ushf *bl_count;            /* number of codes at each bit length */
+{
+	var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */
+	var code = 0;              /* running code value */
+	var bits;                  /* bit index */
+	var n;                     /* code index */
+
+	/* The distribution counts are first used to generate the code values
+	 * without bit reversal.
+	 */
+	for (bits = 1; bits <= MAX_BITS; bits++) {
+		next_code[bits] = code = (code + bl_count[bits - 1]) << 1;
+	}
+	/* Check that the bit counts in bl_count are consistent. The last code
+	 * must be all ones.
+	 */
+	//Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
+	//        "inconsistent bit counts");
+	//Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
+
+	for (n = 0; n <= max_code; n++) {
+		var len = tree[n * 2 + 1]/*.Len*/;
+		if (len === 0) {
+			continue;
+		}
+		/* Now reverse the bits */
+		tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);
+
+		//Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
+		//     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
+	}
+}
+
+
+/* ===========================================================================
+ * Initialize the various 'constant' tables.
+ */
+function tr_static_init() {
+	var n;        /* iterates over tree elements */
+	var bits;     /* bit counter */
+	var length;   /* length value */
+	var code;     /* code value */
+	var dist;     /* distance index */
+	var bl_count = new Array(MAX_BITS + 1);
+	/* number of codes at each bit length for an optimal tree */
+
+	// do check in _tr_init()
+	//if (static_init_done) return;
+
+	/* For some embedded targets, global variables are not initialized: */
+	/*#ifdef NO_INIT_GLOBAL_POINTERS
+		static_l_desc.static_tree = static_ltree;
+		static_l_desc.extra_bits = extra_lbits;
+		static_d_desc.static_tree = static_dtree;
+		static_d_desc.extra_bits = extra_dbits;
+		static_bl_desc.extra_bits = extra_blbits;
+	#endif*/
+
+	/* Initialize the mapping length (0..255) -> length code (0..28) */
+	length = 0;
+	for (code = 0; code < LENGTH_CODES - 1; code++) {
+		base_length[code] = length;
+		for (n = 0; n < (1 << extra_lbits[code]); n++) {
+			_length_code[length++] = code;
+		}
+	}
+	//Assert (length == 256, "tr_static_init: length != 256");
+	/* Note that the length 255 (match length 258) can be represented
+	 * in two different ways: code 284 + 5 bits or code 285, so we
+	 * overwrite length_code[255] to use the best encoding:
+	 */
+	_length_code[length - 1] = code;
+
+	/* Initialize the mapping dist (0..32K) -> dist code (0..29) */
+	dist = 0;
+	for (code = 0; code < 16; code++) {
+		base_dist[code] = dist;
+		for (n = 0; n < (1 << extra_dbits[code]); n++) {
+			_dist_code[dist++] = code;
+		}
+	}
+	//Assert (dist == 256, "tr_static_init: dist != 256");
+	dist >>= 7; /* from now on, all distances are divided by 128 */
+	for (; code < D_CODES; code++) {
+		base_dist[code] = dist << 7;
+		for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {
+			_dist_code[256 + dist++] = code;
+		}
+	}
+	//Assert (dist == 256, "tr_static_init: 256+dist != 512");
+
+	/* Construct the codes of the static literal tree */
+	for (bits = 0; bits <= MAX_BITS; bits++) {
+		bl_count[bits] = 0;
+	}
+
+	n = 0;
+	while (n <= 143) {
+		static_ltree[n * 2 + 1]/*.Len*/ = 8;
+		n++;
+		bl_count[8]++;
+	}
+	while (n <= 255) {
+		static_ltree[n * 2 + 1]/*.Len*/ = 9;
+		n++;
+		bl_count[9]++;
+	}
+	while (n <= 279) {
+		static_ltree[n * 2 + 1]/*.Len*/ = 7;
+		n++;
+		bl_count[7]++;
+	}
+	while (n <= 287) {
+		static_ltree[n * 2 + 1]/*.Len*/ = 8;
+		n++;
+		bl_count[8]++;
+	}
+	/* Codes 286 and 287 do not exist, but we must include them in the
+	 * tree construction to get a canonical Huffman tree (longest code
+	 * all ones)
+	 */
+	gen_codes(static_ltree, L_CODES + 1, bl_count);
+
+	/* The static distance tree is trivial: */
+	for (n = 0; n < D_CODES; n++) {
+		static_dtree[n * 2 + 1]/*.Len*/ = 5;
+		static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);
+	}
+
+	// Now data ready and we can init static trees
+	static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);
+	static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS);
+	static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS);
+
+	//static_init_done = true;
+}
+
+
+/* ===========================================================================
+ * Initialize a new block.
+ */
+function init_block(s) {
+	var n; /* iterates over tree elements */
+
+	/* Initialize the trees. */
+	for (n = 0; n < L_CODES; n++) {
+		s.dyn_ltree[n * 2]/*.Freq*/ = 0;
+	}
+	for (n = 0; n < D_CODES; n++) {
+		s.dyn_dtree[n * 2]/*.Freq*/ = 0;
+	}
+	for (n = 0; n < BL_CODES; n++) {
+		s.bl_tree[n * 2]/*.Freq*/ = 0;
+	}
+
+	s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;
+	s.opt_len = s.static_len = 0;
+	s.last_lit = s.matches = 0;
+}
+
+
+/* ===========================================================================
+ * Flush the bit buffer and align the output on a byte boundary
+ */
+function bi_windup(s) {
+	if (s.bi_valid > 8) {
+		put_short(s, s.bi_buf);
+	} else if (s.bi_valid > 0) {
+		//put_byte(s, (Byte)s->bi_buf);
+		s.pending_buf[s.pending++] = s.bi_buf;
+	}
+	s.bi_buf = 0;
+	s.bi_valid = 0;
+}
+
+/* ===========================================================================
+ * Copy a stored block, storing first the length and its
+ * one's complement if requested.
+ */
+function copy_block(s, buf, len, header)
+//DeflateState *s;
+//charf    *buf;    /* the input data */
+//unsigned len;     /* its length */
+//int      header;  /* true if block header must be written */
+{
+	bi_windup(s);        /* align on byte boundary */
+
+	if (header) {
+		put_short(s, len);
+		put_short(s, ~len);
+	}
+//  while (len--) {
+//    put_byte(s, *buf++);
+//  }
+	utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);
+	s.pending += len;
+}
+
+/* ===========================================================================
+ * Compares to subtrees, using the tree depth as tie breaker when
+ * the subtrees have equal frequency. This minimizes the worst case length.
+ */
+function smaller(tree, n, m, depth) {
+	var _n2 = n * 2;
+	var _m2 = m * 2;
+	return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||
+		(tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));
+}
+
+/* ===========================================================================
+ * Restore the heap property by moving down the tree starting at node k,
+ * exchanging a node with the smallest of its two sons if necessary, stopping
+ * when the heap property is re-established (each father smaller than its
+ * two sons).
+ */
+function pqdownheap(s, tree, k)
+//    deflate_state *s;
+//    ct_data *tree;  /* the tree to restore */
+//    int k;               /* node to move down */
+{
+	var v = s.heap[k];
+	var j = k << 1;  /* left son of k */
+	while (j <= s.heap_len) {
+		/* Set j to the smallest of the two sons: */
+		if (j < s.heap_len &&
+			smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {
+			j++;
+		}
+		/* Exit if v is smaller than both sons */
+		if (smaller(tree, v, s.heap[j], s.depth)) {
+			break;
+		}
+
+		/* Exchange v with the smallest son */
+		s.heap[k] = s.heap[j];
+		k = j;
+
+		/* And continue down the tree, setting j to the left son of k */
+		j <<= 1;
+	}
+	s.heap[k] = v;
+}
+
+
+// inlined manually
+// var SMALLEST = 1;
+
+/* ===========================================================================
+ * Send the block data compressed using the given Huffman trees
+ */
+function compress_block(s, ltree, dtree)
+//    deflate_state *s;
+//    const ct_data *ltree; /* literal tree */
+//    const ct_data *dtree; /* distance tree */
+{
+	var dist;           /* distance of matched string */
+	var lc;             /* match length or unmatched char (if dist == 0) */
+	var lx = 0;         /* running index in l_buf */
+	var code;           /* the code to send */
+	var extra;          /* number of extra bits to send */
+
+	if (s.last_lit !== 0) {
+		do {
+			dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);
+			lc = s.pending_buf[s.l_buf + lx];
+			lx++;
+
+			if (dist === 0) {
+				send_code(s, lc, ltree); /* send a literal byte */
+				//Tracecv(isgraph(lc), (stderr," '%c' ", lc));
+			} else {
+				/* Here, lc is the match length - MIN_MATCH */
+				code = _length_code[lc];
+				send_code(s, code + LITERALS + 1, ltree); /* send the length code */
+				extra = extra_lbits[code];
+				if (extra !== 0) {
+					lc -= base_length[code];
+					send_bits(s, lc, extra);       /* send the extra length bits */
+				}
+				dist--; /* dist is now the match distance - 1 */
+				code = d_code(dist);
+				//Assert (code < D_CODES, "bad d_code");
+
+				send_code(s, code, dtree);       /* send the distance code */
+				extra = extra_dbits[code];
+				if (extra !== 0) {
+					dist -= base_dist[code];
+					send_bits(s, dist, extra);   /* send the extra distance bits */
+				}
+			} /* literal or match pair ? */
+
+			/* Check that the overlay between pending_buf and d_buf+l_buf is ok: */
+			//Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,
+			//       "pendingBuf overflow");
+
+		} while (lx < s.last_lit);
+	}
+
+	send_code(s, END_BLOCK, ltree);
+}
+
+
+/* ===========================================================================
+ * Construct one Huffman tree and assigns the code bit strings and lengths.
+ * Update the total bit length for the current block.
+ * IN assertion: the field freq is set for all tree elements.
+ * OUT assertions: the fields len and code are set to the optimal bit length
+ *     and corresponding code. The length opt_len is updated; static_len is
+ *     also updated if stree is not null. The field max_code is set.
+ */
+function build_tree(s, desc)
+//    deflate_state *s;
+//    tree_desc *desc; /* the tree descriptor */
+{
+	var tree = desc.dyn_tree;
+	var stree = desc.stat_desc.static_tree;
+	var has_stree = desc.stat_desc.has_stree;
+	var elems = desc.stat_desc.elems;
+	var n, m;          /* iterate over heap elements */
+	var max_code = -1; /* largest code with non zero frequency */
+	var node;          /* new node being created */
+
+	/* Construct the initial heap, with least frequent element in
+	 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
+	 * heap[0] is not used.
+	 */
+	s.heap_len = 0;
+	s.heap_max = HEAP_SIZE;
+
+	for (n = 0; n < elems; n++) {
+		if (tree[n * 2]/*.Freq*/ !== 0) {
+			s.heap[++s.heap_len] = max_code = n;
+			s.depth[n] = 0;
+
+		} else {
+			tree[n * 2 + 1]/*.Len*/ = 0;
+		}
+	}
+
+	/* The pkzip format requires that at least one distance code exists,
+	 * and that at least one bit should be sent even if there is only one
+	 * possible code. So to avoid special checks later on we force at least
+	 * two codes of non zero frequency.
+	 */
+	while (s.heap_len < 2) {
+		node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);
+		tree[node * 2]/*.Freq*/ = 1;
+		s.depth[node] = 0;
+		s.opt_len--;
+
+		if (has_stree) {
+			s.static_len -= stree[node * 2 + 1]/*.Len*/;
+		}
+		/* node is 0 or 1 so it does not have extra bits */
+	}
+	desc.max_code = max_code;
+
+	/* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
+	 * establish sub-heaps of increasing lengths:
+	 */
+	for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) {
+		pqdownheap(s, tree, n);
+	}
+
+	/* Construct the Huffman tree by repeatedly combining the least two
+	 * frequent nodes.
+	 */
+	node = elems;              /* next internal node of the tree */
+	do {
+		//pqremove(s, tree, n);  /* n = node of least frequency */
+		/*** pqremove ***/
+		n = s.heap[1/*SMALLEST*/];
+		s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];
+		pqdownheap(s, tree, 1/*SMALLEST*/);
+		/***/
+
+		m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */
+
+		s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */
+		s.heap[--s.heap_max] = m;
+
+		/* Create a new node father of n and m */
+		tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;
+		s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;
+		tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;
+
+		/* and insert the new node in the heap */
+		s.heap[1/*SMALLEST*/] = node++;
+		pqdownheap(s, tree, 1/*SMALLEST*/);
+
+	} while (s.heap_len >= 2);
+
+	s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];
+
+	/* At this point, the fields freq and dad are set. We can now
+	 * generate the bit lengths.
+	 */
+	gen_bitlen(s, desc);
+
+	/* The field len is now set, we can generate the bit codes */
+	gen_codes(tree, max_code, s.bl_count);
+}
+
+
+/* ===========================================================================
+ * Scan a literal or distance tree to determine the frequencies of the codes
+ * in the bit length tree.
+ */
+function scan_tree(s, tree, max_code)
+//    deflate_state *s;
+//    ct_data *tree;   /* the tree to be scanned */
+//    int max_code;    /* and its largest code of non zero frequency */
+{
+	var n;                     /* iterates over all tree elements */
+	var prevlen = -1;          /* last emitted length */
+	var curlen;                /* length of current code */
+
+	var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */
+
+	var count = 0;             /* repeat count of the current code */
+	var max_count = 7;         /* max repeat count */
+	var min_count = 4;         /* min repeat count */
+
+	if (nextlen === 0) {
+		max_count = 138;
+		min_count = 3;
+	}
+	tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */
+
+	for (n = 0; n <= max_code; n++) {
+		curlen = nextlen;
+		nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;
+
+		if (++count < max_count && curlen === nextlen) {
+			continue;
+
+		} else if (count < min_count) {
+			s.bl_tree[curlen * 2]/*.Freq*/ += count;
+
+		} else if (curlen !== 0) {
+
+			if (curlen !== prevlen) {
+				s.bl_tree[curlen * 2]/*.Freq*/++;
+			}
+			s.bl_tree[REP_3_6 * 2]/*.Freq*/++;
+
+		} else if (count <= 10) {
+			s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;
+
+		} else {
+			s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;
+		}
+
+		count = 0;
+		prevlen = curlen;
+
+		if (nextlen === 0) {
+			max_count = 138;
+			min_count = 3;
+
+		} else if (curlen === nextlen) {
+			max_count = 6;
+			min_count = 3;
+
+		} else {
+			max_count = 7;
+			min_count = 4;
+		}
+	}
+}
+
+
+/* ===========================================================================
+ * Send a literal or distance tree in compressed form, using the codes in
+ * bl_tree.
+ */
+function send_tree(s, tree, max_code)
+//    deflate_state *s;
+//    ct_data *tree; /* the tree to be scanned */
+//    int max_code;       /* and its largest code of non zero frequency */
+{
+	var n;                     /* iterates over all tree elements */
+	var prevlen = -1;          /* last emitted length */
+	var curlen;                /* length of current code */
+
+	var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */
+
+	var count = 0;             /* repeat count of the current code */
+	var max_count = 7;         /* max repeat count */
+	var min_count = 4;         /* min repeat count */
+
+	/* tree[max_code+1].Len = -1; */  /* guard already set */
+	if (nextlen === 0) {
+		max_count = 138;
+		min_count = 3;
+	}
+
+	for (n = 0; n <= max_code; n++) {
+		curlen = nextlen;
+		nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;
+
+		if (++count < max_count && curlen === nextlen) {
+			continue;
+
+		} else if (count < min_count) {
+			do {
+				send_code(s, curlen, s.bl_tree);
+			} while (--count !== 0);
+
+		} else if (curlen !== 0) {
+			if (curlen !== prevlen) {
+				send_code(s, curlen, s.bl_tree);
+				count--;
+			}
+			//Assert(count >= 3 && count <= 6, " 3_6?");
+			send_code(s, REP_3_6, s.bl_tree);
+			send_bits(s, count - 3, 2);
+
+		} else if (count <= 10) {
+			send_code(s, REPZ_3_10, s.bl_tree);
+			send_bits(s, count - 3, 3);
+
+		} else {
+			send_code(s, REPZ_11_138, s.bl_tree);
+			send_bits(s, count - 11, 7);
+		}
+
+		count = 0;
+		prevlen = curlen;
+		if (nextlen === 0) {
+			max_count = 138;
+			min_count = 3;
+
+		} else if (curlen === nextlen) {
+			max_count = 6;
+			min_count = 3;
+
+		} else {
+			max_count = 7;
+			min_count = 4;
+		}
+	}
+}
+
+
+/* ===========================================================================
+ * Construct the Huffman tree for the bit lengths and return the index in
+ * bl_order of the last bit length code to send.
+ */
+function build_bl_tree(s) {
+	var max_blindex;  /* index of last bit length code of non zero freq */
+
+	/* Determine the bit length frequencies for literal and distance trees */
+	scan_tree(s, s.dyn_ltree, s.l_desc.max_code);
+	scan_tree(s, s.dyn_dtree, s.d_desc.max_code);
+
+	/* Build the bit length tree: */
+	build_tree(s, s.bl_desc);
+	/* opt_len now includes the length of the tree representations, except
+	 * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
+	 */
+
+	/* Determine the number of bit length codes to send. The pkzip format
+	 * requires that at least 4 bit length codes be sent. (appnote.txt says
+	 * 3 but the actual value used is 4.)
+	 */
+	for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {
+		if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {
+			break;
+		}
+	}
+	/* Update opt_len to include the bit length tree and counts */
+	s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;
+	//Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",
+	//        s->opt_len, s->static_len));
+
+	return max_blindex;
+}
+
+
+/* ===========================================================================
+ * Send the header for a block using dynamic Huffman trees: the counts, the
+ * lengths of the bit length codes, the literal tree and the distance tree.
+ * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
+ */
+function send_all_trees(s, lcodes, dcodes, blcodes)
+//    deflate_state *s;
+//    int lcodes, dcodes, blcodes; /* number of codes for each tree */
+{
+	var rank;                    /* index in bl_order */
+
+	//Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
+	//Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
+	//        "too many codes");
+	//Tracev((stderr, "\nbl counts: "));
+	send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */
+	send_bits(s, dcodes - 1, 5);
+	send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */
+	for (rank = 0; rank < blcodes; rank++) {
+		//Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
+		send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);
+	}
+	//Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent));
+
+	send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */
+	//Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent));
+
+	send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */
+	//Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));
+}
+
+
+/* ===========================================================================
+ * Check if the data type is TEXT or BINARY, using the following algorithm:
+ * - TEXT if the two conditions below are satisfied:
+ *    a) There are no non-portable control characters belonging to the
+ *       "black list" (0..6, 14..25, 28..31).
+ *    b) There is at least one printable character belonging to the
+ *       "white list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).
+ * - BINARY otherwise.
+ * - The following partially-portable control characters form a
+ *   "gray list" that is ignored in this detection algorithm:
+ *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).
+ * IN assertion: the fields Freq of dyn_ltree are set.
+ */
+function detect_data_type(s) {
+	/* black_mask is the bit mask of black-listed bytes
+	 * set bits 0..6, 14..25, and 28..31
+	 * 0xf3ffc07f = binary 11110011111111111100000001111111
+	 */
+	var black_mask = 0xf3ffc07f;
+	var n;
+
+	/* Check for non-textual ("black-listed") bytes. */
+	for (n = 0; n <= 31; n++, black_mask >>>= 1) {
+		if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {
+			return Z_BINARY;
+		}
+	}
+
+	/* Check for textual ("white-listed") bytes. */
+	if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||
+		s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {
+		return Z_TEXT;
+	}
+	for (n = 32; n < LITERALS; n++) {
+		if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {
+			return Z_TEXT;
+		}
+	}
+
+	/* There are no "black-listed" or "white-listed" bytes:
+	 * this stream either is empty or has tolerated ("gray-listed") bytes only.
+	 */
+	return Z_BINARY;
+}
+
+
+var static_init_done = false;
+
+/* ===========================================================================
+ * Initialize the tree data structures for a new zlib stream.
+ */
+function _tr_init(s) {
+
+	if (!static_init_done) {
+		tr_static_init();
+		static_init_done = true;
+	}
+
+	s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);
+	s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);
+	s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);
+
+	s.bi_buf = 0;
+	s.bi_valid = 0;
+
+	/* Initialize the first block of the first file: */
+	init_block(s);
+}
+
+
+/* ===========================================================================
+ * Send a stored block
+ */
+function _tr_stored_block(s, buf, stored_len, last)
+//DeflateState *s;
+//charf *buf;       /* input block */
+//ulg stored_len;   /* length of input block */
+//int last;         /* one if this is the last block for a file */
+{
+	send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */
+	copy_block(s, buf, stored_len, true); /* with header */
+}
+
+
+/* ===========================================================================
+ * Send one empty static block to give enough lookahead for inflate.
+ * This takes 10 bits, of which 7 may remain in the bit buffer.
+ */
+function _tr_align(s) {
+	send_bits(s, STATIC_TREES << 1, 3);
+	send_code(s, END_BLOCK, static_ltree);
+	bi_flush(s);
+}
+
+
+/* ===========================================================================
+ * Determine the best encoding for the current block: dynamic trees, static
+ * trees or store, and output the encoded block to the zip file.
+ */
+function _tr_flush_block(s, buf, stored_len, last)
+//DeflateState *s;
+//charf *buf;       /* input block, or NULL if too old */
+//ulg stored_len;   /* length of input block */
+//int last;         /* one if this is the last block for a file */
+{
+	var opt_lenb, static_lenb;  /* opt_len and static_len in bytes */
+	var max_blindex = 0;        /* index of last bit length code of non zero freq */
+
+	/* Build the Huffman trees unless a stored block is forced */
+	if (s.level > 0) {
+
+		/* Check if the file is binary or text */
+		if (s.strm.data_type === Z_UNKNOWN) {
+			s.strm.data_type = detect_data_type(s);
+		}
+
+		/* Construct the literal and distance trees */
+		build_tree(s, s.l_desc);
+		// Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len,
+		//        s->static_len));
+
+		build_tree(s, s.d_desc);
+		// Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len,
+		//        s->static_len));
+		/* At this point, opt_len and static_len are the total bit lengths of
+		 * the compressed block data, excluding the tree representations.
+		 */
+
+		/* Build the bit length tree for the above two trees, and get the index
+		 * in bl_order of the last bit length code to send.
+		 */
+		max_blindex = build_bl_tree(s);
+
+		/* Determine the best encoding. Compute the block lengths in bytes. */
+		opt_lenb = (s.opt_len + 3 + 7) >>> 3;
+		static_lenb = (s.static_len + 3 + 7) >>> 3;
+
+		// Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ",
+		//        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,
+		//        s->last_lit));
+
+		if (static_lenb <= opt_lenb) {
+			opt_lenb = static_lenb;
+		}
+
+	} else {
+		// Assert(buf != (char*)0, "lost buf");
+		opt_lenb = static_lenb = stored_len + 5; /* force a stored block */
+	}
+
+	if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {
+		/* 4: two words for the lengths */
+
+		/* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
+		 * Otherwise we can't have processed more than WSIZE input bytes since
+		 * the last block flush, because compression would have been
+		 * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
+		 * transform a block into a stored block.
+		 */
+		_tr_stored_block(s, buf, stored_len, last);
+
+	} else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {
+
+		send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);
+		compress_block(s, static_ltree, static_dtree);
+
+	} else {
+		send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);
+		send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);
+		compress_block(s, s.dyn_ltree, s.dyn_dtree);
+	}
+	// Assert (s->compressed_len == s->bits_sent, "bad compressed size");
+	/* The above check is made mod 2^32, for files larger than 512 MB
+	 * and uLong implemented on 32 bits.
+	 */
+	init_block(s);
+
+	if (last) {
+		bi_windup(s);
+	}
+	// Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3,
+	//       s->compressed_len-7*last));
+}
+
+/* ===========================================================================
+ * Save the match info and tally the frequency counts. Return true if
+ * the current block must be flushed.
+ */
+function _tr_tally(s, dist, lc)
+//    deflate_state *s;
+//    unsigned dist;  /* distance of matched string */
+//    unsigned lc;    /* match length-MIN_MATCH or unmatched char (if dist==0) */
+{
+	//var out_length, in_length, dcode;
+
+	s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff;
+	s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;
+
+	s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;
+	s.last_lit++;
+
+	if (dist === 0) {
+		/* lc is the unmatched char */
+		s.dyn_ltree[lc * 2]/*.Freq*/++;
+	} else {
+		s.matches++;
+		/* Here, lc is the match length - MIN_MATCH */
+		dist--;             /* dist = match distance - 1 */
+		//Assert((ush)dist < (ush)MAX_DIST(s) &&
+		//       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
+		//       (ush)d_code(dist) < (ush)D_CODES,  "_tr_tally: bad match");
+
+		s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;
+		s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;
+	}
+
+// (!) This block is disabled in zlib defaults,
+// don't enable it for binary compatibility
+
+//#ifdef TRUNCATE_BLOCK
+//  /* Try to guess if it is profitable to stop the current block here */
+//  if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {
+//    /* Compute an upper bound for the compressed length */
+//    out_length = s.last_lit*8;
+//    in_length = s.strstart - s.block_start;
+//
+//    for (dcode = 0; dcode < D_CODES; dcode++) {
+//      out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);
+//    }
+//    out_length >>>= 3;
+//    //Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ",
+//    //       s->last_lit, in_length, out_length,
+//    //       100L - out_length*100L/in_length));
+//    if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {
+//      return true;
+//    }
+//  }
+//#endif
+
+	return (s.last_lit === s.lit_bufsize - 1);
+	/* We avoid equality with lit_bufsize because of wraparound at 64K
+	 * on 16 bit machines and because stored blocks are restricted to
+	 * 64K-1 bytes.
+	 */
+}
+
+export default {
+	_tr_init,
+	_tr_stored_block,
+	_tr_flush_block,
+	_tr_tally,
+	_tr_align
+}
+
+

src/svga/pako/zlib/zstream.ts

+'use strict';
+
+// (C) 1995-2013 Jean-loup Gailly and Mark Adler
+// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+//
+// This software is provided 'as-is', without any express or implied
+// warranty. In no event will the authors be held liable for any damages
+// arising from the use of this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+// 1. The origin of this software must not be misrepresented; you must not
+//   claim that you wrote the original software. If you use this software
+//   in a product, an acknowledgment in the product documentation would be
+//   appreciated but is not required.
+// 2. Altered source versions must be plainly marked as such, and must not be
+//   misrepresented as being the original software.
+// 3. This notice may not be removed or altered from any source distribution.
+
+function ZStream() {
+	/* next input byte */
+	this.input = null; // JS specific, because we have no pointers
+	this.next_in = 0;
+	/* number of bytes available at input */
+	this.avail_in = 0;
+	/* total number of input bytes read so far */
+	this.total_in = 0;
+	/* next output byte should be put there */
+	this.output = null; // JS specific, because we have no pointers
+	this.next_out = 0;
+	/* remaining free space at output */
+	this.avail_out = 0;
+	/* total number of bytes output so far */
+	this.total_out = 0;
+	/* last error message, NULL if no error */
+	this.msg = ''/*Z_NULL*/;
+	/* not visible by applications */
+	this.state = null;
+	/* best guess about the data type: binary or text */
+	this.data_type = 2/*Z_UNKNOWN*/;
+	/* adler32 value of the uncompressed data */
+	this.adler = 0;
+}
+
+export default ZStream;

src/svga/parser.ts

+import {VideoEntity} from './VideoEntity'
+import MockWorker from './mockWorker'
+
+export class Parser {
+
+	/**
+	 * url: 资源路径
+	 * success(VideoEntity videoItem)
+	 */
+	load(url, success, failure) {
+		this.loadViaWorker(url, success, failure);
+	}
+
+	loadViaWorker(url, success, failure) {
+		MockWorker(url, (data) => {
+			let movie = data.movie;
+			movie["version"] = data.ver;
+			let images = data.images;
+			let videoItem = new VideoEntity(movie, images);
+			// console.log(videoItem)
+			success(videoItem);
+		}, failure)
+	}
+
+}
\ No newline at end of file

src/svga/proto.ts

+// import * as protobuf from "protobufjs/light";
+import protobuf from "./protobuf"
+// import * as protobuf from "./protobufjs/light";
+const svgaDescriptor = JSON.parse(`{"nested":{"com":{"nested":{"opensource":{"nested":{"svga":{"options":{"objc_class_prefix":"SVGAProto","java_package":"com.opensource.svgaplayer.proto"},"nested":{"MovieParams":{"fields":{"viewBoxWidth":{"type":"float","id":1},"viewBoxHeight":{"type":"float","id":2},"fps":{"type":"int32","id":3},"frames":{"type":"int32","id":4}}},"SpriteEntity":{"fields":{"imageKey":{"type":"string","id":1},"frames":{"rule":"repeated","type":"FrameEntity","id":2},"matteKey":{"type":"string","id":3}}},"AudioEntity":{"fields":{"audioKey":{"type":"string","id":1},"startFrame":{"type":"int32","id":2},"endFrame":{"type":"int32","id":3},"startTime":{"type":"int32","id":4},"totalTime":{"type":"int32","id":5}}},"Layout":{"fields":{"x":{"type":"float","id":1},"y":{"type":"float","id":2},"width":{"type":"float","id":3},"height":{"type":"float","id":4}}},"Transform":{"fields":{"a":{"type":"float","id":1},"b":{"type":"float","id":2},"c":{"type":"float","id":3},"d":{"type":"float","id":4},"tx":{"type":"float","id":5},"ty":{"type":"float","id":6}}},"ShapeEntity":{"oneofs":{"args":{"oneof":["shape","rect","ellipse"]}},"fields":{"type":{"type":"ShapeType","id":1},"shape":{"type":"ShapeArgs","id":2},"rect":{"type":"RectArgs","id":3},"ellipse":{"type":"EllipseArgs","id":4},"styles":{"type":"ShapeStyle","id":10},"transform":{"type":"Transform","id":11}},"nested":{"ShapeType":{"values":{"SHAPE":0,"RECT":1,"ELLIPSE":2,"KEEP":3}},"ShapeArgs":{"fields":{"d":{"type":"string","id":1}}},"RectArgs":{"fields":{"x":{"type":"float","id":1},"y":{"type":"float","id":2},"width":{"type":"float","id":3},"height":{"type":"float","id":4},"cornerRadius":{"type":"float","id":5}}},"EllipseArgs":{"fields":{"x":{"type":"float","id":1},"y":{"type":"float","id":2},"radiusX":{"type":"float","id":3},"radiusY":{"type":"float","id":4}}},"ShapeStyle":{"fields":{"fill":{"type":"RGBAColor","id":1},"stroke":{"type":"RGBAColor","id":2},"strokeWidth":{"type":"float","id":3},"lineCap":{"type":"LineCap","id":4},"lineJoin":{"type":"LineJoin","id":5},"miterLimit":{"type":"float","id":6},"lineDashI":{"type":"float","id":7},"lineDashII":{"type":"float","id":8},"lineDashIII":{"type":"float","id":9}},"nested":{"RGBAColor":{"fields":{"r":{"type":"float","id":1},"g":{"type":"float","id":2},"b":{"type":"float","id":3},"a":{"type":"float","id":4}}},"LineCap":{"values":{"LineCap_BUTT":0,"LineCap_ROUND":1,"LineCap_SQUARE":2}},"LineJoin":{"values":{"LineJoin_MITER":0,"LineJoin_ROUND":1,"LineJoin_BEVEL":2}}}}}},"FrameEntity":{"fields":{"alpha":{"type":"float","id":1},"layout":{"type":"Layout","id":2},"transform":{"type":"Transform","id":3},"clipPath":{"type":"string","id":4},"shapes":{"rule":"repeated","type":"ShapeEntity","id":5}}},"MovieEntity":{"fields":{"version":{"type":"string","id":1},"params":{"type":"MovieParams","id":2},"images":{"keyType":"string","type":"bytes","id":3},"sprites":{"rule":"repeated","type":"SpriteEntity","id":4},"audios":{"rule":"repeated","type":"AudioEntity","id":5}}}}}}}}}}}`)
+
+export const proto = protobuf.Root.fromJSON(svgaDescriptor);
+export const ProtoMovieEntity = proto.lookupType("com.opensource.svga.MovieEntity");
\ No newline at end of file

src/svga/rectPath.ts

+import {BezierPath} from './bezierPath'
+
+export class RectPath extends BezierPath {
+
+	_x;
+	_y;
+	_width;
+	_height;
+	_cornerRadius;
+	_transform;
+	_styles;
+
+	constructor(x, y, width, height, cornerRadius, transform, styles) {
+		super();
+		this._x = x
+		this._y = y
+		this._width = width
+		this._height = height
+		this._cornerRadius = cornerRadius
+		this._transform = transform
+		this._styles = styles
+	}
+
+}
\ No newline at end of file

src/svga/spriteEntity.ts

+import {FrameEntity} from './frameEntity'
+
+export class SpriteEntity {
+
+	/**
+	 * string
+	 */
+	matteKey = null
+
+	/**
+	 * string
+	 */
+	imageKey = null
+
+	/**
+	 * FrameEntity[]
+	 */
+	frames = []
+
+	constructor(spec) {
+		this.matteKey = spec.matteKey;
+		this.imageKey = spec.imageKey;
+		if (spec.frames) {
+			this.frames = spec.frames.map((obj) => {
+				return new FrameEntity(obj)
+			})
+		}
+	}
+
+}
\ No newline at end of file

src/svga/svga-wrapper.ts

+/**
+ * Created by rockyl on 2019-12-19.
+ */
+
+import {MovieClip} from "./MovieClip";
+import {Parser} from "./parser";
+import {VideoEntity} from "./VideoEntity";
+
+const assetScheme = 'asset://';
+
+export class Svga extends MovieClip {
+	private _source: string;
+
+	public autoPlay: boolean = false;
+
+	get source() {
+		return this._source;
+	}
+
+	set source(v) {
+		if (this._source !== v) {
+			this._setSource(v);
+		}
+	}
+
+	private _setSource(value) {
+		if (value !== this._source) {
+			this._source = value;
+
+			let needLoad = true;
+			if (value.indexOf('://') >= 0) { //如果是有协议的地址
+				if (value.indexOf(assetScheme) === 0) {
+					let uuid = value.replace(assetScheme, '');
+					let mv = engine.globalLoader.get(uuid);
+					this.init(mv);
+					this._dataInitialized();
+					needLoad = false;
+				}
+			}
+			if(needLoad){
+				engine.globalLoader['loadSvga'](value)
+					.then(mv => {
+						this.init(mv);
+						this._dataInitialized();
+					});
+			}
+		}
+	}
+
+	private _dataInitialized(){
+		setTimeout(()=>{
+			if(this.autoPlay){
+				this.play();
+			}
+		})
+	}
+}
+
+engine.registerNodeType('svga', Svga);
+engine.globalLoader['loadSvga'] = function (url: string, uuid?: string) {
+	return new Promise((resolve, reject) => {
+		let data = this.caches[uuid || url];
+		if (data) {
+			return resolve(data);
+		} else {
+			if (!this.parser) this.parser = new Parser();
+			this.parser.load(url, (videoEntity: VideoEntity) => {
+				this.cache(uuid || url, videoEntity);
+				resolve(videoEntity);
+			}, reject)
+		}
+	})
+};

tsconfig.json

+{
+	"compilerOptions": {
+		"module": "ES2015",
+		"target": "es5",
+		"noImplicitAny": false,
+		"sourceMap": true,
+		"removeComments": true,
+		"noEmitOnError": true,
+		"noEmitHelpers": true,
+		"declarationDir": "types",
+		"declaration": true,
+		"experimentalDecorators": true,
+		"outDir": "dist-m",
+		"lib": [
+			"es5",
+			"dom",
+			"es2015.promise"
+		]
+	},
+	"include": [
+		"src"
+	],
+	"exclude": [
+		"node_modules"
+	]
+}
\ No newline at end of file

yarn.lock

+# THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY.
+# yarn lockfile v1
+
+
+"@babel/code-frame@^7.0.0":
+  version "7.5.5"
+  resolved "https://registry.npm.taobao.org/@babel/code-frame/download/@babel/code-frame-7.5.5.tgz#bc0782f6d69f7b7d49531219699b988f669a8f9d"
+  integrity sha1-vAeC9tafe31JUxIZaZuYj2aaj50=
+  dependencies:
+    "@babel/highlight" "^7.0.0"
+
+"@babel/highlight@^7.0.0":
+  version "7.5.0"
+  resolved "https://registry.npm.taobao.org/@babel/highlight/download/@babel/highlight-7.5.0.tgz#56d11312bd9248fa619591d02472be6e8cb32540"
+  integrity sha1-VtETEr2SSPphlZHQJHK+boyzJUA=
+  dependencies:
+    chalk "^2.0.0"
+    esutils "^2.0.2"
+    js-tokens "^4.0.0"
+
+"@protobufjs/aspromise@^1.1.1", "@protobufjs/aspromise@^1.1.2":
+  version "1.1.2"
+  resolved "https://registry.npm.taobao.org/@protobufjs/aspromise/download/@protobufjs/aspromise-1.1.2.tgz#9b8b0cc663d669a7d8f6f5d0893a14d348f30fbf"
+  integrity sha1-m4sMxmPWaafY9vXQiToU00jzD78=
+
+"@protobufjs/base64@^1.1.2":
+  version "1.1.2"
+  resolved "https://registry.npm.taobao.org/@protobufjs/base64/download/@protobufjs/base64-1.1.2.tgz#4c85730e59b9a1f1f349047dbf24296034bb2735"
+  integrity sha1-TIVzDlm5ofHzSQR9vyQpYDS7JzU=
+
+"@protobufjs/codegen@^2.0.4":
+  version "2.0.4"
+  resolved "https://registry.npm.taobao.org/@protobufjs/codegen/download/@protobufjs/codegen-2.0.4.tgz#7ef37f0d010fb028ad1ad59722e506d9262815cb"
+  integrity sha1-fvN/DQEPsCitGtWXIuUG2SYoFcs=
+
+"@protobufjs/eventemitter@^1.1.0":
+  version "1.1.0"
+  resolved "https://registry.npm.taobao.org/@protobufjs/eventemitter/download/@protobufjs/eventemitter-1.1.0.tgz#355cbc98bafad5978f9ed095f397621f1d066b70"
+  integrity sha1-NVy8mLr61ZePntCV85diHx0Ga3A=
+
+"@protobufjs/fetch@^1.1.0":
+  version "1.1.0"
+  resolved "https://registry.npm.taobao.org/@protobufjs/fetch/download/@protobufjs/fetch-1.1.0.tgz#ba99fb598614af65700c1619ff06d454b0d84c45"
+  integrity sha1-upn7WYYUr2VwDBYZ/wbUVLDYTEU=
+  dependencies:
+    "@protobufjs/aspromise" "^1.1.1"
+    "@protobufjs/inquire" "^1.1.0"
+
+"@protobufjs/float@^1.0.2":
+  version "1.0.2"
+  resolved "https://registry.npm.taobao.org/@protobufjs/float/download/@protobufjs/float-1.0.2.tgz#5e9e1abdcb73fc0a7cb8b291df78c8cbd97b87d1"
+  integrity sha1-Xp4avctz/Ap8uLKR33jIy9l7h9E=
+
+"@protobufjs/inquire@^1.1.0":
+  version "1.1.0"
+  resolved "https://registry.npm.taobao.org/@protobufjs/inquire/download/@protobufjs/inquire-1.1.0.tgz#ff200e3e7cf2429e2dcafc1140828e8cc638f089"
+  integrity sha1-/yAOPnzyQp4tyvwRQIKOjMY48Ik=
+
+"@protobufjs/path@^1.1.2":
+  version "1.1.2"
+  resolved "https://registry.npm.taobao.org/@protobufjs/path/download/@protobufjs/path-1.1.2.tgz#6cc2b20c5c9ad6ad0dccfd21ca7673d8d7fbf68d"
+  integrity sha1-bMKyDFya1q0NzP0hynZz2Nf79o0=
+
+"@protobufjs/pool@^1.1.0":
+  version "1.1.0"
+  resolved "https://registry.npm.taobao.org/@protobufjs/pool/download/@protobufjs/pool-1.1.0.tgz#09fd15f2d6d3abfa9b65bc366506d6ad7846ff54"
+  integrity sha1-Cf0V8tbTq/qbZbw2ZQbWrXhG/1Q=
+
+"@protobufjs/utf8@^1.1.0":
+  version "1.1.0"
+  resolved "https://registry.npm.taobao.org/@protobufjs/utf8/download/@protobufjs/utf8-1.1.0.tgz#a777360b5b39a1a2e5106f8e858f2fd2d060c570"
+  integrity sha1-p3c2C1s5oaLlEG+OhY8v0tBgxXA=
+
+"@types/estree@0.0.39":
+  version "0.0.39"
+  resolved "https://registry.npm.taobao.org/@types/estree/download/@types/estree-0.0.39.tgz#e177e699ee1b8c22d23174caaa7422644389509f"
+  integrity sha1-4Xfmme4bjCLSMXTKqnQiZEOJUJ8=
+
+"@types/long@^4.0.0":
+  version "4.0.0"
+  resolved "https://registry.npm.taobao.org/@types/long/download/@types/long-4.0.0.tgz?cache=0&sync_timestamp=1572463917434&other_urls=https%3A%2F%2Fregistry.npm.taobao.org%2F%40types%2Flong%2Fdownload%2F%40types%2Flong-4.0.0.tgz#719551d2352d301ac8b81db732acb6bdc28dbdef"
+  integrity sha1-cZVR0jUtMBrIuB23Mqy2vcKNve8=
+
+"@types/node@*":
+  version "12.12.21"
+  resolved "https://registry.npm.taobao.org/@types/node/download/@types/node-12.12.21.tgz?cache=0&sync_timestamp=1576679981554&other_urls=https%3A%2F%2Fregistry.npm.taobao.org%2F%40types%2Fnode%2Fdownload%2F%40types%2Fnode-12.12.21.tgz#aa44a6363291c7037111c47e4661ad210aded23f"
+  integrity sha1-qkSmNjKRxwNxEcR+RmGtIQre0j8=
+
+"@types/node@^10.1.0":
+  version "10.17.11"
+  resolved "https://registry.npm.taobao.org/@types/node/download/@types/node-10.17.11.tgz?cache=0&sync_timestamp=1576679981554&other_urls=https%3A%2F%2Fregistry.npm.taobao.org%2F%40types%2Fnode%2Fdownload%2F%40types%2Fnode-10.17.11.tgz#46ba035fb917b31c948280dbea22ab8838f386a4"
+  integrity sha1-RroDX7kXsxyUgoDb6iKriDjzhqQ=
+
+"@types/resolve@0.0.8":
+  version "0.0.8"
+  resolved "https://registry.npm.taobao.org/@types/resolve/download/@types/resolve-0.0.8.tgz#f26074d238e02659e323ce1a13d041eee280e194"
+  integrity sha1-8mB00jjgJlnjI84aE9BB7uKA4ZQ=
+  dependencies:
+    "@types/node" "*"
+
+ansi-styles@^3.2.1:
+  version "3.2.1"
+  resolved "https://registry.npm.taobao.org/ansi-styles/download/ansi-styles-3.2.1.tgz#41fbb20243e50b12be0f04b8dedbf07520ce841d"
+  integrity sha1-QfuyAkPlCxK+DwS43tvwdSDOhB0=
+  dependencies:
+    color-convert "^1.9.0"
+
+builtin-modules@^3.1.0:
+  version "3.1.0"
+  resolved "https://registry.npm.taobao.org/builtin-modules/download/builtin-modules-3.1.0.tgz#aad97c15131eb76b65b50ef208e7584cd76a7484"
+  integrity sha1-qtl8FRMet2tltQ7yCOdYTNdqdIQ=
+
+chalk@^2.0.0, chalk@^2.4.2:
+  version "2.4.2"
+  resolved "https://registry.npm.taobao.org/chalk/download/chalk-2.4.2.tgz?cache=0&sync_timestamp=1573282918610&other_urls=https%3A%2F%2Fregistry.npm.taobao.org%2Fchalk%2Fdownload%2Fchalk-2.4.2.tgz#cd42541677a54333cf541a49108c1432b44c9424"
+  integrity sha1-zUJUFnelQzPPVBpJEIwUMrRMlCQ=
+  dependencies:
+    ansi-styles "^3.2.1"
+    escape-string-regexp "^1.0.5"
+    supports-color "^5.3.0"
+
+color-convert@^1.9.0:
+  version "1.9.3"
+  resolved "https://registry.npm.taobao.org/color-convert/download/color-convert-1.9.3.tgz#bb71850690e1f136567de629d2d5471deda4c1e8"
+  integrity sha1-u3GFBpDh8TZWfeYp0tVHHe2kweg=
+  dependencies:
+    color-name "1.1.3"
+
+color-name@1.1.3:
+  version "1.1.3"
+  resolved "https://registry.npm.taobao.org/color-name/download/color-name-1.1.3.tgz#a7d0558bd89c42f795dd42328f740831ca53bc25"
+  integrity sha1-p9BVi9icQveV3UIyj3QIMcpTvCU=
+
+commander@~2.20.3:
+  version "2.20.3"
+  resolved "https://registry.npm.taobao.org/commander/download/commander-2.20.3.tgz?cache=0&sync_timestamp=1573464098030&other_urls=https%3A%2F%2Fregistry.npm.taobao.org%2Fcommander%2Fdownload%2Fcommander-2.20.3.tgz#fd485e84c03eb4881c20722ba48035e8531aeb33"
+  integrity sha1-/UhehMA+tIgcIHIrpIA16FMa6zM=
+
+escape-string-regexp@^1.0.5:
+  version "1.0.5"
+  resolved "https://registry.npm.taobao.org/escape-string-regexp/download/escape-string-regexp-1.0.5.tgz#1b61c0562190a8dff6ae3bb2cf0200ca130b86d4"
+  integrity sha1-G2HAViGQqN/2rjuyzwIAyhMLhtQ=
+
+estree-walker@^0.6.1:
+  version "0.6.1"
+  resolved "https://registry.npm.taobao.org/estree-walker/download/estree-walker-0.6.1.tgz#53049143f40c6eb918b23671d1fe3219f3a1b362"
+  integrity sha1-UwSRQ/QMbrkYsjZx0f4yGfOhs2I=
+
+esutils@^2.0.2:
+  version "2.0.3"
+  resolved "https://registry.npm.taobao.org/esutils/download/esutils-2.0.3.tgz#74d2eb4de0b8da1293711910d50775b9b710ef64"
+  integrity sha1-dNLrTeC42hKTcRkQ1Qd1ubcQ72Q=
+
+has-flag@^3.0.0:
+  version "3.0.0"
+  resolved "https://registry.npm.taobao.org/has-flag/download/has-flag-3.0.0.tgz#b5d454dc2199ae225699f3467e5a07f3b955bafd"
+  integrity sha1-tdRU3CGZriJWmfNGfloH87lVuv0=
+
+is-module@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.npm.taobao.org/is-module/download/is-module-1.0.0.tgz#3258fb69f78c14d5b815d664336b4cffb6441591"
+  integrity sha1-Mlj7afeMFNW4FdZkM2tM/7ZEFZE=
+
+is-reference@^1.1.2:
+  version "1.1.4"
+  resolved "https://registry.npm.taobao.org/is-reference/download/is-reference-1.1.4.tgz#3f95849886ddb70256a3e6d062b1a68c13c51427"
+  integrity sha1-P5WEmIbdtwJWo+bQYrGmjBPFFCc=
+  dependencies:
+    "@types/estree" "0.0.39"
+
+jest-worker@^24.0.0:
+  version "24.9.0"
+  resolved "https://registry.npm.taobao.org/jest-worker/download/jest-worker-24.9.0.tgz#5dbfdb5b2d322e98567898238a9697bcce67b3e5"
+  integrity sha1-Xb/bWy0yLphWeJgjipaXvM5ns+U=
+  dependencies:
+    merge-stream "^2.0.0"
+    supports-color "^6.1.0"
+
+js-tokens@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.npm.taobao.org/js-tokens/download/js-tokens-4.0.0.tgz#19203fb59991df98e3a287050d4647cdeaf32499"
+  integrity sha1-GSA/tZmR35jjoocFDUZHzerzJJk=
+
+long@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.npm.taobao.org/long/download/long-4.0.0.tgz#9a7b71cfb7d361a194ea555241c92f7468d5bf28"
+  integrity sha1-mntxz7fTYaGU6lVSQckvdGjVvyg=
+
+magic-string@^0.25.2:
+  version "0.25.4"
+  resolved "https://registry.npm.taobao.org/magic-string/download/magic-string-0.25.4.tgz?cache=0&sync_timestamp=1569857693186&other_urls=https%3A%2F%2Fregistry.npm.taobao.org%2Fmagic-string%2Fdownload%2Fmagic-string-0.25.4.tgz#325b8a0a79fc423db109b77fd5a19183b7ba5143"
+  integrity sha1-MluKCnn8Qj2xCbd/1aGRg7e6UUM=
+  dependencies:
+    sourcemap-codec "^1.4.4"
+
+merge-stream@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.npm.taobao.org/merge-stream/download/merge-stream-2.0.0.tgz#52823629a14dd00c9770fb6ad47dc6310f2c1f60"
+  integrity sha1-UoI2KaFN0AyXcPtq1H3GMQ8sH2A=
+
+path-parse@^1.0.6:
+  version "1.0.6"
+  resolved "https://registry.npm.taobao.org/path-parse/download/path-parse-1.0.6.tgz#d62dbb5679405d72c4737ec58600e9ddcf06d24c"
+  integrity sha1-1i27VnlAXXLEc37FhgDp3c8G0kw=
+
+protobufjs@^6.8.8:
+  version "6.8.8"
+  resolved "https://registry.npm.taobao.org/protobufjs/download/protobufjs-6.8.8.tgz#c8b4f1282fd7a90e6f5b109ed11c84af82908e7c"
+  integrity sha1-yLTxKC/XqQ5vWxCe0RyEr4KQjnw=
+  dependencies:
+    "@protobufjs/aspromise" "^1.1.2"
+    "@protobufjs/base64" "^1.1.2"
+    "@protobufjs/codegen" "^2.0.4"
+    "@protobufjs/eventemitter" "^1.1.0"
+    "@protobufjs/fetch" "^1.1.0"
+    "@protobufjs/float" "^1.0.2"
+    "@protobufjs/inquire" "^1.1.0"
+    "@protobufjs/path" "^1.1.2"
+    "@protobufjs/pool" "^1.1.0"
+    "@protobufjs/utf8" "^1.1.0"
+    "@types/long" "^4.0.0"
+    "@types/node" "^10.1.0"
+    long "^4.0.0"
+
+resolve@^1.10.0, resolve@^1.11.0, resolve@^1.11.1:
+  version "1.14.1"
+  resolved "https://registry.npm.taobao.org/resolve/download/resolve-1.14.1.tgz#9e018c540fcf0c427d678b9931cbf45e984bcaff"
+  integrity sha1-ngGMVA/PDEJ9Z4uZMcv0XphLyv8=
+  dependencies:
+    path-parse "^1.0.6"
+
+rollup-plugin-commonjs@^10.1.0:
+  version "10.1.0"
+  resolved "https://registry.npm.taobao.org/rollup-plugin-commonjs/download/rollup-plugin-commonjs-10.1.0.tgz#417af3b54503878e084d127adf4d1caf8beb86fb"
+  integrity sha1-QXrztUUDh44ITRJ6300cr4vrhvs=
+  dependencies:
+    estree-walker "^0.6.1"
+    is-reference "^1.1.2"
+    magic-string "^0.25.2"
+    resolve "^1.11.0"
+    rollup-pluginutils "^2.8.1"
+
+rollup-plugin-node-resolve@^5.2.0:
+  version "5.2.0"
+  resolved "https://registry.npm.taobao.org/rollup-plugin-node-resolve/download/rollup-plugin-node-resolve-5.2.0.tgz#730f93d10ed202473b1fb54a5997a7db8c6d8523"
+  integrity sha1-cw+T0Q7SAkc7H7VKWZen24xthSM=
+  dependencies:
+    "@types/resolve" "0.0.8"
+    builtin-modules "^3.1.0"
+    is-module "^1.0.0"
+    resolve "^1.11.1"
+    rollup-pluginutils "^2.8.1"
+
+rollup-plugin-progress@^1.1.1:
+  version "1.1.1"
+  resolved "https://registry.npm.taobao.org/rollup-plugin-progress/download/rollup-plugin-progress-1.1.1.tgz#fcce2f915d545014ac89ea0927ee97cb48052f60"
+  integrity sha1-/M4vkV1UUBSsieoJJ+6Xy0gFL2A=
+  dependencies:
+    chalk "^2.4.2"
+
+rollup-plugin-typescript@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.npm.taobao.org/rollup-plugin-typescript/download/rollup-plugin-typescript-1.0.1.tgz#86565033b714c3d1f3aba510aad3dc519f7091e9"
+  integrity sha1-hlZQM7cUw9Hzq6UQqtPcUZ9wkek=
+  dependencies:
+    resolve "^1.10.0"
+    rollup-pluginutils "^2.5.0"
+
+rollup-plugin-uglify@^6.0.4:
+  version "6.0.4"
+  resolved "https://registry.npm.taobao.org/rollup-plugin-uglify/download/rollup-plugin-uglify-6.0.4.tgz#65a0959d91586627f1e46a7db966fd504ec6c4e6"
+  integrity sha1-ZaCVnZFYZifx5Gp9uWb9UE7GxOY=
+  dependencies:
+    "@babel/code-frame" "^7.0.0"
+    jest-worker "^24.0.0"
+    serialize-javascript "^2.1.2"
+    uglify-js "^3.4.9"
+
+rollup-pluginutils@^2.5.0, rollup-pluginutils@^2.8.1:
+  version "2.8.2"
+  resolved "https://registry.npm.taobao.org/rollup-pluginutils/download/rollup-pluginutils-2.8.2.tgz#72f2af0748b592364dbd3389e600e5a9444a351e"
+  integrity sha1-cvKvB0i1kjZNvTOJ5gDlqURKNR4=
+  dependencies:
+    estree-walker "^0.6.1"
+
+serialize-javascript@^2.1.2:
+  version "2.1.2"
+  resolved "https://registry.npm.taobao.org/serialize-javascript/download/serialize-javascript-2.1.2.tgz?cache=0&sync_timestamp=1575910505665&other_urls=https%3A%2F%2Fregistry.npm.taobao.org%2Fserialize-javascript%2Fdownload%2Fserialize-javascript-2.1.2.tgz#ecec53b0e0317bdc95ef76ab7074b7384785fa61"
+  integrity sha1-7OxTsOAxe9yV73arcHS3OEeF+mE=
+
+source-map@~0.6.1:
+  version "0.6.1"
+  resolved "https://registry.npm.taobao.org/source-map/download/source-map-0.6.1.tgz#74722af32e9614e9c287a8d0bbde48b5e2f1a263"
+  integrity sha1-dHIq8y6WFOnCh6jQu95IteLxomM=
+
+sourcemap-codec@^1.4.4:
+  version "1.4.6"
+  resolved "https://registry.npm.taobao.org/sourcemap-codec/download/sourcemap-codec-1.4.6.tgz#e30a74f0402bad09807640d39e971090a08ce1e9"
+  integrity sha1-4wp08EArrQmAdkDTnpcQkKCM4ek=
+
+supports-color@^5.3.0:
+  version "5.5.0"
+  resolved "https://registry.npm.taobao.org/supports-color/download/supports-color-5.5.0.tgz?cache=0&other_urls=https%3A%2F%2Fregistry.npm.taobao.org%2Fsupports-color%2Fdownload%2Fsupports-color-5.5.0.tgz#e2e69a44ac8772f78a1ec0b35b689df6530efc8f"
+  integrity sha1-4uaaRKyHcveKHsCzW2id9lMO/I8=
+  dependencies:
+    has-flag "^3.0.0"
+
+supports-color@^6.1.0:
+  version "6.1.0"
+  resolved "https://registry.npm.taobao.org/supports-color/download/supports-color-6.1.0.tgz?cache=0&other_urls=https%3A%2F%2Fregistry.npm.taobao.org%2Fsupports-color%2Fdownload%2Fsupports-color-6.1.0.tgz#0764abc69c63d5ac842dd4867e8d025e880df8f3"
+  integrity sha1-B2Srxpxj1ayELdSGfo0CXogN+PM=
+  dependencies:
+    has-flag "^3.0.0"
+
+tslib@^1.10.0:
+  version "1.10.0"
+  resolved "https://registry.npm.taobao.org/tslib/download/tslib-1.10.0.tgz#c3c19f95973fb0a62973fb09d90d961ee43e5c8a"
+  integrity sha1-w8GflZc/sKYpc/sJ2Q2WHuQ+XIo=
+
+typescript@^3.7.3:
+  version "3.7.3"
+  resolved "https://registry.npm.taobao.org/typescript/download/typescript-3.7.3.tgz?cache=0&other_urls=https%3A%2F%2Fregistry.npm.taobao.org%2Ftypescript%2Fdownload%2Ftypescript-3.7.3.tgz#b36840668a16458a7025b9eabfad11b66ab85c69"
+  integrity sha1-s2hAZooWRYpwJbnqv60Rtmq4XGk=
+
+uglify-js@^3.4.9:
+  version "3.7.2"
+  resolved "https://registry.npm.taobao.org/uglify-js/download/uglify-js-3.7.2.tgz#cb1a601e67536e9ed094a92dd1e333459643d3f9"
+  integrity sha1-yxpgHmdTbp7QlKkt0eMzRZZD0/k=
+  dependencies:
+    commander "~2.20.3"
+    source-map "~0.6.1"

zeroing-modules.iml

+<?xml version="1.0" encoding="UTF-8"?>
+<module type="WEB_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
\ No newline at end of file