@formancy/builder-core 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 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 [yyyy] [name of copyright owner]
+
+   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,4 @@
+formancy
+Copyright 2026 Daniel Bacher
+
+This product includes software developed by the formancy project.

package/dist/index.d.mts

@@ -0,0 +1,76 @@
+import { SchemaError } from "@formancy/spec/validate";
+import { FieldDef, FormSchema, LogicRule } from "@formancy/spec";
+//#region src/session.d.ts
+/**
+ * The headless document engine under the form builder.
+ *
+ * Three rules shape everything here.
+ *
+ * **A session may never hold a document the validator rejects.** Commands are
+ * applied to a copy, validated, and only then committed; a command that would
+ * produce an invalid document is refused with the validator's own
+ * author-facing message and the held document is untouched. That is why
+ * `canPublish()` is true by construction rather than by hope — and why legality
+ * is decided by *trying* a command rather than by a second implementation of
+ * the validator's rules, which would drift from it.
+ *
+ * **The document is frozen and copied at every boundary.** A builder UI is a
+ * projection of this state, and a projection that can reach in and mutate the
+ * model is how undo stops working.
+ *
+ * **Commands, never gestures.** Insert, move, remove, rename, set. WCAG 2.2
+ * requires every drag operation to have a keyboard equivalent, so the keyboard
+ * path is the API and a drag layer is sugar over it — not the other way round,
+ * which is how the keyboard path ends up an afterthought nobody finishes.
+ */
+interface Refusal {
+  ok: false;
+  /** JSON Pointer into the document, as the validator reports it. */
+  path: string;
+  message: string;
+}
+type CommandOutcome = {
+  ok: true;
+  document: FormSchema;
+} | Refusal;
+/** Where a field goes: the key path of its container, and a position in it. */
+interface Location {
+  parent: readonly string[];
+  index: number;
+}
+interface BuilderSession {
+  /** The current document: frozen, and never the caller's object. */
+  document(): FormSchema;
+  /** A mutable deep copy, safe to hand to anything. */
+  exportDocument(): FormSchema;
+  /** Increments once per accepted command, undo or redo. */
+  revision(): number;
+  canUndo(): boolean;
+  canRedo(): boolean;
+  undo(): boolean;
+  redo(): boolean;
+  /** The validator's verdict on the held document. Valid by construction. */
+  canPublish(): {
+    valid: boolean;
+    errors: SchemaError[];
+  };
+  /** One notification per accepted command, undo or redo. */
+  subscribe(listener: () => void): () => void;
+  insertField(location: Location, def: FieldDef): CommandOutcome;
+  removeField(keyPath: readonly string[]): CommandOutcome;
+  moveField(from: readonly string[], to: Location): CommandOutcome;
+  renameField(keyPath: readonly string[], newKey: string): CommandOutcome;
+  setFieldProperty(keyPath: readonly string[], property: string, value: unknown): CommandOutcome;
+  addRule(rule: LogicRule): CommandOutcome;
+  updateRule(index: number, rule: LogicRule): CommandOutcome;
+  removeRule(index: number): CommandOutcome;
+  /**
+   * Every location a field may legally land: a palette entry (pass a
+   * definition) or an existing field being moved (pass its key path).
+   */
+  validTargets(what: FieldDef | readonly string[]): Location[];
+}
+export declare function createBuilderSession(initial: FormSchema): BuilderSession;
+//#endregion
+export type { BuilderSession, CommandOutcome, Location, Refusal };
+//# sourceMappingURL=index.d.mts.map

package/dist/index.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.mts","names":[],"sources":["../src/session.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;UA0BiB;EACf;;EAEA;EACA;;KAGU;EAAmB;EAAU,UAAU;IAAe;;UAGjD;EACf;EACA;;UAGe;;EAEf,YAAY;;EAEZ,kBAAkB;;EAElB;EACA;EACA;EACA;EACA;;EAEA;IAAgB;IAAgB,QAAQ;;;EAExC,UAAU;EAEV,YAAY,UAAU,UAAU,KAAK,WAAW;EAChD,YAAY,6BAA6B;EACzC,UAAU,yBAAyB,IAAI,WAAW;EAClD,YAAY,4BAA4B,iBAAiB;EACzD,iBAAiB,4BAA4B,kBAAkB,iBAAiB;EAChF,QAAQ,MAAM,YAAY;EAC1B,WAAW,eAAe,MAAM,YAAY;EAC5C,WAAW,gBAAgB;;;;;EAM3B,aAAa,MAAM,+BAA+B;;wBAKpC,qBAAqB,SAAS,aAAa"}

package/dist/index.mjs

@@ -0,0 +1,283 @@
+import { validateSchema } from "@formancy/spec/validate";
+//#region src/session.ts
+const CONTAINER_TYPES = /* @__PURE__ */ new Set([
+	"group",
+	"page",
+	"repeater"
+]);
+function createBuilderSession(initial) {
+	const opened = deepFreeze(copy(initial));
+	const verdict = verdictFor(opened);
+	if (!verdict.valid) throw new Error(`Cannot open this document in a builder session: ${verdict.errors.map((error) => `${error.path} ${error.message}`).join("; ")}`);
+	/**
+	* The keys every field had when the session opened. A rename declares
+	* `renamedFrom` against THIS, never against the previous key: chaining
+	* would point a migration at an interim key no submission ever used.
+	*/
+	const baselineKeys = /* @__PURE__ */ new Map();
+	indexBaseline(opened.model.fields, baselineKeys);
+	const past = [];
+	const future = [];
+	let present = opened;
+	let revision = 0;
+	const listeners = /* @__PURE__ */ new Set();
+	/** Identity survives edits by data path, so a renamed field keeps its
+	*  baseline. Keyed by the path a field had in the baseline document. */
+	const baselineByCurrentKey = /* @__PURE__ */ new Map();
+	seedBaselineByKey(opened.model.fields, baselineByCurrentKey);
+	function commit(candidate) {
+		const check = verdictFor(candidate);
+		if (!check.valid) {
+			const first = check.errors[0];
+			return {
+				ok: false,
+				path: first.path,
+				message: first.message
+			};
+		}
+		past.push(present);
+		future.length = 0;
+		present = deepFreeze(candidate);
+		revision += 1;
+		for (const listener of [...listeners]) listener();
+		return {
+			ok: true,
+			document: present
+		};
+	}
+	function refuse(path, message) {
+		return {
+			ok: false,
+			path,
+			message
+		};
+	}
+	/** Apply `edit` to a working copy and commit if the validator agrees. */
+	function attempt(edit) {
+		const draft = copy(present);
+		const problem = edit(draft);
+		if (problem !== void 0) return problem;
+		return commit(draft);
+	}
+	return {
+		document: () => present,
+		exportDocument: () => copy(present),
+		revision: () => revision,
+		canUndo: () => past.length > 0,
+		canRedo: () => future.length > 0,
+		undo() {
+			const previous = past.pop();
+			if (previous === void 0) return false;
+			future.push(present);
+			present = previous;
+			revision += 1;
+			for (const listener of [...listeners]) listener();
+			return true;
+		},
+		redo() {
+			const next = future.pop();
+			if (next === void 0) return false;
+			past.push(present);
+			present = next;
+			revision += 1;
+			for (const listener of [...listeners]) listener();
+			return true;
+		},
+		canPublish: () => verdictFor(present),
+		subscribe(listener) {
+			listeners.add(listener);
+			return () => listeners.delete(listener);
+		},
+		insertField(location, def) {
+			return attempt((draft) => {
+				const container = containerAt(draft, location.parent);
+				if (container === void 0) return refuse("/model/fields", `No container at "${location.parent.join(".")}".`);
+				container.splice(clampIndex(location.index, container.length), 0, copy(def));
+			});
+		},
+		removeField(keyPath) {
+			return attempt((draft) => {
+				const found = locate(draft, keyPath);
+				if (found === void 0) return refuse("/model/fields", `No field at "${keyPath.join(".")}".`);
+				found.siblings.splice(found.index, 1);
+			});
+		},
+		moveField(from, to) {
+			if (isPrefix(from, to.parent)) return refuse("/model/fields", `Cannot move "${from.join(".")}" inside itself or one of its own children.`);
+			return attempt((draft) => {
+				const found = locate(draft, from);
+				if (found === void 0) return refuse("/model/fields", `No field at "${from.join(".")}".`);
+				const [moved] = found.siblings.splice(found.index, 1);
+				const container = containerAt(draft, to.parent);
+				if (container === void 0) return refuse("/model/fields", `No container at "${to.parent.join(".")}".`);
+				container.splice(clampIndex(to.index, container.length), 0, moved);
+			});
+		},
+		renameField(keyPath, newKey) {
+			return attempt((draft) => {
+				const found = locate(draft, keyPath);
+				if (found === void 0) return refuse("/model/fields", `No field at "${keyPath.join(".")}".`);
+				const field = found.siblings[found.index];
+				const baseline = baselineByCurrentKey.get(field.key) ?? field.key;
+				field.key = newKey;
+				if (newKey === baseline) delete field.renamedFrom;
+				else field.renamedFrom = baseline;
+				baselineByCurrentKey.set(newKey, baseline);
+			});
+		},
+		setFieldProperty(keyPath, property, value) {
+			return attempt((draft) => {
+				const found = locate(draft, keyPath);
+				if (found === void 0) return refuse("/model/fields", `No field at "${keyPath.join(".")}".`);
+				const field = found.siblings[found.index];
+				if (value === void 0) delete field[property];
+				else field[property] = copy(value);
+			});
+		},
+		addRule(rule) {
+			return attempt((draft) => {
+				draft.logic = draft.logic ?? { rules: [] };
+				draft.logic.rules.push(copy(rule));
+			});
+		},
+		updateRule(index, rule) {
+			return attempt((draft) => {
+				const rules = draft.logic?.rules;
+				if (rules === void 0 || index < 0 || index >= rules.length) return refuse("/logic/rules", `No rule at index ${index}.`);
+				rules[index] = copy(rule);
+			});
+		},
+		removeRule(index) {
+			return attempt((draft) => {
+				const rules = draft.logic?.rules;
+				if (rules === void 0 || index < 0 || index >= rules.length) return refuse("/logic/rules", `No rule at index ${index}.`);
+				rules.splice(index, 1);
+			});
+		},
+		validTargets(what) {
+			const movingPath = Array.isArray(what) ? what : void 0;
+			const probe = movingPath === void 0 ? what : locate(present, movingPath)?.siblings[locate(present, movingPath).index];
+			if (probe === void 0) return [];
+			const targets = [];
+			for (const parent of containerPaths(present)) {
+				if (movingPath !== void 0 && isPrefix(movingPath, parent)) continue;
+				const draft = copy(present);
+				if (movingPath !== void 0) {
+					const found = locate(draft, movingPath);
+					if (found === void 0) continue;
+					found.siblings.splice(found.index, 1);
+				}
+				const container = containerAt(draft, parent);
+				if (container === void 0) continue;
+				container.push(movingPath === void 0 ? withUniqueKey(copy(probe), draft) : copy(probe));
+				if (verdictFor(draft).valid) targets.push({
+					parent,
+					index: container.length - 1
+				});
+			}
+			return targets;
+		}
+	};
+}
+/** The child list of the container at `keyPath` — the root list for []. */
+function containerAt(document, keyPath) {
+	if (keyPath.length === 0) return document.model.fields;
+	const found = locate(document, keyPath);
+	if (found === void 0) return void 0;
+	const field = found.siblings[found.index];
+	if (!CONTAINER_TYPES.has(field.type)) return void 0;
+	field.fields = field.fields ?? [];
+	return field.fields;
+}
+function locate(document, keyPath) {
+	if (keyPath.length === 0) return void 0;
+	let siblings = document.model.fields;
+	for (let depth = 0; depth < keyPath.length; depth++) {
+		const index = siblings.findIndex((field) => field.key === keyPath[depth]);
+		if (index === -1) return void 0;
+		if (depth === keyPath.length - 1) return {
+			siblings,
+			index
+		};
+		const next = siblings[index].fields;
+		if (next === void 0) return void 0;
+		siblings = next;
+	}
+}
+/** Every container's key path, root first. */
+function containerPaths(document) {
+	const paths = [[]];
+	const walk = (fields, prefix) => {
+		for (const field of fields) {
+			if (!CONTAINER_TYPES.has(field.type)) continue;
+			const here = [...prefix, field.key];
+			paths.push(here);
+			walk(field.fields ?? [], here);
+		}
+	};
+	walk(document.model.fields, []);
+	return paths;
+}
+function isPrefix(prefix, candidate) {
+	if (prefix.length > candidate.length) return false;
+	return prefix.every((segment, index) => candidate[index] === segment);
+}
+function clampIndex(index, length) {
+	if (!Number.isInteger(index) || index < 0) return 0;
+	return Math.min(index, length);
+}
+/** A palette probe must not fail purely because its placeholder key is taken —
+*  validTargets answers "may this SHAPE go here", not "is this key free". */
+function withUniqueKey(def, document) {
+	const taken = /* @__PURE__ */ new Set();
+	const walk = (fields) => {
+		for (const field of fields) {
+			taken.add(field.key);
+			walk(field.fields ?? []);
+		}
+	};
+	walk(document.model.fields);
+	let candidate = def.key;
+	let counter = 1;
+	while (taken.has(candidate)) candidate = `${def.key}_${counter++}`;
+	return {
+		...def,
+		key: candidate
+	};
+}
+function indexBaseline(fields, into) {
+	for (const field of fields) {
+		into.set(field, field.key);
+		indexBaseline(field.fields ?? [], into);
+	}
+}
+function seedBaselineByKey(fields, into) {
+	for (const field of fields) {
+		into.set(field.key, field.renamedFrom ?? field.key);
+		seedBaselineByKey(field.fields ?? [], into);
+	}
+}
+function verdictFor(document) {
+	const result = validateSchema(document);
+	return result.valid ? {
+		valid: true,
+		errors: []
+	} : {
+		valid: false,
+		errors: result.errors
+	};
+}
+/** JSON round-trip: a form document is JSON by definition, and this package
+*  runs without structuredClone in its lib on purpose. */
+function copy(value) {
+	return JSON.parse(JSON.stringify(value));
+}
+function deepFreeze(value) {
+	if (value === null || typeof value !== "object") return value;
+	for (const nested of Object.values(value)) deepFreeze(nested);
+	return Object.freeze(value);
+}
+//#endregion
+export { createBuilderSession };
+
+//# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","names":[],"sources":["../src/session.ts"],"sourcesContent":["import type { FieldDef, FormSchema, LogicRule } from '@formancy/spec'\nimport { validateSchema } from '@formancy/spec/validate'\nimport type { SchemaError } from '@formancy/spec/validate'\n\n/**\n * The headless document engine under the form builder.\n *\n * Three rules shape everything here.\n *\n * **A session may never hold a document the validator rejects.** Commands are\n * applied to a copy, validated, and only then committed; a command that would\n * produce an invalid document is refused with the validator's own\n * author-facing message and the held document is untouched. That is why\n * `canPublish()` is true by construction rather than by hope — and why legality\n * is decided by *trying* a command rather than by a second implementation of\n * the validator's rules, which would drift from it.\n *\n * **The document is frozen and copied at every boundary.** A builder UI is a\n * projection of this state, and a projection that can reach in and mutate the\n * model is how undo stops working.\n *\n * **Commands, never gestures.** Insert, move, remove, rename, set. WCAG 2.2\n * requires every drag operation to have a keyboard equivalent, so the keyboard\n * path is the API and a drag layer is sugar over it — not the other way round,\n * which is how the keyboard path ends up an afterthought nobody finishes.\n */\nexport interface Refusal {\n  ok: false\n  /** JSON Pointer into the document, as the validator reports it. */\n  path: string\n  message: string\n}\n\nexport type CommandOutcome = { ok: true; document: FormSchema } | Refusal\n\n/** Where a field goes: the key path of its container, and a position in it. */\nexport interface Location {\n  parent: readonly string[]\n  index: number\n}\n\nexport interface BuilderSession {\n  /** The current document: frozen, and never the caller's object. */\n  document(): FormSchema\n  /** A mutable deep copy, safe to hand to anything. */\n  exportDocument(): FormSchema\n  /** Increments once per accepted command, undo or redo. */\n  revision(): number\n  canUndo(): boolean\n  canRedo(): boolean\n  undo(): boolean\n  redo(): boolean\n  /** The validator's verdict on the held document. Valid by construction. */\n  canPublish(): { valid: boolean; errors: SchemaError[] }\n  /** One notification per accepted command, undo or redo. */\n  subscribe(listener: () => void): () => void\n\n  insertField(location: Location, def: FieldDef): CommandOutcome\n  removeField(keyPath: readonly string[]): CommandOutcome\n  moveField(from: readonly string[], to: Location): CommandOutcome\n  renameField(keyPath: readonly string[], newKey: string): CommandOutcome\n  setFieldProperty(keyPath: readonly string[], property: string, value: unknown): CommandOutcome\n  addRule(rule: LogicRule): CommandOutcome\n  updateRule(index: number, rule: LogicRule): CommandOutcome\n  removeRule(index: number): CommandOutcome\n\n  /**\n   * Every location a field may legally land: a palette entry (pass a\n   * definition) or an existing field being moved (pass its key path).\n   */\n  validTargets(what: FieldDef | readonly string[]): Location[]\n}\n\nconst CONTAINER_TYPES = new Set(['group', 'page', 'repeater'])\n\nexport function createBuilderSession(initial: FormSchema): BuilderSession {\n  const opened = deepFreeze(copy(initial))\n  const verdict = verdictFor(opened)\n  if (!verdict.valid) {\n    // Opening an invalid document would make every later refusal ambiguous:\n    // the caller could not tell whether their command broke the form or merely\n    // failed to fix it.\n    throw new Error(\n      `Cannot open this document in a builder session: ${verdict.errors\n        .map((error) => `${error.path} ${error.message}`)\n        .join('; ')}`,\n    )\n  }\n\n  /**\n   * The keys every field had when the session opened. A rename declares\n   * `renamedFrom` against THIS, never against the previous key: chaining\n   * would point a migration at an interim key no submission ever used.\n   */\n  const baselineKeys = new Map<FieldDef, string>()\n  indexBaseline(opened.model.fields, baselineKeys)\n\n  const past: FormSchema[] = []\n  const future: FormSchema[] = []\n  let present: FormSchema = opened\n  let revision = 0\n  const listeners = new Set<() => void>()\n\n  /** Identity survives edits by data path, so a renamed field keeps its\n   *  baseline. Keyed by the path a field had in the baseline document. */\n  const baselineByCurrentKey = new Map<string, string>()\n  seedBaselineByKey(opened.model.fields, baselineByCurrentKey)\n\n  function commit(candidate: FormSchema): CommandOutcome {\n    const check = verdictFor(candidate)\n    if (!check.valid) {\n      const first = check.errors[0]!\n      return { ok: false, path: first.path, message: first.message }\n    }\n    past.push(present)\n    // A new command abandons the redo branch: redoing onto a different history\n    // would replay an edit against a document it was never made against.\n    future.length = 0\n    present = deepFreeze(candidate)\n    revision += 1\n    for (const listener of [...listeners]) listener()\n    return { ok: true, document: present }\n  }\n\n  function refuse(path: string, message: string): Refusal {\n    return { ok: false, path, message }\n  }\n\n  /** Apply `edit` to a working copy and commit if the validator agrees. */\n  function attempt(edit: (draft: FormSchema) => Refusal | undefined): CommandOutcome {\n    const draft = copy(present)\n    const problem = edit(draft)\n    if (problem !== undefined) return problem\n    return commit(draft)\n  }\n\n  return {\n    document: () => present,\n    exportDocument: () => copy(present),\n    revision: () => revision,\n    canUndo: () => past.length > 0,\n    canRedo: () => future.length > 0,\n\n    undo() {\n      const previous = past.pop()\n      if (previous === undefined) return false\n      future.push(present)\n      present = previous\n      revision += 1\n      for (const listener of [...listeners]) listener()\n      return true\n    },\n\n    redo() {\n      const next = future.pop()\n      if (next === undefined) return false\n      past.push(present)\n      present = next\n      revision += 1\n      for (const listener of [...listeners]) listener()\n      return true\n    },\n\n    canPublish: () => verdictFor(present),\n\n    subscribe(listener) {\n      listeners.add(listener)\n      return () => listeners.delete(listener)\n    },\n\n    insertField(location, def) {\n      return attempt((draft) => {\n        const container = containerAt(draft, location.parent)\n        if (container === undefined) {\n          return refuse('/model/fields', `No container at \"${location.parent.join('.')}\".`)\n        }\n        container.splice(clampIndex(location.index, container.length), 0, copy(def))\n        return undefined\n      })\n    },\n\n    removeField(keyPath) {\n      return attempt((draft) => {\n        const found = locate(draft, keyPath)\n        if (found === undefined) return refuse('/model/fields', `No field at \"${keyPath.join('.')}\".`)\n        found.siblings.splice(found.index, 1)\n        return undefined\n      })\n    },\n\n    moveField(from, to) {\n      if (isPrefix(from, to.parent)) {\n        return refuse(\n          '/model/fields',\n          `Cannot move \"${from.join('.')}\" inside itself or one of its own children.`,\n        )\n      }\n      return attempt((draft) => {\n        const found = locate(draft, from)\n        if (found === undefined) return refuse('/model/fields', `No field at \"${from.join('.')}\".`)\n        const [moved] = found.siblings.splice(found.index, 1)\n        const container = containerAt(draft, to.parent)\n        if (container === undefined) {\n          return refuse('/model/fields', `No container at \"${to.parent.join('.')}\".`)\n        }\n        container.splice(clampIndex(to.index, container.length), 0, moved!)\n        return undefined\n      })\n    },\n\n    renameField(keyPath, newKey) {\n      return attempt((draft) => {\n        const found = locate(draft, keyPath)\n        if (found === undefined) return refuse('/model/fields', `No field at \"${keyPath.join('.')}\".`)\n        const field = found.siblings[found.index]!\n        const baseline = baselineByCurrentKey.get(field.key) ?? field.key\n\n        field.key = newKey\n        if (newKey === baseline) {\n          // Back where it started: there is nothing to migrate, and leaving a\n          // renamedFrom pointing at the current key is itself invalid.\n          delete field.renamedFrom\n        } else {\n          field.renamedFrom = baseline\n        }\n        baselineByCurrentKey.set(newKey, baseline)\n        return undefined\n      })\n    },\n\n    setFieldProperty(keyPath, property, value) {\n      return attempt((draft) => {\n        const found = locate(draft, keyPath)\n        if (found === undefined) return refuse('/model/fields', `No field at \"${keyPath.join('.')}\".`)\n        const field = found.siblings[found.index]! as unknown as Record<string, unknown>\n        if (value === undefined) delete field[property]\n        else field[property] = copy(value)\n        return undefined\n      })\n    },\n\n    addRule(rule) {\n      return attempt((draft) => {\n        draft.logic = draft.logic ?? { rules: [] }\n        draft.logic.rules.push(copy(rule))\n        return undefined\n      })\n    },\n\n    updateRule(index, rule) {\n      return attempt((draft) => {\n        const rules = draft.logic?.rules\n        if (rules === undefined || index < 0 || index >= rules.length) {\n          return refuse('/logic/rules', `No rule at index ${index}.`)\n        }\n        rules[index] = copy(rule)\n        return undefined\n      })\n    },\n\n    removeRule(index) {\n      return attempt((draft) => {\n        const rules = draft.logic?.rules\n        if (rules === undefined || index < 0 || index >= rules.length) {\n          return refuse('/logic/rules', `No rule at index ${index}.`)\n        }\n        rules.splice(index, 1)\n        return undefined\n      })\n    },\n\n    validTargets(what) {\n      const movingPath = Array.isArray(what) ? (what as readonly string[]) : undefined\n      const probe: FieldDef =\n        movingPath === undefined\n          ? (what as FieldDef)\n          : (locate(present, movingPath)?.siblings[locate(present, movingPath)!.index] as FieldDef)\n      if (probe === undefined) return []\n\n      const targets: Location[] = []\n      for (const parent of containerPaths(present)) {\n        // A container cannot be moved into itself or its own descendants.\n        if (movingPath !== undefined && isPrefix(movingPath, parent)) continue\n\n        // Legality is decided by TRYING the edit against the validator, so\n        // these rules can never drift from the ones publish enforces.\n        const draft = copy(present)\n        if (movingPath !== undefined) {\n          const found = locate(draft, movingPath)\n          if (found === undefined) continue\n          found.siblings.splice(found.index, 1)\n        }\n        const container = containerAt(draft, parent)\n        if (container === undefined) continue\n        container.push(movingPath === undefined ? withUniqueKey(copy(probe), draft) : copy(probe))\n\n        if (verdictFor(draft).valid) targets.push({ parent, index: container.length - 1 })\n      }\n      return targets\n    },\n  }\n}\n\n// ---------------------------------------------------------------- navigation\n\ninterface Located {\n  siblings: FieldDef[]\n  index: number\n}\n\n/** The child list of the container at `keyPath` — the root list for []. */\nfunction containerAt(document: FormSchema, keyPath: readonly string[]): FieldDef[] | undefined {\n  if (keyPath.length === 0) return document.model.fields\n  const found = locate(document, keyPath)\n  if (found === undefined) return undefined\n  const field = found.siblings[found.index]!\n  if (!CONTAINER_TYPES.has(field.type)) return undefined\n  field.fields = field.fields ?? []\n  return field.fields\n}\n\nfunction locate(document: FormSchema, keyPath: readonly string[]): Located | undefined {\n  if (keyPath.length === 0) return undefined\n  let siblings: FieldDef[] = document.model.fields\n  for (let depth = 0; depth < keyPath.length; depth++) {\n    const index = siblings.findIndex((field) => field.key === keyPath[depth])\n    if (index === -1) return undefined\n    if (depth === keyPath.length - 1) return { siblings, index }\n    const next = siblings[index]!.fields\n    if (next === undefined) return undefined\n    siblings = next\n  }\n  return undefined\n}\n\n/** Every container's key path, root first. */\nfunction containerPaths(document: FormSchema): string[][] {\n  const paths: string[][] = [[]]\n  const walk = (fields: readonly FieldDef[], prefix: string[]): void => {\n    for (const field of fields) {\n      if (!CONTAINER_TYPES.has(field.type)) continue\n      const here = [...prefix, field.key]\n      paths.push(here)\n      walk(field.fields ?? [], here)\n    }\n  }\n  walk(document.model.fields, [])\n  return paths\n}\n\nfunction isPrefix(prefix: readonly string[], candidate: readonly string[]): boolean {\n  if (prefix.length > candidate.length) return false\n  return prefix.every((segment, index) => candidate[index] === segment)\n}\n\nfunction clampIndex(index: number, length: number): number {\n  if (!Number.isInteger(index) || index < 0) return 0\n  return Math.min(index, length)\n}\n\n/** A palette probe must not fail purely because its placeholder key is taken —\n *  validTargets answers \"may this SHAPE go here\", not \"is this key free\". */\nfunction withUniqueKey(def: FieldDef, document: FormSchema): FieldDef {\n  const taken = new Set<string>()\n  const walk = (fields: readonly FieldDef[]): void => {\n    for (const field of fields) {\n      taken.add(field.key)\n      walk(field.fields ?? [])\n    }\n  }\n  walk(document.model.fields)\n\n  let candidate = def.key\n  let counter = 1\n  while (taken.has(candidate)) candidate = `${def.key}_${counter++}`\n  return { ...def, key: candidate }\n}\n\n// ------------------------------------------------------------------ baseline\n\nfunction indexBaseline(fields: readonly FieldDef[], into: Map<FieldDef, string>): void {\n  for (const field of fields) {\n    into.set(field, field.key)\n    indexBaseline(field.fields ?? [], into)\n  }\n}\n\nfunction seedBaselineByKey(fields: readonly FieldDef[], into: Map<string, string>): void {\n  for (const field of fields) {\n    // A field opened with a renamedFrom already declared keeps pointing there:\n    // that is the key the collected answers actually live under.\n    into.set(field.key, field.renamedFrom ?? field.key)\n    seedBaselineByKey(field.fields ?? [], into)\n  }\n}\n\n// --------------------------------------------------------------------- utils\n\nfunction verdictFor(document: FormSchema): { valid: boolean; errors: SchemaError[] } {\n  const result = validateSchema(document)\n  return result.valid ? { valid: true, errors: [] } : { valid: false, errors: result.errors }\n}\n\n/** JSON round-trip: a form document is JSON by definition, and this package\n *  runs without structuredClone in its lib on purpose. */\nfunction copy<T>(value: T): T {\n  return JSON.parse(JSON.stringify(value)) as T\n}\n\nfunction deepFreeze<T>(value: T): T {\n  if (value === null || typeof value !== 'object') return value\n  for (const nested of Object.values(value as Record<string, unknown>)) deepFreeze(nested)\n  return Object.freeze(value)\n}\n"],"mappings":";;AAyEA,MAAM,kCAAkB,IAAI,IAAI;CAAC;CAAS;CAAQ;AAAU,CAAC;AAE7D,SAAgB,qBAAqB,SAAqC;CACxE,MAAM,SAAS,WAAW,KAAK,OAAO,CAAC;CACvC,MAAM,UAAU,WAAW,MAAM;CACjC,IAAI,CAAC,QAAQ,OAIX,MAAM,IAAI,MACR,mDAAmD,QAAQ,OACxD,KAAK,UAAU,GAAG,MAAM,KAAK,GAAG,MAAM,SAAS,CAAC,CAChD,KAAK,IAAI,GACd;;;;;;CAQF,MAAM,+BAAe,IAAI,IAAsB;CAC/C,cAAc,OAAO,MAAM,QAAQ,YAAY;CAE/C,MAAM,OAAqB,CAAC;CAC5B,MAAM,SAAuB,CAAC;CAC9B,IAAI,UAAsB;CAC1B,IAAI,WAAW;CACf,MAAM,4BAAY,IAAI,IAAgB;;;CAItC,MAAM,uCAAuB,IAAI,IAAoB;CACrD,kBAAkB,OAAO,MAAM,QAAQ,oBAAoB;CAE3D,SAAS,OAAO,WAAuC;EACrD,MAAM,QAAQ,WAAW,SAAS;EAClC,IAAI,CAAC,MAAM,OAAO;GAChB,MAAM,QAAQ,MAAM,OAAO;GAC3B,OAAO;IAAE,IAAI;IAAO,MAAM,MAAM;IAAM,SAAS,MAAM;GAAQ;EAC/D;EACA,KAAK,KAAK,OAAO;EAGjB,OAAO,SAAS;EAChB,UAAU,WAAW,SAAS;EAC9B,YAAY;EACZ,KAAK,MAAM,YAAY,CAAC,GAAG,SAAS,GAAG,SAAS;EAChD,OAAO;GAAE,IAAI;GAAM,UAAU;EAAQ;CACvC;CAEA,SAAS,OAAO,MAAc,SAA0B;EACtD,OAAO;GAAE,IAAI;GAAO;GAAM;EAAQ;CACpC;;CAGA,SAAS,QAAQ,MAAkE;EACjF,MAAM,QAAQ,KAAK,OAAO;EAC1B,MAAM,UAAU,KAAK,KAAK;EAC1B,IAAI,YAAY,KAAA,GAAW,OAAO;EAClC,OAAO,OAAO,KAAK;CACrB;CAEA,OAAO;EACL,gBAAgB;EAChB,sBAAsB,KAAK,OAAO;EAClC,gBAAgB;EAChB,eAAe,KAAK,SAAS;EAC7B,eAAe,OAAO,SAAS;EAE/B,OAAO;GACL,MAAM,WAAW,KAAK,IAAI;GAC1B,IAAI,aAAa,KAAA,GAAW,OAAO;GACnC,OAAO,KAAK,OAAO;GACnB,UAAU;GACV,YAAY;GACZ,KAAK,MAAM,YAAY,CAAC,GAAG,SAAS,GAAG,SAAS;GAChD,OAAO;EACT;EAEA,OAAO;GACL,MAAM,OAAO,OAAO,IAAI;GACxB,IAAI,SAAS,KAAA,GAAW,OAAO;GAC/B,KAAK,KAAK,OAAO;GACjB,UAAU;GACV,YAAY;GACZ,KAAK,MAAM,YAAY,CAAC,GAAG,SAAS,GAAG,SAAS;GAChD,OAAO;EACT;EAEA,kBAAkB,WAAW,OAAO;EAEpC,UAAU,UAAU;GAClB,UAAU,IAAI,QAAQ;GACtB,aAAa,UAAU,OAAO,QAAQ;EACxC;EAEA,YAAY,UAAU,KAAK;GACzB,OAAO,SAAS,UAAU;IACxB,MAAM,YAAY,YAAY,OAAO,SAAS,MAAM;IACpD,IAAI,cAAc,KAAA,GAChB,OAAO,OAAO,iBAAiB,oBAAoB,SAAS,OAAO,KAAK,GAAG,EAAE,GAAG;IAElF,UAAU,OAAO,WAAW,SAAS,OAAO,UAAU,MAAM,GAAG,GAAG,KAAK,GAAG,CAAC;GAE7E,CAAC;EACH;EAEA,YAAY,SAAS;GACnB,OAAO,SAAS,UAAU;IACxB,MAAM,QAAQ,OAAO,OAAO,OAAO;IACnC,IAAI,UAAU,KAAA,GAAW,OAAO,OAAO,iBAAiB,gBAAgB,QAAQ,KAAK,GAAG,EAAE,GAAG;IAC7F,MAAM,SAAS,OAAO,MAAM,OAAO,CAAC;GAEtC,CAAC;EACH;EAEA,UAAU,MAAM,IAAI;GAClB,IAAI,SAAS,MAAM,GAAG,MAAM,GAC1B,OAAO,OACL,iBACA,gBAAgB,KAAK,KAAK,GAAG,EAAE,4CACjC;GAEF,OAAO,SAAS,UAAU;IACxB,MAAM,QAAQ,OAAO,OAAO,IAAI;IAChC,IAAI,UAAU,KAAA,GAAW,OAAO,OAAO,iBAAiB,gBAAgB,KAAK,KAAK,GAAG,EAAE,GAAG;IAC1F,MAAM,CAAC,SAAS,MAAM,SAAS,OAAO,MAAM,OAAO,CAAC;IACpD,MAAM,YAAY,YAAY,OAAO,GAAG,MAAM;IAC9C,IAAI,cAAc,KAAA,GAChB,OAAO,OAAO,iBAAiB,oBAAoB,GAAG,OAAO,KAAK,GAAG,EAAE,GAAG;IAE5E,UAAU,OAAO,WAAW,GAAG,OAAO,UAAU,MAAM,GAAG,GAAG,KAAM;GAEpE,CAAC;EACH;EAEA,YAAY,SAAS,QAAQ;GAC3B,OAAO,SAAS,UAAU;IACxB,MAAM,QAAQ,OAAO,OAAO,OAAO;IACnC,IAAI,UAAU,KAAA,GAAW,OAAO,OAAO,iBAAiB,gBAAgB,QAAQ,KAAK,GAAG,EAAE,GAAG;IAC7F,MAAM,QAAQ,MAAM,SAAS,MAAM;IACnC,MAAM,WAAW,qBAAqB,IAAI,MAAM,GAAG,KAAK,MAAM;IAE9D,MAAM,MAAM;IACZ,IAAI,WAAW,UAGb,OAAO,MAAM;SAEb,MAAM,cAAc;IAEtB,qBAAqB,IAAI,QAAQ,QAAQ;GAE3C,CAAC;EACH;EAEA,iBAAiB,SAAS,UAAU,OAAO;GACzC,OAAO,SAAS,UAAU;IACxB,MAAM,QAAQ,OAAO,OAAO,OAAO;IACnC,IAAI,UAAU,KAAA,GAAW,OAAO,OAAO,iBAAiB,gBAAgB,QAAQ,KAAK,GAAG,EAAE,GAAG;IAC7F,MAAM,QAAQ,MAAM,SAAS,MAAM;IACnC,IAAI,UAAU,KAAA,GAAW,OAAO,MAAM;SACjC,MAAM,YAAY,KAAK,KAAK;GAEnC,CAAC;EACH;EAEA,QAAQ,MAAM;GACZ,OAAO,SAAS,UAAU;IACxB,MAAM,QAAQ,MAAM,SAAS,EAAE,OAAO,CAAC,EAAE;IACzC,MAAM,MAAM,MAAM,KAAK,KAAK,IAAI,CAAC;GAEnC,CAAC;EACH;EAEA,WAAW,OAAO,MAAM;GACtB,OAAO,SAAS,UAAU;IACxB,MAAM,QAAQ,MAAM,OAAO;IAC3B,IAAI,UAAU,KAAA,KAAa,QAAQ,KAAK,SAAS,MAAM,QACrD,OAAO,OAAO,gBAAgB,oBAAoB,MAAM,EAAE;IAE5D,MAAM,SAAS,KAAK,IAAI;GAE1B,CAAC;EACH;EAEA,WAAW,OAAO;GAChB,OAAO,SAAS,UAAU;IACxB,MAAM,QAAQ,MAAM,OAAO;IAC3B,IAAI,UAAU,KAAA,KAAa,QAAQ,KAAK,SAAS,MAAM,QACrD,OAAO,OAAO,gBAAgB,oBAAoB,MAAM,EAAE;IAE5D,MAAM,OAAO,OAAO,CAAC;GAEvB,CAAC;EACH;EAEA,aAAa,MAAM;GACjB,MAAM,aAAa,MAAM,QAAQ,IAAI,IAAK,OAA6B,KAAA;GACvE,MAAM,QACJ,eAAe,KAAA,IACV,OACA,OAAO,SAAS,UAAU,CAAC,EAAE,SAAS,OAAO,SAAS,UAAU,CAAC,CAAE;GAC1E,IAAI,UAAU,KAAA,GAAW,OAAO,CAAC;GAEjC,MAAM,UAAsB,CAAC;GAC7B,KAAK,MAAM,UAAU,eAAe,OAAO,GAAG;IAE5C,IAAI,eAAe,KAAA,KAAa,SAAS,YAAY,MAAM,GAAG;IAI9D,MAAM,QAAQ,KAAK,OAAO;IAC1B,IAAI,eAAe,KAAA,GAAW;KAC5B,MAAM,QAAQ,OAAO,OAAO,UAAU;KACtC,IAAI,UAAU,KAAA,GAAW;KACzB,MAAM,SAAS,OAAO,MAAM,OAAO,CAAC;IACtC;IACA,MAAM,YAAY,YAAY,OAAO,MAAM;IAC3C,IAAI,cAAc,KAAA,GAAW;IAC7B,UAAU,KAAK,eAAe,KAAA,IAAY,cAAc,KAAK,KAAK,GAAG,KAAK,IAAI,KAAK,KAAK,CAAC;IAEzF,IAAI,WAAW,KAAK,CAAC,CAAC,OAAO,QAAQ,KAAK;KAAE;KAAQ,OAAO,UAAU,SAAS;IAAE,CAAC;GACnF;GACA,OAAO;EACT;CACF;AACF;;AAUA,SAAS,YAAY,UAAsB,SAAoD;CAC7F,IAAI,QAAQ,WAAW,GAAG,OAAO,SAAS,MAAM;CAChD,MAAM,QAAQ,OAAO,UAAU,OAAO;CACtC,IAAI,UAAU,KAAA,GAAW,OAAO,KAAA;CAChC,MAAM,QAAQ,MAAM,SAAS,MAAM;CACnC,IAAI,CAAC,gBAAgB,IAAI,MAAM,IAAI,GAAG,OAAO,KAAA;CAC7C,MAAM,SAAS,MAAM,UAAU,CAAC;CAChC,OAAO,MAAM;AACf;AAEA,SAAS,OAAO,UAAsB,SAAiD;CACrF,IAAI,QAAQ,WAAW,GAAG,OAAO,KAAA;CACjC,IAAI,WAAuB,SAAS,MAAM;CAC1C,KAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS;EACnD,MAAM,QAAQ,SAAS,WAAW,UAAU,MAAM,QAAQ,QAAQ,MAAM;EACxE,IAAI,UAAU,IAAI,OAAO,KAAA;EACzB,IAAI,UAAU,QAAQ,SAAS,GAAG,OAAO;GAAE;GAAU;EAAM;EAC3D,MAAM,OAAO,SAAS,MAAM,CAAE;EAC9B,IAAI,SAAS,KAAA,GAAW,OAAO,KAAA;EAC/B,WAAW;CACb;AAEF;;AAGA,SAAS,eAAe,UAAkC;CACxD,MAAM,QAAoB,CAAC,CAAC,CAAC;CAC7B,MAAM,QAAQ,QAA6B,WAA2B;EACpE,KAAK,MAAM,SAAS,QAAQ;GAC1B,IAAI,CAAC,gBAAgB,IAAI,MAAM,IAAI,GAAG;GACtC,MAAM,OAAO,CAAC,GAAG,QAAQ,MAAM,GAAG;GAClC,MAAM,KAAK,IAAI;GACf,KAAK,MAAM,UAAU,CAAC,GAAG,IAAI;EAC/B;CACF;CACA,KAAK,SAAS,MAAM,QAAQ,CAAC,CAAC;CAC9B,OAAO;AACT;AAEA,SAAS,SAAS,QAA2B,WAAuC;CAClF,IAAI,OAAO,SAAS,UAAU,QAAQ,OAAO;CAC7C,OAAO,OAAO,OAAO,SAAS,UAAU,UAAU,WAAW,OAAO;AACtE;AAEA,SAAS,WAAW,OAAe,QAAwB;CACzD,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG,OAAO;CAClD,OAAO,KAAK,IAAI,OAAO,MAAM;AAC/B;;;AAIA,SAAS,cAAc,KAAe,UAAgC;CACpE,MAAM,wBAAQ,IAAI,IAAY;CAC9B,MAAM,QAAQ,WAAsC;EAClD,KAAK,MAAM,SAAS,QAAQ;GAC1B,MAAM,IAAI,MAAM,GAAG;GACnB,KAAK,MAAM,UAAU,CAAC,CAAC;EACzB;CACF;CACA,KAAK,SAAS,MAAM,MAAM;CAE1B,IAAI,YAAY,IAAI;CACpB,IAAI,UAAU;CACd,OAAO,MAAM,IAAI,SAAS,GAAG,YAAY,GAAG,IAAI,IAAI,GAAG;CACvD,OAAO;EAAE,GAAG;EAAK,KAAK;CAAU;AAClC;AAIA,SAAS,cAAc,QAA6B,MAAmC;CACrF,KAAK,MAAM,SAAS,QAAQ;EAC1B,KAAK,IAAI,OAAO,MAAM,GAAG;EACzB,cAAc,MAAM,UAAU,CAAC,GAAG,IAAI;CACxC;AACF;AAEA,SAAS,kBAAkB,QAA6B,MAAiC;CACvF,KAAK,MAAM,SAAS,QAAQ;EAG1B,KAAK,IAAI,MAAM,KAAK,MAAM,eAAe,MAAM,GAAG;EAClD,kBAAkB,MAAM,UAAU,CAAC,GAAG,IAAI;CAC5C;AACF;AAIA,SAAS,WAAW,UAAiE;CACnF,MAAM,SAAS,eAAe,QAAQ;CACtC,OAAO,OAAO,QAAQ;EAAE,OAAO;EAAM,QAAQ,CAAC;CAAE,IAAI;EAAE,OAAO;EAAO,QAAQ,OAAO;CAAO;AAC5F;;;AAIA,SAAS,KAAQ,OAAa;CAC5B,OAAO,KAAK,MAAM,KAAK,UAAU,KAAK,CAAC;AACzC;AAEA,SAAS,WAAc,OAAa;CAClC,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU,OAAO;CACxD,KAAK,MAAM,UAAU,OAAO,OAAO,KAAgC,GAAG,WAAW,MAAM;CACvF,OAAO,OAAO,OAAO,KAAK;AAC5B"}

package/package.json

@@ -0,0 +1,47 @@
+{
+  "name": "@formancy/builder-core",
+  "version": "0.1.0",
+  "description": "The headless form-builder document engine: schema editing as commands with undo, selection and valid-target computation.",
+  "license": "Apache-2.0",
+  "type": "module",
+  "sideEffects": false,
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.mts",
+      "default": "./dist/index.mjs"
+    }
+  },
+  "files": [
+    "dist",
+    "LICENSE",
+    "NOTICE"
+  ],
+  "dependencies": {
+    "@formancy/spec": "0.1.0"
+  },
+  "devDependencies": {
+    "@arethetypeswrong/cli": "^0.18.5",
+    "fast-check": "^4.10.1",
+    "publint": "^0.3.24",
+    "tsdown": "^0.23.0",
+    "typescript": "~6.0.3",
+    "unrun": "^0.3.1",
+    "vitest": "^5.0.1"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/sharkysan/formancy.ai.git",
+    "directory": "packages/builder-core"
+  },
+  "homepage": "https://github.com/sharkysan/formancy.ai",
+  "bugs": "https://github.com/sharkysan/formancy.ai/issues",
+  "scripts": {
+    "build": "tsdown",
+    "test": "vitest run",
+    "typecheck": "tsc --noEmit",
+    "check:pkg": "publint && attw --pack . --profile esm-only"
+  }
+}