@aster-cloud/aster-lang-ts 0.0.1

package/dist/src/package/resolver.js

@@ -0,0 +1,236 @@
+/**
+ * 基于回溯的依赖解析器，实现约束合并、冲突检测与依赖图构建。
+ */
+import { satisfies, sortVersions } from './version-utils.js';
+import { DependencyGraph } from './dependency-graph.js';
+import { DiagnosticCode } from '../diagnostics/diagnostics.js';
+const RESOLVER_ERROR_LABEL = {
+    Timeout: 'DEPENDENCY_RESOLUTION_TIMEOUT',
+    Conflict: 'VERSION_CONFLICT_UNRESOLVABLE',
+    MissingPackage: 'PACKAGE_NOT_FOUND',
+};
+const DEFAULT_TIMEOUT = 30_000;
+const DEFAULT_MAX_DEPTH = 100;
+export class MockPackageRegistry {
+    data = {};
+    constructor() {
+        this.bootstrap();
+    }
+    getAvailableVersions(name) {
+        const versions = this.data[name];
+        if (!versions) {
+            return new Error(`${RESOLVER_ERROR_LABEL.MissingPackage}(${DiagnosticCode.PACKAGE_NOT_FOUND}): 未找到包 ${name}`);
+        }
+        return sortVersions(Object.keys(versions));
+    }
+    getDependencies(name, version) {
+        const versions = this.data[name];
+        if (!versions) {
+            return new Error(`${RESOLVER_ERROR_LABEL.MissingPackage}(${DiagnosticCode.PACKAGE_NOT_FOUND}): 未找到包 ${name}`);
+        }
+        if (name === 'deep-package') {
+            this.simulateHeavyLookup();
+        }
+        const dependencies = versions[version];
+        if (!dependencies) {
+            return new Error(`${RESOLVER_ERROR_LABEL.MissingPackage}(${DiagnosticCode.PACKAGE_NOT_FOUND}): ${name} 的版本 ${version} 缺失`);
+        }
+        return { ...dependencies };
+    }
+    bootstrap() {
+        this.data['aster.http'] = {
+            '3.0.0': { 'aster.time': '^2.0.0' },
+            '2.5.0': { 'aster.time': '^1.5.0' },
+            '2.1.0': {},
+            '2.0.0': {},
+        };
+        this.data['aster.time'] = {
+            '2.0.0': {},
+            '1.5.3': {},
+            '1.5.0': {},
+            '1.0.0': {},
+        };
+        this.data['aster.sql'] = {
+            '1.0.0': { 'aster.time': '~1.5.0' },
+            '0.9.0': {},
+        };
+        this.createDeepChain('deep-chain', 32);
+        this.createDeepChain('deep-package', 48);
+    }
+    createDeepChain(rootName, length) {
+        for (let index = 0; index < length; index += 1) {
+            const packageName = index === 0 ? rootName : `${rootName}-${index}`;
+            const nextName = index === length - 1 ? null : `${rootName}-${index + 1}`;
+            this.data[packageName] = {
+                '1.0.0': nextName ? { [nextName]: '^1.0.0' } : {},
+            };
+        }
+    }
+    /**
+     * 通过忙等模拟复杂依赖图遍历延迟，确保timeout逻辑可测。
+     */
+    simulateHeavyLookup() {
+        const target = Date.now() + 150;
+        while (Date.now() < target) {
+            // 忙等待，生成可预测的延迟
+        }
+    }
+}
+export class DependencyResolver {
+    registry;
+    constructor(registry) {
+        this.registry = registry;
+    }
+    resolve(rootDeps, options = {}) {
+        const normalized = this.normalizeOptions(options);
+        const constraints = this.buildInitialConstraints(rootDeps);
+        const resolved = new Map();
+        const packageDeps = new Map();
+        const startTime = Date.now();
+        return this.backtrack(constraints, resolved, packageDeps, 0, startTime, normalized);
+    }
+    backtrack(constraints, resolved, packageDeps, depth, startTime, options) {
+        if (Date.now() - startTime >= options.timeout) {
+            return new Error(`${RESOLVER_ERROR_LABEL.Timeout}(${DiagnosticCode.DEPENDENCY_RESOLUTION_TIMEOUT}): 解析耗时超过 ${options.timeout}ms`);
+        }
+        if (depth > options.maxDepth) {
+            return new Error(`超过最大深度${options.maxDepth}，请检查依赖链`);
+        }
+        const nextPackage = this.selectNextPackage(constraints, resolved);
+        if (!nextPackage) {
+            return this.buildResult(resolved, packageDeps);
+        }
+        const availableVersions = this.registry.getAvailableVersions(nextPackage);
+        if (availableVersions instanceof Error) {
+            return availableVersions;
+        }
+        const sortedVersions = sortVersions(availableVersions);
+        const packageConstraints = constraints.get(nextPackage) ?? [];
+        let lastError = null;
+        for (const version of sortedVersions) {
+            if (!this.versionSatisfiesConstraints(version, packageConstraints)) {
+                continue;
+            }
+            resolved.set(nextPackage, version);
+            const dependencies = this.registry.getDependencies(nextPackage, version);
+            if (dependencies instanceof Error) {
+                lastError = dependencies;
+                resolved.delete(nextPackage);
+                packageDeps.delete(nextPackage);
+                continue;
+            }
+            packageDeps.set(nextPackage, dependencies);
+            const mergedConstraints = this.mergeConstraints(constraints, dependencies);
+            const validation = this.validateConstraints(mergedConstraints, resolved);
+            if (validation instanceof Error) {
+                lastError = validation;
+                resolved.delete(nextPackage);
+                packageDeps.delete(nextPackage);
+                continue;
+            }
+            const outcome = this.backtrack(mergedConstraints, resolved, packageDeps, depth + 1, startTime, options);
+            if (!(outcome instanceof Error)) {
+                return outcome;
+            }
+            resolved.delete(nextPackage);
+            packageDeps.delete(nextPackage);
+            if (this.isFatalError(outcome)) {
+                return outcome;
+            }
+            lastError = outcome;
+        }
+        return (lastError ??
+            new Error(`${RESOLVER_ERROR_LABEL.Conflict}(${DiagnosticCode.VERSION_CONFLICT_UNRESOLVABLE}): 包 ${nextPackage} 无法满足约束`));
+    }
+    buildInitialConstraints(rootDeps) {
+        const constraints = new Map();
+        for (const [name, constraint] of Object.entries(rootDeps)) {
+            constraints.set(name, [constraint]);
+        }
+        return constraints;
+    }
+    normalizeOptions(options) {
+        const timeout = options.timeout ?? DEFAULT_TIMEOUT;
+        const maxDepth = options.maxDepth ?? DEFAULT_MAX_DEPTH;
+        return {
+            timeout: timeout > 0 ? timeout : DEFAULT_TIMEOUT,
+            maxDepth: maxDepth > 0 ? maxDepth : DEFAULT_MAX_DEPTH,
+        };
+    }
+    mergeConstraints(base, dependencies) {
+        const next = new Map();
+        for (const [name, list] of base.entries()) {
+            next.set(name, [...list]);
+        }
+        for (const [depName, constraint] of Object.entries(dependencies)) {
+            const existing = next.get(depName);
+            if (existing) {
+                existing.push(constraint);
+            }
+            else {
+                next.set(depName, [constraint]);
+            }
+        }
+        return next;
+    }
+    validateConstraints(constraints, resolved) {
+        for (const [name, packageConstraints] of constraints) {
+            const availableVersions = this.registry.getAvailableVersions(name);
+            if (availableVersions instanceof Error) {
+                return availableVersions;
+            }
+            const candidateVersions = resolved.has(name)
+                ? [resolved.get(name)]
+                : availableVersions;
+            const hasSatisfyingVersion = candidateVersions.some((version) => this.versionSatisfiesConstraints(version, packageConstraints));
+            if (!hasSatisfyingVersion) {
+                return new Error(`${RESOLVER_ERROR_LABEL.Conflict}(${DiagnosticCode.VERSION_CONFLICT_UNRESOLVABLE}): 包 ${name} 无可用版本满足 ${packageConstraints.join(', ')}`);
+            }
+        }
+        return null;
+    }
+    versionSatisfiesConstraints(version, constraints) {
+        return constraints.every((constraint) => satisfies(version, constraint));
+    }
+    selectNextPackage(constraints, resolved) {
+        let target = null;
+        let maxConstraints = -1;
+        for (const [name, packageConstraints] of constraints) {
+            if (resolved.has(name)) {
+                continue;
+            }
+            const constraintCount = packageConstraints.length;
+            if (constraintCount > maxConstraints || (constraintCount === maxConstraints && target && name < target)) {
+                target = name;
+                maxConstraints = constraintCount;
+            }
+        }
+        return target;
+    }
+    buildResult(resolved, packageDeps) {
+        const graph = new DependencyGraph();
+        for (const [name, version] of resolved.entries()) {
+            graph.addNode(name, version);
+        }
+        for (const [name, version] of resolved.entries()) {
+            const dependencies = packageDeps.get(name) ?? {};
+            const fromId = `${name}@${version}`;
+            for (const [depName] of Object.entries(dependencies)) {
+                const depVersion = resolved.get(depName);
+                if (!depVersion) {
+                    continue;
+                }
+                graph.addEdge(fromId, `${depName}@${depVersion}`);
+            }
+        }
+        return {
+            packages: new Map(resolved),
+            graph,
+        };
+    }
+    isFatalError(error) {
+        const message = error.message;
+        return (message.includes(RESOLVER_ERROR_LABEL.Timeout) || message.includes('超过最大深度'));
+    }
+}
+//# sourceMappingURL=resolver.js.map

package/dist/src/package/resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolver.js","sourceRoot":"","sources":["../../../src/package/resolver.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAS/D,MAAM,oBAAoB,GAAG;IAC3B,OAAO,EAAE,+BAA+B;IACxC,QAAQ,EAAE,+BAA+B;IACzC,cAAc,EAAE,mBAAmB;CAC3B,CAAC;AA2BX,MAAM,eAAe,GAAG,MAAM,CAAC;AAC/B,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAE9B,MAAM,OAAO,mBAAmB;IACb,IAAI,GAAiB,EAAE,CAAC;IAEzC;QACE,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAED,oBAAoB,CAAC,IAAY;QAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,IAAI,KAAK,CACd,GAAG,oBAAoB,CAAC,cAAc,IAAI,cAAc,CAAC,iBAAiB,WAAW,IAAI,EAAE,CAC5F,CAAC;QACJ,CAAC;QACD,OAAO,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,eAAe,CAAC,IAAY,EAAE,OAAe;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,IAAI,KAAK,CACd,GAAG,oBAAoB,CAAC,cAAc,IAAI,cAAc,CAAC,iBAAiB,WAAW,IAAI,EAAE,CAC5F,CAAC;QACJ,CAAC;QAED,IAAI,IAAI,KAAK,cAAc,EAAE,CAAC;YAC5B,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC7B,CAAC;QAED,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,OAAO,IAAI,KAAK,CACd,GAAG,oBAAoB,CAAC,cAAc,IAAI,cAAc,CAAC,iBAAiB,MAAM,IAAI,QAAQ,OAAO,KAAK,CACzG,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,GAAG,YAAY,EAAE,CAAC;IAC7B,CAAC;IAEO,SAAS;QACf,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG;YACxB,OAAO,EAAE,EAAE,YAAY,EAAE,QAAQ,EAAE;YACnC,OAAO,EAAE,EAAE,YAAY,EAAE,QAAQ,EAAE;YACnC,OAAO,EAAE,EAAE;YACX,OAAO,EAAE,EAAE;SACZ,CAAC;QAEF,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG;YACxB,OAAO,EAAE,EAAE;YACX,OAAO,EAAE,EAAE;YACX,OAAO,EAAE,EAAE;YACX,OAAO,EAAE,EAAE;SACZ,CAAC;QAEF,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG;YACvB,OAAO,EAAE,EAAE,YAAY,EAAE,QAAQ,EAAE;YACnC,OAAO,EAAE,EAAE;SACZ,CAAC;QAEF,IAAI,CAAC,eAAe,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;QACvC,IAAI,CAAC,eAAe,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;IAC3C,CAAC;IAEO,eAAe,CAAC,QAAgB,EAAE,MAAc;QACtD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YAC/C,MAAM,WAAW,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,IAAI,KAAK,EAAE,CAAC;YACpE,MAAM,QAAQ,GAAG,KAAK,KAAK,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YAC1E,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG;gBACvB,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE;aAClD,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,mBAAmB;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC;QAChC,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,MAAM,EAAE,CAAC;YAC3B,eAAe;QACjB,CAAC;IACH,CAAC;CACF;AAED,MAAM,OAAO,kBAAkB;IACA;IAA7B,YAA6B,QAAyB;QAAzB,aAAQ,GAAR,QAAQ,CAAiB;IAAG,CAAC;IAE1D,OAAO,CAAC,QAAuB,EAAE,UAA2B,EAAE;QAC5D,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAClD,MAAM,WAAW,GAAG,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAyB,CAAC;QACrD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,OAAO,IAAI,CAAC,SAAS,CAAC,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACtF,CAAC;IAEO,SAAS,CACf,WAA4B,EAC5B,QAA6B,EAC7B,WAAuC,EACvC,KAAa,EACb,SAAiB,EACjB,OAA0B;QAE1B,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YAC9C,OAAO,IAAI,KAAK,CACd,GAAG,oBAAoB,CAAC,OAAO,IAAI,cAAc,CAAC,6BAA6B,aAAa,OAAO,CAAC,OAAO,IAAI,CAChH,CAAC;QACJ,CAAC;QAED,IAAI,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YAC7B,OAAO,IAAI,KAAK,CAAC,SAAS,OAAO,CAAC,QAAQ,SAAS,CAAC,CAAC;QACvD,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,iBAAiB,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;QAClE,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,OAAO,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;QACjD,CAAC;QAED,MAAM,iBAAiB,GAAG,IAAI,CAAC,QAAQ,CAAC,oBAAoB,CAAC,WAAW,CAAC,CAAC;QAC1E,IAAI,iBAAiB,YAAY,KAAK,EAAE,CAAC;YACvC,OAAO,iBAAiB,CAAC;QAC3B,CAAC;QAED,MAAM,cAAc,GAAG,YAAY,CAAC,iBAAiB,CAAC,CAAC;QACvD,MAAM,kBAAkB,GAAG,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAC9D,IAAI,SAAS,GAAiB,IAAI,CAAC;QAEnC,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,2BAA2B,CAAC,OAAO,EAAE,kBAAkB,CAAC,EAAE,CAAC;gBACnE,SAAS;YACX,CAAC;YAED,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YAEnC,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACzE,IAAI,YAAY,YAAY,KAAK,EAAE,CAAC;gBAClC,SAAS,GAAG,YAAY,CAAC;gBACzB,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;gBAC7B,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;gBAChC,SAAS;YACX,CAAC;YAED,WAAW,CAAC,GAAG,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;YAC3C,MAAM,iBAAiB,GAAG,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;YAC3E,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,iBAAiB,EAAE,QAAQ,CAAC,CAAC;YACzE,IAAI,UAAU,YAAY,KAAK,EAAE,CAAC;gBAChC,SAAS,GAAG,UAAU,CAAC;gBACvB,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;gBAC7B,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;gBAChC,SAAS;YACX,CAAC;YAED,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAC5B,iBAAiB,EACjB,QAAQ,EACR,WAAW,EACX,KAAK,GAAG,CAAC,EACT,SAAS,EACT,OAAO,CACR,CAAC;YAEF,IAAI,CAAC,CAAC,OAAO,YAAY,KAAK,CAAC,EAAE,CAAC;gBAChC,OAAO,OAAO,CAAC;YACjB,CAAC;YAED,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YAC7B,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YAEhC,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC/B,OAAO,OAAO,CAAC;YACjB,CAAC;YAED,SAAS,GAAG,OAAO,CAAC;QACtB,CAAC;QAED,OAAO,CACL,SAAS;YACT,IAAI,KAAK,CACP,GAAG,oBAAoB,CAAC,QAAQ,IAAI,cAAc,CAAC,6BAA6B,QAAQ,WAAW,SAAS,CAC7G,CACF,CAAC;IACJ,CAAC;IAEO,uBAAuB,CAAC,QAAuB;QACrD,MAAM,WAAW,GAAoB,IAAI,GAAG,EAAE,CAAC;QAC/C,KAAK,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC1D,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAEO,gBAAgB,CAAC,OAAwB;QAC/C,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,eAAe,CAAC;QACnD,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,iBAAiB,CAAC;QACvD,OAAO;YACL,OAAO,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe;YAChD,QAAQ,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,iBAAiB;SACtD,CAAC;IACJ,CAAC;IAEO,gBAAgB,CAAC,IAAqB,EAAE,YAA2B;QACzE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAC5B,CAAC;QAED,KAAK,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;YACjE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACnC,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,mBAAmB,CAAC,WAA4B,EAAE,QAA6B;QACrF,KAAK,MAAM,CAAC,IAAI,EAAE,kBAAkB,CAAC,IAAI,WAAW,EAAE,CAAC;YACrD,MAAM,iBAAiB,GAAG,IAAI,CAAC,QAAQ,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;YACnE,IAAI,iBAAiB,YAAY,KAAK,EAAE,CAAC;gBACvC,OAAO,iBAAiB,CAAC;YAC3B,CAAC;YAED,MAAM,iBAAiB,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;gBAC1C,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;gBACvB,CAAC,CAAC,iBAAiB,CAAC;YACtB,MAAM,oBAAoB,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAC9D,IAAI,CAAC,2BAA2B,CAAC,OAAO,EAAE,kBAAkB,CAAC,CAC9D,CAAC;YAEF,IAAI,CAAC,oBAAoB,EAAE,CAAC;gBAC1B,OAAO,IAAI,KAAK,CACd,GAAG,oBAAoB,CAAC,QAAQ,IAAI,cAAc,CAAC,6BAA6B,QAAQ,IAAI,YAAY,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACxI,CAAC;YACJ,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,2BAA2B,CAAC,OAAe,EAAE,WAAqB;QACxE,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,SAAS,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC;IAC3E,CAAC;IAEO,iBAAiB,CAAC,WAA4B,EAAE,QAA6B;QACnF,IAAI,MAAM,GAAkB,IAAI,CAAC;QACjC,IAAI,cAAc,GAAG,CAAC,CAAC,CAAC;QAExB,KAAK,MAAM,CAAC,IAAI,EAAE,kBAAkB,CAAC,IAAI,WAAW,EAAE,CAAC;YACrD,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvB,SAAS;YACX,CAAC;YACD,MAAM,eAAe,GAAG,kBAAkB,CAAC,MAAM,CAAC;YAClD,IAAI,eAAe,GAAG,cAAc,IAAI,CAAC,eAAe,KAAK,cAAc,IAAI,MAAM,IAAI,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC;gBACxG,MAAM,GAAG,IAAI,CAAC;gBACd,cAAc,GAAG,eAAe,CAAC;YACnC,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,WAAW,CACjB,QAA6B,EAC7B,WAAuC;QAEvC,MAAM,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;YACjD,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC/B,CAAC;QAED,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;YACjD,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACjD,MAAM,MAAM,GAAG,GAAG,IAAI,IAAI,OAAO,EAAE,CAAC;YACpC,KAAK,MAAM,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;gBACrD,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACzC,IAAI,CAAC,UAAU,EAAE,CAAC;oBAChB,SAAS;gBACX,CAAC;gBACD,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,OAAO,IAAI,UAAU,EAAE,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC;YAC3B,KAAK;SACN,CAAC;IACJ,CAAC;IAEO,YAAY,CAAC,KAAY;QAC/B,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;QAC9B,OAAO,CACL,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAC7E,CAAC;IACJ,CAAC;CACF"}

package/dist/src/package/version-utils.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Aster包管理版本工具函数
+ *
+ * 封装npm semver库，提供版本解析、约束匹配和排序功能
+ */
+import semver from 'semver';
+/**
+ * 解析版本号字符串为SemVer对象
+ *
+ * @param version 版本号字符串（如 "1.0.0"、"2.3.4"）
+ * @returns 解析后的SemVer对象，解析失败返回null
+ *
+ * @example
+ * parseVersion("1.0.0")  // SemVer { major: 1, minor: 0, patch: 0 }
+ * parseVersion("invalid") // null
+ */
+export declare function parseVersion(version: string): semver.SemVer | null;
+/**
+ * 检查版本号是否满足指定约束
+ *
+ * @param version 版本号字符串（如 "2.1.0"）
+ * @param constraint 版本约束（如 "^2.0.0"、"~1.5.3"、">=1.0.0 <3.0.0"）
+ * @returns 如果版本满足约束返回true，否则返回false
+ *
+ * @example
+ * satisfies("2.1.0", "^2.0.0")  // true
+ * satisfies("1.9.0", "^2.0.0")  // false
+ * satisfies("1.5.4", "~1.5.3")  // true
+ */
+export declare function satisfies(version: string, constraint: string): boolean;
+/**
+ * 从版本列表中返回满足约束的最高版本
+ *
+ * @param versions 版本号字符串数组
+ * @param constraint 版本约束（如 "^2.0.0"）
+ * @returns 满足约束的最高版本号字符串，无匹配返回null
+ *
+ * @example
+ * maxSatisfying(["1.0.0", "2.1.0", "2.3.5"], "^2.0.0")  // "2.3.5"
+ * maxSatisfying(["1.0.0", "1.5.0"], "^2.0.0")           // null
+ */
+export declare function maxSatisfying(versions: string[], constraint: string): string | null;
+/**
+ * 对版本号数组进行降序排序
+ *
+ * @param versions 版本号字符串数组
+ * @returns 按降序排列的版本号数组（最新版本在前）
+ *
+ * @example
+ * sortVersions(["1.0.0", "2.1.0", "1.5.0"])  // ["2.1.0", "1.5.0", "1.0.0"]
+ */
+export declare function sortVersions(versions: string[]): string[];
+//# sourceMappingURL=version-utils.d.ts.map

package/dist/src/package/version-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"version-utils.d.ts","sourceRoot":"","sources":["../../../src/package/version-utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,MAAM,MAAM,QAAQ,CAAC;AAE5B;;;;;;;;;GASG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,GAAG,IAAI,CAElE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,OAAO,CAEtE;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAEnF;AAED;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAEzD"}

package/dist/src/package/version-utils.js

@@ -0,0 +1,61 @@
+/**
+ * Aster包管理版本工具函数
+ *
+ * 封装npm semver库，提供版本解析、约束匹配和排序功能
+ */
+import semver from 'semver';
+/**
+ * 解析版本号字符串为SemVer对象
+ *
+ * @param version 版本号字符串（如 "1.0.0"、"2.3.4"）
+ * @returns 解析后的SemVer对象，解析失败返回null
+ *
+ * @example
+ * parseVersion("1.0.0")  // SemVer { major: 1, minor: 0, patch: 0 }
+ * parseVersion("invalid") // null
+ */
+export function parseVersion(version) {
+    return semver.parse(version);
+}
+/**
+ * 检查版本号是否满足指定约束
+ *
+ * @param version 版本号字符串（如 "2.1.0"）
+ * @param constraint 版本约束（如 "^2.0.0"、"~1.5.3"、">=1.0.0 <3.0.0"）
+ * @returns 如果版本满足约束返回true，否则返回false
+ *
+ * @example
+ * satisfies("2.1.0", "^2.0.0")  // true
+ * satisfies("1.9.0", "^2.0.0")  // false
+ * satisfies("1.5.4", "~1.5.3")  // true
+ */
+export function satisfies(version, constraint) {
+    return semver.satisfies(version, constraint);
+}
+/**
+ * 从版本列表中返回满足约束的最高版本
+ *
+ * @param versions 版本号字符串数组
+ * @param constraint 版本约束（如 "^2.0.0"）
+ * @returns 满足约束的最高版本号字符串，无匹配返回null
+ *
+ * @example
+ * maxSatisfying(["1.0.0", "2.1.0", "2.3.5"], "^2.0.0")  // "2.3.5"
+ * maxSatisfying(["1.0.0", "1.5.0"], "^2.0.0")           // null
+ */
+export function maxSatisfying(versions, constraint) {
+    return semver.maxSatisfying(versions, constraint);
+}
+/**
+ * 对版本号数组进行降序排序
+ *
+ * @param versions 版本号字符串数组
+ * @returns 按降序排列的版本号数组（最新版本在前）
+ *
+ * @example
+ * sortVersions(["1.0.0", "2.1.0", "1.5.0"])  // ["2.1.0", "1.5.0", "1.0.0"]
+ */
+export function sortVersions(versions) {
+    return versions.slice().sort(semver.rcompare);
+}
+//# sourceMappingURL=version-utils.js.map

package/dist/src/package/version-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"version-utils.js","sourceRoot":"","sources":["../../../src/package/version-utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,MAAM,MAAM,QAAQ,CAAC;AAE5B;;;;;;;;;GASG;AACH,MAAM,UAAU,YAAY,CAAC,OAAe;IAC1C,OAAO,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,SAAS,CAAC,OAAe,EAAE,UAAkB;IAC3D,OAAO,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;AAC/C,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,aAAa,CAAC,QAAkB,EAAE,UAAkB;IAClE,OAAO,MAAM,CAAC,aAAa,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;AACpD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAC,QAAkB;IAC7C,OAAO,QAAQ,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AAChD,CAAC"}

package/dist/src/parser/constraint-parser.d.ts

@@ -0,0 +1,42 @@
+/**
+ * CNL 约束解析器
+ *
+ * 解析 CNL 约束语法，替代原有的注解解析器。
+ *
+ * 支持的约束语法：
+ * - `required` - 必填约束
+ * - `between X and Y` - 范围约束（同时指定最小和最大值）
+ * - `at least X` - 最小值约束
+ * - `at most Y` - 最大值约束
+ * - `matching pattern "..."` 或 `matching "..."` - 正则模式约束
+ *
+ * 多个约束可以通过 `and` 或逗号连接：
+ * - `username: Text required matching "^[a-z]+$"`
+ * - `age: Int between 18 and 120`
+ */
+import type { Constraint, Span, Token } from '../types.js';
+import type { ParserContext } from './context.js';
+/**
+ * 解析约束列表
+ *
+ * 在类型之后解析可选的约束列表，直到遇到字段分隔符（逗号、and）或语句终止符。
+ *
+ * @param ctx 解析器上下文
+ * @param error 错误报告函数
+ * @returns 约束数组和第一个约束的 token（用于 span 计算）
+ */
+export interface ParsedConstraints {
+    readonly constraints: readonly Constraint[];
+    readonly lastToken?: Token;
+}
+export declare function parseConstraints(ctx: ParserContext, error: (msg: string, tok?: Token) => never): ParsedConstraints;
+/**
+ * 将旧的 Annotation 转换为新的 Constraint（用于迁移）
+ *
+ * @deprecated 仅用于迁移期间的兼容性
+ */
+export declare function annotationToConstraint(annotation: {
+    name: string;
+    params: ReadonlyMap<string, unknown>;
+}, span: Span): Constraint | null;
+//# sourceMappingURL=constraint-parser.d.ts.map

package/dist/src/parser/constraint-parser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constraint-parser.d.ts","sourceRoot":"","sources":["../../../src/parser/constraint-parser.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAGH,OAAO,KAAK,EAAE,UAAU,EAA0D,IAAI,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AACnH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAElD;;;;;;;;GAQG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,WAAW,EAAE,SAAS,UAAU,EAAE,CAAC;IAC5C,QAAQ,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC;CAC5B;AAED,wBAAgB,gBAAgB,CAC9B,GAAG,EAAE,aAAa,EAClB,KAAK,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,KAAK,KAAK,KAAK,GACzC,iBAAiB,CA2BnB;AAqKD;;;;GAIG;AACH,wBAAgB,sBAAsB,CACpC,UAAU,EAAE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CAAE,EAClE,IAAI,EAAE,IAAI,GACT,UAAU,GAAG,IAAI,CAuBnB"}

package/dist/src/parser/constraint-parser.js

@@ -0,0 +1,192 @@
+/**
+ * CNL 约束解析器
+ *
+ * 解析 CNL 约束语法，替代原有的注解解析器。
+ *
+ * 支持的约束语法：
+ * - `required` - 必填约束
+ * - `between X and Y` - 范围约束（同时指定最小和最大值）
+ * - `at least X` - 最小值约束
+ * - `at most Y` - 最大值约束
+ * - `matching pattern "..."` 或 `matching "..."` - 正则模式约束
+ *
+ * 多个约束可以通过 `and` 或逗号连接：
+ * - `username: Text required matching "^[a-z]+$"`
+ * - `age: Int between 18 and 120`
+ */
+import { KW, TokenKind } from '../frontend/tokens.js';
+export function parseConstraints(ctx, error) {
+    const constraints = [];
+    let lastToken;
+    while (true) {
+        const constraint = tryParseConstraint(ctx, error);
+        if (!constraint) {
+            break;
+        }
+        constraints.push(constraint.constraint);
+        lastToken = constraint.endToken;
+        // 检查是否有 'and' 连接更多约束（仅在约束之间）
+        // 注意：不要消费字段之间的 'and'
+        if (isConstraintKeyword(ctx)) {
+            // 有更多约束，继续循环
+            continue;
+        }
+        break;
+    }
+    // 使用条件扩展确保 exactOptionalPropertyTypes 兼容
+    return lastToken !== undefined
+        ? { constraints, lastToken }
+        : { constraints };
+}
+/**
+ * 检查当前位置是否是约束关键词
+ */
+function isConstraintKeyword(ctx) {
+    if (!ctx.at(TokenKind.IDENT)) {
+        return false;
+    }
+    const value = (ctx.peek().value || '').toLowerCase();
+    return (value === KW.REQUIRED ||
+        value === KW.BETWEEN ||
+        value === KW.MATCHING ||
+        value === 'at' // 用于 'at least' / 'at most'
+    );
+}
+/**
+ * 尝试解析单个约束
+ *
+ * @returns 解析的约束，如果当前位置不是约束则返回 null
+ */
+function tryParseConstraint(ctx, error) {
+    if (!ctx.at(TokenKind.IDENT)) {
+        return null;
+    }
+    const value = (ctx.peek().value || '').toLowerCase();
+    // 'required' - 必填约束
+    if (value === KW.REQUIRED) {
+        const startTok = ctx.next();
+        const span = { start: startTok.start, end: startTok.end };
+        const constraint = { kind: 'Required', span };
+        return { constraint, endToken: startTok };
+    }
+    // 'between X and Y' - 范围约束
+    if (value === KW.BETWEEN) {
+        return parseBetweenConstraint(ctx, error);
+    }
+    // 'at least X' / 'at most Y' - 单边范围约束
+    if (value === 'at') {
+        return parseAtConstraint(ctx, error);
+    }
+    // 'matching [pattern] "..."' - 模式约束
+    if (value === KW.MATCHING) {
+        return parseMatchingConstraint(ctx, error);
+    }
+    return null;
+}
+/**
+ * 解析 'between X and Y' 约束
+ */
+function parseBetweenConstraint(ctx, error) {
+    const startTok = ctx.next(); // consume 'between'
+    // 解析最小值
+    const minTok = ctx.peek();
+    if (!ctx.at(TokenKind.INT) && !ctx.at(TokenKind.FLOAT)) {
+        error("约束 'between' 后需要数值作为最小值", minTok);
+    }
+    const min = ctx.next().value;
+    // 期望 'and'
+    if (!ctx.isKeyword(KW.AND)) {
+        error("约束 'between X' 后需要 'and Y' 指定最大值", ctx.peek());
+    }
+    ctx.nextWord(); // consume 'and'
+    // 解析最大值
+    const maxTok = ctx.peek();
+    if (!ctx.at(TokenKind.INT) && !ctx.at(TokenKind.FLOAT)) {
+        error("约束 'between X and' 后需要数值作为最大值", maxTok);
+    }
+    const max = ctx.next().value;
+    const span = { start: startTok.start, end: maxTok.end };
+    const constraint = { kind: 'Range', min, max, span };
+    return { constraint, endToken: maxTok };
+}
+/**
+ * 解析 'at least X' 或 'at most Y' 约束
+ */
+function parseAtConstraint(ctx, error) {
+    const startTok = ctx.next(); // consume 'at'
+    // 检查是 'least' 还是 'most'
+    const modifierTok = ctx.peek();
+    if (!ctx.at(TokenKind.IDENT)) {
+        error("'at' 后需要 'least' 或 'most'", modifierTok);
+    }
+    const modifier = (modifierTok.value || '').toLowerCase();
+    if (modifier !== 'least' && modifier !== 'most') {
+        error("'at' 后需要 'least' 或 'most'", modifierTok);
+    }
+    ctx.next(); // consume 'least' / 'most'
+    // 解析数值
+    const valueTok = ctx.peek();
+    if (!ctx.at(TokenKind.INT) && !ctx.at(TokenKind.FLOAT)) {
+        error(`约束 'at ${modifier}' 后需要数值`, valueTok);
+    }
+    const value = ctx.next().value;
+    const span = { start: startTok.start, end: valueTok.end };
+    let constraint;
+    if (modifier === 'least') {
+        constraint = { kind: 'Range', min: value, span };
+    }
+    else {
+        constraint = { kind: 'Range', max: value, span };
+    }
+    return { constraint, endToken: valueTok };
+}
+/**
+ * 解析 'matching [pattern] "..."' 约束
+ */
+function parseMatchingConstraint(ctx, error) {
+    const startTok = ctx.next(); // consume 'matching'
+    // 可选的 'pattern' 关键字
+    if (ctx.at(TokenKind.IDENT) && (ctx.peek().value || '').toLowerCase() === KW.PATTERN) {
+        ctx.next(); // consume 'pattern'
+    }
+    // 解析正则表达式字符串
+    const regexpTok = ctx.peek();
+    if (!ctx.at(TokenKind.STRING)) {
+        error("约束 'matching' 后需要正则表达式字符串", regexpTok);
+    }
+    const regexp = ctx.next().value;
+    const span = { start: startTok.start, end: regexpTok.end };
+    const constraint = { kind: 'Pattern', regexp, span };
+    return { constraint, endToken: regexpTok };
+}
+/**
+ * 将旧的 Annotation 转换为新的 Constraint（用于迁移）
+ *
+ * @deprecated 仅用于迁移期间的兼容性
+ */
+export function annotationToConstraint(annotation, span) {
+    switch (annotation.name) {
+        case 'NotEmpty':
+            return { kind: 'Required', span };
+        case 'Range': {
+            const min = annotation.params.get('min');
+            const max = annotation.params.get('max');
+            // 使用条件扩展确保 exactOptionalPropertyTypes 兼容
+            return {
+                kind: 'Range',
+                ...(min !== undefined && { min }),
+                ...(max !== undefined && { max }),
+                span,
+            };
+        }
+        case 'Pattern': {
+            const regexp = annotation.params.get('regexp');
+            if (!regexp)
+                return null;
+            return { kind: 'Pattern', regexp, span };
+        }
+        default:
+            return null;
+    }
+}
+//# sourceMappingURL=constraint-parser.js.map

package/dist/src/parser/constraint-parser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constraint-parser.js","sourceRoot":"","sources":["../../../src/parser/constraint-parser.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAkBtD,MAAM,UAAU,gBAAgB,CAC9B,GAAkB,EAClB,KAA0C;IAE1C,MAAM,WAAW,GAAiB,EAAE,CAAC;IACrC,IAAI,SAA4B,CAAC;IAEjC,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,UAAU,GAAG,kBAAkB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClD,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,MAAM;QACR,CAAC;QAED,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QACxC,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC;QAEhC,6BAA6B;QAC7B,qBAAqB;QACrB,IAAI,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7B,aAAa;YACb,SAAS;QACX,CAAC;QAED,MAAM;IACR,CAAC;IAED,yCAAyC;IACzC,OAAO,SAAS,KAAK,SAAS;QAC5B,CAAC,CAAC,EAAE,WAAW,EAAE,SAAS,EAAE;QAC5B,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAC,GAAkB;IAC7C,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,KAAK,GAAG,CAAE,GAAG,CAAC,IAAI,EAAE,CAAC,KAAgB,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IACjE,OAAO,CACL,KAAK,KAAK,EAAE,CAAC,QAAQ;QACrB,KAAK,KAAK,EAAE,CAAC,OAAO;QACpB,KAAK,KAAK,EAAE,CAAC,QAAQ;QACrB,KAAK,KAAK,IAAI,CAAC,4BAA4B;KAC5C,CAAC;AACJ,CAAC;AAOD;;;;GAIG;AACH,SAAS,kBAAkB,CACzB,GAAkB,EAClB,KAA0C;IAE1C,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,KAAK,GAAG,CAAE,GAAG,CAAC,IAAI,EAAE,CAAC,KAAgB,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IAEjE,oBAAoB;IACpB,IAAI,KAAK,KAAK,EAAE,CAAC,QAAQ,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAS,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE,QAAQ,CAAC,GAAG,EAAE,CAAC;QAChE,MAAM,UAAU,GAAuB,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QAClE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;IAC5C,CAAC;IAED,2BAA2B;IAC3B,IAAI,KAAK,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;QACzB,OAAO,sBAAsB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC5C,CAAC;IAED,sCAAsC;IACtC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACnB,OAAO,iBAAiB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACvC,CAAC;IAED,oCAAoC;IACpC,IAAI,KAAK,KAAK,EAAE,CAAC,QAAQ,EAAE,CAAC;QAC1B,OAAO,uBAAuB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,SAAS,sBAAsB,CAC7B,GAAkB,EAClB,KAA0C;IAE1C,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,oBAAoB;IAEjD,QAAQ;IACR,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QACvD,KAAK,CAAC,yBAAyB,EAAE,MAAM,CAAC,CAAC;IAC3C,CAAC;IACD,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,KAAe,CAAC;IAEvC,WAAW;IACX,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,kCAAkC,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IACxD,CAAC;IACD,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,gBAAgB;IAEhC,QAAQ;IACR,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QACvD,KAAK,CAAC,+BAA+B,EAAE,MAAM,CAAC,CAAC;IACjD,CAAC;IACD,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,KAAe,CAAC;IAEvC,MAAM,IAAI,GAAS,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC;IAC9D,MAAM,UAAU,GAAoB,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;IACtE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;AAC1C,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CACxB,GAAkB,EAClB,KAA0C;IAE1C,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,eAAe;IAE5C,wBAAwB;IACxB,MAAM,WAAW,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAC/B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7B,KAAK,CAAC,2BAA2B,EAAE,WAAW,CAAC,CAAC;IAClD,CAAC;IAED,MAAM,QAAQ,GAAG,CAAE,WAAW,CAAC,KAAgB,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IACrE,IAAI,QAAQ,KAAK,OAAO,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;QAChD,KAAK,CAAC,2BAA2B,EAAE,WAAW,CAAC,CAAC;IAClD,CAAC;IACD,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,2BAA2B;IAEvC,OAAO;IACP,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAC5B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QACvD,KAAK,CAAC,UAAU,QAAQ,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC/C,CAAC;IACD,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,KAAe,CAAC;IAEzC,MAAM,IAAI,GAAS,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE,QAAQ,CAAC,GAAG,EAAE,CAAC;IAEhE,IAAI,UAA2B,CAAC;IAChC,IAAI,QAAQ,KAAK,OAAO,EAAE,CAAC;QACzB,UAAU,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACnD,CAAC;SAAM,CAAC;QACN,UAAU,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACnD,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAC5C,CAAC;AAED;;GAEG;AACH,SAAS,uBAAuB,CAC9B,GAAkB,EAClB,KAA0C;IAE1C,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,qBAAqB;IAElD,oBAAoB;IACpB,IAAI,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAE,GAAG,CAAC,IAAI,EAAE,CAAC,KAAgB,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;QACjG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,oBAAoB;IAClC,CAAC;IAED,aAAa;IACb,MAAM,SAAS,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;QAC9B,KAAK,CAAC,2BAA2B,EAAE,SAAS,CAAC,CAAC;IAChD,CAAC;IACD,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,KAAe,CAAC;IAE1C,MAAM,IAAI,GAAS,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE,SAAS,CAAC,GAAG,EAAE,CAAC;IACjE,MAAM,UAAU,GAAsB,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IACxE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;AAC7C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CACpC,UAAkE,EAClE,IAAU;IAEV,QAAQ,UAAU,CAAC,IAAI,EAAE,CAAC;QACxB,KAAK,UAAU;YACb,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QACpC,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAuB,CAAC;YAC/D,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAuB,CAAC;YAC/D,yCAAyC;YACzC,OAAO;gBACL,IAAI,EAAE,OAAO;gBACb,GAAG,CAAC,GAAG,KAAK,SAAS,IAAI,EAAE,GAAG,EAAE,CAAC;gBACjC,GAAG,CAAC,GAAG,KAAK,SAAS,IAAI,EAAE,GAAG,EAAE,CAAC;gBACjC,IAAI;aACc,CAAC;QACvB,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAW,CAAC;YACzD,IAAI,CAAC,MAAM;gBAAE,OAAO,IAAI,CAAC;YACzB,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QAC3C,CAAC;QACD;YACE,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC"}