@0xkaleab/sdk-js 0.2.7

package/dist/cjs/codegen/utf8.js

@@ -0,0 +1,142 @@
+// @ts-nocheck
+/* eslint-disable */
+/**
+* This file and any referenced files were automatically generated by @hyperweb/telescope@2.0.3
+* DO NOT MODIFY BY HAND. Instead, download the latest proto files for your chain
+* and run the transpile command or npm scripts command that is used to regenerate this bundle.
+*/
+// Copyright (c) 2016, Daniel Wirtz  All rights reserved.
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+// * Redistributions of source code must retain the above copyright
+//   notice, this list of conditions and the following disclaimer.
+// * Redistributions in binary form must reproduce the above copyright
+//   notice, this list of conditions and the following disclaimer in the
+//   documentation and/or other materials provided with the distribution.
+// * Neither the name of its author, nor the names of its contributors
+//   may be used to endorse or promote products derived from this software
+//   without specific prior written permission.
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.utf8Length = utf8Length;
+exports.utf8Read = utf8Read;
+exports.utf8Write = utf8Write;
+/**
+ * Calculates the UTF8 byte length of a string.
+ * @param {string} string String
+ * @returns {number} Byte length
+ */
+function utf8Length(str) {
+    let len = 0, c = 0;
+    for (let i = 0; i < str.length; ++i) {
+        c = str.charCodeAt(i);
+        if (c < 128)
+            len += 1;
+        else if (c < 2048)
+            len += 2;
+        else if ((c & 0xfc00) === 0xd800 &&
+            (str.charCodeAt(i + 1) & 0xfc00) === 0xdc00) {
+            ++i;
+            len += 4;
+        }
+        else
+            len += 3;
+    }
+    return len;
+}
+/**
+ * Reads UTF8 bytes as a string.
+ * @param {Uint8Array} buffer Source buffer
+ * @param {number} start Source start
+ * @param {number} end Source end
+ * @returns {string} String read
+ */
+function utf8Read(buffer, start, end) {
+    const len = end - start;
+    if (len < 1)
+        return "";
+    const chunk = [];
+    let parts = [], i = 0, // char offset
+    t; // temporary
+    while (start < end) {
+        t = buffer[start++];
+        if (t < 128)
+            chunk[i++] = t;
+        else if (t > 191 && t < 224)
+            chunk[i++] = ((t & 31) << 6) | (buffer[start++] & 63);
+        else if (t > 239 && t < 365) {
+            t =
+                (((t & 7) << 18) |
+                    ((buffer[start++] & 63) << 12) |
+                    ((buffer[start++] & 63) << 6) |
+                    (buffer[start++] & 63)) -
+                    0x10000;
+            chunk[i++] = 0xd800 + (t >> 10);
+            chunk[i++] = 0xdc00 + (t & 1023);
+        }
+        else
+            chunk[i++] =
+                ((t & 15) << 12) |
+                    ((buffer[start++] & 63) << 6) |
+                    (buffer[start++] & 63);
+        if (i > 8191) {
+            (parts || (parts = [])).push(String.fromCharCode(...chunk));
+            i = 0;
+        }
+    }
+    if (parts) {
+        if (i)
+            parts.push(String.fromCharCode(...chunk.slice(0, i)));
+        return parts.join("");
+    }
+    return String.fromCharCode(...chunk.slice(0, i));
+}
+/**
+ * Writes a string as UTF8 bytes.
+ * @param {string} string Source string
+ * @param {Uint8Array} buffer Destination buffer
+ * @param {number} offset Destination offset
+ * @returns {number} Bytes written
+ */
+function utf8Write(str, buffer, offset) {
+    const start = offset;
+    let c1, // character 1
+    c2; // character 2
+    for (let i = 0; i < str.length; ++i) {
+        c1 = str.charCodeAt(i);
+        if (c1 < 128) {
+            buffer[offset++] = c1;
+        }
+        else if (c1 < 2048) {
+            buffer[offset++] = (c1 >> 6) | 192;
+            buffer[offset++] = (c1 & 63) | 128;
+        }
+        else if ((c1 & 0xfc00) === 0xd800 &&
+            ((c2 = str.charCodeAt(i + 1)) & 0xfc00) === 0xdc00) {
+            c1 = 0x10000 + ((c1 & 0x03ff) << 10) + (c2 & 0x03ff);
+            ++i;
+            buffer[offset++] = (c1 >> 18) | 240;
+            buffer[offset++] = ((c1 >> 12) & 63) | 128;
+            buffer[offset++] = ((c1 >> 6) & 63) | 128;
+            buffer[offset++] = (c1 & 63) | 128;
+        }
+        else {
+            buffer[offset++] = (c1 >> 12) | 224;
+            buffer[offset++] = ((c1 >> 6) & 63) | 128;
+            buffer[offset++] = (c1 & 63) | 128;
+        }
+    }
+    return offset - start;
+}

package/dist/cjs/codegen/varint.js

@@ -0,0 +1,427 @@
+"use strict";
+// @ts-nocheck
+/* eslint-disable */
+/**
+* This file and any referenced files were automatically generated by @hyperweb/telescope@2.0.3
+* DO NOT MODIFY BY HAND. Instead, download the latest proto files for your chain
+* and run the transpile command or npm scripts command that is used to regenerate this bundle.
+*/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.varint64read = varint64read;
+exports.varint64write = varint64write;
+exports.int64FromString = int64FromString;
+exports.int64ToString = int64ToString;
+exports.uInt64ToString = uInt64ToString;
+exports.varint32write = varint32write;
+exports.varint32read = varint32read;
+exports.zzEncode = zzEncode;
+exports.zzDecode = zzDecode;
+exports.readUInt32 = readUInt32;
+exports.readInt32 = readInt32;
+exports.writeVarint32 = writeVarint32;
+exports.writeVarint64 = writeVarint64;
+exports.int64Length = int64Length;
+exports.writeFixed32 = writeFixed32;
+exports.writeByte = writeByte;
+// Copyright 2008 Google Inc.  All rights reserved.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+// * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+// * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following disclaimer
+// in the documentation and/or other materials provided with the
+// distribution.
+// * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived from
+// this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+// Code generated by the Protocol Buffer compiler is owned by the owner
+// of the input file used when generating it.  This code is not
+// standalone and requires a support library to be linked with it.  This
+// support library is itself covered by the above license.
+/* eslint-disable prefer-const,@typescript-eslint/restrict-plus-operands */
+/**
+ * Read a 64 bit varint as two JS numbers.
+ *
+ * Returns tuple:
+ * [0]: low bits
+ * [1]: high bits
+ *
+ * Copyright 2008 Google Inc.  All rights reserved.
+ *
+ * See https://github.com/protocolbuffers/protobuf/blob/8a71927d74a4ce34efe2d8769fda198f52d20d12/js/experimental/runtime/kernel/buffer_decoder.js#L175
+ */
+function varint64read() {
+    let lowBits = 0;
+    let highBits = 0;
+    for (let shift = 0; shift < 28; shift += 7) {
+        let b = this.buf[this.pos++];
+        lowBits |= (b & 0x7f) << shift;
+        if ((b & 0x80) == 0) {
+            this.assertBounds();
+            return [lowBits, highBits];
+        }
+    }
+    let middleByte = this.buf[this.pos++];
+    // last four bits of the first 32 bit number
+    lowBits |= (middleByte & 0x0f) << 28;
+    // 3 upper bits are part of the next 32 bit number
+    highBits = (middleByte & 0x70) >> 4;
+    if ((middleByte & 0x80) == 0) {
+        this.assertBounds();
+        return [lowBits, highBits];
+    }
+    for (let shift = 3; shift <= 31; shift += 7) {
+        let b = this.buf[this.pos++];
+        highBits |= (b & 0x7f) << shift;
+        if ((b & 0x80) == 0) {
+            this.assertBounds();
+            return [lowBits, highBits];
+        }
+    }
+    throw new Error("invalid varint");
+}
+/**
+ * Write a 64 bit varint, given as two JS numbers, to the given bytes array.
+ *
+ * Copyright 2008 Google Inc.  All rights reserved.
+ *
+ * See https://github.com/protocolbuffers/protobuf/blob/8a71927d74a4ce34efe2d8769fda198f52d20d12/js/experimental/runtime/kernel/writer.js#L344
+ */
+function varint64write(lo, hi, bytes) {
+    for (let i = 0; i < 28; i = i + 7) {
+        const shift = lo >>> i;
+        const hasNext = !(shift >>> 7 == 0 && hi == 0);
+        const byte = (hasNext ? shift | 0x80 : shift) & 0xff;
+        bytes.push(byte);
+        if (!hasNext) {
+            return;
+        }
+    }
+    const splitBits = ((lo >>> 28) & 0x0f) | ((hi & 0x07) << 4);
+    const hasMoreBits = !(hi >> 3 == 0);
+    bytes.push((hasMoreBits ? splitBits | 0x80 : splitBits) & 0xff);
+    if (!hasMoreBits) {
+        return;
+    }
+    for (let i = 3; i < 31; i = i + 7) {
+        const shift = hi >>> i;
+        const hasNext = !(shift >>> 7 == 0);
+        const byte = (hasNext ? shift | 0x80 : shift) & 0xff;
+        bytes.push(byte);
+        if (!hasNext) {
+            return;
+        }
+    }
+    bytes.push((hi >>> 31) & 0x01);
+}
+// constants for binary math
+const TWO_PWR_32_DBL = 0x100000000;
+/**
+ * Parse decimal string of 64 bit integer value as two JS numbers.
+ *
+ * Copyright 2008 Google Inc.  All rights reserved.
+ *
+ * See https://github.com/protocolbuffers/protobuf-javascript/blob/a428c58273abad07c66071d9753bc4d1289de426/experimental/runtime/int64.js#L10
+ */
+function int64FromString(dec) {
+    // Check for minus sign.
+    const minus = dec[0] === "-";
+    if (minus) {
+        dec = dec.slice(1);
+    }
+    // Work 6 decimal digits at a time, acting like we're converting base 1e6
+    // digits to binary. This is safe to do with floating point math because
+    // Number.isSafeInteger(ALL_32_BITS * 1e6) == true.
+    const base = 1e6;
+    let lowBits = 0;
+    let highBits = 0;
+    function add1e6digit(begin, end) {
+        // Note: Number('') is 0.
+        const digit1e6 = Number(dec.slice(begin, end));
+        highBits *= base;
+        lowBits = lowBits * base + digit1e6;
+        // Carry bits from lowBits to
+        if (lowBits >= TWO_PWR_32_DBL) {
+            highBits = highBits + ((lowBits / TWO_PWR_32_DBL) | 0);
+            lowBits = lowBits % TWO_PWR_32_DBL;
+        }
+    }
+    add1e6digit(-24, -18);
+    add1e6digit(-18, -12);
+    add1e6digit(-12, -6);
+    add1e6digit(-6);
+    return minus ? negate(lowBits, highBits) : newBits(lowBits, highBits);
+}
+/**
+ * Losslessly converts a 64-bit signed integer in 32:32 split representation
+ * into a decimal string.
+ *
+ * Copyright 2008 Google Inc.  All rights reserved.
+ *
+ * See https://github.com/protocolbuffers/protobuf-javascript/blob/a428c58273abad07c66071d9753bc4d1289de426/experimental/runtime/int64.js#L10
+ */
+function int64ToString(lo, hi) {
+    let bits = newBits(lo, hi);
+    // If we're treating the input as a signed value and the high bit is set, do
+    // a manual two's complement conversion before the decimal conversion.
+    const negative = bits.hi & 0x80000000;
+    if (negative) {
+        bits = negate(bits.lo, bits.hi);
+    }
+    const result = uInt64ToString(bits.lo, bits.hi);
+    return negative ? "-" + result : result;
+}
+/**
+ * Losslessly converts a 64-bit unsigned integer in 32:32 split representation
+ * into a decimal string.
+ *
+ * Copyright 2008 Google Inc.  All rights reserved.
+ *
+ * See https://github.com/protocolbuffers/protobuf-javascript/blob/a428c58273abad07c66071d9753bc4d1289de426/experimental/runtime/int64.js#L10
+ */
+function uInt64ToString(lo, hi) {
+    ({ lo, hi } = toUnsigned(lo, hi));
+    // Skip the expensive conversion if the number is small enough to use the
+    // built-in conversions.
+    // Number.MAX_SAFE_INTEGER = 0x001FFFFF FFFFFFFF, thus any number with
+    // highBits <= 0x1FFFFF can be safely expressed with a number and retain
+    // integer precision.
+    // Proven by: Number.isSafeInteger(0x1FFFFF * 2**32 + 0xFFFFFFFF) == true.
+    if (hi <= 0x1fffff) {
+        return String(TWO_PWR_32_DBL * hi + lo);
+    }
+    // What this code is doing is essentially converting the input number from
+    // base-2 to base-1e7, which allows us to represent the 64-bit range with
+    // only 3 (very large) digits. Those digits are then trivial to convert to
+    // a base-10 string.
+    // The magic numbers used here are -
+    // 2^24 = 16777216 = (1,6777216) in base-1e7.
+    // 2^48 = 281474976710656 = (2,8147497,6710656) in base-1e7.
+    // Split 32:32 representation into 16:24:24 representation so our
+    // intermediate digits don't overflow.
+    const low = lo & 0xffffff;
+    const mid = ((lo >>> 24) | (hi << 8)) & 0xffffff;
+    const high = (hi >> 16) & 0xffff;
+    // Assemble our three base-1e7 digits, ignoring carries. The maximum
+    // value in a digit at this step is representable as a 48-bit integer, which
+    // can be stored in a 64-bit floating point number.
+    let digitA = low + mid * 6777216 + high * 6710656;
+    let digitB = mid + high * 8147497;
+    let digitC = high * 2;
+    // Apply carries from A to B and from B to C.
+    const base = 10000000;
+    if (digitA >= base) {
+        digitB += Math.floor(digitA / base);
+        digitA %= base;
+    }
+    if (digitB >= base) {
+        digitC += Math.floor(digitB / base);
+        digitB %= base;
+    }
+    // If digitC is 0, then we should have returned in the trivial code path
+    // at the top for non-safe integers. Given this, we can assume both digitB
+    // and digitA need leading zeros.
+    return (digitC.toString() +
+        decimalFrom1e7WithLeadingZeros(digitB) +
+        decimalFrom1e7WithLeadingZeros(digitA));
+}
+function toUnsigned(lo, hi) {
+    return { lo: lo >>> 0, hi: hi >>> 0 };
+}
+function newBits(lo, hi) {
+    return { lo: lo | 0, hi: hi | 0 };
+}
+/**
+ * Returns two's compliment negation of input.
+ * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Bitwise_Operators#Signed_32-bit_integers
+ */
+function negate(lowBits, highBits) {
+    highBits = ~highBits;
+    if (lowBits) {
+        lowBits = ~lowBits + 1;
+    }
+    else {
+        // If lowBits is 0, then bitwise-not is 0xFFFFFFFF,
+        // adding 1 to that, results in 0x100000000, which leaves
+        // the low bits 0x0 and simply adds one to the high bits.
+        highBits += 1;
+    }
+    return newBits(lowBits, highBits);
+}
+/**
+ * Returns decimal representation of digit1e7 with leading zeros.
+ */
+const decimalFrom1e7WithLeadingZeros = (digit1e7) => {
+    const partial = String(digit1e7);
+    return "0000000".slice(partial.length) + partial;
+};
+/**
+ * Write a 32 bit varint, signed or unsigned. Same as `varint64write(0, value, bytes)`
+ *
+ * Copyright 2008 Google Inc.  All rights reserved.
+ *
+ * See https://github.com/protocolbuffers/protobuf/blob/1b18833f4f2a2f681f4e4a25cdf3b0a43115ec26/js/binary/encoder.js#L144
+ */
+function varint32write(value, bytes) {
+    if (value >= 0) {
+        // write value as varint 32
+        while (value > 0x7f) {
+            bytes.push((value & 0x7f) | 0x80);
+            value = value >>> 7;
+        }
+        bytes.push(value);
+    }
+    else {
+        for (let i = 0; i < 9; i++) {
+            bytes.push((value & 127) | 128);
+            value = value >> 7;
+        }
+        bytes.push(1);
+    }
+}
+/**
+ * Read an unsigned 32 bit varint.
+ *
+ * See https://github.com/protocolbuffers/protobuf/blob/8a71927d74a4ce34efe2d8769fda198f52d20d12/js/experimental/runtime/kernel/buffer_decoder.js#L220
+ */
+function varint32read() {
+    let b = this.buf[this.pos++];
+    let result = b & 0x7f;
+    if ((b & 0x80) == 0) {
+        this.assertBounds();
+        return result;
+    }
+    b = this.buf[this.pos++];
+    result |= (b & 0x7f) << 7;
+    if ((b & 0x80) == 0) {
+        this.assertBounds();
+        return result;
+    }
+    b = this.buf[this.pos++];
+    result |= (b & 0x7f) << 14;
+    if ((b & 0x80) == 0) {
+        this.assertBounds();
+        return result;
+    }
+    b = this.buf[this.pos++];
+    result |= (b & 0x7f) << 21;
+    if ((b & 0x80) == 0) {
+        this.assertBounds();
+        return result;
+    }
+    // Extract only last 4 bits
+    b = this.buf[this.pos++];
+    result |= (b & 0x0f) << 28;
+    for (let readBytes = 5; (b & 0x80) !== 0 && readBytes < 10; readBytes++)
+        b = this.buf[this.pos++];
+    if ((b & 0x80) != 0)
+        throw new Error("invalid varint");
+    this.assertBounds();
+    // Result can have 32 bits, convert it to unsigned
+    return result >>> 0;
+}
+/**
+ * encode zig zag
+ */
+function zzEncode(lo, hi) {
+    let mask = hi >> 31;
+    hi = (((hi << 1) | (lo >>> 31)) ^ mask) >>> 0;
+    lo = ((lo << 1) ^ mask) >>> 0;
+    return [lo, hi];
+}
+/**
+ * decode zig zag
+ */
+function zzDecode(lo, hi) {
+    let mask = -(lo & 1);
+    lo = (((lo >>> 1) | (hi << 31)) ^ mask) >>> 0;
+    hi = ((hi >>> 1) ^ mask) >>> 0;
+    return [lo, hi];
+}
+/**
+ * unsigned int32 without moving pos.
+ */
+function readUInt32(buf, pos) {
+    return ((buf[pos] | (buf[pos + 1] << 8) | (buf[pos + 2] << 16)) +
+        buf[pos + 3] * 0x1000000);
+}
+/**
+ * signed int32 without moving pos.
+ */
+function readInt32(buf, pos) {
+    return ((buf[pos] | (buf[pos + 1] << 8) | (buf[pos + 2] << 16)) +
+        (buf[pos + 3] << 24));
+}
+/**
+ * writing varint32 to pos
+ */
+function writeVarint32(val, buf, pos) {
+    while (val > 127) {
+        buf[pos++] = (val & 127) | 128;
+        val >>>= 7;
+    }
+    buf[pos] = val;
+}
+/**
+ * writing varint64 to pos
+ */
+function writeVarint64(val, buf, pos) {
+    while (val.hi) {
+        buf[pos++] = (val.lo & 127) | 128;
+        val.lo = ((val.lo >>> 7) | (val.hi << 25)) >>> 0;
+        val.hi >>>= 7;
+    }
+    while (val.lo > 127) {
+        buf[pos++] = (val.lo & 127) | 128;
+        val.lo = val.lo >>> 7;
+    }
+    buf[pos++] = val.lo;
+}
+function int64Length(lo, hi) {
+    let part0 = lo, part1 = ((lo >>> 28) | (hi << 4)) >>> 0, part2 = hi >>> 24;
+    return part2 === 0
+        ? part1 === 0
+            ? part0 < 16384
+                ? part0 < 128
+                    ? 1
+                    : 2
+                : part0 < 2097152
+                    ? 3
+                    : 4
+            : part1 < 16384
+                ? part1 < 128
+                    ? 5
+                    : 6
+                : part1 < 2097152
+                    ? 7
+                    : 8
+        : part2 < 128
+            ? 9
+            : 10;
+}
+function writeFixed32(val, buf, pos) {
+    buf[pos] = val & 255;
+    buf[pos + 1] = (val >>> 8) & 255;
+    buf[pos + 2] = (val >>> 16) & 255;
+    buf[pos + 3] = val >>> 24;
+}
+function writeByte(val, buf, pos) {
+    buf[pos] = val & 255;
+}

package/dist/cjs/compat/blake3.browser.js

@@ -0,0 +1,20 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createHash = createHash;
+const browser_async_1 = require("blake3/browser-async");
+const blake3_js_bg_wasm_url_1 = require("blake3/dist/wasm/web/blake3_js_bg.wasm?url");
+let blake3Instance = null;
+let wasmLoaded = null;
+async function ensureLoaded() {
+    if (!wasmLoaded) {
+        wasmLoaded = (async () => {
+            // Load WASM by passing the fetched WASM binary to the loader
+            blake3Instance = await (0, browser_async_1.default)(fetch(blake3_js_bg_wasm_url_1.default));
+        })();
+    }
+    await wasmLoaded;
+}
+async function createHash() {
+    await ensureLoaded();
+    return blake3Instance.createHash();
+}

package/dist/cjs/compat/blake3.node.js

@@ -0,0 +1,5 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createHash = void 0;
+var blake3_1 = require("blake3");
+Object.defineProperty(exports, "createHash", { enumerable: true, get: function () { return blake3_1.createHash; } });

package/dist/cjs/compat/zstd.browser.js

@@ -0,0 +1,38 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.compress = compress;
+const toUint8 = (data) => {
+    if (data instanceof Uint8Array)
+        return data;
+    if (data instanceof ArrayBuffer)
+        return new Uint8Array(data);
+    return new Uint8Array(data.buffer, data.byteOffset, data.byteLength);
+};
+// We lazy-load and init @bokuweb/zstd-wasm because it needs to fetch/instantiate WASM.
+let bokuReady = null;
+async function ensureBokuwebLoaded() {
+    if (!bokuReady) {
+        bokuReady = (async () => {
+            // Let the package choose the right browser entry and wasm asset.
+            const zstd = (await Promise.resolve().then(() => require('@bokuweb/zstd-wasm')));
+            if (typeof zstd.init === 'function') {
+                // In bundler environments, init() without a path resolves the wasm internally.
+                await zstd.init();
+            }
+            if (typeof zstd.compress !== 'function') {
+                throw new Error('@bokuweb/zstd-wasm does not expose compress()');
+            }
+            return (input, level = 3) => new Uint8Array(zstd.compress(input, level));
+        })();
+    }
+    return bokuReady;
+}
+/**
+ * Compress bytes at the given zstd level (default 3).
+ * Returns a new Uint8Array containing the compressed payload.
+ */
+async function compress(data, level = 3) {
+    const inputBytes = toUint8(data);
+    const compressor = await ensureBokuwebLoaded();
+    return compressor(inputBytes, level);
+}

package/dist/cjs/compat/zstd.node.js

@@ -0,0 +1,12 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.compress = compress;
+const zstd_1 = require("@mongodb-js/zstd");
+async function compress(data, level = 3) {
+    const view = data instanceof ArrayBuffer ? new Uint8Array(data) :
+        data instanceof Uint8Array ? data :
+            new Uint8Array(data.buffer, data.byteOffset, data.byteLength);
+    const buffer = Buffer.from(view);
+    const out = await (0, zstd_1.compress)(buffer, level);
+    return new Uint8Array(out);
+}