unzipit 1.4.3 → 2.0.1

package/README.md

@@ -4,18 +4,20 @@
 
 Random access unzip library for browser and node based JavaScript
 
-[![Build Status](https://travis-ci.org/greggman/unzipit.svg?branch=master)](https://travis-ci.org/greggman/unzipit)
+[![Build and Deploy](https://github.com/greggman/unzipit/actions/workflows/build_and_deploy.yml/badge.svg)](https://github.com/greggman/unzipit/actions/workflows/build_and_deploy.yml)
 [[Live Tests](https://greggman.github.io/unzipit/test/)]
 
-* Less than 8k gzipped without workers, Less than 13k with.
+* Less than 5k gzipped without workers, Less than 6k with.
 * [6x to 25x faster than JSZip](https://jsperf.com/jszip-vs-unzipit/4) without workers and even faster with
 * Uses far less memory.
 * Can [avoid downloading the entire zip file](#Streaming) if the server supports http range requests.
 
 # How to use
 
-Live Example: [https://jsfiddle.net/greggman/awez4sd7/](https://jsfiddle.net/greggman/awez4sd7/)
-Live Parallel Example: [https://jsfiddle.net/greggman/cgdjm07f/](https://jsfiddle.net/greggman/cgdjm07f/)
+* Live Example: [https://jsfiddle.net/greggman/awez4sd7/](https://jsfiddle.net/greggman/awez4sd7/)
+* Live Parallel Example: [https://jsfiddle.net/greggman/cgdjm07f/](https://jsfiddle.net/greggman/cgdjm07f/)
+* Live User File Example: [https://jsfiddle.net/greggman/s2qe7m6b/](https://jsfiddle.net/greggman/s2qe7m6b/)
+* Live User Drag and Drop Example: [https://jsfiddle.net/greggman/oxnhpmL8/](https://jsfiddle.net/greggman/oxnhpmL8/)
 
 ## without workers
 
@@ -277,6 +279,7 @@ entries.forEach(entry => {
 Some libraries both zip and unzip.
 IMO those should be separate libraries as there is little if any code to share between
 both. Plenty of projects only need to do one or the other.
+[Here's the sister library for zip](https://greggman.github.io/zipup/).
 
 Similarly inflate and deflate libraries should be separate from zip, unzip libraries.
 You need one or the other not both. See zlib as an example.
@@ -334,6 +337,9 @@ manages them. They don't count as part of the JavaScript heap.
 In node, the examples with the file readers will only read the header and whatever entries' contents
 you ask for so similarly you can avoid having everything in memory except the things you read.
 
+# Zip Creation
+
+see: [zipup](https://greggman.github.io/zipup/)
 
 # API
 
@@ -448,6 +454,10 @@ to exit since it will wait for the workers to exit.
 
 Use a transpiler like [Babel](https://babeljs.io).
 
+As of version 2 the library uses `DecompressionStream` which is built into node
+since v18 and [in browsers for a while](https://caniuse.com/mdn-api_decompressionstream). For older
+browsers there is [a polyfill](https://github.com/101arrowz/compression-streams-polyfill).
+
 ## Caching
 
 If you ask for the same entry twice it will be read twice and decompressed twice.
@@ -599,7 +609,6 @@ Follow the instructions on testing but add  `?timeout=0` to the URL as in `http:
 # Acknowledgements
 
 * The code is **heavily** based on [yauzl](https://github.com/thejoshwolfe/yauzl)
-* The code uses the es6 module version of [uzip.js](https://www.npmjs.com/package/uzip-module)
 
 # Licence
 

package/dist/ArrayBufferReader.d.ts

@@ -0,0 +1,7 @@
+import type { Reader } from './BlobReader.js';
+export default class ArrayBufferReader implements Reader {
+    private typedArray;
+    constructor(arrayBufferOrView: ArrayBuffer | SharedArrayBuffer | ArrayBufferView);
+    getLength(): Promise<number>;
+    read(offset: number, length: number): Promise<Uint8Array<ArrayBuffer>>;
+}

package/dist/BlobReader.d.ts

@@ -0,0 +1,12 @@
+export interface Reader {
+    getLength(): Promise<number>;
+    read(offset: number, size: number): Promise<Uint8Array<ArrayBuffer>>;
+    sliceAsBlob?(offset: number, length: number, type?: string): Promise<Blob>;
+}
+export default class BlobReader implements Reader {
+    private blob;
+    constructor(blob: Blob);
+    getLength(): Promise<number>;
+    read(offset: number, length: number): Promise<Uint8Array<ArrayBuffer>>;
+    sliceAsBlob(offset: number, length: number, type?: string): Promise<Blob>;
+}

package/dist/HTTPRangeReader.d.ts

@@ -0,0 +1,8 @@
+import type { Reader } from './BlobReader.js';
+export declare class HTTPRangeReader implements Reader {
+    private url;
+    private length;
+    constructor(url: string);
+    getLength(): Promise<number>;
+    read(offset: number, size: number): Promise<Uint8Array<ArrayBuffer>>;
+}

package/dist/inflate-worker.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/inflate.d.ts

@@ -0,0 +1,8 @@
+export interface UnzipitOptions {
+    useWorkers?: boolean;
+    workerURL?: string;
+    numWorkers?: number;
+}
+export declare function setOptions(options: UnzipitOptions): void;
+export declare function inflateRawAsync(src: Uint8Array<ArrayBuffer> | Blob, uncompressedSize: number, type?: string): Promise<ArrayBuffer | Blob>;
+export declare function cleanup(): Promise<void>;

package/dist/unzipit-worker.js

@@ -1,329 +1,41 @@
-/* unzipit@1.4.3, license MIT */
+/* unzipit@2.0.1, license MIT */
 (function (factory) {
   typeof define === 'function' && define.amd ? define(factory) :
   factory();
-}((function () { 'use strict';
-
-  function inflate(data, buf) {
-  	var u8=Uint8Array;
-  	if(data[0]==3 && data[1]==0) return (buf ? buf : new u8(0));
-  	var bitsF = _bitsF, bitsE = _bitsE, decodeTiny = _decodeTiny, get17 = _get17;
-  	
-  	var noBuf = (buf==null);
-  	if(noBuf) buf = new u8((data.length>>>2)<<3);
-  	
-  	var BFINAL=0, BTYPE=0, HLIT=0, HDIST=0, HCLEN=0, ML=0, MD=0; 	
-  	var off = 0, pos = 0;
-  	var lmap, dmap;
-  	
-  	while(BFINAL==0) {		
-  		BFINAL = bitsF(data, pos  , 1);
-  		BTYPE  = bitsF(data, pos+1, 2);  pos+=3;
-  		//console.log(BFINAL, BTYPE);
-  		
-  		if(BTYPE==0) {
-  			if((pos&7)!=0) pos+=8-(pos&7);
-  			var p8 = (pos>>>3)+4, len = data[p8-4]|(data[p8-3]<<8);  //console.log(len);//bitsF(data, pos, 16), 
-  			if(noBuf) buf=_check(buf, off+len);
-  			buf.set(new u8(data.buffer, data.byteOffset+p8, len), off);
-  			//for(var i=0; i<len; i++) buf[off+i] = data[p8+i];
-  			//for(var i=0; i<len; i++) if(buf[off+i] != data[p8+i]) throw "e";
-  			pos = ((p8+len)<<3);  off+=len;  continue;
-  		}
-  		if(noBuf) buf=_check(buf, off+(1<<17));  // really not enough in many cases (but PNG and ZIP provide buffer in advance)
-  		if(BTYPE==1) {  lmap = U.flmap;  dmap = U.fdmap;  ML = (1<<9)-1;  MD = (1<<5)-1;   }
-  		if(BTYPE==2) {
-  			HLIT  = bitsE(data, pos   , 5)+257;  
-  			HDIST = bitsE(data, pos+ 5, 5)+  1;  
-  			HCLEN = bitsE(data, pos+10, 4)+  4;  pos+=14;
-  			for(var i=0; i<38; i+=2) {  U.itree[i]=0;  U.itree[i+1]=0;  }
-  			var tl = 1;
-  			for(var i=0; i<HCLEN; i++) {  var l=bitsE(data, pos+i*3, 3);  U.itree[(U.ordr[i]<<1)+1] = l;  if(l>tl)tl=l;  }     pos+=3*HCLEN;  //console.log(itree);
-  			makeCodes(U.itree, tl);
-  			codes2map(U.itree, tl, U.imap);
-  			
-  			lmap = U.lmap;  dmap = U.dmap;
-  			
-  			pos = decodeTiny(U.imap, (1<<tl)-1, HLIT+HDIST, data, pos, U.ttree);
-  			var mx0 = _copyOut(U.ttree,    0, HLIT , U.ltree);  ML = (1<<mx0)-1;
-  			var mx1 = _copyOut(U.ttree, HLIT, HDIST, U.dtree);  MD = (1<<mx1)-1;
-  			
-  			//var ml = decodeTiny(U.imap, (1<<tl)-1, HLIT , data, pos, U.ltree); ML = (1<<(ml>>>24))-1;  pos+=(ml&0xffffff);
-  			makeCodes(U.ltree, mx0);
-  			codes2map(U.ltree, mx0, lmap);
-  			
-  			//var md = decodeTiny(U.imap, (1<<tl)-1, HDIST, data, pos, U.dtree); MD = (1<<(md>>>24))-1;  pos+=(md&0xffffff);
-  			makeCodes(U.dtree, mx1);
-  			codes2map(U.dtree, mx1, dmap);
-  		}
-  		//var ooff=off, opos=pos;
-  		while(true) {
-  			var code = lmap[get17(data, pos) & ML];  pos += code&15;
-  			var lit = code>>>4;  //U.lhst[lit]++;  
-  			if((lit>>>8)==0) {  buf[off++] = lit;  }
-  			else if(lit==256) {  break;  }
-  			else {
-  				var end = off+lit-254;
-  				if(lit>264) { var ebs = U.ldef[lit-257];  end = off + (ebs>>>3) + bitsE(data, pos, ebs&7);  pos += ebs&7;  }
-  				//dst[end-off]++;
-  				
-  				var dcode = dmap[get17(data, pos) & MD];  pos += dcode&15;
-  				var dlit = dcode>>>4;
-  				var dbs = U.ddef[dlit], dst = (dbs>>>4) + bitsF(data, pos, dbs&15);  pos += dbs&15;
-  				
-  				//var o0 = off-dst, stp = Math.min(end-off, dst);
-  				//if(stp>20) while(off<end) {  buf.copyWithin(off, o0, o0+stp);  off+=stp;  }  else
-  				//if(end-dst<=off) buf.copyWithin(off, off-dst, end-dst);  else
-  				//if(dst==1) buf.fill(buf[off-1], off, end);  else
-  				if(noBuf) buf=_check(buf, off+(1<<17));
-  				while(off<end) {  buf[off]=buf[off++-dst];    buf[off]=buf[off++-dst];  buf[off]=buf[off++-dst];  buf[off]=buf[off++-dst];  }   
-  				off=end;
-  				//while(off!=end) {  buf[off]=buf[off++-dst];  }
-  			}
-  		}
-  		//console.log(off-ooff, (pos-opos)>>>3);
-  	}
-  	//console.log(dst);
-  	//console.log(tlen, dlen, off-tlen+tcnt);
-  	return buf.length==off ? buf : buf.slice(0,off);
-  }
-  function _check(buf, len) {
-  	var bl=buf.length;  if(len<=bl) return buf;
-  	var nbuf = new Uint8Array(Math.max(bl<<1,len));  nbuf.set(buf,0);
-  	//for(var i=0; i<bl; i+=4) {  nbuf[i]=buf[i];  nbuf[i+1]=buf[i+1];  nbuf[i+2]=buf[i+2];  nbuf[i+3]=buf[i+3];  }
-  	return nbuf;
-  }
-
-  function _decodeTiny(lmap, LL, len, data, pos, tree) {
-  	var bitsE = _bitsE, get17 = _get17;
-  	var i = 0;
-  	while(i<len) {
-  		var code = lmap[get17(data, pos)&LL];  pos+=code&15;
-  		var lit = code>>>4; 
-  		if(lit<=15) {  tree[i]=lit;  i++;  }
-  		else {
-  			var ll = 0, n = 0;
-  			if(lit==16) {
-  				n = (3  + bitsE(data, pos, 2));  pos += 2;  ll = tree[i-1];
-  			}
-  			else if(lit==17) {
-  				n = (3  + bitsE(data, pos, 3));  pos += 3;
-  			}
-  			else if(lit==18) {
-  				n = (11 + bitsE(data, pos, 7));  pos += 7;
-  			}
-  			var ni = i+n;
-  			while(i<ni) {  tree[i]=ll;  i++; }
-  		}
-  	}
-  	return pos;
-  }
-  function _copyOut(src, off, len, tree) {
-  	var mx=0, i=0, tl=tree.length>>>1;
-  	while(i<len) {  var v=src[i+off];  tree[(i<<1)]=0;  tree[(i<<1)+1]=v;  if(v>mx)mx=v;  i++;  }
-  	while(i<tl ) {  tree[(i<<1)]=0;  tree[(i<<1)+1]=0;  i++;  }
-  	return mx;
-  }
-
-  function makeCodes(tree, MAX_BITS) {  // code, length
-  	var max_code = tree.length;
-  	var code, bits, n, i, len;
-  	
-  	var bl_count = U.bl_count;  for(var i=0; i<=MAX_BITS; i++) bl_count[i]=0;
-  	for(i=1; i<max_code; i+=2) bl_count[tree[i]]++;
-  	
-  	var next_code = U.next_code;	// smallest code for each length
-  	
-  	code = 0;
-  	bl_count[0] = 0;
-  	for (bits = 1; bits <= MAX_BITS; bits++) {
-  		code = (code + bl_count[bits-1]) << 1;
-  		next_code[bits] = code;
-  	}
-  	
-  	for (n = 0; n < max_code; n+=2) {
-  		len = tree[n+1];
-  		if (len != 0) {
-  			tree[n] = next_code[len];
-  			next_code[len]++;
-  		}
-  	}
-  }
-  function codes2map(tree, MAX_BITS, map) {
-  	var max_code = tree.length;
-  	var r15 = U.rev15;
-  	for(var i=0; i<max_code; i+=2) if(tree[i+1]!=0)  {
-  		var lit = i>>1;
-  		var cl = tree[i+1], val = (lit<<4)|cl; // :  (0x8000 | (U.of0[lit-257]<<7) | (U.exb[lit-257]<<4) | cl);
-  		var rest = (MAX_BITS-cl), i0 = tree[i]<<rest, i1 = i0 + (1<<rest);
-  		//tree[i]=r15[i0]>>>(15-MAX_BITS);
-  		while(i0!=i1) {
-  			var p0 = r15[i0]>>>(15-MAX_BITS);
-  			map[p0]=val;  i0++;
-  		}
-  	}
-  }
-  function revCodes(tree, MAX_BITS) {
-  	var r15 = U.rev15, imb = 15-MAX_BITS;
-  	for(var i=0; i<tree.length; i+=2) {  var i0 = (tree[i]<<(MAX_BITS-tree[i+1]));  tree[i] = r15[i0]>>>imb;  }
-  }
-
-  function _bitsE(dt, pos, length) {  return ((dt[pos>>>3] | (dt[(pos>>>3)+1]<<8)                        )>>>(pos&7))&((1<<length)-1);  }
-  function _bitsF(dt, pos, length) {  return ((dt[pos>>>3] | (dt[(pos>>>3)+1]<<8) | (dt[(pos>>>3)+2]<<16))>>>(pos&7))&((1<<length)-1);  }
-  /*
-  function _get9(dt, pos) {
-  	return ((dt[pos>>>3] | (dt[(pos>>>3)+1]<<8))>>>(pos&7))&511;
-  } */
-  function _get17(dt, pos) {	// return at least 17 meaningful bytes
-  	return (dt[pos>>>3] | (dt[(pos>>>3)+1]<<8) | (dt[(pos>>>3)+2]<<16) )>>>(pos&7);
-  }
-  const U = function(){
-  	var u16=Uint16Array, u32=Uint32Array;
-  	return {
-  		next_code : new u16(16),
-  		bl_count  : new u16(16),
-  		ordr : [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ],
-  		of0  : [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,999,999,999],
-  		exb  : [0,0,0,0,0,0,0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4,  4,  5,  5,  5,  5,  0,  0,  0,  0],
-  		ldef : new u16(32),
-  		df0  : [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, 65535, 65535],
-  		dxb  : [0,0,0,0,1,1,2, 2, 3, 3, 4, 4, 5, 5,  6,  6,  7,  7,  8,  8,   9,   9,  10,  10,  11,  11,  12,   12,   13,   13,     0,     0],
-  		ddef : new u32(32),
-  		flmap: new u16(  512),  fltree: [],
-  		fdmap: new u16(   32),  fdtree: [],
-  		lmap : new u16(32768),  ltree : [],  ttree:[],
-  		dmap : new u16(32768),  dtree : [],
-  		imap : new u16(  512),  itree : [],
-  		//rev9 : new u16(  512)
-  		rev15: new u16(1<<15),
-  		lhst : new u32(286), dhst : new u32( 30), ihst : new u32(19),
-  		lits : new u32(15000),
-  		strt : new u16(1<<16),
-  		prev : new u16(1<<15)
-  	};  
-  } ();
-
-  (function(){	
-  	var len = 1<<15;
-  	for(var i=0; i<len; i++) {
-  		var x = i;
-  		x = (((x & 0xaaaaaaaa) >>> 1) | ((x & 0x55555555) << 1));
-  		x = (((x & 0xcccccccc) >>> 2) | ((x & 0x33333333) << 2));
-  		x = (((x & 0xf0f0f0f0) >>> 4) | ((x & 0x0f0f0f0f) << 4));
-  		x = (((x & 0xff00ff00) >>> 8) | ((x & 0x00ff00ff) << 8));
-  		U.rev15[i] = (((x >>> 16) | (x << 16)))>>>17;
-  	}
-  	
-  	function pushV(tgt, n, sv) {  while(n--!=0) tgt.push(0,sv);  }
-  	
-  	for(var i=0; i<32; i++) {  U.ldef[i]=(U.of0[i]<<3)|U.exb[i];  U.ddef[i]=(U.df0[i]<<4)|U.dxb[i];  }
-  	
-  	pushV(U.fltree, 144, 8);  pushV(U.fltree, 255-143, 9);  pushV(U.fltree, 279-255, 7);  pushV(U.fltree,287-279,8);
-  	/*
-  	var i = 0;
-  	for(; i<=143; i++) U.fltree.push(0,8);
-  	for(; i<=255; i++) U.fltree.push(0,9);
-  	for(; i<=279; i++) U.fltree.push(0,7);
-  	for(; i<=287; i++) U.fltree.push(0,8);
-  	*/
-  	makeCodes(U.fltree, 9);
-  	codes2map(U.fltree, 9, U.flmap);
-  	revCodes (U.fltree, 9);
-  	
-  	pushV(U.fdtree,32,5);
-  	//for(i=0;i<32; i++) U.fdtree.push(0,5);
-  	makeCodes(U.fdtree, 5);
-  	codes2map(U.fdtree, 5, U.fdmap);
-  	revCodes (U.fdtree, 5);
-  	
-  	pushV(U.itree,19,0);  pushV(U.ltree,286,0);  pushV(U.dtree,30,0);  pushV(U.ttree,320,0);
-  	/*
-  	for(var i=0; i< 19; i++) U.itree.push(0,0);
-  	for(var i=0; i<286; i++) U.ltree.push(0,0);
-  	for(var i=0; i< 30; i++) U.dtree.push(0,0);
-  	for(var i=0; i<320; i++) U.ttree.push(0,0);
-  	*/
-  })();
-
-  const crc = {
-  	table : ( function() {
-  	   var tab = new Uint32Array(256);
-  	   for (var n=0; n<256; n++) {
-  			var c = n;
-  			for (var k=0; k<8; k++) {
-  				if (c & 1)  c = 0xedb88320 ^ (c >>> 1);
-  				else        c = c >>> 1;
-  			}
-  			tab[n] = c;  }    
-  		return tab;  })(),
-  	update : function(c, buf, off, len) {
-  		for (var i=0; i<len; i++)  c = crc.table[(c ^ buf[off+i]) & 0xff] ^ (c >>> 8);
-  		return c;
-  	},
-  	crc : function(b,o,l)  {  return crc.update(0xffffffff,b,o,l) ^ 0xffffffff;  }
-  };
-
-  function inflateRaw(file, buf) {  return inflate(file, buf);  }
-
-  /* global SharedArrayBuffer, process */
+})((function () { 'use strict';
 
+  var _a, _b;
   function readBlobAsArrayBuffer(blob) {
-    if (blob.arrayBuffer) {
-      return blob.arrayBuffer();
-    }
-    return new Promise((resolve, reject) => {
-      const reader = new FileReader();
-      reader.addEventListener('loadend', () => {
-        resolve(reader.result);
+      if (blob.arrayBuffer) {
+          return blob.arrayBuffer();
+      }
+      return new Promise((resolve, reject) => {
+          const reader = new FileReader();
+          reader.addEventListener('loadend', () => {
+              resolve(reader.result);
+          });
+          reader.addEventListener('error', reject);
+          reader.readAsArrayBuffer(blob);
       });
-      reader.addEventListener('error', reject);
-      reader.readAsArrayBuffer(blob);
-    });
   }
-
   async function readBlobAsUint8Array(blob) {
-    const arrayBuffer = await readBlobAsArrayBuffer(blob);
-    return new Uint8Array(arrayBuffer);
+      const arrayBuffer = await readBlobAsArrayBuffer(blob);
+      return new Uint8Array(arrayBuffer);
   }
-
   function isBlob(v) {
-    return typeof Blob !== 'undefined' && v instanceof Blob;
+      return typeof Blob !== 'undefined' && v instanceof Blob;
   }
+  const isNode = (typeof process !== 'undefined') &&
+      !!(process === null || process === void 0 ? void 0 : process.versions) &&
+      (typeof ((_a = process === null || process === void 0 ? void 0 : process.versions) === null || _a === void 0 ? void 0 : _a.node) !== 'undefined') &&
+      (typeof ((_b = process === null || process === void 0 ? void 0 : process.versions) === null || _b === void 0 ? void 0 : _b.electron) === 'undefined');
 
-  const isNode =
-      (typeof process !== 'undefined') &&
-      process.versions &&
-      (typeof process.versions.node !== 'undefined') &&
-      (typeof process.versions.electron === 'undefined');
-
-  /* global require */
-
+  /* global DecompressionStream */
   // note: we only handle the inflate portion in a worker
   // every other part is already async and JavaScript
   // is non blocking. I suppose if you had a million entry
   // zip file then the loop going through the directory
   // might take time but that's an unlikely situation.
-
-  const msgHelper = (function() {
-    if (isNode) {
-      const { parentPort } = require('worker_threads');
-
-      return {
-        postMessage: parentPort.postMessage.bind(parentPort),
-        addEventListener: parentPort.on.bind(parentPort),
-      };
-    } else {
-      return {
-        postMessage: self.postMessage.bind(self),
-        addEventListener(type, fn) {
-          self.addEventListener(type, (e) => {
-            fn(e.data);
-          });
-        },
-      };
-    }
-  }());
-
   // class InflateRequest {
   //   id: string,
   //   src: ArrayBuffer, SharedArrayBuffer, blob
@@ -335,55 +47,80 @@
   // then 50 blobs will be asked to be read at once.
   // If feels like that should happen at a higher level (user code)
   // or a lower level (the browser)?
-  async function inflate$1(req) {
-    const {id, src, uncompressedSize, type} = req;
-    try {
-      let srcData;
-      if (isBlob(src)) {
-        srcData = await readBlobAsUint8Array(src);
-      } else {
-        srcData = new Uint8Array(src);
+  async function decompressRaw(src) {
+      const ds = new DecompressionStream('deflate-raw');
+      const writer = ds.writable.getWriter();
+      writer.write(src).then(() => writer.close()).catch(() => { });
+      const chunks = [];
+      const reader = ds.readable.getReader();
+      for (;;) {
+          const { done, value } = await reader.read();
+          if (done) {
+              break;
+          }
+          chunks.push(value);
+      }
+      const size = chunks.reduce((s, c) => s + c.byteLength, 0);
+      const result = new Uint8Array(size);
+      let offset = 0;
+      for (const chunk of chunks) {
+          result.set(chunk, offset);
+          offset += chunk.byteLength;
+      }
+      return result;
+  }
+  async function inflate(req, postMessage) {
+      const { id, src, type } = req;
+      try {
+          const srcData = isBlob(src)
+              ? await readBlobAsUint8Array(src)
+              : new Uint8Array(src);
+          const dstData = await decompressRaw(srcData);
+          const transferables = [];
+          let data;
+          if (type) {
+              data = new Blob([dstData], { type });
+          }
+          else {
+              data = dstData.buffer;
+              transferables.push(data);
+          }
+          postMessage({ id, data }, transferables);
       }
-      const dstData = new Uint8Array(uncompressedSize);
-      inflateRaw(srcData, dstData);
-      const transferables = [];
-      let data;
-      if (type) {
-        data = new Blob([dstData], {type});
-      } else {
-        data = dstData.buffer;
-        transferables.push(data);
+      catch (e) {
+          console.error(e);
+          postMessage({ id, error: `${e}` });
       }
-      msgHelper.postMessage({
-        id,
-        data,
-      }, transferables);
-    } catch (e) {
-      console.error(e);
-      msgHelper.postMessage({
-        id,
-        error: `${e.toString()}`,
+  }
+  function handleMessage(msg, postMessage) {
+      const { type, data } = msg;
+      if (type === 'inflate') {
+          inflate(data, postMessage);
+      }
+      else {
+          throw new Error('no handler for type: ' + type);
+      }
+  }
+  if (isNode) {
+      // Use dynamic import so this works in both CJS and ESM contexts.
+      // The import of a built-in resolves before any messages can arrive.
+      const moduleId = 'node:worker_threads';
+      import(moduleId).then(({ parentPort }) => {
+          parentPort.on('message', (msg) => {
+              // eslint-disable-next-line @typescript-eslint/no-explicit-any
+              handleMessage(msg, (m, t) => parentPort.postMessage(m, t));
+          });
       });
-    }
   }
-
-  const handlers = {
-    inflate: inflate$1,
-  };
-
-  msgHelper.addEventListener('message', function(e) {
-    const {type, data} = e;
-    const fn = handlers[type];
-    if (!fn) {
-      throw new Error('no handler for type: ' + type);
-    }
-    fn(data);
-  });
-
-  if (!isNode) {
-    // needed for firefox AFAICT as there so no other
-    // way to know a worker loaded successfully.?
-    msgHelper.postMessage('start');
+  else {
+      // eslint-disable-next-line @typescript-eslint/no-explicit-any
+      const workerSelf = self;
+      workerSelf.addEventListener('message', (e) => {
+          handleMessage(e.data, (m, t) => workerSelf.postMessage(m, t));
+      });
+      // needed for firefox AFAICT as there is no other
+      // way to know a worker loaded successfully.
+      workerSelf.postMessage('start');
   }
 
-})));
+}));

package/dist/unzipit-worker.min.js

@@ -1,12 +1 @@
-/* unzipit@1.4.3, license MIT */
-'use strict';(function(w){"function"===typeof define&&define.amd?define(w):w()})(function(){function w(a,b){var e=a.length;if(b<=e)return a;b=new Uint8Array(Math.max(e<<1,b));b.set(a,0);return b}function X(a,b,e,g){for(var f=0,c=0,m=g.length>>>1;c<e;){var p=a[c+b];g[c<<1]=0;g[(c<<1)+1]=p;p>f&&(f=p);c++}for(;c<m;)g[c<<1]=0,g[(c<<1)+1]=0,c++;return f}function z(a,b){var e=a.length,g,f;var c=d.bl_count;for(f=0;f<=b;f++)c[f]=0;for(f=1;f<e;f+=2)c[a[f]]++;f=d.next_code;var m=0;c[0]=0;for(g=1;g<=b;g++)m=
-m+c[g-1]<<1,f[g]=m;for(b=0;b<e;b+=2)c=a[b+1],0!=c&&(a[b]=f[c],f[c]++)}function A(a,b,e){for(var g=a.length,f=d.rev15,c=0;c<g;c+=2)if(0!=a[c+1]){var m=a[c+1],p=c>>1<<4|m,t=b-m;m=a[c]<<t;for(t=m+(1<<t);m!=t;)e[f[m]>>>15-b]=p,m++}}function Y(a,b){for(var e=d.rev15,g=15-b,f=0;f<a.length;f+=2)a[f]=e[a[f]<<b-a[f+1]]>>>g}function x(a,b,e){return(a[b>>>3]|a[(b>>>3)+1]<<8)>>>(b&7)&(1<<e)-1}function K(a,b,e){return(a[b>>>3]|a[(b>>>3)+1]<<8|a[(b>>>3)+2]<<16)>>>(b&7)&(1<<e)-1}function L(a,b){return(a[b>>>3]|
-a[(b>>>3)+1]<<8|a[(b>>>3)+2]<<16)>>>(b&7)}function fa(a){return a.arrayBuffer?a.arrayBuffer():new Promise((b,e)=>{const g=new FileReader;g.addEventListener("loadend",()=>{b(g.result)});g.addEventListener("error",e);g.readAsArrayBuffer(a)})}async function ha(a){a=await fa(a);return new Uint8Array(a)}const d=function(){var a=Uint16Array,b=Uint32Array;return{next_code:new a(16),bl_count:new a(16),ordr:[16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15],of0:[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,999,999,999],exb:[0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0,0,0,0],ldef:new a(32),df0:[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,65535,65535],dxb:[0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13,0,0],ddef:new b(32),flmap:new a(512),fltree:[],fdmap:new a(32),fdtree:[],lmap:new a(32768),ltree:[],ttree:[],dmap:new a(32768),dtree:[],imap:new a(512),itree:[],
-rev15:new a(32768),lhst:new b(286),dhst:new b(30),ihst:new b(19),lits:new b(15E3),strt:new a(65536),prev:new a(32768)}}();(function(){function a(g,f,c){for(;0!=f--;)g.push(0,c)}for(var b=0;32768>b;b++){var e=b;e=(e&2863311530)>>>1|(e&1431655765)<<1;e=(e&3435973836)>>>2|(e&858993459)<<2;e=(e&4042322160)>>>4|(e&252645135)<<4;e=(e&4278255360)>>>8|(e&16711935)<<8;d.rev15[b]=(e>>>16|e<<16)>>>17}for(b=0;32>b;b++)d.ldef[b]=d.of0[b]<<3|d.exb[b],d.ddef[b]=d.df0[b]<<4|d.dxb[b];a(d.fltree,144,8);a(d.fltree,
-112,9);a(d.fltree,24,7);a(d.fltree,8,8);z(d.fltree,9);A(d.fltree,9,d.flmap);Y(d.fltree,9);a(d.fdtree,32,5);z(d.fdtree,5);A(d.fdtree,5,d.fdmap);Y(d.fdtree,5);a(d.itree,19,0);a(d.ltree,286,0);a(d.dtree,30,0);a(d.ttree,320,0)})();const Z={table:function(){for(var a=new Uint32Array(256),b=0;256>b;b++){for(var e=b,g=0;8>g;g++)e=e&1?3988292384^e>>>1:e>>>1;a[b]=e}return a}(),update:function(a,b,e,g){for(var f=0;f<g;f++)a=Z.table[(a^b[e+f])&255]^a>>>8;return a},crc:function(a,b,e){return Z.update(4294967295,
-a,b,e)^4294967295}},aa="undefined"!==typeof process&&process.versions&&"undefined"!==typeof process.versions.node&&"undefined"===typeof process.versions.electron,B=function(){if(aa){const {parentPort:a}=require("worker_threads");return{postMessage:a.postMessage.bind(a),addEventListener:a.on.bind(a)}}return{postMessage:self.postMessage.bind(self),addEventListener(a,b){self.addEventListener(a,e=>{b(e.data)})}}}(),ka={inflate:async function(a){const {id:b,src:e,uncompressedSize:g,type:f}=a;try{var c=
-"undefined"!==typeof Blob&&e instanceof Blob?await ha(e):new Uint8Array(e);const y=new Uint8Array(g);a=c;c=y;var m=Uint8Array;if(3==a[0]&&0==a[1])c||new m(0);else{var p=null==c;p&&(c=new m(a.length>>>2<<3));for(var t=0,u,C,M,N,O=0,P=0,l=0,h=0,D,E;0==t;)if(t=K(a,h,1),u=K(a,h+1,2),h+=3,0==u){0!=(h&7)&&(h+=8-(h&7));var k=(h>>>3)+4,F=a[k-4]|a[k-3]<<8;p&&(c=w(c,l+F));c.set(new m(a.buffer,a.byteOffset+k,F),l);h=k+F<<3;l+=F}else{p&&(c=w(c,l+131072));1==u&&(D=d.flmap,E=d.fdmap,O=511,P=31);if(2==u){C=x(a,
-h,5)+257;M=x(a,h+5,5)+1;N=x(a,h+10,4)+4;h+=14;for(k=0;38>k;k+=2)d.itree[k]=0,d.itree[k+1]=0;var n=1;for(k=0;k<N;k++){var Q=x(a,h+3*k,3);d.itree[(d.ordr[k]<<1)+1]=Q;Q>n&&(n=Q)}h+=3*N;z(d.itree,n);A(d.itree,n,d.imap);D=d.lmap;E=d.dmap;var ia=d.imap;k=(1<<n)-1;n=C+M;for(var G=a,q=h,R=d.ttree,S=x,ja=L,r=0;r<n;){var ba=ia[ja(G,q)&k];q+=ba&15;var v=ba>>>4;if(15>=v)R[r]=v,r++;else{var ca=0,H=0;16==v?(H=3+S(G,q,2),q+=2,ca=R[r-1]):17==v?(H=3+S(G,q,3),q+=3):18==v&&(H=11+S(G,q,7),q+=7);for(v=r+H;r<v;)R[r]=ca,
-r++}}h=q;var T=X(d.ttree,0,C,d.ltree);O=(1<<T)-1;var U=X(d.ttree,C,M,d.dtree);P=(1<<U)-1;z(d.ltree,T);A(d.ltree,T,D);z(d.dtree,U);A(d.dtree,U,E)}for(;;){var da=D[L(a,h)&O];h+=da&15;k=da>>>4;if(0==k>>>8)c[l++]=k;else if(256==k)break;else{n=l+k-254;if(264<k){var V=d.ldef[k-257];n=l+(V>>>3)+x(a,h,V&7);h+=V&7}var ea=E[L(a,h)&P];h+=ea&15;var W=d.ddef[ea>>>4],I=(W>>>4)+K(a,h,W&15);h+=W&15;for(p&&(c=w(c,l+131072));l<n;)c[l]=c[l++-I],c[l]=c[l++-I],c[l]=c[l++-I],c[l]=c[l++-I];l=n}}}c.length==l||c.slice(0,
-l)}u=[];let J;f?J=new Blob([y],{type:f}):(J=y.buffer,u.push(J));B.postMessage({id:b,data:J},u)}catch(y){console.error(y),B.postMessage({id:b,error:`${y.toString()}`})}}};B.addEventListener("message",function(a){const {type:b,data:e}=a;a=ka[b];if(!a)throw Error("no handler for type: "+b);a(e)});aa||B.postMessage("start")});
+!function(e){"function"==typeof define&&define.amd?define(e):e()}(function(){"use strict";var e,r;async function n(e){const r=await function(e){return e.arrayBuffer?e.arrayBuffer():new Promise((r,n)=>{const t=new FileReader;t.addEventListener("loadend",()=>{r(t.result)}),t.addEventListener("error",n),t.readAsArrayBuffer(e)})}(e);return new Uint8Array(r)}async function t(e,r){const{id:t,src:o,type:s}=e;try{const e=(a=o,"undefined"!=typeof Blob&&a instanceof Blob?await n(o):new Uint8Array(o)),i=await async function(e){const r=new DecompressionStream("deflate-raw"),n=r.writable.getWriter();n.write(e).then(()=>n.close()).catch(()=>{});const t=[],o=r.readable.getReader();for(;;){const{done:e,value:r}=await o.read();if(e)break;t.push(r)}const s=t.reduce((e,r)=>e+r.byteLength,0),a=new Uint8Array(s);let i=0;for(const e of t)a.set(e,i),i+=e.byteLength;return a}(e),d=[];let c;s?c=new Blob([i],{type:s}):(c=i.buffer,d.push(c)),r({id:t,data:c},d)}catch(e){console.error(e),r({id:t,error:`${e}`})}var a}function o(e,r){const{type:n,data:o}=e;if("inflate"!==n)throw new Error("no handler for type: "+n);t(o,r)}if("undefined"!=typeof process&&!!(null===process||void 0===process?void 0:process.versions)&&void 0!==(null===(e=null===process||void 0===process?void 0:process.versions)||void 0===e?void 0:e.node)&&void 0===(null===(r=null===process||void 0===process?void 0:process.versions)||void 0===r?void 0:r.electron)){import("node:worker_threads").then(({parentPort:e})=>{e.on("message",r=>{o(r,(r,n)=>e.postMessage(r,n))})})}else{const e=self;e.addEventListener("message",r=>{o(r.data,(r,n)=>e.postMessage(r,n))}),e.postMessage("start")}});