@calibrate-ds/core 0.1.0

package/dist/model/resolve-component.js

@@ -0,0 +1,110 @@
+import { createNamingStrategy } from "../mappings/naming-strategy.js";
+/**
+ * Basic Levenshtein distance formula for fuzzy string comparisons implicitly natively handled without bulk deps.
+ */
+function levenshtein(a, b) {
+    const tmp = [];
+    let i, j, alen = a.length, blen = b.length;
+    if (alen === 0)
+        return blen;
+    if (blen === 0)
+        return alen;
+    for (i = 0; i <= alen; i++) {
+        tmp[i] = [i];
+    }
+    for (j = 0; j <= blen; j++) {
+        tmp[0][j] = j;
+    }
+    for (i = 1; i <= alen; i++) {
+        for (j = 1; j <= blen; j++) {
+            tmp[i][j] = Math.min(tmp[i - 1][j] + 1, tmp[i][j - 1] + 1, tmp[i - 1][j - 1] + (a[i - 1] === b[j - 1] ? 0 : 1));
+        }
+    }
+    return tmp[alen][blen];
+}
+/**
+ * Cleans user queries removing trailing extensions or structural paths naturally.
+ */
+function stripExtensionsAndPaths(query) {
+    let clean = query.replace(/\\/g, "/"); // normalize Windows paths
+    // Extract base filename if it looks like a path
+    if (clean.includes("/")) {
+        const parts = clean.split("/");
+        clean = parts[parts.length - 1];
+    }
+    // Remove typical extensions
+    clean = clean.replace(/\.tsx$/, "")
+        .replace(/\.ts$/, "")
+        .replace(/\.jsx$/, "")
+        .replace(/\.js$/, "")
+        .replace(/\.types$/, "")
+        .replace(/^index$/, ""); // ignore "index.ts" purely natively
+    return clean.trim();
+}
+/**
+ * Resolves a human-entered component query against canonical design system models safely matching multiple formats cleanly.
+ */
+export function resolveComponent(query, components, config) {
+    const cleanQuery = query.trim();
+    const queryLower = cleanQuery.toLowerCase();
+    const namingStrategy = createNamingStrategy(config.naming);
+    // 1. Direct Literal Matching natively mapping normalized PTB constraints
+    for (const c of components) {
+        if (c.name.trim().toLowerCase() === queryLower) {
+            return { exactMatch: c, suggestions: [] };
+        }
+    }
+    // Prepare structural variations per component representing potential query targets
+    const componentSearchVariants = components.map(c => {
+        const componentName = namingStrategy.formatComponentName(c.name);
+        const folderName = namingStrategy.formatFolderName(c.name);
+        let categoryFolder = "";
+        if (c.categoryPath) {
+            categoryFolder = namingStrategy.formatFolderName(c.categoryPath);
+        }
+        const fullPath = categoryFolder ? `${categoryFolder}/${folderName}` : folderName;
+        return {
+            component: c,
+            searchVariants: [
+                c.name.toLowerCase(), // "notification popup"
+                c.name.replace(/\s+/g, "").toLowerCase(), // "notificationpopup"
+                componentName.toLowerCase(), // "notificationpopup" (Pascal mapped)
+                folderName.toLowerCase(), // "notification-popup"
+                fullPath.toLowerCase() // "overlays/notification-popup"
+            ],
+            displaySuggestion: componentName // Native format for "Did you mean: X"
+        };
+    });
+    // 2. Formatted Exact Matching (e.g., PascalCase, folder-name, file-name)
+    const strippedQueryLower = stripExtensionsAndPaths(queryLower);
+    // Check if stripped target matches any known literal outputs
+    for (const v of componentSearchVariants) {
+        if (v.searchVariants.includes(queryLower) || (strippedQueryLower && v.searchVariants.includes(strippedQueryLower))) {
+            return { exactMatch: v.component, suggestions: [] };
+        }
+    }
+    // 3. Fuzzy Matching Fallback resolving Levenshtein distances dynamically predicting targets natively.
+    // Calculate distances across all components and rank them
+    const distances = [];
+    for (const v of componentSearchVariants) {
+        let bestDistance = Infinity;
+        // Find the lowest distance among all search variants for this component
+        for (const variantStr of v.searchVariants) {
+            const dist = levenshtein(strippedQueryLower || queryLower, variantStr);
+            if (dist < bestDistance) {
+                bestDistance = dist;
+            }
+        }
+        // Record the best fuzzy score
+        distances.push({ name: v.displaySuggestion, distance: bestDistance });
+    }
+    // Sort by shortest functional distance natively mapping top 5 closest
+    distances.sort((a, b) => a.distance - b.distance);
+    const maxSuggestions = 5;
+    const topSuggestions = distances.slice(0, maxSuggestions).map(d => d.name);
+    return {
+        exactMatch: null,
+        suggestions: topSuggestions
+    };
+}
+//# sourceMappingURL=resolve-component.js.map

package/dist/model/resolve-component.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolve-component.js","sourceRoot":"","sources":["../../src/model/resolve-component.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,oBAAoB,EAAE,MAAM,gCAAgC,CAAC;AAOtE;;GAEG;AACH,SAAS,WAAW,CAAC,CAAS,EAAE,CAAS;IACrC,MAAM,GAAG,GAAG,EAAE,CAAC;IACf,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;IAC3C,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5B,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5B,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAChB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EACjB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EACjB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACtD,CAAC;QACN,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;AAC3B,CAAC;AAED;;GAEG;AACH,SAAS,uBAAuB,CAAC,KAAa;IAC1C,IAAI,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,0BAA0B;IACjE,gDAAgD;IAChD,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC/B,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,4BAA4B;IAC5B,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC;SACrB,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;SACpB,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC;SACrB,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;SACpB,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;SACvB,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC,oCAAoC;IAE1E,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa,EAAE,UAAiC,EAAE,MAAiB;IAChG,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAChC,MAAM,UAAU,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;IAE5C,MAAM,cAAc,GAAG,oBAAoB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAE3D,yEAAyE;IACzE,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,KAAK,UAAU,EAAE,CAAC;YAC7C,OAAO,EAAE,UAAU,EAAE,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;QAC9C,CAAC;IACL,CAAC;IAED,mFAAmF;IACnF,MAAM,uBAAuB,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;QAC/C,MAAM,aAAa,GAAG,cAAc,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACjE,MAAM,UAAU,GAAG,cAAc,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC3D,IAAI,cAAc,GAAG,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;YACjB,cAAc,GAAG,cAAc,CAAC,gBAAgB,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QACrE,CAAC;QAED,MAAM,QAAQ,GAAG,cAAc,CAAC,CAAC,CAAC,GAAG,cAAc,IAAI,UAAU,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC;QAEjF,OAAO;YACH,SAAS,EAAE,CAAC;YACZ,cAAc,EAAE;gBACZ,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,EAA0B,uBAAuB;gBACrE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,EAAM,sBAAsB;gBACpE,aAAa,CAAC,WAAW,EAAE,EAAmB,sCAAsC;gBACpF,UAAU,CAAC,WAAW,EAAE,EAAsB,uBAAuB;gBACrE,QAAQ,CAAC,WAAW,EAAE,CAAwB,gCAAgC;aACjF;YACD,iBAAiB,EAAE,aAAa,CAAC,sCAAsC;SAC1E,CAAC;IACN,CAAC,CAAC,CAAC;IAEH,yEAAyE;IACzE,MAAM,kBAAkB,GAAG,uBAAuB,CAAC,UAAU,CAAC,CAAC;IAE/D,6DAA6D;IAC7D,KAAK,MAAM,CAAC,IAAI,uBAAuB,EAAE,CAAC;QACtC,IAAI,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,kBAAkB,IAAI,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC;YACjH,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC,SAAS,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;QACxD,CAAC;IACL,CAAC;IAED,sGAAsG;IACtG,0DAA0D;IAC1D,MAAM,SAAS,GAA8C,EAAE,CAAC;IAEhE,KAAK,MAAM,CAAC,IAAI,uBAAuB,EAAE,CAAC;QACtC,IAAI,YAAY,GAAG,QAAQ,CAAC;QAE5B,wEAAwE;QACxE,KAAK,MAAM,UAAU,IAAI,CAAC,CAAC,cAAc,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,WAAW,CAAC,kBAAkB,IAAI,UAAU,EAAE,UAAU,CAAC,CAAC;YACvE,IAAI,IAAI,GAAG,YAAY,EAAE,CAAC;gBACtB,YAAY,GAAG,IAAI,CAAC;YACxB,CAAC;QACL,CAAC;QAED,8BAA8B;QAC9B,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,iBAAiB,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC,CAAC;IAC1E,CAAC;IAED,sEAAsE;IACtE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAElD,MAAM,cAAc,GAAG,CAAC,CAAC;IACzB,MAAM,cAAc,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAE3E,OAAO;QACH,UAAU,EAAE,IAAI;QAChB,WAAW,EAAE,cAAc;KAC9B,CAAC;AACN,CAAC"}

package/dist/normalizer/classify-entities.d.ts

@@ -0,0 +1,12 @@
+import type { RawScanResult } from "../scanner/types.js";
+import type { ClassificationResult } from "./types.js";
+/**
+ * Categorizes raw component nodes into Canonical Components vs. Composites.
+ *
+ * Heuristics:
+ * 1. Component Sets are always Canonical.
+ * 2. Standalone components with INSTANCE children are Composites.
+ * 3. Standalone components without INSTANCE children are Canonical.
+ */
+export declare function classifyEntities(scanResult: RawScanResult): ClassificationResult;
+//# sourceMappingURL=classify-entities.d.ts.map

package/dist/normalizer/classify-entities.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"classify-entities.d.ts","sourceRoot":"","sources":["../../src/normalizer/classify-entities.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAqC,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAC5F,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAC;AAEvD;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,aAAa,GAAG,oBAAoB,CA8ChF"}

package/dist/normalizer/classify-entities.js

@@ -0,0 +1,62 @@
+/**
+ * Categorizes raw component nodes into Canonical Components vs. Composites.
+ *
+ * Heuristics:
+ * 1. Component Sets are always Canonical.
+ * 2. Standalone components with INSTANCE children are Composites.
+ * 3. Standalone components without INSTANCE children are Canonical.
+ */
+export function classifyEntities(scanResult) {
+    const canonicalComponents = [];
+    const compositeCandidates = [];
+    // All component sets are canonical
+    for (const set of scanResult.componentSets) {
+        canonicalComponents.push(set);
+    }
+    // Check standalone components
+    for (const comp of scanResult.components) {
+        // 1. Structural rule: Check componentSetId directly or via ancestors safely
+        const setAncestor = comp.context?.ancestors?.find(a => a.type === "COMPONENT_SET");
+        if (comp.componentSetId || setAncestor) {
+            continue;
+        }
+        // 2. Secondary defensive filter: Backup safety rule based on typical variant names 
+        // If it somehow broke out of a set but bears a variant name
+        const lowerName = comp.name.toLowerCase();
+        const isSuspiciousVariant = comp.name.includes("=") ||
+            lowerName.startsWith("property-") ||
+            lowerName.startsWith("property ") ||
+            lowerName.startsWith("state-") ||
+            lowerName.startsWith("state ") ||
+            lowerName.startsWith("variant");
+        // If it's suspiciously named AND has structural context hinting it's a property, drop it
+        if (isSuspiciousVariant && (comp.name.includes(",") || comp.name.includes("="))) {
+            continue;
+        }
+        // Heuristic: Does it contain instances?
+        const hasInstances = hasNestedInstances(comp);
+        if (hasInstances) {
+            compositeCandidates.push(comp);
+        }
+        else {
+            canonicalComponents.push(comp);
+        }
+    }
+    return {
+        canonicalComponents,
+        compositeCandidates,
+    };
+}
+// Helper to check for nested instances traversing child nodes
+function hasNestedInstances(node) {
+    if (!node || !node.children)
+        return false;
+    for (const child of node.children) {
+        if (child.type === "INSTANCE")
+            return true;
+        if (hasNestedInstances(child))
+            return true;
+    }
+    return false;
+}
+//# sourceMappingURL=classify-entities.js.map

package/dist/normalizer/classify-entities.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"classify-entities.js","sourceRoot":"","sources":["../../src/normalizer/classify-entities.ts"],"names":[],"mappings":"AAGA;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,UAAyB;IACtD,MAAM,mBAAmB,GAA2C,EAAE,CAAC;IACvE,MAAM,mBAAmB,GAAuB,EAAE,CAAC;IAEnD,mCAAmC;IACnC,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,aAAa,EAAE,CAAC;QACzC,mBAAmB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED,8BAA8B;IAC9B,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,UAAU,EAAE,CAAC;QACvC,4EAA4E;QAC5E,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,eAAe,CAAC,CAAC;QACnF,IAAI,IAAI,CAAC,cAAc,IAAI,WAAW,EAAE,CAAC;YACrC,SAAS;QACb,CAAC;QAED,oFAAoF;QACpF,4DAA4D;QAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QAC1C,MAAM,mBAAmB,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;YAC/C,SAAS,CAAC,UAAU,CAAC,WAAW,CAAC;YACjC,SAAS,CAAC,UAAU,CAAC,WAAW,CAAC;YACjC,SAAS,CAAC,UAAU,CAAC,QAAQ,CAAC;YAC9B,SAAS,CAAC,UAAU,CAAC,QAAQ,CAAC;YAC9B,SAAS,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAEpC,yFAAyF;QACzF,IAAI,mBAAmB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC9E,SAAS;QACb,CAAC;QAED,wCAAwC;QACxC,MAAM,YAAY,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;QAE9C,IAAI,YAAY,EAAE,CAAC;YACf,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC;aAAM,CAAC;YACJ,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC;IACL,CAAC;IAED,OAAO;QACH,mBAAmB;QACnB,mBAAmB;KACtB,CAAC;AACN,CAAC;AAED,8DAA8D;AAC9D,SAAS,kBAAkB,CAAC,IAAS;IACjC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ;QAAE,OAAO,KAAK,CAAC;IAE1C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU;YAAE,OAAO,IAAI,CAAC;QAC3C,IAAI,kBAAkB,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;IAC/C,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC"}

package/dist/normalizer/helpers.d.ts

@@ -0,0 +1,13 @@
+import type { IndexedToken } from "./types.js";
+/**
+ * Converts Figma RGB (0-1) to HEX string.
+ */
+export declare function rgbToHex(r: number, g: number, b: number): string;
+/**
+ * Resolves token metadata (name, CSS variable) from a Figma Variable ID.
+ */
+export declare function resolveTokenInfo(id: string, tokenIndex: Map<string, IndexedToken>): {
+    name: string;
+    cssVar: string;
+} | undefined;
+//# sourceMappingURL=helpers.d.ts.map

package/dist/normalizer/helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.d.ts","sourceRoot":"","sources":["../../src/normalizer/helpers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAG/C;;GAEG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAMhE;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC;;;cAUjF"}

package/dist/normalizer/helpers.js

@@ -0,0 +1,27 @@
+import { getPTBTokenVariableName } from "../tokens/naming.js";
+/**
+ * Converts Figma RGB (0-1) to HEX string.
+ */
+export function rgbToHex(r, g, b) {
+    const toHex = (c) => {
+        const hex = Math.round(c * 255).toString(16);
+        return hex.length === 1 ? "0" + hex : hex;
+    };
+    return `#${toHex(r)}${toHex(g)}${toHex(b)}`.toUpperCase();
+}
+/**
+ * Resolves token metadata (name, CSS variable) from a Figma Variable ID.
+ */
+export function resolveTokenInfo(id, tokenIndex) {
+    if (!id)
+        return undefined;
+    const normalizedId = id.replace(/^VariableID:/i, "");
+    const entry = tokenIndex.get(normalizedId);
+    if (!entry)
+        return undefined;
+    return {
+        name: entry.token.name,
+        cssVar: getPTBTokenVariableName(entry.collection.name, entry.token.name)
+    };
+}
+//# sourceMappingURL=helpers.js.map

package/dist/normalizer/helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.js","sourceRoot":"","sources":["../../src/normalizer/helpers.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,uBAAuB,EAAE,MAAM,qBAAqB,CAAC;AAE9D;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;IACpD,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,EAAE;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC7C,OAAO,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IAC9C,CAAC,CAAC;IACF,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;AAC9D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,EAAU,EAAE,UAAqC;IAC9E,IAAI,CAAC,EAAE;QAAE,OAAO,SAAS,CAAC;IAC1B,MAAM,YAAY,GAAG,EAAE,CAAC,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC;IACrD,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAC3C,IAAI,CAAC,KAAK;QAAE,OAAO,SAAS,CAAC;IAE7B,OAAO;QACH,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI;QACtB,MAAM,EAAE,uBAAuB,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;KAC3E,CAAC;AACN,CAAC"}

package/dist/normalizer/index.d.ts

@@ -0,0 +1,7 @@
+export * from "./types.js";
+export * from "./naming.js";
+export * from "./classify-entities.js";
+export * from "./normalize-components.js";
+export * from "./normalize-composites.js";
+export * from "./normalize-instances.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/normalizer/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,wBAAwB,CAAC;AACvC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,2BAA2B,CAAC;AAC1C,cAAc,0BAA0B,CAAC"}

package/dist/normalizer/index.js

@@ -0,0 +1,7 @@
+export * from "./types.js";
+export * from "./naming.js";
+export * from "./classify-entities.js";
+export * from "./normalize-components.js";
+export * from "./normalize-composites.js";
+export * from "./normalize-instances.js";
+//# sourceMappingURL=index.js.map

package/dist/normalizer/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/normalizer/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,wBAAwB,CAAC;AACvC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,2BAA2B,CAAC;AAC1C,cAAc,0BAA0B,CAAC"}

package/dist/normalizer/instance-resolver.d.ts

@@ -0,0 +1,13 @@
+import { LayoutTreeNode, ResolvedInstanceUsage, ComponentDefinition } from "@calibrate-ds/shared-types";
+import { IndexedToken } from "./types.js";
+/**
+ * Deterministically resolves a usage "recipe" for a nested dependency instance.
+ * This helps downstream AI implementation avoid guessing about slot visibility
+ * and intended visual configuration.
+ */
+export declare function resolveInstanceRecipe(node: LayoutTreeNode, components?: ComponentDefinition[], tokenIndex?: Map<string, IndexedToken>): ResolvedInstanceUsage | undefined;
+/**
+ * Re-resolves all instance recipes in a tree once all component definitions are available.
+ */
+export declare function relinkTreeRecipes(node: LayoutTreeNode, components: ComponentDefinition[], tokenIndex?: Map<string, IndexedToken>): void;
+//# sourceMappingURL=instance-resolver.d.ts.map

package/dist/normalizer/instance-resolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"instance-resolver.d.ts","sourceRoot":"","sources":["../../src/normalizer/instance-resolver.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,qBAAqB,EAAsB,mBAAmB,EAA2L,MAAM,4BAA4B,CAAC;AACrT,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AA4B1C;;;;GAIG;AACH,wBAAgB,qBAAqB,CACjC,IAAI,EAAE,cAAc,EACpB,UAAU,GAAE,mBAAmB,EAAO,EACtC,UAAU,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,GACvC,qBAAqB,GAAG,SAAS,CAsCnC;AA+hBD;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,UAAU,EAAE,mBAAmB,EAAE,EAAE,UAAU,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,QAwBhI"}