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

package/lib/packlets/resources/candidateReducer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"candidateReducer.d.ts","sourceRoot":"","sources":["../../../src/packlets/resources/candidateReducer.ts"],"names":[],"mappings":"AAsBA,OAAO,EAAiB,UAAU,EAAE,wBAAwB,EAAE,MAAM,WAAW,CAAC;AAChF,OAAO,KAAK,OAAO,MAAM,YAAY,CAAC;AACtC,OAAO,KAAK,YAAY,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAE/C,OAAO,EAAE,MAAM,EAA6B,MAAM,eAAe,CAAC;AAElE;;;GAGG;AACH,MAAM,MAAM,eAAe,GAAG,WAAW,GAAG,SAAS,GAAG,YAAY,CAAC;AAErE;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,iBAAiB,EAAE,iBAAiB,CAAC;IAC9C,MAAM,EAAE,eAAe,CAAC;IACxB,UAAU,EAAE,YAAY,CAAC,IAAI,CAAC,mBAAmB,EAAE,CAAC;IACpD,eAAe,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC;CAC5B;AAED;;;GAGG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,SAAS,EAAE,iBAAiB,CAAC;IACtC,QAAQ,CAAC,UAAU,EAAE,YAAY,CAAC,IAAI,CAAC,gBAAgB,CAAC;IACxD,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC;IAC3B,QAAQ,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,WAAW,CAAC,EAAE,wBAAwB,CAAC;CACjD;AAED;;;;GAIG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAmB;IACnD,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAgC;IAClE,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAA6B;IAEjE;;;;OAIG;gBAED,UAAU,EAAE,aAAa,CAAC,iBAAiB,CAAC,EAC5C,gBAAgB,EAAE,OAAO,CAAC,qBAAqB;IAiCjD;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAWtC;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,gBAAgB;IAW/B;;;;;;;OAOG;IACH,OAAO,CAAC,kBAAkB;IA2E1B;;;;;;;OAOG;WACW,mCAAmC,CAC/C,UAAU,EAAE,aAAa,CAAC,iBAAiB,CAAC,EAC5C,gBAAgB,CAAC,EAAE,OAAO,CAAC,qBAAqB,GAC/C,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,2BAA2B,EAAE,CAAC;IAyB1D;;;;;;;;OAQG;WACW,mCAAmC,CAC/C,EAAE,EAAE,UAAU,EACd,UAAU,EAAE,aAAa,CAAC,iBAAiB,CAAC,EAC5C,gBAAgB,CAAC,EAAE,OAAO,CAAC,qBAAqB,GAC/C,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,2BAA2B,EAAE,CAAC;IA0B1D;;;;OAIG;IACI,eAAe,CAAC,SAAS,EAAE,iBAAiB,GAAG,MAAM,CAAC,iBAAiB,GAAG,SAAS,CAAC;CAuB5F"}

package/lib/packlets/resources/candidateReducer.js

@@ -0,0 +1,247 @@
+"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.CandidateReducer = void 0;
+const resourceCandidate_1 = require("./resourceCandidate");
+const ts_json_1 = require("@fgv/ts-json");
+const ts_utils_1 = require("@fgv/ts-utils");
+/**
+ * Manages candidate reduction logic for filtering and qualifier reduction operations.
+ * Encapsulates the state and logic needed to consistently process candidates for reduction.
+ * @public
+ */
+class CandidateReducer {
+    /**
+     * Constructor for CandidateReducer.
+     * @param candidates - The set of candidates to potentially reduce
+     * @param filterForContext - Context to filter candidates against
+     */
+    constructor(candidates, filterForContext) {
+        var _a;
+        this._filterForContext = filterForContext;
+        // Use existing logic to determine reducible qualifiers
+        this._qualifiersToReduce =
+            (_a = resourceCandidate_1.ResourceCandidate.findReducibleQualifiers(candidates, filterForContext)) !== null && _a !== void 0 ? _a : new Set();
+        // Initialize candidate info array with initial reduction attempts
+        this._candidateInfos = candidates.map((candidate) => {
+            const filteredConditions = candidate.conditions.conditions.filter((c) => !this._qualifiersToReduce.has(c.qualifier.name));
+            const reducedConditions = filteredConditions.map((c) => c.toLooseConditionDecl());
+            const conditionSetKey = CandidateReducer._computeConditionSetKey(reducedConditions);
+            const action = filteredConditions.length < candidate.conditions.conditions.length ? 'reduced' : 'unchanged';
+            return {
+                originalCandidate: candidate,
+                action,
+                conditions: reducedConditions,
+                conditionSetKey,
+                json: undefined // Will be set later when needed
+            };
+        });
+        // Resolve collisions by reverting reduced candidates to unchanged when they collide
+        this._resolveCollisions();
+    }
+    /**
+     * Computes a string key for a set of condition declarations for collision detection.
+     * @param conditions - The conditions to compute a key for
+     * @returns A string key representing the condition set
+     */
+    static _computeConditionSetKey(conditions) {
+        if (conditions.length === 0) {
+            return '{}';
+        }
+        // Sort conditions by qualifier name for consistent keys
+        const sortedConditions = [...conditions].sort((a, b) => a.qualifierName.localeCompare(b.qualifierName));
+        const pairs = sortedConditions.map((c) => `${c.qualifierName}:${c.value}`);
+        return `{${pairs.join(',')}}`;
+    }
+    /**
+     * Merges a partial candidate's JSON value into a base candidate's JSON value.
+     * @param baseJson - The base JSON value to merge into
+     * @param partialJson - The partial JSON value to merge from
+     * @returns The merged JSON value
+     * @internal
+     */
+    static _mergeJsonValues(baseJson, partialJson) {
+        // Create JsonEditor with array replacement behavior for candidate merging
+        const editor = ts_json_1.JsonEditor.create({
+            merge: {
+                arrayMergeBehavior: 'replace'
+            }
+        }).orThrow(); // Should never fail with valid options
+        return editor.mergeObjectsInPlace({}, [baseJson, partialJson]).orThrow(); // Internal method should throw on error - this indicates a serious bug
+    }
+    /**
+     * Resolves collisions using smart collision resolution rules.
+     * - If a reduced candidate collides with an unchanged candidate and only one reduced candidate collides:
+     *   - If reduced candidate is complete: suppress unchanged, keep reduced
+     *   - If reduced candidate is partial: merge into unchanged, suppress reduced
+     * - Otherwise: revert reduced candidates to unchanged to avoid collisions
+     * @internal
+     */
+    _resolveCollisions() {
+        let hasCollisions = true;
+        let iterationCount = 0;
+        const maxIterations = this._candidateInfos.length; // Safety limit
+        while (hasCollisions && iterationCount < maxIterations) {
+            hasCollisions = false;
+            iterationCount++;
+            // Group candidates by their condition set keys (excluding suppressed)
+            const conditionKeyGroups = new Map();
+            for (const candidateInfo of this._candidateInfos) {
+                if (candidateInfo.action !== 'suppressed') {
+                    // Don't include suppressed candidates
+                    const key = candidateInfo.conditionSetKey;
+                    if (!conditionKeyGroups.has(key)) {
+                        conditionKeyGroups.set(key, []);
+                    }
+                    conditionKeyGroups.get(key).push(candidateInfo);
+                }
+            }
+            // Apply smart collision resolution
+            for (const [, candidatesWithSameKey] of conditionKeyGroups) {
+                if (candidatesWithSameKey.length > 1) {
+                    // Categorize candidates
+                    const unchangedCandidates = candidatesWithSameKey.filter((c) => c.action === 'unchanged');
+                    const reducedCandidates = candidatesWithSameKey.filter((c) => c.action === 'reduced');
+                    if (unchangedCandidates.length === 1 && reducedCandidates.length === 1) {
+                        // Simple case: one unchanged vs one reduced - apply smart resolution
+                        const unchangedCandidate = unchangedCandidates[0];
+                        const reducedCandidate = reducedCandidates[0];
+                        if (!reducedCandidate.originalCandidate.isPartial) {
+                            // Complete reduced candidate wins - suppress unchanged
+                            unchangedCandidate.action = 'suppressed';
+                            hasCollisions = true;
+                        }
+                        else {
+                            // Partial reduced candidate - merge into unchanged and suppress reduced
+                            const mergedJson = CandidateReducer._mergeJsonValues(unchangedCandidate.originalCandidate.json, reducedCandidate.originalCandidate.json);
+                            // Update unchanged candidate with merged JSON, keeping its isPartial status
+                            unchangedCandidate.json = mergedJson;
+                            // Suppress the reduced candidate
+                            reducedCandidate.action = 'suppressed';
+                            hasCollisions = true;
+                        }
+                    }
+                    else {
+                        // Complex collision case - revert all reduced candidates to unchanged
+                        for (const candidateInfo of reducedCandidates) {
+                            // Revert to original conditions and mark as unchanged
+                            const originalConditions = candidateInfo.originalCandidate.conditions.conditions.map((c) => c.toLooseConditionDecl());
+                            const originalKey = CandidateReducer._computeConditionSetKey(originalConditions);
+                            // Update the candidate info to revert to original state
+                            candidateInfo.action = 'unchanged';
+                            candidateInfo.conditions = originalConditions;
+                            candidateInfo.conditionSetKey = originalKey;
+                            hasCollisions = true;
+                        }
+                    }
+                }
+            }
+        }
+    }
+    /**
+     * Static convenience method to construct an array of properly reduced
+     * {@link ResourceJson.Json.IChildResourceCandidateDecl | child resource candidate declarations}
+     * from a set of {@link Resources.ResourceCandidate | resource candidates}.
+     * @param candidates - The candidates to reduce
+     * @param filterForContext - Optional context to filter against
+     * @returns Result with array of reduced candidate declarations, or Failure if reduction fails
+     */
+    static reduceToChildResourceCandidateDecls(candidates, filterForContext) {
+        if (!filterForContext || Object.keys(filterForContext).length === 0) {
+            return (0, ts_utils_1.succeed)(candidates.map((candidate) => candidate.toChildResourceCandidateDecl()));
+        }
+        const reducer = new CandidateReducer(candidates, filterForContext);
+        const reductionResults = (0, ts_utils_1.mapResults)(candidates.map((candidate) => reducer.reduceCandidate(candidate)));
+        return reductionResults.onSuccess((reductions) => {
+            const validReductions = reductions.filter((reduction) => reduction !== undefined);
+            return (0, ts_utils_1.succeed)(validReductions.map((reduction) => {
+                var _a, _b, _c;
+                return ({
+                    /* c8 ignore next 3 -- defense in depth */
+                    json: (_a = reduction.json) !== null && _a !== void 0 ? _a : reduction.candidate.json,
+                    isPartial: (_b = reduction.isPartial) !== null && _b !== void 0 ? _b : reduction.candidate.isPartial,
+                    mergeMethod: (_c = reduction.mergeMethod) !== null && _c !== void 0 ? _c : reduction.candidate.mergeMethod,
+                    conditions: reduction.conditions
+                });
+            }));
+        });
+    }
+    /**
+     * Static convenience method to construct an array of properly reduced
+     * {@link ResourceJson.Json.ILooseResourceCandidateDecl | loose resource candidate declarations}
+     * from a set of {@link Resources.ResourceCandidate | resource candidates}.
+     * @param id - The id of the resource
+     * @param candidates - The candidates to reduce
+     * @param filterForContext - Optional context to filter against
+     * @returns Result with array of reduced candidate declarations, or Failure if reduction fails
+     */
+    static reduceToLooseResourceCandidateDecls(id, candidates, filterForContext) {
+        if (!filterForContext || Object.keys(filterForContext).length === 0) {
+            return (0, ts_utils_1.succeed)(candidates.map((candidate) => candidate.toLooseResourceCandidateDecl()));
+        }
+        const reducer = new CandidateReducer(candidates, filterForContext);
+        const reductionResults = (0, ts_utils_1.mapResults)(candidates.map((candidate) => reducer.reduceCandidate(candidate)));
+        return reductionResults.onSuccess((reductions) => {
+            const validReductions = reductions.filter((reduction) => reduction !== undefined);
+            return (0, ts_utils_1.succeed)(validReductions.map((reduction) => {
+                var _a, _b, _c;
+                return ({
+                    id,
+                    /* c8 ignore next 3 -- defense in depth */
+                    json: (_a = reduction.json) !== null && _a !== void 0 ? _a : reduction.candidate.json,
+                    isPartial: (_b = reduction.isPartial) !== null && _b !== void 0 ? _b : reduction.candidate.isPartial,
+                    mergeMethod: (_c = reduction.mergeMethod) !== null && _c !== void 0 ? _c : reduction.candidate.mergeMethod,
+                    conditions: reduction.conditions
+                });
+            }));
+        });
+    }
+    /**
+     * Reduces a single candidate according to the configured reduction rules.
+     * @param candidate - The candidate to reduce
+     * @returns Either a reduced candidate declaration or an error if the candidate is not found
+     */
+    reduceCandidate(candidate) {
+        var _a;
+        const candidateInfo = this._candidateInfos.find((info) => info.originalCandidate === candidate);
+        if (!candidateInfo) {
+            return (0, ts_utils_1.fail)(`Candidate not found in reducer state`);
+        }
+        if (candidateInfo.action === 'suppressed') {
+            return (0, ts_utils_1.succeed)(undefined);
+        }
+        // Convert array of conditions back to ConditionSetDecl for compatibility
+        const conditionsAsRecord = candidateInfo.conditions.reduce((acc, condition) => {
+            return Object.assign(Object.assign({}, acc), { [condition.qualifierName]: condition.value });
+        }, {});
+        return (0, ts_utils_1.succeed)({
+            candidate,
+            conditions: conditionsAsRecord,
+            json: (_a = candidateInfo.json) !== null && _a !== void 0 ? _a : candidate.json,
+            isPartial: candidate.isPartial,
+            mergeMethod: candidate.mergeMethod
+        });
+    }
+}
+exports.CandidateReducer = CandidateReducer;
+//# sourceMappingURL=candidateReducer.js.map

package/lib/packlets/resources/candidateReducer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"candidateReducer.js","sourceRoot":"","sources":["../../../src/packlets/resources/candidateReducer.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;AAKH,2DAAwD;AAExD,0CAA0C;AAC1C,4CAAkE;AAgClE;;;;GAIG;AACH,MAAa,gBAAgB;IAK3B;;;;OAIG;IACH,YACE,UAA4C,EAC5C,gBAA+C;;QAE/C,IAAI,CAAC,iBAAiB,GAAG,gBAAgB,CAAC;QAE1C,uDAAuD;QACvD,IAAI,CAAC,mBAAmB;YACtB,MAAA,qCAAiB,CAAC,uBAAuB,CAAC,UAAU,EAAE,gBAAgB,CAAC,mCAAI,IAAI,GAAG,EAAE,CAAC;QAEvF,kEAAkE;QAClE,IAAI,CAAC,eAAe,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAkB,EAAE;YAClE,MAAM,kBAAkB,GAAG,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,CAC/D,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CACvD,CAAC;YAEF,MAAM,iBAAiB,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,oBAAoB,EAAE,CAAC,CAAC;YAClF,MAAM,eAAe,GAAG,gBAAgB,CAAC,uBAAuB,CAAC,iBAAiB,CAAC,CAAC;YAEpF,MAAM,MAAM,GACV,kBAAkB,CAAC,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC;YAE/F,OAAO;gBACL,iBAAiB,EAAE,SAAS;gBAC5B,MAAM;gBACN,UAAU,EAAE,iBAAiB;gBAC7B,eAAe;gBACf,IAAI,EAAE,SAAS,CAAC,gCAAgC;aACjD,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,oFAAoF;QACpF,IAAI,CAAC,kBAAkB,EAAE,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,uBAAuB,CAAC,UAAmD;QACxF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,wDAAwD;QACxD,MAAM,gBAAgB,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;QACxG,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QAC3E,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAChC,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,gBAAgB,CAAC,QAAoB,EAAE,WAAuB;QAC3E,0EAA0E;QAC1E,MAAM,MAAM,GAAG,oBAAU,CAAC,MAAM,CAAC;YAC/B,KAAK,EAAE;gBACL,kBAAkB,EAAE,SAAS;aAC9B;SACF,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,uCAAuC;QAErD,OAAO,MAAM,CAAC,mBAAmB,CAAC,EAAE,EAAE,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,uEAAuE;IACnJ,CAAC;IAED;;;;;;;OAOG;IACK,kBAAkB;QACxB,IAAI,aAAa,GAAG,IAAI,CAAC;QACzB,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,aAAa,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,eAAe;QAElE,OAAO,aAAa,IAAI,cAAc,GAAG,aAAa,EAAE,CAAC;YACvD,aAAa,GAAG,KAAK,CAAC;YACtB,cAAc,EAAE,CAAC;YAEjB,sEAAsE;YACtE,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAA4B,CAAC;YAE/D,KAAK,MAAM,aAAa,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;gBACjD,IAAI,aAAa,CAAC,MAAM,KAAK,YAAY,EAAE,CAAC;oBAC1C,sCAAsC;oBACtC,MAAM,GAAG,GAAG,aAAa,CAAC,eAAe,CAAC;oBAC1C,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBACjC,kBAAkB,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;oBAClC,CAAC;oBACD,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBACnD,CAAC;YACH,CAAC;YAED,mCAAmC;YACnC,KAAK,MAAM,CAAC,EAAE,qBAAqB,CAAC,IAAI,kBAAkB,EAAE,CAAC;gBAC3D,IAAI,qBAAqB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACrC,wBAAwB;oBACxB,MAAM,mBAAmB,GAAG,qBAAqB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC;oBAC1F,MAAM,iBAAiB,GAAG,qBAAqB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;oBAEtF,IAAI,mBAAmB,CAAC,MAAM,KAAK,CAAC,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBACvE,qEAAqE;wBACrE,MAAM,kBAAkB,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;wBAClD,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;wBAE9C,IAAI,CAAC,gBAAgB,CAAC,iBAAiB,CAAC,SAAS,EAAE,CAAC;4BAClD,uDAAuD;4BACvD,kBAAkB,CAAC,MAAM,GAAG,YAAY,CAAC;4BACzC,aAAa,GAAG,IAAI,CAAC;wBACvB,CAAC;6BAAM,CAAC;4BACN,wEAAwE;4BACxE,MAAM,UAAU,GAAG,gBAAgB,CAAC,gBAAgB,CAClD,kBAAkB,CAAC,iBAAiB,CAAC,IAAI,EACzC,gBAAgB,CAAC,iBAAiB,CAAC,IAAI,CACxC,CAAC;4BAEF,4EAA4E;4BAC3E,kBAA4C,CAAC,IAAI,GAAG,UAAU,CAAC;4BAEhE,iCAAiC;4BACjC,gBAAgB,CAAC,MAAM,GAAG,YAAY,CAAC;4BACvC,aAAa,GAAG,IAAI,CAAC;wBACvB,CAAC;oBACH,CAAC;yBAAM,CAAC;wBACN,sEAAsE;wBACtE,KAAK,MAAM,aAAa,IAAI,iBAAiB,EAAE,CAAC;4BAC9C,sDAAsD;4BACtD,MAAM,kBAAkB,GAAG,aAAa,CAAC,iBAAiB,CAAC,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACzF,CAAC,CAAC,oBAAoB,EAAE,CACzB,CAAC;4BACF,MAAM,WAAW,GAAG,gBAAgB,CAAC,uBAAuB,CAAC,kBAAkB,CAAC,CAAC;4BAEjF,wDAAwD;4BACxD,aAAa,CAAC,MAAM,GAAG,WAAW,CAAC;4BACnC,aAAa,CAAC,UAAU,GAAG,kBAAkB,CAAC;4BAC9C,aAAa,CAAC,eAAe,GAAG,WAAW,CAAC;4BAE5C,aAAa,GAAG,IAAI,CAAC;wBACvB,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,mCAAmC,CAC/C,UAA4C,EAC5C,gBAAgD;QAEhD,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpE,OAAO,IAAA,kBAAO,EAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,4BAA4B,EAAE,CAAC,CAAC,CAAC;QAC1F,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,gBAAgB,CAAC,UAAU,EAAE,gBAAgB,CAAC,CAAC;QACnE,MAAM,gBAAgB,GAAG,IAAA,qBAAU,EAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,OAAO,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAEvG,OAAO,gBAAgB,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,EAAE;YAC/C,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CACvC,CAAC,SAAS,EAAkC,EAAE,CAAC,SAAS,KAAK,SAAS,CACvE,CAAC;YAEF,OAAO,IAAA,kBAAO,EACZ,eAAe,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE;;gBAAC,OAAA,CAAC;oBAClC,0CAA0C;oBAC1C,IAAI,EAAE,MAAA,SAAS,CAAC,IAAI,mCAAI,SAAS,CAAC,SAAS,CAAC,IAAI;oBAChD,SAAS,EAAE,MAAA,SAAS,CAAC,SAAS,mCAAI,SAAS,CAAC,SAAS,CAAC,SAAS;oBAC/D,WAAW,EAAE,MAAA,SAAS,CAAC,WAAW,mCAAI,SAAS,CAAC,SAAS,CAAC,WAAW;oBACrE,UAAU,EAAE,SAAS,CAAC,UAAU;iBACjC,CAAC,CAAA;aAAA,CAAC,CACJ,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,mCAAmC,CAC/C,EAAc,EACd,UAA4C,EAC5C,gBAAgD;QAEhD,IAAI,CAAC,gBAAgB,IAAI,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpE,OAAO,IAAA,kBAAO,EAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,4BAA4B,EAAE,CAAC,CAAC,CAAC;QAC1F,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,gBAAgB,CAAC,UAAU,EAAE,gBAAgB,CAAC,CAAC;QACnE,MAAM,gBAAgB,GAAG,IAAA,qBAAU,EAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,OAAO,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAEvG,OAAO,gBAAgB,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,EAAE;YAC/C,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CACvC,CAAC,SAAS,EAAkC,EAAE,CAAC,SAAS,KAAK,SAAS,CACvE,CAAC;YAEF,OAAO,IAAA,kBAAO,EACZ,eAAe,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE;;gBAAC,OAAA,CAAC;oBAClC,EAAE;oBACF,0CAA0C;oBAC1C,IAAI,EAAE,MAAA,SAAS,CAAC,IAAI,mCAAI,SAAS,CAAC,SAAS,CAAC,IAAI;oBAChD,SAAS,EAAE,MAAA,SAAS,CAAC,SAAS,mCAAI,SAAS,CAAC,SAAS,CAAC,SAAS;oBAC/D,WAAW,EAAE,MAAA,SAAS,CAAC,WAAW,mCAAI,SAAS,CAAC,SAAS,CAAC,WAAW;oBACrE,UAAU,EAAE,SAAS,CAAC,UAAU;iBACjC,CAAC,CAAA;aAAA,CAAC,CACJ,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACI,eAAe,CAAC,SAA4B;;QACjD,MAAM,aAAa,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,iBAAiB,KAAK,SAAS,CAAC,CAAC;QAChG,IAAI,CAAC,aAAa,EAAE,CAAC;YACnB,OAAO,IAAA,eAAI,EAAC,sCAAsC,CAAC,CAAC;QACtD,CAAC;QAED,IAAI,aAAa,CAAC,MAAM,KAAK,YAAY,EAAE,CAAC;YAC1C,OAAO,IAAA,kBAAO,EAAC,SAAS,CAAC,CAAC;QAC5B,CAAC;QAED,yEAAyE;QACzE,MAAM,kBAAkB,GAAG,aAAa,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,SAAS,EAAE,EAAE;YAC5E,uCAAY,GAAG,KAAE,CAAC,SAAS,CAAC,aAAa,CAAC,EAAE,SAAS,CAAC,KAAK,IAAG;QAChE,CAAC,EAAE,EAAwC,CAAC,CAAC;QAE7C,OAAO,IAAA,kBAAO,EAAC;YACb,SAAS;YACT,UAAU,EAAE,kBAAkB;YAC9B,IAAI,EAAE,MAAA,aAAa,CAAC,IAAI,mCAAI,SAAS,CAAC,IAAI;YAC1C,SAAS,EAAE,SAAS,CAAC,SAAS;YAC9B,WAAW,EAAE,SAAS,CAAC,WAAW;SACnC,CAAC,CAAC;IACL,CAAC;CACF;AAzQD,4CAyQC","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 { QualifierName, ResourceId, ResourceValueMergeMethod } from '../common';\nimport * as Context from '../context';\nimport * as ResourceJson from '../resource-json';\nimport { ResourceCandidate } from './resourceCandidate';\nimport { JsonObject } from '@fgv/ts-json-base';\nimport { JsonEditor } from '@fgv/ts-json';\nimport { Result, succeed, fail, mapResults } from '@fgv/ts-utils';\n\n/**\n * Action taken on a candidate during reduction processing.\n * @public\n */\nexport type CandidateAction = 'unchanged' | 'reduced' | 'suppressed';\n\n/**\n * Information about a candidate being processed by the reducer.\n * @public\n */\nexport interface ICandidateInfo {\n  readonly originalCandidate: ResourceCandidate;\n  action: CandidateAction;\n  conditions: ResourceJson.Json.ILooseConditionDecl[];\n  conditionSetKey: string;\n  readonly json?: JsonObject;\n}\n\n/**\n * Represents a reduced candidate after applying reduction logic.\n * @public\n */\nexport interface IReducedCandidate {\n  readonly candidate: ResourceCandidate;\n  readonly conditions: ResourceJson.Json.ConditionSetDecl;\n  readonly json?: JsonObject;\n  readonly isPartial?: boolean;\n  readonly mergeMethod?: ResourceValueMergeMethod;\n}\n\n/**\n * Manages candidate reduction logic for filtering and qualifier reduction operations.\n * Encapsulates the state and logic needed to consistently process candidates for reduction.\n * @public\n */\nexport class CandidateReducer {\n  private readonly _candidateInfos: ICandidateInfo[];\n  private readonly _filterForContext: Context.IValidatedContextDecl;\n  private readonly _qualifiersToReduce: ReadonlySet<QualifierName>;\n\n  /**\n   * Constructor for CandidateReducer.\n   * @param candidates - The set of candidates to potentially reduce\n   * @param filterForContext - Context to filter candidates against\n   */\n  public constructor(\n    candidates: ReadonlyArray<ResourceCandidate>,\n    filterForContext: Context.IValidatedContextDecl\n  ) {\n    this._filterForContext = filterForContext;\n\n    // Use existing logic to determine reducible qualifiers\n    this._qualifiersToReduce =\n      ResourceCandidate.findReducibleQualifiers(candidates, filterForContext) ?? new Set();\n\n    // Initialize candidate info array with initial reduction attempts\n    this._candidateInfos = candidates.map((candidate): ICandidateInfo => {\n      const filteredConditions = candidate.conditions.conditions.filter(\n        (c) => !this._qualifiersToReduce.has(c.qualifier.name)\n      );\n\n      const reducedConditions = filteredConditions.map((c) => c.toLooseConditionDecl());\n      const conditionSetKey = CandidateReducer._computeConditionSetKey(reducedConditions);\n\n      const action: CandidateAction =\n        filteredConditions.length < candidate.conditions.conditions.length ? 'reduced' : 'unchanged';\n\n      return {\n        originalCandidate: candidate,\n        action,\n        conditions: reducedConditions,\n        conditionSetKey,\n        json: undefined // Will be set later when needed\n      };\n    });\n\n    // Resolve collisions by reverting reduced candidates to unchanged when they collide\n    this._resolveCollisions();\n  }\n\n  /**\n   * Computes a string key for a set of condition declarations for collision detection.\n   * @param conditions - The conditions to compute a key for\n   * @returns A string key representing the condition set\n   */\n  private static _computeConditionSetKey(conditions: ResourceJson.Json.ILooseConditionDecl[]): string {\n    if (conditions.length === 0) {\n      return '{}';\n    }\n\n    // Sort conditions by qualifier name for consistent keys\n    const sortedConditions = [...conditions].sort((a, b) => a.qualifierName.localeCompare(b.qualifierName));\n    const pairs = sortedConditions.map((c) => `${c.qualifierName}:${c.value}`);\n    return `{${pairs.join(',')}}`;\n  }\n\n  /**\n   * Merges a partial candidate's JSON value into a base candidate's JSON value.\n   * @param baseJson - The base JSON value to merge into\n   * @param partialJson - The partial JSON value to merge from\n   * @returns The merged JSON value\n   * @internal\n   */\n  private static _mergeJsonValues(baseJson: JsonObject, partialJson: JsonObject): JsonObject {\n    // Create JsonEditor with array replacement behavior for candidate merging\n    const editor = JsonEditor.create({\n      merge: {\n        arrayMergeBehavior: 'replace'\n      }\n    }).orThrow(); // Should never fail with valid options\n\n    return editor.mergeObjectsInPlace({}, [baseJson, partialJson]).orThrow(); // Internal method should throw on error - this indicates a serious bug\n  }\n\n  /**\n   * Resolves collisions using smart collision resolution rules.\n   * - If a reduced candidate collides with an unchanged candidate and only one reduced candidate collides:\n   *   - If reduced candidate is complete: suppress unchanged, keep reduced\n   *   - If reduced candidate is partial: merge into unchanged, suppress reduced\n   * - Otherwise: revert reduced candidates to unchanged to avoid collisions\n   * @internal\n   */\n  private _resolveCollisions(): void {\n    let hasCollisions = true;\n    let iterationCount = 0;\n    const maxIterations = this._candidateInfos.length; // Safety limit\n\n    while (hasCollisions && iterationCount < maxIterations) {\n      hasCollisions = false;\n      iterationCount++;\n\n      // Group candidates by their condition set keys (excluding suppressed)\n      const conditionKeyGroups = new Map<string, ICandidateInfo[]>();\n\n      for (const candidateInfo of this._candidateInfos) {\n        if (candidateInfo.action !== 'suppressed') {\n          // Don't include suppressed candidates\n          const key = candidateInfo.conditionSetKey;\n          if (!conditionKeyGroups.has(key)) {\n            conditionKeyGroups.set(key, []);\n          }\n          conditionKeyGroups.get(key)!.push(candidateInfo);\n        }\n      }\n\n      // Apply smart collision resolution\n      for (const [, candidatesWithSameKey] of conditionKeyGroups) {\n        if (candidatesWithSameKey.length > 1) {\n          // Categorize candidates\n          const unchangedCandidates = candidatesWithSameKey.filter((c) => c.action === 'unchanged');\n          const reducedCandidates = candidatesWithSameKey.filter((c) => c.action === 'reduced');\n\n          if (unchangedCandidates.length === 1 && reducedCandidates.length === 1) {\n            // Simple case: one unchanged vs one reduced - apply smart resolution\n            const unchangedCandidate = unchangedCandidates[0];\n            const reducedCandidate = reducedCandidates[0];\n\n            if (!reducedCandidate.originalCandidate.isPartial) {\n              // Complete reduced candidate wins - suppress unchanged\n              unchangedCandidate.action = 'suppressed';\n              hasCollisions = true;\n            } else {\n              // Partial reduced candidate - merge into unchanged and suppress reduced\n              const mergedJson = CandidateReducer._mergeJsonValues(\n                unchangedCandidate.originalCandidate.json,\n                reducedCandidate.originalCandidate.json\n              );\n\n              // Update unchanged candidate with merged JSON, keeping its isPartial status\n              (unchangedCandidate as { json?: JsonObject }).json = mergedJson;\n\n              // Suppress the reduced candidate\n              reducedCandidate.action = 'suppressed';\n              hasCollisions = true;\n            }\n          } else {\n            // Complex collision case - revert all reduced candidates to unchanged\n            for (const candidateInfo of reducedCandidates) {\n              // Revert to original conditions and mark as unchanged\n              const originalConditions = candidateInfo.originalCandidate.conditions.conditions.map((c) =>\n                c.toLooseConditionDecl()\n              );\n              const originalKey = CandidateReducer._computeConditionSetKey(originalConditions);\n\n              // Update the candidate info to revert to original state\n              candidateInfo.action = 'unchanged';\n              candidateInfo.conditions = originalConditions;\n              candidateInfo.conditionSetKey = originalKey;\n\n              hasCollisions = true;\n            }\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Static convenience method to construct an array of properly reduced\n   * {@link ResourceJson.Json.IChildResourceCandidateDecl | child resource candidate declarations}\n   * from a set of {@link Resources.ResourceCandidate | resource candidates}.\n   * @param candidates - The candidates to reduce\n   * @param filterForContext - Optional context to filter against\n   * @returns Result with array of reduced candidate declarations, or Failure if reduction fails\n   */\n  public static reduceToChildResourceCandidateDecls(\n    candidates: ReadonlyArray<ResourceCandidate>,\n    filterForContext?: Context.IValidatedContextDecl\n  ): Result<ResourceJson.Json.IChildResourceCandidateDecl[]> {\n    if (!filterForContext || Object.keys(filterForContext).length === 0) {\n      return succeed(candidates.map((candidate) => candidate.toChildResourceCandidateDecl()));\n    }\n\n    const reducer = new CandidateReducer(candidates, filterForContext);\n    const reductionResults = mapResults(candidates.map((candidate) => reducer.reduceCandidate(candidate)));\n\n    return reductionResults.onSuccess((reductions) => {\n      const validReductions = reductions.filter(\n        (reduction): reduction is IReducedCandidate => reduction !== undefined\n      );\n\n      return succeed(\n        validReductions.map((reduction) => ({\n          /* c8 ignore next 3 -- defense in depth */\n          json: reduction.json ?? reduction.candidate.json,\n          isPartial: reduction.isPartial ?? reduction.candidate.isPartial,\n          mergeMethod: reduction.mergeMethod ?? reduction.candidate.mergeMethod,\n          conditions: reduction.conditions\n        }))\n      );\n    });\n  }\n\n  /**\n   * Static convenience method to construct an array of properly reduced\n   * {@link ResourceJson.Json.ILooseResourceCandidateDecl | loose resource candidate declarations}\n   * from a set of {@link Resources.ResourceCandidate | resource candidates}.\n   * @param id - The id of the resource\n   * @param candidates - The candidates to reduce\n   * @param filterForContext - Optional context to filter against\n   * @returns Result with array of reduced candidate declarations, or Failure if reduction fails\n   */\n  public static reduceToLooseResourceCandidateDecls(\n    id: ResourceId,\n    candidates: ReadonlyArray<ResourceCandidate>,\n    filterForContext?: Context.IValidatedContextDecl\n  ): Result<ResourceJson.Json.ILooseResourceCandidateDecl[]> {\n    if (!filterForContext || Object.keys(filterForContext).length === 0) {\n      return succeed(candidates.map((candidate) => candidate.toLooseResourceCandidateDecl()));\n    }\n\n    const reducer = new CandidateReducer(candidates, filterForContext);\n    const reductionResults = mapResults(candidates.map((candidate) => reducer.reduceCandidate(candidate)));\n\n    return reductionResults.onSuccess((reductions) => {\n      const validReductions = reductions.filter(\n        (reduction): reduction is IReducedCandidate => reduction !== undefined\n      );\n\n      return succeed(\n        validReductions.map((reduction) => ({\n          id,\n          /* c8 ignore next 3 -- defense in depth */\n          json: reduction.json ?? reduction.candidate.json,\n          isPartial: reduction.isPartial ?? reduction.candidate.isPartial,\n          mergeMethod: reduction.mergeMethod ?? reduction.candidate.mergeMethod,\n          conditions: reduction.conditions\n        }))\n      );\n    });\n  }\n\n  /**\n   * Reduces a single candidate according to the configured reduction rules.\n   * @param candidate - The candidate to reduce\n   * @returns Either a reduced candidate declaration or an error if the candidate is not found\n   */\n  public reduceCandidate(candidate: ResourceCandidate): Result<IReducedCandidate | undefined> {\n    const candidateInfo = this._candidateInfos.find((info) => info.originalCandidate === candidate);\n    if (!candidateInfo) {\n      return fail(`Candidate not found in reducer state`);\n    }\n\n    if (candidateInfo.action === 'suppressed') {\n      return succeed(undefined);\n    }\n\n    // Convert array of conditions back to ConditionSetDecl for compatibility\n    const conditionsAsRecord = candidateInfo.conditions.reduce((acc, condition) => {\n      return { ...acc, [condition.qualifierName]: condition.value };\n    }, {} as ResourceJson.Json.ConditionSetDecl);\n\n    return succeed({\n      candidate,\n      conditions: conditionsAsRecord,\n      json: candidateInfo.json ?? candidate.json,\n      isPartial: candidate.isPartial,\n      mergeMethod: candidate.mergeMethod\n    });\n  }\n}\n"]}

package/lib/packlets/resources/common.d.ts

@@ -0,0 +1,72 @@
+import * as ResourceJson from '../resource-json';
+import { IValidatedContextDecl } from '../context';
+/**
+ * Options for resource declaration operations with strongly-typed context filtering.
+ * Extends the base IDeclarationOptions with proper type safety for context filtering.
+ *
+ * @example
+ * ```typescript
+ * // Preferred Result pattern with onSuccess chaining
+ * resourceManager.validateContext({ language: 'en' })
+ *   .onSuccess((validatedContext) => {
+ *     return resourceManager.clone({ filterForContext: validatedContext });
+ *   })
+ *   .onSuccess((clonedManager) => {
+ *     return clonedManager.getResourceCollectionDecl();
+ *   })
+ *   .onFailure((error) => {
+ *     console.error('Failed to create filtered clone:', error);
+ *   });
+ * ```
+ * @public
+ */
+export interface IResourceDeclarationOptions extends ResourceJson.Helpers.IDeclarationOptions {
+    /**
+     * If provided, filters resource candidates to only include those that can match the
+     * specified validated context. This provides strongly-typed context filtering.
+     *
+     * Use resourceManager.validateContext() to create a validated context from an IContextDecl.
+     */
+    filterForContext?: IValidatedContextDecl;
+    /**
+     * If true, reduces the qualifiers of the resource candidates by removing qualifiers that are made
+     * irrelevant by the filterForContext.
+     * @defaultValue false
+     */
+    reduceQualifiers?: boolean;
+    /**
+     * Whether to include metadata in compiled outputs.
+     * Metadata includes human-readable information like semantic keys
+     * that can be useful for debugging or tooling.
+     * @defaultValue false
+     */
+    includeMetadata?: boolean;
+}
+/**
+ * Extended compiled resource options that includes context filtering capabilities.
+ * This interface combines the standard compilation options with strongly-typed
+ * context filtering for resource candidates.
+ * @public
+ */
+export interface ICompiledResourceOptionsWithFilter extends ResourceJson.Compiled.ICompiledResourceOptions {
+    /**
+     * If provided, filters resource candidates to only include those that can match the
+     * specified validated context. This provides strongly-typed context filtering.
+     *
+     * Use resourceManager.validateContext() to create a validated context from an IContextDecl.
+     */
+    filterForContext?: IValidatedContextDecl;
+}
+/**
+ * Options for ResourceManagerBuilder clone operations.
+ * Extends IDeclarationOptions to include support for applying edits when cloning.
+ * @public
+ */
+export interface IResourceManagerCloneOptions extends IResourceDeclarationOptions {
+    /**
+     * Optional array of loose condition declarations to be applied as edits during the clone operation.
+     * These conditions can modify or extend the resource candidates in the cloned manager.
+     */
+    readonly candidates?: ReadonlyArray<ResourceJson.Json.ILooseResourceCandidateDecl>;
+}
+//# sourceMappingURL=common.d.ts.map

package/lib/packlets/resources/common.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"common.d.ts","sourceRoot":"","sources":["../../../src/packlets/resources/common.ts"],"names":[],"mappings":"AAsBA,OAAO,KAAK,YAAY,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AAEnD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,WAAW,2BAA4B,SAAQ,YAAY,CAAC,OAAO,CAAC,mBAAmB;IAC3F;;;;;OAKG;IACH,gBAAgB,CAAC,EAAE,qBAAqB,CAAC;IAEzC;;;;OAIG;IACH,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAE3B;;;;;OAKG;IACH,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED;;;;;GAKG;AACH,MAAM,WAAW,kCAAmC,SAAQ,YAAY,CAAC,QAAQ,CAAC,wBAAwB;IACxG;;;;;OAKG;IACH,gBAAgB,CAAC,EAAE,qBAAqB,CAAC;CAC1C;AAED;;;;GAIG;AACH,MAAM,WAAW,4BAA6B,SAAQ,2BAA2B;IAC/E;;;OAGG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,aAAa,CAAC,YAAY,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;CACpF"}

package/lib/packlets/resources/common.js

@@ -0,0 +1,24 @@
+"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 });
+//# sourceMappingURL=common.js.map

package/lib/packlets/resources/common.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"common.js","sourceRoot":"","sources":["../../../src/packlets/resources/common.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG","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 * as ResourceJson from '../resource-json';\nimport { IValidatedContextDecl } from '../context';\n\n/**\n * Options for resource declaration operations with strongly-typed context filtering.\n * Extends the base IDeclarationOptions with proper type safety for context filtering.\n *\n * @example\n * ```typescript\n * // Preferred Result pattern with onSuccess chaining\n * resourceManager.validateContext({ language: 'en' })\n *   .onSuccess((validatedContext) => {\n *     return resourceManager.clone({ filterForContext: validatedContext });\n *   })\n *   .onSuccess((clonedManager) => {\n *     return clonedManager.getResourceCollectionDecl();\n *   })\n *   .onFailure((error) => {\n *     console.error('Failed to create filtered clone:', error);\n *   });\n * ```\n * @public\n */\nexport interface IResourceDeclarationOptions extends ResourceJson.Helpers.IDeclarationOptions {\n  /**\n   * If provided, filters resource candidates to only include those that can match the\n   * specified validated context. This provides strongly-typed context filtering.\n   *\n   * Use resourceManager.validateContext() to create a validated context from an IContextDecl.\n   */\n  filterForContext?: IValidatedContextDecl;\n\n  /**\n   * If true, reduces the qualifiers of the resource candidates by removing qualifiers that are made\n   * irrelevant by the filterForContext.\n   * @defaultValue false\n   */\n  reduceQualifiers?: boolean;\n\n  /**\n   * Whether to include metadata in compiled outputs.\n   * Metadata includes human-readable information like semantic keys\n   * that can be useful for debugging or tooling.\n   * @defaultValue false\n   */\n  includeMetadata?: boolean;\n}\n\n/**\n * Extended compiled resource options that includes context filtering capabilities.\n * This interface combines the standard compilation options with strongly-typed\n * context filtering for resource candidates.\n * @public\n */\nexport interface ICompiledResourceOptionsWithFilter extends ResourceJson.Compiled.ICompiledResourceOptions {\n  /**\n   * If provided, filters resource candidates to only include those that can match the\n   * specified validated context. This provides strongly-typed context filtering.\n   *\n   * Use resourceManager.validateContext() to create a validated context from an IContextDecl.\n   */\n  filterForContext?: IValidatedContextDecl;\n}\n\n/**\n * Options for ResourceManagerBuilder clone operations.\n * Extends IDeclarationOptions to include support for applying edits when cloning.\n * @public\n */\nexport interface IResourceManagerCloneOptions extends IResourceDeclarationOptions {\n  /**\n   * Optional array of loose condition declarations to be applied as edits during the clone operation.\n   * These conditions can modify or extend the resource candidates in the cloned manager.\n   */\n  readonly candidates?: ReadonlyArray<ResourceJson.Json.ILooseResourceCandidateDecl>;\n}\n"]}

package/lib/packlets/resources/index.d.ts

@@ -1,5 +1,7 @@
+export * from './candidateReducer';
 export * from './resourceCandidate';
 export * from './resource';
 export * from './resourceBuilder';
-export * from './resourceManager';
+export * from './resourceManagerBuilder';
+export * from './common';
 //# sourceMappingURL=index.d.ts.map

package/lib/packlets/resources/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/packlets/resources/index.ts"],"names":[],"mappings":"AAsBA,cAAc,qBAAqB,CAAC;AACpC,cAAc,YAAY,CAAC;AAC3B,cAAc,mBAAmB,CAAC;AAClC,cAAc,mBAAmB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/packlets/resources/index.ts"],"names":[],"mappings":"AAsBA,cAAc,oBAAoB,CAAC;AACnC,cAAc,qBAAqB,CAAC;AACpC,cAAc,YAAY,CAAC;AAC3B,cAAc,mBAAmB,CAAC;AAClC,cAAc,0BAA0B,CAAC;AACzC,cAAc,UAAU,CAAC"}

package/lib/packlets/resources/index.js

@@ -35,8 +35,10 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
     for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
 };
 Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./candidateReducer"), exports);
 __exportStar(require("./resourceCandidate"), exports);
 __exportStar(require("./resource"), exports);
 __exportStar(require("./resourceBuilder"), exports);
-__exportStar(require("./resourceManager"), exports);
+__exportStar(require("./resourceManagerBuilder"), exports);
+__exportStar(require("./common"), exports);
 //# sourceMappingURL=index.js.map

package/lib/packlets/resources/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/packlets/resources/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;;;;;;;;;;;AAEH,sDAAoC;AACpC,6CAA2B;AAC3B,oDAAkC;AAClC,oDAAkC","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\nexport * from './resourceCandidate';\nexport * from './resource';\nexport * from './resourceBuilder';\nexport * from './resourceManager';\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/packlets/resources/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;;;;;;;;;;;;;;;AAEH,qDAAmC;AACnC,sDAAoC;AACpC,6CAA2B;AAC3B,oDAAkC;AAClC,2DAAyC;AACzC,2CAAyB","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\nexport * from './candidateReducer';\nexport * from './resourceCandidate';\nexport * from './resource';\nexport * from './resourceBuilder';\nexport * from './resourceManagerBuilder';\nexport * from './common';\n"]}

package/lib/packlets/resources/resource.d.ts

@@ -2,7 +2,11 @@ import { Result } from '@fgv/ts-utils';
 import { ResourceId } from '../common';
 import { ResourceCandidate } from './resourceCandidate';
 import { ResourceType } from '../resource-types';
+import { ConcreteDecision, AbstractDecisionCollector } from '../decisions';
+import { IResource } from '../runtime';
+import { IResourceDeclarationOptions, ICompiledResourceOptionsWithFilter } from './common';
 import * as ResourceJson from '../resource-json';
+import * as Context from '../context';
 /**
  * Parameters used to create a {@link Resources.Resource | Resource} object.
  * @public
@@ -21,13 +25,17 @@ export interface IResourceCreateParams {
      * Array of {@link Resources.ResourceCandidate | candidates} for the resource.
      */
     candidates: ReadonlyArray<ResourceCandidate>;
+    /**
+     * {@link Decisions.AbstractDecisionCollector | AbstractDecisionCollector} used to create the optimized decision.
+     */
+    decisions: AbstractDecisionCollector;
 }
 /**
  * Represents a single logical resource, with a unique id and a set of possible
  * candidate instances.
  * @public
  */
-export declare class Resource {
+export declare class Resource implements IResource {
     /**
      * The unique {@link ResourceId | id} of the resource.
      */
@@ -35,11 +43,23 @@ export declare class Resource {
     /**
      * The {@link ResourceTypes.ResourceType | type} of the resource.
      */
-    readonly resourceType: ResourceType;
+    readonly _resourceType: ResourceType;
     /**
      * The array of {@link Resources.ResourceCandidate | candidates} for the resource.
      */
     readonly candidates: ReadonlyArray<ResourceCandidate>;
+    /**
+     * {@link Decisions.ConcreteDecision | Decision} for optimized resource resolution.
+     */
+    readonly decision: ConcreteDecision;
+    /**
+     * Gets the resource type (implements IResource interface).
+     */
+    get resourceType(): ResourceType;
+    /**
+     * Gets the resource type name as a string.
+     */
+    get resourceTypeName(): string;
     /**
      * Constructor for a {@link Resources.Resource | Resource} object.
      * @param params - {@link Resources.IResourceCreateParams | Parameters} used to create the resource.
@@ -54,18 +74,32 @@ export declare class Resource {
      * @public
      */
     static create(params: IResourceCreateParams): Result<Resource>;
+    /**
+     * Gets the candidates for this resource that match the specified {@link Context.IValidatedContextDecl | context}.
+     * @param context - The {@link Context.IValidatedContextDecl | context} to match against.
+     * @param options - {@link Context.IContextMatchOptions | options} for the context match.
+     * @returns The array of {@link Resources.ResourceCandidate | candidates} that match the context.
+     */
+    getCandidatesForContext(context: Context.IValidatedContextDecl, options?: Context.IContextMatchOptions): ReadonlyArray<ResourceCandidate>;
     /**
      * Gets the {@link ResourceJson.Json.IChildResourceDecl | child resource declaration} for this resource.
      * @param options - {@link ResourceJson.Helpers.IDeclarationOptions | options} for the declaration.
      * @returns The {@link ResourceJson.Json.IChildResourceDecl | child resource declaration}.
      */
-    toChildResourceDecl(options?: ResourceJson.Helpers.IDeclarationOptions): ResourceJson.Json.IChildResourceDecl;
+    toChildResourceDecl(options?: IResourceDeclarationOptions): ResourceJson.Json.IChildResourceDecl;
     /**
      * Gets the {@link ResourceJson.Json.ILooseResourceDecl | loose resource declaration} for this resource.
-     * @param options - {@link ResourceJson.Helpers.IDeclarationOptions | options} for the declaration.
+     * @param options - {@link Resources.IResourceDeclarationOptions | options} for the declaration.
      * @returns The {@link ResourceJson.Json.ILooseResourceDecl | loose resource declaration}.
      */
-    toLooseResourceDecl(options?: ResourceJson.Helpers.IDeclarationOptions): ResourceJson.Json.ILooseResourceDecl;
+    toLooseResourceDecl(options?: IResourceDeclarationOptions): ResourceJson.Json.ILooseResourceDecl;
+    /**
+     * Converts this resource to a compiled resource representation.
+     * @param options - Optional compilation options controlling the output format and filtering.
+     * @returns A compiled resource object that can be used for serialization or runtime processing.
+     * @public
+     */
+    toCompiled(options?: IResourceDeclarationOptions | ICompiledResourceOptionsWithFilter): ResourceJson.Compiled.ICompiledResource;
     /**
      * Validates that all candidates have the same id as the resource.
      * @param resourceId - The expected id of the resource.
@@ -75,6 +109,15 @@ export declare class Resource {
      * @internal
      */
     private static _validateCandidateResourceIds;
+    /**
+     * Creates an optimized decision for the given candidates using the decisions collector.
+     * @param candidates - The validated and normalized candidates to create a decision for.
+     * @param decisions - The {@link Decisions.AbstractDecisionCollector | AbstractDecisionCollector} to use.
+     * @returns `Success` with the {@link Decisions.ConcreteDecision | ConcreteDecision} if successful,
+     * `Failure` with an error message otherwise.
+     * @internal
+     */
+    private static _createOptimizedDecision;
     /**
      * Validates and normalizes an array of {@link Resources.ResourceCandidate | candidates}. Fails if there
      * are multiple candidates for the same set of conditions.
@@ -84,5 +127,14 @@ export declare class Resource {
      * @internal
      */
     private static _validateAndNormalizeCandidates;
+    /**
+     * Gets the appropriate candidates based on filtering options.
+     * If a validated filter context is provided, returns only matching candidates.
+     * Otherwise returns all candidates.
+     * @param options - Options that may contain a validated filter context
+     * @returns The filtered array of candidates
+     * @internal
+     */
+    protected _getMatchingCandidates(options?: IResourceDeclarationOptions | ICompiledResourceOptionsWithFilter): ReadonlyArray<ResourceCandidate>;
 }
 //# sourceMappingURL=resource.d.ts.map

package/lib/packlets/resources/resource.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"resource.d.ts","sourceRoot":"","sources":["../../../src/packlets/resources/resource.ts"],"names":[],"mappings":"AAsBA,OAAO,EAAqB,MAAM,EAAgC,MAAM,eAAe,CAAC;AACxF,OAAO,EAAE,UAAU,EAAY,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,KAAK,YAAY,MAAM,kBAAkB,CAAC;AAEjD;;;GAGG;AACH,MAAM,WAAW,qBAAqB;IACpC;;OAEG;IACH,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ;;;OAGG;IACH,YAAY,CAAC,EAAE,YAAY,CAAC;IAC5B;;OAEG;IACH,UAAU,EAAE,aAAa,CAAC,iBAAiB,CAAC,CAAC;CAC9C;AAED;;;;GAIG;AACH,qBAAa,QAAQ;IACnB;;OAEG;IACH,SAAgB,EAAE,EAAE,UAAU,CAAC;IAC/B;;OAEG;IACH,SAAgB,YAAY,EAAE,YAAY,CAAC;IAC3C;;OAEG;IACH,SAAgB,UAAU,EAAE,aAAa,CAAC,iBAAiB,CAAC,CAAC;IAE7D;;;;OAIG;IACH,SAAS,aAAa,MAAM,EAAE,qBAAqB;IAenD;;;;;;OAMG;WACW,MAAM,CAAC,MAAM,EAAE,qBAAqB,GAAG,MAAM,CAAC,QAAQ,CAAC;IAIrE;;;;OAIG;IACI,mBAAmB,CACxB,OAAO,CAAC,EAAE,YAAY,CAAC,OAAO,CAAC,mBAAmB,GACjD,YAAY,CAAC,IAAI,CAAC,kBAAkB;IAQvC;;;;OAIG;IACI,mBAAmB,CACxB,OAAO,CAAC,EAAE,YAAY,CAAC,OAAO,CAAC,mBAAmB,GACjD,YAAY,CAAC,IAAI,CAAC,kBAAkB;IASvC;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,6BAA6B;IAgB5C;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,+BAA+B;CAqB/C"}
+{"version":3,"file":"resource.d.ts","sourceRoot":"","sources":["../../../src/packlets/resources/resource.ts"],"names":[],"mappings":"AAsBA,OAAO,EAAqB,MAAM,EAAgC,MAAM,eAAe,CAAC;AACxF,OAAO,EAAE,UAAU,EAAY,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAExD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,gBAAgB,EAAE,yBAAyB,EAAE,MAAM,cAAc,CAAC;AAC3E,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AACvC,OAAO,EAAE,2BAA2B,EAAE,kCAAkC,EAAE,MAAM,UAAU,CAAC;AAC3F,OAAO,KAAK,YAAY,MAAM,kBAAkB,CAAC;AACjD,OAAO,KAAK,OAAO,MAAM,YAAY,CAAC;AAEtC;;;GAGG;AACH,MAAM,WAAW,qBAAqB;IACpC;;OAEG;IACH,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ;;;OAGG;IACH,YAAY,CAAC,EAAE,YAAY,CAAC;IAC5B;;OAEG;IACH,UAAU,EAAE,aAAa,CAAC,iBAAiB,CAAC,CAAC;IAC7C;;OAEG;IACH,SAAS,EAAE,yBAAyB,CAAC;CACtC;AAED;;;;GAIG;AACH,qBAAa,QAAS,YAAW,SAAS;IACxC;;OAEG;IACH,SAAgB,EAAE,EAAE,UAAU,CAAC;IAC/B;;OAEG;IACH,SAAgB,aAAa,EAAE,YAAY,CAAC;IAC5C;;OAEG;IACH,SAAgB,UAAU,EAAE,aAAa,CAAC,iBAAiB,CAAC,CAAC;IAC7D;;OAEG;IACH,SAAgB,QAAQ,EAAE,gBAAgB,CAAC;IAE3C;;OAEG;IACH,IAAW,YAAY,IAAI,YAAY,CAEtC;IAED;;OAEG;IACH,IAAW,gBAAgB,IAAI,MAAM,CAEpC;IAED;;;;OAIG;IACH,SAAS,aAAa,MAAM,EAAE,qBAAqB;IAiBnD;;;;;;OAMG;WACW,MAAM,CAAC,MAAM,EAAE,qBAAqB,GAAG,MAAM,CAAC,QAAQ,CAAC;IAIrE;;;;;OAKG;IACI,uBAAuB,CAC5B,OAAO,EAAE,OAAO,CAAC,qBAAqB,EACtC,OAAO,CAAC,EAAE,OAAO,CAAC,oBAAoB,GACrC,aAAa,CAAC,iBAAiB,CAAC;IAInC;;;;OAIG;IACI,mBAAmB,CAAC,OAAO,CAAC,EAAE,2BAA2B,GAAG,YAAY,CAAC,IAAI,CAAC,kBAAkB;IAevG;;;;OAIG;IACI,mBAAmB,CAAC,OAAO,CAAC,EAAE,2BAA2B,GAAG,YAAY,CAAC,IAAI,CAAC,kBAAkB;IAgBvG;;;;;OAKG;IACI,UAAU,CACf,OAAO,CAAC,EAAE,2BAA2B,GAAG,kCAAkC,GACzE,YAAY,CAAC,QAAQ,CAAC,iBAAiB;IAiB1C;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,6BAA6B;IAkB5C;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAevC;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAuB9C;;;;;;;OAOG;IACH,SAAS,CAAC,sBAAsB,CAC9B,OAAO,CAAC,EAAE,2BAA2B,GAAG,kCAAkC,GACzE,aAAa,CAAC,iBAAiB,CAAC;CASpC"}