@secrecy/lib 1.0.0-dev.68 → 1.0.0-dev.69

package/dist/crypto/file.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/crypto/file.ts"],"sourcesContent":["import type { MessageTag } from \"libsodium-wrappers\";\nimport { setup, sodium } from \"../sodium.js\";\nimport SparkMD5 from \"spark-md5\";\nimport { chunks } from \"../utils/utils.js\";\n\nexport type EncryptedFile = {\n  data: Uint8Array;\n  md5: string;\n  md5Encrypted: string;\n};\n\nfunction assert(c: boolean, message: string): void {\n  if (!c) {\n    throw new Error(message);\n  }\n}\n\ntype EncryptFn = (tag: number, plaintext: Uint8Array) => Uint8Array;\n\ntype DecryptFn = (ciphertext: Uint8Array) => MessageTag;\n\nexport function secretstreamKeygen(): Uint8Array {\n  return sodium.crypto_secretstream_xchacha20poly1305_keygen();\n}\n\nfunction encrypt(key: Uint8Array): {\n  destroy: () => void;\n  encrypt: EncryptFn;\n  header: Uint8Array;\n} {\n  let destroyed = false;\n  const { state, header } =\n    sodium.crypto_secretstream_xchacha20poly1305_init_push(key);\n\n  const encrypt: EncryptFn = (tag, plaintext) => {\n    assert(destroyed === false, \"state already destroyed\");\n\n    return sodium.crypto_secretstream_xchacha20poly1305_push(\n      state,\n      plaintext,\n      null,\n      tag\n    );\n  };\n\n  function destroy(): void {\n    assert(destroyed === false, \"state already destroyed\");\n    destroyed = true;\n  }\n\n  return {\n    encrypt,\n    destroy,\n    header\n  };\n}\n\nfunction decrypt(\n  header: Uint8Array,\n  key: Uint8Array\n): {\n  destroy: () => void;\n  decrypt: DecryptFn;\n} {\n  assert(\n    header.byteLength >=\n      sodium.crypto_secretstream_xchacha20poly1305_HEADERBYTES,\n    `header must be at least HEADERBYTES (${sodium.crypto_secretstream_xchacha20poly1305_HEADERBYTES}) long`\n  );\n  assert(\n    key.byteLength >= sodium.crypto_secretstream_xchacha20poly1305_KEYBYTES,\n    `key must be at least KEYBYTES (${sodium.crypto_secretstream_xchacha20poly1305_KEYBYTES}) long`\n  );\n\n  let destroyed = false;\n  const state = sodium.crypto_secretstream_xchacha20poly1305_init_pull(\n    header,\n    key\n  );\n\n  const decrypt: DecryptFn = ciphertext => {\n    assert(destroyed === false, \"state already destroyed\");\n\n    return sodium.crypto_secretstream_xchacha20poly1305_pull(state, ciphertext);\n  };\n\n  function destroy(): void {\n    assert(destroyed === false, \"state already destroyed\");\n    destroyed = true;\n  }\n\n  return {\n    decrypt,\n    destroy\n  };\n}\n\nexport const CHUNK_SIZE = 8192;\n\nexport type Progress = {\n  percent: number;\n  total: number;\n  current: number;\n};\n\nexport async function encryptSecretstream(\n  key: Uint8Array,\n  data: Uint8Array,\n  progress?: (progress: Progress) => Promise<void>,\n  abort?: AbortController\n): Promise<EncryptedFile> {\n  await setup();\n  const { encrypt: crypt, destroy, header } = encrypt(key);\n  const cryptedChunk =\n    CHUNK_SIZE + sodium.crypto_secretstream_xchacha20poly1305_ABYTES;\n  const max =\n    Math.ceil(data.byteLength / CHUNK_SIZE) * cryptedChunk + header.byteLength;\n\n  progress?.({\n    percent: 0,\n    total: max,\n    current: 0\n  });\n  const final = new Uint8Array(max);\n  const sparkEncrypted = new SparkMD5.ArrayBuffer();\n  const spark = new SparkMD5.ArrayBuffer();\n\n  final.set(header);\n  sparkEncrypted.append(header);\n  let total = header.byteLength;\n  progress?.({\n    percent: total / max,\n    total: max,\n    current: total\n  });\n  let lastPercent = total / max;\n\n  for (const chunk of chunks(data, CHUNK_SIZE)) {\n    if (abort?.signal.aborted) {\n      throw new Error(`Encrypt aborted`);\n    }\n    spark.append(chunk);\n    const tag =\n      chunk.length < CHUNK_SIZE\n        ? sodium.crypto_secretstream_xchacha20poly1305_TAG_FINAL\n        : sodium.crypto_secretstream_xchacha20poly1305_TAG_MESSAGE;\n    const crypted = crypt(tag, chunk);\n    sparkEncrypted.append(crypted);\n    final.set(crypted, total);\n    total += crypted.byteLength;\n    const percent = total / max;\n    if (percent > lastPercent + 0.01) {\n      progress?.({\n        percent,\n        total: max,\n        current: total\n      });\n      lastPercent = percent;\n    }\n  }\n\n  destroy();\n  progress?.({\n    percent: 1,\n    total,\n    current: total\n  });\n  return {\n    data: final.slice(0, total),\n    md5Encrypted: sparkEncrypted.end(),\n    md5: spark.end()\n  };\n}\n\nexport async function decryptSecretstream(\n  key: Uint8Array,\n  data: Uint8Array,\n  progress?: (progress: Progress) => Promise<void>,\n  abort?: AbortController\n): Promise<Uint8Array> {\n  await setup();\n  const header = data.slice(\n    0,\n    sodium.crypto_secretstream_xchacha20poly1305_HEADERBYTES\n  );\n  data = data.slice(sodium.crypto_secretstream_xchacha20poly1305_HEADERBYTES);\n\n  const { decrypt: decryptt, destroy } = decrypt(header, key);\n  const chunkSize =\n    CHUNK_SIZE + sodium.crypto_secretstream_xchacha20poly1305_ABYTES;\n  const max = Math.ceil(data.byteLength / chunkSize) * CHUNK_SIZE;\n\n  progress?.({\n    percent: 0,\n    total: max,\n    current: 0\n  });\n  const final = new Uint8Array(max);\n  let total = 0;\n\n  let lastPercent = total / max;\n\n  for (const chunk of chunks(data, chunkSize)) {\n    if (abort?.signal.aborted) {\n      throw new Error(`Decrypt aborted`);\n    }\n    const tmp = decryptt(chunk);\n    final.set(tmp.message, total);\n    total += tmp.message.byteLength;\n    const percent = total / max;\n    if (percent > lastPercent + 0.01) {\n      progress?.({\n        percent,\n        total: max,\n        current: total\n      });\n      lastPercent = percent;\n    }\n  }\n\n  destroy();\n  progress?.({\n    percent: 1,\n    total,\n    current: total\n  });\n  return final.slice(0, total);\n}\n\n// async function mainSecretstream(random: Uint8Array): Promise<void> {\n//   const key = secretstreamKeygen();\n//   console.time(\"secretstream_encrypt\");\n//   const crypted = encryptSecretstream(key, random);\n//   console.timeEnd(\"secretstream_encrypt\");\n//   console.time(\"secretstream_decrypt\");\n//   const decrypted = decryptSecretstream(key, crypted);\n//   console.timeEnd(\"secretstream_decrypt\");\n//   const first = to_hex(random).slice(0, 32);\n//   const final = to_hex(decrypted).slice(0, 32);\n//   console.log({\n//     first,\n//     final,\n//     equals: first === final\n//   });\n// }\n// async function mainSecretbox(random: Uint8Array): Promise<void> {\n//   const key = generateSecretBox();\n//   console.time(\"secretbox_encrypt\");\n//   const crypted = encryptFile(random, key);\n//   console.timeEnd(\"secretbox_encrypt\");\n//   console.time(\"secretbox_decrypt\");\n//   const decrypted = decryptFile(crypted, key);\n//   console.timeEnd(\"secretbox_decrypt\");\n//   const first = to_hex(random).slice(0, 32);\n//   const final = to_hex(decrypted).slice(0, 32);\n//   console.log({\n//     first,\n//     final,\n//     equals: first === final\n//   });\n// }\n\n// async function main(): Promise<void> {\n//   await ready;\n//   console.time(\"randombytes_buf\");\n//   const random = randombytes_buf(1_000_000 * 1024);\n//   console.timeEnd(\"randombytes_buf\");\n//   await Promise.all([mainSecretstream(random), mainSecretbox(random)]);\n// }\n\n// main();\n"],"mappings":"yCACA,OAAS,SAAAA,EAAO,UAAAC,MAAc,eAC9B,OAAOC,MAAc,YACrB,OAAS,UAAAC,MAAc,oBAQvB,SAASC,EAAOC,EAAYC,EAAuB,CACjD,GAAI,CAACD,EACH,MAAM,IAAI,MAAMC,CAAO,CAE3B,CAMO,SAASC,GAAiC,CAC/C,OAAON,EAAO,6CAA6C,CAC7D,CAEA,SAASO,EAAQC,EAIf,CACA,IAAIC,EAAY,GAChB,KAAM,CAAE,MAAAC,EAAO,OAAAC,CAAO,EACpBX,EAAO,gDAAgDQ,CAAG,EAEtDD,EAAqB,CAACK,EAAKC,KAC/BV,EAAOM,IAAc,GAAO,yBAAyB,EAE9CT,EAAO,2CACZU,EACAG,EACA,KACAD,CACF,GAGF,SAASE,GAAgB,CACvBX,EAAOM,IAAc,GAAO,yBAAyB,EACrDA,EAAY,EACd,CAEA,MAAO,CACL,QAAAF,EACA,QAAAO,EACA,OAAAH,CACF,CACF,CAEA,SAASI,EACPJ,EACAH,EAIA,CACAL,EACEQ,EAAO,YACLX,EAAO,kDACT,wCAAwCA,EAAO,yDACjD,EACAG,EACEK,EAAI,YAAcR,EAAO,+CACzB,kCAAkCA,EAAO,sDAC3C,EAEA,IAAIS,EAAY,GAChB,MAAMC,EAAQV,EAAO,gDACnBW,EACAH,CACF,EAEMO,EAAqBC,IACzBb,EAAOM,IAAc,GAAO,yBAAyB,EAE9CT,EAAO,2CAA2CU,EAAOM,CAAU,GAG5E,SAASF,GAAgB,CACvBX,EAAOM,IAAc,GAAO,yBAAyB,EACrDA,EAAY,EACd,CAEA,MAAO,CACL,QAAAM,EACA,QAAAD,CACF,CACF,CAEO,MAAMG,EAAa,KAQ1B,SAAsBC,EACpBV,EACAW,EACAC,EACAC,EACwB,QAAAC,EAAA,sBACxB,MAAMvB,EAAM,EACZ,KAAM,CAAE,QAASwB,EAAO,QAAAT,EAAS,OAAAH,CAAO,EAAIJ,EAAQC,CAAG,EACjDgB,EACJP,EAAajB,EAAO,6CAChByB,EACJ,KAAK,KAAKN,EAAK,WAAaF,CAAU,EAAIO,EAAeb,EAAO,WAElES,GAAA,MAAAA,EAAW,CACT,QAAS,EACT,MAAOK,EACP,QAAS,CACX,GACA,MAAMC,EAAQ,IAAI,WAAWD,CAAG,EAC1BE,EAAiB,IAAI1B,EAAS,YAC9B2B,EAAQ,IAAI3B,EAAS,YAE3ByB,EAAM,IAAIf,CAAM,EAChBgB,EAAe,OAAOhB,CAAM,EAC5B,IAAIkB,EAAQlB,EAAO,WACnBS,GAAA,MAAAA,EAAW,CACT,QAASS,EAAQJ,EACjB,MAAOA,EACP,QAASI,CACX,GACA,IAAIC,EAAcD,EAAQJ,EAE1B,UAAWM,KAAS7B,EAAOiB,EAAMF,CAAU,EAAG,CAC5C,GAAII,GAAA,MAAAA,EAAO,OAAO,QAChB,MAAM,IAAI,MAAM,iBAAiB,EAEnCO,EAAM,OAAOG,CAAK,EAClB,MAAMnB,EACJmB,EAAM,OAASd,EACXjB,EAAO,gDACPA,EAAO,kDACPgC,EAAUT,EAAMX,EAAKmB,CAAK,EAChCJ,EAAe,OAAOK,CAAO,EAC7BN,EAAM,IAAIM,EAASH,CAAK,EACxBA,GAASG,EAAQ,WACjB,MAAMC,EAAUJ,EAAQJ,EACpBQ,EAAUH,EAAc,MAC1BV,GAAA,MAAAA,EAAW,CACT,QAAAa,EACA,MAAOR,EACP,QAASI,CACX,GACAC,EAAcG,EAElB,CAEA,OAAAnB,EAAQ,EACRM,GAAA,MAAAA,EAAW,CACT,QAAS,EACT,MAAAS,EACA,QAASA,CACX,GACO,CACL,KAAMH,EAAM,MAAM,EAAGG,CAAK,EAC1B,aAAcF,EAAe,IAAI,EACjC,IAAKC,EAAM,IAAI,CACjB,CACF,GAEA,SAAsBM,EACpB1B,EACAW,EACAC,EACAC,EACqB,QAAAC,EAAA,sBACrB,MAAMvB,EAAM,EACZ,MAAMY,EAASQ,EAAK,MAClB,EACAnB,EAAO,iDACT,EACAmB,EAAOA,EAAK,MAAMnB,EAAO,iDAAiD,EAE1E,KAAM,CAAE,QAASmC,EAAU,QAAArB,CAAQ,EAAIC,EAAQJ,EAAQH,CAAG,EACpD4B,EACJnB,EAAajB,EAAO,6CAChByB,EAAM,KAAK,KAAKN,EAAK,WAAaiB,CAAS,EAAInB,EAErDG,GAAA,MAAAA,EAAW,CACT,QAAS,EACT,MAAOK,EACP,QAAS,CACX,GACA,MAAMC,EAAQ,IAAI,WAAWD,CAAG,EAChC,IAAII,EAAQ,EAERC,EAAcD,EAAQJ,EAE1B,UAAWM,KAAS7B,EAAOiB,EAAMiB,CAAS,EAAG,CAC3C,GAAIf,GAAA,MAAAA,EAAO,OAAO,QAChB,MAAM,IAAI,MAAM,iBAAiB,EAEnC,MAAMgB,EAAMF,EAASJ,CAAK,EAC1BL,EAAM,IAAIW,EAAI,QAASR,CAAK,EAC5BA,GAASQ,EAAI,QAAQ,WACrB,MAAMJ,EAAUJ,EAAQJ,EACpBQ,EAAUH,EAAc,MAC1BV,GAAA,MAAAA,EAAW,CACT,QAAAa,EACA,MAAOR,EACP,QAASI,CACX,GACAC,EAAcG,EAElB,CAEA,OAAAnB,EAAQ,EACRM,GAAA,MAAAA,EAAW,CACT,QAAS,EACT,MAAAS,EACA,QAASA,CACX,GACOH,EAAM,MAAM,EAAGG,CAAK,CAC7B","names":["setup","sodium","SparkMD5","chunks","assert","c","message","secretstreamKeygen","encrypt","key","destroyed","state","header","tag","plaintext","destroy","decrypt","ciphertext","CHUNK_SIZE","encryptSecretstream","data","progress","abort","__async","crypt","cryptedChunk","max","final","sparkEncrypted","spark","total","lastPercent","chunk","crypted","percent","decryptSecretstream","decryptt","chunkSize","tmp"]}

package/dist/crypto/index.cjs

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});require('../chunk-XDPEU3HV.cjs');var _utilsjs = require('../utils/utils.js');var _sodiumjs = require('../sodium.js');function p(t,o,e){const n=_sodiumjs.sodium.randombytes_buf(_sodiumjs.sodium.crypto_box_NONCEBYTES),c=_sodiumjs.sodium.crypto_box_easy(t,n,_sodiumjs.sodium.from_hex(o),_sodiumjs.sodium.from_hex(e));return _utilsjs.concatenate.call(void 0, n,c)}function s(){return _sodiumjs.sodium.crypto_box_keypair("hex")}function x(t,o,e){if(t.length<_sodiumjs.sodium.crypto_box_NONCEBYTES+_sodiumjs.sodium.crypto_box_MACBYTES)throw"data too short";const n=t.slice(0,_sodiumjs.sodium.crypto_box_NONCEBYTES),c=t.slice(_sodiumjs.sodium.crypto_box_NONCEBYTES);return _sodiumjs.sodium.crypto_box_open_easy(c,n,_sodiumjs.sodium.from_hex(o),_sodiumjs.sodium.from_hex(e))}function a(){return _sodiumjs.sodium.randombytes_buf(_sodiumjs.sodium.crypto_secretbox_KEYBYTES,"hex")}function b(t,o){const e=_sodiumjs.sodium.randombytes_buf(_sodiumjs.sodium.crypto_secretbox_NONCEBYTES),n=_sodiumjs.sodium.crypto_secretbox_easy(t,e,_sodiumjs.sodium.from_hex(o));return _utilsjs.concatenate.call(void 0, e,n)}function f(t,o){if(t.length<_sodiumjs.sodium.crypto_secretbox_NONCEBYTES+_sodiumjs.sodium.crypto_secretbox_MACBYTES)throw"data too short";const e=t.slice(0,_sodiumjs.sodium.crypto_secretbox_NONCEBYTES),n=t.slice(_sodiumjs.sodium.crypto_secretbox_NONCEBYTES);return _sodiumjs.sodium.crypto_secretbox_open_easy(n,e,_sodiumjs.sodium.from_hex(o))}function u(t,o){return _sodiumjs.sodium.crypto_box_seal(t,_sodiumjs.sodium.from_hex(o))}function E(t,{privateKey:o,publicKey:e}){return _sodiumjs.sodium.crypto_box_seal_open(t,_sodiumjs.sodium.from_hex(e),_sodiumjs.sodium.from_hex(o))}exports.decryptAnonymous = E; exports.decryptCryptoBox = x; exports.decryptSecretBox = f; exports.encryptAnonymous = u; exports.encryptCryptoBox = p; exports.encryptSecretBox = b; exports.generateCryptoBoxKeyPair = s; exports.generateSecretBoxKey = a;
-//# sourceMappingURL=index.cjs.map

package/dist/crypto/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/crypto/index.ts"],"names":["concatenate","sodium","encryptCryptoBox","data","publicKeyBob","privateKeyAlice","nonce","crypt","generateCryptoBoxKeyPair","decryptCryptoBox","publicKeyAlice","privateKeyBob","cipher","generateSecretBoxKey","encryptSecretBox","key","decryptSecretBox","encryptAnonymous","receiverPublicKey","decryptAnonymous","privateKey","publicKey"],"mappings":"8BAAA,OAAS,eAAAA,MAAmB,oBAC5B,OAAS,UAAAC,MAAc,eAOhB,SAASC,EACdC,EACAC,EACAC,EACY,CACZ,MAAMC,EAAQL,EAAO,gBAAgBA,EAAO,qBAAqB,EAC3DM,EAAQN,EAAO,gBACnBE,EACAG,EACAL,EAAO,SAASG,CAAY,EAC5BH,EAAO,SAASI,CAAe,CACjC,EACA,OAAOL,EAAYM,EAAOC,CAAK,CACjC,CAEO,SAASC,GAAoC,CAClD,OAAOP,EAAO,mBAAmB,KAAK,CACxC,CAEO,SAASQ,EACdN,EACAO,EACAC,EACY,CACZ,GAAIR,EAAK,OAASF,EAAO,sBAAwBA,EAAO,oBACtD,KAAM,iBAER,MAAMK,EAAQH,EAAK,MAAM,EAAGF,EAAO,qBAAqB,EAClDW,EAAST,EAAK,MAAMF,EAAO,qBAAqB,EACtD,OAAOA,EAAO,qBACZW,EACAN,EACAL,EAAO,SAASS,CAAc,EAC9BT,EAAO,SAASU,CAAa,CAC/B,CACF,CAEO,SAASE,GAA+B,CAC7C,OAAOZ,EAAO,gBAAgBA,EAAO,0BAA2B,KAAK,CACvE,CAEO,SAASa,EAAiBX,EAAkBY,EAAyB,CAC1E,MAAMT,EAAQL,EAAO,gBAAgBA,EAAO,2BAA2B,EACjEM,EAAQN,EAAO,sBAAsBE,EAAMG,EAAOL,EAAO,SAASc,CAAG,CAAC,EAC5E,OAAOf,EAAYM,EAAOC,CAAK,CACjC,CAEO,SAASS,EAAiBb,EAAkBY,EAAyB,CAC1E,GACEZ,EAAK,OACLF,EAAO,4BAA8BA,EAAO,0BAE5C,KAAM,iBAER,MAAMK,EAAQH,EAAK,MAAM,EAAGF,EAAO,2BAA2B,EACxDW,EAAST,EAAK,MAAMF,EAAO,2BAA2B,EAC5D,OAAOA,EAAO,2BAA2BW,EAAQN,EAAOL,EAAO,SAASc,CAAG,CAAC,CAC9E,CAEO,SAASE,EACdd,EACAe,EACY,CACZ,OAAOjB,EAAO,gBAAgBE,EAAMF,EAAO,SAASiB,CAAiB,CAAC,CACxE,CAEO,SAASC,EACdhB,EACA,CAAE,WAAAiB,EAAY,UAAAC,CAAU,EACZ,CACZ,OAAOpB,EAAO,qBACZE,EACAF,EAAO,SAASoB,CAAS,EACzBpB,EAAO,SAASmB,CAAU,CAC5B,CACF","sourcesContent":["import { concatenate } from \"../utils/utils.js\";\nimport { sodium } from \"../sodium.js\";\n\nexport interface KeyPair {\n  publicKey: string;\n  privateKey: string;\n}\n\nexport function encryptCryptoBox(\n  data: Uint8Array,\n  publicKeyBob: string,\n  privateKeyAlice: string\n): Uint8Array {\n  const nonce = sodium.randombytes_buf(sodium.crypto_box_NONCEBYTES);\n  const crypt = sodium.crypto_box_easy(\n    data,\n    nonce,\n    sodium.from_hex(publicKeyBob),\n    sodium.from_hex(privateKeyAlice)\n  );\n  return concatenate(nonce, crypt);\n}\n\nexport function generateCryptoBoxKeyPair(): KeyPair {\n  return sodium.crypto_box_keypair(\"hex\");\n}\n\nexport function decryptCryptoBox(\n  data: Uint8Array,\n  publicKeyAlice: string,\n  privateKeyBob: string\n): Uint8Array {\n  if (data.length < sodium.crypto_box_NONCEBYTES + sodium.crypto_box_MACBYTES) {\n    throw \"data too short\";\n  }\n  const nonce = data.slice(0, sodium.crypto_box_NONCEBYTES);\n  const cipher = data.slice(sodium.crypto_box_NONCEBYTES);\n  return sodium.crypto_box_open_easy(\n    cipher,\n    nonce,\n    sodium.from_hex(publicKeyAlice),\n    sodium.from_hex(privateKeyBob)\n  );\n}\n\nexport function generateSecretBoxKey(): string {\n  return sodium.randombytes_buf(sodium.crypto_secretbox_KEYBYTES, \"hex\");\n}\n\nexport function encryptSecretBox(data: Uint8Array, key: string): Uint8Array {\n  const nonce = sodium.randombytes_buf(sodium.crypto_secretbox_NONCEBYTES);\n  const crypt = sodium.crypto_secretbox_easy(data, nonce, sodium.from_hex(key));\n  return concatenate(nonce, crypt);\n}\n\nexport function decryptSecretBox(data: Uint8Array, key: string): Uint8Array {\n  if (\n    data.length <\n    sodium.crypto_secretbox_NONCEBYTES + sodium.crypto_secretbox_MACBYTES\n  ) {\n    throw \"data too short\";\n  }\n  const nonce = data.slice(0, sodium.crypto_secretbox_NONCEBYTES);\n  const cipher = data.slice(sodium.crypto_secretbox_NONCEBYTES);\n  return sodium.crypto_secretbox_open_easy(cipher, nonce, sodium.from_hex(key));\n}\n\nexport function encryptAnonymous(\n  data: Uint8Array,\n  receiverPublicKey: string\n): Uint8Array {\n  return sodium.crypto_box_seal(data, sodium.from_hex(receiverPublicKey));\n}\n\nexport function decryptAnonymous(\n  data: Uint8Array,\n  { privateKey, publicKey }: KeyPair\n): Uint8Array {\n  return sodium.crypto_box_seal_open(\n    data,\n    sodium.from_hex(publicKey),\n    sodium.from_hex(privateKey)\n  );\n}\n"]}

package/dist/crypto/index.d.ts

@@ -1,14 +0,0 @@
-interface KeyPair {
-    publicKey: string;
-    privateKey: string;
-}
-declare function encryptCryptoBox(data: Uint8Array, publicKeyBob: string, privateKeyAlice: string): Uint8Array;
-declare function generateCryptoBoxKeyPair(): KeyPair;
-declare function decryptCryptoBox(data: Uint8Array, publicKeyAlice: string, privateKeyBob: string): Uint8Array;
-declare function generateSecretBoxKey(): string;
-declare function encryptSecretBox(data: Uint8Array, key: string): Uint8Array;
-declare function decryptSecretBox(data: Uint8Array, key: string): Uint8Array;
-declare function encryptAnonymous(data: Uint8Array, receiverPublicKey: string): Uint8Array;
-declare function decryptAnonymous(data: Uint8Array, { privateKey, publicKey }: KeyPair): Uint8Array;
-
-export { KeyPair, decryptAnonymous, decryptCryptoBox, decryptSecretBox, encryptAnonymous, encryptCryptoBox, encryptSecretBox, generateCryptoBoxKeyPair, generateSecretBoxKey };

package/dist/crypto/index.js

@@ -1,2 +0,0 @@
-import"../chunk-UPFDSEKI.js";import{concatenate as y}from"../utils/utils.js";import{sodium as r}from"../sodium.js";function p(t,o,e){const n=r.randombytes_buf(r.crypto_box_NONCEBYTES),c=r.crypto_box_easy(t,n,r.from_hex(o),r.from_hex(e));return y(n,c)}function s(){return r.crypto_box_keypair("hex")}function x(t,o,e){if(t.length<r.crypto_box_NONCEBYTES+r.crypto_box_MACBYTES)throw"data too short";const n=t.slice(0,r.crypto_box_NONCEBYTES),c=t.slice(r.crypto_box_NONCEBYTES);return r.crypto_box_open_easy(c,n,r.from_hex(o),r.from_hex(e))}function a(){return r.randombytes_buf(r.crypto_secretbox_KEYBYTES,"hex")}function b(t,o){const e=r.randombytes_buf(r.crypto_secretbox_NONCEBYTES),n=r.crypto_secretbox_easy(t,e,r.from_hex(o));return y(e,n)}function f(t,o){if(t.length<r.crypto_secretbox_NONCEBYTES+r.crypto_secretbox_MACBYTES)throw"data too short";const e=t.slice(0,r.crypto_secretbox_NONCEBYTES),n=t.slice(r.crypto_secretbox_NONCEBYTES);return r.crypto_secretbox_open_easy(n,e,r.from_hex(o))}function u(t,o){return r.crypto_box_seal(t,r.from_hex(o))}function E(t,{privateKey:o,publicKey:e}){return r.crypto_box_seal_open(t,r.from_hex(e),r.from_hex(o))}export{E as decryptAnonymous,x as decryptCryptoBox,f as decryptSecretBox,u as encryptAnonymous,p as encryptCryptoBox,b as encryptSecretBox,s as generateCryptoBoxKeyPair,a as generateSecretBoxKey};
-//# sourceMappingURL=index.js.map

package/dist/crypto/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/crypto/index.ts"],"sourcesContent":["import { concatenate } from \"../utils/utils.js\";\nimport { sodium } from \"../sodium.js\";\n\nexport interface KeyPair {\n  publicKey: string;\n  privateKey: string;\n}\n\nexport function encryptCryptoBox(\n  data: Uint8Array,\n  publicKeyBob: string,\n  privateKeyAlice: string\n): Uint8Array {\n  const nonce = sodium.randombytes_buf(sodium.crypto_box_NONCEBYTES);\n  const crypt = sodium.crypto_box_easy(\n    data,\n    nonce,\n    sodium.from_hex(publicKeyBob),\n    sodium.from_hex(privateKeyAlice)\n  );\n  return concatenate(nonce, crypt);\n}\n\nexport function generateCryptoBoxKeyPair(): KeyPair {\n  return sodium.crypto_box_keypair(\"hex\");\n}\n\nexport function decryptCryptoBox(\n  data: Uint8Array,\n  publicKeyAlice: string,\n  privateKeyBob: string\n): Uint8Array {\n  if (data.length < sodium.crypto_box_NONCEBYTES + sodium.crypto_box_MACBYTES) {\n    throw \"data too short\";\n  }\n  const nonce = data.slice(0, sodium.crypto_box_NONCEBYTES);\n  const cipher = data.slice(sodium.crypto_box_NONCEBYTES);\n  return sodium.crypto_box_open_easy(\n    cipher,\n    nonce,\n    sodium.from_hex(publicKeyAlice),\n    sodium.from_hex(privateKeyBob)\n  );\n}\n\nexport function generateSecretBoxKey(): string {\n  return sodium.randombytes_buf(sodium.crypto_secretbox_KEYBYTES, \"hex\");\n}\n\nexport function encryptSecretBox(data: Uint8Array, key: string): Uint8Array {\n  const nonce = sodium.randombytes_buf(sodium.crypto_secretbox_NONCEBYTES);\n  const crypt = sodium.crypto_secretbox_easy(data, nonce, sodium.from_hex(key));\n  return concatenate(nonce, crypt);\n}\n\nexport function decryptSecretBox(data: Uint8Array, key: string): Uint8Array {\n  if (\n    data.length <\n    sodium.crypto_secretbox_NONCEBYTES + sodium.crypto_secretbox_MACBYTES\n  ) {\n    throw \"data too short\";\n  }\n  const nonce = data.slice(0, sodium.crypto_secretbox_NONCEBYTES);\n  const cipher = data.slice(sodium.crypto_secretbox_NONCEBYTES);\n  return sodium.crypto_secretbox_open_easy(cipher, nonce, sodium.from_hex(key));\n}\n\nexport function encryptAnonymous(\n  data: Uint8Array,\n  receiverPublicKey: string\n): Uint8Array {\n  return sodium.crypto_box_seal(data, sodium.from_hex(receiverPublicKey));\n}\n\nexport function decryptAnonymous(\n  data: Uint8Array,\n  { privateKey, publicKey }: KeyPair\n): Uint8Array {\n  return sodium.crypto_box_seal_open(\n    data,\n    sodium.from_hex(publicKey),\n    sodium.from_hex(privateKey)\n  );\n}\n"],"mappings":"6BAAA,OAAS,eAAAA,MAAmB,oBAC5B,OAAS,UAAAC,MAAc,eAOhB,SAASC,EACdC,EACAC,EACAC,EACY,CACZ,MAAMC,EAAQL,EAAO,gBAAgBA,EAAO,qBAAqB,EAC3DM,EAAQN,EAAO,gBACnBE,EACAG,EACAL,EAAO,SAASG,CAAY,EAC5BH,EAAO,SAASI,CAAe,CACjC,EACA,OAAOL,EAAYM,EAAOC,CAAK,CACjC,CAEO,SAASC,GAAoC,CAClD,OAAOP,EAAO,mBAAmB,KAAK,CACxC,CAEO,SAASQ,EACdN,EACAO,EACAC,EACY,CACZ,GAAIR,EAAK,OAASF,EAAO,sBAAwBA,EAAO,oBACtD,KAAM,iBAER,MAAMK,EAAQH,EAAK,MAAM,EAAGF,EAAO,qBAAqB,EAClDW,EAAST,EAAK,MAAMF,EAAO,qBAAqB,EACtD,OAAOA,EAAO,qBACZW,EACAN,EACAL,EAAO,SAASS,CAAc,EAC9BT,EAAO,SAASU,CAAa,CAC/B,CACF,CAEO,SAASE,GAA+B,CAC7C,OAAOZ,EAAO,gBAAgBA,EAAO,0BAA2B,KAAK,CACvE,CAEO,SAASa,EAAiBX,EAAkBY,EAAyB,CAC1E,MAAMT,EAAQL,EAAO,gBAAgBA,EAAO,2BAA2B,EACjEM,EAAQN,EAAO,sBAAsBE,EAAMG,EAAOL,EAAO,SAASc,CAAG,CAAC,EAC5E,OAAOf,EAAYM,EAAOC,CAAK,CACjC,CAEO,SAASS,EAAiBb,EAAkBY,EAAyB,CAC1E,GACEZ,EAAK,OACLF,EAAO,4BAA8BA,EAAO,0BAE5C,KAAM,iBAER,MAAMK,EAAQH,EAAK,MAAM,EAAGF,EAAO,2BAA2B,EACxDW,EAAST,EAAK,MAAMF,EAAO,2BAA2B,EAC5D,OAAOA,EAAO,2BAA2BW,EAAQN,EAAOL,EAAO,SAASc,CAAG,CAAC,CAC9E,CAEO,SAASE,EACdd,EACAe,EACY,CACZ,OAAOjB,EAAO,gBAAgBE,EAAMF,EAAO,SAASiB,CAAiB,CAAC,CACxE,CAEO,SAASC,EACdhB,EACA,CAAE,WAAAiB,EAAY,UAAAC,CAAU,EACZ,CACZ,OAAOpB,EAAO,qBACZE,EACAF,EAAO,SAASoB,CAAS,EACzBpB,EAAO,SAASmB,CAAU,CAC5B,CACF","names":["concatenate","sodium","encryptCryptoBox","data","publicKeyBob","privateKeyAlice","nonce","crypt","generateCryptoBoxKeyPair","decryptCryptoBox","publicKeyAlice","privateKeyBob","cipher","generateSecretBoxKey","encryptSecretBox","key","decryptSecretBox","encryptAnonymous","receiverPublicKey","decryptAnonymous","privateKey","publicKey"]}

package/dist/error.cjs

@@ -1 +0,0 @@
-"use strict";//# sourceMappingURL=error.cjs.map

package/dist/error.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":[],"names":[],"mappings":""}

package/dist/error.d.ts

@@ -1,35 +0,0 @@
-declare type ErrorType = "ErrorUpgradePlan" | "ErrorNotFound" | "ErrorNotExist" | "ErrorAccessDenied" | "ErrorLangNotExist" | "ErrorLimit" | "ErrorStripe" | "ErrorBasic";
-interface ErrorBase {
-    message: string;
-    __typename: ErrorType;
-}
-interface ErrorUpgradePlan extends ErrorBase {
-    __typename: "ErrorUpgradePlan";
-}
-interface ErrorNotFound extends ErrorBase {
-    __typename: "ErrorNotFound";
-    field?: string | undefined;
-}
-interface ErrorNotExist extends ErrorBase {
-    __typename: "ErrorNotExist";
-    field?: string | undefined;
-}
-interface ErrorAccessDenied extends ErrorBase {
-    __typename: "ErrorAccessDenied";
-}
-interface ErrorLangNotExist extends ErrorBase {
-    __typename: "ErrorLangNotExist";
-}
-interface ErrorLimit extends ErrorBase {
-    __typename: "ErrorLimit";
-    field?: string | undefined;
-}
-interface ErrorBasic extends ErrorBase {
-    __typename: "ErrorBasic";
-}
-interface ErrorStripe extends ErrorBase {
-    __typename: "ErrorStripe";
-}
-declare type SecrecyError = ErrorUpgradePlan | ErrorNotFound | ErrorNotExist | ErrorAccessDenied | ErrorLangNotExist | ErrorLimit | ErrorStripe | ErrorBasic;
-
-export { ErrorAccessDenied, ErrorBase, ErrorBasic, ErrorLangNotExist, ErrorLimit, ErrorNotExist, ErrorNotFound, ErrorStripe, ErrorType, ErrorUpgradePlan, SecrecyError };

package/dist/error.js

@@ -1 +0,0 @@
-//# sourceMappingURL=error.js.map

package/dist/error.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/index.ts"],"names":["BaseClient","Lang","FileContentType","MailType","PlanKind","Rights","PayInputType","UserRole","InfuraNetwork","Thunder"],"mappings":"6BAAA,WAAc,oBACd,WAAc,oBAYd,OAAS,cAAAA,MAAkB,kBAoB3B,WAAc,sBACd,WAAc,cACd,WAAc,yBACd,OACE,QAAAC,EACA,mBAAAC,EACA,YAAAC,EACA,YAAAC,EACA,UAAAC,EACA,gBAAAC,EACA,YAAAC,EACA,iBAAAC,EACA,WAAAC,MACK,kBAEP,WAAc","sourcesContent":["export * from \"./client/index.js\";\nexport * from \"./crypto/index.js\";\nexport type { Progress } from \"./crypto/file.js\";\nexport type {\n  User,\n  QueryLimits,\n  DownloadProgress,\n  UserData,\n  MailLimitsValues,\n  CloudLimits,\n  SendReport,\n  SuccessResponse\n} from \"./BaseClient.js\";\nexport { BaseClient } from \"./BaseClient.js\";\nexport type {\n  Node,\n  NodeFull,\n  FileMetadata,\n  SecrecyUserApp,\n  BaseMail,\n  ReceivedMail,\n  SentMail,\n  PublicUser,\n  UserAppSettings,\n  NodeSize,\n  UserAppNotifications,\n  MailFile,\n  MailIntegrity,\n  DraftMail,\n  Mail,\n  WaitingReceivedMail,\n  MailRecipientInput\n} from \"./client/types/index.js\";\nexport * from \"./client/helpers.js\";\nexport * from \"./sodium.js\";\nexport * from \"./utils/store-buddy.js\";\nexport {\n  Lang,\n  FileContentType,\n  MailType,\n  PlanKind,\n  Rights,\n  PayInputType,\n  UserRole,\n  InfuraNetwork,\n  Thunder\n} from \"./zeus/index.js\";\nexport type { GraphQLTypes } from \"./zeus/index.js\";\nexport * from \"./error.js\";\n"]}

package/dist/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/index.ts"],"sourcesContent":["export * from \"./client/index.js\";\nexport * from \"./crypto/index.js\";\nexport type { Progress } from \"./crypto/file.js\";\nexport type {\n  User,\n  QueryLimits,\n  DownloadProgress,\n  UserData,\n  MailLimitsValues,\n  CloudLimits,\n  SendReport,\n  SuccessResponse\n} from \"./BaseClient.js\";\nexport { BaseClient } from \"./BaseClient.js\";\nexport type {\n  Node,\n  NodeFull,\n  FileMetadata,\n  SecrecyUserApp,\n  BaseMail,\n  ReceivedMail,\n  SentMail,\n  PublicUser,\n  UserAppSettings,\n  NodeSize,\n  UserAppNotifications,\n  MailFile,\n  MailIntegrity,\n  DraftMail,\n  Mail,\n  WaitingReceivedMail,\n  MailRecipientInput\n} from \"./client/types/index.js\";\nexport * from \"./client/helpers.js\";\nexport * from \"./sodium.js\";\nexport * from \"./utils/store-buddy.js\";\nexport {\n  Lang,\n  FileContentType,\n  MailType,\n  PlanKind,\n  Rights,\n  PayInputType,\n  UserRole,\n  InfuraNetwork,\n  Thunder\n} from \"./zeus/index.js\";\nexport type { GraphQLTypes } from \"./zeus/index.js\";\nexport * from \"./error.js\";\n"],"mappings":"4BAAA,WAAc,oBACd,WAAc,oBAYd,OAAS,cAAAA,MAAkB,kBAoB3B,WAAc,sBACd,WAAc,cACd,WAAc,yBACd,OACE,QAAAC,EACA,mBAAAC,EACA,YAAAC,EACA,YAAAC,EACA,UAAAC,EACA,gBAAAC,EACA,YAAAC,EACA,iBAAAC,EACA,WAAAC,MACK,kBAEP,WAAc","names":["BaseClient","Lang","FileContentType","MailType","PlanKind","Rights","PayInputType","UserRole","InfuraNetwork","Thunder"]}

package/dist/minify/index.cjs

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});require('../chunk-XDPEU3HV.cjs');var _lz4js = require('./lz4.js');var _utilsjs = require('../utils/utils.js');function y(r){if(r.byteLength>15e6)return _utilsjs.concatenate.call(void 0, new Uint8Array([0]),r);const e=new Uint8Array(_lz4js.compressBlockBound.call(void 0, r.byteLength)),n=_lz4js.compressBlockHC.call(void 0, r,e,0);return n===0?_utilsjs.concatenate.call(void 0, new Uint8Array([0]),r):_utilsjs.concatenate.call(void 0, new Uint8Array([1]),e.slice(0,n))}function U(r){const e=r.slice(1);if(r[0]===0)return e;const n=new Uint8Array(_lz4js.calcUncompressedLen.call(void 0, e)),o=_lz4js.uncompressBlock.call(void 0, e,n);return n.slice(0,o)}exports.compress = y; exports.uncompress = U;
-//# sourceMappingURL=index.cjs.map

package/dist/minify/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/minify/index.ts"],"names":["calcUncompressedLen","compressBlockBound","compressBlockHC","uncompressBlock","concatenate","compress","data","compressed","compressedSize","uncompress","realData","dst","uncompressedSize"],"mappings":"8BAAA,OACE,uBAAAA,EACA,sBAAAC,EACA,mBAAAC,EACA,mBAAAC,MACK,WACP,OAAS,eAAAC,MAAmB,oBAErB,SAASC,EAASC,EAA8B,CACrD,GAAIA,EAAK,WAAa,KACpB,OAAOF,EAAY,IAAI,WAAW,CAAC,CAAC,CAAC,EAAGE,CAAI,EAE9C,MAAMC,EAAa,IAAI,WAAWN,EAAmBK,EAAK,UAAU,CAAC,EAC/DE,EAAiBN,EAAgBI,EAAMC,EAAY,CAAC,EAC1D,OAAIC,IAAmB,EACdJ,EAAY,IAAI,WAAW,CAAC,CAAC,CAAC,EAAGE,CAAI,EAEvCF,EAAY,IAAI,WAAW,CAAC,CAAC,CAAC,EAAGG,EAAW,MAAM,EAAGC,CAAc,CAAC,CAC7E,CAEO,SAASC,EAAWH,EAA8B,CACvD,MAAMI,EAAWJ,EAAK,MAAM,CAAC,EAC7B,GAAIA,EAAK,KAAO,EACd,OAAOI,EAET,MAAMC,EAAM,IAAI,WAAWX,EAAoBU,CAAQ,CAAC,EAClDE,EAAmBT,EAAgBO,EAAUC,CAAG,EACtD,OAAOA,EAAI,MAAM,EAAGC,CAAgB,CACtC","sourcesContent":["import {\n  calcUncompressedLen,\n  compressBlockBound,\n  compressBlockHC,\n  uncompressBlock\n} from \"./lz4.js\";\nimport { concatenate } from \"../utils/utils.js\";\n\nexport function compress(data: Uint8Array): Uint8Array {\n  if (data.byteLength > 15_000_000) {\n    return concatenate(new Uint8Array([0]), data);\n  }\n  const compressed = new Uint8Array(compressBlockBound(data.byteLength));\n  const compressedSize = compressBlockHC(data, compressed, 0);\n  if (compressedSize === 0) {\n    return concatenate(new Uint8Array([0]), data);\n  }\n  return concatenate(new Uint8Array([1]), compressed.slice(0, compressedSize));\n}\n\nexport function uncompress(data: Uint8Array): Uint8Array {\n  const realData = data.slice(1);\n  if (data[0] === 0) {\n    return realData;\n  }\n  const dst = new Uint8Array(calcUncompressedLen(realData));\n  const uncompressedSize = uncompressBlock(realData, dst);\n  return dst.slice(0, uncompressedSize);\n}\n"]}

package/dist/minify/index.d.ts

@@ -1,4 +0,0 @@
-declare function compress(data: Uint8Array): Uint8Array;
-declare function uncompress(data: Uint8Array): Uint8Array;
-
-export { compress, uncompress };

package/dist/minify/index.js

@@ -1,2 +0,0 @@
-import"../chunk-UPFDSEKI.js";import{calcUncompressedLen as s,compressBlockBound as c,compressBlockHC as i,uncompressBlock as m}from"./lz4.js";import{concatenate as t}from"../utils/utils.js";function y(r){if(r.byteLength>15e6)return t(new Uint8Array([0]),r);const e=new Uint8Array(c(r.byteLength)),n=i(r,e,0);return n===0?t(new Uint8Array([0]),r):t(new Uint8Array([1]),e.slice(0,n))}function U(r){const e=r.slice(1);if(r[0]===0)return e;const n=new Uint8Array(s(e)),o=m(e,n);return n.slice(0,o)}export{y as compress,U as uncompress};
-//# sourceMappingURL=index.js.map

package/dist/minify/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/minify/index.ts"],"sourcesContent":["import {\n  calcUncompressedLen,\n  compressBlockBound,\n  compressBlockHC,\n  uncompressBlock\n} from \"./lz4.js\";\nimport { concatenate } from \"../utils/utils.js\";\n\nexport function compress(data: Uint8Array): Uint8Array {\n  if (data.byteLength > 15_000_000) {\n    return concatenate(new Uint8Array([0]), data);\n  }\n  const compressed = new Uint8Array(compressBlockBound(data.byteLength));\n  const compressedSize = compressBlockHC(data, compressed, 0);\n  if (compressedSize === 0) {\n    return concatenate(new Uint8Array([0]), data);\n  }\n  return concatenate(new Uint8Array([1]), compressed.slice(0, compressedSize));\n}\n\nexport function uncompress(data: Uint8Array): Uint8Array {\n  const realData = data.slice(1);\n  if (data[0] === 0) {\n    return realData;\n  }\n  const dst = new Uint8Array(calcUncompressedLen(realData));\n  const uncompressedSize = uncompressBlock(realData, dst);\n  return dst.slice(0, uncompressedSize);\n}\n"],"mappings":"6BAAA,OACE,uBAAAA,EACA,sBAAAC,EACA,mBAAAC,EACA,mBAAAC,MACK,WACP,OAAS,eAAAC,MAAmB,oBAErB,SAASC,EAASC,EAA8B,CACrD,GAAIA,EAAK,WAAa,KACpB,OAAOF,EAAY,IAAI,WAAW,CAAC,CAAC,CAAC,EAAGE,CAAI,EAE9C,MAAMC,EAAa,IAAI,WAAWN,EAAmBK,EAAK,UAAU,CAAC,EAC/DE,EAAiBN,EAAgBI,EAAMC,EAAY,CAAC,EAC1D,OAAIC,IAAmB,EACdJ,EAAY,IAAI,WAAW,CAAC,CAAC,CAAC,EAAGE,CAAI,EAEvCF,EAAY,IAAI,WAAW,CAAC,CAAC,CAAC,EAAGG,EAAW,MAAM,EAAGC,CAAc,CAAC,CAC7E,CAEO,SAASC,EAAWH,EAA8B,CACvD,MAAMI,EAAWJ,EAAK,MAAM,CAAC,EAC7B,GAAIA,EAAK,KAAO,EACd,OAAOI,EAET,MAAMC,EAAM,IAAI,WAAWX,EAAoBU,CAAQ,CAAC,EAClDE,EAAmBT,EAAgBO,EAAUC,CAAG,EACtD,OAAOA,EAAI,MAAM,EAAGC,CAAgB,CACtC","names":["calcUncompressedLen","compressBlockBound","compressBlockHC","uncompressBlock","concatenate","compress","data","compressed","compressedSize","uncompress","realData","dst","uncompressedSize"]}

package/dist/minify/lz4.cjs

@@ -1,3 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});require('../chunk-XDPEU3HV.cjs');// lz4-ts @license BSD-3-Clause / Copyright (c) 2015, Pierre Curto / 2016, oov. All rights reserved.
-const m=new Error("invalid source"),h=new Error("short buffer"),S=4,H=16,s=1<<H,E=s-1,I=16,P=1<<I,z=S*8-I,j=8+S,C=6,M=-1640531535;function q(t,i){const e=t>>>16&65535,r=t&65535,o=i>>>16&65535,n=i&65535;return r*n+(e*n+r*o<<16>>>0)|0}const v=Math.imul?Math.imul:q;function T(t,i){return t[i+3]|t[i+2]<<8|t[i+1]<<16|t[i]<<24}function k(t,i,e,r,o){for(let n=0;n<o;++n)t[e++]=i[r++]}function D(t){const i=t.length;if(i===0)return 0;let e=0,r=0;for(;;){let o=t[e]>>4,n=t[e]&15;if(++e===i)throw m;if(o>0){if(o===15){for(;t[e]===255;)if(o+=255,++e===i)throw m;if(o+=t[e],++e===i)throw m}if(r+=o,e+=o,e>=i)return r}if(e+=2,e>=i)throw m;const f=t[e-2]|t[e-1]<<8;if(r-f<0||f===0)throw m;if(n===15){for(;t[e]===255;)if(n+=255,++e===i)throw m;if(n+=t[e],++e===i)throw m}for(n+=4;n>=f;n-=f)r+=f;r+=n}}function F(t,i){const e=t.length,r=i.length;if(e===0)return 0;let o=0,n=0;for(;;){let f=t[o]>>4,x=t[o]&15;if(++o===e)throw m;if(f>0){if(f===15){for(;t[o]===255;)if(f+=255,++o===e)throw m;if(f+=t[o],++o===e)throw m}if(r-n<f||o+f>e)throw h;if(k(i,t,n,o,f),n+=f,o+=f,o>=e)return n}if(o+=2,o>=e)throw m;const w=t[o-2]|t[o-1]<<8;if(n-w<0||w===0)throw m;if(x===15){for(;t[o]===255;)if(x+=255,++o===e)throw m;if(x+=t[o],++o===e)throw m}if(x+=4,r-n<=x)throw h;for(;x>=w;x-=w)k(i,i,n,n-w,w),n+=w;k(i,i,n,n-w,x),n+=x}}function G(t){return t+(t/255|0)+16}function J(t,i,e){const r=t.length-j,o=i.length;if(r<=0||o===0||e>=r)return 0;let n=0,f=0;const x=new Uint32Array(P);for(;n<e;){const b=v(T(t,n),M)>>>z;x[b]=++n}let w=n,c=1<<C;for(;n<r-S;){const b=v(T(t,n),M)>>>z,l=x[b]-1;if(x[b]=n+1,l<0||n-l>>H>0||t[l]!==t[n]||t[l+1]!==t[n+1]||t[l+2]!==t[n+2]||t[l+3]!==t[n+3]){n+=c>>C,++c;continue}c=1<<C;const g=n-w,U=n-l;n+=S;let L=n;for(;n<=r&&t[n]===t[n-U];)n++;if(L=n-L,L<15?i[f]=L:i[f]=15,g<15)i[f]|=g<<4;else{if(i[f]|=240,++f===o)throw h;let y=g-15;for(;y>=255;y-=255)if(i[f]=255,++f===o)throw h;i[f]=y&255}if(++f===o||f+g>=o||(k(i,t,f,w,g),f+=g,w=n,f+=2,f>=o))throw h;if(i[f-2]=U,i[f-1]=U>>8,L>=15){for(L-=15;L>=255;L-=255)if(i[f]=255,++f===o)throw h;if(i[f]=L,++f===o)throw h}}if(w===0)return 0;let a=t.length-w;if(a<15)i[f]=a<<4;else{if(i[f]=240,++f===o)throw h;for(a-=15;a>=255;a-=255)if(i[f]=255,++f===o)throw h;i[f]=a}if(++f===o)throw h;const A=t.length-w,B=f+A;if(B>o)throw h;return B>=r?0:(k(i,t,f,w,A),f+=A,f)}function K(t,i,e){const r=t.length-j,o=i.length;if(r<=0||o===0||e>=r)return 0;let n=0,f=0;const x=new Uint32Array(P),w=new Uint32Array(s);for(;n<e;){const b=v(T(t,n),M)>>>z;w[n&E]=x[b],x[b]=++n}let c=n;for(;n<r-S;){const b=v(T(t,n),M)>>>z;let l=0,g=0;for(let u=x[b]-1;u>0&&u>n-s;u=w[u&E]-1)if(t[u+l]===t[n+l]){for(let p=0;;++p)if(t[u+p]!==t[n+p]||n+p>r){l<p&&p>=S&&(l=p,g=n-u);break}}if(w[n&E]=x[b],x[b]=n+1,l===0){++n;continue}let U=n+1;const L=n+l;for(;U<L;){const u=v(T(t,U),M)>>>z;w[U&E]=x[u],x[u]=++U}const y=n-c;if(n+=l,l-=S,l<15?i[f]=l:i[f]=15,y<15)i[f]|=y<<4;else{if(i[f]|=240,++f===o)throw h;let u=y-15;for(;u>=255;u-=255)if(i[f]=255,++f===o)throw h;i[f]=u&255}if(++f===o||f+y>=o||(k(i,t,f,c,y),f+=y,c=n,f+=2,f>=o))throw h;if(i[f-2]=g,i[f-1]=g>>8,l>=15){for(l-=15;l>=255;l-=255)if(i[f]=255,++f===o)throw h;if(i[f]=l,++f===o)throw h}}if(c===0)return 0;let a=t.length-c;if(a<15)i[f]=a<<4;else{if(i[f]=240,++f===o)throw h;for(a-=15;a>=255;a-=255)if(i[f]=255,++f===o)throw h;i[f]=a}if(++f===o)throw h;const A=t.length-c,B=f+A;if(B>o)throw h;return B>=r?0:(k(i,t,f,c,A),f+=A,f)}exports.calcUncompressedLen = D; exports.compressBlock = J; exports.compressBlockBound = G; exports.compressBlockHC = K; exports.uncompressBlock = F;
-//# sourceMappingURL=lz4.cjs.map

package/dist/minify/lz4.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/minify/lz4.ts"],"names":["errInvalidSource","errShortBuffer","minMatch","winSizeLog","winSize","winMask","hashSizeLog","hashSize","hashShift","mfLimit","skipStrength","hasher","imulPolyfill","a","b","ah","al","bh","bl","imul","getUint32","copy","dest","src","di","si","len","i","calcUncompressedLen","sn","lLen","mLen","offset","uncompressBlock","dn","compressBlockBound","n","compressBlock","soffset","hashTable","h","anchor","fma","ref","l","lastLen","compressBlockHC","chainTable","next","ml","si2"],"mappings":"8BAAA;AAgCA,MAAMA,EAAmB,IAAI,MAAM,gBAAgB,EAC7CC,EAAiB,IAAI,MAAM,cAAc,EAGzCC,EAAW,EACXC,EAAa,GACbC,EAAU,GAAKD,EACfE,EAAUD,EAAU,EAMpBE,EAAc,GACdC,EAAW,GAAKD,EAChBE,EAAYN,EAAW,EAAII,EAE3BG,EAAU,EAAIP,EACdQ,EAAe,EAEfC,EAAS,YAGf,SAASC,EAAaC,EAAWC,EAAmB,CAClD,MAAMC,EAAMF,IAAM,GAAM,MAClBG,EAAKH,EAAI,MACTI,EAAMH,IAAM,GAAM,MAClBI,EAAKJ,EAAI,MAGf,OAAQE,EAAKE,GAAQH,EAAKG,EAAKF,EAAKC,GAAO,KAAQ,GAAM,CAC3D,CACA,MAAME,EAAO,KAAK,KAAO,KAAK,KAAOP,EAErC,SAASQ,EAAUP,EAAe,EAAmB,CACnD,OAAOA,EAAE,EAAI,GAAMA,EAAE,EAAI,IAAM,EAAMA,EAAE,EAAI,IAAM,GAAOA,EAAE,IAAM,EAClE,CAEA,SAASQ,EACPC,EACAC,EACAC,EACAC,EACAC,EACM,CACN,QAASC,EAAI,EAAGA,EAAID,EAAK,EAAEC,EACzBL,EAAKE,KAAQD,EAAIE,IAErB,CAEO,SAASG,EAAoBL,EAAyB,CAC3D,MAAMM,EAAKN,EAAI,OACf,GAAIM,IAAO,EACT,MAAO,GAGT,IAAIJ,EAAK,EACLD,EAAK,EAET,OAAa,CAEX,IAAIM,EAAOP,EAAIE,IAAO,EAClBM,EAAOR,EAAIE,GAAM,GACrB,GAAI,EAAEA,IAAOI,EACX,MAAM7B,EAIR,GAAI8B,EAAO,EAAG,CACZ,GAAIA,IAAS,GAAK,CAChB,KAAOP,EAAIE,KAAQ,KAEjB,GADAK,GAAQ,IACJ,EAAEL,IAAOI,EACX,MAAM7B,EAIV,GADA8B,GAAQP,EAAIE,GACR,EAAEA,IAAOI,EACX,MAAM7B,CAEV,CAGA,GAFAwB,GAAMM,EACNL,GAAMK,EACFL,GAAMI,EACR,OAAOL,CAEX,CAGA,GADAC,GAAM,EACFA,GAAMI,EACR,MAAM7B,EAER,MAAMgC,EAAST,EAAIE,EAAK,GAAMF,EAAIE,EAAK,IAAM,EAC7C,GAAID,EAAKQ,EAAS,GAAKA,IAAW,EAChC,MAAMhC,EAIR,GAAI+B,IAAS,GAAK,CAChB,KAAOR,EAAIE,KAAQ,KAEjB,GADAM,GAAQ,IACJ,EAAEN,IAAOI,EACX,MAAM7B,EAIV,GADA+B,GAAQR,EAAIE,GACR,EAAEA,IAAOI,EACX,MAAM7B,CAEV,CAKA,IAHA+B,GAAQ,EAGDA,GAAQC,EAAQD,GAAQC,EAC7BR,GAAMQ,EAERR,GAAMO,CACR,CACF,CAEO,SAASE,EAAgBV,EAAiBD,EAA0B,CACzE,MAAMO,EAAKN,EAAI,OACTW,EAAKZ,EAAK,OAChB,GAAIO,IAAO,EACT,MAAO,GAGT,IAAIJ,EAAK,EACLD,EAAK,EAET,OAAa,CAEX,IAAIM,EAAOP,EAAIE,IAAO,EAClBM,EAAOR,EAAIE,GAAM,GACrB,GAAI,EAAEA,IAAOI,EACX,MAAM7B,EAIR,GAAI8B,EAAO,EAAG,CACZ,GAAIA,IAAS,GAAK,CAChB,KAAOP,EAAIE,KAAQ,KAEjB,GADAK,GAAQ,IACJ,EAAEL,IAAOI,EACX,MAAM7B,EAIV,GADA8B,GAAQP,EAAIE,GACR,EAAEA,IAAOI,EACX,MAAM7B,CAEV,CACA,GAAIkC,EAAKV,EAAKM,GAAQL,EAAKK,EAAOD,EAChC,MAAM5B,EAKR,GAHAoB,EAAKC,EAAMC,EAAKC,EAAIC,EAAIK,CAAI,EAC5BN,GAAMM,EACNL,GAAMK,EACFL,GAAMI,EACR,OAAOL,CAEX,CAGA,GADAC,GAAM,EACFA,GAAMI,EACR,MAAM7B,EAER,MAAMgC,EAAST,EAAIE,EAAK,GAAMF,EAAIE,EAAK,IAAM,EAC7C,GAAID,EAAKQ,EAAS,GAAKA,IAAW,EAChC,MAAMhC,EAIR,GAAI+B,IAAS,GAAK,CAChB,KAAOR,EAAIE,KAAQ,KAEjB,GADAM,GAAQ,IACJ,EAAEN,IAAOI,EACX,MAAM7B,EAIV,GADA+B,GAAQR,EAAIE,GACR,EAAEA,IAAOI,EACX,MAAM7B,CAEV,CAGA,GADA+B,GAAQ,EACJG,EAAKV,GAAMO,EACb,MAAM9B,EAIR,KAAO8B,GAAQC,EAAQD,GAAQC,EAC7BX,EAAKC,EAAMA,EAAME,EAAIA,EAAKQ,EAAQA,CAAM,EACxCR,GAAMQ,EAERX,EAAKC,EAAMA,EAAME,EAAIA,EAAKQ,EAAQD,CAAI,EACtCP,GAAMO,CACR,CACF,CAEO,SAASI,EAAmBC,EAAmB,CACpD,OAAOA,GAAMA,EAAI,IAAO,GAAK,EAC/B,CAEO,SAASC,EACdd,EACAD,EACAgB,EACQ,CACR,MAAMT,EAAKN,EAAI,OAASd,EAClByB,EAAKZ,EAAK,OAChB,GAAIO,GAAM,GAAKK,IAAO,GAAKI,GAAWT,EACpC,MAAO,GAET,IAAIJ,EAAK,EACPD,EAAK,EAIP,MAAMe,EAAY,IAAI,YAAYhC,CAAQ,EAI1C,KAAOkB,EAAKa,GAAS,CACnB,MAAME,EAAIrB,EAAKC,EAAUG,EAAKE,CAAE,EAAGd,CAAM,IAAMH,EAC/C+B,EAAUC,GAAK,EAAEf,CACnB,CAEA,IAAIgB,EAAShB,EACTiB,EAAM,GAAKhC,EACf,KAAOe,EAAKI,EAAK3B,GAAU,CAEzB,MAAMsC,EAAIrB,EAAKC,EAAUG,EAAKE,CAAE,EAAGd,CAAM,IAAMH,EAEzCmC,EAAMJ,EAAUC,GAAK,EAc3B,GAZAD,EAAUC,GAAKf,EAAK,EAalBkB,EAAM,GACLlB,EAAKkB,GAAQxC,EAAa,GAC3BoB,EAAIoB,KAASpB,EAAIE,IACjBF,EAAIoB,EAAM,KAAOpB,EAAIE,EAAK,IAC1BF,EAAIoB,EAAM,KAAOpB,EAAIE,EAAK,IAC1BF,EAAIoB,EAAM,KAAOpB,EAAIE,EAAK,GAC1B,CAEAA,GAAMiB,GAAOhC,EACb,EAAEgC,EACF,QACF,CAEAA,EAAM,GAAKhC,EACX,MAAMoB,EAAOL,EAAKgB,EACZT,EAASP,EAAKkB,EAGpBlB,GAAMvB,EACN,IAAI6B,EAAON,EACX,KAAOA,GAAMI,GAAMN,EAAIE,KAAQF,EAAIE,EAAKO,IACtCP,IAUF,GARAM,EAAON,EAAKM,EACRA,EAAO,GACTT,EAAKE,GAAMO,EAEXT,EAAKE,GAAM,GAITM,EAAO,GACTR,EAAKE,IAAOM,GAAQ,MACf,CAEL,GADAR,EAAKE,IAAO,IACR,EAAEA,IAAOU,EACX,MAAMjC,EAER,IAAI2C,EAAId,EAAO,GACf,KAAOc,GAAK,IAAMA,GAAK,IAErB,GADAtB,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAGVqB,EAAKE,GAAMoB,EAAI,GACjB,CAeA,GAdI,EAAEpB,IAAOU,GAKTV,EAAKM,GAAQI,IAGjBb,EAAKC,EAAMC,EAAKC,EAAIiB,EAAQX,CAAI,EAChCN,GAAMM,EACNW,EAAShB,EAGTD,GAAM,EACFA,GAAMU,GACR,MAAMjC,EAMR,GAJAqB,EAAKE,EAAK,GAAKQ,EACfV,EAAKE,EAAK,GAAKQ,GAAU,EAGrBD,GAAQ,GAAK,CACf,IAAKA,GAAQ,GAAKA,GAAQ,IAAMA,GAAQ,IAEtC,GADAT,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAIV,GADAqB,EAAKE,GAAMO,EACP,EAAEP,IAAOU,EACX,MAAMjC,CAEV,CACF,CAEA,GAAIwC,IAAW,EAEb,MAAO,GAIT,IAAIX,EAAOP,EAAI,OAASkB,EACxB,GAAIX,EAAO,GACTR,EAAKE,GAAMM,GAAQ,MACd,CAEL,GADAR,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAER,IAAK6B,GAAQ,GAAKA,GAAQ,IAAMA,GAAQ,IAEtC,GADAR,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAGVqB,EAAKE,GAAMM,CACb,CACA,GAAI,EAAEN,IAAOU,EACX,MAAMjC,EAIR,MAAM4C,EAAUtB,EAAI,OAASkB,EACvBL,EAAIZ,EAAKqB,EACf,GAAIT,EAAIF,EACN,MAAMjC,EACD,OAAImC,GAAKP,EAEP,GAETR,EAAKC,EAAMC,EAAKC,EAAIiB,EAAQI,CAAO,EACnCrB,GAAMqB,EACCrB,EACT,CAEO,SAASsB,EACdvB,EACAD,EACAgB,EACQ,CACR,MAAMT,EAAKN,EAAI,OAASd,EAClByB,EAAKZ,EAAK,OAChB,GAAIO,GAAM,GAAKK,IAAO,GAAKI,GAAWT,EACpC,MAAO,GAET,IAAIJ,EAAK,EACLD,EAAK,EAKT,MAAMe,EAAY,IAAI,YAAYhC,CAAQ,EACpCwC,EAAa,IAAI,YAAY3C,CAAO,EAI1C,KAAOqB,EAAKa,GAAS,CACnB,MAAME,EAAIrB,EAAKC,EAAUG,EAAKE,CAAE,EAAGd,CAAM,IAAMH,EAC/CuC,EAAWtB,EAAKpB,GAAWkC,EAAUC,GACrCD,EAAUC,GAAK,EAAEf,CACnB,CAEA,IAAIgB,EAAShB,EACb,KAAOA,EAAKI,EAAK3B,GAAU,CAEzB,MAAMsC,EAAIrB,EAAKC,EAAUG,EAAKE,CAAE,EAAGd,CAAM,IAAMH,EAG/C,IAAIuB,EAAO,EACPC,EAAS,EACb,QACMgB,EAAOT,EAAUC,GAAK,EAC1BQ,EAAO,GAAKA,EAAOvB,EAAKrB,EACxB4C,EAAOD,EAAWC,EAAO3C,GAAW,EAGpC,GAAIkB,EAAIyB,EAAOjB,KAAUR,EAAIE,EAAKM,IAChC,QAASkB,EAAK,GAAK,EAAEA,EACnB,GAAI1B,EAAIyB,EAAOC,KAAQ1B,EAAIE,EAAKwB,IAAOxB,EAAKwB,EAAKpB,EAAI,CAE/CE,EAAOkB,GAAMA,GAAM/C,IACrB6B,EAAOkB,EACPjB,EAASP,EAAKuB,GAEhB,KACF,EAQN,GAJAD,EAAWtB,EAAKpB,GAAWkC,EAAUC,GACrCD,EAAUC,GAAKf,EAAK,EAGhBM,IAAS,EAAG,CACd,EAAEN,EACF,QACF,CAEA,IAAIyB,EAAMzB,EAAK,EACf,MAAMwB,EAAKxB,EAAKM,EAKhB,KAAOmB,EAAMD,GAAI,CACf,MAAMT,EAAIrB,EAAKC,EAAUG,EAAK2B,CAAG,EAAGvC,CAAM,IAAMH,EAChDuC,EAAWG,EAAM7C,GAAWkC,EAAUC,GACtCD,EAAUC,GAAK,EAAEU,CACnB,CAEA,MAAMpB,EAAOL,EAAKgB,EAWlB,GAVAhB,GAAMM,EACNA,GAAQ7B,EAEJ6B,EAAO,GACTT,EAAKE,GAAMO,EAEXT,EAAKE,GAAM,GAITM,EAAO,GACTR,EAAKE,IAAOM,GAAQ,MACf,CAEL,GADAR,EAAKE,IAAO,IACR,EAAEA,IAAOU,EACX,MAAMjC,EAER,IAAI2C,EAAId,EAAO,GACf,KAAOc,GAAK,IAAMA,GAAK,IAErB,GADAtB,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAGVqB,EAAKE,GAAMoB,EAAI,GACjB,CAeA,GAdI,EAAEpB,IAAOU,GAKTV,EAAKM,GAAQI,IAGjBb,EAAKC,EAAMC,EAAKC,EAAIiB,EAAQX,CAAI,EAChCN,GAAMM,EACNW,EAAShB,EAGTD,GAAM,EACFA,GAAMU,GACR,MAAMjC,EAMR,GAJAqB,EAAKE,EAAK,GAAKQ,EACfV,EAAKE,EAAK,GAAKQ,GAAU,EAGrBD,GAAQ,GAAK,CACf,IAAKA,GAAQ,GAAKA,GAAQ,IAAMA,GAAQ,IAEtC,GADAT,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAIV,GADAqB,EAAKE,GAAMO,EACP,EAAEP,IAAOU,EACX,MAAMjC,CAEV,CACF,CAEA,GAAIwC,IAAW,EAEb,MAAO,GAIT,IAAIX,EAAOP,EAAI,OAASkB,EACxB,GAAIX,EAAO,GACTR,EAAKE,GAAMM,GAAQ,MACd,CAEL,GADAR,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAER,IAAK6B,GAAQ,GAAKA,GAAQ,IAAMA,GAAQ,IAEtC,GADAR,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAGVqB,EAAKE,GAAMM,CACb,CACA,GAAI,EAAEN,IAAOU,EACX,MAAMjC,EAIR,MAAM4C,EAAUtB,EAAI,OAASkB,EACvBL,EAAIZ,EAAKqB,EACf,GAAIT,EAAIF,EACN,MAAMjC,EACD,OAAImC,GAAKP,EAEP,GAETR,EAAKC,EAAMC,EAAKC,EAAIiB,EAAQI,CAAO,EACnCrB,GAAMqB,EACCrB,EACT","sourcesContent":["// lz4-ts @license BSD-3-Clause / Copyright (c) 2015, Pierre Curto / 2016, oov. All rights reserved.\n/**\n * Copyright (c) 2015, Pierre Curto\n * Copyright (c) 2016, oov\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice, this\n *   list of conditions and the following disclaimer.\n *\n * * Redistributions in binary form must reproduce the above copyright notice,\n *   this list of conditions and the following disclaimer in the documentation\n *   and/or other materials provided with the distribution.\n *\n * * Neither the name of xxHash nor the names of its\n *   contributors may be used to endorse or promote products derived from\n *   this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nconst errInvalidSource = new Error(\"invalid source\");\nconst errShortBuffer = new Error(\"short buffer\");\n\n// The following constants are used to setup the compression algorithm.\nconst minMatch = 4; // the minimum size of the match sequence size (4 bytes)\nconst winSizeLog = 16; // LZ4 64Kb window size limit\nconst winSize = 1 << winSizeLog;\nconst winMask = winSize - 1; // 64Kb window of previous data for dependent blocks\n\n// hashSizeLog determines the size of the hash table used to quickly find a previous match position.\n// Its value influences the compression speed and memory usage, the lower the faster,\n// but at the expense of the compression ratio.\n// 16 seems to be the best compromise.\nconst hashSizeLog = 16;\nconst hashSize = 1 << hashSizeLog;\nconst hashShift = minMatch * 8 - hashSizeLog;\n\nconst mfLimit = 8 + minMatch; // The last match cannot start within the last 12 bytes.\nconst skipStrength = 6; // variable step for fast scan\n\nconst hasher = 2654435761 | 0; // prime number used to hash minMatch\n\n// https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/Math/imul#Polyfill\nfunction imulPolyfill(a: number, b: number): number {\n  const ah = (a >>> 16) & 0xffff;\n  const al = a & 0xffff;\n  const bh = (b >>> 16) & 0xffff;\n  const bl = b & 0xffff;\n  // the shift by 0 fixes the sign on the high part\n  // the final |0 converts the unsigned value into a signed value\n  return (al * bl + (((ah * bl + al * bh) << 16) >>> 0)) | 0;\n}\nconst imul = Math.imul ? Math.imul : imulPolyfill;\n\nfunction getUint32(a: Uint8Array, i: number): number {\n  return a[i + 3] | (a[i + 2] << 8) | (a[i + 1] << 16) | (a[i] << 24);\n}\n\nfunction copy(\n  dest: Uint8Array,\n  src: Uint8Array,\n  di: number,\n  si: number,\n  len: number\n): void {\n  for (let i = 0; i < len; ++i) {\n    dest[di++] = src[si++];\n  }\n}\n\nexport function calcUncompressedLen(src: Uint8Array): number {\n  const sn = src.length;\n  if (sn === 0) {\n    return 0;\n  }\n\n  let si = 0;\n  let di = 0;\n\n  while (true) {\n    // literals and match lengths (token)\n    let lLen = src[si] >> 4;\n    let mLen = src[si] & 0xf;\n    if (++si === sn) {\n      throw errInvalidSource;\n    }\n\n    // literals\n    if (lLen > 0) {\n      if (lLen === 0xf) {\n        while (src[si] === 0xff) {\n          lLen += 0xff;\n          if (++si === sn) {\n            throw errInvalidSource;\n          }\n        }\n        lLen += src[si];\n        if (++si === sn) {\n          throw errInvalidSource;\n        }\n      }\n      di += lLen;\n      si += lLen;\n      if (si >= sn) {\n        return di;\n      }\n    }\n\n    si += 2;\n    if (si >= sn) {\n      throw errInvalidSource;\n    }\n    const offset = src[si - 2] | (src[si - 1] << 8);\n    if (di - offset < 0 || offset === 0) {\n      throw errInvalidSource;\n    }\n\n    // match\n    if (mLen === 0xf) {\n      while (src[si] === 0xff) {\n        mLen += 0xff;\n        if (++si === sn) {\n          throw errInvalidSource;\n        }\n      }\n      mLen += src[si];\n      if (++si === sn) {\n        throw errInvalidSource;\n      }\n    }\n    // minimum match length is 4\n    mLen += 4;\n\n    // copy the match (NB. match is at least 4 bytes long)\n    for (; mLen >= offset; mLen -= offset) {\n      di += offset;\n    }\n    di += mLen;\n  }\n}\n\nexport function uncompressBlock(src: Uint8Array, dest: Uint8Array): number {\n  const sn = src.length;\n  const dn = dest.length;\n  if (sn === 0) {\n    return 0;\n  }\n\n  let si = 0;\n  let di = 0;\n\n  while (true) {\n    // literals and match lengths (token)\n    let lLen = src[si] >> 4;\n    let mLen = src[si] & 0xf;\n    if (++si === sn) {\n      throw errInvalidSource;\n    }\n\n    // literals\n    if (lLen > 0) {\n      if (lLen === 0xf) {\n        while (src[si] === 0xff) {\n          lLen += 0xff;\n          if (++si === sn) {\n            throw errInvalidSource;\n          }\n        }\n        lLen += src[si];\n        if (++si === sn) {\n          throw errInvalidSource;\n        }\n      }\n      if (dn - di < lLen || si + lLen > sn) {\n        throw errShortBuffer;\n      }\n      copy(dest, src, di, si, lLen);\n      di += lLen;\n      si += lLen;\n      if (si >= sn) {\n        return di;\n      }\n    }\n\n    si += 2;\n    if (si >= sn) {\n      throw errInvalidSource;\n    }\n    const offset = src[si - 2] | (src[si - 1] << 8);\n    if (di - offset < 0 || offset === 0) {\n      throw errInvalidSource;\n    }\n\n    // match\n    if (mLen === 0xf) {\n      while (src[si] === 0xff) {\n        mLen += 0xff;\n        if (++si === sn) {\n          throw errInvalidSource;\n        }\n      }\n      mLen += src[si];\n      if (++si === sn) {\n        throw errInvalidSource;\n      }\n    }\n    // minimum match length is 4\n    mLen += 4;\n    if (dn - di <= mLen) {\n      throw errShortBuffer;\n    }\n\n    // copy the match (NB. match is at least 4 bytes long)\n    for (; mLen >= offset; mLen -= offset) {\n      copy(dest, dest, di, di - offset, offset);\n      di += offset;\n    }\n    copy(dest, dest, di, di - offset, mLen);\n    di += mLen;\n  }\n}\n\nexport function compressBlockBound(n: number): number {\n  return n + ((n / 255) | 0) + 16;\n}\n\nexport function compressBlock(\n  src: Uint8Array,\n  dest: Uint8Array,\n  soffset: number\n): number {\n  const sn = src.length - mfLimit;\n  const dn = dest.length;\n  if (sn <= 0 || dn === 0 || soffset >= sn) {\n    return 0;\n  }\n  let si = 0,\n    di = 0;\n\n  // fast scan strategy:\n  // we only need a hash table to store the last sequences (4 bytes)\n  const hashTable = new Uint32Array(hashSize);\n\n  // Initialise the hash table with the first 64Kb of the input buffer\n  // (used when compressing dependent blocks)\n  while (si < soffset) {\n    const h = imul(getUint32(src, si), hasher) >>> hashShift;\n    hashTable[h] = ++si;\n  }\n\n  let anchor = si;\n  let fma = 1 << skipStrength;\n  while (si < sn - minMatch) {\n    // hash the next 4 bytes (sequence)...\n    const h = imul(getUint32(src, si), hasher) >>> hashShift;\n    // -1 to separate existing entries from new ones\n    const ref = hashTable[h] - 1;\n    // ...and store the position of the hash in the hash table (+1 to compensate the -1 upon saving)\n    hashTable[h] = si + 1;\n    // no need to check the last 3 bytes in the first literal 4 bytes as\n    // this guarantees that the next match, if any, is compressed with\n    // a lower size, since to have some compression we must have:\n    // ll+ml-overlap > 1 + (ll-15)/255 + (ml-4-15)/255 + 2 (uncompressed size>compressed size)\n    // => ll+ml>3+2*overlap => ll+ml>= 4+2*overlap\n    // and by definition we do have:\n    // ll >= 1, ml >= 4\n    // => ll+ml >= 5\n    // => so overlap must be 0\n\n    // the sequence is new, out of bound (64kb) or not valid: try next sequence\n    if (\n      ref < 0 || //(fma & ((1 << skipStrength) - 1)) < 4 || // this code seems has a big penalty for size...\n      (si - ref) >> winSizeLog > 0 ||\n      src[ref] !== src[si] ||\n      src[ref + 1] !== src[si + 1] ||\n      src[ref + 2] !== src[si + 2] ||\n      src[ref + 3] !== src[si + 3]\n    ) {\n      // variable step: improves performance on non-compressible data\n      si += fma >> skipStrength;\n      ++fma;\n      continue;\n    }\n    // match found\n    fma = 1 << skipStrength;\n    const lLen = si - anchor;\n    const offset = si - ref;\n\n    // encode match length part 1\n    si += minMatch;\n    let mLen = si; // match length has minMatch already\n    while (si <= sn && src[si] === src[si - offset]) {\n      si++;\n    }\n    mLen = si - mLen;\n    if (mLen < 0xf) {\n      dest[di] = mLen;\n    } else {\n      dest[di] = 0xf;\n    }\n\n    // encode literals length\n    if (lLen < 0xf) {\n      dest[di] |= lLen << 4;\n    } else {\n      dest[di] |= 0xf0;\n      if (++di === dn) {\n        throw errShortBuffer;\n      }\n      let l = lLen - 0xf;\n      for (; l >= 0xff; l -= 0xff) {\n        dest[di] = 0xff;\n        if (++di === dn) {\n          throw errShortBuffer;\n        }\n      }\n      dest[di] = l & 0xff;\n    }\n    if (++di === dn) {\n      throw errShortBuffer;\n    }\n\n    // literals\n    if (di + lLen >= dn) {\n      throw errShortBuffer;\n    }\n    copy(dest, src, di, anchor, lLen);\n    di += lLen;\n    anchor = si;\n\n    // encode offset\n    di += 2;\n    if (di >= dn) {\n      throw errShortBuffer;\n    }\n    dest[di - 2] = offset;\n    dest[di - 1] = offset >> 8;\n\n    // encode match length part 2\n    if (mLen >= 0xf) {\n      for (mLen -= 0xf; mLen >= 0xff; mLen -= 0xff) {\n        dest[di] = 0xff;\n        if (++di === dn) {\n          throw errShortBuffer;\n        }\n      }\n      dest[di] = mLen;\n      if (++di === dn) {\n        throw errShortBuffer;\n      }\n    }\n  }\n\n  if (anchor === 0) {\n    // incompressible\n    return 0;\n  }\n\n  // last literals\n  let lLen = src.length - anchor;\n  if (lLen < 0xf) {\n    dest[di] = lLen << 4;\n  } else {\n    dest[di] = 0xf0;\n    if (++di === dn) {\n      throw errShortBuffer;\n    }\n    for (lLen -= 0xf; lLen >= 0xff; lLen -= 0xff) {\n      dest[di] = 0xff;\n      if (++di === dn) {\n        throw errShortBuffer;\n      }\n    }\n    dest[di] = lLen;\n  }\n  if (++di === dn) {\n    throw errShortBuffer;\n  }\n\n  // write literals\n  const lastLen = src.length - anchor;\n  const n = di + lastLen;\n  if (n > dn) {\n    throw errShortBuffer;\n  } else if (n >= sn) {\n    // incompressible\n    return 0;\n  }\n  copy(dest, src, di, anchor, lastLen);\n  di += lastLen;\n  return di;\n}\n\nexport function compressBlockHC(\n  src: Uint8Array,\n  dest: Uint8Array,\n  soffset: number\n): number {\n  const sn = src.length - mfLimit;\n  const dn = dest.length;\n  if (sn <= 0 || dn === 0 || soffset >= sn) {\n    return 0;\n  }\n  let si = 0;\n  let di = 0;\n\n  // Hash Chain strategy:\n  // we need a hash table and a chain table\n  // the chain table cannot contain more entries than the window size (64Kb entries)\n  const hashTable = new Uint32Array(hashSize);\n  const chainTable = new Uint32Array(winSize);\n\n  // Initialise the hash table with the first 64Kb of the input buffer\n  // (used when compressing dependent blocks)\n  while (si < soffset) {\n    const h = imul(getUint32(src, si), hasher) >>> hashShift;\n    chainTable[si & winMask] = hashTable[h];\n    hashTable[h] = ++si;\n  }\n\n  let anchor = si;\n  while (si < sn - minMatch) {\n    // hash the next 4 bytes (sequence)...\n    const h = imul(getUint32(src, si), hasher) >>> hashShift;\n\n    // follow the chain until out of window and give the longest match\n    let mLen = 0;\n    let offset = 0;\n    for (\n      let next = hashTable[h] - 1;\n      next > 0 && next > si - winSize;\n      next = chainTable[next & winMask] - 1\n    ) {\n      // the first (mLen==0) or next byte (mLen>=minMatch) at current match length must match to improve on the match length\n      if (src[next + mLen] === src[si + mLen]) {\n        for (let ml = 0; ; ++ml) {\n          if (src[next + ml] !== src[si + ml] || si + ml > sn) {\n            // found a longer match, keep its position and length\n            if (mLen < ml && ml >= minMatch) {\n              mLen = ml;\n              offset = si - next;\n            }\n            break;\n          }\n        }\n      }\n    }\n    chainTable[si & winMask] = hashTable[h];\n    hashTable[h] = si + 1;\n\n    // no match found\n    if (mLen === 0) {\n      ++si;\n      continue;\n    }\n\n    let si2 = si + 1;\n    const ml = si + mLen;\n\n    // match found\n    // update hash/chain tables with overlaping bytes:\n    // si already hashed, add everything from si+1 up to the match length\n    while (si2 < ml) {\n      const h = imul(getUint32(src, si2), hasher) >>> hashShift;\n      chainTable[si2 & winMask] = hashTable[h];\n      hashTable[h] = ++si2;\n    }\n\n    const lLen = si - anchor;\n    si += mLen;\n    mLen -= minMatch; // match length does not include minMatch\n\n    if (mLen < 0xf) {\n      dest[di] = mLen;\n    } else {\n      dest[di] = 0xf;\n    }\n\n    // encode literals length\n    if (lLen < 0xf) {\n      dest[di] |= lLen << 4;\n    } else {\n      dest[di] |= 0xf0;\n      if (++di === dn) {\n        throw errShortBuffer;\n      }\n      let l = lLen - 0xf;\n      for (; l >= 0xff; l -= 0xff) {\n        dest[di] = 0xff;\n        if (++di === dn) {\n          throw errShortBuffer;\n        }\n      }\n      dest[di] = l & 0xff;\n    }\n    if (++di === dn) {\n      throw errShortBuffer;\n    }\n\n    // literals\n    if (di + lLen >= dn) {\n      throw errShortBuffer;\n    }\n    copy(dest, src, di, anchor, lLen);\n    di += lLen;\n    anchor = si;\n\n    // encode offset\n    di += 2;\n    if (di >= dn) {\n      throw errShortBuffer;\n    }\n    dest[di - 2] = offset;\n    dest[di - 1] = offset >> 8;\n\n    // encode match length part 2\n    if (mLen >= 0xf) {\n      for (mLen -= 0xf; mLen >= 0xff; mLen -= 0xff) {\n        dest[di] = 0xff;\n        if (++di === dn) {\n          throw errShortBuffer;\n        }\n      }\n      dest[di] = mLen;\n      if (++di === dn) {\n        throw errShortBuffer;\n      }\n    }\n  }\n\n  if (anchor === 0) {\n    // incompressible\n    return 0;\n  }\n\n  // last literals\n  let lLen = src.length - anchor;\n  if (lLen < 0xf) {\n    dest[di] = lLen << 4;\n  } else {\n    dest[di] = 0xf0;\n    if (++di === dn) {\n      throw errShortBuffer;\n    }\n    for (lLen -= 0xf; lLen >= 0xff; lLen -= 0xff) {\n      dest[di] = 0xff;\n      if (++di === dn) {\n        throw errShortBuffer;\n      }\n    }\n    dest[di] = lLen;\n  }\n  if (++di === dn) {\n    throw errShortBuffer;\n  }\n\n  // write literals\n  const lastLen = src.length - anchor;\n  const n = di + lastLen;\n  if (n > dn) {\n    throw errShortBuffer;\n  } else if (n >= sn) {\n    // incompressible\n    return 0;\n  }\n  copy(dest, src, di, anchor, lastLen);\n  di += lastLen;\n  return di;\n}\n"]}

package/dist/minify/lz4.d.ts

@@ -1,7 +0,0 @@
-declare function calcUncompressedLen(src: Uint8Array): number;
-declare function uncompressBlock(src: Uint8Array, dest: Uint8Array): number;
-declare function compressBlockBound(n: number): number;
-declare function compressBlock(src: Uint8Array, dest: Uint8Array, soffset: number): number;
-declare function compressBlockHC(src: Uint8Array, dest: Uint8Array, soffset: number): number;
-
-export { calcUncompressedLen, compressBlock, compressBlockBound, compressBlockHC, uncompressBlock };

package/dist/minify/lz4.js

@@ -1,3 +0,0 @@
-import"../chunk-UPFDSEKI.js";// lz4-ts @license BSD-3-Clause / Copyright (c) 2015, Pierre Curto / 2016, oov. All rights reserved.
-const m=new Error("invalid source"),h=new Error("short buffer"),S=4,H=16,s=1<<H,E=s-1,I=16,P=1<<I,z=S*8-I,j=8+S,C=6,M=-1640531535;function q(t,i){const e=t>>>16&65535,r=t&65535,o=i>>>16&65535,n=i&65535;return r*n+(e*n+r*o<<16>>>0)|0}const v=Math.imul?Math.imul:q;function T(t,i){return t[i+3]|t[i+2]<<8|t[i+1]<<16|t[i]<<24}function k(t,i,e,r,o){for(let n=0;n<o;++n)t[e++]=i[r++]}function D(t){const i=t.length;if(i===0)return 0;let e=0,r=0;for(;;){let o=t[e]>>4,n=t[e]&15;if(++e===i)throw m;if(o>0){if(o===15){for(;t[e]===255;)if(o+=255,++e===i)throw m;if(o+=t[e],++e===i)throw m}if(r+=o,e+=o,e>=i)return r}if(e+=2,e>=i)throw m;const f=t[e-2]|t[e-1]<<8;if(r-f<0||f===0)throw m;if(n===15){for(;t[e]===255;)if(n+=255,++e===i)throw m;if(n+=t[e],++e===i)throw m}for(n+=4;n>=f;n-=f)r+=f;r+=n}}function F(t,i){const e=t.length,r=i.length;if(e===0)return 0;let o=0,n=0;for(;;){let f=t[o]>>4,x=t[o]&15;if(++o===e)throw m;if(f>0){if(f===15){for(;t[o]===255;)if(f+=255,++o===e)throw m;if(f+=t[o],++o===e)throw m}if(r-n<f||o+f>e)throw h;if(k(i,t,n,o,f),n+=f,o+=f,o>=e)return n}if(o+=2,o>=e)throw m;const w=t[o-2]|t[o-1]<<8;if(n-w<0||w===0)throw m;if(x===15){for(;t[o]===255;)if(x+=255,++o===e)throw m;if(x+=t[o],++o===e)throw m}if(x+=4,r-n<=x)throw h;for(;x>=w;x-=w)k(i,i,n,n-w,w),n+=w;k(i,i,n,n-w,x),n+=x}}function G(t){return t+(t/255|0)+16}function J(t,i,e){const r=t.length-j,o=i.length;if(r<=0||o===0||e>=r)return 0;let n=0,f=0;const x=new Uint32Array(P);for(;n<e;){const b=v(T(t,n),M)>>>z;x[b]=++n}let w=n,c=1<<C;for(;n<r-S;){const b=v(T(t,n),M)>>>z,l=x[b]-1;if(x[b]=n+1,l<0||n-l>>H>0||t[l]!==t[n]||t[l+1]!==t[n+1]||t[l+2]!==t[n+2]||t[l+3]!==t[n+3]){n+=c>>C,++c;continue}c=1<<C;const g=n-w,U=n-l;n+=S;let L=n;for(;n<=r&&t[n]===t[n-U];)n++;if(L=n-L,L<15?i[f]=L:i[f]=15,g<15)i[f]|=g<<4;else{if(i[f]|=240,++f===o)throw h;let y=g-15;for(;y>=255;y-=255)if(i[f]=255,++f===o)throw h;i[f]=y&255}if(++f===o||f+g>=o||(k(i,t,f,w,g),f+=g,w=n,f+=2,f>=o))throw h;if(i[f-2]=U,i[f-1]=U>>8,L>=15){for(L-=15;L>=255;L-=255)if(i[f]=255,++f===o)throw h;if(i[f]=L,++f===o)throw h}}if(w===0)return 0;let a=t.length-w;if(a<15)i[f]=a<<4;else{if(i[f]=240,++f===o)throw h;for(a-=15;a>=255;a-=255)if(i[f]=255,++f===o)throw h;i[f]=a}if(++f===o)throw h;const A=t.length-w,B=f+A;if(B>o)throw h;return B>=r?0:(k(i,t,f,w,A),f+=A,f)}function K(t,i,e){const r=t.length-j,o=i.length;if(r<=0||o===0||e>=r)return 0;let n=0,f=0;const x=new Uint32Array(P),w=new Uint32Array(s);for(;n<e;){const b=v(T(t,n),M)>>>z;w[n&E]=x[b],x[b]=++n}let c=n;for(;n<r-S;){const b=v(T(t,n),M)>>>z;let l=0,g=0;for(let u=x[b]-1;u>0&&u>n-s;u=w[u&E]-1)if(t[u+l]===t[n+l]){for(let p=0;;++p)if(t[u+p]!==t[n+p]||n+p>r){l<p&&p>=S&&(l=p,g=n-u);break}}if(w[n&E]=x[b],x[b]=n+1,l===0){++n;continue}let U=n+1;const L=n+l;for(;U<L;){const u=v(T(t,U),M)>>>z;w[U&E]=x[u],x[u]=++U}const y=n-c;if(n+=l,l-=S,l<15?i[f]=l:i[f]=15,y<15)i[f]|=y<<4;else{if(i[f]|=240,++f===o)throw h;let u=y-15;for(;u>=255;u-=255)if(i[f]=255,++f===o)throw h;i[f]=u&255}if(++f===o||f+y>=o||(k(i,t,f,c,y),f+=y,c=n,f+=2,f>=o))throw h;if(i[f-2]=g,i[f-1]=g>>8,l>=15){for(l-=15;l>=255;l-=255)if(i[f]=255,++f===o)throw h;if(i[f]=l,++f===o)throw h}}if(c===0)return 0;let a=t.length-c;if(a<15)i[f]=a<<4;else{if(i[f]=240,++f===o)throw h;for(a-=15;a>=255;a-=255)if(i[f]=255,++f===o)throw h;i[f]=a}if(++f===o)throw h;const A=t.length-c,B=f+A;if(B>o)throw h;return B>=r?0:(k(i,t,f,c,A),f+=A,f)}export{D as calcUncompressedLen,J as compressBlock,G as compressBlockBound,K as compressBlockHC,F as uncompressBlock};
-//# sourceMappingURL=lz4.js.map

package/dist/minify/lz4.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/minify/lz4.ts"],"sourcesContent":["// lz4-ts @license BSD-3-Clause / Copyright (c) 2015, Pierre Curto / 2016, oov. All rights reserved.\n/**\n * Copyright (c) 2015, Pierre Curto\n * Copyright (c) 2016, oov\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice, this\n *   list of conditions and the following disclaimer.\n *\n * * Redistributions in binary form must reproduce the above copyright notice,\n *   this list of conditions and the following disclaimer in the documentation\n *   and/or other materials provided with the distribution.\n *\n * * Neither the name of xxHash nor the names of its\n *   contributors may be used to endorse or promote products derived from\n *   this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nconst errInvalidSource = new Error(\"invalid source\");\nconst errShortBuffer = new Error(\"short buffer\");\n\n// The following constants are used to setup the compression algorithm.\nconst minMatch = 4; // the minimum size of the match sequence size (4 bytes)\nconst winSizeLog = 16; // LZ4 64Kb window size limit\nconst winSize = 1 << winSizeLog;\nconst winMask = winSize - 1; // 64Kb window of previous data for dependent blocks\n\n// hashSizeLog determines the size of the hash table used to quickly find a previous match position.\n// Its value influences the compression speed and memory usage, the lower the faster,\n// but at the expense of the compression ratio.\n// 16 seems to be the best compromise.\nconst hashSizeLog = 16;\nconst hashSize = 1 << hashSizeLog;\nconst hashShift = minMatch * 8 - hashSizeLog;\n\nconst mfLimit = 8 + minMatch; // The last match cannot start within the last 12 bytes.\nconst skipStrength = 6; // variable step for fast scan\n\nconst hasher = 2654435761 | 0; // prime number used to hash minMatch\n\n// https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/Math/imul#Polyfill\nfunction imulPolyfill(a: number, b: number): number {\n  const ah = (a >>> 16) & 0xffff;\n  const al = a & 0xffff;\n  const bh = (b >>> 16) & 0xffff;\n  const bl = b & 0xffff;\n  // the shift by 0 fixes the sign on the high part\n  // the final |0 converts the unsigned value into a signed value\n  return (al * bl + (((ah * bl + al * bh) << 16) >>> 0)) | 0;\n}\nconst imul = Math.imul ? Math.imul : imulPolyfill;\n\nfunction getUint32(a: Uint8Array, i: number): number {\n  return a[i + 3] | (a[i + 2] << 8) | (a[i + 1] << 16) | (a[i] << 24);\n}\n\nfunction copy(\n  dest: Uint8Array,\n  src: Uint8Array,\n  di: number,\n  si: number,\n  len: number\n): void {\n  for (let i = 0; i < len; ++i) {\n    dest[di++] = src[si++];\n  }\n}\n\nexport function calcUncompressedLen(src: Uint8Array): number {\n  const sn = src.length;\n  if (sn === 0) {\n    return 0;\n  }\n\n  let si = 0;\n  let di = 0;\n\n  while (true) {\n    // literals and match lengths (token)\n    let lLen = src[si] >> 4;\n    let mLen = src[si] & 0xf;\n    if (++si === sn) {\n      throw errInvalidSource;\n    }\n\n    // literals\n    if (lLen > 0) {\n      if (lLen === 0xf) {\n        while (src[si] === 0xff) {\n          lLen += 0xff;\n          if (++si === sn) {\n            throw errInvalidSource;\n          }\n        }\n        lLen += src[si];\n        if (++si === sn) {\n          throw errInvalidSource;\n        }\n      }\n      di += lLen;\n      si += lLen;\n      if (si >= sn) {\n        return di;\n      }\n    }\n\n    si += 2;\n    if (si >= sn) {\n      throw errInvalidSource;\n    }\n    const offset = src[si - 2] | (src[si - 1] << 8);\n    if (di - offset < 0 || offset === 0) {\n      throw errInvalidSource;\n    }\n\n    // match\n    if (mLen === 0xf) {\n      while (src[si] === 0xff) {\n        mLen += 0xff;\n        if (++si === sn) {\n          throw errInvalidSource;\n        }\n      }\n      mLen += src[si];\n      if (++si === sn) {\n        throw errInvalidSource;\n      }\n    }\n    // minimum match length is 4\n    mLen += 4;\n\n    // copy the match (NB. match is at least 4 bytes long)\n    for (; mLen >= offset; mLen -= offset) {\n      di += offset;\n    }\n    di += mLen;\n  }\n}\n\nexport function uncompressBlock(src: Uint8Array, dest: Uint8Array): number {\n  const sn = src.length;\n  const dn = dest.length;\n  if (sn === 0) {\n    return 0;\n  }\n\n  let si = 0;\n  let di = 0;\n\n  while (true) {\n    // literals and match lengths (token)\n    let lLen = src[si] >> 4;\n    let mLen = src[si] & 0xf;\n    if (++si === sn) {\n      throw errInvalidSource;\n    }\n\n    // literals\n    if (lLen > 0) {\n      if (lLen === 0xf) {\n        while (src[si] === 0xff) {\n          lLen += 0xff;\n          if (++si === sn) {\n            throw errInvalidSource;\n          }\n        }\n        lLen += src[si];\n        if (++si === sn) {\n          throw errInvalidSource;\n        }\n      }\n      if (dn - di < lLen || si + lLen > sn) {\n        throw errShortBuffer;\n      }\n      copy(dest, src, di, si, lLen);\n      di += lLen;\n      si += lLen;\n      if (si >= sn) {\n        return di;\n      }\n    }\n\n    si += 2;\n    if (si >= sn) {\n      throw errInvalidSource;\n    }\n    const offset = src[si - 2] | (src[si - 1] << 8);\n    if (di - offset < 0 || offset === 0) {\n      throw errInvalidSource;\n    }\n\n    // match\n    if (mLen === 0xf) {\n      while (src[si] === 0xff) {\n        mLen += 0xff;\n        if (++si === sn) {\n          throw errInvalidSource;\n        }\n      }\n      mLen += src[si];\n      if (++si === sn) {\n        throw errInvalidSource;\n      }\n    }\n    // minimum match length is 4\n    mLen += 4;\n    if (dn - di <= mLen) {\n      throw errShortBuffer;\n    }\n\n    // copy the match (NB. match is at least 4 bytes long)\n    for (; mLen >= offset; mLen -= offset) {\n      copy(dest, dest, di, di - offset, offset);\n      di += offset;\n    }\n    copy(dest, dest, di, di - offset, mLen);\n    di += mLen;\n  }\n}\n\nexport function compressBlockBound(n: number): number {\n  return n + ((n / 255) | 0) + 16;\n}\n\nexport function compressBlock(\n  src: Uint8Array,\n  dest: Uint8Array,\n  soffset: number\n): number {\n  const sn = src.length - mfLimit;\n  const dn = dest.length;\n  if (sn <= 0 || dn === 0 || soffset >= sn) {\n    return 0;\n  }\n  let si = 0,\n    di = 0;\n\n  // fast scan strategy:\n  // we only need a hash table to store the last sequences (4 bytes)\n  const hashTable = new Uint32Array(hashSize);\n\n  // Initialise the hash table with the first 64Kb of the input buffer\n  // (used when compressing dependent blocks)\n  while (si < soffset) {\n    const h = imul(getUint32(src, si), hasher) >>> hashShift;\n    hashTable[h] = ++si;\n  }\n\n  let anchor = si;\n  let fma = 1 << skipStrength;\n  while (si < sn - minMatch) {\n    // hash the next 4 bytes (sequence)...\n    const h = imul(getUint32(src, si), hasher) >>> hashShift;\n    // -1 to separate existing entries from new ones\n    const ref = hashTable[h] - 1;\n    // ...and store the position of the hash in the hash table (+1 to compensate the -1 upon saving)\n    hashTable[h] = si + 1;\n    // no need to check the last 3 bytes in the first literal 4 bytes as\n    // this guarantees that the next match, if any, is compressed with\n    // a lower size, since to have some compression we must have:\n    // ll+ml-overlap > 1 + (ll-15)/255 + (ml-4-15)/255 + 2 (uncompressed size>compressed size)\n    // => ll+ml>3+2*overlap => ll+ml>= 4+2*overlap\n    // and by definition we do have:\n    // ll >= 1, ml >= 4\n    // => ll+ml >= 5\n    // => so overlap must be 0\n\n    // the sequence is new, out of bound (64kb) or not valid: try next sequence\n    if (\n      ref < 0 || //(fma & ((1 << skipStrength) - 1)) < 4 || // this code seems has a big penalty for size...\n      (si - ref) >> winSizeLog > 0 ||\n      src[ref] !== src[si] ||\n      src[ref + 1] !== src[si + 1] ||\n      src[ref + 2] !== src[si + 2] ||\n      src[ref + 3] !== src[si + 3]\n    ) {\n      // variable step: improves performance on non-compressible data\n      si += fma >> skipStrength;\n      ++fma;\n      continue;\n    }\n    // match found\n    fma = 1 << skipStrength;\n    const lLen = si - anchor;\n    const offset = si - ref;\n\n    // encode match length part 1\n    si += minMatch;\n    let mLen = si; // match length has minMatch already\n    while (si <= sn && src[si] === src[si - offset]) {\n      si++;\n    }\n    mLen = si - mLen;\n    if (mLen < 0xf) {\n      dest[di] = mLen;\n    } else {\n      dest[di] = 0xf;\n    }\n\n    // encode literals length\n    if (lLen < 0xf) {\n      dest[di] |= lLen << 4;\n    } else {\n      dest[di] |= 0xf0;\n      if (++di === dn) {\n        throw errShortBuffer;\n      }\n      let l = lLen - 0xf;\n      for (; l >= 0xff; l -= 0xff) {\n        dest[di] = 0xff;\n        if (++di === dn) {\n          throw errShortBuffer;\n        }\n      }\n      dest[di] = l & 0xff;\n    }\n    if (++di === dn) {\n      throw errShortBuffer;\n    }\n\n    // literals\n    if (di + lLen >= dn) {\n      throw errShortBuffer;\n    }\n    copy(dest, src, di, anchor, lLen);\n    di += lLen;\n    anchor = si;\n\n    // encode offset\n    di += 2;\n    if (di >= dn) {\n      throw errShortBuffer;\n    }\n    dest[di - 2] = offset;\n    dest[di - 1] = offset >> 8;\n\n    // encode match length part 2\n    if (mLen >= 0xf) {\n      for (mLen -= 0xf; mLen >= 0xff; mLen -= 0xff) {\n        dest[di] = 0xff;\n        if (++di === dn) {\n          throw errShortBuffer;\n        }\n      }\n      dest[di] = mLen;\n      if (++di === dn) {\n        throw errShortBuffer;\n      }\n    }\n  }\n\n  if (anchor === 0) {\n    // incompressible\n    return 0;\n  }\n\n  // last literals\n  let lLen = src.length - anchor;\n  if (lLen < 0xf) {\n    dest[di] = lLen << 4;\n  } else {\n    dest[di] = 0xf0;\n    if (++di === dn) {\n      throw errShortBuffer;\n    }\n    for (lLen -= 0xf; lLen >= 0xff; lLen -= 0xff) {\n      dest[di] = 0xff;\n      if (++di === dn) {\n        throw errShortBuffer;\n      }\n    }\n    dest[di] = lLen;\n  }\n  if (++di === dn) {\n    throw errShortBuffer;\n  }\n\n  // write literals\n  const lastLen = src.length - anchor;\n  const n = di + lastLen;\n  if (n > dn) {\n    throw errShortBuffer;\n  } else if (n >= sn) {\n    // incompressible\n    return 0;\n  }\n  copy(dest, src, di, anchor, lastLen);\n  di += lastLen;\n  return di;\n}\n\nexport function compressBlockHC(\n  src: Uint8Array,\n  dest: Uint8Array,\n  soffset: number\n): number {\n  const sn = src.length - mfLimit;\n  const dn = dest.length;\n  if (sn <= 0 || dn === 0 || soffset >= sn) {\n    return 0;\n  }\n  let si = 0;\n  let di = 0;\n\n  // Hash Chain strategy:\n  // we need a hash table and a chain table\n  // the chain table cannot contain more entries than the window size (64Kb entries)\n  const hashTable = new Uint32Array(hashSize);\n  const chainTable = new Uint32Array(winSize);\n\n  // Initialise the hash table with the first 64Kb of the input buffer\n  // (used when compressing dependent blocks)\n  while (si < soffset) {\n    const h = imul(getUint32(src, si), hasher) >>> hashShift;\n    chainTable[si & winMask] = hashTable[h];\n    hashTable[h] = ++si;\n  }\n\n  let anchor = si;\n  while (si < sn - minMatch) {\n    // hash the next 4 bytes (sequence)...\n    const h = imul(getUint32(src, si), hasher) >>> hashShift;\n\n    // follow the chain until out of window and give the longest match\n    let mLen = 0;\n    let offset = 0;\n    for (\n      let next = hashTable[h] - 1;\n      next > 0 && next > si - winSize;\n      next = chainTable[next & winMask] - 1\n    ) {\n      // the first (mLen==0) or next byte (mLen>=minMatch) at current match length must match to improve on the match length\n      if (src[next + mLen] === src[si + mLen]) {\n        for (let ml = 0; ; ++ml) {\n          if (src[next + ml] !== src[si + ml] || si + ml > sn) {\n            // found a longer match, keep its position and length\n            if (mLen < ml && ml >= minMatch) {\n              mLen = ml;\n              offset = si - next;\n            }\n            break;\n          }\n        }\n      }\n    }\n    chainTable[si & winMask] = hashTable[h];\n    hashTable[h] = si + 1;\n\n    // no match found\n    if (mLen === 0) {\n      ++si;\n      continue;\n    }\n\n    let si2 = si + 1;\n    const ml = si + mLen;\n\n    // match found\n    // update hash/chain tables with overlaping bytes:\n    // si already hashed, add everything from si+1 up to the match length\n    while (si2 < ml) {\n      const h = imul(getUint32(src, si2), hasher) >>> hashShift;\n      chainTable[si2 & winMask] = hashTable[h];\n      hashTable[h] = ++si2;\n    }\n\n    const lLen = si - anchor;\n    si += mLen;\n    mLen -= minMatch; // match length does not include minMatch\n\n    if (mLen < 0xf) {\n      dest[di] = mLen;\n    } else {\n      dest[di] = 0xf;\n    }\n\n    // encode literals length\n    if (lLen < 0xf) {\n      dest[di] |= lLen << 4;\n    } else {\n      dest[di] |= 0xf0;\n      if (++di === dn) {\n        throw errShortBuffer;\n      }\n      let l = lLen - 0xf;\n      for (; l >= 0xff; l -= 0xff) {\n        dest[di] = 0xff;\n        if (++di === dn) {\n          throw errShortBuffer;\n        }\n      }\n      dest[di] = l & 0xff;\n    }\n    if (++di === dn) {\n      throw errShortBuffer;\n    }\n\n    // literals\n    if (di + lLen >= dn) {\n      throw errShortBuffer;\n    }\n    copy(dest, src, di, anchor, lLen);\n    di += lLen;\n    anchor = si;\n\n    // encode offset\n    di += 2;\n    if (di >= dn) {\n      throw errShortBuffer;\n    }\n    dest[di - 2] = offset;\n    dest[di - 1] = offset >> 8;\n\n    // encode match length part 2\n    if (mLen >= 0xf) {\n      for (mLen -= 0xf; mLen >= 0xff; mLen -= 0xff) {\n        dest[di] = 0xff;\n        if (++di === dn) {\n          throw errShortBuffer;\n        }\n      }\n      dest[di] = mLen;\n      if (++di === dn) {\n        throw errShortBuffer;\n      }\n    }\n  }\n\n  if (anchor === 0) {\n    // incompressible\n    return 0;\n  }\n\n  // last literals\n  let lLen = src.length - anchor;\n  if (lLen < 0xf) {\n    dest[di] = lLen << 4;\n  } else {\n    dest[di] = 0xf0;\n    if (++di === dn) {\n      throw errShortBuffer;\n    }\n    for (lLen -= 0xf; lLen >= 0xff; lLen -= 0xff) {\n      dest[di] = 0xff;\n      if (++di === dn) {\n        throw errShortBuffer;\n      }\n    }\n    dest[di] = lLen;\n  }\n  if (++di === dn) {\n    throw errShortBuffer;\n  }\n\n  // write literals\n  const lastLen = src.length - anchor;\n  const n = di + lastLen;\n  if (n > dn) {\n    throw errShortBuffer;\n  } else if (n >= sn) {\n    // incompressible\n    return 0;\n  }\n  copy(dest, src, di, anchor, lastLen);\n  di += lastLen;\n  return di;\n}\n"],"mappings":"6BAAA;AAgCA,MAAMA,EAAmB,IAAI,MAAM,gBAAgB,EAC7CC,EAAiB,IAAI,MAAM,cAAc,EAGzCC,EAAW,EACXC,EAAa,GACbC,EAAU,GAAKD,EACfE,EAAUD,EAAU,EAMpBE,EAAc,GACdC,EAAW,GAAKD,EAChBE,EAAYN,EAAW,EAAII,EAE3BG,EAAU,EAAIP,EACdQ,EAAe,EAEfC,EAAS,YAGf,SAASC,EAAaC,EAAWC,EAAmB,CAClD,MAAMC,EAAMF,IAAM,GAAM,MAClBG,EAAKH,EAAI,MACTI,EAAMH,IAAM,GAAM,MAClBI,EAAKJ,EAAI,MAGf,OAAQE,EAAKE,GAAQH,EAAKG,EAAKF,EAAKC,GAAO,KAAQ,GAAM,CAC3D,CACA,MAAME,EAAO,KAAK,KAAO,KAAK,KAAOP,EAErC,SAASQ,EAAUP,EAAe,EAAmB,CACnD,OAAOA,EAAE,EAAI,GAAMA,EAAE,EAAI,IAAM,EAAMA,EAAE,EAAI,IAAM,GAAOA,EAAE,IAAM,EAClE,CAEA,SAASQ,EACPC,EACAC,EACAC,EACAC,EACAC,EACM,CACN,QAASC,EAAI,EAAGA,EAAID,EAAK,EAAEC,EACzBL,EAAKE,KAAQD,EAAIE,IAErB,CAEO,SAASG,EAAoBL,EAAyB,CAC3D,MAAMM,EAAKN,EAAI,OACf,GAAIM,IAAO,EACT,MAAO,GAGT,IAAIJ,EAAK,EACLD,EAAK,EAET,OAAa,CAEX,IAAIM,EAAOP,EAAIE,IAAO,EAClBM,EAAOR,EAAIE,GAAM,GACrB,GAAI,EAAEA,IAAOI,EACX,MAAM7B,EAIR,GAAI8B,EAAO,EAAG,CACZ,GAAIA,IAAS,GAAK,CAChB,KAAOP,EAAIE,KAAQ,KAEjB,GADAK,GAAQ,IACJ,EAAEL,IAAOI,EACX,MAAM7B,EAIV,GADA8B,GAAQP,EAAIE,GACR,EAAEA,IAAOI,EACX,MAAM7B,CAEV,CAGA,GAFAwB,GAAMM,EACNL,GAAMK,EACFL,GAAMI,EACR,OAAOL,CAEX,CAGA,GADAC,GAAM,EACFA,GAAMI,EACR,MAAM7B,EAER,MAAMgC,EAAST,EAAIE,EAAK,GAAMF,EAAIE,EAAK,IAAM,EAC7C,GAAID,EAAKQ,EAAS,GAAKA,IAAW,EAChC,MAAMhC,EAIR,GAAI+B,IAAS,GAAK,CAChB,KAAOR,EAAIE,KAAQ,KAEjB,GADAM,GAAQ,IACJ,EAAEN,IAAOI,EACX,MAAM7B,EAIV,GADA+B,GAAQR,EAAIE,GACR,EAAEA,IAAOI,EACX,MAAM7B,CAEV,CAKA,IAHA+B,GAAQ,EAGDA,GAAQC,EAAQD,GAAQC,EAC7BR,GAAMQ,EAERR,GAAMO,CACR,CACF,CAEO,SAASE,EAAgBV,EAAiBD,EAA0B,CACzE,MAAMO,EAAKN,EAAI,OACTW,EAAKZ,EAAK,OAChB,GAAIO,IAAO,EACT,MAAO,GAGT,IAAIJ,EAAK,EACLD,EAAK,EAET,OAAa,CAEX,IAAIM,EAAOP,EAAIE,IAAO,EAClBM,EAAOR,EAAIE,GAAM,GACrB,GAAI,EAAEA,IAAOI,EACX,MAAM7B,EAIR,GAAI8B,EAAO,EAAG,CACZ,GAAIA,IAAS,GAAK,CAChB,KAAOP,EAAIE,KAAQ,KAEjB,GADAK,GAAQ,IACJ,EAAEL,IAAOI,EACX,MAAM7B,EAIV,GADA8B,GAAQP,EAAIE,GACR,EAAEA,IAAOI,EACX,MAAM7B,CAEV,CACA,GAAIkC,EAAKV,EAAKM,GAAQL,EAAKK,EAAOD,EAChC,MAAM5B,EAKR,GAHAoB,EAAKC,EAAMC,EAAKC,EAAIC,EAAIK,CAAI,EAC5BN,GAAMM,EACNL,GAAMK,EACFL,GAAMI,EACR,OAAOL,CAEX,CAGA,GADAC,GAAM,EACFA,GAAMI,EACR,MAAM7B,EAER,MAAMgC,EAAST,EAAIE,EAAK,GAAMF,EAAIE,EAAK,IAAM,EAC7C,GAAID,EAAKQ,EAAS,GAAKA,IAAW,EAChC,MAAMhC,EAIR,GAAI+B,IAAS,GAAK,CAChB,KAAOR,EAAIE,KAAQ,KAEjB,GADAM,GAAQ,IACJ,EAAEN,IAAOI,EACX,MAAM7B,EAIV,GADA+B,GAAQR,EAAIE,GACR,EAAEA,IAAOI,EACX,MAAM7B,CAEV,CAGA,GADA+B,GAAQ,EACJG,EAAKV,GAAMO,EACb,MAAM9B,EAIR,KAAO8B,GAAQC,EAAQD,GAAQC,EAC7BX,EAAKC,EAAMA,EAAME,EAAIA,EAAKQ,EAAQA,CAAM,EACxCR,GAAMQ,EAERX,EAAKC,EAAMA,EAAME,EAAIA,EAAKQ,EAAQD,CAAI,EACtCP,GAAMO,CACR,CACF,CAEO,SAASI,EAAmBC,EAAmB,CACpD,OAAOA,GAAMA,EAAI,IAAO,GAAK,EAC/B,CAEO,SAASC,EACdd,EACAD,EACAgB,EACQ,CACR,MAAMT,EAAKN,EAAI,OAASd,EAClByB,EAAKZ,EAAK,OAChB,GAAIO,GAAM,GAAKK,IAAO,GAAKI,GAAWT,EACpC,MAAO,GAET,IAAIJ,EAAK,EACPD,EAAK,EAIP,MAAMe,EAAY,IAAI,YAAYhC,CAAQ,EAI1C,KAAOkB,EAAKa,GAAS,CACnB,MAAME,EAAIrB,EAAKC,EAAUG,EAAKE,CAAE,EAAGd,CAAM,IAAMH,EAC/C+B,EAAUC,GAAK,EAAEf,CACnB,CAEA,IAAIgB,EAAShB,EACTiB,EAAM,GAAKhC,EACf,KAAOe,EAAKI,EAAK3B,GAAU,CAEzB,MAAMsC,EAAIrB,EAAKC,EAAUG,EAAKE,CAAE,EAAGd,CAAM,IAAMH,EAEzCmC,EAAMJ,EAAUC,GAAK,EAc3B,GAZAD,EAAUC,GAAKf,EAAK,EAalBkB,EAAM,GACLlB,EAAKkB,GAAQxC,EAAa,GAC3BoB,EAAIoB,KAASpB,EAAIE,IACjBF,EAAIoB,EAAM,KAAOpB,EAAIE,EAAK,IAC1BF,EAAIoB,EAAM,KAAOpB,EAAIE,EAAK,IAC1BF,EAAIoB,EAAM,KAAOpB,EAAIE,EAAK,GAC1B,CAEAA,GAAMiB,GAAOhC,EACb,EAAEgC,EACF,QACF,CAEAA,EAAM,GAAKhC,EACX,MAAMoB,EAAOL,EAAKgB,EACZT,EAASP,EAAKkB,EAGpBlB,GAAMvB,EACN,IAAI6B,EAAON,EACX,KAAOA,GAAMI,GAAMN,EAAIE,KAAQF,EAAIE,EAAKO,IACtCP,IAUF,GARAM,EAAON,EAAKM,EACRA,EAAO,GACTT,EAAKE,GAAMO,EAEXT,EAAKE,GAAM,GAITM,EAAO,GACTR,EAAKE,IAAOM,GAAQ,MACf,CAEL,GADAR,EAAKE,IAAO,IACR,EAAEA,IAAOU,EACX,MAAMjC,EAER,IAAI2C,EAAId,EAAO,GACf,KAAOc,GAAK,IAAMA,GAAK,IAErB,GADAtB,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAGVqB,EAAKE,GAAMoB,EAAI,GACjB,CAeA,GAdI,EAAEpB,IAAOU,GAKTV,EAAKM,GAAQI,IAGjBb,EAAKC,EAAMC,EAAKC,EAAIiB,EAAQX,CAAI,EAChCN,GAAMM,EACNW,EAAShB,EAGTD,GAAM,EACFA,GAAMU,GACR,MAAMjC,EAMR,GAJAqB,EAAKE,EAAK,GAAKQ,EACfV,EAAKE,EAAK,GAAKQ,GAAU,EAGrBD,GAAQ,GAAK,CACf,IAAKA,GAAQ,GAAKA,GAAQ,IAAMA,GAAQ,IAEtC,GADAT,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAIV,GADAqB,EAAKE,GAAMO,EACP,EAAEP,IAAOU,EACX,MAAMjC,CAEV,CACF,CAEA,GAAIwC,IAAW,EAEb,MAAO,GAIT,IAAIX,EAAOP,EAAI,OAASkB,EACxB,GAAIX,EAAO,GACTR,EAAKE,GAAMM,GAAQ,MACd,CAEL,GADAR,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAER,IAAK6B,GAAQ,GAAKA,GAAQ,IAAMA,GAAQ,IAEtC,GADAR,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAGVqB,EAAKE,GAAMM,CACb,CACA,GAAI,EAAEN,IAAOU,EACX,MAAMjC,EAIR,MAAM4C,EAAUtB,EAAI,OAASkB,EACvBL,EAAIZ,EAAKqB,EACf,GAAIT,EAAIF,EACN,MAAMjC,EACD,OAAImC,GAAKP,EAEP,GAETR,EAAKC,EAAMC,EAAKC,EAAIiB,EAAQI,CAAO,EACnCrB,GAAMqB,EACCrB,EACT,CAEO,SAASsB,EACdvB,EACAD,EACAgB,EACQ,CACR,MAAMT,EAAKN,EAAI,OAASd,EAClByB,EAAKZ,EAAK,OAChB,GAAIO,GAAM,GAAKK,IAAO,GAAKI,GAAWT,EACpC,MAAO,GAET,IAAIJ,EAAK,EACLD,EAAK,EAKT,MAAMe,EAAY,IAAI,YAAYhC,CAAQ,EACpCwC,EAAa,IAAI,YAAY3C,CAAO,EAI1C,KAAOqB,EAAKa,GAAS,CACnB,MAAME,EAAIrB,EAAKC,EAAUG,EAAKE,CAAE,EAAGd,CAAM,IAAMH,EAC/CuC,EAAWtB,EAAKpB,GAAWkC,EAAUC,GACrCD,EAAUC,GAAK,EAAEf,CACnB,CAEA,IAAIgB,EAAShB,EACb,KAAOA,EAAKI,EAAK3B,GAAU,CAEzB,MAAMsC,EAAIrB,EAAKC,EAAUG,EAAKE,CAAE,EAAGd,CAAM,IAAMH,EAG/C,IAAIuB,EAAO,EACPC,EAAS,EACb,QACMgB,EAAOT,EAAUC,GAAK,EAC1BQ,EAAO,GAAKA,EAAOvB,EAAKrB,EACxB4C,EAAOD,EAAWC,EAAO3C,GAAW,EAGpC,GAAIkB,EAAIyB,EAAOjB,KAAUR,EAAIE,EAAKM,IAChC,QAASkB,EAAK,GAAK,EAAEA,EACnB,GAAI1B,EAAIyB,EAAOC,KAAQ1B,EAAIE,EAAKwB,IAAOxB,EAAKwB,EAAKpB,EAAI,CAE/CE,EAAOkB,GAAMA,GAAM/C,IACrB6B,EAAOkB,EACPjB,EAASP,EAAKuB,GAEhB,KACF,EAQN,GAJAD,EAAWtB,EAAKpB,GAAWkC,EAAUC,GACrCD,EAAUC,GAAKf,EAAK,EAGhBM,IAAS,EAAG,CACd,EAAEN,EACF,QACF,CAEA,IAAIyB,EAAMzB,EAAK,EACf,MAAMwB,EAAKxB,EAAKM,EAKhB,KAAOmB,EAAMD,GAAI,CACf,MAAMT,EAAIrB,EAAKC,EAAUG,EAAK2B,CAAG,EAAGvC,CAAM,IAAMH,EAChDuC,EAAWG,EAAM7C,GAAWkC,EAAUC,GACtCD,EAAUC,GAAK,EAAEU,CACnB,CAEA,MAAMpB,EAAOL,EAAKgB,EAWlB,GAVAhB,GAAMM,EACNA,GAAQ7B,EAEJ6B,EAAO,GACTT,EAAKE,GAAMO,EAEXT,EAAKE,GAAM,GAITM,EAAO,GACTR,EAAKE,IAAOM,GAAQ,MACf,CAEL,GADAR,EAAKE,IAAO,IACR,EAAEA,IAAOU,EACX,MAAMjC,EAER,IAAI2C,EAAId,EAAO,GACf,KAAOc,GAAK,IAAMA,GAAK,IAErB,GADAtB,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAGVqB,EAAKE,GAAMoB,EAAI,GACjB,CAeA,GAdI,EAAEpB,IAAOU,GAKTV,EAAKM,GAAQI,IAGjBb,EAAKC,EAAMC,EAAKC,EAAIiB,EAAQX,CAAI,EAChCN,GAAMM,EACNW,EAAShB,EAGTD,GAAM,EACFA,GAAMU,GACR,MAAMjC,EAMR,GAJAqB,EAAKE,EAAK,GAAKQ,EACfV,EAAKE,EAAK,GAAKQ,GAAU,EAGrBD,GAAQ,GAAK,CACf,IAAKA,GAAQ,GAAKA,GAAQ,IAAMA,GAAQ,IAEtC,GADAT,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAIV,GADAqB,EAAKE,GAAMO,EACP,EAAEP,IAAOU,EACX,MAAMjC,CAEV,CACF,CAEA,GAAIwC,IAAW,EAEb,MAAO,GAIT,IAAIX,EAAOP,EAAI,OAASkB,EACxB,GAAIX,EAAO,GACTR,EAAKE,GAAMM,GAAQ,MACd,CAEL,GADAR,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAER,IAAK6B,GAAQ,GAAKA,GAAQ,IAAMA,GAAQ,IAEtC,GADAR,EAAKE,GAAM,IACP,EAAEA,IAAOU,EACX,MAAMjC,EAGVqB,EAAKE,GAAMM,CACb,CACA,GAAI,EAAEN,IAAOU,EACX,MAAMjC,EAIR,MAAM4C,EAAUtB,EAAI,OAASkB,EACvBL,EAAIZ,EAAKqB,EACf,GAAIT,EAAIF,EACN,MAAMjC,EACD,OAAImC,GAAKP,EAEP,GAETR,EAAKC,EAAMC,EAAKC,EAAIiB,EAAQI,CAAO,EACnCrB,GAAMqB,EACCrB,EACT","names":["errInvalidSource","errShortBuffer","minMatch","winSizeLog","winSize","winMask","hashSizeLog","hashSize","hashShift","mfLimit","skipStrength","hasher","imulPolyfill","a","b","ah","al","bh","bl","imul","getUint32","copy","dest","src","di","si","len","i","calcUncompressedLen","sn","lLen","mLen","offset","uncompressBlock","dn","compressBlockBound","n","compressBlock","soffset","hashTable","h","anchor","fma","ref","l","lastLen","compressBlockHC","chainTable","next","ml","si2"]}

package/dist/sodium.cjs

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true}); function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }var _chunkXDPEU3HVcjs = require('./chunk-XDPEU3HV.cjs');var _libsodiumwrappers = require('libsodium-wrappers'); var _libsodiumwrappers2 = _interopRequireDefault(_libsodiumwrappers);function t(){return _chunkXDPEU3HVcjs.h.call(void 0, this,null,function*(){yield _libsodiumwrappers2.default.ready})}exports.setup = t; exports.sodium = _libsodiumwrappers2.default;
-//# sourceMappingURL=sodium.cjs.map

package/dist/sodium.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/sodium.ts"],"names":["sodium","setup","__async"],"mappings":"yCAAA,OAAOA,MAAY,qBAEnB,SAAsBC,GAAuB,QAAAC,EAAA,sBAC3C,MAAMF,EAAO,KACf","sourcesContent":["import sodium from \"libsodium-wrappers\";\n\nexport async function setup(): Promise<void> {\n  await sodium.ready;\n}\n\nexport { sodium };\n"]}

package/dist/sodium.d.ts

@@ -1,5 +0,0 @@
-export { default as sodium } from 'libsodium-wrappers';
-
-declare function setup(): Promise<void>;
-
-export { setup };

package/dist/sodium.js

@@ -1,2 +0,0 @@
-import{h as o}from"./chunk-UPFDSEKI.js";import i from"libsodium-wrappers";function t(){return o(this,null,function*(){yield i.ready})}export{t as setup,i as sodium};
-//# sourceMappingURL=sodium.js.map

package/dist/sodium.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/sodium.ts"],"sourcesContent":["import sodium from \"libsodium-wrappers\";\n\nexport async function setup(): Promise<void> {\n  await sodium.ready;\n}\n\nexport { sodium };\n"],"mappings":"wCAAA,OAAOA,MAAY,qBAEnB,SAAsBC,GAAuB,QAAAC,EAAA,sBAC3C,MAAMF,EAAO,KACf","names":["sodium","setup","__async"]}

package/dist/utils/store-buddy.cjs

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});require('../chunk-XDPEU3HV.cjs');function d(t,o=!1){return{init(s){const e=o?sessionStorage:localStorage;return e.getItem(t)||e.setItem(t,JSON.stringify(s)),{load(){const r=e.getItem(t);if(!r)throw new Error("store-buddy: data has not been set or cannot be recognised");return JSON.parse(r)},save:r=>e.setItem(t,JSON.stringify(r)),reset:()=>e.setItem(t,JSON.stringify(s)),clear:()=>e.removeItem(t)}}}}exports.storeBuddy = d;
-//# sourceMappingURL=store-buddy.cjs.map

package/dist/utils/store-buddy.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/utils/store-buddy.ts"],"names":["storeBuddy","key","session","initialData","sessionOrLocal","raw","data"],"mappings":"8BAwIO,SAASA,EAAcC,EAAaC,EAAU,GAA0B,CAC7E,MAAO,CACL,KAAKC,EAA8C,CACjD,MAAMC,EAAiBF,EAAU,eAAiB,aAElD,OAAKE,EAAe,QAAQH,CAAG,GAC7BG,EAAe,QAAQH,EAAK,KAAK,UAAUE,CAAW,CAAC,EAGlD,CACL,MAAyB,CACvB,MAAME,EAAMD,EAAe,QAAQH,CAAG,EAEtC,GAAI,CAACI,EACH,MAAM,IAAI,MACR,4DACF,EAIF,OADa,KAAK,MAAMA,CAAG,CAE7B,EACA,KAAOC,GACLF,EAAe,QAAQH,EAAK,KAAK,UAAUK,CAAI,CAAC,EAClD,MAAO,IACLF,EAAe,QAAQH,EAAK,KAAK,UAAUE,CAAW,CAAC,EACzD,MAAO,IAAYC,EAAe,WAAWH,CAAG,CAClD,CACF,CACF,CACF","sourcesContent":["type IsEmptyObject<O> = O extends { [key: string]: never }\n  ? Record<string, unknown>\n  : O;\n\ninterface StoreBuddyInit<T> {\n  /**\n   * Initialise the storeBuddy instance with 'default' (first-load) data. This\n   * behaves in the same way as the `save` method in the main `StoreBuddy`\n   * interface but doesn't save any data if the storage entry already exists\n   * (to prevent new data being overwritten by its older, default form).\n   * @param data The data to save to localStorage or sessionStorage.\n   * @returns The main `StoreBuddy` interface with methods like `load`, etc.\n   * @example\n   *\n   * ```ts\n   * import storeBuddy from \"store-buddy\";\n   *\n   * // The \"foo\" entry is initialised with the default data \"bar\"\n   * const storage1 = storeBuddy(\"foo\").init(\"bar\");\n   *\n   * // The \"hello\" entry is initialised with a default object literal\n   * const storage2 = storeBuddy(\"hello\").init({ prop1: \"world\", prop2: false });\n   * ```\n   */\n  init(data: IsEmptyObject<T>): StoreBuddy<T>;\n}\n\nexport interface StoreBuddy<T> {\n  /**\n   * Retrieve the current data set using this instance.\n   * @returns The data from localStorage or sessionStorage, throwing an error\n   * if no data is found.\n   * @example\n   *\n   * ```ts\n   * import storeBuddy from \"store-buddy\";\n   *\n   * const storage1 = storeBuddy(\"foo\").init(\"bar\");\n   * storage1.load(); // returns \"bar\"\n   * ```\n   */\n  load(): IsEmptyObject<T>;\n\n  /**\n   * Set new data or overwrite old data in localStorage or sessionStorage. For\n   * TS developers, saving data of a _different_ type to the one specified in\n   * the type parameter is prevented.\n   * @param data The data to save to localStorage or sessionStorage.\n   * @example\n   *\n   * ```ts\n   * import storeBuddy from \"store-buddy\";\n   *\n   * // Saves the string \"bar\" to the localStorage entry with the key \"foo\"\n   * const storage1 = storeBuddy(\"foo\").init(\"bar\");\n   *\n   * // Overwrites that same string with different data. Note that, without\n   * // specifying a specific type when initialising, there is no type safety\n   * // provided for TypeScript developers\n   * storage1.save(\"baz\");\n   * storage1.save(123);\n   *\n   * // This is type-safe...\n   * const storage2 = storeBuddy<number>(\"foo\").init(123);\n   *\n   * // ...so this works...\n   * storage2.save(456);\n   *\n   * // ...and this does not work :)\n   * storage2.save(\"I am not a number\");\n   * ```\n   */\n  save(data: IsEmptyObject<T>): void;\n\n  /**\n   * Reset the data back to its original value set with the `init` method.\n   * @example\n   *\n   * ```ts\n   * import storeBuddy from \"store-buddy\";\n   *\n   * const storage = storeBuddy(\"foo\").init(\"bar\");\n   * storage.save(\"hello\");\n   * storage.reset();\n   * storage.load(); // returns \"bar\"\n   * ```\n   */\n  reset(): void;\n\n  /**\n   * Remove all data set using this instance.\n   * @example\n   *\n   * ```ts\n   * import storeBuddy from \"store-buddy\";\n   *\n   * const storage = storeBuddy(\"foo\").init(\"bar\");\n   * storage.load(); // returns \"bar\"\n   * storage.clear();\n   * storage.load(); // throws an error (no data exists)\n   * ```\n   */\n  clear(): void;\n}\n\n/**\n * Create persistent or temporary client-side storage with a portable,\n * type-safe wrapper around the [Web Storage API](https://developer.mozilla.org/en-US/docs/Web/API/Web_Storage_API).\n * @param key The key used to access the stored value.\n * @param [session] Save data in sessionStorage (`true`) or in localStorage\n * (`false`). Default is `false`.\n * @example\n *\n * ```ts\n * import storeBuddy from \"store-buddy\";\n *\n * // \"foo\" is the key used to access the stored value, which is created in the\n * // method `init`\n * const storage1 = storeBuddy(\"foo\").init(\"bar\");\n *\n * // Using sessionStorage instead of localStorage is possible by specifying\n * // `true` in the `session` parameter\n * const storage2 = storeBuddy(\"foo\", true).init(\"bar\");\n *\n * // Type safety can be enabled by providing an argument to the type parameter\n * type Data = {\n *   hello: string;\n *   world: number;\n * }\n *\n * const storage3 = storeBuddy<Data>(\"foo\").init({\n *   hello: \"foo\",\n *   world: 123\n * })\n * ```\n */\nexport function storeBuddy<T>(key: string, session = false): StoreBuddyInit<T> {\n  return {\n    init(initialData: IsEmptyObject<T>): StoreBuddy<T> {\n      const sessionOrLocal = session ? sessionStorage : localStorage;\n\n      if (!sessionOrLocal.getItem(key)) {\n        sessionOrLocal.setItem(key, JSON.stringify(initialData));\n      }\n\n      return {\n        load(): IsEmptyObject<T> {\n          const raw = sessionOrLocal.getItem(key);\n\n          if (!raw) {\n            throw new Error(\n              \"store-buddy: data has not been set or cannot be recognised\"\n            );\n          }\n\n          const data = JSON.parse(raw);\n          return data;\n        },\n        save: (data: IsEmptyObject<T>): void =>\n          sessionOrLocal.setItem(key, JSON.stringify(data)),\n        reset: (): void =>\n          sessionOrLocal.setItem(key, JSON.stringify(initialData)),\n        clear: (): void => sessionOrLocal.removeItem(key)\n      };\n    }\n  };\n}\n"]}

package/dist/utils/store-buddy.d.ts

@@ -1,15 +0,0 @@
-declare type IsEmptyObject<O> = O extends {
-    [key: string]: never;
-} ? Record<string, unknown> : O;
-interface StoreBuddyInit<T> {
-    init(data: IsEmptyObject<T>): StoreBuddy<T>;
-}
-interface StoreBuddy<T> {
-    load(): IsEmptyObject<T>;
-    save(data: IsEmptyObject<T>): void;
-    reset(): void;
-    clear(): void;
-}
-declare function storeBuddy<T>(key: string, session?: boolean): StoreBuddyInit<T>;
-
-export { StoreBuddy, storeBuddy };

package/dist/utils/store-buddy.js

@@ -1,2 +0,0 @@
-import"../chunk-UPFDSEKI.js";function d(t,o=!1){return{init(s){const e=o?sessionStorage:localStorage;return e.getItem(t)||e.setItem(t,JSON.stringify(s)),{load(){const r=e.getItem(t);if(!r)throw new Error("store-buddy: data has not been set or cannot be recognised");return JSON.parse(r)},save:r=>e.setItem(t,JSON.stringify(r)),reset:()=>e.setItem(t,JSON.stringify(s)),clear:()=>e.removeItem(t)}}}}export{d as storeBuddy};
-//# sourceMappingURL=store-buddy.js.map

package/dist/utils/store-buddy.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/utils/store-buddy.ts"],"sourcesContent":["type IsEmptyObject<O> = O extends { [key: string]: never }\n  ? Record<string, unknown>\n  : O;\n\ninterface StoreBuddyInit<T> {\n  /**\n   * Initialise the storeBuddy instance with 'default' (first-load) data. This\n   * behaves in the same way as the `save` method in the main `StoreBuddy`\n   * interface but doesn't save any data if the storage entry already exists\n   * (to prevent new data being overwritten by its older, default form).\n   * @param data The data to save to localStorage or sessionStorage.\n   * @returns The main `StoreBuddy` interface with methods like `load`, etc.\n   * @example\n   *\n   * ```ts\n   * import storeBuddy from \"store-buddy\";\n   *\n   * // The \"foo\" entry is initialised with the default data \"bar\"\n   * const storage1 = storeBuddy(\"foo\").init(\"bar\");\n   *\n   * // The \"hello\" entry is initialised with a default object literal\n   * const storage2 = storeBuddy(\"hello\").init({ prop1: \"world\", prop2: false });\n   * ```\n   */\n  init(data: IsEmptyObject<T>): StoreBuddy<T>;\n}\n\nexport interface StoreBuddy<T> {\n  /**\n   * Retrieve the current data set using this instance.\n   * @returns The data from localStorage or sessionStorage, throwing an error\n   * if no data is found.\n   * @example\n   *\n   * ```ts\n   * import storeBuddy from \"store-buddy\";\n   *\n   * const storage1 = storeBuddy(\"foo\").init(\"bar\");\n   * storage1.load(); // returns \"bar\"\n   * ```\n   */\n  load(): IsEmptyObject<T>;\n\n  /**\n   * Set new data or overwrite old data in localStorage or sessionStorage. For\n   * TS developers, saving data of a _different_ type to the one specified in\n   * the type parameter is prevented.\n   * @param data The data to save to localStorage or sessionStorage.\n   * @example\n   *\n   * ```ts\n   * import storeBuddy from \"store-buddy\";\n   *\n   * // Saves the string \"bar\" to the localStorage entry with the key \"foo\"\n   * const storage1 = storeBuddy(\"foo\").init(\"bar\");\n   *\n   * // Overwrites that same string with different data. Note that, without\n   * // specifying a specific type when initialising, there is no type safety\n   * // provided for TypeScript developers\n   * storage1.save(\"baz\");\n   * storage1.save(123);\n   *\n   * // This is type-safe...\n   * const storage2 = storeBuddy<number>(\"foo\").init(123);\n   *\n   * // ...so this works...\n   * storage2.save(456);\n   *\n   * // ...and this does not work :)\n   * storage2.save(\"I am not a number\");\n   * ```\n   */\n  save(data: IsEmptyObject<T>): void;\n\n  /**\n   * Reset the data back to its original value set with the `init` method.\n   * @example\n   *\n   * ```ts\n   * import storeBuddy from \"store-buddy\";\n   *\n   * const storage = storeBuddy(\"foo\").init(\"bar\");\n   * storage.save(\"hello\");\n   * storage.reset();\n   * storage.load(); // returns \"bar\"\n   * ```\n   */\n  reset(): void;\n\n  /**\n   * Remove all data set using this instance.\n   * @example\n   *\n   * ```ts\n   * import storeBuddy from \"store-buddy\";\n   *\n   * const storage = storeBuddy(\"foo\").init(\"bar\");\n   * storage.load(); // returns \"bar\"\n   * storage.clear();\n   * storage.load(); // throws an error (no data exists)\n   * ```\n   */\n  clear(): void;\n}\n\n/**\n * Create persistent or temporary client-side storage with a portable,\n * type-safe wrapper around the [Web Storage API](https://developer.mozilla.org/en-US/docs/Web/API/Web_Storage_API).\n * @param key The key used to access the stored value.\n * @param [session] Save data in sessionStorage (`true`) or in localStorage\n * (`false`). Default is `false`.\n * @example\n *\n * ```ts\n * import storeBuddy from \"store-buddy\";\n *\n * // \"foo\" is the key used to access the stored value, which is created in the\n * // method `init`\n * const storage1 = storeBuddy(\"foo\").init(\"bar\");\n *\n * // Using sessionStorage instead of localStorage is possible by specifying\n * // `true` in the `session` parameter\n * const storage2 = storeBuddy(\"foo\", true).init(\"bar\");\n *\n * // Type safety can be enabled by providing an argument to the type parameter\n * type Data = {\n *   hello: string;\n *   world: number;\n * }\n *\n * const storage3 = storeBuddy<Data>(\"foo\").init({\n *   hello: \"foo\",\n *   world: 123\n * })\n * ```\n */\nexport function storeBuddy<T>(key: string, session = false): StoreBuddyInit<T> {\n  return {\n    init(initialData: IsEmptyObject<T>): StoreBuddy<T> {\n      const sessionOrLocal = session ? sessionStorage : localStorage;\n\n      if (!sessionOrLocal.getItem(key)) {\n        sessionOrLocal.setItem(key, JSON.stringify(initialData));\n      }\n\n      return {\n        load(): IsEmptyObject<T> {\n          const raw = sessionOrLocal.getItem(key);\n\n          if (!raw) {\n            throw new Error(\n              \"store-buddy: data has not been set or cannot be recognised\"\n            );\n          }\n\n          const data = JSON.parse(raw);\n          return data;\n        },\n        save: (data: IsEmptyObject<T>): void =>\n          sessionOrLocal.setItem(key, JSON.stringify(data)),\n        reset: (): void =>\n          sessionOrLocal.setItem(key, JSON.stringify(initialData)),\n        clear: (): void => sessionOrLocal.removeItem(key)\n      };\n    }\n  };\n}\n"],"mappings":"6BAwIO,SAASA,EAAcC,EAAaC,EAAU,GAA0B,CAC7E,MAAO,CACL,KAAKC,EAA8C,CACjD,MAAMC,EAAiBF,EAAU,eAAiB,aAElD,OAAKE,EAAe,QAAQH,CAAG,GAC7BG,EAAe,QAAQH,EAAK,KAAK,UAAUE,CAAW,CAAC,EAGlD,CACL,MAAyB,CACvB,MAAME,EAAMD,EAAe,QAAQH,CAAG,EAEtC,GAAI,CAACI,EACH,MAAM,IAAI,MACR,4DACF,EAIF,OADa,KAAK,MAAMA,CAAG,CAE7B,EACA,KAAOC,GACLF,EAAe,QAAQH,EAAK,KAAK,UAAUK,CAAI,CAAC,EAClD,MAAO,IACLF,EAAe,QAAQH,EAAK,KAAK,UAAUE,CAAW,CAAC,EACzD,MAAO,IAAYC,EAAe,WAAWH,CAAG,CAClD,CACF,CACF,CACF","names":["storeBuddy","key","session","initialData","sessionOrLocal","raw","data"]}

package/dist/utils/time.cjs

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});require('../chunk-XDPEU3HV.cjs');const n=s=>new Promise(o=>setTimeout(o,s)),e=s=>o=>Math.round(o*s),r= exports.ms ={seconds:e(1e3),minutes:e(6e4),hours:e(36e5),days:e(864e5),weeks:e(6048e5),months:e(26298e5),years:e(315576e5)};exports.ms = r; exports.sleep = n;
-//# sourceMappingURL=time.cjs.map

package/dist/utils/time.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/utils/time.ts"],"names":["sleep","ms","r","calc","m","n"],"mappings":"8BAAO,MAAMA,EAASC,GACpB,IAAI,QAAcC,GAAK,WAAWA,EAAGD,CAAE,CAAC,EAEpCE,EACHC,GACAC,GACC,KAAK,MAAMA,EAAID,CAAC,EAEPH,EAAK,CAChB,QAASE,EAAK,GAAG,EACjB,QAASA,EAAK,GAAG,EACjB,MAAOA,EAAK,IAAI,EAChB,KAAMA,EAAK,KAAK,EAChB,MAAOA,EAAK,MAAM,EAClB,OAAQA,EAAK,OAAO,EACpB,MAAOA,EAAK,QAAQ,CACtB","sourcesContent":["export const sleep = (ms: number): Promise<void> =>\n  new Promise<void>(r => setTimeout(r, ms));\n\nconst calc =\n  (m: number) =>\n  (n: number): number =>\n    Math.round(n * m);\n\nexport const ms = {\n  seconds: calc(1e3),\n  minutes: calc(6e4),\n  hours: calc(36e5),\n  days: calc(864e5),\n  weeks: calc(6048e5),\n  months: calc(26298e5),\n  years: calc(315576e5)\n};\n"]}

package/dist/utils/time.d.ts

@@ -1,12 +0,0 @@
-declare const sleep: (ms: number) => Promise<void>;
-declare const ms: {
-    seconds: (n: number) => number;
-    minutes: (n: number) => number;
-    hours: (n: number) => number;
-    days: (n: number) => number;
-    weeks: (n: number) => number;
-    months: (n: number) => number;
-    years: (n: number) => number;
-};
-
-export { ms, sleep };

package/dist/utils/time.js

@@ -1,2 +0,0 @@
-import"../chunk-UPFDSEKI.js";const n=s=>new Promise(o=>setTimeout(o,s)),e=s=>o=>Math.round(o*s),r={seconds:e(1e3),minutes:e(6e4),hours:e(36e5),days:e(864e5),weeks:e(6048e5),months:e(26298e5),years:e(315576e5)};export{r as ms,n as sleep};
-//# sourceMappingURL=time.js.map

package/dist/utils/time.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/utils/time.ts"],"sourcesContent":["export const sleep = (ms: number): Promise<void> =>\n  new Promise<void>(r => setTimeout(r, ms));\n\nconst calc =\n  (m: number) =>\n  (n: number): number =>\n    Math.round(n * m);\n\nexport const ms = {\n  seconds: calc(1e3),\n  minutes: calc(6e4),\n  hours: calc(36e5),\n  days: calc(864e5),\n  weeks: calc(6048e5),\n  months: calc(26298e5),\n  years: calc(315576e5)\n};\n"],"mappings":"6BAAO,MAAMA,EAASC,GACpB,IAAI,QAAcC,GAAK,WAAWA,EAAGD,CAAE,CAAC,EAEpCE,EACHC,GACAC,GACC,KAAK,MAAMA,EAAID,CAAC,EAEPH,EAAK,CAChB,QAASE,EAAK,GAAG,EACjB,QAASA,EAAK,GAAG,EACjB,MAAOA,EAAK,IAAI,EAChB,KAAMA,EAAK,KAAK,EAChB,MAAOA,EAAK,MAAM,EAClB,OAAQA,EAAK,OAAO,EACpB,MAAOA,EAAK,QAAQ,CACtB","names":["sleep","ms","r","calc","m","n"]}

package/dist/utils/utils.cjs

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXDPEU3HVcjs = require('../chunk-XDPEU3HV.cjs');function m(...n){let e=0;for(const o of n)e+=o.length;const t=new Uint8Array(e);let i=0;for(const o of n)t.set(o,i),i+=o.length;return t}function*f(n){let e=0;for(const t of n)yield[e,t],e++}function*d(n,e){for(let t=0;t<n.length;t+=e)yield n.slice(t,t+e)}const h=(n,e)=>_chunkXDPEU3HVcjs.h.call(void 0, void 0,null,function*(){const t=e.slice(0,n),i=e.slice(n),o=[],c=(s,r,u)=>_chunkXDPEU3HVcjs.h.call(void 0, void 0,null,function*(){o[r]=yield s(),yield u()}),l=()=>_chunkXDPEU3HVcjs.h.call(void 0, void 0,null,function*(){const s=e.length-i.length,r=i.shift();r!==void 0&&(yield c(r,s,l))});return yield Promise.all(t.map((s,r)=>c(s,r,l))),o});exports.chunks = d; exports.concatenate = m; exports.enumerate = f; exports.promiseAllLimit = h;
-//# sourceMappingURL=utils.cjs.map

package/dist/utils/utils.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/utils/utils.ts"],"names":["concatenate","arrays","totalLength","arr","result","offset","enumerate","iterable","i","x","chunks","n","promiseAllLimit","list","__async","head","tail","execute","promise","runNext"],"mappings":"0CAAO,SAASA,KAAeC,EAAkC,CAC/D,IAAIC,EAAc,EAClB,UAAWC,KAAOF,EAChBC,GAAeC,EAAI,OAErB,MAAMC,EAAS,IAAI,WAAWF,CAAW,EACzC,IAAIG,EAAS,EACb,UAAWF,KAAOF,EAChBG,EAAO,IAAID,EAAKE,CAAM,EACtBA,GAAUF,EAAI,OAEhB,OAAOC,CACT,CAEO,SAAUE,EACfC,EAC+B,CAC/B,IAAIC,EAAI,EAER,UAAWC,KAAKF,EACd,KAAM,CAACC,EAAGC,CAAC,EACXD,GAEJ,CAEO,SAAUE,EACfP,EACAQ,EACsC,CACtC,QAASH,EAAI,EAAGA,EAAIL,EAAI,OAAQK,GAAKG,EACnC,MAAMR,EAAI,MAAMK,EAAGA,EAAIG,CAAC,CAE5B,CAEO,MAAMC,EAAkB,CAC7B,EACAC,IACiBC,EAAA,wBACjB,MAAMC,EAAOF,EAAK,MAAM,EAAG,CAAC,EACtBG,EAAOH,EAAK,MAAM,CAAC,EACnBT,EAAc,CAAC,EACfa,EAAU,CACdC,EACAV,EACAW,IACkBL,EAAA,wBAClBV,EAAOI,GAAK,MAAMU,EAAQ,EAC1B,MAAMC,EAAQ,CAChB,GACMA,EAAU,IAA2BL,EAAA,wBACzC,MAAMN,EAAIK,EAAK,OAASG,EAAK,OACvBE,EAAUF,EAAK,MAAM,EACvBE,IAAY,SACd,MAAMD,EAAQC,EAASV,EAAGW,CAAO,EAErC,GACA,aAAM,QAAQ,IAAIJ,EAAK,IAAI,CAACG,EAASV,IAAMS,EAAQC,EAASV,EAAGW,CAAO,CAAC,CAAC,EACjEf,CACT","sourcesContent":["export function concatenate(...arrays: Uint8Array[]): Uint8Array {\n  let totalLength = 0;\n  for (const arr of arrays) {\n    totalLength += arr.length;\n  }\n  const result = new Uint8Array(totalLength);\n  let offset = 0;\n  for (const arr of arrays) {\n    result.set(arr, offset);\n    offset += arr.length;\n  }\n  return result;\n}\n\nexport function* enumerate<T>(\n  iterable: Iterable<T>\n): IterableIterator<[number, T]> {\n  let i = 0;\n\n  for (const x of iterable) {\n    yield [i, x];\n    i++;\n  }\n}\n\nexport function* chunks(\n  arr: Uint8Array,\n  n: number\n): Generator<Uint8Array, void, unknown> {\n  for (let i = 0; i < arr.length; i += n) {\n    yield arr.slice(i, i + n);\n  }\n}\n\nexport const promiseAllLimit = async <T>(\n  n: number,\n  list: (() => Promise<T>)[]\n): Promise<T[]> => {\n  const head = list.slice(0, n);\n  const tail = list.slice(n);\n  const result: T[] = [];\n  const execute = async (\n    promise: () => Promise<T>,\n    i: number,\n    runNext: () => Promise<void>\n  ): Promise<void> => {\n    result[i] = await promise();\n    await runNext();\n  };\n  const runNext = async (): Promise<void> => {\n    const i = list.length - tail.length;\n    const promise = tail.shift();\n    if (promise !== undefined) {\n      await execute(promise, i, runNext);\n    }\n  };\n  await Promise.all(head.map((promise, i) => execute(promise, i, runNext)));\n  return result;\n};\n"]}

package/dist/utils/utils.d.ts

@@ -1,6 +0,0 @@
-declare function concatenate(...arrays: Uint8Array[]): Uint8Array;
-declare function enumerate<T>(iterable: Iterable<T>): IterableIterator<[number, T]>;
-declare function chunks(arr: Uint8Array, n: number): Generator<Uint8Array, void, unknown>;
-declare const promiseAllLimit: <T>(n: number, list: (() => Promise<T>)[]) => Promise<T[]>;
-
-export { chunks, concatenate, enumerate, promiseAllLimit };

package/dist/utils/utils.js

@@ -1,2 +0,0 @@
-import{h as a}from"../chunk-UPFDSEKI.js";function m(...n){let e=0;for(const o of n)e+=o.length;const t=new Uint8Array(e);let i=0;for(const o of n)t.set(o,i),i+=o.length;return t}function*f(n){let e=0;for(const t of n)yield[e,t],e++}function*d(n,e){for(let t=0;t<n.length;t+=e)yield n.slice(t,t+e)}const h=(n,e)=>a(void 0,null,function*(){const t=e.slice(0,n),i=e.slice(n),o=[],c=(s,r,u)=>a(void 0,null,function*(){o[r]=yield s(),yield u()}),l=()=>a(void 0,null,function*(){const s=e.length-i.length,r=i.shift();r!==void 0&&(yield c(r,s,l))});return yield Promise.all(t.map((s,r)=>c(s,r,l))),o});export{d as chunks,m as concatenate,f as enumerate,h as promiseAllLimit};
-//# sourceMappingURL=utils.js.map

package/dist/utils/utils.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/utils/utils.ts"],"sourcesContent":["export function concatenate(...arrays: Uint8Array[]): Uint8Array {\n  let totalLength = 0;\n  for (const arr of arrays) {\n    totalLength += arr.length;\n  }\n  const result = new Uint8Array(totalLength);\n  let offset = 0;\n  for (const arr of arrays) {\n    result.set(arr, offset);\n    offset += arr.length;\n  }\n  return result;\n}\n\nexport function* enumerate<T>(\n  iterable: Iterable<T>\n): IterableIterator<[number, T]> {\n  let i = 0;\n\n  for (const x of iterable) {\n    yield [i, x];\n    i++;\n  }\n}\n\nexport function* chunks(\n  arr: Uint8Array,\n  n: number\n): Generator<Uint8Array, void, unknown> {\n  for (let i = 0; i < arr.length; i += n) {\n    yield arr.slice(i, i + n);\n  }\n}\n\nexport const promiseAllLimit = async <T>(\n  n: number,\n  list: (() => Promise<T>)[]\n): Promise<T[]> => {\n  const head = list.slice(0, n);\n  const tail = list.slice(n);\n  const result: T[] = [];\n  const execute = async (\n    promise: () => Promise<T>,\n    i: number,\n    runNext: () => Promise<void>\n  ): Promise<void> => {\n    result[i] = await promise();\n    await runNext();\n  };\n  const runNext = async (): Promise<void> => {\n    const i = list.length - tail.length;\n    const promise = tail.shift();\n    if (promise !== undefined) {\n      await execute(promise, i, runNext);\n    }\n  };\n  await Promise.all(head.map((promise, i) => execute(promise, i, runNext)));\n  return result;\n};\n"],"mappings":"yCAAO,SAASA,KAAeC,EAAkC,CAC/D,IAAIC,EAAc,EAClB,UAAWC,KAAOF,EAChBC,GAAeC,EAAI,OAErB,MAAMC,EAAS,IAAI,WAAWF,CAAW,EACzC,IAAIG,EAAS,EACb,UAAWF,KAAOF,EAChBG,EAAO,IAAID,EAAKE,CAAM,EACtBA,GAAUF,EAAI,OAEhB,OAAOC,CACT,CAEO,SAAUE,EACfC,EAC+B,CAC/B,IAAIC,EAAI,EAER,UAAWC,KAAKF,EACd,KAAM,CAACC,EAAGC,CAAC,EACXD,GAEJ,CAEO,SAAUE,EACfP,EACAQ,EACsC,CACtC,QAASH,EAAI,EAAGA,EAAIL,EAAI,OAAQK,GAAKG,EACnC,MAAMR,EAAI,MAAMK,EAAGA,EAAIG,CAAC,CAE5B,CAEO,MAAMC,EAAkB,CAC7B,EACAC,IACiBC,EAAA,wBACjB,MAAMC,EAAOF,EAAK,MAAM,EAAG,CAAC,EACtBG,EAAOH,EAAK,MAAM,CAAC,EACnBT,EAAc,CAAC,EACfa,EAAU,CACdC,EACAV,EACAW,IACkBL,EAAA,wBAClBV,EAAOI,GAAK,MAAMU,EAAQ,EAC1B,MAAMC,EAAQ,CAChB,GACMA,EAAU,IAA2BL,EAAA,wBACzC,MAAMN,EAAIK,EAAK,OAASG,EAAK,OACvBE,EAAUF,EAAK,MAAM,EACvBE,IAAY,SACd,MAAMD,EAAQC,EAASV,EAAGW,CAAO,EAErC,GACA,aAAM,QAAQ,IAAIJ,EAAK,IAAI,CAACG,EAASV,IAAMS,EAAQC,EAASV,EAAGW,CAAO,CAAC,CAAC,EACjEf,CACT","names":["concatenate","arrays","totalLength","arr","result","offset","enumerate","iterable","i","x","chunks","n","promiseAllLimit","list","__async","head","tail","execute","promise","runNext"]}

package/dist/worker/md5.cjs

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXDPEU3HVcjs = require('../chunk-XDPEU3HV.cjs');var _workerCodesjs = require('./workerCodes.js');function d(s){return _chunkXDPEU3HVcjs.h.call(void 0, this,null,function*(){return new Promise((o,r)=>{const e=new Worker(URL.createObjectURL(new Blob([_workerCodesjs.workerMd5Script],{type:"text/javascript"})));e.addEventListener("error",r),e.addEventListener("messageerror",r),e.addEventListener("message",({data:t})=>{if(t.event==="md5-result")return e.terminate(),o(t.data)}),e.postMessage({event:"md5",data:s})})})}exports.md5 = d;
-//# sourceMappingURL=md5.cjs.map

package/dist/worker/md5.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/worker/md5.ts"],"names":["workerMd5Script","md5","data","__async","resolve","reject","worker"],"mappings":"0CAAA,OAAS,mBAAAA,MAAuB,mBAEhC,SAAsBC,EAAIC,EAAmC,QAAAC,EAAA,sBAC3D,OAAO,IAAI,QAAQ,CAACC,EAASC,IAAW,CACtC,MAAMC,EAAS,IAAI,OACjB,IAAI,gBACF,IAAI,KAAK,CAACN,CAAe,EAAG,CAAE,KAAM,iBAAkB,CAAC,CACzD,CACF,EACAM,EAAO,iBAAiB,QAASD,CAAM,EACvCC,EAAO,iBAAiB,eAAgBD,CAAM,EAE9CC,EAAO,iBAAiB,UAAW,CAAC,CAAE,KAAAJ,CAAK,IAAM,CAC/C,GAAIA,EAAK,QAAU,aACjB,OAAAI,EAAO,UAAU,EACVF,EAAQF,EAAK,IAAI,CAE5B,CAAC,EAEDI,EAAO,YAAY,CACjB,MAAO,MACP,KAAAJ,CACF,CAAC,CACH,CAAC,CACH","sourcesContent":["import { workerMd5Script } from \"./workerCodes.js\";\n\nexport async function md5(data: Uint8Array): Promise<string> {\n  return new Promise((resolve, reject) => {\n    const worker = new Worker(\n      URL.createObjectURL(\n        new Blob([workerMd5Script], { type: \"text/javascript\" })\n      )\n    );\n    worker.addEventListener(\"error\", reject);\n    worker.addEventListener(\"messageerror\", reject);\n\n    worker.addEventListener(\"message\", ({ data }) => {\n      if (data.event === \"md5-result\") {\n        worker.terminate();\n        return resolve(data.data);\n      }\n    });\n\n    worker.postMessage({\n      event: \"md5\",\n      data\n    });\n  });\n}\n"]}

package/dist/worker/md5.d.ts

@@ -1,3 +0,0 @@
-declare function md5(data: Uint8Array): Promise<string>;
-
-export { md5 };

package/dist/worker/md5.js

@@ -1,2 +0,0 @@
-import{h as n}from"../chunk-UPFDSEKI.js";import{workerMd5Script as i}from"./workerCodes.js";function d(s){return n(this,null,function*(){return new Promise((o,r)=>{const e=new Worker(URL.createObjectURL(new Blob([i],{type:"text/javascript"})));e.addEventListener("error",r),e.addEventListener("messageerror",r),e.addEventListener("message",({data:t})=>{if(t.event==="md5-result")return e.terminate(),o(t.data)}),e.postMessage({event:"md5",data:s})})})}export{d as md5};
-//# sourceMappingURL=md5.js.map

package/dist/worker/md5.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/worker/md5.ts"],"sourcesContent":["import { workerMd5Script } from \"./workerCodes.js\";\n\nexport async function md5(data: Uint8Array): Promise<string> {\n  return new Promise((resolve, reject) => {\n    const worker = new Worker(\n      URL.createObjectURL(\n        new Blob([workerMd5Script], { type: \"text/javascript\" })\n      )\n    );\n    worker.addEventListener(\"error\", reject);\n    worker.addEventListener(\"messageerror\", reject);\n\n    worker.addEventListener(\"message\", ({ data }) => {\n      if (data.event === \"md5-result\") {\n        worker.terminate();\n        return resolve(data.data);\n      }\n    });\n\n    worker.postMessage({\n      event: \"md5\",\n      data\n    });\n  });\n}\n"],"mappings":"yCAAA,OAAS,mBAAAA,MAAuB,mBAEhC,SAAsBC,EAAIC,EAAmC,QAAAC,EAAA,sBAC3D,OAAO,IAAI,QAAQ,CAACC,EAASC,IAAW,CACtC,MAAMC,EAAS,IAAI,OACjB,IAAI,gBACF,IAAI,KAAK,CAACN,CAAe,EAAG,CAAE,KAAM,iBAAkB,CAAC,CACzD,CACF,EACAM,EAAO,iBAAiB,QAASD,CAAM,EACvCC,EAAO,iBAAiB,eAAgBD,CAAM,EAE9CC,EAAO,iBAAiB,UAAW,CAAC,CAAE,KAAAJ,CAAK,IAAM,CAC/C,GAAIA,EAAK,QAAU,aACjB,OAAAI,EAAO,UAAU,EACVF,EAAQF,EAAK,IAAI,CAE5B,CAAC,EAEDI,EAAO,YAAY,CACjB,MAAO,MACP,KAAAJ,CACF,CAAC,CACH,CAAC,CACH","names":["workerMd5Script","md5","data","__async","resolve","reject","worker"]}

package/dist/worker/sodium.cjs

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXDPEU3HVcjs = require('../chunk-XDPEU3HV.cjs');var _workerCodesjs = require('./workerCodes.js');function s(i,c,e,n){return _chunkXDPEU3HVcjs.h.call(void 0, this,null,function*(){return new Promise((d,a)=>{e==null||e({current:0,percent:0,total:c.byteLength});const t=new Worker(URL.createObjectURL(new Blob([_workerCodesjs.workerSodiumScript],{type:"text/javascript"})));t.addEventListener("error",a),t.addEventListener("messageerror",a),t.addEventListener("message",({data:o})=>{switch(o.event){case"ready":{const r={event:"encrypt",data:c,key:i};t.postMessage(r,[r.data.buffer]);break}case"encrypt-progress":{if(n!=null&&n.aborted){const r=new Error("Aborted");r.name="AbortError",t.terminate(),a(r)}e==null||e(o.data);break}case"encrypt-result":return t.terminate(),d(o.data)}})})})}function v(i,c,e,n){return _chunkXDPEU3HVcjs.h.call(void 0, this,null,function*(){return new Promise((d,a)=>{e==null||e({current:0,percent:0,total:c.byteLength});const t=new Worker(URL.createObjectURL(new Blob([_workerCodesjs.workerSodiumScript],{type:"text/javascript"})));t.addEventListener("error",a),t.addEventListener("messageerror",a),t.addEventListener("message",({data:o})=>{switch(o.event){case"ready":{const r={event:"decrypt",key:i,data:c};t.postMessage(r,[r.data.buffer]);break}case"decrypt-progress":{if(n!=null&&n.aborted){const r=new Error("Aborted");r.name="AbortError",t.terminate(),a(r)}e==null||e(o.data);break}case"decrypt-result":return t.terminate(),d(o.data)}})})})}exports.decrypt = v; exports.encrypt = s;
-//# sourceMappingURL=sodium.cjs.map

package/dist/worker/sodium.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/worker/sodium.ts"],"names":["workerSodiumScript","encrypt","key","dataToEncrypt","progress","signal","__async","resolve","reject","worker","data","postData","abortError","decrypt","dataToDecrypt"],"mappings":"0CACA,OAAS,sBAAAA,MAA0B,mBAenC,SAAsBC,EACpBC,EACAC,EACAC,EACAC,EACwB,QAAAC,EAAA,sBACxB,OAAO,IAAI,QAAQ,CAACC,EAASC,IAAW,CACtCJ,GAAA,MAAAA,EAAW,CACT,QAAS,EACT,QAAS,EACT,MAAOD,EAAc,UACvB,GACA,MAAMM,EAAS,IAAI,OACjB,IAAI,gBACF,IAAI,KAAK,CAACT,CAAkB,EAAG,CAAE,KAAM,iBAAkB,CAAC,CAC5D,CACF,EACAS,EAAO,iBAAiB,QAASD,CAAM,EACvCC,EAAO,iBAAiB,eAAgBD,CAAM,EAC9CC,EAAO,iBAAiB,UAAW,CAAC,CAAE,KAAAC,CAAK,IAAM,CAC/C,OAAQA,EAAK,WACN,QAAS,CACZ,MAAMC,EAAW,CACf,MAAO,UACP,KAAMR,EACN,IAAAD,CACF,EACAO,EAAO,YACLE,EACA,CAACA,EAAS,KAAK,MAAM,CAGvB,EACA,KACF,KACK,mBAAoB,CACvB,GAAIN,GAAA,MAAAA,EAAQ,QAAS,CACnB,MAAMO,EAAa,IAAI,MAAM,SAAS,EACtCA,EAAW,KAAO,aAClBH,EAAO,UAAU,EACjBD,EAAOI,CAAU,CACnB,CACAR,GAAA,MAAAA,EAAWM,EAAK,MAChB,KACF,KACK,iBACH,OAAAD,EAAO,UAAU,EACVF,EAAQG,EAAK,IAAI,EAG9B,CAAC,CACH,CAAC,CACH,GAEA,SAAsBG,EACpBX,EACAY,EACAV,EACAC,EACqB,QAAAC,EAAA,sBACrB,OAAO,IAAI,QAAQ,CAACC,EAASC,IAAW,CACtCJ,GAAA,MAAAA,EAAW,CACT,QAAS,EACT,QAAS,EACT,MAAOU,EAAc,UACvB,GACA,MAAML,EAAS,IAAI,OACjB,IAAI,gBACF,IAAI,KAAK,CAACT,CAAkB,EAAG,CAAE,KAAM,iBAAkB,CAAC,CAC5D,CACF,EACAS,EAAO,iBAAiB,QAASD,CAAM,EACvCC,EAAO,iBAAiB,eAAgBD,CAAM,EAE9CC,EAAO,iBAAiB,UAAW,CAAC,CAAE,KAAAC,CAAK,IAAM,CAC/C,OAAQA,EAAK,WACN,QAAS,CACZ,MAAMC,EAAW,CACf,MAAO,UACP,IAAAT,EACA,KAAMY,CACR,EACAL,EAAO,YACLE,EACA,CAACA,EAAS,KAAK,MAAM,CAGvB,EACA,KACF,KACK,mBAAoB,CACvB,GAAIN,GAAA,MAAAA,EAAQ,QAAS,CACnB,MAAMO,EAAa,IAAI,MAAM,SAAS,EACtCA,EAAW,KAAO,aAClBH,EAAO,UAAU,EACjBD,EAAOI,CAAU,CACnB,CACAR,GAAA,MAAAA,EAAWM,EAAK,MAChB,KACF,KACK,iBACH,OAAAD,EAAO,UAAU,EACVF,EAAQG,EAAK,IAAI,EAG9B,CAAC,CACH,CAAC,CACH","sourcesContent":["import type { EncryptedFile, Progress } from \"../crypto/file.js\";\nimport { workerSodiumScript } from \"./workerCodes.js\";\n\n// const ensureNonDetachedUniqueBuffers = (\n//   values: Transferable[]\n// ): Set<Transferable> =>\n//   new Set(\n//     values.filter(v => {\n//       if (v instanceof ArrayBuffer) {\n//         return v.byteLength === 0;\n//       } else {\n//         return true;\n//       }\n//     })\n//   );\n\nexport async function encrypt(\n  key: Uint8Array,\n  dataToEncrypt: Uint8Array,\n  progress?: (progress: Progress) => Promise<void>,\n  signal?: AbortSignal\n): Promise<EncryptedFile> {\n  return new Promise((resolve, reject) => {\n    progress?.({\n      current: 0,\n      percent: 0,\n      total: dataToEncrypt.byteLength\n    });\n    const worker = new Worker(\n      URL.createObjectURL(\n        new Blob([workerSodiumScript], { type: \"text/javascript\" })\n      )\n    );\n    worker.addEventListener(\"error\", reject);\n    worker.addEventListener(\"messageerror\", reject);\n    worker.addEventListener(\"message\", ({ data }) => {\n      switch (data.event) {\n        case \"ready\": {\n          const postData = {\n            event: \"encrypt\",\n            data: dataToEncrypt,\n            key\n          };\n          worker.postMessage(\n            postData,\n            [postData.data.buffer]\n            // // @ts-expect-error - Typescript expects the transfer list to be an Array, but it can actually be any iterable.\n            // ensureNonDetachedUniqueBuffers([postData.data.buffer])\n          );\n          break;\n        }\n        case \"encrypt-progress\": {\n          if (signal?.aborted) {\n            const abortError = new Error(\"Aborted\");\n            abortError.name = \"AbortError\";\n            worker.terminate();\n            reject(abortError);\n          }\n          progress?.(data.data);\n          break;\n        }\n        case \"encrypt-result\": {\n          worker.terminate();\n          return resolve(data.data);\n        }\n      }\n    });\n  });\n}\n\nexport async function decrypt(\n  key: Uint8Array,\n  dataToDecrypt: Uint8Array,\n  progress?: (progress: Progress) => Promise<void>,\n  signal?: AbortSignal\n): Promise<Uint8Array> {\n  return new Promise((resolve, reject) => {\n    progress?.({\n      current: 0,\n      percent: 0,\n      total: dataToDecrypt.byteLength\n    });\n    const worker = new Worker(\n      URL.createObjectURL(\n        new Blob([workerSodiumScript], { type: \"text/javascript\" })\n      )\n    );\n    worker.addEventListener(\"error\", reject);\n    worker.addEventListener(\"messageerror\", reject);\n\n    worker.addEventListener(\"message\", ({ data }) => {\n      switch (data.event) {\n        case \"ready\": {\n          const postData = {\n            event: \"decrypt\",\n            key,\n            data: dataToDecrypt\n          };\n          worker.postMessage(\n            postData,\n            [postData.data.buffer]\n            // // @ts-expect-error - Typescript expects the transfer list to be an Array, but it can actually be any iterable.\n            // ensureNonDetachedUniqueBuffers([postData.data.buffer])\n          );\n          break;\n        }\n        case \"decrypt-progress\": {\n          if (signal?.aborted) {\n            const abortError = new Error(\"Aborted\");\n            abortError.name = \"AbortError\";\n            worker.terminate();\n            reject(abortError);\n          }\n          progress?.(data.data);\n          break;\n        }\n        case \"decrypt-result\": {\n          worker.terminate();\n          return resolve(data.data);\n        }\n      }\n    });\n  });\n}\n"]}

package/dist/worker/sodium.d.ts

@@ -1,6 +0,0 @@
-import { Progress, EncryptedFile } from '../crypto/file.js';
-
-declare function encrypt(key: Uint8Array, dataToEncrypt: Uint8Array, progress?: (progress: Progress) => Promise<void>, signal?: AbortSignal): Promise<EncryptedFile>;
-declare function decrypt(key: Uint8Array, dataToDecrypt: Uint8Array, progress?: (progress: Progress) => Promise<void>, signal?: AbortSignal): Promise<Uint8Array>;
-
-export { decrypt, encrypt };

package/dist/worker/sodium.js

@@ -1,2 +0,0 @@
-import{h as y}from"../chunk-UPFDSEKI.js";import{workerSodiumScript as b}from"./workerCodes.js";function s(i,c,e,n){return y(this,null,function*(){return new Promise((d,a)=>{e==null||e({current:0,percent:0,total:c.byteLength});const t=new Worker(URL.createObjectURL(new Blob([b],{type:"text/javascript"})));t.addEventListener("error",a),t.addEventListener("messageerror",a),t.addEventListener("message",({data:o})=>{switch(o.event){case"ready":{const r={event:"encrypt",data:c,key:i};t.postMessage(r,[r.data.buffer]);break}case"encrypt-progress":{if(n!=null&&n.aborted){const r=new Error("Aborted");r.name="AbortError",t.terminate(),a(r)}e==null||e(o.data);break}case"encrypt-result":return t.terminate(),d(o.data)}})})})}function v(i,c,e,n){return y(this,null,function*(){return new Promise((d,a)=>{e==null||e({current:0,percent:0,total:c.byteLength});const t=new Worker(URL.createObjectURL(new Blob([b],{type:"text/javascript"})));t.addEventListener("error",a),t.addEventListener("messageerror",a),t.addEventListener("message",({data:o})=>{switch(o.event){case"ready":{const r={event:"decrypt",key:i,data:c};t.postMessage(r,[r.data.buffer]);break}case"decrypt-progress":{if(n!=null&&n.aborted){const r=new Error("Aborted");r.name="AbortError",t.terminate(),a(r)}e==null||e(o.data);break}case"decrypt-result":return t.terminate(),d(o.data)}})})})}export{v as decrypt,s as encrypt};
-//# sourceMappingURL=sodium.js.map

package/dist/worker/sodium.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/worker/sodium.ts"],"sourcesContent":["import type { EncryptedFile, Progress } from \"../crypto/file.js\";\nimport { workerSodiumScript } from \"./workerCodes.js\";\n\n// const ensureNonDetachedUniqueBuffers = (\n//   values: Transferable[]\n// ): Set<Transferable> =>\n//   new Set(\n//     values.filter(v => {\n//       if (v instanceof ArrayBuffer) {\n//         return v.byteLength === 0;\n//       } else {\n//         return true;\n//       }\n//     })\n//   );\n\nexport async function encrypt(\n  key: Uint8Array,\n  dataToEncrypt: Uint8Array,\n  progress?: (progress: Progress) => Promise<void>,\n  signal?: AbortSignal\n): Promise<EncryptedFile> {\n  return new Promise((resolve, reject) => {\n    progress?.({\n      current: 0,\n      percent: 0,\n      total: dataToEncrypt.byteLength\n    });\n    const worker = new Worker(\n      URL.createObjectURL(\n        new Blob([workerSodiumScript], { type: \"text/javascript\" })\n      )\n    );\n    worker.addEventListener(\"error\", reject);\n    worker.addEventListener(\"messageerror\", reject);\n    worker.addEventListener(\"message\", ({ data }) => {\n      switch (data.event) {\n        case \"ready\": {\n          const postData = {\n            event: \"encrypt\",\n            data: dataToEncrypt,\n            key\n          };\n          worker.postMessage(\n            postData,\n            [postData.data.buffer]\n            // // @ts-expect-error - Typescript expects the transfer list to be an Array, but it can actually be any iterable.\n            // ensureNonDetachedUniqueBuffers([postData.data.buffer])\n          );\n          break;\n        }\n        case \"encrypt-progress\": {\n          if (signal?.aborted) {\n            const abortError = new Error(\"Aborted\");\n            abortError.name = \"AbortError\";\n            worker.terminate();\n            reject(abortError);\n          }\n          progress?.(data.data);\n          break;\n        }\n        case \"encrypt-result\": {\n          worker.terminate();\n          return resolve(data.data);\n        }\n      }\n    });\n  });\n}\n\nexport async function decrypt(\n  key: Uint8Array,\n  dataToDecrypt: Uint8Array,\n  progress?: (progress: Progress) => Promise<void>,\n  signal?: AbortSignal\n): Promise<Uint8Array> {\n  return new Promise((resolve, reject) => {\n    progress?.({\n      current: 0,\n      percent: 0,\n      total: dataToDecrypt.byteLength\n    });\n    const worker = new Worker(\n      URL.createObjectURL(\n        new Blob([workerSodiumScript], { type: \"text/javascript\" })\n      )\n    );\n    worker.addEventListener(\"error\", reject);\n    worker.addEventListener(\"messageerror\", reject);\n\n    worker.addEventListener(\"message\", ({ data }) => {\n      switch (data.event) {\n        case \"ready\": {\n          const postData = {\n            event: \"decrypt\",\n            key,\n            data: dataToDecrypt\n          };\n          worker.postMessage(\n            postData,\n            [postData.data.buffer]\n            // // @ts-expect-error - Typescript expects the transfer list to be an Array, but it can actually be any iterable.\n            // ensureNonDetachedUniqueBuffers([postData.data.buffer])\n          );\n          break;\n        }\n        case \"decrypt-progress\": {\n          if (signal?.aborted) {\n            const abortError = new Error(\"Aborted\");\n            abortError.name = \"AbortError\";\n            worker.terminate();\n            reject(abortError);\n          }\n          progress?.(data.data);\n          break;\n        }\n        case \"decrypt-result\": {\n          worker.terminate();\n          return resolve(data.data);\n        }\n      }\n    });\n  });\n}\n"],"mappings":"yCACA,OAAS,sBAAAA,MAA0B,mBAenC,SAAsBC,EACpBC,EACAC,EACAC,EACAC,EACwB,QAAAC,EAAA,sBACxB,OAAO,IAAI,QAAQ,CAACC,EAASC,IAAW,CACtCJ,GAAA,MAAAA,EAAW,CACT,QAAS,EACT,QAAS,EACT,MAAOD,EAAc,UACvB,GACA,MAAMM,EAAS,IAAI,OACjB,IAAI,gBACF,IAAI,KAAK,CAACT,CAAkB,EAAG,CAAE,KAAM,iBAAkB,CAAC,CAC5D,CACF,EACAS,EAAO,iBAAiB,QAASD,CAAM,EACvCC,EAAO,iBAAiB,eAAgBD,CAAM,EAC9CC,EAAO,iBAAiB,UAAW,CAAC,CAAE,KAAAC,CAAK,IAAM,CAC/C,OAAQA,EAAK,WACN,QAAS,CACZ,MAAMC,EAAW,CACf,MAAO,UACP,KAAMR,EACN,IAAAD,CACF,EACAO,EAAO,YACLE,EACA,CAACA,EAAS,KAAK,MAAM,CAGvB,EACA,KACF,KACK,mBAAoB,CACvB,GAAIN,GAAA,MAAAA,EAAQ,QAAS,CACnB,MAAMO,EAAa,IAAI,MAAM,SAAS,EACtCA,EAAW,KAAO,aAClBH,EAAO,UAAU,EACjBD,EAAOI,CAAU,CACnB,CACAR,GAAA,MAAAA,EAAWM,EAAK,MAChB,KACF,KACK,iBACH,OAAAD,EAAO,UAAU,EACVF,EAAQG,EAAK,IAAI,EAG9B,CAAC,CACH,CAAC,CACH,GAEA,SAAsBG,EACpBX,EACAY,EACAV,EACAC,EACqB,QAAAC,EAAA,sBACrB,OAAO,IAAI,QAAQ,CAACC,EAASC,IAAW,CACtCJ,GAAA,MAAAA,EAAW,CACT,QAAS,EACT,QAAS,EACT,MAAOU,EAAc,UACvB,GACA,MAAML,EAAS,IAAI,OACjB,IAAI,gBACF,IAAI,KAAK,CAACT,CAAkB,EAAG,CAAE,KAAM,iBAAkB,CAAC,CAC5D,CACF,EACAS,EAAO,iBAAiB,QAASD,CAAM,EACvCC,EAAO,iBAAiB,eAAgBD,CAAM,EAE9CC,EAAO,iBAAiB,UAAW,CAAC,CAAE,KAAAC,CAAK,IAAM,CAC/C,OAAQA,EAAK,WACN,QAAS,CACZ,MAAMC,EAAW,CACf,MAAO,UACP,IAAAT,EACA,KAAMY,CACR,EACAL,EAAO,YACLE,EACA,CAACA,EAAS,KAAK,MAAM,CAGvB,EACA,KACF,KACK,mBAAoB,CACvB,GAAIN,GAAA,MAAAA,EAAQ,QAAS,CACnB,MAAMO,EAAa,IAAI,MAAM,SAAS,EACtCA,EAAW,KAAO,aAClBH,EAAO,UAAU,EACjBD,EAAOI,CAAU,CACnB,CACAR,GAAA,MAAAA,EAAWM,EAAK,MAChB,KACF,KACK,iBACH,OAAAD,EAAO,UAAU,EACVF,EAAQG,EAAK,IAAI,EAG9B,CAAC,CACH,CAAC,CACH","names":["workerSodiumScript","encrypt","key","dataToEncrypt","progress","signal","__async","resolve","reject","worker","data","postData","abortError","decrypt","dataToDecrypt"]}