x

2025-12-01 21:00:54 +08:00
parent fde86ef902
commit 67c44bc746
97 changed files with 45781 additions and 395 deletions
@@ -0,0 +1,20 @@
+{
+  "name": "测试流式传输uniapp",
+  "lockfileVersion": 3,
+  "requires": true,
+  "packages": {
+    "node_modules/@types/pako": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmmirror.com/@types/pako/-/pako-2.0.4.tgz",
+      "integrity": "sha512-VWDCbrLeVXJM9fihYodcLiIv0ku+AlOa/TQ1SvYOaBuyrSKgEcro95LJyIsJ4vSo6BXIxOKxiJAat04CmST9Fw==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/pako": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/pako/-/pako-2.1.0.tgz",
+      "integrity": "sha512-w+eufiZ1WuJYgPXbV/PO3NCMEc3xqylkKHzp8bxp1uW4qaSNQUkwmLLEc3kKsfz8lpV1F8Ht3U1Cm+9Srog2ug==",
+      "license": "(MIT AND Zlib)"
+    }
+  }
+}
@@ -0,0 +1,21 @@
+    MIT License
+
+    Copyright (c) Microsoft Corporation.
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE
@@ -0,0 +1,15 @@
+# Installation
+> `npm install --save @types/pako`
+
+# Summary
+This package contains type definitions for pako (https://github.com/nodeca/pako).
+
+# Details
+Files were exported from https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/pako.
+
+### Additional Details
+ * Last updated: Fri, 15 Aug 2025 08:39:32 GMT
+ * Dependencies: none
+
+# Credits
+These definitions were written by [Caleb Eggensperger](https://github.com/calebegg), [Muhammet Öztürk](https://github.com/hlthi), and [Thibault Poisson](https://github.com/OrIOg).
@@ -0,0 +1,161 @@
+export = Pako;
+export as namespace pako;
+
+declare namespace Pako {
+    enum constants {
+        // FlushValues
+        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,
+        // StrategyValues
+        Z_FILTERED = 1,
+        Z_HUFFMAN_ONLY = 2,
+        Z_RLE = 3,
+        Z_FIXED = 4,
+        Z_DEFAULT_STRATEGY = 0,
+        // ReturnCodes
+        Z_OK = 0,
+        Z_STREAM_END = 1,
+        Z_NEED_DICT = 2,
+        Z_ERRNO = -1,
+        Z_STREAM_ERROR = -2,
+        Z_DATA_ERROR = -3,
+        Z_BUF_ERROR = -5,
+    }
+
+    type FlushValues =
+        | constants.Z_NO_FLUSH
+        | constants.Z_PARTIAL_FLUSH
+        | constants.Z_SYNC_FLUSH
+        | constants.Z_FINISH
+        | constants.Z_BLOCK
+        | constants.Z_TREES;
+
+    type StrategyValues =
+        | constants.Z_FILTERED
+        | constants.Z_HUFFMAN_ONLY
+        | constants.Z_RLE
+        | constants.Z_FIXED
+        | constants.Z_DEFAULT_STRATEGY;
+
+    type ReturnCodes =
+        | constants.Z_OK
+        | constants.Z_STREAM_END
+        | constants.Z_NEED_DICT
+        | constants.Z_ERRNO
+        | constants.Z_STREAM_ERROR
+        | constants.Z_DATA_ERROR
+        | constants.Z_BUF_ERROR
+        | constants.Z_DEFAULT_STRATEGY;
+
+    interface DeflateOptions {
+        level?: -1 | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | undefined;
+        windowBits?: number | undefined;
+        memLevel?: number | undefined;
+        strategy?: StrategyValues | undefined;
+        dictionary?: any;
+        raw?: boolean | undefined;
+        chunkSize?: number | undefined;
+        gzip?: boolean | undefined;
+        header?: Header | undefined;
+    }
+
+    interface DeflateFunctionOptions {
+        level?: -1 | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | undefined;
+        windowBits?: number | undefined;
+        memLevel?: number | undefined;
+        strategy?: StrategyValues | undefined;
+        dictionary?: any;
+        raw?: boolean | undefined;
+    }
+
+    interface InflateOptions {
+        windowBits?: number | undefined;
+        dictionary?: any;
+        raw?: boolean | undefined;
+        to?: "string" | undefined;
+        chunkSize?: number | undefined;
+    }
+
+    interface InflateFunctionOptions {
+        windowBits?: number | undefined;
+        raw?: boolean | undefined;
+        to?: "string" | undefined;
+    }
+
+    interface Header {
+        text?: boolean | undefined;
+        time?: number | undefined;
+        os?: number | undefined;
+        extra?: number[] | undefined;
+        name?: string | undefined;
+        comment?: string | undefined;
+        hcrc?: boolean | undefined;
+    }
+
+    type Data = Uint8Array | ArrayBuffer;
+
+    // For TS <=5.6 compatibility: Uint8Array<ArrayBuffer> in TS >=5.7, Uint8Array in TS <=5.6
+    type Uint8ArrayReturnType = InstanceType<typeof Uint8Array>;
+
+    /**
+     * Compress data with deflate algorithm and options.
+     */
+    function deflate(data: Data | string, options?: DeflateFunctionOptions): Uint8ArrayReturnType;
+
+    /**
+     * The same as deflate, but creates raw data, without wrapper (header and adler32 crc).
+     */
+    function deflateRaw(data: Data | string, options?: DeflateFunctionOptions): Uint8ArrayReturnType;
+
+    /**
+     * The same as deflate, but create gzip wrapper instead of deflate one.
+     */
+    function gzip(data: Data | string, options?: DeflateFunctionOptions): Uint8ArrayReturnType;
+
+    /**
+     * Decompress data with inflate/ungzip and options. Autodetect format via wrapper header
+     * by default. That's why we don't provide separate ungzip method.
+     */
+    function inflate(data: Data, options: InflateFunctionOptions & { to: "string" }): string;
+    function inflate(data: Data, options?: InflateFunctionOptions): Uint8ArrayReturnType;
+
+    /**
+     * The same as inflate, but creates raw data, without wrapper (header and adler32 crc).
+     */
+    function inflateRaw(data: Data, options: InflateFunctionOptions & { to: "string" }): string;
+    function inflateRaw(data: Data, options?: InflateFunctionOptions): Uint8ArrayReturnType;
+
+    /**
+     * Just shortcut to inflate, because it autodetects format by header.content. Done for convenience.
+     */
+    function ungzip(data: Data, options: InflateFunctionOptions & { to: "string" }): string;
+    function ungzip(data: Data, options?: InflateFunctionOptions): Uint8ArrayReturnType;
+
+    // https://github.com/nodeca/pako/blob/893381abcafa10fa2081ce60dae7d4d8e873a658/lib/deflate.js
+    class Deflate {
+        constructor(options?: DeflateOptions);
+        err: ReturnCodes;
+        msg: string;
+        result: Uint8ArrayReturnType;
+        onData(chunk: Data): void;
+        onEnd(status: number): void;
+        push(data: Data | string, mode?: FlushValues | boolean): boolean;
+    }
+
+    // https://github.com/nodeca/pako/blob/893381abcafa10fa2081ce60dae7d4d8e873a658/lib/inflate.js
+    class Inflate {
+        constructor(options?: InflateOptions);
+        header?: Header | undefined;
+        err: ReturnCodes;
+        msg: string;
+        result: Uint8ArrayReturnType | string;
+        onData(chunk: Data): void;
+        onEnd(status: number): void;
+        push(data: Data, mode?: FlushValues | boolean): boolean;
+    }
+}
@@ -0,0 +1,36 @@
+{
+    "name": "@types/pako",
+    "version": "2.0.4",
+    "description": "TypeScript definitions for pako",
+    "homepage": "https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/pako",
+    "license": "MIT",
+    "contributors": [
+        {
+            "name": "Caleb Eggensperger",
+            "githubUsername": "calebegg",
+            "url": "https://github.com/calebegg"
+        },
+        {
+            "name": "Muhammet Öztürk",
+            "githubUsername": "hlthi",
+            "url": "https://github.com/hlthi"
+        },
+        {
+            "name": "Thibault Poisson",
+            "githubUsername": "OrIOg",
+            "url": "https://github.com/OrIOg"
+        }
+    ],
+    "main": "",
+    "types": "index.d.ts",
+    "repository": {
+        "type": "git",
+        "url": "https://github.com/DefinitelyTyped/DefinitelyTyped.git",
+        "directory": "types/pako"
+    },
+    "scripts": {},
+    "dependencies": {},
+    "peerDependencies": {},
+    "typesPublisherContentHash": "1aa5b0407205ecaf32d7e7dfdb7cd3a7a87fad829f92f3c51eea48dc08742b89",
+    "typeScriptVersion": "5.2"
+}
@@ -0,0 +1,21 @@
+(The MIT License)
+
+Copyright (C) 2014-2017 by Vitaly Puzrin and Andrei Tuputcyn
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
@@ -0,0 +1,177 @@
+pako
+==========================================
+
+[![CI](https://github.com/nodeca/pako/workflows/CI/badge.svg)](https://github.com/nodeca/pako/actions)
+[![NPM version](https://img.shields.io/npm/v/pako.svg)](https://www.npmjs.org/package/pako)
+
+> zlib port to javascript, very fast!
+
+__Why pako is cool:__
+
+- Results are binary equal to well known [zlib](http://www.zlib.net/) (now contains ported zlib v1.2.8).
+- Almost as fast in modern JS engines as C implementation (see benchmarks).
+- Works in browsers, you can browserify any separate component.
+
+This project was done to understand how fast JS can be and is it necessary to
+develop native C modules for CPU-intensive tasks. Enjoy the result!
+
+
+__Benchmarks:__
+
+
+node v12.16.3 (zlib 1.2.9), 1mb input sample:
+
+```
+deflate-imaya x 4.75 ops/sec ±4.93% (15 runs sampled)
+deflate-pako x 10.38 ops/sec ±0.37% (29 runs sampled)
+deflate-zlib x 17.74 ops/sec ±0.77% (46 runs sampled)
+gzip-pako x 8.86 ops/sec ±1.41% (29 runs sampled)
+inflate-imaya x 107 ops/sec ±0.69% (77 runs sampled)
+inflate-pako x 131 ops/sec ±1.74% (82 runs sampled)
+inflate-zlib x 258 ops/sec ±0.66% (88 runs sampled)
+ungzip-pako x 115 ops/sec ±1.92% (80 runs sampled)
+```
+
+node v14.15.0 (google's zlib), 1mb output sample:
+
+```
+deflate-imaya x 4.93 ops/sec ±3.09% (16 runs sampled)
+deflate-pako x 10.22 ops/sec ±0.33% (29 runs sampled)
+deflate-zlib x 18.48 ops/sec ±0.24% (48 runs sampled)
+gzip-pako x 10.16 ops/sec ±0.25% (28 runs sampled)
+inflate-imaya x 110 ops/sec ±0.41% (77 runs sampled)
+inflate-pako x 134 ops/sec ±0.66% (83 runs sampled)
+inflate-zlib x 402 ops/sec ±0.74% (87 runs sampled)
+ungzip-pako x 113 ops/sec ±0.62% (80 runs sampled)
+```
+
+zlib's test is partially affected by marshalling (that make sense for inflate only).
+You can change deflate level to 0 in benchmark source, to investigate details.
+For deflate level 6 results can be considered as correct.
+
+__Install:__
+
+```
+npm install pako
+```
+
+
+Examples / API
+--------------
+
+Full docs - http://nodeca.github.io/pako/
+
+```javascript
+const pako = require('pako');
+
+// Deflate
+//
+const input = new Uint8Array();
+//... fill input data here
+const output = pako.deflate(input);
+
+// Inflate (simple wrapper can throw exception on broken stream)
+//
+const compressed = new Uint8Array();
+//... fill data to uncompress here
+try {
+  const result = pako.inflate(compressed);
+  // ... continue processing
+} catch (err) {
+  console.log(err);
+}
+
+//
+// Alternate interface for chunking & without exceptions
+//
+
+const deflator = new pako.Deflate();
+
+deflator.push(chunk1, false);
+deflator.push(chunk2); // second param is false by default.
+...
+deflator.push(chunk_last, true); // `true` says this chunk is last
+
+if (deflator.err) {
+  console.log(deflator.msg);
+}
+
+const output = deflator.result;
+
+
+const inflator = new pako.Inflate();
+
+inflator.push(chunk1);
+inflator.push(chunk2);
+...
+inflator.push(chunk_last); // no second param because end is auto-detected
+
+if (inflator.err) {
+  console.log(inflator.msg);
+}
+
+const output = inflator.result;
+```
+
+Sometime you can wish to work with strings. For example, to send
+stringified objects to server. Pako's deflate detects input data type, and
+automatically recode strings to utf-8 prior to compress. Inflate has special
+option, to say compressed data has utf-8 encoding and should be recoded to
+javascript's utf-16.
+
+```javascript
+const pako = require('pako');
+
+const test = { my: 'super', puper: [456, 567], awesome: 'pako' };
+
+const compressed = pako.deflate(JSON.stringify(test));
+
+const restored = JSON.parse(pako.inflate(compressed, { to: 'string' }));
+```
+
+
+Notes
+-----
+
+Pako does not contain some specific zlib functions:
+
+- __deflate__ -  methods `deflateCopy`, `deflateBound`, `deflateParams`,
+  `deflatePending`, `deflatePrime`, `deflateTune`.
+- __inflate__ - methods `inflateCopy`, `inflateMark`,
+  `inflatePrime`, `inflateGetDictionary`, `inflateSync`, `inflateSyncPoint`, `inflateUndermine`.
+- High level inflate/deflate wrappers (classes) may not support some flush
+  modes.
+
+
+pako for enterprise
+-------------------
+
+Available as part of the Tidelift Subscription
+
+The maintainers of pako and thousands of other packages are working with Tidelift to deliver commercial support and maintenance for the open source dependencies you use to build your applications. Save time, reduce risk, and improve code health, while paying the maintainers of the exact dependencies you use. [Learn more.](https://tidelift.com/subscription/pkg/npm-pako?utm_source=npm-pako&utm_medium=referral&utm_campaign=enterprise&utm_term=repo)
+
+
+Authors
+-------
+
+- Andrey Tupitsin [@anrd83](https://github.com/andr83)
+- Vitaly Puzrin [@puzrin](https://github.com/puzrin)
+
+Personal thanks to:
+
+- Vyacheslav Egorov ([@mraleph](https://github.com/mraleph)) for his awesome
+  tutorials about optimising JS code for v8, [IRHydra](http://mrale.ph/irhydra/)
+  tool and his advices.
+- David Duponchel ([@dduponchel](https://github.com/dduponchel)) for help with
+  testing.
+
+Original implementation (in C):
+
+- [zlib](http://zlib.net/) by Jean-loup Gailly and Mark Adler.
+
+
+License
+-------
+
+- MIT - all files, except `/lib/zlib` folder
+- ZLIB - `/lib/zlib` content
@@ -0,0 +1,18 @@
+// Top level file is just a mixin of submodules & constants
+'use strict';
+
+const { Deflate, deflate, deflateRaw, gzip } = require('./lib/deflate');
+
+const { Inflate, inflate, inflateRaw, ungzip } = require('./lib/inflate');
+
+const constants = require('./lib/zlib/constants');
+
+module.exports.Deflate = Deflate;
+module.exports.deflate = deflate;
+module.exports.deflateRaw = deflateRaw;
+module.exports.gzip = gzip;
+module.exports.Inflate = Inflate;
+module.exports.inflate = inflate;
+module.exports.inflateRaw = inflateRaw;
+module.exports.ungzip = ungzip;
+module.exports.constants = constants;
@@ -0,0 +1,380 @@
+'use strict';
+
+
+const zlib_deflate = require('./zlib/deflate');
+const utils        = require('./utils/common');
+const strings      = require('./utils/strings');
+const msg          = require('./zlib/messages');
+const ZStream      = require('./zlib/zstream');
+
+const toString = Object.prototype.toString;
+
+/* Public constants ==========================================================*/
+/* ===========================================================================*/
+
+const {
+  Z_NO_FLUSH, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH,
+  Z_OK, Z_STREAM_END,
+  Z_DEFAULT_COMPRESSION,
+  Z_DEFAULT_STRATEGY,
+  Z_DEFLATED
+} = require('./zlib/constants');
+
+/* ===========================================================================*/
+
+
+/**
+ * class Deflate
+ *
+ * Generic JS-style wrapper for zlib calls. If you don't need
+ * streaming behaviour - use more simple functions: [[deflate]],
+ * [[deflateRaw]] and [[gzip]].
+ **/
+
+/* internal
+ * Deflate.chunks -> Array
+ *
+ * Chunks of output data, if [[Deflate#onData]] not overridden.
+ **/
+
+/**
+ * Deflate.result -> Uint8Array
+ *
+ * Compressed result, generated by default [[Deflate#onData]]
+ * and [[Deflate#onEnd]] handlers. Filled after you push last chunk
+ * (call [[Deflate#push]] with `Z_FINISH` / `true` param).
+ **/
+
+/**
+ * Deflate.err -> Number
+ *
+ * Error code after deflate finished. 0 (Z_OK) on success.
+ * You will not need it in real life, because deflate errors
+ * are possible only on wrong options or bad `onData` / `onEnd`
+ * custom handlers.
+ **/
+
+/**
+ * Deflate.msg -> String
+ *
+ * Error message, if [[Deflate.err]] != 0
+ **/
+
+
+/**
+ * new Deflate(options)
+ * - options (Object): zlib deflate options.
+ *
+ * Creates new deflator instance with specified params. Throws exception
+ * on bad params. Supported options:
+ *
+ * - `level`
+ * - `windowBits`
+ * - `memLevel`
+ * - `strategy`
+ * - `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 deflate
+ * - `gzip` (Boolean) - create gzip wrapper
+ * - `header` (Object) - custom header for gzip
+ *   - `text` (Boolean) - true if compressed data believed to be text
+ *   - `time` (Number) - modification time, unix timestamp
+ *   - `os` (Number) - operation system code
+ *   - `extra` (Array) - array of bytes with extra data (max 65536)
+ *   - `name` (String) - file name (binary string)
+ *   - `comment` (String) - comment (binary string)
+ *   - `hcrc` (Boolean) - true if header crc should be added
+ *
+ * ##### Example:
+ *
+ * ```javascript
+ * const pako = require('pako')
+ *   , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])
+ *   , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);
+ *
+ * const deflate = new pako.Deflate({ level: 3});
+ *
+ * deflate.push(chunk1, false);
+ * deflate.push(chunk2, true);  // true -> last chunk
+ *
+ * if (deflate.err) { throw new Error(deflate.err); }
+ *
+ * console.log(deflate.result);
+ * ```
+ **/
+function Deflate(options) {
+  this.options = utils.assign({
+    level: Z_DEFAULT_COMPRESSION,
+    method: Z_DEFLATED,
+    chunkSize: 16384,
+    windowBits: 15,
+    memLevel: 8,
+    strategy: Z_DEFAULT_STRATEGY
+  }, options || {});
+
+  let opt = this.options;
+
+  if (opt.raw && (opt.windowBits > 0)) {
+    opt.windowBits = -opt.windowBits;
+  }
+
+  else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {
+    opt.windowBits += 16;
+  }
+
+  this.err    = 0;      // error code, if happens (0 = Z_OK)
+  this.msg    = '';     // error message
+  this.ended  = false;  // used to avoid multiple onEnd() calls
+  this.chunks = [];     // chunks of compressed data
+
+  this.strm = new ZStream();
+  this.strm.avail_out = 0;
+
+  let status = zlib_deflate.deflateInit2(
+    this.strm,
+    opt.level,
+    opt.method,
+    opt.windowBits,
+    opt.memLevel,
+    opt.strategy
+  );
+
+  if (status !== Z_OK) {
+    throw new Error(msg[status]);
+  }
+
+  if (opt.header) {
+    zlib_deflate.deflateSetHeader(this.strm, opt.header);
+  }
+
+  if (opt.dictionary) {
+    let dict;
+    // Convert data if needed
+    if (typeof opt.dictionary === 'string') {
+      // If we need to compress text, change encoding to utf8.
+      dict = strings.string2buf(opt.dictionary);
+    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {
+      dict = new Uint8Array(opt.dictionary);
+    } else {
+      dict = opt.dictionary;
+    }
+
+    status = zlib_deflate.deflateSetDictionary(this.strm, dict);
+
+    if (status !== Z_OK) {
+      throw new Error(msg[status]);
+    }
+
+    this._dict_set = true;
+  }
+}
+
+/**
+ * Deflate#push(data[, flush_mode]) -> Boolean
+ * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be
+ *   converted to utf8 byte sequence.
+ * - flush_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 deflate pipe, generating [[Deflate#onData]] calls with
+ * new compressed chunks. Returns `true` on success. The last data block must
+ * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending
+ * buffers and call [[Deflate#onEnd]].
+ *
+ * On fail call [[Deflate#onEnd]] with error code and return false.
+ *
+ * ##### Example
+ *
+ * ```javascript
+ * push(chunk, false); // push one of data chunks
+ * ...
+ * push(chunk, true);  // push last chunk
+ * ```
+ **/
+Deflate.prototype.push = function (data, flush_mode) {
+  const strm = this.strm;
+  const chunkSize = this.options.chunkSize;
+  let status, _flush_mode;
+
+  if (this.ended) { return false; }
+
+  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;
+  else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;
+
+  // Convert data if needed
+  if (typeof data === 'string') {
+    // If we need to compress text, change encoding to utf8.
+    strm.input = strings.string2buf(data);
+  } else 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;
+
+  for (;;) {
+    if (strm.avail_out === 0) {
+      strm.output = new Uint8Array(chunkSize);
+      strm.next_out = 0;
+      strm.avail_out = chunkSize;
+    }
+
+    // Make sure avail_out > 6 to avoid repeating markers
+    if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {
+      this.onData(strm.output.subarray(0, strm.next_out));
+      strm.avail_out = 0;
+      continue;
+    }
+
+    status = zlib_deflate.deflate(strm, _flush_mode);
+
+    // Ended => flush and finish
+    if (status === Z_STREAM_END) {
+      if (strm.next_out > 0) {
+        this.onData(strm.output.subarray(0, strm.next_out));
+      }
+      status = zlib_deflate.deflateEnd(this.strm);
+      this.onEnd(status);
+      this.ended = true;
+      return status === Z_OK;
+    }
+
+    // Flush if out buffer full
+    if (strm.avail_out === 0) {
+      this.onData(strm.output);
+      continue;
+    }
+
+    // Flush if requested and has data
+    if (_flush_mode > 0 && strm.next_out > 0) {
+      this.onData(strm.output.subarray(0, strm.next_out));
+      strm.avail_out = 0;
+      continue;
+    }
+
+    if (strm.avail_in === 0) break;
+  }
+
+  return true;
+};
+
+
+/**
+ * Deflate#onData(chunk) -> Void
+ * - chunk (Uint8Array): output data.
+ *
+ * By default, stores data blocks in `chunks[]` property and glue
+ * those in `onEnd`. Override this handler, if you need another behaviour.
+ **/
+Deflate.prototype.onData = function (chunk) {
+  this.chunks.push(chunk);
+};
+
+
+/**
+ * Deflate#onEnd(status) -> Void
+ * - status (Number): deflate status. 0 (Z_OK) on success,
+ *   other if not.
+ *
+ * Called once after you tell deflate that the input stream is
+ * complete (Z_FINISH). By default - join collected chunks,
+ * free memory and fill `results` / `err` properties.
+ **/
+Deflate.prototype.onEnd = function (status) {
+  // On success - join
+  if (status === Z_OK) {
+    this.result = utils.flattenChunks(this.chunks);
+  }
+  this.chunks = [];
+  this.err = status;
+  this.msg = this.strm.msg;
+};
+
+
+/**
+ * deflate(data[, options]) -> Uint8Array
+ * - data (Uint8Array|ArrayBuffer|String): input data to compress.
+ * - options (Object): zlib deflate options.
+ *
+ * Compress `data` with deflate algorithm and `options`.
+ *
+ * Supported options are:
+ *
+ * - level
+ * - windowBits
+ * - memLevel
+ * - strategy
+ * - dictionary
+ *
+ * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
+ * for more information on these.
+ *
+ * Sugar (options):
+ *
+ * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify
+ *   negative windowBits implicitly.
+ *
+ * ##### Example:
+ *
+ * ```javascript
+ * const pako = require('pako')
+ * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);
+ *
+ * console.log(pako.deflate(data));
+ * ```
+ **/
+function deflate(input, options) {
+  const deflator = new Deflate(options);
+
+  deflator.push(input, true);
+
+  // That will never happens, if you don't cheat with options :)
+  if (deflator.err) { throw deflator.msg || msg[deflator.err]; }
+
+  return deflator.result;
+}
+
+
+/**
+ * deflateRaw(data[, options]) -> Uint8Array
+ * - data (Uint8Array|ArrayBuffer|String): input data to compress.
+ * - options (Object): zlib deflate options.
+ *
+ * The same as [[deflate]], but creates raw data, without wrapper
+ * (header and adler32 crc).
+ **/
+function deflateRaw(input, options) {
+  options = options || {};
+  options.raw = true;
+  return deflate(input, options);
+}
+
+
+/**
+ * gzip(data[, options]) -> Uint8Array
+ * - data (Uint8Array|ArrayBuffer|String): input data to compress.
+ * - options (Object): zlib deflate options.
+ *
+ * The same as [[deflate]], but create gzip wrapper instead of
+ * deflate one.
+ **/
+function gzip(input, options) {
+  options = options || {};
+  options.gzip = true;
+  return deflate(input, options);
+}
+
+
+module.exports.Deflate = Deflate;
+module.exports.deflate = deflate;
+module.exports.deflateRaw = deflateRaw;
+module.exports.gzip = gzip;
+module.exports.constants = require('./zlib/constants');
@@ -0,0 +1,419 @@
+'use strict';
+
+
+const zlib_inflate = require('./zlib/inflate');
+const utils        = require('./utils/common');
+const strings      = require('./utils/strings');
+const msg          = require('./zlib/messages');
+const ZStream      = require('./zlib/zstream');
+const GZheader     = require('./zlib/gzheader');
+
+const toString = Object.prototype.toString;
+
+/* Public constants ==========================================================*/
+/* ===========================================================================*/
+
+const {
+  Z_NO_FLUSH, Z_FINISH,
+  Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR
+} = require('./zlib/constants');
+
+/* ===========================================================================*/
+
+
+/**
+ * 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|String
+ *
+ * Uncompressed result, generated by default [[Inflate#onData]]
+ * and [[Inflate#onEnd]] handlers. Filled after you push last chunk
+ * (call [[Inflate#push]] with `Z_FINISH` / `true` param).
+ **/
+
+/**
+ * Inflate.err -> Number
+ *
+ * Error code after inflate finished. 0 (Z_OK) on success.
+ * Should be checked if broken data possible.
+ **/
+
+/**
+ * Inflate.msg -> String
+ *
+ * Error message, if [[Inflate.err]] != 0
+ **/
+
+
+/**
+ * new Inflate(options)
+ * - options (Object): zlib inflate options.
+ *
+ * Creates new inflator instance with specified params. Throws exception
+ * on bad params. Supported options:
+ *
+ * - `windowBits`
+ * - `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
+ * const pako = require('pako')
+ * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])
+ * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);
+ *
+ * const 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) {
+  this.options = utils.assign({
+    chunkSize: 1024 * 64,
+    windowBits: 15,
+    to: ''
+  }, options || {});
+
+  const 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;
+
+  let status  = zlib_inflate.inflateInit2(
+    this.strm,
+    opt.windowBits
+  );
+
+  if (status !== 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 !== Z_OK) {
+        throw new Error(msg[status]);
+      }
+    }
+  }
+}
+
+/**
+ * Inflate#push(data[, flush_mode]) -> Boolean
+ * - data (Uint8Array|ArrayBuffer): input data
+ * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE
+ *   flush 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. If end of stream detected,
+ * [[Inflate#onEnd]] will be called.
+ *
+ * `flush_mode` is not needed for normal operation, because end of stream
+ * detected automatically. You may try to use it for advanced things, but
+ * this functionality was not tested.
+ *
+ * On fail call [[Inflate#onEnd]] with error code and return false.
+ *
+ * ##### Example
+ *
+ * ```javascript
+ * push(chunk, false); // push one of data chunks
+ * ...
+ * push(chunk, true);  // push last chunk
+ * ```
+ **/
+Inflate.prototype.push = function (data, flush_mode) {
+  const strm = this.strm;
+  const chunkSize = this.options.chunkSize;
+  const dictionary = this.options.dictionary;
+  let status, _flush_mode, last_avail_out;
+
+  if (this.ended) return false;
+
+  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;
+  else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;
+
+  // Convert data if needed
+  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;
+
+  for (;;) {
+    if (strm.avail_out === 0) {
+      strm.output = new Uint8Array(chunkSize);
+      strm.next_out = 0;
+      strm.avail_out = chunkSize;
+    }
+
+    status = zlib_inflate.inflate(strm, _flush_mode);
+
+    if (status === Z_NEED_DICT && dictionary) {
+      status = zlib_inflate.inflateSetDictionary(strm, dictionary);
+
+      if (status === Z_OK) {
+        status = zlib_inflate.inflate(strm, _flush_mode);
+      } else if (status === Z_DATA_ERROR) {
+        // Replace code with more verbose
+        status = Z_NEED_DICT;
+      }
+    }
+
+    // Skip snyc markers if more data follows and not raw mode
+    while (strm.avail_in > 0 &&
+           status === Z_STREAM_END &&
+           strm.state.wrap > 0 &&
+           data[strm.next_in] !== 0)
+    {
+      zlib_inflate.inflateReset(strm);
+      status = zlib_inflate.inflate(strm, _flush_mode);
+    }
+
+    switch (status) {
+      case Z_STREAM_ERROR:
+      case Z_DATA_ERROR:
+      case Z_NEED_DICT:
+      case Z_MEM_ERROR:
+        this.onEnd(status);
+        this.ended = true;
+        return false;
+    }
+
+    // Remember real `avail_out` value, because we may patch out buffer content
+    // to align utf8 strings boundaries.
+    last_avail_out = strm.avail_out;
+
+    if (strm.next_out) {
+      if (strm.avail_out === 0 || status === Z_STREAM_END) {
+
+        if (this.options.to === 'string') {
+
+          let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);
+
+          let tail = strm.next_out - next_out_utf8;
+          let utf8str = strings.buf2string(strm.output, next_out_utf8);
+
+          // move tail & realign counters
+          strm.next_out = tail;
+          strm.avail_out = chunkSize - tail;
+          if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);
+
+          this.onData(utf8str);
+
+        } else {
+          this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));
+        }
+      }
+    }
+
+    // Must repeat iteration if out buffer is full
+    if (status === Z_OK && last_avail_out === 0) continue;
+
+    // Finalize if end of stream reached.
+    if (status === Z_STREAM_END) {
+      status = zlib_inflate.inflateEnd(this.strm);
+      this.onEnd(status);
+      this.ended = true;
+      return true;
+    }
+
+    if (strm.avail_in === 0) break;
+  }
+
+  return true;
+};
+
+
+/**
+ * Inflate#onData(chunk) -> Void
+ * - chunk (Uint8Array|String): output data. 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). By default - join collected chunks,
+ * free memory and fill `results` / `err` properties.
+ **/
+Inflate.prototype.onEnd = function (status) {
+  // On success - join
+  if (status === Z_OK) {
+    if (this.options.to === 'string') {
+      this.result = this.chunks.join('');
+    } else {
+      this.result = utils.flattenChunks(this.chunks);
+    }
+  }
+  this.chunks = [];
+  this.err = status;
+  this.msg = this.strm.msg;
+};
+
+
+/**
+ * inflate(data[, options]) -> Uint8Array|String
+ * - data (Uint8Array|ArrayBuffer): 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
+ * const pako = require('pako');
+ * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));
+ * let output;
+ *
+ * try {
+ *   output = pako.inflate(input);
+ * } catch (err) {
+ *   console.log(err);
+ * }
+ * ```
+ **/
+function inflate(input, options) {
+  const inflator = new Inflate(options);
+
+  inflator.push(input);
+
+  // 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|String
+ * - data (Uint8Array|ArrayBuffer): 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|String
+ * - data (Uint8Array|ArrayBuffer): input data to decompress.
+ * - options (Object): zlib inflate options.
+ *
+ * Just shortcut to [[inflate]], because it autodetects format
+ * by header.content. Done for convenience.
+ **/
+
+
+module.exports.Inflate = Inflate;
+module.exports.inflate = inflate;
+module.exports.inflateRaw = inflateRaw;
+module.exports.ungzip = inflate;
+module.exports.constants = require('./zlib/constants');
@@ -0,0 +1,48 @@
+'use strict';
+
+
+const _has = (obj, key) => {
+  return Object.prototype.hasOwnProperty.call(obj, key);
+};
+
+module.exports.assign = function (obj /*from1, from2, from3, ...*/) {
+  const sources = Array.prototype.slice.call(arguments, 1);
+  while (sources.length) {
+    const source = sources.shift();
+    if (!source) { continue; }
+
+    if (typeof source !== 'object') {
+      throw new TypeError(source + 'must be non-object');
+    }
+
+    for (const p in source) {
+      if (_has(source, p)) {
+        obj[p] = source[p];
+      }
+    }
+  }
+
+  return obj;
+};
+
+
+// Join array of chunks to single array.
+module.exports.flattenChunks = (chunks) => {
+  // calculate data length
+  let len = 0;
+
+  for (let i = 0, l = chunks.length; i < l; i++) {
+    len += chunks[i].length;
+  }
+
+  // join chunks
+  const result = new Uint8Array(len);
+
+  for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {
+    let chunk = chunks[i];
+    result.set(chunk, pos);
+    pos += chunk.length;
+  }
+
+  return result;
+};
@@ -0,0 +1,174 @@
+// String encode/decode helpers
+'use strict';
+
+
+// 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
+//
+let STR_APPLY_UIA_OK = true;
+
+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
+const _utf8len = new Uint8Array(256);
+for (let 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)
+module.exports.string2buf = (str) => {
+  if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {
+    return new TextEncoder().encode(str);
+  }
+
+  let 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 Uint8Array(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
+const 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.
+  if (len < 65534) {
+    if (buf.subarray && STR_APPLY_UIA_OK) {
+      return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));
+    }
+  }
+
+  let result = '';
+  for (let i = 0; i < len; i++) {
+    result += String.fromCharCode(buf[i]);
+  }
+  return result;
+};
+
+
+// convert array to string
+module.exports.buf2string = (buf, max) => {
+  const len = max || buf.length;
+
+  if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {
+    return new TextDecoder().decode(buf.subarray(0, max));
+  }
+
+  let i, out;
+
+  // Reserve max possible length (2 words per char)
+  // NB: by unknown reasons, Array is significantly faster for
+  //     String.fromCharCode.apply than Uint16Array.
+  const utf16buf = new Array(len * 2);
+
+  for (out = 0, i = 0; i < len;) {
+    let c = buf[i++];
+    // quick process ascii
+    if (c < 0x80) { utf16buf[out++] = c; continue; }
+
+    let 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);
+module.exports.utf8border = (buf, max) => {
+
+  max = max || buf.length;
+  if (max > buf.length) { max = buf.length; }
+
+  // go back from last position, until start of sequence found
+  let 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;
+};
@@ -0,0 +1,59 @@
+Content of this folder follows zlib C sources as close as possible.
+That's intended to simplify maintainability and guarantee equal API
+and result.
+
+Key differences:
+
+- Everything is in JavaScript.
+- No platform-dependent blocks.
+- Some things like crc32 rewritten to keep size small and make JIT
+  work better.
+- Some code is different due missed features in JS (macros, pointers,
+  structures, header files)
+- Specific API methods are not implemented (see notes in root readme)
+
+This port is based on zlib 1.2.8.
+
+This port is under zlib license (see below) with contribution and addition of javascript
+port under expat license (see LICENSE at root of project)
+
+Copyright:
+(C) 1995-2013 Jean-loup Gailly and Mark Adler
+(C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
+
+
+From zlib's README
+=============================================================================
+
+Acknowledgments:
+
+  The deflate format used by zlib was defined by Phil Katz.  The deflate and
+  zlib specifications were written by L.  Peter Deutsch.  Thanks to all the
+  people who reported problems and suggested various improvements in zlib; they
+  are too numerous to cite here.
+
+Copyright notice:
+
+ (C) 1995-2013 Jean-loup Gailly and Mark Adler
+
+Copyright (c) <''year''> <''copyright holders''>
+
+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.
+
+
+  Jean-loup Gailly        Mark Adler
+  jloup@gzip.org          madler@alumni.caltech.edu
@@ -0,0 +1,51 @@
+'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.
+
+const adler32 = (adler, buf, len, pos) => {
+  let s1 = (adler & 0xffff) |0,
+      s2 = ((adler >>> 16) & 0xffff) |0,
+      n = 0;
+
+  while (len !== 0) {
+    // Set limit ~ twice less than 5552, to keep
+    // s2 in 31-bits, because we force signed ints.
+    // in other case %= will fail.
+    n = len > 2000 ? 2000 : len;
+    len -= n;
+
+    do {
+      s1 = (s1 + buf[pos++]) |0;
+      s2 = (s2 + s1) |0;
+    } while (--n);
+
+    s1 %= 65521;
+    s2 %= 65521;
+  }
+
+  return (s1 | (s2 << 16)) |0;
+};
+
+
+module.exports = adler32;
@@ -0,0 +1,68 @@
+'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.
+
+module.exports = {
+
+  /* Allowed flush values; see deflate() and inflate() below for details */
+  Z_NO_FLUSH:         0,
+  Z_PARTIAL_FLUSH:    1,
+  Z_SYNC_FLUSH:       2,
+  Z_FULL_FLUSH:       3,
+  Z_FINISH:           4,
+  Z_BLOCK:            5,
+  Z_TREES:            6,
+
+  /* Return codes for the compression/decompression functions. Negative values
+  * are errors, positive values are used for special but normal events.
+  */
+  Z_OK:               0,
+  Z_STREAM_END:       1,
+  Z_NEED_DICT:        2,
+  Z_ERRNO:           -1,
+  Z_STREAM_ERROR:    -2,
+  Z_DATA_ERROR:      -3,
+  Z_MEM_ERROR:       -4,
+  Z_BUF_ERROR:       -5,
+  //Z_VERSION_ERROR: -6,
+
+  /* compression levels */
+  Z_NO_COMPRESSION:         0,
+  Z_BEST_SPEED:             1,
+  Z_BEST_COMPRESSION:       9,
+  Z_DEFAULT_COMPRESSION:   -1,
+
+
+  Z_FILTERED:               1,
+  Z_HUFFMAN_ONLY:           2,
+  Z_RLE:                    3,
+  Z_FIXED:                  4,
+  Z_DEFAULT_STRATEGY:       0,
+
+  /* Possible values of the data_type field (though see inflate()) */
+  Z_BINARY:                 0,
+  Z_TEXT:                   1,
+  //Z_ASCII:                1, // = Z_TEXT (deprecated)
+  Z_UNKNOWN:                2,
+
+  /* The deflate compression method */
+  Z_DEFLATED:               8
+  //Z_NULL:                 null // Use -1 or null inline, depending on var type
+};
@@ -0,0 +1,59 @@
+'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
+const makeTable = () => {
+  let 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.
+const crcTable = new Uint32Array(makeTable());
+
+
+const crc32 = (crc, buf, len, pos) => {
+  const t = crcTable;
+  const end = pos + len;
+
+  crc ^= -1;
+
+  for (let i = pos; i < end; i++) {
+    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];
+  }
+
+  return (crc ^ (-1)); // >>> 0;
+};
+
+
+module.exports = crc32;
@@ -0,0 +1,58 @@
+'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;
+}
+
+module.exports = GZheader;
@@ -0,0 +1,344 @@
+'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
+const BAD = 16209;       /* got a data error -- remain here until reset */
+const TYPE = 16191;      /* i: waiting for type bits, including last-flag bit */
+
+/*
+   Decode literal, length, and distance codes and write out the resulting
+   literal and match bytes until either not enough input or output is
+   available, an end-of-block is encountered, or a data error is encountered.
+   When large enough input and output buffers are supplied to inflate(), for
+   example, a 16K input buffer and a 64K output buffer, more than 95% of the
+   inflate execution time is spent in this routine.
+
+   Entry assumptions:
+
+        state.mode === LEN
+        strm.avail_in >= 6
+        strm.avail_out >= 258
+        start >= strm.avail_out
+        state.bits < 8
+
+   On return, state.mode is one of:
+
+        LEN -- ran out of enough output space or enough available input
+        TYPE -- reached end of block code, inflate() to interpret next block
+        BAD -- error in block data
+
+   Notes:
+
+    - The maximum input bits used by a length/distance pair is 15 bits for the
+      length code, 5 bits for the length extra, 15 bits for the distance code,
+      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.
+      Therefore if strm.avail_in >= 6, then there is enough input to avoid
+      checking for available input while decoding.
+
+    - The maximum bytes that a single length/distance pair can output is 258
+      bytes, which is the maximum length that can be coded.  inflate_fast()
+      requires strm.avail_out >= 258 for each loop to avoid checking for
+      output space.
+ */
+module.exports = function inflate_fast(strm, start) {
+  let _in;                    /* local strm.input */
+  let last;                   /* have enough input while in < last */
+  let _out;                   /* local strm.output */
+  let beg;                    /* inflate()'s initial strm.output */
+  let end;                    /* while out < end, enough space available */
+//#ifdef INFLATE_STRICT
+  let dmax;                   /* maximum distance from zlib header */
+//#endif
+  let wsize;                  /* window size or zero if not using window */
+  let whave;                  /* valid bytes in the window */
+  let wnext;                  /* window write index */
+  // Use `s_window` instead `window`, avoid conflict with instrumentation tools
+  let s_window;               /* allocated sliding window, if wsize != 0 */
+  let hold;                   /* local strm.hold */
+  let bits;                   /* local strm.bits */
+  let lcode;                  /* local strm.lencode */
+  let dcode;                  /* local strm.distcode */
+  let lmask;                  /* mask for first level of length codes */
+  let dmask;                  /* mask for first level of distance codes */
+  let here;                   /* retrieved table entry */
+  let op;                     /* code bits, operation, extra bits, or */
+                              /*  window position, window bytes to copy */
+  let len;                    /* match length, unused bytes */
+  let dist;                   /* match distance */
+  let from;                   /* where to copy match from */
+  let from_source;
+
+
+  let input, output; // JS specific, because we have no pointers
+
+  /* copy state to local variables */
+  const 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;
+};
@@ -0,0 +1,340 @@
+'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.
+
+const MAXBITS = 15;
+const ENOUGH_LENS = 852;
+const ENOUGH_DISTS = 592;
+//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);
+
+const CODES = 0;
+const LENS = 1;
+const DISTS = 2;
+
+const lbase = new Uint16Array([ /* 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
+]);
+
+const lext = new Uint8Array([ /* 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
+]);
+
+const dbase = new Uint16Array([ /* 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
+]);
+
+const dext = new Uint8Array([ /* 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
+]);
+
+const inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>
+{
+  const bits = opts.bits;
+      //here = opts.here; /* table entry for duplication */
+
+  let len = 0;               /* a code's length in bits */
+  let sym = 0;               /* index of code symbols */
+  let min = 0, max = 0;          /* minimum and maximum code lengths */
+  let root = 0;              /* number of index bits for root table */
+  let curr = 0;              /* number of index bits for current table */
+  let drop = 0;              /* code bits to drop for sub-table */
+  let left = 0;                   /* number of prefix codes available */
+  let used = 0;              /* code entries in table used */
+  let huff = 0;              /* Huffman code */
+  let incr;              /* for incrementing code, index */
+  let fill;              /* index for replicating entries */
+  let low;               /* low bits for current root entry */
+  let mask;              /* mask for low root bits */
+  let next;             /* next available space in table */
+  let base = null;     /* base value table to use */
+//  let shoextra;    /* extra bits table to use */
+  let match;                  /* use base and extra for symbol >= match */
+  const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */
+  const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */
+  let extra = null;
+
+  let 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 */
+    match = 20;
+
+  } else if (type === LENS) {
+    base = lbase;
+    extra = lext;
+    match = 257;
+
+  } else {                    /* DISTS */
+    base = dbase;
+    extra = dext;
+    match = 0;
+  }
+
+  /* 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] + 1 < match) {
+      here_op = 0;
+      here_val = work[sym];
+    }
+    else if (work[sym] >= match) {
+      here_op = extra[work[sym] - match];
+      here_val = base[work[sym] - match];
+    }
+    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;
+};
+
+
+module.exports = inflate_table;
@@ -0,0 +1,32 @@
+'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.
+
+module.exports = {
+  2:      'need dictionary',     /* Z_NEED_DICT       2  */
+  1:      'stream end',          /* Z_STREAM_END      1  */
+  0:      '',                    /* Z_OK              0  */
+  '-1':   'file error',          /* Z_ERRNO         (-1) */
+  '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */
+  '-3':   'data error',          /* Z_DATA_ERROR    (-3) */
+  '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */
+  '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */
+  '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */
+};
@@ -0,0 +1,47 @@
+'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;
+}
+
+module.exports = ZStream;
@@ -0,0 +1,64 @@
+{
+  "name": "pako",
+  "description": "zlib port to javascript - fast, modularized, with browser support",
+  "version": "2.1.0",
+  "keywords": [
+    "zlib",
+    "deflate",
+    "inflate",
+    "gzip"
+  ],
+  "contributors": [
+    "Andrei Tuputcyn (https://github.com/andr83)",
+    "Vitaly Puzrin (https://github.com/puzrin)",
+    "Friedel Ziegelmayer (https://github.com/dignifiedquire)",
+    "Kirill Efimov (https://github.com/Kirill89)",
+    "Jean-loup Gailly",
+    "Mark Adler"
+  ],
+  "files": [
+    "index.js",
+    "dist/",
+    "lib/"
+  ],
+  "license": "(MIT AND Zlib)",
+  "repository": "nodeca/pako",
+  "module": "./dist/pako.esm.mjs",
+  "exports": {
+    ".": {
+      "import": "./dist/pako.esm.mjs",
+      "require": "./index.js"
+    },
+    "./package.json": "./package.json",
+    "./dist/*": "./dist/*",
+    "./lib/*": "./lib/*",
+    "./lib/zlib/*": "./lib/zlib/*",
+    "./lib/utils/*": "./lib/utils/*"
+  },
+  "scripts": {
+    "lint": "eslint .",
+    "test": "npm run lint && mocha",
+    "coverage": "npm run lint && nyc mocha && nyc report --reporter html",
+    "build": "rollup -c",
+    "build_fixtures": "node support/build_fixtures.js",
+    "doc": "node support/build_doc.js",
+    "gh-doc": "npm run doc && gh-pages -d doc -f",
+    "prepublishOnly": "npm run gh-doc"
+  },
+  "devDependencies": {
+    "@babel/preset-env": "^7.12.1",
+    "@rollup/plugin-babel": "^5.2.1",
+    "@rollup/plugin-commonjs": "^16.0.0",
+    "@rollup/plugin-node-resolve": "^10.0.0",
+    "eslint": "^7.13.0",
+    "gh-pages": "^3.1.0",
+    "mocha": "^8.2.1",
+    "multiparty": "^4.1.3",
+    "ndoc": "^6.0.0",
+    "nyc": "^15.1.0",
+    "rollup": "^2.33.1",
+    "rollup-plugin-terser": "^7.0.2",
+    "shelljs": "^0.8.4"
+  },
+  "dependencies": {}
+}
@@ -0,0 +1,28 @@
+{
+  "name": "测试流式传输uniapp",
+  "lockfileVersion": 3,
+  "requires": true,
+  "packages": {
+    "": {
+      "dependencies": {
+        "pako": "^2.1.0"
+      },
+      "devDependencies": {
+        "@types/pako": "^2.0.4"
+      }
+    },
+    "node_modules/@types/pako": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmmirror.com/@types/pako/-/pako-2.0.4.tgz",
+      "integrity": "sha512-VWDCbrLeVXJM9fihYodcLiIv0ku+AlOa/TQ1SvYOaBuyrSKgEcro95LJyIsJ4vSo6BXIxOKxiJAat04CmST9Fw==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/pako": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/pako/-/pako-2.1.0.tgz",
+      "integrity": "sha512-w+eufiZ1WuJYgPXbV/PO3NCMEc3xqylkKHzp8bxp1uW4qaSNQUkwmLLEc3kKsfz8lpV1F8Ht3U1Cm+9Srog2ug==",
+      "license": "(MIT AND Zlib)"
+    }
+  }
+}
@@ -0,0 +1,8 @@
+{
+  "dependencies": {
+    "pako": "^2.1.0"
+  },
+  "devDependencies": {
+    "@types/pako": "^2.0.4"
+  }
+}
@@ -0,0 +1,338 @@
+// 导入 GZIP 处理库（浏览器/Node.js 通用，需提前安装：npm install pako @types/pako）
+// import * as pako from "pako";
+
+/**
+ * 协议常量类：存储协议核心配置（不可修改，确保前后端一致）
+ */
+export class ProtocolConst {
+  /** 协议版本：v1（4位，对应字节3~4的低4位，剩余位保留用于后续升级） */
+  static readonly PROTOCOL_VERSION = 0b0001;
+
+  /** 头部固定长度：8字节（字节1~8，结构严格定义，不可修改） */
+  static readonly HEADER_SIZE = 8;
+
+  /** 最大包体大小：10MB（防止内存溢出，与 Python 端 MAX_BODY_SIZE 一致） */
+  static readonly MAX_BODY_SIZE = 1024 * 1024 * 10;
+
+  /** 字符串编码格式：UTF-8（统一前后端字符串编解码，避免乱码） */
+  static readonly STRING_ENCODING = "utf-8" as const; // as const 固定字符串类型，避免类型拓宽
+}
+
+/**
+ * 消息类型枚举（4位，存储在字节1高4位）
+ * 与 Python 端 MessageType 枚举值完全对齐，支持16种类型（当前用5种，剩余预留扩展）
+ */
+export enum MessageType {
+  PING = 0b0000, // 心跳消息（用于检测连接存活）
+  AUDIO_DATA = 0b0001, // 纯音频数据（PCM 二进制流，对应 RAW 序列化）
+  TEXT_MESSAGE = 0b0010, // 纯文本消息（对应 STRING 序列化，无 JSON 包装）
+  AUDIO_TEXT_MIX = 0b0011, // 音频+文本混合数据（复杂结构，对应 JSON 序列化）
+  CONTROL_CMD = 0b0100, // 控制指令（暂停/继续/停止等，对应 JSON 序列化）
+}
+
+/**
+ * 序列化方式枚举（4位，存储在字节2高4位）
+ * 按数据类型选择最优序列化方式，减少开销
+ */
+export enum SerializationType {
+  RAW = 0b0000, // 原始二进制（无需编解码，直接透传，适合音频等二进制数据）
+  JSON = 0b0001, // JSON 格式（适合字典、列表等复杂结构，如控制指令、混合数据）
+  STRING = 0b0010, // 直接字符串（UTF-8 编码，无 JSON 包装，适合纯文本消息）
+}
+
+/**
+ * 压缩方式枚举（4位，存储在字节2低4位）
+ * 按需选择压缩策略，平衡性能和传输体积
+ */
+export enum CompressionType {
+  NONE = 0b0000, // 无压缩（小数据包如控制指令、短文本，避免压缩开销）
+  GZIP = 0b0001, // GZIP 压缩（大数据包如长文本、混合数据，减少网络传输量）
+}
+
+/**
+ * 控制指令枚举（配合 MessageType.CONTROL_CMD 使用）
+ * 定义业务层面的控制指令，与 Python 端控制指令值一致
+ */
+export enum ControlCommand {
+  HEARTBEAT = 0b0001, // 心跳响应（回复 PING 消息）
+  PAUSE = 0b0010, // 暂停指令（如暂停音频播放）
+  RESUME = 0b0011, // 继续指令（如恢复音频播放）
+  STOP = 0b0100, // 停止指令（如停止音频传输）
+}
+
+/**
+ * 解包返回结果接口（强类型约束，明确返回数据结构）
+ * 让 IDE 提供自动提示，避免类型错误
+ */
+export interface UnpackedResult {
+  msgType: MessageType; // 消息类型（枚举值，便于逻辑判断）
+  msgTypeName: keyof typeof MessageType; // 消息类型名称（字符串，如 "TEXT_MESSAGE"，便于日志打印）
+  serialization: SerializationType; // 序列化方式（枚举值）
+  serializationName: keyof typeof SerializationType; // 序列化方式名称（字符串）
+  compression: CompressionType; // 压缩方式（枚举值）
+  compressionName: keyof typeof CompressionType; // 压缩方式名称（字符串）
+  body: Uint8Array | string | object | unknown[]; // 解包后的原始包体（根据序列化方式动态变化）
+}
+
+/**
+ * 打包入参类型别名（简化方法入参类型定义，提高可读性）
+ */
+// 包体支持的类型：二进制、字符串、对象、数组
+type PackBody = Uint8Array | string | object | unknown[];
+// 序列化方式可选值：枚举值、null、undefined（null/undefined 时自动推导）
+type OptionalSerialization = SerializationType | null | undefined;
+
+/**
+ * 协议编解码工具类（静态类，无需实例化，提供 pack/unpack 静态方法）
+ * 核心功能：将业务数据打包为符合协议的二进制包，或解析二进制包为业务数据
+ * 特点：与 Python/JS 端完全兼容，性能高效，类型安全
+ */
+export class ProtocolCodec {
+  /**
+   * 打包协议包：将业务数据按协议格式封装为二进制包
+   * @param msgType 消息类型（必须指定，枚举值）
+   * @param body 业务数据（根据消息类型对应不同类型，如字符串、对象、Uint8Array）
+   * @param serialization 序列化方式（可选，默认自动推导：纯文本→STRING，音频→RAW，复杂结构→JSON）
+   * @param compression 压缩方式（可选，默认无压缩）
+   * @returns 完整协议包（Uint8Array 类型，便于网络传输）
+   * @throws 类型错误、不支持的枚举值、包体过大等异常
+   */
+  static pack(
+    msgType: MessageType,
+    body: PackBody,
+    serialization: OptionalSerialization = null,
+    compression: CompressionType = CompressionType.NONE
+  ): Uint8Array {
+    // 1. 自动推导序列化方式（减少调用方心智负担，按消息类型默认最优解）
+    if (serialization === null || serialization === undefined) {
+      if (msgType === MessageType.AUDIO_DATA) {
+        // 音频数据→RAW 序列化（无需编解码，性能最优）
+        serialization = SerializationType.RAW;
+      } else if (msgType === MessageType.TEXT_MESSAGE) {
+        // 纯文本消息→STRING 序列化（直接 UTF-8 编码，无冗余）
+        serialization = SerializationType.STRING;
+      } else if (msgType === MessageType.CONTROL_CMD || msgType === MessageType.AUDIO_TEXT_MIX) {
+        // 控制指令/混合数据→JSON 序列化（支持复杂结构）
+        serialization = SerializationType.JSON;
+      } else {
+        // 非法消息类型：抛出异常，提前阻断错误
+        throw new Error(`不支持的消息类型：${MessageType[msgType]}（值：${msgType}）`);
+      }
+    }
+
+    // 2. 序列化包体：将业务数据转为二进制（按序列化方式处理）
+    let serializedBody: Uint8Array; // 序列化后的二进制数据
+    const textEncoder = new TextEncoder(ProtocolConst.STRING_ENCODING); // UTF-8 编码器
+
+    switch (serialization) {
+      case SerializationType.RAW:
+        // RAW 序列化：必须传入 Uint8Array（二进制数据直接透传）
+        if (!(body instanceof Uint8Array)) {
+          throw new TypeError(`RAW 序列化要求 body 必须是 Uint8Array 类型，当前传入：${typeof body}`);
+        }
+        serializedBody = body;
+        break;
+
+      case SerializationType.STRING:
+        // STRING 序列化：必须传入字符串，直接 UTF-8 编码（无 JSON 包装）
+        if (typeof body !== "string") {
+          throw new TypeError(`STRING 序列化要求 body 必须是 string 类型，当前传入：${typeof body}`);
+        }
+        serializedBody = textEncoder.encode(body);
+        break;
+
+      case SerializationType.JSON:
+        // JSON 序列化：支持字符串、对象、数组，转为 JSON 字符串后 UTF-8 编码
+        if (typeof body === "string") {
+          // 已为字符串，直接编码
+          serializedBody = textEncoder.encode(body);
+        } else if (typeof body === "object" && body !== null) {
+          // 对象/数组→JSON 字符串→编码（用 JSON.stringify 序列化）
+          const jsonStr = JSON.stringify(body);
+          serializedBody = textEncoder.encode(jsonStr);
+        } else {
+          throw new TypeError(`JSON 序列化要求 body 必须是 string/object/array 类型，当前传入：${typeof body}`);
+        }
+        break;
+
+      default:
+        // 非法序列化方式：抛出异常
+        throw new Error(`不支持的序列化方式：${SerializationType[serialization]}（值：${serialization}）`);
+    }
+
+    // 3. 压缩包体：按指定压缩方式处理（GZIP 或无压缩）
+    let compressedBody: Uint8Array; // 压缩后的二进制数据
+    if (compression === CompressionType.NONE) {
+      // 无压缩：直接透传序列化后的二进制数据
+      compressedBody = serializedBody;
+    } else {
+      // 非法压缩方式：抛出异常
+      throw new Error(`不支持的压缩方式：${CompressionType[compression]}（值：${compression}）`);
+    }
+
+    // 4. 校验包体大小：防止超过最大限制（避免内存溢出）
+    const bodyLen = compressedBody.length; // 压缩后的包体长度
+    if (bodyLen > ProtocolConst.MAX_BODY_SIZE) {
+      throw new Error(
+        `包体过大（${bodyLen}字节），最大支持${ProtocolConst.MAX_BODY_SIZE}字节（10MB）`
+      );
+    }
+
+    // 5. 构造头部：8字节固定结构（严格按协议定义，大端序，与 Python 端一致）
+    const header = new Uint8Array(ProtocolConst.HEADER_SIZE); // 头部缓冲区（8字节）
+
+    // 字节1：消息类型(4位) + 保留位(4位)
+    // 消息类型左移4位（占高4位），保留位填0（后续扩展用）
+    header[0] = (msgType << 4) | 0x00;
+
+    // 字节2：序列化方式(4位) + 压缩方式(4位)
+    // 序列化方式左移4位（占高4位），压缩方式占低4位（&0x0F 确保仅4位）
+    header[1] = (serialization << 4) | (compression & 0x0F);
+
+    // 字节3~4：协议版本（16位大端序）
+    // 大端序：高位字节在前，低位字节在后（网络传输标准字节序）
+    header[2] = (ProtocolConst.PROTOCOL_VERSION >> 8) & 0xFF; // 版本高8位（当前版本为1，高8位为0）
+    header[3] = ProtocolConst.PROTOCOL_VERSION & 0xFF; // 版本低8位（当前版本为1）
+
+    // 字节5~8：包体长度（32位大端序）
+    // 32位整数：最高位字节（第5字节）→ 最低位字节（第8字节）
+    header[4] = (bodyLen >> 24) & 0xFF; // 包体长度第24~31位
+    header[5] = (bodyLen >> 16) & 0xFF; // 包体长度第16~23位
+    header[6] = (bodyLen >> 8) & 0xFF; // 包体长度第8~15位
+    header[7] = bodyLen & 0xFF; // 包体长度第0~7位
+
+    // 6. 拼接头部和包体：生成完整协议包
+    const totalLen = ProtocolConst.HEADER_SIZE + bodyLen; // 总长度 = 头部8字节 + 包体长度
+    const packet = new Uint8Array(totalLen); // 完整包缓冲区
+
+    packet.set(header, 0); // 从索引0开始写入头部（占前8字节）
+    packet.set(compressedBody, ProtocolConst.HEADER_SIZE); // 从索引8开始写入包体
+
+    return packet; // 返回完整协议包（Uint8Array，网络传输高效）
+  }
+
+  /**
+   * 解包协议包：将二进制协议包解析为业务数据
+   * @param packet 完整协议包（网络接收的二进制数据，支持 Uint8Array 或 ArrayBuffer）
+   * @returns 结构化解包结果（UnpackedResult 接口，包含消息类型、包体等信息）
+   * @throws 包长度过短、版本不匹配、解压缩失败、反序列化失败等异常
+   */
+  static unpack(packet: Uint8Array | ArrayBuffer): UnpackedResult {
+    // 统一数据类型：将 ArrayBuffer 转为 Uint8Array（便于按字节操作）
+    const uint8Packet = packet instanceof ArrayBuffer 
+      ? new Uint8Array(packet) 
+      : packet;
+
+    // 1. 校验包长度：至少包含8字节头部
+    if (uint8Packet.length < ProtocolConst.HEADER_SIZE) {
+      throw new Error(
+        `包长度过短（${uint8Packet.length}字节），至少需要${ProtocolConst.HEADER_SIZE}字节头部`
+      );
+    }
+
+    // 2. 拆分头部和包体：前8字节为头部，剩余为包体
+    const header = uint8Packet.subarray(0, ProtocolConst.HEADER_SIZE); // 头部（0~7索引）
+    const bodyBuffer = uint8Packet.subarray(ProtocolConst.HEADER_SIZE); // 包体（8索引开始）
+
+    // 3. 解析头部字段（按协议结构逐字节解析，大端序）
+    // 字节1：消息类型(4位) + 保留位(4位)
+    const byte1 = header[0];
+    const msgType = (byte1 >> 4) & 0x0F; // 右移4位取高4位（消息类型），&0x0F 确保仅4位
+    // 校验消息类型合法性（防止非法包注入）
+    if (!Object.values(MessageType).includes(msgType as MessageType)) {
+      throw new Error(`非法消息类型：${msgType}（无对应枚举值）`);
+    }
+
+    // 字节2：序列化方式(4位) + 压缩方式(4位)
+    const byte2 = header[1];
+    const serialization = (byte2 >> 4) & 0x0F; // 右移4位取高4位（序列化方式）
+    const compression = byte2 & 0x0F; // 取低4位（压缩方式）
+    // 校验序列化方式合法性
+    if (!Object.values(SerializationType).includes(serialization as SerializationType)) {
+      throw new Error(`非法序列化方式：${serialization}（无对应枚举值）`);
+    }
+    // 校验压缩方式合法性
+    if (!Object.values(CompressionType).includes(compression as CompressionType)) {
+      throw new Error(`非法压缩方式：${compression}（无对应枚举值）`);
+    }
+
+    // 字节3~4：协议版本（16位大端序）
+    const version = (header[2] << 8) | header[3]; // 大端序解析：高位字节<<8 + 低位字节
+    // 校验版本兼容性（仅支持当前协议版本）
+    if (version !== ProtocolConst.PROTOCOL_VERSION) {
+      throw new Error(
+        `协议版本不匹配：收到v${version}，当前支持v${ProtocolConst.PROTOCOL_VERSION}`
+      );
+    }
+
+    // 字节5~8：包体长度（32位大端序）
+    const bodyLen = (header[4] << 24) | (header[5] << 16) | (header[6] << 8) | header[7];
+    // 校验包体长度一致性（头部声明长度 vs 实际包体长度）
+    if (bodyBuffer.length !== bodyLen) {
+      throw new Error(
+        `包体长度不匹配：头部声明${bodyLen}字节，实际接收${bodyBuffer.length}字节（可能包丢失或非法包）`
+      );
+    }
+
+    // 4. 解压包体：按头部指定的压缩方式解压
+    let decompressedBody: Uint8Array; // 解压后的二进制数据
+    if (compression === CompressionType.NONE) {
+      // 无压缩：直接透传包体数据
+      decompressedBody = bodyBuffer;
+    } else {
+      // 此处理论上不会触发（已提前校验压缩方式合法性）
+      throw new Error(`不支持的压缩方式：${CompressionType[compression]}（值：${compression}）`);
+    }
+
+    // 5. 反序列化包体：将二进制数据转为业务数据（按序列化方式处理）
+    let body: UnpackedResult["body"]; // 反序列化后的原始业务数据
+    const textDecoder = new TextDecoder(ProtocolConst.STRING_ENCODING); // UTF-8 解码器
+
+    switch (serialization) {
+      case SerializationType.RAW:
+        // RAW 反序列化：直接返回 Uint8Array（二进制数据，如音频 PCM）
+        body = decompressedBody;
+        break;
+
+      case SerializationType.STRING:
+        // STRING 反序列化：UTF-8 解码为字符串（无 JSON 解析步骤）
+        try {
+          body = textDecoder.decode(decompressedBody);
+        } catch (e) {
+          throw new Error(`STRING 反序列化失败：${(e as Error).message}（UTF-8 解码错误，可能是非法字符串数据）`);
+        }
+        break;
+
+      case SerializationType.JSON:
+        // JSON 反序列化：先 UTF-8 解码为字符串，再 JSON.parse 转为对象/数组
+        try {
+          const jsonStr = textDecoder.decode(decompressedBody); // 二进制→JSON 字符串
+          body = JSON.parse(jsonStr); // JSON 字符串→对象/数组
+        } catch (e) {
+          if (e instanceof TypeError) {
+            throw new Error(`JSON 反序列化失败：${ProtocolConst.STRING_ENCODING} 解码错误（非法 UTF-8 数据）`);
+          } else if (e instanceof SyntaxError) {
+            throw new Error(`JSON 反序列化失败：格式错误（${(e as Error).message}），请检查 JSON 语法`);
+          } else {
+            throw new Error(`JSON 反序列化失败：${(e as Error).message}`);
+          }
+        }
+        break;
+
+      default:
+        // 此处理论上不会触发（已提前校验序列化方式合法性）
+        throw new Error(`不支持的序列化方式：${SerializationType[serialization]}（值：${serialization}）`);
+    }
+
+    // 6. 构造并返回解包结果（利用枚举反向映射获取名称，便于日志和展示）
+    return {
+      msgType: msgType as MessageType, // 消息类型枚举值
+      msgTypeName: MessageType[msgType] as keyof typeof MessageType, // 消息类型名称（如 "TEXT_MESSAGE"）
+      serialization: serialization as SerializationType, // 序列化方式枚举值
+      serializationName: SerializationType[serialization] as keyof typeof SerializationType, // 序列化方式名称
+      compression: compression as CompressionType, // 压缩方式枚举值
+      compressionName: CompressionType[compression] as keyof typeof CompressionType, // 压缩方式名称
+      body: body, // 反序列化后的原始业务数据
+    };
+  }
+}
@@ -0,0 +1,237 @@
+<template>
+	<view class="container">
+		<button @click="onStartRecord" :disabled="isRecording">开始录音</button>
+		<button @click="onStopRecord" :disabled="!isRecording">停止录音</button>
+		<view class="tip">{{ status }}</view>
+		<view class="tip">当前分贝：{{ currentDecibels }}</view>
+		<yao-RecordFrame ref="recordFrame" @onFrameRecorded="frameRecorded" @currentDecibels="onCurrentDecibels"
+			@onStop="stopIt">
+		</yao-RecordFrame>
+		<sdx-StreamPlayer>xx</sdx-StreamPlayer>
+	</view>
+</template>
+
+<script>
+	export default {
+		data() {
+			return {
+				status: "未录音",
+				currentDecibels: 0,
+				isRecording: false,
+				ws: null, // WebSocket 实例
+				audioContext: null, // 音频上下文
+				scriptProcessor: null, // 音频处理节点
+				audioBufferSource: null, // 音频源节点
+				frameBufferList: [], // 缓存音频帧
+				wsUrl: "ws://172.16.89.58:8000/ws/audio", // 替换为实际后端地址
+			};
+		},
+		onUnload() {
+			// 页面卸载时清理资源
+			this.stopRecordAndClean();
+		},
+		methods: {
+
+
+			// 申请录音权限
+			async applyRecordPermission() {
+				try {
+					const res = await uni.requestPermissions({
+						scope: "scope.record"
+					});
+					const isGranted = res[0].grantStatus === 1;
+					if (!isGranted) {
+						uni.showToast({
+							title: "请授予录音权限",
+							icon: "none"
+						});
+					}
+					return isGranted;
+				} catch (e) {
+					console.error("申请权限失败：", e);
+					return false;
+				}
+			},
+			// ArrayBuffer 转字符串
+			// 兼容的 ArrayBuffer 转字符串方法
+			arrayBufferToStringCompat(buffer) {
+			    // 方法1: 使用 String.fromCharCode 和 Uint8Array
+			    const uint8Array = new Uint8Array(buffer);
+			    let str = '';
+			    for (let i = 0; i < uint8Array.length; i++) {
+			        str += String.fromCharCode(uint8Array[i]);
+			    }
+			    return str;
+			    
+			    // 方法2: 或者使用更简洁的方式
+			    // return String.fromCharCode.apply(null, new Uint8Array(buffer));
+			},
+			// 开始录音
+			async onStartRecord() {
+				// 1. 申请权限
+				// const hasPermission = await this.applyRecordPermission();
+				// if (!hasPermission) return;
+				this.ws = uni.connectSocket({
+					url: this.wsUrl, //仅为示例，并非真实接口地址。
+					complete: () => {
+						console.log('complete');
+					},
+					success: () => {
+						console.log('web');
+						this.ws.onOpen((res) => {
+							console.log('WebSocket连接已打开', res);
+							this.ws.onMessage((res) => {
+								let messageData = res.data;
+								// 处理不同类型的数据
+								if (typeof messageData === 'string') {
+									// 文本数据
+									try {
+										const parsedData = JSON.parse(messageData);
+										this.handleMessage(parsedData);
+									} catch (e) {
+										this.handleMessage(messageData);
+									}
+								} else if (messageData instanceof ArrayBuffer) {
+									// 二进制数据
+									try {
+										
+										// const str = this.arrayBufferToStringCompat(messageData);
+										// console.log('转换后的字符串:', str);
+										
+									} catch (e) {
+										console.log('二进制数据解析失败:', e);
+									}
+								}
+							})
+						});
+					},
+					fail: () => {
+						console.log('fail');
+					},
+				});
+
+				// await this.initWebSocket();
+
+				// 3. 启动录音
+				try {
+					this.$refs.recordFrame.start({
+						sampleRate: 16000,
+						frameSize: 1024,
+						gain: 1.0,
+						onFrameRecorded: ({
+							isLastFrame,
+							frameBuffer
+						}) => {
+							// 处理帧数据（如实时上传/渲染）
+							// console.log('帧数据:', frameData);
+							this.ws.send({
+								data: frameBuffer
+							});
+						},
+						onDecibels: (decibels) => {
+							// 处理分贝数据（如实时更新UI）
+							// console.log('当前分贝:', decibels);
+							this.currentDecibels = decibels;
+						}
+					});
+					this.isRecording = true;
+					this.status = "录音中...";
+				} catch (e) {
+					console.error("启动录音失败：", e);
+					this.status = "启动录音失败";
+					this.isRecording = false;
+				}
+			},
+			
+			// 停止录音
+			onStopRecord() {
+				this.stopRecordAndClean();
+			},
+
+			// 停止录音并清理资源
+			stopRecordAndClean() {
+				if (this.isRecording) {
+					// 停止录音组件
+					this.$refs.recordFrame.stop();
+					this.isRecording = false;
+					this.status = "已停止录音";
+				}
+
+				// 关闭 WebSocket
+				if (this.ws) {
+					this.ws.close();
+					this.ws = null;
+				}
+
+				// 清理音频上下文
+				if (this.audioContext) {
+					this.audioContext.close();
+					this.audioContext = null;
+					this.scriptProcessor = null;
+					this.frameBufferList = [];
+				}
+
+				// 重置状态
+				this.currentDecibels = 0;
+			},
+
+			// 接收音频帧并处理
+			frameRecorded({
+				isLastFrame,
+				frameBuffer
+			}) {
+				// console.log("收到音频帧：", isLastFrame, frameBuffer.length);
+
+				// 2. 通过 WebSocket 发送给后端
+				if (this.ws) {
+					try {
+						this.ws.send({
+							data: frameBuffer
+						});
+					} catch (e) {
+						console.error("发送音频帧失败：", e);
+					}
+				}
+
+
+			},
+
+			// 监听分贝值
+			onCurrentDecibels(decibels) {
+				// this.currentDecibels = decibels.toFixed(2);
+				// console.log("当前分贝：", this.currentDecibels);
+			},
+
+			// 录音停止回调
+			stopIt(base64) {
+				this.stopRecordAndClean();
+				console.log("录音停止，最终音频Base64：", base64?.substring(0, 50) + "...");
+			},
+		},
+	};
+</script>
+
+<style scoped>
+	.container {
+		padding: 20rpx;
+	}
+
+	button {
+		margin: 10rpx 0;
+		padding: 15rpx 30rpx;
+		background: #007aff;
+		color: white;
+		border: none;
+		border-radius: 8rpx;
+	}
+
+	button:disabled {
+		background: #ccc;
+	}
+
+	.tip {
+		margin: 15rpx 0;
+		font-size: 28rpx;
+		color: #333;
+	}
+</style>
@@ -7,7 +7,7 @@
 		<yao-RecordFrame ref="recordFrame" @onFrameRecorded="frameRecorded" @currentDecibels="onCurrentDecibels"
 			@onStop="stopIt">
 		</yao-RecordFrame>
-		<sdx-StreamPlayer>xx</sdx-StreamPlayer>
+		<sdx-StreamPlayer ref="aaa">xx</sdx-StreamPlayer>
 	</view>
 </template>

@@ -23,7 +23,7 @@
 				scriptProcessor: null, // 音频处理节点
 				audioBufferSource: null, // 音频源节点
 				frameBufferList: [], // 缓存音频帧
-				wsUrl: "ws://10.10.10.201:8000/ws/audio", // 替换为实际后端地址
+				wsUrl: "ws://172.16.89.58:8000/ws/audio", // 替换为实际后端地址
 			};
 		},
 		onUnload() {
@@ -80,6 +80,8 @@
 						console.log('web');
 						this.ws.onOpen((res) => {
 							console.log('WebSocket连接已打开', res);
+							
+
 							this.ws.onMessage((res) => {
 								let messageData = res.data;
 								// 处理不同类型的数据
@@ -94,7 +96,7 @@
 								} else if (messageData instanceof ArrayBuffer) {
 									// 二进制数据
 									try {
-										
+										this.$refs.aaa.appendBuffer(messageData)
 										// const str = this.arrayBufferToStringCompat(messageData);
 										// console.log('转换后的字符串:', str);
 										
@@ -142,7 +144,7 @@
 					this.isRecording = false;
 				}
 			},
-
+			
 			// 停止录音
 			onStopRecord() {
 				this.stopRecordAndClean();
@@ -21,22 +21,8 @@
 		},
 		methods: {
 			connect() {
-				// 这里链接socket或者sse,并把接受到的二进制数据不断调用即可, 具体的ws请自行封装
-				// ws = uni.connectSocket({
-				// 	url: 'ws://10.10.10.201:8000/ws/audio',
-				// 	method: 'GET',
-				// 	success() {},
-				// 	fail(e) {
-				// 		console.log(e);
-				// 	}
-				// });
-				// ws.onMessage(arrayBuffer => {
-				// 	console.log('arrayBuffer', arrayBuffer);
-				// 	this.isStreamPlaying = true
-				// 	this.currBuffer= uni.arrayBufferToBase64(arrayBuffer)
-				// })
 				this.ws = uni.connectSocket({
-					url: 'ws://10.10.10.201:8000/ws/audio',
+					url: 'ws://172.16.89.58:8000/ws/audio',
 					complete: () => {
 						console.log('complete');
 					},
@@ -60,10 +46,8 @@
 									this.isStreamPlaying = true
 									this.currBuffer= uni.arrayBufferToBase64(messageData)
 									try {
-										
 										// const str = this.arrayBufferToStringCompat(messageData);
 										// console.log('转换后的字符串:', str);
-										
 									} catch (e) {
 										console.log('二进制数据解析失败:', e);
 									}
@@ -77,6 +61,10 @@
 			},
 			changeStreamPlaying(e) {
 				this.isStreamPlaying = e.type
+			},
+			appendBuffer(messageData) {
+				this.isStreamPlaying = true
+				this.currBuffer= uni.arrayBufferToBase64(messageData)
 			}
 		}
 	}
@@ -99,6 +87,7 @@
 		},
 		methods: {
 			playTTS (base64) {
+				console.log('base64', base64);
 				if(!base64)return
 				const binaryStr = atob(base64)
 				const bytes = new Uint8Array(binaryStr.length)
@@ -30,6 +30,7 @@ export class StreamPlayer {
 	}

 	appendChunk(audioData) {
+		console.log('this.audioQueue', this.audioQueue.length);
 		this.audioQueue.push(audioData);
 		this._processQueue();
 	}
@@ -1,6 +1,5 @@
 <template>
 	<view :options="options" :change:options="record.startRecord" :status="status" :change:status="record.onStop">
-
 	</view>
 </template>
 <script>
@@ -313,7 +313,7 @@ __renderjsModules["5f91482f"] = (() => {
    default: () => stdin_default
  });

-  // F:/aistream-test/测试流式传输uniapp/uni_modules/sdx-StreamPlayer/plugins/StreamPlayer.js
+  // C:/Users/1/Desktop/testAudio/测试流式传输uniapp/uni_modules/sdx-StreamPlayer/plugins/StreamPlayer.js
  var StreamPlayer = class {
    constructor({
      inputSampleRate = 16e3,
@@ -343,6 +343,7 @@ __renderjsModules["5f91482f"] = (() => {
      this.callback = callback;
    }
    appendChunk(audioData) {
+      console.log("this.audioQueue", this.audioQueue.length);
      this.audioQueue.push(audioData);
      this._processQueue();
    }
@@ -496,6 +497,7 @@ __renderjsModules["5f91482f"] = (() => {
    },
    methods: {
      playTTS(base64) {
+        console.log("base64", base64);
        if (!base64)
          return;
        const binaryStr = atob(base64);
@@ -121,7 +121,7 @@ if (uni.restoreGlobal) {
  }
  if (typeof block0$1 === "function")
    block0$1(_sfc_main$3);
-  const __easycom_0 = /* @__PURE__ */ _export_sfc(_sfc_main$3, [["render", _sfc_render$2], ["__file", "F:/aistream-test/测试流式传输uniapp/uni_modules/yao-RecordFrame/components/yao-RecordFrame/yao-RecordFrame.vue"]]);
+  const __easycom_0 = /* @__PURE__ */ _export_sfc(_sfc_main$3, [["render", _sfc_render$2], ["__file", "C:/Users/1/Desktop/testAudio/测试流式传输uniapp/uni_modules/yao-RecordFrame/components/yao-RecordFrame/yao-RecordFrame.vue"]]);
  const block0 = (Comp) => {
    (Comp.$renderjs || (Comp.$renderjs = [])).push("renderJS");
    (Comp.$renderjsModules || (Comp.$renderjsModules = {}))["renderJS"] = "5f91482f";
@@ -137,14 +137,14 @@ if (uni.restoreGlobal) {
    methods: {
      connect() {
        this.ws = uni.connectSocket({
-          url: "ws://10.10.10.201:8000/ws/audio",
+          url: "ws://172.16.89.58:8000/ws/audio",
          complete: () => {
-            formatAppLog("log", "at uni_modules/sdx-StreamPlayer/components/sdx-StreamPlayer/sdx-StreamPlayer.vue:41", "complete");
+            formatAppLog("log", "at uni_modules/sdx-StreamPlayer/components/sdx-StreamPlayer/sdx-StreamPlayer.vue:27", "complete");
          },
          success: () => {
-            formatAppLog("log", "at uni_modules/sdx-StreamPlayer/components/sdx-StreamPlayer/sdx-StreamPlayer.vue:44", "web");
+            formatAppLog("log", "at uni_modules/sdx-StreamPlayer/components/sdx-StreamPlayer/sdx-StreamPlayer.vue:30", "web");
            this.ws.onOpen((res) => {
-              formatAppLog("log", "at uni_modules/sdx-StreamPlayer/components/sdx-StreamPlayer/sdx-StreamPlayer.vue:46", "WebSocket连接已打开", res);
+              formatAppLog("log", "at uni_modules/sdx-StreamPlayer/components/sdx-StreamPlayer/sdx-StreamPlayer.vue:32", "WebSocket连接已打开", res);
              this.ws.onMessage((res2) => {
                let messageData = res2.data;
                if (typeof messageData === "string") {
@@ -168,6 +168,10 @@ if (uni.restoreGlobal) {
      },
      changeStreamPlaying(e) {
        this.isStreamPlaying = e.type;
+      },
+      appendBuffer(messageData) {
+        this.isStreamPlaying = true;
+        this.currBuffer = uni.arrayBufferToBase64(messageData);
      }
    }
  };
@@ -200,7 +204,7 @@ if (uni.restoreGlobal) {
  }
  if (typeof block0 === "function")
    block0(_sfc_main$2);
-  const __easycom_1 = /* @__PURE__ */ _export_sfc(_sfc_main$2, [["render", _sfc_render$1], ["__file", "F:/aistream-test/测试流式传输uniapp/uni_modules/sdx-StreamPlayer/components/sdx-StreamPlayer/sdx-StreamPlayer.vue"]]);
+  const __easycom_1 = /* @__PURE__ */ _export_sfc(_sfc_main$2, [["render", _sfc_render$1], ["__file", "C:/Users/1/Desktop/testAudio/测试流式传输uniapp/uni_modules/sdx-StreamPlayer/components/sdx-StreamPlayer/sdx-StreamPlayer.vue"]]);
  const _sfc_main$1 = {
    data() {
      return {
@@ -217,7 +221,7 @@ if (uni.restoreGlobal) {
        // 音频源节点
        frameBufferList: [],
        // 缓存音频帧
-        wsUrl: "ws://10.10.10.201:8000/ws/audio"
+        wsUrl: "ws://172.16.89.58:8000/ws/audio"
        // 替换为实际后端地址
      };
    },
@@ -275,12 +279,18 @@ if (uni.restoreGlobal) {
                  } catch (e) {
                    this.handleMessage(messageData);
                  }
+                } else if (messageData instanceof ArrayBuffer) {
+                  try {
+                    this.$refs.aaa.appendBuffer(messageData);
+                  } catch (e) {
+                    formatAppLog("log", "at pages/index/index.vue:104", "二进制数据解析失败:", e);
+                  }
                }
              });
            });
          },
          fail: () => {
-            formatAppLog("log", "at pages/index/index.vue:109", "fail");
+            formatAppLog("log", "at pages/index/index.vue:111", "fail");
          }
        });
        try {
@@ -303,7 +313,7 @@ if (uni.restoreGlobal) {
          this.isRecording = true;
          this.status = "录音中...";
        } catch (e) {
-          formatAppLog("error", "at pages/index/index.vue:140", "启动录音失败：", e);
+          formatAppLog("error", "at pages/index/index.vue:142", "启动录音失败：", e);
          this.status = "启动录音失败";
          this.isRecording = false;
        }
@@ -342,7 +352,7 @@ if (uni.restoreGlobal) {
              data: frameBuffer
            });
          } catch (e) {
-            formatAppLog("error", "at pages/index/index.vue:192", "发送音频帧失败：", e);
+            formatAppLog("error", "at pages/index/index.vue:194", "发送音频帧失败：", e);
          }
        }
      },
@@ -352,7 +362,7 @@ if (uni.restoreGlobal) {
      // 录音停止回调
      stopIt(base64) {
        this.stopRecordAndClean();
-        formatAppLog("log", "at pages/index/index.vue:208", "录音停止，最终音频Base64：", (base64 == null ? void 0 : base64.substring(0, 50)) + "...");
+        formatAppLog("log", "at pages/index/index.vue:210", "录音停止，最终音频Base64：", (base64 == null ? void 0 : base64.substring(0, 50)) + "...");
      }
    }
  };
@@ -388,16 +398,22 @@ if (uni.restoreGlobal) {
        onCurrentDecibels: $options.onCurrentDecibels,
        onOnStop: $options.stopIt
      }, null, 8, ["onOnFrameRecorded", "onCurrentDecibels", "onOnStop"]),
-      vue.createVNode(_component_sdx_StreamPlayer, null, {
-        default: vue.withCtx(() => [
-          vue.createTextVNode("xx")
-        ]),
-        _: 1
-        /* STABLE */
-      })
+      vue.createVNode(
+        _component_sdx_StreamPlayer,
+        { ref: "aaa" },
+        {
+          default: vue.withCtx(() => [
+            vue.createTextVNode("xx")
+          ]),
+          _: 1
+          /* STABLE */
+        },
+        512
+        /* NEED_PATCH */
+      )
    ]);
  }
-  const PagesIndexIndex = /* @__PURE__ */ _export_sfc(_sfc_main$1, [["render", _sfc_render], ["__scopeId", "data-v-1cf27b2a"], ["__file", "F:/aistream-test/测试流式传输uniapp/pages/index/index.vue"]]);
+  const PagesIndexIndex = /* @__PURE__ */ _export_sfc(_sfc_main$1, [["render", _sfc_render], ["__scopeId", "data-v-1cf27b2a"], ["__file", "C:/Users/1/Desktop/testAudio/测试流式传输uniapp/pages/index/index.vue"]]);
  __definePage("pages/index/index", PagesIndexIndex);
  const _sfc_main = {
    onLaunch: function() {
@@ -410,7 +426,7 @@ if (uni.restoreGlobal) {
      formatAppLog("log", "at App.vue:10", "App Hide");
    }
  };
-  const App = /* @__PURE__ */ _export_sfc(_sfc_main, [["__file", "F:/aistream-test/测试流式传输uniapp/App.vue"]]);
+  const App = /* @__PURE__ */ _export_sfc(_sfc_main, [["__file", "C:/Users/1/Desktop/testAudio/测试流式传输uniapp/App.vue"]]);
  function createApp() {
    const app = vue.createVueApp(App);
    return {