@haatlabs-core/providers 0.0.0-stage → 0.11.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "{}"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Haatlabs
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -1,3 +1,34 @@
-# Temporary Holding Version
+# @haatlabs-core/providers
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+What every caller of an outside service needs, written once: `retry`, a circuit breaker,
+rate-limit turns, a concurrency limit and `mapLimit`, `protect` (the layers in their order),
+the services-gateway contract (tiers and the headers a gateway reads), `cachedCall` with single-flight, and the safe fetch of
+untrusted URLs (`@haatlabs-core/providers/safe-fetch`). Each takes any call; the error a project
+throws stays the project's. It throws `PROVIDER_UNAVAILABLE` by default; a project spreads
+`PROVIDERS_ERRORS` into `defineErrors`.
+
+    const breaker = createCircuitBreaker({ name: 'search' });
+    const gate = gateByRateLimit(limiter, { key: 'search', policy }, (ms) => refusal(ms));
+    const answer = await protect(() => call(), { gate, breaker, retry: { signal } });
+
+The root carries `cachedCall`, the codecs and the memory store, never the Redis one: import
+`createRedisCacheStore` from `@haatlabs-core/providers/cache`, so the root's types never name
+`ioredis`. The root loads no HTTP client either; `sniffImageType` is there as well as in
+`@haatlabs-core/providers/safe-fetch`.
+
+A fetch that failed for now (DNS, a reset, a 5xx or 429 image) is worth another attempt:
+
+    import { isTransientSafeFetchError, safeFetchImage } from '@haatlabs-core/providers/safe-fetch';
+    const image = await retry(() => safeFetchImage(url, { signal }), {
+      isRetryable: isTransientSafeFetchError,
+      signal,
+    });
+
+`localTimeoutMs(timeoutMs, call)` bounds an adapter's own timeout by the call's deadline, and
+`retryAfterMsOf(response.headers)` reads a `Retry-After` (seconds or a date, at most 300 s).
+
+## Install
+
+    pnpm add @haatlabs-core/providers
+
+It leaves one package to your app, so the app holds one copy: `ioredis`.

package/dist/abort.d.ts

@@ -0,0 +1,4 @@
+/** The caller's abort as an error: their reason if it is an Error, else an AbortError. */
+export declare function abortError(signal: AbortSignal, what?: string): Error;
+/** Waits `ms`, or rejects with the caller's abort as soon as `signal` aborts. */
+export declare function abortableSleep(ms: number, signal?: AbortSignal): Promise<void>;

package/dist/abort.js

@@ -0,0 +1,24 @@
+/** The caller's abort as an error: their reason if it is an Error, else an AbortError. */
+export function abortError(signal, what = 'The call was aborted') {
+    const reason = signal.reason;
+    return reason instanceof Error ? reason : new DOMException(what, 'AbortError');
+}
+/** Waits `ms`, or rejects with the caller's abort as soon as `signal` aborts. */
+export function abortableSleep(ms, signal) {
+    return new Promise((resolve, reject) => {
+        if (signal?.aborted) {
+            reject(abortError(signal));
+            return;
+        }
+        const onAbort = () => {
+            clearTimeout(handle);
+            reject(abortError(signal));
+        };
+        const handle = setTimeout(() => {
+            signal?.removeEventListener('abort', onAbort);
+            resolve();
+        }, ms);
+        signal?.addEventListener('abort', onAbort, { once: true });
+    });
+}
+//# sourceMappingURL=abort.js.map

package/dist/abort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"abort.js","sourceRoot":"","sources":["../src/abort.ts"],"names":[],"mappings":"AAAA,0FAA0F;AAC1F,MAAM,UAAU,UAAU,CAAC,MAAmB,EAAE,IAAI,GAAG,sBAAsB;IAC3E,MAAM,MAAM,GAAY,MAAM,CAAC,MAAM,CAAC;IACtC,OAAO,MAAM,YAAY,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;AACjF,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,cAAc,CAAC,EAAU,EAAE,MAAoB;IAC7D,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACrC,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;YACpB,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;YAC3B,OAAO;QACT,CAAC;QACD,MAAM,OAAO,GAAG,GAAS,EAAE;YACzB,YAAY,CAAC,MAAM,CAAC,CAAC;YACrB,MAAM,CAAC,UAAU,CAAC,MAAqB,CAAC,CAAC,CAAC;QAC5C,CAAC,CAAC;QACF,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,EAAE;YAC7B,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAC9C,OAAO,EAAE,CAAC;QACZ,CAAC,EAAE,EAAE,CAAC,CAAC;QACP,MAAM,EAAE,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/cache/cached-call.d.ts

@@ -0,0 +1,55 @@
+import type { Codec } from './codecs.js';
+import { type CacheStore } from './store.js';
+export type CacheEvent = 'hit' | 'miss' | 'joined' | 'store-error' | 'too-large';
+/** 'hit': read from the store. 'miss': this caller computed. 'joined': another's compute was shared. */
+export type CacheOutcome = 'hit' | 'miss' | 'joined';
+export interface CachedResult<O> {
+    value: O;
+    /** `outcome !== 'miss'`. */
+    hit: boolean;
+    outcome: CacheOutcome;
+    /** When the value was computed (ms since the epoch). */
+    storedAt: number;
+}
+export type CachedCall<I, O> = (input: I, compute: () => Promise<O>) => Promise<CachedResult<O>>;
+export interface CachedCallOptions<I, O> {
+    /** Null turns caching off: every call computes. */
+    store: CacheStore | null;
+    namespace: string;
+    /** A changed model, prompt or parser is a new version, never a stale hit. */
+    version: string | number;
+    ttlMs: number;
+    /** What identifies an answer: never a header, a key or the caller's identity. */
+    keyOf: (input: I) => unknown;
+    codec: Codec<O>;
+    /** A value it refuses is returned, not kept. */
+    cacheIf?: (value: O) => boolean;
+    /** Defaults: lockTtlMs 30 s, waitMs 10 s, pollMs 100 ms (at least 10). */
+    singleFlight?: {
+        lockTtlMs: number;
+        waitMs: number;
+        pollMs?: number;
+    };
+    /** How long a store that timed out is left alone, for every call on it. Default 10 s. */
+    storeAwayMs?: number;
+    /** For metrics. A 'store-error' comes with the error (the store's, or the codec's). */
+    onEvent?: (event: CacheEvent, detail?: {
+        error: unknown;
+    }) => void;
+    /** Test seams. */
+    now?: () => number;
+    sleep?: (ms: number) => Promise<void>;
+}
+/** The store key of an input: `${namespace}:v${version}:${hashKey(keyInput)}`. */
+export declare const cacheKeyOf: (namespace: string, version: string | number, keyInput: unknown) => string;
+/**
+ * A call whose answers are kept in `store` for `ttlMs`. Callers asking for the same key
+ * share one compute: in this process through one promise, across processes through the
+ * store's lock (the first takes it; the others look again every `pollMs` for up to `waitMs`,
+ * then compute themselves). A failed compute is thrown to the caller that ran it only and is
+ * never kept: whoever was waiting on it looks again and computes for itself, one at a time
+ * through the lock. A store that fails is a miss, never a failed call. A store that times out
+ * costs the call that found out one timeout only (no lock, no write after it), and is then
+ * left alone for `storeAwayMs` (10 s): calls compute directly.
+ */
+export declare function cachedCall<I, O>(options: CachedCallOptions<I, O>): CachedCall<I, O>;

package/dist/cache/cached-call.js

@@ -0,0 +1,212 @@
+import { abortableSleep } from '../abort.js';
+import { hashKey } from './hash.js';
+import { isStoreTimeoutError } from './store.js';
+const DEFAULT_LOCK_TTL_MS = 30_000;
+const DEFAULT_WAIT_MS = 10_000;
+const DEFAULT_POLL_MS = 100;
+/** After a store times out, calls compute directly for this long. */
+const DEFAULT_STORE_AWAY_MS = 10_000;
+const MIN_POLL_MS = 10;
+/**
+ * When a store that timed out is back in use, kept on the store itself so every cachedCall on it
+ * (from any copy of this package) shares the cool-off.
+ */
+const AWAY_UNTIL = Symbol.for('@haatlabs-core/providers.cacheStoreAwayUntil');
+/** Each entry starts with when it was computed, a float64. */
+const STORED_AT_BYTES = 8;
+/** The store key of an input: `${namespace}:v${version}:${hashKey(keyInput)}`. */
+export const cacheKeyOf = (namespace, version, keyInput) => `${namespace}:v${version}:${hashKey(keyInput)}`;
+/**
+ * A call whose answers are kept in `store` for `ttlMs`. Callers asking for the same key
+ * share one compute: in this process through one promise, across processes through the
+ * store's lock (the first takes it; the others look again every `pollMs` for up to `waitMs`,
+ * then compute themselves). A failed compute is thrown to the caller that ran it only and is
+ * never kept: whoever was waiting on it looks again and computes for itself, one at a time
+ * through the lock. A store that fails is a miss, never a failed call. A store that times out
+ * costs the call that found out one timeout only (no lock, no write after it), and is then
+ * left alone for `storeAwayMs` (10 s): calls compute directly.
+ */
+export function cachedCall(options) {
+    const { store, codec } = options;
+    if (!options.namespace)
+        throw new Error('cachedCall needs a namespace');
+    if (!Number.isInteger(options.ttlMs) || options.ttlMs < 1) {
+        throw new RangeError('ttlMs must be a positive integer');
+    }
+    const positive = (name, value, least = 1) => {
+        if (!Number.isInteger(value) || value < least) {
+            throw new RangeError(`${name} must be an integer of at least ${least}`);
+        }
+    };
+    const now = options.now ?? Date.now;
+    const sleep = options.sleep ?? ((ms) => abortableSleep(ms));
+    const lockTtlMs = options.singleFlight?.lockTtlMs ?? DEFAULT_LOCK_TTL_MS;
+    const waitMs = options.singleFlight?.waitMs ?? DEFAULT_WAIT_MS;
+    const pollMs = options.singleFlight?.pollMs ?? DEFAULT_POLL_MS;
+    const inflight = new Map();
+    const emit = (event, detail) => {
+        try {
+            if (detail)
+                options.onEvent?.(event, detail);
+            else
+                options.onEvent?.(event);
+        }
+        catch {
+            // Counting is not what was asked for.
+        }
+    };
+    positive('lockTtlMs', lockTtlMs);
+    positive('waitMs', waitMs);
+    positive('pollMs', pollMs, MIN_POLL_MS);
+    const storeAwayMs = options.storeAwayMs ?? DEFAULT_STORE_AWAY_MS;
+    positive('storeAwayMs', storeAwayMs, 0);
+    const away = () => (store ? now() < (store[AWAY_UNTIL] ?? 0) : false);
+    /** Records a store failure; a timeout (from a store of any copy of this package) means away. */
+    const failed = (error) => {
+        emit('store-error', { error });
+        if (store && isStoreTimeoutError(error))
+            store[AWAY_UNTIL] = now() + storeAwayMs;
+    };
+    const read = async (key) => {
+        if (!store || away())
+            return null;
+        let bytes;
+        try {
+            bytes = await store.get(key);
+        }
+        catch (error) {
+            failed(error);
+            return null;
+        }
+        // Bytes it cannot read are a miss; the next write goes over them.
+        if (!bytes || bytes.length < STORED_AT_BYTES)
+            return null;
+        try {
+            return {
+                storedAt: bytes.readDoubleBE(0),
+                value: codec.decode(bytes.subarray(STORED_AT_BYTES)),
+            };
+        }
+        catch {
+            return null;
+        }
+    };
+    const write = async (key, found) => {
+        if (!store || away())
+            return;
+        let encoded;
+        try {
+            if (options.cacheIf && !options.cacheIf(found.value))
+                return;
+            encoded = codec.encode(found.value);
+        }
+        catch (error) {
+            emit('store-error', { error });
+            return;
+        }
+        const entry = Buffer.alloc(STORED_AT_BYTES + encoded.length);
+        entry.writeDoubleBE(found.storedAt, 0);
+        encoded.copy(entry, STORED_AT_BYTES);
+        if (store.maxValueBytes !== undefined && entry.length > store.maxValueBytes) {
+            emit('too-large');
+            return;
+        }
+        try {
+            await store.set(key, entry, options.ttlMs);
+        }
+        catch (error) {
+            failed(error);
+        }
+    };
+    const computeAndKeep = async (key, compute) => {
+        const value = await compute();
+        const found = { value, storedAt: now() };
+        await write(key, found);
+        return { found, outcome: 'miss' };
+    };
+    /** null: someone else holds it. undefined: the store has no lock, or it failed. */
+    const tryLock = async (key) => {
+        if (!store?.lock || away())
+            return undefined;
+        try {
+            return await store.lock(key, lockTtlMs);
+        }
+        catch (error) {
+            failed(error);
+            return undefined;
+        }
+    };
+    /** One caller's whole way to a value: the store, then the lock, then compute. */
+    const resolve = async (key, compute) => {
+        const cached = await read(key);
+        if (cached)
+            return { found: cached, outcome: 'hit' };
+        if (away())
+            return computeAndKeep(key, compute);
+        const startedAt = now();
+        for (;;) {
+            const release = await tryLock(key);
+            if (release === undefined)
+                return computeAndKeep(key, compute);
+            if (release) {
+                try {
+                    // Another caller may have kept it between the read and the lock.
+                    const kept = await read(key);
+                    if (kept)
+                        return { found: kept, outcome: 'joined' };
+                    return await computeAndKeep(key, compute);
+                }
+                finally {
+                    // Always released; but once the store is away, not waited for: a hung store would
+                    // otherwise cost this call a second timeout.
+                    const freeing = release().catch(failed);
+                    if (!away())
+                        await freeing;
+                }
+            }
+            if (now() - startedAt >= waitMs)
+                return computeAndKeep(key, compute);
+            await sleep(pollMs);
+            const shared = await read(key);
+            if (shared)
+                return { found: shared, outcome: 'joined' };
+            if (away())
+                return computeAndKeep(key, compute);
+        }
+    };
+    const done = (resolved) => {
+        emit(resolved.outcome);
+        return {
+            value: resolved.found.value,
+            storedAt: resolved.found.storedAt,
+            outcome: resolved.outcome,
+            hit: resolved.outcome !== 'miss',
+        };
+    };
+    return async (input, compute) => {
+        if (!store) {
+            const value = await compute();
+            emit('miss');
+            return { value, hit: false, outcome: 'miss', storedAt: now() };
+        }
+        const key = cacheKeyOf(options.namespace, options.version, options.keyOf(input));
+        const shared = inflight.get(key);
+        if (shared) {
+            const joined = await shared.catch(() => null);
+            if (joined)
+                return done({ found: joined.found, outcome: joined.outcome === 'hit' ? 'hit' : 'joined' });
+            // The compute it waited for failed: that failure was its caller's alone.
+            return done(await resolve(key, compute));
+        }
+        const own = resolve(key, compute);
+        inflight.set(key, own);
+        try {
+            return done(await own);
+        }
+        finally {
+            if (inflight.get(key) === own)
+                inflight.delete(key);
+        }
+    };
+}
+//# sourceMappingURL=cached-call.js.map

package/dist/cache/cached-call.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cached-call.js","sourceRoot":"","sources":["../../src/cache/cached-call.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,OAAO,EAAE,mBAAmB,EAAmB,MAAM,YAAY,CAAC;AAwClE,MAAM,mBAAmB,GAAG,MAAM,CAAC;AACnC,MAAM,eAAe,GAAG,MAAM,CAAC;AAC/B,MAAM,eAAe,GAAG,GAAG,CAAC;AAC5B,qEAAqE;AACrE,MAAM,qBAAqB,GAAG,MAAM,CAAC;AACrC,MAAM,WAAW,GAAG,EAAE,CAAC;AACvB;;;GAGG;AACH,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,yCAAyC,CAAC,CAAC;AAEzE,8DAA8D;AAC9D,MAAM,eAAe,GAAG,CAAC,CAAC;AAW1B,kFAAkF;AAClF,MAAM,CAAC,MAAM,UAAU,GAAG,CACxB,SAAiB,EACjB,OAAwB,EACxB,QAAiB,EACT,EAAE,CAAC,GAAG,SAAS,KAAK,OAAO,IAAI,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;AAE7D;;;;;;;;;GASG;AACH,MAAM,UAAU,UAAU,CAAO,OAAgC;IAC/D,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC;IACjC,IAAI,CAAC,OAAO,CAAC,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;IACxE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;QAC1D,MAAM,IAAI,UAAU,CAAC,kCAAkC,CAAC,CAAC;IAC3D,CAAC;IACD,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,KAAa,EAAE,KAAK,GAAG,CAAC,EAAQ,EAAE;QAChE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;YAC9C,MAAM,IAAI,UAAU,CAAC,GAAG,IAAI,mCAAmC,KAAK,EAAE,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC,CAAC;IACF,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC;IACpC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC,EAAU,EAAE,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;IACpE,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,EAAE,SAAS,IAAI,mBAAmB,CAAC;IACzE,MAAM,MAAM,GAAG,OAAO,CAAC,YAAY,EAAE,MAAM,IAAI,eAAe,CAAC;IAC/D,MAAM,MAAM,GAAG,OAAO,CAAC,YAAY,EAAE,MAAM,IAAI,eAAe,CAAC;IAC/D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAgC,CAAC;IACzD,MAAM,IAAI,GAAG,CAAC,KAAiB,EAAE,MAA2B,EAAQ,EAAE;QACpE,IAAI,CAAC;YACH,IAAI,MAAM;gBAAE,OAAO,CAAC,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;;gBACxC,OAAO,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;QAAC,MAAM,CAAC;YACP,sCAAsC;QACxC,CAAC;IACH,CAAC,CAAC;IAEF,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACjC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC3B,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IACxC,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,qBAAqB,CAAC;IACjE,QAAQ,CAAC,aAAa,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,GAAY,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAE,KAAqB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAChG,gGAAgG;IAChG,MAAM,MAAM,GAAG,CAAC,KAAc,EAAQ,EAAE;QACtC,IAAI,CAAC,aAAa,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;QAC/B,IAAI,KAAK,IAAI,mBAAmB,CAAC,KAAK,CAAC;YACpC,KAAqB,CAAC,UAAU,CAAC,GAAG,GAAG,EAAE,GAAG,WAAW,CAAC;IAC7D,CAAC,CAAC;IAEF,MAAM,IAAI,GAAG,KAAK,EAAE,GAAW,EAA4B,EAAE;QAC3D,IAAI,CAAC,KAAK,IAAI,IAAI,EAAE;YAAE,OAAO,IAAI,CAAC;QAClC,IAAI,KAAoB,CAAC;QACzB,IAAI,CAAC;YACH,KAAK,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,CAAC;YACd,OAAO,IAAI,CAAC;QACd,CAAC;QACD,kEAAkE;QAClE,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,eAAe;YAAE,OAAO,IAAI,CAAC;QAC1D,IAAI,CAAC;YACH,OAAO;gBACL,QAAQ,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC;gBAC/B,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;aACrD,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,KAAK,GAAG,KAAK,EAAE,GAAW,EAAE,KAAe,EAAiB,EAAE;QAClE,IAAI,CAAC,KAAK,IAAI,IAAI,EAAE;YAAE,OAAO;QAC7B,IAAI,OAAe,CAAC;QACpB,IAAI,CAAC;YACH,IAAI,OAAO,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC;gBAAE,OAAO;YAC7D,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACtC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,aAAa,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;YAC/B,OAAO;QACT,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;QAC7D,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACvC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC;QACrC,IAAI,KAAK,CAAC,aAAa,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC;YAC5E,IAAI,CAAC,WAAW,CAAC,CAAC;YAClB,OAAO;QACT,CAAC;QACD,IAAI,CAAC;YACH,MAAM,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QAC7C,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,CAAC;QAChB,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,cAAc,GAAG,KAAK,EAAE,GAAW,EAAE,OAAyB,EAAwB,EAAE;QAC5F,MAAM,KAAK,GAAG,MAAM,OAAO,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,CAAC;QACzC,MAAM,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACxB,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;IACpC,CAAC,CAAC;IAEF,mFAAmF;IACnF,MAAM,OAAO,GAAG,KAAK,EAAE,GAAW,EAAqD,EAAE;QACvF,IAAI,CAAC,KAAK,EAAE,IAAI,IAAI,IAAI,EAAE;YAAE,OAAO,SAAS,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,MAAM,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QAC1C,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,CAAC;YACd,OAAO,SAAS,CAAC;QACnB,CAAC;IACH,CAAC,CAAC;IAEF,iFAAiF;IACjF,MAAM,OAAO,GAAG,KAAK,EAAE,GAAW,EAAE,OAAyB,EAAwB,EAAE;QACrF,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,MAAM;YAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QACrD,IAAI,IAAI,EAAE;YAAE,OAAO,cAAc,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAChD,MAAM,SAAS,GAAG,GAAG,EAAE,CAAC;QACxB,SAAS,CAAC;YACR,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,OAAO,KAAK,SAAS;gBAAE,OAAO,cAAc,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YAC/D,IAAI,OAAO,EAAE,CAAC;gBACZ,IAAI,CAAC;oBACH,iEAAiE;oBACjE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC;oBAC7B,IAAI,IAAI;wBAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;oBACpD,OAAO,MAAM,cAAc,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;gBAC5C,CAAC;wBAAS,CAAC;oBACT,kFAAkF;oBAClF,6CAA6C;oBAC7C,MAAM,OAAO,GAAG,OAAO,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;oBACxC,IAAI,CAAC,IAAI,EAAE;wBAAE,MAAM,OAAO,CAAC;gBAC7B,CAAC;YACH,CAAC;YACD,IAAI,GAAG,EAAE,GAAG,SAAS,IAAI,MAAM;gBAAE,OAAO,cAAc,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YACrE,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC;YACpB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/B,IAAI,MAAM;gBAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;YACxD,IAAI,IAAI,EAAE;gBAAE,OAAO,cAAc,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAClD,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,IAAI,GAAG,CAAC,QAAqB,EAAmB,EAAE;QACtD,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACvB,OAAO;YACL,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,KAAK;YAC3B,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC,QAAQ;YACjC,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,GAAG,EAAE,QAAQ,CAAC,OAAO,KAAK,MAAM;SACjC,CAAC;IACJ,CAAC,CAAC;IAEF,OAAO,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE;QAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,KAAK,GAAG,MAAM,OAAO,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,CAAC;YACb,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,CAAC;QACjE,CAAC;QACD,MAAM,GAAG,GAAG,UAAU,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACjF,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YAC9C,IAAI,MAAM;gBACR,OAAO,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC7F,yEAAyE;YACzE,OAAO,IAAI,CAAC,MAAM,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;QAC3C,CAAC;QACD,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAClC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,CAAC;gBAAS,CAAC;YACT,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG;gBAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACtD,CAAC;IACH,CAAC,CAAC;AACJ,CAAC"}

package/dist/cache/codecs.d.ts

@@ -0,0 +1,11 @@
+/** How a value is kept: as bytes. */
+export interface Codec<T> {
+    encode(value: T): Buffer;
+    decode(bytes: Buffer): T;
+}
+/** JSON, checked on the way out by `parse` when given (a zod schema's `parse`, say). */
+export declare function jsonCodec<T>(parse?: (value: unknown) => T): Codec<T>;
+/** A vector as 32-bit floats: four bytes a dimension. */
+export declare const float32Codec: Codec<number[]>;
+/** The inner codec's bytes, gzipped: for values that repeat themselves (products, pages). */
+export declare function gzipCodec<T>(inner: Codec<T>): Codec<T>;

package/dist/cache/codecs.js

@@ -0,0 +1,33 @@
+import { gunzipSync, gzipSync } from 'node:zlib';
+const BYTES_PER_FLOAT = 4;
+/** The most a gzipped value may inflate to. */
+const MAX_INFLATED_BYTES = 8 * 1024 * 1024;
+/** JSON, checked on the way out by `parse` when given (a zod schema's `parse`, say). */
+export function jsonCodec(parse) {
+    return {
+        encode: (value) => Buffer.from(JSON.stringify(value), 'utf8'),
+        decode: (bytes) => {
+            const value = JSON.parse(bytes.toString('utf8'));
+            return parse ? parse(value) : value;
+        },
+    };
+}
+/** A vector as 32-bit floats: four bytes a dimension. */
+export const float32Codec = {
+    encode: (vector) => Buffer.from(new Float32Array(vector).buffer),
+    decode: (bytes) => {
+        if (bytes.length % BYTES_PER_FLOAT !== 0) {
+            throw new RangeError('A float32 vector is a whole number of four-byte values');
+        }
+        const copy = new Uint8Array(bytes);
+        return Array.from(new Float32Array(copy.buffer, 0, copy.length / BYTES_PER_FLOAT));
+    },
+};
+/** The inner codec's bytes, gzipped: for values that repeat themselves (products, pages). */
+export function gzipCodec(inner) {
+    return {
+        encode: (value) => gzipSync(inner.encode(value)),
+        decode: (bytes) => inner.decode(gunzipSync(bytes, { maxOutputLength: MAX_INFLATED_BYTES })),
+    };
+}
+//# sourceMappingURL=codecs.js.map

package/dist/cache/codecs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"codecs.js","sourceRoot":"","sources":["../../src/cache/codecs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAQjD,MAAM,eAAe,GAAG,CAAC,CAAC;AAC1B,+CAA+C;AAC/C,MAAM,kBAAkB,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;AAE3C,wFAAwF;AACxF,MAAM,UAAU,SAAS,CAAI,KAA6B;IACxD,OAAO;QACL,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;QAC7D,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;YAChB,MAAM,KAAK,GAAY,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;YAC1D,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAE,KAAW,CAAC;QAC7C,CAAC;KACF,CAAC;AACJ,CAAC;AAED,yDAAyD;AACzD,MAAM,CAAC,MAAM,YAAY,GAAoB;IAC3C,MAAM,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC;IAChE,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;QAChB,IAAI,KAAK,CAAC,MAAM,GAAG,eAAe,KAAK,CAAC,EAAE,CAAC;YACzC,MAAM,IAAI,UAAU,CAAC,wDAAwD,CAAC,CAAC;QACjF,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;QACnC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC;IACrF,CAAC;CACF,CAAC;AAEF,6FAA6F;AAC7F,MAAM,UAAU,SAAS,CAAI,KAAe;IAC1C,OAAO;QACL,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,eAAe,EAAE,kBAAkB,EAAE,CAAC,CAAC;KAC5F,CAAC;AACJ,CAAC"}

package/dist/cache/hash.d.ts

@@ -0,0 +1,2 @@
+/** SHA-256 of the value's canonical JSON, base64url: the same input, the same key. */
+export declare function hashKey(value: unknown): string;

package/dist/cache/hash.js

@@ -0,0 +1,36 @@
+import { createHash } from 'node:crypto';
+/** The value as JSON would write it, with object keys sorted and undefined fields left out. */
+function canonical(value) {
+    // JSON would drop these, or write them as null, or throw: never a key of their own.
+    if (typeof value === 'function' || typeof value === 'symbol' || typeof value === 'bigint') {
+        throw new TypeError(`A cache key cannot hold a ${typeof value}`);
+    }
+    if (typeof value === 'number' && !Number.isFinite(value)) {
+        throw new TypeError('A cache key cannot hold NaN or Infinity');
+    }
+    if (value === null || typeof value !== 'object')
+        return value;
+    const withJson = value;
+    if (typeof withJson.toJSON === 'function')
+        return canonical(withJson.toJSON());
+    if (Array.isArray(value))
+        return value.map((item) => (item === undefined ? null : canonical(item)));
+    const prototype = Object.getPrototypeOf(value);
+    if (prototype !== Object.prototype && prototype !== null) {
+        throw new TypeError('A cache key holds plain objects, arrays and dates only');
+    }
+    const sorted = {};
+    for (const key of Object.keys(value).sort()) {
+        const item = value[key];
+        if (item !== undefined)
+            sorted[key] = canonical(item);
+    }
+    return sorted;
+}
+/** SHA-256 of the value's canonical JSON, base64url: the same input, the same key. */
+export function hashKey(value) {
+    return createHash('sha256')
+        .update(JSON.stringify(canonical(value)) ?? 'undefined')
+        .digest('base64url');
+}
+//# sourceMappingURL=hash.js.map

package/dist/cache/hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.js","sourceRoot":"","sources":["../../src/cache/hash.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,+FAA+F;AAC/F,SAAS,SAAS,CAAC,KAAc;IAC/B,oFAAoF;IACpF,IAAI,OAAO,KAAK,KAAK,UAAU,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC1F,MAAM,IAAI,SAAS,CAAC,6BAA6B,OAAO,KAAK,EAAE,CAAC,CAAC;IACnE,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,SAAS,CAAC,yCAAyC,CAAC,CAAC;IACjE,CAAC;IACD,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC9D,MAAM,QAAQ,GAAG,KAAmC,CAAC;IACrD,IAAI,OAAO,QAAQ,CAAC,MAAM,KAAK,UAAU;QAAE,OAAO,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IAC/E,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QACtB,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,SAAS,GAAY,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;IACxD,IAAI,SAAS,KAAK,MAAM,CAAC,SAAS,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;QACzD,MAAM,IAAI,SAAS,CAAC,wDAAwD,CAAC,CAAC;IAChF,CAAC;IACD,MAAM,MAAM,GAA4B,EAAE,CAAC;IAC3C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAI,KAAiC,CAAC,GAAG,CAAC,CAAC;QACrD,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,OAAO,CAAC,KAAc;IACpC,OAAO,UAAU,CAAC,QAAQ,CAAC;SACxB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,IAAI,WAAW,CAAC;SACvD,MAAM,CAAC,WAAW,CAAC,CAAC;AACzB,CAAC"}