openclaw-multi-auto 1.2.7 → 1.2.9

package/node_modules/.pnpm/@keyv+bigmap@1.3.1_keyv@5.6.0/node_modules/hashery/dist/browser/index.global.js

@@ -1,8 +0,0 @@
-"use strict";(()=>{var L=Object.defineProperty;var S=(t,e,r)=>e in t?L(t,e,{enumerable:!0,configurable:!0,writable:!0,value:r}):t[e]=r;var h=(t,e,r)=>S(t,typeof e!="symbol"?e+"":e,r);var O=class{constructor(t){h(this,"_eventListeners");h(this,"_maxListeners");h(this,"_logger");h(this,"_throwOnEmitError",!1);h(this,"_throwOnEmptyListeners",!1);h(this,"_errorEvent","error");this._eventListeners=new Map,this._maxListeners=100,this._logger=t?.logger,t?.throwOnEmitError!==void 0&&(this._throwOnEmitError=t.throwOnEmitError),t?.throwOnEmptyListeners!==void 0&&(this._throwOnEmptyListeners=t.throwOnEmptyListeners)}get logger(){return this._logger}set logger(t){this._logger=t}get throwOnEmitError(){return this._throwOnEmitError}set throwOnEmitError(t){this._throwOnEmitError=t}get throwOnEmptyListeners(){return this._throwOnEmptyListeners}set throwOnEmptyListeners(t){this._throwOnEmptyListeners=t}once(t,e){let r=(...s)=>{this.off(t,r),e(...s)};return this.on(t,r),this}listenerCount(t){if(t===void 0)return this.getAllListeners().length;let e=this._eventListeners.get(t);return e?e.length:0}eventNames(){return[...this._eventListeners.keys()]}rawListeners(t){return t===void 0?this.getAllListeners():this._eventListeners.get(t)??[]}prependListener(t,e){let r=this._eventListeners.get(t)??[];return r.unshift(e),this._eventListeners.set(t,r),this}prependOnceListener(t,e){let r=(...s)=>{this.off(t,r),e(...s)};return this.prependListener(t,r),this}maxListeners(){return this._maxListeners}addListener(t,e){return this.on(t,e),this}on(t,e){this._eventListeners.has(t)||this._eventListeners.set(t,[]);let r=this._eventListeners.get(t);return r&&(r.length>=this._maxListeners&&console.warn(`MaxListenersExceededWarning: Possible event memory leak detected. ${r.length+1} ${t} listeners added. Use setMaxListeners() to increase limit.`),r.push(e)),this}removeListener(t,e){return this.off(t,e),this}off(t,e){let r=this._eventListeners.get(t)??[],s=r.indexOf(e);return s!==-1&&r.splice(s,1),r.length===0&&this._eventListeners.delete(t),this}emit(t,...e){let r=!1,s=this._eventListeners.get(t);if(s&&s.length>0)for(let i of s)i(...e),r=!0;if(t===this._errorEvent){let i=e[0]instanceof Error?e[0]:new Error(`${e[0]}`);if(this._throwOnEmitError&&!r)throw i;if(this.listeners(this._errorEvent).length===0&&this._throwOnEmptyListeners===!0)throw i}return this.sendLog(t,e),r}listeners(t){return this._eventListeners.get(t)??[]}removeAllListeners(t){return t!==void 0?this._eventListeners.delete(t):this._eventListeners.clear(),this}setMaxListeners(t){this._maxListeners=t;for(let e of this._eventListeners.values())e.length>t&&e.splice(t)}getAllListeners(){let t=[];for(let e of this._eventListeners.values())t=[...t,...e];return t}sendLog(t,e){if(!this._logger)return;let r;switch(typeof e=="string"?r=e:Array.isArray(e)&&e.length>0&&e[0]instanceof Error?r=e[0].message:e instanceof Error?r=e.message:Array.isArray(e)&&e.length>0&&typeof e[0]?.message=="string"?r=e[0].message:r=JSON.stringify(e),t){case"error":{this._logger.error?.(r,{event:t,data:e});break}case"warn":{this._logger.warn?.(r,{event:t,data:e});break}case"trace":{this._logger.trace?.(r,{event:t,data:e});break}case"debug":{this._logger.debug?.(r,{event:t,data:e});break}case"fatal":{this._logger.fatal?.(r,{event:t,data:e});break}default:{this._logger.info?.(r,{event:t,data:e});break}}}},x=class extends O{constructor(e){super({logger:e?.logger,throwOnEmitError:e?.throwOnEmitError,throwOnEmptyListeners:e?.throwOnEmptyListeners});h(this,"_hooks");h(this,"_throwOnHookError",!1);h(this,"_enforceBeforeAfter",!1);h(this,"_deprecatedHooks");h(this,"_allowDeprecated",!0);this._hooks=new Map,this._deprecatedHooks=e?.deprecatedHooks?new Map(e.deprecatedHooks):new Map,e?.throwOnHookError!==void 0?this._throwOnHookError=e.throwOnHookError:e?.throwHookErrors!==void 0&&(this._throwOnHookError=e.throwHookErrors),e?.enforceBeforeAfter!==void 0&&(this._enforceBeforeAfter=e.enforceBeforeAfter),e?.allowDeprecated!==void 0&&(this._allowDeprecated=e.allowDeprecated)}get hooks(){return this._hooks}get throwHookErrors(){return this._throwOnHookError}set throwHookErrors(e){this._throwOnHookError=e}get throwOnHookError(){return this._throwOnHookError}set throwOnHookError(e){this._throwOnHookError=e}get enforceBeforeAfter(){return this._enforceBeforeAfter}set enforceBeforeAfter(e){this._enforceBeforeAfter=e}get deprecatedHooks(){return this._deprecatedHooks}set deprecatedHooks(e){this._deprecatedHooks=e}get allowDeprecated(){return this._allowDeprecated}set allowDeprecated(e){this._allowDeprecated=e}validateHookName(e){if(this._enforceBeforeAfter){let r=e.trim().toLocaleLowerCase();if(!r.startsWith("before")&&!r.startsWith("after"))throw new Error(`Hook event "${e}" must start with "before" or "after" when enforceBeforeAfter is enabled`)}}checkDeprecatedHook(e){if(this._deprecatedHooks.has(e)){let r=this._deprecatedHooks.get(e),s=`Hook "${e}" is deprecated${r?`: ${r}`:""}`;return this.emit("warn",{hook:e,message:s}),this._allowDeprecated}return!0}onHook(e,r){this.onHookEntry({event:e,handler:r})}onHookEntry(e){if(this.validateHookName(e.event),!this.checkDeprecatedHook(e.event))return;let r=this._hooks.get(e.event);r?r.push(e.handler):this._hooks.set(e.event,[e.handler])}addHook(e,r){this.onHookEntry({event:e,handler:r})}onHooks(e){for(let r of e)this.onHook(r.event,r.handler)}prependHook(e,r){if(this.validateHookName(e),!this.checkDeprecatedHook(e))return;let s=this._hooks.get(e);s?s.unshift(r):this._hooks.set(e,[r])}prependOnceHook(e,r){if(this.validateHookName(e),!this.checkDeprecatedHook(e))return;let s=async(...i)=>(this.removeHook(e,s),r(...i));this.prependHook(e,s)}onceHook(e,r){if(this.validateHookName(e),!this.checkDeprecatedHook(e))return;let s=async(...i)=>(this.removeHook(e,s),r(...i));this.onHook(e,s)}removeHook(e,r){if(this.validateHookName(e),!this.checkDeprecatedHook(e))return;let s=this._hooks.get(e);if(s){let i=s.indexOf(r);i!==-1&&s.splice(i,1)}}removeHooks(e){for(let r of e)this.removeHook(r.event,r.handler)}async hook(e,...r){if(this.validateHookName(e),!this.checkDeprecatedHook(e))return;let s=this._hooks.get(e);if(s)for(let i of s)try{await i(...r)}catch(o){let a=`${e}: ${o.message}`;if(this.emit("error",new Error(a)),this._throwOnHookError)throw new Error(a)}}hookSync(e,...r){if(this.validateHookName(e),!this.checkDeprecatedHook(e))return;let s=this._hooks.get(e);if(s){for(let i of s)if(i.constructor.name!=="AsyncFunction")try{i(...r)}catch(o){let a=`${e}: ${o.message}`;if(this.emit("error",new Error(a)),this._throwOnHookError)throw new Error(a)}}}async beforeHook(e,...r){await this.hook(`before:${e}`,...r)}async afterHook(e,...r){await this.hook(`after:${e}`,...r)}async callHook(e,...r){await this.hook(e,...r)}getHooks(e){if(this.validateHookName(e),!!this.checkDeprecatedHook(e))return this._hooks.get(e)}clearHooks(){this._hooks.clear()}};var y=class{constructor(e){h(this,"_enabled",!0);h(this,"_maxSize",4e3);h(this,"_store",new Map);h(this,"_keys",[]);e?.enabled!==void 0&&(this._enabled=e.enabled),e?.maxSize!==void 0&&(this._maxSize=e.maxSize)}get enabled(){return this._enabled}set enabled(e){this._enabled=e}get maxSize(){return this._maxSize}set maxSize(e){this._maxSize=e}get store(){return this._store}get size(){return this._store.size}get(e){return this._store.get(e)}set(e,r){if(this._enabled){if(this._store.has(e)){this._store.set(e,r);return}if(this._store.size>=this._maxSize){let s=this._keys.shift();s&&this._store.delete(s)}this._keys.push(e),this._store.set(e,r)}}has(e){return this._store.has(e)}clear(){this._store.clear(),this._keys=[]}};var _=class{get name(){return"crc32"}toHashSync(e){let r;if(e instanceof Uint8Array)r=e;else if(e instanceof ArrayBuffer)r=new Uint8Array(e);else if(e instanceof DataView)r=new Uint8Array(e.buffer,e.byteOffset,e.byteLength);else{let a=e;r=new Uint8Array(a.buffer,a.byteOffset,a.byteLength)}let s=3988292384,i=4294967295;for(let a=0;a<r.length;a++){i=i^r[a];for(let n=0;n<8;n++)i=i>>>1^s&-(i&1)}return i=(i^4294967295)>>>0,i.toString(16).padStart(8,"0")}async toHash(e){return this.toHashSync(e)}};var m=class{constructor(e){h(this,"_algorithm","SHA-256");e?.algorithm&&(this._algorithm=e?.algorithm)}get name(){return this._algorithm}async toHash(e){let r=await crypto.subtle.digest(this._algorithm,e);return Array.from(new Uint8Array(r)).map(o=>o.toString(16).padStart(2,"0")).join("")}};var H=class{get name(){return"djb2"}toHashSync(e){let r;if(e instanceof Uint8Array)r=e;else if(e instanceof ArrayBuffer)r=new Uint8Array(e);else if(e instanceof DataView)r=new Uint8Array(e.buffer,e.byteOffset,e.byteLength);else{let o=e;r=new Uint8Array(o.buffer,o.byteOffset,o.byteLength)}let s=5381;for(let o=0;o<r.length;o++)s=(s<<5)+s+r[o],s=s>>>0;return s.toString(16).padStart(8,"0")}async toHash(e){return this.toHashSync(e)}};var b=class{get name(){return"fnv1"}toHashSync(e){let r;if(e instanceof Uint8Array)r=e;else if(e instanceof ArrayBuffer)r=new Uint8Array(e);else if(e instanceof DataView)r=new Uint8Array(e.buffer,e.byteOffset,e.byteLength);else{let n=e;r=new Uint8Array(n.buffer,n.byteOffset,n.byteLength)}let s=2166136261,i=16777619,o=s;for(let n=0;n<r.length;n++)o=o*i,o=o^r[n],o=o>>>0;return o.toString(16).padStart(8,"0")}async toHash(e){return this.toHashSync(e)}};var w=class{constructor(e=0){h(this,"_seed");this._seed=e>>>0}get name(){return"murmur"}get seed(){return this._seed}toHashSync(e){let r;if(e instanceof Uint8Array)r=e;else if(e instanceof ArrayBuffer)r=new Uint8Array(e);else if(e instanceof DataView)r=new Uint8Array(e.buffer,e.byteOffset,e.byteLength);else{let f=e;r=new Uint8Array(f.buffer,f.byteOffset,f.byteLength)}let s=3432918353,i=461845907,o=r.length,a=Math.floor(o/4),n=this._seed;for(let f=0;f<a;f++){let d=f*4,u=r[d]&255|(r[d+1]&255)<<8|(r[d+2]&255)<<16|(r[d+3]&255)<<24;u=this._imul(u,s),u=this._rotl32(u,15),u=this._imul(u,i),n^=u,n=this._rotl32(n,13),n=this._imul(n,5)+3864292196}let g=a*4,c=0;switch(o&3){case 3:c^=(r[g+2]&255)<<16;case 2:c^=(r[g+1]&255)<<8;case 1:c^=r[g]&255,c=this._imul(c,s),c=this._rotl32(c,15),c=this._imul(c,i),n^=c}return n^=o,n^=n>>>16,n=this._imul(n,2246822507),n^=n>>>13,n=this._imul(n,3266489909),n^=n>>>16,n=n>>>0,n.toString(16).padStart(8,"0")}async toHash(e){return this.toHashSync(e)}_imul(e,r){if(Math.imul)return Math.imul(e,r);let s=e>>>16&65535;let i=e&65535;let o=r>>>16&65535;let a=r&65535;return i*a+(s*a+i*o<<16>>>0)|0}_rotl32(e,r){return e<<r|e>>>32-r}};var v=class{constructor(e){h(this,"_providers",new Map);h(this,"_getFuzzy",!0);e?.providers&&this.loadProviders(e?.providers),e?.getFuzzy!==void 0&&(this._getFuzzy=!!e?.getFuzzy)}loadProviders(e){for(let r of e)this._providers.set(r.name,r)}get providers(){return this._providers}set providers(e){this._providers=e}get names(){return Array.from(this._providers.keys())}get(e,r){let s=r?.fuzzy??this._getFuzzy;e=e.trim();let i=this._providers.get(e);return i===void 0&&s===!0&&(e=e.toLowerCase(),i=this._providers.get(e)),i===void 0&&s===!0&&(e=e.replaceAll("-",""),i=this._providers.get(e)),i}add(e){this._providers.set(e.name,e)}remove(e){return this._providers.delete(e)}};var A=class extends x{constructor(r){super(r);h(this,"_parse",JSON.parse);h(this,"_stringify",JSON.stringify);h(this,"_providers",new v);h(this,"_defaultAlgorithm","SHA-256");h(this,"_defaultAlgorithmSync","djb2");h(this,"_cache");r?.parse&&(this._parse=r.parse),r?.stringify&&(this._stringify=r.stringify),r?.defaultAlgorithm&&(this._defaultAlgorithm=r.defaultAlgorithm),r?.defaultAlgorithmSync&&(this._defaultAlgorithmSync=r.defaultAlgorithmSync),this._cache=new y(r?.cache),this.loadProviders(r?.providers,{includeBase:r?.includeBase??!0})}get parse(){return this._parse}set parse(r){this._parse=r}get stringify(){return this._stringify}set stringify(r){this._stringify=r}get providers(){return this._providers}set providers(r){this._providers=r}get names(){return this._providers.names}get defaultAlgorithm(){return this._defaultAlgorithm}set defaultAlgorithm(r){this._defaultAlgorithm=r}get defaultAlgorithmSync(){return this._defaultAlgorithmSync}set defaultAlgorithmSync(r){this._defaultAlgorithmSync=r}get cache(){return this._cache}async toHash(r,s){let i={data:r,algorithm:s?.algorithm??this._defaultAlgorithm,maxLength:s?.maxLength};await this.beforeHook("toHash",i);let o=this._stringify(i.data),a=`${i.algorithm}:${o}`;if(this._cache.enabled){let d=this._cache.get(a);if(d!==void 0){let u=d;s?.maxLength&&u.length>s.maxLength&&(u=u.substring(0,s.maxLength));let p={hash:u,data:i.data,algorithm:i.algorithm};return await this.afterHook("toHash",p),p.hash}}let g=new TextEncoder().encode(o),c=this._providers.get(i.algorithm);c||(this.emit("warn",`Invalid algorithm '${i.algorithm}' not found. Falling back to default algorithm '${this._defaultAlgorithm}'.`),c=new m({algorithm:this._defaultAlgorithm}));let l=await c.toHash(g);this._cache.enabled&&this._cache.set(a,l),s?.maxLength&&l.length>s?.maxLength&&(l=l.substring(0,s.maxLength));let f={hash:l,data:i.data,algorithm:i.algorithm};return await this.afterHook("toHash",f),f.hash}async toNumber(r,s={}){let{min:i=0,max:o=100,algorithm:a=this._defaultAlgorithm,hashLength:n=16}=s;if(i>o)throw new Error("min cannot be greater than max");let g=await this.toHash(r,{algorithm:a,maxLength:n}),c=Number.parseInt(g,16),l=o-i+1;return i+c%l}toHashSync(r,s){let i={data:r,algorithm:s?.algorithm??this._defaultAlgorithmSync,maxLength:s?.maxLength};this.hookSync("before:toHashSync",i);let o=i.algorithm,a=this._stringify(i.data),n=`${o}:${a}`;if(this._cache.enabled){let u=this._cache.get(n);if(u!==void 0){let p=u;s?.maxLength&&p.length>s.maxLength&&(p=p.substring(0,s.maxLength));let k={hash:p,data:i.data,algorithm:o};return this.hookSync("after:toHashSync",k),k.hash}}let c=new TextEncoder().encode(a),l=this._providers.get(o);if(!l&&(this.emit("warn",`Invalid algorithm '${o}' not found. Falling back to default algorithm '${this._defaultAlgorithmSync}'.`),l=this._providers.get(this._defaultAlgorithmSync),!l))throw new Error(`Hash provider '${this._defaultAlgorithmSync}' (default) not found`);if(!l.toHashSync)throw new Error(`Hash provider '${o}' does not support synchronous hashing. Use toHash() instead or choose a different algorithm (djb2, fnv1, murmur, crc32).`);let f=l.toHashSync(c);this._cache.enabled&&this._cache.set(n,f),s?.maxLength&&f.length>s?.maxLength&&(f=f.substring(0,s.maxLength));let d={hash:f,data:i.data,algorithm:i.algorithm};return this.hookSync("after:toHashSync",d),d.hash}toNumberSync(r,s={}){let{min:i=0,max:o=100,algorithm:a=this._defaultAlgorithmSync,hashLength:n=16}=s;if(i>o)throw new Error("min cannot be greater than max");let g=this.toHashSync(r,{algorithm:a,maxLength:n}),c=Number.parseInt(g,16),l=o-i+1;return i+c%l}loadProviders(r,s={includeBase:!0}){if(r)for(let i of r)this._providers.add(i);s.includeBase&&(this.providers.add(new m({algorithm:"SHA-256"})),this.providers.add(new m({algorithm:"SHA-384"})),this.providers.add(new m({algorithm:"SHA-512"})),this.providers.add(new _),this.providers.add(new H),this.providers.add(new b),this.providers.add(new w))}};})();
-/* v8 ignore next -- @preserve */
-/*! Bundled license information:
-
-hookified/dist/node/index.js:
-  (* v8 ignore next -- @preserve *)
-*/
-//# sourceMappingURL=index.global.js.map

package/node_modules/.pnpm/@keyv+bigmap@1.3.1_keyv@5.6.0/node_modules/hashery/dist/browser/index.global.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../node_modules/.pnpm/hookified@1.15.1/node_modules/hookified/dist/node/index.js","../../src/cache.ts","../../src/providers/crc.ts","../../src/providers/crypto.ts","../../src/providers/djb2.ts","../../src/providers/fnv1.ts","../../src/providers/murmur.ts","../../src/providers.ts","../../src/index.ts"],"sourcesContent":["// src/eventified.ts\nvar Eventified = class {\n  _eventListeners;\n  _maxListeners;\n  _logger;\n  _throwOnEmitError = false;\n  _throwOnEmptyListeners = false;\n  _errorEvent = \"error\";\n  constructor(options) {\n    this._eventListeners = /* @__PURE__ */ new Map();\n    this._maxListeners = 100;\n    this._logger = options?.logger;\n    if (options?.throwOnEmitError !== void 0) {\n      this._throwOnEmitError = options.throwOnEmitError;\n    }\n    if (options?.throwOnEmptyListeners !== void 0) {\n      this._throwOnEmptyListeners = options.throwOnEmptyListeners;\n    }\n  }\n  /**\n   * Gets the logger\n   * @returns {Logger}\n   */\n  get logger() {\n    return this._logger;\n  }\n  /**\n   * Sets the logger\n   * @param {Logger} logger\n   */\n  set logger(logger) {\n    this._logger = logger;\n  }\n  /**\n   * Gets whether an error should be thrown when an emit throws an error. Default is false and only emits an error event.\n   * @returns {boolean}\n   */\n  get throwOnEmitError() {\n    return this._throwOnEmitError;\n  }\n  /**\n   * Sets whether an error should be thrown when an emit throws an error. Default is false and only emits an error event.\n   * @param {boolean} value\n   */\n  set throwOnEmitError(value) {\n    this._throwOnEmitError = value;\n  }\n  /**\n   * Gets whether an error should be thrown when emitting 'error' event with no listeners. Default is false.\n   * @returns {boolean}\n   */\n  get throwOnEmptyListeners() {\n    return this._throwOnEmptyListeners;\n  }\n  /**\n   * Sets whether an error should be thrown when emitting 'error' event with no listeners. Default is false.\n   * @param {boolean} value\n   */\n  set throwOnEmptyListeners(value) {\n    this._throwOnEmptyListeners = value;\n  }\n  /**\n   * Adds a handler function for a specific event that will run only once\n   * @param {string | symbol} eventName\n   * @param {EventListener} listener\n   * @returns {IEventEmitter} returns the instance of the class for chaining\n   */\n  once(eventName, listener) {\n    const onceListener = (...arguments_) => {\n      this.off(eventName, onceListener);\n      listener(...arguments_);\n    };\n    this.on(eventName, onceListener);\n    return this;\n  }\n  /**\n   * Gets the number of listeners for a specific event. If no event is provided, it returns the total number of listeners\n   * @param {string} eventName The event name. Not required\n   * @returns {number} The number of listeners\n   */\n  listenerCount(eventName) {\n    if (eventName === void 0) {\n      return this.getAllListeners().length;\n    }\n    const listeners = this._eventListeners.get(eventName);\n    return listeners ? listeners.length : 0;\n  }\n  /**\n   * Gets an array of event names\n   * @returns {Array<string | symbol>} An array of event names\n   */\n  eventNames() {\n    return [...this._eventListeners.keys()];\n  }\n  /**\n   * Gets an array of listeners for a specific event. If no event is provided, it returns all listeners\n   * @param {string} [event] (Optional) The event name\n   * @returns {EventListener[]} An array of listeners\n   */\n  rawListeners(event) {\n    if (event === void 0) {\n      return this.getAllListeners();\n    }\n    return this._eventListeners.get(event) ?? [];\n  }\n  /**\n   * Prepends a listener to the beginning of the listeners array for the specified event\n   * @param {string | symbol} eventName\n   * @param {EventListener} listener\n   * @returns {IEventEmitter} returns the instance of the class for chaining\n   */\n  prependListener(eventName, listener) {\n    const listeners = this._eventListeners.get(eventName) ?? [];\n    listeners.unshift(listener);\n    this._eventListeners.set(eventName, listeners);\n    return this;\n  }\n  /**\n   * Prepends a one-time listener to the beginning of the listeners array for the specified event\n   * @param {string | symbol} eventName\n   * @param {EventListener} listener\n   * @returns {IEventEmitter} returns the instance of the class for chaining\n   */\n  prependOnceListener(eventName, listener) {\n    const onceListener = (...arguments_) => {\n      this.off(eventName, onceListener);\n      listener(...arguments_);\n    };\n    this.prependListener(eventName, onceListener);\n    return this;\n  }\n  /**\n   * Gets the maximum number of listeners that can be added for a single event\n   * @returns {number} The maximum number of listeners\n   */\n  maxListeners() {\n    return this._maxListeners;\n  }\n  /**\n   * Adds a listener for a specific event. It is an alias for the on() method\n   * @param {string | symbol} event\n   * @param {EventListener} listener\n   * @returns {IEventEmitter} returns the instance of the class for chaining\n   */\n  addListener(event, listener) {\n    this.on(event, listener);\n    return this;\n  }\n  /**\n   * Adds a listener for a specific event\n   * @param {string | symbol} event\n   * @param {EventListener} listener\n   * @returns {IEventEmitter} returns the instance of the class for chaining\n   */\n  on(event, listener) {\n    if (!this._eventListeners.has(event)) {\n      this._eventListeners.set(event, []);\n    }\n    const listeners = this._eventListeners.get(event);\n    if (listeners) {\n      if (listeners.length >= this._maxListeners) {\n        console.warn(\n          `MaxListenersExceededWarning: Possible event memory leak detected. ${listeners.length + 1} ${event} listeners added. Use setMaxListeners() to increase limit.`\n        );\n      }\n      listeners.push(listener);\n    }\n    return this;\n  }\n  /**\n   * Removes a listener for a specific event. It is an alias for the off() method\n   * @param {string | symbol} event\n   * @param {EventListener} listener\n   * @returns {IEventEmitter} returns the instance of the class for chaining\n   */\n  removeListener(event, listener) {\n    this.off(event, listener);\n    return this;\n  }\n  /**\n   * Removes a listener for a specific event\n   * @param {string | symbol} event\n   * @param {EventListener} listener\n   * @returns {IEventEmitter} returns the instance of the class for chaining\n   */\n  off(event, listener) {\n    const listeners = this._eventListeners.get(event) ?? [];\n    const index = listeners.indexOf(listener);\n    if (index !== -1) {\n      listeners.splice(index, 1);\n    }\n    if (listeners.length === 0) {\n      this._eventListeners.delete(event);\n    }\n    return this;\n  }\n  /**\n   * Calls all listeners for a specific event\n   * @param {string | symbol} event\n   * @param arguments_ The arguments to pass to the listeners\n   * @returns {boolean} Returns true if the event had listeners, false otherwise\n   */\n  emit(event, ...arguments_) {\n    let result = false;\n    const listeners = this._eventListeners.get(event);\n    if (listeners && listeners.length > 0) {\n      for (const listener of listeners) {\n        listener(...arguments_);\n        result = true;\n      }\n    }\n    if (event === this._errorEvent) {\n      const error = arguments_[0] instanceof Error ? arguments_[0] : new Error(`${arguments_[0]}`);\n      if (this._throwOnEmitError && !result) {\n        throw error;\n      } else {\n        if (this.listeners(this._errorEvent).length === 0 && this._throwOnEmptyListeners === true) {\n          throw error;\n        }\n      }\n    }\n    this.sendLog(event, arguments_);\n    return result;\n  }\n  /**\n   * Gets all listeners for a specific event. If no event is provided, it returns all listeners\n   * @param {string} [event] (Optional) The event name\n   * @returns {EventListener[]} An array of listeners\n   */\n  listeners(event) {\n    return this._eventListeners.get(event) ?? [];\n  }\n  /**\n   * Removes all listeners for a specific event. If no event is provided, it removes all listeners\n   * @param {string} [event] (Optional) The event name\n   * @returns {IEventEmitter} returns the instance of the class for chaining\n   */\n  removeAllListeners(event) {\n    if (event !== void 0) {\n      this._eventListeners.delete(event);\n    } else {\n      this._eventListeners.clear();\n    }\n    return this;\n  }\n  /**\n   * Sets the maximum number of listeners that can be added for a single event\n   * @param {number} n The maximum number of listeners\n   * @returns {void}\n   */\n  setMaxListeners(n) {\n    this._maxListeners = n;\n    for (const listeners of this._eventListeners.values()) {\n      if (listeners.length > n) {\n        listeners.splice(n);\n      }\n    }\n  }\n  /**\n   * Gets all listeners\n   * @returns {EventListener[]} An array of listeners\n   */\n  getAllListeners() {\n    let result = [];\n    for (const listeners of this._eventListeners.values()) {\n      result = [...result, ...listeners];\n    }\n    return result;\n  }\n  /**\n   * Sends a log message using the configured logger based on the event name\n   * @param {string | symbol} eventName - The event name that determines the log level\n   * @param {unknown} data - The data to log\n   */\n  sendLog(eventName, data) {\n    if (!this._logger) {\n      return;\n    }\n    let message;\n    if (typeof data === \"string\") {\n      message = data;\n    } else if (Array.isArray(data) && data.length > 0 && data[0] instanceof Error) {\n      message = data[0].message;\n    } else if (data instanceof Error) {\n      message = data.message;\n    } else if (Array.isArray(data) && data.length > 0 && typeof data[0]?.message === \"string\") {\n      message = data[0].message;\n    } else {\n      message = JSON.stringify(data);\n    }\n    switch (eventName) {\n      case \"error\": {\n        this._logger.error?.(message, { event: eventName, data });\n        break;\n      }\n      case \"warn\": {\n        this._logger.warn?.(message, { event: eventName, data });\n        break;\n      }\n      case \"trace\": {\n        this._logger.trace?.(message, { event: eventName, data });\n        break;\n      }\n      case \"debug\": {\n        this._logger.debug?.(message, { event: eventName, data });\n        break;\n      }\n      case \"fatal\": {\n        this._logger.fatal?.(message, { event: eventName, data });\n        break;\n      }\n      default: {\n        this._logger.info?.(message, { event: eventName, data });\n        break;\n      }\n    }\n  }\n};\n\n// src/index.ts\nvar Hookified = class extends Eventified {\n  _hooks;\n  _throwOnHookError = false;\n  _enforceBeforeAfter = false;\n  _deprecatedHooks;\n  _allowDeprecated = true;\n  constructor(options) {\n    super({\n      logger: options?.logger,\n      throwOnEmitError: options?.throwOnEmitError,\n      throwOnEmptyListeners: options?.throwOnEmptyListeners\n    });\n    this._hooks = /* @__PURE__ */ new Map();\n    this._deprecatedHooks = options?.deprecatedHooks ? new Map(options.deprecatedHooks) : /* @__PURE__ */ new Map();\n    if (options?.throwOnHookError !== void 0) {\n      this._throwOnHookError = options.throwOnHookError;\n    } else if (options?.throwHookErrors !== void 0) {\n      this._throwOnHookError = options.throwHookErrors;\n    }\n    if (options?.enforceBeforeAfter !== void 0) {\n      this._enforceBeforeAfter = options.enforceBeforeAfter;\n    }\n    if (options?.allowDeprecated !== void 0) {\n      this._allowDeprecated = options.allowDeprecated;\n    }\n  }\n  /**\n   * Gets all hooks\n   * @returns {Map<string, Hook[]>}\n   */\n  get hooks() {\n    return this._hooks;\n  }\n  /**\n   * Gets whether an error should be thrown when a hook throws an error. Default is false and only emits an error event.\n   * @returns {boolean}\n   * @deprecated - this will be deprecated in version 2. Please use throwOnHookError.\n   */\n  get throwHookErrors() {\n    return this._throwOnHookError;\n  }\n  /**\n   * Sets whether an error should be thrown when a hook throws an error. Default is false and only emits an error event.\n   * @param {boolean} value\n   * @deprecated - this will be deprecated in version 2. Please use throwOnHookError.\n   */\n  set throwHookErrors(value) {\n    this._throwOnHookError = value;\n  }\n  /**\n   * Gets whether an error should be thrown when a hook throws an error. Default is false and only emits an error event.\n   * @returns {boolean}\n   */\n  get throwOnHookError() {\n    return this._throwOnHookError;\n  }\n  /**\n   * Sets whether an error should be thrown when a hook throws an error. Default is false and only emits an error event.\n   * @param {boolean} value\n   */\n  set throwOnHookError(value) {\n    this._throwOnHookError = value;\n  }\n  /**\n   * Gets whether to enforce that all hook names start with 'before' or 'after'. Default is false.\n   * @returns {boolean}\n   * @default false\n   */\n  get enforceBeforeAfter() {\n    return this._enforceBeforeAfter;\n  }\n  /**\n   * Sets whether to enforce that all hook names start with 'before' or 'after'. Default is false.\n   * @param {boolean} value\n   */\n  set enforceBeforeAfter(value) {\n    this._enforceBeforeAfter = value;\n  }\n  /**\n   * Gets the map of deprecated hook names to deprecation messages.\n   * @returns {Map<string, string>}\n   */\n  get deprecatedHooks() {\n    return this._deprecatedHooks;\n  }\n  /**\n   * Sets the map of deprecated hook names to deprecation messages.\n   * @param {Map<string, string>} value\n   */\n  set deprecatedHooks(value) {\n    this._deprecatedHooks = value;\n  }\n  /**\n   * Gets whether deprecated hooks are allowed to be registered and executed. Default is true.\n   * @returns {boolean}\n   */\n  get allowDeprecated() {\n    return this._allowDeprecated;\n  }\n  /**\n   * Sets whether deprecated hooks are allowed to be registered and executed. Default is true.\n   * @param {boolean} value\n   */\n  set allowDeprecated(value) {\n    this._allowDeprecated = value;\n  }\n  /**\n   * Validates hook event name if enforceBeforeAfter is enabled\n   * @param {string} event - The event name to validate\n   * @throws {Error} If enforceBeforeAfter is true and event doesn't start with 'before' or 'after'\n   */\n  validateHookName(event) {\n    if (this._enforceBeforeAfter) {\n      const eventValue = event.trim().toLocaleLowerCase();\n      if (!eventValue.startsWith(\"before\") && !eventValue.startsWith(\"after\")) {\n        throw new Error(\n          `Hook event \"${event}\" must start with \"before\" or \"after\" when enforceBeforeAfter is enabled`\n        );\n      }\n    }\n  }\n  /**\n   * Checks if a hook is deprecated and emits a warning if it is\n   * @param {string} event - The event name to check\n   * @returns {boolean} - Returns true if the hook should proceed, false if it should be blocked\n   */\n  checkDeprecatedHook(event) {\n    if (this._deprecatedHooks.has(event)) {\n      const message = this._deprecatedHooks.get(event);\n      const warningMessage = `Hook \"${event}\" is deprecated${message ? `: ${message}` : \"\"}`;\n      this.emit(\"warn\", { hook: event, message: warningMessage });\n      return this._allowDeprecated;\n    }\n    return true;\n  }\n  /**\n   * Adds a handler function for a specific event\n   * @param {string} event\n   * @param {Hook} handler - this can be async or sync\n   * @returns {void}\n   */\n  onHook(event, handler) {\n    this.onHookEntry({ event, handler });\n  }\n  /**\n   * Adds a handler function for a specific event\n   * @param {HookEntry} hookEntry\n   * @returns {void}\n   */\n  onHookEntry(hookEntry) {\n    this.validateHookName(hookEntry.event);\n    if (!this.checkDeprecatedHook(hookEntry.event)) {\n      return;\n    }\n    const eventHandlers = this._hooks.get(hookEntry.event);\n    if (eventHandlers) {\n      eventHandlers.push(hookEntry.handler);\n    } else {\n      this._hooks.set(hookEntry.event, [hookEntry.handler]);\n    }\n  }\n  /**\n   * Alias for onHook. This is provided for compatibility with other libraries that use the `addHook` method.\n   * @param {string} event\n   * @param {Hook} handler - this can be async or sync\n   * @returns {void}\n   */\n  addHook(event, handler) {\n    this.onHookEntry({ event, handler });\n  }\n  /**\n   * Adds a handler function for a specific event\n   * @param {Array<HookEntry>} hooks\n   * @returns {void}\n   */\n  onHooks(hooks) {\n    for (const hook of hooks) {\n      this.onHook(hook.event, hook.handler);\n    }\n  }\n  /**\n   * Adds a handler function for a specific event that runs before all other handlers\n   * @param {string} event\n   * @param {Hook} handler - this can be async or sync\n   * @returns {void}\n   */\n  prependHook(event, handler) {\n    this.validateHookName(event);\n    if (!this.checkDeprecatedHook(event)) {\n      return;\n    }\n    const eventHandlers = this._hooks.get(event);\n    if (eventHandlers) {\n      eventHandlers.unshift(handler);\n    } else {\n      this._hooks.set(event, [handler]);\n    }\n  }\n  /**\n   * Adds a handler that only executes once for a specific event before all other handlers\n   * @param event\n   * @param handler\n   */\n  prependOnceHook(event, handler) {\n    this.validateHookName(event);\n    if (!this.checkDeprecatedHook(event)) {\n      return;\n    }\n    const hook = async (...arguments_) => {\n      this.removeHook(event, hook);\n      return handler(...arguments_);\n    };\n    this.prependHook(event, hook);\n  }\n  /**\n   * Adds a handler that only executes once for a specific event\n   * @param event\n   * @param handler\n   */\n  onceHook(event, handler) {\n    this.validateHookName(event);\n    if (!this.checkDeprecatedHook(event)) {\n      return;\n    }\n    const hook = async (...arguments_) => {\n      this.removeHook(event, hook);\n      return handler(...arguments_);\n    };\n    this.onHook(event, hook);\n  }\n  /**\n   * Removes a handler function for a specific event\n   * @param {string} event\n   * @param {Hook} handler\n   * @returns {void}\n   */\n  removeHook(event, handler) {\n    this.validateHookName(event);\n    if (!this.checkDeprecatedHook(event)) {\n      return;\n    }\n    const eventHandlers = this._hooks.get(event);\n    if (eventHandlers) {\n      const index = eventHandlers.indexOf(handler);\n      if (index !== -1) {\n        eventHandlers.splice(index, 1);\n      }\n    }\n  }\n  /**\n   * Removes all handlers for a specific event\n   * @param {Array<HookEntry>} hooks\n   * @returns {void}\n   */\n  removeHooks(hooks) {\n    for (const hook of hooks) {\n      this.removeHook(hook.event, hook.handler);\n    }\n  }\n  /**\n   * Calls all handlers for a specific event\n   * @param {string} event\n   * @param {T[]} arguments_\n   * @returns {Promise<void>}\n   */\n  async hook(event, ...arguments_) {\n    this.validateHookName(event);\n    if (!this.checkDeprecatedHook(event)) {\n      return;\n    }\n    const eventHandlers = this._hooks.get(event);\n    if (eventHandlers) {\n      for (const handler of eventHandlers) {\n        try {\n          await handler(...arguments_);\n        } catch (error) {\n          const message = `${event}: ${error.message}`;\n          this.emit(\"error\", new Error(message));\n          if (this._throwOnHookError) {\n            throw new Error(message);\n          }\n        }\n      }\n    }\n  }\n  /**\n   * Calls all synchronous handlers for a specific event.\n   * Async handlers (declared with `async` keyword) are silently skipped.\n   *\n   * Note: The `hook` method is preferred as it executes both sync and async functions.\n   * Use `hookSync` only when you specifically need synchronous execution.\n   * @param {string} event\n   * @param {T[]} arguments_\n   * @returns {void}\n   */\n  hookSync(event, ...arguments_) {\n    this.validateHookName(event);\n    if (!this.checkDeprecatedHook(event)) {\n      return;\n    }\n    const eventHandlers = this._hooks.get(event);\n    if (eventHandlers) {\n      for (const handler of eventHandlers) {\n        if (handler.constructor.name === \"AsyncFunction\") {\n          continue;\n        }\n        try {\n          handler(...arguments_);\n        } catch (error) {\n          const message = `${event}: ${error.message}`;\n          this.emit(\"error\", new Error(message));\n          if (this._throwOnHookError) {\n            throw new Error(message);\n          }\n        }\n      }\n    }\n  }\n  /**\n   * Prepends the word `before` to your hook. Example is event is `test`, the before hook is `before:test`.\n   * @param {string} event - The event name\n   * @param {T[]} arguments_ - The arguments to pass to the hook\n   */\n  async beforeHook(event, ...arguments_) {\n    await this.hook(`before:${event}`, ...arguments_);\n  }\n  /**\n   * Prepends the word `after` to your hook. Example is event is `test`, the after hook is `after:test`.\n   * @param {string} event - The event name\n   * @param {T[]} arguments_ - The arguments to pass to the hook\n   */\n  async afterHook(event, ...arguments_) {\n    await this.hook(`after:${event}`, ...arguments_);\n  }\n  /**\n   * Calls all handlers for a specific event. This is an alias for `hook` and is provided for\n   * compatibility with other libraries that use the `callHook` method.\n   * @param {string} event\n   * @param {T[]} arguments_\n   * @returns {Promise<void>}\n   */\n  async callHook(event, ...arguments_) {\n    await this.hook(event, ...arguments_);\n  }\n  /**\n   * Gets all hooks for a specific event\n   * @param {string} event\n   * @returns {Hook[]}\n   */\n  getHooks(event) {\n    this.validateHookName(event);\n    if (!this.checkDeprecatedHook(event)) {\n      return void 0;\n    }\n    return this._hooks.get(event);\n  }\n  /**\n   * Removes all hooks\n   * @returns {void}\n   */\n  clearHooks() {\n    this._hooks.clear();\n  }\n};\nexport {\n  Eventified,\n  Hookified\n};\n/* v8 ignore next -- @preserve */\n","/**\n * Configuration options for the Cache class.\n */\nexport type CacheOptions = {\n\t/**\n\t * Enable or disable the cache.\n\t * Defaults to true (enabled).\n\t */\n\tenabled?: boolean;\n\n\t/**\n\t * Maximum number of items to store in the cache.\n\t * Defaults to 4000. When limit is reached, oldest entries are evicted (FIFO).\n\t *\n\t * Note: JavaScript Map can hold up to 2^24 (~16.7 million) entries in most\n\t * environments, but practical limits depend on available memory and key/value sizes.\n\t * For hash caching, 4000-10000 entries is typically sufficient for most use cases.\n\t */\n\tmaxSize?: number;\n};\n\n/**\n * A simple FIFO (First In, First Out) cache for storing hash values.\n * When the cache reaches its maximum size, the oldest entries are evicted.\n *\n * The cache uses a JavaScript Map internally, which can theoretically hold up to\n * 2^24 (~16.7 million) entries. However, practical limits depend on available memory\n * and the size of cached keys/values. The default maxSize of 4000 provides a good\n * balance between performance and memory usage for typical hash caching scenarios.\n */\nexport class Cache {\n\tprivate _enabled = true;\n\tprivate _maxSize = 4000;\n\tprivate _store = new Map<string, string>();\n\tprivate _keys: string[] = [];\n\n\tconstructor(options?: CacheOptions) {\n\t\tif (options?.enabled !== undefined) {\n\t\t\tthis._enabled = options.enabled;\n\t\t}\n\n\t\tif (options?.maxSize !== undefined) {\n\t\t\tthis._maxSize = options.maxSize;\n\t\t}\n\t}\n\n\t/**\n\t * Gets whether the cache is enabled.\n\t */\n\tpublic get enabled(): boolean {\n\t\treturn this._enabled;\n\t}\n\n\t/**\n\t * Sets whether the cache is enabled.\n\t */\n\tpublic set enabled(value: boolean) {\n\t\tthis._enabled = value;\n\t}\n\n\t/**\n\t * Gets the maximum number of items the cache can hold.\n\t */\n\tpublic get maxSize(): number {\n\t\treturn this._maxSize;\n\t}\n\n\t/**\n\t * Sets the maximum number of items the cache can hold.\n\t */\n\tpublic set maxSize(value: number) {\n\t\tthis._maxSize = value;\n\t}\n\n\t/**\n\t * Gets the underlying Map store.\n\t */\n\tpublic get store(): Map<string, string> {\n\t\treturn this._store;\n\t}\n\n\t/**\n\t * Gets the current number of items in the cache.\n\t */\n\tpublic get size(): number {\n\t\treturn this._store.size;\n\t}\n\n\t/**\n\t * Gets a value from the cache.\n\t * @param key - The cache key\n\t * @returns The cached value, or undefined if not found\n\t */\n\tpublic get(key: string): string | undefined {\n\t\treturn this._store.get(key);\n\t}\n\n\t/**\n\t * Sets a value in the cache with FIFO eviction.\n\t * If the cache is disabled, this method does nothing.\n\t * If the cache is at capacity, the oldest entry is removed before adding the new one.\n\t * @param key - The cache key\n\t * @param value - The value to cache\n\t */\n\tpublic set(key: string, value: string): void {\n\t\tif (!this._enabled) {\n\t\t\treturn;\n\t\t}\n\n\t\t// If key already exists, just update the value\n\t\tif (this._store.has(key)) {\n\t\t\tthis._store.set(key, value);\n\t\t\treturn;\n\t\t}\n\n\t\t// If at capacity, remove oldest (FIFO)\n\t\tif (this._store.size >= this._maxSize) {\n\t\t\tconst oldestKey = this._keys.shift();\n\t\t\t/* v8 ignore next -- @preserve */\n\t\t\tif (oldestKey) {\n\t\t\t\tthis._store.delete(oldestKey);\n\t\t\t}\n\t\t}\n\n\t\t// Add new entry\n\t\tthis._keys.push(key);\n\t\tthis._store.set(key, value);\n\t}\n\n\t/**\n\t * Checks if a key exists in the cache.\n\t * @param key - The cache key\n\t * @returns True if the key exists, false otherwise\n\t */\n\tpublic has(key: string): boolean {\n\t\treturn this._store.has(key);\n\t}\n\n\t/**\n\t * Clears all entries from the cache.\n\t */\n\tpublic clear(): void {\n\t\tthis._store.clear();\n\t\tthis._keys = [];\n\t}\n}\n","import type { HashProvider } from \"../types.ts\";\n\nexport class CRC implements HashProvider {\n    public get name(): string {\n        return \"crc32\";\n    }\n\n    public toHashSync(data: BufferSource): string {\n        // Convert BufferSource to Uint8Array\n        let bytes: Uint8Array;\n\n        if (data instanceof Uint8Array) {\n            bytes = data;\n        } else if (data instanceof ArrayBuffer) {\n            bytes = new Uint8Array(data);\n        } else if (data instanceof DataView) {\n            bytes = new Uint8Array(data.buffer, data.byteOffset, data.byteLength);\n        } else {\n            const view = data as ArrayBufferView;\n            bytes = new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n        }\n\n        // CRC-32 algorithm (IEEE 802.3 polynomial)\n        // This is the same algorithm used by PHP's crc32() function\n        const CRC32_POLYNOMIAL = 0xEDB88320;\n        let crc = 0xFFFFFFFF;\n\n        for (let i = 0; i < bytes.length; i++) {\n            crc = crc ^ bytes[i];\n            for (let j = 0; j < 8; j++) {\n                crc = (crc >>> 1) ^ (CRC32_POLYNOMIAL & -(crc & 1));\n            }\n        }\n\n        // Finalize CRC\n        crc = (crc ^ 0xFFFFFFFF) >>> 0;\n\n        // Convert to hexadecimal string (8 characters, zero-padded)\n        const hashHex = crc.toString(16).padStart(8, \"0\");\n        return hashHex;\n    }\n\n    public async toHash(data: BufferSource): Promise<string> {\n        return this.toHashSync(data);\n    }\n}\n","import type { WebCryptoHashAlgorithm, HashProvider } from \"../types.js\";\n\n\nexport type WebCryptoOptions = {\n\talgorithm?: WebCryptoHashAlgorithm\n}\n\nexport class WebCrypto implements HashProvider {\n\tprivate _algorithm: WebCryptoHashAlgorithm = \"SHA-256\";\n\tconstructor(options?: WebCryptoOptions) {\n\t\tif(options?.algorithm) {\n\t\t\tthis._algorithm = options?.algorithm;\n\t\t}\n\n\t}\n\n\tpublic get name(): string {\n\t\treturn this._algorithm;\n\t}\n\n\tpublic async toHash(data: BufferSource): Promise<string> {\n\t\t// Hash the data using Web Crypto API\n\t\tconst hashBuffer = await crypto.subtle.digest(this._algorithm, data);\n\n\t\t// Convert the hash to a hexadecimal string\n\t\tconst hashArray = Array.from(new Uint8Array(hashBuffer));\n\t\tconst hashHex = hashArray\n\t\t\t.map((byte) => byte.toString(16).padStart(2, \"0\"))\n\t\t\t.join(\"\");\n\n\t\treturn hashHex;\n\t}\n}","import type { HashProvider } from \"../types.ts\";\n\n/**\n * DJB2 hash algorithm implementation.\n *\n * DJB2 is a non-cryptographic hash function created by Daniel J. Bernstein.\n * It produces a 32-bit hash value, making it suitable for hash tables and checksums,\n * but NOT for cryptographic purposes.\n *\n * Algorithm: hash = hash * 33 + c (where c is each byte)\n * Initial value: 5381\n *\n * @example\n * ```typescript\n * import { Hashery } from 'hashery';\n * import { DJB2 } from 'hashery/providers/djb2';\n *\n * const hashery = new Hashery();\n * hashery.providers.add(new DJB2());\n *\n * const hash = await hashery.toHash({ data: 'hello' }, 'djb2');\n * console.log(hash); // \"7c9df5ea\"\n * ```\n */\nexport class DJB2 implements HashProvider {\n\t/**\n\t * The name identifier for this hash provider.\n\t */\n\tpublic get name(): string {\n\t\treturn \"djb2\";\n\t}\n\n\t/**\n\t * Computes the DJB2 hash of the provided data synchronously.\n\t *\n\t * @param data - The data to hash (Uint8Array, ArrayBuffer, or DataView)\n\t * @returns An 8-character lowercase hexadecimal string\n\t *\n\t * @example\n\t * ```typescript\n\t * const djb2 = new DJB2();\n\t * const data = new TextEncoder().encode('hello');\n\t * const hash = djb2.toHashSync(data);\n\t * console.log(hash); // \"7c9df5ea\"\n\t * ```\n\t */\n\tpublic toHashSync(data: BufferSource): string {\n\t\t// Convert BufferSource to Uint8Array for consistent processing\n\t\tlet bytes: Uint8Array;\n\n\t\tif (data instanceof Uint8Array) {\n\t\t\tbytes = data;\n\t\t} else if (data instanceof ArrayBuffer) {\n\t\t\tbytes = new Uint8Array(data);\n\t\t} else if (data instanceof DataView) {\n\t\t\tbytes = new Uint8Array(data.buffer, data.byteOffset, data.byteLength);\n\t\t} else {\n\t\t\t// Fallback for other ArrayBufferView types (e.g., Int8Array, Uint16Array, etc.)\n\t\t\tconst view = data as ArrayBufferView;\n\t\t\tbytes = new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n\t\t}\n\n\t\t// DJB2 algorithm\n\t\t// Initial hash value: 5381\n\t\tlet hash = 5381;\n\n\t\t// Process each byte: hash = hash * 33 + byte\n\t\tfor (let i = 0; i < bytes.length; i++) {\n\t\t\thash = ((hash << 5) + hash) + bytes[i]; // hash * 33 + c\n\t\t\t// Keep it as a 32-bit unsigned integer\n\t\t\thash = hash >>> 0;\n\t\t}\n\n\t\t// Convert to 8-character lowercase hexadecimal string\n\t\tconst hashHex = hash.toString(16).padStart(8, \"0\");\n\n\t\treturn hashHex;\n\t}\n\n\t/**\n\t * Computes the DJB2 hash of the provided data.\n\t *\n\t * @param data - The data to hash (Uint8Array, ArrayBuffer, or DataView)\n\t * @returns A Promise resolving to an 8-character lowercase hexadecimal string\n\t *\n\t * @example\n\t * ```typescript\n\t * const djb2 = new DJB2();\n\t * const data = new TextEncoder().encode('hello');\n\t * const hash = await djb2.toHash(data);\n\t * console.log(hash); // \"7c9df5ea\"\n\t * ```\n\t */\n\tpublic async toHash(data: BufferSource): Promise<string> {\n\t\treturn this.toHashSync(data);\n\t}\n}\n","import type { HashProvider } from \"../types.ts\";\n\n/**\n * FNV-1 (Fowler-Noll-Vo) hash algorithm implementation.\n *\n * FNV-1 is a non-cryptographic hash function created by Glenn Fowler, Landon Curt Noll,\n * and Kiem-Phong Vo. It produces a 32-bit hash value, making it suitable for hash tables\n * and checksums, but NOT for cryptographic purposes.\n *\n * Algorithm: hash = (hash * FNV_prime) XOR octet_of_data\n * FNV-1 32-bit offset basis: 2166136261\n * FNV-1 32-bit prime: 16777619\n */\nexport class FNV1 implements HashProvider {\n    /**\n     * The name identifier for this hash provider.\n     */\n    public get name(): string {\n        return \"fnv1\";\n    }\n\n    /**\n     * Computes the FNV-1 hash of the provided data synchronously.\n     *\n     * @param data - The data to hash (Uint8Array, ArrayBuffer, or DataView)\n     * @returns An 8-character lowercase hexadecimal string\n     */\n    public toHashSync(data: BufferSource): string {\n        // Convert BufferSource to Uint8Array for consistent processing\n        let bytes: Uint8Array;\n\n        if (data instanceof Uint8Array) {\n            bytes = data;\n        } else if (data instanceof ArrayBuffer) {\n            bytes = new Uint8Array(data);\n        } else if (data instanceof DataView) {\n            bytes = new Uint8Array(data.buffer, data.byteOffset, data.byteLength);\n        } else {\n            // Fallback for other ArrayBufferView types (e.g., Int8Array, Uint16Array, etc.)\n            const view = data as ArrayBufferView;\n            bytes = new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n        }\n\n        // FNV-1 algorithm constants\n        const FNV_OFFSET_BASIS = 2166136261; // 32-bit offset basis\n        const FNV_PRIME = 16777619; // 32-bit FNV prime\n\n        // Initialize hash with FNV offset basis\n        let hash = FNV_OFFSET_BASIS;\n\n        // Process each byte: hash = (hash * FNV_prime) XOR byte\n        for (let i = 0; i < bytes.length; i++) {\n            hash = hash * FNV_PRIME;\n            hash = hash ^ bytes[i];\n            // Keep it as a 32-bit unsigned integer\n            hash = hash >>> 0;\n        }\n\n        // Convert to 8-character lowercase hexadecimal string\n        const hashHex = hash.toString(16).padStart(8, \"0\");\n\n        return hashHex;\n    }\n\n    /**\n     * Computes the FNV-1 hash of the provided data.\n     *\n     * @param data - The data to hash (Uint8Array, ArrayBuffer, or DataView)\n     * @returns A Promise resolving to an 8-character lowercase hexadecimal string\n     */\n    public async toHash(data: BufferSource): Promise<string> {\n        return this.toHashSync(data);\n    }\n}\n","import type { HashProvider } from \"../types.ts\";\n\n/**\n * Murmur 32-bit hash algorithm implementation.\n *\n * Murmur is a non-cryptographic hash function based on MurmurHash3 by Austin Appleby.\n * It produces a 32-bit hash value with excellent distribution and performance,\n * making it suitable for hash tables, bloom filters, and checksums,\n * but NOT for cryptographic purposes.\n *\n * This implementation uses the MurmurHash3_x86_32 variant.\n *\n * @example\n * ```typescript\n * import { Hashery } from 'hashery';\n * import { Murmur } from 'hashery/providers/murmur';\n *\n * const hashery = new Hashery();\n * hashery.providers.add(new Murmur());\n *\n * const hash = await hashery.toHash({ data: 'hello' }, 'murmur');\n * console.log(hash); // \"248bfa47\"\n * ```\n */\nexport class Murmur implements HashProvider {\n\tprivate _seed: number;\n\n\t/**\n\t * Creates a new Murmur instance.\n\t *\n\t * @param seed - Optional seed value for the hash (default: 0)\n\t */\n\tconstructor(seed: number = 0) {\n\t\tthis._seed = seed >>> 0; // Ensure it's a 32-bit unsigned integer\n\t}\n\n\t/**\n\t * The name identifier for this hash provider.\n\t */\n\tpublic get name(): string {\n\t\treturn \"murmur\";\n\t}\n\n\t/**\n\t * Gets the current seed value used for hashing.\n\t */\n\tpublic get seed(): number {\n\t\treturn this._seed;\n\t}\n\n\t/**\n\t * Computes the Murmur 32-bit hash of the provided data synchronously.\n\t *\n\t * @param data - The data to hash (Uint8Array, ArrayBuffer, or DataView)\n\t * @returns An 8-character lowercase hexadecimal string\n\t *\n\t * @example\n\t * ```typescript\n\t * const murmur = new Murmur();\n\t * const data = new TextEncoder().encode('hello');\n\t * const hash = murmur.toHashSync(data);\n\t * console.log(hash); // \"248bfa47\"\n\t * ```\n\t */\n\tpublic toHashSync(data: BufferSource): string {\n\t\t// Convert BufferSource to Uint8Array for consistent processing\n\t\tlet bytes: Uint8Array;\n\n\t\tif (data instanceof Uint8Array) {\n\t\t\tbytes = data;\n\t\t} else if (data instanceof ArrayBuffer) {\n\t\t\tbytes = new Uint8Array(data);\n\t\t} else if (data instanceof DataView) {\n\t\t\tbytes = new Uint8Array(data.buffer, data.byteOffset, data.byteLength);\n\t\t} else {\n\t\t\t// Fallback for other ArrayBufferView types (e.g., Int8Array, Uint16Array, etc.)\n\t\t\tconst view = data as ArrayBufferView;\n\t\t\tbytes = new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n\t\t}\n\n\t\t// MurmurHash3_x86_32 algorithm\n\t\tconst c1 = 0xcc9e2d51;\n\t\tconst c2 = 0x1b873593;\n\t\tconst length = bytes.length;\n\t\tconst nblocks = Math.floor(length / 4);\n\n\t\tlet h1 = this._seed;\n\n\t\t// Process 4-byte blocks\n\t\tfor (let i = 0; i < nblocks; i++) {\n\t\t\tconst index = i * 4;\n\t\t\tlet k1 =\n\t\t\t\t(bytes[index] & 0xff) |\n\t\t\t\t((bytes[index + 1] & 0xff) << 8) |\n\t\t\t\t((bytes[index + 2] & 0xff) << 16) |\n\t\t\t\t((bytes[index + 3] & 0xff) << 24);\n\n\t\t\tk1 = this._imul(k1, c1);\n\t\t\tk1 = this._rotl32(k1, 15);\n\t\t\tk1 = this._imul(k1, c2);\n\n\t\t\th1 ^= k1;\n\t\t\th1 = this._rotl32(h1, 13);\n\t\t\th1 = this._imul(h1, 5) + 0xe6546b64;\n\t\t}\n\n\t\t// Process remaining bytes\n\t\tconst tail = nblocks * 4;\n\t\tlet k1 = 0;\n\n\t\tswitch (length & 3) {\n\t\t\tcase 3:\n\t\t\t\tk1 ^= (bytes[tail + 2] & 0xff) << 16;\n\t\t\t// fallthrough\n\t\t\tcase 2:\n\t\t\t\tk1 ^= (bytes[tail + 1] & 0xff) << 8;\n\t\t\t// fallthrough\n\t\t\tcase 1:\n\t\t\t\tk1 ^= bytes[tail] & 0xff;\n\t\t\t\tk1 = this._imul(k1, c1);\n\t\t\t\tk1 = this._rotl32(k1, 15);\n\t\t\t\tk1 = this._imul(k1, c2);\n\t\t\t\th1 ^= k1;\n\t\t}\n\n\t\t// Finalization\n\t\th1 ^= length;\n\n\t\th1 ^= h1 >>> 16;\n\t\th1 = this._imul(h1, 0x85ebca6b);\n\t\th1 ^= h1 >>> 13;\n\t\th1 = this._imul(h1, 0xc2b2ae35);\n\t\th1 ^= h1 >>> 16;\n\n\t\t// Convert to unsigned 32-bit integer\n\t\th1 = h1 >>> 0;\n\n\t\t// Convert to 8-character lowercase hexadecimal string\n\t\tconst hashHex = h1.toString(16).padStart(8, \"0\");\n\n\t\treturn hashHex;\n\t}\n\n\t/**\n\t * Computes the Murmur 32-bit hash of the provided data.\n\t *\n\t * @param data - The data to hash (Uint8Array, ArrayBuffer, or DataView)\n\t * @returns A Promise resolving to an 8-character lowercase hexadecimal string\n\t *\n\t * @example\n\t * ```typescript\n\t * const murmur = new Murmur();\n\t * const data = new TextEncoder().encode('hello');\n\t * const hash = await murmur.toHash(data);\n\t * console.log(hash); // \"248bfa47\"\n\t * ```\n\t */\n\tpublic async toHash(data: BufferSource): Promise<string> {\n\t\treturn this.toHashSync(data);\n\t}\n\n\t/**\n\t * 32-bit integer multiplication with proper overflow handling.\n\t * @private\n\t */\n\tprivate _imul(a: number, b: number): number {\n\t\t// Use Math.imul if available, otherwise fallback to manual implementation\n\t\t/* v8 ignore next -- @preserve */\n\t\tif (Math.imul) {\n\t\t\treturn Math.imul(a, b);\n\t\t}\n\n\t\t// Manual 32-bit multiplication\n\t\t/* v8 ignore next -- @preserve */\n\t\tconst ah = (a >>> 16) & 0xffff;\n\t\t/* v8 ignore next -- @preserve */\n\t\tconst al = a & 0xffff;\n\t\t/* v8 ignore next -- @preserve */\n\t\tconst bh = (b >>> 16) & 0xffff;\n\t\t/* v8 ignore next -- @preserve */\n\t\tconst bl = b & 0xffff;\n\n\t\t/* v8 ignore next -- @preserve */\n\t\treturn ((al * bl) + (((ah * bl + al * bh) << 16) >>> 0)) | 0;\n\t}\n\n\t/**\n\t * Left rotate a 32-bit integer.\n\t * @private\n\t */\n\tprivate _rotl32(x: number, r: number): number {\n\t\treturn (x << r) | (x >>> (32 - r));\n\t}\n}\n","import type {\n\tHashProvider,\n\tHashProvidersGetOptions,\n\tHashProvidersOptions,\n} from \"./types.js\";\n\n/**\n * Manages a collection of hash providers for the Hashery system.\n * Provides methods to add, remove, and load multiple hash providers.\n */\nexport class HashProviders {\n\tprivate _providers: Map<string, HashProvider> = new Map();\n\tprivate _getFuzzy = true;\n\n\t/**\n\t * Creates a new HashProviders instance.\n\t * @param options - Optional configuration including initial providers to load\n\t * @example\n\t * ```ts\n\t * const providers = new HashProviders({\n\t *   providers: [{ name: 'custom', toHash: async (data) => '...' }]\n\t * });\n\t * ```\n\t */\n\tconstructor(options?: HashProvidersOptions) {\n\t\tif (options?.providers) {\n\t\t\tthis.loadProviders(options?.providers);\n\t\t}\n\n\t\tif (options?.getFuzzy !== undefined) {\n\t\t\tthis._getFuzzy = Boolean(options?.getFuzzy);\n\t\t}\n\t}\n\n\t/**\n\t * Loads multiple hash providers at once.\n\t * Each provider is added to the internal map using its name as the key.\n\t * @param providers - Array of HashProvider objects to load\n\t * @example\n\t * ```ts\n\t * const providers = new HashProviders();\n\t * providers.loadProviders([\n\t *   { name: 'md5', toHash: async (data) => '...' },\n\t *   { name: 'sha1', toHash: async (data) => '...' }\n\t * ]);\n\t * ```\n\t */\n\tpublic loadProviders(providers: Array<HashProvider>) {\n\t\tfor (const provider of providers) {\n\t\t\tthis._providers.set(provider.name, provider);\n\t\t}\n\t}\n\n\t/**\n\t * Gets the internal Map of all registered hash providers.\n\t * @returns Map of provider names to HashProvider objects\n\t */\n\tpublic get providers(): Map<string, HashProvider> {\n\t\treturn this._providers;\n\t}\n\n\t/**\n\t * Sets the internal Map of hash providers, replacing all existing providers.\n\t * @param providers - Map of provider names to HashProvider objects\n\t */\n\tpublic set providers(providers: Map<string, HashProvider>) {\n\t\tthis._providers = providers;\n\t}\n\n\t/**\n\t * Gets an array of all provider names.\n\t * @returns Array of provider names\n\t * @example\n\t * ```ts\n\t * const providers = new HashProviders();\n\t * providers.add({ name: 'sha256', toHash: async (data) => '...' });\n\t * providers.add({ name: 'md5', toHash: async (data) => '...' });\n\t * console.log(providers.names); // ['sha256', 'md5']\n\t * ```\n\t */\n\tpublic get names(): Array<string> {\n\t\treturn Array.from(this._providers.keys());\n\t}\n\n\t/**\n\t * Gets a hash provider by name with optional fuzzy matching.\n\t *\n\t * Fuzzy matching (enabled by default) attempts to find providers by:\n\t * 1. Exact match (after trimming whitespace)\n\t * 2. Case-insensitive match (lowercase)\n\t * 3. Dash-removed match (e.g., \"SHA-256\" matches \"sha256\")\n\t *\n\t * @param name - The name of the provider to retrieve\n\t * @param options - Optional configuration for the get operation\n\t * @param options.fuzzy - Enable/disable fuzzy matching (overrides constructor setting)\n\t * @returns The HashProvider if found, undefined otherwise\n\t * @example\n\t * ```ts\n\t * const providers = new HashProviders();\n\t * providers.add({ name: 'sha256', toHash: async (data) => '...' });\n\t *\n\t * // Exact match\n\t * const provider = providers.get('sha256');\n\t *\n\t * // Fuzzy match (case-insensitive)\n\t * const provider2 = providers.get('SHA256');\n\t *\n\t * // Fuzzy match (with dash)\n\t * const provider3 = providers.get('SHA-256');\n\t *\n\t * // Disable fuzzy matching\n\t * const provider4 = providers.get('SHA256', { fuzzy: false }); // returns undefined\n\t * ```\n\t */\n\tpublic get(\n\t\tname: string,\n\t\toptions?: HashProvidersGetOptions,\n\t): HashProvider | undefined {\n\t\t// set the options\n\t\tconst getFuzzy = options?.fuzzy ?? this._getFuzzy;\n\n\t\t// do the trim\n\t\tname = name.trim();\n\n\t\tlet result = this._providers.get(name);\n\n\t\t// try with lower case\n\t\tif (result === undefined && getFuzzy === true) {\n\t\t\tname = name.toLowerCase();\n\t\t\tresult = this._providers.get(name);\n\t\t}\n\n\t\t// try removing dash\n\t\tif (result === undefined && getFuzzy === true) {\n\t\t\tname = name.replaceAll(\"-\", \"\");\n\t\t\tresult = this._providers.get(name);\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Adds a single hash provider to the collection.\n\t * If a provider with the same name already exists, it will be replaced.\n\t * @param provider - The HashProvider object to add\n\t * @example\n\t * ```ts\n\t * const providers = new HashProviders();\n\t * providers.add({\n\t *   name: 'custom-hash',\n\t *   toHash: async (data) => {\n\t *     // Custom hashing logic\n\t *     return 'hash-result';\n\t *   }\n\t * });\n\t * ```\n\t */\n\tpublic add(provider: HashProvider): void {\n\t\tthis._providers.set(provider.name, provider);\n\t}\n\n\t/**\n\t * Removes a hash provider from the collection by name.\n\t * @param name - The name of the provider to remove\n\t * @returns true if the provider was found and removed, false otherwise\n\t * @example\n\t * ```ts\n\t * const providers = new HashProviders();\n\t * providers.add({ name: 'custom', toHash: async (data) => '...' });\n\t * const removed = providers.remove('custom'); // returns true\n\t * const removed2 = providers.remove('nonexistent'); // returns false\n\t * ```\n\t */\n\tpublic remove(name: string): boolean {\n\t\treturn this._providers.delete(name);\n\t}\n}\n","import { Hookified } from \"hookified\";\nimport { Cache } from \"./cache.js\";\nimport { CRC } from \"./providers/crc.js\";\nimport { WebCrypto } from \"./providers/crypto.js\";\nimport { DJB2 } from \"./providers/djb2.js\";\nimport { FNV1 } from \"./providers/fnv1.js\";\nimport { Murmur } from \"./providers/murmur.js\";\nimport { HashProviders } from \"./providers.js\";\nimport type {\n\tHasheryLoadProviderOptions,\n\tHasheryOptions,\n\tHasheryToHashOptions,\n\tHasheryToHashSyncOptions,\n\tHasheryToNumberOptions,\n\tHasheryToNumberSyncOptions,\n\tHashProvider,\n\tParseFn,\n\tStringifyFn,\n\tWebCryptoHashAlgorithm,\n} from \"./types.js\";\n\nexport class Hashery extends Hookified {\n\tprivate _parse: ParseFn = JSON.parse;\n\tprivate _stringify: StringifyFn = JSON.stringify;\n\tprivate _providers = new HashProviders();\n\tprivate _defaultAlgorithm: string = \"SHA-256\";\n\tprivate _defaultAlgorithmSync: string = \"djb2\";\n\tprivate _cache: Cache;\n\n\tconstructor(options?: HasheryOptions) {\n\t\tsuper(options);\n\n\t\tif (options?.parse) {\n\t\t\tthis._parse = options.parse;\n\t\t}\n\n\t\tif (options?.stringify) {\n\t\t\tthis._stringify = options.stringify;\n\t\t}\n\n\t\tif (options?.defaultAlgorithm) {\n\t\t\tthis._defaultAlgorithm = options.defaultAlgorithm;\n\t\t}\n\n\t\tif (options?.defaultAlgorithmSync) {\n\t\t\tthis._defaultAlgorithmSync = options.defaultAlgorithmSync;\n\t\t}\n\n\t\tthis._cache = new Cache(options?.cache);\n\n\t\tthis.loadProviders(options?.providers, {\n\t\t\tincludeBase: options?.includeBase ?? true,\n\t\t});\n\t}\n\n\t/**\n\t * Gets the parse function used to deserialize stored values.\n\t * @returns The current parse function (defaults to JSON.parse)\n\t */\n\tpublic get parse(): ParseFn {\n\t\treturn this._parse;\n\t}\n\n\t/**\n\t * Sets the parse function used to deserialize stored values.\n\t * @param value - The parse function to use for deserialization\n\t */\n\tpublic set parse(value: ParseFn) {\n\t\tthis._parse = value;\n\t}\n\n\t/**\n\t * Gets the stringify function used to serialize values for storage.\n\t * @returns The current stringify function (defaults to JSON.stringify)\n\t */\n\tpublic get stringify(): StringifyFn {\n\t\treturn this._stringify;\n\t}\n\n\t/**\n\t * Sets the stringify function used to serialize values for storage.\n\t * @param value - The stringify function to use for serialization\n\t */\n\tpublic set stringify(value: StringifyFn) {\n\t\tthis._stringify = value;\n\t}\n\n\t/**\n\t * Gets the HashProviders instance used to manage hash providers.\n\t * @returns The current HashProviders instance\n\t */\n\tpublic get providers(): HashProviders {\n\t\treturn this._providers;\n\t}\n\n\t/**\n\t * Sets the HashProviders instance used to manage hash providers.\n\t * @param value - The HashProviders instance to use\n\t */\n\tpublic set providers(value: HashProviders) {\n\t\tthis._providers = value;\n\t}\n\n\t/**\n\t * Gets the names of all registered hash algorithm providers.\n\t * @returns An array of provider names (e.g., ['SHA-256', 'SHA-384', 'SHA-512'])\n\t */\n\tpublic get names(): Array<string> {\n\t\treturn this._providers.names;\n\t}\n\n\t/**\n\t * Gets the default hash algorithm used when none is specified.\n\t * @returns The current default algorithm (defaults to 'SHA-256')\n\t */\n\tpublic get defaultAlgorithm(): string {\n\t\treturn this._defaultAlgorithm;\n\t}\n\n\t/**\n\t * Sets the default hash algorithm to use when none is specified.\n\t * @param value - The default algorithm to use (e.g., 'SHA-256', 'SHA-512', 'djb2')\n\t * @example\n\t * ```ts\n\t * const hashery = new Hashery();\n\t * hashery.defaultAlgorithm = 'SHA-512';\n\t *\n\t * // Now toHash will use SHA-512 by default\n\t * const hash = await hashery.toHash({ data: 'example' });\n\t * ```\n\t */\n\tpublic set defaultAlgorithm(value: string) {\n\t\tthis._defaultAlgorithm = value;\n\t}\n\n\t/**\n\t * Gets the default synchronous hash algorithm used when none is specified.\n\t * @returns The current default synchronous algorithm (defaults to 'djb2')\n\t */\n\tpublic get defaultAlgorithmSync(): string {\n\t\treturn this._defaultAlgorithmSync;\n\t}\n\n\t/**\n\t * Sets the default synchronous hash algorithm to use when none is specified.\n\t * @param value - The default synchronous algorithm to use (e.g., 'djb2', 'fnv1', 'murmur', 'crc32')\n\t * @example\n\t * ```ts\n\t * const hashery = new Hashery();\n\t * hashery.defaultAlgorithmSync = 'fnv1';\n\t *\n\t * // Now synchronous operations will use fnv1 by default\n\t * ```\n\t */\n\tpublic set defaultAlgorithmSync(value: string) {\n\t\tthis._defaultAlgorithmSync = value;\n\t}\n\n\t/**\n\t * Gets the cache instance used to store computed hash values.\n\t * @returns The Cache instance\n\t * @example\n\t * ```ts\n\t * const hashery = new Hashery({ cache: { enabled: true } });\n\t *\n\t * // Access the cache\n\t * hashery.cache.enabled; // true\n\t * hashery.cache.size; // number of cached items\n\t * hashery.cache.clear(); // clear all cached items\n\t * ```\n\t */\n\tpublic get cache(): Cache {\n\t\treturn this._cache;\n\t}\n\n\t/**\n\t * Generates a cryptographic hash of the provided data using the Web Crypto API.\n\t * The data is first stringified using the configured stringify function, then hashed.\n\t *\n\t * If an invalid algorithm is provided, a 'warn' event is emitted and the method falls back\n\t * to the default algorithm. You can listen to these warnings:\n\t * ```ts\n\t * hashery.on('warn', (message) => console.log(message));\n\t * ```\n\t *\n\t * @param data - The data to hash (will be stringified before hashing)\n\t * @param options - Optional configuration object\n\t * @param options.algorithm - The hash algorithm to use (defaults to 'SHA-256')\n\t * @param options.maxLength - Optional maximum length for the hash output\n\t * @returns A Promise that resolves to the hexadecimal string representation of the hash\n\t *\n\t * @example\n\t * ```ts\n\t * const hashery = new Hashery();\n\t * const hash = await hashery.toHash({ name: 'John', age: 30 });\n\t * console.log(hash); // \"a1b2c3d4...\"\n\t *\n\t * // Using a different algorithm\n\t * const hash512 = await hashery.toHash({ name: 'John' }, { algorithm: 'SHA-512' });\n\t * ```\n\t */\n\tpublic async toHash(\n\t\tdata: unknown,\n\t\toptions?: HasheryToHashOptions,\n\t): Promise<string> {\n\t\t// Before hook - allows modification of input data and algorithm\n\t\tconst context = {\n\t\t\tdata,\n\t\t\talgorithm: options?.algorithm ?? this._defaultAlgorithm,\n\t\t\tmaxLength: options?.maxLength,\n\t\t};\n\t\tawait this.beforeHook(\"toHash\", context);\n\n\t\t// Stringify the data using the configured stringify function\n\t\tconst stringified = this._stringify(context.data);\n\n\t\t// Check cache first\n\t\tconst cacheKey = `${context.algorithm}:${stringified}`;\n\t\tif (this._cache.enabled) {\n\t\t\tconst cached = this._cache.get(cacheKey);\n\t\t\tif (cached !== undefined) {\n\t\t\t\tlet cachedHash = cached;\n\t\t\t\t// Apply maxLength if specified\n\t\t\t\tif (options?.maxLength && cachedHash.length > options.maxLength) {\n\t\t\t\t\tcachedHash = cachedHash.substring(0, options.maxLength);\n\t\t\t\t}\n\n\t\t\t\t// After hook - run even on cache hits for consistent behavior\n\t\t\t\tconst result = {\n\t\t\t\t\thash: cachedHash,\n\t\t\t\t\tdata: context.data,\n\t\t\t\t\talgorithm: context.algorithm,\n\t\t\t\t};\n\t\t\t\tawait this.afterHook(\"toHash\", result);\n\n\t\t\t\treturn result.hash;\n\t\t\t}\n\t\t}\n\n\t\t// Convert the string to a Uint8Array\n\t\tconst encoder = new TextEncoder();\n\t\tconst dataBuffer = encoder.encode(stringified);\n\n\t\t// Get the provider for the specified algorithm\n\t\tlet provider = this._providers.get(context.algorithm);\n\t\tif (!provider) {\n\t\t\t// Emit warning for invalid algorithm\n\t\t\tthis.emit(\n\t\t\t\t\"warn\",\n\t\t\t\t`Invalid algorithm '${context.algorithm}' not found. Falling back to default algorithm '${this._defaultAlgorithm}'.`,\n\t\t\t);\n\n\t\t\tprovider = new WebCrypto({\n\t\t\t\talgorithm: this._defaultAlgorithm as WebCryptoHashAlgorithm,\n\t\t\t});\n\t\t}\n\n\t\t// Use the provider to hash the data\n\t\tlet hash = await provider.toHash(dataBuffer);\n\n\t\t// Store the full hash in cache before truncation\n\t\tif (this._cache.enabled) {\n\t\t\tthis._cache.set(cacheKey, hash);\n\t\t}\n\n\t\t// if there is a max then change the hash\n\t\tif (options?.maxLength && hash.length > options?.maxLength) {\n\t\t\thash = hash.substring(0, options.maxLength);\n\t\t}\n\n\t\t// After hook - allows modification/logging of result\n\t\tconst result = { hash, data: context.data, algorithm: context.algorithm };\n\t\tawait this.afterHook(\"toHash\", result);\n\n\t\treturn result.hash;\n\t}\n\n\t/**\n\t * Generates a deterministic number within a specified range based on the hash of the provided data.\n\t * This method uses the toHash function to create a consistent hash, then maps it to a number\n\t * between min and max (inclusive).\n\t *\n\t * @param data - The data to hash (will be stringified before hashing)\n\t * @param options - Configuration options (optional, defaults to min: 0, max: 100)\n\t * @param options.min - The minimum value of the range (inclusive, defaults to 0)\n\t * @param options.max - The maximum value of the range (inclusive, defaults to 100)\n\t * @param options.algorithm - The hash algorithm to use (defaults to 'SHA-256')\n\t * @param options.hashLength - Number of characters from hash to use for conversion (defaults to 16)\n\t * @returns A Promise that resolves to a number between min and max (inclusive)\n\t *\n\t * @example\n\t * ```ts\n\t * const hashery = new Hashery();\n\t * const num = await hashery.toNumber({ user: 'john' }); // Uses default min: 0, max: 100\n\t * console.log(num); // Always returns the same number for the same input, e.g., 42\n\t *\n\t * // Using custom range\n\t * const num2 = await hashery.toNumber({ user: 'john' }, { min: 1, max: 100 });\n\t *\n\t * // Using a different algorithm\n\t * const num512 = await hashery.toNumber({ user: 'john' }, { min: 0, max: 255, algorithm: 'SHA-512' });\n\t * ```\n\t */\n\tpublic async toNumber(\n\t\tdata: unknown,\n\t\toptions: HasheryToNumberOptions = {},\n\t): Promise<number> {\n\t\tconst {\n\t\t\tmin = 0,\n\t\t\tmax = 100,\n\t\t\talgorithm = this._defaultAlgorithm,\n\t\t\thashLength = 16,\n\t\t} = options;\n\n\t\tif (min > max) {\n\t\t\tthrow new Error(\"min cannot be greater than max\");\n\t\t}\n\n\t\t// Get the hash as a hex string\n\t\t// Take the first hashLength characters of the hash to convert to a number\n\t\t// This provides good distribution while avoiding precision issues with JavaScript numbers\n\t\tconst hash = await this.toHash(data, { algorithm, maxLength: hashLength });\n\n\t\t// Convert hex to a number\n\t\tconst hashNumber = Number.parseInt(hash, 16);\n\n\t\t// Map the hash number to the desired range\n\t\tconst range = max - min + 1;\n\t\tconst mapped = min + (hashNumber % range);\n\n\t\treturn mapped;\n\t}\n\n\t/**\n\t * Generates a hash of the provided data synchronously using a non-cryptographic hash algorithm.\n\t * The data is first stringified using the configured stringify function, then hashed.\n\t *\n\t * Note: This method only works with synchronous hash providers (djb2, fnv1, murmur, crc32).\n\t * WebCrypto algorithms (SHA-256, SHA-384, SHA-512) are not supported and will throw an error.\n\t *\n\t * If an invalid algorithm is provided, a 'warn' event is emitted and the method falls back\n\t * to the default synchronous algorithm. You can listen to these warnings:\n\t * ```ts\n\t * hashery.on('warn', (message) => console.log(message));\n\t * ```\n\t *\n\t * @param data - The data to hash (will be stringified before hashing)\n\t * @param options - Optional configuration object\n\t * @param options.algorithm - The hash algorithm to use (defaults to 'djb2')\n\t * @param options.maxLength - Optional maximum length for the hash output\n\t * @returns The hexadecimal string representation of the hash\n\t *\n\t * @throws {Error} If the specified algorithm does not support synchronous hashing\n\t * @throws {Error} If the default algorithm is not found\n\t *\n\t * @example\n\t * ```ts\n\t * const hashery = new Hashery();\n\t * const hash = hashery.toHashSync({ name: 'John', age: 30 });\n\t * console.log(hash); // \"7c9df5ea...\" (djb2 hash)\n\t *\n\t * // Using a different algorithm\n\t * const hashFnv1 = hashery.toHashSync({ name: 'John' }, { algorithm: 'fnv1' });\n\t * ```\n\t */\n\tpublic toHashSync(data: unknown, options?: HasheryToHashSyncOptions): string {\n\t\t// Before hook - allows modification of input data and algorithm (synchronous/blocking)\n\t\tconst context = {\n\t\t\tdata,\n\t\t\talgorithm: options?.algorithm ?? this._defaultAlgorithmSync,\n\t\t\tmaxLength: options?.maxLength,\n\t\t};\n\t\tthis.hookSync(\"before:toHashSync\", context);\n\n\t\t// Get algorithm from context (may have been modified by hook)\n\t\tconst algorithm = context.algorithm;\n\n\t\t// Stringify the data using the configured stringify function\n\t\tconst stringified = this._stringify(context.data);\n\n\t\t// Check cache first\n\t\tconst cacheKey = `${algorithm}:${stringified}`;\n\t\tif (this._cache.enabled) {\n\t\t\tconst cached = this._cache.get(cacheKey);\n\t\t\tif (cached !== undefined) {\n\t\t\t\tlet cachedHash = cached;\n\t\t\t\t// Apply maxLength if specified\n\t\t\t\tif (options?.maxLength && cachedHash.length > options.maxLength) {\n\t\t\t\t\tcachedHash = cachedHash.substring(0, options.maxLength);\n\t\t\t\t}\n\n\t\t\t\t// After hook - run even on cache hits for consistent behavior\n\t\t\t\tconst result = {\n\t\t\t\t\thash: cachedHash,\n\t\t\t\t\tdata: context.data,\n\t\t\t\t\talgorithm,\n\t\t\t\t};\n\t\t\t\tthis.hookSync(\"after:toHashSync\", result);\n\n\t\t\t\treturn result.hash;\n\t\t\t}\n\t\t}\n\n\t\t// Convert the string to a Uint8Array\n\t\tconst encoder = new TextEncoder();\n\t\tconst dataBuffer = encoder.encode(stringified);\n\n\t\t// Get the provider for the specified algorithm\n\t\tlet provider = this._providers.get(algorithm);\n\t\tif (!provider) {\n\t\t\t// Emit warning for invalid algorithm\n\t\t\tthis.emit(\n\t\t\t\t\"warn\",\n\t\t\t\t`Invalid algorithm '${algorithm}' not found. Falling back to default algorithm '${this._defaultAlgorithmSync}'.`,\n\t\t\t);\n\n\t\t\t// Fallback to default sync algorithm\n\t\t\tprovider = this._providers.get(this._defaultAlgorithmSync);\n\n\t\t\t// If default algorithm is also not found, throw error\n\t\t\tif (!provider) {\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`Hash provider '${this._defaultAlgorithmSync}' (default) not found`,\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\n\t\t// Check if provider supports synchronous hashing\n\t\tif (!provider.toHashSync) {\n\t\t\tthrow new Error(\n\t\t\t\t`Hash provider '${algorithm}' does not support synchronous hashing. Use toHash() instead or choose a different algorithm (djb2, fnv1, murmur, crc32).`,\n\t\t\t);\n\t\t}\n\n\t\t// Use the provider to hash the data synchronously\n\t\tlet hash = provider.toHashSync(dataBuffer);\n\n\t\t// Store the full hash in cache before truncation\n\t\tif (this._cache.enabled) {\n\t\t\tthis._cache.set(cacheKey, hash);\n\t\t}\n\n\t\t// if there is a max then change the hash\n\t\tif (options?.maxLength && hash.length > options?.maxLength) {\n\t\t\thash = hash.substring(0, options.maxLength);\n\t\t}\n\n\t\t// After hook - allows modification/logging of result (synchronous/blocking)\n\t\tconst result = { hash, data: context.data, algorithm: context.algorithm };\n\t\tthis.hookSync(\"after:toHashSync\", result);\n\n\t\treturn result.hash;\n\t}\n\n\t/**\n\t * Generates a deterministic number within a specified range based on the hash of the provided data synchronously.\n\t * This method uses the toHashSync function to create a consistent hash, then maps it to a number\n\t * between min and max (inclusive).\n\t *\n\t * Note: This method only works with synchronous hash providers (djb2, fnv1, murmur, crc32).\n\t *\n\t * @param data - The data to hash (will be stringified before hashing)\n\t * @param options - Configuration options (optional, defaults to min: 0, max: 100)\n\t * @param options.min - The minimum value of the range (inclusive, defaults to 0)\n\t * @param options.max - The maximum value of the range (inclusive, defaults to 100)\n\t * @param options.algorithm - The hash algorithm to use (defaults to 'djb2')\n\t * @param options.hashLength - Number of characters from hash to use for conversion (defaults to 16)\n\t * @returns A number between min and max (inclusive)\n\t *\n\t * @throws {Error} If the specified algorithm does not support synchronous hashing\n\t * @throws {Error} If min is greater than max\n\t *\n\t * @example\n\t * ```ts\n\t * const hashery = new Hashery();\n\t * const num = hashery.toNumberSync({ user: 'john' }); // Uses default min: 0, max: 100\n\t * console.log(num); // Always returns the same number for the same input, e.g., 42\n\t *\n\t * // Using custom range\n\t * const num2 = hashery.toNumberSync({ user: 'john' }, { min: 1, max: 100 });\n\t *\n\t * // Using a different algorithm\n\t * const numFnv1 = hashery.toNumberSync({ user: 'john' }, { min: 0, max: 255, algorithm: 'fnv1' });\n\t * ```\n\t */\n\tpublic toNumberSync(\n\t\tdata: unknown,\n\t\toptions: HasheryToNumberSyncOptions = {},\n\t): number {\n\t\tconst {\n\t\t\tmin = 0,\n\t\t\tmax = 100,\n\t\t\talgorithm = this._defaultAlgorithmSync,\n\t\t\thashLength = 16,\n\t\t} = options;\n\n\t\tif (min > max) {\n\t\t\tthrow new Error(\"min cannot be greater than max\");\n\t\t}\n\n\t\t// Get the hash as a hex string\n\t\t// Take the first hashLength characters of the hash to convert to a number\n\t\t// This provides good distribution while avoiding precision issues with JavaScript numbers\n\t\tconst hash = this.toHashSync(data, { algorithm, maxLength: hashLength });\n\n\t\t// Convert hex to a number\n\t\tconst hashNumber = Number.parseInt(hash, 16);\n\n\t\t// Map the hash number to the desired range\n\t\tconst range = max - min + 1;\n\t\tconst mapped = min + (hashNumber % range);\n\n\t\treturn mapped;\n\t}\n\n\tpublic loadProviders(\n\t\tproviders?: Array<HashProvider>,\n\t\toptions: HasheryLoadProviderOptions = { includeBase: true },\n\t): void {\n\t\tif (providers) {\n\t\t\tfor (const provider of providers) {\n\t\t\t\tthis._providers.add(provider);\n\t\t\t}\n\t\t}\n\n\t\t// load all the providers\n\t\tif (options.includeBase) {\n\t\t\tthis.providers.add(new WebCrypto({ algorithm: \"SHA-256\" }));\n\t\t\tthis.providers.add(new WebCrypto({ algorithm: \"SHA-384\" }));\n\t\t\tthis.providers.add(new WebCrypto({ algorithm: \"SHA-512\" }));\n\t\t\tthis.providers.add(new CRC());\n\t\t\tthis.providers.add(new DJB2());\n\t\t\tthis.providers.add(new FNV1());\n\t\t\tthis.providers.add(new Murmur());\n\t\t}\n\t}\n}\n\n// Types\nexport type { CacheOptions } from \"./cache.js\";\n// Classes\nexport { Cache } from \"./cache.js\";\nexport { CRC } from \"./providers/crc.js\";\nexport type { WebCryptoOptions } from \"./providers/crypto.js\";\nexport { WebCrypto } from \"./providers/crypto.js\";\nexport { DJB2 } from \"./providers/djb2.js\";\nexport { FNV1 } from \"./providers/fnv1.js\";\nexport { Murmur } from \"./providers/murmur.js\";\nexport { HashProviders } from \"./providers.js\";\nexport type {\n\tHashAlgorithm,\n\tHasheryLoadProviderOptions,\n\tHasheryOptions,\n\tHasheryToHashOptions,\n\tHasheryToHashSyncOptions,\n\tHasheryToNumberOptions,\n\tHasheryToNumberSyncOptions,\n\tHashProvider,\n\tHashProvidersGetOptions,\n\tHashProvidersOptions,\n\tParseFn,\n\tStringifyFn,\n\tWebCryptoHashAlgorithm,\n} from \"./types.js\";\n"],"mappings":"uLACA,IAAIA,EAAa,KAAM,CAOrB,YAAYC,EAAS,CANrBC,EAAA,wBACAA,EAAA,sBACAA,EAAA,gBACAA,EAAA,yBAAoB,IACpBA,EAAA,8BAAyB,IACzBA,EAAA,mBAAc,SAEZ,KAAK,gBAAkC,IAAI,IAC3C,KAAK,cAAgB,IACrB,KAAK,QAAUD,GAAS,OACpBA,GAAS,mBAAqB,SAChC,KAAK,kBAAoBA,EAAQ,kBAE/BA,GAAS,wBAA0B,SACrC,KAAK,uBAAyBA,EAAQ,sBAE1C,CAKA,IAAI,QAAS,CACX,OAAO,KAAK,OACd,CAKA,IAAI,OAAOE,EAAQ,CACjB,KAAK,QAAUA,CACjB,CAKA,IAAI,kBAAmB,CACrB,OAAO,KAAK,iBACd,CAKA,IAAI,iBAAiBC,EAAO,CAC1B,KAAK,kBAAoBA,CAC3B,CAKA,IAAI,uBAAwB,CAC1B,OAAO,KAAK,sBACd,CAKA,IAAI,sBAAsBA,EAAO,CAC/B,KAAK,uBAAyBA,CAChC,CAOA,KAAKC,EAAWC,EAAU,CACxB,IAAMC,EAAe,IAAIC,IAAe,CACtC,KAAK,IAAIH,EAAWE,CAAY,EAChCD,EAAS,GAAGE,CAAU,CACxB,EACA,YAAK,GAAGH,EAAWE,CAAY,EACxB,IACT,CAMA,cAAcF,EAAW,CACvB,GAAIA,IAAc,OAChB,OAAO,KAAK,gBAAgB,EAAE,OAEhC,IAAMI,EAAY,KAAK,gBAAgB,IAAIJ,CAAS,EACpD,OAAOI,EAAYA,EAAU,OAAS,CACxC,CAKA,YAAa,CACX,MAAO,CAAC,GAAG,KAAK,gBAAgB,KAAK,CAAC,CACxC,CAMA,aAAaC,EAAO,CAClB,OAAIA,IAAU,OACL,KAAK,gBAAgB,EAEvB,KAAK,gBAAgB,IAAIA,CAAK,GAAK,CAAC,CAC7C,CAOA,gBAAgBL,EAAWC,EAAU,CACnC,IAAMG,EAAY,KAAK,gBAAgB,IAAIJ,CAAS,GAAK,CAAC,EAC1D,OAAAI,EAAU,QAAQH,CAAQ,EAC1B,KAAK,gBAAgB,IAAID,EAAWI,CAAS,EACtC,IACT,CAOA,oBAAoBJ,EAAWC,EAAU,CACvC,IAAMC,EAAe,IAAIC,IAAe,CACtC,KAAK,IAAIH,EAAWE,CAAY,EAChCD,EAAS,GAAGE,CAAU,CACxB,EACA,YAAK,gBAAgBH,EAAWE,CAAY,EACrC,IACT,CAKA,cAAe,CACb,OAAO,KAAK,aACd,CAOA,YAAYG,EAAOJ,EAAU,CAC3B,YAAK,GAAGI,EAAOJ,CAAQ,EAChB,IACT,CAOA,GAAGI,EAAOJ,EAAU,CACb,KAAK,gBAAgB,IAAII,CAAK,GACjC,KAAK,gBAAgB,IAAIA,EAAO,CAAC,CAAC,EAEpC,IAAMD,EAAY,KAAK,gBAAgB,IAAIC,CAAK,EAChD,OAAID,IACEA,EAAU,QAAU,KAAK,eAC3B,QAAQ,KACN,qEAAqEA,EAAU,OAAS,CAAC,IAAIC,CAAK,4DACpG,EAEFD,EAAU,KAAKH,CAAQ,GAElB,IACT,CAOA,eAAeI,EAAOJ,EAAU,CAC9B,YAAK,IAAII,EAAOJ,CAAQ,EACjB,IACT,CAOA,IAAII,EAAOJ,EAAU,CACnB,IAAMG,EAAY,KAAK,gBAAgB,IAAIC,CAAK,GAAK,CAAC,EAChDC,EAAQF,EAAU,QAAQH,CAAQ,EACxC,OAAIK,IAAU,IACZF,EAAU,OAAOE,EAAO,CAAC,EAEvBF,EAAU,SAAW,GACvB,KAAK,gBAAgB,OAAOC,CAAK,EAE5B,IACT,CAOA,KAAKA,KAAUF,EAAY,CACzB,IAAII,EAAS,GACPH,EAAY,KAAK,gBAAgB,IAAIC,CAAK,EAChD,GAAID,GAAaA,EAAU,OAAS,EAClC,QAAWH,KAAYG,EACrBH,EAAS,GAAGE,CAAU,EACtBI,EAAS,GAGb,GAAIF,IAAU,KAAK,YAAa,CAC9B,IAAMG,EAAQL,EAAW,CAAC,YAAa,MAAQA,EAAW,CAAC,EAAI,IAAI,MAAM,GAAGA,EAAW,CAAC,CAAC,EAAE,EAC3F,GAAI,KAAK,mBAAqB,CAACI,EAC7B,MAAMC,EAEN,GAAI,KAAK,UAAU,KAAK,WAAW,EAAE,SAAW,GAAK,KAAK,yBAA2B,GACnF,MAAMA,CAGZ,CACA,YAAK,QAAQH,EAAOF,CAAU,EACvBI,CACT,CAMA,UAAUF,EAAO,CACf,OAAO,KAAK,gBAAgB,IAAIA,CAAK,GAAK,CAAC,CAC7C,CAMA,mBAAmBA,EAAO,CACxB,OAAIA,IAAU,OACZ,KAAK,gBAAgB,OAAOA,CAAK,EAEjC,KAAK,gBAAgB,MAAM,EAEtB,IACT,CAMA,gBAAgBI,EAAG,CACjB,KAAK,cAAgBA,EACrB,QAAWL,KAAa,KAAK,gBAAgB,OAAO,EAC9CA,EAAU,OAASK,GACrBL,EAAU,OAAOK,CAAC,CAGxB,CAKA,iBAAkB,CAChB,IAAIF,EAAS,CAAC,EACd,QAAWH,KAAa,KAAK,gBAAgB,OAAO,EAClDG,EAAS,CAAC,GAAGA,EAAQ,GAAGH,CAAS,EAEnC,OAAOG,CACT,CAMA,QAAQP,EAAWU,EAAM,CACvB,GAAI,CAAC,KAAK,QACR,OAEF,IAAIC,EAYJ,OAXI,OAAOD,GAAS,SAClBC,EAAUD,EACD,MAAM,QAAQA,CAAI,GAAKA,EAAK,OAAS,GAAKA,EAAK,CAAC,YAAa,MACtEC,EAAUD,EAAK,CAAC,EAAE,QACTA,aAAgB,MACzBC,EAAUD,EAAK,QACN,MAAM,QAAQA,CAAI,GAAKA,EAAK,OAAS,GAAK,OAAOA,EAAK,CAAC,GAAG,SAAY,SAC/EC,EAAUD,EAAK,CAAC,EAAE,QAElBC,EAAU,KAAK,UAAUD,CAAI,EAEvBV,EAAW,CACjB,IAAK,QAAS,CACZ,KAAK,QAAQ,QAAQW,EAAS,CAAE,MAAOX,EAAW,KAAAU,CAAK,CAAC,EACxD,KACF,CACA,IAAK,OAAQ,CACX,KAAK,QAAQ,OAAOC,EAAS,CAAE,MAAOX,EAAW,KAAAU,CAAK,CAAC,EACvD,KACF,CACA,IAAK,QAAS,CACZ,KAAK,QAAQ,QAAQC,EAAS,CAAE,MAAOX,EAAW,KAAAU,CAAK,CAAC,EACxD,KACF,CACA,IAAK,QAAS,CACZ,KAAK,QAAQ,QAAQC,EAAS,CAAE,MAAOX,EAAW,KAAAU,CAAK,CAAC,EACxD,KACF,CACA,IAAK,QAAS,CACZ,KAAK,QAAQ,QAAQC,EAAS,CAAE,MAAOX,EAAW,KAAAU,CAAK,CAAC,EACxD,KACF,CACA,QAAS,CACP,KAAK,QAAQ,OAAOC,EAAS,CAAE,MAAOX,EAAW,KAAAU,CAAK,CAAC,EACvD,KACF,CACF,CACF,CACF,EAGIE,EAAY,cAAcjB,CAAW,CAMvC,YAAYC,EAAS,CACnB,MAAM,CACJ,OAAQA,GAAS,OACjB,iBAAkBA,GAAS,iBAC3B,sBAAuBA,GAAS,qBAClC,CAAC,EAVHC,EAAA,eACAA,EAAA,yBAAoB,IACpBA,EAAA,2BAAsB,IACtBA,EAAA,yBACAA,EAAA,wBAAmB,IAOjB,KAAK,OAAyB,IAAI,IAClC,KAAK,iBAAmBD,GAAS,gBAAkB,IAAI,IAAIA,EAAQ,eAAe,EAAoB,IAAI,IACtGA,GAAS,mBAAqB,OAChC,KAAK,kBAAoBA,EAAQ,iBACxBA,GAAS,kBAAoB,SACtC,KAAK,kBAAoBA,EAAQ,iBAE/BA,GAAS,qBAAuB,SAClC,KAAK,oBAAsBA,EAAQ,oBAEjCA,GAAS,kBAAoB,SAC/B,KAAK,iBAAmBA,EAAQ,gBAEpC,CAKA,IAAI,OAAQ,CACV,OAAO,KAAK,MACd,CAMA,IAAI,iBAAkB,CACpB,OAAO,KAAK,iBACd,CAMA,IAAI,gBAAgBG,EAAO,CACzB,KAAK,kBAAoBA,CAC3B,CAKA,IAAI,kBAAmB,CACrB,OAAO,KAAK,iBACd,CAKA,IAAI,iBAAiBA,EAAO,CAC1B,KAAK,kBAAoBA,CAC3B,CAMA,IAAI,oBAAqB,CACvB,OAAO,KAAK,mBACd,CAKA,IAAI,mBAAmBA,EAAO,CAC5B,KAAK,oBAAsBA,CAC7B,CAKA,IAAI,iBAAkB,CACpB,OAAO,KAAK,gBACd,CAKA,IAAI,gBAAgBA,EAAO,CACzB,KAAK,iBAAmBA,CAC1B,CAKA,IAAI,iBAAkB,CACpB,OAAO,KAAK,gBACd,CAKA,IAAI,gBAAgBA,EAAO,CACzB,KAAK,iBAAmBA,CAC1B,CAMA,iBAAiBM,EAAO,CACtB,GAAI,KAAK,oBAAqB,CAC5B,IAAMQ,EAAaR,EAAM,KAAK,EAAE,kBAAkB,EAClD,GAAI,CAACQ,EAAW,WAAW,QAAQ,GAAK,CAACA,EAAW,WAAW,OAAO,EACpE,MAAM,IAAI,MACR,eAAeR,CAAK,0EACtB,CAEJ,CACF,CAMA,oBAAoBA,EAAO,CACzB,GAAI,KAAK,iBAAiB,IAAIA,CAAK,EAAG,CACpC,IAAMM,EAAU,KAAK,iBAAiB,IAAIN,CAAK,EACzCS,EAAiB,SAAST,CAAK,kBAAkBM,EAAU,KAAKA,CAAO,GAAK,EAAE,GACpF,YAAK,KAAK,OAAQ,CAAE,KAAMN,EAAO,QAASS,CAAe,CAAC,EACnD,KAAK,gBACd,CACA,MAAO,EACT,CAOA,OAAOT,EAAOU,EAAS,CACrB,KAAK,YAAY,CAAE,MAAAV,EAAO,QAAAU,CAAQ,CAAC,CACrC,CAMA,YAAYC,EAAW,CAErB,GADA,KAAK,iBAAiBA,EAAU,KAAK,EACjC,CAAC,KAAK,oBAAoBA,EAAU,KAAK,EAC3C,OAEF,IAAMC,EAAgB,KAAK,OAAO,IAAID,EAAU,KAAK,EACjDC,EACFA,EAAc,KAAKD,EAAU,OAAO,EAEpC,KAAK,OAAO,IAAIA,EAAU,MAAO,CAACA,EAAU,OAAO,CAAC,CAExD,CAOA,QAAQX,EAAOU,EAAS,CACtB,KAAK,YAAY,CAAE,MAAAV,EAAO,QAAAU,CAAQ,CAAC,CACrC,CAMA,QAAQG,EAAO,CACb,QAAWC,KAAQD,EACjB,KAAK,OAAOC,EAAK,MAAOA,EAAK,OAAO,CAExC,CAOA,YAAYd,EAAOU,EAAS,CAE1B,GADA,KAAK,iBAAiBV,CAAK,EACvB,CAAC,KAAK,oBAAoBA,CAAK,EACjC,OAEF,IAAMY,EAAgB,KAAK,OAAO,IAAIZ,CAAK,EACvCY,EACFA,EAAc,QAAQF,CAAO,EAE7B,KAAK,OAAO,IAAIV,EAAO,CAACU,CAAO,CAAC,CAEpC,CAMA,gBAAgBV,EAAOU,EAAS,CAE9B,GADA,KAAK,iBAAiBV,CAAK,EACvB,CAAC,KAAK,oBAAoBA,CAAK,EACjC,OAEF,IAAMc,EAAO,SAAUhB,KACrB,KAAK,WAAWE,EAAOc,CAAI,EACpBJ,EAAQ,GAAGZ,CAAU,GAE9B,KAAK,YAAYE,EAAOc,CAAI,CAC9B,CAMA,SAASd,EAAOU,EAAS,CAEvB,GADA,KAAK,iBAAiBV,CAAK,EACvB,CAAC,KAAK,oBAAoBA,CAAK,EACjC,OAEF,IAAMc,EAAO,SAAUhB,KACrB,KAAK,WAAWE,EAAOc,CAAI,EACpBJ,EAAQ,GAAGZ,CAAU,GAE9B,KAAK,OAAOE,EAAOc,CAAI,CACzB,CAOA,WAAWd,EAAOU,EAAS,CAEzB,GADA,KAAK,iBAAiBV,CAAK,EACvB,CAAC,KAAK,oBAAoBA,CAAK,EACjC,OAEF,IAAMY,EAAgB,KAAK,OAAO,IAAIZ,CAAK,EAC3C,GAAIY,EAAe,CACjB,IAAMX,EAAQW,EAAc,QAAQF,CAAO,EACvCT,IAAU,IACZW,EAAc,OAAOX,EAAO,CAAC,CAEjC,CACF,CAMA,YAAYY,EAAO,CACjB,QAAWC,KAAQD,EACjB,KAAK,WAAWC,EAAK,MAAOA,EAAK,OAAO,CAE5C,CAOA,MAAM,KAAKd,KAAUF,EAAY,CAE/B,GADA,KAAK,iBAAiBE,CAAK,EACvB,CAAC,KAAK,oBAAoBA,CAAK,EACjC,OAEF,IAAMY,EAAgB,KAAK,OAAO,IAAIZ,CAAK,EAC3C,GAAIY,EACF,QAAWF,KAAWE,EACpB,GAAI,CACF,MAAMF,EAAQ,GAAGZ,CAAU,CAC7B,OAASK,EAAO,CACd,IAAMG,EAAU,GAAGN,CAAK,KAAKG,EAAM,OAAO,GAE1C,GADA,KAAK,KAAK,QAAS,IAAI,MAAMG,CAAO,CAAC,EACjC,KAAK,kBACP,MAAM,IAAI,MAAMA,CAAO,CAE3B,CAGN,CAWA,SAASN,KAAUF,EAAY,CAE7B,GADA,KAAK,iBAAiBE,CAAK,EACvB,CAAC,KAAK,oBAAoBA,CAAK,EACjC,OAEF,IAAMY,EAAgB,KAAK,OAAO,IAAIZ,CAAK,EAC3C,GAAIY,GACF,QAAWF,KAAWE,EACpB,GAAIF,EAAQ,YAAY,OAAS,gBAGjC,GAAI,CACFA,EAAQ,GAAGZ,CAAU,CACvB,OAASK,EAAO,CACd,IAAMG,EAAU,GAAGN,CAAK,KAAKG,EAAM,OAAO,GAE1C,GADA,KAAK,KAAK,QAAS,IAAI,MAAMG,CAAO,CAAC,EACjC,KAAK,kBACP,MAAM,IAAI,MAAMA,CAAO,CAE3B,EAGN,CAMA,MAAM,WAAWN,KAAUF,EAAY,CACrC,MAAM,KAAK,KAAK,UAAUE,CAAK,GAAI,GAAGF,CAAU,CAClD,CAMA,MAAM,UAAUE,KAAUF,EAAY,CACpC,MAAM,KAAK,KAAK,SAASE,CAAK,GAAI,GAAGF,CAAU,CACjD,CAQA,MAAM,SAASE,KAAUF,EAAY,CACnC,MAAM,KAAK,KAAKE,EAAO,GAAGF,CAAU,CACtC,CAMA,SAASE,EAAO,CAEd,GADA,KAAK,iBAAiBA,CAAK,EACvB,EAAC,KAAK,oBAAoBA,CAAK,EAGnC,OAAO,KAAK,OAAO,IAAIA,CAAK,CAC9B,CAKA,YAAa,CACX,KAAK,OAAO,MAAM,CACpB,CACF,EC7oBO,IAAMe,EAAN,KAAY,CAMlB,YAAYC,EAAwB,CALpCC,EAAA,KAAQ,WAAW,IACnBA,EAAA,KAAQ,WAAW,KACnBA,EAAA,KAAQ,SAAS,IAAI,KACrBA,EAAA,KAAQ,QAAkB,CAAC,GAGtBD,GAAS,UAAY,SACxB,KAAK,SAAWA,EAAQ,SAGrBA,GAAS,UAAY,SACxB,KAAK,SAAWA,EAAQ,QAE1B,CAKA,IAAW,SAAmB,CAC7B,OAAO,KAAK,QACb,CAKA,IAAW,QAAQE,EAAgB,CAClC,KAAK,SAAWA,CACjB,CAKA,IAAW,SAAkB,CAC5B,OAAO,KAAK,QACb,CAKA,IAAW,QAAQA,EAAe,CACjC,KAAK,SAAWA,CACjB,CAKA,IAAW,OAA6B,CACvC,OAAO,KAAK,MACb,CAKA,IAAW,MAAe,CACzB,OAAO,KAAK,OAAO,IACpB,CAOO,IAAIC,EAAiC,CAC3C,OAAO,KAAK,OAAO,IAAIA,CAAG,CAC3B,CASO,IAAIA,EAAaD,EAAqB,CAC5C,GAAK,KAAK,SAKV,IAAI,KAAK,OAAO,IAAIC,CAAG,EAAG,CACzB,KAAK,OAAO,IAAIA,EAAKD,CAAK,EAC1B,MACD,CAGA,GAAI,KAAK,OAAO,MAAQ,KAAK,SAAU,CACtC,IAAME,EAAY,KAAK,MAAM,MAAM,EAE/BA,GACH,KAAK,OAAO,OAAOA,CAAS,CAE9B,CAGA,KAAK,MAAM,KAAKD,CAAG,EACnB,KAAK,OAAO,IAAIA,EAAKD,CAAK,EAC3B,CAOO,IAAIC,EAAsB,CAChC,OAAO,KAAK,OAAO,IAAIA,CAAG,CAC3B,CAKO,OAAc,CACpB,KAAK,OAAO,MAAM,EAClB,KAAK,MAAQ,CAAC,CACf,CACD,EC/IO,IAAME,EAAN,KAAkC,CACrC,IAAW,MAAe,CACtB,MAAO,OACX,CAEO,WAAWC,EAA4B,CAE1C,IAAIC,EAEJ,GAAID,aAAgB,WAChBC,EAAQD,UACDA,aAAgB,YACvBC,EAAQ,IAAI,WAAWD,CAAI,UACpBA,aAAgB,SACvBC,EAAQ,IAAI,WAAWD,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,MACjE,CACH,IAAME,EAAOF,EACbC,EAAQ,IAAI,WAAWC,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,CACxE,CAIA,IAAMC,EAAmB,WACrBC,EAAM,WAEV,QAASC,EAAI,EAAGA,EAAIJ,EAAM,OAAQI,IAAK,CACnCD,EAAMA,EAAMH,EAAMI,CAAC,EACnB,QAASC,EAAI,EAAGA,EAAI,EAAGA,IACnBF,EAAOA,IAAQ,EAAMD,EAAmB,EAAEC,EAAM,EAExD,CAGA,OAAAA,GAAOA,EAAM,cAAgB,EAGbA,EAAI,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAEpD,CAEA,MAAa,OAAOJ,EAAqC,CACrD,OAAO,KAAK,WAAWA,CAAI,CAC/B,CACJ,ECtCO,IAAMO,EAAN,KAAwC,CAE9C,YAAYC,EAA4B,CADxCC,EAAA,KAAQ,aAAqC,WAEzCD,GAAS,YACX,KAAK,WAAaA,GAAS,UAG7B,CAEA,IAAW,MAAe,CACzB,OAAO,KAAK,UACb,CAEA,MAAa,OAAOE,EAAqC,CAExD,IAAMC,EAAa,MAAM,OAAO,OAAO,OAAO,KAAK,WAAYD,CAAI,EAQnE,OALkB,MAAM,KAAK,IAAI,WAAWC,CAAU,CAAC,EAErD,IAAKC,GAASA,EAAK,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,EAChD,KAAK,EAAE,CAGV,CACD,ECRO,IAAMC,EAAN,KAAmC,CAIzC,IAAW,MAAe,CACzB,MAAO,MACR,CAgBO,WAAWC,EAA4B,CAE7C,IAAIC,EAEJ,GAAID,aAAgB,WACnBC,EAAQD,UACEA,aAAgB,YAC1BC,EAAQ,IAAI,WAAWD,CAAI,UACjBA,aAAgB,SAC1BC,EAAQ,IAAI,WAAWD,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,MAC9D,CAEN,IAAME,EAAOF,EACbC,EAAQ,IAAI,WAAWC,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,CACrE,CAIA,IAAIC,EAAO,KAGX,QAASC,EAAI,EAAGA,EAAIH,EAAM,OAAQG,IACjCD,GAASA,GAAQ,GAAKA,EAAQF,EAAMG,CAAC,EAErCD,EAAOA,IAAS,EAMjB,OAFgBA,EAAK,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAGlD,CAgBA,MAAa,OAAOH,EAAqC,CACxD,OAAO,KAAK,WAAWA,CAAI,CAC5B,CACD,ECnFO,IAAMK,EAAN,KAAmC,CAItC,IAAW,MAAe,CACtB,MAAO,MACX,CAQO,WAAWC,EAA4B,CAE1C,IAAIC,EAEJ,GAAID,aAAgB,WAChBC,EAAQD,UACDA,aAAgB,YACvBC,EAAQ,IAAI,WAAWD,CAAI,UACpBA,aAAgB,SACvBC,EAAQ,IAAI,WAAWD,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,MACjE,CAEH,IAAME,EAAOF,EACbC,EAAQ,IAAI,WAAWC,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,CACxE,CAGA,IAAMC,EAAmB,WACnBC,EAAY,SAGdC,EAAOF,EAGX,QAASG,EAAI,EAAGA,EAAIL,EAAM,OAAQK,IAC9BD,EAAOA,EAAOD,EACdC,EAAOA,EAAOJ,EAAMK,CAAC,EAErBD,EAAOA,IAAS,EAMpB,OAFgBA,EAAK,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAGrD,CAQA,MAAa,OAAOL,EAAqC,CACrD,OAAO,KAAK,WAAWA,CAAI,CAC/B,CACJ,ECjDO,IAAMO,EAAN,KAAqC,CAQ3C,YAAYC,EAAe,EAAG,CAP9BC,EAAA,KAAQ,SAQP,KAAK,MAAQD,IAAS,CACvB,CAKA,IAAW,MAAe,CACzB,MAAO,QACR,CAKA,IAAW,MAAe,CACzB,OAAO,KAAK,KACb,CAgBO,WAAWE,EAA4B,CAE7C,IAAIC,EAEJ,GAAID,aAAgB,WACnBC,EAAQD,UACEA,aAAgB,YAC1BC,EAAQ,IAAI,WAAWD,CAAI,UACjBA,aAAgB,SAC1BC,EAAQ,IAAI,WAAWD,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,MAC9D,CAEN,IAAME,EAAOF,EACbC,EAAQ,IAAI,WAAWC,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,CACrE,CAGA,IAAMC,EAAK,WACLC,EAAK,UACLC,EAASJ,EAAM,OACfK,EAAU,KAAK,MAAMD,EAAS,CAAC,EAEjCE,EAAK,KAAK,MAGd,QAASC,EAAI,EAAGA,EAAIF,EAASE,IAAK,CACjC,IAAMC,EAAQD,EAAI,EACdE,EACFT,EAAMQ,CAAK,EAAI,KACdR,EAAMQ,EAAQ,CAAC,EAAI,MAAS,GAC5BR,EAAMQ,EAAQ,CAAC,EAAI,MAAS,IAC5BR,EAAMQ,EAAQ,CAAC,EAAI,MAAS,GAE/BC,EAAK,KAAK,MAAMA,EAAIP,CAAE,EACtBO,EAAK,KAAK,QAAQA,EAAI,EAAE,EACxBA,EAAK,KAAK,MAAMA,EAAIN,CAAE,EAEtBG,GAAMG,EACNH,EAAK,KAAK,QAAQA,EAAI,EAAE,EACxBA,EAAK,KAAK,MAAMA,EAAI,CAAC,EAAI,UAC1B,CAGA,IAAMI,EAAOL,EAAU,EACnBI,EAAK,EAET,OAAQL,EAAS,EAAG,CACnB,IAAK,GACJK,IAAOT,EAAMU,EAAO,CAAC,EAAI,MAAS,GAEnC,IAAK,GACJD,IAAOT,EAAMU,EAAO,CAAC,EAAI,MAAS,EAEnC,IAAK,GACJD,GAAMT,EAAMU,CAAI,EAAI,IACpBD,EAAK,KAAK,MAAMA,EAAIP,CAAE,EACtBO,EAAK,KAAK,QAAQA,EAAI,EAAE,EACxBA,EAAK,KAAK,MAAMA,EAAIN,CAAE,EACtBG,GAAMG,CACR,CAGA,OAAAH,GAAMF,EAENE,GAAMA,IAAO,GACbA,EAAK,KAAK,MAAMA,EAAI,UAAU,EAC9BA,GAAMA,IAAO,GACbA,EAAK,KAAK,MAAMA,EAAI,UAAU,EAC9BA,GAAMA,IAAO,GAGbA,EAAKA,IAAO,EAGIA,EAAG,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAGhD,CAgBA,MAAa,OAAOP,EAAqC,CACxD,OAAO,KAAK,WAAWA,CAAI,CAC5B,CAMQ,MAAMY,EAAWC,EAAmB,CAG3C,GAAI,KAAK,KACR,OAAO,KAAK,KAAKD,EAAGC,CAAC,EAKtB,IAAMC,EAAMF,IAAM,GAAM,MAExB,IAAMG,EAAKH,EAAI,MAEf,IAAMI,EAAMH,IAAM,GAAM,MAExB,IAAMI,EAAKJ,EAAI,MAGf,OAASE,EAAKE,GAASH,EAAKG,EAAKF,EAAKC,GAAO,KAAQ,GAAM,CAC5D,CAMQ,QAAQE,EAAW,EAAmB,CAC7C,OAAQA,GAAK,EAAMA,IAAO,GAAK,CAChC,CACD,ECvLO,IAAMC,EAAN,KAAoB,CAc1B,YAAYC,EAAgC,CAb5CC,EAAA,KAAQ,aAAwC,IAAI,KACpDA,EAAA,KAAQ,YAAY,IAafD,GAAS,WACZ,KAAK,cAAcA,GAAS,SAAS,EAGlCA,GAAS,WAAa,SACzB,KAAK,UAAY,EAAQA,GAAS,SAEpC,CAeO,cAAcE,EAAgC,CACpD,QAAWC,KAAYD,EACtB,KAAK,WAAW,IAAIC,EAAS,KAAMA,CAAQ,CAE7C,CAMA,IAAW,WAAuC,CACjD,OAAO,KAAK,UACb,CAMA,IAAW,UAAUD,EAAsC,CAC1D,KAAK,WAAaA,CACnB,CAaA,IAAW,OAAuB,CACjC,OAAO,MAAM,KAAK,KAAK,WAAW,KAAK,CAAC,CACzC,CAgCO,IACNE,EACAJ,EAC2B,CAE3B,IAAMK,EAAWL,GAAS,OAAS,KAAK,UAGxCI,EAAOA,EAAK,KAAK,EAEjB,IAAIE,EAAS,KAAK,WAAW,IAAIF,CAAI,EAGrC,OAAIE,IAAW,QAAaD,IAAa,KACxCD,EAAOA,EAAK,YAAY,EACxBE,EAAS,KAAK,WAAW,IAAIF,CAAI,GAI9BE,IAAW,QAAaD,IAAa,KACxCD,EAAOA,EAAK,WAAW,IAAK,EAAE,EAC9BE,EAAS,KAAK,WAAW,IAAIF,CAAI,GAG3BE,CACR,CAkBO,IAAIH,EAA8B,CACxC,KAAK,WAAW,IAAIA,EAAS,KAAMA,CAAQ,CAC5C,CAcO,OAAOC,EAAuB,CACpC,OAAO,KAAK,WAAW,OAAOA,CAAI,CACnC,CACD,EC3JO,IAAMG,EAAN,cAAsBC,CAAU,CAQtC,YAAYC,EAA0B,CACrC,MAAMA,CAAO,EARdC,EAAA,KAAQ,SAAkB,KAAK,OAC/BA,EAAA,KAAQ,aAA0B,KAAK,WACvCA,EAAA,KAAQ,aAAa,IAAIC,GACzBD,EAAA,KAAQ,oBAA4B,WACpCA,EAAA,KAAQ,wBAAgC,QACxCA,EAAA,KAAQ,UAKHD,GAAS,QACZ,KAAK,OAASA,EAAQ,OAGnBA,GAAS,YACZ,KAAK,WAAaA,EAAQ,WAGvBA,GAAS,mBACZ,KAAK,kBAAoBA,EAAQ,kBAG9BA,GAAS,uBACZ,KAAK,sBAAwBA,EAAQ,sBAGtC,KAAK,OAAS,IAAIG,EAAMH,GAAS,KAAK,EAEtC,KAAK,cAAcA,GAAS,UAAW,CACtC,YAAaA,GAAS,aAAe,EACtC,CAAC,CACF,CAMA,IAAW,OAAiB,CAC3B,OAAO,KAAK,MACb,CAMA,IAAW,MAAMI,EAAgB,CAChC,KAAK,OAASA,CACf,CAMA,IAAW,WAAyB,CACnC,OAAO,KAAK,UACb,CAMA,IAAW,UAAUA,EAAoB,CACxC,KAAK,WAAaA,CACnB,CAMA,IAAW,WAA2B,CACrC,OAAO,KAAK,UACb,CAMA,IAAW,UAAUA,EAAsB,CAC1C,KAAK,WAAaA,CACnB,CAMA,IAAW,OAAuB,CACjC,OAAO,KAAK,WAAW,KACxB,CAMA,IAAW,kBAA2B,CACrC,OAAO,KAAK,iBACb,CAcA,IAAW,iBAAiBA,EAAe,CAC1C,KAAK,kBAAoBA,CAC1B,CAMA,IAAW,sBAA+B,CACzC,OAAO,KAAK,qBACb,CAaA,IAAW,qBAAqBA,EAAe,CAC9C,KAAK,sBAAwBA,CAC9B,CAeA,IAAW,OAAe,CACzB,OAAO,KAAK,MACb,CA4BA,MAAa,OACZC,EACAL,EACkB,CAElB,IAAMM,EAAU,CACf,KAAAD,EACA,UAAWL,GAAS,WAAa,KAAK,kBACtC,UAAWA,GAAS,SACrB,EACA,MAAM,KAAK,WAAW,SAAUM,CAAO,EAGvC,IAAMC,EAAc,KAAK,WAAWD,EAAQ,IAAI,EAG1CE,EAAW,GAAGF,EAAQ,SAAS,IAAIC,CAAW,GACpD,GAAI,KAAK,OAAO,QAAS,CACxB,IAAME,EAAS,KAAK,OAAO,IAAID,CAAQ,EACvC,GAAIC,IAAW,OAAW,CACzB,IAAIC,EAAaD,EAEbT,GAAS,WAAaU,EAAW,OAASV,EAAQ,YACrDU,EAAaA,EAAW,UAAU,EAAGV,EAAQ,SAAS,GAIvD,IAAMW,EAAS,CACd,KAAMD,EACN,KAAMJ,EAAQ,KACd,UAAWA,EAAQ,SACpB,EACA,aAAM,KAAK,UAAU,SAAUK,CAAM,EAE9BA,EAAO,IACf,CACD,CAIA,IAAMC,EADU,IAAI,YAAY,EACL,OAAOL,CAAW,EAGzCM,EAAW,KAAK,WAAW,IAAIP,EAAQ,SAAS,EAC/CO,IAEJ,KAAK,KACJ,OACA,sBAAsBP,EAAQ,SAAS,mDAAmD,KAAK,iBAAiB,IACjH,EAEAO,EAAW,IAAIC,EAAU,CACxB,UAAW,KAAK,iBACjB,CAAC,GAIF,IAAIC,EAAO,MAAMF,EAAS,OAAOD,CAAU,EAGvC,KAAK,OAAO,SACf,KAAK,OAAO,IAAIJ,EAAUO,CAAI,EAI3Bf,GAAS,WAAae,EAAK,OAASf,GAAS,YAChDe,EAAOA,EAAK,UAAU,EAAGf,EAAQ,SAAS,GAI3C,IAAMW,EAAS,CAAE,KAAAI,EAAM,KAAMT,EAAQ,KAAM,UAAWA,EAAQ,SAAU,EACxE,aAAM,KAAK,UAAU,SAAUK,CAAM,EAE9BA,EAAO,IACf,CA4BA,MAAa,SACZN,EACAL,EAAkC,CAAC,EACjB,CAClB,GAAM,CACL,IAAAgB,EAAM,EACN,IAAAC,EAAM,IACN,UAAAC,EAAY,KAAK,kBACjB,WAAAC,EAAa,EACd,EAAInB,EAEJ,GAAIgB,EAAMC,EACT,MAAM,IAAI,MAAM,gCAAgC,EAMjD,IAAMF,EAAO,MAAM,KAAK,OAAOV,EAAM,CAAE,UAAAa,EAAW,UAAWC,CAAW,CAAC,EAGnEC,EAAa,OAAO,SAASL,EAAM,EAAE,EAGrCM,EAAQJ,EAAMD,EAAM,EAG1B,OAFeA,EAAOI,EAAaC,CAGpC,CAkCO,WAAWhB,EAAeL,EAA4C,CAE5E,IAAMM,EAAU,CACf,KAAAD,EACA,UAAWL,GAAS,WAAa,KAAK,sBACtC,UAAWA,GAAS,SACrB,EACA,KAAK,SAAS,oBAAqBM,CAAO,EAG1C,IAAMY,EAAYZ,EAAQ,UAGpBC,EAAc,KAAK,WAAWD,EAAQ,IAAI,EAG1CE,EAAW,GAAGU,CAAS,IAAIX,CAAW,GAC5C,GAAI,KAAK,OAAO,QAAS,CACxB,IAAME,EAAS,KAAK,OAAO,IAAID,CAAQ,EACvC,GAAIC,IAAW,OAAW,CACzB,IAAIC,EAAaD,EAEbT,GAAS,WAAaU,EAAW,OAASV,EAAQ,YACrDU,EAAaA,EAAW,UAAU,EAAGV,EAAQ,SAAS,GAIvD,IAAMW,EAAS,CACd,KAAMD,EACN,KAAMJ,EAAQ,KACd,UAAAY,CACD,EACA,YAAK,SAAS,mBAAoBP,CAAM,EAEjCA,EAAO,IACf,CACD,CAIA,IAAMC,EADU,IAAI,YAAY,EACL,OAAOL,CAAW,EAGzCM,EAAW,KAAK,WAAW,IAAIK,CAAS,EAC5C,GAAI,CAACL,IAEJ,KAAK,KACJ,OACA,sBAAsBK,CAAS,mDAAmD,KAAK,qBAAqB,IAC7G,EAGAL,EAAW,KAAK,WAAW,IAAI,KAAK,qBAAqB,EAGrD,CAACA,GACJ,MAAM,IAAI,MACT,kBAAkB,KAAK,qBAAqB,uBAC7C,EAKF,GAAI,CAACA,EAAS,WACb,MAAM,IAAI,MACT,kBAAkBK,CAAS,2HAC5B,EAID,IAAIH,EAAOF,EAAS,WAAWD,CAAU,EAGrC,KAAK,OAAO,SACf,KAAK,OAAO,IAAIJ,EAAUO,CAAI,EAI3Bf,GAAS,WAAae,EAAK,OAASf,GAAS,YAChDe,EAAOA,EAAK,UAAU,EAAGf,EAAQ,SAAS,GAI3C,IAAMW,EAAS,CAAE,KAAAI,EAAM,KAAMT,EAAQ,KAAM,UAAWA,EAAQ,SAAU,EACxE,YAAK,SAAS,mBAAoBK,CAAM,EAEjCA,EAAO,IACf,CAiCO,aACNN,EACAL,EAAsC,CAAC,EAC9B,CACT,GAAM,CACL,IAAAgB,EAAM,EACN,IAAAC,EAAM,IACN,UAAAC,EAAY,KAAK,sBACjB,WAAAC,EAAa,EACd,EAAInB,EAEJ,GAAIgB,EAAMC,EACT,MAAM,IAAI,MAAM,gCAAgC,EAMjD,IAAMF,EAAO,KAAK,WAAWV,EAAM,CAAE,UAAAa,EAAW,UAAWC,CAAW,CAAC,EAGjEC,EAAa,OAAO,SAASL,EAAM,EAAE,EAGrCM,EAAQJ,EAAMD,EAAM,EAG1B,OAFeA,EAAOI,EAAaC,CAGpC,CAEO,cACNC,EACAtB,EAAsC,CAAE,YAAa,EAAK,EACnD,CACP,GAAIsB,EACH,QAAWT,KAAYS,EACtB,KAAK,WAAW,IAAIT,CAAQ,EAK1Bb,EAAQ,cACX,KAAK,UAAU,IAAI,IAAIc,EAAU,CAAE,UAAW,SAAU,CAAC,CAAC,EAC1D,KAAK,UAAU,IAAI,IAAIA,EAAU,CAAE,UAAW,SAAU,CAAC,CAAC,EAC1D,KAAK,UAAU,IAAI,IAAIA,EAAU,CAAE,UAAW,SAAU,CAAC,CAAC,EAC1D,KAAK,UAAU,IAAI,IAAIS,CAAK,EAC5B,KAAK,UAAU,IAAI,IAAIC,CAAM,EAC7B,KAAK,UAAU,IAAI,IAAIC,CAAM,EAC7B,KAAK,UAAU,IAAI,IAAIC,CAAQ,EAEjC,CACD","names":["Eventified","options","__publicField","logger","value","eventName","listener","onceListener","arguments_","listeners","event","index","result","error","n","data","message","Hookified","eventValue","warningMessage","handler","hookEntry","eventHandlers","hooks","hook","Cache","options","__publicField","value","key","oldestKey","CRC","data","bytes","view","CRC32_POLYNOMIAL","crc","i","j","WebCrypto","options","__publicField","data","hashBuffer","byte","DJB2","data","bytes","view","hash","i","FNV1","data","bytes","view","FNV_OFFSET_BASIS","FNV_PRIME","hash","i","Murmur","seed","__publicField","data","bytes","view","c1","c2","length","nblocks","h1","i","index","k1","tail","a","b","ah","al","bh","bl","x","HashProviders","options","__publicField","providers","provider","name","getFuzzy","result","Hashery","Hookified","options","__publicField","HashProviders","Cache","value","data","context","stringified","cacheKey","cached","cachedHash","result","dataBuffer","provider","WebCrypto","hash","min","max","algorithm","hashLength","hashNumber","range","providers","CRC","DJB2","FNV1","Murmur"]}

package/node_modules/.pnpm/@keyv+bigmap@1.3.1_keyv@5.6.0/node_modules/hashery/dist/browser/index.js

@@ -1,3 +0,0 @@
-var w=Object.defineProperty;var P=(u,e,t)=>e in u?w(u,e,{enumerable:!0,configurable:!0,writable:!0,value:t}):u[e]=t;var h=(u,e,t)=>P(u,typeof e!="symbol"?e+"":e,t);import{Hookified as O}from"hookified";var y=class{constructor(e){h(this,"_enabled",!0);h(this,"_maxSize",4e3);h(this,"_store",new Map);h(this,"_keys",[]);e?.enabled!==void 0&&(this._enabled=e.enabled),e?.maxSize!==void 0&&(this._maxSize=e.maxSize)}get enabled(){return this._enabled}set enabled(e){this._enabled=e}get maxSize(){return this._maxSize}set maxSize(e){this._maxSize=e}get store(){return this._store}get size(){return this._store.size}get(e){return this._store.get(e)}set(e,t){if(this._enabled){if(this._store.has(e)){this._store.set(e,t);return}if(this._store.size>=this._maxSize){let i=this._keys.shift();i&&this._store.delete(i)}this._keys.push(e),this._store.set(e,t)}}has(e){return this._store.has(e)}clear(){this._store.clear(),this._keys=[]}};var b=class{get name(){return"crc32"}toHashSync(e){let t;if(e instanceof Uint8Array)t=e;else if(e instanceof ArrayBuffer)t=new Uint8Array(e);else if(e instanceof DataView)t=new Uint8Array(e.buffer,e.byteOffset,e.byteLength);else{let o=e;t=new Uint8Array(o.buffer,o.byteOffset,o.byteLength)}let i=3988292384,r=4294967295;for(let o=0;o<t.length;o++){r=r^t[o];for(let n=0;n<8;n++)r=r>>>1^i&-(r&1)}return r=(r^4294967295)>>>0,r.toString(16).padStart(8,"0")}async toHash(e){return this.toHashSync(e)}};var p=class{constructor(e){h(this,"_algorithm","SHA-256");e?.algorithm&&(this._algorithm=e?.algorithm)}get name(){return this._algorithm}async toHash(e){let t=await crypto.subtle.digest(this._algorithm,e);return Array.from(new Uint8Array(t)).map(s=>s.toString(16).padStart(2,"0")).join("")}};var H=class{get name(){return"djb2"}toHashSync(e){let t;if(e instanceof Uint8Array)t=e;else if(e instanceof ArrayBuffer)t=new Uint8Array(e);else if(e instanceof DataView)t=new Uint8Array(e.buffer,e.byteOffset,e.byteLength);else{let s=e;t=new Uint8Array(s.buffer,s.byteOffset,s.byteLength)}let i=5381;for(let s=0;s<t.length;s++)i=(i<<5)+i+t[s],i=i>>>0;return i.toString(16).padStart(8,"0")}async toHash(e){return this.toHashSync(e)}};var _=class{get name(){return"fnv1"}toHashSync(e){let t;if(e instanceof Uint8Array)t=e;else if(e instanceof ArrayBuffer)t=new Uint8Array(e);else if(e instanceof DataView)t=new Uint8Array(e.buffer,e.byteOffset,e.byteLength);else{let n=e;t=new Uint8Array(n.buffer,n.byteOffset,n.byteLength)}let i=2166136261,r=16777619,s=i;for(let n=0;n<t.length;n++)s=s*r,s=s^t[n],s=s>>>0;return s.toString(16).padStart(8,"0")}async toHash(e){return this.toHashSync(e)}};var v=class{constructor(e=0){h(this,"_seed");this._seed=e>>>0}get name(){return"murmur"}get seed(){return this._seed}toHashSync(e){let t;if(e instanceof Uint8Array)t=e;else if(e instanceof ArrayBuffer)t=new Uint8Array(e);else if(e instanceof DataView)t=new Uint8Array(e.buffer,e.byteOffset,e.byteLength);else{let c=e;t=new Uint8Array(c.buffer,c.byteOffset,c.byteLength)}let i=3432918353,r=461845907,s=t.length,o=Math.floor(s/4),n=this._seed;for(let c=0;c<o;c++){let g=c*4,l=t[g]&255|(t[g+1]&255)<<8|(t[g+2]&255)<<16|(t[g+3]&255)<<24;l=this._imul(l,i),l=this._rotl32(l,15),l=this._imul(l,r),n^=l,n=this._rotl32(n,13),n=this._imul(n,5)+3864292196}let m=o*4,a=0;switch(s&3){case 3:a^=(t[m+2]&255)<<16;case 2:a^=(t[m+1]&255)<<8;case 1:a^=t[m]&255,a=this._imul(a,i),a=this._rotl32(a,15),a=this._imul(a,r),n^=a}return n^=s,n^=n>>>16,n=this._imul(n,2246822507),n^=n>>>13,n=this._imul(n,3266489909),n^=n>>>16,n=n>>>0,n.toString(16).padStart(8,"0")}async toHash(e){return this.toHashSync(e)}_imul(e,t){if(Math.imul)return Math.imul(e,t);let i=e>>>16&65535;let r=e&65535;let s=t>>>16&65535;let o=t&65535;return r*o+(i*o+r*s<<16>>>0)|0}_rotl32(e,t){return e<<t|e>>>32-t}};var x=class{constructor(e){h(this,"_providers",new Map);h(this,"_getFuzzy",!0);e?.providers&&this.loadProviders(e?.providers),e?.getFuzzy!==void 0&&(this._getFuzzy=!!e?.getFuzzy)}loadProviders(e){for(let t of e)this._providers.set(t.name,t)}get providers(){return this._providers}set providers(e){this._providers=e}get names(){return Array.from(this._providers.keys())}get(e,t){let i=t?.fuzzy??this._getFuzzy;e=e.trim();let r=this._providers.get(e);return r===void 0&&i===!0&&(e=e.toLowerCase(),r=this._providers.get(e)),r===void 0&&i===!0&&(e=e.replaceAll("-",""),r=this._providers.get(e)),r}add(e){this._providers.set(e.name,e)}remove(e){return this._providers.delete(e)}};var A=class extends O{constructor(t){super(t);h(this,"_parse",JSON.parse);h(this,"_stringify",JSON.stringify);h(this,"_providers",new x);h(this,"_defaultAlgorithm","SHA-256");h(this,"_defaultAlgorithmSync","djb2");h(this,"_cache");t?.parse&&(this._parse=t.parse),t?.stringify&&(this._stringify=t.stringify),t?.defaultAlgorithm&&(this._defaultAlgorithm=t.defaultAlgorithm),t?.defaultAlgorithmSync&&(this._defaultAlgorithmSync=t.defaultAlgorithmSync),this._cache=new y(t?.cache),this.loadProviders(t?.providers,{includeBase:t?.includeBase??!0})}get parse(){return this._parse}set parse(t){this._parse=t}get stringify(){return this._stringify}set stringify(t){this._stringify=t}get providers(){return this._providers}set providers(t){this._providers=t}get names(){return this._providers.names}get defaultAlgorithm(){return this._defaultAlgorithm}set defaultAlgorithm(t){this._defaultAlgorithm=t}get defaultAlgorithmSync(){return this._defaultAlgorithmSync}set defaultAlgorithmSync(t){this._defaultAlgorithmSync=t}get cache(){return this._cache}async toHash(t,i){let r={data:t,algorithm:i?.algorithm??this._defaultAlgorithm,maxLength:i?.maxLength};await this.beforeHook("toHash",r);let s=this._stringify(r.data),o=`${r.algorithm}:${s}`;if(this._cache.enabled){let g=this._cache.get(o);if(g!==void 0){let l=g;i?.maxLength&&l.length>i.maxLength&&(l=l.substring(0,i.maxLength));let d={hash:l,data:r.data,algorithm:r.algorithm};return await this.afterHook("toHash",d),d.hash}}let m=new TextEncoder().encode(s),a=this._providers.get(r.algorithm);a||(this.emit("warn",`Invalid algorithm '${r.algorithm}' not found. Falling back to default algorithm '${this._defaultAlgorithm}'.`),a=new p({algorithm:this._defaultAlgorithm}));let f=await a.toHash(m);this._cache.enabled&&this._cache.set(o,f),i?.maxLength&&f.length>i?.maxLength&&(f=f.substring(0,i.maxLength));let c={hash:f,data:r.data,algorithm:r.algorithm};return await this.afterHook("toHash",c),c.hash}async toNumber(t,i={}){let{min:r=0,max:s=100,algorithm:o=this._defaultAlgorithm,hashLength:n=16}=i;if(r>s)throw new Error("min cannot be greater than max");let m=await this.toHash(t,{algorithm:o,maxLength:n}),a=Number.parseInt(m,16),f=s-r+1;return r+a%f}toHashSync(t,i){let r={data:t,algorithm:i?.algorithm??this._defaultAlgorithmSync,maxLength:i?.maxLength};this.hookSync("before:toHashSync",r);let s=r.algorithm,o=this._stringify(r.data),n=`${s}:${o}`;if(this._cache.enabled){let l=this._cache.get(n);if(l!==void 0){let d=l;i?.maxLength&&d.length>i.maxLength&&(d=d.substring(0,i.maxLength));let S={hash:d,data:r.data,algorithm:s};return this.hookSync("after:toHashSync",S),S.hash}}let a=new TextEncoder().encode(o),f=this._providers.get(s);if(!f&&(this.emit("warn",`Invalid algorithm '${s}' not found. Falling back to default algorithm '${this._defaultAlgorithmSync}'.`),f=this._providers.get(this._defaultAlgorithmSync),!f))throw new Error(`Hash provider '${this._defaultAlgorithmSync}' (default) not found`);if(!f.toHashSync)throw new Error(`Hash provider '${s}' does not support synchronous hashing. Use toHash() instead or choose a different algorithm (djb2, fnv1, murmur, crc32).`);let c=f.toHashSync(a);this._cache.enabled&&this._cache.set(n,c),i?.maxLength&&c.length>i?.maxLength&&(c=c.substring(0,i.maxLength));let g={hash:c,data:r.data,algorithm:r.algorithm};return this.hookSync("after:toHashSync",g),g.hash}toNumberSync(t,i={}){let{min:r=0,max:s=100,algorithm:o=this._defaultAlgorithmSync,hashLength:n=16}=i;if(r>s)throw new Error("min cannot be greater than max");let m=this.toHashSync(t,{algorithm:o,maxLength:n}),a=Number.parseInt(m,16),f=s-r+1;return r+a%f}loadProviders(t,i={includeBase:!0}){if(t)for(let r of t)this._providers.add(r);i.includeBase&&(this.providers.add(new p({algorithm:"SHA-256"})),this.providers.add(new p({algorithm:"SHA-384"})),this.providers.add(new p({algorithm:"SHA-512"})),this.providers.add(new b),this.providers.add(new H),this.providers.add(new _),this.providers.add(new v))}};export{b as CRC,y as Cache,H as DJB2,_ as FNV1,x as HashProviders,A as Hashery,v as Murmur,p as WebCrypto};
-/* v8 ignore next -- @preserve */
-//# sourceMappingURL=index.js.map

package/node_modules/.pnpm/@keyv+bigmap@1.3.1_keyv@5.6.0/node_modules/hashery/dist/browser/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/index.ts","../../src/cache.ts","../../src/providers/crc.ts","../../src/providers/crypto.ts","../../src/providers/djb2.ts","../../src/providers/fnv1.ts","../../src/providers/murmur.ts","../../src/providers.ts"],"sourcesContent":["import { Hookified } from \"hookified\";\nimport { Cache } from \"./cache.js\";\nimport { CRC } from \"./providers/crc.js\";\nimport { WebCrypto } from \"./providers/crypto.js\";\nimport { DJB2 } from \"./providers/djb2.js\";\nimport { FNV1 } from \"./providers/fnv1.js\";\nimport { Murmur } from \"./providers/murmur.js\";\nimport { HashProviders } from \"./providers.js\";\nimport type {\n\tHasheryLoadProviderOptions,\n\tHasheryOptions,\n\tHasheryToHashOptions,\n\tHasheryToHashSyncOptions,\n\tHasheryToNumberOptions,\n\tHasheryToNumberSyncOptions,\n\tHashProvider,\n\tParseFn,\n\tStringifyFn,\n\tWebCryptoHashAlgorithm,\n} from \"./types.js\";\n\nexport class Hashery extends Hookified {\n\tprivate _parse: ParseFn = JSON.parse;\n\tprivate _stringify: StringifyFn = JSON.stringify;\n\tprivate _providers = new HashProviders();\n\tprivate _defaultAlgorithm: string = \"SHA-256\";\n\tprivate _defaultAlgorithmSync: string = \"djb2\";\n\tprivate _cache: Cache;\n\n\tconstructor(options?: HasheryOptions) {\n\t\tsuper(options);\n\n\t\tif (options?.parse) {\n\t\t\tthis._parse = options.parse;\n\t\t}\n\n\t\tif (options?.stringify) {\n\t\t\tthis._stringify = options.stringify;\n\t\t}\n\n\t\tif (options?.defaultAlgorithm) {\n\t\t\tthis._defaultAlgorithm = options.defaultAlgorithm;\n\t\t}\n\n\t\tif (options?.defaultAlgorithmSync) {\n\t\t\tthis._defaultAlgorithmSync = options.defaultAlgorithmSync;\n\t\t}\n\n\t\tthis._cache = new Cache(options?.cache);\n\n\t\tthis.loadProviders(options?.providers, {\n\t\t\tincludeBase: options?.includeBase ?? true,\n\t\t});\n\t}\n\n\t/**\n\t * Gets the parse function used to deserialize stored values.\n\t * @returns The current parse function (defaults to JSON.parse)\n\t */\n\tpublic get parse(): ParseFn {\n\t\treturn this._parse;\n\t}\n\n\t/**\n\t * Sets the parse function used to deserialize stored values.\n\t * @param value - The parse function to use for deserialization\n\t */\n\tpublic set parse(value: ParseFn) {\n\t\tthis._parse = value;\n\t}\n\n\t/**\n\t * Gets the stringify function used to serialize values for storage.\n\t * @returns The current stringify function (defaults to JSON.stringify)\n\t */\n\tpublic get stringify(): StringifyFn {\n\t\treturn this._stringify;\n\t}\n\n\t/**\n\t * Sets the stringify function used to serialize values for storage.\n\t * @param value - The stringify function to use for serialization\n\t */\n\tpublic set stringify(value: StringifyFn) {\n\t\tthis._stringify = value;\n\t}\n\n\t/**\n\t * Gets the HashProviders instance used to manage hash providers.\n\t * @returns The current HashProviders instance\n\t */\n\tpublic get providers(): HashProviders {\n\t\treturn this._providers;\n\t}\n\n\t/**\n\t * Sets the HashProviders instance used to manage hash providers.\n\t * @param value - The HashProviders instance to use\n\t */\n\tpublic set providers(value: HashProviders) {\n\t\tthis._providers = value;\n\t}\n\n\t/**\n\t * Gets the names of all registered hash algorithm providers.\n\t * @returns An array of provider names (e.g., ['SHA-256', 'SHA-384', 'SHA-512'])\n\t */\n\tpublic get names(): Array<string> {\n\t\treturn this._providers.names;\n\t}\n\n\t/**\n\t * Gets the default hash algorithm used when none is specified.\n\t * @returns The current default algorithm (defaults to 'SHA-256')\n\t */\n\tpublic get defaultAlgorithm(): string {\n\t\treturn this._defaultAlgorithm;\n\t}\n\n\t/**\n\t * Sets the default hash algorithm to use when none is specified.\n\t * @param value - The default algorithm to use (e.g., 'SHA-256', 'SHA-512', 'djb2')\n\t * @example\n\t * ```ts\n\t * const hashery = new Hashery();\n\t * hashery.defaultAlgorithm = 'SHA-512';\n\t *\n\t * // Now toHash will use SHA-512 by default\n\t * const hash = await hashery.toHash({ data: 'example' });\n\t * ```\n\t */\n\tpublic set defaultAlgorithm(value: string) {\n\t\tthis._defaultAlgorithm = value;\n\t}\n\n\t/**\n\t * Gets the default synchronous hash algorithm used when none is specified.\n\t * @returns The current default synchronous algorithm (defaults to 'djb2')\n\t */\n\tpublic get defaultAlgorithmSync(): string {\n\t\treturn this._defaultAlgorithmSync;\n\t}\n\n\t/**\n\t * Sets the default synchronous hash algorithm to use when none is specified.\n\t * @param value - The default synchronous algorithm to use (e.g., 'djb2', 'fnv1', 'murmur', 'crc32')\n\t * @example\n\t * ```ts\n\t * const hashery = new Hashery();\n\t * hashery.defaultAlgorithmSync = 'fnv1';\n\t *\n\t * // Now synchronous operations will use fnv1 by default\n\t * ```\n\t */\n\tpublic set defaultAlgorithmSync(value: string) {\n\t\tthis._defaultAlgorithmSync = value;\n\t}\n\n\t/**\n\t * Gets the cache instance used to store computed hash values.\n\t * @returns The Cache instance\n\t * @example\n\t * ```ts\n\t * const hashery = new Hashery({ cache: { enabled: true } });\n\t *\n\t * // Access the cache\n\t * hashery.cache.enabled; // true\n\t * hashery.cache.size; // number of cached items\n\t * hashery.cache.clear(); // clear all cached items\n\t * ```\n\t */\n\tpublic get cache(): Cache {\n\t\treturn this._cache;\n\t}\n\n\t/**\n\t * Generates a cryptographic hash of the provided data using the Web Crypto API.\n\t * The data is first stringified using the configured stringify function, then hashed.\n\t *\n\t * If an invalid algorithm is provided, a 'warn' event is emitted and the method falls back\n\t * to the default algorithm. You can listen to these warnings:\n\t * ```ts\n\t * hashery.on('warn', (message) => console.log(message));\n\t * ```\n\t *\n\t * @param data - The data to hash (will be stringified before hashing)\n\t * @param options - Optional configuration object\n\t * @param options.algorithm - The hash algorithm to use (defaults to 'SHA-256')\n\t * @param options.maxLength - Optional maximum length for the hash output\n\t * @returns A Promise that resolves to the hexadecimal string representation of the hash\n\t *\n\t * @example\n\t * ```ts\n\t * const hashery = new Hashery();\n\t * const hash = await hashery.toHash({ name: 'John', age: 30 });\n\t * console.log(hash); // \"a1b2c3d4...\"\n\t *\n\t * // Using a different algorithm\n\t * const hash512 = await hashery.toHash({ name: 'John' }, { algorithm: 'SHA-512' });\n\t * ```\n\t */\n\tpublic async toHash(\n\t\tdata: unknown,\n\t\toptions?: HasheryToHashOptions,\n\t): Promise<string> {\n\t\t// Before hook - allows modification of input data and algorithm\n\t\tconst context = {\n\t\t\tdata,\n\t\t\talgorithm: options?.algorithm ?? this._defaultAlgorithm,\n\t\t\tmaxLength: options?.maxLength,\n\t\t};\n\t\tawait this.beforeHook(\"toHash\", context);\n\n\t\t// Stringify the data using the configured stringify function\n\t\tconst stringified = this._stringify(context.data);\n\n\t\t// Check cache first\n\t\tconst cacheKey = `${context.algorithm}:${stringified}`;\n\t\tif (this._cache.enabled) {\n\t\t\tconst cached = this._cache.get(cacheKey);\n\t\t\tif (cached !== undefined) {\n\t\t\t\tlet cachedHash = cached;\n\t\t\t\t// Apply maxLength if specified\n\t\t\t\tif (options?.maxLength && cachedHash.length > options.maxLength) {\n\t\t\t\t\tcachedHash = cachedHash.substring(0, options.maxLength);\n\t\t\t\t}\n\n\t\t\t\t// After hook - run even on cache hits for consistent behavior\n\t\t\t\tconst result = {\n\t\t\t\t\thash: cachedHash,\n\t\t\t\t\tdata: context.data,\n\t\t\t\t\talgorithm: context.algorithm,\n\t\t\t\t};\n\t\t\t\tawait this.afterHook(\"toHash\", result);\n\n\t\t\t\treturn result.hash;\n\t\t\t}\n\t\t}\n\n\t\t// Convert the string to a Uint8Array\n\t\tconst encoder = new TextEncoder();\n\t\tconst dataBuffer = encoder.encode(stringified);\n\n\t\t// Get the provider for the specified algorithm\n\t\tlet provider = this._providers.get(context.algorithm);\n\t\tif (!provider) {\n\t\t\t// Emit warning for invalid algorithm\n\t\t\tthis.emit(\n\t\t\t\t\"warn\",\n\t\t\t\t`Invalid algorithm '${context.algorithm}' not found. Falling back to default algorithm '${this._defaultAlgorithm}'.`,\n\t\t\t);\n\n\t\t\tprovider = new WebCrypto({\n\t\t\t\talgorithm: this._defaultAlgorithm as WebCryptoHashAlgorithm,\n\t\t\t});\n\t\t}\n\n\t\t// Use the provider to hash the data\n\t\tlet hash = await provider.toHash(dataBuffer);\n\n\t\t// Store the full hash in cache before truncation\n\t\tif (this._cache.enabled) {\n\t\t\tthis._cache.set(cacheKey, hash);\n\t\t}\n\n\t\t// if there is a max then change the hash\n\t\tif (options?.maxLength && hash.length > options?.maxLength) {\n\t\t\thash = hash.substring(0, options.maxLength);\n\t\t}\n\n\t\t// After hook - allows modification/logging of result\n\t\tconst result = { hash, data: context.data, algorithm: context.algorithm };\n\t\tawait this.afterHook(\"toHash\", result);\n\n\t\treturn result.hash;\n\t}\n\n\t/**\n\t * Generates a deterministic number within a specified range based on the hash of the provided data.\n\t * This method uses the toHash function to create a consistent hash, then maps it to a number\n\t * between min and max (inclusive).\n\t *\n\t * @param data - The data to hash (will be stringified before hashing)\n\t * @param options - Configuration options (optional, defaults to min: 0, max: 100)\n\t * @param options.min - The minimum value of the range (inclusive, defaults to 0)\n\t * @param options.max - The maximum value of the range (inclusive, defaults to 100)\n\t * @param options.algorithm - The hash algorithm to use (defaults to 'SHA-256')\n\t * @param options.hashLength - Number of characters from hash to use for conversion (defaults to 16)\n\t * @returns A Promise that resolves to a number between min and max (inclusive)\n\t *\n\t * @example\n\t * ```ts\n\t * const hashery = new Hashery();\n\t * const num = await hashery.toNumber({ user: 'john' }); // Uses default min: 0, max: 100\n\t * console.log(num); // Always returns the same number for the same input, e.g., 42\n\t *\n\t * // Using custom range\n\t * const num2 = await hashery.toNumber({ user: 'john' }, { min: 1, max: 100 });\n\t *\n\t * // Using a different algorithm\n\t * const num512 = await hashery.toNumber({ user: 'john' }, { min: 0, max: 255, algorithm: 'SHA-512' });\n\t * ```\n\t */\n\tpublic async toNumber(\n\t\tdata: unknown,\n\t\toptions: HasheryToNumberOptions = {},\n\t): Promise<number> {\n\t\tconst {\n\t\t\tmin = 0,\n\t\t\tmax = 100,\n\t\t\talgorithm = this._defaultAlgorithm,\n\t\t\thashLength = 16,\n\t\t} = options;\n\n\t\tif (min > max) {\n\t\t\tthrow new Error(\"min cannot be greater than max\");\n\t\t}\n\n\t\t// Get the hash as a hex string\n\t\t// Take the first hashLength characters of the hash to convert to a number\n\t\t// This provides good distribution while avoiding precision issues with JavaScript numbers\n\t\tconst hash = await this.toHash(data, { algorithm, maxLength: hashLength });\n\n\t\t// Convert hex to a number\n\t\tconst hashNumber = Number.parseInt(hash, 16);\n\n\t\t// Map the hash number to the desired range\n\t\tconst range = max - min + 1;\n\t\tconst mapped = min + (hashNumber % range);\n\n\t\treturn mapped;\n\t}\n\n\t/**\n\t * Generates a hash of the provided data synchronously using a non-cryptographic hash algorithm.\n\t * The data is first stringified using the configured stringify function, then hashed.\n\t *\n\t * Note: This method only works with synchronous hash providers (djb2, fnv1, murmur, crc32).\n\t * WebCrypto algorithms (SHA-256, SHA-384, SHA-512) are not supported and will throw an error.\n\t *\n\t * If an invalid algorithm is provided, a 'warn' event is emitted and the method falls back\n\t * to the default synchronous algorithm. You can listen to these warnings:\n\t * ```ts\n\t * hashery.on('warn', (message) => console.log(message));\n\t * ```\n\t *\n\t * @param data - The data to hash (will be stringified before hashing)\n\t * @param options - Optional configuration object\n\t * @param options.algorithm - The hash algorithm to use (defaults to 'djb2')\n\t * @param options.maxLength - Optional maximum length for the hash output\n\t * @returns The hexadecimal string representation of the hash\n\t *\n\t * @throws {Error} If the specified algorithm does not support synchronous hashing\n\t * @throws {Error} If the default algorithm is not found\n\t *\n\t * @example\n\t * ```ts\n\t * const hashery = new Hashery();\n\t * const hash = hashery.toHashSync({ name: 'John', age: 30 });\n\t * console.log(hash); // \"7c9df5ea...\" (djb2 hash)\n\t *\n\t * // Using a different algorithm\n\t * const hashFnv1 = hashery.toHashSync({ name: 'John' }, { algorithm: 'fnv1' });\n\t * ```\n\t */\n\tpublic toHashSync(data: unknown, options?: HasheryToHashSyncOptions): string {\n\t\t// Before hook - allows modification of input data and algorithm (synchronous/blocking)\n\t\tconst context = {\n\t\t\tdata,\n\t\t\talgorithm: options?.algorithm ?? this._defaultAlgorithmSync,\n\t\t\tmaxLength: options?.maxLength,\n\t\t};\n\t\tthis.hookSync(\"before:toHashSync\", context);\n\n\t\t// Get algorithm from context (may have been modified by hook)\n\t\tconst algorithm = context.algorithm;\n\n\t\t// Stringify the data using the configured stringify function\n\t\tconst stringified = this._stringify(context.data);\n\n\t\t// Check cache first\n\t\tconst cacheKey = `${algorithm}:${stringified}`;\n\t\tif (this._cache.enabled) {\n\t\t\tconst cached = this._cache.get(cacheKey);\n\t\t\tif (cached !== undefined) {\n\t\t\t\tlet cachedHash = cached;\n\t\t\t\t// Apply maxLength if specified\n\t\t\t\tif (options?.maxLength && cachedHash.length > options.maxLength) {\n\t\t\t\t\tcachedHash = cachedHash.substring(0, options.maxLength);\n\t\t\t\t}\n\n\t\t\t\t// After hook - run even on cache hits for consistent behavior\n\t\t\t\tconst result = {\n\t\t\t\t\thash: cachedHash,\n\t\t\t\t\tdata: context.data,\n\t\t\t\t\talgorithm,\n\t\t\t\t};\n\t\t\t\tthis.hookSync(\"after:toHashSync\", result);\n\n\t\t\t\treturn result.hash;\n\t\t\t}\n\t\t}\n\n\t\t// Convert the string to a Uint8Array\n\t\tconst encoder = new TextEncoder();\n\t\tconst dataBuffer = encoder.encode(stringified);\n\n\t\t// Get the provider for the specified algorithm\n\t\tlet provider = this._providers.get(algorithm);\n\t\tif (!provider) {\n\t\t\t// Emit warning for invalid algorithm\n\t\t\tthis.emit(\n\t\t\t\t\"warn\",\n\t\t\t\t`Invalid algorithm '${algorithm}' not found. Falling back to default algorithm '${this._defaultAlgorithmSync}'.`,\n\t\t\t);\n\n\t\t\t// Fallback to default sync algorithm\n\t\t\tprovider = this._providers.get(this._defaultAlgorithmSync);\n\n\t\t\t// If default algorithm is also not found, throw error\n\t\t\tif (!provider) {\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`Hash provider '${this._defaultAlgorithmSync}' (default) not found`,\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\n\t\t// Check if provider supports synchronous hashing\n\t\tif (!provider.toHashSync) {\n\t\t\tthrow new Error(\n\t\t\t\t`Hash provider '${algorithm}' does not support synchronous hashing. Use toHash() instead or choose a different algorithm (djb2, fnv1, murmur, crc32).`,\n\t\t\t);\n\t\t}\n\n\t\t// Use the provider to hash the data synchronously\n\t\tlet hash = provider.toHashSync(dataBuffer);\n\n\t\t// Store the full hash in cache before truncation\n\t\tif (this._cache.enabled) {\n\t\t\tthis._cache.set(cacheKey, hash);\n\t\t}\n\n\t\t// if there is a max then change the hash\n\t\tif (options?.maxLength && hash.length > options?.maxLength) {\n\t\t\thash = hash.substring(0, options.maxLength);\n\t\t}\n\n\t\t// After hook - allows modification/logging of result (synchronous/blocking)\n\t\tconst result = { hash, data: context.data, algorithm: context.algorithm };\n\t\tthis.hookSync(\"after:toHashSync\", result);\n\n\t\treturn result.hash;\n\t}\n\n\t/**\n\t * Generates a deterministic number within a specified range based on the hash of the provided data synchronously.\n\t * This method uses the toHashSync function to create a consistent hash, then maps it to a number\n\t * between min and max (inclusive).\n\t *\n\t * Note: This method only works with synchronous hash providers (djb2, fnv1, murmur, crc32).\n\t *\n\t * @param data - The data to hash (will be stringified before hashing)\n\t * @param options - Configuration options (optional, defaults to min: 0, max: 100)\n\t * @param options.min - The minimum value of the range (inclusive, defaults to 0)\n\t * @param options.max - The maximum value of the range (inclusive, defaults to 100)\n\t * @param options.algorithm - The hash algorithm to use (defaults to 'djb2')\n\t * @param options.hashLength - Number of characters from hash to use for conversion (defaults to 16)\n\t * @returns A number between min and max (inclusive)\n\t *\n\t * @throws {Error} If the specified algorithm does not support synchronous hashing\n\t * @throws {Error} If min is greater than max\n\t *\n\t * @example\n\t * ```ts\n\t * const hashery = new Hashery();\n\t * const num = hashery.toNumberSync({ user: 'john' }); // Uses default min: 0, max: 100\n\t * console.log(num); // Always returns the same number for the same input, e.g., 42\n\t *\n\t * // Using custom range\n\t * const num2 = hashery.toNumberSync({ user: 'john' }, { min: 1, max: 100 });\n\t *\n\t * // Using a different algorithm\n\t * const numFnv1 = hashery.toNumberSync({ user: 'john' }, { min: 0, max: 255, algorithm: 'fnv1' });\n\t * ```\n\t */\n\tpublic toNumberSync(\n\t\tdata: unknown,\n\t\toptions: HasheryToNumberSyncOptions = {},\n\t): number {\n\t\tconst {\n\t\t\tmin = 0,\n\t\t\tmax = 100,\n\t\t\talgorithm = this._defaultAlgorithmSync,\n\t\t\thashLength = 16,\n\t\t} = options;\n\n\t\tif (min > max) {\n\t\t\tthrow new Error(\"min cannot be greater than max\");\n\t\t}\n\n\t\t// Get the hash as a hex string\n\t\t// Take the first hashLength characters of the hash to convert to a number\n\t\t// This provides good distribution while avoiding precision issues with JavaScript numbers\n\t\tconst hash = this.toHashSync(data, { algorithm, maxLength: hashLength });\n\n\t\t// Convert hex to a number\n\t\tconst hashNumber = Number.parseInt(hash, 16);\n\n\t\t// Map the hash number to the desired range\n\t\tconst range = max - min + 1;\n\t\tconst mapped = min + (hashNumber % range);\n\n\t\treturn mapped;\n\t}\n\n\tpublic loadProviders(\n\t\tproviders?: Array<HashProvider>,\n\t\toptions: HasheryLoadProviderOptions = { includeBase: true },\n\t): void {\n\t\tif (providers) {\n\t\t\tfor (const provider of providers) {\n\t\t\t\tthis._providers.add(provider);\n\t\t\t}\n\t\t}\n\n\t\t// load all the providers\n\t\tif (options.includeBase) {\n\t\t\tthis.providers.add(new WebCrypto({ algorithm: \"SHA-256\" }));\n\t\t\tthis.providers.add(new WebCrypto({ algorithm: \"SHA-384\" }));\n\t\t\tthis.providers.add(new WebCrypto({ algorithm: \"SHA-512\" }));\n\t\t\tthis.providers.add(new CRC());\n\t\t\tthis.providers.add(new DJB2());\n\t\t\tthis.providers.add(new FNV1());\n\t\t\tthis.providers.add(new Murmur());\n\t\t}\n\t}\n}\n\n// Types\nexport type { CacheOptions } from \"./cache.js\";\n// Classes\nexport { Cache } from \"./cache.js\";\nexport { CRC } from \"./providers/crc.js\";\nexport type { WebCryptoOptions } from \"./providers/crypto.js\";\nexport { WebCrypto } from \"./providers/crypto.js\";\nexport { DJB2 } from \"./providers/djb2.js\";\nexport { FNV1 } from \"./providers/fnv1.js\";\nexport { Murmur } from \"./providers/murmur.js\";\nexport { HashProviders } from \"./providers.js\";\nexport type {\n\tHashAlgorithm,\n\tHasheryLoadProviderOptions,\n\tHasheryOptions,\n\tHasheryToHashOptions,\n\tHasheryToHashSyncOptions,\n\tHasheryToNumberOptions,\n\tHasheryToNumberSyncOptions,\n\tHashProvider,\n\tHashProvidersGetOptions,\n\tHashProvidersOptions,\n\tParseFn,\n\tStringifyFn,\n\tWebCryptoHashAlgorithm,\n} from \"./types.js\";\n","/**\n * Configuration options for the Cache class.\n */\nexport type CacheOptions = {\n\t/**\n\t * Enable or disable the cache.\n\t * Defaults to true (enabled).\n\t */\n\tenabled?: boolean;\n\n\t/**\n\t * Maximum number of items to store in the cache.\n\t * Defaults to 4000. When limit is reached, oldest entries are evicted (FIFO).\n\t *\n\t * Note: JavaScript Map can hold up to 2^24 (~16.7 million) entries in most\n\t * environments, but practical limits depend on available memory and key/value sizes.\n\t * For hash caching, 4000-10000 entries is typically sufficient for most use cases.\n\t */\n\tmaxSize?: number;\n};\n\n/**\n * A simple FIFO (First In, First Out) cache for storing hash values.\n * When the cache reaches its maximum size, the oldest entries are evicted.\n *\n * The cache uses a JavaScript Map internally, which can theoretically hold up to\n * 2^24 (~16.7 million) entries. However, practical limits depend on available memory\n * and the size of cached keys/values. The default maxSize of 4000 provides a good\n * balance between performance and memory usage for typical hash caching scenarios.\n */\nexport class Cache {\n\tprivate _enabled = true;\n\tprivate _maxSize = 4000;\n\tprivate _store = new Map<string, string>();\n\tprivate _keys: string[] = [];\n\n\tconstructor(options?: CacheOptions) {\n\t\tif (options?.enabled !== undefined) {\n\t\t\tthis._enabled = options.enabled;\n\t\t}\n\n\t\tif (options?.maxSize !== undefined) {\n\t\t\tthis._maxSize = options.maxSize;\n\t\t}\n\t}\n\n\t/**\n\t * Gets whether the cache is enabled.\n\t */\n\tpublic get enabled(): boolean {\n\t\treturn this._enabled;\n\t}\n\n\t/**\n\t * Sets whether the cache is enabled.\n\t */\n\tpublic set enabled(value: boolean) {\n\t\tthis._enabled = value;\n\t}\n\n\t/**\n\t * Gets the maximum number of items the cache can hold.\n\t */\n\tpublic get maxSize(): number {\n\t\treturn this._maxSize;\n\t}\n\n\t/**\n\t * Sets the maximum number of items the cache can hold.\n\t */\n\tpublic set maxSize(value: number) {\n\t\tthis._maxSize = value;\n\t}\n\n\t/**\n\t * Gets the underlying Map store.\n\t */\n\tpublic get store(): Map<string, string> {\n\t\treturn this._store;\n\t}\n\n\t/**\n\t * Gets the current number of items in the cache.\n\t */\n\tpublic get size(): number {\n\t\treturn this._store.size;\n\t}\n\n\t/**\n\t * Gets a value from the cache.\n\t * @param key - The cache key\n\t * @returns The cached value, or undefined if not found\n\t */\n\tpublic get(key: string): string | undefined {\n\t\treturn this._store.get(key);\n\t}\n\n\t/**\n\t * Sets a value in the cache with FIFO eviction.\n\t * If the cache is disabled, this method does nothing.\n\t * If the cache is at capacity, the oldest entry is removed before adding the new one.\n\t * @param key - The cache key\n\t * @param value - The value to cache\n\t */\n\tpublic set(key: string, value: string): void {\n\t\tif (!this._enabled) {\n\t\t\treturn;\n\t\t}\n\n\t\t// If key already exists, just update the value\n\t\tif (this._store.has(key)) {\n\t\t\tthis._store.set(key, value);\n\t\t\treturn;\n\t\t}\n\n\t\t// If at capacity, remove oldest (FIFO)\n\t\tif (this._store.size >= this._maxSize) {\n\t\t\tconst oldestKey = this._keys.shift();\n\t\t\t/* v8 ignore next -- @preserve */\n\t\t\tif (oldestKey) {\n\t\t\t\tthis._store.delete(oldestKey);\n\t\t\t}\n\t\t}\n\n\t\t// Add new entry\n\t\tthis._keys.push(key);\n\t\tthis._store.set(key, value);\n\t}\n\n\t/**\n\t * Checks if a key exists in the cache.\n\t * @param key - The cache key\n\t * @returns True if the key exists, false otherwise\n\t */\n\tpublic has(key: string): boolean {\n\t\treturn this._store.has(key);\n\t}\n\n\t/**\n\t * Clears all entries from the cache.\n\t */\n\tpublic clear(): void {\n\t\tthis._store.clear();\n\t\tthis._keys = [];\n\t}\n}\n","import type { HashProvider } from \"../types.ts\";\n\nexport class CRC implements HashProvider {\n    public get name(): string {\n        return \"crc32\";\n    }\n\n    public toHashSync(data: BufferSource): string {\n        // Convert BufferSource to Uint8Array\n        let bytes: Uint8Array;\n\n        if (data instanceof Uint8Array) {\n            bytes = data;\n        } else if (data instanceof ArrayBuffer) {\n            bytes = new Uint8Array(data);\n        } else if (data instanceof DataView) {\n            bytes = new Uint8Array(data.buffer, data.byteOffset, data.byteLength);\n        } else {\n            const view = data as ArrayBufferView;\n            bytes = new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n        }\n\n        // CRC-32 algorithm (IEEE 802.3 polynomial)\n        // This is the same algorithm used by PHP's crc32() function\n        const CRC32_POLYNOMIAL = 0xEDB88320;\n        let crc = 0xFFFFFFFF;\n\n        for (let i = 0; i < bytes.length; i++) {\n            crc = crc ^ bytes[i];\n            for (let j = 0; j < 8; j++) {\n                crc = (crc >>> 1) ^ (CRC32_POLYNOMIAL & -(crc & 1));\n            }\n        }\n\n        // Finalize CRC\n        crc = (crc ^ 0xFFFFFFFF) >>> 0;\n\n        // Convert to hexadecimal string (8 characters, zero-padded)\n        const hashHex = crc.toString(16).padStart(8, \"0\");\n        return hashHex;\n    }\n\n    public async toHash(data: BufferSource): Promise<string> {\n        return this.toHashSync(data);\n    }\n}\n","import type { WebCryptoHashAlgorithm, HashProvider } from \"../types.js\";\n\n\nexport type WebCryptoOptions = {\n\talgorithm?: WebCryptoHashAlgorithm\n}\n\nexport class WebCrypto implements HashProvider {\n\tprivate _algorithm: WebCryptoHashAlgorithm = \"SHA-256\";\n\tconstructor(options?: WebCryptoOptions) {\n\t\tif(options?.algorithm) {\n\t\t\tthis._algorithm = options?.algorithm;\n\t\t}\n\n\t}\n\n\tpublic get name(): string {\n\t\treturn this._algorithm;\n\t}\n\n\tpublic async toHash(data: BufferSource): Promise<string> {\n\t\t// Hash the data using Web Crypto API\n\t\tconst hashBuffer = await crypto.subtle.digest(this._algorithm, data);\n\n\t\t// Convert the hash to a hexadecimal string\n\t\tconst hashArray = Array.from(new Uint8Array(hashBuffer));\n\t\tconst hashHex = hashArray\n\t\t\t.map((byte) => byte.toString(16).padStart(2, \"0\"))\n\t\t\t.join(\"\");\n\n\t\treturn hashHex;\n\t}\n}","import type { HashProvider } from \"../types.ts\";\n\n/**\n * DJB2 hash algorithm implementation.\n *\n * DJB2 is a non-cryptographic hash function created by Daniel J. Bernstein.\n * It produces a 32-bit hash value, making it suitable for hash tables and checksums,\n * but NOT for cryptographic purposes.\n *\n * Algorithm: hash = hash * 33 + c (where c is each byte)\n * Initial value: 5381\n *\n * @example\n * ```typescript\n * import { Hashery } from 'hashery';\n * import { DJB2 } from 'hashery/providers/djb2';\n *\n * const hashery = new Hashery();\n * hashery.providers.add(new DJB2());\n *\n * const hash = await hashery.toHash({ data: 'hello' }, 'djb2');\n * console.log(hash); // \"7c9df5ea\"\n * ```\n */\nexport class DJB2 implements HashProvider {\n\t/**\n\t * The name identifier for this hash provider.\n\t */\n\tpublic get name(): string {\n\t\treturn \"djb2\";\n\t}\n\n\t/**\n\t * Computes the DJB2 hash of the provided data synchronously.\n\t *\n\t * @param data - The data to hash (Uint8Array, ArrayBuffer, or DataView)\n\t * @returns An 8-character lowercase hexadecimal string\n\t *\n\t * @example\n\t * ```typescript\n\t * const djb2 = new DJB2();\n\t * const data = new TextEncoder().encode('hello');\n\t * const hash = djb2.toHashSync(data);\n\t * console.log(hash); // \"7c9df5ea\"\n\t * ```\n\t */\n\tpublic toHashSync(data: BufferSource): string {\n\t\t// Convert BufferSource to Uint8Array for consistent processing\n\t\tlet bytes: Uint8Array;\n\n\t\tif (data instanceof Uint8Array) {\n\t\t\tbytes = data;\n\t\t} else if (data instanceof ArrayBuffer) {\n\t\t\tbytes = new Uint8Array(data);\n\t\t} else if (data instanceof DataView) {\n\t\t\tbytes = new Uint8Array(data.buffer, data.byteOffset, data.byteLength);\n\t\t} else {\n\t\t\t// Fallback for other ArrayBufferView types (e.g., Int8Array, Uint16Array, etc.)\n\t\t\tconst view = data as ArrayBufferView;\n\t\t\tbytes = new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n\t\t}\n\n\t\t// DJB2 algorithm\n\t\t// Initial hash value: 5381\n\t\tlet hash = 5381;\n\n\t\t// Process each byte: hash = hash * 33 + byte\n\t\tfor (let i = 0; i < bytes.length; i++) {\n\t\t\thash = ((hash << 5) + hash) + bytes[i]; // hash * 33 + c\n\t\t\t// Keep it as a 32-bit unsigned integer\n\t\t\thash = hash >>> 0;\n\t\t}\n\n\t\t// Convert to 8-character lowercase hexadecimal string\n\t\tconst hashHex = hash.toString(16).padStart(8, \"0\");\n\n\t\treturn hashHex;\n\t}\n\n\t/**\n\t * Computes the DJB2 hash of the provided data.\n\t *\n\t * @param data - The data to hash (Uint8Array, ArrayBuffer, or DataView)\n\t * @returns A Promise resolving to an 8-character lowercase hexadecimal string\n\t *\n\t * @example\n\t * ```typescript\n\t * const djb2 = new DJB2();\n\t * const data = new TextEncoder().encode('hello');\n\t * const hash = await djb2.toHash(data);\n\t * console.log(hash); // \"7c9df5ea\"\n\t * ```\n\t */\n\tpublic async toHash(data: BufferSource): Promise<string> {\n\t\treturn this.toHashSync(data);\n\t}\n}\n","import type { HashProvider } from \"../types.ts\";\n\n/**\n * FNV-1 (Fowler-Noll-Vo) hash algorithm implementation.\n *\n * FNV-1 is a non-cryptographic hash function created by Glenn Fowler, Landon Curt Noll,\n * and Kiem-Phong Vo. It produces a 32-bit hash value, making it suitable for hash tables\n * and checksums, but NOT for cryptographic purposes.\n *\n * Algorithm: hash = (hash * FNV_prime) XOR octet_of_data\n * FNV-1 32-bit offset basis: 2166136261\n * FNV-1 32-bit prime: 16777619\n */\nexport class FNV1 implements HashProvider {\n    /**\n     * The name identifier for this hash provider.\n     */\n    public get name(): string {\n        return \"fnv1\";\n    }\n\n    /**\n     * Computes the FNV-1 hash of the provided data synchronously.\n     *\n     * @param data - The data to hash (Uint8Array, ArrayBuffer, or DataView)\n     * @returns An 8-character lowercase hexadecimal string\n     */\n    public toHashSync(data: BufferSource): string {\n        // Convert BufferSource to Uint8Array for consistent processing\n        let bytes: Uint8Array;\n\n        if (data instanceof Uint8Array) {\n            bytes = data;\n        } else if (data instanceof ArrayBuffer) {\n            bytes = new Uint8Array(data);\n        } else if (data instanceof DataView) {\n            bytes = new Uint8Array(data.buffer, data.byteOffset, data.byteLength);\n        } else {\n            // Fallback for other ArrayBufferView types (e.g., Int8Array, Uint16Array, etc.)\n            const view = data as ArrayBufferView;\n            bytes = new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n        }\n\n        // FNV-1 algorithm constants\n        const FNV_OFFSET_BASIS = 2166136261; // 32-bit offset basis\n        const FNV_PRIME = 16777619; // 32-bit FNV prime\n\n        // Initialize hash with FNV offset basis\n        let hash = FNV_OFFSET_BASIS;\n\n        // Process each byte: hash = (hash * FNV_prime) XOR byte\n        for (let i = 0; i < bytes.length; i++) {\n            hash = hash * FNV_PRIME;\n            hash = hash ^ bytes[i];\n            // Keep it as a 32-bit unsigned integer\n            hash = hash >>> 0;\n        }\n\n        // Convert to 8-character lowercase hexadecimal string\n        const hashHex = hash.toString(16).padStart(8, \"0\");\n\n        return hashHex;\n    }\n\n    /**\n     * Computes the FNV-1 hash of the provided data.\n     *\n     * @param data - The data to hash (Uint8Array, ArrayBuffer, or DataView)\n     * @returns A Promise resolving to an 8-character lowercase hexadecimal string\n     */\n    public async toHash(data: BufferSource): Promise<string> {\n        return this.toHashSync(data);\n    }\n}\n","import type { HashProvider } from \"../types.ts\";\n\n/**\n * Murmur 32-bit hash algorithm implementation.\n *\n * Murmur is a non-cryptographic hash function based on MurmurHash3 by Austin Appleby.\n * It produces a 32-bit hash value with excellent distribution and performance,\n * making it suitable for hash tables, bloom filters, and checksums,\n * but NOT for cryptographic purposes.\n *\n * This implementation uses the MurmurHash3_x86_32 variant.\n *\n * @example\n * ```typescript\n * import { Hashery } from 'hashery';\n * import { Murmur } from 'hashery/providers/murmur';\n *\n * const hashery = new Hashery();\n * hashery.providers.add(new Murmur());\n *\n * const hash = await hashery.toHash({ data: 'hello' }, 'murmur');\n * console.log(hash); // \"248bfa47\"\n * ```\n */\nexport class Murmur implements HashProvider {\n\tprivate _seed: number;\n\n\t/**\n\t * Creates a new Murmur instance.\n\t *\n\t * @param seed - Optional seed value for the hash (default: 0)\n\t */\n\tconstructor(seed: number = 0) {\n\t\tthis._seed = seed >>> 0; // Ensure it's a 32-bit unsigned integer\n\t}\n\n\t/**\n\t * The name identifier for this hash provider.\n\t */\n\tpublic get name(): string {\n\t\treturn \"murmur\";\n\t}\n\n\t/**\n\t * Gets the current seed value used for hashing.\n\t */\n\tpublic get seed(): number {\n\t\treturn this._seed;\n\t}\n\n\t/**\n\t * Computes the Murmur 32-bit hash of the provided data synchronously.\n\t *\n\t * @param data - The data to hash (Uint8Array, ArrayBuffer, or DataView)\n\t * @returns An 8-character lowercase hexadecimal string\n\t *\n\t * @example\n\t * ```typescript\n\t * const murmur = new Murmur();\n\t * const data = new TextEncoder().encode('hello');\n\t * const hash = murmur.toHashSync(data);\n\t * console.log(hash); // \"248bfa47\"\n\t * ```\n\t */\n\tpublic toHashSync(data: BufferSource): string {\n\t\t// Convert BufferSource to Uint8Array for consistent processing\n\t\tlet bytes: Uint8Array;\n\n\t\tif (data instanceof Uint8Array) {\n\t\t\tbytes = data;\n\t\t} else if (data instanceof ArrayBuffer) {\n\t\t\tbytes = new Uint8Array(data);\n\t\t} else if (data instanceof DataView) {\n\t\t\tbytes = new Uint8Array(data.buffer, data.byteOffset, data.byteLength);\n\t\t} else {\n\t\t\t// Fallback for other ArrayBufferView types (e.g., Int8Array, Uint16Array, etc.)\n\t\t\tconst view = data as ArrayBufferView;\n\t\t\tbytes = new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n\t\t}\n\n\t\t// MurmurHash3_x86_32 algorithm\n\t\tconst c1 = 0xcc9e2d51;\n\t\tconst c2 = 0x1b873593;\n\t\tconst length = bytes.length;\n\t\tconst nblocks = Math.floor(length / 4);\n\n\t\tlet h1 = this._seed;\n\n\t\t// Process 4-byte blocks\n\t\tfor (let i = 0; i < nblocks; i++) {\n\t\t\tconst index = i * 4;\n\t\t\tlet k1 =\n\t\t\t\t(bytes[index] & 0xff) |\n\t\t\t\t((bytes[index + 1] & 0xff) << 8) |\n\t\t\t\t((bytes[index + 2] & 0xff) << 16) |\n\t\t\t\t((bytes[index + 3] & 0xff) << 24);\n\n\t\t\tk1 = this._imul(k1, c1);\n\t\t\tk1 = this._rotl32(k1, 15);\n\t\t\tk1 = this._imul(k1, c2);\n\n\t\t\th1 ^= k1;\n\t\t\th1 = this._rotl32(h1, 13);\n\t\t\th1 = this._imul(h1, 5) + 0xe6546b64;\n\t\t}\n\n\t\t// Process remaining bytes\n\t\tconst tail = nblocks * 4;\n\t\tlet k1 = 0;\n\n\t\tswitch (length & 3) {\n\t\t\tcase 3:\n\t\t\t\tk1 ^= (bytes[tail + 2] & 0xff) << 16;\n\t\t\t// fallthrough\n\t\t\tcase 2:\n\t\t\t\tk1 ^= (bytes[tail + 1] & 0xff) << 8;\n\t\t\t// fallthrough\n\t\t\tcase 1:\n\t\t\t\tk1 ^= bytes[tail] & 0xff;\n\t\t\t\tk1 = this._imul(k1, c1);\n\t\t\t\tk1 = this._rotl32(k1, 15);\n\t\t\t\tk1 = this._imul(k1, c2);\n\t\t\t\th1 ^= k1;\n\t\t}\n\n\t\t// Finalization\n\t\th1 ^= length;\n\n\t\th1 ^= h1 >>> 16;\n\t\th1 = this._imul(h1, 0x85ebca6b);\n\t\th1 ^= h1 >>> 13;\n\t\th1 = this._imul(h1, 0xc2b2ae35);\n\t\th1 ^= h1 >>> 16;\n\n\t\t// Convert to unsigned 32-bit integer\n\t\th1 = h1 >>> 0;\n\n\t\t// Convert to 8-character lowercase hexadecimal string\n\t\tconst hashHex = h1.toString(16).padStart(8, \"0\");\n\n\t\treturn hashHex;\n\t}\n\n\t/**\n\t * Computes the Murmur 32-bit hash of the provided data.\n\t *\n\t * @param data - The data to hash (Uint8Array, ArrayBuffer, or DataView)\n\t * @returns A Promise resolving to an 8-character lowercase hexadecimal string\n\t *\n\t * @example\n\t * ```typescript\n\t * const murmur = new Murmur();\n\t * const data = new TextEncoder().encode('hello');\n\t * const hash = await murmur.toHash(data);\n\t * console.log(hash); // \"248bfa47\"\n\t * ```\n\t */\n\tpublic async toHash(data: BufferSource): Promise<string> {\n\t\treturn this.toHashSync(data);\n\t}\n\n\t/**\n\t * 32-bit integer multiplication with proper overflow handling.\n\t * @private\n\t */\n\tprivate _imul(a: number, b: number): number {\n\t\t// Use Math.imul if available, otherwise fallback to manual implementation\n\t\t/* v8 ignore next -- @preserve */\n\t\tif (Math.imul) {\n\t\t\treturn Math.imul(a, b);\n\t\t}\n\n\t\t// Manual 32-bit multiplication\n\t\t/* v8 ignore next -- @preserve */\n\t\tconst ah = (a >>> 16) & 0xffff;\n\t\t/* v8 ignore next -- @preserve */\n\t\tconst al = a & 0xffff;\n\t\t/* v8 ignore next -- @preserve */\n\t\tconst bh = (b >>> 16) & 0xffff;\n\t\t/* v8 ignore next -- @preserve */\n\t\tconst bl = b & 0xffff;\n\n\t\t/* v8 ignore next -- @preserve */\n\t\treturn ((al * bl) + (((ah * bl + al * bh) << 16) >>> 0)) | 0;\n\t}\n\n\t/**\n\t * Left rotate a 32-bit integer.\n\t * @private\n\t */\n\tprivate _rotl32(x: number, r: number): number {\n\t\treturn (x << r) | (x >>> (32 - r));\n\t}\n}\n","import type {\n\tHashProvider,\n\tHashProvidersGetOptions,\n\tHashProvidersOptions,\n} from \"./types.js\";\n\n/**\n * Manages a collection of hash providers for the Hashery system.\n * Provides methods to add, remove, and load multiple hash providers.\n */\nexport class HashProviders {\n\tprivate _providers: Map<string, HashProvider> = new Map();\n\tprivate _getFuzzy = true;\n\n\t/**\n\t * Creates a new HashProviders instance.\n\t * @param options - Optional configuration including initial providers to load\n\t * @example\n\t * ```ts\n\t * const providers = new HashProviders({\n\t *   providers: [{ name: 'custom', toHash: async (data) => '...' }]\n\t * });\n\t * ```\n\t */\n\tconstructor(options?: HashProvidersOptions) {\n\t\tif (options?.providers) {\n\t\t\tthis.loadProviders(options?.providers);\n\t\t}\n\n\t\tif (options?.getFuzzy !== undefined) {\n\t\t\tthis._getFuzzy = Boolean(options?.getFuzzy);\n\t\t}\n\t}\n\n\t/**\n\t * Loads multiple hash providers at once.\n\t * Each provider is added to the internal map using its name as the key.\n\t * @param providers - Array of HashProvider objects to load\n\t * @example\n\t * ```ts\n\t * const providers = new HashProviders();\n\t * providers.loadProviders([\n\t *   { name: 'md5', toHash: async (data) => '...' },\n\t *   { name: 'sha1', toHash: async (data) => '...' }\n\t * ]);\n\t * ```\n\t */\n\tpublic loadProviders(providers: Array<HashProvider>) {\n\t\tfor (const provider of providers) {\n\t\t\tthis._providers.set(provider.name, provider);\n\t\t}\n\t}\n\n\t/**\n\t * Gets the internal Map of all registered hash providers.\n\t * @returns Map of provider names to HashProvider objects\n\t */\n\tpublic get providers(): Map<string, HashProvider> {\n\t\treturn this._providers;\n\t}\n\n\t/**\n\t * Sets the internal Map of hash providers, replacing all existing providers.\n\t * @param providers - Map of provider names to HashProvider objects\n\t */\n\tpublic set providers(providers: Map<string, HashProvider>) {\n\t\tthis._providers = providers;\n\t}\n\n\t/**\n\t * Gets an array of all provider names.\n\t * @returns Array of provider names\n\t * @example\n\t * ```ts\n\t * const providers = new HashProviders();\n\t * providers.add({ name: 'sha256', toHash: async (data) => '...' });\n\t * providers.add({ name: 'md5', toHash: async (data) => '...' });\n\t * console.log(providers.names); // ['sha256', 'md5']\n\t * ```\n\t */\n\tpublic get names(): Array<string> {\n\t\treturn Array.from(this._providers.keys());\n\t}\n\n\t/**\n\t * Gets a hash provider by name with optional fuzzy matching.\n\t *\n\t * Fuzzy matching (enabled by default) attempts to find providers by:\n\t * 1. Exact match (after trimming whitespace)\n\t * 2. Case-insensitive match (lowercase)\n\t * 3. Dash-removed match (e.g., \"SHA-256\" matches \"sha256\")\n\t *\n\t * @param name - The name of the provider to retrieve\n\t * @param options - Optional configuration for the get operation\n\t * @param options.fuzzy - Enable/disable fuzzy matching (overrides constructor setting)\n\t * @returns The HashProvider if found, undefined otherwise\n\t * @example\n\t * ```ts\n\t * const providers = new HashProviders();\n\t * providers.add({ name: 'sha256', toHash: async (data) => '...' });\n\t *\n\t * // Exact match\n\t * const provider = providers.get('sha256');\n\t *\n\t * // Fuzzy match (case-insensitive)\n\t * const provider2 = providers.get('SHA256');\n\t *\n\t * // Fuzzy match (with dash)\n\t * const provider3 = providers.get('SHA-256');\n\t *\n\t * // Disable fuzzy matching\n\t * const provider4 = providers.get('SHA256', { fuzzy: false }); // returns undefined\n\t * ```\n\t */\n\tpublic get(\n\t\tname: string,\n\t\toptions?: HashProvidersGetOptions,\n\t): HashProvider | undefined {\n\t\t// set the options\n\t\tconst getFuzzy = options?.fuzzy ?? this._getFuzzy;\n\n\t\t// do the trim\n\t\tname = name.trim();\n\n\t\tlet result = this._providers.get(name);\n\n\t\t// try with lower case\n\t\tif (result === undefined && getFuzzy === true) {\n\t\t\tname = name.toLowerCase();\n\t\t\tresult = this._providers.get(name);\n\t\t}\n\n\t\t// try removing dash\n\t\tif (result === undefined && getFuzzy === true) {\n\t\t\tname = name.replaceAll(\"-\", \"\");\n\t\t\tresult = this._providers.get(name);\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Adds a single hash provider to the collection.\n\t * If a provider with the same name already exists, it will be replaced.\n\t * @param provider - The HashProvider object to add\n\t * @example\n\t * ```ts\n\t * const providers = new HashProviders();\n\t * providers.add({\n\t *   name: 'custom-hash',\n\t *   toHash: async (data) => {\n\t *     // Custom hashing logic\n\t *     return 'hash-result';\n\t *   }\n\t * });\n\t * ```\n\t */\n\tpublic add(provider: HashProvider): void {\n\t\tthis._providers.set(provider.name, provider);\n\t}\n\n\t/**\n\t * Removes a hash provider from the collection by name.\n\t * @param name - The name of the provider to remove\n\t * @returns true if the provider was found and removed, false otherwise\n\t * @example\n\t * ```ts\n\t * const providers = new HashProviders();\n\t * providers.add({ name: 'custom', toHash: async (data) => '...' });\n\t * const removed = providers.remove('custom'); // returns true\n\t * const removed2 = providers.remove('nonexistent'); // returns false\n\t * ```\n\t */\n\tpublic remove(name: string): boolean {\n\t\treturn this._providers.delete(name);\n\t}\n}\n"],"mappings":"oKAAA,OAAS,aAAAA,MAAiB,YC8BnB,IAAMC,EAAN,KAAY,CAMlB,YAAYC,EAAwB,CALpCC,EAAA,KAAQ,WAAW,IACnBA,EAAA,KAAQ,WAAW,KACnBA,EAAA,KAAQ,SAAS,IAAI,KACrBA,EAAA,KAAQ,QAAkB,CAAC,GAGtBD,GAAS,UAAY,SACxB,KAAK,SAAWA,EAAQ,SAGrBA,GAAS,UAAY,SACxB,KAAK,SAAWA,EAAQ,QAE1B,CAKA,IAAW,SAAmB,CAC7B,OAAO,KAAK,QACb,CAKA,IAAW,QAAQE,EAAgB,CAClC,KAAK,SAAWA,CACjB,CAKA,IAAW,SAAkB,CAC5B,OAAO,KAAK,QACb,CAKA,IAAW,QAAQA,EAAe,CACjC,KAAK,SAAWA,CACjB,CAKA,IAAW,OAA6B,CACvC,OAAO,KAAK,MACb,CAKA,IAAW,MAAe,CACzB,OAAO,KAAK,OAAO,IACpB,CAOO,IAAIC,EAAiC,CAC3C,OAAO,KAAK,OAAO,IAAIA,CAAG,CAC3B,CASO,IAAIA,EAAaD,EAAqB,CAC5C,GAAK,KAAK,SAKV,IAAI,KAAK,OAAO,IAAIC,CAAG,EAAG,CACzB,KAAK,OAAO,IAAIA,EAAKD,CAAK,EAC1B,MACD,CAGA,GAAI,KAAK,OAAO,MAAQ,KAAK,SAAU,CACtC,IAAME,EAAY,KAAK,MAAM,MAAM,EAE/BA,GACH,KAAK,OAAO,OAAOA,CAAS,CAE9B,CAGA,KAAK,MAAM,KAAKD,CAAG,EACnB,KAAK,OAAO,IAAIA,EAAKD,CAAK,EAC3B,CAOO,IAAIC,EAAsB,CAChC,OAAO,KAAK,OAAO,IAAIA,CAAG,CAC3B,CAKO,OAAc,CACpB,KAAK,OAAO,MAAM,EAClB,KAAK,MAAQ,CAAC,CACf,CACD,EC/IO,IAAME,EAAN,KAAkC,CACrC,IAAW,MAAe,CACtB,MAAO,OACX,CAEO,WAAWC,EAA4B,CAE1C,IAAIC,EAEJ,GAAID,aAAgB,WAChBC,EAAQD,UACDA,aAAgB,YACvBC,EAAQ,IAAI,WAAWD,CAAI,UACpBA,aAAgB,SACvBC,EAAQ,IAAI,WAAWD,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,MACjE,CACH,IAAME,EAAOF,EACbC,EAAQ,IAAI,WAAWC,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,CACxE,CAIA,IAAMC,EAAmB,WACrBC,EAAM,WAEV,QAASC,EAAI,EAAGA,EAAIJ,EAAM,OAAQI,IAAK,CACnCD,EAAMA,EAAMH,EAAMI,CAAC,EACnB,QAASC,EAAI,EAAGA,EAAI,EAAGA,IACnBF,EAAOA,IAAQ,EAAMD,EAAmB,EAAEC,EAAM,EAExD,CAGA,OAAAA,GAAOA,EAAM,cAAgB,EAGbA,EAAI,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAEpD,CAEA,MAAa,OAAOJ,EAAqC,CACrD,OAAO,KAAK,WAAWA,CAAI,CAC/B,CACJ,ECtCO,IAAMO,EAAN,KAAwC,CAE9C,YAAYC,EAA4B,CADxCC,EAAA,KAAQ,aAAqC,WAEzCD,GAAS,YACX,KAAK,WAAaA,GAAS,UAG7B,CAEA,IAAW,MAAe,CACzB,OAAO,KAAK,UACb,CAEA,MAAa,OAAOE,EAAqC,CAExD,IAAMC,EAAa,MAAM,OAAO,OAAO,OAAO,KAAK,WAAYD,CAAI,EAQnE,OALkB,MAAM,KAAK,IAAI,WAAWC,CAAU,CAAC,EAErD,IAAKC,GAASA,EAAK,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,EAChD,KAAK,EAAE,CAGV,CACD,ECRO,IAAMC,EAAN,KAAmC,CAIzC,IAAW,MAAe,CACzB,MAAO,MACR,CAgBO,WAAWC,EAA4B,CAE7C,IAAIC,EAEJ,GAAID,aAAgB,WACnBC,EAAQD,UACEA,aAAgB,YAC1BC,EAAQ,IAAI,WAAWD,CAAI,UACjBA,aAAgB,SAC1BC,EAAQ,IAAI,WAAWD,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,MAC9D,CAEN,IAAME,EAAOF,EACbC,EAAQ,IAAI,WAAWC,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,CACrE,CAIA,IAAIC,EAAO,KAGX,QAASC,EAAI,EAAGA,EAAIH,EAAM,OAAQG,IACjCD,GAASA,GAAQ,GAAKA,EAAQF,EAAMG,CAAC,EAErCD,EAAOA,IAAS,EAMjB,OAFgBA,EAAK,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAGlD,CAgBA,MAAa,OAAOH,EAAqC,CACxD,OAAO,KAAK,WAAWA,CAAI,CAC5B,CACD,ECnFO,IAAMK,EAAN,KAAmC,CAItC,IAAW,MAAe,CACtB,MAAO,MACX,CAQO,WAAWC,EAA4B,CAE1C,IAAIC,EAEJ,GAAID,aAAgB,WAChBC,EAAQD,UACDA,aAAgB,YACvBC,EAAQ,IAAI,WAAWD,CAAI,UACpBA,aAAgB,SACvBC,EAAQ,IAAI,WAAWD,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,MACjE,CAEH,IAAME,EAAOF,EACbC,EAAQ,IAAI,WAAWC,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,CACxE,CAGA,IAAMC,EAAmB,WACnBC,EAAY,SAGdC,EAAOF,EAGX,QAASG,EAAI,EAAGA,EAAIL,EAAM,OAAQK,IAC9BD,EAAOA,EAAOD,EACdC,EAAOA,EAAOJ,EAAMK,CAAC,EAErBD,EAAOA,IAAS,EAMpB,OAFgBA,EAAK,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAGrD,CAQA,MAAa,OAAOL,EAAqC,CACrD,OAAO,KAAK,WAAWA,CAAI,CAC/B,CACJ,ECjDO,IAAMO,EAAN,KAAqC,CAQ3C,YAAYC,EAAe,EAAG,CAP9BC,EAAA,KAAQ,SAQP,KAAK,MAAQD,IAAS,CACvB,CAKA,IAAW,MAAe,CACzB,MAAO,QACR,CAKA,IAAW,MAAe,CACzB,OAAO,KAAK,KACb,CAgBO,WAAWE,EAA4B,CAE7C,IAAIC,EAEJ,GAAID,aAAgB,WACnBC,EAAQD,UACEA,aAAgB,YAC1BC,EAAQ,IAAI,WAAWD,CAAI,UACjBA,aAAgB,SAC1BC,EAAQ,IAAI,WAAWD,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,MAC9D,CAEN,IAAME,EAAOF,EACbC,EAAQ,IAAI,WAAWC,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,CACrE,CAGA,IAAMC,EAAK,WACLC,EAAK,UACLC,EAASJ,EAAM,OACfK,EAAU,KAAK,MAAMD,EAAS,CAAC,EAEjCE,EAAK,KAAK,MAGd,QAASC,EAAI,EAAGA,EAAIF,EAASE,IAAK,CACjC,IAAMC,EAAQD,EAAI,EACdE,EACFT,EAAMQ,CAAK,EAAI,KACdR,EAAMQ,EAAQ,CAAC,EAAI,MAAS,GAC5BR,EAAMQ,EAAQ,CAAC,EAAI,MAAS,IAC5BR,EAAMQ,EAAQ,CAAC,EAAI,MAAS,GAE/BC,EAAK,KAAK,MAAMA,EAAIP,CAAE,EACtBO,EAAK,KAAK,QAAQA,EAAI,EAAE,EACxBA,EAAK,KAAK,MAAMA,EAAIN,CAAE,EAEtBG,GAAMG,EACNH,EAAK,KAAK,QAAQA,EAAI,EAAE,EACxBA,EAAK,KAAK,MAAMA,EAAI,CAAC,EAAI,UAC1B,CAGA,IAAMI,EAAOL,EAAU,EACnBI,EAAK,EAET,OAAQL,EAAS,EAAG,CACnB,IAAK,GACJK,IAAOT,EAAMU,EAAO,CAAC,EAAI,MAAS,GAEnC,IAAK,GACJD,IAAOT,EAAMU,EAAO,CAAC,EAAI,MAAS,EAEnC,IAAK,GACJD,GAAMT,EAAMU,CAAI,EAAI,IACpBD,EAAK,KAAK,MAAMA,EAAIP,CAAE,EACtBO,EAAK,KAAK,QAAQA,EAAI,EAAE,EACxBA,EAAK,KAAK,MAAMA,EAAIN,CAAE,EACtBG,GAAMG,CACR,CAGA,OAAAH,GAAMF,EAENE,GAAMA,IAAO,GACbA,EAAK,KAAK,MAAMA,EAAI,UAAU,EAC9BA,GAAMA,IAAO,GACbA,EAAK,KAAK,MAAMA,EAAI,UAAU,EAC9BA,GAAMA,IAAO,GAGbA,EAAKA,IAAO,EAGIA,EAAG,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAGhD,CAgBA,MAAa,OAAOP,EAAqC,CACxD,OAAO,KAAK,WAAWA,CAAI,CAC5B,CAMQ,MAAMY,EAAWC,EAAmB,CAG3C,GAAI,KAAK,KACR,OAAO,KAAK,KAAKD,EAAGC,CAAC,EAKtB,IAAMC,EAAMF,IAAM,GAAM,MAExB,IAAMG,EAAKH,EAAI,MAEf,IAAMI,EAAMH,IAAM,GAAM,MAExB,IAAMI,EAAKJ,EAAI,MAGf,OAASE,EAAKE,GAASH,EAAKG,EAAKF,EAAKC,GAAO,KAAQ,GAAM,CAC5D,CAMQ,QAAQE,EAAWC,EAAmB,CAC7C,OAAQD,GAAKC,EAAMD,IAAO,GAAKC,CAChC,CACD,ECvLO,IAAMC,EAAN,KAAoB,CAc1B,YAAYC,EAAgC,CAb5CC,EAAA,KAAQ,aAAwC,IAAI,KACpDA,EAAA,KAAQ,YAAY,IAafD,GAAS,WACZ,KAAK,cAAcA,GAAS,SAAS,EAGlCA,GAAS,WAAa,SACzB,KAAK,UAAY,EAAQA,GAAS,SAEpC,CAeO,cAAcE,EAAgC,CACpD,QAAWC,KAAYD,EACtB,KAAK,WAAW,IAAIC,EAAS,KAAMA,CAAQ,CAE7C,CAMA,IAAW,WAAuC,CACjD,OAAO,KAAK,UACb,CAMA,IAAW,UAAUD,EAAsC,CAC1D,KAAK,WAAaA,CACnB,CAaA,IAAW,OAAuB,CACjC,OAAO,MAAM,KAAK,KAAK,WAAW,KAAK,CAAC,CACzC,CAgCO,IACNE,EACAJ,EAC2B,CAE3B,IAAMK,EAAWL,GAAS,OAAS,KAAK,UAGxCI,EAAOA,EAAK,KAAK,EAEjB,IAAIE,EAAS,KAAK,WAAW,IAAIF,CAAI,EAGrC,OAAIE,IAAW,QAAaD,IAAa,KACxCD,EAAOA,EAAK,YAAY,EACxBE,EAAS,KAAK,WAAW,IAAIF,CAAI,GAI9BE,IAAW,QAAaD,IAAa,KACxCD,EAAOA,EAAK,WAAW,IAAK,EAAE,EAC9BE,EAAS,KAAK,WAAW,IAAIF,CAAI,GAG3BE,CACR,CAkBO,IAAIH,EAA8B,CACxC,KAAK,WAAW,IAAIA,EAAS,KAAMA,CAAQ,CAC5C,CAcO,OAAOC,EAAuB,CACpC,OAAO,KAAK,WAAW,OAAOA,CAAI,CACnC,CACD,EP3JO,IAAMG,EAAN,cAAsBC,CAAU,CAQtC,YAAYC,EAA0B,CACrC,MAAMA,CAAO,EARdC,EAAA,KAAQ,SAAkB,KAAK,OAC/BA,EAAA,KAAQ,aAA0B,KAAK,WACvCA,EAAA,KAAQ,aAAa,IAAIC,GACzBD,EAAA,KAAQ,oBAA4B,WACpCA,EAAA,KAAQ,wBAAgC,QACxCA,EAAA,KAAQ,UAKHD,GAAS,QACZ,KAAK,OAASA,EAAQ,OAGnBA,GAAS,YACZ,KAAK,WAAaA,EAAQ,WAGvBA,GAAS,mBACZ,KAAK,kBAAoBA,EAAQ,kBAG9BA,GAAS,uBACZ,KAAK,sBAAwBA,EAAQ,sBAGtC,KAAK,OAAS,IAAIG,EAAMH,GAAS,KAAK,EAEtC,KAAK,cAAcA,GAAS,UAAW,CACtC,YAAaA,GAAS,aAAe,EACtC,CAAC,CACF,CAMA,IAAW,OAAiB,CAC3B,OAAO,KAAK,MACb,CAMA,IAAW,MAAMI,EAAgB,CAChC,KAAK,OAASA,CACf,CAMA,IAAW,WAAyB,CACnC,OAAO,KAAK,UACb,CAMA,IAAW,UAAUA,EAAoB,CACxC,KAAK,WAAaA,CACnB,CAMA,IAAW,WAA2B,CACrC,OAAO,KAAK,UACb,CAMA,IAAW,UAAUA,EAAsB,CAC1C,KAAK,WAAaA,CACnB,CAMA,IAAW,OAAuB,CACjC,OAAO,KAAK,WAAW,KACxB,CAMA,IAAW,kBAA2B,CACrC,OAAO,KAAK,iBACb,CAcA,IAAW,iBAAiBA,EAAe,CAC1C,KAAK,kBAAoBA,CAC1B,CAMA,IAAW,sBAA+B,CACzC,OAAO,KAAK,qBACb,CAaA,IAAW,qBAAqBA,EAAe,CAC9C,KAAK,sBAAwBA,CAC9B,CAeA,IAAW,OAAe,CACzB,OAAO,KAAK,MACb,CA4BA,MAAa,OACZC,EACAL,EACkB,CAElB,IAAMM,EAAU,CACf,KAAAD,EACA,UAAWL,GAAS,WAAa,KAAK,kBACtC,UAAWA,GAAS,SACrB,EACA,MAAM,KAAK,WAAW,SAAUM,CAAO,EAGvC,IAAMC,EAAc,KAAK,WAAWD,EAAQ,IAAI,EAG1CE,EAAW,GAAGF,EAAQ,SAAS,IAAIC,CAAW,GACpD,GAAI,KAAK,OAAO,QAAS,CACxB,IAAME,EAAS,KAAK,OAAO,IAAID,CAAQ,EACvC,GAAIC,IAAW,OAAW,CACzB,IAAIC,EAAaD,EAEbT,GAAS,WAAaU,EAAW,OAASV,EAAQ,YACrDU,EAAaA,EAAW,UAAU,EAAGV,EAAQ,SAAS,GAIvD,IAAMW,EAAS,CACd,KAAMD,EACN,KAAMJ,EAAQ,KACd,UAAWA,EAAQ,SACpB,EACA,aAAM,KAAK,UAAU,SAAUK,CAAM,EAE9BA,EAAO,IACf,CACD,CAIA,IAAMC,EADU,IAAI,YAAY,EACL,OAAOL,CAAW,EAGzCM,EAAW,KAAK,WAAW,IAAIP,EAAQ,SAAS,EAC/CO,IAEJ,KAAK,KACJ,OACA,sBAAsBP,EAAQ,SAAS,mDAAmD,KAAK,iBAAiB,IACjH,EAEAO,EAAW,IAAIC,EAAU,CACxB,UAAW,KAAK,iBACjB,CAAC,GAIF,IAAIC,EAAO,MAAMF,EAAS,OAAOD,CAAU,EAGvC,KAAK,OAAO,SACf,KAAK,OAAO,IAAIJ,EAAUO,CAAI,EAI3Bf,GAAS,WAAae,EAAK,OAASf,GAAS,YAChDe,EAAOA,EAAK,UAAU,EAAGf,EAAQ,SAAS,GAI3C,IAAMW,EAAS,CAAE,KAAAI,EAAM,KAAMT,EAAQ,KAAM,UAAWA,EAAQ,SAAU,EACxE,aAAM,KAAK,UAAU,SAAUK,CAAM,EAE9BA,EAAO,IACf,CA4BA,MAAa,SACZN,EACAL,EAAkC,CAAC,EACjB,CAClB,GAAM,CACL,IAAAgB,EAAM,EACN,IAAAC,EAAM,IACN,UAAAC,EAAY,KAAK,kBACjB,WAAAC,EAAa,EACd,EAAInB,EAEJ,GAAIgB,EAAMC,EACT,MAAM,IAAI,MAAM,gCAAgC,EAMjD,IAAMF,EAAO,MAAM,KAAK,OAAOV,EAAM,CAAE,UAAAa,EAAW,UAAWC,CAAW,CAAC,EAGnEC,EAAa,OAAO,SAASL,EAAM,EAAE,EAGrCM,EAAQJ,EAAMD,EAAM,EAG1B,OAFeA,EAAOI,EAAaC,CAGpC,CAkCO,WAAWhB,EAAeL,EAA4C,CAE5E,IAAMM,EAAU,CACf,KAAAD,EACA,UAAWL,GAAS,WAAa,KAAK,sBACtC,UAAWA,GAAS,SACrB,EACA,KAAK,SAAS,oBAAqBM,CAAO,EAG1C,IAAMY,EAAYZ,EAAQ,UAGpBC,EAAc,KAAK,WAAWD,EAAQ,IAAI,EAG1CE,EAAW,GAAGU,CAAS,IAAIX,CAAW,GAC5C,GAAI,KAAK,OAAO,QAAS,CACxB,IAAME,EAAS,KAAK,OAAO,IAAID,CAAQ,EACvC,GAAIC,IAAW,OAAW,CACzB,IAAIC,EAAaD,EAEbT,GAAS,WAAaU,EAAW,OAASV,EAAQ,YACrDU,EAAaA,EAAW,UAAU,EAAGV,EAAQ,SAAS,GAIvD,IAAMW,EAAS,CACd,KAAMD,EACN,KAAMJ,EAAQ,KACd,UAAAY,CACD,EACA,YAAK,SAAS,mBAAoBP,CAAM,EAEjCA,EAAO,IACf,CACD,CAIA,IAAMC,EADU,IAAI,YAAY,EACL,OAAOL,CAAW,EAGzCM,EAAW,KAAK,WAAW,IAAIK,CAAS,EAC5C,GAAI,CAACL,IAEJ,KAAK,KACJ,OACA,sBAAsBK,CAAS,mDAAmD,KAAK,qBAAqB,IAC7G,EAGAL,EAAW,KAAK,WAAW,IAAI,KAAK,qBAAqB,EAGrD,CAACA,GACJ,MAAM,IAAI,MACT,kBAAkB,KAAK,qBAAqB,uBAC7C,EAKF,GAAI,CAACA,EAAS,WACb,MAAM,IAAI,MACT,kBAAkBK,CAAS,2HAC5B,EAID,IAAIH,EAAOF,EAAS,WAAWD,CAAU,EAGrC,KAAK,OAAO,SACf,KAAK,OAAO,IAAIJ,EAAUO,CAAI,EAI3Bf,GAAS,WAAae,EAAK,OAASf,GAAS,YAChDe,EAAOA,EAAK,UAAU,EAAGf,EAAQ,SAAS,GAI3C,IAAMW,EAAS,CAAE,KAAAI,EAAM,KAAMT,EAAQ,KAAM,UAAWA,EAAQ,SAAU,EACxE,YAAK,SAAS,mBAAoBK,CAAM,EAEjCA,EAAO,IACf,CAiCO,aACNN,EACAL,EAAsC,CAAC,EAC9B,CACT,GAAM,CACL,IAAAgB,EAAM,EACN,IAAAC,EAAM,IACN,UAAAC,EAAY,KAAK,sBACjB,WAAAC,EAAa,EACd,EAAInB,EAEJ,GAAIgB,EAAMC,EACT,MAAM,IAAI,MAAM,gCAAgC,EAMjD,IAAMF,EAAO,KAAK,WAAWV,EAAM,CAAE,UAAAa,EAAW,UAAWC,CAAW,CAAC,EAGjEC,EAAa,OAAO,SAASL,EAAM,EAAE,EAGrCM,EAAQJ,EAAMD,EAAM,EAG1B,OAFeA,EAAOI,EAAaC,CAGpC,CAEO,cACNC,EACAtB,EAAsC,CAAE,YAAa,EAAK,EACnD,CACP,GAAIsB,EACH,QAAWT,KAAYS,EACtB,KAAK,WAAW,IAAIT,CAAQ,EAK1Bb,EAAQ,cACX,KAAK,UAAU,IAAI,IAAIc,EAAU,CAAE,UAAW,SAAU,CAAC,CAAC,EAC1D,KAAK,UAAU,IAAI,IAAIA,EAAU,CAAE,UAAW,SAAU,CAAC,CAAC,EAC1D,KAAK,UAAU,IAAI,IAAIA,EAAU,CAAE,UAAW,SAAU,CAAC,CAAC,EAC1D,KAAK,UAAU,IAAI,IAAIS,CAAK,EAC5B,KAAK,UAAU,IAAI,IAAIC,CAAM,EAC7B,KAAK,UAAU,IAAI,IAAIC,CAAM,EAC7B,KAAK,UAAU,IAAI,IAAIC,CAAQ,EAEjC,CACD","names":["Hookified","Cache","options","__publicField","value","key","oldestKey","CRC","data","bytes","view","CRC32_POLYNOMIAL","crc","i","j","WebCrypto","options","__publicField","data","hashBuffer","byte","DJB2","data","bytes","view","hash","i","FNV1","data","bytes","view","FNV_OFFSET_BASIS","FNV_PRIME","hash","i","Murmur","seed","__publicField","data","bytes","view","c1","c2","length","nblocks","h1","i","index","k1","tail","a","b","ah","al","bh","bl","x","r","HashProviders","options","__publicField","providers","provider","name","getFuzzy","result","Hashery","Hookified","options","__publicField","HashProviders","Cache","value","data","context","stringified","cacheKey","cached","cachedHash","result","dataBuffer","provider","WebCrypto","hash","min","max","algorithm","hashLength","hashNumber","range","providers","CRC","DJB2","FNV1","Murmur"]}