@enterstellar-ai/contracts-shadcn 0.1.0

package/LICENSE

@@ -0,0 +1,196 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship made available under
+      the License, as indicated by a copyright notice that is included in
+      or attached to the work (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and derivative works thereof.
+
+      "Contribution" shall mean, as submitted to the Licensor for inclusion
+      in the Work by the copyright owner or by an individual or Legal Entity
+      authorized to submit on behalf of the copyright owner. For the purposes
+      of this definition, "submitted" means any form of electronic, verbal,
+      or written communication sent to the Licensor or its representatives,
+      including but not limited to communication on electronic mailing lists,
+      source code control systems, and issue tracking systems that are managed
+      by, or on behalf of, the Licensor for the purpose of discussing and
+      improving the Work, but excluding communication that is conspicuously
+      marked or designated in writing by the copyright owner as "Not a
+      Contribution."
+
+      "Contributor" shall mean Licensor and any Legal Entity on behalf of
+      whom a Contribution has been received by the Licensor and included
+      within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by the combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a cross-claim
+      or counterclaim in a lawsuit) alleging that the Work or any
+      Contribution embodied within the Work constitutes direct or contributory
+      patent infringement, then any patent licenses granted to You under
+      this License for that Work shall terminate as of the date such
+      litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or Derivative
+          Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, You must include a readable copy of the
+          attribution notices contained within such NOTICE file, in
+          at least one of the following places: within a NOTICE text
+          file distributed as part of the Derivative Works; within
+          the Source form or documentation, if provided along with the
+          Derivative Works; or, within a display generated by the
+          Derivative Works, if and wherever such third-party notices
+          normally appear. The contents of the NOTICE file are for
+          informational purposes only and do not modify the License.
+          You may add Your own attribution notices within Derivative
+          Works that You distribute, alongside or as an addendum to
+          the NOTICE text from the Work, provided that such additional
+          attribution notices cannot be construed as modifying the
+          License.
+
+      You may add Your own license statement to Your modifications and
+      may provide additional grant of rights to use, copy, modify, merge,
+      publish, distribute, sublicense, and/or sell copies of the
+      Modifications or such Derivative Works, and to permit recipients
+      of the Modifications to such Derivative Works to do so, subject to
+      the terms of the License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or reproducing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or exemplary damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or all other
+      commercial damages or losses), even if such Contributor has been
+      advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may offer such
+      obligations only on Your own behalf and on Your sole responsibility,
+      not on behalf of any other Contributor, and only if You agree to
+      indemnify, defend, and hold each Contributor harmless for any
+      liability incurred by, or claims asserted against, such Contributor
+      by reason of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Do not include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format in question. Please also
+      make a list of the licenses used in the work and ask the
+      maintainers for clarification if needed.
+
+   Copyright 2026 LifeOS Frameworks, Inc. (DBA Enterstellar) and A. Yassin
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,17 @@
+Enterstellar
+Copyright 2026 LifeOS Frameworks, Inc. (DBA Enterstellar) and A. Yassin
+
+This product is licensed under the Apache License, Version 2.0 (the "License").
+You may not use this product except in compliance with the License.
+You may obtain a copy of the License at:
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software distributed
+under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
+CONDITIONS OF ANY KIND, either express or implied. See the License for the
+specific language governing permissions and limitations under the License.
+
+For licensing inquiries, contact: legal@enterstellar.dev
+Homepage: https://enterstellar.dev
+Repository: https://github.com/enterstellar-ai/enterstellar

package/README.md

@@ -0,0 +1,133 @@
+# @enterstellar-ai/contracts-shadcn
+
+> Pre-converted Enterstellar ComponentContracts for [shadcn/ui](https://ui.shadcn.com/) — enabling one-line registration of shadcn components into the Enterstellar GenUI Compiler.
+
+shadcn/ui uses a **code-copy distribution model** — components are copied into the developer's source tree, not installed from npm. This means there is no universal import path that this package can reference directly. Instead, developers provide their local component implementations via `registerShadcnContracts()`.
+
+## Current State
+
+- **Registration logic:** Production-grade with 3-path validation.
+- **Contracts:** Empty. Populated by the CI sync pipeline (`sync-contracts-shadcn.yml`).
+- **Once contracts land**, `registerShadcnContracts()` will validate and pair them with local component implementations via `defineComponent()`.
+
+## Quick Start
+
+```ts
+import { registerShadcnContracts } from '@enterstellar-ai/contracts-shadcn';
+import { createRegistry } from '@enterstellar-ai/registry';
+
+// Import your local shadcn component implementations.
+import { Button } from '@/components/ui/button';
+import { Card } from '@/components/ui/card';
+import { Dialog } from '@/components/ui/dialog';
+
+// Register: pairs your components with Enterstellar contracts.
+const contracts = registerShadcnContracts({ Button, Card, Dialog });
+
+// Include in your Enterstellar registry alongside your own contracts.
+const registry = createRegistry({
+  components: [...myContracts, ...contracts],
+});
+```
+
+## API Reference
+
+### `registerShadcnContracts(components)`
+
+| Parameter    | Type                 | Description                                                                  |
+| :----------- | :------------------- | :--------------------------------------------------------------------------- |
+| `components` | `ShadcnComponentMap` | Map of contract names (PascalCase) to local React component implementations. |
+
+**Returns:** `readonly ComponentContract[]` — validated contracts for `createRegistry()`.
+
+**Throws:**
+
+| Condition                | Error Message                                                                        |
+| :----------------------- | :----------------------------------------------------------------------------------- |
+| Unknown key (typo)       | `'Buttn' is not a known shadcn contract. Did you mean 'Button'?`                     |
+| `undefined`/`null` value | `Component 'Button' was not provided. Run 'npx shadcn@latest add button' to add it.` |
+
+**Warn (console.warn):**
+
+| Condition                  | Message                                                                                     |
+| :------------------------- | :------------------------------------------------------------------------------------------ |
+| Missing key (not provided) | `ShadcnButton: contract registered without renderer. <Zone> will use GenericCard fallback.` |
+
+### `ShadcnComponentMap`
+
+```ts
+type ShadcnComponentMap = Partial<
+  Record<ShadcnContractName, ComponentType<Record<string, unknown>>>
+>;
+```
+
+Keys must match contract names in PascalCase. Missing keys are valid — contracts are registered without renderers, falling back to `GenericCard`. Unknown keys trigger an error with a Levenshtein-based suggestion (distance ≤ 3).
+
+### `SHADCN_CONTRACTS`
+
+```ts
+export const SHADCN_CONTRACTS: Record<string, ComponentContractInput> = {};
+```
+
+Master record of all shadcn/ui component contracts. Empty pre-CI — populated by the sync pipeline. Each key is a PascalCase component name, each value is a `defineComponent()`-compatible input.
+
+### Utilities
+
+| Export                                | Description                                                  |
+| :------------------------------------ | :----------------------------------------------------------- |
+| `levenshteinDistance(a, b)`           | Edit distance between two strings (O(m×n) time, O(n) space). |
+| `findClosestMatch(input, candidates)` | Best match within distance ≤ 3, or `undefined`.              |
+
+## Configuration
+
+No configuration required. This package provides pre-built contracts — no build step, no code generation needed by the consumer.
+
+### Dependencies
+
+| Package                            | Purpose                                                                          |
+| :--------------------------------- | :------------------------------------------------------------------------------- |
+| `@enterstellar-ai/react` (peer)    | Provides `defineComponent()` for contract validation and renderer registration.  |
+| `@enterstellar-ai/registry` (peer) | Provides `defineComponent()` and `ComponentContractInput` for contract creation. |
+| `@enterstellar-ai/types` (peer)    | Provides `ComponentContract` type definition.                                    |
+| `zod` (peer)                       | Runtime schema validation for contract prop types.                               |
+
+> **Note:** There is no `shadcn` peer dependency — shadcn uses a code-copy model. The developer imports their own copied components directly.
+
+## CI Sync Pipeline
+
+The `.github/workflows/sync-contracts-shadcn.yml` workflow defines the contract generation pipeline:
+
+1. `npx shadcn@latest add --all` — fetch latest component source.
+2. `enterstellar migrate` — generate contracts from source.
+3. Diff against published contracts.
+4. Classify changes (minor/major/deprecation).
+5. Open human-gated PR if changes detected.
+
+Schedule: Weekly, Monday 06:00 UTC.
+
+## File Structure
+
+```
+packages/contracts-shadcn/
+├── src/
+│   ├── index.ts                    ← Barrel: public API surface
+│   ├── register.ts                 ← registerShadcnContracts() implementation
+│   ├── contracts/
+│   │   └── index.ts                ← SHADCN_CONTRACTS record (populated by CI)
+│   └── utils/
+│       └── levenshtein.ts          ← Levenshtein distance + closest match
+├── __tests__/
+│   ├── smoke.test.ts               ← Barrel export smoke tests
+│   ├── register.test.ts            ← Registration validation path tests
+│   └── levenshtein.test.ts         ← Edit distance + closest match tests
+├── package.json
+├── tsconfig.json
+├── tsup.config.ts
+└── vitest.config.ts
+```
+
+## See Also
+
+- [Contract Packs Spec](../../archive/ADOPTION/migration/migration-05-contract-packs.md) — Correction 7: contract pack architecture.
+- [Migration Pipeline](../../archive/ADOPTION/migration/migration-01-pipeline.md) — Corrections 1 & 2: the pipeline that generates contracts.
+- [Coding Rules](../../agent/05-enterstellar-coding-rules.md) — naming conventions, strictness requirements.

package/dist/index.cjs

@@ -0,0 +1,127 @@
+'use strict';
+
+var Registry = require('@enterstellar-ai/registry');
+var react = require('@enterstellar-ai/react');
+
+function _interopNamespace(e) {
+  if (e && e.__esModule) return e;
+  var n = Object.create(null);
+  if (e) {
+    Object.keys(e).forEach(function (k) {
+      if (k !== 'default') {
+        var d = Object.getOwnPropertyDescriptor(e, k);
+        Object.defineProperty(n, k, d.get ? d : {
+          enumerable: true,
+          get: function () { return e[k]; }
+        });
+      }
+    });
+  }
+  n.default = e;
+  return Object.freeze(n);
+}
+
+var Registry__namespace = /*#__PURE__*/_interopNamespace(Registry);
+
+// src/register.ts
+
+// src/contracts/index.ts
+var SHADCN_CONTRACTS = {
+  // -------------------------------------------------------------------------
+  // Populated by CI sync pipeline (sync-contracts-shadcn.yml).
+  // Each entry is a defineComponent()-compatible contract input.
+  //
+  // DO NOT add entries manually — they are auto-generated by running
+  // `enterstellar migrate` against upstream shadcn/ui source components.
+  // -------------------------------------------------------------------------
+};
+
+// src/utils/levenshtein.ts
+var MATCH_THRESHOLD = 3;
+function levenshteinDistance(a, b) {
+  if (a === b) {
+    return 0;
+  }
+  const m = a.length;
+  const n = b.length;
+  if (m === 0) {
+    return n;
+  }
+  if (n === 0) {
+    return m;
+  }
+  let prev = Array.from({ length: n + 1 }, (_, j) => j);
+  let curr = new Array(n + 1);
+  for (let i = 1; i <= m; i++) {
+    curr[0] = i;
+    for (let j = 1; j <= n; j++) {
+      const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+      const deletion = (prev[j] ?? 0) + 1;
+      const insertion = (curr[j - 1] ?? 0) + 1;
+      const substitution = (prev[j - 1] ?? 0) + cost;
+      curr[j] = Math.min(deletion, insertion, substitution);
+    }
+    [prev, curr] = [curr, prev];
+  }
+  return prev[n] ?? 0;
+}
+function findClosestMatch(input, candidates) {
+  let bestMatch;
+  let bestDistance = MATCH_THRESHOLD + 1;
+  for (const candidate of candidates) {
+    const distance = levenshteinDistance(input, candidate);
+    if (distance < bestDistance) {
+      bestDistance = distance;
+      bestMatch = candidate;
+    }
+    if (distance === 0) {
+      break;
+    }
+  }
+  return bestDistance <= MATCH_THRESHOLD ? bestMatch : void 0;
+}
+
+// src/register.ts
+function registerShadcnContracts(components) {
+  const contracts = [];
+  const knownNames = Object.keys(SHADCN_CONTRACTS);
+  for (const key of Object.keys(components)) {
+    if (!(key in SHADCN_CONTRACTS)) {
+      const suggestion = findClosestMatch(key, knownNames);
+      const hint = suggestion !== void 0 ? ` Did you mean '${suggestion}'?` : "";
+      throw new Error(
+        `'${key}' is not a known shadcn contract.${hint}`
+      );
+    }
+  }
+  for (const [name, contractInput] of Object.entries(SHADCN_CONTRACTS)) {
+    const typedInput = contractInput;
+    const isProvided = name in components;
+    const component = components[name];
+    if (isProvided && component == null) {
+      throw new Error(
+        `Component '${name}' was not provided (received ${String(component)}). Run 'npx shadcn@latest add ${name.toLowerCase()}' to add it.`
+      );
+    }
+    if (component === void 0) {
+      console.warn(
+        `Shadcn${name}: contract registered without renderer. <Zone> will use GenericCard fallback. Pass ${name} to registerShadcnContracts() to enable full rendering.`
+      );
+      contracts.push(Registry__namespace.defineComponent(typedInput));
+      continue;
+    }
+    const { contract } = react.defineComponent({
+      contract: typedInput,
+      render: component
+    });
+    contracts.push(contract);
+  }
+  return contracts;
+}
+
+exports.SHADCN_CONTRACTS = SHADCN_CONTRACTS;
+exports.findClosestMatch = findClosestMatch;
+exports.levenshteinDistance = levenshteinDistance;
+exports.registerShadcnContracts = registerShadcnContracts;
+//# sourceMappingURL=index.cjs.map
+//# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/contracts/index.ts","../src/utils/levenshtein.ts","../src/register.ts"],"names":["Registry","defineComponent"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoDO,IAAM,gBAAA,GAA2D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQxE;;;AC1BA,IAAM,eAAA,GAAkB,CAAA;AA4BjB,SAAS,mBAAA,CAAoB,GAAW,CAAA,EAAmB;AAE9D,EAAA,IAAI,MAAM,CAAA,EAAG;AACT,IAAA,OAAO,CAAA;AAAA,EACX;AAEA,EAAA,MAAM,IAAI,CAAA,CAAE,MAAA;AACZ,EAAA,MAAM,IAAI,CAAA,CAAE,MAAA;AAGZ,EAAA,IAAI,MAAM,CAAA,EAAG;AACT,IAAA,OAAO,CAAA;AAAA,EACX;AACA,EAAA,IAAI,MAAM,CAAA,EAAG;AACT,IAAA,OAAO,CAAA;AAAA,EACX;AAIA,EAAA,IAAI,IAAA,GAAiB,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,CAAA,GAAI,CAAA,EAAE,EAAG,CAAC,CAAA,EAAG,CAAA,KAAM,CAAC,CAAA;AAC9D,EAAA,IAAI,IAAA,GAAiB,IAAI,KAAA,CAAc,CAAA,GAAI,CAAC,CAAA;AAE5C,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,CAAA,EAAG,CAAA,EAAA,EAAK;AACzB,IAAA,IAAA,CAAK,CAAC,CAAA,GAAI,CAAA;AAEV,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,CAAA,EAAG,CAAA,EAAA,EAAK;AAEzB,MAAA,MAAM,IAAA,GAAO,EAAE,CAAA,GAAI,CAAC,MAAM,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA;AAMzC,MAAA,MAAM,QAAA,GAAA,CAAY,IAAA,CAAK,CAAC,CAAA,IAAK,CAAA,IAAK,CAAA;AAClC,MAAA,MAAM,SAAA,GAAA,CAAa,IAAA,CAAK,CAAA,GAAI,CAAC,KAAK,CAAA,IAAK,CAAA;AACvC,MAAA,MAAM,YAAA,GAAA,CAAgB,IAAA,CAAK,CAAA,GAAI,CAAC,KAAK,CAAA,IAAK,IAAA;AAE1C,MAAA,IAAA,CAAK,CAAC,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,QAAA,EAAU,WAAW,YAAY,CAAA;AAAA,IACxD;AAGA,IAAA,CAAC,IAAA,EAAM,IAAI,CAAA,GAAI,CAAC,MAAM,IAAI,CAAA;AAAA,EAC9B;AAIA,EAAA,OAAO,IAAA,CAAK,CAAC,CAAA,IAAK,CAAA;AACtB;AA+BO,SAAS,gBAAA,CACZ,OACA,UAAA,EACkB;AAClB,EAAA,IAAI,SAAA;AACJ,EAAA,IAAI,eAAe,eAAA,GAAkB,CAAA;AAErC,EAAA,KAAA,MAAW,aAAa,UAAA,EAAY;AAChC,IAAA,MAAM,QAAA,GAAW,mBAAA,CAAoB,KAAA,EAAO,SAAS,CAAA;AAErD,IAAA,IAAI,WAAW,YAAA,EAAc;AACzB,MAAA,YAAA,GAAe,QAAA;AACf,MAAA,SAAA,GAAY,SAAA;AAAA,IAChB;AAGA,IAAA,IAAI,aAAa,CAAA,EAAG;AAChB,MAAA;AAAA,IACJ;AAAA,EACJ;AAGA,EAAA,OAAO,YAAA,IAAgB,kBAAkB,SAAA,GAAY,MAAA;AACzD;;;AC9CO,SAAS,wBACZ,UAAA,EAC4B;AAC5B,EAAA,MAAM,YAAiC,EAAC;AACxC,EAAA,MAAM,UAAA,GAAa,MAAA,CAAO,IAAA,CAAK,gBAAgB,CAAA;AAQ/C,EAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,UAAU,CAAA,EAAG;AACvC,IAAA,IAAI,EAAE,OAAO,gBAAA,CAAA,EAAmB;AAC5B,MAAA,MAAM,UAAA,GAAa,gBAAA,CAAiB,GAAA,EAAK,UAAU,CAAA;AACnD,MAAA,MAAM,IAAA,GAAO,UAAA,KAAe,MAAA,GACtB,CAAA,eAAA,EAAkB,UAAU,CAAA,EAAA,CAAA,GAC5B,EAAA;AACN,MAAA,MAAM,IAAI,KAAA;AAAA,QACN,CAAA,CAAA,EAAI,GAAG,CAAA,iCAAA,EAAoC,IAAI,CAAA;AAAA,OACnD;AAAA,IACJ;AAAA,EACJ;AAKA,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,aAAa,KAAK,MAAA,CAAO,OAAA,CAAQ,gBAAgB,CAAA,EAAG;AAClE,IAAA,MAAM,UAAA,GAAqC,aAAA;AAG3C,IAAA,MAAM,aAAa,IAAA,IAAQ,UAAA;AAC3B,IAAA,MAAM,SAAA,GAAa,WAAkF,IAAI,CAAA;AAMzG,IAAA,IAAI,UAAA,IAAc,aAAa,IAAA,EAAM;AACjC,MAAA,MAAM,IAAI,KAAA;AAAA,QACN,CAAA,WAAA,EAAc,IAAI,CAAA,6BAAA,EAAgC,MAAA,CAAO,SAAS,CAAC,CAAA,8BAAA,EACrC,IAAA,CAAK,WAAA,EAAa,CAAA,YAAA;AAAA,OACpD;AAAA,IACJ;AAMA,IAAA,IAAI,cAAc,MAAA,EAAW;AACzB,MAAA,OAAA,CAAQ,IAAA;AAAA,QACJ,CAAA,MAAA,EAAS,IAAI,CAAA,mFAAA,EAEL,IAAI,CAAA,uDAAA;AAAA,OAChB;AACA,MAAA,SAAA,CAAU,IAAA,CAAcA,mBAAA,CAAA,eAAA,CAAgB,UAAU,CAAC,CAAA;AACnD,MAAA;AAAA,IACJ;AAMA,IAAA,MAAM,EAAE,QAAA,EAAS,GAAIC,qBAAAA,CAAgB;AAAA,MACjC,QAAA,EAAU,UAAA;AAAA,MACV,MAAA,EAAQ;AAAA,KACX,CAAA;AACD,IAAA,SAAA,CAAU,KAAK,QAAQ,CAAA;AAAA,EAC3B;AAEA,EAAA,OAAO,SAAA;AACX","file":"index.cjs","sourcesContent":["/**\n * @module @enterstellar-ai/contracts-shadcn/contracts\n * @description Barrel export for shadcn/ui component contracts.\n *\n * This directory is the target for the CI sync pipeline\n * (`sync-contracts-shadcn.yml`). The pipeline:\n *\n * 1. Scaffolds a temp Next.js project.\n * 2. Runs `npx shadcn@latest add --all` to install all components.\n * 3. Runs `enterstellar migrate` against the installed source files.\n * 4. Copies generated `*.contract.ts` files into this directory.\n * 5. Opens a human-gated PR with the updated contracts.\n *\n * **Pre-CI state:** `SHADCN_CONTRACTS` is an empty record. The type\n * infrastructure is in place so that `registerShadcnContracts()` can\n * operate against the record immediately when contracts arrive.\n *\n * **Post-CI state:** Each CI run adds/updates contract entries like:\n * ```ts\n * export const SHADCN_CONTRACTS = {\n *     Button: { name: 'Button', description: '...', props: z.object({...}), ... },\n *     Card:   { name: 'Card', description: '...', props: z.object({...}), ... },\n *     // ... ~50 components\n * } as const satisfies Record<string, ComponentContractInput>;\n * ```\n *\n * @see Correction 7 Decision 3 — CI Sync Pipeline\n * @see sync-contracts-shadcn.yml — workflow definition\n */\n\nimport type { ComponentContractInput } from '@enterstellar-ai/registry'; // Audit E1: from @enterstellar-ai/registry, NOT @enterstellar-ai/types\n\n// ---------------------------------------------------------------------------\n// Contract Record\n// ---------------------------------------------------------------------------\n\n/**\n * Master record of all shadcn/ui component contracts.\n *\n * **Current state:** Empty. Populated by the CI sync pipeline.\n *\n * Each key is a PascalCase component name (e.g., `'Button'`, `'Card'`).\n * Each value is a `ComponentContractInput` — the input to\n * `defineComponent()` from `@enterstellar-ai/registry`.\n *\n * When contracts exist, this record is used by:\n * - `registerShadcnContracts()` — to validate component maps and pair renderers.\n * - `ShadcnContractName` — derived literal union for type-safe keys.\n *\n * @see registerShadcnContracts — uses this record for validation + pairing\n * @see defineComponent — accepts each value as input\n */\nexport const SHADCN_CONTRACTS: Record<string, ComponentContractInput> = {\n    // -------------------------------------------------------------------------\n    // Populated by CI sync pipeline (sync-contracts-shadcn.yml).\n    // Each entry is a defineComponent()-compatible contract input.\n    //\n    // DO NOT add entries manually — they are auto-generated by running\n    // `enterstellar migrate` against upstream shadcn/ui source components.\n    // -------------------------------------------------------------------------\n};\n\n// ---------------------------------------------------------------------------\n// Derived Types\n// ---------------------------------------------------------------------------\n\n/**\n * Union type of all known shadcn/ui contract names.\n *\n * **Pre-CI:** Resolves to `string` (empty record → `string` keys).\n * **Post-CI:** Resolves to a literal union (e.g., `'Button' | 'Card' | ...`)\n * when the record is populated and typed with `as const satisfies`.\n *\n * Used by `ShadcnComponentMap` to provide compile-time key validation.\n */\nexport type ShadcnContractName = keyof typeof SHADCN_CONTRACTS;\n","/**\n * @module @enterstellar-ai/contracts-shadcn/utils/levenshtein\n * @description Pure-function Levenshtein distance implementation for fuzzy\n * contract name validation.\n *\n * Used by {@link registerShadcnContracts} to provide actionable error\n * messages when a developer passes an unknown component name:\n *\n * ```\n * Error: 'Buttn' is not a known shadcn contract. Did you mean 'Button'?\n * ```\n *\n * **Zero dependencies. Zero framework imports. Pure functions only.**\n *\n * The threshold distance is **3** — any candidate with a distance ≤ 3\n * from the input is considered a viable suggestion. This covers:\n * - 1-char typos (distance 1): `Buttn` → `Button`\n * - Transpositions (distance 2): `Cadr` → `Card`\n * - Prefix/suffix errors (distance 2-3): `Dialg` → `Dialog`\n *\n * @see Correction 7 Decision 2 — fuzzy-validated registration\n */\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\n/**\n * Maximum Levenshtein distance to consider a candidate a valid suggestion.\n *\n * A threshold of 3 covers common typos (single-char, transposition,\n * prefix/suffix) while avoiding false positives on completely unrelated\n * names. Empirically validated against shadcn component names.\n */\nconst MATCH_THRESHOLD = 3;\n\n// ---------------------------------------------------------------------------\n// Levenshtein Distance\n// ---------------------------------------------------------------------------\n\n/**\n * Computes the Levenshtein distance between two strings.\n *\n * The Levenshtein distance is the minimum number of single-character\n * edits (insertions, deletions, or substitutions) required to change\n * one string into the other.\n *\n * Uses the standard O(m×n) dynamic programming algorithm with O(n)\n * space (two-row optimization).\n *\n * @param a - First string.\n * @param b - Second string.\n * @returns The edit distance between `a` and `b`. Always ≥ 0.\n *\n * @example\n * ```ts\n * levenshteinDistance('Button', 'Buttn');  // → 1\n * levenshteinDistance('Card', 'Cadr');     // → 2\n * levenshteinDistance('', 'Hello');        // → 5\n * levenshteinDistance('same', 'same');     // → 0\n * ```\n */\nexport function levenshteinDistance(a: string, b: string): number {\n    // Early exit: identical strings.\n    if (a === b) {\n        return 0;\n    }\n\n    const m = a.length;\n    const n = b.length;\n\n    // Edge cases: one string is empty.\n    if (m === 0) {\n        return n;\n    }\n    if (n === 0) {\n        return m;\n    }\n\n    // Two-row DP: prev = row (i-1), curr = row i.\n    // Each row has (n + 1) entries.\n    let prev: number[] = Array.from({ length: n + 1 }, (_, j) => j);\n    let curr: number[] = new Array<number>(n + 1);\n\n    for (let i = 1; i <= m; i++) {\n        curr[0] = i;\n\n        for (let j = 1; j <= n; j++) {\n            // Cost is 0 if characters match, 1 otherwise.\n            const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n\n            // Minimum of insertion, deletion, or substitution.\n            // prev[j] + 1:       deletion  (remove from a)\n            // (curr[j - 1] ?? 0) + 1: insertion (add to a)\n            // (prev[j - 1] ?? 0) + cost: substitution\n            const deletion = (prev[j] ?? 0) + 1;\n            const insertion = (curr[j - 1] ?? 0) + 1;\n            const substitution = (prev[j - 1] ?? 0) + cost;\n\n            curr[j] = Math.min(deletion, insertion, substitution);\n        }\n\n        // Swap rows: curr becomes prev for next iteration.\n        [prev, curr] = [curr, prev];\n    }\n\n    // After the loop, prev contains the last computed row.\n    // The answer is in prev[n].\n    return prev[n] ?? 0;\n}\n\n// ---------------------------------------------------------------------------\n// Closest Match Finder\n// ---------------------------------------------------------------------------\n\n/**\n * Finds the closest matching string from a list of candidates using\n * Levenshtein distance.\n *\n * Returns the candidate with the smallest distance to `input`, provided\n * that distance is ≤ {@link MATCH_THRESHOLD} (3). If no candidate is\n * within threshold, returns `undefined`.\n *\n * When multiple candidates share the minimum distance, the first one\n * encountered is returned (stable, deterministic ordering).\n *\n * @param input - The string to match against candidates.\n * @param candidates - The list of valid candidate strings.\n * @returns The closest matching candidate, or `undefined` if none\n *   are within the threshold distance.\n *\n * @example\n * ```ts\n * const names = ['Button', 'Card', 'Dialog', 'Input'];\n *\n * findClosestMatch('Buttn', names);   // → 'Button' (distance 1)\n * findClosestMatch('Crad', names);    // → 'Card' (distance 2)\n * findClosestMatch('Xyz', names);     // → undefined (no close match)\n * ```\n */\nexport function findClosestMatch(\n    input: string,\n    candidates: readonly string[],\n): string | undefined {\n    let bestMatch: string | undefined;\n    let bestDistance = MATCH_THRESHOLD + 1; // Start above threshold.\n\n    for (const candidate of candidates) {\n        const distance = levenshteinDistance(input, candidate);\n\n        if (distance < bestDistance) {\n            bestDistance = distance;\n            bestMatch = candidate;\n        }\n\n        // Perfect match — can't do better.\n        if (distance === 0) {\n            break;\n        }\n    }\n\n    // Only return if within threshold.\n    return bestDistance <= MATCH_THRESHOLD ? bestMatch : undefined;\n}\n","/**\n * @module @enterstellar-ai/contracts-shadcn/register\n * @description Registration API for pairing shadcn/ui components with\n * Enterstellar ComponentContracts.\n *\n * shadcn/ui uses a **code-copy distribution model** — components are copied\n * into the developer's source tree (e.g., `@/components/ui/button`), not\n * installed from npm. This means there is no universal import path for\n * shadcn components that this package can reference directly.\n *\n * Instead, the developer provides their local component imports via\n * {@link registerShadcnContracts}:\n *\n * @example\n * ```ts\n * import { registerShadcnContracts } from '@enterstellar-ai/contracts-shadcn';\n * import { Button } from '@/components/ui/button';\n * import { Card } from '@/components/ui/card';\n *\n * const contracts = registerShadcnContracts({ Button, Card });\n * const registry = createRegistry({ components: [...myContracts, ...contracts] });\n * ```\n *\n * ## Validation Rules\n *\n * 1. **Unknown keys** → throw with Levenshtein fuzzy suggestion.\n * 2. **`undefined`/`null` values** → throw with `npx shadcn add` hint.\n * 3. **Missing keys** → `console.warn` with GenericCard fallback message.\n * 4. **Valid components** → `defineComponent()` pairing.\n *\n * @see Correction 7 Decision 2 — Code-Copy Libraries\n * @see Correction 7 Decision 3 — CI Sync Pipeline\n */\n\nimport type { ComponentType } from 'react'; // type-only — erased at compile time (Audit N1)\n\nimport type { ComponentContract } from '@enterstellar-ai/types';\nimport * as Registry from '@enterstellar-ai/registry';             // Audit E2: explicit import\nimport type { ComponentContractInput } from '@enterstellar-ai/registry';   // Audit E1: from @enterstellar-ai/registry, NOT @enterstellar-ai/types\nimport { defineComponent } from '@enterstellar-ai/react';\n\nimport { SHADCN_CONTRACTS } from './contracts/index.js';\nimport type { ShadcnContractName } from './contracts/index.js';\nimport { findClosestMatch } from './utils/levenshtein.js';\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/**\n * Map of component names to React components provided by the developer.\n *\n * Keys must match contract names (PascalCase). Validation rules:\n * - **Unknown keys** throw an `Error` with a Levenshtein-based fuzzy\n *   suggestion (e.g., \"Did you mean 'Button'?\" when given 'Buttn').\n * - **`undefined`/`null` values** throw an `Error` with a\n *   `npx shadcn@latest add` hint for the missing component.\n * - **Missing keys** log `console.warn` — the contract is registered\n *   without a renderer, which falls back to `GenericCard`.\n *\n * Uses `Record<string, unknown>` to match `defineComponent()`'s\n * `TProps extends Record<string, unknown>` constraint (Audit M7).\n *\n * @see Correction 7 Decision 2 — registerShadcnContracts() pairing pattern\n * @see defineComponent — TProps constraint\n */\nexport type ShadcnComponentMap = Partial<\n    Record<ShadcnContractName, ComponentType<Record<string, unknown>>>\n>;\n\n// ---------------------------------------------------------------------------\n// Registration API\n// ---------------------------------------------------------------------------\n\n/**\n * Registers shadcn/ui contracts and pairs them with the developer's\n * local component implementations.\n *\n * **Validation sequence:**\n * 1. Iterate over all keys in the provided `components` map.\n * 2. For each key NOT in `SHADCN_CONTRACTS`, throw with a Levenshtein\n *    fuzzy suggestion (if one exists within distance ≤ 3).\n * 3. Iterate over all entries in `SHADCN_CONTRACTS`:\n *    - If the key was explicitly passed as `undefined` or `null`,\n *      throw with `npx shadcn@latest add <name>` hint.\n *    - If the key was not provided at all, `console.warn` that\n *      GenericCard fallback will be used, and register the contract\n *      without a renderer via `defineComponent()`.\n *    - If the key was provided with a valid component, pair via\n *      `defineComponent()` and collect the validated contract.\n *\n * @param components - Map of contract names to local React components.\n *   Keys must be PascalCase and match known contract names.\n * @returns Readonly array of validated `ComponentContract` objects for\n *   `createRegistry({ components: [...] })`.\n * @throws {Error} If a key doesn't match any known contract\n *   (with Levenshtein-based fuzzy suggestion).\n * @throws {Error} If a component value is explicitly `undefined` or `null`\n *   (with `npx shadcn@latest add` hint).\n *\n * @example\n * ```ts\n * import { registerShadcnContracts } from '@enterstellar-ai/contracts-shadcn';\n * import { Button } from '@/components/ui/button';\n * import { Card } from '@/components/ui/card';\n * import { Dialog } from '@/components/ui/dialog';\n *\n * const contracts = registerShadcnContracts({ Button, Card, Dialog });\n *\n * const registry = createRegistry({\n *     components: [...myContracts, ...contracts],\n * });\n * ```\n *\n * @see Correction 7 Decision 2 — Code-Copy Libraries\n * @see defineComponent — internal pairing mechanism\n */\nexport function registerShadcnContracts(\n    components: ShadcnComponentMap,\n): readonly ComponentContract[] {\n    const contracts: ComponentContract[] = [];\n    const knownNames = Object.keys(SHADCN_CONTRACTS);\n\n    // -------------------------------------------------------------------------\n    // Phase 1: Validate unknown keys (throw with fuzzy suggestion)\n    // -------------------------------------------------------------------------\n    // Check every key the developer provided against the known contract names.\n    // This runs first so the developer gets immediate feedback on typos before\n    // any contracts are registered.\n    for (const key of Object.keys(components)) {\n        if (!(key in SHADCN_CONTRACTS)) {\n            const suggestion = findClosestMatch(key, knownNames);\n            const hint = suggestion !== undefined\n                ? ` Did you mean '${suggestion}'?`\n                : '';\n            throw new Error(\n                `'${key}' is not a known shadcn contract.${hint}`,\n            );\n        }\n    }\n\n    // -------------------------------------------------------------------------\n    // Phase 2: Register each known contract\n    // -------------------------------------------------------------------------\n    for (const [name, contractInput] of Object.entries(SHADCN_CONTRACTS)) {\n        const typedInput: ComponentContractInput = contractInput;\n\n        // Check if the developer provided this key at all.\n        const isProvided = name in components;\n        const component = (components as Record<string, ComponentType<Record<string, unknown>> | undefined>)[name];\n\n        // --- Case: explicitly passed undefined/null ---\n        // The developer listed the key but didn't provide a component.\n        // This is likely a mistake — they intended to provide it but forgot\n        // to install/import it.\n        if (isProvided && component == null) {\n            throw new Error(\n                `Component '${name}' was not provided (received ${String(component)}). ` +\n                `Run 'npx shadcn@latest add ${name.toLowerCase()}' to add it.`,\n            );\n        }\n\n        // --- Case: not provided at all ---\n        // The developer didn't list this key in the map. This is intentional —\n        // they don't have this component installed. Register the contract\n        // without a renderer so GenericCard can fall back.\n        if (component === undefined) {\n            console.warn(\n                `Shadcn${name}: contract registered without renderer. ` +\n                `<Zone> will use GenericCard fallback. ` +\n                `Pass ${name} to registerShadcnContracts() to enable full rendering.`,\n            );\n            contracts.push(Registry.defineComponent(typedInput));\n            continue;\n        }\n\n        // --- Case: provided with a valid component ---\n        // Pair the contract with the developer's local component implementation\n        // via defineComponent(). This validates the contract, freezes it,\n        // and registers the renderer in the module-level RendererRegistry.\n        const { contract } = defineComponent({\n            contract: typedInput,\n            render: component,\n        });\n        contracts.push(contract);\n    }\n\n    return contracts;\n}\n"]}

package/dist/index.d.cts

@@ -0,0 +1,232 @@
+import { ComponentType } from 'react';
+import { ComponentContract } from '@enterstellar-ai/types';
+import { ComponentContractInput } from '@enterstellar-ai/registry';
+
+/**
+ * @module @enterstellar-ai/contracts-shadcn/contracts
+ * @description Barrel export for shadcn/ui component contracts.
+ *
+ * This directory is the target for the CI sync pipeline
+ * (`sync-contracts-shadcn.yml`). The pipeline:
+ *
+ * 1. Scaffolds a temp Next.js project.
+ * 2. Runs `npx shadcn@latest add --all` to install all components.
+ * 3. Runs `enterstellar migrate` against the installed source files.
+ * 4. Copies generated `*.contract.ts` files into this directory.
+ * 5. Opens a human-gated PR with the updated contracts.
+ *
+ * **Pre-CI state:** `SHADCN_CONTRACTS` is an empty record. The type
+ * infrastructure is in place so that `registerShadcnContracts()` can
+ * operate against the record immediately when contracts arrive.
+ *
+ * **Post-CI state:** Each CI run adds/updates contract entries like:
+ * ```ts
+ * export const SHADCN_CONTRACTS = {
+ *     Button: { name: 'Button', description: '...', props: z.object({...}), ... },
+ *     Card:   { name: 'Card', description: '...', props: z.object({...}), ... },
+ *     // ... ~50 components
+ * } as const satisfies Record<string, ComponentContractInput>;
+ * ```
+ *
+ * @see Correction 7 Decision 3 — CI Sync Pipeline
+ * @see sync-contracts-shadcn.yml — workflow definition
+ */
+
+/**
+ * Master record of all shadcn/ui component contracts.
+ *
+ * **Current state:** Empty. Populated by the CI sync pipeline.
+ *
+ * Each key is a PascalCase component name (e.g., `'Button'`, `'Card'`).
+ * Each value is a `ComponentContractInput` — the input to
+ * `defineComponent()` from `@enterstellar-ai/registry`.
+ *
+ * When contracts exist, this record is used by:
+ * - `registerShadcnContracts()` — to validate component maps and pair renderers.
+ * - `ShadcnContractName` — derived literal union for type-safe keys.
+ *
+ * @see registerShadcnContracts — uses this record for validation + pairing
+ * @see defineComponent — accepts each value as input
+ */
+declare const SHADCN_CONTRACTS: Record<string, ComponentContractInput>;
+/**
+ * Union type of all known shadcn/ui contract names.
+ *
+ * **Pre-CI:** Resolves to `string` (empty record → `string` keys).
+ * **Post-CI:** Resolves to a literal union (e.g., `'Button' | 'Card' | ...`)
+ * when the record is populated and typed with `as const satisfies`.
+ *
+ * Used by `ShadcnComponentMap` to provide compile-time key validation.
+ */
+type ShadcnContractName = keyof typeof SHADCN_CONTRACTS;
+
+/**
+ * @module @enterstellar-ai/contracts-shadcn/register
+ * @description Registration API for pairing shadcn/ui components with
+ * Enterstellar ComponentContracts.
+ *
+ * shadcn/ui uses a **code-copy distribution model** — components are copied
+ * into the developer's source tree (e.g., `@/components/ui/button`), not
+ * installed from npm. This means there is no universal import path for
+ * shadcn components that this package can reference directly.
+ *
+ * Instead, the developer provides their local component imports via
+ * {@link registerShadcnContracts}:
+ *
+ * @example
+ * ```ts
+ * import { registerShadcnContracts } from '@enterstellar-ai/contracts-shadcn';
+ * import { Button } from '@/components/ui/button';
+ * import { Card } from '@/components/ui/card';
+ *
+ * const contracts = registerShadcnContracts({ Button, Card });
+ * const registry = createRegistry({ components: [...myContracts, ...contracts] });
+ * ```
+ *
+ * ## Validation Rules
+ *
+ * 1. **Unknown keys** → throw with Levenshtein fuzzy suggestion.
+ * 2. **`undefined`/`null` values** → throw with `npx shadcn add` hint.
+ * 3. **Missing keys** → `console.warn` with GenericCard fallback message.
+ * 4. **Valid components** → `defineComponent()` pairing.
+ *
+ * @see Correction 7 Decision 2 — Code-Copy Libraries
+ * @see Correction 7 Decision 3 — CI Sync Pipeline
+ */
+
+/**
+ * Map of component names to React components provided by the developer.
+ *
+ * Keys must match contract names (PascalCase). Validation rules:
+ * - **Unknown keys** throw an `Error` with a Levenshtein-based fuzzy
+ *   suggestion (e.g., "Did you mean 'Button'?" when given 'Buttn').
+ * - **`undefined`/`null` values** throw an `Error` with a
+ *   `npx shadcn@latest add` hint for the missing component.
+ * - **Missing keys** log `console.warn` — the contract is registered
+ *   without a renderer, which falls back to `GenericCard`.
+ *
+ * Uses `Record<string, unknown>` to match `defineComponent()`'s
+ * `TProps extends Record<string, unknown>` constraint (Audit M7).
+ *
+ * @see Correction 7 Decision 2 — registerShadcnContracts() pairing pattern
+ * @see defineComponent — TProps constraint
+ */
+type ShadcnComponentMap = Partial<Record<ShadcnContractName, ComponentType<Record<string, unknown>>>>;
+/**
+ * Registers shadcn/ui contracts and pairs them with the developer's
+ * local component implementations.
+ *
+ * **Validation sequence:**
+ * 1. Iterate over all keys in the provided `components` map.
+ * 2. For each key NOT in `SHADCN_CONTRACTS`, throw with a Levenshtein
+ *    fuzzy suggestion (if one exists within distance ≤ 3).
+ * 3. Iterate over all entries in `SHADCN_CONTRACTS`:
+ *    - If the key was explicitly passed as `undefined` or `null`,
+ *      throw with `npx shadcn@latest add <name>` hint.
+ *    - If the key was not provided at all, `console.warn` that
+ *      GenericCard fallback will be used, and register the contract
+ *      without a renderer via `defineComponent()`.
+ *    - If the key was provided with a valid component, pair via
+ *      `defineComponent()` and collect the validated contract.
+ *
+ * @param components - Map of contract names to local React components.
+ *   Keys must be PascalCase and match known contract names.
+ * @returns Readonly array of validated `ComponentContract` objects for
+ *   `createRegistry({ components: [...] })`.
+ * @throws {Error} If a key doesn't match any known contract
+ *   (with Levenshtein-based fuzzy suggestion).
+ * @throws {Error} If a component value is explicitly `undefined` or `null`
+ *   (with `npx shadcn@latest add` hint).
+ *
+ * @example
+ * ```ts
+ * import { registerShadcnContracts } from '@enterstellar-ai/contracts-shadcn';
+ * import { Button } from '@/components/ui/button';
+ * import { Card } from '@/components/ui/card';
+ * import { Dialog } from '@/components/ui/dialog';
+ *
+ * const contracts = registerShadcnContracts({ Button, Card, Dialog });
+ *
+ * const registry = createRegistry({
+ *     components: [...myContracts, ...contracts],
+ * });
+ * ```
+ *
+ * @see Correction 7 Decision 2 — Code-Copy Libraries
+ * @see defineComponent — internal pairing mechanism
+ */
+declare function registerShadcnContracts(components: ShadcnComponentMap): readonly ComponentContract[];
+
+/**
+ * @module @enterstellar-ai/contracts-shadcn/utils/levenshtein
+ * @description Pure-function Levenshtein distance implementation for fuzzy
+ * contract name validation.
+ *
+ * Used by {@link registerShadcnContracts} to provide actionable error
+ * messages when a developer passes an unknown component name:
+ *
+ * ```
+ * Error: 'Buttn' is not a known shadcn contract. Did you mean 'Button'?
+ * ```
+ *
+ * **Zero dependencies. Zero framework imports. Pure functions only.**
+ *
+ * The threshold distance is **3** — any candidate with a distance ≤ 3
+ * from the input is considered a viable suggestion. This covers:
+ * - 1-char typos (distance 1): `Buttn` → `Button`
+ * - Transpositions (distance 2): `Cadr` → `Card`
+ * - Prefix/suffix errors (distance 2-3): `Dialg` → `Dialog`
+ *
+ * @see Correction 7 Decision 2 — fuzzy-validated registration
+ */
+/**
+ * Computes the Levenshtein distance between two strings.
+ *
+ * The Levenshtein distance is the minimum number of single-character
+ * edits (insertions, deletions, or substitutions) required to change
+ * one string into the other.
+ *
+ * Uses the standard O(m×n) dynamic programming algorithm with O(n)
+ * space (two-row optimization).
+ *
+ * @param a - First string.
+ * @param b - Second string.
+ * @returns The edit distance between `a` and `b`. Always ≥ 0.
+ *
+ * @example
+ * ```ts
+ * levenshteinDistance('Button', 'Buttn');  // → 1
+ * levenshteinDistance('Card', 'Cadr');     // → 2
+ * levenshteinDistance('', 'Hello');        // → 5
+ * levenshteinDistance('same', 'same');     // → 0
+ * ```
+ */
+declare function levenshteinDistance(a: string, b: string): number;
+/**
+ * Finds the closest matching string from a list of candidates using
+ * Levenshtein distance.
+ *
+ * Returns the candidate with the smallest distance to `input`, provided
+ * that distance is ≤ {@link MATCH_THRESHOLD} (3). If no candidate is
+ * within threshold, returns `undefined`.
+ *
+ * When multiple candidates share the minimum distance, the first one
+ * encountered is returned (stable, deterministic ordering).
+ *
+ * @param input - The string to match against candidates.
+ * @param candidates - The list of valid candidate strings.
+ * @returns The closest matching candidate, or `undefined` if none
+ *   are within the threshold distance.
+ *
+ * @example
+ * ```ts
+ * const names = ['Button', 'Card', 'Dialog', 'Input'];
+ *
+ * findClosestMatch('Buttn', names);   // → 'Button' (distance 1)
+ * findClosestMatch('Crad', names);    // → 'Card' (distance 2)
+ * findClosestMatch('Xyz', names);     // → undefined (no close match)
+ * ```
+ */
+declare function findClosestMatch(input: string, candidates: readonly string[]): string | undefined;
+
+export { SHADCN_CONTRACTS, type ShadcnComponentMap, type ShadcnContractName, findClosestMatch, levenshteinDistance, registerShadcnContracts };

package/dist/index.d.ts

@@ -0,0 +1,232 @@
+import { ComponentType } from 'react';
+import { ComponentContract } from '@enterstellar-ai/types';
+import { ComponentContractInput } from '@enterstellar-ai/registry';
+
+/**
+ * @module @enterstellar-ai/contracts-shadcn/contracts
+ * @description Barrel export for shadcn/ui component contracts.
+ *
+ * This directory is the target for the CI sync pipeline
+ * (`sync-contracts-shadcn.yml`). The pipeline:
+ *
+ * 1. Scaffolds a temp Next.js project.
+ * 2. Runs `npx shadcn@latest add --all` to install all components.
+ * 3. Runs `enterstellar migrate` against the installed source files.
+ * 4. Copies generated `*.contract.ts` files into this directory.
+ * 5. Opens a human-gated PR with the updated contracts.
+ *
+ * **Pre-CI state:** `SHADCN_CONTRACTS` is an empty record. The type
+ * infrastructure is in place so that `registerShadcnContracts()` can
+ * operate against the record immediately when contracts arrive.
+ *
+ * **Post-CI state:** Each CI run adds/updates contract entries like:
+ * ```ts
+ * export const SHADCN_CONTRACTS = {
+ *     Button: { name: 'Button', description: '...', props: z.object({...}), ... },
+ *     Card:   { name: 'Card', description: '...', props: z.object({...}), ... },
+ *     // ... ~50 components
+ * } as const satisfies Record<string, ComponentContractInput>;
+ * ```
+ *
+ * @see Correction 7 Decision 3 — CI Sync Pipeline
+ * @see sync-contracts-shadcn.yml — workflow definition
+ */
+
+/**
+ * Master record of all shadcn/ui component contracts.
+ *
+ * **Current state:** Empty. Populated by the CI sync pipeline.
+ *
+ * Each key is a PascalCase component name (e.g., `'Button'`, `'Card'`).
+ * Each value is a `ComponentContractInput` — the input to
+ * `defineComponent()` from `@enterstellar-ai/registry`.
+ *
+ * When contracts exist, this record is used by:
+ * - `registerShadcnContracts()` — to validate component maps and pair renderers.
+ * - `ShadcnContractName` — derived literal union for type-safe keys.
+ *
+ * @see registerShadcnContracts — uses this record for validation + pairing
+ * @see defineComponent — accepts each value as input
+ */
+declare const SHADCN_CONTRACTS: Record<string, ComponentContractInput>;
+/**
+ * Union type of all known shadcn/ui contract names.
+ *
+ * **Pre-CI:** Resolves to `string` (empty record → `string` keys).
+ * **Post-CI:** Resolves to a literal union (e.g., `'Button' | 'Card' | ...`)
+ * when the record is populated and typed with `as const satisfies`.
+ *
+ * Used by `ShadcnComponentMap` to provide compile-time key validation.
+ */
+type ShadcnContractName = keyof typeof SHADCN_CONTRACTS;
+
+/**
+ * @module @enterstellar-ai/contracts-shadcn/register
+ * @description Registration API for pairing shadcn/ui components with
+ * Enterstellar ComponentContracts.
+ *
+ * shadcn/ui uses a **code-copy distribution model** — components are copied
+ * into the developer's source tree (e.g., `@/components/ui/button`), not
+ * installed from npm. This means there is no universal import path for
+ * shadcn components that this package can reference directly.
+ *
+ * Instead, the developer provides their local component imports via
+ * {@link registerShadcnContracts}:
+ *
+ * @example
+ * ```ts
+ * import { registerShadcnContracts } from '@enterstellar-ai/contracts-shadcn';
+ * import { Button } from '@/components/ui/button';
+ * import { Card } from '@/components/ui/card';
+ *
+ * const contracts = registerShadcnContracts({ Button, Card });
+ * const registry = createRegistry({ components: [...myContracts, ...contracts] });
+ * ```
+ *
+ * ## Validation Rules
+ *
+ * 1. **Unknown keys** → throw with Levenshtein fuzzy suggestion.
+ * 2. **`undefined`/`null` values** → throw with `npx shadcn add` hint.
+ * 3. **Missing keys** → `console.warn` with GenericCard fallback message.
+ * 4. **Valid components** → `defineComponent()` pairing.
+ *
+ * @see Correction 7 Decision 2 — Code-Copy Libraries
+ * @see Correction 7 Decision 3 — CI Sync Pipeline
+ */
+
+/**
+ * Map of component names to React components provided by the developer.
+ *
+ * Keys must match contract names (PascalCase). Validation rules:
+ * - **Unknown keys** throw an `Error` with a Levenshtein-based fuzzy
+ *   suggestion (e.g., "Did you mean 'Button'?" when given 'Buttn').
+ * - **`undefined`/`null` values** throw an `Error` with a
+ *   `npx shadcn@latest add` hint for the missing component.
+ * - **Missing keys** log `console.warn` — the contract is registered
+ *   without a renderer, which falls back to `GenericCard`.
+ *
+ * Uses `Record<string, unknown>` to match `defineComponent()`'s
+ * `TProps extends Record<string, unknown>` constraint (Audit M7).
+ *
+ * @see Correction 7 Decision 2 — registerShadcnContracts() pairing pattern
+ * @see defineComponent — TProps constraint
+ */
+type ShadcnComponentMap = Partial<Record<ShadcnContractName, ComponentType<Record<string, unknown>>>>;
+/**
+ * Registers shadcn/ui contracts and pairs them with the developer's
+ * local component implementations.
+ *
+ * **Validation sequence:**
+ * 1. Iterate over all keys in the provided `components` map.
+ * 2. For each key NOT in `SHADCN_CONTRACTS`, throw with a Levenshtein
+ *    fuzzy suggestion (if one exists within distance ≤ 3).
+ * 3. Iterate over all entries in `SHADCN_CONTRACTS`:
+ *    - If the key was explicitly passed as `undefined` or `null`,
+ *      throw with `npx shadcn@latest add <name>` hint.
+ *    - If the key was not provided at all, `console.warn` that
+ *      GenericCard fallback will be used, and register the contract
+ *      without a renderer via `defineComponent()`.
+ *    - If the key was provided with a valid component, pair via
+ *      `defineComponent()` and collect the validated contract.
+ *
+ * @param components - Map of contract names to local React components.
+ *   Keys must be PascalCase and match known contract names.
+ * @returns Readonly array of validated `ComponentContract` objects for
+ *   `createRegistry({ components: [...] })`.
+ * @throws {Error} If a key doesn't match any known contract
+ *   (with Levenshtein-based fuzzy suggestion).
+ * @throws {Error} If a component value is explicitly `undefined` or `null`
+ *   (with `npx shadcn@latest add` hint).
+ *
+ * @example
+ * ```ts
+ * import { registerShadcnContracts } from '@enterstellar-ai/contracts-shadcn';
+ * import { Button } from '@/components/ui/button';
+ * import { Card } from '@/components/ui/card';
+ * import { Dialog } from '@/components/ui/dialog';
+ *
+ * const contracts = registerShadcnContracts({ Button, Card, Dialog });
+ *
+ * const registry = createRegistry({
+ *     components: [...myContracts, ...contracts],
+ * });
+ * ```
+ *
+ * @see Correction 7 Decision 2 — Code-Copy Libraries
+ * @see defineComponent — internal pairing mechanism
+ */
+declare function registerShadcnContracts(components: ShadcnComponentMap): readonly ComponentContract[];
+
+/**
+ * @module @enterstellar-ai/contracts-shadcn/utils/levenshtein
+ * @description Pure-function Levenshtein distance implementation for fuzzy
+ * contract name validation.
+ *
+ * Used by {@link registerShadcnContracts} to provide actionable error
+ * messages when a developer passes an unknown component name:
+ *
+ * ```
+ * Error: 'Buttn' is not a known shadcn contract. Did you mean 'Button'?
+ * ```
+ *
+ * **Zero dependencies. Zero framework imports. Pure functions only.**
+ *
+ * The threshold distance is **3** — any candidate with a distance ≤ 3
+ * from the input is considered a viable suggestion. This covers:
+ * - 1-char typos (distance 1): `Buttn` → `Button`
+ * - Transpositions (distance 2): `Cadr` → `Card`
+ * - Prefix/suffix errors (distance 2-3): `Dialg` → `Dialog`
+ *
+ * @see Correction 7 Decision 2 — fuzzy-validated registration
+ */
+/**
+ * Computes the Levenshtein distance between two strings.
+ *
+ * The Levenshtein distance is the minimum number of single-character
+ * edits (insertions, deletions, or substitutions) required to change
+ * one string into the other.
+ *
+ * Uses the standard O(m×n) dynamic programming algorithm with O(n)
+ * space (two-row optimization).
+ *
+ * @param a - First string.
+ * @param b - Second string.
+ * @returns The edit distance between `a` and `b`. Always ≥ 0.
+ *
+ * @example
+ * ```ts
+ * levenshteinDistance('Button', 'Buttn');  // → 1
+ * levenshteinDistance('Card', 'Cadr');     // → 2
+ * levenshteinDistance('', 'Hello');        // → 5
+ * levenshteinDistance('same', 'same');     // → 0
+ * ```
+ */
+declare function levenshteinDistance(a: string, b: string): number;
+/**
+ * Finds the closest matching string from a list of candidates using
+ * Levenshtein distance.
+ *
+ * Returns the candidate with the smallest distance to `input`, provided
+ * that distance is ≤ {@link MATCH_THRESHOLD} (3). If no candidate is
+ * within threshold, returns `undefined`.
+ *
+ * When multiple candidates share the minimum distance, the first one
+ * encountered is returned (stable, deterministic ordering).
+ *
+ * @param input - The string to match against candidates.
+ * @param candidates - The list of valid candidate strings.
+ * @returns The closest matching candidate, or `undefined` if none
+ *   are within the threshold distance.
+ *
+ * @example
+ * ```ts
+ * const names = ['Button', 'Card', 'Dialog', 'Input'];
+ *
+ * findClosestMatch('Buttn', names);   // → 'Button' (distance 1)
+ * findClosestMatch('Crad', names);    // → 'Card' (distance 2)
+ * findClosestMatch('Xyz', names);     // → undefined (no close match)
+ * ```
+ */
+declare function findClosestMatch(input: string, candidates: readonly string[]): string | undefined;
+
+export { SHADCN_CONTRACTS, type ShadcnComponentMap, type ShadcnContractName, findClosestMatch, levenshteinDistance, registerShadcnContracts };

package/dist/index.js

@@ -0,0 +1,102 @@
+import * as Registry from '@enterstellar-ai/registry';
+import { defineComponent } from '@enterstellar-ai/react';
+
+// src/register.ts
+
+// src/contracts/index.ts
+var SHADCN_CONTRACTS = {
+  // -------------------------------------------------------------------------
+  // Populated by CI sync pipeline (sync-contracts-shadcn.yml).
+  // Each entry is a defineComponent()-compatible contract input.
+  //
+  // DO NOT add entries manually — they are auto-generated by running
+  // `enterstellar migrate` against upstream shadcn/ui source components.
+  // -------------------------------------------------------------------------
+};
+
+// src/utils/levenshtein.ts
+var MATCH_THRESHOLD = 3;
+function levenshteinDistance(a, b) {
+  if (a === b) {
+    return 0;
+  }
+  const m = a.length;
+  const n = b.length;
+  if (m === 0) {
+    return n;
+  }
+  if (n === 0) {
+    return m;
+  }
+  let prev = Array.from({ length: n + 1 }, (_, j) => j);
+  let curr = new Array(n + 1);
+  for (let i = 1; i <= m; i++) {
+    curr[0] = i;
+    for (let j = 1; j <= n; j++) {
+      const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+      const deletion = (prev[j] ?? 0) + 1;
+      const insertion = (curr[j - 1] ?? 0) + 1;
+      const substitution = (prev[j - 1] ?? 0) + cost;
+      curr[j] = Math.min(deletion, insertion, substitution);
+    }
+    [prev, curr] = [curr, prev];
+  }
+  return prev[n] ?? 0;
+}
+function findClosestMatch(input, candidates) {
+  let bestMatch;
+  let bestDistance = MATCH_THRESHOLD + 1;
+  for (const candidate of candidates) {
+    const distance = levenshteinDistance(input, candidate);
+    if (distance < bestDistance) {
+      bestDistance = distance;
+      bestMatch = candidate;
+    }
+    if (distance === 0) {
+      break;
+    }
+  }
+  return bestDistance <= MATCH_THRESHOLD ? bestMatch : void 0;
+}
+
+// src/register.ts
+function registerShadcnContracts(components) {
+  const contracts = [];
+  const knownNames = Object.keys(SHADCN_CONTRACTS);
+  for (const key of Object.keys(components)) {
+    if (!(key in SHADCN_CONTRACTS)) {
+      const suggestion = findClosestMatch(key, knownNames);
+      const hint = suggestion !== void 0 ? ` Did you mean '${suggestion}'?` : "";
+      throw new Error(
+        `'${key}' is not a known shadcn contract.${hint}`
+      );
+    }
+  }
+  for (const [name, contractInput] of Object.entries(SHADCN_CONTRACTS)) {
+    const typedInput = contractInput;
+    const isProvided = name in components;
+    const component = components[name];
+    if (isProvided && component == null) {
+      throw new Error(
+        `Component '${name}' was not provided (received ${String(component)}). Run 'npx shadcn@latest add ${name.toLowerCase()}' to add it.`
+      );
+    }
+    if (component === void 0) {
+      console.warn(
+        `Shadcn${name}: contract registered without renderer. <Zone> will use GenericCard fallback. Pass ${name} to registerShadcnContracts() to enable full rendering.`
+      );
+      contracts.push(Registry.defineComponent(typedInput));
+      continue;
+    }
+    const { contract } = defineComponent({
+      contract: typedInput,
+      render: component
+    });
+    contracts.push(contract);
+  }
+  return contracts;
+}
+
+export { SHADCN_CONTRACTS, findClosestMatch, levenshteinDistance, registerShadcnContracts };
+//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/contracts/index.ts","../src/utils/levenshtein.ts","../src/register.ts"],"names":["defineComponent"],"mappings":";;;;;;AAoDO,IAAM,gBAAA,GAA2D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQxE;;;AC1BA,IAAM,eAAA,GAAkB,CAAA;AA4BjB,SAAS,mBAAA,CAAoB,GAAW,CAAA,EAAmB;AAE9D,EAAA,IAAI,MAAM,CAAA,EAAG;AACT,IAAA,OAAO,CAAA;AAAA,EACX;AAEA,EAAA,MAAM,IAAI,CAAA,CAAE,MAAA;AACZ,EAAA,MAAM,IAAI,CAAA,CAAE,MAAA;AAGZ,EAAA,IAAI,MAAM,CAAA,EAAG;AACT,IAAA,OAAO,CAAA;AAAA,EACX;AACA,EAAA,IAAI,MAAM,CAAA,EAAG;AACT,IAAA,OAAO,CAAA;AAAA,EACX;AAIA,EAAA,IAAI,IAAA,GAAiB,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,CAAA,GAAI,CAAA,EAAE,EAAG,CAAC,CAAA,EAAG,CAAA,KAAM,CAAC,CAAA;AAC9D,EAAA,IAAI,IAAA,GAAiB,IAAI,KAAA,CAAc,CAAA,GAAI,CAAC,CAAA;AAE5C,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,CAAA,EAAG,CAAA,EAAA,EAAK;AACzB,IAAA,IAAA,CAAK,CAAC,CAAA,GAAI,CAAA;AAEV,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,CAAA,EAAG,CAAA,EAAA,EAAK;AAEzB,MAAA,MAAM,IAAA,GAAO,EAAE,CAAA,GAAI,CAAC,MAAM,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA;AAMzC,MAAA,MAAM,QAAA,GAAA,CAAY,IAAA,CAAK,CAAC,CAAA,IAAK,CAAA,IAAK,CAAA;AAClC,MAAA,MAAM,SAAA,GAAA,CAAa,IAAA,CAAK,CAAA,GAAI,CAAC,KAAK,CAAA,IAAK,CAAA;AACvC,MAAA,MAAM,YAAA,GAAA,CAAgB,IAAA,CAAK,CAAA,GAAI,CAAC,KAAK,CAAA,IAAK,IAAA;AAE1C,MAAA,IAAA,CAAK,CAAC,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,QAAA,EAAU,WAAW,YAAY,CAAA;AAAA,IACxD;AAGA,IAAA,CAAC,IAAA,EAAM,IAAI,CAAA,GAAI,CAAC,MAAM,IAAI,CAAA;AAAA,EAC9B;AAIA,EAAA,OAAO,IAAA,CAAK,CAAC,CAAA,IAAK,CAAA;AACtB;AA+BO,SAAS,gBAAA,CACZ,OACA,UAAA,EACkB;AAClB,EAAA,IAAI,SAAA;AACJ,EAAA,IAAI,eAAe,eAAA,GAAkB,CAAA;AAErC,EAAA,KAAA,MAAW,aAAa,UAAA,EAAY;AAChC,IAAA,MAAM,QAAA,GAAW,mBAAA,CAAoB,KAAA,EAAO,SAAS,CAAA;AAErD,IAAA,IAAI,WAAW,YAAA,EAAc;AACzB,MAAA,YAAA,GAAe,QAAA;AACf,MAAA,SAAA,GAAY,SAAA;AAAA,IAChB;AAGA,IAAA,IAAI,aAAa,CAAA,EAAG;AAChB,MAAA;AAAA,IACJ;AAAA,EACJ;AAGA,EAAA,OAAO,YAAA,IAAgB,kBAAkB,SAAA,GAAY,MAAA;AACzD;;;AC9CO,SAAS,wBACZ,UAAA,EAC4B;AAC5B,EAAA,MAAM,YAAiC,EAAC;AACxC,EAAA,MAAM,UAAA,GAAa,MAAA,CAAO,IAAA,CAAK,gBAAgB,CAAA;AAQ/C,EAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,UAAU,CAAA,EAAG;AACvC,IAAA,IAAI,EAAE,OAAO,gBAAA,CAAA,EAAmB;AAC5B,MAAA,MAAM,UAAA,GAAa,gBAAA,CAAiB,GAAA,EAAK,UAAU,CAAA;AACnD,MAAA,MAAM,IAAA,GAAO,UAAA,KAAe,MAAA,GACtB,CAAA,eAAA,EAAkB,UAAU,CAAA,EAAA,CAAA,GAC5B,EAAA;AACN,MAAA,MAAM,IAAI,KAAA;AAAA,QACN,CAAA,CAAA,EAAI,GAAG,CAAA,iCAAA,EAAoC,IAAI,CAAA;AAAA,OACnD;AAAA,IACJ;AAAA,EACJ;AAKA,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,aAAa,KAAK,MAAA,CAAO,OAAA,CAAQ,gBAAgB,CAAA,EAAG;AAClE,IAAA,MAAM,UAAA,GAAqC,aAAA;AAG3C,IAAA,MAAM,aAAa,IAAA,IAAQ,UAAA;AAC3B,IAAA,MAAM,SAAA,GAAa,WAAkF,IAAI,CAAA;AAMzG,IAAA,IAAI,UAAA,IAAc,aAAa,IAAA,EAAM;AACjC,MAAA,MAAM,IAAI,KAAA;AAAA,QACN,CAAA,WAAA,EAAc,IAAI,CAAA,6BAAA,EAAgC,MAAA,CAAO,SAAS,CAAC,CAAA,8BAAA,EACrC,IAAA,CAAK,WAAA,EAAa,CAAA,YAAA;AAAA,OACpD;AAAA,IACJ;AAMA,IAAA,IAAI,cAAc,MAAA,EAAW;AACzB,MAAA,OAAA,CAAQ,IAAA;AAAA,QACJ,CAAA,MAAA,EAAS,IAAI,CAAA,mFAAA,EAEL,IAAI,CAAA,uDAAA;AAAA,OAChB;AACA,MAAA,SAAA,CAAU,IAAA,CAAc,QAAA,CAAA,eAAA,CAAgB,UAAU,CAAC,CAAA;AACnD,MAAA;AAAA,IACJ;AAMA,IAAA,MAAM,EAAE,QAAA,EAAS,GAAIA,eAAAA,CAAgB;AAAA,MACjC,QAAA,EAAU,UAAA;AAAA,MACV,MAAA,EAAQ;AAAA,KACX,CAAA;AACD,IAAA,SAAA,CAAU,KAAK,QAAQ,CAAA;AAAA,EAC3B;AAEA,EAAA,OAAO,SAAA;AACX","file":"index.js","sourcesContent":["/**\n * @module @enterstellar-ai/contracts-shadcn/contracts\n * @description Barrel export for shadcn/ui component contracts.\n *\n * This directory is the target for the CI sync pipeline\n * (`sync-contracts-shadcn.yml`). The pipeline:\n *\n * 1. Scaffolds a temp Next.js project.\n * 2. Runs `npx shadcn@latest add --all` to install all components.\n * 3. Runs `enterstellar migrate` against the installed source files.\n * 4. Copies generated `*.contract.ts` files into this directory.\n * 5. Opens a human-gated PR with the updated contracts.\n *\n * **Pre-CI state:** `SHADCN_CONTRACTS` is an empty record. The type\n * infrastructure is in place so that `registerShadcnContracts()` can\n * operate against the record immediately when contracts arrive.\n *\n * **Post-CI state:** Each CI run adds/updates contract entries like:\n * ```ts\n * export const SHADCN_CONTRACTS = {\n *     Button: { name: 'Button', description: '...', props: z.object({...}), ... },\n *     Card:   { name: 'Card', description: '...', props: z.object({...}), ... },\n *     // ... ~50 components\n * } as const satisfies Record<string, ComponentContractInput>;\n * ```\n *\n * @see Correction 7 Decision 3 — CI Sync Pipeline\n * @see sync-contracts-shadcn.yml — workflow definition\n */\n\nimport type { ComponentContractInput } from '@enterstellar-ai/registry'; // Audit E1: from @enterstellar-ai/registry, NOT @enterstellar-ai/types\n\n// ---------------------------------------------------------------------------\n// Contract Record\n// ---------------------------------------------------------------------------\n\n/**\n * Master record of all shadcn/ui component contracts.\n *\n * **Current state:** Empty. Populated by the CI sync pipeline.\n *\n * Each key is a PascalCase component name (e.g., `'Button'`, `'Card'`).\n * Each value is a `ComponentContractInput` — the input to\n * `defineComponent()` from `@enterstellar-ai/registry`.\n *\n * When contracts exist, this record is used by:\n * - `registerShadcnContracts()` — to validate component maps and pair renderers.\n * - `ShadcnContractName` — derived literal union for type-safe keys.\n *\n * @see registerShadcnContracts — uses this record for validation + pairing\n * @see defineComponent — accepts each value as input\n */\nexport const SHADCN_CONTRACTS: Record<string, ComponentContractInput> = {\n    // -------------------------------------------------------------------------\n    // Populated by CI sync pipeline (sync-contracts-shadcn.yml).\n    // Each entry is a defineComponent()-compatible contract input.\n    //\n    // DO NOT add entries manually — they are auto-generated by running\n    // `enterstellar migrate` against upstream shadcn/ui source components.\n    // -------------------------------------------------------------------------\n};\n\n// ---------------------------------------------------------------------------\n// Derived Types\n// ---------------------------------------------------------------------------\n\n/**\n * Union type of all known shadcn/ui contract names.\n *\n * **Pre-CI:** Resolves to `string` (empty record → `string` keys).\n * **Post-CI:** Resolves to a literal union (e.g., `'Button' | 'Card' | ...`)\n * when the record is populated and typed with `as const satisfies`.\n *\n * Used by `ShadcnComponentMap` to provide compile-time key validation.\n */\nexport type ShadcnContractName = keyof typeof SHADCN_CONTRACTS;\n","/**\n * @module @enterstellar-ai/contracts-shadcn/utils/levenshtein\n * @description Pure-function Levenshtein distance implementation for fuzzy\n * contract name validation.\n *\n * Used by {@link registerShadcnContracts} to provide actionable error\n * messages when a developer passes an unknown component name:\n *\n * ```\n * Error: 'Buttn' is not a known shadcn contract. Did you mean 'Button'?\n * ```\n *\n * **Zero dependencies. Zero framework imports. Pure functions only.**\n *\n * The threshold distance is **3** — any candidate with a distance ≤ 3\n * from the input is considered a viable suggestion. This covers:\n * - 1-char typos (distance 1): `Buttn` → `Button`\n * - Transpositions (distance 2): `Cadr` → `Card`\n * - Prefix/suffix errors (distance 2-3): `Dialg` → `Dialog`\n *\n * @see Correction 7 Decision 2 — fuzzy-validated registration\n */\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\n/**\n * Maximum Levenshtein distance to consider a candidate a valid suggestion.\n *\n * A threshold of 3 covers common typos (single-char, transposition,\n * prefix/suffix) while avoiding false positives on completely unrelated\n * names. Empirically validated against shadcn component names.\n */\nconst MATCH_THRESHOLD = 3;\n\n// ---------------------------------------------------------------------------\n// Levenshtein Distance\n// ---------------------------------------------------------------------------\n\n/**\n * Computes the Levenshtein distance between two strings.\n *\n * The Levenshtein distance is the minimum number of single-character\n * edits (insertions, deletions, or substitutions) required to change\n * one string into the other.\n *\n * Uses the standard O(m×n) dynamic programming algorithm with O(n)\n * space (two-row optimization).\n *\n * @param a - First string.\n * @param b - Second string.\n * @returns The edit distance between `a` and `b`. Always ≥ 0.\n *\n * @example\n * ```ts\n * levenshteinDistance('Button', 'Buttn');  // → 1\n * levenshteinDistance('Card', 'Cadr');     // → 2\n * levenshteinDistance('', 'Hello');        // → 5\n * levenshteinDistance('same', 'same');     // → 0\n * ```\n */\nexport function levenshteinDistance(a: string, b: string): number {\n    // Early exit: identical strings.\n    if (a === b) {\n        return 0;\n    }\n\n    const m = a.length;\n    const n = b.length;\n\n    // Edge cases: one string is empty.\n    if (m === 0) {\n        return n;\n    }\n    if (n === 0) {\n        return m;\n    }\n\n    // Two-row DP: prev = row (i-1), curr = row i.\n    // Each row has (n + 1) entries.\n    let prev: number[] = Array.from({ length: n + 1 }, (_, j) => j);\n    let curr: number[] = new Array<number>(n + 1);\n\n    for (let i = 1; i <= m; i++) {\n        curr[0] = i;\n\n        for (let j = 1; j <= n; j++) {\n            // Cost is 0 if characters match, 1 otherwise.\n            const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n\n            // Minimum of insertion, deletion, or substitution.\n            // prev[j] + 1:       deletion  (remove from a)\n            // (curr[j - 1] ?? 0) + 1: insertion (add to a)\n            // (prev[j - 1] ?? 0) + cost: substitution\n            const deletion = (prev[j] ?? 0) + 1;\n            const insertion = (curr[j - 1] ?? 0) + 1;\n            const substitution = (prev[j - 1] ?? 0) + cost;\n\n            curr[j] = Math.min(deletion, insertion, substitution);\n        }\n\n        // Swap rows: curr becomes prev for next iteration.\n        [prev, curr] = [curr, prev];\n    }\n\n    // After the loop, prev contains the last computed row.\n    // The answer is in prev[n].\n    return prev[n] ?? 0;\n}\n\n// ---------------------------------------------------------------------------\n// Closest Match Finder\n// ---------------------------------------------------------------------------\n\n/**\n * Finds the closest matching string from a list of candidates using\n * Levenshtein distance.\n *\n * Returns the candidate with the smallest distance to `input`, provided\n * that distance is ≤ {@link MATCH_THRESHOLD} (3). If no candidate is\n * within threshold, returns `undefined`.\n *\n * When multiple candidates share the minimum distance, the first one\n * encountered is returned (stable, deterministic ordering).\n *\n * @param input - The string to match against candidates.\n * @param candidates - The list of valid candidate strings.\n * @returns The closest matching candidate, or `undefined` if none\n *   are within the threshold distance.\n *\n * @example\n * ```ts\n * const names = ['Button', 'Card', 'Dialog', 'Input'];\n *\n * findClosestMatch('Buttn', names);   // → 'Button' (distance 1)\n * findClosestMatch('Crad', names);    // → 'Card' (distance 2)\n * findClosestMatch('Xyz', names);     // → undefined (no close match)\n * ```\n */\nexport function findClosestMatch(\n    input: string,\n    candidates: readonly string[],\n): string | undefined {\n    let bestMatch: string | undefined;\n    let bestDistance = MATCH_THRESHOLD + 1; // Start above threshold.\n\n    for (const candidate of candidates) {\n        const distance = levenshteinDistance(input, candidate);\n\n        if (distance < bestDistance) {\n            bestDistance = distance;\n            bestMatch = candidate;\n        }\n\n        // Perfect match — can't do better.\n        if (distance === 0) {\n            break;\n        }\n    }\n\n    // Only return if within threshold.\n    return bestDistance <= MATCH_THRESHOLD ? bestMatch : undefined;\n}\n","/**\n * @module @enterstellar-ai/contracts-shadcn/register\n * @description Registration API for pairing shadcn/ui components with\n * Enterstellar ComponentContracts.\n *\n * shadcn/ui uses a **code-copy distribution model** — components are copied\n * into the developer's source tree (e.g., `@/components/ui/button`), not\n * installed from npm. This means there is no universal import path for\n * shadcn components that this package can reference directly.\n *\n * Instead, the developer provides their local component imports via\n * {@link registerShadcnContracts}:\n *\n * @example\n * ```ts\n * import { registerShadcnContracts } from '@enterstellar-ai/contracts-shadcn';\n * import { Button } from '@/components/ui/button';\n * import { Card } from '@/components/ui/card';\n *\n * const contracts = registerShadcnContracts({ Button, Card });\n * const registry = createRegistry({ components: [...myContracts, ...contracts] });\n * ```\n *\n * ## Validation Rules\n *\n * 1. **Unknown keys** → throw with Levenshtein fuzzy suggestion.\n * 2. **`undefined`/`null` values** → throw with `npx shadcn add` hint.\n * 3. **Missing keys** → `console.warn` with GenericCard fallback message.\n * 4. **Valid components** → `defineComponent()` pairing.\n *\n * @see Correction 7 Decision 2 — Code-Copy Libraries\n * @see Correction 7 Decision 3 — CI Sync Pipeline\n */\n\nimport type { ComponentType } from 'react'; // type-only — erased at compile time (Audit N1)\n\nimport type { ComponentContract } from '@enterstellar-ai/types';\nimport * as Registry from '@enterstellar-ai/registry';             // Audit E2: explicit import\nimport type { ComponentContractInput } from '@enterstellar-ai/registry';   // Audit E1: from @enterstellar-ai/registry, NOT @enterstellar-ai/types\nimport { defineComponent } from '@enterstellar-ai/react';\n\nimport { SHADCN_CONTRACTS } from './contracts/index.js';\nimport type { ShadcnContractName } from './contracts/index.js';\nimport { findClosestMatch } from './utils/levenshtein.js';\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/**\n * Map of component names to React components provided by the developer.\n *\n * Keys must match contract names (PascalCase). Validation rules:\n * - **Unknown keys** throw an `Error` with a Levenshtein-based fuzzy\n *   suggestion (e.g., \"Did you mean 'Button'?\" when given 'Buttn').\n * - **`undefined`/`null` values** throw an `Error` with a\n *   `npx shadcn@latest add` hint for the missing component.\n * - **Missing keys** log `console.warn` — the contract is registered\n *   without a renderer, which falls back to `GenericCard`.\n *\n * Uses `Record<string, unknown>` to match `defineComponent()`'s\n * `TProps extends Record<string, unknown>` constraint (Audit M7).\n *\n * @see Correction 7 Decision 2 — registerShadcnContracts() pairing pattern\n * @see defineComponent — TProps constraint\n */\nexport type ShadcnComponentMap = Partial<\n    Record<ShadcnContractName, ComponentType<Record<string, unknown>>>\n>;\n\n// ---------------------------------------------------------------------------\n// Registration API\n// ---------------------------------------------------------------------------\n\n/**\n * Registers shadcn/ui contracts and pairs them with the developer's\n * local component implementations.\n *\n * **Validation sequence:**\n * 1. Iterate over all keys in the provided `components` map.\n * 2. For each key NOT in `SHADCN_CONTRACTS`, throw with a Levenshtein\n *    fuzzy suggestion (if one exists within distance ≤ 3).\n * 3. Iterate over all entries in `SHADCN_CONTRACTS`:\n *    - If the key was explicitly passed as `undefined` or `null`,\n *      throw with `npx shadcn@latest add <name>` hint.\n *    - If the key was not provided at all, `console.warn` that\n *      GenericCard fallback will be used, and register the contract\n *      without a renderer via `defineComponent()`.\n *    - If the key was provided with a valid component, pair via\n *      `defineComponent()` and collect the validated contract.\n *\n * @param components - Map of contract names to local React components.\n *   Keys must be PascalCase and match known contract names.\n * @returns Readonly array of validated `ComponentContract` objects for\n *   `createRegistry({ components: [...] })`.\n * @throws {Error} If a key doesn't match any known contract\n *   (with Levenshtein-based fuzzy suggestion).\n * @throws {Error} If a component value is explicitly `undefined` or `null`\n *   (with `npx shadcn@latest add` hint).\n *\n * @example\n * ```ts\n * import { registerShadcnContracts } from '@enterstellar-ai/contracts-shadcn';\n * import { Button } from '@/components/ui/button';\n * import { Card } from '@/components/ui/card';\n * import { Dialog } from '@/components/ui/dialog';\n *\n * const contracts = registerShadcnContracts({ Button, Card, Dialog });\n *\n * const registry = createRegistry({\n *     components: [...myContracts, ...contracts],\n * });\n * ```\n *\n * @see Correction 7 Decision 2 — Code-Copy Libraries\n * @see defineComponent — internal pairing mechanism\n */\nexport function registerShadcnContracts(\n    components: ShadcnComponentMap,\n): readonly ComponentContract[] {\n    const contracts: ComponentContract[] = [];\n    const knownNames = Object.keys(SHADCN_CONTRACTS);\n\n    // -------------------------------------------------------------------------\n    // Phase 1: Validate unknown keys (throw with fuzzy suggestion)\n    // -------------------------------------------------------------------------\n    // Check every key the developer provided against the known contract names.\n    // This runs first so the developer gets immediate feedback on typos before\n    // any contracts are registered.\n    for (const key of Object.keys(components)) {\n        if (!(key in SHADCN_CONTRACTS)) {\n            const suggestion = findClosestMatch(key, knownNames);\n            const hint = suggestion !== undefined\n                ? ` Did you mean '${suggestion}'?`\n                : '';\n            throw new Error(\n                `'${key}' is not a known shadcn contract.${hint}`,\n            );\n        }\n    }\n\n    // -------------------------------------------------------------------------\n    // Phase 2: Register each known contract\n    // -------------------------------------------------------------------------\n    for (const [name, contractInput] of Object.entries(SHADCN_CONTRACTS)) {\n        const typedInput: ComponentContractInput = contractInput;\n\n        // Check if the developer provided this key at all.\n        const isProvided = name in components;\n        const component = (components as Record<string, ComponentType<Record<string, unknown>> | undefined>)[name];\n\n        // --- Case: explicitly passed undefined/null ---\n        // The developer listed the key but didn't provide a component.\n        // This is likely a mistake — they intended to provide it but forgot\n        // to install/import it.\n        if (isProvided && component == null) {\n            throw new Error(\n                `Component '${name}' was not provided (received ${String(component)}). ` +\n                `Run 'npx shadcn@latest add ${name.toLowerCase()}' to add it.`,\n            );\n        }\n\n        // --- Case: not provided at all ---\n        // The developer didn't list this key in the map. This is intentional —\n        // they don't have this component installed. Register the contract\n        // without a renderer so GenericCard can fall back.\n        if (component === undefined) {\n            console.warn(\n                `Shadcn${name}: contract registered without renderer. ` +\n                `<Zone> will use GenericCard fallback. ` +\n                `Pass ${name} to registerShadcnContracts() to enable full rendering.`,\n            );\n            contracts.push(Registry.defineComponent(typedInput));\n            continue;\n        }\n\n        // --- Case: provided with a valid component ---\n        // Pair the contract with the developer's local component implementation\n        // via defineComponent(). This validates the contract, freezes it,\n        // and registers the renderer in the module-level RendererRegistry.\n        const { contract } = defineComponent({\n            contract: typedInput,\n            render: component,\n        });\n        contracts.push(contract);\n    }\n\n    return contracts;\n}\n"]}

package/package.json

@@ -0,0 +1,69 @@
+{
+  "name": "@enterstellar-ai/contracts-shadcn",
+  "description": "shadcn/ui component contracts — pre-built ComponentContracts for shadcn/ui components.",
+  "version": "0.1.0",
+  "author": "Enterstellar",
+  "license": "Apache-2.0",
+  "homepage": "https://enterstellar.dev",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/enterstellar-ai/enterstellar.git",
+    "directory": "packages/contracts-shadcn"
+  },
+  "bugs": {
+    "url": "https://github.com/enterstellar-ai/enterstellar/issues"
+  },
+  "keywords": [
+    "shadcn",
+    "contracts",
+    "components",
+    "generative-ui",
+    "enterstellar"
+  ],
+  "type": "module",
+  "private": false,
+  "sideEffects": false,
+  "publishConfig": {
+    "access": "public"
+  },
+  "main": "./dist/index.cjs",
+  "module": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "import": {
+        "types": "./dist/index.d.ts",
+        "default": "./dist/index.js"
+      },
+      "require": {
+        "types": "./dist/index.d.cts",
+        "default": "./dist/index.cjs"
+      }
+    }
+  },
+  "files": [
+    "LICENSE",
+    "NOTICE",
+    "dist"
+  ],
+  "peerDependencies": {
+    "zod": "^4.3.6",
+    "@enterstellar-ai/react": "0.1.0",
+    "@enterstellar-ai/registry": "0.1.0",
+    "@enterstellar-ai/types": "0.1.0"
+  },
+  "devDependencies": {
+    "@types/react": "^19.2.14",
+    "zod": "^4.3.6",
+    "@enterstellar-ai/react": "0.1.0",
+    "@enterstellar-ai/registry": "0.1.0",
+    "@enterstellar-ai/types": "0.1.0"
+  },
+  "scripts": {
+    "build": "tsup",
+    "typecheck": "tsc --noEmit",
+    "lint": "eslint src/",
+    "test": "vitest run",
+    "test:watch": "vitest"
+  }
+}