@uploadista/core 0.1.1 → 0.1.3-beta.10

package/dist/{utils-DVwfrVBJ.mjs.map → utils-Zq5USthu.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"utils-DVwfrVBJ.mjs","names":[],"sources":["../src/utils/md5.ts","../src/utils/once.ts","../src/utils/debounce.ts","../src/utils/throttle.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","import { Effect } from \"effect\";\nimport { UploadistaError } from \"../errors/uploadista-error\";\n\n// only call a function once\nexport function once<T, A extends unknown[], Return>(\n  fn: (this: T, ...args: A) => Return,\n) {\n  let called = false;\n  let value: Return | undefined;\n  const f = function (this: T, ...args: A): Return {\n    if (called) {\n      if (value) {\n        return value;\n      }\n      throw new Error(\"Function called more than once\");\n    }\n    called = true;\n    value = fn.apply(this, args);\n    return value;\n  };\n  return f;\n}\n\n/**\n * Effect-based once utilities\n */\nexport const OnceEffect = {\n  /**\n   * Creates an Effect-based once function that only executes once\n   * @param effect - The effect to execute only once\n   * @returns Effect that caches the result after first execution\n   */\n  make: <A, E, R>(\n    effect: Effect.Effect<A, E, R>,\n  ): Effect.Effect<A, E | UploadistaError, R> => {\n    let cached: A | undefined;\n    let called = false;\n\n    return Effect.gen(function* () {\n      if (called) {\n        if (cached !== undefined) {\n          return cached;\n        }\n        yield* new UploadistaError({\n          code: \"UNKNOWN_ERROR\",\n          status: 500,\n          body: \"Effect called more than once with undefined result\",\n        }).toEffect();\n      }\n\n      called = true;\n      cached = yield* effect;\n      return cached;\n    });\n  },\n\n  /**\n   * Creates a legacy once function wrapper\n   * @param fn - Function to wrap\n   * @returns Once-wrapped function\n   */\n  legacy: once,\n};\n","type DebounceOptions = {\n  // Whether the first call to the debounced function is run immediately.\n  leading?: boolean;\n\n  // Whether the last call to the debounced function is run after delay\n  // milliseconds have elapsed since the last call.\n  trailing?: boolean;\n};\n\nconst defaultDebounceOptions: DebounceOptions = {\n  leading: false,\n  trailing: true,\n};\n\n/**\n * Returns `fn` wrapped by a function that delays invoking `fn` for `delay`\n * milliseconds since the last call. Set `options.leading` to invoke `fn` on\n * the leading edge of the delay, and/or set `options.trailing` to invoke `fn`\n * on the trailing edge of the delay (true by default).\n *\n * Example for `debounce(fn, 30, {leading: true, trailing: true})`,\n * where `fn` is called twice, with the second call made 20 ms after the first:\n *\n * Time:     0                   20                            50 (ms)\n * Timeline: |----------------------------------------------------------------|\n *           ^                   ^                             ^\n *           |                   |                             |\n *           | First call.       | Second call 20ms after the  | End of delay.\n *           | (instant leading  | first.                      | (trailing edge\n *           |  edge call)       |                             |  call)\n *                               |-----------------------------|\n *                               |  30 ms delay for debounce.  |\n *\n *\n * Note that if both `options.leading` and `options.trailing` are true, `fn`\n * will only be invoked on the trailing edge if the debounced function is called\n * more than once during the delay.\n *\n * @param fn - Function to debounce.\n * @param delay - Milliseconds to delay calling `fn` since the last call.\n * @param debounceOptions - See `DebounceOptions` and `defaultDebounceOptions`.\n * @returns A debounced `fn`.\n */\nexport function debounce<T, A extends unknown[]>(\n  fn: (this: T, ...args: A) => void,\n  delay: number,\n  debounceOptions: DebounceOptions = {},\n): (this: T, ...args: A) => void {\n  const options = { ...defaultDebounceOptions, ...debounceOptions };\n\n  let timer: ReturnType<typeof setTimeout> | undefined;\n\n  return function (this: T, ...args: A): void {\n    if (options.leading && !timer) {\n      // Leading edge.\n      // Call fn on the leading edge, when debouncing hasn't started yet.\n      console.log(\"leading\");\n      fn.apply(this, args);\n\n      // Debounce the next call.\n      timer = setTimeout(() => {\n        timer = undefined;\n      }, delay);\n    } else {\n      // Trailing edge.\n      // Postpone calling fn until the delay has elapsed since the last call.\n      // Each call clears any previously delayed call and resets the delay, so\n      // the postponed call will always be the last one.\n      clearTimeout(timer);\n      timer = setTimeout(() => {\n        if (options.trailing) {\n          // Call fn on the trailing edge.\n          fn.apply(this, args);\n\n          if (options.leading) {\n            // Debounce next leading call since a trailing call was just made.\n            setTimeout(() => {\n              timer = undefined;\n            }, delay);\n          }\n        } else {\n          // No trailing call. Since the delay has elapsed since the last call,\n          // immediately reset the debouncing delay.\n          timer = undefined;\n        }\n      }, delay);\n    }\n  };\n}\n","import { debounce } from \"./debounce.js\";\n\nexport function throttle<T, A extends unknown[], Return>(\n  fn: (this: T, ...args: A) => Return,\n  wait: number,\n  {\n    leading = true,\n    trailing = true,\n  }: { leading?: boolean; trailing?: boolean } = {},\n) {\n  return debounce(fn, wait, {\n    leading,\n    trailing,\n  });\n}\n\n/**\n * Effect-based throttle utilities\n */\nexport const ThrottleEffect = {\n  /**\n   * Creates a legacy throttle function wrapper\n   * @param fn - Function to throttle\n   * @param wait - Wait time in milliseconds\n   * @param options - Throttle options\n   * @returns Throttled function\n   */\n  legacy: throttle,\n};\n"],"mappings":"oFAyDA,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,OACX,EACA,EACA,EACA,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,IAAI,EAAY,EAAE,IAAM,EACpB,EAAY,EAAE,IAAM,EACpB,EAAY,EAAE,IAAM,EACpB,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,cACd,EACA,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,cACd,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,cACd,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,OACX,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,CCrd1C,SAAgB,EACd,EACA,CACA,IAAI,EAAS,GACT,EAYJ,OAXU,SAAmB,GAAG,EAAiB,CAC/C,GAAI,EAAQ,CACV,GAAI,EACF,OAAO,EAET,MAAU,MAAM,iCAAiC,CAInD,MAFA,GAAS,GACT,EAAQ,EAAG,MAAM,KAAM,EAAK,CACrB,GAQX,MAAa,EAAa,CAMxB,KACE,GAC6C,CAC7C,IAAI,EACA,EAAS,GAEb,OAAO,EAAO,IAAI,WAAa,CAC7B,GAAI,EAAQ,CACV,GAAI,IAAW,IAAA,GACb,OAAO,EAET,MAAO,IAAI,EAAgB,CACzB,KAAM,gBACN,OAAQ,IACR,KAAM,qDACP,CAAC,CAAC,UAAU,CAKf,MAFA,GAAS,GACT,EAAS,MAAO,EACT,GACP,EAQJ,OAAQ,EACT,CCrDK,EAA0C,CAC9C,QAAS,GACT,SAAU,GACX,CA+BD,SAAgB,EACd,EACA,EACA,EAAmC,EAAE,CACN,CAC/B,IAAM,EAAU,CAAE,GAAG,EAAwB,GAAG,EAAiB,CAE7D,EAEJ,OAAO,SAAmB,GAAG,EAAe,CACtC,EAAQ,SAAW,CAAC,GAGtB,QAAQ,IAAI,UAAU,CACtB,EAAG,MAAM,KAAM,EAAK,CAGpB,EAAQ,eAAiB,CACvB,EAAQ,IAAA,IACP,EAAM,GAMT,aAAa,EAAM,CACnB,EAAQ,eAAiB,CACnB,EAAQ,UAEV,EAAG,MAAM,KAAM,EAAK,CAEhB,EAAQ,SAEV,eAAiB,CACf,EAAQ,IAAA,IACP,EAAM,EAKX,EAAQ,IAAA,IAET,EAAM,GCnFf,SAAgB,EACd,EACA,EACA,CACE,UAAU,GACV,WAAW,IACkC,EAAE,CACjD,CACA,OAAO,EAAS,EAAI,EAAM,CACxB,UACA,WACD,CAAC,CAMJ,MAAa,EAAiB,CAQ5B,OAAQ,EACT"}
+{"version":3,"file":"utils-Zq5USthu.mjs","names":[],"sources":["../src/utils/md5.ts","../src/utils/once.ts","../src/utils/debounce.ts","../src/utils/throttle.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","import { Effect } from \"effect\";\nimport { UploadistaError } from \"../errors/uploadista-error\";\n\n// only call a function once\nexport function once<T, A extends unknown[], Return>(\n  fn: (this: T, ...args: A) => Return,\n) {\n  let called = false;\n  let value: Return | undefined;\n  const f = function (this: T, ...args: A): Return {\n    if (called) {\n      if (value) {\n        return value;\n      }\n      throw new Error(\"Function called more than once\");\n    }\n    called = true;\n    value = fn.apply(this, args);\n    return value;\n  };\n  return f;\n}\n\n/**\n * Effect-based once utilities\n */\nexport const OnceEffect = {\n  /**\n   * Creates an Effect-based once function that only executes once\n   * @param effect - The effect to execute only once\n   * @returns Effect that caches the result after first execution\n   */\n  make: <A, E, R>(\n    effect: Effect.Effect<A, E, R>,\n  ): Effect.Effect<A, E | UploadistaError, R> => {\n    let cached: A | undefined;\n    let called = false;\n\n    return Effect.gen(function* () {\n      if (called) {\n        if (cached !== undefined) {\n          return cached;\n        }\n        yield* new UploadistaError({\n          code: \"UNKNOWN_ERROR\",\n          status: 500,\n          body: \"Effect called more than once with undefined result\",\n        }).toEffect();\n      }\n\n      called = true;\n      cached = yield* effect;\n      return cached;\n    });\n  },\n\n  /**\n   * Creates a legacy once function wrapper\n   * @param fn - Function to wrap\n   * @returns Once-wrapped function\n   */\n  legacy: once,\n};\n","type DebounceOptions = {\n  // Whether the first call to the debounced function is run immediately.\n  leading?: boolean;\n\n  // Whether the last call to the debounced function is run after delay\n  // milliseconds have elapsed since the last call.\n  trailing?: boolean;\n};\n\nconst defaultDebounceOptions: DebounceOptions = {\n  leading: false,\n  trailing: true,\n};\n\n/**\n * Returns `fn` wrapped by a function that delays invoking `fn` for `delay`\n * milliseconds since the last call. Set `options.leading` to invoke `fn` on\n * the leading edge of the delay, and/or set `options.trailing` to invoke `fn`\n * on the trailing edge of the delay (true by default).\n *\n * Example for `debounce(fn, 30, {leading: true, trailing: true})`,\n * where `fn` is called twice, with the second call made 20 ms after the first:\n *\n * Time:     0                   20                            50 (ms)\n * Timeline: |----------------------------------------------------------------|\n *           ^                   ^                             ^\n *           |                   |                             |\n *           | First call.       | Second call 20ms after the  | End of delay.\n *           | (instant leading  | first.                      | (trailing edge\n *           |  edge call)       |                             |  call)\n *                               |-----------------------------|\n *                               |  30 ms delay for debounce.  |\n *\n *\n * Note that if both `options.leading` and `options.trailing` are true, `fn`\n * will only be invoked on the trailing edge if the debounced function is called\n * more than once during the delay.\n *\n * @param fn - Function to debounce.\n * @param delay - Milliseconds to delay calling `fn` since the last call.\n * @param debounceOptions - See `DebounceOptions` and `defaultDebounceOptions`.\n * @returns A debounced `fn`.\n */\nexport function debounce<T, A extends unknown[]>(\n  fn: (this: T, ...args: A) => void,\n  delay: number,\n  debounceOptions: DebounceOptions = {},\n): (this: T, ...args: A) => void {\n  const options = { ...defaultDebounceOptions, ...debounceOptions };\n\n  let timer: ReturnType<typeof setTimeout> | undefined;\n\n  return function (this: T, ...args: A): void {\n    if (options.leading && !timer) {\n      // Leading edge.\n      // Call fn on the leading edge, when debouncing hasn't started yet.\n      console.log(\"leading\");\n      fn.apply(this, args);\n\n      // Debounce the next call.\n      timer = setTimeout(() => {\n        timer = undefined;\n      }, delay);\n    } else {\n      // Trailing edge.\n      // Postpone calling fn until the delay has elapsed since the last call.\n      // Each call clears any previously delayed call and resets the delay, so\n      // the postponed call will always be the last one.\n      clearTimeout(timer);\n      timer = setTimeout(() => {\n        if (options.trailing) {\n          // Call fn on the trailing edge.\n          fn.apply(this, args);\n\n          if (options.leading) {\n            // Debounce next leading call since a trailing call was just made.\n            setTimeout(() => {\n              timer = undefined;\n            }, delay);\n          }\n        } else {\n          // No trailing call. Since the delay has elapsed since the last call,\n          // immediately reset the debouncing delay.\n          timer = undefined;\n        }\n      }, delay);\n    }\n  };\n}\n","import { debounce } from \"./debounce.js\";\n\nexport function throttle<T, A extends unknown[], Return>(\n  fn: (this: T, ...args: A) => Return,\n  wait: number,\n  {\n    leading = true,\n    trailing = true,\n  }: { leading?: boolean; trailing?: boolean } = {},\n) {\n  return debounce(fn, wait, {\n    leading,\n    trailing,\n  });\n}\n\n/**\n * Effect-based throttle utilities\n */\nexport const ThrottleEffect = {\n  /**\n   * Creates a legacy throttle function wrapper\n   * @param fn - Function to throttle\n   * @param wait - Wait time in milliseconds\n   * @param options - Throttle options\n   * @returns Throttled function\n   */\n  legacy: throttle,\n};\n"],"mappings":"oFAyDA,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,OACX,EACA,EACA,EACA,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,IAAI,EAAY,EAAE,IAAM,EACpB,EAAY,EAAE,IAAM,EACpB,EAAY,EAAE,IAAM,EACpB,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,cACd,EACA,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,cACd,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,cACd,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,OACX,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,CCrd1C,SAAgB,EACd,EACA,CACA,IAAI,EAAS,GACT,EAYJ,OAXU,SAAmB,GAAG,EAAiB,CAC/C,GAAI,EAAQ,CACV,GAAI,EACF,OAAO,EAET,MAAU,MAAM,iCAAiC,CAInD,MAFA,GAAS,GACT,EAAQ,EAAG,MAAM,KAAM,EAAK,CACrB,GAQX,MAAa,EAAa,CAMxB,KACE,GAC6C,CAC7C,IAAI,EACA,EAAS,GAEb,OAAO,EAAO,IAAI,WAAa,CAC7B,GAAI,EAAQ,CACV,GAAI,IAAW,IAAA,GACb,OAAO,EAET,MAAO,IAAI,EAAgB,CACzB,KAAM,gBACN,OAAQ,IACR,KAAM,qDACP,CAAC,CAAC,UAAU,CAKf,MAFA,GAAS,GACT,EAAS,MAAO,EACT,GACP,EAQJ,OAAQ,EACT,CCrDK,EAA0C,CAC9C,QAAS,GACT,SAAU,GACX,CA+BD,SAAgB,EACd,EACA,EACA,EAAmC,EAAE,CACN,CAC/B,IAAM,EAAU,CAAE,GAAG,EAAwB,GAAG,EAAiB,CAE7D,EAEJ,OAAO,SAAmB,GAAG,EAAe,CACtC,EAAQ,SAAW,CAAC,GAGtB,QAAQ,IAAI,UAAU,CACtB,EAAG,MAAM,KAAM,EAAK,CAGpB,EAAQ,eAAiB,CACvB,EAAQ,IAAA,IACP,EAAM,GAMT,aAAa,EAAM,CACnB,EAAQ,eAAiB,CACnB,EAAQ,UAEV,EAAG,MAAM,KAAM,EAAK,CAEhB,EAAQ,SAEV,eAAiB,CACf,EAAQ,IAAA,IACP,EAAM,EAKX,EAAQ,IAAA,IAET,EAAM,GCnFf,SAAgB,EACd,EACA,EACA,CACE,UAAU,GACV,WAAW,IACkC,EAAE,CACjD,CACA,OAAO,EAAS,EAAI,EAAM,CACxB,UACA,WACD,CAAC,CAMJ,MAAa,EAAiB,CAQ5B,OAAQ,EACT"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@uploadista/core",
-  "version": "0.1.1",
+  "version": "0.1.3-beta.10",
   "description": "Core package of Uploadista",
   "license": "MIT",
   "author": "Uploadista",
@@ -72,12 +72,12 @@
   "devDependencies": {
     "@effect/vitest": "0.27.0",
     "@types/node": "24.10.9",
-    "effect": "3.19.14",
+    "effect": "3.19.15",
     "tsd": "0.33.0",
-    "tsdown": "0.19.0",
-    "vitest": "4.0.17",
-    "zod": "4.3.5",
-    "@uploadista/typescript-config": "0.1.1"
+    "tsdown": "0.20.1",
+    "vitest": "4.0.18",
+    "zod": "4.3.6",
+    "@uploadista/typescript-config": "0.1.3-beta.10"
   },
   "publishConfig": {
     "access": "public",

package/src/errors/uploadista-error.ts

@@ -25,6 +25,7 @@ export type UploadistaErrorCode =
   | "FLOW_JOB_ERROR"
   | "DATASTORE_NOT_FOUND"
   | "FILE_NOT_FOUND"
+  | "UPLOAD_CANCELLED"
   | "INVALID_OFFSET"
   | "FILE_NO_LONGER_EXISTS"
   | "ERR_SIZE_EXCEEDED"
@@ -116,6 +117,10 @@ export const ERROR_CATALOG: Readonly<
     status: 404,
     body: "The file for this url was not found\n",
   },
+  UPLOAD_CANCELLED: {
+    status: 410,
+    body: "The upload was cancelled\n",
+  },
   FLOW_NOT_AUTHORIZED: {
     status: 401,
     body: "The flow is not authorized\n",
@@ -370,6 +375,8 @@ export class UploadistaError extends Data.TaggedError("UploadistaError") {
     this.status = status;
     this.status_code = status; // legacy alias
     this.body = body;
+    // Set message property from body so it's serializable to JSON
+    (this as unknown as { message: string }).message = body;
     this.details = details;
     if (cause) (this as unknown as { cause?: unknown }).cause = cause;
   }

package/src/flow/flow-engine.ts

@@ -472,9 +472,20 @@ function withFlowEvents<
                       },
                     ];
 
+                // Track active upload IDs for cleanup on cancel
+                // The partialData from streaming-input contains the upload file info
+                const partialData = event.partialData as
+                  | { id?: string }
+                  | undefined;
+                const uploadId = partialData?.id;
+                const activeUploads = uploadId
+                  ? [...(job.activeUploads || []), uploadId]
+                  : job.activeUploads;
+
                 yield* kvStore.set(executionJobId, {
                   ...job,
                   tasks: updatedTasks,
+                  activeUploads,
                   updatedAt: new Date(),
                 });
               }
@@ -566,10 +577,20 @@ function withFlowEvents<
                   }
                 }
 
+                // Remove completed upload from activeUploads
+                // The upload is now complete and tracked in intermediateFiles (or preserved as output)
+                let activeUploads = job.activeUploads || [];
+                if (isResultUploadFile(resultData) && resultData.id) {
+                  activeUploads = activeUploads.filter(
+                    (uploadId) => uploadId !== resultData.id,
+                  );
+                }
+
                 yield* kvStore.set(executionJobId, {
                   ...job,
                   tasks: updatedTasks,
                   intermediateFiles,
+                  activeUploads,
                   updatedAt: new Date(),
                 });
               }
@@ -1012,6 +1033,56 @@ export function createFlowEngine() {
               ),
             );
 
+            // Cleanup active uploads (in-progress multipart uploads) on failure
+            yield* Effect.gen(function* () {
+              const failedJob = yield* kvStore.get(jobId);
+              if (
+                failedJob &&
+                failedJob.activeUploads &&
+                failedJob.activeUploads.length > 0
+              ) {
+                yield* Effect.logInfo(
+                  `Cleaning up ${failedJob.activeUploads.length} active uploads for failed job ${jobId}`,
+                );
+
+                yield* Effect.all(
+                  failedJob.activeUploads.map((uploadId) =>
+                    Effect.gen(function* () {
+                      yield* uploadEngine.delete(uploadId, clientId);
+                      yield* Effect.logDebug(
+                        `Aborted active upload ${uploadId} for failed job ${jobId}`,
+                      );
+                    }).pipe(
+                      Effect.catchAll((deleteError) =>
+                        Effect.gen(function* () {
+                          yield* Effect.logWarning(
+                            `Failed to abort active upload ${uploadId}: ${deleteError}`,
+                          );
+                          return Effect.succeed(undefined);
+                        }),
+                      ),
+                    ),
+                  ),
+                  { concurrency: 5 },
+                );
+
+                // Clear the activeUploads array
+                yield* updateJob(jobId, {
+                  activeUploads: [],
+                });
+              }
+            }).pipe(
+              Effect.catchAll((cleanupError) =>
+                Effect.gen(function* () {
+                  yield* Effect.logWarning(
+                    `Failed to cleanup active uploads for job ${jobId}`,
+                    cleanupError,
+                  );
+                  return Effect.succeed(undefined);
+                }),
+              ),
+            );
+
             // Add failed job to Dead Letter Queue for retry/debugging
             const uploadistaError =
               error instanceof UploadistaError
@@ -1373,6 +1444,56 @@ export function createFlowEngine() {
                     ),
                   );
 
+                  // Cleanup active uploads (in-progress multipart uploads) on failure
+                  yield* Effect.gen(function* () {
+                    const failedJob = yield* kvStore.get(jobId);
+                    if (
+                      failedJob &&
+                      failedJob.activeUploads &&
+                      failedJob.activeUploads.length > 0
+                    ) {
+                      yield* Effect.logInfo(
+                        `Cleaning up ${failedJob.activeUploads.length} active uploads for failed job ${jobId}`,
+                      );
+
+                      yield* Effect.all(
+                        failedJob.activeUploads.map((uploadId) =>
+                          Effect.gen(function* () {
+                            yield* uploadEngine.delete(uploadId, clientId);
+                            yield* Effect.logDebug(
+                              `Aborted active upload ${uploadId} for failed job ${jobId}`,
+                            );
+                          }).pipe(
+                            Effect.catchAll((deleteError) =>
+                              Effect.gen(function* () {
+                                yield* Effect.logWarning(
+                                  `Failed to abort active upload ${uploadId}: ${deleteError}`,
+                                );
+                                return Effect.succeed(undefined);
+                              }),
+                            ),
+                          ),
+                        ),
+                        { concurrency: 5 },
+                      );
+
+                      // Clear the activeUploads array
+                      yield* updateJob(jobId, {
+                        activeUploads: [],
+                      });
+                    }
+                  }).pipe(
+                    Effect.catchAll((cleanupError) =>
+                      Effect.gen(function* () {
+                        yield* Effect.logWarning(
+                          `Failed to cleanup active uploads for job ${jobId}`,
+                          cleanupError,
+                        );
+                        return Effect.succeed(undefined);
+                      }),
+                    ),
+                  );
+
                   // Add failed job to Dead Letter Queue for retry/debugging
                   const uploadistaError =
                     error instanceof UploadistaError
@@ -1540,6 +1661,39 @@ export function createFlowEngine() {
             eventType: EventType.FlowCancel,
           });
 
+          // Cleanup active uploads (in-progress multipart uploads)
+          if (job.activeUploads && job.activeUploads.length > 0) {
+            yield* Effect.logInfo(
+              `Cleaning up ${job.activeUploads.length} active uploads for job ${jobId}`,
+            );
+
+            yield* Effect.all(
+              job.activeUploads.map((uploadId) =>
+                Effect.gen(function* () {
+                  yield* uploadEngine.delete(uploadId, clientId);
+                  yield* Effect.logDebug(
+                    `Aborted active upload ${uploadId} for job ${jobId}`,
+                  );
+                }).pipe(
+                  Effect.catchAll((error) =>
+                    Effect.gen(function* () {
+                      yield* Effect.logWarning(
+                        `Failed to abort active upload ${uploadId}: ${error}`,
+                      );
+                      return Effect.succeed(undefined);
+                    }),
+                  ),
+                ),
+              ),
+              { concurrency: 5 },
+            );
+
+            // Clear the activeUploads array
+            yield* updateJob(jobId, {
+              activeUploads: [],
+            });
+          }
+
           // Cleanup intermediate files
           yield* cleanupIntermediateFiles(jobId, clientId);