tryaii-dre 0.2.0

package/dist/budget.js

@@ -0,0 +1,344 @@
+/**
+ * Budget-aware dataset routing utilities.
+ *
+ * This solves the routing budget problem as a multiple-choice knapsack:
+ * for each prompt, choose one model candidate; maximize total utility while
+ * keeping estimated generation cost under one shared budget.
+ */
+import { Priorities } from './scoring/priorities.js';
+/** Approximate token count with a deterministic 4 chars ~= 1 token rule. */
+export function estimateTokens(text) {
+    return Math.max(1, Math.ceil(text.length / 4));
+}
+/** Estimate USD generation cost for a model, or null when pricing is missing. */
+export function estimateGenerationCost(model, inputTokens, outputTokens) {
+    if (!model?.pricing)
+        return null;
+    // Guard against non-finite pricing fields: returning NaN here would poison
+    // every downstream comparison/sort, so surface "no estimate" instead.
+    if (!Number.isFinite(model.pricing.inputPer1k) || !Number.isFinite(model.pricing.outputPer1k)) {
+        return null;
+    }
+    return ((inputTokens / 1000) * model.pricing.inputPer1k
+        + (outputTokens / 1000) * model.pricing.outputPer1k);
+}
+export function costUnitForBudget(maxPrice) {
+    // Scale the unit to the budget so budgetUnits stays ~constant (~10k) for any
+    // budget size. This gives fine *relative* resolution without an absolute
+    // floor (the old 1e-5 floor collapsed resolution for sub-cent budgets) while
+    // keeping the DP state space bounded -- a fixed maxPrice/1e6 made budgetUnits
+    // ~1e6 for a $4 budget and exhausted the heap. Correctness comes from the
+    // float feasibility gate + cheapest fallback, so this only affects
+    // optimization granularity. Guard maxPrice <= 0 against a zero/negative unit.
+    if (maxPrice <= 0)
+        return 1e-9;
+    return maxPrice / 10000;
+}
+/** Deterministic Unicode code-point compare (NOT locale-aware) for modelIds. */
+function compareModelId(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+function candidateSortKey(a, b) {
+    if (a.estimatedCost !== b.estimatedCost)
+        return a.estimatedCost - b.estimatedCost;
+    if (a.utility !== b.utility)
+        return b.utility - a.utility;
+    return compareModelId(a.modelId, b.modelId);
+}
+export function paretoPrune(candidates) {
+    const ordered = [...candidates].sort(candidateSortKey);
+    const kept = [];
+    let bestUtility = Number.NEGATIVE_INFINITY;
+    for (const candidate of ordered) {
+        if (candidate.utility > bestUtility + 1e-12) {
+            kept.push(candidate);
+            bestUtility = candidate.utility;
+        }
+    }
+    return kept;
+}
+export function optimizeBudgetCandidates(candidateGroups, maxPrice, costUnit = costUnitForBudget(maxPrice)) {
+    if (maxPrice < 0)
+        throw new Error('maxPrice must be non-negative');
+    if (candidateGroups.length === 0) {
+        return {
+            status: 'optimal',
+            selected: [],
+            totalEstimatedCost: 0,
+            minimumRequiredBudget: 0,
+            budget: maxPrice,
+            costUnit,
+        };
+    }
+    const budgetUnits = Math.floor(maxPrice / costUnit);
+    const groups = candidateGroups.map((group) => paretoPrune(group));
+    if (groups.some((group) => group.length === 0)) {
+        return {
+            status: 'infeasible',
+            selected: [],
+            totalEstimatedCost: 0,
+            minimumRequiredBudget: Number.POSITIVE_INFINITY,
+            budget: maxPrice,
+            costUnit,
+            message: 'At least one prompt has no priced model candidates.',
+        };
+    }
+    const cheapest = groups.map((group) => [...group].sort(candidateSortKey)[0]);
+    const minimumRequiredBudget = cheapest.reduce((sum, candidate) => sum + candidate.estimatedCost, 0);
+    // Float feasibility is the source of truth: if the cheapest float assignment
+    // fits, the workload IS feasible. The integer DP below only *optimizes* the
+    // assignment; it must never declare infeasibility on its own. When the DP
+    // frontier collapses (quantization / pruning artefacts), fall back to the
+    // proven-feasible cheapest assignment as an optimal selection.
+    const cheapestResult = () => ({
+        status: 'optimal',
+        selected: cheapest,
+        totalEstimatedCost: minimumRequiredBudget,
+        minimumRequiredBudget,
+        budget: maxPrice,
+        costUnit,
+    });
+    if (minimumRequiredBudget > maxPrice) {
+        return {
+            status: 'infeasible',
+            selected: cheapest,
+            totalEstimatedCost: minimumRequiredBudget,
+            minimumRequiredBudget,
+            budget: maxPrice,
+            costUnit,
+            message: 'Budget is below the minimum cost required to route every prompt.',
+        };
+    }
+    let states = new Map([[0, { utility: 0, previousCost: null, candidateIndex: null }]]);
+    const layers = [];
+    for (const group of groups) {
+        const nextStates = new Map();
+        for (const [previousCost, previousState] of states.entries()) {
+            for (let idx = 0; idx < group.length; idx++) {
+                const candidate = group[idx];
+                const newCost = previousCost + candidate.costUnits;
+                if (newCost > budgetUnits)
+                    continue;
+                const newUtility = previousState.utility + candidate.utility;
+                const existing = nextStates.get(newCost);
+                if (!existing || newUtility > existing.utility + 1e-12) {
+                    nextStates.set(newCost, { utility: newUtility, previousCost, candidateIndex: idx });
+                }
+            }
+        }
+        if (nextStates.size === 0) {
+            // Float feasibility already proven above -> return the cheapest assignment
+            // rather than falsely reporting infeasible.
+            return cheapestResult();
+        }
+        const pruned = new Map();
+        let bestSeen = Number.NEGATIVE_INFINITY;
+        for (const cost of [...nextStates.keys()].sort((a, b) => a - b)) {
+            const state = nextStates.get(cost);
+            if (state.utility > bestSeen + 1e-12) {
+                pruned.set(cost, state);
+                bestSeen = state.utility;
+            }
+        }
+        states = pruned;
+        layers.push(states);
+    }
+    if (states.size === 0) {
+        // No surviving DP state, but float feasibility holds -> cheapest fallback.
+        return cheapestResult();
+    }
+    const [bestCost] = [...states.entries()].sort((a, b) => {
+        if (b[1].utility !== a[1].utility)
+            return b[1].utility - a[1].utility;
+        return a[0] - b[0];
+    })[0];
+    const selected = new Array(groups.length);
+    let currentCost = bestCost;
+    for (let promptIndex = groups.length - 1; promptIndex >= 0; promptIndex--) {
+        const state = layers[promptIndex].get(currentCost);
+        if (!state || state.previousCost == null || state.candidateIndex == null) {
+            throw new Error('invalid optimizer backpointer');
+        }
+        selected[promptIndex] = groups[promptIndex][state.candidateIndex];
+        currentCost = state.previousCost;
+    }
+    const totalEstimatedCost = selected.reduce((sum, candidate) => sum + candidate.estimatedCost, 0);
+    return {
+        status: 'optimal',
+        selected,
+        totalEstimatedCost,
+        minimumRequiredBudget,
+        budget: maxPrice,
+        costUnit,
+    };
+}
+function repriceCandidate(router, candidate, outputTokens, costUnit) {
+    const model = router.models.getModel(candidate.modelId);
+    const estimatedCost = estimateGenerationCost(model, candidate.inputTokens, outputTokens);
+    // Reject null AND non-finite (NaN/Infinity); the `=== null` arm also narrows
+    // the type for the assignment below.
+    if (estimatedCost === null || !Number.isFinite(estimatedCost))
+        return null;
+    return {
+        ...candidate,
+        estimatedCost,
+        // Zero-cost candidates must consume zero budget units; only clamp negatives.
+        costUnits: Math.max(0, Math.ceil(estimatedCost / costUnit)),
+        outputTokens,
+    };
+}
+function repriceCandidateGroups(router, candidateGroups, outputTokens, costUnit) {
+    return candidateGroups.map((group) => group
+        .map((candidate) => repriceCandidate(router, candidate, outputTokens, costUnit))
+        .filter((candidate) => candidate != null));
+}
+function minimumRequiredUnits(candidateGroups) {
+    if (candidateGroups.some((group) => group.length === 0))
+        return Number.POSITIVE_INFINITY;
+    return candidateGroups.reduce((sum, group) => sum + Math.min(...group.map((candidate) => candidate.costUnits)), 0);
+}
+function fitOutputTokens(router, candidateGroups, requestedOutputTokens, maxPrice, costUnit) {
+    const budgetUnits = Math.floor(maxPrice / costUnit);
+    // Require a positive output-token floor: an answer of 0 tokens is degenerate
+    // and must not be reported as a feasible "optimal" fit. If nothing >= 1 fits,
+    // bestTokens stays -1 and we return null (caller treats that as infeasible).
+    let low = 1;
+    let high = requestedOutputTokens;
+    let bestTokens = -1;
+    let bestGroups = [];
+    while (low <= high) {
+        const mid = Math.floor((low + high) / 2);
+        const repriced = repriceCandidateGroups(router, candidateGroups, mid, costUnit);
+        if (minimumRequiredUnits(repriced) <= budgetUnits) {
+            bestTokens = mid;
+            bestGroups = repriced;
+            low = mid + 1;
+        }
+        else {
+            high = mid - 1;
+        }
+    }
+    return bestTokens >= 1 ? { outputTokens: bestTokens, candidateGroups: bestGroups } : null;
+}
+async function buildBudgetCandidates(router, prompt, promptIndex, priorities, outputTokens, costUnit) {
+    const started = Date.now();
+    const routeResult = await router.route(prompt, {
+        topK: router.models.allModels.length,
+        priorities,
+    });
+    const routeMs = Date.now() - started;
+    const confidence = routeResult.classification?.confidence ?? 0;
+    const confidenceFactor = 0.75 + 0.25 * Math.max(0, Math.min(1, confidence));
+    const inputTokens = estimateTokens(prompt);
+    const candidateInputs = [];
+    for (const score of routeResult.scores) {
+        const model = router.models.getModel(score.modelId);
+        const estimatedCost = estimateGenerationCost(model, inputTokens, outputTokens);
+        // Reject null AND non-finite (NaN/Infinity); the `=== null` arm also narrows
+        // the type for the push below.
+        if (estimatedCost === null || !Number.isFinite(estimatedCost))
+            continue;
+        candidateInputs.push({
+            score,
+            estimatedCost,
+            utility: score.qualityScore * confidenceFactor,
+        });
+    }
+    const qualityBestModel = [...candidateInputs].sort((a, b) => {
+        if (b.utility !== a.utility)
+            return b.utility - a.utility;
+        if (a.estimatedCost !== b.estimatedCost)
+            return a.estimatedCost - b.estimatedCost;
+        return compareModelId(a.score.modelId, b.score.modelId);
+    })[0]?.score.modelId ?? routeResult.bestModel;
+    const candidates = [];
+    for (const { score, estimatedCost, utility } of candidateInputs) {
+        candidates.push({
+            promptIndex,
+            modelId: score.modelId,
+            utility,
+            estimatedCost,
+            // Zero-cost candidates must consume zero budget units; only clamp negatives.
+            costUnits: Math.max(0, Math.ceil(estimatedCost / costUnit)),
+            inputTokens,
+            outputTokens,
+            finalScore: score.finalScore,
+            reasoning: score.reasoning,
+            normalBestModel: qualityBestModel,
+        });
+    }
+    return { routeResult, candidates, routeMs };
+}
+export async function routeDatasetWithBudget(options) {
+    const budgetMode = options.budgetMode ?? 'strict';
+    if (budgetMode !== 'strict' && budgetMode !== 'fit-output') {
+        throw new Error("budgetMode must be 'strict' or 'fit-output'");
+    }
+    if (options.outputTokens < 0)
+        throw new Error('outputTokens must be non-negative');
+    const costUnit = costUnitForBudget(options.maxPrice);
+    const routeResults = [];
+    const routeTimes = [];
+    const candidateGroups = [];
+    const qualityPriorities = Priorities.performance();
+    for (let idx = 0; idx < options.prompts.length; idx++) {
+        const prepared = await buildBudgetCandidates(options.router, options.prompts[idx], idx, qualityPriorities, options.outputTokens, costUnit);
+        routeResults.push(prepared.routeResult);
+        routeTimes.push(prepared.routeMs);
+        candidateGroups.push(prepared.candidates);
+        options.progressCallback?.(idx + 1, options.prompts.length);
+    }
+    const requestedOutputTokens = options.outputTokens;
+    let optimization = optimizeBudgetCandidates(candidateGroups, options.maxPrice, costUnit);
+    const requestedMinimumRequiredBudget = optimization.minimumRequiredBudget;
+    const budgetShortfall = Number.isFinite(requestedMinimumRequiredBudget)
+        ? Math.max(0, requestedMinimumRequiredBudget - options.maxPrice)
+        : Number.POSITIVE_INFINITY;
+    optimization = {
+        ...optimization,
+        budgetMode,
+        requestedOutputTokens,
+        effectiveOutputTokens: options.outputTokens,
+        requestedMinimumRequiredBudget,
+        budgetShortfall,
+    };
+    if (budgetMode === 'fit-output' &&
+        optimization.status === 'infeasible' &&
+        options.outputTokens > 0 &&
+        Number.isFinite(optimization.minimumRequiredBudget)) {
+        const fitted = fitOutputTokens(options.router, candidateGroups, requestedOutputTokens, options.maxPrice, costUnit);
+        if (fitted) {
+            const fittedOptimization = optimizeBudgetCandidates(fitted.candidateGroups, options.maxPrice, costUnit);
+            if (fittedOptimization.status === 'optimal') {
+                optimization = {
+                    ...fittedOptimization,
+                    budgetMode,
+                    requestedOutputTokens,
+                    effectiveOutputTokens: fitted.outputTokens,
+                    requestedMinimumRequiredBudget,
+                    budgetShortfall,
+                    message: 'Requested output tokens did not fit the budget; ' +
+                        `optimized with ${fitted.outputTokens} output tokens per prompt.`,
+                };
+            }
+        }
+    }
+    const selectedByIndex = new Map(optimization.selected.map((candidate) => [candidate.promptIndex, candidate]));
+    const results = [];
+    let cumulativeCost = 0;
+    for (let idx = 0; idx < routeResults.length; idx++) {
+        const selected = selectedByIndex.get(idx);
+        if (!selected)
+            continue;
+        cumulativeCost += selected.estimatedCost;
+        results.push({
+            routeResult: routeResults[idx],
+            selected,
+            cumulativeCost,
+            remainingBudget: options.maxPrice - cumulativeCost,
+            routeMs: routeTimes[idx],
+        });
+    }
+    return { results, optimization };
+}
+//# sourceMappingURL=budget.js.map

package/dist/budget.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"budget.js","sourceRoot":"","sources":["../src/budget.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,OAAO,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AAwDrD,4EAA4E;AAC5E,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;AACjD,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,sBAAsB,CACpC,KAA4B,EAC5B,WAAmB,EACnB,YAAoB;IAEpB,IAAI,CAAC,KAAK,EAAE,OAAO;QAAE,OAAO,IAAI,CAAC;IACjC,2EAA2E;IAC3E,sEAAsE;IACtE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QAC9F,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,CACL,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU;UAC7C,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,CACpD,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,QAAgB;IAChD,6EAA6E;IAC7E,yEAAyE;IACzE,6EAA6E;IAC7E,8EAA8E;IAC9E,0EAA0E;IAC1E,mEAAmE;IACnE,8EAA8E;IAC9E,IAAI,QAAQ,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAC/B,OAAO,QAAQ,GAAG,KAAM,CAAC;AAC3B,CAAC;AAED,gFAAgF;AAChF,SAAS,cAAc,CAAC,CAAS,EAAE,CAAS;IAC1C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,gBAAgB,CAAC,CAAkB,EAAE,CAAkB;IAC9D,IAAI,CAAC,CAAC,aAAa,KAAK,CAAC,CAAC,aAAa;QAAE,OAAO,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC;IAClF,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO;QAAE,OAAO,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;IAC1D,OAAO,cAAc,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;AAC9C,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,UAA6B;IACvD,MAAM,OAAO,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;IACvD,MAAM,IAAI,GAAsB,EAAE,CAAC;IACnC,IAAI,WAAW,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAC3C,KAAK,MAAM,SAAS,IAAI,OAAO,EAAE,CAAC;QAChC,IAAI,SAAS,CAAC,OAAO,GAAG,WAAW,GAAG,KAAK,EAAE,CAAC;YAC5C,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACrB,WAAW,GAAG,SAAS,CAAC,OAAO,CAAC;QAClC,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,wBAAwB,CACtC,eAAoC,EACpC,QAAgB,EAChB,QAAQ,GAAG,iBAAiB,CAAC,QAAQ,CAAC;IAEtC,IAAI,QAAQ,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACnE,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjC,OAAO;YACL,MAAM,EAAE,SAAS;YACjB,QAAQ,EAAE,EAAE;YACZ,kBAAkB,EAAE,CAAC;YACrB,qBAAqB,EAAE,CAAC;YACxB,MAAM,EAAE,QAAQ;YAChB,QAAQ;SACT,CAAC;IACJ,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;IAClE,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;QAC/C,OAAO;YACL,MAAM,EAAE,YAAY;YACpB,QAAQ,EAAE,EAAE;YACZ,kBAAkB,EAAE,CAAC;YACrB,qBAAqB,EAAE,MAAM,CAAC,iBAAiB;YAC/C,MAAM,EAAE,QAAQ;YAChB,QAAQ;YACR,OAAO,EAAE,qDAAqD;SAC/D,CAAC;IACJ,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,MAAM,qBAAqB,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,SAAS,EAAE,EAAE,CAAC,GAAG,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAEpG,6EAA6E;IAC7E,4EAA4E;IAC5E,0EAA0E;IAC1E,0EAA0E;IAC1E,+DAA+D;IAC/D,MAAM,cAAc,GAAG,GAA6B,EAAE,CAAC,CAAC;QACtD,MAAM,EAAE,SAAS;QACjB,QAAQ,EAAE,QAAQ;QAClB,kBAAkB,EAAE,qBAAqB;QACzC,qBAAqB;QACrB,MAAM,EAAE,QAAQ;QAChB,QAAQ;KACT,CAAC,CAAC;IAEH,IAAI,qBAAqB,GAAG,QAAQ,EAAE,CAAC;QACrC,OAAO;YACL,MAAM,EAAE,YAAY;YACpB,QAAQ,EAAE,QAAQ;YAClB,kBAAkB,EAAE,qBAAqB;YACzC,qBAAqB;YACrB,MAAM,EAAE,QAAQ;YAChB,QAAQ;YACR,OAAO,EAAE,kEAAkE;SAC5E,CAAC;IACJ,CAAC;IAED,IAAI,MAAM,GAAG,IAAI,GAAG,CAAgB,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACrG,MAAM,MAAM,GAA8B,EAAE,CAAC;IAE7C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAiB,CAAC;QAC5C,KAAK,MAAM,CAAC,YAAY,EAAE,aAAa,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YAC7D,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC;gBAC5C,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;gBAC7B,MAAM,OAAO,GAAG,YAAY,GAAG,SAAS,CAAC,SAAS,CAAC;gBACnD,IAAI,OAAO,GAAG,WAAW;oBAAE,SAAS;gBACpC,MAAM,UAAU,GAAG,aAAa,CAAC,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC;gBAC7D,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACzC,IAAI,CAAC,QAAQ,IAAI,UAAU,GAAG,QAAQ,CAAC,OAAO,GAAG,KAAK,EAAE,CAAC;oBACvD,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,cAAc,EAAE,GAAG,EAAE,CAAC,CAAC;gBACtF,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC1B,2EAA2E;YAC3E,4CAA4C;YAC5C,OAAO,cAAc,EAAE,CAAC;QAC1B,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiB,CAAC;QACxC,IAAI,QAAQ,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACxC,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAChE,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAU,CAAC;YAC5C,IAAI,KAAK,CAAC,OAAO,GAAG,QAAQ,GAAG,KAAK,EAAE,CAAC;gBACrC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBACxB,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,MAAM,GAAG,MAAM,CAAC;QAChB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtB,CAAC;IAED,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACtB,2EAA2E;QAC3E,OAAO,cAAc,EAAE,CAAC;IAC1B,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACrD,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO;YAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;QACtE,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEN,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAkB,MAAM,CAAC,MAAM,CAAC,CAAC;IAC3D,IAAI,WAAW,GAAG,QAAQ,CAAC;IAC3B,KAAK,IAAI,WAAW,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,WAAW,IAAI,CAAC,EAAE,WAAW,EAAE,EAAE,CAAC;QAC1E,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,YAAY,IAAI,IAAI,IAAI,KAAK,CAAC,cAAc,IAAI,IAAI,EAAE,CAAC;YACzE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACnD,CAAC;QACD,QAAQ,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QAClE,WAAW,GAAG,KAAK,CAAC,YAAY,CAAC;IACnC,CAAC;IAED,MAAM,kBAAkB,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,SAAS,EAAE,EAAE,CAAC,GAAG,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IACjG,OAAO;QACL,MAAM,EAAE,SAAS;QACjB,QAAQ;QACR,kBAAkB;QAClB,qBAAqB;QACrB,MAAM,EAAE,QAAQ;QAChB,QAAQ;KACT,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CACvB,MAAc,EACd,SAA0B,EAC1B,YAAoB,EACpB,QAAgB;IAEhB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IACxD,MAAM,aAAa,GAAG,sBAAsB,CAAC,KAAK,EAAE,SAAS,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IACzF,6EAA6E;IAC7E,qCAAqC;IACrC,IAAI,aAAa,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3E,OAAO;QACL,GAAG,SAAS;QACZ,aAAa;QACb,6EAA6E;QAC7E,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC,CAAC;QAC3D,YAAY;KACb,CAAC;AACJ,CAAC;AAED,SAAS,sBAAsB,CAC7B,MAAc,EACd,eAAoC,EACpC,YAAoB,EACpB,QAAgB;IAEhB,OAAO,eAAe,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACnC,KAAK;SACF,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,gBAAgB,CAAC,MAAM,EAAE,SAAS,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;SAC/E,MAAM,CAAC,CAAC,SAAS,EAAgC,EAAE,CAAC,SAAS,IAAI,IAAI,CAAC,CAC1E,CAAC;AACJ,CAAC;AAED,SAAS,oBAAoB,CAAC,eAAoC;IAChE,IAAI,eAAe,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;QAAE,OAAO,MAAM,CAAC,iBAAiB,CAAC;IACzF,OAAO,eAAe,CAAC,MAAM,CAC3B,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,EAChF,CAAC,CACF,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CACtB,MAAc,EACd,eAAoC,EACpC,qBAA6B,EAC7B,QAAgB,EAChB,QAAgB;IAEhB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;IACpD,6EAA6E;IAC7E,8EAA8E;IAC9E,6EAA6E;IAC7E,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,qBAAqB,CAAC;IACjC,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;IACpB,IAAI,UAAU,GAAwB,EAAE,CAAC;IAEzC,OAAO,GAAG,IAAI,IAAI,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,QAAQ,GAAG,sBAAsB,CAAC,MAAM,EAAE,eAAe,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QAChF,IAAI,oBAAoB,CAAC,QAAQ,CAAC,IAAI,WAAW,EAAE,CAAC;YAClD,UAAU,GAAG,GAAG,CAAC;YACjB,UAAU,GAAG,QAAQ,CAAC;YACtB,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;QAChB,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,UAAU,EAAE,eAAe,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AAC5F,CAAC;AAED,KAAK,UAAU,qBAAqB,CAClC,MAAc,EACd,MAAc,EACd,WAAmB,EACnB,UAAsB,EACtB,YAAoB,EACpB,QAAgB;IAEhB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC3B,MAAM,WAAW,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE;QAC7C,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM;QACpC,UAAU;KACX,CAAC,CAAC;IACH,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC;IACrC,MAAM,UAAU,GAAG,WAAW,CAAC,cAAc,EAAE,UAAU,IAAI,CAAC,CAAC;IAC/D,MAAM,gBAAgB,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IAC5E,MAAM,WAAW,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,eAAe,GAIhB,EAAE,CAAC;IAER,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACpD,MAAM,aAAa,GAAG,sBAAsB,CAAC,KAAK,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC;QAC/E,6EAA6E;QAC7E,+BAA+B;QAC/B,IAAI,aAAa,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC;YAAE,SAAS;QACxE,eAAe,CAAC,IAAI,CAAC;YACnB,KAAK;YACL,aAAa;YACb,OAAO,EAAE,KAAK,CAAC,YAAY,GAAG,gBAAgB;SAC/C,CAAC,CAAC;IACL,CAAC;IAED,MAAM,gBAAgB,GACpB,CAAC,GAAG,eAAe,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACjC,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO;YAAE,OAAO,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;QAC1D,IAAI,CAAC,CAAC,aAAa,KAAK,CAAC,CAAC,aAAa;YAAE,OAAO,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC;QAClF,OAAO,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,IAAI,WAAW,CAAC,SAAS,CAAC;IAEhD,MAAM,UAAU,GAAsB,EAAE,CAAC;IACzC,KAAK,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,OAAO,EAAE,IAAI,eAAe,EAAE,CAAC;QAChE,UAAU,CAAC,IAAI,CAAC;YACd,WAAW;YACX,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,OAAO;YACP,aAAa;YACb,6EAA6E;YAC7E,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC,CAAC;YAC3D,WAAW;YACX,YAAY;YACZ,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,eAAe,EAAE,gBAAgB;SAClC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;AAC9C,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,OAAsC;IAEtC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,QAAQ,CAAC;IAClD,IAAI,UAAU,KAAK,QAAQ,IAAI,UAAU,KAAK,YAAY,EAAE,CAAC;QAC3D,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IACjE,CAAC;IACD,IAAI,OAAO,CAAC,YAAY,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IAEnF,MAAM,QAAQ,GAAG,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACrD,MAAM,YAAY,GAAkB,EAAE,CAAC;IACvC,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,MAAM,eAAe,GAAwB,EAAE,CAAC;IAChD,MAAM,iBAAiB,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;IAEnD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC;QACtD,MAAM,QAAQ,GAAG,MAAM,qBAAqB,CAC1C,OAAO,CAAC,MAAM,EACd,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EACpB,GAAG,EACH,iBAAiB,EACjB,OAAO,CAAC,YAAY,EACpB,QAAQ,CACT,CAAC;QACF,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QACxC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAClC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC1C,OAAO,CAAC,gBAAgB,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9D,CAAC;IAED,MAAM,qBAAqB,GAAG,OAAO,CAAC,YAAY,CAAC;IACnD,IAAI,YAAY,GAAG,wBAAwB,CAAC,eAAe,EAAE,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACzF,MAAM,8BAA8B,GAAG,YAAY,CAAC,qBAAqB,CAAC;IAC1E,MAAM,eAAe,GAAG,MAAM,CAAC,QAAQ,CAAC,8BAA8B,CAAC;QACrE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,8BAA8B,GAAG,OAAO,CAAC,QAAQ,CAAC;QAChE,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC;IAE7B,YAAY,GAAG;QACb,GAAG,YAAY;QACf,UAAU;QACV,qBAAqB;QACrB,qBAAqB,EAAE,OAAO,CAAC,YAAY;QAC3C,8BAA8B;QAC9B,eAAe;KAChB,CAAC;IAEF,IACE,UAAU,KAAK,YAAY;QAC3B,YAAY,CAAC,MAAM,KAAK,YAAY;QACpC,OAAO,CAAC,YAAY,GAAG,CAAC;QACxB,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,qBAAqB,CAAC,EACnD,CAAC;QACD,MAAM,MAAM,GAAG,eAAe,CAC5B,OAAO,CAAC,MAAM,EACd,eAAe,EACf,qBAAqB,EACrB,OAAO,CAAC,QAAQ,EAChB,QAAQ,CACT,CAAC;QACF,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,kBAAkB,GAAG,wBAAwB,CACjD,MAAM,CAAC,eAAe,EACtB,OAAO,CAAC,QAAQ,EAChB,QAAQ,CACT,CAAC;YACF,IAAI,kBAAkB,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC5C,YAAY,GAAG;oBACb,GAAG,kBAAkB;oBACrB,UAAU;oBACV,qBAAqB;oBACrB,qBAAqB,EAAE,MAAM,CAAC,YAAY;oBAC1C,8BAA8B;oBAC9B,eAAe;oBACf,OAAO,EACL,kDAAkD;wBAClD,kBAAkB,MAAM,CAAC,YAAY,4BAA4B;iBACpE,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,eAAe,GAAG,IAAI,GAAG,CAC7B,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC,CAC7E,CAAC;IACF,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,IAAI,cAAc,GAAG,CAAC,CAAC;IAEvB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,YAAY,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC;QACnD,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,CAAC,QAAQ;YAAE,SAAS;QACxB,cAAc,IAAI,QAAQ,CAAC,aAAa,CAAC;QACzC,OAAO,CAAC,IAAI,CAAC;YACX,WAAW,EAAE,YAAY,CAAC,GAAG,CAAC;YAC9B,QAAQ;YACR,cAAc;YACd,eAAe,EAAE,OAAO,CAAC,QAAQ,GAAG,cAAc;YAClD,OAAO,EAAE,UAAU,CAAC,GAAG,CAAC;SACzB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC;AACnC,CAAC"}

package/dist/cache/index.d.ts

@@ -0,0 +1,27 @@
+/**
+ * LRU Cache with TTL support.
+ *
+ * Generic cache used for embedding vectors and classification results.
+ * No threading lock needed in JS (single-threaded).
+ */
+export declare class LRUCache<T> {
+    private readonly _maxSize;
+    private readonly _ttlMs;
+    private readonly _cache;
+    /**
+     * @param maxSize Maximum number of items to store.
+     * @param ttlSeconds Time-to-live for each entry in seconds.
+     */
+    constructor(maxSize?: number, ttlSeconds?: number);
+    /** Get a value from cache. Returns undefined if missing or expired. */
+    get(key: string): T | undefined;
+    /** Set a value in cache. */
+    set(key: string, value: T): void;
+    /** Clear all cached entries. */
+    clear(): void;
+    /** Current number of items in cache. */
+    get size(): number;
+    /** Check if a key exists and is not expired. */
+    has(key: string): boolean;
+}
+//# sourceMappingURL=index.d.ts.map

package/dist/cache/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/cache/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,qBAAa,QAAQ,CAAC,CAAC;IACrB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAA6B;IAEpD;;;OAGG;gBACS,OAAO,SAAM,EAAE,UAAU,SAAQ;IAM7C,uEAAuE;IACvE,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAgB/B,4BAA4B;IAC5B,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAmBhC,gCAAgC;IAChC,KAAK,IAAI,IAAI;IAIb,wCAAwC;IACxC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,gDAAgD;IAChD,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;CAG1B"}

package/dist/cache/index.js

@@ -0,0 +1,63 @@
+/**
+ * LRU Cache with TTL support.
+ *
+ * Generic cache used for embedding vectors and classification results.
+ * No threading lock needed in JS (single-threaded).
+ */
+export class LRUCache {
+    /**
+     * @param maxSize Maximum number of items to store.
+     * @param ttlSeconds Time-to-live for each entry in seconds.
+     */
+    constructor(maxSize = 300, ttlSeconds = 300.0) {
+        this._maxSize = maxSize;
+        this._ttlMs = ttlSeconds * 1000;
+        this._cache = new Map();
+    }
+    /** Get a value from cache. Returns undefined if missing or expired. */
+    get(key) {
+        const entry = this._cache.get(key);
+        if (!entry)
+            return undefined;
+        // Check TTL
+        if (Date.now() - entry.timestamp > this._ttlMs) {
+            this._cache.delete(key);
+            return undefined;
+        }
+        // Move to end (mark as recently used) by re-inserting
+        this._cache.delete(key);
+        this._cache.set(key, entry);
+        return entry.value;
+    }
+    /** Set a value in cache. */
+    set(key, value) {
+        // Remove if exists (to update position)
+        if (this._cache.has(key)) {
+            this._cache.delete(key);
+        }
+        // Evict oldest if at capacity
+        while (this._cache.size >= this._maxSize) {
+            const firstKey = this._cache.keys().next().value;
+            if (firstKey !== undefined) {
+                this._cache.delete(firstKey);
+            }
+            else {
+                break;
+            }
+        }
+        this._cache.set(key, { value, timestamp: Date.now() });
+    }
+    /** Clear all cached entries. */
+    clear() {
+        this._cache.clear();
+    }
+    /** Current number of items in cache. */
+    get size() {
+        return this._cache.size;
+    }
+    /** Check if a key exists and is not expired. */
+    has(key) {
+        return this.get(key) !== undefined;
+    }
+}
+//# sourceMappingURL=index.js.map

package/dist/cache/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/cache/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,MAAM,OAAO,QAAQ;IAKnB;;;OAGG;IACH,YAAY,OAAO,GAAG,GAAG,EAAE,UAAU,GAAG,KAAK;QAC3C,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,UAAU,GAAG,IAAI,CAAC;QAChC,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;IAC1B,CAAC;IAED,uEAAuE;IACvE,GAAG,CAAC,GAAW;QACb,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAC;QAE7B,YAAY;QACZ,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACxB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,sDAAsD;QACtD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC5B,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED,4BAA4B;IAC5B,GAAG,CAAC,GAAW,EAAE,KAAQ;QACvB,wCAAwC;QACxC,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1B,CAAC;QAED,8BAA8B;QAC9B,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;YACjD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC/B,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACzD,CAAC;IAED,gCAAgC;IAChC,KAAK;QACH,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED,wCAAwC;IACxC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAC1B,CAAC;IAED,gDAAgD;IAChD,GAAG,CAAC,GAAW;QACb,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC;IACrC,CAAC;CACF"}