vue-html-bridge 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Masato Nagashima
+
+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.

package/README.md

@@ -0,0 +1,60 @@
+# `vue-html-bridge`
+
+The core of [vue-html-bridge](https://github.com/vue-html-bridge/vue-html-bridge):
+parses a Vue 3 Single-File Component template and generates one or more
+concrete, static HTML variants — one per meaningfully distinct combination of
+`v-if`/`v-else`/`v-for`/dynamic-binding outcomes — with source mapping back
+to the original `.vue` file. Any plain HTML validator can then check those
+variants without knowing anything about Vue.
+
+This package has no knowledge of any particular HTML validator, the language
+server, or the CLI. It is a pure "Vue template → static HTML" engine; the
+validation pipeline that consumes its output lives in
+[`@vue-html-bridge/analyzer`](../analyzer).
+
+## Installation
+
+```sh
+npm install vue-html-bridge
+```
+
+Most consumers should not need this package directly — reach for
+`@vue-html-bridge/analyzer`'s `createWorkspaceAnalyzer`/`analyze`, which
+orchestrates generation, validation, and reverse-mapping together. Import
+this package directly only if you are building a new host that needs
+generation without validation.
+
+## Minimal example
+
+```ts
+import { generateVariants, createTypeAnalysisContext } from "vue-html-bridge";
+
+const result = await generateVariants({
+  filename: "/workspace/src/components/Menu.vue",
+  source: await readFile("/workspace/src/components/Menu.vue", "utf8"),
+  typeContext: createTypeAnalysisContext(),
+  signal: new AbortController().signal,
+});
+
+for (const variant of result.variants) {
+  console.log(variant.id, variant.html);
+}
+```
+
+`createTypeAnalysisContext()` gives the generator a thin, caller-owned
+filesystem/TypeScript-project abstraction (ADR-0002) — one instance is meant
+to be created once per workspace root and reused across calls, not recreated
+per file.
+
+## What it does not do
+
+- Run any HTML validator (`@vue-html-bridge/adapter-markuplint` and other
+  adapters implement `@vue-html-bridge/validator-api` for that).
+- Reverse-map validator diagnostics back to source coordinates on its own —
+  it exposes `findSourceOrigins` and `MappingEntry`s for a caller to do that;
+  `@vue-html-bridge/analyzer` is the caller that actually does it.
+- Cache anything across calls, or know about LSP/CLI concerns.
+
+See [`docs/design/packages/core.md`](../../docs/design/packages/core.md) for
+the full design: variant-generation semantics, the Decision Model, and the
+source-mapping contract.

package/dist/expressions.d.ts

@@ -0,0 +1,38 @@
+import ts from "typescript";
+import type { JsonValue } from "./types.js";
+export interface ExpressionEnvironment {
+    resolve(path: string): {
+        found: true;
+        value: JsonValue;
+    } | {
+        found: false;
+    };
+    resolvePredicate(source: string): boolean | undefined;
+}
+export type EvaluationResult = {
+    kind: "known";
+    value: JsonValue | undefined;
+} | {
+    kind: "unknown";
+    reason: string;
+};
+export declare function parseExpression(source: string): ts.Expression | undefined;
+export declare function evaluateExpression(source: string, environment: ExpressionEnvironment): EvaluationResult;
+export declare function referencedPaths(source: string): readonly string[];
+export declare function isSideEffectFreeExpression(source: string): boolean;
+export declare function normalizeExpression(source: string): string;
+/**
+ * Whether `expression` compares `lengthPath` (e.g. "items.length") against a
+ * fixed threshold such that the comparison's TRUE branch is actually
+ * reachable by one of v-for's {0, 1, 2} cardinality exemplars (core.md
+ * §4.5) — each exemplar is a concrete array of that literal size, so e.g.
+ * `items.length === 2` is exactly correct for the 2-item exemplar.
+ *
+ * A bare `v-if="items.length"` is a truthiness check, equivalent to `> 0`.
+ * A "`> 2`-style predicate" (or `>= 3`, `=== 5`, ...) can never be true for
+ * any exemplar we ever generate — correlating it anyway would silently make
+ * it always false and never exercise its true branch at all, so the caller
+ * should fall back to treating it as an independent predicate instead.
+ */
+export declare function lengthComparisonSafety(expression: string, lengthPath: string): "safe" | "unsafe" | "not-a-length-comparison";
+//# sourceMappingURL=expressions.d.ts.map

package/dist/expressions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expressions.d.ts","sourceRoot":"","sources":["../src/expressions.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,YAAY,CAAC;AAC5B,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAE5C,MAAM,WAAW,qBAAqB;IACpC,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG;QAAE,KAAK,EAAE,IAAI,CAAC;QAAC,KAAK,EAAE,SAAS,CAAA;KAAE,GAAG;QAAE,KAAK,EAAE,KAAK,CAAA;KAAE,CAAC;IAC5E,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS,CAAC;CACvD;AAED,MAAM,MAAM,gBAAgB,GACxB;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,SAAS,GAAG,SAAS,CAAA;CAAE,GAC/C;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAExC,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,EAAE,CAAC,UAAU,GAAG,SAAS,CAWzE;AAED,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,qBAAqB,GACjC,gBAAgB,CASlB;AAED,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAWjE;AAED,wBAAgB,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CA0BlE;AAED,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAE1D;AAaD;;;;;;;;;;;;GAYG;AACH,wBAAgB,sBAAsB,CACpC,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,GACjB,MAAM,GAAG,QAAQ,GAAG,yBAAyB,CAgC/C"}

package/dist/expressions.js

@@ -0,0 +1,301 @@
+import ts from "typescript";
+export function parseExpression(source) {
+    const file = ts.createSourceFile("expression.ts", `(${source})`, ts.ScriptTarget.Latest, true, ts.ScriptKind.TSX);
+    const statement = file.statements[0];
+    if (!statement || !ts.isExpressionStatement(statement))
+        return undefined;
+    return unwrap(statement.expression);
+}
+export function evaluateExpression(source, environment) {
+    const expression = parseExpression(source);
+    if (!expression)
+        return { kind: "unknown", reason: "parse-error" };
+    const result = evaluate(expression, environment);
+    if (result.kind === "unknown") {
+        const predicate = environment.resolvePredicate(normalizeExpression(source));
+        if (predicate !== undefined)
+            return { kind: "known", value: predicate };
+    }
+    return result;
+}
+export function referencedPaths(source) {
+    const root = parseExpression(source);
+    if (!root)
+        return [];
+    const paths = new Set();
+    function visit(node) {
+        const path = accessPath(node);
+        if (path && !isPartOfLongerAccess(node))
+            paths.add(path);
+        ts.forEachChild(node, visit);
+    }
+    visit(root);
+    return [...paths].sort();
+}
+export function isSideEffectFreeExpression(source) {
+    const root = parseExpression(source);
+    if (!root)
+        return false;
+    let safe = true;
+    function visit(node) {
+        if (ts.isCallExpression(node) ||
+            ts.isNewExpression(node) ||
+            ts.isAwaitExpression(node) ||
+            ts.isYieldExpression(node) ||
+            ts.isPostfixUnaryExpression(node) ||
+            (ts.isPrefixUnaryExpression(node) &&
+                node.operator !== ts.SyntaxKind.ExclamationToken &&
+                node.operator !== ts.SyntaxKind.PlusToken &&
+                node.operator !== ts.SyntaxKind.MinusToken) ||
+            (ts.isBinaryExpression(node) &&
+                node.operatorToken.kind >= ts.SyntaxKind.FirstAssignment &&
+                node.operatorToken.kind <= ts.SyntaxKind.LastAssignment)) {
+            safe = false;
+            return;
+        }
+        ts.forEachChild(node, visit);
+    }
+    visit(root);
+    return safe;
+}
+export function normalizeExpression(source) {
+    return source.replace(/\s+/g, "").replace(/^!/, (match) => match);
+}
+const LENGTH_COMPARISON_OPERATORS = new Set([
+    ts.SyntaxKind.GreaterThanToken,
+    ts.SyntaxKind.GreaterThanEqualsToken,
+    ts.SyntaxKind.LessThanToken,
+    ts.SyntaxKind.LessThanEqualsToken,
+    ts.SyntaxKind.EqualsEqualsToken,
+    ts.SyntaxKind.EqualsEqualsEqualsToken,
+    ts.SyntaxKind.ExclamationEqualsToken,
+    ts.SyntaxKind.ExclamationEqualsEqualsToken,
+]);
+/**
+ * Whether `expression` compares `lengthPath` (e.g. "items.length") against a
+ * fixed threshold such that the comparison's TRUE branch is actually
+ * reachable by one of v-for's {0, 1, 2} cardinality exemplars (core.md
+ * §4.5) — each exemplar is a concrete array of that literal size, so e.g.
+ * `items.length === 2` is exactly correct for the 2-item exemplar.
+ *
+ * A bare `v-if="items.length"` is a truthiness check, equivalent to `> 0`.
+ * A "`> 2`-style predicate" (or `>= 3`, `=== 5`, ...) can never be true for
+ * any exemplar we ever generate — correlating it anyway would silently make
+ * it always false and never exercise its true branch at all, so the caller
+ * should fall back to treating it as an independent predicate instead.
+ */
+export function lengthComparisonSafety(expression, lengthPath) {
+    const root = parseExpression(expression);
+    if (!root)
+        return "not-a-length-comparison";
+    const normalizedPath = normalizeExpression(lengthPath);
+    if (normalizeExpression(root.getText()) === normalizedPath) {
+        return "safe"; // bare truthiness check, equivalent to "> 0"
+    }
+    if (!ts.isBinaryExpression(root))
+        return "not-a-length-comparison";
+    if (!LENGTH_COMPARISON_OPERATORS.has(root.operatorToken.kind)) {
+        return "not-a-length-comparison";
+    }
+    const { left, right, operatorToken } = root;
+    let threshold;
+    let operator = operatorToken.kind;
+    if (ts.isNumericLiteral(right) &&
+        normalizeExpression(left.getText()) === normalizedPath) {
+        threshold = Number(right.text);
+    }
+    else if (ts.isNumericLiteral(left) &&
+        normalizeExpression(right.getText()) === normalizedPath) {
+        // "2 < items.length" reads right-to-left from the path's perspective —
+        // equivalent to "items.length > 2", so the operator flips.
+        threshold = Number(left.text);
+        operator = flip(operator);
+    }
+    if (threshold === undefined)
+        return "not-a-length-comparison";
+    return trueBranchReachable(operator, threshold) ? "safe" : "unsafe";
+}
+function flip(operator) {
+    switch (operator) {
+        case ts.SyntaxKind.GreaterThanToken:
+            return ts.SyntaxKind.LessThanToken;
+        case ts.SyntaxKind.GreaterThanEqualsToken:
+            return ts.SyntaxKind.LessThanEqualsToken;
+        case ts.SyntaxKind.LessThanToken:
+            return ts.SyntaxKind.GreaterThanToken;
+        case ts.SyntaxKind.LessThanEqualsToken:
+            return ts.SyntaxKind.GreaterThanEqualsToken;
+        default:
+            return operator; // ===/!==/==/!= are symmetric
+    }
+}
+/** Is there some n in {0, 1, 2} for which `n <operator> threshold` is true? */
+function trueBranchReachable(operator, threshold) {
+    switch (operator) {
+        case ts.SyntaxKind.GreaterThanToken:
+            return threshold < 2;
+        case ts.SyntaxKind.GreaterThanEqualsToken:
+            return threshold <= 2;
+        case ts.SyntaxKind.LessThanToken:
+            return threshold > 0;
+        case ts.SyntaxKind.LessThanEqualsToken:
+            return threshold >= 0;
+        case ts.SyntaxKind.EqualsEqualsToken:
+        case ts.SyntaxKind.EqualsEqualsEqualsToken:
+            return threshold >= 0 && threshold <= 2;
+        case ts.SyntaxKind.ExclamationEqualsToken:
+        case ts.SyntaxKind.ExclamationEqualsEqualsToken:
+            return true; // {0,1,2} always has a member other than any single threshold
+        default:
+            return false;
+    }
+}
+function evaluate(node, environment) {
+    node = unwrap(node);
+    if (ts.isStringLiteral(node))
+        return known(node.text);
+    if (ts.isNumericLiteral(node))
+        return known(Number(node.text));
+    if (node.kind === ts.SyntaxKind.TrueKeyword)
+        return known(true);
+    if (node.kind === ts.SyntaxKind.FalseKeyword)
+        return known(false);
+    if (node.kind === ts.SyntaxKind.NullKeyword)
+        return known(null);
+    if (ts.isIdentifier(node) && node.text === "undefined")
+        return known(undefined);
+    const path = accessPath(node);
+    if (path) {
+        const resolved = environment.resolve(path);
+        return resolved.found
+            ? known(resolved.value)
+            : { kind: "unknown", reason: `unresolved:${path}` };
+    }
+    if (ts.isPrefixUnaryExpression(node)) {
+        const operand = evaluate(node.operand, environment);
+        if (operand.kind === "unknown")
+            return operand;
+        if (node.operator === ts.SyntaxKind.ExclamationToken) {
+            return known(!operand.value);
+        }
+        if (node.operator === ts.SyntaxKind.MinusToken &&
+            typeof operand.value === "number") {
+            return known(-operand.value);
+        }
+        if (node.operator === ts.SyntaxKind.PlusToken &&
+            typeof operand.value === "number") {
+            return known(operand.value);
+        }
+        return { kind: "unknown", reason: "unsupported-unary" };
+    }
+    if (ts.isConditionalExpression(node)) {
+        const condition = evaluate(node.condition, environment);
+        if (condition.kind === "unknown")
+            return condition;
+        return evaluate(condition.value ? node.whenTrue : node.whenFalse, environment);
+    }
+    if (ts.isBinaryExpression(node)) {
+        const left = evaluate(node.left, environment);
+        if (left.kind === "unknown")
+            return left;
+        const kind = node.operatorToken.kind;
+        if (kind === ts.SyntaxKind.AmpersandAmpersandToken && !left.value)
+            return left;
+        if (kind === ts.SyntaxKind.BarBarToken && left.value)
+            return left;
+        if (kind === ts.SyntaxKind.QuestionQuestionToken &&
+            left.value !== null &&
+            left.value !== undefined) {
+            return left;
+        }
+        const right = evaluate(node.right, environment);
+        if (right.kind === "unknown")
+            return right;
+        switch (kind) {
+            case ts.SyntaxKind.AmpersandAmpersandToken:
+            case ts.SyntaxKind.BarBarToken:
+            case ts.SyntaxKind.QuestionQuestionToken:
+                return right;
+            case ts.SyntaxKind.EqualsEqualsEqualsToken:
+                return known(left.value === right.value);
+            case ts.SyntaxKind.ExclamationEqualsEqualsToken:
+                return known(left.value !== right.value);
+            case ts.SyntaxKind.EqualsEqualsToken:
+                return known(String(left.value) === String(right.value));
+            case ts.SyntaxKind.ExclamationEqualsToken:
+                return known(String(left.value) !== String(right.value));
+            case ts.SyntaxKind.GreaterThanToken:
+                return known(Number(left.value) > Number(right.value));
+            case ts.SyntaxKind.GreaterThanEqualsToken:
+                return known(Number(left.value) >= Number(right.value));
+            case ts.SyntaxKind.LessThanToken:
+                return known(Number(left.value) < Number(right.value));
+            case ts.SyntaxKind.LessThanEqualsToken:
+                return known(Number(left.value) <= Number(right.value));
+            default:
+                return { kind: "unknown", reason: "unsupported-binary" };
+        }
+    }
+    if (ts.isArrayLiteralExpression(node)) {
+        const values = [];
+        for (const element of node.elements) {
+            const value = evaluate(element, environment);
+            if (value.kind === "unknown" || value.value === undefined)
+                return value;
+            values.push(value.value);
+        }
+        return known(values);
+    }
+    if (ts.isObjectLiteralExpression(node)) {
+        const object = Object.create(null);
+        for (const property of node.properties) {
+            if (!ts.isPropertyAssignment(property)) {
+                return { kind: "unknown", reason: "unsupported-object-member" };
+            }
+            const value = evaluate(property.initializer, environment);
+            if (value.kind === "unknown" || value.value === undefined)
+                return value;
+            object[property.name.getText().replace(/^['"]|['"]$/g, "")] = value.value;
+        }
+        return known(object);
+    }
+    return { kind: "unknown", reason: `unsupported:${ts.SyntaxKind[node.kind]}` };
+}
+function accessPath(node) {
+    if (ts.isIdentifier(node))
+        return node.text;
+    if (ts.isPropertyAccessExpression(node)) {
+        const base = accessPath(node.expression);
+        return base ? `${base}.${node.name.text}` : undefined;
+    }
+    if (ts.isElementAccessExpression(node) && node.argumentExpression) {
+        const base = accessPath(node.expression);
+        const argument = node.argumentExpression;
+        if (!base)
+            return undefined;
+        if (ts.isStringLiteral(argument) || ts.isNumericLiteral(argument)) {
+            return `${base}.${argument.text}`;
+        }
+    }
+    return undefined;
+}
+function isPartOfLongerAccess(node) {
+    return Boolean(node.parent &&
+        ((ts.isPropertyAccessExpression(node.parent) &&
+            node.parent.expression === node) ||
+            (ts.isElementAccessExpression(node.parent) &&
+                node.parent.expression === node)));
+}
+function unwrap(expression) {
+    let current = expression;
+    while (ts.isParenthesizedExpression(current) ||
+        ts.isAsExpression(current) ||
+        ts.isNonNullExpression(current)) {
+        current = current.expression;
+    }
+    return current;
+}
+function known(value) {
+    return { kind: "known", value };
+}
+//# sourceMappingURL=expressions.js.map

package/dist/expressions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"expressions.js","sourceRoot":"","sources":["../src/expressions.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,YAAY,CAAC;AAY5B,MAAM,UAAU,eAAe,CAAC,MAAc;IAC5C,MAAM,IAAI,GAAG,EAAE,CAAC,gBAAgB,CAC9B,eAAe,EACf,IAAI,MAAM,GAAG,EACb,EAAE,CAAC,YAAY,CAAC,MAAM,EACtB,IAAI,EACJ,EAAE,CAAC,UAAU,CAAC,GAAG,CAClB,CAAC;IACF,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACrC,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,CAAC,qBAAqB,CAAC,SAAS,CAAC;QAAE,OAAO,SAAS,CAAC;IACzE,OAAO,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;AACtC,CAAC;AAED,MAAM,UAAU,kBAAkB,CAChC,MAAc,EACd,WAAkC;IAElC,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IAC3C,IAAI,CAAC,UAAU;QAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;IACnE,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;IACjD,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAG,WAAW,CAAC,gBAAgB,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5E,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;IAC1E,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,MAAc;IAC5C,MAAM,IAAI,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IACrC,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IACrB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,SAAS,KAAK,CAAC,IAAa;QAC1B,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,IAAI,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAC;IACZ,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;AAC3B,CAAC;AAED,MAAM,UAAU,0BAA0B,CAAC,MAAc;IACvD,MAAM,IAAI,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IACrC,IAAI,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACxB,IAAI,IAAI,GAAG,IAAI,CAAC;IAChB,SAAS,KAAK,CAAC,IAAa;QAC1B,IACE,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC;YACzB,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC;YACxB,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC;YAC1B,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC;YAC1B,EAAE,CAAC,wBAAwB,CAAC,IAAI,CAAC;YACjC,CAAC,EAAE,CAAC,uBAAuB,CAAC,IAAI,CAAC;gBAC/B,IAAI,CAAC,QAAQ,KAAK,EAAE,CAAC,UAAU,CAAC,gBAAgB;gBAChD,IAAI,CAAC,QAAQ,KAAK,EAAE,CAAC,UAAU,CAAC,SAAS;gBACzC,IAAI,CAAC,QAAQ,KAAK,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC;YAC7C,CAAC,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC;gBAC1B,IAAI,CAAC,aAAa,CAAC,IAAI,IAAI,EAAE,CAAC,UAAU,CAAC,eAAe;gBACxD,IAAI,CAAC,aAAa,CAAC,IAAI,IAAI,EAAE,CAAC,UAAU,CAAC,cAAc,CAAC,EAC1D,CAAC;YACD,IAAI,GAAG,KAAK,CAAC;YACb,OAAO;QACT,CAAC;QACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAC;IACZ,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,MAAc;IAChD,OAAO,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;AACpE,CAAC;AAED,MAAM,2BAA2B,GAAG,IAAI,GAAG,CAAC;IAC1C,EAAE,CAAC,UAAU,CAAC,gBAAgB;IAC9B,EAAE,CAAC,UAAU,CAAC,sBAAsB;IACpC,EAAE,CAAC,UAAU,CAAC,aAAa;IAC3B,EAAE,CAAC,UAAU,CAAC,mBAAmB;IACjC,EAAE,CAAC,UAAU,CAAC,iBAAiB;IAC/B,EAAE,CAAC,UAAU,CAAC,uBAAuB;IACrC,EAAE,CAAC,UAAU,CAAC,sBAAsB;IACpC,EAAE,CAAC,UAAU,CAAC,4BAA4B;CAC3C,CAAC,CAAC;AAEH;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,sBAAsB,CACpC,UAAkB,EAClB,UAAkB;IAElB,MAAM,IAAI,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;IACzC,IAAI,CAAC,IAAI;QAAE,OAAO,yBAAyB,CAAC;IAC5C,MAAM,cAAc,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;IAEvD,IAAI,mBAAmB,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,KAAK,cAAc,EAAE,CAAC;QAC3D,OAAO,MAAM,CAAC,CAAC,6CAA6C;IAC9D,CAAC;IACD,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC;QAAE,OAAO,yBAAyB,CAAC;IACnE,IAAI,CAAC,2BAA2B,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9D,OAAO,yBAAyB,CAAC;IACnC,CAAC;IAED,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,IAAI,CAAC;IAC5C,IAAI,SAA6B,CAAC;IAClC,IAAI,QAAQ,GAAkB,aAAa,CAAC,IAAI,CAAC;IACjD,IACE,EAAE,CAAC,gBAAgB,CAAC,KAAK,CAAC;QAC1B,mBAAmB,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,KAAK,cAAc,EACtD,CAAC;QACD,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;SAAM,IACL,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC;QACzB,mBAAmB,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,KAAK,cAAc,EACvD,CAAC;QACD,uEAAuE;QACvE,2DAA2D;QAC3D,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC5B,CAAC;IACD,IAAI,SAAS,KAAK,SAAS;QAAE,OAAO,yBAAyB,CAAC;IAC9D,OAAO,mBAAmB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;AACtE,CAAC;AAED,SAAS,IAAI,CAAC,QAAuB;IACnC,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,EAAE,CAAC,UAAU,CAAC,gBAAgB;YACjC,OAAO,EAAE,CAAC,UAAU,CAAC,aAAa,CAAC;QACrC,KAAK,EAAE,CAAC,UAAU,CAAC,sBAAsB;YACvC,OAAO,EAAE,CAAC,UAAU,CAAC,mBAAmB,CAAC;QAC3C,KAAK,EAAE,CAAC,UAAU,CAAC,aAAa;YAC9B,OAAO,EAAE,CAAC,UAAU,CAAC,gBAAgB,CAAC;QACxC,KAAK,EAAE,CAAC,UAAU,CAAC,mBAAmB;YACpC,OAAO,EAAE,CAAC,UAAU,CAAC,sBAAsB,CAAC;QAC9C;YACE,OAAO,QAAQ,CAAC,CAAC,8BAA8B;IACnD,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,SAAS,mBAAmB,CAC1B,QAAuB,EACvB,SAAiB;IAEjB,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,EAAE,CAAC,UAAU,CAAC,gBAAgB;YACjC,OAAO,SAAS,GAAG,CAAC,CAAC;QACvB,KAAK,EAAE,CAAC,UAAU,CAAC,sBAAsB;YACvC,OAAO,SAAS,IAAI,CAAC,CAAC;QACxB,KAAK,EAAE,CAAC,UAAU,CAAC,aAAa;YAC9B,OAAO,SAAS,GAAG,CAAC,CAAC;QACvB,KAAK,EAAE,CAAC,UAAU,CAAC,mBAAmB;YACpC,OAAO,SAAS,IAAI,CAAC,CAAC;QACxB,KAAK,EAAE,CAAC,UAAU,CAAC,iBAAiB,CAAC;QACrC,KAAK,EAAE,CAAC,UAAU,CAAC,uBAAuB;YACxC,OAAO,SAAS,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,CAAC;QAC1C,KAAK,EAAE,CAAC,UAAU,CAAC,sBAAsB,CAAC;QAC1C,KAAK,EAAE,CAAC,UAAU,CAAC,4BAA4B;YAC7C,OAAO,IAAI,CAAC,CAAC,8DAA8D;QAC7E;YACE,OAAO,KAAK,CAAC;IACjB,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CACf,IAAmB,EACnB,WAAkC;IAElC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IACpB,IAAI,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/D,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW;QAAE,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC;IAChE,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,YAAY;QAAE,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC;IAClE,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW;QAAE,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC;IAChE,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW;QACpD,OAAO,KAAK,CAAC,SAAS,CAAC,CAAC;IAE1B,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,IAAI,EAAE,CAAC;QACT,MAAM,QAAQ,GAAG,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC3C,OAAO,QAAQ,CAAC,KAAK;YACnB,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC;YACvB,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,cAAc,IAAI,EAAE,EAAE,CAAC;IACxD,CAAC;IAED,IAAI,EAAE,CAAC,uBAAuB,CAAC,IAAI,CAAC,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QACpD,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS;YAAE,OAAO,OAAO,CAAC;QAC/C,IAAI,IAAI,CAAC,QAAQ,KAAK,EAAE,CAAC,UAAU,CAAC,gBAAgB,EAAE,CAAC;YACrD,OAAO,KAAK,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;QACD,IACE,IAAI,CAAC,QAAQ,KAAK,EAAE,CAAC,UAAU,CAAC,UAAU;YAC1C,OAAO,OAAO,CAAC,KAAK,KAAK,QAAQ,EACjC,CAAC;YACD,OAAO,KAAK,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;QACD,IACE,IAAI,CAAC,QAAQ,KAAK,EAAE,CAAC,UAAU,CAAC,SAAS;YACzC,OAAO,OAAO,CAAC,KAAK,KAAK,QAAQ,EACjC,CAAC;YACD,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,mBAAmB,EAAE,CAAC;IAC1D,CAAC;IAED,IAAI,EAAE,CAAC,uBAAuB,CAAC,IAAI,CAAC,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QACxD,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACnD,OAAO,QAAQ,CACb,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,EAChD,WAAW,CACZ,CAAC;IACJ,CAAC;IAED,IAAI,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC9C,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;QACrC,IAAI,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,uBAAuB,IAAI,CAAC,IAAI,CAAC,KAAK;YAC/D,OAAO,IAAI,CAAC;QACd,IAAI,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC;QAClE,IACE,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,qBAAqB;YAC5C,IAAI,CAAC,KAAK,KAAK,IAAI;YACnB,IAAI,CAAC,KAAK,KAAK,SAAS,EACxB,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QAChD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAC3C,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,EAAE,CAAC,UAAU,CAAC,uBAAuB,CAAC;YAC3C,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC;YAC/B,KAAK,EAAE,CAAC,UAAU,CAAC,qBAAqB;gBACtC,OAAO,KAAK,CAAC;YACf,KAAK,EAAE,CAAC,UAAU,CAAC,uBAAuB;gBACxC,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK,CAAC,CAAC;YAC3C,KAAK,EAAE,CAAC,UAAU,CAAC,4BAA4B;gBAC7C,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK,CAAC,CAAC;YAC3C,KAAK,EAAE,CAAC,UAAU,CAAC,iBAAiB;gBAClC,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3D,KAAK,EAAE,CAAC,UAAU,CAAC,sBAAsB;gBACvC,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3D,KAAK,EAAE,CAAC,UAAU,CAAC,gBAAgB;gBACjC,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACzD,KAAK,EAAE,CAAC,UAAU,CAAC,sBAAsB;gBACvC,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YAC1D,KAAK,EAAE,CAAC,UAAU,CAAC,aAAa;gBAC9B,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACzD,KAAK,EAAE,CAAC,UAAU,CAAC,mBAAmB;gBACpC,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YAC1D;gBACE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,oBAAoB,EAAE,CAAC;QAC7D,CAAC;IACH,CAAC;IAED,IAAI,EAAE,CAAC,wBAAwB,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,MAAM,MAAM,GAAgB,EAAE,CAAC;QAC/B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;YAC7C,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YACxE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IAED,IAAI,EAAE,CAAC,yBAAyB,CAAC,IAAI,CAAC,EAAE,CAAC;QACvC,MAAM,MAAM,GAA8B,MAAM,CAAC,MAAM,CAAC,IAAI,CAG3D,CAAC;QACF,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACvC,IAAI,CAAC,EAAE,CAAC,oBAAoB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACvC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,2BAA2B,EAAE,CAAC;YAClE,CAAC;YACD,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;YAC1D,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YACxE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QAC5E,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;AAChF,CAAC;AAED,SAAS,UAAU,CAAC,IAAa;IAC/B,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC;IAC5C,IAAI,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IACxD,CAAC;IACD,IAAI,EAAE,CAAC,yBAAyB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAClE,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC;QACzC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAC5B,IAAI,EAAE,CAAC,eAAe,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClE,OAAO,GAAG,IAAI,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC;QACpC,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAa;IACzC,OAAO,OAAO,CACZ,IAAI,CAAC,MAAM;QACX,CAAC,CAAC,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,MAAM,CAAC;YAC1C,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,IAAI,CAAC;YAChC,CAAC,EAAE,CAAC,yBAAyB,CAAC,IAAI,CAAC,MAAM,CAAC;gBACxC,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,IAAI,CAAC,CAAC,CACtC,CAAC;AACJ,CAAC;AAED,SAAS,MAAM,CAAC,UAAyB;IACvC,IAAI,OAAO,GAAG,UAAU,CAAC;IACzB,OACE,EAAE,CAAC,yBAAyB,CAAC,OAAO,CAAC;QACrC,EAAE,CAAC,cAAc,CAAC,OAAO,CAAC;QAC1B,EAAE,CAAC,mBAAmB,CAAC,OAAO,CAAC,EAC/B,CAAC;QACD,OAAO,GAAG,OAAO,CAAC,UAAU,CAAC;IAC/B,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,KAAK,CAAC,KAA4B;IACzC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AAClC,CAAC"}

package/dist/generate.d.ts

@@ -0,0 +1,5 @@
+import { createTypeAnalysisContext } from "./type-analysis.js";
+import type { GenerateRequest, GenerateResult } from "./types.js";
+export { createTypeAnalysisContext };
+export declare function generateVariants(request: GenerateRequest): Promise<GenerateResult>;
+//# sourceMappingURL=generate.d.ts.map

package/dist/generate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"generate.d.ts","sourceRoot":"","sources":["../src/generate.ts"],"names":[],"mappings":"AAyBA,OAAO,EAEL,yBAAyB,EAE1B,MAAM,oBAAoB,CAAC;AAC5B,OAAO,KAAK,EAGV,eAAe,EACf,cAAc,EAMf,MAAM,YAAY,CAAC;AAEpB,OAAO,EAAE,yBAAyB,EAAE,CAAC;AAyJrC,wBAAsB,gBAAgB,CACpC,OAAO,EAAE,eAAe,GACvB,OAAO,CAAC,cAAc,CAAC,CAoJzB"}