@pezkuwi/wasm-util 7.5.9 → 7.5.10

package/fflate.js

@@ -0,0 +1,304 @@
+const u8 = Uint8Array, u16 = Uint16Array, u32 = Uint32Array;
+const clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);
+const fleb = new u8([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, /* unused */ 0, 0, /* impossible */ 0]);
+const fdeb = new u8([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, /* unused */ 0, 0]);
+const freb = (eb, start) => {
+    const b = new u16(31);
+    for (let i = 0; i < 31; ++i) {
+        b[i] = start += 1 << eb[i - 1];
+    }
+    // numbers here are at max 18 bits
+    const r = new u32(b[30]);
+    for (let i = 1; i < 30; ++i) {
+        for (let j = b[i]; j < b[i + 1]; ++j) {
+            r[j] = ((j - b[i]) << 5) | i;
+        }
+    }
+    return [b, r];
+};
+const [fl, revfl] = freb(fleb, 2);
+fl[28] = 258, revfl[258] = 28;
+const [fd] = freb(fdeb, 0);
+const rev = new u16(32768);
+for (let i = 0; i < 32768; ++i) {
+    // reverse table algorithm from SO
+    let x = ((i & 0xAAAA) >>> 1) | ((i & 0x5555) << 1);
+    x = ((x & 0xCCCC) >>> 2) | ((x & 0x3333) << 2);
+    x = ((x & 0xF0F0) >>> 4) | ((x & 0x0F0F) << 4);
+    rev[i] = (((x & 0xFF00) >>> 8) | ((x & 0x00FF) << 8)) >>> 1;
+}
+const hMap = ((cd, mb, r) => {
+    const s = cd.length;
+    // index
+    let i = 0;
+    // u16 "map": index -> # of codes with bit length = index
+    const l = new u16(mb);
+    // length of cd must be 288 (total # of codes)
+    for (; i < s; ++i) {
+        if (cd[i])
+            ++l[cd[i] - 1];
+    }
+    // u16 "map": index -> minimum code for bit length = index
+    const le = new u16(mb);
+    for (i = 1; i < mb; ++i) {
+        le[i] = (le[i - 1] + l[i - 1]) << 1;
+    }
+    let co;
+    if (r) {
+        // u16 "map": index -> number of actual bits, symbol for code
+        co = new u16(1 << mb);
+        // bits to remove for reverser
+        const rvb = 15 - mb;
+        for (i = 0; i < s; ++i) {
+            // ignore 0 lengths
+            if (cd[i]) {
+                // num encoding both symbol and bits read
+                const sv = (i << 4) | cd[i];
+                // free bits
+                const r = mb - cd[i];
+                // start value
+                let v = le[cd[i] - 1]++ << r;
+                // m is end value
+                for (const m = v | ((1 << r) - 1); v <= m; ++v) {
+                    // every 16 bit value starting with the code yields the same result
+                    co[rev[v] >> rvb] = sv;
+                }
+            }
+        }
+    }
+    else {
+        co = new u16(s);
+        for (i = 0; i < s; ++i) {
+            if (cd[i]) {
+                co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);
+            }
+        }
+    }
+    return co;
+});
+const flt = new u8(288);
+for (let i = 0; i < 144; ++i)
+    flt[i] = 8;
+for (let i = 144; i < 256; ++i)
+    flt[i] = 9;
+for (let i = 256; i < 280; ++i)
+    flt[i] = 7;
+for (let i = 280; i < 288; ++i)
+    flt[i] = 8;
+const fdt = new u8(32);
+for (let i = 0; i < 32; ++i)
+    fdt[i] = 5;
+const flrm = hMap(flt, 9, 1);
+const fdrm = hMap(fdt, 5, 1);
+const bits = (d, p, m) => {
+    const o = p >>> 3;
+    return ((d[o] | (d[o + 1] << 8)) >>> (p & 7)) & m;
+};
+const bits16 = (d, p) => {
+    const o = p >>> 3;
+    return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >>> (p & 7));
+};
+const shft = (p) => (p >>> 3) + (p & 7 && 1);
+const slc = (v, s, e) => {
+    if (s == null || s < 0)
+        s = 0;
+    if (e == null || e > v.length)
+        e = v.length;
+    // can't use .constructor in case user-supplied
+    const n = new (v instanceof u16 ? u16 : v instanceof u32 ? u32 : u8)(e - s);
+    n.set(v.subarray(s, e));
+    return n;
+};
+const max = (a) => {
+    let m = a[0];
+    for (let i = 1, count = a.length; i < count; ++i) {
+        if (a[i] > m)
+            m = a[i];
+    }
+    return m;
+};
+const inflt = (dat, buf, st) => {
+    const noSt = !st || st.i;
+    if (!st)
+        st = {};
+    // source length
+    const sl = dat.length;
+    // have to estimate size
+    const noBuf = !buf || !noSt;
+    // Assumes roughly 33% compression ratio average
+    if (!buf)
+        buf = new u8(sl * 3);
+    // ensure buffer can fit at least l elements
+    const cbuf = (l) => {
+        let bl = buf.length;
+        // need to increase size to fit
+        if (l > bl) {
+            // Double or set to necessary, whichever is greater
+            const nbuf = new u8(Math.max(bl << 1, l));
+            nbuf.set(buf);
+            buf = nbuf;
+        }
+    };
+    //  last chunk         bitpos           bytes
+    let final = st.f || 0, pos = st.p || 0, bt = st.b || 0, lm = st.l, dm = st.d, lbt = st.m, dbt = st.n;
+    if (final && !lm)
+        return buf;
+    // total bits
+    const tbts = sl << 3;
+    do {
+        if (!lm) {
+            // BFINAL - this is only 1 when last chunk is next
+            st.f = final = bits(dat, pos, 1);
+            // type: 0 = no compression, 1 = fixed huffman, 2 = dynamic huffman
+            const type = bits(dat, pos + 1, 3);
+            pos += 3;
+            if (!type) {
+                // go to end of byte boundary
+                const s = shft(pos) + 4, l = dat[s - 4] | (dat[s - 3] << 8), t = s + l;
+                if (t > sl) {
+                    if (noSt)
+                        throw 'unexpected EOF';
+                    break;
+                }
+                // ensure size
+                if (noBuf)
+                    cbuf(bt + l);
+                // Copy over uncompressed data
+                buf.set(dat.subarray(s, t), bt);
+                // Get new bitpos, update byte count
+                st.b = bt += l, st.p = pos = t << 3;
+                continue;
+            }
+            else if (type == 1)
+                lm = flrm, dm = fdrm, lbt = 9, dbt = 5;
+            else if (type == 2) {
+                //  literal                            lengths
+                const hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;
+                const tl = hLit + bits(dat, pos + 5, 31) + 1;
+                pos += 14;
+                // length+distance tree
+                const ldt = new u8(tl);
+                // code length tree
+                const clt = new u8(19);
+                for (let i = 0; i < hcLen; ++i) {
+                    // use index map to get real code
+                    clt[clim[i]] = bits(dat, pos + i * 3, 7);
+                }
+                pos += hcLen * 3;
+                // code lengths bits
+                const clb = max(clt), clbmsk = (1 << clb) - 1;
+                if (!noSt && pos + tl * (clb + 7) > tbts)
+                    break;
+                // code lengths map
+                const clm = hMap(clt, clb, 1);
+                for (let i = 0; i < tl;) {
+                    const r = clm[bits(dat, pos, clbmsk)];
+                    // bits read
+                    pos += r & 15;
+                    // symbol
+                    const s = r >>> 4;
+                    // code length to copy
+                    if (s < 16) {
+                        ldt[i++] = s;
+                    }
+                    else {
+                        //  copy   count
+                        let c = 0, n = 0;
+                        if (s == 16)
+                            n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];
+                        else if (s == 17)
+                            n = 3 + bits(dat, pos, 7), pos += 3;
+                        else if (s == 18)
+                            n = 11 + bits(dat, pos, 127), pos += 7;
+                        while (n--)
+                            ldt[i++] = c;
+                    }
+                }
+                //    length tree                 distance tree
+                const lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);
+                // max length bits
+                lbt = max(lt);
+                // max dist bits
+                dbt = max(dt);
+                lm = hMap(lt, lbt, 1);
+                dm = hMap(dt, dbt, 1);
+            }
+            else
+                throw 'invalid block type';
+            if (pos > tbts)
+                throw 'unexpected EOF';
+        }
+        // Make sure the buffer can hold this + the largest possible addition
+        // maximum chunk size (practically, theoretically infinite) is 2^17;
+        if (noBuf)
+            cbuf(bt + 131072);
+        const lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;
+        const mxa = lbt + dbt + 18;
+        while (noSt || pos + mxa < tbts) {
+            // bits read, code
+            const c = lm[bits16(dat, pos) & lms], sym = c >>> 4;
+            pos += c & 15;
+            if (pos > tbts)
+                throw 'unexpected EOF';
+            if (!c)
+                throw 'invalid length/literal';
+            if (sym < 256)
+                buf[bt++] = sym;
+            else if (sym == 256) {
+                lm = undefined;
+                break;
+            }
+            else {
+                let add = sym - 254;
+                // no extra bits needed if less
+                if (sym > 264) {
+                    // index
+                    const i = sym - 257, b = fleb[i];
+                    add = bits(dat, pos, (1 << b) - 1) + fl[i];
+                    pos += b;
+                }
+                // dist
+                const d = dm[bits16(dat, pos) & dms], dsym = d >>> 4;
+                if (!d)
+                    throw 'invalid distance';
+                pos += d & 15;
+                let dt = fd[dsym];
+                if (dsym > 3) {
+                    const b = fdeb[dsym];
+                    dt += bits16(dat, pos) & ((1 << b) - 1), pos += b;
+                }
+                if (pos > tbts)
+                    throw 'unexpected EOF';
+                if (noBuf)
+                    cbuf(bt + 131072);
+                const end = bt + add;
+                for (; bt < end; bt += 4) {
+                    buf[bt] = buf[bt - dt];
+                    buf[bt + 1] = buf[bt + 1 - dt];
+                    buf[bt + 2] = buf[bt + 2 - dt];
+                    buf[bt + 3] = buf[bt + 3 - dt];
+                }
+                bt = end;
+            }
+        }
+        st.l = lm, st.p = pos, st.b = bt;
+        if (lm)
+            final = 1, st.m = lbt, st.d = dm, st.n = dbt;
+    } while (!final);
+    return bt == buf.length ? buf : slc(buf, 0, bt);
+};
+const zlv = (d) => {
+    if ((d[0] & 15) != 8 || (d[0] >>> 4) > 7 || ((d[0] << 8 | d[1]) % 31))
+        throw 'invalid zlib data';
+    if (d[1] & 32)
+        throw 'invalid zlib data: preset dictionaries not supported';
+};
+/**
+ * Expands Zlib data
+ * @param data The data to decompress
+ * @param out Where to write the data. Saves memory if you know the decompressed size and provide an output buffer of that length.
+ * @returns The decompressed version of the data
+ */
+export function unzlibSync(data, out) {
+    return inflt((zlv(data), data.subarray(2, -4)), out);
+}

package/index.d.ts

@@ -0,0 +1,2 @@
+import './packageDetect.js';
+export * from './bundle.js';

package/index.js

@@ -0,0 +1,2 @@
+import './packageDetect.js';
+export * from './bundle.js';

package/package.json

@@ -15,17 +15,122 @@
   },
   "sideEffects": [
     "./packageDetect.js",
-    "./packageDetect.cjs"
+    "./cjs/packageDetect.js"
   ],
   "type": "module",
-  "version": "7.5.9",
-  "main": "index.js",
+  "version": "7.5.10",
+  "main": "./cjs/index.js",
+  "module": "./index.js",
+  "types": "./index.d.ts",
+  "exports": {
+    "./cjs/package.json": "./cjs/package.json",
+    "./cjs/*": "./cjs/*.js",
+    ".": {
+      "module": {
+        "types": "./index.d.ts",
+        "default": "./index.js"
+      },
+      "require": {
+        "types": "./cjs/index.d.ts",
+        "default": "./cjs/index.js"
+      },
+      "default": {
+        "types": "./index.d.ts",
+        "default": "./index.js"
+      }
+    },
+    "./base64": {
+      "module": {
+        "types": "./base64.d.ts",
+        "default": "./base64.js"
+      },
+      "require": {
+        "types": "./cjs/base64.d.ts",
+        "default": "./cjs/base64.js"
+      },
+      "default": {
+        "types": "./base64.d.ts",
+        "default": "./base64.js"
+      }
+    },
+    "./bundle": {
+      "module": {
+        "types": "./bundle.d.ts",
+        "default": "./bundle.js"
+      },
+      "require": {
+        "types": "./cjs/bundle.d.ts",
+        "default": "./cjs/bundle.js"
+      },
+      "default": {
+        "types": "./bundle.d.ts",
+        "default": "./bundle.js"
+      }
+    },
+    "./fflate": {
+      "module": {
+        "types": "./fflate.d.ts",
+        "default": "./fflate.js"
+      },
+      "require": {
+        "types": "./cjs/fflate.d.ts",
+        "default": "./cjs/fflate.js"
+      },
+      "default": {
+        "types": "./fflate.d.ts",
+        "default": "./fflate.js"
+      }
+    },
+    "./package.json": {
+      "require": "./cjs/package.json",
+      "default": "./package.json"
+    },
+    "./packageDetect": {
+      "module": {
+        "types": "./packageDetect.d.ts",
+        "default": "./packageDetect.js"
+      },
+      "require": {
+        "types": "./cjs/packageDetect.d.ts",
+        "default": "./cjs/packageDetect.js"
+      },
+      "default": {
+        "types": "./packageDetect.d.ts",
+        "default": "./packageDetect.js"
+      }
+    },
+    "./packageInfo.js": {
+      "module": {
+        "types": "./packageInfo.d.ts",
+        "default": "./packageInfo.js"
+      },
+      "require": {
+        "types": "./cjs/packageInfo.d.ts",
+        "default": "./cjs/packageInfo.js"
+      },
+      "default": {
+        "types": "./packageInfo.d.ts",
+        "default": "./packageInfo.js"
+      }
+    },
+    "./packageInfo": {
+      "module": {
+        "types": "./packageInfo.d.ts",
+        "default": "./packageInfo.js"
+      },
+      "require": {
+        "types": "./cjs/packageInfo.d.ts",
+        "default": "./cjs/packageInfo.js"
+      },
+      "default": {
+        "types": "./packageInfo.d.ts",
+        "default": "./packageInfo.js"
+      }
+    }
+  },
   "dependencies": {
     "tslib": "^2.7.0"
   },
-  "devDependencies": {
-    "@pezkuwi/util": "^14.0.1"
-  },
   "peerDependencies": {
     "@pezkuwi/util": "*"
   }

package/packageDetect.d.ts

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

package/packageDetect.js

@@ -0,0 +1,3 @@
+import { detectPackage } from '@pezkuwi/util';
+import { packageInfo } from './packageInfo.js';
+detectPackage(packageInfo, null, []);

package/packageInfo.d.ts

@@ -0,0 +1,6 @@
+export declare const packageInfo: {
+    name: string;
+    path: string;
+    type: string;
+    version: string;
+};

package/packageInfo.js

@@ -0,0 +1 @@
+export const packageInfo = { name: '@pezkuwi/wasm-util', path: (import.meta && import.meta.url) ? new URL(import.meta.url).pathname.substring(0, new URL(import.meta.url).pathname.lastIndexOf('/') + 1) : 'auto', type: 'esm', version: '7.5.10' };

package/src/base64.spec.ts

@@ -1,46 +0,0 @@
-// Copyright 2019-2026 @pezkuwi/wasm-util authors & contributors
-// SPDX-License-Identifier: Apache-2.0
-
-/// <reference types="@pezkuwi/dev-test/globals.d.ts" />
-
-import { base64Decode } from './base64.js';
-
-const TESTS = [
-  {
-    // hello world Приветствую ми 你好
-    base64: 'aGVsbG8gd29ybGQg0J/RgNC40LLQtdGC0YHRgtCy0YPRjiDQvNC4IOS9oOWlvQ==',
-    output: new Uint8Array([104, 101, 108, 108, 111, 32, 119, 111, 114, 108, 100, 32, 208, 159, 209, 128, 208, 184, 208, 178, 208, 181, 209, 130, 209, 129, 209, 130, 208, 178, 209, 131, 209, 142, 32, 208, 188, 208, 184, 32, 228, 189, 160, 229, 165, 189])
-  },
-  {
-    // ✓ à la mode
-    base64: '4pyTIMOgIGxhIG1vZGU=',
-    output: new Uint8Array([226, 156, 147, 32, 195, 160, 32, 108, 97, 32, 109, 111, 100, 101])
-  },
-  {
-    // Hello World!
-    base64: 'SGVsbG8gV29ybGQh',
-    output: new Uint8Array([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33])
-  },
-  {
-    base64: 'AA==',
-    output: new Uint8Array([0])
-  },
-  {
-    base64: 'AAA=',
-    output: new Uint8Array([0, 0])
-  },
-  {
-    base64: 'AAAA',
-    output: new Uint8Array([0, 0, 0])
-  }
-];
-
-describe('base64Decode', (): void => {
-  for (const { base64, output } of TESTS) {
-    it(`decodes ${base64}`, (): void => {
-      expect(
-        base64Decode(base64, new Uint8Array(output.length))
-      ).toEqual(output);
-    });
-  }
-});

package/src/base64.ts

@@ -1,43 +0,0 @@
-// Copyright 2019-2026 @pezkuwi/wasm-util authors & contributors
-// SPDX-License-Identifier: Apache-2.0
-
-// Use an array for our indexer - this is faster than using map access. In
-// this case we assume ASCII-only inputs, so we cannot overflow the array
-const CHR = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/' as const;
-const map = new Array<number>(256);
-
-// We use charCodeAt for access here and in the decoder loop - this is faster
-// on lookups (array + numbers) and also faster than accessing the specific
-// character via data[i]
-for (let i = 0, count = CHR.length; i < count; i++) {
-  map[CHR.charCodeAt(i)] = i;
-}
-
-/**
- * @name base64Decode
- * @description
- * A base64 decoding function that operates in all environments. Unlike decoding
- * from Buffer (Node.js only) or atob (browser-only) this implementation is
- * slightly slower, but it is platform independent.
- *
- * For our usage, since we have access to the static final size, so we decode
- * to a specified output buffer. This also means we have applied a number of
- * optimizations based on this - checking output position instead of chars.
- */
-export function base64Decode (data: string, out: Uint8Array): Uint8Array {
-  let byte = 0;
-  let bits = 0;
-  let pos = -1;
-
-  for (let i = 0, last = out.length - 1; pos !== last; i++) {
-    // each character represents 6 bits
-    byte = (byte << 6) | map[data.charCodeAt(i)];
-
-    // each byte needs to contain 8 bits
-    if ((bits += 6) >= 8) {
-      out[++pos] = (byte >>> (bits -= 8)) & 0xff;
-    }
-  }
-
-  return out;
-}