@rsconcept/domain 1.8.0 → 2.0.1

package/dist/diagnostics-DYMvTSev.js

@@ -0,0 +1,532 @@
+import { TypeClass, TypeID, basic, bool, constant, isTypification } from "./rslang/semantic/typification.js";
+import { labelType } from "./rslang/labels.js";
+import { applyEntityReferenceMapping } from "./cctext/language-api.js";
+import { RSErrorCode } from "./rslang/error.js";
+import { generateExpressionFromAst } from "./rslang/parser/expression-generator.js";
+import { applyAliasMapping, applyTypificationMapping, parseRSLangExpression } from "./rslang/api.js";
+import { applyPath } from "./rslang/semantic/typification-api.js";
+import { ValueClass } from "./rslang/semantic/value-class.js";
+import "./rslang/index.js";
+import { CstClass, CstStatus, CstType } from "./library/rsform.js";
+import { EvalStatus } from "./library/rsmodel.js";
+//#region src/library/rsform-api.ts
+/**
+* Module: API for formal representation for systems of concepts.
+*/
+/** 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
+};
+/** 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;
+}
+/** 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;
+}
+/** 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;
+}
+/**
+* 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;
+}
+/** 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;
+}
+/** 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));
+}
+/** 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;
+}
+/** 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 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);
+}
+/** 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;
+	}
+}
+/** 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);
+	if (schema.items.length <= 0) return `${prefix}1`;
+	let index = schema.items.reduce((prev, cst, index) => {
+		if (cst.cst_type !== type) return prev;
+		index = Number(cst.alias.slice(1 - cst.alias.length)) + 1;
+		return Math.max(prev, index);
+	}, 1);
+	let alias = `${prefix}${index}`;
+	while (takenAliases.includes(alias)) {
+		index = index + 1;
+		alias = `${prefix}${index}`;
+	}
+	return alias;
+}
+/**
+* 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;
+}
+/** Sorts library items relevant for InlineSynthesis 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 === item.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;
+}
+/**
+* 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);
+	}
+}
+/** Remove alias from expression. */
+function removeAliasReference(expression, alias) {
+	const result = expression.replaceAll(new RegExp(`\\b${alias}\\b`, "g"), "DEL");
+	return result === "DEL" ? "" : result;
+}
+/** Add alias to expression. */
+function addAliasReference(expression, alias) {
+	return expression + " " + alias;
+}
+/** 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;
+	}
+}
+/** Checks whether a constituenta type supports formal definitions. */
+function canHaveFormalDefinition(cstType) {
+	return cstType !== CstType.BASE && cstType !== CstType.CONSTANT;
+}
+/** Analyze expression for {@link RSForm}. */
+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 schema.analyzer.checkFull(expression, {
+		expected: typeClassForCstType(cstType),
+		isDomain: cstType === CstType.STRUCTURED
+	});
+}
+/** Calculate statistics for {@link RSForm}. */
+function calculateSchemaStats(target) {
+	const items = target.items;
+	return {
+		count_all: items.length,
+		count_crucial: items.reduce((sum, cst) => sum + (cst.crucial ? 1 : 0), 0),
+		step_complexity: items.reduce((sum, cst) => sum + calculateStepComplexity(cst), 0),
+		count_problematic: items.reduce((sum, cst) => sum + (isSchemaIssue(cst) ? 1 : 0), 0),
+		count_homonyms: items.reduce((sum, cst) => sum + (hasCstDiagnostic(cst, RSDiagnosticCode.schemaHomonym) ? 1 : 0), 0),
+		count_formal_duplicates: items.reduce((sum, cst) => sum + (hasCstDiagnostic(cst, RSDiagnosticCode.schemaFormalDuplicate) ? 1 : 0), 0),
+		count_missing_convention: items.reduce((sum, cst) => sum + (isMissingConvention(cst) ? 1 : 0), 0),
+		count_type_mismatch: items.reduce((sum, cst) => sum + (cst.is_type_mismatch ? 1 : 0), 0),
+		count_incorrect: items.reduce((sum, cst) => sum + (cst.status === CstStatus.INCORRECT ? 1 : 0), 0),
+		count_property: items.reduce((sum, cst) => sum + (cst.analysis?.valueClass === ValueClass.PROPERTY ? 1 : 0), 0),
+		count_incalculable: items.reduce((sum, cst) => sum + (cst.analysis?.success && cst.analysis.valueClass === null ? 1 : 0), 0),
+		count_inherited: items.reduce((sum, cst) => sum + (cst.is_inherited ? 1 : 0), 0),
+		count_text_term: items.reduce((sum, cst) => sum + (cst.term_raw ? 1 : 0), 0),
+		count_definition: items.reduce((sum, cst) => sum + (cst.definition_raw ? 1 : 0), 0),
+		count_convention: items.reduce((sum, cst) => sum + (isBasicConcept(cst.cst_type) && cst.convention ? 1 : 0), 0),
+		count_comment: items.reduce((sum, cst) => sum + (!isBasicConcept(cst.cst_type) && !cst.convention ? 1 : 0), 0),
+		count_base: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.BASE ? 1 : 0), 0),
+		count_constant: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.CONSTANT ? 1 : 0), 0),
+		count_structured: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.STRUCTURED ? 1 : 0), 0),
+		count_axiom: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.AXIOM ? 1 : 0), 0),
+		count_term: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.TERM ? 1 : 0), 0),
+		count_function: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.FUNCTION ? 1 : 0), 0),
+		count_predicate: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.PREDICATE ? 1 : 0), 0),
+		count_statement: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.STATEMENT ? 1 : 0), 0),
+		count_nominal: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.NOMINAL ? 1 : 0), 0)
+	};
+}
+/** Finds {@link Constituenta} by structure path. */
+function findCstByStructure(schema, target, path) {
+	for (const cst of schema.items) if (cst.spawner === target.id && cst.spawner_path) {
+		if (cst.spawner_path.length === path.length && cst.spawner_path.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 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;
+	}
+}
+function isMissingConvention(cst) {
+	if (isBasicConcept(cst.cst_type) && !isLogical(cst.cst_type)) {
+		if (!cst.convention || !cst.term_resolved) return true;
+	}
+	return false;
+}
+/** Evaluate if {@link Typification} can be used to produce structure. */
+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/diagnostics.ts
+/**
+* Module: Compact diagnostics for constituents (schema and model issue codes).
+*/
+/** 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,
+	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).
+*
+* Requires normalized formal definitions for duplicate detection (same as Portal loader).
+*/
+function assignSchemaDiagnostics(items, resolveAlias, normalizedDefinitions) {
+	const homonymById = detectHomonymDiagnostics(items, resolveAlias);
+	const duplicateById = detectFormalDuplicateDiagnostics(items, resolveAlias, normalizedDefinitions);
+	for (const cst of items) {
+		const diagnostics = [];
+		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;
+	}
+}
+/** 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 detectHomonymDiagnostics(items, resolveAlias) {
+	const byTerm = /* @__PURE__ */ new Map();
+	for (const cst of items) {
+		const key = cst.term_resolved.trim().toLocaleLowerCase();
+		if (key === "") continue;
+		const group = byTerm.get(key) ?? [];
+		group.push(cst);
+		byTerm.set(key, group);
+	}
+	const result = /* @__PURE__ */ new Map();
+	for (const group of byTerm.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: RSDiagnosticCode.schemaHomonym,
+				params: [aliases]
+			});
+		}
+	}
+	return result;
+}
+function detectFormalDuplicateDiagnostics(items, resolveAlias, normalizedDefinitions) {
+	const byDefinition = /* @__PURE__ */ new Map();
+	for (const cst of items) {
+		const key = normalizedDefinitions.get(cst.id);
+		if (!key) continue;
+		const group = byDefinition.get(key) ?? [];
+		group.push(cst);
+		byDefinition.set(key, group);
+	}
+	const result = /* @__PURE__ */ new Map();
+	for (const group of byDefinition.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: RSDiagnosticCode.schemaFormalDuplicate,
+				params: [aliases]
+			});
+		}
+	}
+	return result;
+}
+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 { isTemplateCst as A, inferTemplate as C, isFunctional as D, isBasicConcept as E, validateAliasFormat as F, validateNewAlias as I, removeAliasReference as M, sortItemsForInlineSynthesis as N, isLogical as O, typeClassForCstType as P, inferStatus as S, isBaseSet as T, getCstTypePrefix as _, modelStatusCstDiagnostic as a, inferClass as b, applyMappingToConstituents as c, canHaveFormalDefinition as d, canHaveManualTypification as f, getAnalysisFor as g, generateAlias as h, hasCstDiagnostic as i, normalizeExpression as j, isSchemaIssue as k, argumentValuesToMapping as l, findCstByStructure as m, RSDiagnosticCode as n, addAliasReference as o, canProduceStructure as p, assignSchemaDiagnostics as r, applyFilterCategory as s, DiagnosticKind as t, calculateSchemaStats as u, getStructureName as v, inferTemplatedType as w, inferNewSpawnPosition as x, guessCstType as y };
+
+//# sourceMappingURL=diagnostics-DYMvTSev.js.map

package/dist/diagnostics-DYMvTSev.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"diagnostics-DYMvTSev.js","names":[],"sources":["../src/library/rsform-api.ts","../src/library/diagnostics.ts"],"sourcesContent":["/**\n * Module: API for formal representation for systems of concepts.\n */\n\nimport { applyEntityReferenceMapping } from '../cctext/language-api';\nimport { type AstNode } from '../parsing';\nimport {\n  type AnalysisFull,\n  RSErrorCode,\n  TypeClass,\n  TypeID,\n  type TypePath,\n  type Typification,\n  ValueClass\n} from '../rslang';\nimport {\n  type AliasMapping,\n  applyAliasMapping,\n  applyTypificationMapping,\n  generateExpressionFromAst,\n  parseRSLangExpression\n} from '../rslang/api';\nimport { basic, bool, constant, type EchelonFunctional, isTypification } from '../rslang/semantic/typification';\nimport { applyPath } from '../rslang/semantic/typification-api';\n\nimport { hasCstDiagnostic, RSDiagnosticCode } from './diagnostics';\nimport { type LibraryItem } from './library';\nimport {\n  type ArgumentValue,\n  type Constituenta,\n  CstClass,\n  CstStatus,\n  CstType,\n  type RSForm,\n  type RSFormStats\n} from './rsform';\n\n/** Record of {@link CstType} prefixes. */\nconst CST_TYPE_PREFIX: Record<CstType, string> = {\n  [CstType.NOMINAL]: 'N',\n  [CstType.BASE]: 'X',\n  [CstType.CONSTANT]: 'C',\n  [CstType.STRUCTURED]: 'S',\n  [CstType.AXIOM]: 'A',\n  [CstType.TERM]: 'D',\n  [CstType.FUNCTION]: 'F',\n  [CstType.PREDICATE]: 'P',\n  [CstType.STATEMENT]: 'T'\n};\n\n/** Record of {@link CstType} to {@link CstClass} mapping. */\nconst CST_TYPE_TO_CLASS: Record<CstType, CstClass> = {\n  [CstType.NOMINAL]: CstClass.NOMINAL,\n  [CstType.BASE]: CstClass.BASIC,\n  [CstType.CONSTANT]: CstClass.BASIC,\n  [CstType.STRUCTURED]: CstClass.BASIC,\n  [CstType.TERM]: CstClass.DERIVED,\n  [CstType.FUNCTION]: CstClass.DERIVED,\n  [CstType.AXIOM]: CstClass.STATEMENT,\n  [CstType.PREDICATE]: CstClass.DERIVED,\n  [CstType.STATEMENT]: CstClass.STATEMENT\n};\n\n/** Checks if {@link Constituenta} is a schema issue. */\nexport function isSchemaIssue(cst: Constituenta): boolean {\n  return (\n    (cst.diagnostics?.length ?? 0) > 0 || cst.status === CstStatus.INCORRECT || cst.status === CstStatus.INCALCULABLE\n  );\n}\n\n/** Infers the status of an expression based on parsing and value information. */\nexport function inferStatus(parse: boolean, value?: ValueClass | null): CstStatus {\n  if (!parse) {\n    return CstStatus.INCORRECT;\n  }\n  if (value === null) {\n    return CstStatus.INCALCULABLE;\n  }\n  if (value === ValueClass.PROPERTY) {\n    return CstStatus.PROPERTY;\n  }\n  return CstStatus.VERIFIED;\n}\n\n/** Infers type of constituent for a given template and arguments. */\nexport function inferTemplatedType(templateType: CstType, args: ArgumentValue[]): CstType {\n  if (args.length === 0 || args.some(arg => !arg.value)) {\n    return templateType;\n  } else if (templateType === CstType.PREDICATE) {\n    return CstType.AXIOM;\n  } else {\n    return CstType.TERM;\n  }\n}\n\n/** Build alias mapping from template argument bindings. */\nexport function argumentValuesToMapping(args: ArgumentValue[]): AliasMapping {\n  const mapping: AliasMapping = {};\n  for (const arg of args) {\n    if (arg.value) {\n      mapping[arg.alias] = arg.value;\n    }\n  }\n  return mapping;\n}\n\n/**\n * Normalize a RSLang expression for duplicate comparison.\n *\n * Returns `null` for basic concepts without formal definitions. Pass a pre-parsed `ast`\n * when the expression was already analyzed to avoid re-parsing.\n */\nexport function normalizeExpression(expression: string, cst_type: CstType, ast?: AstNode | null): string | null {\n  if (isBasicConcept(cst_type) && cst_type !== CstType.AXIOM) {\n    return null;\n  }\n  const parsed = ast ?? parseRSLangExpression(expression);\n  let normalized = '';\n  if (parsed && !parsed.hasError) {\n    normalized = generateExpressionFromAst(parsed, { normalize: true });\n  } else {\n    normalized = expression;\n  }\n  normalized = normalized.replace(/\\s+/g, '');\n  return normalized === '' ? null : normalized;\n}\n\n/** Checks if given expression is a template. */\nexport function inferTemplate(expression: string): boolean {\n  const match = expression.match(/R\\d+/g);\n  return (match && match?.length > 0) ?? false;\n}\n\n/** Infers the {@link CstClass} based on the provided {@link CstType} and template status. */\nexport function inferClass(type: CstType, isTemplate: boolean = false): CstClass {\n  if (isTemplate) {\n    return CstClass.TEMPLATE;\n  }\n  return CST_TYPE_TO_CLASS[type];\n}\n\n/** Check if {@link Constituenta} is a template or a category. */\nexport function isTemplateCst(cst: Constituenta): boolean {\n  return cst.cst_type === CstType.FUNCTION || cst.cst_type === CstType.PREDICATE || cst.cst_type === CstType.STATEMENT;\n}\n\n/** Apply filter based on start {@link Constituenta} type. */\nexport function applyFilterCategory(start: Constituenta, items: Constituenta[]): Constituenta[] {\n  const startIndex = items.indexOf(start);\n  if (startIndex === -1) {\n    return [];\n  }\n  const nextCategoryIndex = items.findIndex((cst, index) => index > startIndex && cst.cst_type === CstType.STATEMENT);\n\n  return items.filter((_, index) => index >= startIndex && (nextCategoryIndex === -1 || index < nextCategoryIndex));\n}\n\n/** Prefix for alias indicating {@link CstType}. */\nexport function getCstTypePrefix(type: CstType): string {\n  return CST_TYPE_PREFIX[type];\n}\n\n/** Guess {@link CstType} from user input hint. */\nexport function guessCstType(hint: string): CstType | null {\n  if (hint.length !== 1) {\n    return null;\n  }\n  for (const [type, prefix] of Object.entries(CST_TYPE_PREFIX)) {\n    if (hint === prefix) {\n      return type as CstType;\n    }\n  }\n  return null;\n}\n\n/** Evaluate if {@link CstType} is basic concept. */\nexport function isBasicConcept(type: CstType): boolean {\n  switch (type) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n      return true;\n\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is base set or constant set. */\nexport function isBaseSet(type: CstType): boolean {\n  switch (type) {\n    case CstType.BASE:\n    case CstType.CONSTANT:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is a function. */\nexport function isFunctional(type: CstType): boolean {\n  switch (type) {\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n    case CstType.TERM:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is logical. */\nexport function isLogical(type: CstType): boolean {\n  switch (type) {\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return false;\n  }\n}\n\n/** Evaluate if {@link Constituenta} can be used produce structure. */\nexport function canProduceStructure(cst: Constituenta): boolean {\n  switch (cst.cst_type) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n    case CstType.PREDICATE:\n      return false;\n  }\n  if (!cst.effectiveType) {\n    return false;\n  }\n  if (cst.cst_type === CstType.FUNCTION) {\n    const result = (cst.effectiveType as EchelonFunctional).result;\n    return typeCanProduceStructure(result);\n  }\n  if (!isTypification(cst.effectiveType)) {\n    return false;\n  }\n  return typeCanProduceStructure(cst.effectiveType as Typification);\n}\n\n/** Evaluate if {@link CstType} can have manual typification. */\nexport function canHaveManualTypification(type: CstType): boolean {\n  switch (type) {\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Validate alias format for a given {@link CstType} (prefix + digits, min length 2). */\nexport function validateAliasFormat(alias: string, type: CstType): boolean {\n  if (alias.length < 2) {\n    return false;\n  }\n  const prefix = getCstTypePrefix(type);\n  if (!alias.startsWith(prefix)) {\n    return false;\n  }\n  if (!/^\\d+$/.exec(alias.substring(prefix.length))) {\n    return false;\n  }\n  return true;\n}\n\n/** Validate new alias against {@link CstType} and {@link RSForm}. */\nexport function validateNewAlias(alias: string, type: CstType, schema: RSForm): boolean {\n  if (!validateAliasFormat(alias, type)) {\n    return false;\n  }\n  if (schema.cstByAlias.has(alias)) {\n    return false;\n  }\n  return true;\n}\n\n/** Generate alias for new {@link Constituenta} of a given {@link CstType} for current {@link RSForm}. */\nexport function generateAlias(type: CstType, schema: RSForm, takenAliases: string[] = []): string {\n  const prefix = getCstTypePrefix(type);\n  if (schema.items.length <= 0) {\n    return `${prefix}1`;\n  }\n  let index = schema.items.reduce((prev, cst, index) => {\n    if (cst.cst_type !== type) {\n      return prev;\n    }\n    index = Number(cst.alias.slice(1 - cst.alias.length)) + 1;\n    return Math.max(prev, index);\n  }, 1);\n  let alias = `${prefix}${index}`;\n  while (takenAliases.includes(alias)) {\n    index = index + 1;\n    alias = `${prefix}${index}`;\n  }\n  return alias;\n}\n\n/**\n * Id to pass as `insert_after` when creating a new {@link Constituenta} spawned by `targetId`:\n * after the last existing child of that spawner, or after the spawner itself if none.\n */\nexport function inferNewSpawnPosition(schema: RSForm, targetId: number): number {\n  let last: number | null = null;\n  for (const cst of schema.items) {\n    if (cst.spawner === targetId) {\n      last = cst.id;\n    }\n  }\n  return last ?? targetId;\n}\n\n/** Sorts library items relevant for InlineSynthesis with specified {@link RSForm}. */\nexport function sortItemsForInlineSynthesis(receiver: RSForm, items: readonly LibraryItem[]): LibraryItem[] {\n  const result = items.filter(item => item.location === receiver.location);\n  for (const item of items) {\n    if (item.visible && item.owner === item.owner && !result.includes(item)) {\n      result.push(item);\n    }\n  }\n  for (const item of items) {\n    if (item.visible && !result.includes(item)) {\n      result.push(item);\n    }\n  }\n  for (const item of items) {\n    if (!result.includes(item)) {\n      result.push(item);\n    }\n  }\n  return result;\n}\n\n/** Fields of {@link Constituenta} updated in place by alias mapping. */\nexport interface ConstituentaMappableFields {\n  alias: string;\n  definition_formal: string;\n  typification_manual: string;\n  term_raw: string;\n  definition_raw: string;\n}\n\n/**\n * Remap formal expressions and terminological entity references in constituent fields.\n * Mutates each element of `items` in place; pass owned or cloned data only.\n */\nexport function applyMappingToConstituents<T extends ConstituentaMappableFields>(\n  items: T[],\n  mapping: AliasMapping,\n  changeAliases: boolean\n): void {\n  for (const cst of items) {\n    if (changeAliases && cst.alias in mapping) {\n      cst.alias = mapping[cst.alias];\n    }\n    cst.definition_formal = applyAliasMapping(cst.definition_formal, mapping);\n    cst.typification_manual = applyTypificationMapping(cst.typification_manual, mapping);\n    cst.term_raw = applyEntityReferenceMapping(cst.term_raw, mapping);\n    cst.definition_raw = applyEntityReferenceMapping(cst.definition_raw, mapping);\n  }\n}\n\n/** Remove alias from expression. */\nexport function removeAliasReference(expression: string, alias: string): string {\n  const result = expression.replaceAll(new RegExp(`\\\\b${alias}\\\\b`, 'g'), 'DEL');\n  return result === 'DEL' ? '' : result;\n}\n\n/** Add alias to expression. */\nexport function addAliasReference(expression: string, alias: string): string {\n  return expression + ' ' + alias;\n}\n\n/** Returns expected {@link TypeClass} of formal definition for {@link CstType}. */\nexport function typeClassForCstType(cstType: CstType): TypeClass {\n  switch (cstType) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n      return TypeClass.typification;\n    case CstType.FUNCTION:\n      return TypeClass.function;\n    case CstType.PREDICATE:\n      return TypeClass.predicate;\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return TypeClass.logic;\n  }\n}\n\n/** Checks whether a constituenta type supports formal definitions. */\nexport function canHaveFormalDefinition(cstType: CstType): boolean {\n  return cstType !== CstType.BASE && cstType !== CstType.CONSTANT;\n}\n\n/** Analyze expression for {@link RSForm}. */\nexport function getAnalysisFor(expression: string, cstType: CstType, schema: RSForm, alias?: string): AnalysisFull {\n  if (!canHaveFormalDefinition(cstType)) {\n    if (expression.trim().length === 0) {\n      const fallbackAlias = alias && alias.length > 0 ? alias : 'X0';\n      const type = cstType === CstType.BASE ? bool(basic(fallbackAlias)) : bool(constant(fallbackAlias));\n      return {\n        success: true,\n        type,\n        valueClass: ValueClass.VALUE,\n        errors: [],\n        ast: null\n      };\n    }\n    return {\n      success: false,\n      type: null,\n      valueClass: null,\n      errors: [\n        {\n          code: RSErrorCode.definitionNotAllowed,\n          from: 0,\n          to: Math.max(expression.length, 1),\n          params: [cstType, alias ?? '']\n        }\n      ],\n      ast: null\n    };\n  }\n  return schema.analyzer.checkFull(expression, {\n    expected: typeClassForCstType(cstType),\n    isDomain: cstType === CstType.STRUCTURED\n  });\n}\n\n/** Calculate statistics for {@link RSForm}. */\nexport function calculateSchemaStats(target: RSForm): RSFormStats {\n  const items = target.items;\n  return {\n    count_all: items.length,\n    count_crucial: items.reduce((sum, cst) => sum + (cst.crucial ? 1 : 0), 0),\n\n    step_complexity: items.reduce((sum, cst) => sum + calculateStepComplexity(cst), 0),\n\n    count_problematic: items.reduce((sum, cst) => sum + (isSchemaIssue(cst) ? 1 : 0), 0),\n    count_homonyms: items.reduce(\n      (sum, cst) => sum + (hasCstDiagnostic(cst, RSDiagnosticCode.schemaHomonym) ? 1 : 0),\n      0\n    ),\n    count_formal_duplicates: items.reduce(\n      (sum, cst) => sum + (hasCstDiagnostic(cst, RSDiagnosticCode.schemaFormalDuplicate) ? 1 : 0),\n      0\n    ),\n    count_missing_convention: items.reduce((sum, cst) => sum + (isMissingConvention(cst) ? 1 : 0), 0),\n    count_type_mismatch: items.reduce((sum, cst) => sum + (cst.is_type_mismatch ? 1 : 0), 0),\n\n    count_incorrect: items.reduce((sum, cst) => sum + (cst.status === CstStatus.INCORRECT ? 1 : 0), 0),\n    count_property: items.reduce((sum, cst) => sum + (cst.analysis?.valueClass === ValueClass.PROPERTY ? 1 : 0), 0),\n    count_incalculable: items.reduce(\n      (sum, cst) => sum + (cst.analysis?.success && cst.analysis.valueClass === null ? 1 : 0),\n      0\n    ),\n    count_inherited: items.reduce((sum, cst) => sum + (cst.is_inherited ? 1 : 0), 0),\n\n    count_text_term: items.reduce((sum, cst) => sum + (cst.term_raw ? 1 : 0), 0),\n    count_definition: items.reduce((sum, cst) => sum + (cst.definition_raw ? 1 : 0), 0),\n    count_convention: items.reduce((sum, cst) => sum + (isBasicConcept(cst.cst_type) && cst.convention ? 1 : 0), 0),\n    count_comment: items.reduce((sum, cst) => sum + (!isBasicConcept(cst.cst_type) && !cst.convention ? 1 : 0), 0),\n\n    count_base: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.BASE ? 1 : 0), 0),\n    count_constant: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.CONSTANT ? 1 : 0), 0),\n    count_structured: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.STRUCTURED ? 1 : 0), 0),\n    count_axiom: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.AXIOM ? 1 : 0), 0),\n    count_term: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.TERM ? 1 : 0), 0),\n    count_function: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.FUNCTION ? 1 : 0), 0),\n    count_predicate: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.PREDICATE ? 1 : 0), 0),\n    count_statement: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.STATEMENT ? 1 : 0), 0),\n    count_nominal: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.NOMINAL ? 1 : 0), 0)\n  };\n}\n\n/** Finds {@link Constituenta} by structure path. */\nexport function findCstByStructure(schema: RSForm, target: Constituenta, path: TypePath): Constituenta | null {\n  for (const cst of schema.items) {\n    if (cst.spawner === target.id && cst.spawner_path) {\n      if (cst.spawner_path.length === path.length && cst.spawner_path.every((v, i) => v === path[i])) {\n        return cst;\n      }\n    }\n  }\n  return null;\n}\n\n/** Retrieves name for piece of target {@link Constituenta} structure. */\nexport function getStructureName(schema: RSForm, target: Constituenta, path: TypePath): string {\n  const representation = findCstByStructure(schema, target, path);\n  if (representation) {\n    return `${representation.alias}: ${representation.term_resolved}`;\n  }\n  if (!isTypification(target.effectiveType)) {\n    return '';\n  }\n  const type = applyPath(target.effectiveType as Typification, path);\n  if (type?.typeID === TypeID.basic) {\n    const cst = schema.cstByAlias.get(type.baseID);\n    if (cst?.term_resolved) {\n      return `${cst.alias}: ${cst.term_resolved}`;\n    }\n  }\n  return '';\n}\n\n// ========= Internals =====\nfunction calculateStepComplexity(cst: Constituenta): number {\n  if (cst.cst_type === CstType.AXIOM || cst.cst_type === CstType.NOMINAL || !isBasicConcept(cst.cst_type)) {\n    return 0;\n  }\n  if (cst.cst_type === CstType.BASE || cst.cst_type === CstType.CONSTANT || !cst.effectiveType) {\n    return 1;\n  }\n\n  const type = cst.effectiveType as Typification;\n  return calculateTypificationComplexity(type) + 1;\n}\n\nfunction calculateTypificationComplexity(type: Typification): number {\n  switch (type.typeID) {\n    case TypeID.basic:\n    case TypeID.integer:\n    case TypeID.anyTypification:\n      return 0;\n    case TypeID.tuple:\n      return (\n        type.factors.length + type.factors.reduce((sum, factor) => sum + calculateTypificationComplexity(factor), 0)\n      );\n    case TypeID.collection:\n      if (type.base.typeID === TypeID.tuple) {\n        let sum = 0;\n        type.base.factors.forEach(factor => {\n          sum += calculateTypificationComplexity(factor);\n        });\n        return sum + type.base.factors.length;\n      } else if (type.base.typeID === TypeID.collection) {\n        return calculateTypificationComplexity(type.base) + 1;\n      }\n      return 0;\n  }\n}\n\nfunction isMissingConvention(cst: Constituenta): boolean {\n  if (isBasicConcept(cst.cst_type) && !isLogical(cst.cst_type)) {\n    if (!cst.convention || !cst.term_resolved) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/** Evaluate if {@link Typification} can be used to produce structure. */\nfunction typeCanProduceStructure(type: Typification): boolean {\n  if (type.typeID === TypeID.basic || type.typeID === TypeID.integer || type.typeID === TypeID.anyTypification) {\n    return false;\n  } else if (type.typeID === TypeID.tuple) {\n    return true;\n  } else {\n    return (\n      type.base.typeID !== TypeID.basic &&\n      type.base.typeID !== TypeID.integer &&\n      type.base.typeID !== TypeID.anyTypification\n    );\n  }\n}\n","/**\n * Module: Compact diagnostics for constituents (schema and model issue codes).\n */\n\nimport { labelType } from '../rslang/labels';\n\nimport { type Constituenta, type CstType } from './rsform';\nimport { isBasicConcept, isLogical } from './rsform-api';\nimport { EvalStatus } from './rsmodel';\n\n/** Origin of a diagnostic. */\nexport const DiagnosticKind = {\n  EXPRESSION: 'expression',\n  SCHEMA: 'schema',\n  MODEL: 'model'\n} as const;\nexport type DiagnosticKind = (typeof DiagnosticKind)[keyof typeof DiagnosticKind];\n\n/** Schema and model diagnostic codes (same numeric format as {@link RSErrorCode}). */\nexport const RSDiagnosticCode = {\n  schemaHomonym: 0x8901,\n  schemaFormalDuplicate: 0x8902,\n  schemaMissingConvention: 0x8903,\n  schemaMissingTerm: 0x8904,\n  schemaTypeMismatch: 0x8905,\n\n  modelEmpty: 0x8910,\n  modelAxiomFalse: 0x8911,\n  modelInvalidData: 0x8912,\n  modelEvalFail: 0x8913\n} as const;\nexport type RSDiagnosticCode = (typeof RSDiagnosticCode)[keyof typeof RSDiagnosticCode];\n\n/** Compact diagnostic stored on {@link Constituenta} after schema loading. */\nexport interface CstDiagnostic {\n  kind: DiagnosticKind;\n  code: number;\n  /** Positional message arguments (per-code; homonyms/duplicates use `[aliases]`). */\n  params?: readonly string[];\n}\n\n/** Whether a constituent has a schema/model diagnostic with the given code. */\nexport function hasCstDiagnostic(cst: Constituenta, code: RSDiagnosticCode): boolean {\n  return cst.diagnostics?.some(item => item.code === code) ?? false;\n}\n\n/**\n * Populate `diagnostics` on each constituent (homonyms, duplicates, metadata, type mismatch).\n *\n * Requires normalized formal definitions for duplicate detection (same as Portal loader).\n */\nexport function assignSchemaDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string,\n  normalizedDefinitions: ReadonlyMap<number, string>\n): void {\n  const homonymById = detectHomonymDiagnostics(items, resolveAlias);\n  const duplicateById = detectFormalDuplicateDiagnostics(items, resolveAlias, normalizedDefinitions);\n\n  for (const cst of items) {\n    const diagnostics: CstDiagnostic[] = [];\n    const homonym = homonymById.get(cst.id);\n    if (homonym) {\n      diagnostics.push(homonym);\n    }\n    const duplicate = duplicateById.get(cst.id);\n    if (duplicate) {\n      diagnostics.push(duplicate);\n    }\n    diagnostics.push(...collectLocalSchemaDiagnostics(cst));\n    cst.diagnostics = diagnostics;\n  }\n}\n\n/** Map a model evaluation status to a compact diagnostic, or `null` when not an issue. */\nexport function modelStatusCstDiagnostic(status: EvalStatus, cstType: CstType): CstDiagnostic | null {\n  const code = modelStatusToCode(status, cstType);\n  if (code === null) {\n    return null;\n  }\n  return { kind: DiagnosticKind.MODEL, code, params: [String(status)] };\n}\n\nfunction collectLocalSchemaDiagnostics(cst: Constituenta): CstDiagnostic[] {\n  const result: CstDiagnostic[] = [];\n  if (cst.is_type_mismatch) {\n    result.push({\n      kind: DiagnosticKind.SCHEMA,\n      code: RSDiagnosticCode.schemaTypeMismatch,\n      params: [cst.typification_manual, labelType(cst.analysis.type)]\n    });\n  }\n  if (isBasicConcept(cst.cst_type) && !isLogical(cst.cst_type)) {\n    if (!cst.convention.trim()) {\n      result.push({ kind: DiagnosticKind.SCHEMA, code: RSDiagnosticCode.schemaMissingConvention });\n    }\n    if (!cst.term_resolved.trim()) {\n      result.push({ kind: DiagnosticKind.SCHEMA, code: RSDiagnosticCode.schemaMissingTerm });\n    }\n  }\n  return result;\n}\n\nfunction detectHomonymDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string\n): Map<number, CstDiagnostic> {\n  const byTerm = new Map<string, Constituenta[]>();\n  for (const cst of items) {\n    const key = cst.term_resolved.trim().toLocaleLowerCase();\n    if (key === '') {\n      continue;\n    }\n    const group = byTerm.get(key) ?? [];\n    group.push(cst);\n    byTerm.set(key, group);\n  }\n\n  const result = new Map<number, CstDiagnostic>();\n  for (const group of byTerm.values()) {\n    if (group.length <= 1) {\n      continue;\n    }\n    for (const cst of group) {\n      const aliases = group\n        .filter(other => other.id !== cst.id)\n        .map(other => resolveAlias(other.id))\n        .join(', ');\n      result.set(cst.id, {\n        kind: DiagnosticKind.SCHEMA,\n        code: RSDiagnosticCode.schemaHomonym,\n        params: [aliases]\n      });\n    }\n  }\n  return result;\n}\n\nfunction detectFormalDuplicateDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string,\n  normalizedDefinitions: ReadonlyMap<number, string>\n): Map<number, CstDiagnostic> {\n  const byDefinition = new Map<string, Constituenta[]>();\n  for (const cst of items) {\n    const key = normalizedDefinitions.get(cst.id);\n    if (!key) {\n      continue;\n    }\n    const group = byDefinition.get(key) ?? [];\n    group.push(cst);\n    byDefinition.set(key, group);\n  }\n\n  const result = new Map<number, CstDiagnostic>();\n  for (const group of byDefinition.values()) {\n    if (group.length <= 1) {\n      continue;\n    }\n    for (const cst of group) {\n      const aliases = group\n        .filter(other => other.id !== cst.id)\n        .map(other => resolveAlias(other.id))\n        .join(', ');\n      result.set(cst.id, {\n        kind: DiagnosticKind.SCHEMA,\n        code: RSDiagnosticCode.schemaFormalDuplicate,\n        params: [aliases]\n      });\n    }\n  }\n  return result;\n}\n\nfunction modelStatusToCode(status: EvalStatus, cstType: CstType): RSDiagnosticCode | null {\n  switch (status) {\n    case EvalStatus.EMPTY:\n      return isBasicConcept(cstType) ? RSDiagnosticCode.modelEmpty : null;\n    case EvalStatus.AXIOM_FALSE:\n      return RSDiagnosticCode.modelAxiomFalse;\n    case EvalStatus.INVALID_DATA:\n      return RSDiagnosticCode.modelInvalidData;\n    case EvalStatus.EVAL_FAIL:\n      return RSDiagnosticCode.modelEvalFail;\n    default:\n      return null;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAsCA,MAAM,kBAA2C;EAC9C,QAAQ,UAAU;EAClB,QAAQ,OAAO;EACf,QAAQ,WAAW;EACnB,QAAQ,aAAa;EACrB,QAAQ,QAAQ;EAChB,QAAQ,OAAO;EACf,QAAQ,WAAW;EACnB,QAAQ,YAAY;EACpB,QAAQ,YAAY;AACvB;;AAGA,MAAM,oBAA+C;EAClD,QAAQ,UAAU,SAAS;EAC3B,QAAQ,OAAO,SAAS;EACxB,QAAQ,WAAW,SAAS;EAC5B,QAAQ,aAAa,SAAS;EAC9B,QAAQ,OAAO,SAAS;EACxB,QAAQ,WAAW,SAAS;EAC5B,QAAQ,QAAQ,SAAS;EACzB,QAAQ,YAAY,SAAS;EAC7B,QAAQ,YAAY,SAAS;AAChC;;AAGA,SAAgB,cAAc,KAA4B;CACxD,QACG,IAAI,aAAa,UAAU,KAAK,KAAK,IAAI,WAAW,UAAU,aAAa,IAAI,WAAW,UAAU;AAEzG;;AAGA,SAAgB,YAAY,OAAgB,OAAsC;CAChF,IAAI,CAAC,OACH,OAAO,UAAU;CAEnB,IAAI,UAAU,MACZ,OAAO,UAAU;CAEnB,IAAI,UAAU,WAAW,UACvB,OAAO,UAAU;CAEnB,OAAO,UAAU;AACnB;;AAGA,SAAgB,mBAAmB,cAAuB,MAAgC;CACxF,IAAI,KAAK,WAAW,KAAK,KAAK,MAAK,QAAO,CAAC,IAAI,KAAK,GAClD,OAAO;MACF,IAAI,iBAAiB,QAAQ,WAClC,OAAO,QAAQ;MAEf,OAAO,QAAQ;AAEnB;;AAGA,SAAgB,wBAAwB,MAAqC;CAC3E,MAAM,UAAwB,CAAC;CAC/B,KAAK,MAAM,OAAO,MAChB,IAAI,IAAI,OACN,QAAQ,IAAI,SAAS,IAAI;CAG7B,OAAO;AACT;;;;;;;AAQA,SAAgB,oBAAoB,YAAoB,UAAmB,KAAqC;CAC9G,IAAI,eAAe,QAAQ,KAAK,aAAa,QAAQ,OACnD,OAAO;CAET,MAAM,SAAS,OAAO,sBAAsB,UAAU;CACtD,IAAI,aAAa;CACjB,IAAI,UAAU,CAAC,OAAO,UACpB,aAAa,0BAA0B,QAAQ,EAAE,WAAW,KAAK,CAAC;MAElE,aAAa;CAEf,aAAa,WAAW,QAAQ,QAAQ,EAAE;CAC1C,OAAO,eAAe,KAAK,OAAO;AACpC;;AAGA,SAAgB,cAAc,YAA6B;CACzD,MAAM,QAAQ,WAAW,MAAM,OAAO;CACtC,QAAQ,SAAS,OAAO,SAAS,MAAM;AACzC;;AAGA,SAAgB,WAAW,MAAe,aAAsB,OAAiB;CAC/E,IAAI,YACF,OAAO,SAAS;CAElB,OAAO,kBAAkB;AAC3B;;AAGA,SAAgB,cAAc,KAA4B;CACxD,OAAO,IAAI,aAAa,QAAQ,YAAY,IAAI,aAAa,QAAQ,aAAa,IAAI,aAAa,QAAQ;AAC7G;;AAGA,SAAgB,oBAAoB,OAAqB,OAAuC;CAC9F,MAAM,aAAa,MAAM,QAAQ,KAAK;CACtC,IAAI,eAAe,IACjB,OAAO,CAAC;CAEV,MAAM,oBAAoB,MAAM,WAAW,KAAK,UAAU,QAAQ,cAAc,IAAI,aAAa,QAAQ,SAAS;CAElH,OAAO,MAAM,QAAQ,GAAG,UAAU,SAAS,eAAe,sBAAsB,MAAM,QAAQ,kBAAkB;AAClH;;AAGA,SAAgB,iBAAiB,MAAuB;CACtD,OAAO,gBAAgB;AACzB;;AAGA,SAAgB,aAAa,MAA8B;CACzD,IAAI,KAAK,WAAW,GAClB,OAAO;CAET,KAAK,MAAM,CAAC,MAAM,WAAW,OAAO,QAAQ,eAAe,GACzD,IAAI,SAAS,QACX,OAAO;CAGX,OAAO;AACT;;AAGA,SAAgB,eAAe,MAAwB;CACrD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,OACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,UAAU,MAAwB;CAChD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ,UACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,aAAa,MAAwB;CACnD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,UAAU,MAAwB;CAChD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,oBAAoB,KAA4B;CAC9D,QAAQ,IAAI,UAAZ;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;CACA,IAAI,CAAC,IAAI,eACP,OAAO;CAET,IAAI,IAAI,aAAa,QAAQ,UAAU;EACrC,MAAM,SAAU,IAAI,cAAoC;EACxD,OAAO,wBAAwB,MAAM;CACvC;CACA,IAAI,CAAC,eAAe,IAAI,aAAa,GACnC,OAAO;CAET,OAAO,wBAAwB,IAAI,aAA6B;AAClE;;AAGA,SAAgB,0BAA0B,MAAwB;CAChE,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,oBAAoB,OAAe,MAAwB;CACzE,IAAI,MAAM,SAAS,GACjB,OAAO;CAET,MAAM,SAAS,iBAAiB,IAAI;CACpC,IAAI,CAAC,MAAM,WAAW,MAAM,GAC1B,OAAO;CAET,IAAI,CAAC,QAAQ,KAAK,MAAM,UAAU,OAAO,MAAM,CAAC,GAC9C,OAAO;CAET,OAAO;AACT;;AAGA,SAAgB,iBAAiB,OAAe,MAAe,QAAyB;CACtF,IAAI,CAAC,oBAAoB,OAAO,IAAI,GAClC,OAAO;CAET,IAAI,OAAO,WAAW,IAAI,KAAK,GAC7B,OAAO;CAET,OAAO;AACT;;AAGA,SAAgB,cAAc,MAAe,QAAgB,eAAyB,CAAC,GAAW;CAChG,MAAM,SAAS,iBAAiB,IAAI;CACpC,IAAI,OAAO,MAAM,UAAU,GACzB,OAAO,GAAG,OAAO;CAEnB,IAAI,QAAQ,OAAO,MAAM,QAAQ,MAAM,KAAK,UAAU;EACpD,IAAI,IAAI,aAAa,MACnB,OAAO;EAET,QAAQ,OAAO,IAAI,MAAM,MAAM,IAAI,IAAI,MAAM,MAAM,CAAC,IAAI;EACxD,OAAO,KAAK,IAAI,MAAM,KAAK;CAC7B,GAAG,CAAC;CACJ,IAAI,QAAQ,GAAG,SAAS;CACxB,OAAO,aAAa,SAAS,KAAK,GAAG;EACnC,QAAQ,QAAQ;EAChB,QAAQ,GAAG,SAAS;CACtB;CACA,OAAO;AACT;;;;;AAMA,SAAgB,sBAAsB,QAAgB,UAA0B;CAC9E,IAAI,OAAsB;CAC1B,KAAK,MAAM,OAAO,OAAO,OACvB,IAAI,IAAI,YAAY,UAClB,OAAO,IAAI;CAGf,OAAO,QAAQ;AACjB;;AAGA,SAAgB,4BAA4B,UAAkB,OAA8C;CAC1G,MAAM,SAAS,MAAM,QAAO,SAAQ,KAAK,aAAa,SAAS,QAAQ;CACvE,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,WAAW,KAAK,UAAU,KAAK,SAAS,CAAC,OAAO,SAAS,IAAI,GACpE,OAAO,KAAK,IAAI;CAGpB,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,WAAW,CAAC,OAAO,SAAS,IAAI,GACvC,OAAO,KAAK,IAAI;CAGpB,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,OAAO,SAAS,IAAI,GACvB,OAAO,KAAK,IAAI;CAGpB,OAAO;AACT;;;;;AAeA,SAAgB,2BACd,OACA,SACA,eACM;CACN,KAAK,MAAM,OAAO,OAAO;EACvB,IAAI,iBAAiB,IAAI,SAAS,SAChC,IAAI,QAAQ,QAAQ,IAAI;EAE1B,IAAI,oBAAoB,kBAAkB,IAAI,mBAAmB,OAAO;EACxE,IAAI,sBAAsB,yBAAyB,IAAI,qBAAqB,OAAO;EACnF,IAAI,WAAW,4BAA4B,IAAI,UAAU,OAAO;EAChE,IAAI,iBAAiB,4BAA4B,IAAI,gBAAgB,OAAO;CAC9E;AACF;;AAGA,SAAgB,qBAAqB,YAAoB,OAAuB;CAC9E,MAAM,SAAS,WAAW,WAAW,IAAI,OAAO,MAAM,MAAM,MAAM,GAAG,GAAG,KAAK;CAC7E,OAAO,WAAW,QAAQ,KAAK;AACjC;;AAGA,SAAgB,kBAAkB,YAAoB,OAAuB;CAC3E,OAAO,aAAa,MAAM;AAC5B;;AAGA,SAAgB,oBAAoB,SAA6B;CAC/D,QAAQ,SAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,MACX,OAAO,UAAU;EACnB,KAAK,QAAQ,UACX,OAAO,UAAU;EACnB,KAAK,QAAQ,WACX,OAAO,UAAU;EACnB,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO,UAAU;CACrB;AACF;;AAGA,SAAgB,wBAAwB,SAA2B;CACjE,OAAO,YAAY,QAAQ,QAAQ,YAAY,QAAQ;AACzD;;AAGA,SAAgB,eAAe,YAAoB,SAAkB,QAAgB,OAA8B;CACjH,IAAI,CAAC,wBAAwB,OAAO,GAAG;EACrC,IAAI,WAAW,KAAK,CAAC,CAAC,WAAW,GAAG;GAClC,MAAM,gBAAgB,SAAS,MAAM,SAAS,IAAI,QAAQ;GAE1D,OAAO;IACL,SAAS;IACT,MAHW,YAAY,QAAQ,OAAO,KAAK,MAAM,aAAa,CAAC,IAAI,KAAK,SAAS,aAAa,CAAC;IAI/F,YAAY,WAAW;IACvB,QAAQ,CAAC;IACT,KAAK;GACP;EACF;EACA,OAAO;GACL,SAAS;GACT,MAAM;GACN,YAAY;GACZ,QAAQ,CACN;IACE,MAAM,YAAY;IAClB,MAAM;IACN,IAAI,KAAK,IAAI,WAAW,QAAQ,CAAC;IACjC,QAAQ,CAAC,SAAS,SAAS,EAAE;GAC/B,CACF;GACA,KAAK;EACP;CACF;CACA,OAAO,OAAO,SAAS,UAAU,YAAY;EAC3C,UAAU,oBAAoB,OAAO;EACrC,UAAU,YAAY,QAAQ;CAChC,CAAC;AACH;;AAGA,SAAgB,qBAAqB,QAA6B;CAChE,MAAM,QAAQ,OAAO;CACrB,OAAO;EACL,WAAW,MAAM;EACjB,eAAe,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,UAAU,IAAI,IAAI,CAAC;EAExE,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,MAAM,wBAAwB,GAAG,GAAG,CAAC;EAEjF,mBAAmB,MAAM,QAAQ,KAAK,QAAQ,OAAO,cAAc,GAAG,IAAI,IAAI,IAAI,CAAC;EACnF,gBAAgB,MAAM,QACnB,KAAK,QAAQ,OAAO,iBAAiB,KAAK,iBAAiB,aAAa,IAAI,IAAI,IACjF,CACF;EACA,yBAAyB,MAAM,QAC5B,KAAK,QAAQ,OAAO,iBAAiB,KAAK,iBAAiB,qBAAqB,IAAI,IAAI,IACzF,CACF;EACA,0BAA0B,MAAM,QAAQ,KAAK,QAAQ,OAAO,oBAAoB,GAAG,IAAI,IAAI,IAAI,CAAC;EAChG,qBAAqB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,mBAAmB,IAAI,IAAI,CAAC;EAEvF,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,WAAW,UAAU,YAAY,IAAI,IAAI,CAAC;EACjG,gBAAgB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,UAAU,eAAe,WAAW,WAAW,IAAI,IAAI,CAAC;EAC9G,oBAAoB,MAAM,QACvB,KAAK,QAAQ,OAAO,IAAI,UAAU,WAAW,IAAI,SAAS,eAAe,OAAO,IAAI,IACrF,CACF;EACA,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,eAAe,IAAI,IAAI,CAAC;EAE/E,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,WAAW,IAAI,IAAI,CAAC;EAC3E,kBAAkB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,iBAAiB,IAAI,IAAI,CAAC;EAClF,kBAAkB,MAAM,QAAQ,KAAK,QAAQ,OAAO,eAAe,IAAI,QAAQ,KAAK,IAAI,aAAa,IAAI,IAAI,CAAC;EAC9G,eAAe,MAAM,QAAQ,KAAK,QAAQ,OAAO,CAAC,eAAe,IAAI,QAAQ,KAAK,CAAC,IAAI,aAAa,IAAI,IAAI,CAAC;EAE7G,YAAY,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,OAAO,IAAI,IAAI,CAAC;EACvF,gBAAgB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,WAAW,IAAI,IAAI,CAAC;EAC/F,kBAAkB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,aAAa,IAAI,IAAI,CAAC;EACnG,aAAa,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,QAAQ,IAAI,IAAI,CAAC;EACzF,YAAY,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,OAAO,IAAI,IAAI,CAAC;EACvF,gBAAgB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,WAAW,IAAI,IAAI,CAAC;EAC/F,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,YAAY,IAAI,IAAI,CAAC;EACjG,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,YAAY,IAAI,IAAI,CAAC;EACjG,eAAe,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,UAAU,IAAI,IAAI,CAAC;CAC/F;AACF;;AAGA,SAAgB,mBAAmB,QAAgB,QAAsB,MAAqC;CAC5G,KAAK,MAAM,OAAO,OAAO,OACvB,IAAI,IAAI,YAAY,OAAO,MAAM,IAAI,cACnC;MAAI,IAAI,aAAa,WAAW,KAAK,UAAU,IAAI,aAAa,OAAO,GAAG,MAAM,MAAM,KAAK,EAAE,GAC3F,OAAO;CACT;CAGJ,OAAO;AACT;;AAGA,SAAgB,iBAAiB,QAAgB,QAAsB,MAAwB;CAC7F,MAAM,iBAAiB,mBAAmB,QAAQ,QAAQ,IAAI;CAC9D,IAAI,gBACF,OAAO,GAAG,eAAe,MAAM,IAAI,eAAe;CAEpD,IAAI,CAAC,eAAe,OAAO,aAAa,GACtC,OAAO;CAET,MAAM,OAAO,UAAU,OAAO,eAA+B,IAAI;CACjE,IAAI,MAAM,WAAW,OAAO,OAAO;EACjC,MAAM,MAAM,OAAO,WAAW,IAAI,KAAK,MAAM;EAC7C,IAAI,KAAK,eACP,OAAO,GAAG,IAAI,MAAM,IAAI,IAAI;CAEhC;CACA,OAAO;AACT;AAGA,SAAS,wBAAwB,KAA2B;CAC1D,IAAI,IAAI,aAAa,QAAQ,SAAS,IAAI,aAAa,QAAQ,WAAW,CAAC,eAAe,IAAI,QAAQ,GACpG,OAAO;CAET,IAAI,IAAI,aAAa,QAAQ,QAAQ,IAAI,aAAa,QAAQ,YAAY,CAAC,IAAI,eAC7E,OAAO;CAGT,MAAM,OAAO,IAAI;CACjB,OAAO,gCAAgC,IAAI,IAAI;AACjD;AAEA,SAAS,gCAAgC,MAA4B;CACnE,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO,OACV,OACE,KAAK,QAAQ,SAAS,KAAK,QAAQ,QAAQ,KAAK,WAAW,MAAM,gCAAgC,MAAM,GAAG,CAAC;EAE/G,KAAK,OAAO;GACV,IAAI,KAAK,KAAK,WAAW,OAAO,OAAO;IACrC,IAAI,MAAM;IACV,KAAK,KAAK,QAAQ,SAAQ,WAAU;KAClC,OAAO,gCAAgC,MAAM;IAC/C,CAAC;IACD,OAAO,MAAM,KAAK,KAAK,QAAQ;GACjC,OAAO,IAAI,KAAK,KAAK,WAAW,OAAO,YACrC,OAAO,gCAAgC,KAAK,IAAI,IAAI;GAEtD,OAAO;CACX;AACF;AAEA,SAAS,oBAAoB,KAA4B;CACvD,IAAI,eAAe,IAAI,QAAQ,KAAK,CAAC,UAAU,IAAI,QAAQ,GACzD;MAAI,CAAC,IAAI,cAAc,CAAC,IAAI,eAC1B,OAAO;CACT;CAEF,OAAO;AACT;;AAGA,SAAS,wBAAwB,MAA6B;CAC5D,IAAI,KAAK,WAAW,OAAO,SAAS,KAAK,WAAW,OAAO,WAAW,KAAK,WAAW,OAAO,iBAC3F,OAAO;MACF,IAAI,KAAK,WAAW,OAAO,OAChC,OAAO;MAEP,OACE,KAAK,KAAK,WAAW,OAAO,SAC5B,KAAK,KAAK,WAAW,OAAO,WAC5B,KAAK,KAAK,WAAW,OAAO;AAGlC;;;;;;;ACnlBA,MAAa,iBAAiB;CAC5B,YAAY;CACZ,QAAQ;CACR,OAAO;AACT;;AAIA,MAAa,mBAAmB;CAC9B,eAAe;CACf,uBAAuB;CACvB,yBAAyB;CACzB,mBAAmB;CACnB,oBAAoB;CAEpB,YAAY;CACZ,iBAAiB;CACjB,kBAAkB;CAClB,eAAe;AACjB;;AAYA,SAAgB,iBAAiB,KAAmB,MAAiC;CACnF,OAAO,IAAI,aAAa,MAAK,SAAQ,KAAK,SAAS,IAAI,KAAK;AAC9D;;;;;;AAOA,SAAgB,wBACd,OACA,cACA,uBACM;CACN,MAAM,cAAc,yBAAyB,OAAO,YAAY;CAChE,MAAM,gBAAgB,iCAAiC,OAAO,cAAc,qBAAqB;CAEjG,KAAK,MAAM,OAAO,OAAO;EACvB,MAAM,cAA+B,CAAC;EACtC,MAAM,UAAU,YAAY,IAAI,IAAI,EAAE;EACtC,IAAI,SACF,YAAY,KAAK,OAAO;EAE1B,MAAM,YAAY,cAAc,IAAI,IAAI,EAAE;EAC1C,IAAI,WACF,YAAY,KAAK,SAAS;EAE5B,YAAY,KAAK,GAAG,8BAA8B,GAAG,CAAC;EACtD,IAAI,cAAc;CACpB;AACF;;AAGA,SAAgB,yBAAyB,QAAoB,SAAwC;CACnG,MAAM,OAAO,kBAAkB,QAAQ,OAAO;CAC9C,IAAI,SAAS,MACX,OAAO;CAET,OAAO;EAAE,MAAM,eAAe;EAAO;EAAM,QAAQ,CAAC,OAAO,MAAM,CAAC;CAAE;AACtE;AAEA,SAAS,8BAA8B,KAAoC;CACzE,MAAM,SAA0B,CAAC;CACjC,IAAI,IAAI,kBACN,OAAO,KAAK;EACV,MAAM,eAAe;EACrB,MAAM,iBAAiB;EACvB,QAAQ,CAAC,IAAI,qBAAqB,UAAU,IAAI,SAAS,IAAI,CAAC;CAChE,CAAC;CAEH,IAAI,eAAe,IAAI,QAAQ,KAAK,CAAC,UAAU,IAAI,QAAQ,GAAG;EAC5D,IAAI,CAAC,IAAI,WAAW,KAAK,GACvB,OAAO,KAAK;GAAE,MAAM,eAAe;GAAQ,MAAM,iBAAiB;EAAwB,CAAC;EAE7F,IAAI,CAAC,IAAI,cAAc,KAAK,GAC1B,OAAO,KAAK;GAAE,MAAM,eAAe;GAAQ,MAAM,iBAAiB;EAAkB,CAAC;CAEzF;CACA,OAAO;AACT;AAEA,SAAS,yBACP,OACA,cAC4B;CAC5B,MAAM,yBAAS,IAAI,IAA4B;CAC/C,KAAK,MAAM,OAAO,OAAO;EACvB,MAAM,MAAM,IAAI,cAAc,KAAK,CAAC,CAAC,kBAAkB;EACvD,IAAI,QAAQ,IACV;EAEF,MAAM,QAAQ,OAAO,IAAI,GAAG,KAAK,CAAC;EAClC,MAAM,KAAK,GAAG;EACd,OAAO,IAAI,KAAK,KAAK;CACvB;CAEA,MAAM,yBAAS,IAAI,IAA2B;CAC9C,KAAK,MAAM,SAAS,OAAO,OAAO,GAAG;EACnC,IAAI,MAAM,UAAU,GAClB;EAEF,KAAK,MAAM,OAAO,OAAO;GACvB,MAAM,UAAU,MACb,QAAO,UAAS,MAAM,OAAO,IAAI,EAAE,CAAC,CACpC,KAAI,UAAS,aAAa,MAAM,EAAE,CAAC,CAAC,CACpC,KAAK,IAAI;GACZ,OAAO,IAAI,IAAI,IAAI;IACjB,MAAM,eAAe;IACrB,MAAM,iBAAiB;IACvB,QAAQ,CAAC,OAAO;GAClB,CAAC;EACH;CACF;CACA,OAAO;AACT;AAEA,SAAS,iCACP,OACA,cACA,uBAC4B;CAC5B,MAAM,+BAAe,IAAI,IAA4B;CACrD,KAAK,MAAM,OAAO,OAAO;EACvB,MAAM,MAAM,sBAAsB,IAAI,IAAI,EAAE;EAC5C,IAAI,CAAC,KACH;EAEF,MAAM,QAAQ,aAAa,IAAI,GAAG,KAAK,CAAC;EACxC,MAAM,KAAK,GAAG;EACd,aAAa,IAAI,KAAK,KAAK;CAC7B;CAEA,MAAM,yBAAS,IAAI,IAA2B;CAC9C,KAAK,MAAM,SAAS,aAAa,OAAO,GAAG;EACzC,IAAI,MAAM,UAAU,GAClB;EAEF,KAAK,MAAM,OAAO,OAAO;GACvB,MAAM,UAAU,MACb,QAAO,UAAS,MAAM,OAAO,IAAI,EAAE,CAAC,CACpC,KAAI,UAAS,aAAa,MAAM,EAAE,CAAC,CAAC,CACpC,KAAK,IAAI;GACZ,OAAO,IAAI,IAAI,IAAI;IACjB,MAAM,eAAe;IACrB,MAAM,iBAAiB;IACvB,QAAQ,CAAC,OAAO;GAClB,CAAC;EACH;CACF;CACA,OAAO;AACT;AAEA,SAAS,kBAAkB,QAAoB,SAA2C;CACxF,QAAQ,QAAR;EACE,KAAK,WAAW,OACd,OAAO,eAAe,OAAO,IAAI,iBAAiB,aAAa;EACjE,KAAK,WAAW,aACd,OAAO,iBAAiB;EAC1B,KAAK,WAAW,cACd,OAAO,iBAAiB;EAC1B,KAAK,WAAW,WACd,OAAO,iBAAiB;EAC1B,SACE,OAAO;CACX;AACF"}