@uploadista/core 0.0.2 → 0.0.4

package/dist/utils/md5.d.ts

@@ -1,71 +0,0 @@
-type HasherState = {
-    buffer: string;
-    buflen: number;
-    length: number;
-    state: number[];
-};
-export declare class Md5 {
-    /**
-     * Hash a UTF-8 string on the spot
-     * @param str String to hash
-     * @param raw Whether to return the value as an `Int32Array`
-     */
-    static hashStr(str: string, raw?: false): string;
-    static hashStr(str: string, raw: true): Int32Array;
-    /**
-     * Hash a ASCII string on the spot
-     * @param str String to hash
-     * @param raw Whether to return the value as an `Int32Array`
-     */
-    static hashAsciiStr(str: string, raw?: false): string;
-    static hashAsciiStr(str: string, raw: true): Int32Array;
-    private static stateIdentity;
-    private static buffer32Identity;
-    private static hexChars;
-    private static hexOut;
-    private static onePassHasher;
-    private static _hex;
-    private static _md5cycle;
-    private _dataLength;
-    private _bufferLength;
-    private _state;
-    private _buffer;
-    private _buffer8;
-    private _buffer32;
-    constructor();
-    /**
-     * Initialise buffer to be hashed
-     */
-    start(): this;
-    /**
-     * Append a UTF-8 string to the hash buffer
-     * @param str String to append
-     */
-    appendStr(str: string): this;
-    /**
-     * Append an ASCII string to the hash buffer
-     * @param str String to append
-     */
-    appendAsciiStr(str: string): this;
-    /**
-     * Append a byte array to the hash buffer
-     * @param input array to append
-     */
-    appendByteArray(input: Uint8Array): this;
-    /**
-     * Get the state of the hash buffer
-     */
-    getState(): HasherState;
-    /**
-     * Override the current state of the hash buffer
-     * @param state New hash buffer state
-     */
-    setState(state: HasherState): void;
-    /**
-     * Hash the current state of the hash buffer and return the result
-     * @param raw Whether to return the value as an `Int32Array`
-     */
-    end(raw?: boolean): string | Int32Array<ArrayBufferLike> | undefined;
-}
-export {};
-//# sourceMappingURL=md5.d.ts.map

package/dist/utils/md5.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"md5.d.ts","sourceRoot":"","sources":["../../src/utils/md5.ts"],"names":[],"mappings":"AAkDA,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB,CAAC;AAEF,qBAAa,GAAG;IACd;;;;OAIG;WACW,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM;WACzC,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,GAAG,UAAU;IAKzD;;;;OAIG;WACW,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM;WAC9C,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,GAAG,UAAU;IAM9D,OAAO,CAAC,MAAM,CAAC,aAAa,CAEzB;IAEH,OAAO,CAAC,MAAM,CAAC,gBAAgB,CAE5B;IAEH,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAsB;IAC7C,OAAO,CAAC,MAAM,CAAC,MAAM,CAAgB;IAGrC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAa;IAEzC,OAAO,CAAC,MAAM,CAAC,IAAI;IAqBnB,OAAO,CAAC,MAAM,CAAC,SAAS;IAmJxB,OAAO,CAAC,WAAW,CAAK;IACxB,OAAO,CAAC,aAAa,CAAK;IAE1B,OAAO,CAAC,MAAM,CAAiC;IAC/C,OAAO,CAAC,OAAO,CAAoC;IACnD,OAAO,CAAC,QAAQ,CAAa;IAC7B,OAAO,CAAC,SAAS,CAAc;;IAQ/B;;OAEG;IACI,KAAK;IAWZ;;;OAGG;IACI,SAAS,CAAC,GAAG,EAAE,MAAM;IA0C5B;;;OAGG;IACI,cAAc,CAAC,GAAG,EAAE,MAAM;IAuBjC;;;OAGG;IACI,eAAe,CAAC,KAAK,EAAE,UAAU;IAuBxC;;OAEG;IACI,QAAQ,IAAI,WAAW;IAW9B;;;OAGG;IACI,QAAQ,CAAC,KAAK,EAAE,WAAW;IAkBlC;;;OAGG;IACI,GAAG,CAAC,GAAG,UAAQ;CAuCvB"}

package/dist/utils/md5.js

@@ -1,417 +0,0 @@
-/*
-
-TypeScript Md5
-==============
-
-Based on work by
-* Joseph Myers: http://www.myersdaily.org/joseph/javascript/md5-text.html
-* André Cruz: https://github.com/satazor/SparkMD5
-* Raymond Hill: https://github.com/gorhill/yamd5.js
-
-Effectively a TypeScrypt re-write of Raymond Hill JS Library
-
-The MIT License (MIT)
-
-Copyright (C) 2014 Raymond Hill
-
-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.
-
-            DO WHAT YOU WANT TO PUBLIC LICENSE
-                    Version 2, December 2004
-
- Copyright (C) 2015 André Cruz <amdfcruz@gmail.com>
-
- Everyone is permitted to copy and distribute verbatim or modified
- copies of this license document, and changing it is allowed as long
- as the name is changed.
-
-            DO WHAT YOU WANT TO PUBLIC LICENSE
-   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-  0. You just DO WHAT YOU WANT TO.
-
-*/
-export class Md5 {
-    static hashStr(str, raw = false) {
-        return Md5.onePassHasher.start().appendStr(str).end(raw);
-    }
-    static hashAsciiStr(str, raw = false) {
-        return Md5.onePassHasher.start().appendAsciiStr(str).end(raw);
-    }
-    // Private Static Variables
-    static stateIdentity = new Int32Array([
-        1732584193, -271733879, -1732584194, 271733878,
-    ]);
-    static buffer32Identity = new Int32Array([
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-    ]);
-    static hexChars = "0123456789abcdef";
-    static hexOut = [];
-    // Permanent instance is to use for one-call hashing
-    static onePassHasher = new Md5();
-    static _hex(x) {
-        const hc = Md5.hexChars;
-        const ho = Md5.hexOut;
-        let n;
-        let offset;
-        let j;
-        let i;
-        for (i = 0; i < 4; i += 1) {
-            offset = i * 8;
-            n = x[i] ?? 0;
-            for (j = 0; j < 8; j += 2) {
-                ho[offset + 1 + j] = hc.charAt(n & 0x0f);
-                n >>>= 4;
-                ho[offset + 0 + j] = hc.charAt(n & 0x0f);
-                n >>>= 4;
-            }
-        }
-        return ho.join("");
-    }
-    static _md5cycle(x, k) {
-        let a = x[0] ?? 0;
-        let b = x[1] ?? 0;
-        let c = x[2] ?? 0;
-        let d = x[3] ?? 0;
-        // ff()
-        a += (((b & c) | (~b & d)) + (k[0] ?? 0) - 680876936) | 0;
-        a = (((a << 7) | (a >>> 25)) + b) | 0;
-        d += (((a & b) | (~a & c)) + (k[1] ?? 0) - 389564586) | 0;
-        d = (((d << 12) | (d >>> 20)) + a) | 0;
-        c += (((d & a) | (~d & b)) + (k[2] ?? 0) + 606105819) | 0;
-        c = (((c << 17) | (c >>> 15)) + d) | 0;
-        b += (((c & d) | (~c & a)) + (k[3] ?? 0) - 1044525330) | 0;
-        b = (((b << 22) | (b >>> 10)) + c) | 0;
-        a += (((b & c) | (~b & d)) + (k[4] ?? 0) - 176418897) | 0;
-        a = (((a << 7) | (a >>> 25)) + b) | 0;
-        d += (((a & b) | (~a & c)) + (k[5] ?? 0) + 1200080426) | 0;
-        d = (((d << 12) | (d >>> 20)) + a) | 0;
-        c += (((d & a) | (~d & b)) + (k[6] ?? 0) - 1473231341) | 0;
-        c = (((c << 17) | (c >>> 15)) + d) | 0;
-        b += (((c & d) | (~c & a)) + (k[7] ?? 0) - 45705983) | 0;
-        b = (((b << 22) | (b >>> 10)) + c) | 0;
-        a += (((b & c) | (~b & d)) + (k[8] ?? 0) + 1770035416) | 0;
-        a = (((a << 7) | (a >>> 25)) + b) | 0;
-        d += (((a & b) | (~a & c)) + (k[9] ?? 0) - 1958414417) | 0;
-        d = (((d << 12) | (d >>> 20)) + a) | 0;
-        c += (((d & a) | (~d & b)) + (k[10] ?? 0) - 42063) | 0;
-        c = (((c << 17) | (c >>> 15)) + d) | 0;
-        b += (((c & d) | (~c & a)) + (k[11] ?? 0) - 1990404162) | 0;
-        b = (((b << 22) | (b >>> 10)) + c) | 0;
-        a += (((b & c) | (~b & d)) + (k[12] ?? 0) + 1804603682) | 0;
-        a = (((a << 7) | (a >>> 25)) + b) | 0;
-        d += (((a & b) | (~a & c)) + (k[13] ?? 0) - 40341101) | 0;
-        d = (((d << 12) | (d >>> 20)) + a) | 0;
-        c += (((d & a) | (~d & b)) + (k[14] ?? 0) - 1502002290) | 0;
-        c = (((c << 17) | (c >>> 15)) + d) | 0;
-        b += (((c & d) | (~c & a)) + (k[15] ?? 0) + 1236535329) | 0;
-        b = (((b << 22) | (b >>> 10)) + c) | 0;
-        // gg()
-        a += (((b & d) | (c & ~d)) + (k[1] ?? 0) - 165796510) | 0;
-        a = (((a << 5) | (a >>> 27)) + b) | 0;
-        d += (((a & c) | (b & ~c)) + (k[6] ?? 0) - 1069501632) | 0;
-        d = (((d << 9) | (d >>> 23)) + a) | 0;
-        c += (((d & b) | (a & ~b)) + (k[11] ?? 0) + 643717713) | 0;
-        c = (((c << 14) | (c >>> 18)) + d) | 0;
-        b += (((c & a) | (d & ~a)) + (k[0] ?? 0) - 373897302) | 0;
-        b = (((b << 20) | (b >>> 12)) + c) | 0;
-        a += (((b & d) | (c & ~d)) + (k[5] ?? 0) - 701558691) | 0;
-        a = (((a << 5) | (a >>> 27)) + b) | 0;
-        d += (((a & c) | (b & ~c)) + (k[10] ?? 0) + 38016083) | 0;
-        d = (((d << 9) | (d >>> 23)) + a) | 0;
-        c += (((d & b) | (a & ~b)) + (k[15] ?? 0) - 660478335) | 0;
-        c = (((c << 14) | (c >>> 18)) + d) | 0;
-        b += (((c & a) | (d & ~a)) + (k[4] ?? 0) - 405537848) | 0;
-        b = (((b << 20) | (b >>> 12)) + c) | 0;
-        a += (((b & d) | (c & ~d)) + (k[9] ?? 0) + 568446438) | 0;
-        a = (((a << 5) | (a >>> 27)) + b) | 0;
-        d += (((a & c) | (b & ~c)) + (k[14] ?? 0) - 1019803690) | 0;
-        d = (((d << 9) | (d >>> 23)) + a) | 0;
-        c += (((d & b) | (a & ~b)) + (k[3] ?? 0) - 187363961) | 0;
-        c = (((c << 14) | (c >>> 18)) + d) | 0;
-        b += (((c & a) | (d & ~a)) + (k[8] ?? 0) + 1163531501) | 0;
-        b = (((b << 20) | (b >>> 12)) + c) | 0;
-        a += (((b & d) | (c & ~d)) + (k[13] ?? 0) - 1444681467) | 0;
-        a = (((a << 5) | (a >>> 27)) + b) | 0;
-        d += (((a & c) | (b & ~c)) + (k[2] ?? 0) - 51403784) | 0;
-        d = (((d << 9) | (d >>> 23)) + a) | 0;
-        c += (((d & b) | (a & ~b)) + (k[7] ?? 0) + 1735328473) | 0;
-        c = (((c << 14) | (c >>> 18)) + d) | 0;
-        b += (((c & a) | (d & ~a)) + (k[12] ?? 0) - 1926607734) | 0;
-        b = (((b << 20) | (b >>> 12)) + c) | 0;
-        // hh()
-        a += ((b ^ c ^ d) + (k[5] ?? 0) - 378558) | 0;
-        a = (((a << 4) | (a >>> 28)) + b) | 0;
-        d += ((a ^ b ^ c) + (k[8] ?? 0) - 2022574463) | 0;
-        d = (((d << 11) | (d >>> 21)) + a) | 0;
-        c += ((d ^ a ^ b) + (k[11] ?? 0) + 1839030562) | 0;
-        c = (((c << 16) | (c >>> 16)) + d) | 0;
-        b += ((c ^ d ^ a) + (k[14] ?? 0) - 35309556) | 0;
-        b = (((b << 23) | (b >>> 9)) + c) | 0;
-        a += ((b ^ c ^ d) + (k[1] ?? 0) - 1530992060) | 0;
-        a = (((a << 4) | (a >>> 28)) + b) | 0;
-        d += ((a ^ b ^ c) + (k[4] ?? 0) + 1272893353) | 0;
-        d = (((d << 11) | (d >>> 21)) + a) | 0;
-        c += ((d ^ a ^ b) + (k[7] ?? 0) - 155497632) | 0;
-        c = (((c << 16) | (c >>> 16)) + d) | 0;
-        b += ((c ^ d ^ a) + (k[10] ?? 0) - 1094730640) | 0;
-        b = (((b << 23) | (b >>> 9)) + c) | 0;
-        a += ((b ^ c ^ d) + (k[13] ?? 0) + 681279174) | 0;
-        a = (((a << 4) | (a >>> 28)) + b) | 0;
-        d += ((a ^ b ^ c) + (k[0] ?? 0) - 358537222) | 0;
-        d = (((d << 11) | (d >>> 21)) + a) | 0;
-        c += ((d ^ a ^ b) + (k[3] ?? 0) - 722521979) | 0;
-        c = (((c << 16) | (c >>> 16)) + d) | 0;
-        b += ((c ^ d ^ a) + (k[6] ?? 0) + 76029189) | 0;
-        b = (((b << 23) | (b >>> 9)) + c) | 0;
-        a += ((b ^ c ^ d) + (k[9] ?? 0) - 640364487) | 0;
-        a = (((a << 4) | (a >>> 28)) + b) | 0;
-        d += ((a ^ b ^ c) + (k[12] ?? 0) - 421815835) | 0;
-        d = (((d << 11) | (d >>> 21)) + a) | 0;
-        c += ((d ^ a ^ b) + (k[15] ?? 0) + 530742520) | 0;
-        c = (((c << 16) | (c >>> 16)) + d) | 0;
-        b += ((c ^ d ^ a) + (k[2] ?? 0) - 995338651) | 0;
-        b = (((b << 23) | (b >>> 9)) + c) | 0;
-        // ii()
-        a += ((c ^ (b | ~d)) + (k[0] ?? 0) - 198630844) | 0;
-        a = (((a << 6) | (a >>> 26)) + b) | 0;
-        d += ((b ^ (a | ~c)) + (k[7] ?? 0) + 1126891415) | 0;
-        d = (((d << 10) | (d >>> 22)) + a) | 0;
-        c += ((a ^ (d | ~b)) + (k[14] ?? 0) - 1416354905) | 0;
-        c = (((c << 15) | (c >>> 17)) + d) | 0;
-        b += ((d ^ (c | ~a)) + (k[5] ?? 0) - 57434055) | 0;
-        b = (((b << 21) | (b >>> 11)) + c) | 0;
-        a += ((c ^ (b | ~d)) + (k[12] ?? 0) + 1700485571) | 0;
-        a = (((a << 6) | (a >>> 26)) + b) | 0;
-        d += ((b ^ (a | ~c)) + (k[3] ?? 0) - 1894986606) | 0;
-        d = (((d << 10) | (d >>> 22)) + a) | 0;
-        c += ((a ^ (d | ~b)) + (k[10] ?? 0) - 1051523) | 0;
-        c = (((c << 15) | (c >>> 17)) + d) | 0;
-        b += ((d ^ (c | ~a)) + (k[1] ?? 0) - 2054922799) | 0;
-        b = (((b << 21) | (b >>> 11)) + c) | 0;
-        a += ((c ^ (b | ~d)) + (k[8] ?? 0) + 1873313359) | 0;
-        a = (((a << 6) | (a >>> 26)) + b) | 0;
-        d += ((b ^ (a | ~c)) + (k[15] ?? 0) - 30611744) | 0;
-        d = (((d << 10) | (d >>> 22)) + a) | 0;
-        c += ((a ^ (d | ~b)) + (k[6] ?? 0) - 1560198380) | 0;
-        c = (((c << 15) | (c >>> 17)) + d) | 0;
-        b += ((d ^ (c | ~a)) + (k[13] ?? 0) + 1309151649) | 0;
-        b = (((b << 21) | (b >>> 11)) + c) | 0;
-        a += ((c ^ (b | ~d)) + (k[4] ?? 0) - 145523070) | 0;
-        a = (((a << 6) | (a >>> 26)) + b) | 0;
-        d += ((b ^ (a | ~c)) + (k[11] ?? 0) - 1120210379) | 0;
-        d = (((d << 10) | (d >>> 22)) + a) | 0;
-        c += ((a ^ (d | ~b)) + (k[2] ?? 0) + 718787259) | 0;
-        c = (((c << 15) | (c >>> 17)) + d) | 0;
-        b += ((d ^ (c | ~a)) + (k[9] ?? 0) - 343485551) | 0;
-        b = (((b << 21) | (b >>> 11)) + c) | 0;
-        x[0] = (a + (x[0] ?? 0)) | 0;
-        x[1] = (b + (x[1] ?? 0)) | 0;
-        x[2] = (c + (x[2] ?? 0)) | 0;
-        x[3] = (d + (x[3] ?? 0)) | 0;
-    }
-    _dataLength = 0;
-    _bufferLength = 0;
-    _state = new Int32Array(4);
-    _buffer = new ArrayBuffer(68);
-    _buffer8;
-    _buffer32;
-    constructor() {
-        this._buffer8 = new Uint8Array(this._buffer, 0, 68);
-        this._buffer32 = new Uint32Array(this._buffer, 0, 17);
-        this.start();
-    }
-    /**
-     * Initialise buffer to be hashed
-     */
-    start() {
-        this._dataLength = 0;
-        this._bufferLength = 0;
-        this._state.set(Md5.stateIdentity);
-        return this;
-    }
-    // Char to code point to to array conversion:
-    // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/charCodeAt
-    // #Example.3A_Fixing_charCodeAt_to_handle_non-Basic-Multilingual-Plane_characters_if_their_presence_earlier_in_the_string_is_unknown
-    /**
-     * Append a UTF-8 string to the hash buffer
-     * @param str String to append
-     */
-    appendStr(str) {
-        const buf8 = this._buffer8;
-        const buf32 = this._buffer32;
-        let bufLen = this._bufferLength;
-        let code;
-        let i;
-        for (i = 0; i < str.length; i += 1) {
-            code = str.charCodeAt(i);
-            if (code < 128) {
-                buf8[bufLen++] = code;
-            }
-            else if (code < 0x800) {
-                buf8[bufLen++] = (code >>> 6) + 0xc0;
-                buf8[bufLen++] = (code & 0x3f) | 0x80;
-            }
-            else if (code < 0xd800 || code > 0xdbff) {
-                buf8[bufLen++] = (code >>> 12) + 0xe0;
-                buf8[bufLen++] = ((code >>> 6) & 0x3f) | 0x80;
-                buf8[bufLen++] = (code & 0x3f) | 0x80;
-            }
-            else {
-                code =
-                    (code - 0xd800) * 0x400 + (str.charCodeAt(++i) - 0xdc00) + 0x10000;
-                if (code > 0x10ffff) {
-                    throw new Error("Unicode standard supports code points up to U+10FFFF");
-                }
-                buf8[bufLen++] = (code >>> 18) + 0xf0;
-                buf8[bufLen++] = ((code >>> 12) & 0x3f) | 0x80;
-                buf8[bufLen++] = ((code >>> 6) & 0x3f) | 0x80;
-                buf8[bufLen++] = (code & 0x3f) | 0x80;
-            }
-            if (bufLen >= 64) {
-                this._dataLength += 64;
-                Md5._md5cycle(this._state, buf32);
-                bufLen -= 64;
-                buf32[0] = buf32[16] ?? 0;
-            }
-        }
-        this._bufferLength = bufLen;
-        return this;
-    }
-    /**
-     * Append an ASCII string to the hash buffer
-     * @param str String to append
-     */
-    appendAsciiStr(str) {
-        const buf8 = this._buffer8;
-        const buf32 = this._buffer32;
-        let bufLen = this._bufferLength;
-        let i;
-        let j = 0;
-        for (;;) {
-            i = Math.min(str.length - j, 64 - bufLen);
-            while (i--) {
-                buf8[bufLen++] = str.charCodeAt(j++);
-            }
-            if (bufLen < 64) {
-                break;
-            }
-            this._dataLength += 64;
-            Md5._md5cycle(this._state, buf32);
-            bufLen = 0;
-        }
-        this._bufferLength = bufLen;
-        return this;
-    }
-    /**
-     * Append a byte array to the hash buffer
-     * @param input array to append
-     */
-    appendByteArray(input) {
-        const buf8 = this._buffer8;
-        const buf32 = this._buffer32;
-        let bufLen = this._bufferLength;
-        let i;
-        let j = 0;
-        for (;;) {
-            i = Math.min(input.length - j, 64 - bufLen);
-            while (i--) {
-                buf8[bufLen++] = input[j++] ?? 0;
-            }
-            if (bufLen < 64) {
-                break;
-            }
-            this._dataLength += 64;
-            Md5._md5cycle(this._state, buf32);
-            bufLen = 0;
-        }
-        this._bufferLength = bufLen;
-        return this;
-    }
-    /**
-     * Get the state of the hash buffer
-     */
-    getState() {
-        const s = this._state;
-        return {
-            buffer: String.fromCharCode.apply(null, Array.from(this._buffer8)),
-            buflen: this._bufferLength,
-            length: this._dataLength,
-            state: [s[0] ?? 0, s[1] ?? 0, s[2] ?? 0, s[3] ?? 0],
-        };
-    }
-    /**
-     * Override the current state of the hash buffer
-     * @param state New hash buffer state
-     */
-    setState(state) {
-        const buf = state.buffer;
-        const x = state.state;
-        const s = this._state;
-        let i;
-        this._dataLength = state.length;
-        this._bufferLength = state.buflen;
-        s[0] = x[0] ?? 0;
-        s[1] = x[1] ?? 0;
-        s[2] = x[2] ?? 0;
-        s[3] = x[3] ?? 0;
-        for (i = 0; i < buf.length; i += 1) {
-            this._buffer8[i] = buf.charCodeAt(i);
-        }
-    }
-    /**
-     * Hash the current state of the hash buffer and return the result
-     * @param raw Whether to return the value as an `Int32Array`
-     */
-    end(raw = false) {
-        const bufLen = this._bufferLength;
-        const buf8 = this._buffer8;
-        const buf32 = this._buffer32;
-        const i = (bufLen >> 2) + 1;
-        this._dataLength += bufLen;
-        const dataBitsLen = this._dataLength * 8;
-        buf8[bufLen] = 0x80;
-        buf8[bufLen + 1] = buf8[bufLen + 2] = buf8[bufLen + 3] = 0;
-        buf32.set(Md5.buffer32Identity.subarray(i), i);
-        if (bufLen > 55) {
-            Md5._md5cycle(this._state, buf32);
-            buf32.set(Md5.buffer32Identity);
-        }
-        // Do the final computation based on the tail and length
-        // Beware that the final length may not fit in 32 bits so we take care of that
-        if (dataBitsLen <= 0xffffffff) {
-            buf32[14] = dataBitsLen;
-        }
-        else {
-            const matches = dataBitsLen.toString(16).match(/(.*?)(.{0,8})$/);
-            if (matches === null) {
-                return;
-            }
-            const lo = Number.parseInt(matches[2] ?? "", 16);
-            const hi = Number.parseInt(matches[1] ?? "", 16) || 0;
-            buf32[14] = lo;
-            buf32[15] = hi;
-        }
-        Md5._md5cycle(this._state, buf32);
-        return raw ? this._state : Md5._hex(this._state);
-    }
-}
-if (Md5.hashStr("hello") !== "5d41402abc4b2a76b9719d911017c592") {
-    throw new Error("Md5 self test failed.");
-}

package/dist/utils/md5.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"md5.js","names":["n: number","offset: number","j: number","i: number","a: number","b: number","c: number","d: number","code: number"],"sources":["../../src/utils/md5.ts"],"sourcesContent":["/*\n\nTypeScript Md5\n==============\n\nBased on work by\n* Joseph Myers: http://www.myersdaily.org/joseph/javascript/md5-text.html\n* André Cruz: https://github.com/satazor/SparkMD5\n* Raymond Hill: https://github.com/gorhill/yamd5.js\n\nEffectively a TypeScrypt re-write of Raymond Hill JS Library\n\nThe MIT License (MIT)\n\nCopyright (C) 2014 Raymond Hill\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n            DO WHAT YOU WANT TO PUBLIC LICENSE\n                    Version 2, December 2004\n\n Copyright (C) 2015 André Cruz <amdfcruz@gmail.com>\n\n Everyone is permitted to copy and distribute verbatim or modified\n copies of this license document, and changing it is allowed as long\n as the name is changed.\n\n            DO WHAT YOU WANT TO PUBLIC LICENSE\n   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION\n\n  0. You just DO WHAT YOU WANT TO.\n\n*/\n\ntype HasherState = {\n  buffer: string;\n  buflen: number;\n  length: number;\n  state: number[];\n};\n\nexport class Md5 {\n  /**\n   * Hash a UTF-8 string on the spot\n   * @param str String to hash\n   * @param raw Whether to return the value as an `Int32Array`\n   */\n  public static hashStr(str: string, raw?: false): string;\n  public static hashStr(str: string, raw: true): Int32Array;\n  public static hashStr(str: string, raw = false) {\n    return Md5.onePassHasher.start().appendStr(str).end(raw);\n  }\n\n  /**\n   * Hash a ASCII string on the spot\n   * @param str String to hash\n   * @param raw Whether to return the value as an `Int32Array`\n   */\n  public static hashAsciiStr(str: string, raw?: false): string;\n  public static hashAsciiStr(str: string, raw: true): Int32Array;\n  public static hashAsciiStr(str: string, raw = false) {\n    return Md5.onePassHasher.start().appendAsciiStr(str).end(raw);\n  }\n\n  // Private Static Variables\n  private static stateIdentity = new Int32Array([\n    1732584193, -271733879, -1732584194, 271733878,\n  ]);\n\n  private static buffer32Identity = new Int32Array([\n    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n  ]);\n\n  private static hexChars = \"0123456789abcdef\";\n  private static hexOut: string[] = [];\n\n  // Permanent instance is to use for one-call hashing\n  private static onePassHasher = new Md5();\n\n  private static _hex(x: Int32Array): string {\n    const hc = Md5.hexChars;\n    const ho = Md5.hexOut;\n    let n: number;\n    let offset: number;\n    let j: number;\n    let i: number;\n\n    for (i = 0; i < 4; i += 1) {\n      offset = i * 8;\n      n = x[i] ?? 0;\n      for (j = 0; j < 8; j += 2) {\n        ho[offset + 1 + j] = hc.charAt(n & 0x0f);\n        n >>>= 4;\n        ho[offset + 0 + j] = hc.charAt(n & 0x0f);\n        n >>>= 4;\n      }\n    }\n    return ho.join(\"\");\n  }\n\n  private static _md5cycle(\n    x: Int32Array | Uint32Array,\n    k: Int32Array | Uint32Array,\n  ) {\n    let a: number = x[0] ?? 0;\n    let b: number = x[1] ?? 0;\n    let c: number = x[2] ?? 0;\n    let d: number = x[3] ?? 0;\n    // ff()\n    a += (((b & c) | (~b & d)) + (k[0] ?? 0) - 680876936) | 0;\n    a = (((a << 7) | (a >>> 25)) + b) | 0;\n    d += (((a & b) | (~a & c)) + (k[1] ?? 0) - 389564586) | 0;\n    d = (((d << 12) | (d >>> 20)) + a) | 0;\n    c += (((d & a) | (~d & b)) + (k[2] ?? 0) + 606105819) | 0;\n    c = (((c << 17) | (c >>> 15)) + d) | 0;\n    b += (((c & d) | (~c & a)) + (k[3] ?? 0) - 1044525330) | 0;\n    b = (((b << 22) | (b >>> 10)) + c) | 0;\n    a += (((b & c) | (~b & d)) + (k[4] ?? 0) - 176418897) | 0;\n    a = (((a << 7) | (a >>> 25)) + b) | 0;\n    d += (((a & b) | (~a & c)) + (k[5] ?? 0) + 1200080426) | 0;\n    d = (((d << 12) | (d >>> 20)) + a) | 0;\n    c += (((d & a) | (~d & b)) + (k[6] ?? 0) - 1473231341) | 0;\n    c = (((c << 17) | (c >>> 15)) + d) | 0;\n    b += (((c & d) | (~c & a)) + (k[7] ?? 0) - 45705983) | 0;\n    b = (((b << 22) | (b >>> 10)) + c) | 0;\n    a += (((b & c) | (~b & d)) + (k[8] ?? 0) + 1770035416) | 0;\n    a = (((a << 7) | (a >>> 25)) + b) | 0;\n    d += (((a & b) | (~a & c)) + (k[9] ?? 0) - 1958414417) | 0;\n    d = (((d << 12) | (d >>> 20)) + a) | 0;\n    c += (((d & a) | (~d & b)) + (k[10] ?? 0) - 42063) | 0;\n    c = (((c << 17) | (c >>> 15)) + d) | 0;\n    b += (((c & d) | (~c & a)) + (k[11] ?? 0) - 1990404162) | 0;\n    b = (((b << 22) | (b >>> 10)) + c) | 0;\n    a += (((b & c) | (~b & d)) + (k[12] ?? 0) + 1804603682) | 0;\n    a = (((a << 7) | (a >>> 25)) + b) | 0;\n    d += (((a & b) | (~a & c)) + (k[13] ?? 0) - 40341101) | 0;\n    d = (((d << 12) | (d >>> 20)) + a) | 0;\n    c += (((d & a) | (~d & b)) + (k[14] ?? 0) - 1502002290) | 0;\n    c = (((c << 17) | (c >>> 15)) + d) | 0;\n    b += (((c & d) | (~c & a)) + (k[15] ?? 0) + 1236535329) | 0;\n    b = (((b << 22) | (b >>> 10)) + c) | 0;\n    // gg()\n    a += (((b & d) | (c & ~d)) + (k[1] ?? 0) - 165796510) | 0;\n    a = (((a << 5) | (a >>> 27)) + b) | 0;\n    d += (((a & c) | (b & ~c)) + (k[6] ?? 0) - 1069501632) | 0;\n    d = (((d << 9) | (d >>> 23)) + a) | 0;\n    c += (((d & b) | (a & ~b)) + (k[11] ?? 0) + 643717713) | 0;\n    c = (((c << 14) | (c >>> 18)) + d) | 0;\n    b += (((c & a) | (d & ~a)) + (k[0] ?? 0) - 373897302) | 0;\n    b = (((b << 20) | (b >>> 12)) + c) | 0;\n    a += (((b & d) | (c & ~d)) + (k[5] ?? 0) - 701558691) | 0;\n    a = (((a << 5) | (a >>> 27)) + b) | 0;\n    d += (((a & c) | (b & ~c)) + (k[10] ?? 0) + 38016083) | 0;\n    d = (((d << 9) | (d >>> 23)) + a) | 0;\n    c += (((d & b) | (a & ~b)) + (k[15] ?? 0) - 660478335) | 0;\n    c = (((c << 14) | (c >>> 18)) + d) | 0;\n    b += (((c & a) | (d & ~a)) + (k[4] ?? 0) - 405537848) | 0;\n    b = (((b << 20) | (b >>> 12)) + c) | 0;\n    a += (((b & d) | (c & ~d)) + (k[9] ?? 0) + 568446438) | 0;\n    a = (((a << 5) | (a >>> 27)) + b) | 0;\n    d += (((a & c) | (b & ~c)) + (k[14] ?? 0) - 1019803690) | 0;\n    d = (((d << 9) | (d >>> 23)) + a) | 0;\n    c += (((d & b) | (a & ~b)) + (k[3] ?? 0) - 187363961) | 0;\n    c = (((c << 14) | (c >>> 18)) + d) | 0;\n    b += (((c & a) | (d & ~a)) + (k[8] ?? 0) + 1163531501) | 0;\n    b = (((b << 20) | (b >>> 12)) + c) | 0;\n    a += (((b & d) | (c & ~d)) + (k[13] ?? 0) - 1444681467) | 0;\n    a = (((a << 5) | (a >>> 27)) + b) | 0;\n    d += (((a & c) | (b & ~c)) + (k[2] ?? 0) - 51403784) | 0;\n    d = (((d << 9) | (d >>> 23)) + a) | 0;\n    c += (((d & b) | (a & ~b)) + (k[7] ?? 0) + 1735328473) | 0;\n    c = (((c << 14) | (c >>> 18)) + d) | 0;\n    b += (((c & a) | (d & ~a)) + (k[12] ?? 0) - 1926607734) | 0;\n    b = (((b << 20) | (b >>> 12)) + c) | 0;\n    // hh()\n    a += ((b ^ c ^ d) + (k[5] ?? 0) - 378558) | 0;\n    a = (((a << 4) | (a >>> 28)) + b) | 0;\n    d += ((a ^ b ^ c) + (k[8] ?? 0) - 2022574463) | 0;\n    d = (((d << 11) | (d >>> 21)) + a) | 0;\n    c += ((d ^ a ^ b) + (k[11] ?? 0) + 1839030562) | 0;\n    c = (((c << 16) | (c >>> 16)) + d) | 0;\n    b += ((c ^ d ^ a) + (k[14] ?? 0) - 35309556) | 0;\n    b = (((b << 23) | (b >>> 9)) + c) | 0;\n    a += ((b ^ c ^ d) + (k[1] ?? 0) - 1530992060) | 0;\n    a = (((a << 4) | (a >>> 28)) + b) | 0;\n    d += ((a ^ b ^ c) + (k[4] ?? 0) + 1272893353) | 0;\n    d = (((d << 11) | (d >>> 21)) + a) | 0;\n    c += ((d ^ a ^ b) + (k[7] ?? 0) - 155497632) | 0;\n    c = (((c << 16) | (c >>> 16)) + d) | 0;\n    b += ((c ^ d ^ a) + (k[10] ?? 0) - 1094730640) | 0;\n    b = (((b << 23) | (b >>> 9)) + c) | 0;\n    a += ((b ^ c ^ d) + (k[13] ?? 0) + 681279174) | 0;\n    a = (((a << 4) | (a >>> 28)) + b) | 0;\n    d += ((a ^ b ^ c) + (k[0] ?? 0) - 358537222) | 0;\n    d = (((d << 11) | (d >>> 21)) + a) | 0;\n    c += ((d ^ a ^ b) + (k[3] ?? 0) - 722521979) | 0;\n    c = (((c << 16) | (c >>> 16)) + d) | 0;\n    b += ((c ^ d ^ a) + (k[6] ?? 0) + 76029189) | 0;\n    b = (((b << 23) | (b >>> 9)) + c) | 0;\n    a += ((b ^ c ^ d) + (k[9] ?? 0) - 640364487) | 0;\n    a = (((a << 4) | (a >>> 28)) + b) | 0;\n    d += ((a ^ b ^ c) + (k[12] ?? 0) - 421815835) | 0;\n    d = (((d << 11) | (d >>> 21)) + a) | 0;\n    c += ((d ^ a ^ b) + (k[15] ?? 0) + 530742520) | 0;\n    c = (((c << 16) | (c >>> 16)) + d) | 0;\n    b += ((c ^ d ^ a) + (k[2] ?? 0) - 995338651) | 0;\n    b = (((b << 23) | (b >>> 9)) + c) | 0;\n    // ii()\n    a += ((c ^ (b | ~d)) + (k[0] ?? 0) - 198630844) | 0;\n    a = (((a << 6) | (a >>> 26)) + b) | 0;\n    d += ((b ^ (a | ~c)) + (k[7] ?? 0) + 1126891415) | 0;\n    d = (((d << 10) | (d >>> 22)) + a) | 0;\n    c += ((a ^ (d | ~b)) + (k[14] ?? 0) - 1416354905) | 0;\n    c = (((c << 15) | (c >>> 17)) + d) | 0;\n    b += ((d ^ (c | ~a)) + (k[5] ?? 0) - 57434055) | 0;\n    b = (((b << 21) | (b >>> 11)) + c) | 0;\n    a += ((c ^ (b | ~d)) + (k[12] ?? 0) + 1700485571) | 0;\n    a = (((a << 6) | (a >>> 26)) + b) | 0;\n    d += ((b ^ (a | ~c)) + (k[3] ?? 0) - 1894986606) | 0;\n    d = (((d << 10) | (d >>> 22)) + a) | 0;\n    c += ((a ^ (d | ~b)) + (k[10] ?? 0) - 1051523) | 0;\n    c = (((c << 15) | (c >>> 17)) + d) | 0;\n    b += ((d ^ (c | ~a)) + (k[1] ?? 0) - 2054922799) | 0;\n    b = (((b << 21) | (b >>> 11)) + c) | 0;\n    a += ((c ^ (b | ~d)) + (k[8] ?? 0) + 1873313359) | 0;\n    a = (((a << 6) | (a >>> 26)) + b) | 0;\n    d += ((b ^ (a | ~c)) + (k[15] ?? 0) - 30611744) | 0;\n    d = (((d << 10) | (d >>> 22)) + a) | 0;\n    c += ((a ^ (d | ~b)) + (k[6] ?? 0) - 1560198380) | 0;\n    c = (((c << 15) | (c >>> 17)) + d) | 0;\n    b += ((d ^ (c | ~a)) + (k[13] ?? 0) + 1309151649) | 0;\n    b = (((b << 21) | (b >>> 11)) + c) | 0;\n    a += ((c ^ (b | ~d)) + (k[4] ?? 0) - 145523070) | 0;\n    a = (((a << 6) | (a >>> 26)) + b) | 0;\n    d += ((b ^ (a | ~c)) + (k[11] ?? 0) - 1120210379) | 0;\n    d = (((d << 10) | (d >>> 22)) + a) | 0;\n    c += ((a ^ (d | ~b)) + (k[2] ?? 0) + 718787259) | 0;\n    c = (((c << 15) | (c >>> 17)) + d) | 0;\n    b += ((d ^ (c | ~a)) + (k[9] ?? 0) - 343485551) | 0;\n    b = (((b << 21) | (b >>> 11)) + c) | 0;\n\n    x[0] = (a + (x[0] ?? 0)) | 0;\n    x[1] = (b + (x[1] ?? 0)) | 0;\n    x[2] = (c + (x[2] ?? 0)) | 0;\n    x[3] = (d + (x[3] ?? 0)) | 0;\n  }\n\n  private _dataLength = 0;\n  private _bufferLength = 0;\n\n  private _state: Int32Array = new Int32Array(4);\n  private _buffer: ArrayBuffer = new ArrayBuffer(68);\n  private _buffer8: Uint8Array;\n  private _buffer32: Uint32Array;\n\n  constructor() {\n    this._buffer8 = new Uint8Array(this._buffer, 0, 68);\n    this._buffer32 = new Uint32Array(this._buffer, 0, 17);\n    this.start();\n  }\n\n  /**\n   * Initialise buffer to be hashed\n   */\n  public start() {\n    this._dataLength = 0;\n    this._bufferLength = 0;\n    this._state.set(Md5.stateIdentity);\n    return this;\n  }\n\n  // Char to code point to to array conversion:\n  // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/charCodeAt\n  // #Example.3A_Fixing_charCodeAt_to_handle_non-Basic-Multilingual-Plane_characters_if_their_presence_earlier_in_the_string_is_unknown\n\n  /**\n   * Append a UTF-8 string to the hash buffer\n   * @param str String to append\n   */\n  public appendStr(str: string) {\n    const buf8 = this._buffer8;\n    const buf32 = this._buffer32;\n    let bufLen = this._bufferLength;\n    let code: number;\n    let i: number;\n\n    for (i = 0; i < str.length; i += 1) {\n      code = str.charCodeAt(i);\n      if (code < 128) {\n        buf8[bufLen++] = code;\n      } else if (code < 0x800) {\n        buf8[bufLen++] = (code >>> 6) + 0xc0;\n        buf8[bufLen++] = (code & 0x3f) | 0x80;\n      } else if (code < 0xd800 || code > 0xdbff) {\n        buf8[bufLen++] = (code >>> 12) + 0xe0;\n        buf8[bufLen++] = ((code >>> 6) & 0x3f) | 0x80;\n        buf8[bufLen++] = (code & 0x3f) | 0x80;\n      } else {\n        code =\n          (code - 0xd800) * 0x400 + (str.charCodeAt(++i) - 0xdc00) + 0x10000;\n        if (code > 0x10ffff) {\n          throw new Error(\n            \"Unicode standard supports code points up to U+10FFFF\",\n          );\n        }\n        buf8[bufLen++] = (code >>> 18) + 0xf0;\n        buf8[bufLen++] = ((code >>> 12) & 0x3f) | 0x80;\n        buf8[bufLen++] = ((code >>> 6) & 0x3f) | 0x80;\n        buf8[bufLen++] = (code & 0x3f) | 0x80;\n      }\n      if (bufLen >= 64) {\n        this._dataLength += 64;\n        Md5._md5cycle(this._state, buf32);\n        bufLen -= 64;\n        buf32[0] = buf32[16] ?? 0;\n      }\n    }\n    this._bufferLength = bufLen;\n    return this;\n  }\n\n  /**\n   * Append an ASCII string to the hash buffer\n   * @param str String to append\n   */\n  public appendAsciiStr(str: string) {\n    const buf8 = this._buffer8;\n    const buf32 = this._buffer32;\n    let bufLen = this._bufferLength;\n    let i: number;\n    let j = 0;\n\n    for (;;) {\n      i = Math.min(str.length - j, 64 - bufLen);\n      while (i--) {\n        buf8[bufLen++] = str.charCodeAt(j++);\n      }\n      if (bufLen < 64) {\n        break;\n      }\n      this._dataLength += 64;\n      Md5._md5cycle(this._state, buf32);\n      bufLen = 0;\n    }\n    this._bufferLength = bufLen;\n    return this;\n  }\n\n  /**\n   * Append a byte array to the hash buffer\n   * @param input array to append\n   */\n  public appendByteArray(input: Uint8Array) {\n    const buf8 = this._buffer8;\n    const buf32 = this._buffer32;\n    let bufLen = this._bufferLength;\n    let i: number;\n    let j = 0;\n\n    for (;;) {\n      i = Math.min(input.length - j, 64 - bufLen);\n      while (i--) {\n        buf8[bufLen++] = input[j++] ?? 0;\n      }\n      if (bufLen < 64) {\n        break;\n      }\n      this._dataLength += 64;\n      Md5._md5cycle(this._state, buf32);\n      bufLen = 0;\n    }\n    this._bufferLength = bufLen;\n    return this;\n  }\n\n  /**\n   * Get the state of the hash buffer\n   */\n  public getState(): HasherState {\n    const s = this._state;\n\n    return {\n      buffer: String.fromCharCode.apply(null, Array.from(this._buffer8)),\n      buflen: this._bufferLength,\n      length: this._dataLength,\n      state: [s[0] ?? 0, s[1] ?? 0, s[2] ?? 0, s[3] ?? 0],\n    };\n  }\n\n  /**\n   * Override the current state of the hash buffer\n   * @param state New hash buffer state\n   */\n  public setState(state: HasherState) {\n    const buf = state.buffer;\n    const x = state.state;\n    const s = this._state;\n    let i: number;\n\n    this._dataLength = state.length;\n    this._bufferLength = state.buflen;\n    s[0] = x[0] ?? 0;\n    s[1] = x[1] ?? 0;\n    s[2] = x[2] ?? 0;\n    s[3] = x[3] ?? 0;\n\n    for (i = 0; i < buf.length; i += 1) {\n      this._buffer8[i] = buf.charCodeAt(i);\n    }\n  }\n\n  /**\n   * Hash the current state of the hash buffer and return the result\n   * @param raw Whether to return the value as an `Int32Array`\n   */\n  public end(raw = false) {\n    const bufLen = this._bufferLength;\n    const buf8 = this._buffer8;\n    const buf32 = this._buffer32;\n    const i = (bufLen >> 2) + 1;\n\n    this._dataLength += bufLen;\n    const dataBitsLen = this._dataLength * 8;\n\n    buf8[bufLen] = 0x80;\n    buf8[bufLen + 1] = buf8[bufLen + 2] = buf8[bufLen + 3] = 0;\n    buf32.set(Md5.buffer32Identity.subarray(i), i);\n\n    if (bufLen > 55) {\n      Md5._md5cycle(this._state, buf32);\n      buf32.set(Md5.buffer32Identity);\n    }\n\n    // Do the final computation based on the tail and length\n    // Beware that the final length may not fit in 32 bits so we take care of that\n    if (dataBitsLen <= 0xffffffff) {\n      buf32[14] = dataBitsLen;\n    } else {\n      const matches = dataBitsLen.toString(16).match(/(.*?)(.{0,8})$/);\n      if (matches === null) {\n        return;\n      }\n\n      const lo = Number.parseInt(matches[2] ?? \"\", 16);\n      const hi = Number.parseInt(matches[1] ?? \"\", 16) || 0;\n\n      buf32[14] = lo;\n      buf32[15] = hi;\n    }\n\n    Md5._md5cycle(this._state, buf32);\n\n    return raw ? this._state : Md5._hex(this._state);\n  }\n}\n\nif (Md5.hashStr(\"hello\") !== \"5d41402abc4b2a76b9719d911017c592\") {\n  throw new Error(\"Md5 self test failed.\");\n}\n"],"mappings":"AAyDA,IAAa,EAAb,MAAa,CAAI,CAQf,OAAc,QAAQ,EAAa,EAAM,GAAO,CAC9C,OAAO,EAAI,cAAc,OAAO,CAAC,UAAU,EAAI,CAAC,IAAI,EAAI,CAU1D,OAAc,aAAa,EAAa,EAAM,GAAO,CACnD,OAAO,EAAI,cAAc,OAAO,CAAC,eAAe,EAAI,CAAC,IAAI,EAAI,CAI/D,OAAe,cAAgB,IAAI,WAAW,CAC5C,WAAY,WAAY,YAAa,UACtC,CAAC,CAEF,OAAe,iBAAmB,IAAI,WAAW,CAC/C,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAC9C,CAAC,CAEF,OAAe,SAAW,mBAC1B,OAAe,OAAmB,EAAE,CAGpC,OAAe,cAAgB,IAAI,EAEnC,OAAe,KAAK,EAAuB,CACzC,IAAM,EAAK,EAAI,SACT,EAAK,EAAI,OACXA,EACAC,EACAC,EACAC,EAEJ,IAAK,EAAI,EAAG,EAAI,EAAG,GAAK,EAGtB,IAFA,EAAS,EAAI,EACb,EAAI,EAAE,IAAM,EACP,EAAI,EAAG,EAAI,EAAG,GAAK,EACtB,EAAG,EAAS,EAAI,GAAK,EAAG,OAAO,EAAI,GAAK,CACxC,KAAO,EACP,EAAG,EAAS,EAAI,GAAK,EAAG,OAAO,EAAI,GAAK,CACxC,KAAO,EAGX,OAAO,EAAG,KAAK,GAAG,CAGpB,OAAe,UACb,EACA,EACA,CACA,IAAIC,EAAY,EAAE,IAAM,EACpBC,EAAY,EAAE,IAAM,EACpBC,EAAY,EAAE,IAAM,EACpBC,EAAY,EAAE,IAAM,EAExB,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,IAAM,GAAK,UAAa,EACxD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,IAAM,GAAK,UAAa,EACxD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,IAAM,GAAK,UAAa,EACxD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,IAAM,GAAK,WAAc,EACzD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,IAAM,GAAK,UAAa,EACxD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,IAAM,GAAK,WAAc,EACzD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,IAAM,GAAK,WAAc,EACzD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,IAAM,GAAK,SAAY,EACvD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,IAAM,GAAK,WAAc,EACzD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,IAAM,GAAK,WAAc,EACzD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,KAAO,GAAK,MAAS,EACrD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,KAAO,GAAK,WAAc,EAC1D,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,KAAO,GAAK,WAAc,EAC1D,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,KAAO,GAAK,SAAY,EACxD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,KAAO,GAAK,WAAc,EAC1D,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,CAAC,EAAI,IAAO,EAAE,KAAO,GAAK,WAAc,EAC1D,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EAErC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,IAAM,GAAK,UAAa,EACxD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,IAAM,GAAK,WAAc,EACzD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,KAAO,GAAK,UAAa,EACzD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,IAAM,GAAK,UAAa,EACxD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,IAAM,GAAK,UAAa,EACxD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,KAAO,GAAK,SAAY,EACxD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,KAAO,GAAK,UAAa,EACzD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,IAAM,GAAK,UAAa,EACxD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,IAAM,GAAK,UAAa,EACxD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,KAAO,GAAK,WAAc,EAC1D,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,IAAM,GAAK,UAAa,EACxD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,IAAM,GAAK,WAAc,EACzD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,KAAO,GAAK,WAAc,EAC1D,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,IAAM,GAAK,SAAY,EACvD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,IAAM,GAAK,WAAc,EACzD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAQ,EAAI,EAAM,EAAI,CAAC,IAAO,EAAE,KAAO,GAAK,WAAc,EAC1D,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EAErC,IAAO,EAAI,EAAI,IAAM,EAAE,IAAM,GAAK,OAAU,EAC5C,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAO,EAAI,EAAI,IAAM,EAAE,IAAM,GAAK,WAAc,EAChD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,EAAI,EAAI,IAAM,EAAE,KAAO,GAAK,WAAc,EACjD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,EAAI,EAAI,IAAM,EAAE,KAAO,GAAK,SAAY,EAC/C,GAAO,GAAK,GAAO,IAAM,GAAM,EAAK,EACpC,IAAO,EAAI,EAAI,IAAM,EAAE,IAAM,GAAK,WAAc,EAChD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAO,EAAI,EAAI,IAAM,EAAE,IAAM,GAAK,WAAc,EAChD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,EAAI,EAAI,IAAM,EAAE,IAAM,GAAK,UAAa,EAC/C,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,EAAI,EAAI,IAAM,EAAE,KAAO,GAAK,WAAc,EACjD,GAAO,GAAK,GAAO,IAAM,GAAM,EAAK,EACpC,IAAO,EAAI,EAAI,IAAM,EAAE,KAAO,GAAK,UAAa,EAChD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAO,EAAI,EAAI,IAAM,EAAE,IAAM,GAAK,UAAa,EAC/C,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,EAAI,EAAI,IAAM,EAAE,IAAM,GAAK,UAAa,EAC/C,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,EAAI,EAAI,IAAM,EAAE,IAAM,GAAK,SAAY,EAC9C,GAAO,GAAK,GAAO,IAAM,GAAM,EAAK,EACpC,IAAO,EAAI,EAAI,IAAM,EAAE,IAAM,GAAK,UAAa,EAC/C,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAO,EAAI,EAAI,IAAM,EAAE,KAAO,GAAK,UAAa,EAChD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,EAAI,EAAI,IAAM,EAAE,KAAO,GAAK,UAAa,EAChD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,EAAI,EAAI,IAAM,EAAE,IAAM,GAAK,UAAa,EAC/C,GAAO,GAAK,GAAO,IAAM,GAAM,EAAK,EAEpC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,IAAM,GAAK,UAAa,EAClD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,IAAM,GAAK,WAAc,EACnD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,KAAO,GAAK,WAAc,EACpD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,IAAM,GAAK,SAAY,EACjD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,KAAO,GAAK,WAAc,EACpD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,IAAM,GAAK,WAAc,EACnD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,KAAO,GAAK,QAAW,EACjD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,IAAM,GAAK,WAAc,EACnD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,IAAM,GAAK,WAAc,EACnD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,KAAO,GAAK,SAAY,EAClD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,IAAM,GAAK,WAAc,EACnD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,KAAO,GAAK,WAAc,EACpD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,IAAM,GAAK,UAAa,EAClD,GAAO,GAAK,EAAM,IAAM,IAAO,EAAK,EACpC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,KAAO,GAAK,WAAc,EACpD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,IAAM,GAAK,UAAa,EAClD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EACrC,IAAO,GAAK,EAAI,CAAC,KAAO,EAAE,IAAM,GAAK,UAAa,EAClD,GAAO,GAAK,GAAO,IAAM,IAAO,EAAK,EAErC,EAAE,GAAM,GAAK,EAAE,IAAM,GAAM,EAC3B,EAAE,GAAM,GAAK,EAAE,IAAM,GAAM,EAC3B,EAAE,GAAM,GAAK,EAAE,IAAM,GAAM,EAC3B,EAAE,GAAM,GAAK,EAAE,IAAM,GAAM,EAG7B,YAAsB,EACtB,cAAwB,EAExB,OAA6B,IAAI,WAAW,EAAE,CAC9C,QAA+B,IAAI,YAAY,GAAG,CAClD,SACA,UAEA,aAAc,CACZ,KAAK,SAAW,IAAI,WAAW,KAAK,QAAS,EAAG,GAAG,CACnD,KAAK,UAAY,IAAI,YAAY,KAAK,QAAS,EAAG,GAAG,CACrD,KAAK,OAAO,CAMd,OAAe,CAIb,MAHA,MAAK,YAAc,EACnB,KAAK,cAAgB,EACrB,KAAK,OAAO,IAAI,EAAI,cAAc,CAC3B,KAWT,UAAiB,EAAa,CAC5B,IAAM,EAAO,KAAK,SACZ,EAAQ,KAAK,UACf,EAAS,KAAK,cACdC,EACAL,EAEJ,IAAK,EAAI,EAAG,EAAI,EAAI,OAAQ,GAAK,EAAG,CAElC,GADA,EAAO,EAAI,WAAW,EAAE,CACpB,EAAO,IACT,EAAK,KAAY,UACR,EAAO,KAChB,EAAK,MAAa,IAAS,GAAK,IAChC,EAAK,KAAa,EAAO,GAAQ,YACxB,EAAO,OAAU,EAAO,MACjC,EAAK,MAAa,IAAS,IAAM,IACjC,EAAK,KAAc,IAAS,EAAK,GAAQ,IACzC,EAAK,KAAa,EAAO,GAAQ,QAC5B,CAGL,GAFA,GACG,EAAO,OAAU,MAAS,EAAI,WAAW,EAAE,EAAE,CAAG,OAAU,MACzD,EAAO,QACT,MAAU,MACR,uDACD,CAEH,EAAK,MAAa,IAAS,IAAM,IACjC,EAAK,KAAc,IAAS,GAAM,GAAQ,IAC1C,EAAK,KAAc,IAAS,EAAK,GAAQ,IACzC,EAAK,KAAa,EAAO,GAAQ,IAE/B,GAAU,KACZ,KAAK,aAAe,GACpB,EAAI,UAAU,KAAK,OAAQ,EAAM,CACjC,GAAU,GACV,EAAM,GAAK,EAAM,KAAO,GAI5B,MADA,MAAK,cAAgB,EACd,KAOT,eAAsB,EAAa,CACjC,IAAM,EAAO,KAAK,SACZ,EAAQ,KAAK,UACf,EAAS,KAAK,cACdA,EACA,EAAI,EAER,OAAS,CAEP,IADA,EAAI,KAAK,IAAI,EAAI,OAAS,EAAG,GAAK,EAAO,CAClC,KACL,EAAK,KAAY,EAAI,WAAW,IAAI,CAEtC,GAAI,EAAS,GACX,MAEF,KAAK,aAAe,GACpB,EAAI,UAAU,KAAK,OAAQ,EAAM,CACjC,EAAS,EAGX,MADA,MAAK,cAAgB,EACd,KAOT,gBAAuB,EAAmB,CACxC,IAAM,EAAO,KAAK,SACZ,EAAQ,KAAK,UACf,EAAS,KAAK,cACdA,EACA,EAAI,EAER,OAAS,CAEP,IADA,EAAI,KAAK,IAAI,EAAM,OAAS,EAAG,GAAK,EAAO,CACpC,KACL,EAAK,KAAY,EAAM,MAAQ,EAEjC,GAAI,EAAS,GACX,MAEF,KAAK,aAAe,GACpB,EAAI,UAAU,KAAK,OAAQ,EAAM,CACjC,EAAS,EAGX,MADA,MAAK,cAAgB,EACd,KAMT,UAA+B,CAC7B,IAAM,EAAI,KAAK,OAEf,MAAO,CACL,OAAQ,OAAO,aAAa,MAAM,KAAM,MAAM,KAAK,KAAK,SAAS,CAAC,CAClE,OAAQ,KAAK,cACb,OAAQ,KAAK,YACb,MAAO,CAAC,EAAE,IAAM,EAAG,EAAE,IAAM,EAAG,EAAE,IAAM,EAAG,EAAE,IAAM,EAAE,CACpD,CAOH,SAAgB,EAAoB,CAClC,IAAM,EAAM,EAAM,OACZ,EAAI,EAAM,MACV,EAAI,KAAK,OACXA,EASJ,IAPA,KAAK,YAAc,EAAM,OACzB,KAAK,cAAgB,EAAM,OAC3B,EAAE,GAAK,EAAE,IAAM,EACf,EAAE,GAAK,EAAE,IAAM,EACf,EAAE,GAAK,EAAE,IAAM,EACf,EAAE,GAAK,EAAE,IAAM,EAEV,EAAI,EAAG,EAAI,EAAI,OAAQ,GAAK,EAC/B,KAAK,SAAS,GAAK,EAAI,WAAW,EAAE,CAQxC,IAAW,EAAM,GAAO,CACtB,IAAM,EAAS,KAAK,cACd,EAAO,KAAK,SACZ,EAAQ,KAAK,UACb,GAAK,GAAU,GAAK,EAE1B,KAAK,aAAe,EACpB,IAAM,EAAc,KAAK,YAAc,EAavC,GAXA,EAAK,GAAU,IACf,EAAK,EAAS,GAAK,EAAK,EAAS,GAAK,EAAK,EAAS,GAAK,EACzD,EAAM,IAAI,EAAI,iBAAiB,SAAS,EAAE,CAAE,EAAE,CAE1C,EAAS,KACX,EAAI,UAAU,KAAK,OAAQ,EAAM,CACjC,EAAM,IAAI,EAAI,iBAAiB,EAK7B,GAAe,WACjB,EAAM,IAAM,MACP,CACL,IAAM,EAAU,EAAY,SAAS,GAAG,CAAC,MAAM,iBAAiB,CAChE,GAAI,IAAY,KACd,OAGF,IAAM,EAAK,OAAO,SAAS,EAAQ,IAAM,GAAI,GAAG,CAC1C,EAAK,OAAO,SAAS,EAAQ,IAAM,GAAI,GAAG,EAAI,EAEpD,EAAM,IAAM,EACZ,EAAM,IAAM,EAKd,OAFA,EAAI,UAAU,KAAK,OAAQ,EAAM,CAE1B,EAAM,KAAK,OAAS,EAAI,KAAK,KAAK,OAAO,GAIpD,GAAI,EAAI,QAAQ,QAAQ,GAAK,mCAC3B,MAAU,MAAM,wBAAwB"}

package/dist/utils/once.cjs

@@ -1 +0,0 @@
-const e=require(`../chunk-CUT6urMc.cjs`),t=require(`../uploadista-error-BB-Wdiz9.cjs`);let n=require(`effect`);n=e.__toESM(n);function r(e){let t=!1,n;return function(...r){if(t){if(n)return n;throw Error(`Function called more than once`)}return t=!0,n=e.apply(this,r),n}}const i={make:e=>{let r,i=!1;return n.Effect.gen(function*(){if(i){if(r!==void 0)return r;yield*new t.UploadistaError({code:`UNKNOWN_ERROR`,status:500,body:`Effect called more than once with undefined result`}).toEffect()}return i=!0,r=yield*e,r})},legacy:r};exports.OnceEffect=i,exports.once=r;

package/dist/utils/once.d.cts

@@ -1,25 +0,0 @@
-import { UploadistaError } from "../uploadista-error-kKlhLRhY.cjs";
-import { Effect } from "effect";
-
-//#region src/utils/once.d.ts
-declare function once<T, A extends unknown[], Return>(fn: (this: T, ...args: A) => Return): (this: T, ...args: A) => Return;
-/**
- * Effect-based once utilities
- */
-declare const OnceEffect: {
-  /**
-   * Creates an Effect-based once function that only executes once
-   * @param effect - The effect to execute only once
-   * @returns Effect that caches the result after first execution
-   */
-  make: <A, E, R>(effect: Effect.Effect<A, E, R>) => Effect.Effect<A, E | UploadistaError, R>;
-  /**
-   * Creates a legacy once function wrapper
-   * @param fn - Function to wrap
-   * @returns Once-wrapped function
-   */
-  legacy: typeof once;
-};
-//#endregion
-export { OnceEffect, once };
-//# sourceMappingURL=once.d.cts.map

package/dist/utils/once.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"once.d.cts","names":[],"sources":["../../src/utils/once.ts"],"sourcesContent":[],"mappings":";;;;iBAIgB,gDACH,YAAY,MAAM,gBAIH,YAAY,MAAI;;AAL5C;;AACa,cAqBA,UArBA,EAAA;;;;;;EAIqC,IAAA,EAAA,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,MAAA,EAwBtC,MAAA,CAAO,MAxB+B,CAwBxB,CAxBwB,EAwBrB,CAxBqB,EAwBlB,CAxBkB,CAAA,EAAA,GAyB7C,MAAA,CAAO,MAzBsC,CAyB/B,CAzB+B,EAyB5B,CAzB4B,GAyBxB,eAzBwB,EAyBP,CAzBO,CAAA;EAiBrC;;;;;QAOD,EAAA,WAAO"}

package/dist/utils/once.d.ts

@@ -1,21 +0,0 @@
-import { Effect } from "effect";
-import { UploadistaError } from "../errors/uploadista-error";
-export declare function once<T, A extends unknown[], Return>(fn: (this: T, ...args: A) => Return): (this: T, ...args: A) => Return;
-/**
- * Effect-based once utilities
- */
-export declare const OnceEffect: {
-    /**
-     * Creates an Effect-based once function that only executes once
-     * @param effect - The effect to execute only once
-     * @returns Effect that caches the result after first execution
-     */
-    make: <A, E, R>(effect: Effect.Effect<A, E, R>) => Effect.Effect<A, E | UploadistaError, R>;
-    /**
-     * Creates a legacy once function wrapper
-     * @param fn - Function to wrap
-     * @returns Once-wrapped function
-     */
-    legacy: typeof once;
-};
-//# sourceMappingURL=once.d.ts.map

package/dist/utils/once.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"once.d.ts","sourceRoot":"","sources":["../../src/utils/once.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAChC,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAG7D,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,SAAS,OAAO,EAAE,EAAE,MAAM,EACjD,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC,KAAK,MAAM,UAIT,CAAC,WAAW,CAAC,KAAG,MAAM,CAYjD;AAED;;GAEG;AACH,eAAO,MAAM,UAAU;IACrB;;;;OAIG;WACI,CAAC,EAAE,CAAC,EAAE,CAAC,UACJ,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAC7B,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,CAAC;IAsB3C;;;;OAIG;;CAEJ,CAAC"}

package/dist/utils/once.js

@@ -1,54 +0,0 @@
-import { Effect } from "effect";
-import { UploadistaError } from "../errors/uploadista-error";
-// only call a function once
-export function once(fn) {
-    let called = false;
-    let value;
-    const f = function (...args) {
-        if (called) {
-            if (value) {
-                return value;
-            }
-            throw new Error("Function called more than once");
-        }
-        called = true;
-        value = fn.apply(this, args);
-        return value;
-    };
-    return f;
-}
-/**
- * Effect-based once utilities
- */
-export const OnceEffect = {
-    /**
-     * Creates an Effect-based once function that only executes once
-     * @param effect - The effect to execute only once
-     * @returns Effect that caches the result after first execution
-     */
-    make: (effect) => {
-        let cached;
-        let called = false;
-        return Effect.gen(function* () {
-            if (called) {
-                if (cached !== undefined) {
-                    return cached;
-                }
-                yield* new UploadistaError({
-                    code: "UNKNOWN_ERROR",
-                    status: 500,
-                    body: "Effect called more than once with undefined result",
-                }).toEffect();
-            }
-            called = true;
-            cached = yield* effect;
-            return cached;
-        });
-    },
-    /**
-     * Creates a legacy once function wrapper
-     * @param fn - Function to wrap
-     * @returns Once-wrapped function
-     */
-    legacy: once,
-};