@prisma/orm-framework 8.0.0-rc.12-dev.14 → 8.0.0-rc.12-dev.15

package/dist/ast-helpers-2XRnkQEO-BxG5qx3Q.mjs

@@ -0,0 +1,386 @@
+//#region ../../../1-framework/2-authoring/psl-parser/dist/ast-helpers-2XRnkQEO.mjs
+/**
+* A token in the red tree. Unlike the green-layer {@link Token} (kind + text
+* only), a red token also carries its absolute `offset` within the source and a
+* link back to its `parent` {@link SyntaxNode}, so a cursor anchored on a token
+* can walk outward (parent, previous/next token, siblings) without re-scanning
+* from the document root.
+*/
+var SyntaxToken = class {
+	green;
+	kind;
+	text;
+	offset;
+	parent;
+	/** Position within the parent's children, enabling O(1) sibling navigation without rescanning the green layer. */
+	index;
+	constructor(green, offset, parent, index) {
+		this.green = green;
+		this.kind = green.kind;
+		this.text = green.text;
+		this.offset = offset;
+		this.parent = parent;
+		this.index = index;
+	}
+	get textLength() {
+		return this.text.length;
+	}
+	get endOffset() {
+		return this.offset + this.textLength;
+	}
+	/** Whether `offset` falls within this token, inclusive of both ends. */
+	isInside(offset) {
+		return offset >= this.offset && offset <= this.endOffset;
+	}
+	isOutside(offset) {
+		return !this.isInside(offset);
+	}
+	/** The sibling element immediately after this token within its parent. */
+	get nextSiblingOrToken() {
+		return this.parent.childAt(this.index + 1);
+	}
+	/** The sibling element immediately before this token within its parent. */
+	get prevSiblingOrToken() {
+		return this.parent.childAt(this.index - 1);
+	}
+	/** The next token in document order, crossing node boundaries. */
+	get nextToken() {
+		for (let el = climbingNext(this); el !== void 0; el = climbingNext(el)) {
+			const token = firstToken(el);
+			if (token !== void 0) return token;
+		}
+	}
+	/** The previous token in document order, crossing node boundaries. */
+	get prevToken() {
+		for (let el = climbingPrev(this); el !== void 0; el = climbingPrev(el)) {
+			const token = lastToken(el);
+			if (token !== void 0) return token;
+		}
+	}
+};
+var TokenAtOffset = class TokenAtOffset {
+	#state;
+	constructor(state) {
+		this.#state = state;
+	}
+	static none() {
+		return new TokenAtOffset({ kind: "none" });
+	}
+	static single(token) {
+		return new TokenAtOffset({
+			kind: "single",
+			token
+		});
+	}
+	static between(left, right) {
+		return new TokenAtOffset({
+			kind: "between",
+			left,
+			right
+		});
+	}
+	get isEmpty() {
+		return this.#state.kind === "none";
+	}
+	get isBetween() {
+		return this.#state.kind === "between";
+	}
+	leftBiased() {
+		switch (this.#state.kind) {
+			case "none": return;
+			case "single": return this.#state.token;
+			case "between": return this.#state.left;
+		}
+	}
+	rightBiased() {
+		switch (this.#state.kind) {
+			case "none": return;
+			case "single": return this.#state.token;
+			case "between": return this.#state.right;
+		}
+	}
+};
+var SyntaxNode = class SyntaxNode {
+	green;
+	offset;
+	parent;
+	/** Position within the parent's children, enabling O(1) sibling navigation without rescanning the green layer. */
+	index;
+	#childSlots;
+	#childOffsets;
+	constructor(green, offset, parent, index) {
+		this.green = green;
+		this.offset = offset;
+		this.parent = parent;
+		this.index = index;
+	}
+	#slots() {
+		let slots = this.#childSlots;
+		if (slots === void 0) {
+			slots = new Array(this.green.children.length).fill(void 0);
+			this.#childSlots = slots;
+		}
+		return slots;
+	}
+	#childOffset(index) {
+		let offsets = this.#childOffsets;
+		if (offsets === void 0) {
+			offsets = [];
+			this.#childOffsets = offsets;
+		}
+		for (let known = offsets.length; known <= index; known++) {
+			const previousOffset = offsets[known - 1];
+			const previousChild = this.green.children[known - 1];
+			offsets.push(previousOffset === void 0 || previousChild === void 0 ? this.offset : previousOffset + elementTextLength(previousChild));
+		}
+		return offsets[index] ?? this.offset;
+	}
+	childAt(index) {
+		const green = this.green.children[index];
+		if (green === void 0) return void 0;
+		const slots = this.#slots();
+		const cached = slots[index];
+		if (cached !== void 0) return cached;
+		const created = wrapElement(green, this.#childOffset(index), this, index);
+		slots[index] = created;
+		return created;
+	}
+	get kind() {
+		return this.green.kind;
+	}
+	get textLength() {
+		return this.green.textLength;
+	}
+	get endOffset() {
+		return this.offset + this.textLength;
+	}
+	/** Whether `offset` falls within this node, inclusive of both ends. */
+	isInside(offset) {
+		return offset >= this.offset && offset <= this.endOffset;
+	}
+	isOutside(offset) {
+		return !this.isInside(offset);
+	}
+	get firstChild() {
+		return this.childAt(0);
+	}
+	get lastChild() {
+		return this.childAt(this.green.children.length - 1);
+	}
+	get nextSibling() {
+		return this.parent?.childAt(this.index + 1);
+	}
+	get prevSibling() {
+		return this.parent?.childAt(this.index - 1);
+	}
+	/** The sibling element immediately after this node within its parent. */
+	get nextSiblingOrToken() {
+		return this.nextSibling;
+	}
+	/** The sibling element immediately before this node within its parent. */
+	get prevSiblingOrToken() {
+		return this.prevSibling;
+	}
+	/** The first token in this subtree (depth-first), or `undefined` if empty. */
+	get firstToken() {
+		return firstToken(this);
+	}
+	/** The last token in this subtree (depth-first), or `undefined` if empty. */
+	get lastToken() {
+		return lastToken(this);
+	}
+	*children() {
+		const count = this.green.children.length;
+		for (let index = 0; index < count; index++) {
+			const child = this.childAt(index);
+			if (child !== void 0) yield child;
+		}
+	}
+	*childNodes() {
+		for (const child of this.children()) if (child instanceof SyntaxNode) yield child;
+	}
+	root() {
+		let current = this;
+		for (const parent of this.ancestors()) current = parent;
+		return current;
+	}
+	*ancestors() {
+		let current = this.parent;
+		while (current) {
+			yield current;
+			current = current.parent;
+		}
+	}
+	/** The nearest match, testing this node itself before walking its ancestors. */
+	findAncestor(cast) {
+		const self = cast(this);
+		if (self !== void 0) return self;
+		for (const ancestor of this.ancestors()) {
+			const result = cast(ancestor);
+			if (result !== void 0) return result;
+		}
+	}
+	*descendants() {
+		const stack = [this];
+		for (let el = stack.pop(); el !== void 0; el = stack.pop()) {
+			yield el;
+			if (el instanceof SyntaxNode) {
+				const children = Array.from(el.children());
+				for (let i = children.length - 1; i >= 0; i--) {
+					const child = children[i];
+					if (child !== void 0) stack.push(child);
+				}
+			}
+		}
+	}
+	*tokens() {
+		for (const el of this.descendants()) if (el instanceof SyntaxToken) yield el;
+	}
+	/**
+	* The token(s) at `offset`. The between-two-tokens case (offset exactly on a
+	* token seam) is represented explicitly so callers can left/right bias.
+	*/
+	tokenAtOffset(offset) {
+		return tokenAtOffsetOf(this, offset);
+	}
+	/**
+	* The smallest element fully containing the range `[start, end]`. At a seam
+	* (and for empty ranges) the left-hand element is preferred, matching
+	* {@link containsOffset}'s inclusive span.
+	*/
+	coveringElement(start, end) {
+		let result = this;
+		for (;;) {
+			if (result instanceof SyntaxToken) return result;
+			let next;
+			for (const child of result.children()) if (containsRange(child, start, end)) {
+				next = child;
+				break;
+			}
+			if (next === void 0) return result;
+			result = next;
+		}
+	}
+};
+function elementTextLength(el) {
+	return el.type === "token" ? el.text.length : el.textLength;
+}
+function elementLength(el) {
+	return el instanceof SyntaxToken ? el.text.length : el.textLength;
+}
+/**
+* Whether `el` contains `offset`. The span is inclusive on both ends so a seam
+* offset touches both neighbours.
+*/
+function containsOffset(el, offset) {
+	const start = el.offset;
+	const len = elementLength(el);
+	return offset >= start && offset <= start + len;
+}
+function containsRange(el, start, end) {
+	const elStart = el.offset;
+	const len = elementLength(el);
+	return elStart <= start && end <= elStart + len;
+}
+function tokenAtOffsetOf(el, offset) {
+	if (el instanceof SyntaxToken) return TokenAtOffset.single(el);
+	let left;
+	let right;
+	for (const child of el.children()) {
+		if (!containsOffset(child, offset)) continue;
+		if (left === void 0) left = child;
+		else {
+			right = child;
+			break;
+		}
+	}
+	if (left === void 0) return TokenAtOffset.none();
+	if (right === void 0) return tokenAtOffsetOf(left, offset);
+	const leftToken = tokenAtOffsetOf(left, offset).rightBiased();
+	const rightToken = tokenAtOffsetOf(right, offset).leftBiased();
+	if (leftToken !== void 0 && rightToken !== void 0) return TokenAtOffset.between(leftToken, rightToken);
+	if (leftToken !== void 0) return TokenAtOffset.single(leftToken);
+	if (rightToken !== void 0) return TokenAtOffset.single(rightToken);
+	return TokenAtOffset.none();
+}
+function firstToken(el) {
+	if (el instanceof SyntaxToken) return el;
+	for (const child of el.children()) {
+		const token = firstToken(child);
+		if (token !== void 0) return token;
+	}
+}
+function lastToken(el) {
+	if (el instanceof SyntaxToken) return el;
+	const children = Array.from(el.children());
+	for (let i = children.length - 1; i >= 0; i--) {
+		const child = children[i];
+		if (child !== void 0) {
+			const token = lastToken(child);
+			if (token !== void 0) return token;
+		}
+	}
+}
+function climbingNext(el) {
+	let current = el;
+	for (;;) {
+		const parent = current.parent;
+		if (parent === void 0) return void 0;
+		const sibling = parent.childAt(current.index + 1);
+		if (sibling !== void 0) return sibling;
+		current = parent;
+	}
+}
+function climbingPrev(el) {
+	let current = el;
+	for (;;) {
+		const parent = current.parent;
+		if (parent === void 0) return void 0;
+		const sibling = parent.childAt(current.index - 1);
+		if (sibling !== void 0) return sibling;
+		current = parent;
+	}
+}
+function wrapElement(green, offset, parent, index) {
+	if (green.type === "token") return new SyntaxToken(green, offset, parent, index);
+	return new SyntaxNode(green, offset, parent, index);
+}
+function createSyntaxTree(green) {
+	return new SyntaxNode(green, 0, void 0, 0);
+}
+function findChildToken(node, kind) {
+	for (const child of node.children()) if (!(child instanceof SyntaxNode) && child.kind === kind) return child;
+}
+function findFirstChild(node, cast) {
+	for (const child of node.childNodes()) {
+		const result = cast(child);
+		if (result !== void 0) return result;
+	}
+}
+function* filterChildren(node, cast) {
+	for (const child of node.childNodes()) {
+		const result = cast(child);
+		if (result !== void 0) yield result;
+	}
+}
+function any(...casts) {
+	return (node) => {
+		for (const cast of casts) {
+			const result = cast(node);
+			if (result !== void 0) return result;
+		}
+	};
+}
+/**
+* Raw source text of a CST node, verbatim (quotes and brackets preserved). For
+* the decoded value of a string literal, decode it instead.
+*/
+function printSyntax(node) {
+	let text = "";
+	for (const token of node.tokens()) text += token.text;
+	return text;
+}
+//#endregion
+export { createSyntaxTree as a, findFirstChild as c, any as i, printSyntax as l, SyntaxToken as n, filterChildren as o, TokenAtOffset as r, findChildToken as s, SyntaxNode as t };
+
+//# sourceMappingURL=ast-helpers-2XRnkQEO-BxG5qx3Q.mjs.map

package/dist/ast-helpers-2XRnkQEO-BxG5qx3Q.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-helpers-2XRnkQEO-BxG5qx3Q.mjs","names":["#state","#childSlots","#childOffsets","#slots","#childOffset"],"sources":["../../../../1-framework/2-authoring/psl-parser/dist/ast-helpers-2XRnkQEO.mjs"],"sourcesContent":["//#region src/syntax/red.ts\n/**\n* A token in the red tree. Unlike the green-layer {@link Token} (kind + text\n* only), a red token also carries its absolute `offset` within the source and a\n* link back to its `parent` {@link SyntaxNode}, so a cursor anchored on a token\n* can walk outward (parent, previous/next token, siblings) without re-scanning\n* from the document root.\n*/\nvar SyntaxToken = class {\n\tgreen;\n\tkind;\n\ttext;\n\toffset;\n\tparent;\n\t/** Position within the parent's children, enabling O(1) sibling navigation without rescanning the green layer. */\n\tindex;\n\tconstructor(green, offset, parent, index) {\n\t\tthis.green = green;\n\t\tthis.kind = green.kind;\n\t\tthis.text = green.text;\n\t\tthis.offset = offset;\n\t\tthis.parent = parent;\n\t\tthis.index = index;\n\t}\n\tget textLength() {\n\t\treturn this.text.length;\n\t}\n\tget endOffset() {\n\t\treturn this.offset + this.textLength;\n\t}\n\t/** Whether `offset` falls within this token, inclusive of both ends. */\n\tisInside(offset) {\n\t\treturn offset >= this.offset && offset <= this.endOffset;\n\t}\n\tisOutside(offset) {\n\t\treturn !this.isInside(offset);\n\t}\n\t/** The sibling element immediately after this token within its parent. */\n\tget nextSiblingOrToken() {\n\t\treturn this.parent.childAt(this.index + 1);\n\t}\n\t/** The sibling element immediately before this token within its parent. */\n\tget prevSiblingOrToken() {\n\t\treturn this.parent.childAt(this.index - 1);\n\t}\n\t/** The next token in document order, crossing node boundaries. */\n\tget nextToken() {\n\t\tfor (let el = climbingNext(this); el !== void 0; el = climbingNext(el)) {\n\t\t\tconst token = firstToken(el);\n\t\t\tif (token !== void 0) return token;\n\t\t}\n\t}\n\t/** The previous token in document order, crossing node boundaries. */\n\tget prevToken() {\n\t\tfor (let el = climbingPrev(this); el !== void 0; el = climbingPrev(el)) {\n\t\t\tconst token = lastToken(el);\n\t\t\tif (token !== void 0) return token;\n\t\t}\n\t}\n};\nvar TokenAtOffset = class TokenAtOffset {\n\t#state;\n\tconstructor(state) {\n\t\tthis.#state = state;\n\t}\n\tstatic none() {\n\t\treturn new TokenAtOffset({ kind: \"none\" });\n\t}\n\tstatic single(token) {\n\t\treturn new TokenAtOffset({\n\t\t\tkind: \"single\",\n\t\t\ttoken\n\t\t});\n\t}\n\tstatic between(left, right) {\n\t\treturn new TokenAtOffset({\n\t\t\tkind: \"between\",\n\t\t\tleft,\n\t\t\tright\n\t\t});\n\t}\n\tget isEmpty() {\n\t\treturn this.#state.kind === \"none\";\n\t}\n\tget isBetween() {\n\t\treturn this.#state.kind === \"between\";\n\t}\n\tleftBiased() {\n\t\tswitch (this.#state.kind) {\n\t\t\tcase \"none\": return;\n\t\t\tcase \"single\": return this.#state.token;\n\t\t\tcase \"between\": return this.#state.left;\n\t\t}\n\t}\n\trightBiased() {\n\t\tswitch (this.#state.kind) {\n\t\t\tcase \"none\": return;\n\t\t\tcase \"single\": return this.#state.token;\n\t\t\tcase \"between\": return this.#state.right;\n\t\t}\n\t}\n};\nvar SyntaxNode = class SyntaxNode {\n\tgreen;\n\toffset;\n\tparent;\n\t/** Position within the parent's children, enabling O(1) sibling navigation without rescanning the green layer. */\n\tindex;\n\t#childSlots;\n\t#childOffsets;\n\tconstructor(green, offset, parent, index) {\n\t\tthis.green = green;\n\t\tthis.offset = offset;\n\t\tthis.parent = parent;\n\t\tthis.index = index;\n\t}\n\t#slots() {\n\t\tlet slots = this.#childSlots;\n\t\tif (slots === void 0) {\n\t\t\tslots = new Array(this.green.children.length).fill(void 0);\n\t\t\tthis.#childSlots = slots;\n\t\t}\n\t\treturn slots;\n\t}\n\t#childOffset(index) {\n\t\tlet offsets = this.#childOffsets;\n\t\tif (offsets === void 0) {\n\t\t\toffsets = [];\n\t\t\tthis.#childOffsets = offsets;\n\t\t}\n\t\tfor (let known = offsets.length; known <= index; known++) {\n\t\t\tconst previousOffset = offsets[known - 1];\n\t\t\tconst previousChild = this.green.children[known - 1];\n\t\t\toffsets.push(previousOffset === void 0 || previousChild === void 0 ? this.offset : previousOffset + elementTextLength(previousChild));\n\t\t}\n\t\treturn offsets[index] ?? this.offset;\n\t}\n\tchildAt(index) {\n\t\tconst green = this.green.children[index];\n\t\tif (green === void 0) return void 0;\n\t\tconst slots = this.#slots();\n\t\tconst cached = slots[index];\n\t\tif (cached !== void 0) return cached;\n\t\tconst created = wrapElement(green, this.#childOffset(index), this, index);\n\t\tslots[index] = created;\n\t\treturn created;\n\t}\n\tget kind() {\n\t\treturn this.green.kind;\n\t}\n\tget textLength() {\n\t\treturn this.green.textLength;\n\t}\n\tget endOffset() {\n\t\treturn this.offset + this.textLength;\n\t}\n\t/** Whether `offset` falls within this node, inclusive of both ends. */\n\tisInside(offset) {\n\t\treturn offset >= this.offset && offset <= this.endOffset;\n\t}\n\tisOutside(offset) {\n\t\treturn !this.isInside(offset);\n\t}\n\tget firstChild() {\n\t\treturn this.childAt(0);\n\t}\n\tget lastChild() {\n\t\treturn this.childAt(this.green.children.length - 1);\n\t}\n\tget nextSibling() {\n\t\treturn this.parent?.childAt(this.index + 1);\n\t}\n\tget prevSibling() {\n\t\treturn this.parent?.childAt(this.index - 1);\n\t}\n\t/** The sibling element immediately after this node within its parent. */\n\tget nextSiblingOrToken() {\n\t\treturn this.nextSibling;\n\t}\n\t/** The sibling element immediately before this node within its parent. */\n\tget prevSiblingOrToken() {\n\t\treturn this.prevSibling;\n\t}\n\t/** The first token in this subtree (depth-first), or `undefined` if empty. */\n\tget firstToken() {\n\t\treturn firstToken(this);\n\t}\n\t/** The last token in this subtree (depth-first), or `undefined` if empty. */\n\tget lastToken() {\n\t\treturn lastToken(this);\n\t}\n\t*children() {\n\t\tconst count = this.green.children.length;\n\t\tfor (let index = 0; index < count; index++) {\n\t\t\tconst child = this.childAt(index);\n\t\t\tif (child !== void 0) yield child;\n\t\t}\n\t}\n\t*childNodes() {\n\t\tfor (const child of this.children()) if (child instanceof SyntaxNode) yield child;\n\t}\n\troot() {\n\t\tlet current = this;\n\t\tfor (const parent of this.ancestors()) current = parent;\n\t\treturn current;\n\t}\n\t*ancestors() {\n\t\tlet current = this.parent;\n\t\twhile (current) {\n\t\t\tyield current;\n\t\t\tcurrent = current.parent;\n\t\t}\n\t}\n\t/** The nearest match, testing this node itself before walking its ancestors. */\n\tfindAncestor(cast) {\n\t\tconst self = cast(this);\n\t\tif (self !== void 0) return self;\n\t\tfor (const ancestor of this.ancestors()) {\n\t\t\tconst result = cast(ancestor);\n\t\t\tif (result !== void 0) return result;\n\t\t}\n\t}\n\t*descendants() {\n\t\tconst stack = [this];\n\t\tfor (let el = stack.pop(); el !== void 0; el = stack.pop()) {\n\t\t\tyield el;\n\t\t\tif (el instanceof SyntaxNode) {\n\t\t\t\tconst children = Array.from(el.children());\n\t\t\t\tfor (let i = children.length - 1; i >= 0; i--) {\n\t\t\t\t\tconst child = children[i];\n\t\t\t\t\tif (child !== void 0) stack.push(child);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t*tokens() {\n\t\tfor (const el of this.descendants()) if (el instanceof SyntaxToken) yield el;\n\t}\n\t/**\n\t* The token(s) at `offset`. The between-two-tokens case (offset exactly on a\n\t* token seam) is represented explicitly so callers can left/right bias.\n\t*/\n\ttokenAtOffset(offset) {\n\t\treturn tokenAtOffsetOf(this, offset);\n\t}\n\t/**\n\t* The smallest element fully containing the range `[start, end]`. At a seam\n\t* (and for empty ranges) the left-hand element is preferred, matching\n\t* {@link containsOffset}'s inclusive span.\n\t*/\n\tcoveringElement(start, end) {\n\t\tlet result = this;\n\t\tfor (;;) {\n\t\t\tif (result instanceof SyntaxToken) return result;\n\t\t\tlet next;\n\t\t\tfor (const child of result.children()) if (containsRange(child, start, end)) {\n\t\t\t\tnext = child;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (next === void 0) return result;\n\t\t\tresult = next;\n\t\t}\n\t}\n};\nfunction elementTextLength(el) {\n\treturn el.type === \"token\" ? el.text.length : el.textLength;\n}\nfunction elementLength(el) {\n\treturn el instanceof SyntaxToken ? el.text.length : el.textLength;\n}\n/**\n* Whether `el` contains `offset`. The span is inclusive on both ends so a seam\n* offset touches both neighbours.\n*/\nfunction containsOffset(el, offset) {\n\tconst start = el.offset;\n\tconst len = elementLength(el);\n\treturn offset >= start && offset <= start + len;\n}\nfunction containsRange(el, start, end) {\n\tconst elStart = el.offset;\n\tconst len = elementLength(el);\n\treturn elStart <= start && end <= elStart + len;\n}\nfunction tokenAtOffsetOf(el, offset) {\n\tif (el instanceof SyntaxToken) return TokenAtOffset.single(el);\n\tlet left;\n\tlet right;\n\tfor (const child of el.children()) {\n\t\tif (!containsOffset(child, offset)) continue;\n\t\tif (left === void 0) left = child;\n\t\telse {\n\t\t\tright = child;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (left === void 0) return TokenAtOffset.none();\n\tif (right === void 0) return tokenAtOffsetOf(left, offset);\n\tconst leftToken = tokenAtOffsetOf(left, offset).rightBiased();\n\tconst rightToken = tokenAtOffsetOf(right, offset).leftBiased();\n\tif (leftToken !== void 0 && rightToken !== void 0) return TokenAtOffset.between(leftToken, rightToken);\n\tif (leftToken !== void 0) return TokenAtOffset.single(leftToken);\n\tif (rightToken !== void 0) return TokenAtOffset.single(rightToken);\n\treturn TokenAtOffset.none();\n}\nfunction firstToken(el) {\n\tif (el instanceof SyntaxToken) return el;\n\tfor (const child of el.children()) {\n\t\tconst token = firstToken(child);\n\t\tif (token !== void 0) return token;\n\t}\n}\nfunction lastToken(el) {\n\tif (el instanceof SyntaxToken) return el;\n\tconst children = Array.from(el.children());\n\tfor (let i = children.length - 1; i >= 0; i--) {\n\t\tconst child = children[i];\n\t\tif (child !== void 0) {\n\t\t\tconst token = lastToken(child);\n\t\t\tif (token !== void 0) return token;\n\t\t}\n\t}\n}\nfunction climbingNext(el) {\n\tlet current = el;\n\tfor (;;) {\n\t\tconst parent = current.parent;\n\t\tif (parent === void 0) return void 0;\n\t\tconst sibling = parent.childAt(current.index + 1);\n\t\tif (sibling !== void 0) return sibling;\n\t\tcurrent = parent;\n\t}\n}\nfunction climbingPrev(el) {\n\tlet current = el;\n\tfor (;;) {\n\t\tconst parent = current.parent;\n\t\tif (parent === void 0) return void 0;\n\t\tconst sibling = parent.childAt(current.index - 1);\n\t\tif (sibling !== void 0) return sibling;\n\t\tcurrent = parent;\n\t}\n}\nfunction wrapElement(green, offset, parent, index) {\n\tif (green.type === \"token\") return new SyntaxToken(green, offset, parent, index);\n\treturn new SyntaxNode(green, offset, parent, index);\n}\nfunction createSyntaxTree(green) {\n\treturn new SyntaxNode(green, 0, void 0, 0);\n}\n//#endregion\n//#region src/syntax/ast-helpers.ts\nfunction findChildToken(node, kind) {\n\tfor (const child of node.children()) if (!(child instanceof SyntaxNode) && child.kind === kind) return child;\n}\nfunction findFirstChild(node, cast) {\n\tfor (const child of node.childNodes()) {\n\t\tconst result = cast(child);\n\t\tif (result !== void 0) return result;\n\t}\n}\nfunction* filterChildren(node, cast) {\n\tfor (const child of node.childNodes()) {\n\t\tconst result = cast(child);\n\t\tif (result !== void 0) yield result;\n\t}\n}\nfunction any(...casts) {\n\treturn (node) => {\n\t\tfor (const cast of casts) {\n\t\t\tconst result = cast(node);\n\t\t\tif (result !== void 0) return result;\n\t\t}\n\t};\n}\n/**\n* Raw source text of a CST node, verbatim (quotes and brackets preserved). For\n* the decoded value of a string literal, decode it instead.\n*/\nfunction printSyntax(node) {\n\tlet text = \"\";\n\tfor (const token of node.tokens()) text += token.text;\n\treturn text;\n}\n//#endregion\nexport { printSyntax as a, TokenAtOffset as c, findFirstChild as i, createSyntaxTree as l, filterChildren as n, SyntaxNode as o, findChildToken as r, SyntaxToken as s, any as t };\n\n//# sourceMappingURL=ast-helpers-2XRnkQEO.mjs.map"],"mappings":";;;;;;;;AAQA,IAAI,cAAc,MAAM;CACvB;CACA;CACA;CACA;CACA;;CAEA;CACA,YAAY,OAAO,QAAQ,QAAQ,OAAO;EACzC,KAAK,QAAQ;EACb,KAAK,OAAO,MAAM;EAClB,KAAK,OAAO,MAAM;EAClB,KAAK,SAAS;EACd,KAAK,SAAS;EACd,KAAK,QAAQ;CACd;CACA,IAAI,aAAa;EAChB,OAAO,KAAK,KAAK;CAClB;CACA,IAAI,YAAY;EACf,OAAO,KAAK,SAAS,KAAK;CAC3B;;CAEA,SAAS,QAAQ;EAChB,OAAO,UAAU,KAAK,UAAU,UAAU,KAAK;CAChD;CACA,UAAU,QAAQ;EACjB,OAAO,CAAC,KAAK,SAAS,MAAM;CAC7B;;CAEA,IAAI,qBAAqB;EACxB,OAAO,KAAK,OAAO,QAAQ,KAAK,QAAQ,CAAC;CAC1C;;CAEA,IAAI,qBAAqB;EACxB,OAAO,KAAK,OAAO,QAAQ,KAAK,QAAQ,CAAC;CAC1C;;CAEA,IAAI,YAAY;EACf,KAAK,IAAI,KAAK,aAAa,IAAI,GAAG,OAAO,KAAK,GAAG,KAAK,aAAa,EAAE,GAAG;GACvE,MAAM,QAAQ,WAAW,EAAE;GAC3B,IAAI,UAAU,KAAK,GAAG,OAAO;EAC9B;CACD;;CAEA,IAAI,YAAY;EACf,KAAK,IAAI,KAAK,aAAa,IAAI,GAAG,OAAO,KAAK,GAAG,KAAK,aAAa,EAAE,GAAG;GACvE,MAAM,QAAQ,UAAU,EAAE;GAC1B,IAAI,UAAU,KAAK,GAAG,OAAO;EAC9B;CACD;AACD;AACA,IAAI,gBAAgB,MAAM,cAAc;CACvC;CACA,YAAY,OAAO;EAClB,KAAKA,SAAS;CACf;CACA,OAAO,OAAO;EACb,OAAO,IAAI,cAAc,EAAE,MAAM,OAAO,CAAC;CAC1C;CACA,OAAO,OAAO,OAAO;EACpB,OAAO,IAAI,cAAc;GACxB,MAAM;GACN;EACD,CAAC;CACF;CACA,OAAO,QAAQ,MAAM,OAAO;EAC3B,OAAO,IAAI,cAAc;GACxB,MAAM;GACN;GACA;EACD,CAAC;CACF;CACA,IAAI,UAAU;EACb,OAAO,KAAKA,OAAO,SAAS;CAC7B;CACA,IAAI,YAAY;EACf,OAAO,KAAKA,OAAO,SAAS;CAC7B;CACA,aAAa;EACZ,QAAQ,KAAKA,OAAO,MAApB;GACC,KAAK,QAAQ;GACb,KAAK,UAAU,OAAO,KAAKA,OAAO;GAClC,KAAK,WAAW,OAAO,KAAKA,OAAO;EACpC;CACD;CACA,cAAc;EACb,QAAQ,KAAKA,OAAO,MAApB;GACC,KAAK,QAAQ;GACb,KAAK,UAAU,OAAO,KAAKA,OAAO;GAClC,KAAK,WAAW,OAAO,KAAKA,OAAO;EACpC;CACD;AACD;AACA,IAAI,aAAa,MAAM,WAAW;CACjC;CACA;CACA;;CAEA;CACA;CACA;CACA,YAAY,OAAO,QAAQ,QAAQ,OAAO;EACzC,KAAK,QAAQ;EACb,KAAK,SAAS;EACd,KAAK,SAAS;EACd,KAAK,QAAQ;CACd;CACA,SAAS;EACR,IAAI,QAAQ,KAAKC;EACjB,IAAI,UAAU,KAAK,GAAG;GACrB,QAAQ,IAAI,MAAM,KAAK,MAAM,SAAS,MAAM,CAAC,CAAC,KAAK,KAAK,CAAC;GACzD,KAAKA,cAAc;EACpB;EACA,OAAO;CACR;CACA,aAAa,OAAO;EACnB,IAAI,UAAU,KAAKC;EACnB,IAAI,YAAY,KAAK,GAAG;GACvB,UAAU,CAAC;GACX,KAAKA,gBAAgB;EACtB;EACA,KAAK,IAAI,QAAQ,QAAQ,QAAQ,SAAS,OAAO,SAAS;GACzD,MAAM,iBAAiB,QAAQ,QAAQ;GACvC,MAAM,gBAAgB,KAAK,MAAM,SAAS,QAAQ;GAClD,QAAQ,KAAK,mBAAmB,KAAK,KAAK,kBAAkB,KAAK,IAAI,KAAK,SAAS,iBAAiB,kBAAkB,aAAa,CAAC;EACrI;EACA,OAAO,QAAQ,UAAU,KAAK;CAC/B;CACA,QAAQ,OAAO;EACd,MAAM,QAAQ,KAAK,MAAM,SAAS;EAClC,IAAI,UAAU,KAAK,GAAG,OAAO,KAAK;EAClC,MAAM,QAAQ,KAAKC,OAAO;EAC1B,MAAM,SAAS,MAAM;EACrB,IAAI,WAAW,KAAK,GAAG,OAAO;EAC9B,MAAM,UAAU,YAAY,OAAO,KAAKC,aAAa,KAAK,GAAG,MAAM,KAAK;EACxE,MAAM,SAAS;EACf,OAAO;CACR;CACA,IAAI,OAAO;EACV,OAAO,KAAK,MAAM;CACnB;CACA,IAAI,aAAa;EAChB,OAAO,KAAK,MAAM;CACnB;CACA,IAAI,YAAY;EACf,OAAO,KAAK,SAAS,KAAK;CAC3B;;CAEA,SAAS,QAAQ;EAChB,OAAO,UAAU,KAAK,UAAU,UAAU,KAAK;CAChD;CACA,UAAU,QAAQ;EACjB,OAAO,CAAC,KAAK,SAAS,MAAM;CAC7B;CACA,IAAI,aAAa;EAChB,OAAO,KAAK,QAAQ,CAAC;CACtB;CACA,IAAI,YAAY;EACf,OAAO,KAAK,QAAQ,KAAK,MAAM,SAAS,SAAS,CAAC;CACnD;CACA,IAAI,cAAc;EACjB,OAAO,KAAK,QAAQ,QAAQ,KAAK,QAAQ,CAAC;CAC3C;CACA,IAAI,cAAc;EACjB,OAAO,KAAK,QAAQ,QAAQ,KAAK,QAAQ,CAAC;CAC3C;;CAEA,IAAI,qBAAqB;EACxB,OAAO,KAAK;CACb;;CAEA,IAAI,qBAAqB;EACxB,OAAO,KAAK;CACb;;CAEA,IAAI,aAAa;EAChB,OAAO,WAAW,IAAI;CACvB;;CAEA,IAAI,YAAY;EACf,OAAO,UAAU,IAAI;CACtB;CACA,CAAC,WAAW;EACX,MAAM,QAAQ,KAAK,MAAM,SAAS;EAClC,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,SAAS;GAC3C,MAAM,QAAQ,KAAK,QAAQ,KAAK;GAChC,IAAI,UAAU,KAAK,GAAG,MAAM;EAC7B;CACD;CACA,CAAC,aAAa;EACb,KAAK,MAAM,SAAS,KAAK,SAAS,GAAG,IAAI,iBAAiB,YAAY,MAAM;CAC7E;CACA,OAAO;EACN,IAAI,UAAU;EACd,KAAK,MAAM,UAAU,KAAK,UAAU,GAAG,UAAU;EACjD,OAAO;CACR;CACA,CAAC,YAAY;EACZ,IAAI,UAAU,KAAK;EACnB,OAAO,SAAS;GACf,MAAM;GACN,UAAU,QAAQ;EACnB;CACD;;CAEA,aAAa,MAAM;EAClB,MAAM,OAAO,KAAK,IAAI;EACtB,IAAI,SAAS,KAAK,GAAG,OAAO;EAC5B,KAAK,MAAM,YAAY,KAAK,UAAU,GAAG;GACxC,MAAM,SAAS,KAAK,QAAQ;GAC5B,IAAI,WAAW,KAAK,GAAG,OAAO;EAC/B;CACD;CACA,CAAC,cAAc;EACd,MAAM,QAAQ,CAAC,IAAI;EACnB,KAAK,IAAI,KAAK,MAAM,IAAI,GAAG,OAAO,KAAK,GAAG,KAAK,MAAM,IAAI,GAAG;GAC3D,MAAM;GACN,IAAI,cAAc,YAAY;IAC7B,MAAM,WAAW,MAAM,KAAK,GAAG,SAAS,CAAC;IACzC,KAAK,IAAI,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;KAC9C,MAAM,QAAQ,SAAS;KACvB,IAAI,UAAU,KAAK,GAAG,MAAM,KAAK,KAAK;IACvC;GACD;EACD;CACD;CACA,CAAC,SAAS;EACT,KAAK,MAAM,MAAM,KAAK,YAAY,GAAG,IAAI,cAAc,aAAa,MAAM;CAC3E;;;;;CAKA,cAAc,QAAQ;EACrB,OAAO,gBAAgB,MAAM,MAAM;CACpC;;;;;;CAMA,gBAAgB,OAAO,KAAK;EAC3B,IAAI,SAAS;EACb,SAAS;GACR,IAAI,kBAAkB,aAAa,OAAO;GAC1C,IAAI;GACJ,KAAK,MAAM,SAAS,OAAO,SAAS,GAAG,IAAI,cAAc,OAAO,OAAO,GAAG,GAAG;IAC5E,OAAO;IACP;GACD;GACA,IAAI,SAAS,KAAK,GAAG,OAAO;GAC5B,SAAS;EACV;CACD;AACD;AACA,SAAS,kBAAkB,IAAI;CAC9B,OAAO,GAAG,SAAS,UAAU,GAAG,KAAK,SAAS,GAAG;AAClD;AACA,SAAS,cAAc,IAAI;CAC1B,OAAO,cAAc,cAAc,GAAG,KAAK,SAAS,GAAG;AACxD;;;;;AAKA,SAAS,eAAe,IAAI,QAAQ;CACnC,MAAM,QAAQ,GAAG;CACjB,MAAM,MAAM,cAAc,EAAE;CAC5B,OAAO,UAAU,SAAS,UAAU,QAAQ;AAC7C;AACA,SAAS,cAAc,IAAI,OAAO,KAAK;CACtC,MAAM,UAAU,GAAG;CACnB,MAAM,MAAM,cAAc,EAAE;CAC5B,OAAO,WAAW,SAAS,OAAO,UAAU;AAC7C;AACA,SAAS,gBAAgB,IAAI,QAAQ;CACpC,IAAI,cAAc,aAAa,OAAO,cAAc,OAAO,EAAE;CAC7D,IAAI;CACJ,IAAI;CACJ,KAAK,MAAM,SAAS,GAAG,SAAS,GAAG;EAClC,IAAI,CAAC,eAAe,OAAO,MAAM,GAAG;EACpC,IAAI,SAAS,KAAK,GAAG,OAAO;OACvB;GACJ,QAAQ;GACR;EACD;CACD;CACA,IAAI,SAAS,KAAK,GAAG,OAAO,cAAc,KAAK;CAC/C,IAAI,UAAU,KAAK,GAAG,OAAO,gBAAgB,MAAM,MAAM;CACzD,MAAM,YAAY,gBAAgB,MAAM,MAAM,CAAC,CAAC,YAAY;CAC5D,MAAM,aAAa,gBAAgB,OAAO,MAAM,CAAC,CAAC,WAAW;CAC7D,IAAI,cAAc,KAAK,KAAK,eAAe,KAAK,GAAG,OAAO,cAAc,QAAQ,WAAW,UAAU;CACrG,IAAI,cAAc,KAAK,GAAG,OAAO,cAAc,OAAO,SAAS;CAC/D,IAAI,eAAe,KAAK,GAAG,OAAO,cAAc,OAAO,UAAU;CACjE,OAAO,cAAc,KAAK;AAC3B;AACA,SAAS,WAAW,IAAI;CACvB,IAAI,cAAc,aAAa,OAAO;CACtC,KAAK,MAAM,SAAS,GAAG,SAAS,GAAG;EAClC,MAAM,QAAQ,WAAW,KAAK;EAC9B,IAAI,UAAU,KAAK,GAAG,OAAO;CAC9B;AACD;AACA,SAAS,UAAU,IAAI;CACtB,IAAI,cAAc,aAAa,OAAO;CACtC,MAAM,WAAW,MAAM,KAAK,GAAG,SAAS,CAAC;CACzC,KAAK,IAAI,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;EAC9C,MAAM,QAAQ,SAAS;EACvB,IAAI,UAAU,KAAK,GAAG;GACrB,MAAM,QAAQ,UAAU,KAAK;GAC7B,IAAI,UAAU,KAAK,GAAG,OAAO;EAC9B;CACD;AACD;AACA,SAAS,aAAa,IAAI;CACzB,IAAI,UAAU;CACd,SAAS;EACR,MAAM,SAAS,QAAQ;EACvB,IAAI,WAAW,KAAK,GAAG,OAAO,KAAK;EACnC,MAAM,UAAU,OAAO,QAAQ,QAAQ,QAAQ,CAAC;EAChD,IAAI,YAAY,KAAK,GAAG,OAAO;EAC/B,UAAU;CACX;AACD;AACA,SAAS,aAAa,IAAI;CACzB,IAAI,UAAU;CACd,SAAS;EACR,MAAM,SAAS,QAAQ;EACvB,IAAI,WAAW,KAAK,GAAG,OAAO,KAAK;EACnC,MAAM,UAAU,OAAO,QAAQ,QAAQ,QAAQ,CAAC;EAChD,IAAI,YAAY,KAAK,GAAG,OAAO;EAC/B,UAAU;CACX;AACD;AACA,SAAS,YAAY,OAAO,QAAQ,QAAQ,OAAO;CAClD,IAAI,MAAM,SAAS,SAAS,OAAO,IAAI,YAAY,OAAO,QAAQ,QAAQ,KAAK;CAC/E,OAAO,IAAI,WAAW,OAAO,QAAQ,QAAQ,KAAK;AACnD;AACA,SAAS,iBAAiB,OAAO;CAChC,OAAO,IAAI,WAAW,OAAO,GAAG,KAAK,GAAG,CAAC;AAC1C;AAGA,SAAS,eAAe,MAAM,MAAM;CACnC,KAAK,MAAM,SAAS,KAAK,SAAS,GAAG,IAAI,EAAE,iBAAiB,eAAe,MAAM,SAAS,MAAM,OAAO;AACxG;AACA,SAAS,eAAe,MAAM,MAAM;CACnC,KAAK,MAAM,SAAS,KAAK,WAAW,GAAG;EACtC,MAAM,SAAS,KAAK,KAAK;EACzB,IAAI,WAAW,KAAK,GAAG,OAAO;CAC/B;AACD;AACA,UAAU,eAAe,MAAM,MAAM;CACpC,KAAK,MAAM,SAAS,KAAK,WAAW,GAAG;EACtC,MAAM,SAAS,KAAK,KAAK;EACzB,IAAI,WAAW,KAAK,GAAG,MAAM;CAC9B;AACD;AACA,SAAS,IAAI,GAAG,OAAO;CACtB,QAAQ,SAAS;EAChB,KAAK,MAAM,QAAQ,OAAO;GACzB,MAAM,SAAS,KAAK,IAAI;GACxB,IAAI,WAAW,KAAK,GAAG,OAAO;EAC/B;CACD;AACD;;;;;AAKA,SAAS,YAAY,MAAM;CAC1B,IAAI,OAAO;CACX,KAAK,MAAM,SAAS,KAAK,OAAO,GAAG,QAAQ,MAAM;CACjD,OAAO;AACR"}

package/dist/authoring-BffMNBO5.d.mts

@@ -0,0 +1,43 @@
+import { A as AuthoringTypeNamespace, St as instantiateAuthoringTypeConstructor, a as AuthoringContributions, m as AuthoringFieldPresetDescriptor } from "./framework-authoring-C9VTqnML-BXtBl2dJ.mjs";
+import "./temporal-presets-L05Tl534-jgcrZX_O.mjs";
+//#region ../../../1-framework/1-core/framework-components/dist/authoring.d.mts
+//#region src/shared/authoring-type-constructor-call.d.ts
+/** What a type constructor call produces for a column. */
+type AuthoringTypeConstructorOutput = ReturnType<typeof instantiateAuthoringTypeConstructor>;
+/** A type constructor, by its path in an authoring namespace, and the arguments of one call to it. */
+interface AuthoringTypeConstructorCall {
+  readonly path: readonly string[];
+  readonly args: readonly unknown[];
+}
+/**
+ * The first call, in namespace order, to a type constructor in `namespace` that produces exactly
+ * `output`. The inverse of {@link instantiateAuthoringTypeConstructor} for constructors whose type
+ * parameters each come straight from one argument. A constructor whose argument names another
+ * entity is never chosen. `undefined` when no call produces `output`.
+ */
+declare function findAuthoringTypeConstructorCall(namespace: AuthoringTypeNamespace, output: AuthoringTypeConstructorOutput): AuthoringTypeConstructorCall | undefined;
+//#endregion
+//#region src/shared/field-preset-resolution.d.ts
+/**
+ * Walks `authoringContributions.field` segment by segment and returns the field-preset descriptor at the path, or `undefined` when none is registered there.
+ */
+declare function getAuthoringFieldPreset(contributions: AuthoringContributions | undefined, path: readonly string[]): AuthoringFieldPresetDescriptor | undefined;
+/**
+ * Returns the namespace prefix of `attributeName` when it names an extension namespace that is not composed, otherwise `undefined`. A namespace is recognized when it is:
+ *
+ * - `db` (native-type spec, always allowed),
+ * - the active family id,
+ * - the active target id,
+ * - a registered field-preset namespace (e.g. `temporal`),
+ * - present in `composedExtensions`.
+ *
+ * Family, target, and field-preset namespaces are exempt so an attribute that does not exist under them surfaces as an unsupported attribute rather than as an uncomposed extension namespace.
+ */
+declare function checkUncomposedNamespace(attributeName: string, composedExtensions: ReadonlySet<string>, context?: {
+  readonly familyId?: string;
+  readonly targetId?: string;
+  readonly authoringContributions?: AuthoringContributions | undefined;
+}): string | undefined;
+//#endregion
+export { getAuthoringFieldPreset as a, findAuthoringTypeConstructorCall as i, AuthoringTypeConstructorOutput as n, checkUncomposedNamespace as r, AuthoringTypeConstructorCall as t };
+//# sourceMappingURL=authoring-BffMNBO5.d.mts.map

package/dist/authoring-BffMNBO5.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"authoring-BffMNBO5.d.mts","names":[],"sources":["../../../../1-framework/1-core/framework-components/dist/authoring.d.mts"],"mappings":";;;;;KAIK,iCAAiC,kBAAkB;;UAE9C;WACC;WACA;;;;;;;;iBAQM,iCAAiC,WAAW,wBAAwB,QAAQ,iCAAiC;;;;;;iBAM7G,wBAAwB,eAAe,oCAAoC,0BAA0B;;;;;;;;;;;;iBAYrG,yBAAyB,uBAAuB,oBAAoB,qBAAqB;WAC/F;WACA;WACA,yBAAyB"}

package/dist/authoring-DbG78eh2.mjs

@@ -0,0 +1,88 @@
+import { t as canonicalizeJson } from "./canonicalize-json-ZPawceQR-Dua1VNEB.mjs";
+import { g as isAuthoringFieldPresetDescriptor, m as isAuthoringArgRef, p as instantiateAuthoringTypeConstructor, u as hasRegisteredFieldNamespace, y as isAuthoringTypeConstructorDescriptor } from "./temporal-presets-DABMpaxB-DDEaCwpa.mjs";
+//#region ../../../1-framework/1-core/framework-components/dist/authoring.mjs
+function* typeConstructors(namespace, path = []) {
+	for (const [name, value] of Object.entries(namespace)) if (isAuthoringTypeConstructorDescriptor(value)) yield {
+		path: [...path, name],
+		descriptor: value
+	};
+	else yield* typeConstructors(value, [...path, name]);
+}
+function produces(produced, wanted) {
+	const wantedFields = {
+		...wanted,
+		typeParams: wanted.typeParams ?? {}
+	};
+	return Object.entries({
+		...produced,
+		typeParams: produced.typeParams ?? {}
+	}).every(([key, value]) => canonicalizeJson(value) === canonicalizeJson(wantedFields[key]));
+}
+/**
+* The arguments that make `descriptor` produce exactly `output`, when each of its type parameters
+* comes straight from one argument; `undefined` when it cannot produce `output`, including when
+* `output` has no value for an argument the constructor requires.
+*/
+function argumentsFor(descriptor, output) {
+	if (descriptor.entityRefArg !== void 0 || descriptor.output.codecId !== output.codecId) return;
+	const args = [];
+	for (const [key, template] of Object.entries(descriptor.output.typeParams ?? {})) {
+		const value = output.typeParams?.[key];
+		if (value !== void 0 && isAuthoringArgRef(template) && template.path === void 0) args[template.index] = value;
+	}
+	const requiredArgs = (descriptor.args ?? []).filter((arg) => arg.optional !== true).length;
+	if (args.length < requiredArgs || Array.from(args).includes(void 0)) return void 0;
+	try {
+		return produces(instantiateAuthoringTypeConstructor(descriptor, args), output) ? args : void 0;
+	} catch {
+		return;
+	}
+}
+/**
+* The first call, in namespace order, to a type constructor in `namespace` that produces exactly
+* `output`. The inverse of {@link instantiateAuthoringTypeConstructor} for constructors whose type
+* parameters each come straight from one argument. A constructor whose argument names another
+* entity is never chosen. `undefined` when no call produces `output`.
+*/
+function findAuthoringTypeConstructorCall(namespace, output) {
+	for (const { path, descriptor } of typeConstructors(namespace)) {
+		const args = argumentsFor(descriptor, output);
+		if (args !== void 0) return {
+			path,
+			args
+		};
+	}
+}
+/**
+* Walks `authoringContributions.field` segment by segment and returns the field-preset descriptor at the path, or `undefined` when none is registered there.
+*/
+function getAuthoringFieldPreset(contributions, path) {
+	let current = contributions?.field;
+	for (const segment of path) {
+		if (typeof current !== "object" || current === null || "kind" in current) return;
+		current = current[segment];
+	}
+	return current !== void 0 && isAuthoringFieldPresetDescriptor(current) ? current : void 0;
+}
+/**
+* Returns the namespace prefix of `attributeName` when it names an extension namespace that is not composed, otherwise `undefined`. A namespace is recognized when it is:
+*
+* - `db` (native-type spec, always allowed),
+* - the active family id,
+* - the active target id,
+* - a registered field-preset namespace (e.g. `temporal`),
+* - present in `composedExtensions`.
+*
+* Family, target, and field-preset namespaces are exempt so an attribute that does not exist under them surfaces as an unsupported attribute rather than as an uncomposed extension namespace.
+*/
+function checkUncomposedNamespace(attributeName, composedExtensions, context) {
+	const dotIndex = attributeName.indexOf(".");
+	if (dotIndex <= 0 || dotIndex === attributeName.length - 1) return;
+	const namespace = attributeName.slice(0, dotIndex);
+	if (namespace === "db" || namespace === context?.familyId || namespace === context?.targetId || hasRegisteredFieldNamespace(context?.authoringContributions, namespace) || composedExtensions.has(namespace)) return;
+	return namespace;
+}
+//#endregion
+export { findAuthoringTypeConstructorCall as n, getAuthoringFieldPreset as r, checkUncomposedNamespace as t };
+
+//# sourceMappingURL=authoring-DbG78eh2.mjs.map

package/dist/authoring-DbG78eh2.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"authoring-DbG78eh2.mjs","names":[],"sources":["../../../../1-framework/1-core/framework-components/dist/authoring.mjs"],"sourcesContent":["import { t as canonicalizeJson } from \"./canonicalize-json-ZPawceQR.mjs\";\nimport { A as resolveEnumCodecId, C as isAuthoringTypeConstructorDescriptor, E as loweringEntryKey, O as mergeAuthoringNamespaces, S as isAuthoringPslBlockDescriptor, T as isLoweringEntryKey, _ as instantiateAuthoringTypeConstructor, a as temporalCodecPreset, b as isAuthoringFieldPresetDescriptor, c as assertNoCrossRegistryCollisions, f as collectScalarTypeConstructors, g as instantiateAuthoringFieldPreset, h as instantiateAuthoringEntityType, i as temporalAuthoringPresets, j as validateAuthoringHelperArguments, k as resolveAuthoringTemplateValue, l as assertResolvableTypeConstructorTemplates, m as hasRegisteredFieldNamespace, n as TEMPORAL_ON_UPDATE_ARG, o as temporalPhaseTemplate, p as flushAuthoringWarnings, r as TIMESTAMP_NOW_GENERATOR_ID, t as TEMPORAL_ON_CREATE_ARG, u as classifyEnumMemberType, v as isAuthoringArgRef, w as isDataTypeLoweringEntry, x as isAuthoringModelAttributeDescriptor, y as isAuthoringEntityTypeDescriptor } from \"./temporal-presets-DABMpaxB.mjs\";\n//#region src/shared/authoring-type-constructor-call.ts\nfunction* typeConstructors(namespace, path = []) {\n\tfor (const [name, value] of Object.entries(namespace)) if (isAuthoringTypeConstructorDescriptor(value)) yield {\n\t\tpath: [...path, name],\n\t\tdescriptor: value\n\t};\n\telse yield* typeConstructors(value, [...path, name]);\n}\nfunction produces(produced, wanted) {\n\tconst wantedFields = {\n\t\t...wanted,\n\t\ttypeParams: wanted.typeParams ?? {}\n\t};\n\treturn Object.entries({\n\t\t...produced,\n\t\ttypeParams: produced.typeParams ?? {}\n\t}).every(([key, value]) => canonicalizeJson(value) === canonicalizeJson(wantedFields[key]));\n}\n/**\n* The arguments that make `descriptor` produce exactly `output`, when each of its type parameters\n* comes straight from one argument; `undefined` when it cannot produce `output`, including when\n* `output` has no value for an argument the constructor requires.\n*/\nfunction argumentsFor(descriptor, output) {\n\tif (descriptor.entityRefArg !== void 0 || descriptor.output.codecId !== output.codecId) return;\n\tconst args = [];\n\tfor (const [key, template] of Object.entries(descriptor.output.typeParams ?? {})) {\n\t\tconst value = output.typeParams?.[key];\n\t\tif (value !== void 0 && isAuthoringArgRef(template) && template.path === void 0) args[template.index] = value;\n\t}\n\tconst requiredArgs = (descriptor.args ?? []).filter((arg) => arg.optional !== true).length;\n\tif (args.length < requiredArgs || Array.from(args).includes(void 0)) return void 0;\n\ttry {\n\t\treturn produces(instantiateAuthoringTypeConstructor(descriptor, args), output) ? args : void 0;\n\t} catch {\n\t\treturn;\n\t}\n}\n/**\n* The first call, in namespace order, to a type constructor in `namespace` that produces exactly\n* `output`. The inverse of {@link instantiateAuthoringTypeConstructor} for constructors whose type\n* parameters each come straight from one argument. A constructor whose argument names another\n* entity is never chosen. `undefined` when no call produces `output`.\n*/\nfunction findAuthoringTypeConstructorCall(namespace, output) {\n\tfor (const { path, descriptor } of typeConstructors(namespace)) {\n\t\tconst args = argumentsFor(descriptor, output);\n\t\tif (args !== void 0) return {\n\t\t\tpath,\n\t\t\targs\n\t\t};\n\t}\n}\n//#endregion\n//#region src/shared/field-preset-resolution.ts\n/**\n* Walks `authoringContributions.field` segment by segment and returns the field-preset descriptor at the path, or `undefined` when none is registered there.\n*/\nfunction getAuthoringFieldPreset(contributions, path) {\n\tlet current = contributions?.field;\n\tfor (const segment of path) {\n\t\tif (typeof current !== \"object\" || current === null || \"kind\" in current) return;\n\t\tcurrent = current[segment];\n\t}\n\treturn current !== void 0 && isAuthoringFieldPresetDescriptor(current) ? current : void 0;\n}\n/**\n* Returns the namespace prefix of `attributeName` when it names an extension namespace that is not composed, otherwise `undefined`. A namespace is recognized when it is:\n*\n* - `db` (native-type spec, always allowed),\n* - the active family id,\n* - the active target id,\n* - a registered field-preset namespace (e.g. `temporal`),\n* - present in `composedExtensions`.\n*\n* Family, target, and field-preset namespaces are exempt so an attribute that does not exist under them surfaces as an unsupported attribute rather than as an uncomposed extension namespace.\n*/\nfunction checkUncomposedNamespace(attributeName, composedExtensions, context) {\n\tconst dotIndex = attributeName.indexOf(\".\");\n\tif (dotIndex <= 0 || dotIndex === attributeName.length - 1) return;\n\tconst namespace = attributeName.slice(0, dotIndex);\n\tif (namespace === \"db\" || namespace === context?.familyId || namespace === context?.targetId || hasRegisteredFieldNamespace(context?.authoringContributions, namespace) || composedExtensions.has(namespace)) return;\n\treturn namespace;\n}\n//#endregion\nexport { TEMPORAL_ON_CREATE_ARG, TEMPORAL_ON_UPDATE_ARG, TIMESTAMP_NOW_GENERATOR_ID, assertNoCrossRegistryCollisions, assertResolvableTypeConstructorTemplates, checkUncomposedNamespace, classifyEnumMemberType, collectScalarTypeConstructors, findAuthoringTypeConstructorCall, flushAuthoringWarnings, getAuthoringFieldPreset, hasRegisteredFieldNamespace, instantiateAuthoringEntityType, instantiateAuthoringFieldPreset, instantiateAuthoringTypeConstructor, isAuthoringArgRef, isAuthoringEntityTypeDescriptor, isAuthoringFieldPresetDescriptor, isAuthoringModelAttributeDescriptor, isAuthoringPslBlockDescriptor, isAuthoringTypeConstructorDescriptor, isDataTypeLoweringEntry, isLoweringEntryKey, loweringEntryKey, mergeAuthoringNamespaces, resolveAuthoringTemplateValue, resolveEnumCodecId, temporalAuthoringPresets, temporalCodecPreset, temporalPhaseTemplate, validateAuthoringHelperArguments };\n\n//# sourceMappingURL=authoring.mjs.map"],"mappings":";;;AAGA,UAAU,iBAAiB,WAAW,OAAO,CAAC,GAAG;CAChD,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,SAAS,GAAG,IAAI,qCAAqC,KAAK,GAAG,MAAM;EAC7G,MAAM,CAAC,GAAG,MAAM,IAAI;EACpB,YAAY;CACb;MACK,OAAO,iBAAiB,OAAO,CAAC,GAAG,MAAM,IAAI,CAAC;AACpD;AACA,SAAS,SAAS,UAAU,QAAQ;CACnC,MAAM,eAAe;EACpB,GAAG;EACH,YAAY,OAAO,cAAc,CAAC;CACnC;CACA,OAAO,OAAO,QAAQ;EACrB,GAAG;EACH,YAAY,SAAS,cAAc,CAAC;CACrC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,WAAW,iBAAiB,KAAK,MAAM,iBAAiB,aAAa,IAAI,CAAC;AAC3F;;;;;;AAMA,SAAS,aAAa,YAAY,QAAQ;CACzC,IAAI,WAAW,iBAAiB,KAAK,KAAK,WAAW,OAAO,YAAY,OAAO,SAAS;CACxF,MAAM,OAAO,CAAC;CACd,KAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,WAAW,OAAO,cAAc,CAAC,CAAC,GAAG;EACjF,MAAM,QAAQ,OAAO,aAAa;EAClC,IAAI,UAAU,KAAK,KAAK,kBAAkB,QAAQ,KAAK,SAAS,SAAS,KAAK,GAAG,KAAK,SAAS,SAAS;CACzG;CACA,MAAM,gBAAgB,WAAW,QAAQ,CAAC,EAAA,CAAG,QAAQ,QAAQ,IAAI,aAAa,IAAI,CAAC,CAAC;CACpF,IAAI,KAAK,SAAS,gBAAgB,MAAM,KAAK,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,GAAG,OAAO,KAAK;CACjF,IAAI;EACH,OAAO,SAAS,oCAAoC,YAAY,IAAI,GAAG,MAAM,IAAI,OAAO,KAAK;CAC9F,QAAQ;EACP;CACD;AACD;;;;;;;AAOA,SAAS,iCAAiC,WAAW,QAAQ;CAC5D,KAAK,MAAM,EAAE,MAAM,gBAAgB,iBAAiB,SAAS,GAAG;EAC/D,MAAM,OAAO,aAAa,YAAY,MAAM;EAC5C,IAAI,SAAS,KAAK,GAAG,OAAO;GAC3B;GACA;EACD;CACD;AACD;;;;AAMA,SAAS,wBAAwB,eAAe,MAAM;CACrD,IAAI,UAAU,eAAe;CAC7B,KAAK,MAAM,WAAW,MAAM;EAC3B,IAAI,OAAO,YAAY,YAAY,YAAY,QAAQ,UAAU,SAAS;EAC1E,UAAU,QAAQ;CACnB;CACA,OAAO,YAAY,KAAK,KAAK,iCAAiC,OAAO,IAAI,UAAU,KAAK;AACzF;;;;;;;;;;;;AAYA,SAAS,yBAAyB,eAAe,oBAAoB,SAAS;CAC7E,MAAM,WAAW,cAAc,QAAQ,GAAG;CAC1C,IAAI,YAAY,KAAK,aAAa,cAAc,SAAS,GAAG;CAC5D,MAAM,YAAY,cAAc,MAAM,GAAG,QAAQ;CACjD,IAAI,cAAc,QAAQ,cAAc,SAAS,YAAY,cAAc,SAAS,YAAY,4BAA4B,SAAS,wBAAwB,SAAS,KAAK,mBAAmB,IAAI,SAAS,GAAG;CAC9M,OAAO;AACR"}

package/dist/{utils-DMAM0unR.mjs → canonicalize-json-ZPawceQR-Dua1VNEB.mjs}

@@ -1,4 +1,4 @@
-//#region ../../../1-framework/1-core/framework-components/dist/utils.mjs
+//#region ../../../1-framework/1-core/framework-components/dist/canonicalize-json-ZPawceQR.mjs
 function sortKeys(value) {
 	if (value === null || typeof value !== "object") return value;
 	if (Array.isArray(value)) return value.map(sortKeys);
@@ -17,4 +17,4 @@ function canonicalizeJson(value) {
 //#endregion
 export { canonicalizeJson as t };
 
-//# sourceMappingURL=utils-DMAM0unR.mjs.map
+//# sourceMappingURL=canonicalize-json-ZPawceQR-Dua1VNEB.mjs.map

package/dist/canonicalize-json-ZPawceQR-Dua1VNEB.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"canonicalize-json-ZPawceQR-Dua1VNEB.mjs","names":[],"sources":["../../../../1-framework/1-core/framework-components/dist/canonicalize-json-ZPawceQR.mjs"],"sourcesContent":["//#region src/utils/canonicalize-json.ts\nfunction sortKeys(value) {\n\tif (value === null || typeof value !== \"object\") return value;\n\tif (Array.isArray(value)) return value.map(sortKeys);\n\tconst sorted = Object.create(null);\n\tfor (const key of Object.keys(value).sort()) sorted[key] = sortKeys(value[key]);\n\treturn sorted;\n}\n/**\n* `JSON.stringify` with object keys sorted lexicographically at every level. Two structurally equal values produce the same string regardless of object key insertion order, so the result is a stable cache key for JSON-shaped values.\n*\n* Array order is preserved; primitives serialise as their JSON form. Inputs are expected to be JSON-safe (the typeParams shape on {@link CodecRef} is `JsonValue`-constrained for this reason); callers that need to canonicalise non-JSON-safe values (BigInt, Dates, typed arrays) should use `canonicalStringify` from `@internal/utils/canonical-stringify` instead.\n*/\nfunction canonicalizeJson(value) {\n\treturn JSON.stringify(sortKeys(value));\n}\n//#endregion\nexport { canonicalizeJson as t };\n\n//# sourceMappingURL=canonicalize-json-ZPawceQR.mjs.map"],"mappings":";AACA,SAAS,SAAS,OAAO;CACxB,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU,OAAO;CACxD,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,MAAM,IAAI,QAAQ;CACnD,MAAM,SAAS,OAAO,OAAO,IAAI;CACjC,KAAK,MAAM,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,KAAK,GAAG,OAAO,OAAO,SAAS,MAAM,IAAI;CAC9E,OAAO;AACR;;;;;;AAMA,SAAS,iBAAiB,OAAO;CAChC,OAAO,KAAK,UAAU,SAAS,KAAK,CAAC;AACtC"}