@prisma/orm-framework 0.16.0-dev.36

package/LICENSE

@@ -0,0 +1,201 @@
+                                 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, whether in Source or
+      Object form, 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 any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to 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 otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated 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 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 a Contribution incorporated 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, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, 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 copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this 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 redistributing 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 consequential 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 any and 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 act 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. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [2026] [Prisma Data, Inc]
+
+   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/README.md

@@ -0,0 +1,27 @@
+# @prisma/orm-framework
+
+The target-agnostic core of Prisma Next: the contract model, the component/registry system, and the authoring surface that emitted contracts and application code reach at runtime.
+
+Most applications never install this package directly — it arrives as an exact-pinned dependency of a database facade (`@prisma/orm-postgres`, `@prisma/orm-sqlite`, `@prisma/orm-mongo`), which is the package app developers should install. Extension authors and decomposed installs (applications replacing part of the default wiring) depend on it directly.
+
+## Entrypoints
+
+Each subpath namespace consolidates one internal framework module; a bare namespace import (e.g. `@prisma/orm-framework/contract`) aggregates that module's full surface, and deeper paths (e.g. `@prisma/orm-framework/contract/hashing`) select individual modules.
+
+| Namespace | Surface |
+| --- | --- |
+| `/contract` | contract types, validation, hashing, domain resolution |
+| `/components` | component descriptors, control stack, registries, codecs |
+| `/contract-authoring` | authoring-time contract construction |
+| `/psl-parser`, `/psl-printer` | PSL parsing, formatting, printing |
+| `/config` | configuration types and validation |
+| `/errors` | control, execution, and migration error types |
+| `/ids`, `/operations`, `/ts-render`, `/utils` | identifiers, operation model, TypeScript rendering, shared utilities |
+
+## Responsibilities
+
+Everything runtime and authoring code needs independently of a concrete database: contract representation and validation, component wiring, PSL handling, and shared utilities. No database drivers, no build tooling (that is `@prisma/orm-toolchain`).
+
+## Dependencies
+
+Self-contained apart from small third-party runtime libraries (`arktype`, `@standard-schema/spec`, `pathe`, `uniku`). It is the root of the platform-package graph: the family, target, and toolchain packages all depend on it.

package/dist/abortable-CQO6uG9F.mjs

@@ -0,0 +1,39 @@
+//#region ../../../1-framework/0-foundation/utils/dist/abortable.mjs
+/**
+* Allows aborting an async operation by returning a Promise which rejects if
+* the provided AbortSignal aborts and otherwise resolves with the result of
+* the async operation.
+*
+* Throws immediately if the signal is already aborted.
+* When the signal is aborted later, any wrapped promise will reject with
+* the signal's reason (or a default DOMException).
+*
+* @example
+* ```typescript
+* const { signal = new AbortController().signal } = options;
+* const unlessAborted = abortable(signal);
+*
+* // Any of these will reject if signal is aborted
+* await unlessAborted(asyncOperation());
+* await unlessAborted(fetch(url));
+* ```
+*
+* @param signal - The AbortSignal to race against
+* @returns A function that wraps promises to be cancelable
+* @throws If signal is already aborted
+*/
+function abortable(signal) {
+	signal.throwIfAborted();
+	const abortPromise = new Promise((_resolve, reject) => {
+		signal.addEventListener("abort", () => {
+			reject(signal.reason ?? new DOMException("Operation cancelled"));
+		}, { once: true });
+	});
+	return (operation) => {
+		return Promise.race([operation, abortPromise]);
+	};
+}
+//#endregion
+export { abortable as t };
+
+//# sourceMappingURL=abortable-CQO6uG9F.mjs.map

package/dist/abortable-CQO6uG9F.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"abortable-CQO6uG9F.mjs","names":[],"sources":["../../../../1-framework/0-foundation/utils/dist/abortable.mjs"],"sourcesContent":["//#region src/abortable.ts\n/**\n* Allows aborting an async operation by returning a Promise which rejects if\n* the provided AbortSignal aborts and otherwise resolves with the result of\n* the async operation.\n*\n* Throws immediately if the signal is already aborted.\n* When the signal is aborted later, any wrapped promise will reject with\n* the signal's reason (or a default DOMException).\n*\n* @example\n* ```typescript\n* const { signal = new AbortController().signal } = options;\n* const unlessAborted = abortable(signal);\n*\n* // Any of these will reject if signal is aborted\n* await unlessAborted(asyncOperation());\n* await unlessAborted(fetch(url));\n* ```\n*\n* @param signal - The AbortSignal to race against\n* @returns A function that wraps promises to be cancelable\n* @throws If signal is already aborted\n*/\nfunction abortable(signal) {\n\tsignal.throwIfAborted();\n\tconst abortPromise = new Promise((_resolve, reject) => {\n\t\tsignal.addEventListener(\"abort\", () => {\n\t\t\treject(signal.reason ?? new DOMException(\"Operation cancelled\"));\n\t\t}, { once: true });\n\t});\n\treturn (operation) => {\n\t\treturn Promise.race([operation, abortPromise]);\n\t};\n}\n//#endregion\nexport { abortable };\n\n//# sourceMappingURL=abortable.mjs.map"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAS,UAAU,QAAQ;CAC1B,OAAO,eAAe;CACtB,MAAM,eAAe,IAAI,SAAS,UAAU,WAAW;EACtD,OAAO,iBAAiB,eAAe;GACtC,OAAO,OAAO,UAAU,IAAI,aAAa,qBAAqB,CAAC;EAChE,GAAG,EAAE,MAAM,KAAK,CAAC;CAClB,CAAC;CACD,QAAQ,cAAc;EACrB,OAAO,QAAQ,KAAK,CAAC,WAAW,YAAY,CAAC;CAC9C;AACD"}

package/dist/abortable-DBbAaT_4.d.mts

@@ -0,0 +1,29 @@
+//#region ../../../1-framework/0-foundation/utils/dist/abortable.d.mts
+//#region src/abortable.d.ts
+/**
+ * Allows aborting an async operation by returning a Promise which rejects if
+ * the provided AbortSignal aborts and otherwise resolves with the result of
+ * the async operation.
+ *
+ * Throws immediately if the signal is already aborted.
+ * When the signal is aborted later, any wrapped promise will reject with
+ * the signal's reason (or a default DOMException).
+ *
+ * @example
+ * ```typescript
+ * const { signal = new AbortController().signal } = options;
+ * const unlessAborted = abortable(signal);
+ *
+ * // Any of these will reject if signal is aborted
+ * await unlessAborted(asyncOperation());
+ * await unlessAborted(fetch(url));
+ * ```
+ *
+ * @param signal - The AbortSignal to race against
+ * @returns A function that wraps promises to be cancelable
+ * @throws If signal is already aborted
+ */
+declare function abortable(signal: AbortSignal): <T>(promise: Promise<T>) => Promise<T>;
+//#endregion
+export { abortable as t };
+//# sourceMappingURL=abortable-DBbAaT_4.d.mts.map

package/dist/abortable-DBbAaT_4.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"abortable-DBbAaT_4.d.mts","names":[],"sources":["../../../../1-framework/0-foundation/utils/dist/abortable.d.mts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;iBAwBiB,UAAU,QAAQ,eAAe,GAAG,SAAS,QAAQ,OAAO,QAAQ"}

package/dist/apply-specifier-default-control-policy-CAxiXxKg.d.mts

@@ -0,0 +1,7 @@
+import { i as ControlPolicy, t as Contract } from "./contract-types-CkdMH7F7-9EHXSwbH.mjs";
+//#region ../../../1-framework/0-foundation/contract/dist/apply-specifier-default-control-policy.d.mts
+//#region src/apply-specifier-default-control-policy.d.ts
+declare function applySpecifierDefaultControlPolicy(contract: Contract, specifierDefault: ControlPolicy | undefined): Contract;
+//#endregion
+export { applySpecifierDefaultControlPolicy as t };
+//# sourceMappingURL=apply-specifier-default-control-policy-CAxiXxKg.d.mts.map

package/dist/apply-specifier-default-control-policy-CAxiXxKg.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"apply-specifier-default-control-policy-CAxiXxKg.d.mts","names":[],"sources":["../../../../1-framework/0-foundation/contract/dist/apply-specifier-default-control-policy.d.mts"],"mappings":";;;iBAEiB,mCAAmC,UAAU,UAAU,kBAAkB,4BAA4B"}

package/dist/apply-specifier-default-control-policy-CsYHsfTF.mjs

@@ -0,0 +1,12 @@
+//#region ../../../1-framework/0-foundation/contract/dist/apply-specifier-default-control-policy.mjs
+function applySpecifierDefaultControlPolicy(contract, specifierDefault) {
+	if (specifierDefault === void 0 || contract.defaultControlPolicy !== void 0) return contract;
+	return {
+		...contract,
+		defaultControlPolicy: specifierDefault
+	};
+}
+//#endregion
+export { applySpecifierDefaultControlPolicy as t };
+
+//# sourceMappingURL=apply-specifier-default-control-policy-CsYHsfTF.mjs.map

package/dist/apply-specifier-default-control-policy-CsYHsfTF.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"apply-specifier-default-control-policy-CsYHsfTF.mjs","names":[],"sources":["../../../../1-framework/0-foundation/contract/dist/apply-specifier-default-control-policy.mjs"],"sourcesContent":["//#region src/apply-specifier-default-control-policy.ts\nfunction applySpecifierDefaultControlPolicy(contract, specifierDefault) {\n\tif (specifierDefault === void 0 || contract.defaultControlPolicy !== void 0) return contract;\n\treturn {\n\t\t...contract,\n\t\tdefaultControlPolicy: specifierDefault\n\t};\n}\n//#endregion\nexport { applySpecifierDefaultControlPolicy };\n\n//# sourceMappingURL=apply-specifier-default-control-policy.mjs.map"],"mappings":";AACA,SAAS,mCAAmC,UAAU,kBAAkB;CACvE,IAAI,qBAAqB,KAAK,KAAK,SAAS,yBAAyB,KAAK,GAAG,OAAO;CACpF,OAAO;EACN,GAAG;EACH,sBAAsB;CACvB;AACD"}

package/dist/array-equal-28xupwIB.mjs

@@ -0,0 +1,26 @@
+//#region ../../../1-framework/0-foundation/utils/dist/array-equal.mjs
+/**
+* Checks if two arrays are equal using Object.is() for element comparison.
+* Arrays are considered equal if they have the same length and each element
+* at corresponding indices is equal according to Object.is().
+*
+* @param a - First array to compare
+* @param b - Second array to compare
+* @returns true if arrays are equal, false otherwise
+*
+* @example
+* ```typescript
+* isArrayEqual(['a', 'b'], ['a', 'b']); // true
+* isArrayEqual(['a'], ['a', 'b']); // false
+* isArrayEqual([0], [-0]); // false (Object.is distinguishes +0 and -0)
+* ```
+*/
+function isArrayEqual(a, b) {
+	if (a.length !== b.length) return false;
+	for (let i = 0; i < a.length; i++) if (!Object.is(a[i], b[i])) return false;
+	return true;
+}
+//#endregion
+export { isArrayEqual as t };
+
+//# sourceMappingURL=array-equal-28xupwIB.mjs.map

package/dist/array-equal-28xupwIB.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-equal-28xupwIB.mjs","names":[],"sources":["../../../../1-framework/0-foundation/utils/dist/array-equal.mjs"],"sourcesContent":["//#region src/array-equal.ts\n/**\n* Checks if two arrays are equal using Object.is() for element comparison.\n* Arrays are considered equal if they have the same length and each element\n* at corresponding indices is equal according to Object.is().\n*\n* @param a - First array to compare\n* @param b - Second array to compare\n* @returns true if arrays are equal, false otherwise\n*\n* @example\n* ```typescript\n* isArrayEqual(['a', 'b'], ['a', 'b']); // true\n* isArrayEqual(['a'], ['a', 'b']); // false\n* isArrayEqual([0], [-0]); // false (Object.is distinguishes +0 and -0)\n* ```\n*/\nfunction isArrayEqual(a, b) {\n\tif (a.length !== b.length) return false;\n\tfor (let i = 0; i < a.length; i++) if (!Object.is(a[i], b[i])) return false;\n\treturn true;\n}\n//#endregion\nexport { isArrayEqual };\n\n//# sourceMappingURL=array-equal.mjs.map"],"mappings":";;;;;;;;;;;;;;;;;AAiBA,SAAS,aAAa,GAAG,GAAG;CAC3B,IAAI,EAAE,WAAW,EAAE,QAAQ,OAAO;CAClC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,IAAI,CAAC,OAAO,GAAG,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO;CACtE,OAAO;AACR"}

package/dist/array-equal-dUd-VPlk.d.mts

@@ -0,0 +1,22 @@
+//#region ../../../1-framework/0-foundation/utils/dist/array-equal.d.mts
+//#region src/array-equal.d.ts
+/**
+ * Checks if two arrays are equal using Object.is() for element comparison.
+ * Arrays are considered equal if they have the same length and each element
+ * at corresponding indices is equal according to Object.is().
+ *
+ * @param a - First array to compare
+ * @param b - Second array to compare
+ * @returns true if arrays are equal, false otherwise
+ *
+ * @example
+ * ```typescript
+ * isArrayEqual(['a', 'b'], ['a', 'b']); // true
+ * isArrayEqual(['a'], ['a', 'b']); // false
+ * isArrayEqual([0], [-0]); // false (Object.is distinguishes +0 and -0)
+ * ```
+ */
+declare function isArrayEqual<T>(a: readonly T[], b: readonly T[]): boolean;
+//#endregion
+export { isArrayEqual as t };
+//# sourceMappingURL=array-equal-dUd-VPlk.d.mts.map

package/dist/array-equal-dUd-VPlk.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-equal-dUd-VPlk.d.mts","names":[],"sources":["../../../../1-framework/0-foundation/utils/dist/array-equal.d.mts"],"mappings":";;;;;;;;;;;;;;;;;;iBAiBiB,aAAa,GAAG,YAAY,KAAK,YAAY"}

package/dist/assertions-BEQnOIQd.d.mts

@@ -0,0 +1,31 @@
+//#region ../../../1-framework/0-foundation/utils/dist/assertions.d.mts
+//#region src/assertions.d.ts
+/**
+ * Asserts that a value is defined (not null or undefined).
+ * Use for invariants where the value should always exist at runtime.
+ *
+ * @throws Error if value is null or undefined
+ *
+ * @example
+ * ```typescript
+ * const table = storage.namespaces[namespaceId].entries.table[tableName];
+ * assertDefined(table, `Table "${tableName}" not found`);
+ * // table is now narrowed to non-nullable
+ * ```
+ */
+declare function assertDefined<T>(value: T | null | undefined, message: string): asserts value is T;
+/**
+ * Asserts that a condition is true.
+ * Use for invariants that should always hold at runtime.
+ *
+ * @throws Error if condition is false
+ *
+ * @example
+ * ```typescript
+ * invariant(columns.length > 0, 'Primary key must have at least one column');
+ * ```
+ */
+declare function invariant(condition: boolean, message: string): asserts condition;
+//#endregion
+export { invariant as n, assertDefined as t };
+//# sourceMappingURL=assertions-BEQnOIQd.d.mts.map

package/dist/assertions-BEQnOIQd.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"assertions-BEQnOIQd.d.mts","names":[],"sources":["../../../../1-framework/0-foundation/utils/dist/assertions.d.mts"],"mappings":";;;;;;;;;;;;;;;iBAciB,cAAc,GAAG,OAAO,sBAAsB,0BAA0B,SAAS;;;;;;;;;;;;iBAYjF,UAAU,oBAAoB,0BAA0B"}

package/dist/assertions-Cz-GWH8P.mjs

@@ -0,0 +1,36 @@
+import { t as InternalError } from "./internal-error-BIc-ehme-ouBQPoEL.mjs";
+//#region ../../../1-framework/0-foundation/utils/dist/assertions.mjs
+/**
+* Asserts that a value is defined (not null or undefined).
+* Use for invariants where the value should always exist at runtime.
+*
+* @throws Error if value is null or undefined
+*
+* @example
+* ```typescript
+* const table = storage.namespaces[namespaceId].entries.table[tableName];
+* assertDefined(table, `Table "${tableName}" not found`);
+* // table is now narrowed to non-nullable
+* ```
+*/
+function assertDefined(value, message) {
+	if (value === null || value === void 0) throw new InternalError(message);
+}
+/**
+* Asserts that a condition is true.
+* Use for invariants that should always hold at runtime.
+*
+* @throws Error if condition is false
+*
+* @example
+* ```typescript
+* invariant(columns.length > 0, 'Primary key must have at least one column');
+* ```
+*/
+function invariant(condition, message) {
+	if (!condition) throw new InternalError(message);
+}
+//#endregion
+export { invariant as n, assertDefined as t };
+
+//# sourceMappingURL=assertions-Cz-GWH8P.mjs.map

package/dist/assertions-Cz-GWH8P.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"assertions-Cz-GWH8P.mjs","names":[],"sources":["../../../../1-framework/0-foundation/utils/dist/assertions.mjs"],"sourcesContent":["import { t as InternalError } from \"./internal-error-BIc-ehme.mjs\";\n//#region src/assertions.ts\n/**\n* Asserts that a value is defined (not null or undefined).\n* Use for invariants where the value should always exist at runtime.\n*\n* @throws Error if value is null or undefined\n*\n* @example\n* ```typescript\n* const table = storage.namespaces[namespaceId].entries.table[tableName];\n* assertDefined(table, `Table \"${tableName}\" not found`);\n* // table is now narrowed to non-nullable\n* ```\n*/\nfunction assertDefined(value, message) {\n\tif (value === null || value === void 0) throw new InternalError(message);\n}\n/**\n* Asserts that a condition is true.\n* Use for invariants that should always hold at runtime.\n*\n* @throws Error if condition is false\n*\n* @example\n* ```typescript\n* invariant(columns.length > 0, 'Primary key must have at least one column');\n* ```\n*/\nfunction invariant(condition, message) {\n\tif (!condition) throw new InternalError(message);\n}\n//#endregion\nexport { assertDefined, invariant };\n\n//# sourceMappingURL=assertions.mjs.map"],"mappings":";;;;;;;;;;;;;;;AAeA,SAAS,cAAc,OAAO,SAAS;CACtC,IAAI,UAAU,QAAQ,UAAU,KAAK,GAAG,MAAM,IAAI,cAAc,OAAO;AACxE;;;;;;;;;;;;AAYA,SAAS,UAAU,WAAW,SAAS;CACtC,IAAI,CAAC,WAAW,MAAM,IAAI,cAAc,OAAO;AAChD"}

package/dist/authoring-Dd7p6pTS.d.mts

@@ -0,0 +1 @@
+import "./framework-authoring-7YMP9TwM-C9P-N6_a.mjs";

package/dist/canonical-stringify-Bl6agy_g.d.mts

@@ -0,0 +1,51 @@
+//#region ../../../1-framework/0-foundation/utils/dist/canonical-stringify.d.mts
+//#region src/canonical-stringify.d.ts
+/**
+ * Produces a deterministic, JSON-like string representation of a value.
+ *
+ * Designed for use as a stable identity / cache key. Two values that are
+ * structurally equivalent — regardless of object key insertion order —
+ * produce the same string. Two values that differ in any meaningful way
+ * (including types that JSON would conflate, like `BigInt(1)` vs `1`)
+ * produce different strings.
+ *
+ * Supported inputs:
+ * - `null`, `undefined` (distinguishable: `null` → `"null"`, `undefined` → `"undefined"`)
+ * - `boolean`, `string`, `number` (including `NaN`, `Infinity`, `-Infinity`)
+ * - `bigint` (suffixed with `n` to disambiguate from `number`)
+ * - `Date` (tagged + ISO string)
+ * - `Buffer` / `Uint8Array` (tagged + hex-encoded as `Bytes(<hex>)`)
+ * - Other `ArrayBuffer` views — `Int8Array`, `Uint16Array`, `Float64Array`,
+ *   `DataView`, etc. (tagged with the constructor name + hex-encoded over
+ *   the underlying bytes, e.g. `Uint16Array(<hex>)`). Note that the bytes
+ *   are read in host byte order, so callers that need cross-platform
+ *   stability for multi-byte typed arrays should normalize endianness
+ *   before passing the value in.
+ * - Arrays (order-preserving)
+ * - Plain objects (key-sorted) — only objects whose prototype is
+ *   `Object.prototype` or `null`. Non-plain objects (`Map`, `Set`,
+ *   `RegExp`, class instances, etc.) are rejected so they cannot silently
+ *   collapse to `{}` and collide with each other.
+ *
+ * Throws on `function`, `symbol`, circular references, non-plain objects,
+ * and objects with symbol-keyed properties (which `Object.keys` would
+ * silently drop). Callers that need to canonicalize any of these must
+ * convert them to a supported representation first.
+ *
+ * The output format is intentionally not JSON: the type tags and BigInt
+ * suffix mean it cannot be round-tripped via `JSON.parse`. The goal is
+ * keying, not serialization.
+ *
+ * @example
+ * ```typescript
+ * canonicalStringify({ a: 1, b: 2 }) === canonicalStringify({ b: 2, a: 1 })
+ * // → true
+ *
+ * canonicalStringify(1n) !== canonicalStringify(1)
+ * // → true
+ * ```
+ */
+declare function canonicalStringify(value: unknown): string;
+//#endregion
+export { canonicalStringify as t };
+//# sourceMappingURL=canonical-stringify-Bl6agy_g.d.mts.map

package/dist/canonical-stringify-Bl6agy_g.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"canonical-stringify-Bl6agy_g.d.mts","names":[],"sources":["../../../../1-framework/0-foundation/utils/dist/canonical-stringify.d.mts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBA8CiB,mBAAmB"}

package/dist/canonical-stringify-DY4NaAJi.mjs

@@ -0,0 +1,104 @@
+//#region ../../../1-framework/0-foundation/utils/dist/canonical-stringify.mjs
+/**
+* Produces a deterministic, JSON-like string representation of a value.
+*
+* Designed for use as a stable identity / cache key. Two values that are
+* structurally equivalent — regardless of object key insertion order —
+* produce the same string. Two values that differ in any meaningful way
+* (including types that JSON would conflate, like `BigInt(1)` vs `1`)
+* produce different strings.
+*
+* Supported inputs:
+* - `null`, `undefined` (distinguishable: `null` → `"null"`, `undefined` → `"undefined"`)
+* - `boolean`, `string`, `number` (including `NaN`, `Infinity`, `-Infinity`)
+* - `bigint` (suffixed with `n` to disambiguate from `number`)
+* - `Date` (tagged + ISO string)
+* - `Buffer` / `Uint8Array` (tagged + hex-encoded as `Bytes(<hex>)`)
+* - Other `ArrayBuffer` views — `Int8Array`, `Uint16Array`, `Float64Array`,
+*   `DataView`, etc. (tagged with the constructor name + hex-encoded over
+*   the underlying bytes, e.g. `Uint16Array(<hex>)`). Note that the bytes
+*   are read in host byte order, so callers that need cross-platform
+*   stability for multi-byte typed arrays should normalize endianness
+*   before passing the value in.
+* - Arrays (order-preserving)
+* - Plain objects (key-sorted) — only objects whose prototype is
+*   `Object.prototype` or `null`. Non-plain objects (`Map`, `Set`,
+*   `RegExp`, class instances, etc.) are rejected so they cannot silently
+*   collapse to `{}` and collide with each other.
+*
+* Throws on `function`, `symbol`, circular references, non-plain objects,
+* and objects with symbol-keyed properties (which `Object.keys` would
+* silently drop). Callers that need to canonicalize any of these must
+* convert them to a supported representation first.
+*
+* The output format is intentionally not JSON: the type tags and BigInt
+* suffix mean it cannot be round-tripped via `JSON.parse`. The goal is
+* keying, not serialization.
+*
+* @example
+* ```typescript
+* canonicalStringify({ a: 1, b: 2 }) === canonicalStringify({ b: 2, a: 1 })
+* // → true
+*
+* canonicalStringify(1n) !== canonicalStringify(1)
+* // → true
+* ```
+*/
+function canonicalStringify(value) {
+	return write(value, /* @__PURE__ */ new Set());
+}
+function write(value, seen) {
+	if (value === null) return "null";
+	if (value === void 0) return "undefined";
+	switch (typeof value) {
+		case "boolean": return value ? "true" : "false";
+		case "number": return writeNumber(value);
+		case "bigint": return `${value.toString()}n`;
+		case "string": return JSON.stringify(value);
+		case "function": throw new TypeError("canonicalStringify: functions are not supported");
+		case "symbol": throw new TypeError("canonicalStringify: symbols are not supported");
+	}
+	const obj = value;
+	if (value instanceof Date) return `Date(${value.toISOString()})`;
+	if (value instanceof Uint8Array) return `Bytes(${bytesToHex(value)})`;
+	if (ArrayBuffer.isView(value)) return `${value.constructor.name}(${bytesToHex(new Uint8Array(value.buffer, value.byteOffset, value.byteLength))})`;
+	if (seen.has(obj)) throw new TypeError("canonicalStringify: circular reference detected");
+	seen.add(obj);
+	try {
+		if (Array.isArray(value)) return `[${value.map((item) => write(item, seen)).join(",")}]`;
+		return writePlainObject(obj, seen);
+	} finally {
+		seen.delete(obj);
+	}
+}
+function writeNumber(value) {
+	if (Number.isNaN(value)) return "NaN";
+	if (value === Number.POSITIVE_INFINITY) return "Infinity";
+	if (value === Number.NEGATIVE_INFINITY) return "-Infinity";
+	if (value === 0 && 1 / value === Number.NEGATIVE_INFINITY) return "-0";
+	return String(value);
+}
+function writePlainObject(obj, seen) {
+	const proto = Object.getPrototypeOf(obj);
+	if (proto !== Object.prototype && proto !== null) {
+		const tag = proto?.constructor?.name ?? "unknown";
+		throw new TypeError(`canonicalStringify: non-plain objects are not supported (got ${tag})`);
+	}
+	if (Object.getOwnPropertySymbols(obj).length > 0) throw new TypeError("canonicalStringify: objects with symbol-keyed properties are not supported");
+	const keys = Object.keys(obj).sort();
+	const parts = [];
+	for (const key of keys) parts.push(`${JSON.stringify(key)}:${write(obj[key], seen)}`);
+	return `{${parts.join(",")}}`;
+}
+function bytesToHex(bytes) {
+	let out = "";
+	for (let i = 0; i < bytes.length; i++) {
+		const byte = bytes[i];
+		out += byte.toString(16).padStart(2, "0");
+	}
+	return out;
+}
+//#endregion
+export { canonicalStringify as t };
+
+//# sourceMappingURL=canonical-stringify-DY4NaAJi.mjs.map