@fgv/ts-res 4.5.0-3 → 5.0.0-2

package/lib/packlets/runtime/resourceResolver.js

@@ -0,0 +1,437 @@
+"use strict";
+/*
+ * Copyright (c) 2025 Erik Fortune
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in all
+ * copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ResourceResolver = void 0;
+const ts_utils_1 = require("@fgv/ts-utils");
+const ts_json_base_1 = require("@fgv/ts-json-base");
+const ts_json_1 = require("@fgv/ts-json");
+const common_1 = require("../common");
+const conditionSetResolutionResult_1 = require("./conditionSetResolutionResult");
+/**
+ * High-performance runtime resource resolver with O(1) condition caching.
+ * Resolves resources for a given context by evaluating conditions against qualifier values
+ * and caching results for optimal performance.
+ * @public
+ */
+class ResourceResolver {
+    /**
+     * The cache array for resolved conditions, indexed by condition index for O(1) lookup.
+     * Each entry stores the resolved {@link Runtime.IConditionMatchResult | condition match result} for
+     * the corresponding condition.
+     */
+    get conditionCache() {
+        return this._conditionCache;
+    }
+    /**
+     * The cache array for resolved condition sets, indexed by condition set index for O(1) lookup.
+     * Each entry stores the resolved ConditionSetResolutionResult for the corresponding condition set.
+     */
+    get conditionSetCache() {
+        return this._conditionSetCache;
+    }
+    /**
+     * The cache array for resolved decisions, indexed by decision index for O(1) lookup.
+     * Each entry stores the resolved DecisionResolutionResult for the corresponding decision.
+     */
+    get decisionCache() {
+        return this._decisionCache;
+    }
+    /**
+     * Constructor for a {@link Runtime.ResourceResolver | ResourceResolver} object.
+     * @param params - {@link Runtime.IResourceResolverCreateParams | Parameters} used to create the resolver.
+     */
+    constructor(params) {
+        this.resourceManager = params.resourceManager;
+        this.qualifierTypes = params.qualifierTypes;
+        this.contextQualifierProvider = params.contextQualifierProvider;
+        // Initialize condition cache array with size matching the condition collector
+        const conditionCollectorSize = this.resourceManager.conditions.size;
+        this._conditionCache = new Array(conditionCollectorSize);
+        // Initialize condition set cache array with size matching the condition set collector
+        const conditionSetCollectorSize = this.resourceManager.conditionSets.size;
+        this._conditionSetCache = new Array(conditionSetCollectorSize);
+        // Initialize decision cache array with size matching the decision collector
+        const decisionCollectorSize = this.resourceManager.decisions.size;
+        this._decisionCache = new Array(decisionCollectorSize);
+        this._listener = params.listener;
+    }
+    /**
+     * Creates a new {@link Runtime.ResourceResolver | ResourceResolver} object.
+     * @param params - {@link Runtime.IResourceResolverCreateParams | Parameters} used to create the resolver.
+     * @returns `Success` with the new {@link Runtime.ResourceResolver | ResourceResolver} object if successful,
+     * or `Failure` with an error message if not.
+     * @public
+     */
+    static create(params) {
+        return (0, ts_utils_1.captureResult)(() => new ResourceResolver(params));
+    }
+    /**
+     * Resolves a condition by evaluating it against the current context.
+     * Uses O(1) caching based on the condition's globally unique sequential index.
+     * @param condition - The {@link Conditions.Condition | condition} to resolve.
+     * @returns `Success` with the {@link QualifierMatchScore | match score} if successful,
+     * or `Failure` with an error message if the condition cannot be resolved.
+     * @public
+     */
+    resolveCondition(condition) {
+        var _a, _b, _c, _d;
+        // Get the condition's index for cache lookup
+        const conditionIndex = condition.index;
+        if (conditionIndex === undefined) {
+            return (0, ts_utils_1.fail)(`Condition "${condition.key}" does not have a valid index`);
+        }
+        // Check cache first for O(1) lookup
+        const cachedResult = this._conditionCache[conditionIndex];
+        if (cachedResult !== undefined) {
+            (_a = this._listener) === null || _a === void 0 ? void 0 : _a.onCacheHit('condition', conditionIndex);
+            return (0, ts_utils_1.succeed)(cachedResult);
+        }
+        // Resolve the condition by getting qualifier value and evaluating with qualifier type
+        const qualifierValueResult = this.contextQualifierProvider.get(condition.qualifier);
+        if (qualifierValueResult.isFailure()) {
+            (_b = this._listener) === null || _b === void 0 ? void 0 : _b.onCacheError('condition', conditionIndex);
+            return (0, ts_utils_1.fail)(`Failed to get qualifier value for "${condition.qualifier.name}": ${qualifierValueResult.message}`);
+        }
+        const qualifierValue = qualifierValueResult.value;
+        // Evaluate the condition using the qualifier type's matching logic
+        const score = condition.qualifier.type.matches(condition.value, qualifierValue, condition.operator);
+        const priority = condition.priority;
+        const scoreAsDefault = (_c = condition.scoreAsDefault) !== null && _c !== void 0 ? _c : common_1.NoMatch;
+        const matchResult = score > common_1.NoMatch
+            ? { score, priority, matchType: 'match' }
+            : scoreAsDefault > common_1.NoMatch
+                ? { score: scoreAsDefault, priority, matchType: 'matchAsDefault' }
+                : { score: common_1.NoMatch, priority, matchType: 'noMatch' };
+        // Cache the resolved value for future O(1) lookup
+        this._conditionCache[conditionIndex] = matchResult;
+        (_d = this._listener) === null || _d === void 0 ? void 0 : _d.onCacheMiss('condition', conditionIndex);
+        return (0, ts_utils_1.succeed)(matchResult);
+    }
+    /**
+     * Resolves a condition set by evaluating all its constituent conditions against the current context.
+     * Uses O(1) caching based on the condition set's globally unique sequential index.
+     * @param conditionSet - The {@link Conditions.ConditionSet | condition set} to resolve.
+     * @returns `Success` with the {@link Runtime.ConditionSetResolutionResult | resolution result} if successful,
+     * or `Failure` with an error message if the condition set cannot be resolved.
+     * @public
+     */
+    resolveConditionSet(conditionSet) {
+        var _a, _b;
+        // Get the condition set's index for cache lookup
+        const conditionSetIndex = conditionSet.index;
+        if (conditionSetIndex === undefined) {
+            return (0, ts_utils_1.fail)(`ConditionSet "${conditionSet.key}" does not have a valid index`);
+        }
+        // Check cache first for O(1) lookup
+        const cachedResult = this._conditionSetCache[conditionSetIndex];
+        if (cachedResult !== undefined) {
+            (_a = this._listener) === null || _a === void 0 ? void 0 : _a.onCacheHit('conditionSet', conditionSetIndex);
+            return (0, ts_utils_1.succeed)(cachedResult);
+        }
+        // Resolve all conditions in the condition set
+        const conditions = [];
+        let matchType = 'match';
+        for (const condition of conditionSet.conditions) {
+            const { value: conditionResult, message: conditionMessage } = this.resolveCondition(condition);
+            if (conditionMessage !== undefined) {
+                /* c8 ignore next 2 - defensive coding: extreme internal error scenario not reachable in normal operation */
+                (_b = this._listener) === null || _b === void 0 ? void 0 : _b.onCacheError('conditionSet', conditionSetIndex);
+                return (0, ts_utils_1.fail)(`Failed to resolve condition "${condition.key}": ${conditionMessage}`);
+            }
+            conditions.push(conditionResult);
+            if (conditionResult.matchType === 'noMatch') {
+                // Cache the failure result
+                return conditionSetResolutionResult_1.ConditionSetResolutionResult.create('noMatch', conditions)
+                    .onSuccess((result) => {
+                    var _a;
+                    this._conditionSetCache[conditionSetIndex] = result;
+                    (_a = this._listener) === null || _a === void 0 ? void 0 : _a.onCacheMiss('conditionSet', conditionSetIndex);
+                    return (0, ts_utils_1.succeed)(result);
+                })
+                    .onFailure((err) => {
+                    var _a;
+                    /* c8 ignore next 4 - defensive coding: extreme internal error scenario not reachable in normal operation */
+                    this._conditionSetCache[conditionSetIndex] = undefined;
+                    (_a = this._listener) === null || _a === void 0 ? void 0 : _a.onCacheError('conditionSet', conditionSetIndex);
+                    return (0, ts_utils_1.fail)(`${conditionSetIndex}: error creating condition set resolution result: ${err}`);
+                });
+            }
+            if (conditionResult.matchType === 'matchAsDefault') {
+                matchType = 'matchAsDefault';
+            }
+        }
+        // Cache the successful result
+        return conditionSetResolutionResult_1.ConditionSetResolutionResult.create(matchType, conditions)
+            .onSuccess((result) => {
+            var _a;
+            this._conditionSetCache[conditionSetIndex] = result;
+            (_a = this._listener) === null || _a === void 0 ? void 0 : _a.onCacheMiss('conditionSet', conditionSetIndex);
+            return (0, ts_utils_1.succeed)(result);
+        })
+            .onFailure((err) => {
+            var _a;
+            /* c8 ignore next 4 - defensive coding: extreme internal error scenario not reachable in normal operation */
+            this._conditionSetCache[conditionSetIndex] = undefined;
+            (_a = this._listener) === null || _a === void 0 ? void 0 : _a.onCacheError('conditionSet', conditionSetIndex);
+            return (0, ts_utils_1.fail)(`${conditionSetIndex}: error creating condition set resolution result: ${err}`);
+        });
+    }
+    /**
+     * Resolves a decision by evaluating all its constituent condition sets against the current context.
+     * Uses O(1) caching based on the decision's globally unique sequential index.
+     * @param decision - The {@link Decisions.AbstractDecision | abstract decision} to resolve.
+     * @returns `Success` with the {@link Runtime.DecisionResolutionResult | resolution result} if successful,
+     * or `Failure` with an error message if the decision cannot be resolved.
+     * @public
+     */
+    resolveDecision(decision) {
+        var _a, _b, _c;
+        // Get the decision's index for cache lookup
+        const decisionIndex = decision.index;
+        if (decisionIndex === undefined) {
+            return (0, ts_utils_1.fail)(`Decision "${decision.key}" does not have a valid index`);
+        }
+        // Check cache first for O(1) lookup
+        const cachedResult = this._decisionCache[decisionIndex];
+        if (cachedResult !== undefined) {
+            (_a = this._listener) === null || _a === void 0 ? void 0 : _a.onCacheHit('decision', decisionIndex);
+            return (0, ts_utils_1.succeed)(cachedResult);
+        }
+        // Resolve all condition sets in the decision
+        const matchingInstanceResults = [];
+        const matchingDefaultInstanceResults = [];
+        for (let instanceIndex = 0; instanceIndex < decision.candidates.length; instanceIndex++) {
+            const candidate = decision.candidates[instanceIndex];
+            const conditionSetResult = this.resolveConditionSet(candidate.conditionSet);
+            if (conditionSetResult.isFailure()) {
+                /* c8 ignore next 2 - defensive coding: extreme internal error scenario not reachable in normal operation */
+                (_b = this._listener) === null || _b === void 0 ? void 0 : _b.onCacheError('decision', decisionIndex);
+                return (0, ts_utils_1.fail)(`${decision.key}: Failed to resolve condition set": ${conditionSetResult.message}`);
+            }
+            const resolution = conditionSetResult.value;
+            // Only include condition sets that match
+            if (resolution.matchType === 'match') {
+                matchingInstanceResults.push({
+                    index: instanceIndex,
+                    result: resolution
+                });
+            }
+            else if (resolution.matchType === 'matchAsDefault') {
+                matchingDefaultInstanceResults.push({
+                    index: instanceIndex,
+                    result: resolution
+                });
+            }
+            // If condition set doesn't match, we simply skip it and continue (don't fail the decision)
+        }
+        // Sort by condition set resolution priority using the proper comparison logic
+        matchingInstanceResults.sort((a, b) => conditionSetResolutionResult_1.ConditionSetResolutionResult.compare(a.result, b.result));
+        matchingDefaultInstanceResults.sort((a, b) => conditionSetResolutionResult_1.ConditionSetResolutionResult.compare(a.result, b.result));
+        // Extract just the instance indices in priority order
+        const instanceIndices = matchingInstanceResults.map((item) => item.index);
+        const defaultInstanceIndices = matchingDefaultInstanceResults.map((item) => item.index);
+        // Cache the successful result
+        const successResult = {
+            success: true,
+            instanceIndices,
+            defaultInstanceIndices
+        };
+        this._decisionCache[decisionIndex] = successResult;
+        (_c = this._listener) === null || _c === void 0 ? void 0 : _c.onCacheMiss('decision', decisionIndex);
+        return (0, ts_utils_1.succeed)(successResult);
+    }
+    /**
+     * Resolves a resource by finding the best matching candidate.
+     * Uses the resource's associated decision to determine the best match based on the current context.
+     * @param resource - The {@link Resources.Resource | resource} to resolve.
+     * @returns `Success` with the best matching candidate if successful,
+     * or `Failure` with an error message if no candidates match or resolution fails.
+     * @public
+     */
+    resolveResource(resource) {
+        // Get the abstract decision from the resource's concrete decision
+        const abstractDecision = resource.decision.baseDecision;
+        // Resolve the decision to get candidate indices in priority order
+        const decisionResult = this.resolveDecision(abstractDecision);
+        /* c8 ignore next 3 - defense in depth almost impossible to hit */
+        if (decisionResult.isFailure()) {
+            return (0, ts_utils_1.fail)(`Failed to resolve decision for resource "${resource.id}": ${decisionResult.message}`);
+        }
+        const resolution = decisionResult.value;
+        // Check if any candidates matched (regular or default)
+        if (!resolution.success ||
+            (resolution.instanceIndices.length === 0 && resolution.defaultInstanceIndices.length === 0)) {
+            return (0, ts_utils_1.fail)(`No matching candidates found for resource "${resource.id}"`);
+        }
+        // Prefer regular matches over default matches
+        const candidateIndex = resolution.instanceIndices.length > 0
+            ? resolution.instanceIndices[0] // Best regular match
+            : resolution.defaultInstanceIndices[0]; // Best default match
+        if (candidateIndex >= resource.candidates.length) {
+            return (0, ts_utils_1.fail)(`Invalid candidate index ${candidateIndex} for resource "${resource.id}"`);
+        }
+        const bestCandidate = resource.candidates[candidateIndex];
+        return (0, ts_utils_1.succeed)(bestCandidate);
+    }
+    /**
+     * Resolves all matching resource candidates in priority order.
+     * Uses the resource's associated decision to determine all matching candidates based on the current context.
+     * @param resource - The {@link Resources.Resource | resource} to resolve.
+     * @returns `Success` with an array of all matching candidates in priority order if successful,
+     * or `Failure` with an error message if no candidates match or resolution fails.
+     * @public
+     */
+    resolveAllResourceCandidates(resource) {
+        // Get the abstract decision from the resource's concrete decision
+        const abstractDecision = resource.decision.baseDecision;
+        // Resolve the decision to get candidate indices in priority order
+        const decisionResult = this.resolveDecision(abstractDecision);
+        /* c8 ignore next 3 - defense in depth almost impossible to hit */
+        if (decisionResult.isFailure()) {
+            return (0, ts_utils_1.fail)(`Failed to resolve decision for resource "${resource.id}": ${decisionResult.message}`);
+        }
+        const resolution = decisionResult.value;
+        // Check if any candidates matched (regular or default)
+        if (!resolution.success ||
+            (resolution.instanceIndices.length === 0 && resolution.defaultInstanceIndices.length === 0)) {
+            return (0, ts_utils_1.fail)(`No matching candidates found for resource "${resource.id}"`);
+        }
+        // Get all matching candidates: regular matches first, then default matches
+        const candidates = [];
+        // Add all regular matches first (already sorted by priority)
+        for (const candidateIndex of resolution.instanceIndices) {
+            if (candidateIndex >= resource.candidates.length) {
+                return (0, ts_utils_1.fail)(`Invalid candidate index ${candidateIndex} for resource "${resource.id}"`);
+            }
+            const candidate = resource.candidates[candidateIndex];
+            candidates.push(candidate);
+        }
+        // Add all default matches after regular matches (already sorted by priority)
+        for (const candidateIndex of resolution.defaultInstanceIndices) {
+            /* c8 ignore next 3 - defensive coding: extreme internal error scenario not reachable in normal operation */
+            if (candidateIndex >= resource.candidates.length) {
+                return (0, ts_utils_1.fail)(`Invalid candidate index ${candidateIndex} for resource "${resource.id}"`);
+            }
+            const candidate = resource.candidates[candidateIndex];
+            candidates.push(candidate);
+        }
+        return (0, ts_utils_1.succeed)(candidates);
+    }
+    /**
+     * Resolves a resource to a composed value by merging matching candidates according to their merge methods.
+     * Starting from the highest priority candidates, finds the first "full" candidate and merges all higher
+     * priority "partial" candidates into it in ascending order of priority.
+     * @param resource - The {@link Resources.Resource | resource} to resolve.
+     * @returns `Success` with the composed JsonValue if successful,
+     * or `Failure` with an error message if no candidates match or resolution fails.
+     * @public
+     */
+    resolveComposedResourceValue(resource) {
+        return this.resolveAllResourceCandidates(resource).onSuccess((candidates) => {
+            /* c8 ignore next 3 - defense in depth should never occur */
+            if (candidates.length === 0) {
+                return (0, ts_utils_1.fail)(`${resource.id}: No matching candidates found.`);
+            }
+            // Find the first full candidate and collect all partial candidates above it
+            let fullCandidateIndex = -1;
+            const partialCandidates = [];
+            for (let i = 0; i < candidates.length; i++) {
+                const candidate = candidates[i];
+                if (!candidate.isPartial) {
+                    // Found the first full candidate
+                    fullCandidateIndex = i;
+                    break;
+                }
+                else {
+                    // Collect partial candidates (these are in ascending priority order)
+                    partialCandidates.unshift(candidate);
+                }
+            }
+            // If no full candidate found, use the last candidate as the base
+            const baseCandidateIndex = fullCandidateIndex >= 0 ? fullCandidateIndex : candidates.length - 1;
+            const baseCandidate = candidates[baseCandidateIndex];
+            // If there are no partial candidates to merge, return the base candidate's value
+            if (partialCandidates.length === 0) {
+                return (0, ts_utils_1.succeed)(baseCandidate.json);
+            }
+            const allCandidates = [
+                baseCandidate.json,
+                ...partialCandidates.map((candidate) => candidate.json)
+            ].filter((v) => (0, ts_json_base_1.isJsonObject)(v));
+            /* c8 ignore next 3 - defensive check: non-object values in resource candidates should be prevented at validation time */
+            if (allCandidates.length !== partialCandidates.length + 1) {
+                return (0, ts_utils_1.fail)(`${resource.id}: Unable to compose non-object candidate values.`);
+            }
+            // Create JsonEditor with array replacement behavior for resource composition
+            const editor = ts_json_1.JsonEditor.create({
+                merge: {
+                    arrayMergeBehavior: 'replace'
+                }
+            }).orThrow(); // Should never fail with valid options
+            return editor
+                .mergeObjectsInPlace({}, allCandidates)
+                .withErrorFormat((err) => `${resource.id}: Composition failed: ${err}`);
+        });
+    }
+    /**
+     * Clears all caches (condition, condition set, and decision), forcing all cached items
+     * to be re-evaluated on next access. This should be called when the context changes and cached
+     * results are no longer valid.
+     * @public
+     */
+    clearConditionCache() {
+        var _a, _b, _c;
+        this._conditionCache.fill(undefined);
+        this._conditionSetCache.fill(undefined);
+        this._decisionCache.fill(undefined);
+        (_a = this._listener) === null || _a === void 0 ? void 0 : _a.onCacheClear('condition');
+        (_b = this._listener) === null || _b === void 0 ? void 0 : _b.onCacheClear('conditionSet');
+        (_c = this._listener) === null || _c === void 0 ? void 0 : _c.onCacheClear('decision');
+    }
+    /**
+     * Gets the current size of the condition cache array.
+     * @returns The size of the condition cache array.
+     * @public
+     */
+    get conditionCacheSize() {
+        return this._conditionCache.length;
+    }
+    /**
+     * Gets the current size of the condition set cache array.
+     * @returns The size of the condition set cache array.
+     * @public
+     */
+    get conditionSetCacheSize() {
+        return this._conditionSetCache.length;
+    }
+    /**
+     * Gets the current size of the decision cache array.
+     * @returns The size of the decision cache array.
+     * @public
+     */
+    get decisionCacheSize() {
+        return this._decisionCache.length;
+    }
+}
+exports.ResourceResolver = ResourceResolver;
+//# sourceMappingURL=resourceResolver.js.map

package/lib/packlets/runtime/resourceResolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resourceResolver.js","sourceRoot":"","sources":["../../../src/packlets/runtime/resourceResolver.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;AAEH,4CAAqE;AACrE,oDAAwE;AACxE,0CAA0C;AAC1C,sCAAoC;AAMpC,iFAIwC;AA0CxC;;;;;GAKG;AACH,MAAa,gBAAgB;IAgB3B;;;;OAIG;IACH,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IAED;;;OAGG;IACH,IAAW,iBAAiB;QAC1B,OAAO,IAAI,CAAC,kBAAkB,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,IAAW,aAAa;QACtB,OAAO,IAAI,CAAC,cAAc,CAAC;IAC7B,CAAC;IAyBD;;;OAGG;IACH,YAAsB,MAAqC;QACzD,IAAI,CAAC,eAAe,GAAG,MAAM,CAAC,eAAe,CAAC;QAC9C,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC,cAAc,CAAC;QAC5C,IAAI,CAAC,wBAAwB,GAAG,MAAM,CAAC,wBAAwB,CAAC;QAEhE,8EAA8E;QAC9E,MAAM,sBAAsB,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,IAAI,CAAC;QACpE,IAAI,CAAC,eAAe,GAAG,IAAI,KAAK,CAAoC,sBAAsB,CAAC,CAAC;QAE5F,sFAAsF;QACtF,MAAM,yBAAyB,GAAG,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,IAAI,CAAC;QAC1E,IAAI,CAAC,kBAAkB,GAAG,IAAI,KAAK,CAA2C,yBAAyB,CAAC,CAAC;QAEzG,4EAA4E;QAC5E,MAAM,qBAAqB,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,IAAI,CAAC;QAClE,IAAI,CAAC,cAAc,GAAG,IAAI,KAAK,CAAuC,qBAAqB,CAAC,CAAC;QAE7F,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC;IACnC,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,MAAM,CAAC,MAAqC;QACxD,OAAO,IAAA,wBAAa,EAAC,GAAG,EAAE,CAAC,IAAI,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED;;;;;;;OAOG;IACI,gBAAgB,CAAC,SAAoB;;QAC1C,6CAA6C;QAC7C,MAAM,cAAc,GAAG,SAAS,CAAC,KAAK,CAAC;QACvC,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YACjC,OAAO,IAAA,eAAI,EAAC,cAAc,SAAS,CAAC,GAAG,+BAA+B,CAAC,CAAC;QAC1E,CAAC;QAED,oCAAoC;QACpC,MAAM,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,cAAc,CAAC,CAAC;QAC1D,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC/B,MAAA,IAAI,CAAC,SAAS,0CAAE,UAAU,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC;YACxD,OAAO,IAAA,kBAAO,EAAC,YAAY,CAAC,CAAC;QAC/B,CAAC;QAED,sFAAsF;QACtF,MAAM,oBAAoB,GAAG,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACpF,IAAI,oBAAoB,CAAC,SAAS,EAAE,EAAE,CAAC;YACrC,MAAA,IAAI,CAAC,SAAS,0CAAE,YAAY,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC;YAC1D,OAAO,IAAA,eAAI,EACT,sCAAsC,SAAS,CAAC,SAAS,CAAC,IAAI,MAAM,oBAAoB,CAAC,OAAO,EAAE,CACnG,CAAC;QACJ,CAAC;QAED,MAAM,cAAc,GAAG,oBAAoB,CAAC,KAAK,CAAC;QAElD,mEAAmE;QACnE,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,EAAE,cAAc,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC;QACpG,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;QACpC,MAAM,cAAc,GAAG,MAAA,SAAS,CAAC,cAAc,mCAAI,gBAAO,CAAC;QAC3D,MAAM,WAAW,GACf,KAAK,GAAG,gBAAO;YACb,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE;YACzC,CAAC,CAAC,cAAc,GAAG,gBAAO;gBAC1B,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,SAAS,EAAE,gBAAgB,EAAE;gBAClE,CAAC,CAAC,EAAE,KAAK,EAAE,gBAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC;QAEzD,kDAAkD;QAClD,IAAI,CAAC,eAAe,CAAC,cAAc,CAAC,GAAG,WAAW,CAAC;QACnD,MAAA,IAAI,CAAC,SAAS,0CAAE,WAAW,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC;QAEzD,OAAO,IAAA,kBAAO,EAAC,WAAW,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;;OAOG;IACI,mBAAmB,CAAC,YAA0B;;QACnD,iDAAiD;QACjD,MAAM,iBAAiB,GAAG,YAAY,CAAC,KAAK,CAAC;QAC7C,IAAI,iBAAiB,KAAK,SAAS,EAAE,CAAC;YACpC,OAAO,IAAA,eAAI,EAAC,iBAAiB,YAAY,CAAC,GAAG,+BAA+B,CAAC,CAAC;QAChF,CAAC;QAED,oCAAoC;QACpC,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,CAAC;QAChE,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC/B,MAAA,IAAI,CAAC,SAAS,0CAAE,UAAU,CAAC,cAAc,EAAE,iBAAiB,CAAC,CAAC;YAC9D,OAAO,IAAA,kBAAO,EAAC,YAAY,CAAC,CAAC;QAC/B,CAAC;QAED,8CAA8C;QAC9C,MAAM,UAAU,GAAiC,EAAE,CAAC;QACpD,IAAI,SAAS,GAAuB,OAAO,CAAC;QAE5C,KAAK,MAAM,SAAS,IAAI,YAAY,CAAC,UAAU,EAAE,CAAC;YAChD,MAAM,EAAE,KAAK,EAAE,eAAe,EAAE,OAAO,EAAE,gBAAgB,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;YAE/F,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;gBACnC,4GAA4G;gBAC5G,MAAA,IAAI,CAAC,SAAS,0CAAE,YAAY,CAAC,cAAc,EAAE,iBAAiB,CAAC,CAAC;gBAChE,OAAO,IAAA,eAAI,EAAC,gCAAgC,SAAS,CAAC,GAAG,MAAM,gBAAgB,EAAE,CAAC,CAAC;YACrF,CAAC;YAED,UAAU,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAEjC,IAAI,eAAe,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5C,2BAA2B;gBAC3B,OAAO,2DAA4B,CAAC,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC;qBAC9D,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE;;oBACpB,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,GAAG,MAAM,CAAC;oBACpD,MAAA,IAAI,CAAC,SAAS,0CAAE,WAAW,CAAC,cAAc,EAAE,iBAAiB,CAAC,CAAC;oBAC/D,OAAO,IAAA,kBAAO,EAAC,MAAM,CAAC,CAAC;gBACzB,CAAC,CAAC;qBACD,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE;;oBACjB,4GAA4G;oBAC5G,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,GAAG,SAAS,CAAC;oBACvD,MAAA,IAAI,CAAC,SAAS,0CAAE,YAAY,CAAC,cAAc,EAAE,iBAAiB,CAAC,CAAC;oBAChE,OAAO,IAAA,eAAI,EAAC,GAAG,iBAAiB,qDAAqD,GAAG,EAAE,CAAC,CAAC;gBAC9F,CAAC,CAAC,CAAC;YACP,CAAC;YAED,IAAI,eAAe,CAAC,SAAS,KAAK,gBAAgB,EAAE,CAAC;gBACnD,SAAS,GAAG,gBAAgB,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,8BAA8B;QAC9B,OAAO,2DAA4B,CAAC,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC;aAC9D,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE;;YACpB,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,GAAG,MAAM,CAAC;YACpD,MAAA,IAAI,CAAC,SAAS,0CAAE,WAAW,CAAC,cAAc,EAAE,iBAAiB,CAAC,CAAC;YAC/D,OAAO,IAAA,kBAAO,EAAC,MAAM,CAAC,CAAC;QACzB,CAAC,CAAC;aACD,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE;;YACjB,4GAA4G;YAC5G,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,GAAG,SAAS,CAAC;YACvD,MAAA,IAAI,CAAC,SAAS,0CAAE,YAAY,CAAC,cAAc,EAAE,iBAAiB,CAAC,CAAC;YAChE,OAAO,IAAA,eAAI,EAAC,GAAG,iBAAiB,qDAAqD,GAAG,EAAE,CAAC,CAAC;QAC9F,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;;;;OAOG;IACI,eAAe,CAAC,QAA0B;;QAC/C,4CAA4C;QAC5C,MAAM,aAAa,GAAG,QAAQ,CAAC,KAAK,CAAC;QACrC,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;YAChC,OAAO,IAAA,eAAI,EAAC,aAAa,QAAQ,CAAC,GAAG,+BAA+B,CAAC,CAAC;QACxE,CAAC;QAED,oCAAoC;QACpC,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;QACxD,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC/B,MAAA,IAAI,CAAC,SAAS,0CAAE,UAAU,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;YACtD,OAAO,IAAA,kBAAO,EAAC,YAAY,CAAC,CAAC;QAC/B,CAAC;QAED,6CAA6C;QAC7C,MAAM,uBAAuB,GAAmE,EAAE,CAAC;QACnG,MAAM,8BAA8B,GAAmE,EAAE,CAAC;QAE1G,KAAK,IAAI,aAAa,GAAG,CAAC,EAAE,aAAa,GAAG,QAAQ,CAAC,UAAU,CAAC,MAAM,EAAE,aAAa,EAAE,EAAE,CAAC;YACxF,MAAM,SAAS,GAAG,QAAQ,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC;YACrD,MAAM,kBAAkB,GAAG,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;YAE5E,IAAI,kBAAkB,CAAC,SAAS,EAAE,EAAE,CAAC;gBACnC,4GAA4G;gBAC5G,MAAA,IAAI,CAAC,SAAS,0CAAE,YAAY,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;gBACxD,OAAO,IAAA,eAAI,EAAC,GAAG,QAAQ,CAAC,GAAG,uCAAuC,kBAAkB,CAAC,OAAO,EAAE,CAAC,CAAC;YAClG,CAAC;YAED,MAAM,UAAU,GAAG,kBAAkB,CAAC,KAAK,CAAC;YAE5C,yCAAyC;YACzC,IAAI,UAAU,CAAC,SAAS,KAAK,OAAO,EAAE,CAAC;gBACrC,uBAAuB,CAAC,IAAI,CAAC;oBAC3B,KAAK,EAAE,aAAa;oBACpB,MAAM,EAAE,UAAU;iBACnB,CAAC,CAAC;YACL,CAAC;iBAAM,IAAI,UAAU,CAAC,SAAS,KAAK,gBAAgB,EAAE,CAAC;gBACrD,8BAA8B,CAAC,IAAI,CAAC;oBAClC,KAAK,EAAE,aAAa;oBACpB,MAAM,EAAE,UAAU;iBACnB,CAAC,CAAC;YACL,CAAC;YACD,2FAA2F;QAC7F,CAAC;QAED,8EAA8E;QAC9E,uBAAuB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,2DAA4B,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACjG,8BAA8B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,2DAA4B,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAExG,sDAAsD;QACtD,MAAM,eAAe,GAAG,uBAAuB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1E,MAAM,sBAAsB,GAAG,8BAA8B,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAExF,8BAA8B;QAC9B,MAAM,aAAa,GAA6B;YAC9C,OAAO,EAAE,IAAI;YACb,eAAe;YACf,sBAAsB;SACvB,CAAC;QACF,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,GAAG,aAAa,CAAC;QACnD,MAAA,IAAI,CAAC,SAAS,0CAAE,WAAW,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;QAEvD,OAAO,IAAA,kBAAO,EAAC,aAAa,CAAC,CAAC;IAChC,CAAC;IAED;;;;;;;OAOG;IACI,eAAe,CAAC,QAAmB;QACxC,kEAAkE;QAClE,MAAM,gBAAgB,GAAG,QAAQ,CAAC,QAAQ,CAAC,YAAY,CAAC;QAExD,kEAAkE;QAClE,MAAM,cAAc,GAAG,IAAI,CAAC,eAAe,CAAC,gBAAgB,CAAC,CAAC;QAC9D,kEAAkE;QAClE,IAAI,cAAc,CAAC,SAAS,EAAE,EAAE,CAAC;YAC/B,OAAO,IAAA,eAAI,EAAC,4CAA4C,QAAQ,CAAC,EAAE,MAAM,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC;QACrG,CAAC;QAED,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC;QAExC,uDAAuD;QACvD,IACE,CAAC,UAAU,CAAC,OAAO;YACnB,CAAC,UAAU,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,sBAAsB,CAAC,MAAM,KAAK,CAAC,CAAC,EAC3F,CAAC;YACD,OAAO,IAAA,eAAI,EAAC,8CAA8C,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC;QAC5E,CAAC;QAED,8CAA8C;QAC9C,MAAM,cAAc,GAClB,UAAU,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC;YACnC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,qBAAqB;YACrD,CAAC,CAAC,UAAU,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,qBAAqB;QAEjE,IAAI,cAAc,IAAI,QAAQ,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;YACjD,OAAO,IAAA,eAAI,EAAC,2BAA2B,cAAc,kBAAkB,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC;QACzF,CAAC;QAED,MAAM,aAAa,GAAG,QAAQ,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;QAC1D,OAAO,IAAA,kBAAO,EAAC,aAAa,CAAC,CAAC;IAChC,CAAC;IAED;;;;;;;OAOG;IACI,4BAA4B,CAAC,QAAmB;QACrD,kEAAkE;QAClE,MAAM,gBAAgB,GAAG,QAAQ,CAAC,QAAQ,CAAC,YAAY,CAAC;QAExD,kEAAkE;QAClE,MAAM,cAAc,GAAG,IAAI,CAAC,eAAe,CAAC,gBAAgB,CAAC,CAAC;QAC9D,kEAAkE;QAClE,IAAI,cAAc,CAAC,SAAS,EAAE,EAAE,CAAC;YAC/B,OAAO,IAAA,eAAI,EAAC,4CAA4C,QAAQ,CAAC,EAAE,MAAM,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC;QACrG,CAAC;QAED,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC;QAExC,uDAAuD;QACvD,IACE,CAAC,UAAU,CAAC,OAAO;YACnB,CAAC,UAAU,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,sBAAsB,CAAC,MAAM,KAAK,CAAC,CAAC,EAC3F,CAAC;YACD,OAAO,IAAA,eAAI,EAAC,8CAA8C,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC;QAC5E,CAAC;QAED,2EAA2E;QAC3E,MAAM,UAAU,GAAyB,EAAE,CAAC;QAE5C,6DAA6D;QAC7D,KAAK,MAAM,cAAc,IAAI,UAAU,CAAC,eAAe,EAAE,CAAC;YACxD,IAAI,cAAc,IAAI,QAAQ,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;gBACjD,OAAO,IAAA,eAAI,EAAC,2BAA2B,cAAc,kBAAkB,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC;YACzF,CAAC;YACD,MAAM,SAAS,GAAG,QAAQ,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;YACtD,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7B,CAAC;QAED,6EAA6E;QAC7E,KAAK,MAAM,cAAc,IAAI,UAAU,CAAC,sBAAsB,EAAE,CAAC;YAC/D,4GAA4G;YAC5G,IAAI,cAAc,IAAI,QAAQ,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;gBACjD,OAAO,IAAA,eAAI,EAAC,2BAA2B,cAAc,kBAAkB,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC;YACzF,CAAC;YACD,MAAM,SAAS,GAAG,QAAQ,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;YACtD,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7B,CAAC;QAED,OAAO,IAAA,kBAAO,EAAC,UAAU,CAAC,CAAC;IAC7B,CAAC;IAED;;;;;;;;OAQG;IACI,4BAA4B,CAAC,QAAmB;QACrD,OAAO,IAAI,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,EAAE;YAC1E,4DAA4D;YAC5D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5B,OAAO,IAAA,eAAI,EAAC,GAAG,QAAQ,CAAC,EAAE,iCAAiC,CAAC,CAAC;YAC/D,CAAC;YAED,4EAA4E;YAC5E,IAAI,kBAAkB,GAAG,CAAC,CAAC,CAAC;YAC5B,MAAM,iBAAiB,GAAyB,EAAE,CAAC;YAEnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;gBAChC,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;oBACzB,iCAAiC;oBACjC,kBAAkB,GAAG,CAAC,CAAC;oBACvB,MAAM;gBACR,CAAC;qBAAM,CAAC;oBACN,qEAAqE;oBACrE,iBAAiB,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;YAED,iEAAiE;YACjE,MAAM,kBAAkB,GAAG,kBAAkB,IAAI,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;YAChG,MAAM,aAAa,GAAG,UAAU,CAAC,kBAAkB,CAAC,CAAC;YAErD,iFAAiF;YACjF,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACnC,OAAO,IAAA,kBAAO,EAAC,aAAa,CAAC,IAAI,CAAC,CAAC;YACrC,CAAC;YAED,MAAM,aAAa,GAAG;gBACpB,aAAa,CAAC,IAAI;gBAClB,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC;aACxD,CAAC,MAAM,CAAC,CAAC,CAAC,EAAmB,EAAE,CAAC,IAAA,2BAAY,EAAC,CAAC,CAAC,CAAC,CAAC;YAElD,yHAAyH;YACzH,IAAI,aAAa,CAAC,MAAM,KAAK,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1D,OAAO,IAAA,eAAI,EAAC,GAAG,QAAQ,CAAC,EAAE,kDAAkD,CAAC,CAAC;YAChF,CAAC;YAED,6EAA6E;YAC7E,MAAM,MAAM,GAAG,oBAAU,CAAC,MAAM,CAAC;gBAC/B,KAAK,EAAE;oBACL,kBAAkB,EAAE,SAAS;iBAC9B;aACF,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,uCAAuC;YAErD,OAAO,MAAM;iBACV,mBAAmB,CAAC,EAAE,EAAE,aAAa,CAAC;iBACtC,eAAe,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,QAAQ,CAAC,EAAE,yBAAyB,GAAG,EAAE,CAAC,CAAC;QAC5E,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACI,mBAAmB;;QACxB,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACxC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAEpC,MAAA,IAAI,CAAC,SAAS,0CAAE,YAAY,CAAC,WAAW,CAAC,CAAC;QAC1C,MAAA,IAAI,CAAC,SAAS,0CAAE,YAAY,CAAC,cAAc,CAAC,CAAC;QAC7C,MAAA,IAAI,CAAC,SAAS,0CAAE,YAAY,CAAC,UAAU,CAAC,CAAC;IAC3C,CAAC;IAED;;;;OAIG;IACH,IAAW,kBAAkB;QAC3B,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC;IACrC,CAAC;IAED;;;;OAIG;IACH,IAAW,qBAAqB;QAC9B,OAAO,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC;IACxC,CAAC;IAED;;;;OAIG;IACH,IAAW,iBAAiB;QAC1B,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC;IACpC,CAAC;CACF;AAnfD,4CAmfC","sourcesContent":["/*\n * Copyright (c) 2025 Erik Fortune\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport { Result, captureResult, fail, succeed } from '@fgv/ts-utils';\nimport { JsonValue, JsonObject, isJsonObject } from '@fgv/ts-json-base';\nimport { JsonEditor } from '@fgv/ts-json';\nimport { NoMatch } from '../common';\nimport { Condition, ConditionSet } from '../conditions';\nimport { AbstractDecision } from '../decisions';\nimport { ReadOnlyQualifierTypeCollector } from '../qualifier-types';\nimport { IContextQualifierProvider } from './context';\nimport { IResourceManager, IResource, IResourceCandidate } from './iResourceManager';\nimport {\n  ConditionMatchType,\n  ConditionSetResolutionResult,\n  IConditionMatchResult\n} from './conditionSetResolutionResult';\nimport { IResourceResolverCacheListener } from './cacheListener';\n\n/**\n * Represents the cached result of resolving a decision.\n * Contains either a failure indicator or a list of instance indices for matching condition sets,\n * ordered by condition set priority.\n * @public\n */\nexport type DecisionResolutionResult =\n  | { success: false }\n  | { success: true; instanceIndices: ReadonlyArray<number>; defaultInstanceIndices: ReadonlyArray<number> };\n\n/**\n * Parameters for creating a {@link Runtime.ResourceResolver | ResourceResolver}.\n * @public\n */\nexport interface IResourceResolverCreateParams {\n  /**\n   * The {@link Runtime.IResourceManager | resource manager} that defines the resources available\n   * and provides access to qualifiers and conditions.\n   */\n  resourceManager: IResourceManager;\n\n  /**\n   * The {@link QualifierTypes.ReadOnlyQualifierTypeCollector | readonly qualifier type collector}\n   * that provides qualifier implementations for condition evaluation.\n   */\n  qualifierTypes: ReadOnlyQualifierTypeCollector;\n\n  /**\n   * The {@link Runtime.Context.IContextQualifierProvider | context qualifier provider} that resolves\n   * qualifier values for the current context.\n   */\n  contextQualifierProvider: IContextQualifierProvider;\n\n  /**\n   * An optional listener for {@link Runtime.ResourceResolver | ResourceResolver} cache activity.\n   */\n  listener?: IResourceResolverCacheListener;\n}\n\n/**\n * High-performance runtime resource resolver with O(1) condition caching.\n * Resolves resources for a given context by evaluating conditions against qualifier values\n * and caching results for optimal performance.\n * @public\n */\nexport class ResourceResolver {\n  /**\n   * The resource manager that defines available resources and provides condition access.\n   */\n  public readonly resourceManager: IResourceManager;\n\n  /**\n   * The readonly qualifier type collector that provides qualifier implementations.\n   */\n  public readonly qualifierTypes: ReadOnlyQualifierTypeCollector;\n\n  /**\n   * The context qualifier provider that resolves qualifier values.\n   */\n  public readonly contextQualifierProvider: IContextQualifierProvider;\n\n  /**\n   * The cache array for resolved conditions, indexed by condition index for O(1) lookup.\n   * Each entry stores the resolved {@link Runtime.IConditionMatchResult | condition match result} for\n   * the corresponding condition.\n   */\n  public get conditionCache(): ReadonlyArray<IConditionMatchResult | undefined> {\n    return this._conditionCache;\n  }\n\n  /**\n   * The cache array for resolved condition sets, indexed by condition set index for O(1) lookup.\n   * Each entry stores the resolved ConditionSetResolutionResult for the corresponding condition set.\n   */\n  public get conditionSetCache(): ReadonlyArray<ConditionSetResolutionResult | undefined> {\n    return this._conditionSetCache;\n  }\n\n  /**\n   * The cache array for resolved decisions, indexed by decision index for O(1) lookup.\n   * Each entry stores the resolved DecisionResolutionResult for the corresponding decision.\n   */\n  public get decisionCache(): ReadonlyArray<DecisionResolutionResult | undefined> {\n    return this._decisionCache;\n  }\n\n  /**\n   * Cache array for resolved conditions, indexed by condition index for O(1) lookup.\n   * Each entry stores the resolved QualifierMatchScore for the corresponding condition.\n   */\n  private readonly _conditionCache: Array<IConditionMatchResult | undefined>;\n\n  /**\n   * Cache array for resolved condition sets, indexed by condition set index for O(1) lookup.\n   * Each entry stores the resolved ConditionSetResolutionResult for the corresponding condition set.\n   */\n  private readonly _conditionSetCache: Array<ConditionSetResolutionResult | undefined>;\n\n  /**\n   * Cache array for resolved decisions, indexed by decision index for O(1) lookup.\n   * Each entry stores the resolved DecisionResolutionResult for the corresponding decision.\n   */\n  private readonly _decisionCache: Array<DecisionResolutionResult | undefined>;\n\n  /**\n   * The listener for {@link Runtime.ResourceResolver | ResourceResolver} cache activity.\n   */\n  private readonly _listener?: IResourceResolverCacheListener;\n\n  /**\n   * Constructor for a {@link Runtime.ResourceResolver | ResourceResolver} object.\n   * @param params - {@link Runtime.IResourceResolverCreateParams | Parameters} used to create the resolver.\n   */\n  protected constructor(params: IResourceResolverCreateParams) {\n    this.resourceManager = params.resourceManager;\n    this.qualifierTypes = params.qualifierTypes;\n    this.contextQualifierProvider = params.contextQualifierProvider;\n\n    // Initialize condition cache array with size matching the condition collector\n    const conditionCollectorSize = this.resourceManager.conditions.size;\n    this._conditionCache = new Array<IConditionMatchResult | undefined>(conditionCollectorSize);\n\n    // Initialize condition set cache array with size matching the condition set collector\n    const conditionSetCollectorSize = this.resourceManager.conditionSets.size;\n    this._conditionSetCache = new Array<ConditionSetResolutionResult | undefined>(conditionSetCollectorSize);\n\n    // Initialize decision cache array with size matching the decision collector\n    const decisionCollectorSize = this.resourceManager.decisions.size;\n    this._decisionCache = new Array<DecisionResolutionResult | undefined>(decisionCollectorSize);\n\n    this._listener = params.listener;\n  }\n\n  /**\n   * Creates a new {@link Runtime.ResourceResolver | ResourceResolver} object.\n   * @param params - {@link Runtime.IResourceResolverCreateParams | Parameters} used to create the resolver.\n   * @returns `Success` with the new {@link Runtime.ResourceResolver | ResourceResolver} object if successful,\n   * or `Failure` with an error message if not.\n   * @public\n   */\n  public static create(params: IResourceResolverCreateParams): Result<ResourceResolver> {\n    return captureResult(() => new ResourceResolver(params));\n  }\n\n  /**\n   * Resolves a condition by evaluating it against the current context.\n   * Uses O(1) caching based on the condition's globally unique sequential index.\n   * @param condition - The {@link Conditions.Condition | condition} to resolve.\n   * @returns `Success` with the {@link QualifierMatchScore | match score} if successful,\n   * or `Failure` with an error message if the condition cannot be resolved.\n   * @public\n   */\n  public resolveCondition(condition: Condition): Result<IConditionMatchResult> {\n    // Get the condition's index for cache lookup\n    const conditionIndex = condition.index;\n    if (conditionIndex === undefined) {\n      return fail(`Condition \"${condition.key}\" does not have a valid index`);\n    }\n\n    // Check cache first for O(1) lookup\n    const cachedResult = this._conditionCache[conditionIndex];\n    if (cachedResult !== undefined) {\n      this._listener?.onCacheHit('condition', conditionIndex);\n      return succeed(cachedResult);\n    }\n\n    // Resolve the condition by getting qualifier value and evaluating with qualifier type\n    const qualifierValueResult = this.contextQualifierProvider.get(condition.qualifier);\n    if (qualifierValueResult.isFailure()) {\n      this._listener?.onCacheError('condition', conditionIndex);\n      return fail(\n        `Failed to get qualifier value for \"${condition.qualifier.name}\": ${qualifierValueResult.message}`\n      );\n    }\n\n    const qualifierValue = qualifierValueResult.value;\n\n    // Evaluate the condition using the qualifier type's matching logic\n    const score = condition.qualifier.type.matches(condition.value, qualifierValue, condition.operator);\n    const priority = condition.priority;\n    const scoreAsDefault = condition.scoreAsDefault ?? NoMatch;\n    const matchResult: IConditionMatchResult =\n      score > NoMatch\n        ? { score, priority, matchType: 'match' }\n        : scoreAsDefault > NoMatch\n        ? { score: scoreAsDefault, priority, matchType: 'matchAsDefault' }\n        : { score: NoMatch, priority, matchType: 'noMatch' };\n\n    // Cache the resolved value for future O(1) lookup\n    this._conditionCache[conditionIndex] = matchResult;\n    this._listener?.onCacheMiss('condition', conditionIndex);\n\n    return succeed(matchResult);\n  }\n\n  /**\n   * Resolves a condition set by evaluating all its constituent conditions against the current context.\n   * Uses O(1) caching based on the condition set's globally unique sequential index.\n   * @param conditionSet - The {@link Conditions.ConditionSet | condition set} to resolve.\n   * @returns `Success` with the {@link Runtime.ConditionSetResolutionResult | resolution result} if successful,\n   * or `Failure` with an error message if the condition set cannot be resolved.\n   * @public\n   */\n  public resolveConditionSet(conditionSet: ConditionSet): Result<ConditionSetResolutionResult> {\n    // Get the condition set's index for cache lookup\n    const conditionSetIndex = conditionSet.index;\n    if (conditionSetIndex === undefined) {\n      return fail(`ConditionSet \"${conditionSet.key}\" does not have a valid index`);\n    }\n\n    // Check cache first for O(1) lookup\n    const cachedResult = this._conditionSetCache[conditionSetIndex];\n    if (cachedResult !== undefined) {\n      this._listener?.onCacheHit('conditionSet', conditionSetIndex);\n      return succeed(cachedResult);\n    }\n\n    // Resolve all conditions in the condition set\n    const conditions: Array<IConditionMatchResult> = [];\n    let matchType: ConditionMatchType = 'match';\n\n    for (const condition of conditionSet.conditions) {\n      const { value: conditionResult, message: conditionMessage } = this.resolveCondition(condition);\n\n      if (conditionMessage !== undefined) {\n        /* c8 ignore next 2 - defensive coding: extreme internal error scenario not reachable in normal operation */\n        this._listener?.onCacheError('conditionSet', conditionSetIndex);\n        return fail(`Failed to resolve condition \"${condition.key}\": ${conditionMessage}`);\n      }\n\n      conditions.push(conditionResult);\n\n      if (conditionResult.matchType === 'noMatch') {\n        // Cache the failure result\n        return ConditionSetResolutionResult.create('noMatch', conditions)\n          .onSuccess((result) => {\n            this._conditionSetCache[conditionSetIndex] = result;\n            this._listener?.onCacheMiss('conditionSet', conditionSetIndex);\n            return succeed(result);\n          })\n          .onFailure((err) => {\n            /* c8 ignore next 4 - defensive coding: extreme internal error scenario not reachable in normal operation */\n            this._conditionSetCache[conditionSetIndex] = undefined;\n            this._listener?.onCacheError('conditionSet', conditionSetIndex);\n            return fail(`${conditionSetIndex}: error creating condition set resolution result: ${err}`);\n          });\n      }\n\n      if (conditionResult.matchType === 'matchAsDefault') {\n        matchType = 'matchAsDefault';\n      }\n    }\n\n    // Cache the successful result\n    return ConditionSetResolutionResult.create(matchType, conditions)\n      .onSuccess((result) => {\n        this._conditionSetCache[conditionSetIndex] = result;\n        this._listener?.onCacheMiss('conditionSet', conditionSetIndex);\n        return succeed(result);\n      })\n      .onFailure((err) => {\n        /* c8 ignore next 4 - defensive coding: extreme internal error scenario not reachable in normal operation */\n        this._conditionSetCache[conditionSetIndex] = undefined;\n        this._listener?.onCacheError('conditionSet', conditionSetIndex);\n        return fail(`${conditionSetIndex}: error creating condition set resolution result: ${err}`);\n      });\n  }\n\n  /**\n   * Resolves a decision by evaluating all its constituent condition sets against the current context.\n   * Uses O(1) caching based on the decision's globally unique sequential index.\n   * @param decision - The {@link Decisions.AbstractDecision | abstract decision} to resolve.\n   * @returns `Success` with the {@link Runtime.DecisionResolutionResult | resolution result} if successful,\n   * or `Failure` with an error message if the decision cannot be resolved.\n   * @public\n   */\n  public resolveDecision(decision: AbstractDecision): Result<DecisionResolutionResult> {\n    // Get the decision's index for cache lookup\n    const decisionIndex = decision.index;\n    if (decisionIndex === undefined) {\n      return fail(`Decision \"${decision.key}\" does not have a valid index`);\n    }\n\n    // Check cache first for O(1) lookup\n    const cachedResult = this._decisionCache[decisionIndex];\n    if (cachedResult !== undefined) {\n      this._listener?.onCacheHit('decision', decisionIndex);\n      return succeed(cachedResult);\n    }\n\n    // Resolve all condition sets in the decision\n    const matchingInstanceResults: Array<{ index: number; result: ConditionSetResolutionResult }> = [];\n    const matchingDefaultInstanceResults: Array<{ index: number; result: ConditionSetResolutionResult }> = [];\n\n    for (let instanceIndex = 0; instanceIndex < decision.candidates.length; instanceIndex++) {\n      const candidate = decision.candidates[instanceIndex];\n      const conditionSetResult = this.resolveConditionSet(candidate.conditionSet);\n\n      if (conditionSetResult.isFailure()) {\n        /* c8 ignore next 2 - defensive coding: extreme internal error scenario not reachable in normal operation */\n        this._listener?.onCacheError('decision', decisionIndex);\n        return fail(`${decision.key}: Failed to resolve condition set\": ${conditionSetResult.message}`);\n      }\n\n      const resolution = conditionSetResult.value;\n\n      // Only include condition sets that match\n      if (resolution.matchType === 'match') {\n        matchingInstanceResults.push({\n          index: instanceIndex,\n          result: resolution\n        });\n      } else if (resolution.matchType === 'matchAsDefault') {\n        matchingDefaultInstanceResults.push({\n          index: instanceIndex,\n          result: resolution\n        });\n      }\n      // If condition set doesn't match, we simply skip it and continue (don't fail the decision)\n    }\n\n    // Sort by condition set resolution priority using the proper comparison logic\n    matchingInstanceResults.sort((a, b) => ConditionSetResolutionResult.compare(a.result, b.result));\n    matchingDefaultInstanceResults.sort((a, b) => ConditionSetResolutionResult.compare(a.result, b.result));\n\n    // Extract just the instance indices in priority order\n    const instanceIndices = matchingInstanceResults.map((item) => item.index);\n    const defaultInstanceIndices = matchingDefaultInstanceResults.map((item) => item.index);\n\n    // Cache the successful result\n    const successResult: DecisionResolutionResult = {\n      success: true,\n      instanceIndices,\n      defaultInstanceIndices\n    };\n    this._decisionCache[decisionIndex] = successResult;\n    this._listener?.onCacheMiss('decision', decisionIndex);\n\n    return succeed(successResult);\n  }\n\n  /**\n   * Resolves a resource by finding the best matching candidate.\n   * Uses the resource's associated decision to determine the best match based on the current context.\n   * @param resource - The {@link Resources.Resource | resource} to resolve.\n   * @returns `Success` with the best matching candidate if successful,\n   * or `Failure` with an error message if no candidates match or resolution fails.\n   * @public\n   */\n  public resolveResource(resource: IResource): Result<IResourceCandidate> {\n    // Get the abstract decision from the resource's concrete decision\n    const abstractDecision = resource.decision.baseDecision;\n\n    // Resolve the decision to get candidate indices in priority order\n    const decisionResult = this.resolveDecision(abstractDecision);\n    /* c8 ignore next 3 - defense in depth almost impossible to hit */\n    if (decisionResult.isFailure()) {\n      return fail(`Failed to resolve decision for resource \"${resource.id}\": ${decisionResult.message}`);\n    }\n\n    const resolution = decisionResult.value;\n\n    // Check if any candidates matched (regular or default)\n    if (\n      !resolution.success ||\n      (resolution.instanceIndices.length === 0 && resolution.defaultInstanceIndices.length === 0)\n    ) {\n      return fail(`No matching candidates found for resource \"${resource.id}\"`);\n    }\n\n    // Prefer regular matches over default matches\n    const candidateIndex =\n      resolution.instanceIndices.length > 0\n        ? resolution.instanceIndices[0] // Best regular match\n        : resolution.defaultInstanceIndices[0]; // Best default match\n\n    if (candidateIndex >= resource.candidates.length) {\n      return fail(`Invalid candidate index ${candidateIndex} for resource \"${resource.id}\"`);\n    }\n\n    const bestCandidate = resource.candidates[candidateIndex];\n    return succeed(bestCandidate);\n  }\n\n  /**\n   * Resolves all matching resource candidates in priority order.\n   * Uses the resource's associated decision to determine all matching candidates based on the current context.\n   * @param resource - The {@link Resources.Resource | resource} to resolve.\n   * @returns `Success` with an array of all matching candidates in priority order if successful,\n   * or `Failure` with an error message if no candidates match or resolution fails.\n   * @public\n   */\n  public resolveAllResourceCandidates(resource: IResource): Result<ReadonlyArray<IResourceCandidate>> {\n    // Get the abstract decision from the resource's concrete decision\n    const abstractDecision = resource.decision.baseDecision;\n\n    // Resolve the decision to get candidate indices in priority order\n    const decisionResult = this.resolveDecision(abstractDecision);\n    /* c8 ignore next 3 - defense in depth almost impossible to hit */\n    if (decisionResult.isFailure()) {\n      return fail(`Failed to resolve decision for resource \"${resource.id}\": ${decisionResult.message}`);\n    }\n\n    const resolution = decisionResult.value;\n\n    // Check if any candidates matched (regular or default)\n    if (\n      !resolution.success ||\n      (resolution.instanceIndices.length === 0 && resolution.defaultInstanceIndices.length === 0)\n    ) {\n      return fail(`No matching candidates found for resource \"${resource.id}\"`);\n    }\n\n    // Get all matching candidates: regular matches first, then default matches\n    const candidates: IResourceCandidate[] = [];\n\n    // Add all regular matches first (already sorted by priority)\n    for (const candidateIndex of resolution.instanceIndices) {\n      if (candidateIndex >= resource.candidates.length) {\n        return fail(`Invalid candidate index ${candidateIndex} for resource \"${resource.id}\"`);\n      }\n      const candidate = resource.candidates[candidateIndex];\n      candidates.push(candidate);\n    }\n\n    // Add all default matches after regular matches (already sorted by priority)\n    for (const candidateIndex of resolution.defaultInstanceIndices) {\n      /* c8 ignore next 3 - defensive coding: extreme internal error scenario not reachable in normal operation */\n      if (candidateIndex >= resource.candidates.length) {\n        return fail(`Invalid candidate index ${candidateIndex} for resource \"${resource.id}\"`);\n      }\n      const candidate = resource.candidates[candidateIndex];\n      candidates.push(candidate);\n    }\n\n    return succeed(candidates);\n  }\n\n  /**\n   * Resolves a resource to a composed value by merging matching candidates according to their merge methods.\n   * Starting from the highest priority candidates, finds the first \"full\" candidate and merges all higher\n   * priority \"partial\" candidates into it in ascending order of priority.\n   * @param resource - The {@link Resources.Resource | resource} to resolve.\n   * @returns `Success` with the composed JsonValue if successful,\n   * or `Failure` with an error message if no candidates match or resolution fails.\n   * @public\n   */\n  public resolveComposedResourceValue(resource: IResource): Result<JsonValue> {\n    return this.resolveAllResourceCandidates(resource).onSuccess((candidates) => {\n      /* c8 ignore next 3 - defense in depth should never occur */\n      if (candidates.length === 0) {\n        return fail(`${resource.id}: No matching candidates found.`);\n      }\n\n      // Find the first full candidate and collect all partial candidates above it\n      let fullCandidateIndex = -1;\n      const partialCandidates: IResourceCandidate[] = [];\n\n      for (let i = 0; i < candidates.length; i++) {\n        const candidate = candidates[i];\n        if (!candidate.isPartial) {\n          // Found the first full candidate\n          fullCandidateIndex = i;\n          break;\n        } else {\n          // Collect partial candidates (these are in ascending priority order)\n          partialCandidates.unshift(candidate);\n        }\n      }\n\n      // If no full candidate found, use the last candidate as the base\n      const baseCandidateIndex = fullCandidateIndex >= 0 ? fullCandidateIndex : candidates.length - 1;\n      const baseCandidate = candidates[baseCandidateIndex];\n\n      // If there are no partial candidates to merge, return the base candidate's value\n      if (partialCandidates.length === 0) {\n        return succeed(baseCandidate.json);\n      }\n\n      const allCandidates = [\n        baseCandidate.json,\n        ...partialCandidates.map((candidate) => candidate.json)\n      ].filter((v): v is JsonObject => isJsonObject(v));\n\n      /* c8 ignore next 3 - defensive check: non-object values in resource candidates should be prevented at validation time */\n      if (allCandidates.length !== partialCandidates.length + 1) {\n        return fail(`${resource.id}: Unable to compose non-object candidate values.`);\n      }\n\n      // Create JsonEditor with array replacement behavior for resource composition\n      const editor = JsonEditor.create({\n        merge: {\n          arrayMergeBehavior: 'replace'\n        }\n      }).orThrow(); // Should never fail with valid options\n\n      return editor\n        .mergeObjectsInPlace({}, allCandidates)\n        .withErrorFormat((err) => `${resource.id}: Composition failed: ${err}`);\n    });\n  }\n\n  /**\n   * Clears all caches (condition, condition set, and decision), forcing all cached items\n   * to be re-evaluated on next access. This should be called when the context changes and cached\n   * results are no longer valid.\n   * @public\n   */\n  public clearConditionCache(): void {\n    this._conditionCache.fill(undefined);\n    this._conditionSetCache.fill(undefined);\n    this._decisionCache.fill(undefined);\n\n    this._listener?.onCacheClear('condition');\n    this._listener?.onCacheClear('conditionSet');\n    this._listener?.onCacheClear('decision');\n  }\n\n  /**\n   * Gets the current size of the condition cache array.\n   * @returns The size of the condition cache array.\n   * @public\n   */\n  public get conditionCacheSize(): number {\n    return this._conditionCache.length;\n  }\n\n  /**\n   * Gets the current size of the condition set cache array.\n   * @returns The size of the condition set cache array.\n   * @public\n   */\n  public get conditionSetCacheSize(): number {\n    return this._conditionSetCache.length;\n  }\n\n  /**\n   * Gets the current size of the decision cache array.\n   * @returns The size of the decision cache array.\n   * @public\n   */\n  public get decisionCacheSize(): number {\n    return this._decisionCache.length;\n  }\n}\n"]}

package/lib/packlets/runtime/validate.d.ts

@@ -0,0 +1,13 @@
+import { Validator } from '@fgv/ts-utils';
+import { IResource, IResourceCandidate } from './iResourceManager';
+/**
+ * Validates an {@link Runtime.IResourceCandidate | IResourceCandidate} object.
+ * @public
+ */
+export declare const resourceCandidate: Validator<IResourceCandidate, unknown>;
+/**
+ * Validates an {@link Runtime.IResource | IResource} object.
+ * @public
+ */
+export declare const resource: Validator<IResource, unknown>;
+//# sourceMappingURL=validate.d.ts.map

package/lib/packlets/runtime/validate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate.d.ts","sourceRoot":"","sources":["../../../src/packlets/runtime/validate.ts"],"names":[],"mappings":"AAsBA,OAAO,EAAc,SAAS,EAAE,MAAM,eAAe,CAAC;AAKtD,OAAO,EAAE,SAAS,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAEnE;;;GAGG;AACH,eAAO,MAAM,iBAAiB,EAAE,SAAS,CAAC,kBAAkB,EAAE,OAAO,CAQjE,CAAC;AAEL;;;GAGG;AACH,eAAO,MAAM,QAAQ,EAAE,SAAS,CAAC,SAAS,EAAE,OAAO,CAWjD,CAAC"}

package/lib/packlets/runtime/validate.js

@@ -0,0 +1,49 @@
+"use strict";
+/*
+ * Copyright (c) 2025 Erik Fortune
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in all
+ * copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.resource = exports.resourceCandidate = void 0;
+const ts_utils_1 = require("@fgv/ts-utils");
+const ts_json_base_1 = require("@fgv/ts-json-base");
+const common_1 = require("../common");
+const resource_types_1 = require("../resource-types");
+const decisions_1 = require("../decisions");
+/**
+ * Validates an {@link Runtime.IResourceCandidate | IResourceCandidate} object.
+ * @public
+ */
+exports.resourceCandidate = ts_utils_1.Validators.object({
+    json: ts_json_base_1.Validators.jsonObject,
+    isPartial: ts_utils_1.Validators.boolean,
+    mergeMethod: ts_utils_1.Validators.isA('resource value merge method', (v) => v === 'augment' || v === 'delete' || v === 'replace')
+});
+/**
+ * Validates an {@link Runtime.IResource | IResource} object.
+ * @public
+ */
+exports.resource = ts_utils_1.Validators.object({
+    id: ts_utils_1.Validators.isA('ResourceId', (v) => typeof v === 'string' && common_1.Validate.isValidResourceId(v)),
+    resourceType: ts_utils_1.Validators.isA('ResourceType instance', (v) => v instanceof resource_types_1.ResourceType),
+    decision: ts_utils_1.Validators.isA('ConcreteDecision instance', (v) => v instanceof decisions_1.ConcreteDecision),
+    candidates: ts_utils_1.Validators.arrayOf(exports.resourceCandidate)
+});
+//# sourceMappingURL=validate.js.map

package/lib/packlets/runtime/validate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate.js","sourceRoot":"","sources":["../../../src/packlets/runtime/validate.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;AAEH,4CAAsD;AACtD,oDAAiE;AACjE,sCAAiD;AACjD,sDAAiD;AACjD,4CAAgD;AAGhD;;;GAGG;AACU,QAAA,iBAAiB,GAC5B,qBAAU,CAAC,MAAM,CAAqB;IACpC,IAAI,EAAE,yBAAc,CAAC,UAAU;IAC/B,SAAS,EAAE,qBAAU,CAAC,OAAO;IAC7B,WAAW,EAAE,qBAAU,CAAC,GAAG,CACzB,6BAA6B,EAC7B,CAAC,CAAC,EAAyC,EAAE,CAAC,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,SAAS,CACnG;CACF,CAAC,CAAC;AAEL;;;GAGG;AACU,QAAA,QAAQ,GAAkC,qBAAU,CAAC,MAAM,CAAY;IAClF,EAAE,EAAE,qBAAU,CAAC,GAAG,CAChB,YAAY,EACZ,CAAC,CAAC,EAAmB,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,iBAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAC/E;IACD,YAAY,EAAE,qBAAU,CAAC,GAAG,CAAC,uBAAuB,EAAE,CAAC,CAAC,EAAqB,EAAE,CAAC,CAAC,YAAY,6BAAY,CAAC;IAC1G,QAAQ,EAAE,qBAAU,CAAC,GAAG,CACtB,2BAA2B,EAC3B,CAAC,CAAC,EAAyB,EAAE,CAAC,CAAC,YAAY,4BAAgB,CAC5D;IACD,UAAU,EAAE,qBAAU,CAAC,OAAO,CAAC,yBAAiB,CAAC;CAClD,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2025 Erik Fortune\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport { Validators, Validator } from '@fgv/ts-utils';\nimport { Validators as JsonValidators } from '@fgv/ts-json-base';\nimport { Validate, ResourceId } from '../common';\nimport { ResourceType } from '../resource-types';\nimport { ConcreteDecision } from '../decisions';\nimport { IResource, IResourceCandidate } from './iResourceManager';\n\n/**\n * Validates an {@link Runtime.IResourceCandidate | IResourceCandidate} object.\n * @public\n */\nexport const resourceCandidate: Validator<IResourceCandidate, unknown> =\n  Validators.object<IResourceCandidate>({\n    json: JsonValidators.jsonObject,\n    isPartial: Validators.boolean,\n    mergeMethod: Validators.isA(\n      'resource value merge method',\n      (v): v is 'augment' | 'delete' | 'replace' => v === 'augment' || v === 'delete' || v === 'replace'\n    )\n  });\n\n/**\n * Validates an {@link Runtime.IResource | IResource} object.\n * @public\n */\nexport const resource: Validator<IResource, unknown> = Validators.object<IResource>({\n  id: Validators.isA(\n    'ResourceId',\n    (v): v is ResourceId => typeof v === 'string' && Validate.isValidResourceId(v)\n  ),\n  resourceType: Validators.isA('ResourceType instance', (v): v is ResourceType => v instanceof ResourceType),\n  decision: Validators.isA(\n    'ConcreteDecision instance',\n    (v): v is ConcreteDecision => v instanceof ConcreteDecision\n  ),\n  candidates: Validators.arrayOf(resourceCandidate)\n});\n"]}