@rsconcept/domain 2.1.2 → 2.3.0

package/dist/diagnostics-CljEzVBV.js

@@ -0,0 +1,1245 @@
+import { Graph } from "./graph/graph.js";
+import { TypeClass, TypeID, basic, bool, constant, isTypification } from "./rslang/semantic/typification.js";
+import { labelType } from "./rslang/labels.js";
+import { applyEntityReferenceMapping, extractEntities, parseGrammemes, resolveTextReferences } from "./cctext/language-api.js";
+import { generateExpressionFromAst } from "./rslang/parser/expression-generator.js";
+import { applyAliasMapping, applyTypificationMapping, extractGlobals, isSimpleExpression, parseRSLangExpression, splitTemplateDefinition } from "./rslang/api.js";
+import { CstClass, CstStatus, CstType } from "./library/rsform.js";
+import { RSErrorCode } from "./rslang/error.js";
+import { applyPath } from "./rslang/semantic/typification-api.js";
+import { ValueClass } from "./rslang/semantic/value-class.js";
+import "./rslang/index.js";
+import "./graph/index.js";
+import { EvalStatus } from "./library/rsmodel.js";
+//#region src/library/rsform-api/cst-type.ts
+/**
+* CstType classification, prefixes, and capability predicates.
+*/
+/** Record of {@link CstType} prefixes. */
+const CST_TYPE_PREFIX = {
+	[CstType.NOMINAL]: "N",
+	[CstType.BASE]: "X",
+	[CstType.CONSTANT]: "C",
+	[CstType.STRUCTURED]: "S",
+	[CstType.AXIOM]: "A",
+	[CstType.TERM]: "D",
+	[CstType.FUNCTION]: "F",
+	[CstType.PREDICATE]: "P",
+	[CstType.STATEMENT]: "T"
+};
+/** Record of {@link CstType} to {@link CstClass} mapping. */
+const CST_TYPE_TO_CLASS = {
+	[CstType.NOMINAL]: CstClass.NOMINAL,
+	[CstType.BASE]: CstClass.BASIC,
+	[CstType.CONSTANT]: CstClass.BASIC,
+	[CstType.STRUCTURED]: CstClass.BASIC,
+	[CstType.TERM]: CstClass.DERIVED,
+	[CstType.FUNCTION]: CstClass.DERIVED,
+	[CstType.AXIOM]: CstClass.STATEMENT,
+	[CstType.PREDICATE]: CstClass.DERIVED,
+	[CstType.STATEMENT]: CstClass.STATEMENT
+};
+/** Prefix for alias indicating {@link CstType}. */
+function getCstTypePrefix(type) {
+	return CST_TYPE_PREFIX[type];
+}
+/** Guess {@link CstType} from user input hint. */
+function guessCstType(hint) {
+	if (hint.length !== 1) return null;
+	for (const [type, prefix] of Object.entries(CST_TYPE_PREFIX)) if (hint === prefix) return type;
+	return null;
+}
+/** Infers the {@link CstClass} based on the provided {@link CstType} and template status. */
+function inferClass(type, isTemplate = false) {
+	if (isTemplate) return CstClass.TEMPLATE;
+	return CST_TYPE_TO_CLASS[type];
+}
+/** Check if {@link Constituenta} is a template or a category. */
+function isTemplateCst(cst) {
+	return cst.cst_type === CstType.FUNCTION || cst.cst_type === CstType.PREDICATE || cst.cst_type === CstType.STATEMENT;
+}
+/** Evaluate if {@link CstType} is basic concept. */
+function isBasicConcept(type) {
+	switch (type) {
+		case CstType.NOMINAL:
+		case CstType.BASE:
+		case CstType.CONSTANT:
+		case CstType.STRUCTURED:
+		case CstType.AXIOM: return true;
+		case CstType.TERM:
+		case CstType.FUNCTION:
+		case CstType.PREDICATE:
+		case CstType.STATEMENT: return false;
+	}
+}
+/** Evaluate if {@link CstType} is base set or constant set. */
+function isBaseSet(type) {
+	switch (type) {
+		case CstType.BASE:
+		case CstType.CONSTANT: return true;
+		case CstType.NOMINAL:
+		case CstType.STRUCTURED:
+		case CstType.AXIOM:
+		case CstType.TERM:
+		case CstType.FUNCTION:
+		case CstType.PREDICATE:
+		case CstType.STATEMENT: return false;
+	}
+}
+/** Evaluate if {@link CstType} is a function. */
+function isFunctional(type) {
+	switch (type) {
+		case CstType.FUNCTION:
+		case CstType.PREDICATE: return true;
+		case CstType.NOMINAL:
+		case CstType.BASE:
+		case CstType.CONSTANT:
+		case CstType.STRUCTURED:
+		case CstType.AXIOM:
+		case CstType.TERM:
+		case CstType.STATEMENT: return false;
+	}
+}
+/** Evaluate if {@link CstType} is logical. */
+function isLogical(type) {
+	switch (type) {
+		case CstType.AXIOM:
+		case CstType.STATEMENT: return true;
+		case CstType.NOMINAL:
+		case CstType.BASE:
+		case CstType.CONSTANT:
+		case CstType.STRUCTURED:
+		case CstType.TERM:
+		case CstType.FUNCTION:
+		case CstType.PREDICATE: return false;
+	}
+}
+/** Evaluate if {@link CstType} can have manual typification. */
+function canHaveManualTypification(type) {
+	switch (type) {
+		case CstType.STRUCTURED:
+		case CstType.TERM:
+		case CstType.FUNCTION:
+		case CstType.PREDICATE: return true;
+		case CstType.NOMINAL:
+		case CstType.BASE:
+		case CstType.CONSTANT:
+		case CstType.AXIOM:
+		case CstType.STATEMENT: return false;
+	}
+}
+/** Checks whether a constituenta type supports formal definitions. */
+function canHaveFormalDefinition(cstType) {
+	return cstType !== CstType.BASE && cstType !== CstType.CONSTANT;
+}
+/** Returns expected {@link TypeClass} of formal definition for {@link CstType}. */
+function typeClassForCstType(cstType) {
+	switch (cstType) {
+		case CstType.NOMINAL:
+		case CstType.BASE:
+		case CstType.CONSTANT:
+		case CstType.STRUCTURED:
+		case CstType.TERM: return TypeClass.typification;
+		case CstType.FUNCTION: return TypeClass.function;
+		case CstType.PREDICATE: return TypeClass.predicate;
+		case CstType.AXIOM:
+		case CstType.STATEMENT: return TypeClass.logic;
+	}
+}
+/** Evaluate if {@link Constituenta} can be used produce structure. */
+function canProduceStructure(cst) {
+	switch (cst.cst_type) {
+		case CstType.NOMINAL:
+		case CstType.BASE:
+		case CstType.CONSTANT:
+		case CstType.AXIOM:
+		case CstType.STATEMENT:
+		case CstType.PREDICATE: return false;
+	}
+	if (!cst.effectiveType) return false;
+	if (cst.cst_type === CstType.FUNCTION) {
+		const result = cst.effectiveType.result;
+		return typeCanProduceStructure(result);
+	}
+	if (!isTypification(cst.effectiveType)) return false;
+	return typeCanProduceStructure(cst.effectiveType);
+}
+function typeCanProduceStructure(type) {
+	if (type.typeID === TypeID.basic || type.typeID === TypeID.integer || type.typeID === TypeID.anyTypification) return false;
+	else if (type.typeID === TypeID.tuple) return true;
+	else return type.base.typeID !== TypeID.basic && type.base.typeID !== TypeID.integer && type.base.typeID !== TypeID.anyTypification;
+}
+//#endregion
+//#region src/library/rsform-api/alias.ts
+/**
+* Alias generation, validation, and remapping.
+*/
+/** Build alias mapping from template argument bindings. */
+function argumentValuesToMapping(args) {
+	const mapping = {};
+	for (const arg of args) if (arg.value) mapping[arg.alias] = arg.value;
+	return mapping;
+}
+/** Validate alias format for a given {@link CstType} (prefix + digits, min length 2). */
+function validateAliasFormat(alias, type) {
+	if (alias.length < 2) return false;
+	const prefix = getCstTypePrefix(type);
+	if (!alias.startsWith(prefix)) return false;
+	if (!/^\d+$/.exec(alias.substring(prefix.length))) return false;
+	return true;
+}
+/** Validate new alias against {@link CstType} and {@link RSForm}. */
+function validateNewAlias(alias, type, schema) {
+	if (!validateAliasFormat(alias, type)) return false;
+	if (schema.cstByAlias.has(alias)) return false;
+	return true;
+}
+/** Generate alias for new {@link Constituenta} of a given {@link CstType} for current {@link RSForm}. */
+function generateAlias(type, schema, takenAliases = []) {
+	const prefix = getCstTypePrefix(type);
+	let index = schema.items.reduce((prev, cst) => {
+		if (cst.cst_type !== type) return prev;
+		const next = Number(cst.alias.substring(prefix.length)) + 1;
+		return Math.max(prev, next);
+	}, 1);
+	let alias = `${prefix}${index}`;
+	while (takenAliases.includes(alias)) {
+		index = index + 1;
+		alias = `${prefix}${index}`;
+	}
+	return alias;
+}
+/**
+* Remap formal expressions and terminological entity references in constituent fields.
+* Mutates each element of `items` in place; pass owned or cloned data only.
+*/
+function applyMappingToConstituents(items, mapping, changeAliases) {
+	for (const cst of items) {
+		if (changeAliases && cst.alias in mapping) cst.alias = mapping[cst.alias];
+		cst.definition_formal = applyAliasMapping(cst.definition_formal, mapping);
+		cst.typification_manual = applyTypificationMapping(cst.typification_manual, mapping);
+		cst.term_raw = applyEntityReferenceMapping(cst.term_raw, mapping);
+		cst.definition_raw = applyEntityReferenceMapping(cst.definition_raw, mapping);
+	}
+}
+/** Highest numeric alias suffix for {@link type} among {@link items} (0 when none). */
+function maxAliasIndex(items, type) {
+	const prefix = getCstTypePrefix(type);
+	return items.reduce((max, cst) => {
+		if (cst.cst_type !== type) return max;
+		const index = Number(cst.alias.slice(prefix.length));
+		return Number.isFinite(index) ? Math.max(max, index) : max;
+	}, 0);
+}
+/**
+* Build alias → new-alias mapping that renumbers each type sequentially in list order.
+* Matches backend {@code RSFormCached.reset_aliases}.
+*/
+function buildSequentialAliasMapping(items) {
+	const counts = {};
+	for (const value of Object.values(CstType)) counts[value] = 1;
+	const mapping = {};
+	for (const cst of items) {
+		const alias = `${getCstTypePrefix(cst.cst_type)}${counts[cst.cst_type]}`;
+		counts[cst.cst_type] += 1;
+		if (cst.alias !== alias) mapping[cst.alias] = alias;
+	}
+	return mapping;
+}
+/**
+* Allocate fresh aliases for {@link source} constituents being imported into a non-empty receiver.
+* Returns an empty mapping when the receiver has no items (aliases kept as-is).
+*/
+function allocateImportAliases(receiver, source) {
+	if (receiver.length === 0) return {};
+	const counts = {};
+	for (const value of Object.values(CstType)) counts[value] = maxAliasIndex(receiver, value);
+	const mapping = {};
+	for (const cst of source) {
+		counts[cst.cst_type] += 1;
+		mapping[cst.alias] = `${getCstTypePrefix(cst.cst_type)}${counts[cst.cst_type]}`;
+	}
+	return mapping;
+}
+/** Remove alias from expression. */
+function removeAliasReference(expression, alias) {
+	const escaped = alias.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+	return expression.replaceAll(new RegExp(`\\b${escaped}\\b`, "g"), "").trim();
+}
+/** Add alias to expression. */
+function addAliasReference(expression, alias) {
+	return expression + " " + alias;
+}
+//#endregion
+//#region src/library/rsform-api/analysis.ts
+function getAnalysisFor(expression, cstType, schema, alias) {
+	if (!canHaveFormalDefinition(cstType)) {
+		if (expression.trim().length === 0) {
+			const fallbackAlias = alias && alias.length > 0 ? alias : "X0";
+			return {
+				success: true,
+				type: cstType === CstType.BASE ? bool(basic(fallbackAlias)) : bool(constant(fallbackAlias)),
+				valueClass: ValueClass.VALUE,
+				errors: [],
+				ast: null
+			};
+		}
+		return {
+			success: false,
+			type: null,
+			valueClass: null,
+			errors: [{
+				code: RSErrorCode.definitionNotAllowed,
+				from: 0,
+				to: Math.max(expression.length, 1),
+				params: [cstType, alias ?? ""]
+			}],
+			ast: null
+		};
+	}
+	return refineAnalysisForDependencyCycles(schema.analyzer.checkFull(expression, {
+		expected: typeClassForCstType(cstType),
+		isDomain: cstType === CstType.STRUCTURED
+	}), expression, schema, alias);
+}
+/**
+* When an untyped / bare F·P reference names a constituent on a definition cycle with the
+* current expression, replace that error with {@link RSDiagnosticCode.schemaDependencyCycle}.
+*
+* Covers both semantic `globalNotTyped` (e.g. `F3[σ]`) and parser `globalFuncWithoutArgs`
+* (bare `P1` / `F1` treated as a call without arguments).
+*
+* Uses a draft dependency graph: incoming edges of the edited constituent are taken from
+* `expression`, so Check works before Save.
+*/
+function refineAnalysisForDependencyCycles(analysis, expression, schema, alias) {
+	if (analysis.errors.length === 0 || !schema.graph) return analysis;
+	const currentId = alias ? schema.cstByAlias.get(alias)?.id : void 0;
+	const expressionGlobals = extractGlobals(expression);
+	const draftGraph = currentId !== void 0 ? buildDraftDependencyGraph(schema, currentId, expressionGlobals) : schema.graph;
+	let changed = false;
+	const errors = analysis.errors.map((error) => {
+		if (error.code !== RSErrorCode.globalNotTyped && error.code !== RSErrorCode.globalFuncWithoutArgs) return error;
+		const missingAlias = error.params?.[0];
+		if (!missingAlias) return error;
+		const missing = schema.cstByAlias.get(missingAlias);
+		if (!missing) return error;
+		const cycleText = resolveDependencyCycleText(schema, draftGraph, currentId, missing.id);
+		if (!cycleText) return error;
+		changed = true;
+		return {
+			...error,
+			code: RSErrorCode.schemaDependencyCycle,
+			params: [cycleText]
+		};
+	});
+	return changed ? {
+		...analysis,
+		errors
+	} : analysis;
+}
+/**
+* Clone the schema graph and replace dependencies of `currentId` with globals from the
+* expression under check (unsaved draft).
+*/
+function buildDraftDependencyGraph(schema, currentId, expressionGlobals) {
+	const graph = schema.graph.clone();
+	const node = graph.at(currentId);
+	if (node) for (const parentId of [...node.inputs]) graph.removeEdge(parentId, currentId);
+	else graph.addNode(currentId);
+	for (const globalAlias of expressionGlobals) {
+		const source = schema.cstByAlias.get(globalAlias);
+		if (source) graph.addEdge(source.id, currentId);
+	}
+	return graph;
+}
+/**
+* Resolve formatted cycle text for an untyped global reference in analysis.
+*
+* Uses `graph` (often a draft graph built from the expression under check). When
+* `currentId` is omitted, falls back to schema diagnostics on `missingId`.
+*
+* @returns Closed alias path such as `F3 → P1 → F3`, or `null` when no shared cycle exists.
+*/
+function resolveDependencyCycleText(schema, graph, currentId, missingId) {
+	for (const cycle of graph.findCycles()) {
+		const members = new Set(cycle);
+		if (!members.has(missingId)) continue;
+		if (currentId !== void 0 && !members.has(currentId)) continue;
+		return formatDependencyCycle(cycle.map((id) => schema.cstByID.get(id)?.alias ?? String(id)));
+	}
+	if (currentId === void 0) return (schema.cstByID.get(missingId)?.diagnostics.find((item) => item.code === RSDiagnosticCode.schemaDependencyCycle))?.params?.[0] ?? null;
+	return null;
+}
+//#endregion
+//#region src/library/rsform-api/attribution.ts
+function attributionKey(attr) {
+	return `${attr.container}:${attr.attribute}`;
+}
+/**
+* Remap attributions when constituents are substituted (original → replacement).
+* Drops self-loops and duplicates. Matches sandbox / backend substitute attribution rewrite.
+*/
+function remapAttributionsUnderSubstitution(attributions, origToSub) {
+	const result = [];
+	const seen = /* @__PURE__ */ new Set();
+	for (const attr of attributions) {
+		if (!origToSub.has(attr.container) && !origToSub.has(attr.attribute)) {
+			const key = attributionKey(attr);
+			if (!seen.has(key)) {
+				seen.add(key);
+				result.push({ ...attr });
+			}
+			continue;
+		}
+		const container = origToSub.get(attr.container) ?? attr.container;
+		const attribute = origToSub.get(attr.attribute) ?? attr.attribute;
+		if (container === attribute) continue;
+		const key = `${container}:${attribute}`;
+		if (seen.has(key)) continue;
+		seen.add(key);
+		result.push({
+			container,
+			attribute
+		});
+	}
+	return result;
+}
+/**
+* Copy attributions whose both endpoints are in {@link sourceIdSet}, remapping ids via {@link idMap}.
+* Appends onto a clone of {@link existing} with dedupe. Used by schema embedding / insert.
+*/
+function importAttributions(sourceAttributions, sourceIdSet, idMap, existing = []) {
+	const result = existing.map((attr) => ({ ...attr }));
+	const seen = new Set(result.map(attributionKey));
+	for (const attr of sourceAttributions) {
+		if (!sourceIdSet.has(attr.container) || !sourceIdSet.has(attr.attribute)) continue;
+		const container = idMap[attr.container];
+		const attribute = idMap[attr.attribute];
+		if (container === void 0 || attribute === void 0 || container === attribute) continue;
+		const key = `${container}:${attribute}`;
+		if (seen.has(key)) continue;
+		seen.add(key);
+		result.push({
+			container,
+			attribute
+		});
+	}
+	return result;
+}
+/** Drop attributions that reference any id in {@link deletedIds}. */
+function filterAttributions(attributions, deletedIds) {
+	return attributions.filter((attr) => !deletedIds.has(attr.container) && !deletedIds.has(attr.attribute));
+}
+//#endregion
+//#region src/library/rsform-api/expression.ts
+/** Infers the status of an expression based on parsing and value information. */
+function inferStatus(parse, value) {
+	if (!parse) return CstStatus.INCORRECT;
+	if (value === null) return CstStatus.INCALCULABLE;
+	if (value === ValueClass.PROPERTY) return CstStatus.PROPERTY;
+	return CstStatus.VERIFIED;
+}
+/** Infers type of constituent for a given template and arguments. */
+function inferTemplatedType(templateType, args) {
+	if (args.length === 0 || args.some((arg) => !arg.value)) return templateType;
+	else if (templateType === CstType.PREDICATE) return CstType.AXIOM;
+	else return CstType.TERM;
+}
+/**
+* Normalize a RSLang expression for duplicate comparison.
+*
+* Returns `null` for basic concepts without formal definitions. Pass a pre-parsed `ast`
+* when the expression was already analyzed to avoid re-parsing.
+*/
+function normalizeExpression(expression, cst_type, ast) {
+	if (isBasicConcept(cst_type) && cst_type !== CstType.AXIOM) return null;
+	const parsed = ast ?? parseRSLangExpression(expression);
+	let normalized = "";
+	if (parsed && !parsed.hasError) normalized = generateExpressionFromAst(parsed, { normalize: true });
+	else normalized = expression;
+	normalized = normalized.replace(/\s+/g, "");
+	return normalized === "" ? null : normalized;
+}
+/** Checks if given expression is a template. */
+function inferTemplate(expression) {
+	const match = expression.match(/R\d+/g);
+	return (match && match?.length > 0) ?? false;
+}
+/** Apply filter based on start {@link Constituenta} type. */
+function applyFilterCategory(start, items) {
+	const startIndex = items.indexOf(start);
+	if (startIndex === -1) return [];
+	const nextCategoryIndex = items.findIndex((cst, index) => index > startIndex && cst.cst_type === CstType.STATEMENT);
+	return items.filter((_, index) => index >= startIndex && (nextCategoryIndex === -1 || index < nextCategoryIndex));
+}
+//#endregion
+//#region src/library/rsform-api/semantic-relations.ts
+/**
+* Infer semantic parent/children used for clustering during restore order.
+* Port of backend {@code SemanticInfo}.
+*/
+function computeSemanticRelations(items, graph) {
+	const byId = new Map(items.map((cst) => [cst.id, cst]));
+	const byAlias = new Map(items.map((cst) => [cst.alias, cst]));
+	const isTemplate = /* @__PURE__ */ new Map();
+	const isSimple = /* @__PURE__ */ new Map();
+	const parentOf = /* @__PURE__ */ new Map();
+	const childrenOf = /* @__PURE__ */ new Map();
+	for (const cst of items) {
+		parentOf.set(cst.id, cst.id);
+		childrenOf.set(cst.id, []);
+	}
+	function needCheckHead(sources, head) {
+		if (sources.size === 0) return true;
+		if (sources.size !== 1) return false;
+		const base = byId.get([...sources][0]);
+		return !isFunctional(base.cst_type) || splitTemplateDefinition(base.definition_formal).head !== head;
+	}
+	function extractSources(target) {
+		const sources = /* @__PURE__ */ new Set();
+		if (!isFunctional(target.cst_type)) {
+			for (const parentId of graph.at(target.id)?.inputs ?? []) if (!(isTemplate.get(parentId) && isSimple.get(parentId))) sources.add(parentOf.get(parentId) ?? parentId);
+			return sources;
+		}
+		const expression = splitTemplateDefinition(target.definition_formal);
+		for (const alias of extractGlobals(expression.body)) {
+			const parent = byAlias.get(alias);
+			if (!parent) continue;
+			if (!(isTemplate.get(parent.id) && isSimple.get(parent.id))) sources.add(parentOf.get(parent.id) ?? parent.id);
+		}
+		if (needCheckHead(sources, expression.head)) for (const alias of extractGlobals(expression.head)) {
+			const parent = byAlias.get(alias);
+			if (!parent) continue;
+			if (!isBaseSet(parent.cst_type) && !(isTemplate.get(parent.id) && isSimple.get(parent.id))) sources.add(parentOf.get(parent.id) ?? parent.id);
+		}
+		return sources;
+	}
+	function inferSimple(target) {
+		if (target.cst_type === CstType.STRUCTURED || isBaseSet(target.cst_type)) return false;
+		if ((graph.at(target.id)?.inputs ?? []).some((id) => isTemplate.get(id) && !isSimple.get(id))) return false;
+		return isSimpleExpression(isFunctional(target.cst_type) ? splitTemplateDefinition(target.definition_formal).body : target.definition_formal);
+	}
+	for (const cstId of graph.topologicalOrder()) {
+		const cst = byId.get(cstId);
+		if (!cst) continue;
+		isTemplate.set(cstId, inferTemplate(cst.definition_formal));
+		isSimple.set(cstId, inferSimple(cst));
+		if (!isSimple.get(cstId) || cst.cst_type === CstType.STRUCTURED) continue;
+		const sources = extractSources(cst);
+		if (sources.size !== 1) continue;
+		const parentId = [...sources][0];
+		const parent = byId.get(parentId);
+		if (!parent || isBaseSet(parent.cst_type)) continue;
+		parentOf.set(cstId, parentId);
+		childrenOf.get(parentId).push(cstId);
+	}
+	return {
+		parentOf,
+		childrenOf
+	};
+}
+//#endregion
+//#region src/library/rsform-api/formal-graph.ts
+/**
+* Formal dependency graph and declaration-order restore for RSForm constituents.
+*/
+/**
+* Build the formal dependency graph: supplier → dependent.
+* Matches backend {@code RSForm.graph_formal}.
+*/
+function buildFormalDependencyGraph(items) {
+	const graph = new Graph();
+	const byAlias = new Map(items.map((cst) => [cst.alias, cst]));
+	for (const cst of items) graph.addNode(cst.id);
+	for (const cst of items) for (const alias of extractGlobals(cst.definition_formal)) {
+		const supplier = byAlias.get(alias);
+		if (supplier) graph.addEdge(supplier.id, cst.id);
+	}
+	return graph;
+}
+/**
+* Reorder constituents: formal topology hard, semantic children sticky when ready,
+* otherwise stable against type/kernel preferred ranks.
+*
+* One Kahn pass over the formal dependency graph.
+*/
+function restoreConstituentOrder(items, graph = buildFormalDependencyGraph(items), relations = computeSemanticRelations(items, graph)) {
+	if (items.length <= 1) return [...items];
+	const byId = new Map(items.map((cst) => [cst.id, cst]));
+	const preferred = kernelPriority(items, graph, relations.parentOf);
+	const rank = new Map(preferred.map((cst, index) => [cst.id, index]));
+	const remainingInputs = /* @__PURE__ */ new Map();
+	for (const cst of preferred) {
+		const inputs = graph.at(cst.id)?.inputs ?? [];
+		remainingInputs.set(cst.id, inputs.reduce((count, src) => count + (rank.has(src) ? 1 : 0), 0));
+	}
+	const ready = /* @__PURE__ */ new Set();
+	for (const cst of preferred) if ((remainingInputs.get(cst.id) ?? 0) === 0) ready.add(cst.id);
+	const children = /* @__PURE__ */ new Map();
+	for (const cst of preferred) children.set(cst.id, (relations.childrenOf.get(cst.id) ?? []).filter((childId) => rank.has(childId)));
+	const result = [];
+	const pendingChildren = [];
+	function enqueueSticky(candidateIds) {
+		const sticky = candidateIds.filter((childId) => ready.has(childId) && !pendingChildren.includes(childId));
+		sticky.sort((left, right) => (rank.get(left) ?? 0) - (rank.get(right) ?? 0));
+		pendingChildren.push(...sticky);
+	}
+	function pickReady() {
+		while (pendingChildren.length > 0) {
+			const childId = pendingChildren.shift();
+			if (ready.has(childId)) return childId;
+		}
+		let best = -1;
+		let bestRank = Number.POSITIVE_INFINITY;
+		for (const nodeId of ready) {
+			const nodeRank = rank.get(nodeId) ?? Number.POSITIVE_INFINITY;
+			if (nodeRank < bestRank) {
+				best = nodeId;
+				bestRank = nodeRank;
+			}
+		}
+		return best;
+	}
+	while (ready.size > 0 || pendingChildren.length > 0) {
+		if (ready.size === 0) {
+			pendingChildren.length = 0;
+			continue;
+		}
+		const nodeId = pickReady();
+		ready.delete(nodeId);
+		result.push(byId.get(nodeId));
+		for (const dependentId of graph.at(nodeId)?.outputs ?? []) {
+			if (!remainingInputs.has(dependentId)) continue;
+			const next = (remainingInputs.get(dependentId) ?? 0) - 1;
+			remainingInputs.set(dependentId, next);
+			if (next === 0) ready.add(dependentId);
+		}
+		enqueueSticky(children.get(nodeId) ?? []);
+	}
+	if (result.length < preferred.length) {
+		const placed = new Set(result.map((cst) => cst.id));
+		for (const cst of preferred) if (!placed.has(cst.id)) result.push(cst);
+	}
+	return result;
+}
+function kernelPriority(items, graph, parentOf) {
+	const byId = new Map(items.map((cst) => [cst.id, cst]));
+	const seen = /* @__PURE__ */ new Set();
+	const result = [];
+	function push(cst) {
+		if (seen.has(cst.id)) return;
+		seen.add(cst.id);
+		result.push(cst);
+	}
+	for (const cst of items) if (cst.cst_type === CstType.BASE) push(cst);
+	for (const cst of items) if (cst.cst_type === CstType.CONSTANT) push(cst);
+	for (const cst of items) if ((graph.at(cst.id)?.inputs.length ?? 0) === 0) push(cst);
+	const kernelSeeds = items.filter((cst) => {
+		const parentId = parentOf.get(cst.id) ?? cst.id;
+		const parent = byId.get(parentId);
+		return cst.cst_type === CstType.STRUCTURED || cst.cst_type === CstType.AXIOM || parent?.cst_type === CstType.STRUCTURED;
+	}).map((cst) => cst.id);
+	const kernel = /* @__PURE__ */ new Set([...kernelSeeds, ...graph.expandAllInputs(kernelSeeds)]);
+	for (const cst of items) if (kernel.has(cst.id)) push(cst);
+	for (const cst of items) push(cst);
+	return result;
+}
+//#endregion
+//#region src/library/rsform-api/stats.ts
+/**
+* Schema-level statistics and issue flags.
+*/
+/** Checks if {@link Constituenta} is a schema issue. */
+function isSchemaIssue(cst) {
+	return (cst.diagnostics?.length ?? 0) > 0 || cst.status === CstStatus.INCORRECT || cst.status === CstStatus.INCALCULABLE;
+}
+/** Calculate statistics for {@link RSForm}. */
+function calculateSchemaStats(target) {
+	const stats = {
+		count_all: target.items.length,
+		count_crucial: 0,
+		step_complexity: 0,
+		count_problematic: 0,
+		count_homonyms: 0,
+		count_formal_duplicates: 0,
+		count_missing_basic_text: 0,
+		count_type_mismatch: 0,
+		count_incorrect: 0,
+		count_property: 0,
+		count_incalculable: 0,
+		count_inherited: 0,
+		count_text_term: 0,
+		count_definition: 0,
+		count_convention: 0,
+		count_comment: 0,
+		count_base: 0,
+		count_constant: 0,
+		count_structured: 0,
+		count_axiom: 0,
+		count_term: 0,
+		count_function: 0,
+		count_predicate: 0,
+		count_statement: 0,
+		count_nominal: 0
+	};
+	for (const cst of target.items) {
+		if (cst.crucial) stats.count_crucial += 1;
+		stats.step_complexity += calculateStepComplexity(cst);
+		if (isSchemaIssue(cst)) stats.count_problematic += 1;
+		if (hasCstDiagnostic(cst, RSDiagnosticCode.schemaHomonym)) stats.count_homonyms += 1;
+		if (hasCstDiagnostic(cst, RSDiagnosticCode.schemaFormalDuplicate)) stats.count_formal_duplicates += 1;
+		if (isMissingBasicText(cst)) stats.count_missing_basic_text += 1;
+		if (cst.is_type_mismatch) stats.count_type_mismatch += 1;
+		if (cst.status === CstStatus.INCORRECT) stats.count_incorrect += 1;
+		if (cst.analysis?.valueClass === ValueClass.PROPERTY) stats.count_property += 1;
+		if (cst.analysis?.success && cst.analysis.valueClass === null) stats.count_incalculable += 1;
+		if (cst.is_inherited) stats.count_inherited += 1;
+		if (cst.term_raw) stats.count_text_term += 1;
+		if (cst.definition_raw) stats.count_definition += 1;
+		if (isBasicConcept(cst.cst_type) && cst.convention) stats.count_convention += 1;
+		if (!isBasicConcept(cst.cst_type) && !cst.convention) stats.count_comment += 1;
+		switch (cst.cst_type) {
+			case CstType.BASE:
+				stats.count_base += 1;
+				break;
+			case CstType.CONSTANT:
+				stats.count_constant += 1;
+				break;
+			case CstType.STRUCTURED:
+				stats.count_structured += 1;
+				break;
+			case CstType.AXIOM:
+				stats.count_axiom += 1;
+				break;
+			case CstType.TERM:
+				stats.count_term += 1;
+				break;
+			case CstType.FUNCTION:
+				stats.count_function += 1;
+				break;
+			case CstType.PREDICATE:
+				stats.count_predicate += 1;
+				break;
+			case CstType.STATEMENT:
+				stats.count_statement += 1;
+				break;
+			case CstType.NOMINAL:
+				stats.count_nominal += 1;
+				break;
+		}
+	}
+	return stats;
+}
+function calculateStepComplexity(cst) {
+	if (cst.cst_type === CstType.AXIOM || cst.cst_type === CstType.NOMINAL || !isBasicConcept(cst.cst_type)) return 0;
+	if (cst.cst_type === CstType.BASE || cst.cst_type === CstType.CONSTANT || !cst.effectiveType) return 1;
+	const type = cst.effectiveType;
+	return calculateTypificationComplexity(type) + 1;
+}
+function calculateTypificationComplexity(type) {
+	switch (type.typeID) {
+		case TypeID.basic:
+		case TypeID.integer:
+		case TypeID.anyTypification: return 0;
+		case TypeID.tuple: return type.factors.length + type.factors.reduce((sum, factor) => sum + calculateTypificationComplexity(factor), 0);
+		case TypeID.collection:
+			if (type.base.typeID === TypeID.tuple) {
+				let sum = 0;
+				type.base.factors.forEach((factor) => {
+					sum += calculateTypificationComplexity(factor);
+				});
+				return sum + type.base.factors.length;
+			} else if (type.base.typeID === TypeID.collection) return calculateTypificationComplexity(type.base) + 1;
+			return 0;
+	}
+}
+/** Non-logical basic concept missing convention and/or resolved term (trimmed). */
+function isMissingBasicText(cst) {
+	if (!isBasicConcept(cst.cst_type) || isLogical(cst.cst_type)) return false;
+	return !cst.convention.trim() || !cst.term_resolved.trim();
+}
+//#endregion
+//#region src/library/rsform-api/structure.ts
+/**
+* Structure-path helpers for spawned constituents.
+*/
+/**
+* Id to pass as `insert_after` when creating a new {@link Constituenta} spawned by `targetId`:
+* after the last existing child of that spawner, or after the spawner itself if none.
+*/
+function inferNewSpawnPosition(schema, targetId) {
+	let last = null;
+	for (const cst of schema.items) if (cst.spawner === targetId) last = cst.id;
+	return last ?? targetId;
+}
+/** Finds {@link Constituenta} by structure path. */
+function findCstByStructure(schema, target, path) {
+	const byId = schema.cstByID ?? new Map(schema.items.map((item) => [item.id, item]));
+	for (const cst of schema.items) {
+		if (!cst.spawner_path) continue;
+		const absolutePath = resolveAbsoluteSpawnerPath(cst, target.id, byId);
+		if (absolutePath?.length === path.length && absolutePath.every((v, i) => v === path[i])) return cst;
+	}
+	return null;
+}
+/** Retrieves name for piece of target {@link Constituenta} structure. */
+function getStructureName(schema, target, path) {
+	const representation = findCstByStructure(schema, target, path);
+	if (representation) return `${representation.alias}: ${representation.term_resolved}`;
+	if (!isTypification(target.effectiveType)) return "";
+	const type = applyPath(target.effectiveType, path);
+	if (type?.typeID === TypeID.basic) {
+		const cst = schema.cstByAlias.get(type.baseID);
+		if (cst?.term_resolved) return `${cst.alias}: ${cst.term_resolved}`;
+	}
+	return "";
+}
+function resolveAbsoluteSpawnerPath(cst, targetId, byId) {
+	if (!cst.spawner_path || cst.spawner == null) return null;
+	if (cst.spawner === targetId) return cst.spawner_path;
+	const visited = /* @__PURE__ */ new Set([cst.id]);
+	let currentPath = [...cst.spawner_path];
+	let currentSpawnerId = cst.spawner;
+	while (currentSpawnerId != null) {
+		if (currentSpawnerId === targetId) return currentPath;
+		if (visited.has(currentSpawnerId)) return null;
+		visited.add(currentSpawnerId);
+		const parent = byId.get(currentSpawnerId);
+		if (!parent?.spawner_path || parent.spawner == null) return null;
+		currentPath = [...parent.spawner_path, ...currentPath];
+		currentSpawnerId = parent.spawner;
+	}
+	return null;
+}
+//#endregion
+//#region src/library/rsform-api/substitution.ts
+/**
+* Apply constituenta substitutions: remap attributions, drop originals, rewrite aliases in survivors.
+* Does not resolve texts — call {@link resolveAllConstituentTexts} afterwards.
+*/
+function applyConstituentSubstitutions(items, attributions, substitutions) {
+	if (substitutions.length === 0) return {
+		items: [...items],
+		attributions: attributions.map((attr) => ({ ...attr })),
+		deletedIds: /* @__PURE__ */ new Set(),
+		replacementIds: []
+	};
+	const byId = new Map(items.map((cst) => [cst.id, cst]));
+	const mapping = {};
+	const deletedIds = /* @__PURE__ */ new Set();
+	const origToSub = /* @__PURE__ */ new Map();
+	const replacementIds = [];
+	for (const { original, substitution } of substitutions) {
+		const originalCst = byId.get(original);
+		const substitutionCst = byId.get(substitution);
+		if (!originalCst || !substitutionCst) throw new Error(`applyConstituentSubstitutions: unknown constituenta ${original} -> ${substitution}`);
+		mapping[originalCst.alias] = substitutionCst.alias;
+		deletedIds.add(original);
+		origToSub.set(original, substitution);
+		replacementIds.push(substitution);
+	}
+	const nextItems = items.filter((cst) => !deletedIds.has(cst.id));
+	applyMappingToConstituents(nextItems, mapping, false);
+	return {
+		items: nextItems,
+		attributions: remapAttributionsUnderSubstitution(attributions, origToSub),
+		deletedIds,
+		replacementIds
+	};
+}
+/**
+* Remap substitution endpoints after source constituents were inserted under new ids.
+* If {@link original} was imported, map it; otherwise map {@link substitution}.
+*/
+function remapSubstitutionsAfterImport(substitutions, sourceIdSet, idMap) {
+	return substitutions.map((sub) => {
+		if (sourceIdSet.has(sub.original)) return {
+			original: idMap[sub.original],
+			substitution: sub.substitution
+		};
+		return {
+			original: sub.original,
+			substitution: idMap[sub.substitution]
+		};
+	});
+}
+//#endregion
+//#region src/library/rsform-api/text-resolution.ts
+/** Build term-reference graph: referenced constituent → dependent (backend {@code graph_term}). */
+function buildTermReferenceGraph(items) {
+	return buildReferenceGraph(items, "term_raw");
+}
+/** Build definition-reference graph: referenced constituent → dependent (backend {@code graph_text}). */
+function buildDefinitionReferenceGraph(items) {
+	return buildReferenceGraph(items, "definition_raw");
+}
+/** Resolve all term and definition texts in topological order. Mutates items in place. */
+function resolveAllConstituentTexts(items) {
+	const graphTerm = buildTermReferenceGraph(items);
+	const idToItem = new Map(items.map((item) => [item.id, item]));
+	const context = buildTermContext(items);
+	for (const id of graphTerm.topologicalOrder()) {
+		const row = idToItem.get(id);
+		if (!row) continue;
+		const resolved = resolveTextReferences(row.term_raw, context);
+		if (resolved !== row.term_resolved) {
+			row.term_resolved = resolved;
+			row.term_forms = [];
+			context[row.alias] = {
+				nominal: row.term_resolved,
+				forms: []
+			};
+		}
+	}
+	for (const row of items) row.definition_resolved = resolveTextReferences(row.definition_raw, context);
+}
+/**
+* Resolve texts after a single constituent change, cascading dependents when the term changed.
+* Mutates items in place.
+*/
+function resolveConstituentTextChange(items, targetID, options) {
+	const idToItem = new Map(items.map((item) => [item.id, item]));
+	const target = idToItem.get(targetID);
+	if (!target) throw new Error(`resolveConstituentTextChange: unknown target ${targetID}`);
+	const context = buildTermContext(items);
+	if (options.termRawChanged) {
+		target.term_resolved = resolveTextReferences(target.term_raw, context);
+		if (options.clearTargetForms) target.term_forms = [];
+		context[target.alias] = toContextItem(target);
+	} else if (options.termChanged) context[target.alias] = toContextItem(target);
+	if (options.definitionRawChanged && !options.termChanged) target.definition_resolved = resolveTextReferences(target.definition_raw, context);
+	if (!options.termChanged) return;
+	const graphTerm = buildTermReferenceGraph(items);
+	const graphText = buildDefinitionReferenceGraph(items);
+	const expansion = graphTerm.expandAllOutputs([targetID]);
+	const expansionSet = new Set(expansion);
+	for (const id of graphTerm.topologicalOrder()) {
+		if (!expansionSet.has(id)) continue;
+		const expanded = idToItem.get(id);
+		if (!expanded) continue;
+		const resolved = resolveTextReferences(expanded.term_raw, context);
+		if (resolved !== expanded.term_resolved) {
+			expanded.term_resolved = resolved;
+			expanded.term_forms = [];
+			context[expanded.alias] = {
+				nominal: expanded.term_resolved,
+				forms: []
+			};
+		}
+	}
+	const updateDefs = /* @__PURE__ */ new Set([
+		targetID,
+		...expansion,
+		...graphText.expandAllOutputs([targetID, ...expansion])
+	]);
+	for (const item of items) if (updateDefs.has(item.id)) item.definition_resolved = resolveTextReferences(item.definition_raw, context);
+}
+function buildReferenceGraph(items, field) {
+	const graph = new Graph();
+	const idByAlias = new Map(items.map((row) => [row.alias, row.id]));
+	for (const row of items) graph.addNode(row.id);
+	for (const row of items) for (const entity of extractEntities(row[field])) {
+		const source = idByAlias.get(entity);
+		if (source !== void 0) graph.addEdge(source, row.id);
+	}
+	return graph;
+}
+function buildTermContext(items) {
+	const context = {};
+	for (const row of items) context[row.alias] = toContextItem(row);
+	return context;
+}
+function toContextItem(row) {
+	return {
+		nominal: row.term_resolved,
+		forms: row.term_forms.map((form) => ({
+			text: form.text,
+			grams: parseGrammemes(form.tags)
+		}))
+	};
+}
+//#endregion
+//#region src/library/rsform-api/synthesis.ts
+/**
+* Embed {@link InlineSynthesisInput.sourceItems} into the receiver and apply substitutions.
+* Resolves term/definition entity references on the result.
+* Does not mutate inputs.
+*/
+function inlineSynthesis(input) {
+	const sourceItems = input.sourceItems;
+	if (sourceItems.length === 0) return {
+		items: input.receiverItems.map((item) => structuredClone(item)),
+		attributions: (input.receiverAttributions ?? []).map((attr) => ({ ...attr })),
+		nextId: input.nextId,
+		idMap: {},
+		aliasMapping: {},
+		deletedIds: /* @__PURE__ */ new Set(),
+		insertedIds: [],
+		replacementIds: []
+	};
+	const receiverItems = input.receiverItems.map((item) => structuredClone(item));
+	let attributions = (input.receiverAttributions ?? []).map((attr) => ({ ...attr }));
+	const aliasMapping = allocateImportAliases(receiverItems, sourceItems);
+	const idMap = {};
+	const inserted = [];
+	const sourceIdSet = new Set(sourceItems.map((cst) => cst.id));
+	let nextId = input.nextId;
+	for (const cst of sourceItems) {
+		const newId = nextId;
+		nextId += 1;
+		idMap[cst.id] = newId;
+		const cloned = structuredClone(cst);
+		cloned.id = newId;
+		if (Object.keys(aliasMapping).length > 0) {
+			cloned.alias = aliasMapping[cst.alias];
+			applyMappingToConstituents([cloned], aliasMapping, false);
+		}
+		inserted.push(cloned);
+	}
+	attributions = importAttributions(input.sourceAttributions ?? [], sourceIdSet, idMap, attributions);
+	const items = receiverItems.concat(inserted);
+	resolveAllConstituentTexts(items);
+	const substitutions = input.substitutions ?? [];
+	if (substitutions.length === 0) return {
+		items,
+		attributions,
+		nextId,
+		idMap,
+		aliasMapping,
+		deletedIds: /* @__PURE__ */ new Set(),
+		insertedIds: inserted.map((cst) => cst.id),
+		replacementIds: []
+	};
+	const remapped = remapSubstitutionsAfterImport(substitutions, sourceIdSet, idMap);
+	const substituted = applyConstituentSubstitutions(items, attributions, remapped);
+	resolveAllConstituentTexts(substituted.items);
+	return {
+		items: substituted.items,
+		attributions: substituted.attributions,
+		nextId,
+		idMap,
+		aliasMapping,
+		deletedIds: substituted.deletedIds,
+		insertedIds: inserted.map((cst) => cst.id),
+		replacementIds: substituted.replacementIds
+	};
+}
+/** Sorts library items relevant for schema embedding with specified {@link RSForm}. */
+function sortItemsForInlineSynthesis(receiver, items) {
+	const result = items.filter((item) => item.location === receiver.location);
+	for (const item of items) if (item.visible && item.owner === receiver.owner && !result.includes(item)) result.push(item);
+	for (const item of items) if (item.visible && !result.includes(item)) result.push(item);
+	for (const item of items) if (!result.includes(item)) result.push(item);
+	return result;
+}
+//#endregion
+//#region src/library/rsform-api/transforms.ts
+/**
+* Pure constituenta list transforms: reorder, move, insert position.
+*/
+/** Rebuild an item list following {@link orderedIds}. Throws if an id is missing. */
+function reorderItemsByIds(items, orderedIds) {
+	const byId = new Map(items.map((item) => [item.id, item]));
+	return orderedIds.map((id) => {
+		const item = byId.get(id);
+		if (!item) throw new Error(`reorderItemsByIds: missing id ${id}`);
+		return item;
+	});
+}
+/**
+* Move a subset of ids within an ordered id list.
+* {@link moveTo} is clamped to `[0, rest.length]` (index among non-moving items).
+*/
+function moveIdsInOrder(ids, moving, moveTo) {
+	const movingSet = new Set(moving);
+	const rest = ids.filter((id) => !movingSet.has(id));
+	const movingItems = ids.filter((id) => movingSet.has(id));
+	const clamped = Math.max(0, Math.min(moveTo, rest.length));
+	return [
+		...rest.slice(0, clamped),
+		...movingItems,
+		...rest.slice(clamped)
+	];
+}
+/** Insert {@link item} after {@link insertAfter}, or append when null/undefined/missing. Mutates {@link items}. */
+function insertItemAfter(items, item, insertAfter) {
+	if (insertAfter === null || insertAfter === void 0) {
+		items.push(item);
+		return;
+	}
+	const idx = items.findIndex((row) => row.id === insertAfter);
+	const insertAt = idx === -1 ? items.length : idx + 1;
+	items.splice(insertAt, 0, item);
+}
+//#endregion
+//#region src/library/diagnostics.ts
+/** Origin of a diagnostic. */
+const DiagnosticKind = {
+	EXPRESSION: "expression",
+	SCHEMA: "schema",
+	MODEL: "model"
+};
+/** Schema and model diagnostic codes (same numeric format as {@link RSErrorCode}). */
+const RSDiagnosticCode = {
+	schemaHomonym: 35073,
+	schemaFormalDuplicate: 35074,
+	schemaMissingConvention: 35075,
+	schemaMissingTerm: 35076,
+	schemaTypeMismatch: 35077,
+	schemaDependencyCycle: 35078,
+	modelEmpty: 35088,
+	modelAxiomFalse: 35089,
+	modelInvalidData: 35090,
+	modelEvalFail: 35091
+};
+/** Whether a constituent has a schema/model diagnostic with the given code. */
+function hasCstDiagnostic(cst, code) {
+	return cst.diagnostics?.some((item) => item.code === code) ?? false;
+}
+/**
+* Populate `diagnostics` on each constituent (homonyms, duplicates, metadata, type mismatch, cycles).
+*
+* Requires normalized formal definitions for duplicate detection (same as Portal loader).
+* When `graph` is provided, dependency cycles are reported as {@link RSDiagnosticCode.schemaDependencyCycle}.
+*/
+function assignSchemaDiagnostics(items, resolveAlias, normalizedDefinitions, graph) {
+	const homonymById = detectHomonymDiagnostics(items, resolveAlias);
+	const duplicateById = detectFormalDuplicateDiagnostics(items, resolveAlias, normalizedDefinitions);
+	const cycleById = graph ? detectDependencyCycleDiagnostics(graph, resolveAlias) : /* @__PURE__ */ new Map();
+	for (const cst of items) {
+		const diagnostics = [];
+		const cycle = cycleById.get(cst.id);
+		if (cycle) diagnostics.push(cycle);
+		const homonym = homonymById.get(cst.id);
+		if (homonym) diagnostics.push(homonym);
+		const duplicate = duplicateById.get(cst.id);
+		if (duplicate) diagnostics.push(duplicate);
+		diagnostics.push(...collectLocalSchemaDiagnostics(cst));
+		cst.diagnostics = diagnostics;
+	}
+}
+/**
+* Format a closed dependency cycle as `A → B → A`.
+*
+* Rotates the path to start at the lexicographically smallest alias so the same
+* cycle always renders identically regardless of graph traversal order.
+*
+* @param aliases Closed or open alias path from {@link Graph.findCycles}.
+* @returns Human-readable cycle text joined with ` → `.
+*/
+function formatDependencyCycle(aliases) {
+	if (aliases.length < 2) return aliases.join(" → ");
+	const closed = aliases[0] === aliases[aliases.length - 1];
+	const open = closed ? aliases.slice(0, -1) : [...aliases];
+	if (open.length === 0) return aliases.join(" → ");
+	let bestStart = 0;
+	for (let index = 1; index < open.length; index++) {
+		const alias = open[index];
+		const bestAlias = open[bestStart];
+		if (alias !== void 0 && bestAlias !== void 0 && alias < bestAlias) bestStart = index;
+	}
+	const rotated = [...open.slice(bestStart), ...open.slice(0, bestStart)];
+	if (closed) {
+		const first = rotated[0];
+		if (first !== void 0) rotated.push(first);
+	}
+	return rotated.join(" → ");
+}
+/**
+* Map each node id that participates in a dependency cycle to a schema diagnostic.
+*
+* `params[0]` is the closed cycle path (`F3 → P1 → F3`).
+*
+* @param graph Constituent dependency graph (provider → dependent edges).
+* @param resolveAlias Maps node id to display alias for cycle formatting.
+* @returns One {@link CstDiagnostic} per node on each cyclic SCC.
+*/
+function detectDependencyCycleDiagnostics(graph, resolveAlias) {
+	const result = /* @__PURE__ */ new Map();
+	for (const cycle of graph.findCycles()) {
+		if (cycle.length < 2) continue;
+		const cycleText = formatDependencyCycle(cycle.map((id) => resolveAlias(id)));
+		const memberIds = new Set(cycle);
+		for (const id of memberIds) result.set(id, {
+			kind: DiagnosticKind.SCHEMA,
+			code: RSDiagnosticCode.schemaDependencyCycle,
+			params: [cycleText]
+		});
+	}
+	return result;
+}
+/** Map a model evaluation status to a compact diagnostic, or `null` when not an issue. */
+function modelStatusCstDiagnostic(status, cstType) {
+	const code = modelStatusToCode(status, cstType);
+	if (code === null) return null;
+	return {
+		kind: DiagnosticKind.MODEL,
+		code,
+		params: [String(status)]
+	};
+}
+function collectLocalSchemaDiagnostics(cst) {
+	const result = [];
+	if (cst.is_type_mismatch) result.push({
+		kind: DiagnosticKind.SCHEMA,
+		code: RSDiagnosticCode.schemaTypeMismatch,
+		params: [cst.typification_manual, labelType(cst.analysis.type)]
+	});
+	if (isBasicConcept(cst.cst_type) && !isLogical(cst.cst_type)) {
+		if (!cst.convention.trim()) result.push({
+			kind: DiagnosticKind.SCHEMA,
+			code: RSDiagnosticCode.schemaMissingConvention
+		});
+		if (!cst.term_resolved.trim()) result.push({
+			kind: DiagnosticKind.SCHEMA,
+			code: RSDiagnosticCode.schemaMissingTerm
+		});
+	}
+	return result;
+}
+function detectGroupedAliasDiagnostics(items, resolveAlias, groupKey, code) {
+	const groups = /* @__PURE__ */ new Map();
+	for (const cst of items) {
+		const key = groupKey(cst);
+		if (!key) continue;
+		const group = groups.get(key) ?? [];
+		group.push(cst);
+		groups.set(key, group);
+	}
+	const result = /* @__PURE__ */ new Map();
+	for (const group of groups.values()) {
+		if (group.length <= 1) continue;
+		for (const cst of group) {
+			const aliases = group.filter((other) => other.id !== cst.id).map((other) => resolveAlias(other.id)).join(", ");
+			result.set(cst.id, {
+				kind: DiagnosticKind.SCHEMA,
+				code,
+				params: [aliases]
+			});
+		}
+	}
+	return result;
+}
+function detectHomonymDiagnostics(items, resolveAlias) {
+	return detectGroupedAliasDiagnostics(items, resolveAlias, (cst) => {
+		const key = cst.term_resolved.trim().toLocaleLowerCase();
+		return key === "" ? void 0 : key;
+	}, RSDiagnosticCode.schemaHomonym);
+}
+function detectFormalDuplicateDiagnostics(items, resolveAlias, normalizedDefinitions) {
+	return detectGroupedAliasDiagnostics(items, resolveAlias, (cst) => normalizedDefinitions.get(cst.id), RSDiagnosticCode.schemaFormalDuplicate);
+}
+function modelStatusToCode(status, cstType) {
+	switch (status) {
+		case EvalStatus.EMPTY: return isBasicConcept(cstType) ? RSDiagnosticCode.modelEmpty : null;
+		case EvalStatus.AXIOM_FALSE: return RSDiagnosticCode.modelAxiomFalse;
+		case EvalStatus.INVALID_DATA: return RSDiagnosticCode.modelInvalidData;
+		case EvalStatus.EVAL_FAIL: return RSDiagnosticCode.modelEvalFail;
+		default: return null;
+	}
+}
+//#endregion
+export { isFunctional as $, normalizeExpression as A, buildSequentialAliasMapping as B, isSchemaIssue as C, inferStatus as D, applyFilterCategory as E, refineAnalysisForDependencyCycles as F, validateNewAlias as G, maxAliasIndex as H, addAliasReference as I, getCstTypePrefix as J, canHaveManualTypification as K, allocateImportAliases as L, importAttributions as M, remapAttributionsUnderSubstitution as N, inferTemplate as O, getAnalysisFor as P, isBasicConcept as Q, applyMappingToConstituents as R, calculateSchemaStats as S, restoreConstituentOrder as T, removeAliasReference as U, generateAlias as V, validateAliasFormat as W, inferClass as X, guessCstType as Y, isBaseSet as Z, applyConstituentSubstitutions as _, formatDependencyCycle as a, getStructureName as b, insertItemAfter as c, inlineSynthesis as d, isLogical as et, sortItemsForInlineSynthesis as f, resolveConstituentTextChange as g, resolveAllConstituentTexts as h, detectDependencyCycleDiagnostics as i, filterAttributions as j, inferTemplatedType as k, moveIdsInOrder as l, buildTermReferenceGraph as m, RSDiagnosticCode as n, typeClassForCstType as nt, hasCstDiagnostic as o, buildDefinitionReferenceGraph as p, canProduceStructure as q, assignSchemaDiagnostics as r, modelStatusCstDiagnostic as s, DiagnosticKind as t, isTemplateCst as tt, reorderItemsByIds as u, remapSubstitutionsAfterImport as v, buildFormalDependencyGraph as w, inferNewSpawnPosition as x, findCstByStructure as y, argumentValuesToMapping as z };
+
+//# sourceMappingURL=diagnostics-CljEzVBV.js.map