inray 0.0.2 → 0.0.3

package/dist/caching/src/hashing/index.js

@@ -0,0 +1,447 @@
+/**
+ * Original library: hashery (v1.5.1)
+ * - Copyright (c) 2025 Jared Wray
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+import { Hookified } from "./hooks/index.js";
+import { Cache } from "./cache.js";
+import { CRC } from "./providers/crc.js";
+import { WebCrypto } from "./providers/crypto.js";
+import { DJB2 } from "./providers/djb2.js";
+import { FNV1 } from "./providers/fnv1.js";
+import { Murmur } from "./providers/murmur.js";
+import { HashProviders } from "./providers.js";
+export class Hashery extends Hookified {
+    _parse = JSON.parse;
+    _stringify = JSON.stringify;
+    _providers = new HashProviders();
+    _defaultAlgorithm = 'SHA-256';
+    _defaultAlgorithmSync = 'djb2';
+    _cache;
+    constructor(options) {
+        super(options);
+        if (options?.parse) {
+            this._parse = options.parse;
+        }
+        if (options?.stringify) {
+            this._stringify = options.stringify;
+        }
+        if (options?.defaultAlgorithm) {
+            this._defaultAlgorithm = options.defaultAlgorithm;
+        }
+        if (options?.defaultAlgorithmSync) {
+            this._defaultAlgorithmSync = options.defaultAlgorithmSync;
+        }
+        this._cache = new Cache(options?.cache);
+        this.loadProviders(options?.providers, {
+            includeBase: options?.includeBase ?? true
+        });
+    }
+    /**
+     * Gets the parse function used to deserialize stored values.
+     * @returns The current parse function (defaults to JSON.parse)
+     */
+    get parse() {
+        return this._parse;
+    }
+    /**
+     * Sets the parse function used to deserialize stored values.
+     * @param value - The parse function to use for deserialization
+     */
+    set parse(value) {
+        this._parse = value;
+    }
+    /**
+     * Gets the stringify function used to serialize values for storage.
+     * @returns The current stringify function (defaults to JSON.stringify)
+     */
+    get stringify() {
+        return this._stringify;
+    }
+    /**
+     * Sets the stringify function used to serialize values for storage.
+     * @param value - The stringify function to use for serialization
+     */
+    set stringify(value) {
+        this._stringify = value;
+    }
+    /**
+     * Gets the HashProviders instance used to manage hash providers.
+     * @returns The current HashProviders instance
+     */
+    get providers() {
+        return this._providers;
+    }
+    /**
+     * Sets the HashProviders instance used to manage hash providers.
+     * @param value - The HashProviders instance to use
+     */
+    set providers(value) {
+        this._providers = value;
+    }
+    /**
+     * Gets the names of all registered hash algorithm providers.
+     * @returns An array of provider names (e.g., ['SHA-256', 'SHA-384', 'SHA-512'])
+     */
+    get names() {
+        return this._providers.names;
+    }
+    /**
+     * Gets the default hash algorithm used when none is specified.
+     * @returns The current default algorithm (defaults to 'SHA-256')
+     */
+    get defaultAlgorithm() {
+        return this._defaultAlgorithm;
+    }
+    /**
+     * Sets the default hash algorithm to use when none is specified.
+     * @param value - The default algorithm to use (e.g., 'SHA-256', 'SHA-512', 'djb2')
+     * @example
+     * ```ts
+     * const hashery = new Hashery();
+     * hashery.defaultAlgorithm = 'SHA-512';
+     *
+     * // Now toHash will use SHA-512 by default
+     * const hash = await hashery.toHash({ data: 'example' });
+     * ```
+     */
+    set defaultAlgorithm(value) {
+        this._defaultAlgorithm = value;
+    }
+    /**
+     * Gets the default synchronous hash algorithm used when none is specified.
+     * @returns The current default synchronous algorithm (defaults to 'djb2')
+     */
+    get defaultAlgorithmSync() {
+        return this._defaultAlgorithmSync;
+    }
+    /**
+     * Sets the default synchronous hash algorithm to use when none is specified.
+     * @param value - The default synchronous algorithm to use (e.g., 'djb2', 'fnv1', 'murmur', 'crc32')
+     * @example
+     * ```ts
+     * const hashery = new Hashery();
+     * hashery.defaultAlgorithmSync = 'fnv1';
+     *
+     * // Now synchronous operations will use fnv1 by default
+     * ```
+     */
+    set defaultAlgorithmSync(value) {
+        this._defaultAlgorithmSync = value;
+    }
+    /**
+     * Gets the cache instance used to store computed hash values.
+     * @returns The Cache instance
+     * @example
+     * ```ts
+     * const hashery = new Hashery({ cache: { enabled: true } });
+     *
+     * // Access the cache
+     * hashery.cache.enabled; // true
+     * hashery.cache.size; // number of cached items
+     * hashery.cache.clear(); // clear all cached items
+     * ```
+     */
+    get cache() {
+        return this._cache;
+    }
+    /**
+     * Generates a cryptographic hash of the provided data using the Web Crypto API.
+     * The data is first stringified using the configured stringify function, then hashed.
+     *
+     * If an invalid algorithm is provided, a 'warn' event is emitted and the method falls back
+     * to the default algorithm. You can listen to these warnings:
+     * ```ts
+     * hashery.on('warn', (message) => console.log(message));
+     * ```
+     *
+     * @param data - The data to hash (will be stringified before hashing)
+     * @param options - Optional configuration object
+     * @param options.algorithm - The hash algorithm to use (defaults to 'SHA-256')
+     * @param options.maxLength - Optional maximum length for the hash output
+     * @returns A Promise that resolves to the hexadecimal string representation of the hash
+     *
+     * @example
+     * ```ts
+     * const hashery = new Hashery();
+     * const hash = await hashery.toHash({ name: 'John', age: 30 });
+     * console.log(hash); // "a1b2c3d4..."
+     *
+     * // Using a different algorithm
+     * const hash512 = await hashery.toHash({ name: 'John' }, { algorithm: 'SHA-512' });
+     * ```
+     */
+    async toHash(data, options) {
+        // Before hook - allows modification of input data and algorithm
+        const context = {
+            data,
+            algorithm: options?.algorithm ?? this._defaultAlgorithm,
+            maxLength: options?.maxLength
+        };
+        await this.beforeHook('toHash', context);
+        // Stringify the data using the configured stringify function
+        const stringified = this._stringify(context.data);
+        // Check cache first
+        const cacheKey = `${context.algorithm}:${stringified}`;
+        if (this._cache.enabled) {
+            const cached = this._cache.get(cacheKey);
+            if (cached !== undefined) {
+                let cachedHash = cached;
+                // Apply maxLength if specified
+                if (options?.maxLength && cachedHash.length > options.maxLength) {
+                    cachedHash = cachedHash.substring(0, options.maxLength);
+                }
+                // After hook - run even on cache hits for consistent behavior
+                const result = {
+                    hash: cachedHash,
+                    data: context.data,
+                    algorithm: context.algorithm
+                };
+                await this.afterHook('toHash', result);
+                return result.hash;
+            }
+        }
+        // Convert the string to a Uint8Array
+        const encoder = new TextEncoder();
+        const dataBuffer = encoder.encode(stringified);
+        // Get the provider for the specified algorithm
+        let provider = this._providers.get(context.algorithm);
+        if (!provider) {
+            // Emit warning for invalid algorithm
+            this.emit('warn', `Invalid algorithm '${context.algorithm}' not found. Falling back to default algorithm '${this._defaultAlgorithm}'.`);
+            provider = new WebCrypto({
+                algorithm: this._defaultAlgorithm
+            });
+        }
+        // Use the provider to hash the data
+        let hash = await provider.toHash(dataBuffer);
+        // Store the full hash in cache before truncation
+        if (this._cache.enabled) {
+            this._cache.set(cacheKey, hash);
+        }
+        // if there is a max then change the hash
+        if (options?.maxLength && hash.length > options?.maxLength) {
+            hash = hash.substring(0, options.maxLength);
+        }
+        // After hook - allows modification/logging of result
+        const result = { hash, data: context.data, algorithm: context.algorithm };
+        await this.afterHook('toHash', result);
+        return result.hash;
+    }
+    /**
+     * Generates a deterministic number within a specified range based on the hash of the provided data.
+     * This method uses the toHash function to create a consistent hash, then maps it to a number
+     * between min and max (inclusive).
+     *
+     * @param data - The data to hash (will be stringified before hashing)
+     * @param options - Configuration options (optional, defaults to min: 0, max: 100)
+     * @param options.min - The minimum value of the range (inclusive, defaults to 0)
+     * @param options.max - The maximum value of the range (inclusive, defaults to 100)
+     * @param options.algorithm - The hash algorithm to use (defaults to 'SHA-256')
+     * @param options.hashLength - Number of characters from hash to use for conversion (defaults to 16)
+     * @returns A Promise that resolves to a number between min and max (inclusive)
+     *
+     * @example
+     * ```ts
+     * const hashery = new Hashery();
+     * const num = await hashery.toNumber({ user: 'john' }); // Uses default min: 0, max: 100
+     * console.log(num); // Always returns the same number for the same input, e.g., 42
+     *
+     * // Using custom range
+     * const num2 = await hashery.toNumber({ user: 'john' }, { min: 1, max: 100 });
+     *
+     * // Using a different algorithm
+     * const num512 = await hashery.toNumber({ user: 'john' }, { min: 0, max: 255, algorithm: 'SHA-512' });
+     * ```
+     */
+    async toNumber(data, options = {}) {
+        const { min = 0, max = 100, algorithm = this._defaultAlgorithm, hashLength = 16 } = options;
+        if (min > max) {
+            throw new Error('min cannot be greater than max');
+        }
+        // Get the hash as a hex string
+        // Take the first hashLength characters of the hash to convert to a number
+        // This provides good distribution while avoiding precision issues with JavaScript numbers
+        const hash = await this.toHash(data, { algorithm, maxLength: hashLength });
+        // Convert hex to a number
+        const hashNumber = Number.parseInt(hash, 16);
+        // Map the hash number to the desired range
+        const range = max - min + 1;
+        const mapped = min + (hashNumber % range);
+        return mapped;
+    }
+    /**
+     * Generates a hash of the provided data synchronously using a non-cryptographic hash algorithm.
+     * The data is first stringified using the configured stringify function, then hashed.
+     *
+     * Note: This method only works with synchronous hash providers (djb2, fnv1, murmur, crc32).
+     * WebCrypto algorithms (SHA-256, SHA-384, SHA-512) are not supported and will throw an error.
+     *
+     * If an invalid algorithm is provided, a 'warn' event is emitted and the method falls back
+     * to the default synchronous algorithm. You can listen to these warnings:
+     * ```ts
+     * hashery.on('warn', (message) => console.log(message));
+     * ```
+     *
+     * @param data - The data to hash (will be stringified before hashing)
+     * @param options - Optional configuration object
+     * @param options.algorithm - The hash algorithm to use (defaults to 'djb2')
+     * @param options.maxLength - Optional maximum length for the hash output
+     * @returns The hexadecimal string representation of the hash
+     *
+     * @throws {Error} If the specified algorithm does not support synchronous hashing
+     * @throws {Error} If the default algorithm is not found
+     *
+     * @example
+     * ```ts
+     * const hashery = new Hashery();
+     * const hash = hashery.toHashSync({ name: 'John', age: 30 });
+     * console.log(hash); // "7c9df5ea..." (djb2 hash)
+     *
+     * // Using a different algorithm
+     * const hashFnv1 = hashery.toHashSync({ name: 'John' }, { algorithm: 'fnv1' });
+     * ```
+     */
+    toHashSync(data, options) {
+        // Before hook - allows modification of input data and algorithm (synchronous/blocking)
+        const context = {
+            data,
+            algorithm: options?.algorithm ?? this._defaultAlgorithmSync,
+            maxLength: options?.maxLength
+        };
+        this.hookSync('before:toHashSync', context);
+        // Get algorithm from context (may have been modified by hook)
+        const algorithm = context.algorithm;
+        // Stringify the data using the configured stringify function
+        const stringified = this._stringify(context.data);
+        // Check cache first
+        const cacheKey = `${algorithm}:${stringified}`;
+        if (this._cache.enabled) {
+            const cached = this._cache.get(cacheKey);
+            if (cached !== undefined) {
+                let cachedHash = cached;
+                // Apply maxLength if specified
+                if (options?.maxLength && cachedHash.length > options.maxLength) {
+                    cachedHash = cachedHash.substring(0, options.maxLength);
+                }
+                // After hook - run even on cache hits for consistent behavior
+                const result = {
+                    hash: cachedHash,
+                    data: context.data,
+                    algorithm
+                };
+                this.hookSync('after:toHashSync', result);
+                return result.hash;
+            }
+        }
+        // Convert the string to a Uint8Array
+        const encoder = new TextEncoder();
+        const dataBuffer = encoder.encode(stringified);
+        // Get the provider for the specified algorithm
+        let provider = this._providers.get(algorithm);
+        if (!provider) {
+            // Emit warning for invalid algorithm
+            this.emit('warn', `Invalid algorithm '${algorithm}' not found. Falling back to default algorithm '${this._defaultAlgorithmSync}'.`);
+            // Fallback to default sync algorithm
+            provider = this._providers.get(this._defaultAlgorithmSync);
+            // If default algorithm is also not found, throw error
+            if (!provider) {
+                throw new Error(`Hash provider '${this._defaultAlgorithmSync}' (default) not found`);
+            }
+        }
+        // Check if provider supports synchronous hashing
+        if (!provider.toHashSync) {
+            throw new Error(`Hash provider '${algorithm}' does not support synchronous hashing. Use toHash() instead or choose a different algorithm (djb2, fnv1, murmur, crc32).`);
+        }
+        // Use the provider to hash the data synchronously
+        let hash = provider.toHashSync(dataBuffer);
+        // Store the full hash in cache before truncation
+        if (this._cache.enabled) {
+            this._cache.set(cacheKey, hash);
+        }
+        // if there is a max then change the hash
+        if (options?.maxLength && hash.length > options?.maxLength) {
+            hash = hash.substring(0, options.maxLength);
+        }
+        // After hook - allows modification/logging of result (synchronous/blocking)
+        const result = { hash, data: context.data, algorithm: context.algorithm };
+        this.hookSync('after:toHashSync', result);
+        return result.hash;
+    }
+    /**
+     * Generates a deterministic number within a specified range based on the hash of the provided data synchronously.
+     * This method uses the toHashSync function to create a consistent hash, then maps it to a number
+     * between min and max (inclusive).
+     *
+     * Note: This method only works with synchronous hash providers (djb2, fnv1, murmur, crc32).
+     *
+     * @param data - The data to hash (will be stringified before hashing)
+     * @param options - Configuration options (optional, defaults to min: 0, max: 100)
+     * @param options.min - The minimum value of the range (inclusive, defaults to 0)
+     * @param options.max - The maximum value of the range (inclusive, defaults to 100)
+     * @param options.algorithm - The hash algorithm to use (defaults to 'djb2')
+     * @param options.hashLength - Number of characters from hash to use for conversion (defaults to 16)
+     * @returns A number between min and max (inclusive)
+     *
+     * @throws {Error} If the specified algorithm does not support synchronous hashing
+     * @throws {Error} If min is greater than max
+     *
+     * @example
+     * ```ts
+     * const hashery = new Hashery();
+     * const num = hashery.toNumberSync({ user: 'john' }); // Uses default min: 0, max: 100
+     * console.log(num); // Always returns the same number for the same input, e.g., 42
+     *
+     * // Using custom range
+     * const num2 = hashery.toNumberSync({ user: 'john' }, { min: 1, max: 100 });
+     *
+     * // Using a different algorithm
+     * const numFnv1 = hashery.toNumberSync({ user: 'john' }, { min: 0, max: 255, algorithm: 'fnv1' });
+     * ```
+     */
+    toNumberSync(data, options = {}) {
+        const { min = 0, max = 100, algorithm = this._defaultAlgorithmSync, hashLength = 16 } = options;
+        if (min > max) {
+            throw new Error('min cannot be greater than max');
+        }
+        // Get the hash as a hex string
+        // Take the first hashLength characters of the hash to convert to a number
+        // This provides good distribution while avoiding precision issues with JavaScript numbers
+        const hash = this.toHashSync(data, { algorithm, maxLength: hashLength });
+        // Convert hex to a number
+        const hashNumber = Number.parseInt(hash, 16);
+        // Map the hash number to the desired range
+        const range = max - min + 1;
+        const mapped = min + (hashNumber % range);
+        return mapped;
+    }
+    loadProviders(providers, options = { includeBase: true }) {
+        if (providers) {
+            for (const provider of providers) {
+                this._providers.add(provider);
+            }
+        }
+        // load all the providers
+        if (options.includeBase) {
+            this.providers.add(new WebCrypto({ algorithm: 'SHA-256' }));
+            this.providers.add(new WebCrypto({ algorithm: 'SHA-384' }));
+            this.providers.add(new WebCrypto({ algorithm: 'SHA-512' }));
+            this.providers.add(new CRC());
+            this.providers.add(new DJB2());
+            this.providers.add(new FNV1());
+            this.providers.add(new Murmur());
+        }
+    }
+}
+// Classes
+export { Cache } from './cache.js';
+export { CRC } from './providers/crc.js';
+export { WebCrypto } from './providers/crypto.js';
+export { DJB2 } from './providers/djb2.js';
+export { FNV1 } from './providers/fnv1.js';
+export { Murmur } from './providers/murmur.js';
+export { HashProviders } from './providers.js';
+//# sourceMappingURL=index.js.map

package/dist/caching/src/hashing/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/caching/src/hashing/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAEL,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,GAAG,EAAE,MAAM,oBAAoB,CAAC;AACzC,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAC3C,OAAO,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAC3C,OAAO,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAc/C,MAAM,OAAO,OAAQ,SAAQ,SAAS;IAC5B,MAAM,GAAY,IAAI,CAAC,KAAK,CAAC;IAC7B,UAAU,GAAgB,IAAI,CAAC,SAAS,CAAC;IACzC,UAAU,GAAG,IAAI,aAAa,EAAE,CAAC;IACjC,iBAAiB,GAAW,SAAS,CAAC;IACtC,qBAAqB,GAAW,MAAM,CAAC;IACvC,MAAM,CAAQ;IAEtB,YAAY,OAAwB;QAClC,KAAK,CAAC,OAAO,CAAC,CAAC;QAEf,IAAI,OAAO,EAAE,KAAK,EAAE,CAAC;YACnB,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC;QAC9B,CAAC;QAED,IAAI,OAAO,EAAE,SAAS,EAAE,CAAC;YACvB,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,SAAS,CAAC;QACtC,CAAC;QAED,IAAI,OAAO,EAAE,gBAAgB,EAAE,CAAC;YAC9B,IAAI,CAAC,iBAAiB,GAAG,OAAO,CAAC,gBAAgB,CAAC;QACpD,CAAC;QAED,IAAI,OAAO,EAAE,oBAAoB,EAAE,CAAC;YAClC,IAAI,CAAC,qBAAqB,GAAG,OAAO,CAAC,oBAAoB,CAAC;QAC5D,CAAC;QAED,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAExC,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,SAAS,EAAE;YACrC,WAAW,EAAE,OAAO,EAAE,WAAW,IAAI,IAAI;SAC1C,CAAC,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,IAAW,KAAK;QACd,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,IAAW,KAAK,CAAC,KAAc;QAC7B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED;;;OAGG;IACH,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,IAAW,SAAS,CAAC,KAAkB;QACrC,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,IAAW,SAAS,CAAC,KAAoB;QACvC,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,IAAW,KAAK;QACd,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACH,IAAW,gBAAgB;QACzB,OAAO,IAAI,CAAC,iBAAiB,CAAC;IAChC,CAAC;IAED;;;;;;;;;;;OAWG;IACH,IAAW,gBAAgB,CAAC,KAAa;QACvC,IAAI,CAAC,iBAAiB,GAAG,KAAK,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,IAAW,oBAAoB;QAC7B,OAAO,IAAI,CAAC,qBAAqB,CAAC;IACpC,CAAC;IAED;;;;;;;;;;OAUG;IACH,IAAW,oBAAoB,CAAC,KAAa;QAC3C,IAAI,CAAC,qBAAqB,GAAG,KAAK,CAAC;IACrC,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,IAAW,KAAK;QACd,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;OAyBG;IACI,KAAK,CAAC,MAAM,CAAC,IAAa,EAAE,OAA8B;QAC/D,gEAAgE;QAChE,MAAM,OAAO,GAAG;YACd,IAAI;YACJ,SAAS,EAAE,OAAO,EAAE,SAAS,IAAI,IAAI,CAAC,iBAAiB;YACvD,SAAS,EAAE,OAAO,EAAE,SAAS;SAC9B,CAAC;QACF,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAEzC,6DAA6D;QAC7D,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAElD,oBAAoB;QACpB,MAAM,QAAQ,GAAG,GAAG,OAAO,CAAC,SAAS,IAAI,WAAW,EAAE,CAAC;QACvD,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACzC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,IAAI,UAAU,GAAG,MAAM,CAAC;gBACxB,+BAA+B;gBAC/B,IAAI,OAAO,EAAE,SAAS,IAAI,UAAU,CAAC,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;oBAChE,UAAU,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1D,CAAC;gBAED,8DAA8D;gBAC9D,MAAM,MAAM,GAAG;oBACb,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,OAAO,CAAC,IAAI;oBAClB,SAAS,EAAE,OAAO,CAAC,SAAS;iBAC7B,CAAC;gBACF,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;gBAEvC,OAAO,MAAM,CAAC,IAAI,CAAC;YACrB,CAAC;QACH,CAAC;QAED,qCAAqC;QACrC,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAE/C,+CAA+C;QAC/C,IAAI,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACtD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,qCAAqC;YACrC,IAAI,CAAC,IAAI,CACP,MAAM,EACN,sBAAsB,OAAO,CAAC,SAAS,mDAAmD,IAAI,CAAC,iBAAiB,IAAI,CACrH,CAAC;YAEF,QAAQ,GAAG,IAAI,SAAS,CAAC;gBACvB,SAAS,EAAE,IAAI,CAAC,iBAA2C;aAC5D,CAAC,CAAC;QACL,CAAC;QAED,oCAAoC;QACpC,IAAI,IAAI,GAAG,MAAM,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAE7C,iDAAiD;QACjD,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAClC,CAAC;QAED,yCAAyC;QACzC,IAAI,OAAO,EAAE,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,OAAO,EAAE,SAAS,EAAE,CAAC;YAC3D,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;QAC9C,CAAC;QAED,qDAAqD;QACrD,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC;QAC1E,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAEvC,OAAO,MAAM,CAAC,IAAI,CAAC;IACrB,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;OAyBG;IACI,KAAK,CAAC,QAAQ,CAAC,IAAa,EAAE,UAAkC,EAAE;QACvE,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,SAAS,GAAG,IAAI,CAAC,iBAAiB,EAAE,UAAU,GAAG,EAAE,EAAE,GAAG,OAAO,CAAC;QAE5F,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACpD,CAAC;QAED,+BAA+B;QAC/B,0EAA0E;QAC1E,0FAA0F;QAC1F,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC,CAAC;QAE3E,0BAA0B;QAC1B,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAE7C,2CAA2C;QAC3C,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;QAC5B,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC;QAE1C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA+BG;IACI,UAAU,CAAC,IAAa,EAAE,OAAkC;QACjE,uFAAuF;QACvF,MAAM,OAAO,GAAG;YACd,IAAI;YACJ,SAAS,EAAE,OAAO,EAAE,SAAS,IAAI,IAAI,CAAC,qBAAqB;YAC3D,SAAS,EAAE,OAAO,EAAE,SAAS;SAC9B,CAAC;QACF,IAAI,CAAC,QAAQ,CAAC,mBAAmB,EAAE,OAAO,CAAC,CAAC;QAE5C,8DAA8D;QAC9D,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;QAEpC,6DAA6D;QAC7D,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAElD,oBAAoB;QACpB,MAAM,QAAQ,GAAG,GAAG,SAAS,IAAI,WAAW,EAAE,CAAC;QAC/C,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACzC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,IAAI,UAAU,GAAG,MAAM,CAAC;gBACxB,+BAA+B;gBAC/B,IAAI,OAAO,EAAE,SAAS,IAAI,UAAU,CAAC,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;oBAChE,UAAU,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1D,CAAC;gBAED,8DAA8D;gBAC9D,MAAM,MAAM,GAAG;oBACb,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,OAAO,CAAC,IAAI;oBAClB,SAAS;iBACV,CAAC;gBACF,IAAI,CAAC,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC,CAAC;gBAE1C,OAAO,MAAM,CAAC,IAAI,CAAC;YACrB,CAAC;QACH,CAAC;QAED,qCAAqC;QACrC,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAE/C,+CAA+C;QAC/C,IAAI,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,qCAAqC;YACrC,IAAI,CAAC,IAAI,CACP,MAAM,EACN,sBAAsB,SAAS,mDAAmD,IAAI,CAAC,qBAAqB,IAAI,CACjH,CAAC;YAEF,qCAAqC;YACrC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;YAE3D,sDAAsD;YACtD,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,MAAM,IAAI,KAAK,CAAC,kBAAkB,IAAI,CAAC,qBAAqB,uBAAuB,CAAC,CAAC;YACvF,CAAC;QACH,CAAC;QAED,iDAAiD;QACjD,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CACb,kBAAkB,SAAS,2HAA2H,CACvJ,CAAC;QACJ,CAAC;QAED,kDAAkD;QAClD,IAAI,IAAI,GAAG,QAAQ,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAE3C,iDAAiD;QACjD,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAClC,CAAC;QAED,yCAAyC;QACzC,IAAI,OAAO,EAAE,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,OAAO,EAAE,SAAS,EAAE,CAAC;YAC3D,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;QAC9C,CAAC;QAED,4EAA4E;QAC5E,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC;QAC1E,IAAI,CAAC,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC,CAAC;QAE1C,OAAO,MAAM,CAAC,IAAI,CAAC;IACrB,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA8BG;IACI,YAAY,CAAC,IAAa,EAAE,UAAsC,EAAE;QACzE,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,SAAS,GAAG,IAAI,CAAC,qBAAqB,EAAE,UAAU,GAAG,EAAE,EAAE,GAAG,OAAO,CAAC;QAEhG,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACpD,CAAC;QAED,+BAA+B;QAC/B,0EAA0E;QAC1E,0FAA0F;QAC1F,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC,CAAC;QAEzE,0BAA0B;QAC1B,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAE7C,2CAA2C;QAC3C,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;QAC5B,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC;QAE1C,OAAO,MAAM,CAAC;IAChB,CAAC;IAEM,aAAa,CAClB,SAA+B,EAC/B,UAAsC,EAAE,WAAW,EAAE,IAAI,EAAE;QAE3D,IAAI,SAAS,EAAE,CAAC;YACd,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;YACxB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;YAC5D,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;YAC5D,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;YAC5D,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;YAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;YAC/B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;YAC/B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;CACF;AAID,UAAU;AACV,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,GAAG,EAAE,MAAM,oBAAoB,CAAC;AAEzC,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAC3C,OAAO,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAC3C,OAAO,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC"}

package/dist/caching/src/hashing/providers/crc.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Original library: hashery (v1.5.1)
+ * - Copyright (c) 2025 Jared Wray
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+import type { HashProvider } from '../types.ts';
+export declare class CRC implements HashProvider {
+    get name(): string;
+    toHashSync(data: BufferSource): string;
+    toHash(data: BufferSource): Promise<string>;
+}
+//# sourceMappingURL=crc.d.ts.map

package/dist/caching/src/hashing/providers/crc.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"crc.d.ts","sourceRoot":"","sources":["../../../../../src/caching/src/hashing/providers/crc.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAEL,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAEhD,qBAAa,GAAI,YAAW,YAAY;IACtC,IAAW,IAAI,IAAI,MAAM,CAExB;IAEM,UAAU,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM;IAmChC,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC;CAGzD"}

package/dist/caching/src/hashing/providers/crc.js

@@ -0,0 +1,49 @@
+/**
+ * Original library: hashery (v1.5.1)
+ * - Copyright (c) 2025 Jared Wray
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+export class CRC {
+    get name() {
+        return 'crc32';
+    }
+    toHashSync(data) {
+        // Convert BufferSource to Uint8Array
+        let bytes;
+        if (data instanceof Uint8Array) {
+            bytes = data;
+        }
+        else if (data instanceof ArrayBuffer) {
+            bytes = new Uint8Array(data);
+        }
+        else if (data instanceof DataView) {
+            bytes = new Uint8Array(data.buffer, data.byteOffset, data.byteLength);
+        }
+        else {
+            const view = data;
+            bytes = new Uint8Array(view.buffer, view.byteOffset, view.byteLength);
+        }
+        // CRC-32 algorithm (IEEE 802.3 polynomial)
+        // This is the same algorithm used by PHP's crc32() function
+        const CRC32_POLYNOMIAL = 0xedb88320;
+        let crc = 0xffffffff;
+        for (let i = 0; i < bytes.length; i++) {
+            crc = crc ^ bytes[i];
+            for (let j = 0; j < 8; j++) {
+                crc = (crc >>> 1) ^ (CRC32_POLYNOMIAL & -(crc & 1));
+            }
+        }
+        // Finalize CRC
+        crc = (crc ^ 0xffffffff) >>> 0;
+        // Convert to hexadecimal string (8 characters, zero-padded)
+        const hashHex = crc.toString(16).padStart(8, '0');
+        return hashHex;
+    }
+    async toHash(data) {
+        return this.toHashSync(data);
+    }
+}
+//# sourceMappingURL=crc.js.map

package/dist/caching/src/hashing/providers/crc.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"crc.js","sourceRoot":"","sources":["../../../../../src/caching/src/hashing/providers/crc.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAIL,MAAM,OAAO,GAAG;IACd,IAAW,IAAI;QACb,OAAO,OAAO,CAAC;IACjB,CAAC;IAEM,UAAU,CAAC,IAAkB;QAClC,qCAAqC;QACrC,IAAI,KAAiB,CAAC;QAEtB,IAAI,IAAI,YAAY,UAAU,EAAE,CAAC;YAC/B,KAAK,GAAG,IAAI,CAAC;QACf,CAAC;aAAM,IAAI,IAAI,YAAY,WAAW,EAAE,CAAC;YACvC,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;aAAM,IAAI,IAAI,YAAY,QAAQ,EAAE,CAAC;YACpC,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACxE,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,IAAuB,CAAC;YACrC,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACxE,CAAC;QAED,2CAA2C;QAC3C,4DAA4D;QAC5D,MAAM,gBAAgB,GAAG,UAAU,CAAC;QACpC,IAAI,GAAG,GAAG,UAAU,CAAC;QAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,GAAG,GAAG,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,gBAAgB,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;QAED,eAAe;QACf,GAAG,GAAG,CAAC,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAE/B,4DAA4D;QAC5D,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAClD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEM,KAAK,CAAC,MAAM,CAAC,IAAkB;QACpC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;CACF"}

package/dist/caching/src/hashing/providers/crypto.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Original library: hashery (v1.5.1)
+ * - Copyright (c) 2025 Jared Wray
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+import type { WebCryptoHashAlgorithm, HashProvider } from '../types.ts';
+export type WebCryptoOptions = {
+    algorithm?: WebCryptoHashAlgorithm;
+};
+export declare class WebCrypto implements HashProvider {
+    private _algorithm;
+    constructor(options?: WebCryptoOptions);
+    get name(): string;
+    toHash(data: BufferSource): Promise<string>;
+}
+//# sourceMappingURL=crypto.d.ts.map

package/dist/caching/src/hashing/providers/crypto.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"crypto.d.ts","sourceRoot":"","sources":["../../../../../src/caching/src/hashing/providers/crypto.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAEL,OAAO,KAAK,EAAE,sBAAsB,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAExE,MAAM,MAAM,gBAAgB,GAAG;IAC7B,SAAS,CAAC,EAAE,sBAAsB,CAAC;CACpC,CAAC;AAEF,qBAAa,SAAU,YAAW,YAAY;IAC5C,OAAO,CAAC,UAAU,CAAqC;gBAC3C,OAAO,CAAC,EAAE,gBAAgB;IAMtC,IAAW,IAAI,IAAI,MAAM,CAExB;IAEY,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC;CAUzD"}

package/dist/caching/src/hashing/providers/crypto.js

@@ -0,0 +1,28 @@
+/**
+ * Original library: hashery (v1.5.1)
+ * - Copyright (c) 2025 Jared Wray
+ *
+ * Modified and integrated in "Inray":
+ * - Evgeniy Bushin
+ */
+/***/
+export class WebCrypto {
+    _algorithm = 'SHA-256';
+    constructor(options) {
+        if (options?.algorithm) {
+            this._algorithm = options?.algorithm;
+        }
+    }
+    get name() {
+        return this._algorithm;
+    }
+    async toHash(data) {
+        // Hash the data using Web Crypto API
+        const hashBuffer = await crypto.subtle.digest(this._algorithm, data);
+        // Convert the hash to a hexadecimal string
+        const hashArray = Array.from(new Uint8Array(hashBuffer));
+        const hashHex = hashArray.map((byte) => byte.toString(16).padStart(2, '0')).join('');
+        return hashHex;
+    }
+}
+//# sourceMappingURL=crypto.js.map

package/dist/caching/src/hashing/providers/crypto.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"crypto.js","sourceRoot":"","sources":["../../../../../src/caching/src/hashing/providers/crypto.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,KAAK;AAQL,MAAM,OAAO,SAAS;IACZ,UAAU,GAA2B,SAAS,CAAC;IACvD,YAAY,OAA0B;QACpC,IAAI,OAAO,EAAE,SAAS,EAAE,CAAC;YACvB,IAAI,CAAC,UAAU,GAAG,OAAO,EAAE,SAAS,CAAC;QACvC,CAAC;IACH,CAAC;IAED,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAEM,KAAK,CAAC,MAAM,CAAC,IAAkB;QACpC,qCAAqC;QACrC,MAAM,UAAU,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAErE,2CAA2C;QAC3C,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC;QACzD,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAErF,OAAO,OAAO,CAAC;IACjB,CAAC;CACF"}

package/dist/caching/src/hashing/providers/djb2.d.ts

@@ -0,0 +1,60 @@
+import type { HashProvider } from '../types.ts';
+/**
+ * DJB2 hash algorithm implementation.
+ *
+ * DJB2 is a non-cryptographic hash function created by Daniel J. Bernstein.
+ * It produces a 32-bit hash value, making it suitable for hash tables and checksums,
+ * but NOT for cryptographic purposes.
+ *
+ * Algorithm: hash = hash * 33 + c (where c is each byte)
+ * Initial value: 5381
+ *
+ * @example
+ * ```typescript
+ * import { Hashery } from 'hashery';
+ * import { DJB2 } from 'hashery/providers/djb2';
+ *
+ * const hashery = new Hashery();
+ * hashery.providers.add(new DJB2());
+ *
+ * const hash = await hashery.toHash({ data: 'hello' }, 'djb2');
+ * console.log(hash); // "7c9df5ea"
+ * ```
+ */
+export declare class DJB2 implements HashProvider {
+    /**
+     * The name identifier for this hash provider.
+     */
+    get name(): string;
+    /**
+     * Computes the DJB2 hash of the provided data synchronously.
+     *
+     * @param data - The data to hash (Uint8Array, ArrayBuffer, or DataView)
+     * @returns An 8-character lowercase hexadecimal string
+     *
+     * @example
+     * ```typescript
+     * const djb2 = new DJB2();
+     * const data = new TextEncoder().encode('hello');
+     * const hash = djb2.toHashSync(data);
+     * console.log(hash); // "7c9df5ea"
+     * ```
+     */
+    toHashSync(data: BufferSource): string;
+    /**
+     * Computes the DJB2 hash of the provided data.
+     *
+     * @param data - The data to hash (Uint8Array, ArrayBuffer, or DataView)
+     * @returns A Promise resolving to an 8-character lowercase hexadecimal string
+     *
+     * @example
+     * ```typescript
+     * const djb2 = new DJB2();
+     * const data = new TextEncoder().encode('hello');
+     * const hash = await djb2.toHash(data);
+     * console.log(hash); // "7c9df5ea"
+     * ```
+     */
+    toHash(data: BufferSource): Promise<string>;
+}
+//# sourceMappingURL=djb2.d.ts.map

package/dist/caching/src/hashing/providers/djb2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"djb2.d.ts","sourceRoot":"","sources":["../../../../../src/caching/src/hashing/providers/djb2.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAEhD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,qBAAa,IAAK,YAAW,YAAY;IACvC;;OAEG;IACH,IAAW,IAAI,IAAI,MAAM,CAExB;IAED;;;;;;;;;;;;;OAaG;IACI,UAAU,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM;IAiC7C;;;;;;;;;;;;;OAaG;IACU,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC;CAGzD"}