@secrecy/lib 1.0.0-dev.63 → 1.0.0-dev.65

package/dist/error.cjs.map

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

package/dist/error.d.ts

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

package/dist/error.js

@@ -1,3 +1 @@
-export {};
-export {};
-//# sourceMappingURL=data:application/json;charset=utf-8;base64,eyJ2ZXJzaW9uIjozLCJuYW1lcyI6W10sInNvdXJjZXMiOlsiLi4vc3JjL2Vycm9yLnRzIl0sInNvdXJjZXNDb250ZW50IjpbImV4cG9ydCB0eXBlIEVycm9yVHlwZSA9XG4gIHwgXCJFcnJvclVwZ3JhZGVQbGFuXCJcbiAgfCBcIkVycm9yTm90Rm91bmRcIlxuICB8IFwiRXJyb3JOb3RFeGlzdFwiXG4gIHwgXCJFcnJvckFjY2Vzc0RlbmllZFwiXG4gIHwgXCJFcnJvckxhbmdOb3RFeGlzdFwiXG4gIHwgXCJFcnJvckxpbWl0XCJcbiAgfCBcIkVycm9yQmFzaWNcIjtcblxuZXhwb3J0IGludGVyZmFjZSBFcnJvckJhc2Uge1xuICBtZXNzYWdlOiBzdHJpbmc7XG4gIF9fdHlwZW5hbWU6IEVycm9yVHlwZTtcbn1cblxuZXhwb3J0IGludGVyZmFjZSBFcnJvclVwZ3JhZGVQbGFuIGV4dGVuZHMgRXJyb3JCYXNlIHtcbiAgX190eXBlbmFtZTogXCJFcnJvclVwZ3JhZGVQbGFuXCI7XG59XG5cbmV4cG9ydCBpbnRlcmZhY2UgRXJyb3JOb3RGb3VuZCBleHRlbmRzIEVycm9yQmFzZSB7XG4gIF9fdHlwZW5hbWU6IFwiRXJyb3JOb3RGb3VuZFwiO1xuICBmaWVsZD86IHN0cmluZyB8IHVuZGVmaW5lZDtcbn1cblxuZXhwb3J0IGludGVyZmFjZSBFcnJvck5vdEV4aXN0IGV4dGVuZHMgRXJyb3JCYXNlIHtcbiAgX190eXBlbmFtZTogXCJFcnJvck5vdEV4aXN0XCI7XG4gIGZpZWxkPzogc3RyaW5nIHwgdW5kZWZpbmVkO1xufVxuXG5leHBvcnQgaW50ZXJmYWNlIEVycm9yQWNjZXNzRGVuaWVkIGV4dGVuZHMgRXJyb3JCYXNlIHtcbiAgX190eXBlbmFtZTogXCJFcnJvckFjY2Vzc0RlbmllZFwiO1xufVxuXG5leHBvcnQgaW50ZXJmYWNlIEVycm9yTGFuZ05vdEV4aXN0IGV4dGVuZHMgRXJyb3JCYXNlIHtcbiAgX190eXBlbmFtZTogXCJFcnJvckxhbmdOb3RFeGlzdFwiO1xufVxuXG5leHBvcnQgaW50ZXJmYWNlIEVycm9yTGltaXQgZXh0ZW5kcyBFcnJvckJhc2Uge1xuICBfX3R5cGVuYW1lOiBcIkVycm9yTGltaXRcIjtcbiAgZmllbGQ/OiBzdHJpbmcgfCB1bmRlZmluZWQ7XG59XG5cbmV4cG9ydCBpbnRlcmZhY2UgRXJyb3JCYXNpYyBleHRlbmRzIEVycm9yQmFzZSB7XG4gIF9fdHlwZW5hbWU6IFwiRXJyb3JCYXNpY1wiO1xufVxuXG5leHBvcnQgdHlwZSBTZWNyZWN5RXJyb3IgPVxuICB8IEVycm9yVXBncmFkZVBsYW5cbiAgfCBFcnJvck5vdEZvdW5kXG4gIHwgRXJyb3JOb3RFeGlzdFxuICB8IEVycm9yQWNjZXNzRGVuaWVkXG4gIHwgRXJyb3JMYW5nTm90RXhpc3RcbiAgfCBFcnJvckxpbWl0XG4gIHwgRXJyb3JCYXNpYztcbiJdLCJtYXBwaW5ncyI6IiJ9
+//# sourceMappingURL=error.js.map

package/dist/error.js.map

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

package/dist/index.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true}); function _createStarExport(obj) { Object.keys(obj) .filter((key) => key !== "default" && key !== "__esModule") .forEach((key) => { if (exports.hasOwnProperty(key)) { return; } Object.defineProperty(exports, key, {enumerable: true, configurable: true, get: () => obj[key]}); }); }require('./chunk-5WPCTUWH.cjs');var _indexjs = require('./client/index.js'); _createStarExport(_indexjs);var _indexjs3 = require('./crypto/index.js'); _createStarExport(_indexjs3);var _BaseClientjs = require('./BaseClient.js');var _helpersjs = require('./client/helpers.js'); _createStarExport(_helpersjs);var _sodiumjs = require('./sodium.js'); _createStarExport(_sodiumjs);var _storebuddyjs = require('./utils/store-buddy.js'); _createStarExport(_storebuddyjs);var _indexjs5 = require('./zeus/index.js');var _errorjs = require('./error.js'); _createStarExport(_errorjs);exports.BaseClient = _BaseClientjs.BaseClient; exports.FileContentType = _indexjs5.FileContentType; exports.InfuraNetwork = _indexjs5.InfuraNetwork; exports.Lang = _indexjs5.Lang; exports.MailType = _indexjs5.MailType; exports.PayInputType = _indexjs5.PayInputType; exports.PlanKind = _indexjs5.PlanKind; exports.Rights = _indexjs5.Rights; exports.Thunder = _indexjs5.Thunder; exports.UserRole = _indexjs5.UserRole;
+//# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -0,0 +1 @@
+{"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\";\n\nexport * from \"./error.js\";\n"]}

package/dist/index.d.ts

@@ -1,11 +1,19 @@
-export * from "./client/index.js";
-export * from "./crypto/index.js";
-export type { Progress } from "./crypto/file.js";
-export type { User, QueryLimits, DownloadProgress, UserData, MailLimitsValues, CloudLimits, SendReport, SuccessResponse } from "./BaseClient.js";
-export { BaseClient } from "./BaseClient.js";
-export type { Node, NodeFull, FileMetadata, SecrecyUserApp, BaseMail, ReceivedMail, SentMail, PublicUser, UserAppSettings, NodeSize, UserAppNotifications, MailFile, MailIntegrity, DraftMail, Mail, WaitingReceivedMail, MailRecipientInput } from "./client/types/index.js";
-export * from "./client/helpers.js";
-export * from "./sodium.js";
-export * from "./utils/store-buddy.js";
-export { Lang, FileContentType, MailType, PlanKind, Rights, PayInputType, UserRole, InfuraNetwork, Thunder } from "./zeus/index.js";
-export * from "./error.js";
+export { B as BaseClient, C as CloudLimits, D as DownloadProgress, H as HashInfos, M as MailLimitsValues, N as NewMail, P as ProgressCallback, Q as QueryLimits, d as SecrecyClient, f as SecrecyEnv, S as SendReport, c as SuccessResponse, h as UseSecrecyParams, a as User, b as UserData, V as Value, e as encryptName, i as getSecrecyClient, g as getUrl, l as login, p as parseInfos } from './BaseClient-15fdf493.js';
+export { KeyPair, decryptAnonymous, decryptCryptoBox, decryptSecretBox, encryptAnonymous, encryptCryptoBox, encryptSecretBox, generateCryptoBoxKeyPair, generateSecretBoxKey } from './crypto/index.js';
+export { Progress } from './crypto/file.js';
+export { BaseMail, DraftMail, Mail, MailFile, MailIntegrity, MailRecipientInput, Node, NodeFull, NodeSize, PublicUser, ReceivedMail, SecrecyUserApp, SentMail, WaitingReceivedMail } from './client/types/index.js';
+export { setup } from './sodium.js';
+export { StoreBuddy, storeBuddy } from './utils/store-buddy.js';
+export { FileContentType, InfuraNetwork, Lang, MailType, PayInputType, PlanKind, Rights, Thunder, UserRole } from './zeus/index.js';
+export { ErrorAccessDenied, ErrorBase, ErrorBasic, ErrorLangNotExist, ErrorLimit, ErrorNotExist, ErrorNotFound, ErrorType, ErrorUpgradePlan, SecrecyError } from './error.js';
+export { FileMetadata } from './client/types/File.js';
+export { UserAppSettings } from './client/types/UserAppSettings.js';
+export { UserAppNotifications } from './client/types/UserAppNotifications.js';
+export { default as sodium } from 'libsodium-wrappers';
+import 'ky';
+import 'jsonwebtoken';
+import 'bson';
+import 'ethers';
+import './client/types/selectors.js';
+import './client/types/Inputs.js';
+import './zeus/const.js';

package/dist/index.js

@@ -1,9 +1,2 @@
-export * from "./client/index.js";
-export * from "./crypto/index.js";
-export { BaseClient } from "./BaseClient.js";
-export * from "./client/helpers.js";
-export * from "./sodium.js";
-export * from "./utils/store-buddy.js";
-export { Lang, FileContentType, MailType, PlanKind, Rights, PayInputType, UserRole, InfuraNetwork, Thunder } from "./zeus/index.js";
-export * from "./error.js";
-//# sourceMappingURL=data:application/json;charset=utf-8;base64,eyJ2ZXJzaW9uIjozLCJuYW1lcyI6WyJCYXNlQ2xpZW50IiwiTGFuZyIsIkZpbGVDb250ZW50VHlwZSIsIk1haWxUeXBlIiwiUGxhbktpbmQiLCJSaWdodHMiLCJQYXlJbnB1dFR5cGUiLCJVc2VyUm9sZSIsIkluZnVyYU5ldHdvcmsiLCJUaHVuZGVyIl0sInNvdXJjZXMiOlsiLi4vc3JjL2luZGV4LnRzIl0sInNvdXJjZXNDb250ZW50IjpbImV4cG9ydCAqIGZyb20gXCIuL2NsaWVudC9pbmRleC5qc1wiO1xuZXhwb3J0ICogZnJvbSBcIi4vY3J5cHRvL2luZGV4LmpzXCI7XG5leHBvcnQgdHlwZSB7IFByb2dyZXNzIH0gZnJvbSBcIi4vY3J5cHRvL2ZpbGUuanNcIjtcbmV4cG9ydCB0eXBlIHtcbiAgVXNlcixcbiAgUXVlcnlMaW1pdHMsXG4gIERvd25sb2FkUHJvZ3Jlc3MsXG4gIFVzZXJEYXRhLFxuICBNYWlsTGltaXRzVmFsdWVzLFxuICBDbG91ZExpbWl0cyxcbiAgU2VuZFJlcG9ydCxcbiAgU3VjY2Vzc1Jlc3BvbnNlXG59IGZyb20gXCIuL0Jhc2VDbGllbnQuanNcIjtcbmV4cG9ydCB7IEJhc2VDbGllbnQgfSBmcm9tIFwiLi9CYXNlQ2xpZW50LmpzXCI7XG5leHBvcnQgdHlwZSB7XG4gIE5vZGUsXG4gIE5vZGVGdWxsLFxuICBGaWxlTWV0YWRhdGEsXG4gIFNlY3JlY3lVc2VyQXBwLFxuICBCYXNlTWFpbCxcbiAgUmVjZWl2ZWRNYWlsLFxuICBTZW50TWFpbCxcbiAgUHVibGljVXNlcixcbiAgVXNlckFwcFNldHRpbmdzLFxuICBOb2RlU2l6ZSxcbiAgVXNlckFwcE5vdGlmaWNhdGlvbnMsXG4gIE1haWxGaWxlLFxuICBNYWlsSW50ZWdyaXR5LFxuICBEcmFmdE1haWwsXG4gIE1haWwsXG4gIFdhaXRpbmdSZWNlaXZlZE1haWwsXG4gIE1haWxSZWNpcGllbnRJbnB1dFxufSBmcm9tIFwiLi9jbGllbnQvdHlwZXMvaW5kZXguanNcIjtcbmV4cG9ydCAqIGZyb20gXCIuL2NsaWVudC9oZWxwZXJzLmpzXCI7XG5leHBvcnQgKiBmcm9tIFwiLi9zb2RpdW0uanNcIjtcbmV4cG9ydCAqIGZyb20gXCIuL3V0aWxzL3N0b3JlLWJ1ZGR5LmpzXCI7XG5leHBvcnQge1xuICBMYW5nLFxuICBGaWxlQ29udGVudFR5cGUsXG4gIE1haWxUeXBlLFxuICBQbGFuS2luZCxcbiAgUmlnaHRzLFxuICBQYXlJbnB1dFR5cGUsXG4gIFVzZXJSb2xlLFxuICBJbmZ1cmFOZXR3b3JrLFxuICBUaHVuZGVyXG59IGZyb20gXCIuL3pldXMvaW5kZXguanNcIjtcblxuZXhwb3J0ICogZnJvbSBcIi4vZXJyb3IuanNcIjtcbiJdLCJtYXBwaW5ncyI6IkFBQUEsY0FBYyxtQkFBZDtBQUNBLGNBQWMsbUJBQWQ7QUFZQSxTQUFTQSxVQUFULFFBQTJCLGlCQUEzQjtBQW9CQSxjQUFjLHFCQUFkO0FBQ0EsY0FBYyxhQUFkO0FBQ0EsY0FBYyx3QkFBZDtBQUNBLFNBQ0VDLElBREYsRUFFRUMsZUFGRixFQUdFQyxRQUhGLEVBSUVDLFFBSkYsRUFLRUMsTUFMRixFQU1FQyxZQU5GLEVBT0VDLFFBUEYsRUFRRUMsYUFSRixFQVNFQyxPQVRGLFFBVU8saUJBVlA7QUFZQSxjQUFjLFlBQWQifQ==
+import"./chunk-KMTF2BZE.js";export*from"./client/index.js";export*from"./crypto/index.js";import{BaseClient as o}from"./BaseClient.js";export*from"./client/helpers.js";export*from"./sodium.js";export*from"./utils/store-buddy.js";import{Lang as n,FileContentType as f,MailType as m,PlanKind as d,Rights as x,PayInputType as y,UserRole as M,InfuraNetwork as c,Thunder as u}from"./zeus/index.js";export*from"./error.js";export{o as BaseClient,f as FileContentType,c as InfuraNetwork,n as Lang,m as MailType,y as PayInputType,d as PlanKind,x as Rights,u as Thunder,M as UserRole};
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"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\";\n\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

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});require('../chunk-5WPCTUWH.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

@@ -0,0 +1 @@
+{"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,2 +1,4 @@
-export declare function compress(data: Uint8Array): Uint8Array;
-export declare function uncompress(data: Uint8Array): Uint8Array;
+declare function compress(data: Uint8Array): Uint8Array;
+declare function uncompress(data: Uint8Array): Uint8Array;
+
+export { compress, uncompress };

package/dist/minify/index.js

@@ -1,28 +1,2 @@
-import { calcUncompressedLen, compressBlockBound, compressBlockHC, uncompressBlock } from "./lz4.js";
-import { concatenate } from "../utils/utils.js";
-export function compress(data) {
-  if (data.byteLength > 15_000_000) {
-    return concatenate(new Uint8Array([0]), data);
-  }
-
-  const compressed = new Uint8Array(compressBlockBound(data.byteLength));
-  const compressedSize = compressBlockHC(data, compressed, 0);
-
-  if (compressedSize === 0) {
-    return concatenate(new Uint8Array([0]), data);
-  }
-
-  return concatenate(new Uint8Array([1]), compressed.slice(0, compressedSize));
-}
-export function uncompress(data) {
-  const realData = data.slice(1);
-
-  if (data[0] === 0) {
-    return realData;
-  }
-
-  const dst = new Uint8Array(calcUncompressedLen(realData));
-  const uncompressedSize = uncompressBlock(realData, dst);
-  return dst.slice(0, uncompressedSize);
-}
-//# sourceMappingURL=data:application/json;charset=utf-8;base64,eyJ2ZXJzaW9uIjozLCJuYW1lcyI6WyJjYWxjVW5jb21wcmVzc2VkTGVuIiwiY29tcHJlc3NCbG9ja0JvdW5kIiwiY29tcHJlc3NCbG9ja0hDIiwidW5jb21wcmVzc0Jsb2NrIiwiY29uY2F0ZW5hdGUiLCJjb21wcmVzcyIsImRhdGEiLCJieXRlTGVuZ3RoIiwiVWludDhBcnJheSIsImNvbXByZXNzZWQiLCJjb21wcmVzc2VkU2l6ZSIsInNsaWNlIiwidW5jb21wcmVzcyIsInJlYWxEYXRhIiwiZHN0IiwidW5jb21wcmVzc2VkU2l6ZSJdLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9taW5pZnkvaW5kZXgudHMiXSwic291cmNlc0NvbnRlbnQiOlsiaW1wb3J0IHtcbiAgY2FsY1VuY29tcHJlc3NlZExlbixcbiAgY29tcHJlc3NCbG9ja0JvdW5kLFxuICBjb21wcmVzc0Jsb2NrSEMsXG4gIHVuY29tcHJlc3NCbG9ja1xufSBmcm9tIFwiLi9sejQuanNcIjtcbmltcG9ydCB7IGNvbmNhdGVuYXRlIH0gZnJvbSBcIi4uL3V0aWxzL3V0aWxzLmpzXCI7XG5cbmV4cG9ydCBmdW5jdGlvbiBjb21wcmVzcyhkYXRhOiBVaW50OEFycmF5KTogVWludDhBcnJheSB7XG4gIGlmIChkYXRhLmJ5dGVMZW5ndGggPiAxNV8wMDBfMDAwKSB7XG4gICAgcmV0dXJuIGNvbmNhdGVuYXRlKG5ldyBVaW50OEFycmF5KFswXSksIGRhdGEpO1xuICB9XG4gIGNvbnN0IGNvbXByZXNzZWQgPSBuZXcgVWludDhBcnJheShjb21wcmVzc0Jsb2NrQm91bmQoZGF0YS5ieXRlTGVuZ3RoKSk7XG4gIGNvbnN0IGNvbXByZXNzZWRTaXplID0gY29tcHJlc3NCbG9ja0hDKGRhdGEsIGNvbXByZXNzZWQsIDApO1xuICBpZiAoY29tcHJlc3NlZFNpemUgPT09IDApIHtcbiAgICByZXR1cm4gY29uY2F0ZW5hdGUobmV3IFVpbnQ4QXJyYXkoWzBdKSwgZGF0YSk7XG4gIH1cbiAgcmV0dXJuIGNvbmNhdGVuYXRlKG5ldyBVaW50OEFycmF5KFsxXSksIGNvbXByZXNzZWQuc2xpY2UoMCwgY29tcHJlc3NlZFNpemUpKTtcbn1cblxuZXhwb3J0IGZ1bmN0aW9uIHVuY29tcHJlc3MoZGF0YTogVWludDhBcnJheSk6IFVpbnQ4QXJyYXkge1xuICBjb25zdCByZWFsRGF0YSA9IGRhdGEuc2xpY2UoMSk7XG4gIGlmIChkYXRhWzBdID09PSAwKSB7XG4gICAgcmV0dXJuIHJlYWxEYXRhO1xuICB9XG4gIGNvbnN0IGRzdCA9IG5ldyBVaW50OEFycmF5KGNhbGNVbmNvbXByZXNzZWRMZW4ocmVhbERhdGEpKTtcbiAgY29uc3QgdW5jb21wcmVzc2VkU2l6ZSA9IHVuY29tcHJlc3NCbG9jayhyZWFsRGF0YSwgZHN0KTtcbiAgcmV0dXJuIGRzdC5zbGljZSgwLCB1bmNvbXByZXNzZWRTaXplKTtcbn1cbiJdLCJtYXBwaW5ncyI6IkFBQUEsU0FDRUEsbUJBREYsRUFFRUMsa0JBRkYsRUFHRUMsZUFIRixFQUlFQyxlQUpGLFFBS08sVUFMUDtBQU1BLFNBQVNDLFdBQVQsUUFBNEIsbUJBQTVCO0FBRUEsT0FBTyxTQUFTQyxRQUFULENBQWtCQyxJQUFsQixFQUFnRDtFQUNyRCxJQUFJQSxJQUFJLENBQUNDLFVBQUwsR0FBa0IsVUFBdEIsRUFBa0M7SUFDaEMsT0FBT0gsV0FBVyxDQUFDLElBQUlJLFVBQUosQ0FBZSxDQUFDLENBQUQsQ0FBZixDQUFELEVBQXNCRixJQUF0QixDQUFsQjtFQUNEOztFQUNELE1BQU1HLFVBQVUsR0FBRyxJQUFJRCxVQUFKLENBQWVQLGtCQUFrQixDQUFDSyxJQUFJLENBQUNDLFVBQU4sQ0FBakMsQ0FBbkI7RUFDQSxNQUFNRyxjQUFjLEdBQUdSLGVBQWUsQ0FBQ0ksSUFBRCxFQUFPRyxVQUFQLEVBQW1CLENBQW5CLENBQXRDOztFQUNBLElBQUlDLGNBQWMsS0FBSyxDQUF2QixFQUEwQjtJQUN4QixPQUFPTixXQUFXLENBQUMsSUFBSUksVUFBSixDQUFlLENBQUMsQ0FBRCxDQUFmLENBQUQsRUFBc0JGLElBQXRCLENBQWxCO0VBQ0Q7O0VBQ0QsT0FBT0YsV0FBVyxDQUFDLElBQUlJLFVBQUosQ0FBZSxDQUFDLENBQUQsQ0FBZixDQUFELEVBQXNCQyxVQUFVLENBQUNFLEtBQVgsQ0FBaUIsQ0FBakIsRUFBb0JELGNBQXBCLENBQXRCLENBQWxCO0FBQ0Q7QUFFRCxPQUFPLFNBQVNFLFVBQVQsQ0FBb0JOLElBQXBCLEVBQWtEO0VBQ3ZELE1BQU1PLFFBQVEsR0FBR1AsSUFBSSxDQUFDSyxLQUFMLENBQVcsQ0FBWCxDQUFqQjs7RUFDQSxJQUFJTCxJQUFJLENBQUMsQ0FBRCxDQUFKLEtBQVksQ0FBaEIsRUFBbUI7SUFDakIsT0FBT08sUUFBUDtFQUNEOztFQUNELE1BQU1DLEdBQUcsR0FBRyxJQUFJTixVQUFKLENBQWVSLG1CQUFtQixDQUFDYSxRQUFELENBQWxDLENBQVo7RUFDQSxNQUFNRSxnQkFBZ0IsR0FBR1osZUFBZSxDQUFDVSxRQUFELEVBQVdDLEdBQVgsQ0FBeEM7RUFDQSxPQUFPQSxHQUFHLENBQUNILEtBQUosQ0FBVSxDQUFWLEVBQWFJLGdCQUFiLENBQVA7QUFDRCJ9
+import"../chunk-KMTF2BZE.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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,3 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});require('../chunk-5WPCTUWH.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

@@ -0,0 +1 @@
+{"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,5 +1,7 @@
-export declare function calcUncompressedLen(src: Uint8Array): number;
-export declare function uncompressBlock(src: Uint8Array, dest: Uint8Array): number;
-export declare function compressBlockBound(n: number): number;
-export declare function compressBlock(src: Uint8Array, dest: Uint8Array, soffset: number): number;
-export declare function compressBlockHC(src: Uint8Array, dest: Uint8Array, soffset: number): number;
+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 };