@rsconcept/domain 2.1.0 → 2.1.1

package/dist/{analyzer-iqAXyROE.d.ts → analyzer-fNhkwO-6.d.ts}

@@ -1,6 +1,6 @@
 import { t as AstNode } from "./ast-C8sIpKdL.js";
 import { f as ExpressionType, g as TypeClass } from "./typification-9lNu9R4k.js";
-import { i as RSErrorDescription } from "./error-CzIbnP-N.js";
+import { i as RSErrorDescription } from "./error-B0EkIx4K.js";
 import { t as ValueClass } from "./value-class-CNI-lqXJ.js";
 
 //#region src/rslang/semantic/analyzer.d.ts
@@ -35,4 +35,4 @@ declare class RSLangAnalyzer {
 }
 //#endregion
 export { RSLangAnalyzer as a, AnalysisOptions as i, AnalysisFast as n, AnalysisFull as r, AnalysisBase as t };
-//# sourceMappingURL=analyzer-iqAXyROE.d.ts.map
+//# sourceMappingURL=analyzer-fNhkwO-6.d.ts.map

package/dist/{ast-annotations-D6KZDu12.d.ts → ast-annotations-CiIx8qBM.d.ts}

@@ -1,6 +1,6 @@
 import { t as AstNode } from "./ast-C8sIpKdL.js";
 import { f as ExpressionType } from "./typification-9lNu9R4k.js";
-import { a as RSErrorInfo, r as RSErrorCode } from "./error-CzIbnP-N.js";
+import { a as RSErrorInfo, r as RSErrorCode } from "./error-B0EkIx4K.js";
 
 //#region src/rslang/ast-annotations.d.ts
 /** Appends {@link ExpressionType} onto the node's `annotation.rsType`. */
@@ -13,4 +13,4 @@ declare function annotateError(node: AstNode, code: RSErrorCode, params?: readon
 declare function readErrorAnnotation(node: AstNode): RSErrorInfo | null;
 //#endregion
 export { readTypeAnnotation as i, annotateType as n, readErrorAnnotation as r, annotateError as t };
-//# sourceMappingURL=ast-annotations-D6KZDu12.d.ts.map
+//# sourceMappingURL=ast-annotations-CiIx8qBM.d.ts.map

package/dist/{calculator-k8BGIKmj.d.ts → calculator-DE89LtIM.d.ts}

@@ -1,6 +1,6 @@
 import { t as AstNode } from "./ast-C8sIpKdL.js";
 import { f as ExpressionType } from "./typification-9lNu9R4k.js";
-import { i as RSErrorDescription } from "./error-CzIbnP-N.js";
+import { i as RSErrorDescription } from "./error-B0EkIx4K.js";
 import { l as Value } from "./value-BduA_ZGp.js";
 
 //#region src/rslang/eval/calculator.d.ts
@@ -36,4 +36,4 @@ declare class RSCalculator {
 }
 //#endregion
 export { CalculatorResult as n, RSCalculator as r, CalculatorEvaluateOptions as t };
-//# sourceMappingURL=calculator-k8BGIKmj.d.ts.map
+//# sourceMappingURL=calculator-DE89LtIM.d.ts.map

package/dist/{diagnostics-BSryP66e.js → diagnostics-CY9sKggB.js}

@@ -281,7 +281,6 @@ function typeClassForCstType(cstType) {
 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) {
@@ -339,7 +338,7 @@ function refineAnalysisForDependencyCycles(analysis, expression, schema, alias)
 		changed = true;
 		return {
 			...error,
-			code: RSDiagnosticCode.schemaDependencyCycle,
+			code: RSErrorCode.schemaDependencyCycle,
 			params: [cycleText]
 		};
 	});
@@ -363,6 +362,14 @@ function buildDraftDependencyGraph(schema, currentId, expressionGlobals) {
 	}
 	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);
@@ -525,13 +532,41 @@ function assignSchemaDiagnostics(items, resolveAlias, normalizedDefinitions, gra
 		cst.diagnostics = diagnostics;
 	}
 }
-/** Format a closed cycle of aliases as `A → B → A`. */
+/**
+* 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) {
-	return aliases.join(" → ");
+	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();
@@ -620,4 +655,4 @@ function modelStatusToCode(status, cstType) {
 //#endregion
 export { isLogical as A, inferNewSpawnPosition as C, isBaseSet as D, inferTemplatedType as E, removeAliasReference as F, sortItemsForInlineSynthesis as I, typeClassForCstType as L, isTemplateCst as M, normalizeExpression as N, isBasicConcept as O, refineAnalysisForDependencyCycles as P, validateAliasFormat as R, inferClass as S, inferTemplate as T, generateAlias as _, formatDependencyCycle as a, getStructureName as b, addAliasReference as c, argumentValuesToMapping as d, calculateSchemaStats as f, findCstByStructure as g, canProduceStructure as h, detectDependencyCycleDiagnostics as i, isSchemaIssue as j, isFunctional as k, applyFilterCategory as l, canHaveManualTypification as m, RSDiagnosticCode as n, hasCstDiagnostic as o, canHaveFormalDefinition as p, assignSchemaDiagnostics as r, modelStatusCstDiagnostic as s, DiagnosticKind as t, applyMappingToConstituents as u, getAnalysisFor as v, inferStatus as w, guessCstType as x, getCstTypePrefix as y, validateNewAlias as z };
 
-//# sourceMappingURL=diagnostics-BSryP66e.js.map
+//# sourceMappingURL=diagnostics-CY9sKggB.js.map

package/dist/diagnostics-CY9sKggB.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"diagnostics-CY9sKggB.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 Graph } from '../graph';\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  extractGlobals,\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 { formatDependencyCycle, 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\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  const analysis = schema.analyzer.checkFull(expression, {\n    expected: typeClassForCstType(cstType),\n    isDomain: cstType === CstType.STRUCTURED\n  });\n  return refineAnalysisForDependencyCycles(analysis, expression, schema, alias);\n}\n\n/**\n * When an untyped / bare F·P reference names a constituent on a definition cycle with the\n * current expression, replace that error with {@link RSDiagnosticCode.schemaDependencyCycle}.\n *\n * Covers both semantic `globalNotTyped` (e.g. `F3[σ]`) and parser `globalFuncWithoutArgs`\n * (bare `P1` / `F1` treated as a call without arguments).\n *\n * Uses a draft dependency graph: incoming edges of the edited constituent are taken from\n * `expression`, so Check works before Save.\n */\nexport function refineAnalysisForDependencyCycles(\n  analysis: AnalysisFull,\n  expression: string,\n  schema: RSForm,\n  alias?: string\n): AnalysisFull {\n  if (analysis.errors.length === 0 || !schema.graph) {\n    return analysis;\n  }\n\n  const currentId = alias ? schema.cstByAlias.get(alias)?.id : undefined;\n  const expressionGlobals = extractGlobals(expression);\n  const draftGraph =\n    currentId !== undefined ? buildDraftDependencyGraph(schema, currentId, expressionGlobals) : schema.graph;\n\n  let changed = false;\n  const errors = analysis.errors.map(error => {\n    if (error.code !== RSErrorCode.globalNotTyped && error.code !== RSErrorCode.globalFuncWithoutArgs) {\n      return error;\n    }\n    const missingAlias = error.params?.[0];\n    if (!missingAlias) {\n      return error;\n    }\n    const missing = schema.cstByAlias.get(missingAlias);\n    if (!missing) {\n      return error;\n    }\n    const cycleText = resolveDependencyCycleText(schema, draftGraph, currentId, missing.id);\n    if (!cycleText) {\n      return error;\n    }\n    changed = true;\n    return {\n      ...error,\n      code: RSErrorCode.schemaDependencyCycle,\n      params: [cycleText]\n    };\n  });\n  return changed ? { ...analysis, errors } : analysis;\n}\n\n/**\n * Clone the schema graph and replace dependencies of `currentId` with globals from the\n * expression under check (unsaved draft).\n */\nfunction buildDraftDependencyGraph(schema: RSForm, currentId: number, expressionGlobals: ReadonlySet<string>): Graph {\n  const graph = schema.graph.clone();\n  const node = graph.at(currentId);\n  if (node) {\n    for (const parentId of [...node.inputs]) {\n      graph.removeEdge(parentId, currentId);\n    }\n  } else {\n    graph.addNode(currentId);\n  }\n  for (const globalAlias of expressionGlobals) {\n    const source = schema.cstByAlias.get(globalAlias);\n    if (source) {\n      graph.addEdge(source.id, currentId);\n    }\n  }\n  return graph;\n}\n\n/**\n * Resolve formatted cycle text for an untyped global reference in analysis.\n *\n * Uses `graph` (often a draft graph built from the expression under check). When\n * `currentId` is omitted, falls back to schema diagnostics on `missingId`.\n *\n * @returns Closed alias path such as `F3 → P1 → F3`, or `null` when no shared cycle exists.\n */\nfunction resolveDependencyCycleText(\n  schema: RSForm,\n  graph: Graph,\n  currentId: number | undefined,\n  missingId: number\n): string | null {\n  for (const cycle of graph.findCycles()) {\n    const members = new Set(cycle);\n    if (!members.has(missingId)) {\n      continue;\n    }\n    if (currentId !== undefined && !members.has(currentId)) {\n      continue;\n    }\n    return formatDependencyCycle(cycle.map(id => schema.cstByID.get(id)?.alias ?? String(id)));\n  }\n\n  if (currentId === undefined) {\n    const cycleDiag = schema.cstByID\n      .get(missingId)\n      ?.diagnostics.find(item => item.code === RSDiagnosticCode.schemaDependencyCycle);\n    return cycleDiag?.params?.[0] ?? null;\n  }\n\n  return null;\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_path) {\n      continue;\n    }\n    const absolutePath = resolveAbsoluteSpawnerPath(schema, cst, target.id);\n    if (absolutePath?.length === path.length && absolutePath.every((v, i) => v === path[i])) {\n      return cst;\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\nfunction resolveAbsoluteSpawnerPath(schema: RSForm, cst: Constituenta, targetId: number): TypePath | null {\n  if (!cst.spawner_path || cst.spawner == null) {\n    return null;\n  }\n  if (cst.spawner === targetId) {\n    return cst.spawner_path;\n  }\n\n  const byId = schema.cstByID ?? new Map(schema.items.map(item => [item.id, item]));\n  const visited = new Set<number>([cst.id]);\n  let currentPath: number[] = [...cst.spawner_path];\n  let currentSpawnerId: number | null = cst.spawner;\n\n  while (currentSpawnerId != null) {\n    if (currentSpawnerId === targetId) {\n      return currentPath as TypePath;\n    }\n    if (visited.has(currentSpawnerId)) {\n      return null;\n    }\n    visited.add(currentSpawnerId);\n\n    const parent = byId.get(currentSpawnerId);\n    if (!parent?.spawner_path || parent.spawner == null) {\n      return null;\n    }\n\n    currentPath = [...parent.spawner_path, ...currentPath];\n    currentSpawnerId = parent.spawner;\n  }\n\n  return null;\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 { type Graph } from '../graph';\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  schemaDependencyCycle: 0x8906,\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, cycles).\n *\n * Requires normalized formal definitions for duplicate detection (same as Portal loader).\n * When `graph` is provided, dependency cycles are reported as {@link RSDiagnosticCode.schemaDependencyCycle}.\n */\nexport function assignSchemaDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string,\n  normalizedDefinitions: ReadonlyMap<number, string>,\n  graph?: Graph\n): void {\n  const homonymById = detectHomonymDiagnostics(items, resolveAlias);\n  const duplicateById = detectFormalDuplicateDiagnostics(items, resolveAlias, normalizedDefinitions);\n  const cycleById = graph ? detectDependencyCycleDiagnostics(graph, resolveAlias) : new Map<number, CstDiagnostic>();\n\n  for (const cst of items) {\n    const diagnostics: CstDiagnostic[] = [];\n    const cycle = cycleById.get(cst.id);\n    if (cycle) {\n      diagnostics.push(cycle);\n    }\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/**\n * Format a closed dependency cycle as `A → B → A`.\n *\n * Rotates the path to start at the lexicographically smallest alias so the same\n * cycle always renders identically regardless of graph traversal order.\n *\n * @param aliases Closed or open alias path from {@link Graph.findCycles}.\n * @returns Human-readable cycle text joined with ` → `.\n */\nexport function formatDependencyCycle(aliases: readonly string[]): string {\n  if (aliases.length < 2) {\n    return aliases.join(' → ');\n  }\n\n  const closed = aliases[0] === aliases[aliases.length - 1];\n  const open = closed ? aliases.slice(0, -1) : [...aliases];\n  if (open.length === 0) {\n    return aliases.join(' → ');\n  }\n\n  let bestStart = 0;\n  for (let index = 1; index < open.length; index++) {\n    const alias = open[index];\n    const bestAlias = open[bestStart];\n    if (alias !== undefined && bestAlias !== undefined && alias < bestAlias) {\n      bestStart = index;\n    }\n  }\n  const rotated = [...open.slice(bestStart), ...open.slice(0, bestStart)];\n  if (closed) {\n    const first = rotated[0];\n    if (first !== undefined) {\n      rotated.push(first);\n    }\n  }\n  return rotated.join(' → ');\n}\n\n/**\n * Map each node id that participates in a dependency cycle to a schema diagnostic.\n *\n * `params[0]` is the closed cycle path (`F3 → P1 → F3`).\n *\n * @param graph Constituent dependency graph (provider → dependent edges).\n * @param resolveAlias Maps node id to display alias for cycle formatting.\n * @returns One {@link CstDiagnostic} per node on each cyclic SCC.\n */\nexport function detectDependencyCycleDiagnostics(\n  graph: Graph,\n  resolveAlias: (id: number) => string\n): Map<number, CstDiagnostic> {\n  const result = new Map<number, CstDiagnostic>();\n  for (const cycle of graph.findCycles()) {\n    if (cycle.length < 2) {\n      continue;\n    }\n    const aliases = cycle.map(id => resolveAlias(id));\n    const cycleText = formatDependencyCycle(aliases);\n    const memberIds = new Set(cycle);\n    for (const id of memberIds) {\n      result.set(id, {\n        kind: DiagnosticKind.SCHEMA,\n        code: RSDiagnosticCode.schemaDependencyCycle,\n        params: [cycleText]\n      });\n    }\n  }\n  return result;\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 detectGroupedAliasDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string,\n  groupKey: (cst: Constituenta) => string | undefined,\n  code: RSDiagnosticCode\n): Map<number, CstDiagnostic> {\n  const groups = new Map<string, Constituenta[]>();\n  for (const cst of items) {\n    const key = groupKey(cst);\n    if (!key) {\n      continue;\n    }\n    const group = groups.get(key) ?? [];\n    group.push(cst);\n    groups.set(key, group);\n  }\n\n  const result = new Map<number, CstDiagnostic>();\n  for (const group of groups.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,\n        params: [aliases]\n      });\n    }\n  }\n  return result;\n}\n\nfunction detectHomonymDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string\n): Map<number, CstDiagnostic> {\n  return detectGroupedAliasDiagnostics(\n    items,\n    resolveAlias,\n    cst => {\n      const key = cst.term_resolved.trim().toLocaleLowerCase();\n      return key === '' ? undefined : key;\n    },\n    RSDiagnosticCode.schemaHomonym\n  );\n}\n\nfunction detectFormalDuplicateDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string,\n  normalizedDefinitions: ReadonlyMap<number, string>\n): Map<number, CstDiagnostic> {\n  return detectGroupedAliasDiagnostics(\n    items,\n    resolveAlias,\n    cst => normalizedDefinitions.get(cst.id),\n    RSDiagnosticCode.schemaFormalDuplicate\n  );\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":";;;;;;;;;;;;;;;;AAwCA,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;AAEA,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;CAKA,OAAO,kCAJU,OAAO,SAAS,UAAU,YAAY;EACrD,UAAU,oBAAoB,OAAO;EACrC,UAAU,YAAY,QAAQ;CAChC,CACyC,GAAU,YAAY,QAAQ,KAAK;AAC9E;;;;;;;;;;;AAYA,SAAgB,kCACd,UACA,YACA,QACA,OACc;CACd,IAAI,SAAS,OAAO,WAAW,KAAK,CAAC,OAAO,OAC1C,OAAO;CAGT,MAAM,YAAY,QAAQ,OAAO,WAAW,IAAI,KAAK,CAAC,EAAE,KAAK;CAC7D,MAAM,oBAAoB,eAAe,UAAU;CACnD,MAAM,aACJ,cAAc,SAAY,0BAA0B,QAAQ,WAAW,iBAAiB,IAAI,OAAO;CAErG,IAAI,UAAU;CACd,MAAM,SAAS,SAAS,OAAO,KAAI,UAAS;EAC1C,IAAI,MAAM,SAAS,YAAY,kBAAkB,MAAM,SAAS,YAAY,uBAC1E,OAAO;EAET,MAAM,eAAe,MAAM,SAAS;EACpC,IAAI,CAAC,cACH,OAAO;EAET,MAAM,UAAU,OAAO,WAAW,IAAI,YAAY;EAClD,IAAI,CAAC,SACH,OAAO;EAET,MAAM,YAAY,2BAA2B,QAAQ,YAAY,WAAW,QAAQ,EAAE;EACtF,IAAI,CAAC,WACH,OAAO;EAET,UAAU;EACV,OAAO;GACL,GAAG;GACH,MAAM,YAAY;GAClB,QAAQ,CAAC,SAAS;EACpB;CACF,CAAC;CACD,OAAO,UAAU;EAAE,GAAG;EAAU;CAAO,IAAI;AAC7C;;;;;AAMA,SAAS,0BAA0B,QAAgB,WAAmB,mBAA+C;CACnH,MAAM,QAAQ,OAAO,MAAM,MAAM;CACjC,MAAM,OAAO,MAAM,GAAG,SAAS;CAC/B,IAAI,MACF,KAAK,MAAM,YAAY,CAAC,GAAG,KAAK,MAAM,GACpC,MAAM,WAAW,UAAU,SAAS;MAGtC,MAAM,QAAQ,SAAS;CAEzB,KAAK,MAAM,eAAe,mBAAmB;EAC3C,MAAM,SAAS,OAAO,WAAW,IAAI,WAAW;EAChD,IAAI,QACF,MAAM,QAAQ,OAAO,IAAI,SAAS;CAEtC;CACA,OAAO;AACT;;;;;;;;;AAUA,SAAS,2BACP,QACA,OACA,WACA,WACe;CACf,KAAK,MAAM,SAAS,MAAM,WAAW,GAAG;EACtC,MAAM,UAAU,IAAI,IAAI,KAAK;EAC7B,IAAI,CAAC,QAAQ,IAAI,SAAS,GACxB;EAEF,IAAI,cAAc,UAAa,CAAC,QAAQ,IAAI,SAAS,GACnD;EAEF,OAAO,sBAAsB,MAAM,KAAI,OAAM,OAAO,QAAQ,IAAI,EAAE,CAAC,EAAE,SAAS,OAAO,EAAE,CAAC,CAAC;CAC3F;CAEA,IAAI,cAAc,QAIhB,QAHkB,OAAO,QACtB,IAAI,SAAS,CAAC,EACb,YAAY,MAAK,SAAQ,KAAK,SAAS,iBAAiB,qBAAqB,EAC1E,EAAW,SAAS,MAAM;CAGnC,OAAO;AACT;;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,OAAO;EAC9B,IAAI,CAAC,IAAI,cACP;EAEF,MAAM,eAAe,2BAA2B,QAAQ,KAAK,OAAO,EAAE;EACtE,IAAI,cAAc,WAAW,KAAK,UAAU,aAAa,OAAO,GAAG,MAAM,MAAM,KAAK,EAAE,GACpF,OAAO;CAEX;CACA,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;AAEA,SAAS,2BAA2B,QAAgB,KAAmB,UAAmC;CACxG,IAAI,CAAC,IAAI,gBAAgB,IAAI,WAAW,MACtC,OAAO;CAET,IAAI,IAAI,YAAY,UAClB,OAAO,IAAI;CAGb,MAAM,OAAO,OAAO,WAAW,IAAI,IAAI,OAAO,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CAChF,MAAM,0BAAU,IAAI,IAAY,CAAC,IAAI,EAAE,CAAC;CACxC,IAAI,cAAwB,CAAC,GAAG,IAAI,YAAY;CAChD,IAAI,mBAAkC,IAAI;CAE1C,OAAO,oBAAoB,MAAM;EAC/B,IAAI,qBAAqB,UACvB,OAAO;EAET,IAAI,QAAQ,IAAI,gBAAgB,GAC9B,OAAO;EAET,QAAQ,IAAI,gBAAgB;EAE5B,MAAM,SAAS,KAAK,IAAI,gBAAgB;EACxC,IAAI,CAAC,QAAQ,gBAAgB,OAAO,WAAW,MAC7C,OAAO;EAGT,cAAc,CAAC,GAAG,OAAO,cAAc,GAAG,WAAW;EACrD,mBAAmB,OAAO;CAC5B;CAEA,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;;;;ACtuBA,MAAa,iBAAiB;CAC5B,YAAY;CACZ,QAAQ;CACR,OAAO;AACT;;AAIA,MAAa,mBAAmB;CAC9B,eAAe;CACf,uBAAuB;CACvB,yBAAyB;CACzB,mBAAmB;CACnB,oBAAoB;CACpB,uBAAuB;CAEvB,YAAY;CACZ,iBAAiB;CACjB,kBAAkB;CAClB,eAAe;AACjB;;AAYA,SAAgB,iBAAiB,KAAmB,MAAiC;CACnF,OAAO,IAAI,aAAa,MAAK,SAAQ,KAAK,SAAS,IAAI,KAAK;AAC9D;;;;;;;AAQA,SAAgB,wBACd,OACA,cACA,uBACA,OACM;CACN,MAAM,cAAc,yBAAyB,OAAO,YAAY;CAChE,MAAM,gBAAgB,iCAAiC,OAAO,cAAc,qBAAqB;CACjG,MAAM,YAAY,QAAQ,iCAAiC,OAAO,YAAY,oBAAI,IAAI,IAA2B;CAEjH,KAAK,MAAM,OAAO,OAAO;EACvB,MAAM,cAA+B,CAAC;EACtC,MAAM,QAAQ,UAAU,IAAI,IAAI,EAAE;EAClC,IAAI,OACF,YAAY,KAAK,KAAK;EAExB,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;;;;;;;;;;AAWA,SAAgB,sBAAsB,SAAoC;CACxE,IAAI,QAAQ,SAAS,GACnB,OAAO,QAAQ,KAAK,KAAK;CAG3B,MAAM,SAAS,QAAQ,OAAO,QAAQ,QAAQ,SAAS;CACvD,MAAM,OAAO,SAAS,QAAQ,MAAM,GAAG,EAAE,IAAI,CAAC,GAAG,OAAO;CACxD,IAAI,KAAK,WAAW,GAClB,OAAO,QAAQ,KAAK,KAAK;CAG3B,IAAI,YAAY;CAChB,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS;EAChD,MAAM,QAAQ,KAAK;EACnB,MAAM,YAAY,KAAK;EACvB,IAAI,UAAU,UAAa,cAAc,UAAa,QAAQ,WAC5D,YAAY;CAEhB;CACA,MAAM,UAAU,CAAC,GAAG,KAAK,MAAM,SAAS,GAAG,GAAG,KAAK,MAAM,GAAG,SAAS,CAAC;CACtE,IAAI,QAAQ;EACV,MAAM,QAAQ,QAAQ;EACtB,IAAI,UAAU,QACZ,QAAQ,KAAK,KAAK;CAEtB;CACA,OAAO,QAAQ,KAAK,KAAK;AAC3B;;;;;;;;;;AAWA,SAAgB,iCACd,OACA,cAC4B;CAC5B,MAAM,yBAAS,IAAI,IAA2B;CAC9C,KAAK,MAAM,SAAS,MAAM,WAAW,GAAG;EACtC,IAAI,MAAM,SAAS,GACjB;EAGF,MAAM,YAAY,sBADF,MAAM,KAAI,OAAM,aAAa,EAAE,CACP,CAAO;EAC/C,MAAM,YAAY,IAAI,IAAI,KAAK;EAC/B,KAAK,MAAM,MAAM,WACf,OAAO,IAAI,IAAI;GACb,MAAM,eAAe;GACrB,MAAM,iBAAiB;GACvB,QAAQ,CAAC,SAAS;EACpB,CAAC;CAEL;CACA,OAAO;AACT;;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,8BACP,OACA,cACA,UACA,MAC4B;CAC5B,MAAM,yBAAS,IAAI,IAA4B;CAC/C,KAAK,MAAM,OAAO,OAAO;EACvB,MAAM,MAAM,SAAS,GAAG;EACxB,IAAI,CAAC,KACH;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;IACA,QAAQ,CAAC,OAAO;GAClB,CAAC;EACH;CACF;CACA,OAAO;AACT;AAEA,SAAS,yBACP,OACA,cAC4B;CAC5B,OAAO,8BACL,OACA,eACA,QAAO;EACL,MAAM,MAAM,IAAI,cAAc,KAAK,CAAC,CAAC,kBAAkB;EACvD,OAAO,QAAQ,KAAK,SAAY;CAClC,GACA,iBAAiB,aACnB;AACF;AAEA,SAAS,iCACP,OACA,cACA,uBAC4B;CAC5B,OAAO,8BACL,OACA,eACA,QAAO,sBAAsB,IAAI,IAAI,EAAE,GACvC,iBAAiB,qBACnB;AACF;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"}

package/dist/{diagnostics-Dtzgj5Q9.d.ts → diagnostics-EaIt3zIw.d.ts}

@@ -1,7 +1,7 @@
-import { t as Graph } from "./graph-DPOvglEm.js";
+import { t as Graph } from "./graph-CL73WdW1.js";
 import { f as ExpressionType, y as TypePath } from "./typification-9lNu9R4k.js";
 import { l as Value } from "./value-BduA_ZGp.js";
-import { a as RSLangAnalyzer, t as AnalysisBase } from "./analyzer-iqAXyROE.js";
+import { a as RSLangAnalyzer, t as AnalysisBase } from "./analyzer-fNhkwO-6.js";
 import { i as LibraryItemReference, n as CurrentVersion, r as LibraryItem, s as VersionInfo } from "./library-CYun28Xz.js";
 
 //#region src/library/rsform.d.ts
@@ -274,15 +274,28 @@ declare function hasCstDiagnostic(cst: Constituenta, code: RSDiagnosticCode): bo
  * When `graph` is provided, dependency cycles are reported as {@link RSDiagnosticCode.schemaDependencyCycle}.
  */
 declare function assignSchemaDiagnostics(items: Constituenta[], resolveAlias: (id: number) => string, normalizedDefinitions: ReadonlyMap<number, string>, graph?: Graph): void;
-/** Format a closed cycle of aliases as `A → B → A`. */
+/**
+ * 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 ` → `.
+ */
 declare function formatDependencyCycle(aliases: readonly string[]): string;
 /**
  * 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.
  */
 declare function detectDependencyCycleDiagnostics(graph: Graph, resolveAlias: (id: number) => string): Map<number, CstDiagnostic>;
 /** Map a model evaluation status to a compact diagnostic, or `null` when not an issue. */
 declare function modelStatusCstDiagnostic(status: EvalStatus, cstType: CstType): CstDiagnostic | null;
 //#endregion
 export { RSFormStats as C, RSForm as S, TypeInfo as T, Attribution as _, detectDependencyCycleDiagnostics as a, CstStatus as b, modelStatusCstDiagnostic as c, DEFAULT_VALUE_TEXT as d, EvalStatus as f, ArgumentValue as g, TYPE_BASIC as h, assignSchemaDiagnostics as i, BasicBinding as l, RSModelStats as m, DiagnosticKind as n, formatDependencyCycle as o, RSModel as p, RSDiagnosticCode as r, hasCstDiagnostic as s, CstDiagnostic as t, BasicsContext as u, Constituenta as v, Substitution as w, CstType as x, CstClass as y };
-//# sourceMappingURL=diagnostics-Dtzgj5Q9.d.ts.map
+//# sourceMappingURL=diagnostics-EaIt3zIw.d.ts.map

package/dist/{error-CzIbnP-N.d.ts → error-B0EkIx4K.d.ts}

@@ -98,6 +98,7 @@ declare const RSErrorCode: {
   readonly calcInvalidData: 33032;
   readonly cstEmptyDerived: 34913;
   readonly definitionNotAllowed: 34914;
+  readonly schemaDependencyCycle: 35078;
 };
 type RSErrorCode = (typeof RSErrorCode)[keyof typeof RSErrorCode];
 /** Generate ErrorID label. */
@@ -106,4 +107,4 @@ declare function getRSErrorPrefix(code: RSErrorCode): string;
 declare function isCritical(code: RSErrorCode): boolean;
 //#endregion
 export { RSErrorInfo as a, RSErrorDescription as i, RSErrorClass as n, getRSErrorPrefix as o, RSErrorCode as r, isCritical as s, ErrorReporter as t };
-//# sourceMappingURL=error-CzIbnP-N.d.ts.map
+//# sourceMappingURL=error-B0EkIx4K.d.ts.map

package/dist/graph/graph.d.ts

@@ -1,2 +1,2 @@
-import { n as GraphNode, t as Graph } from "../graph-DPOvglEm.js";
+import { n as GraphNode, t as Graph } from "../graph-CL73WdW1.js";
 export { Graph, GraphNode };

package/dist/graph/graph.js

@@ -362,7 +362,12 @@ var Graph = class Graph {
 		}
 		return result;
 	}
-	/** Tarjan strongly connected components (non-recursive). */
+	/**
+	* Tarjan strongly connected components (iterative).
+	*
+	* @returns Node-id arrays; multi-node components are cyclic SCCs, single-node
+	*   components are acyclic unless the node has a self-loop.
+	*/
 	stronglyConnectedComponents() {
 		let index = 0;
 		const indices = /* @__PURE__ */ new Map();

package/dist/graph/graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph.js","names":[],"sources":["../../src/graph/graph.ts"],"sourcesContent":["/**\n * Module: Custom graph data structure.\n */\n\n/** Represents single node of a {@link Graph}, as implemented by storing outgoing and incoming connections. */\nexport class GraphNode<NodeID> {\n  /** Unique identifier of the node. */\n  id: NodeID;\n  /** List of outgoing nodes. */\n  outputs: NodeID[];\n  /** List of incoming nodes. */\n  inputs: NodeID[];\n\n  constructor(id: NodeID) {\n    this.id = id;\n    this.outputs = [];\n    this.inputs = [];\n  }\n\n  clone(): GraphNode<NodeID> {\n    const result = new GraphNode(this.id);\n    result.outputs = [...this.outputs];\n    result.inputs = [...this.inputs];\n    return result;\n  }\n\n  addOutput(node: NodeID): void {\n    this.outputs.push(node);\n  }\n\n  addInput(node: NodeID): void {\n    this.inputs.push(node);\n  }\n\n  removeInput(target: NodeID): NodeID | null {\n    const index = this.inputs.findIndex(node => node === target);\n    return index > -1 ? this.inputs.splice(index, 1)[0] : null;\n  }\n\n  removeOutput(target: NodeID): NodeID | null {\n    const index = this.outputs.findIndex(node => node === target);\n    return index > -1 ? this.outputs.splice(index, 1)[0] : null;\n  }\n}\n\n/**\n * Represents a Graph.\n *\n * This class is optimized for TermGraph use case and not supposed to be used as generic graph implementation.\n */\nexport class Graph<NodeID = number> {\n  /** Map of nodes. */\n  nodes = new Map<NodeID, GraphNode<NodeID>>();\n\n  constructor(arr?: NodeID[][]) {\n    if (!arr) {\n      return;\n    }\n    arr.forEach(edge => {\n      if (edge.length === 1) {\n        this.addNode(edge[0]);\n      } else {\n        this.addEdge(edge[0], edge[1]);\n      }\n    });\n  }\n\n  clone(): Graph<NodeID> {\n    const result = new Graph<NodeID>();\n    this.nodes.forEach(node => result.nodes.set(node.id, node.clone()));\n    return result;\n  }\n\n  at(target: NodeID): GraphNode<NodeID> | undefined {\n    return this.nodes.get(target);\n  }\n\n  addNode(target: NodeID): GraphNode<NodeID> {\n    let node = this.nodes.get(target);\n    if (!node) {\n      node = new GraphNode(target);\n      this.nodes.set(target, node);\n    }\n    return node;\n  }\n\n  hasNode(target: NodeID): boolean {\n    return !!this.nodes.get(target);\n  }\n\n  removeNode(target: NodeID): void {\n    this.nodes.forEach(node => {\n      node.removeInput(target);\n      node.removeOutput(target);\n    });\n    this.nodes.delete(target);\n  }\n\n  foldNode(target: NodeID): void {\n    const nodeToRemove = this.nodes.get(target);\n    if (!nodeToRemove) {\n      return;\n    }\n    nodeToRemove.inputs.forEach(input => {\n      nodeToRemove.outputs.forEach(output => {\n        this.addEdge(input, output);\n      });\n    });\n    this.removeNode(target);\n  }\n\n  removeIsolated(): GraphNode<NodeID>[] {\n    const result: GraphNode<NodeID>[] = [];\n    this.nodes.forEach(node => {\n      if (node.outputs.length === 0 && node.inputs.length === 0) {\n        result.push(node);\n        this.nodes.delete(node.id);\n      }\n    });\n    return result;\n  }\n\n  addEdge(source: NodeID, destination: NodeID): void {\n    if (this.hasEdge(source, destination)) {\n      return;\n    }\n    const sourceNode = this.addNode(source);\n    const destinationNode = this.addNode(destination);\n    sourceNode.addOutput(destinationNode.id);\n    destinationNode.addInput(sourceNode.id);\n  }\n\n  removeEdge(source: NodeID, destination: NodeID): void {\n    const sourceNode = this.nodes.get(source);\n    const destinationNode = this.nodes.get(destination);\n    if (sourceNode && destinationNode) {\n      sourceNode.removeOutput(destination);\n      destinationNode.removeInput(source);\n    }\n  }\n\n  hasEdge(source: NodeID, destination: NodeID): boolean {\n    const sourceNode = this.nodes.get(source);\n    if (!sourceNode) {\n      return false;\n    }\n    return !!sourceNode.outputs.find(id => id === destination);\n  }\n\n  isReachable(source: NodeID, destination: NodeID): boolean {\n    return this.expandAllOutputs([source]).includes(destination);\n  }\n\n  rootNodes(): NodeID[] {\n    return [...this.nodes.keys()].filter(id => !this.nodes.get(id)?.inputs.length);\n  }\n\n  expandOutputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = [];\n    origin.forEach(id => {\n      const node = this.nodes.get(id);\n      if (node) {\n        node.outputs.forEach(child => {\n          if (!origin.includes(child) && !result.includes(child)) {\n            result.push(child);\n          }\n        });\n      }\n    });\n    return result;\n  }\n\n  expandInputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = [];\n    origin.forEach(id => {\n      const node = this.nodes.get(id);\n      if (node) {\n        node.inputs.forEach(child => {\n          if (!origin.includes(child) && !result.includes(child)) {\n            result.push(child);\n          }\n        });\n      }\n    });\n    return result;\n  }\n\n  expandAllOutputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = this.expandOutputs(origin);\n    if (result.length === 0) {\n      return [];\n    }\n\n    const marked = new Map<NodeID, boolean>();\n    origin.forEach(id => marked.set(id, true));\n    let position = 0;\n    while (position < result.length) {\n      const node = this.nodes.get(result[position]);\n      if (node && !marked.get(node.id)) {\n        marked.set(node.id, true);\n        node.outputs.forEach(child => {\n          if (!marked.get(child) && !result.find(id => id === child)) {\n            result.push(child);\n          }\n        });\n      }\n      position += 1;\n    }\n    return result;\n  }\n\n  expandAllInputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = this.expandInputs(origin);\n    if (result.length === 0) {\n      return [];\n    }\n\n    const marked = new Map<NodeID, boolean>();\n    origin.forEach(id => marked.set(id, true));\n    let position = 0;\n    while (position < result.length) {\n      const node = this.nodes.get(result[position]);\n      if (node && !marked.get(node.id)) {\n        marked.set(node.id, true);\n        node.inputs.forEach(child => {\n          if (!marked.get(child) && !result.find(id => id === child)) {\n            result.push(child);\n          }\n        });\n      }\n      position += 1;\n    }\n    return result;\n  }\n\n  maximizePart(origin: NodeID[]): NodeID[] {\n    const outputs: NodeID[] = this.expandAllOutputs(origin);\n    const result = [...origin];\n    this.topologicalOrder()\n      .filter(id => outputs.includes(id))\n      .forEach(id => {\n        const node = this.nodes.get(id);\n        if (node?.inputs.every(parent => result.includes(parent))) {\n          result.push(id);\n        }\n      });\n    return result;\n  }\n\n  topologicalOrder(): NodeID[] {\n    const result: NodeID[] = [];\n    const marked = new Set<NodeID>();\n    const nodeStack: NodeID[] = [];\n    this.nodes.forEach(node => {\n      if (marked.has(node.id)) {\n        return;\n      }\n      nodeStack.push(node.id);\n      while (nodeStack.length > 0) {\n        const item = nodeStack[nodeStack.length - 1];\n        if (marked.has(item)) {\n          if (!result.find(id => id === item)) {\n            result.push(item);\n          }\n          nodeStack.pop();\n        } else {\n          marked.add(item);\n          const itemNode = this.nodes.get(item);\n          if (itemNode && itemNode.outputs.length > 0) {\n            itemNode.outputs.forEach(child => {\n              if (!marked.has(child)) {\n                nodeStack.push(child);\n              }\n            });\n          }\n        }\n      }\n    });\n    return result.reverse();\n  }\n\n  /**\n   * Stably reorders the given node ids so that, for this DAG, no node appears before a transitive\n   * successor (edges: source → dependent; {@link GraphNode.outputs} lists dependents).\n   */\n  sortStable(target: NodeID[]): NodeID[] {\n    if (target.length <= 1) {\n      return [...target];\n    }\n\n    const reachable = this.buildTransitiveClosureForSort();\n    const testSet = new Set<NodeID>();\n    const result: NodeID[] = [];\n\n    for (const nodeId of [...target].reverse()) {\n      const nodeReachable = reachable.get(nodeId) ?? new Set<NodeID>();\n      const needMove = testSet.has(nodeId);\n      for (const childId of nodeReachable) {\n        testSet.add(childId);\n      }\n\n      if (!needMove) {\n        result.push(nodeId);\n        continue;\n      }\n\n      let inserted = false;\n      for (let index = 0; index < result.length; index++) {\n        const parent = result[index];\n        const parentReachable = reachable.get(parent) ?? new Set<NodeID>();\n        if (nodeReachable.has(parent)) {\n          if (parentReachable.has(nodeId)) {\n            result.push(nodeId);\n          } else {\n            result.splice(index, 0, nodeId);\n          }\n          inserted = true;\n          break;\n        }\n      }\n      if (!inserted) {\n        result.push(nodeId);\n      }\n    }\n\n    result.reverse();\n    return result;\n  }\n\n  private buildTransitiveClosureForSort(): Map<NodeID, Set<NodeID>> {\n    const closure = new Map<NodeID, Set<NodeID>>();\n    for (const node of this.nodes.values()) {\n      closure.set(node.id, new Set(node.outputs));\n    }\n\n    const order = this.topologicalOrder();\n    for (const nodeId of [...order].reverse()) {\n      const node = this.at(nodeId);\n      if (!node) {\n        continue;\n      }\n      const nodeClosure = closure.get(nodeId) ?? new Set<NodeID>();\n      for (const parentId of node.inputs) {\n        const parentClosure = closure.get(parentId) ?? new Set<NodeID>();\n        for (const childId of nodeClosure) {\n          parentClosure.add(childId);\n        }\n        closure.set(parentId, parentClosure);\n      }\n    }\n\n    return closure;\n  }\n\n  transitiveReduction() {\n    const order = this.topologicalOrder();\n    const marked = new Map<NodeID, boolean>();\n    order.forEach(nodeID => {\n      if (marked.get(nodeID)) {\n        return;\n      }\n      const stack: { id: NodeID; parents: NodeID[] }[] = [];\n      stack.push({ id: nodeID, parents: [] });\n      while (stack.length > 0) {\n        const item = stack.splice(0, 1)[0];\n        const node = this.nodes.get(item.id);\n        if (node) {\n          node.outputs.forEach(child => {\n            item.parents.forEach(parent => this.removeEdge(parent, child));\n            stack.push({ id: child, parents: [item.id, ...item.parents] });\n          });\n        }\n        marked.set(item.id, true);\n      }\n    });\n  }\n\n  /**\n   * Finds a cycle in the graph.\n   *\n   * @returns {NodeID[] | null} The cycle if found, otherwise `null`.\n   * Uses non-recursive DFS. The returned path is closed (first id equals last).\n   */\n  findCycle(): NodeID[] | null {\n    const visited = new Set<NodeID>();\n    const nodeStack = new Set<NodeID>();\n    const parents = new Map<NodeID, NodeID>();\n\n    for (const nodeId of this.nodes.keys()) {\n      if (visited.has(nodeId)) {\n        continue;\n      }\n\n      const callStack: { nodeId: NodeID; parentId: NodeID | null }[] = [];\n      callStack.push({ nodeId: nodeId, parentId: null });\n      while (callStack.length > 0) {\n        const { nodeId, parentId } = callStack[callStack.length - 1];\n        if (visited.has(nodeId)) {\n          nodeStack.delete(nodeId);\n          callStack.pop();\n          continue;\n        }\n        visited.add(nodeId);\n        nodeStack.add(nodeId);\n        if (parentId !== null) {\n          parents.set(nodeId, parentId);\n        }\n\n        const currentNode = this.nodes.get(nodeId)!;\n        for (const child of currentNode.outputs) {\n          if (!visited.has(child)) {\n            callStack.push({ nodeId: child, parentId: nodeId });\n            continue;\n          }\n          if (!nodeStack.has(child)) {\n            continue;\n          }\n          const cycle: NodeID[] = [];\n          let current = nodeId;\n          cycle.push(child);\n          while (current !== child) {\n            cycle.push(current);\n            current = parents.get(current)!;\n          }\n          cycle.push(child);\n          cycle.reverse();\n          return cycle;\n        }\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Finds one closed cycle path per cyclic strongly connected component.\n   *\n   * @returns Closed paths (first id equals last). Empty when the graph is acyclic.\n   */\n  findCycles(): NodeID[][] {\n    const components = this.stronglyConnectedComponents();\n    const result: NodeID[][] = [];\n    for (const component of components) {\n      if (component.length === 1) {\n        const id = component[0];\n        if (this.hasEdge(id, id)) {\n          result.push([id, id]);\n        }\n        continue;\n      }\n      const subgraph = new Graph<NodeID>();\n      const memberIds = new Set(component);\n      for (const id of component) {\n        subgraph.addNode(id);\n        const node = this.nodes.get(id);\n        if (!node) {\n          continue;\n        }\n        for (const child of node.outputs) {\n          if (memberIds.has(child)) {\n            subgraph.addEdge(id, child);\n          }\n        }\n      }\n      const cycle = subgraph.findCycle();\n      if (cycle) {\n        result.push(cycle);\n      }\n    }\n    return result;\n  }\n\n  /** Tarjan strongly connected components (non-recursive). */\n  stronglyConnectedComponents(): NodeID[][] {\n    let index = 0;\n    const indices = new Map<NodeID, number>();\n    const lowlink = new Map<NodeID, number>();\n    const onStack = new Set<NodeID>();\n    const stack: NodeID[] = [];\n    const components: NodeID[][] = [];\n\n    type Frame = { nodeId: NodeID; edgeIndex: number; entered: boolean };\n    for (const startId of this.nodes.keys()) {\n      if (indices.has(startId)) {\n        continue;\n      }\n      const callStack: Frame[] = [{ nodeId: startId, edgeIndex: 0, entered: false }];\n      while (callStack.length > 0) {\n        const frame = callStack[callStack.length - 1];\n        const node = this.nodes.get(frame.nodeId);\n        if (!node) {\n          callStack.pop();\n          continue;\n        }\n\n        if (!frame.entered) {\n          frame.entered = true;\n          indices.set(frame.nodeId, index);\n          lowlink.set(frame.nodeId, index);\n          index += 1;\n          stack.push(frame.nodeId);\n          onStack.add(frame.nodeId);\n        }\n\n        if (frame.edgeIndex < node.outputs.length) {\n          const child = node.outputs[frame.edgeIndex];\n          frame.edgeIndex += 1;\n          if (!indices.has(child)) {\n            callStack.push({ nodeId: child, edgeIndex: 0, entered: false });\n          } else if (onStack.has(child)) {\n            lowlink.set(frame.nodeId, Math.min(lowlink.get(frame.nodeId)!, indices.get(child)!));\n          }\n          continue;\n        }\n\n        callStack.pop();\n        if (callStack.length > 0) {\n          const parentId = callStack[callStack.length - 1].nodeId;\n          lowlink.set(parentId, Math.min(lowlink.get(parentId)!, lowlink.get(frame.nodeId)!));\n        }\n\n        if (lowlink.get(frame.nodeId) === indices.get(frame.nodeId)) {\n          const component: NodeID[] = [];\n          while (stack.length > 0) {\n            const id = stack.pop()!;\n            onStack.delete(id);\n            component.push(id);\n            if (id === frame.nodeId) {\n              break;\n            }\n          }\n          components.push(component);\n        }\n      }\n    }\n    return components;\n  }\n}\n"],"mappings":";;;;;AAKA,IAAa,YAAb,MAAa,UAAkB;;CAE7B;;CAEA;;CAEA;CAEA,YAAY,IAAY;EACtB,KAAK,KAAK;EACV,KAAK,UAAU,CAAC;EAChB,KAAK,SAAS,CAAC;CACjB;CAEA,QAA2B;EACzB,MAAM,SAAS,IAAI,UAAU,KAAK,EAAE;EACpC,OAAO,UAAU,CAAC,GAAG,KAAK,OAAO;EACjC,OAAO,SAAS,CAAC,GAAG,KAAK,MAAM;EAC/B,OAAO;CACT;CAEA,UAAU,MAAoB;EAC5B,KAAK,QAAQ,KAAK,IAAI;CACxB;CAEA,SAAS,MAAoB;EAC3B,KAAK,OAAO,KAAK,IAAI;CACvB;CAEA,YAAY,QAA+B;EACzC,MAAM,QAAQ,KAAK,OAAO,WAAU,SAAQ,SAAS,MAAM;EAC3D,OAAO,QAAQ,KAAK,KAAK,OAAO,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK;CACxD;CAEA,aAAa,QAA+B;EAC1C,MAAM,QAAQ,KAAK,QAAQ,WAAU,SAAQ,SAAS,MAAM;EAC5D,OAAO,QAAQ,KAAK,KAAK,QAAQ,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK;CACzD;AACF;;;;;;AAOA,IAAa,QAAb,MAAa,MAAuB;;CAElC,wBAAQ,IAAI,IAA+B;CAE3C,YAAY,KAAkB;EAC5B,IAAI,CAAC,KACH;EAEF,IAAI,SAAQ,SAAQ;GAClB,IAAI,KAAK,WAAW,GAClB,KAAK,QAAQ,KAAK,EAAE;QAEpB,KAAK,QAAQ,KAAK,IAAI,KAAK,EAAE;EAEjC,CAAC;CACH;CAEA,QAAuB;EACrB,MAAM,SAAS,IAAI,MAAc;EACjC,KAAK,MAAM,SAAQ,SAAQ,OAAO,MAAM,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,CAAC;EAClE,OAAO;CACT;CAEA,GAAG,QAA+C;EAChD,OAAO,KAAK,MAAM,IAAI,MAAM;CAC9B;CAEA,QAAQ,QAAmC;EACzC,IAAI,OAAO,KAAK,MAAM,IAAI,MAAM;EAChC,IAAI,CAAC,MAAM;GACT,OAAO,IAAI,UAAU,MAAM;GAC3B,KAAK,MAAM,IAAI,QAAQ,IAAI;EAC7B;EACA,OAAO;CACT;CAEA,QAAQ,QAAyB;EAC/B,OAAO,CAAC,CAAC,KAAK,MAAM,IAAI,MAAM;CAChC;CAEA,WAAW,QAAsB;EAC/B,KAAK,MAAM,SAAQ,SAAQ;GACzB,KAAK,YAAY,MAAM;GACvB,KAAK,aAAa,MAAM;EAC1B,CAAC;EACD,KAAK,MAAM,OAAO,MAAM;CAC1B;CAEA,SAAS,QAAsB;EAC7B,MAAM,eAAe,KAAK,MAAM,IAAI,MAAM;EAC1C,IAAI,CAAC,cACH;EAEF,aAAa,OAAO,SAAQ,UAAS;GACnC,aAAa,QAAQ,SAAQ,WAAU;IACrC,KAAK,QAAQ,OAAO,MAAM;GAC5B,CAAC;EACH,CAAC;EACD,KAAK,WAAW,MAAM;CACxB;CAEA,iBAAsC;EACpC,MAAM,SAA8B,CAAC;EACrC,KAAK,MAAM,SAAQ,SAAQ;GACzB,IAAI,KAAK,QAAQ,WAAW,KAAK,KAAK,OAAO,WAAW,GAAG;IACzD,OAAO,KAAK,IAAI;IAChB,KAAK,MAAM,OAAO,KAAK,EAAE;GAC3B;EACF,CAAC;EACD,OAAO;CACT;CAEA,QAAQ,QAAgB,aAA2B;EACjD,IAAI,KAAK,QAAQ,QAAQ,WAAW,GAClC;EAEF,MAAM,aAAa,KAAK,QAAQ,MAAM;EACtC,MAAM,kBAAkB,KAAK,QAAQ,WAAW;EAChD,WAAW,UAAU,gBAAgB,EAAE;EACvC,gBAAgB,SAAS,WAAW,EAAE;CACxC;CAEA,WAAW,QAAgB,aAA2B;EACpD,MAAM,aAAa,KAAK,MAAM,IAAI,MAAM;EACxC,MAAM,kBAAkB,KAAK,MAAM,IAAI,WAAW;EAClD,IAAI,cAAc,iBAAiB;GACjC,WAAW,aAAa,WAAW;GACnC,gBAAgB,YAAY,MAAM;EACpC;CACF;CAEA,QAAQ,QAAgB,aAA8B;EACpD,MAAM,aAAa,KAAK,MAAM,IAAI,MAAM;EACxC,IAAI,CAAC,YACH,OAAO;EAET,OAAO,CAAC,CAAC,WAAW,QAAQ,MAAK,OAAM,OAAO,WAAW;CAC3D;CAEA,YAAY,QAAgB,aAA8B;EACxD,OAAO,KAAK,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,WAAW;CAC7D;CAEA,YAAsB;EACpB,OAAO,CAAC,GAAG,KAAK,MAAM,KAAK,CAAC,CAAC,CAAC,QAAO,OAAM,CAAC,KAAK,MAAM,IAAI,EAAE,CAAC,EAAE,OAAO,MAAM;CAC/E;CAEA,cAAc,QAA4B;EACxC,MAAM,SAAmB,CAAC;EAC1B,OAAO,SAAQ,OAAM;GACnB,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE;GAC9B,IAAI,MACF,KAAK,QAAQ,SAAQ,UAAS;IAC5B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GACnD,OAAO,KAAK,KAAK;GAErB,CAAC;EAEL,CAAC;EACD,OAAO;CACT;CAEA,aAAa,QAA4B;EACvC,MAAM,SAAmB,CAAC;EAC1B,OAAO,SAAQ,OAAM;GACnB,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE;GAC9B,IAAI,MACF,KAAK,OAAO,SAAQ,UAAS;IAC3B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GACnD,OAAO,KAAK,KAAK;GAErB,CAAC;EAEL,CAAC;EACD,OAAO;CACT;CAEA,iBAAiB,QAA4B;EAC3C,MAAM,SAAmB,KAAK,cAAc,MAAM;EAClD,IAAI,OAAO,WAAW,GACpB,OAAO,CAAC;EAGV,MAAM,yBAAS,IAAI,IAAqB;EACxC,OAAO,SAAQ,OAAM,OAAO,IAAI,IAAI,IAAI,CAAC;EACzC,IAAI,WAAW;EACf,OAAO,WAAW,OAAO,QAAQ;GAC/B,MAAM,OAAO,KAAK,MAAM,IAAI,OAAO,SAAS;GAC5C,IAAI,QAAQ,CAAC,OAAO,IAAI,KAAK,EAAE,GAAG;IAChC,OAAO,IAAI,KAAK,IAAI,IAAI;IACxB,KAAK,QAAQ,SAAQ,UAAS;KAC5B,IAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CAAC,OAAO,MAAK,OAAM,OAAO,KAAK,GACvD,OAAO,KAAK,KAAK;IAErB,CAAC;GACH;GACA,YAAY;EACd;EACA,OAAO;CACT;CAEA,gBAAgB,QAA4B;EAC1C,MAAM,SAAmB,KAAK,aAAa,MAAM;EACjD,IAAI,OAAO,WAAW,GACpB,OAAO,CAAC;EAGV,MAAM,yBAAS,IAAI,IAAqB;EACxC,OAAO,SAAQ,OAAM,OAAO,IAAI,IAAI,IAAI,CAAC;EACzC,IAAI,WAAW;EACf,OAAO,WAAW,OAAO,QAAQ;GAC/B,MAAM,OAAO,KAAK,MAAM,IAAI,OAAO,SAAS;GAC5C,IAAI,QAAQ,CAAC,OAAO,IAAI,KAAK,EAAE,GAAG;IAChC,OAAO,IAAI,KAAK,IAAI,IAAI;IACxB,KAAK,OAAO,SAAQ,UAAS;KAC3B,IAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CAAC,OAAO,MAAK,OAAM,OAAO,KAAK,GACvD,OAAO,KAAK,KAAK;IAErB,CAAC;GACH;GACA,YAAY;EACd;EACA,OAAO;CACT;CAEA,aAAa,QAA4B;EACvC,MAAM,UAAoB,KAAK,iBAAiB,MAAM;EACtD,MAAM,SAAS,CAAC,GAAG,MAAM;EACzB,KAAK,iBAAiB,CAAC,CACpB,QAAO,OAAM,QAAQ,SAAS,EAAE,CAAC,CAAC,CAClC,SAAQ,OAAM;GAEb,IADa,KAAK,MAAM,IAAI,EACxB,CAAA,EAAM,OAAO,OAAM,WAAU,OAAO,SAAS,MAAM,CAAC,GACtD,OAAO,KAAK,EAAE;EAElB,CAAC;EACH,OAAO;CACT;CAEA,mBAA6B;EAC3B,MAAM,SAAmB,CAAC;EAC1B,MAAM,yBAAS,IAAI,IAAY;EAC/B,MAAM,YAAsB,CAAC;EAC7B,KAAK,MAAM,SAAQ,SAAQ;GACzB,IAAI,OAAO,IAAI,KAAK,EAAE,GACpB;GAEF,UAAU,KAAK,KAAK,EAAE;GACtB,OAAO,UAAU,SAAS,GAAG;IAC3B,MAAM,OAAO,UAAU,UAAU,SAAS;IAC1C,IAAI,OAAO,IAAI,IAAI,GAAG;KACpB,IAAI,CAAC,OAAO,MAAK,OAAM,OAAO,IAAI,GAChC,OAAO,KAAK,IAAI;KAElB,UAAU,IAAI;IAChB,OAAO;KACL,OAAO,IAAI,IAAI;KACf,MAAM,WAAW,KAAK,MAAM,IAAI,IAAI;KACpC,IAAI,YAAY,SAAS,QAAQ,SAAS,GACxC,SAAS,QAAQ,SAAQ,UAAS;MAChC,IAAI,CAAC,OAAO,IAAI,KAAK,GACnB,UAAU,KAAK,KAAK;KAExB,CAAC;IAEL;GACF;EACF,CAAC;EACD,OAAO,OAAO,QAAQ;CACxB;;;;;CAMA,WAAW,QAA4B;EACrC,IAAI,OAAO,UAAU,GACnB,OAAO,CAAC,GAAG,MAAM;EAGnB,MAAM,YAAY,KAAK,8BAA8B;EACrD,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,SAAmB,CAAC;EAE1B,KAAK,MAAM,UAAU,CAAC,GAAG,MAAM,CAAC,CAAC,QAAQ,GAAG;GAC1C,MAAM,gBAAgB,UAAU,IAAI,MAAM,qBAAK,IAAI,IAAY;GAC/D,MAAM,WAAW,QAAQ,IAAI,MAAM;GACnC,KAAK,MAAM,WAAW,eACpB,QAAQ,IAAI,OAAO;GAGrB,IAAI,CAAC,UAAU;IACb,OAAO,KAAK,MAAM;IAClB;GACF;GAEA,IAAI,WAAW;GACf,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS;IAClD,MAAM,SAAS,OAAO;IACtB,MAAM,kBAAkB,UAAU,IAAI,MAAM,qBAAK,IAAI,IAAY;IACjE,IAAI,cAAc,IAAI,MAAM,GAAG;KAC7B,IAAI,gBAAgB,IAAI,MAAM,GAC5B,OAAO,KAAK,MAAM;UAElB,OAAO,OAAO,OAAO,GAAG,MAAM;KAEhC,WAAW;KACX;IACF;GACF;GACA,IAAI,CAAC,UACH,OAAO,KAAK,MAAM;EAEtB;EAEA,OAAO,QAAQ;EACf,OAAO;CACT;CAEA,gCAAkE;EAChE,MAAM,0BAAU,IAAI,IAAyB;EAC7C,KAAK,MAAM,QAAQ,KAAK,MAAM,OAAO,GACnC,QAAQ,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,OAAO,CAAC;EAG5C,MAAM,QAAQ,KAAK,iBAAiB;EACpC,KAAK,MAAM,UAAU,CAAC,GAAG,KAAK,CAAC,CAAC,QAAQ,GAAG;GACzC,MAAM,OAAO,KAAK,GAAG,MAAM;GAC3B,IAAI,CAAC,MACH;GAEF,MAAM,cAAc,QAAQ,IAAI,MAAM,qBAAK,IAAI,IAAY;GAC3D,KAAK,MAAM,YAAY,KAAK,QAAQ;IAClC,MAAM,gBAAgB,QAAQ,IAAI,QAAQ,qBAAK,IAAI,IAAY;IAC/D,KAAK,MAAM,WAAW,aACpB,cAAc,IAAI,OAAO;IAE3B,QAAQ,IAAI,UAAU,aAAa;GACrC;EACF;EAEA,OAAO;CACT;CAEA,sBAAsB;EACpB,MAAM,QAAQ,KAAK,iBAAiB;EACpC,MAAM,yBAAS,IAAI,IAAqB;EACxC,MAAM,SAAQ,WAAU;GACtB,IAAI,OAAO,IAAI,MAAM,GACnB;GAEF,MAAM,QAA6C,CAAC;GACpD,MAAM,KAAK;IAAE,IAAI;IAAQ,SAAS,CAAC;GAAE,CAAC;GACtC,OAAO,MAAM,SAAS,GAAG;IACvB,MAAM,OAAO,MAAM,OAAO,GAAG,CAAC,CAAC,CAAC;IAChC,MAAM,OAAO,KAAK,MAAM,IAAI,KAAK,EAAE;IACnC,IAAI,MACF,KAAK,QAAQ,SAAQ,UAAS;KAC5B,KAAK,QAAQ,SAAQ,WAAU,KAAK,WAAW,QAAQ,KAAK,CAAC;KAC7D,MAAM,KAAK;MAAE,IAAI;MAAO,SAAS,CAAC,KAAK,IAAI,GAAG,KAAK,OAAO;KAAE,CAAC;IAC/D,CAAC;IAEH,OAAO,IAAI,KAAK,IAAI,IAAI;GAC1B;EACF,CAAC;CACH;;;;;;;CAQA,YAA6B;EAC3B,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,4BAAY,IAAI,IAAY;EAClC,MAAM,0BAAU,IAAI,IAAoB;EAExC,KAAK,MAAM,UAAU,KAAK,MAAM,KAAK,GAAG;GACtC,IAAI,QAAQ,IAAI,MAAM,GACpB;GAGF,MAAM,YAA2D,CAAC;GAClE,UAAU,KAAK;IAAU;IAAQ,UAAU;GAAK,CAAC;GACjD,OAAO,UAAU,SAAS,GAAG;IAC3B,MAAM,EAAE,QAAQ,aAAa,UAAU,UAAU,SAAS;IAC1D,IAAI,QAAQ,IAAI,MAAM,GAAG;KACvB,UAAU,OAAO,MAAM;KACvB,UAAU,IAAI;KACd;IACF;IACA,QAAQ,IAAI,MAAM;IAClB,UAAU,IAAI,MAAM;IACpB,IAAI,aAAa,MACf,QAAQ,IAAI,QAAQ,QAAQ;IAG9B,MAAM,cAAc,KAAK,MAAM,IAAI,MAAM;IACzC,KAAK,MAAM,SAAS,YAAY,SAAS;KACvC,IAAI,CAAC,QAAQ,IAAI,KAAK,GAAG;MACvB,UAAU,KAAK;OAAE,QAAQ;OAAO,UAAU;MAAO,CAAC;MAClD;KACF;KACA,IAAI,CAAC,UAAU,IAAI,KAAK,GACtB;KAEF,MAAM,QAAkB,CAAC;KACzB,IAAI,UAAU;KACd,MAAM,KAAK,KAAK;KAChB,OAAO,YAAY,OAAO;MACxB,MAAM,KAAK,OAAO;MAClB,UAAU,QAAQ,IAAI,OAAO;KAC/B;KACA,MAAM,KAAK,KAAK;KAChB,MAAM,QAAQ;KACd,OAAO;IACT;GACF;EACF;EACA,OAAO;CACT;;;;;;CAOA,aAAyB;EACvB,MAAM,aAAa,KAAK,4BAA4B;EACpD,MAAM,SAAqB,CAAC;EAC5B,KAAK,MAAM,aAAa,YAAY;GAClC,IAAI,UAAU,WAAW,GAAG;IAC1B,MAAM,KAAK,UAAU;IACrB,IAAI,KAAK,QAAQ,IAAI,EAAE,GACrB,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC;IAEtB;GACF;GACA,MAAM,WAAW,IAAI,MAAc;GACnC,MAAM,YAAY,IAAI,IAAI,SAAS;GACnC,KAAK,MAAM,MAAM,WAAW;IAC1B,SAAS,QAAQ,EAAE;IACnB,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE;IAC9B,IAAI,CAAC,MACH;IAEF,KAAK,MAAM,SAAS,KAAK,SACvB,IAAI,UAAU,IAAI,KAAK,GACrB,SAAS,QAAQ,IAAI,KAAK;GAGhC;GACA,MAAM,QAAQ,SAAS,UAAU;GACjC,IAAI,OACF,OAAO,KAAK,KAAK;EAErB;EACA,OAAO;CACT;;CAGA,8BAA0C;EACxC,IAAI,QAAQ;EACZ,MAAM,0BAAU,IAAI,IAAoB;EACxC,MAAM,0BAAU,IAAI,IAAoB;EACxC,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,QAAkB,CAAC;EACzB,MAAM,aAAyB,CAAC;EAGhC,KAAK,MAAM,WAAW,KAAK,MAAM,KAAK,GAAG;GACvC,IAAI,QAAQ,IAAI,OAAO,GACrB;GAEF,MAAM,YAAqB,CAAC;IAAE,QAAQ;IAAS,WAAW;IAAG,SAAS;GAAM,CAAC;GAC7E,OAAO,UAAU,SAAS,GAAG;IAC3B,MAAM,QAAQ,UAAU,UAAU,SAAS;IAC3C,MAAM,OAAO,KAAK,MAAM,IAAI,MAAM,MAAM;IACxC,IAAI,CAAC,MAAM;KACT,UAAU,IAAI;KACd;IACF;IAEA,IAAI,CAAC,MAAM,SAAS;KAClB,MAAM,UAAU;KAChB,QAAQ,IAAI,MAAM,QAAQ,KAAK;KAC/B,QAAQ,IAAI,MAAM,QAAQ,KAAK;KAC/B,SAAS;KACT,MAAM,KAAK,MAAM,MAAM;KACvB,QAAQ,IAAI,MAAM,MAAM;IAC1B;IAEA,IAAI,MAAM,YAAY,KAAK,QAAQ,QAAQ;KACzC,MAAM,QAAQ,KAAK,QAAQ,MAAM;KACjC,MAAM,aAAa;KACnB,IAAI,CAAC,QAAQ,IAAI,KAAK,GACpB,UAAU,KAAK;MAAE,QAAQ;MAAO,WAAW;MAAG,SAAS;KAAM,CAAC;UACzD,IAAI,QAAQ,IAAI,KAAK,GAC1B,QAAQ,IAAI,MAAM,QAAQ,KAAK,IAAI,QAAQ,IAAI,MAAM,MAAM,GAAI,QAAQ,IAAI,KAAK,CAAE,CAAC;KAErF;IACF;IAEA,UAAU,IAAI;IACd,IAAI,UAAU,SAAS,GAAG;KACxB,MAAM,WAAW,UAAU,UAAU,SAAS,EAAE,CAAC;KACjD,QAAQ,IAAI,UAAU,KAAK,IAAI,QAAQ,IAAI,QAAQ,GAAI,QAAQ,IAAI,MAAM,MAAM,CAAE,CAAC;IACpF;IAEA,IAAI,QAAQ,IAAI,MAAM,MAAM,MAAM,QAAQ,IAAI,MAAM,MAAM,GAAG;KAC3D,MAAM,YAAsB,CAAC;KAC7B,OAAO,MAAM,SAAS,GAAG;MACvB,MAAM,KAAK,MAAM,IAAI;MACrB,QAAQ,OAAO,EAAE;MACjB,UAAU,KAAK,EAAE;MACjB,IAAI,OAAO,MAAM,QACf;KAEJ;KACA,WAAW,KAAK,SAAS;IAC3B;GACF;EACF;EACA,OAAO;CACT;AACF"}
+{"version":3,"file":"graph.js","names":[],"sources":["../../src/graph/graph.ts"],"sourcesContent":["/**\n * Module: Custom graph data structure.\n */\n\n/** Represents single node of a {@link Graph}, as implemented by storing outgoing and incoming connections. */\nexport class GraphNode<NodeID> {\n  /** Unique identifier of the node. */\n  id: NodeID;\n  /** List of outgoing nodes. */\n  outputs: NodeID[];\n  /** List of incoming nodes. */\n  inputs: NodeID[];\n\n  constructor(id: NodeID) {\n    this.id = id;\n    this.outputs = [];\n    this.inputs = [];\n  }\n\n  clone(): GraphNode<NodeID> {\n    const result = new GraphNode(this.id);\n    result.outputs = [...this.outputs];\n    result.inputs = [...this.inputs];\n    return result;\n  }\n\n  addOutput(node: NodeID): void {\n    this.outputs.push(node);\n  }\n\n  addInput(node: NodeID): void {\n    this.inputs.push(node);\n  }\n\n  removeInput(target: NodeID): NodeID | null {\n    const index = this.inputs.findIndex(node => node === target);\n    return index > -1 ? this.inputs.splice(index, 1)[0] : null;\n  }\n\n  removeOutput(target: NodeID): NodeID | null {\n    const index = this.outputs.findIndex(node => node === target);\n    return index > -1 ? this.outputs.splice(index, 1)[0] : null;\n  }\n}\n\n/**\n * Represents a Graph.\n *\n * This class is optimized for TermGraph use case and not supposed to be used as generic graph implementation.\n */\nexport class Graph<NodeID = number> {\n  /** Map of nodes. */\n  nodes = new Map<NodeID, GraphNode<NodeID>>();\n\n  constructor(arr?: NodeID[][]) {\n    if (!arr) {\n      return;\n    }\n    arr.forEach(edge => {\n      if (edge.length === 1) {\n        this.addNode(edge[0]);\n      } else {\n        this.addEdge(edge[0], edge[1]);\n      }\n    });\n  }\n\n  clone(): Graph<NodeID> {\n    const result = new Graph<NodeID>();\n    this.nodes.forEach(node => result.nodes.set(node.id, node.clone()));\n    return result;\n  }\n\n  at(target: NodeID): GraphNode<NodeID> | undefined {\n    return this.nodes.get(target);\n  }\n\n  addNode(target: NodeID): GraphNode<NodeID> {\n    let node = this.nodes.get(target);\n    if (!node) {\n      node = new GraphNode(target);\n      this.nodes.set(target, node);\n    }\n    return node;\n  }\n\n  hasNode(target: NodeID): boolean {\n    return !!this.nodes.get(target);\n  }\n\n  removeNode(target: NodeID): void {\n    this.nodes.forEach(node => {\n      node.removeInput(target);\n      node.removeOutput(target);\n    });\n    this.nodes.delete(target);\n  }\n\n  foldNode(target: NodeID): void {\n    const nodeToRemove = this.nodes.get(target);\n    if (!nodeToRemove) {\n      return;\n    }\n    nodeToRemove.inputs.forEach(input => {\n      nodeToRemove.outputs.forEach(output => {\n        this.addEdge(input, output);\n      });\n    });\n    this.removeNode(target);\n  }\n\n  removeIsolated(): GraphNode<NodeID>[] {\n    const result: GraphNode<NodeID>[] = [];\n    this.nodes.forEach(node => {\n      if (node.outputs.length === 0 && node.inputs.length === 0) {\n        result.push(node);\n        this.nodes.delete(node.id);\n      }\n    });\n    return result;\n  }\n\n  addEdge(source: NodeID, destination: NodeID): void {\n    if (this.hasEdge(source, destination)) {\n      return;\n    }\n    const sourceNode = this.addNode(source);\n    const destinationNode = this.addNode(destination);\n    sourceNode.addOutput(destinationNode.id);\n    destinationNode.addInput(sourceNode.id);\n  }\n\n  removeEdge(source: NodeID, destination: NodeID): void {\n    const sourceNode = this.nodes.get(source);\n    const destinationNode = this.nodes.get(destination);\n    if (sourceNode && destinationNode) {\n      sourceNode.removeOutput(destination);\n      destinationNode.removeInput(source);\n    }\n  }\n\n  hasEdge(source: NodeID, destination: NodeID): boolean {\n    const sourceNode = this.nodes.get(source);\n    if (!sourceNode) {\n      return false;\n    }\n    return !!sourceNode.outputs.find(id => id === destination);\n  }\n\n  isReachable(source: NodeID, destination: NodeID): boolean {\n    return this.expandAllOutputs([source]).includes(destination);\n  }\n\n  rootNodes(): NodeID[] {\n    return [...this.nodes.keys()].filter(id => !this.nodes.get(id)?.inputs.length);\n  }\n\n  expandOutputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = [];\n    origin.forEach(id => {\n      const node = this.nodes.get(id);\n      if (node) {\n        node.outputs.forEach(child => {\n          if (!origin.includes(child) && !result.includes(child)) {\n            result.push(child);\n          }\n        });\n      }\n    });\n    return result;\n  }\n\n  expandInputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = [];\n    origin.forEach(id => {\n      const node = this.nodes.get(id);\n      if (node) {\n        node.inputs.forEach(child => {\n          if (!origin.includes(child) && !result.includes(child)) {\n            result.push(child);\n          }\n        });\n      }\n    });\n    return result;\n  }\n\n  expandAllOutputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = this.expandOutputs(origin);\n    if (result.length === 0) {\n      return [];\n    }\n\n    const marked = new Map<NodeID, boolean>();\n    origin.forEach(id => marked.set(id, true));\n    let position = 0;\n    while (position < result.length) {\n      const node = this.nodes.get(result[position]);\n      if (node && !marked.get(node.id)) {\n        marked.set(node.id, true);\n        node.outputs.forEach(child => {\n          if (!marked.get(child) && !result.find(id => id === child)) {\n            result.push(child);\n          }\n        });\n      }\n      position += 1;\n    }\n    return result;\n  }\n\n  expandAllInputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = this.expandInputs(origin);\n    if (result.length === 0) {\n      return [];\n    }\n\n    const marked = new Map<NodeID, boolean>();\n    origin.forEach(id => marked.set(id, true));\n    let position = 0;\n    while (position < result.length) {\n      const node = this.nodes.get(result[position]);\n      if (node && !marked.get(node.id)) {\n        marked.set(node.id, true);\n        node.inputs.forEach(child => {\n          if (!marked.get(child) && !result.find(id => id === child)) {\n            result.push(child);\n          }\n        });\n      }\n      position += 1;\n    }\n    return result;\n  }\n\n  maximizePart(origin: NodeID[]): NodeID[] {\n    const outputs: NodeID[] = this.expandAllOutputs(origin);\n    const result = [...origin];\n    this.topologicalOrder()\n      .filter(id => outputs.includes(id))\n      .forEach(id => {\n        const node = this.nodes.get(id);\n        if (node?.inputs.every(parent => result.includes(parent))) {\n          result.push(id);\n        }\n      });\n    return result;\n  }\n\n  topologicalOrder(): NodeID[] {\n    const result: NodeID[] = [];\n    const marked = new Set<NodeID>();\n    const nodeStack: NodeID[] = [];\n    this.nodes.forEach(node => {\n      if (marked.has(node.id)) {\n        return;\n      }\n      nodeStack.push(node.id);\n      while (nodeStack.length > 0) {\n        const item = nodeStack[nodeStack.length - 1];\n        if (marked.has(item)) {\n          if (!result.find(id => id === item)) {\n            result.push(item);\n          }\n          nodeStack.pop();\n        } else {\n          marked.add(item);\n          const itemNode = this.nodes.get(item);\n          if (itemNode && itemNode.outputs.length > 0) {\n            itemNode.outputs.forEach(child => {\n              if (!marked.has(child)) {\n                nodeStack.push(child);\n              }\n            });\n          }\n        }\n      }\n    });\n    return result.reverse();\n  }\n\n  /**\n   * Stably reorders the given node ids so that, for this DAG, no node appears before a transitive\n   * successor (edges: source → dependent; {@link GraphNode.outputs} lists dependents).\n   */\n  sortStable(target: NodeID[]): NodeID[] {\n    if (target.length <= 1) {\n      return [...target];\n    }\n\n    const reachable = this.buildTransitiveClosureForSort();\n    const testSet = new Set<NodeID>();\n    const result: NodeID[] = [];\n\n    for (const nodeId of [...target].reverse()) {\n      const nodeReachable = reachable.get(nodeId) ?? new Set<NodeID>();\n      const needMove = testSet.has(nodeId);\n      for (const childId of nodeReachable) {\n        testSet.add(childId);\n      }\n\n      if (!needMove) {\n        result.push(nodeId);\n        continue;\n      }\n\n      let inserted = false;\n      for (let index = 0; index < result.length; index++) {\n        const parent = result[index];\n        const parentReachable = reachable.get(parent) ?? new Set<NodeID>();\n        if (nodeReachable.has(parent)) {\n          if (parentReachable.has(nodeId)) {\n            result.push(nodeId);\n          } else {\n            result.splice(index, 0, nodeId);\n          }\n          inserted = true;\n          break;\n        }\n      }\n      if (!inserted) {\n        result.push(nodeId);\n      }\n    }\n\n    result.reverse();\n    return result;\n  }\n\n  private buildTransitiveClosureForSort(): Map<NodeID, Set<NodeID>> {\n    const closure = new Map<NodeID, Set<NodeID>>();\n    for (const node of this.nodes.values()) {\n      closure.set(node.id, new Set(node.outputs));\n    }\n\n    const order = this.topologicalOrder();\n    for (const nodeId of [...order].reverse()) {\n      const node = this.at(nodeId);\n      if (!node) {\n        continue;\n      }\n      const nodeClosure = closure.get(nodeId) ?? new Set<NodeID>();\n      for (const parentId of node.inputs) {\n        const parentClosure = closure.get(parentId) ?? new Set<NodeID>();\n        for (const childId of nodeClosure) {\n          parentClosure.add(childId);\n        }\n        closure.set(parentId, parentClosure);\n      }\n    }\n\n    return closure;\n  }\n\n  transitiveReduction() {\n    const order = this.topologicalOrder();\n    const marked = new Map<NodeID, boolean>();\n    order.forEach(nodeID => {\n      if (marked.get(nodeID)) {\n        return;\n      }\n      const stack: { id: NodeID; parents: NodeID[] }[] = [];\n      stack.push({ id: nodeID, parents: [] });\n      while (stack.length > 0) {\n        const item = stack.splice(0, 1)[0];\n        const node = this.nodes.get(item.id);\n        if (node) {\n          node.outputs.forEach(child => {\n            item.parents.forEach(parent => this.removeEdge(parent, child));\n            stack.push({ id: child, parents: [item.id, ...item.parents] });\n          });\n        }\n        marked.set(item.id, true);\n      }\n    });\n  }\n\n  /**\n   * Finds a cycle in the graph.\n   *\n   * @returns {NodeID[] | null} The cycle if found, otherwise `null`.\n   * Uses non-recursive DFS. The returned path is closed (first id equals last).\n   */\n  findCycle(): NodeID[] | null {\n    const visited = new Set<NodeID>();\n    const nodeStack = new Set<NodeID>();\n    const parents = new Map<NodeID, NodeID>();\n\n    for (const nodeId of this.nodes.keys()) {\n      if (visited.has(nodeId)) {\n        continue;\n      }\n\n      const callStack: { nodeId: NodeID; parentId: NodeID | null }[] = [];\n      callStack.push({ nodeId: nodeId, parentId: null });\n      while (callStack.length > 0) {\n        const { nodeId, parentId } = callStack[callStack.length - 1];\n        if (visited.has(nodeId)) {\n          nodeStack.delete(nodeId);\n          callStack.pop();\n          continue;\n        }\n        visited.add(nodeId);\n        nodeStack.add(nodeId);\n        if (parentId !== null) {\n          parents.set(nodeId, parentId);\n        }\n\n        const currentNode = this.nodes.get(nodeId)!;\n        for (const child of currentNode.outputs) {\n          if (!visited.has(child)) {\n            callStack.push({ nodeId: child, parentId: nodeId });\n            continue;\n          }\n          if (!nodeStack.has(child)) {\n            continue;\n          }\n          const cycle: NodeID[] = [];\n          let current = nodeId;\n          cycle.push(child);\n          while (current !== child) {\n            cycle.push(current);\n            current = parents.get(current)!;\n          }\n          cycle.push(child);\n          cycle.reverse();\n          return cycle;\n        }\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Finds one closed cycle path per cyclic strongly connected component.\n   *\n   * @returns Closed paths (first id equals last). Empty when the graph is acyclic.\n   */\n  findCycles(): NodeID[][] {\n    const components = this.stronglyConnectedComponents();\n    const result: NodeID[][] = [];\n    for (const component of components) {\n      if (component.length === 1) {\n        const id = component[0];\n        if (this.hasEdge(id, id)) {\n          result.push([id, id]);\n        }\n        continue;\n      }\n      const subgraph = new Graph<NodeID>();\n      const memberIds = new Set(component);\n      for (const id of component) {\n        subgraph.addNode(id);\n        const node = this.nodes.get(id);\n        if (!node) {\n          continue;\n        }\n        for (const child of node.outputs) {\n          if (memberIds.has(child)) {\n            subgraph.addEdge(id, child);\n          }\n        }\n      }\n      const cycle = subgraph.findCycle();\n      if (cycle) {\n        result.push(cycle);\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Tarjan strongly connected components (iterative).\n   *\n   * @returns Node-id arrays; multi-node components are cyclic SCCs, single-node\n   *   components are acyclic unless the node has a self-loop.\n   */\n  stronglyConnectedComponents(): NodeID[][] {\n    let index = 0;\n    const indices = new Map<NodeID, number>();\n    const lowlink = new Map<NodeID, number>();\n    const onStack = new Set<NodeID>();\n    const stack: NodeID[] = [];\n    const components: NodeID[][] = [];\n\n    /** Tarjan stack frame for iterative {@link Graph.stronglyConnectedComponents}. */\n    interface Frame {\n      nodeId: NodeID;\n      edgeIndex: number;\n      entered: boolean;\n    }\n    for (const startId of this.nodes.keys()) {\n      if (indices.has(startId)) {\n        continue;\n      }\n      const callStack: Frame[] = [{ nodeId: startId, edgeIndex: 0, entered: false }];\n      while (callStack.length > 0) {\n        const frame = callStack[callStack.length - 1];\n        const node = this.nodes.get(frame.nodeId);\n        if (!node) {\n          callStack.pop();\n          continue;\n        }\n\n        if (!frame.entered) {\n          frame.entered = true;\n          indices.set(frame.nodeId, index);\n          lowlink.set(frame.nodeId, index);\n          index += 1;\n          stack.push(frame.nodeId);\n          onStack.add(frame.nodeId);\n        }\n\n        if (frame.edgeIndex < node.outputs.length) {\n          const child = node.outputs[frame.edgeIndex];\n          frame.edgeIndex += 1;\n          if (!indices.has(child)) {\n            callStack.push({ nodeId: child, edgeIndex: 0, entered: false });\n          } else if (onStack.has(child)) {\n            lowlink.set(frame.nodeId, Math.min(lowlink.get(frame.nodeId)!, indices.get(child)!));\n          }\n          continue;\n        }\n\n        callStack.pop();\n        if (callStack.length > 0) {\n          const parentId = callStack[callStack.length - 1].nodeId;\n          lowlink.set(parentId, Math.min(lowlink.get(parentId)!, lowlink.get(frame.nodeId)!));\n        }\n\n        if (lowlink.get(frame.nodeId) === indices.get(frame.nodeId)) {\n          const component: NodeID[] = [];\n          while (stack.length > 0) {\n            const id = stack.pop()!;\n            onStack.delete(id);\n            component.push(id);\n            if (id === frame.nodeId) {\n              break;\n            }\n          }\n          components.push(component);\n        }\n      }\n    }\n    return components;\n  }\n}\n"],"mappings":";;;;;AAKA,IAAa,YAAb,MAAa,UAAkB;;CAE7B;;CAEA;;CAEA;CAEA,YAAY,IAAY;EACtB,KAAK,KAAK;EACV,KAAK,UAAU,CAAC;EAChB,KAAK,SAAS,CAAC;CACjB;CAEA,QAA2B;EACzB,MAAM,SAAS,IAAI,UAAU,KAAK,EAAE;EACpC,OAAO,UAAU,CAAC,GAAG,KAAK,OAAO;EACjC,OAAO,SAAS,CAAC,GAAG,KAAK,MAAM;EAC/B,OAAO;CACT;CAEA,UAAU,MAAoB;EAC5B,KAAK,QAAQ,KAAK,IAAI;CACxB;CAEA,SAAS,MAAoB;EAC3B,KAAK,OAAO,KAAK,IAAI;CACvB;CAEA,YAAY,QAA+B;EACzC,MAAM,QAAQ,KAAK,OAAO,WAAU,SAAQ,SAAS,MAAM;EAC3D,OAAO,QAAQ,KAAK,KAAK,OAAO,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK;CACxD;CAEA,aAAa,QAA+B;EAC1C,MAAM,QAAQ,KAAK,QAAQ,WAAU,SAAQ,SAAS,MAAM;EAC5D,OAAO,QAAQ,KAAK,KAAK,QAAQ,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK;CACzD;AACF;;;;;;AAOA,IAAa,QAAb,MAAa,MAAuB;;CAElC,wBAAQ,IAAI,IAA+B;CAE3C,YAAY,KAAkB;EAC5B,IAAI,CAAC,KACH;EAEF,IAAI,SAAQ,SAAQ;GAClB,IAAI,KAAK,WAAW,GAClB,KAAK,QAAQ,KAAK,EAAE;QAEpB,KAAK,QAAQ,KAAK,IAAI,KAAK,EAAE;EAEjC,CAAC;CACH;CAEA,QAAuB;EACrB,MAAM,SAAS,IAAI,MAAc;EACjC,KAAK,MAAM,SAAQ,SAAQ,OAAO,MAAM,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,CAAC;EAClE,OAAO;CACT;CAEA,GAAG,QAA+C;EAChD,OAAO,KAAK,MAAM,IAAI,MAAM;CAC9B;CAEA,QAAQ,QAAmC;EACzC,IAAI,OAAO,KAAK,MAAM,IAAI,MAAM;EAChC,IAAI,CAAC,MAAM;GACT,OAAO,IAAI,UAAU,MAAM;GAC3B,KAAK,MAAM,IAAI,QAAQ,IAAI;EAC7B;EACA,OAAO;CACT;CAEA,QAAQ,QAAyB;EAC/B,OAAO,CAAC,CAAC,KAAK,MAAM,IAAI,MAAM;CAChC;CAEA,WAAW,QAAsB;EAC/B,KAAK,MAAM,SAAQ,SAAQ;GACzB,KAAK,YAAY,MAAM;GACvB,KAAK,aAAa,MAAM;EAC1B,CAAC;EACD,KAAK,MAAM,OAAO,MAAM;CAC1B;CAEA,SAAS,QAAsB;EAC7B,MAAM,eAAe,KAAK,MAAM,IAAI,MAAM;EAC1C,IAAI,CAAC,cACH;EAEF,aAAa,OAAO,SAAQ,UAAS;GACnC,aAAa,QAAQ,SAAQ,WAAU;IACrC,KAAK,QAAQ,OAAO,MAAM;GAC5B,CAAC;EACH,CAAC;EACD,KAAK,WAAW,MAAM;CACxB;CAEA,iBAAsC;EACpC,MAAM,SAA8B,CAAC;EACrC,KAAK,MAAM,SAAQ,SAAQ;GACzB,IAAI,KAAK,QAAQ,WAAW,KAAK,KAAK,OAAO,WAAW,GAAG;IACzD,OAAO,KAAK,IAAI;IAChB,KAAK,MAAM,OAAO,KAAK,EAAE;GAC3B;EACF,CAAC;EACD,OAAO;CACT;CAEA,QAAQ,QAAgB,aAA2B;EACjD,IAAI,KAAK,QAAQ,QAAQ,WAAW,GAClC;EAEF,MAAM,aAAa,KAAK,QAAQ,MAAM;EACtC,MAAM,kBAAkB,KAAK,QAAQ,WAAW;EAChD,WAAW,UAAU,gBAAgB,EAAE;EACvC,gBAAgB,SAAS,WAAW,EAAE;CACxC;CAEA,WAAW,QAAgB,aAA2B;EACpD,MAAM,aAAa,KAAK,MAAM,IAAI,MAAM;EACxC,MAAM,kBAAkB,KAAK,MAAM,IAAI,WAAW;EAClD,IAAI,cAAc,iBAAiB;GACjC,WAAW,aAAa,WAAW;GACnC,gBAAgB,YAAY,MAAM;EACpC;CACF;CAEA,QAAQ,QAAgB,aAA8B;EACpD,MAAM,aAAa,KAAK,MAAM,IAAI,MAAM;EACxC,IAAI,CAAC,YACH,OAAO;EAET,OAAO,CAAC,CAAC,WAAW,QAAQ,MAAK,OAAM,OAAO,WAAW;CAC3D;CAEA,YAAY,QAAgB,aAA8B;EACxD,OAAO,KAAK,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,WAAW;CAC7D;CAEA,YAAsB;EACpB,OAAO,CAAC,GAAG,KAAK,MAAM,KAAK,CAAC,CAAC,CAAC,QAAO,OAAM,CAAC,KAAK,MAAM,IAAI,EAAE,CAAC,EAAE,OAAO,MAAM;CAC/E;CAEA,cAAc,QAA4B;EACxC,MAAM,SAAmB,CAAC;EAC1B,OAAO,SAAQ,OAAM;GACnB,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE;GAC9B,IAAI,MACF,KAAK,QAAQ,SAAQ,UAAS;IAC5B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GACnD,OAAO,KAAK,KAAK;GAErB,CAAC;EAEL,CAAC;EACD,OAAO;CACT;CAEA,aAAa,QAA4B;EACvC,MAAM,SAAmB,CAAC;EAC1B,OAAO,SAAQ,OAAM;GACnB,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE;GAC9B,IAAI,MACF,KAAK,OAAO,SAAQ,UAAS;IAC3B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GACnD,OAAO,KAAK,KAAK;GAErB,CAAC;EAEL,CAAC;EACD,OAAO;CACT;CAEA,iBAAiB,QAA4B;EAC3C,MAAM,SAAmB,KAAK,cAAc,MAAM;EAClD,IAAI,OAAO,WAAW,GACpB,OAAO,CAAC;EAGV,MAAM,yBAAS,IAAI,IAAqB;EACxC,OAAO,SAAQ,OAAM,OAAO,IAAI,IAAI,IAAI,CAAC;EACzC,IAAI,WAAW;EACf,OAAO,WAAW,OAAO,QAAQ;GAC/B,MAAM,OAAO,KAAK,MAAM,IAAI,OAAO,SAAS;GAC5C,IAAI,QAAQ,CAAC,OAAO,IAAI,KAAK,EAAE,GAAG;IAChC,OAAO,IAAI,KAAK,IAAI,IAAI;IACxB,KAAK,QAAQ,SAAQ,UAAS;KAC5B,IAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CAAC,OAAO,MAAK,OAAM,OAAO,KAAK,GACvD,OAAO,KAAK,KAAK;IAErB,CAAC;GACH;GACA,YAAY;EACd;EACA,OAAO;CACT;CAEA,gBAAgB,QAA4B;EAC1C,MAAM,SAAmB,KAAK,aAAa,MAAM;EACjD,IAAI,OAAO,WAAW,GACpB,OAAO,CAAC;EAGV,MAAM,yBAAS,IAAI,IAAqB;EACxC,OAAO,SAAQ,OAAM,OAAO,IAAI,IAAI,IAAI,CAAC;EACzC,IAAI,WAAW;EACf,OAAO,WAAW,OAAO,QAAQ;GAC/B,MAAM,OAAO,KAAK,MAAM,IAAI,OAAO,SAAS;GAC5C,IAAI,QAAQ,CAAC,OAAO,IAAI,KAAK,EAAE,GAAG;IAChC,OAAO,IAAI,KAAK,IAAI,IAAI;IACxB,KAAK,OAAO,SAAQ,UAAS;KAC3B,IAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CAAC,OAAO,MAAK,OAAM,OAAO,KAAK,GACvD,OAAO,KAAK,KAAK;IAErB,CAAC;GACH;GACA,YAAY;EACd;EACA,OAAO;CACT;CAEA,aAAa,QAA4B;EACvC,MAAM,UAAoB,KAAK,iBAAiB,MAAM;EACtD,MAAM,SAAS,CAAC,GAAG,MAAM;EACzB,KAAK,iBAAiB,CAAC,CACpB,QAAO,OAAM,QAAQ,SAAS,EAAE,CAAC,CAAC,CAClC,SAAQ,OAAM;GAEb,IADa,KAAK,MAAM,IAAI,EACxB,CAAA,EAAM,OAAO,OAAM,WAAU,OAAO,SAAS,MAAM,CAAC,GACtD,OAAO,KAAK,EAAE;EAElB,CAAC;EACH,OAAO;CACT;CAEA,mBAA6B;EAC3B,MAAM,SAAmB,CAAC;EAC1B,MAAM,yBAAS,IAAI,IAAY;EAC/B,MAAM,YAAsB,CAAC;EAC7B,KAAK,MAAM,SAAQ,SAAQ;GACzB,IAAI,OAAO,IAAI,KAAK,EAAE,GACpB;GAEF,UAAU,KAAK,KAAK,EAAE;GACtB,OAAO,UAAU,SAAS,GAAG;IAC3B,MAAM,OAAO,UAAU,UAAU,SAAS;IAC1C,IAAI,OAAO,IAAI,IAAI,GAAG;KACpB,IAAI,CAAC,OAAO,MAAK,OAAM,OAAO,IAAI,GAChC,OAAO,KAAK,IAAI;KAElB,UAAU,IAAI;IAChB,OAAO;KACL,OAAO,IAAI,IAAI;KACf,MAAM,WAAW,KAAK,MAAM,IAAI,IAAI;KACpC,IAAI,YAAY,SAAS,QAAQ,SAAS,GACxC,SAAS,QAAQ,SAAQ,UAAS;MAChC,IAAI,CAAC,OAAO,IAAI,KAAK,GACnB,UAAU,KAAK,KAAK;KAExB,CAAC;IAEL;GACF;EACF,CAAC;EACD,OAAO,OAAO,QAAQ;CACxB;;;;;CAMA,WAAW,QAA4B;EACrC,IAAI,OAAO,UAAU,GACnB,OAAO,CAAC,GAAG,MAAM;EAGnB,MAAM,YAAY,KAAK,8BAA8B;EACrD,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,SAAmB,CAAC;EAE1B,KAAK,MAAM,UAAU,CAAC,GAAG,MAAM,CAAC,CAAC,QAAQ,GAAG;GAC1C,MAAM,gBAAgB,UAAU,IAAI,MAAM,qBAAK,IAAI,IAAY;GAC/D,MAAM,WAAW,QAAQ,IAAI,MAAM;GACnC,KAAK,MAAM,WAAW,eACpB,QAAQ,IAAI,OAAO;GAGrB,IAAI,CAAC,UAAU;IACb,OAAO,KAAK,MAAM;IAClB;GACF;GAEA,IAAI,WAAW;GACf,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS;IAClD,MAAM,SAAS,OAAO;IACtB,MAAM,kBAAkB,UAAU,IAAI,MAAM,qBAAK,IAAI,IAAY;IACjE,IAAI,cAAc,IAAI,MAAM,GAAG;KAC7B,IAAI,gBAAgB,IAAI,MAAM,GAC5B,OAAO,KAAK,MAAM;UAElB,OAAO,OAAO,OAAO,GAAG,MAAM;KAEhC,WAAW;KACX;IACF;GACF;GACA,IAAI,CAAC,UACH,OAAO,KAAK,MAAM;EAEtB;EAEA,OAAO,QAAQ;EACf,OAAO;CACT;CAEA,gCAAkE;EAChE,MAAM,0BAAU,IAAI,IAAyB;EAC7C,KAAK,MAAM,QAAQ,KAAK,MAAM,OAAO,GACnC,QAAQ,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,OAAO,CAAC;EAG5C,MAAM,QAAQ,KAAK,iBAAiB;EACpC,KAAK,MAAM,UAAU,CAAC,GAAG,KAAK,CAAC,CAAC,QAAQ,GAAG;GACzC,MAAM,OAAO,KAAK,GAAG,MAAM;GAC3B,IAAI,CAAC,MACH;GAEF,MAAM,cAAc,QAAQ,IAAI,MAAM,qBAAK,IAAI,IAAY;GAC3D,KAAK,MAAM,YAAY,KAAK,QAAQ;IAClC,MAAM,gBAAgB,QAAQ,IAAI,QAAQ,qBAAK,IAAI,IAAY;IAC/D,KAAK,MAAM,WAAW,aACpB,cAAc,IAAI,OAAO;IAE3B,QAAQ,IAAI,UAAU,aAAa;GACrC;EACF;EAEA,OAAO;CACT;CAEA,sBAAsB;EACpB,MAAM,QAAQ,KAAK,iBAAiB;EACpC,MAAM,yBAAS,IAAI,IAAqB;EACxC,MAAM,SAAQ,WAAU;GACtB,IAAI,OAAO,IAAI,MAAM,GACnB;GAEF,MAAM,QAA6C,CAAC;GACpD,MAAM,KAAK;IAAE,IAAI;IAAQ,SAAS,CAAC;GAAE,CAAC;GACtC,OAAO,MAAM,SAAS,GAAG;IACvB,MAAM,OAAO,MAAM,OAAO,GAAG,CAAC,CAAC,CAAC;IAChC,MAAM,OAAO,KAAK,MAAM,IAAI,KAAK,EAAE;IACnC,IAAI,MACF,KAAK,QAAQ,SAAQ,UAAS;KAC5B,KAAK,QAAQ,SAAQ,WAAU,KAAK,WAAW,QAAQ,KAAK,CAAC;KAC7D,MAAM,KAAK;MAAE,IAAI;MAAO,SAAS,CAAC,KAAK,IAAI,GAAG,KAAK,OAAO;KAAE,CAAC;IAC/D,CAAC;IAEH,OAAO,IAAI,KAAK,IAAI,IAAI;GAC1B;EACF,CAAC;CACH;;;;;;;CAQA,YAA6B;EAC3B,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,4BAAY,IAAI,IAAY;EAClC,MAAM,0BAAU,IAAI,IAAoB;EAExC,KAAK,MAAM,UAAU,KAAK,MAAM,KAAK,GAAG;GACtC,IAAI,QAAQ,IAAI,MAAM,GACpB;GAGF,MAAM,YAA2D,CAAC;GAClE,UAAU,KAAK;IAAU;IAAQ,UAAU;GAAK,CAAC;GACjD,OAAO,UAAU,SAAS,GAAG;IAC3B,MAAM,EAAE,QAAQ,aAAa,UAAU,UAAU,SAAS;IAC1D,IAAI,QAAQ,IAAI,MAAM,GAAG;KACvB,UAAU,OAAO,MAAM;KACvB,UAAU,IAAI;KACd;IACF;IACA,QAAQ,IAAI,MAAM;IAClB,UAAU,IAAI,MAAM;IACpB,IAAI,aAAa,MACf,QAAQ,IAAI,QAAQ,QAAQ;IAG9B,MAAM,cAAc,KAAK,MAAM,IAAI,MAAM;IACzC,KAAK,MAAM,SAAS,YAAY,SAAS;KACvC,IAAI,CAAC,QAAQ,IAAI,KAAK,GAAG;MACvB,UAAU,KAAK;OAAE,QAAQ;OAAO,UAAU;MAAO,CAAC;MAClD;KACF;KACA,IAAI,CAAC,UAAU,IAAI,KAAK,GACtB;KAEF,MAAM,QAAkB,CAAC;KACzB,IAAI,UAAU;KACd,MAAM,KAAK,KAAK;KAChB,OAAO,YAAY,OAAO;MACxB,MAAM,KAAK,OAAO;MAClB,UAAU,QAAQ,IAAI,OAAO;KAC/B;KACA,MAAM,KAAK,KAAK;KAChB,MAAM,QAAQ;KACd,OAAO;IACT;GACF;EACF;EACA,OAAO;CACT;;;;;;CAOA,aAAyB;EACvB,MAAM,aAAa,KAAK,4BAA4B;EACpD,MAAM,SAAqB,CAAC;EAC5B,KAAK,MAAM,aAAa,YAAY;GAClC,IAAI,UAAU,WAAW,GAAG;IAC1B,MAAM,KAAK,UAAU;IACrB,IAAI,KAAK,QAAQ,IAAI,EAAE,GACrB,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC;IAEtB;GACF;GACA,MAAM,WAAW,IAAI,MAAc;GACnC,MAAM,YAAY,IAAI,IAAI,SAAS;GACnC,KAAK,MAAM,MAAM,WAAW;IAC1B,SAAS,QAAQ,EAAE;IACnB,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE;IAC9B,IAAI,CAAC,MACH;IAEF,KAAK,MAAM,SAAS,KAAK,SACvB,IAAI,UAAU,IAAI,KAAK,GACrB,SAAS,QAAQ,IAAI,KAAK;GAGhC;GACA,MAAM,QAAQ,SAAS,UAAU;GACjC,IAAI,OACF,OAAO,KAAK,KAAK;EAErB;EACA,OAAO;CACT;;;;;;;CAQA,8BAA0C;EACxC,IAAI,QAAQ;EACZ,MAAM,0BAAU,IAAI,IAAoB;EACxC,MAAM,0BAAU,IAAI,IAAoB;EACxC,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,QAAkB,CAAC;EACzB,MAAM,aAAyB,CAAC;EAQhC,KAAK,MAAM,WAAW,KAAK,MAAM,KAAK,GAAG;GACvC,IAAI,QAAQ,IAAI,OAAO,GACrB;GAEF,MAAM,YAAqB,CAAC;IAAE,QAAQ;IAAS,WAAW;IAAG,SAAS;GAAM,CAAC;GAC7E,OAAO,UAAU,SAAS,GAAG;IAC3B,MAAM,QAAQ,UAAU,UAAU,SAAS;IAC3C,MAAM,OAAO,KAAK,MAAM,IAAI,MAAM,MAAM;IACxC,IAAI,CAAC,MAAM;KACT,UAAU,IAAI;KACd;IACF;IAEA,IAAI,CAAC,MAAM,SAAS;KAClB,MAAM,UAAU;KAChB,QAAQ,IAAI,MAAM,QAAQ,KAAK;KAC/B,QAAQ,IAAI,MAAM,QAAQ,KAAK;KAC/B,SAAS;KACT,MAAM,KAAK,MAAM,MAAM;KACvB,QAAQ,IAAI,MAAM,MAAM;IAC1B;IAEA,IAAI,MAAM,YAAY,KAAK,QAAQ,QAAQ;KACzC,MAAM,QAAQ,KAAK,QAAQ,MAAM;KACjC,MAAM,aAAa;KACnB,IAAI,CAAC,QAAQ,IAAI,KAAK,GACpB,UAAU,KAAK;MAAE,QAAQ;MAAO,WAAW;MAAG,SAAS;KAAM,CAAC;UACzD,IAAI,QAAQ,IAAI,KAAK,GAC1B,QAAQ,IAAI,MAAM,QAAQ,KAAK,IAAI,QAAQ,IAAI,MAAM,MAAM,GAAI,QAAQ,IAAI,KAAK,CAAE,CAAC;KAErF;IACF;IAEA,UAAU,IAAI;IACd,IAAI,UAAU,SAAS,GAAG;KACxB,MAAM,WAAW,UAAU,UAAU,SAAS,EAAE,CAAC;KACjD,QAAQ,IAAI,UAAU,KAAK,IAAI,QAAQ,IAAI,QAAQ,GAAI,QAAQ,IAAI,MAAM,MAAM,CAAE,CAAC;IACpF;IAEA,IAAI,QAAQ,IAAI,MAAM,MAAM,MAAM,QAAQ,IAAI,MAAM,MAAM,GAAG;KAC3D,MAAM,YAAsB,CAAC;KAC7B,OAAO,MAAM,SAAS,GAAG;MACvB,MAAM,KAAK,MAAM,IAAI;MACrB,QAAQ,OAAO,EAAE;MACjB,UAAU,KAAK,EAAE;MACjB,IAAI,OAAO,MAAM,QACf;KAEJ;KACA,WAAW,KAAK,SAAS;IAC3B;GACF;EACF;EACA,OAAO;CACT;AACF"}

package/dist/graph/index.d.ts

@@ -1,2 +1,2 @@
-import { t as Graph } from "../graph-DPOvglEm.js";
+import { t as Graph } from "../graph-CL73WdW1.js";
 export { Graph };

package/dist/{graph-DPOvglEm.d.ts → graph-CL73WdW1.d.ts}

@@ -64,9 +64,14 @@ declare class Graph<NodeID = number> {
    * @returns Closed paths (first id equals last). Empty when the graph is acyclic.
    */
   findCycles(): NodeID[][];
-  /** Tarjan strongly connected components (non-recursive). */
+  /**
+   * Tarjan strongly connected components (iterative).
+   *
+   * @returns Node-id arrays; multi-node components are cyclic SCCs, single-node
+   *   components are acyclic unless the node has a self-loop.
+   */
   stronglyConnectedComponents(): NodeID[][];
 }
 //#endregion
 export { GraphNode as n, Graph as t };
-//# sourceMappingURL=graph-DPOvglEm.d.ts.map
+//# sourceMappingURL=graph-CL73WdW1.d.ts.map

package/dist/index.d.ts

@@ -1,24 +1,24 @@
 import { EntityReference, Grammeme, ReferenceType, SyntacticReference, TermContext, WordForm, supportedGrammemes } from "./cctext/language.js";
-import { t as Graph } from "./graph-DPOvglEm.js";
+import { t as Graph } from "./graph-CL73WdW1.js";
 import { r as printTree, t as CMSyntaxNode } from "./lezer-tree-iS7LpLBJ.js";
 import { a as TOKEN_ERROR, c as flattenAst, d as printAst, f as visitAstDFS, i as FlatAstNode, l as getNodeIndices, n as AstNodeBase, o as buildTree, r as FlatAST, s as findByUid, t as AstNode, u as getNodeText } from "./ast-C8sIpKdL.js";
 import { t as Branded } from "./branded-ZlzIcxzu.js";
 import { n as generateStub, t as applyHash_fnv1a } from "./hash-Y8I4c6Al.js";
 import { A as makeTypePath, b as Typification, d as EmptySetT, f as ExpressionType, g as TypeClass, m as LogicT, t as AnyTypificationT, v as TypeID, y as TypePath } from "./typification-9lNu9R4k.js";
-import { i as RSErrorDescription, r as RSErrorCode } from "./error-CzIbnP-N.js";
-import { i as readTypeAnnotation, r as readErrorAnnotation } from "./ast-annotations-D6KZDu12.js";
+import { i as RSErrorDescription, r as RSErrorCode } from "./error-B0EkIx4K.js";
+import { i as readTypeAnnotation, r as readErrorAnnotation } from "./ast-annotations-CiIx8qBM.js";
 import { d as ValuePath, l as Value, o as TUPLE_ID, p as makeValuePath } from "./value-BduA_ZGp.js";
-import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "./calculator-k8BGIKmj.js";
+import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "./calculator-DE89LtIM.js";
 import { d as printValue } from "./value-api-CXLl_zg0.js";
 import { t as parser } from "./parser-Bwd8LxJ1.js";
 import { t as TokenID } from "./token-DeXAmzwr.js";
 import { t as ValueClass } from "./value-class-CNI-lqXJ.js";
-import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "./analyzer-iqAXyROE.js";
+import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "./analyzer-fNhkwO-6.js";
 import { n as ArgumentsType } from "./arguments-extractor-ngatANBI.js";
 import { n as applyAsciiTypeSubstitutions, r as parseTypeText } from "./typification-parser-Dytsv9CI.js";
 import { n as TypificationNodeData, t as TypificationGraph } from "./typification-graph-BY_oGT82.js";
 import { a as LibraryItemType, i as LibraryItemReference, n as CurrentVersion, o as LocationHead, r as LibraryItem, s as VersionInfo, t as AccessPolicy } from "./library-CYun28Xz.js";
-import { C as RSFormStats, S as RSForm, T as TypeInfo, _ as Attribution, a as detectDependencyCycleDiagnostics, b as CstStatus, c as modelStatusCstDiagnostic, d as DEFAULT_VALUE_TEXT, f as EvalStatus, g as ArgumentValue, i as assignSchemaDiagnostics, l as BasicBinding, m as RSModelStats, n as DiagnosticKind, o as formatDependencyCycle, p as RSModel, r as RSDiagnosticCode, s as hasCstDiagnostic, t as CstDiagnostic, u as BasicsContext, v as Constituenta, w as Substitution, x as CstType, y as CstClass } from "./diagnostics-Dtzgj5Q9.js";
+import { C as RSFormStats, S as RSForm, T as TypeInfo, _ as Attribution, a as detectDependencyCycleDiagnostics, b as CstStatus, c as modelStatusCstDiagnostic, d as DEFAULT_VALUE_TEXT, f as EvalStatus, g as ArgumentValue, i as assignSchemaDiagnostics, l as BasicBinding, m as RSModelStats, n as DiagnosticKind, o as formatDependencyCycle, p as RSModel, r as RSDiagnosticCode, s as hasCstDiagnostic, t as CstDiagnostic, u as BasicsContext, v as Constituenta, w as Substitution, x as CstType, y as CstClass } from "./diagnostics-EaIt3zIw.js";
 import { FolderNode, FolderTree } from "./library/folder-tree.js";
 import { n as OssLayout, r as Position2D } from "./oss-layout-3glgAqfn.js";
 import { Block, CstSubstituteInfo, NodeType, Operation, OperationInput, OperationSchema, OperationSchemaStats, OperationSynthesis, OperationType, OssItem, SubstitutionErrorDescription, SubstitutionErrorType } from "./library/oss.js";

package/dist/index.js

@@ -15,7 +15,7 @@ import { RSLangAnalyzer } from "./rslang/semantic/analyzer.js";
 import { applyAsciiTypeSubstitutions, parseTypeText } from "./rslang/semantic/typification-parser.js";
 import { TypificationGraph } from "./rslang/typification-graph.js";
 import { CstClass, CstStatus, CstType } from "./library/rsform.js";
-import { a as formatDependencyCycle, i as detectDependencyCycleDiagnostics, n as RSDiagnosticCode, o as hasCstDiagnostic, r as assignSchemaDiagnostics, s as modelStatusCstDiagnostic, t as DiagnosticKind } from "./diagnostics-BSryP66e.js";
+import { a as formatDependencyCycle, i as detectDependencyCycleDiagnostics, n as RSDiagnosticCode, o as hasCstDiagnostic, r as assignSchemaDiagnostics, s as modelStatusCstDiagnostic, t as DiagnosticKind } from "./diagnostics-CY9sKggB.js";
 import { DEFAULT_VALUE_TEXT, EvalStatus } from "./library/rsmodel.js";
 import { FolderNode, FolderTree } from "./library/folder-tree.js";
 import { AccessPolicy, LibraryItemType, LocationHead } from "./library/library.js";

package/dist/library/diagnostics.d.ts

@@ -1,2 +1,2 @@
-import { a as detectDependencyCycleDiagnostics, c as modelStatusCstDiagnostic, i as assignSchemaDiagnostics, n as DiagnosticKind, o as formatDependencyCycle, r as RSDiagnosticCode, s as hasCstDiagnostic, t as CstDiagnostic } from "../diagnostics-Dtzgj5Q9.js";
+import { a as detectDependencyCycleDiagnostics, c as modelStatusCstDiagnostic, i as assignSchemaDiagnostics, n as DiagnosticKind, o as formatDependencyCycle, r as RSDiagnosticCode, s as hasCstDiagnostic, t as CstDiagnostic } from "../diagnostics-EaIt3zIw.js";
 export { CstDiagnostic, DiagnosticKind, RSDiagnosticCode, assignSchemaDiagnostics, detectDependencyCycleDiagnostics, formatDependencyCycle, hasCstDiagnostic, modelStatusCstDiagnostic };

package/dist/library/diagnostics.js

@@ -1,2 +1,2 @@
-import { a as formatDependencyCycle, i as detectDependencyCycleDiagnostics, n as RSDiagnosticCode, o as hasCstDiagnostic, r as assignSchemaDiagnostics, s as modelStatusCstDiagnostic, t as DiagnosticKind } from "../diagnostics-BSryP66e.js";
+import { a as formatDependencyCycle, i as detectDependencyCycleDiagnostics, n as RSDiagnosticCode, o as hasCstDiagnostic, r as assignSchemaDiagnostics, s as modelStatusCstDiagnostic, t as DiagnosticKind } from "../diagnostics-CY9sKggB.js";
 export { DiagnosticKind, RSDiagnosticCode, assignSchemaDiagnostics, detectDependencyCycleDiagnostics, formatDependencyCycle, hasCstDiagnostic, modelStatusCstDiagnostic };

package/dist/library/index.d.ts

@@ -1,5 +1,5 @@
 import { a as LibraryItemType, i as LibraryItemReference, n as CurrentVersion, o as LocationHead, r as LibraryItem, s as VersionInfo, t as AccessPolicy } from "../library-CYun28Xz.js";
-import { C as RSFormStats, S as RSForm, T as TypeInfo, _ as Attribution, a as detectDependencyCycleDiagnostics, b as CstStatus, c as modelStatusCstDiagnostic, d as DEFAULT_VALUE_TEXT, f as EvalStatus, g as ArgumentValue, i as assignSchemaDiagnostics, l as BasicBinding, m as RSModelStats, n as DiagnosticKind, o as formatDependencyCycle, p as RSModel, r as RSDiagnosticCode, s as hasCstDiagnostic, t as CstDiagnostic, u as BasicsContext, v as Constituenta, w as Substitution, x as CstType, y as CstClass } from "../diagnostics-Dtzgj5Q9.js";
+import { C as RSFormStats, S as RSForm, T as TypeInfo, _ as Attribution, a as detectDependencyCycleDiagnostics, b as CstStatus, c as modelStatusCstDiagnostic, d as DEFAULT_VALUE_TEXT, f as EvalStatus, g as ArgumentValue, i as assignSchemaDiagnostics, l as BasicBinding, m as RSModelStats, n as DiagnosticKind, o as formatDependencyCycle, p as RSModel, r as RSDiagnosticCode, s as hasCstDiagnostic, t as CstDiagnostic, u as BasicsContext, v as Constituenta, w as Substitution, x as CstType, y as CstClass } from "../diagnostics-EaIt3zIw.js";
 import { FolderNode, FolderTree } from "./folder-tree.js";
 import { n as OssLayout, r as Position2D } from "../oss-layout-3glgAqfn.js";
 import { Block, CstSubstituteInfo, NodeType, Operation, OperationInput, OperationSchema, OperationSchemaStats, OperationSynthesis, OperationType, OssItem, SubstitutionErrorDescription, SubstitutionErrorType } from "./oss.js";

package/dist/library/index.js

@@ -5,7 +5,7 @@ import { TypeID } from "../rslang/semantic/typification.js";
 import { labelType } from "../rslang/labels.js";
 import { applyAliasMapping, isGlobalAlias, parseRSLangExpression, splitTemplateDefinition, substituteLocalAliases, substituteTemplateArgs } from "../rslang/api.js";
 import { CstClass, CstStatus, CstType } from "./rsform.js";
-import { E as inferTemplatedType, N as normalizeExpression, _ as generateAlias, a as formatDependencyCycle, d as argumentValuesToMapping, i as detectDependencyCycleDiagnostics, k as isFunctional, n as RSDiagnosticCode, o as hasCstDiagnostic, r as assignSchemaDiagnostics, s as modelStatusCstDiagnostic, t as DiagnosticKind, u as applyMappingToConstituents } from "../diagnostics-BSryP66e.js";
+import { E as inferTemplatedType, N as normalizeExpression, _ as generateAlias, a as formatDependencyCycle, d as argumentValuesToMapping, i as detectDependencyCycleDiagnostics, k as isFunctional, n as RSDiagnosticCode, o as hasCstDiagnostic, r as assignSchemaDiagnostics, s as modelStatusCstDiagnostic, t as DiagnosticKind, u as applyMappingToConstituents } from "../diagnostics-CY9sKggB.js";
 import { DEFAULT_VALUE_TEXT, EvalStatus } from "./rsmodel.js";
 import { FolderNode, FolderTree } from "./folder-tree.js";
 import { AccessPolicy, LibraryItemType, LocationHead } from "./library.js";

package/dist/library/oss-api.d.ts

@@ -1,5 +1,5 @@
 import { r as LibraryItem } from "../library-CYun28Xz.js";
-import { S as RSForm, v as Constituenta, w as Substitution } from "../diagnostics-Dtzgj5Q9.js";
+import { S as RSForm, v as Constituenta, w as Substitution } from "../diagnostics-EaIt3zIw.js";
 import { NodeType, OperationSchema, SubstitutionErrorDescription } from "./oss.js";
 
 //#region src/library/oss-api.d.ts

package/dist/library/oss.d.ts

@@ -1,4 +1,4 @@
-import { t as Graph } from "../graph-DPOvglEm.js";
+import { t as Graph } from "../graph-CL73WdW1.js";
 import { r as LibraryItem } from "../library-CYun28Xz.js";
 import { n as OssLayout, t as NodePosition } from "../oss-layout-3glgAqfn.js";
 

package/dist/library/rsengine.d.ts

@@ -1,7 +1,7 @@
 import { t as AstNode } from "../ast-C8sIpKdL.js";
 import { l as Value } from "../value-BduA_ZGp.js";
-import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-k8BGIKmj.js";
-import { S as RSForm, f as EvalStatus, l as BasicBinding, p as RSModel, u as BasicsContext, x as CstType } from "../diagnostics-Dtzgj5Q9.js";
+import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-DE89LtIM.js";
+import { S as RSForm, f as EvalStatus, l as BasicBinding, p as RSModel, u as BasicsContext, x as CstType } from "../diagnostics-EaIt3zIw.js";
 
 //#region src/library/rsengine.d.ts
 /** Services for {@link RSEngine}. */

package/dist/library/rsengine.js

@@ -4,7 +4,7 @@ import { l as compare } from "../value-COprb2Je.js";
 import { RSCalculator } from "../rslang/eval/calculator.js";
 import "../rslang/index.js";
 import { CstType } from "./rsform.js";
-import { D as isBaseSet, O as isBasicConcept, k as isFunctional, v as getAnalysisFor } from "../diagnostics-BSryP66e.js";
+import { D as isBaseSet, O as isBasicConcept, k as isFunctional, v as getAnalysisFor } from "../diagnostics-CY9sKggB.js";
 import { TYPE_BASIC } from "./rsmodel.js";
 import { inferEvalStatus, isInferrable, tryFixValue } from "./rsmodel-api.js";
 //#region src/library/rsengine.ts

package/dist/library/rsform-api.d.ts

@@ -1,9 +1,9 @@
 import { t as AstNode } from "../ast-C8sIpKdL.js";
 import { g as TypeClass, y as TypePath } from "../typification-9lNu9R4k.js";
 import { t as ValueClass } from "../value-class-CNI-lqXJ.js";
-import { r as AnalysisFull } from "../analyzer-iqAXyROE.js";
+import { r as AnalysisFull } from "../analyzer-fNhkwO-6.js";
 import { r as LibraryItem } from "../library-CYun28Xz.js";
-import { C as RSFormStats, S as RSForm, b as CstStatus, g as ArgumentValue, v as Constituenta, x as CstType, y as CstClass } from "../diagnostics-Dtzgj5Q9.js";
+import { C as RSFormStats, S as RSForm, b as CstStatus, g as ArgumentValue, v as Constituenta, x as CstType, y as CstClass } from "../diagnostics-EaIt3zIw.js";
 import { AliasMapping } from "../rslang/api.js";
 
 //#region src/library/rsform-api.d.ts
@@ -80,7 +80,6 @@ declare function addAliasReference(expression: string, alias: string): string;
 declare function typeClassForCstType(cstType: CstType): TypeClass;
 /** Checks whether a constituenta type supports formal definitions. */
 declare function canHaveFormalDefinition(cstType: CstType): boolean;
-/** Analyze expression for {@link RSForm}. */
 declare function getAnalysisFor(expression: string, cstType: CstType, schema: RSForm, alias?: string): AnalysisFull;
 /**
  * When an untyped / bare F·P reference names a constituent on a definition cycle with the

package/dist/library/rsform-api.js

@@ -1,2 +1,2 @@
-import { A as isLogical, C as inferNewSpawnPosition, D as isBaseSet, E as inferTemplatedType, F as removeAliasReference, I as sortItemsForInlineSynthesis, L as typeClassForCstType, M as isTemplateCst, N as normalizeExpression, O as isBasicConcept, P as refineAnalysisForDependencyCycles, R as validateAliasFormat, S as inferClass, T as inferTemplate, _ as generateAlias, b as getStructureName, c as addAliasReference, d as argumentValuesToMapping, f as calculateSchemaStats, g as findCstByStructure, h as canProduceStructure, j as isSchemaIssue, k as isFunctional, l as applyFilterCategory, m as canHaveManualTypification, p as canHaveFormalDefinition, u as applyMappingToConstituents, v as getAnalysisFor, w as inferStatus, x as guessCstType, y as getCstTypePrefix, z as validateNewAlias } from "../diagnostics-BSryP66e.js";
+import { A as isLogical, C as inferNewSpawnPosition, D as isBaseSet, E as inferTemplatedType, F as removeAliasReference, I as sortItemsForInlineSynthesis, L as typeClassForCstType, M as isTemplateCst, N as normalizeExpression, O as isBasicConcept, P as refineAnalysisForDependencyCycles, R as validateAliasFormat, S as inferClass, T as inferTemplate, _ as generateAlias, b as getStructureName, c as addAliasReference, d as argumentValuesToMapping, f as calculateSchemaStats, g as findCstByStructure, h as canProduceStructure, j as isSchemaIssue, k as isFunctional, l as applyFilterCategory, m as canHaveManualTypification, p as canHaveFormalDefinition, u as applyMappingToConstituents, v as getAnalysisFor, w as inferStatus, x as guessCstType, y as getCstTypePrefix, z as validateNewAlias } from "../diagnostics-CY9sKggB.js";
 export { addAliasReference, applyFilterCategory, applyMappingToConstituents, argumentValuesToMapping, calculateSchemaStats, canHaveFormalDefinition, canHaveManualTypification, canProduceStructure, findCstByStructure, generateAlias, getAnalysisFor, getCstTypePrefix, getStructureName, guessCstType, inferClass, inferNewSpawnPosition, inferStatus, inferTemplate, inferTemplatedType, isBaseSet, isBasicConcept, isFunctional, isLogical, isSchemaIssue, isTemplateCst, normalizeExpression, refineAnalysisForDependencyCycles, removeAliasReference, sortItemsForInlineSynthesis, typeClassForCstType, validateAliasFormat, validateNewAlias };

package/dist/library/rsform.d.ts

@@ -1,2 +1,2 @@
-import { C as RSFormStats, S as RSForm, T as TypeInfo, _ as Attribution, b as CstStatus, g as ArgumentValue, v as Constituenta, w as Substitution, x as CstType, y as CstClass } from "../diagnostics-Dtzgj5Q9.js";
+import { C as RSFormStats, S as RSForm, T as TypeInfo, _ as Attribution, b as CstStatus, g as ArgumentValue, v as Constituenta, w as Substitution, x as CstType, y as CstClass } from "../diagnostics-EaIt3zIw.js";
 export { ArgumentValue, Attribution, Constituenta, CstClass, CstStatus, CstType, RSForm, RSFormStats, Substitution, TypeInfo };

package/dist/library/rsmodel-api.d.ts

@@ -1,6 +1,6 @@
 import { b as Typification, f as ExpressionType } from "../typification-9lNu9R4k.js";
 import { d as ValuePath, l as Value } from "../value-BduA_ZGp.js";
-import { S as RSForm, f as EvalStatus, l as BasicBinding, m as RSModelStats, v as Constituenta, x as CstType } from "../diagnostics-Dtzgj5Q9.js";
+import { S as RSForm, f as EvalStatus, l as BasicBinding, m as RSModelStats, v as Constituenta, x as CstType } from "../diagnostics-EaIt3zIw.js";
 import { RSEngine } from "./rsengine.js";
 
 //#region src/library/rsmodel-api.d.ts

package/dist/library/rsmodel-api.js

@@ -2,7 +2,7 @@ import { TypeID } from "../rslang/semantic/typification.js";
 import { O as setNestedValue, _ as extractValue, b as isTupleValue, f as tuple, l as compare, x as makeDefaultValue } from "../value-COprb2Je.js";
 import "../rslang/index.js";
 import { CstType } from "./rsform.js";
-import { D as isBaseSet, O as isBasicConcept, f as calculateSchemaStats, s as modelStatusCstDiagnostic } from "../diagnostics-BSryP66e.js";
+import { D as isBaseSet, O as isBasicConcept, f as calculateSchemaStats, s as modelStatusCstDiagnostic } from "../diagnostics-CY9sKggB.js";
 import { EvalStatus } from "./rsmodel.js";
 //#region src/library/rsmodel-api.ts
 const RANDOM_INTEGER_MIN = -100;

package/dist/library/rsmodel.d.ts

@@ -1,2 +1,2 @@
-import { d as DEFAULT_VALUE_TEXT, f as EvalStatus, h as TYPE_BASIC, l as BasicBinding, m as RSModelStats, p as RSModel, u as BasicsContext } from "../diagnostics-Dtzgj5Q9.js";
+import { d as DEFAULT_VALUE_TEXT, f as EvalStatus, h as TYPE_BASIC, l as BasicBinding, m as RSModelStats, p as RSModel, u as BasicsContext } from "../diagnostics-EaIt3zIw.js";
 export { BasicBinding, BasicsContext, DEFAULT_VALUE_TEXT, EvalStatus, RSModel, RSModelStats, TYPE_BASIC };

package/dist/library/structure-planner.d.ts

@@ -1,5 +1,5 @@
 import { b as Typification, y as TypePath } from "../typification-9lNu9R4k.js";
-import { S as RSForm, v as Constituenta } from "../diagnostics-Dtzgj5Q9.js";
+import { S as RSForm, v as Constituenta } from "../diagnostics-EaIt3zIw.js";
 
 //#region src/library/structure-planner.d.ts
 /** Represents a node in the structure planner. */

package/dist/library/structure-planner.js

@@ -3,7 +3,7 @@ import { labelType } from "../rslang/labels.js";
 import { splitTemplateDefinition } from "../rslang/api.js";
 import "../rslang/index.js";
 import { CstType } from "./rsform.js";
-import { g as findCstByStructure } from "../diagnostics-BSryP66e.js";
+import { g as findCstByStructure } from "../diagnostics-CY9sKggB.js";
 //#region src/library/structure-planner.ts
 /** Structure planner for {@link Constituenta}. */
 var StructurePlanner = class {

package/dist/rslang/ast-annotations.d.ts

@@ -1,2 +1,2 @@
-import { i as readTypeAnnotation, n as annotateType, r as readErrorAnnotation, t as annotateError } from "../ast-annotations-D6KZDu12.js";
+import { i as readTypeAnnotation, n as annotateType, r as readErrorAnnotation, t as annotateError } from "../ast-annotations-CiIx8qBM.js";
 export { annotateError, annotateType, readErrorAnnotation, readTypeAnnotation };

package/dist/rslang/error.d.ts

@@ -1,2 +1,2 @@
-import { a as RSErrorInfo, i as RSErrorDescription, n as RSErrorClass, o as getRSErrorPrefix, r as RSErrorCode, s as isCritical, t as ErrorReporter } from "../error-CzIbnP-N.js";
+import { a as RSErrorInfo, i as RSErrorDescription, n as RSErrorClass, o as getRSErrorPrefix, r as RSErrorCode, s as isCritical, t as ErrorReporter } from "../error-B0EkIx4K.js";
 export { ErrorReporter, RSErrorClass, RSErrorCode, RSErrorDescription, RSErrorInfo, getRSErrorPrefix, isCritical };

package/dist/rslang/error.js

@@ -84,7 +84,8 @@ const RSErrorCode = {
 	calculationNotSupported: 33031,
 	calcInvalidData: 33032,
 	cstEmptyDerived: 34913,
-	definitionNotAllowed: 34914
+	definitionNotAllowed: 34914,
+	schemaDependencyCycle: 35078
 };
 const ERROR_EVALUATION_MASK = 256;
 const ERROR_LEXER_MASK = 512;

package/dist/rslang/error.js.map

@@ -1 +1 @@
-{"version":3,"file":"error.js","names":[],"sources":["../../src/rslang/error.ts"],"sourcesContent":["/** Module: Error types and functions. */\n\n/** Represents error class. */\nexport const RSErrorClass = {\n  LEXER: 0,\n  PARSER: 1,\n  SEMANTIC: 2,\n  EVALUATION: 3,\n  UNKNOWN: 4\n} as const;\nexport type RSErrorClass = (typeof RSErrorClass)[keyof typeof RSErrorClass];\n\n/** Represents RSLang expression error information. */\nexport interface RSErrorInfo {\n  code: RSErrorCode;\n  params?: readonly string[];\n}\n\n/** Represents RSLang expression error description. */\nexport interface RSErrorDescription extends RSErrorInfo {\n  from: number;\n  to: number;\n}\n\n/** Error reporter function type. */\nexport type ErrorReporter = (error: RSErrorDescription) => void;\n\n/** Represents RSLang expression error types. */\nexport const RSErrorCode = {\n  unknownSyntax: 0x8400, // 33792\n  forbiddenCharacter: 0x8401, // 33793\n  bracketMismatch: 0x8409, // 33801\n  doubleParenthesis: 0x840a, // 33802\n  missingOpenBracket: 0x840b, // 33803\n  missingCloseBracket: 0x840c, // 33804\n  invalidFilterSyntax: 0x8417, // 33815\n  expectedFunctionBody: 0x8418, // 33816\n  expectedExpressionBody: 0x8419, // 33817\n  expectedLogicBody: 0x841a, // 33818\n  expectedQuantifierBody: 0x841b, // 33819\n  expectedDeclarativeBody: 0x841c, // 33820\n  expectedImperativeBody: 0x841d, // 33821\n  expectedRecursiveBody: 0x841e, // 33822\n  expectedQuantifierDomain: 0x841f, // 33823\n  expectedRightOperand: 0x8420, // 33824\n  expectedUnaryOperand: 0x8421, // 33825\n  globalFuncParenCall: 0x8422, // 33826\n  expectedArgument: 0x8423, // 33827\n  expectedLocal: 0x8415, // 33813\n  expectedType: 0x8416, // 33814\n\n  localNotUsed: 0x2802, // 10242\n\n  localUndeclared: 0x8801, // 34817\n  localShadowing: 0x8802, // 34818\n  localDoubleDeclare: 0x8803, // 34819\n\n  typesNotEqual: 0x880a, // 34826\n  globalNotTyped: 0x8804, // 34820\n  invalidDecart: 0x8805, // 34821\n  invalidBoolean: 0x8806, // 34822\n  invalidTypeOperation: 0x8807, // 34823\n  invalidCard: 0x8808, // 34824\n  invalidDebool: 0x8809, // 34825\n  globalFuncWithoutArgs: 0x880b, // 34827\n  invalidReduce: 0x8810, // 34832\n  invalidEnumeration: 0x8813, // 34835\n  projectionSetArgumentNotSet: 0x8830, // 34864\n  projectionSetArgumentNotTupleSet: 0x8831, // 34865\n  projectionSetIndexOutOfRange: 0x8832, // 34866\n  projectionTupleArgumentNotTuple: 0x8833, // 34867\n  projectionTupleIndexOutOfRange: 0x8834, // 34868\n  invalidCortegeDeclare: 0x8814, // 34836\n  localOutOfScope: 0x8815, // 34837\n  invalidElementPredicate: 0x8816, // 34838\n  invalidEmptySetUsage: 0x8817, // 34839\n  invalidArgsArity: 0x8818, // 34840\n  invalidArgumentType: 0x8819, // 34841\n  globalStructure: 0x881c, // 34844\n  radicalUsage: 0x8821, // 34849\n  invalidFilterArgumentType: 0x8822, // 34850\n  invalidFilterArity: 0x8823, // 34851\n  arithmeticNotSupported: 0x8824, // 34852\n  typesNotCompatible: 0x8825, // 34853\n  orderingNotSupported: 0x8826, // 34854\n  expectedLogic: 0x8827, // 34855\n  expectedSetexpr: 0x8828, // 34856\n  invalidArgumentCortegeDeclare: 0x8829, // 34857\n  invalidQuantifierDomain: 0x882a, // 34858\n  invalidFilterParameterType: 0x882b, // 34859\n  invalidFilterIndex: 0x882c, // 34860\n  invalidFilterBooleanEchelon: 0x882d, // 34861\n  localOutOfScopeParentheses: 0x882e, // 34862\n  localUndeclaredInSubexpr: 0x882f, // 34863\n\n  globalNoValue: 0x8840, // 34880\n  invalidPropertyUsage: 0x8841, // 34881\n\n  // Value evaluation (runtime)\n  calcUnknownError: 0x8100, // 35328\n  setOverflow: 0x8101, // 35329\n  booleanBaseLimit: 0x8102, // 35330\n  calcGlobalMissing: 0x8103, // 35331\n  iterationsLimit: 0x8104, // 35332\n  calcInvalidDebool: 0x8105, // 35333\n  iterateInfinity: 0x8106, // 35334\n  calculationNotSupported: 0x8107, // 35335\n  calcInvalidData: 0x8108, // 35336\n\n  cstEmptyDerived: 0x8861, // 34913\n  definitionNotAllowed: 0x8862 // 34914\n} as const;\nexport type RSErrorCode = (typeof RSErrorCode)[keyof typeof RSErrorCode];\n\nconst ERROR_EVALUATION_MASK = 0x0100;\nconst ERROR_LEXER_MASK = 0x0200;\nconst ERROR_PARSER_MASK = 0x0400;\nconst ERROR_SEMANTIC_MASK = 0x0800;\n\n/** Infers error class from error type (code). */\nfunction inferErrorClass(error: RSErrorCode): RSErrorClass {\n  if ((error & ERROR_EVALUATION_MASK) !== 0) {\n    return RSErrorClass.EVALUATION;\n  } else if ((error & ERROR_LEXER_MASK) !== 0) {\n    return RSErrorClass.LEXER;\n  } else if ((error & ERROR_PARSER_MASK) !== 0) {\n    return RSErrorClass.PARSER;\n  } else if ((error & ERROR_SEMANTIC_MASK) !== 0) {\n    return RSErrorClass.SEMANTIC;\n  } else {\n    return RSErrorClass.UNKNOWN;\n  }\n}\n\n/** Generate ErrorID label. */\nexport function getRSErrorPrefix(code: RSErrorCode): string {\n  const id = code.toString(16).toUpperCase();\n  // prettier-ignore\n  switch (inferErrorClass(code)) {\n    case RSErrorClass.LEXER: return 'L' + id;\n    case RSErrorClass.PARSER: return 'P' + id;\n    case RSErrorClass.SEMANTIC: return 'S' + id;\n    case RSErrorClass.EVALUATION: return 'E' + id;\n    case RSErrorClass.UNKNOWN: return 'U' + id;\n  }\n}\n\n/** Checks if error is critical. */\nexport function isCritical(code: RSErrorCode): boolean {\n  if ((code & 0xf000) === 0x2000) {\n    return false;\n  }\n  return true;\n}\n"],"mappings":";;;AAGA,MAAa,eAAe;CAC1B,OAAO;CACP,QAAQ;CACR,UAAU;CACV,YAAY;CACZ,SAAS;AACX;;AAmBA,MAAa,cAAc;CACzB,eAAe;CACf,oBAAoB;CACpB,iBAAiB;CACjB,mBAAmB;CACnB,oBAAoB;CACpB,qBAAqB;CACrB,qBAAqB;CACrB,sBAAsB;CACtB,wBAAwB;CACxB,mBAAmB;CACnB,wBAAwB;CACxB,yBAAyB;CACzB,wBAAwB;CACxB,uBAAuB;CACvB,0BAA0B;CAC1B,sBAAsB;CACtB,sBAAsB;CACtB,qBAAqB;CACrB,kBAAkB;CAClB,eAAe;CACf,cAAc;CAEd,cAAc;CAEd,iBAAiB;CACjB,gBAAgB;CAChB,oBAAoB;CAEpB,eAAe;CACf,gBAAgB;CAChB,eAAe;CACf,gBAAgB;CAChB,sBAAsB;CACtB,aAAa;CACb,eAAe;CACf,uBAAuB;CACvB,eAAe;CACf,oBAAoB;CACpB,6BAA6B;CAC7B,kCAAkC;CAClC,8BAA8B;CAC9B,iCAAiC;CACjC,gCAAgC;CAChC,uBAAuB;CACvB,iBAAiB;CACjB,yBAAyB;CACzB,sBAAsB;CACtB,kBAAkB;CAClB,qBAAqB;CACrB,iBAAiB;CACjB,cAAc;CACd,2BAA2B;CAC3B,oBAAoB;CACpB,wBAAwB;CACxB,oBAAoB;CACpB,sBAAsB;CACtB,eAAe;CACf,iBAAiB;CACjB,+BAA+B;CAC/B,yBAAyB;CACzB,4BAA4B;CAC5B,oBAAoB;CACpB,6BAA6B;CAC7B,4BAA4B;CAC5B,0BAA0B;CAE1B,eAAe;CACf,sBAAsB;CAGtB,kBAAkB;CAClB,aAAa;CACb,kBAAkB;CAClB,mBAAmB;CACnB,iBAAiB;CACjB,mBAAmB;CACnB,iBAAiB;CACjB,yBAAyB;CACzB,iBAAiB;CAEjB,iBAAiB;CACjB,sBAAsB;AACxB;AAGA,MAAM,wBAAwB;AAC9B,MAAM,mBAAmB;AACzB,MAAM,oBAAoB;AAC1B,MAAM,sBAAsB;;AAG5B,SAAS,gBAAgB,OAAkC;CACzD,KAAK,QAAQ,2BAA2B,GACtC,OAAO,aAAa;MACf,KAAK,QAAQ,sBAAsB,GACxC,OAAO,aAAa;MACf,KAAK,QAAQ,uBAAuB,GACzC,OAAO,aAAa;MACf,KAAK,QAAQ,yBAAyB,GAC3C,OAAO,aAAa;MAEpB,OAAO,aAAa;AAExB;;AAGA,SAAgB,iBAAiB,MAA2B;CAC1D,MAAM,KAAK,KAAK,SAAS,EAAE,CAAC,CAAC,YAAY;CAEzC,QAAQ,gBAAgB,IAAI,GAA5B;EACE,KAAK,aAAa,OAAO,OAAO,MAAM;EACtC,KAAK,aAAa,QAAQ,OAAO,MAAM;EACvC,KAAK,aAAa,UAAU,OAAO,MAAM;EACzC,KAAK,aAAa,YAAY,OAAO,MAAM;EAC3C,KAAK,aAAa,SAAS,OAAO,MAAM;CAC1C;AACF;;AAGA,SAAgB,WAAW,MAA4B;CACrD,KAAK,OAAO,WAAY,MACtB,OAAO;CAET,OAAO;AACT"}
+{"version":3,"file":"error.js","names":[],"sources":["../../src/rslang/error.ts"],"sourcesContent":["/** Module: Error types and functions. */\n\n/** Represents error class. */\nexport const RSErrorClass = {\n  LEXER: 0,\n  PARSER: 1,\n  SEMANTIC: 2,\n  EVALUATION: 3,\n  UNKNOWN: 4\n} as const;\nexport type RSErrorClass = (typeof RSErrorClass)[keyof typeof RSErrorClass];\n\n/** Represents RSLang expression error information. */\nexport interface RSErrorInfo {\n  code: RSErrorCode;\n  params?: readonly string[];\n}\n\n/** Represents RSLang expression error description. */\nexport interface RSErrorDescription extends RSErrorInfo {\n  from: number;\n  to: number;\n}\n\n/** Error reporter function type. */\nexport type ErrorReporter = (error: RSErrorDescription) => void;\n\n/** Represents RSLang expression error types. */\nexport const RSErrorCode = {\n  unknownSyntax: 0x8400, // 33792\n  forbiddenCharacter: 0x8401, // 33793\n  bracketMismatch: 0x8409, // 33801\n  doubleParenthesis: 0x840a, // 33802\n  missingOpenBracket: 0x840b, // 33803\n  missingCloseBracket: 0x840c, // 33804\n  invalidFilterSyntax: 0x8417, // 33815\n  expectedFunctionBody: 0x8418, // 33816\n  expectedExpressionBody: 0x8419, // 33817\n  expectedLogicBody: 0x841a, // 33818\n  expectedQuantifierBody: 0x841b, // 33819\n  expectedDeclarativeBody: 0x841c, // 33820\n  expectedImperativeBody: 0x841d, // 33821\n  expectedRecursiveBody: 0x841e, // 33822\n  expectedQuantifierDomain: 0x841f, // 33823\n  expectedRightOperand: 0x8420, // 33824\n  expectedUnaryOperand: 0x8421, // 33825\n  globalFuncParenCall: 0x8422, // 33826\n  expectedArgument: 0x8423, // 33827\n  expectedLocal: 0x8415, // 33813\n  expectedType: 0x8416, // 33814\n\n  localNotUsed: 0x2802, // 10242\n\n  localUndeclared: 0x8801, // 34817\n  localShadowing: 0x8802, // 34818\n  localDoubleDeclare: 0x8803, // 34819\n\n  typesNotEqual: 0x880a, // 34826\n  globalNotTyped: 0x8804, // 34820\n  invalidDecart: 0x8805, // 34821\n  invalidBoolean: 0x8806, // 34822\n  invalidTypeOperation: 0x8807, // 34823\n  invalidCard: 0x8808, // 34824\n  invalidDebool: 0x8809, // 34825\n  globalFuncWithoutArgs: 0x880b, // 34827\n  invalidReduce: 0x8810, // 34832\n  invalidEnumeration: 0x8813, // 34835\n  projectionSetArgumentNotSet: 0x8830, // 34864\n  projectionSetArgumentNotTupleSet: 0x8831, // 34865\n  projectionSetIndexOutOfRange: 0x8832, // 34866\n  projectionTupleArgumentNotTuple: 0x8833, // 34867\n  projectionTupleIndexOutOfRange: 0x8834, // 34868\n  invalidCortegeDeclare: 0x8814, // 34836\n  localOutOfScope: 0x8815, // 34837\n  invalidElementPredicate: 0x8816, // 34838\n  invalidEmptySetUsage: 0x8817, // 34839\n  invalidArgsArity: 0x8818, // 34840\n  invalidArgumentType: 0x8819, // 34841\n  globalStructure: 0x881c, // 34844\n  radicalUsage: 0x8821, // 34849\n  invalidFilterArgumentType: 0x8822, // 34850\n  invalidFilterArity: 0x8823, // 34851\n  arithmeticNotSupported: 0x8824, // 34852\n  typesNotCompatible: 0x8825, // 34853\n  orderingNotSupported: 0x8826, // 34854\n  expectedLogic: 0x8827, // 34855\n  expectedSetexpr: 0x8828, // 34856\n  invalidArgumentCortegeDeclare: 0x8829, // 34857\n  invalidQuantifierDomain: 0x882a, // 34858\n  invalidFilterParameterType: 0x882b, // 34859\n  invalidFilterIndex: 0x882c, // 34860\n  invalidFilterBooleanEchelon: 0x882d, // 34861\n  localOutOfScopeParentheses: 0x882e, // 34862\n  localUndeclaredInSubexpr: 0x882f, // 34863\n\n  globalNoValue: 0x8840, // 34880\n  invalidPropertyUsage: 0x8841, // 34881\n\n  // Value evaluation (runtime)\n  calcUnknownError: 0x8100, // 35328\n  setOverflow: 0x8101, // 35329\n  booleanBaseLimit: 0x8102, // 35330\n  calcGlobalMissing: 0x8103, // 35331\n  iterationsLimit: 0x8104, // 35332\n  calcInvalidDebool: 0x8105, // 35333\n  iterateInfinity: 0x8106, // 35334\n  calculationNotSupported: 0x8107, // 35335\n  calcInvalidData: 0x8108, // 35336\n\n  cstEmptyDerived: 0x8861, // 34913\n  definitionNotAllowed: 0x8862, // 34914\n\n  // Schema diagnostics surfaced in expression analysis (same value as RSDiagnosticCode.schemaDependencyCycle).\n  schemaDependencyCycle: 0x8906 // 35078\n} as const;\nexport type RSErrorCode = (typeof RSErrorCode)[keyof typeof RSErrorCode];\n\nconst ERROR_EVALUATION_MASK = 0x0100;\nconst ERROR_LEXER_MASK = 0x0200;\nconst ERROR_PARSER_MASK = 0x0400;\nconst ERROR_SEMANTIC_MASK = 0x0800;\n\n/** Infers error class from error type (code). */\nfunction inferErrorClass(error: RSErrorCode): RSErrorClass {\n  if ((error & ERROR_EVALUATION_MASK) !== 0) {\n    return RSErrorClass.EVALUATION;\n  } else if ((error & ERROR_LEXER_MASK) !== 0) {\n    return RSErrorClass.LEXER;\n  } else if ((error & ERROR_PARSER_MASK) !== 0) {\n    return RSErrorClass.PARSER;\n  } else if ((error & ERROR_SEMANTIC_MASK) !== 0) {\n    return RSErrorClass.SEMANTIC;\n  } else {\n    return RSErrorClass.UNKNOWN;\n  }\n}\n\n/** Generate ErrorID label. */\nexport function getRSErrorPrefix(code: RSErrorCode): string {\n  const id = code.toString(16).toUpperCase();\n  // prettier-ignore\n  switch (inferErrorClass(code)) {\n    case RSErrorClass.LEXER: return 'L' + id;\n    case RSErrorClass.PARSER: return 'P' + id;\n    case RSErrorClass.SEMANTIC: return 'S' + id;\n    case RSErrorClass.EVALUATION: return 'E' + id;\n    case RSErrorClass.UNKNOWN: return 'U' + id;\n  }\n}\n\n/** Checks if error is critical. */\nexport function isCritical(code: RSErrorCode): boolean {\n  if ((code & 0xf000) === 0x2000) {\n    return false;\n  }\n  return true;\n}\n"],"mappings":";;;AAGA,MAAa,eAAe;CAC1B,OAAO;CACP,QAAQ;CACR,UAAU;CACV,YAAY;CACZ,SAAS;AACX;;AAmBA,MAAa,cAAc;CACzB,eAAe;CACf,oBAAoB;CACpB,iBAAiB;CACjB,mBAAmB;CACnB,oBAAoB;CACpB,qBAAqB;CACrB,qBAAqB;CACrB,sBAAsB;CACtB,wBAAwB;CACxB,mBAAmB;CACnB,wBAAwB;CACxB,yBAAyB;CACzB,wBAAwB;CACxB,uBAAuB;CACvB,0BAA0B;CAC1B,sBAAsB;CACtB,sBAAsB;CACtB,qBAAqB;CACrB,kBAAkB;CAClB,eAAe;CACf,cAAc;CAEd,cAAc;CAEd,iBAAiB;CACjB,gBAAgB;CAChB,oBAAoB;CAEpB,eAAe;CACf,gBAAgB;CAChB,eAAe;CACf,gBAAgB;CAChB,sBAAsB;CACtB,aAAa;CACb,eAAe;CACf,uBAAuB;CACvB,eAAe;CACf,oBAAoB;CACpB,6BAA6B;CAC7B,kCAAkC;CAClC,8BAA8B;CAC9B,iCAAiC;CACjC,gCAAgC;CAChC,uBAAuB;CACvB,iBAAiB;CACjB,yBAAyB;CACzB,sBAAsB;CACtB,kBAAkB;CAClB,qBAAqB;CACrB,iBAAiB;CACjB,cAAc;CACd,2BAA2B;CAC3B,oBAAoB;CACpB,wBAAwB;CACxB,oBAAoB;CACpB,sBAAsB;CACtB,eAAe;CACf,iBAAiB;CACjB,+BAA+B;CAC/B,yBAAyB;CACzB,4BAA4B;CAC5B,oBAAoB;CACpB,6BAA6B;CAC7B,4BAA4B;CAC5B,0BAA0B;CAE1B,eAAe;CACf,sBAAsB;CAGtB,kBAAkB;CAClB,aAAa;CACb,kBAAkB;CAClB,mBAAmB;CACnB,iBAAiB;CACjB,mBAAmB;CACnB,iBAAiB;CACjB,yBAAyB;CACzB,iBAAiB;CAEjB,iBAAiB;CACjB,sBAAsB;CAGtB,uBAAuB;AACzB;AAGA,MAAM,wBAAwB;AAC9B,MAAM,mBAAmB;AACzB,MAAM,oBAAoB;AAC1B,MAAM,sBAAsB;;AAG5B,SAAS,gBAAgB,OAAkC;CACzD,KAAK,QAAQ,2BAA2B,GACtC,OAAO,aAAa;MACf,KAAK,QAAQ,sBAAsB,GACxC,OAAO,aAAa;MACf,KAAK,QAAQ,uBAAuB,GACzC,OAAO,aAAa;MACf,KAAK,QAAQ,yBAAyB,GAC3C,OAAO,aAAa;MAEpB,OAAO,aAAa;AAExB;;AAGA,SAAgB,iBAAiB,MAA2B;CAC1D,MAAM,KAAK,KAAK,SAAS,EAAE,CAAC,CAAC,YAAY;CAEzC,QAAQ,gBAAgB,IAAI,GAA5B;EACE,KAAK,aAAa,OAAO,OAAO,MAAM;EACtC,KAAK,aAAa,QAAQ,OAAO,MAAM;EACvC,KAAK,aAAa,UAAU,OAAO,MAAM;EACzC,KAAK,aAAa,YAAY,OAAO,MAAM;EAC3C,KAAK,aAAa,SAAS,OAAO,MAAM;CAC1C;AACF;;AAGA,SAAgB,WAAW,MAA4B;CACrD,KAAK,OAAO,WAAY,MACtB,OAAO;CAET,OAAO;AACT"}

package/dist/rslang/eval/calculator.d.ts

@@ -1,2 +1,2 @@
-import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../../calculator-k8BGIKmj.js";
+import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../../calculator-DE89LtIM.js";
 export { CalculatorEvaluateOptions, CalculatorResult, RSCalculator };

package/dist/rslang/eval/evaluator.d.ts

@@ -1,5 +1,5 @@
 import { t as AstNode } from "../../ast-C8sIpKdL.js";
-import { t as ErrorReporter } from "../../error-CzIbnP-N.js";
+import { t as ErrorReporter } from "../../error-B0EkIx4K.js";
 import { l as Value, u as ValueContext } from "../../value-BduA_ZGp.js";
 
 //#region src/rslang/eval/evaluator.d.ts

package/dist/rslang/index.d.ts

@@ -1,13 +1,13 @@
 import { A as makeTypePath, b as Typification, d as EmptySetT, f as ExpressionType, g as TypeClass, m as LogicT, t as AnyTypificationT, v as TypeID, y as TypePath } from "../typification-9lNu9R4k.js";
-import { i as RSErrorDescription, r as RSErrorCode } from "../error-CzIbnP-N.js";
-import { i as readTypeAnnotation, r as readErrorAnnotation } from "../ast-annotations-D6KZDu12.js";
+import { i as RSErrorDescription, r as RSErrorCode } from "../error-B0EkIx4K.js";
+import { i as readTypeAnnotation, r as readErrorAnnotation } from "../ast-annotations-CiIx8qBM.js";
 import { d as ValuePath, l as Value, p as makeValuePath } from "../value-BduA_ZGp.js";
-import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-k8BGIKmj.js";
+import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-DE89LtIM.js";
 import { d as printValue } from "../value-api-CXLl_zg0.js";
 import { t as parser } from "../parser-Bwd8LxJ1.js";
 import { t as TokenID } from "../token-DeXAmzwr.js";
 import { t as ValueClass } from "../value-class-CNI-lqXJ.js";
-import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "../analyzer-iqAXyROE.js";
+import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "../analyzer-fNhkwO-6.js";
 import { n as ArgumentsType } from "../arguments-extractor-ngatANBI.js";
 import { n as applyAsciiTypeSubstitutions, r as parseTypeText } from "../typification-parser-Dytsv9CI.js";
 import { n as TypificationNodeData, t as TypificationGraph } from "../typification-graph-BY_oGT82.js";

package/dist/rslang/parser/syntax-errors/index.d.ts

@@ -1,6 +1,6 @@
 import { t as AstNode } from "../../../ast-C8sIpKdL.js";
 import { g as TypeClass } from "../../../typification-9lNu9R4k.js";
-import { t as ErrorReporter } from "../../../error-CzIbnP-N.js";
+import { t as ErrorReporter } from "../../../error-B0EkIx4K.js";
 
 //#region src/rslang/parser/syntax-errors/index.d.ts
 /** When set, refines incomplete formal headers (`[α∈…]`, quantifiers). */

package/dist/rslang/semantic/analyzer.d.ts

@@ -1,2 +1,2 @@
-import { a as RSLangAnalyzer, i as AnalysisOptions, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "../../analyzer-iqAXyROE.js";
+import { a as RSLangAnalyzer, i as AnalysisOptions, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "../../analyzer-fNhkwO-6.js";
 export { AnalysisBase, AnalysisFast, AnalysisFull, AnalysisOptions, RSLangAnalyzer };

package/dist/rslang/semantic/type-auditor.d.ts

@@ -1,6 +1,6 @@
 import { t as AstNode } from "../../ast-C8sIpKdL.js";
 import { _ as TypeContext, f as ExpressionType } from "../../typification-9lNu9R4k.js";
-import { t as ErrorReporter } from "../../error-CzIbnP-N.js";
+import { t as ErrorReporter } from "../../error-B0EkIx4K.js";
 
 //#region src/rslang/semantic/type-auditor.d.ts
 /** Type auditor for AST type checking. */

package/dist/rslang/semantic/value-auditor.d.ts

@@ -1,5 +1,5 @@
 import { t as AstNode } from "../../ast-C8sIpKdL.js";
-import { t as ErrorReporter } from "../../error-CzIbnP-N.js";
+import { t as ErrorReporter } from "../../error-B0EkIx4K.js";
 import { n as ValueClassContext, t as ValueClass } from "../../value-class-CNI-lqXJ.js";
 
 //#region src/rslang/semantic/value-auditor.d.ts

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@rsconcept/domain",
-  "version": "2.1.0",
+  "version": "2.1.1",
   "description": "Shared TypeScript domain for RS language, RSForm, RSModel, RSEngine, OSS, and concept-text helpers.",
   "license": "MIT",
   "author": "IRBorisov",

package/src/graph/graph.ts

@@ -469,7 +469,12 @@ export class Graph<NodeID = number> {
     return result;
   }
 
-  /** Tarjan strongly connected components (non-recursive). */
+  /**
+   * Tarjan strongly connected components (iterative).
+   *
+   * @returns Node-id arrays; multi-node components are cyclic SCCs, single-node
+   *   components are acyclic unless the node has a self-loop.
+   */
   stronglyConnectedComponents(): NodeID[][] {
     let index = 0;
     const indices = new Map<NodeID, number>();
@@ -478,7 +483,12 @@ export class Graph<NodeID = number> {
     const stack: NodeID[] = [];
     const components: NodeID[][] = [];
 
-    type Frame = { nodeId: NodeID; edgeIndex: number; entered: boolean };
+    /** Tarjan stack frame for iterative {@link Graph.stronglyConnectedComponents}. */
+    interface Frame {
+      nodeId: NodeID;
+      edgeIndex: number;
+      entered: boolean;
+    }
     for (const startId of this.nodes.keys()) {
       if (indices.has(startId)) {
         continue;

package/src/library/diagnostics.test.ts

@@ -112,4 +112,8 @@ describe('formatDependencyCycle', () => {
   it('joins aliases with arrows', () => {
     expect(formatDependencyCycle(['F3', 'P1', 'F3'])).toBe('F3 → P1 → F3');
   });
+
+  it('uses the same text regardless of cycle rotation', () => {
+    expect(formatDependencyCycle(['P1', 'F3', 'P1'])).toBe('F3 → P1 → F3');
+  });
 });

package/src/library/diagnostics.ts

@@ -81,14 +81,52 @@ export function assignSchemaDiagnostics(
   }
 }
 
-/** Format a closed cycle of aliases as `A → B → A`. */
+/**
+ * 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 ` → `.
+ */
 export function formatDependencyCycle(aliases: readonly string[]): string {
-  return aliases.join(' → ');
+  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 !== undefined && bestAlias !== undefined && alias < bestAlias) {
+      bestStart = index;
+    }
+  }
+  const rotated = [...open.slice(bestStart), ...open.slice(0, bestStart)];
+  if (closed) {
+    const first = rotated[0];
+    if (first !== undefined) {
+      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.
  */
 export function detectDependencyCycleDiagnostics(
   graph: Graph,

package/src/library/rsform-api.ts

@@ -435,7 +435,6 @@ export function canHaveFormalDefinition(cstType: CstType): boolean {
   return cstType !== CstType.BASE && cstType !== CstType.CONSTANT;
 }
 
-/** Analyze expression for {@link RSForm}. */
 export function getAnalysisFor(expression: string, cstType: CstType, schema: RSForm, alias?: string): AnalysisFull {
   if (!canHaveFormalDefinition(cstType)) {
     if (expression.trim().length === 0) {
@@ -516,7 +515,7 @@ export function refineAnalysisForDependencyCycles(
     changed = true;
     return {
       ...error,
-      code: RSDiagnosticCode.schemaDependencyCycle as unknown as RSErrorCode,
+      code: RSErrorCode.schemaDependencyCycle,
       params: [cycleText]
     };
   });
@@ -546,6 +545,14 @@ function buildDraftDependencyGraph(schema: RSForm, currentId: number, expression
   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: RSForm,
   graph: Graph,

package/src/rslang/error.ts

@@ -108,7 +108,10 @@ export const RSErrorCode = {
   calcInvalidData: 0x8108, // 35336
 
   cstEmptyDerived: 0x8861, // 34913
-  definitionNotAllowed: 0x8862 // 34914
+  definitionNotAllowed: 0x8862, // 34914
+
+  // Schema diagnostics surfaced in expression analysis (same value as RSDiagnosticCode.schemaDependencyCycle).
+  schemaDependencyCycle: 0x8906 // 35078
 } as const;
 export type RSErrorCode = (typeof RSErrorCode)[keyof typeof RSErrorCode];
 

package/dist/diagnostics-BSryP66e.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"diagnostics-BSryP66e.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 Graph } from '../graph';\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  extractGlobals,\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 { formatDependencyCycle, 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  const analysis = schema.analyzer.checkFull(expression, {\n    expected: typeClassForCstType(cstType),\n    isDomain: cstType === CstType.STRUCTURED\n  });\n  return refineAnalysisForDependencyCycles(analysis, expression, schema, alias);\n}\n\n/**\n * When an untyped / bare F·P reference names a constituent on a definition cycle with the\n * current expression, replace that error with {@link RSDiagnosticCode.schemaDependencyCycle}.\n *\n * Covers both semantic `globalNotTyped` (e.g. `F3[σ]`) and parser `globalFuncWithoutArgs`\n * (bare `P1` / `F1` treated as a call without arguments).\n *\n * Uses a draft dependency graph: incoming edges of the edited constituent are taken from\n * `expression`, so Check works before Save.\n */\nexport function refineAnalysisForDependencyCycles(\n  analysis: AnalysisFull,\n  expression: string,\n  schema: RSForm,\n  alias?: string\n): AnalysisFull {\n  if (analysis.errors.length === 0 || !schema.graph) {\n    return analysis;\n  }\n\n  const currentId = alias ? schema.cstByAlias.get(alias)?.id : undefined;\n  const expressionGlobals = extractGlobals(expression);\n  const draftGraph =\n    currentId !== undefined ? buildDraftDependencyGraph(schema, currentId, expressionGlobals) : schema.graph;\n\n  let changed = false;\n  const errors = analysis.errors.map(error => {\n    if (error.code !== RSErrorCode.globalNotTyped && error.code !== RSErrorCode.globalFuncWithoutArgs) {\n      return error;\n    }\n    const missingAlias = error.params?.[0];\n    if (!missingAlias) {\n      return error;\n    }\n    const missing = schema.cstByAlias.get(missingAlias);\n    if (!missing) {\n      return error;\n    }\n    const cycleText = resolveDependencyCycleText(schema, draftGraph, currentId, missing.id);\n    if (!cycleText) {\n      return error;\n    }\n    changed = true;\n    return {\n      ...error,\n      code: RSDiagnosticCode.schemaDependencyCycle as unknown as RSErrorCode,\n      params: [cycleText]\n    };\n  });\n  return changed ? { ...analysis, errors } : analysis;\n}\n\n/**\n * Clone the schema graph and replace dependencies of `currentId` with globals from the\n * expression under check (unsaved draft).\n */\nfunction buildDraftDependencyGraph(schema: RSForm, currentId: number, expressionGlobals: ReadonlySet<string>): Graph {\n  const graph = schema.graph.clone();\n  const node = graph.at(currentId);\n  if (node) {\n    for (const parentId of [...node.inputs]) {\n      graph.removeEdge(parentId, currentId);\n    }\n  } else {\n    graph.addNode(currentId);\n  }\n  for (const globalAlias of expressionGlobals) {\n    const source = schema.cstByAlias.get(globalAlias);\n    if (source) {\n      graph.addEdge(source.id, currentId);\n    }\n  }\n  return graph;\n}\n\nfunction resolveDependencyCycleText(\n  schema: RSForm,\n  graph: Graph,\n  currentId: number | undefined,\n  missingId: number\n): string | null {\n  for (const cycle of graph.findCycles()) {\n    const members = new Set(cycle);\n    if (!members.has(missingId)) {\n      continue;\n    }\n    if (currentId !== undefined && !members.has(currentId)) {\n      continue;\n    }\n    return formatDependencyCycle(cycle.map(id => schema.cstByID.get(id)?.alias ?? String(id)));\n  }\n\n  if (currentId === undefined) {\n    const cycleDiag = schema.cstByID\n      .get(missingId)\n      ?.diagnostics.find(item => item.code === RSDiagnosticCode.schemaDependencyCycle);\n    return cycleDiag?.params?.[0] ?? null;\n  }\n\n  return null;\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_path) {\n      continue;\n    }\n    const absolutePath = resolveAbsoluteSpawnerPath(schema, cst, target.id);\n    if (absolutePath?.length === path.length && absolutePath.every((v, i) => v === path[i])) {\n      return cst;\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\nfunction resolveAbsoluteSpawnerPath(schema: RSForm, cst: Constituenta, targetId: number): TypePath | null {\n  if (!cst.spawner_path || cst.spawner == null) {\n    return null;\n  }\n  if (cst.spawner === targetId) {\n    return cst.spawner_path;\n  }\n\n  const byId = schema.cstByID ?? new Map(schema.items.map(item => [item.id, item]));\n  const visited = new Set<number>([cst.id]);\n  let currentPath: number[] = [...cst.spawner_path];\n  let currentSpawnerId: number | null = cst.spawner;\n\n  while (currentSpawnerId != null) {\n    if (currentSpawnerId === targetId) {\n      return currentPath as TypePath;\n    }\n    if (visited.has(currentSpawnerId)) {\n      return null;\n    }\n    visited.add(currentSpawnerId);\n\n    const parent = byId.get(currentSpawnerId);\n    if (!parent?.spawner_path || parent.spawner == null) {\n      return null;\n    }\n\n    currentPath = [...parent.spawner_path, ...currentPath];\n    currentSpawnerId = parent.spawner;\n  }\n\n  return null;\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 { type Graph } from '../graph';\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  schemaDependencyCycle: 0x8906,\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, cycles).\n *\n * Requires normalized formal definitions for duplicate detection (same as Portal loader).\n * When `graph` is provided, dependency cycles are reported as {@link RSDiagnosticCode.schemaDependencyCycle}.\n */\nexport function assignSchemaDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string,\n  normalizedDefinitions: ReadonlyMap<number, string>,\n  graph?: Graph\n): void {\n  const homonymById = detectHomonymDiagnostics(items, resolveAlias);\n  const duplicateById = detectFormalDuplicateDiagnostics(items, resolveAlias, normalizedDefinitions);\n  const cycleById = graph ? detectDependencyCycleDiagnostics(graph, resolveAlias) : new Map<number, CstDiagnostic>();\n\n  for (const cst of items) {\n    const diagnostics: CstDiagnostic[] = [];\n    const cycle = cycleById.get(cst.id);\n    if (cycle) {\n      diagnostics.push(cycle);\n    }\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/** Format a closed cycle of aliases as `A → B → A`. */\nexport function formatDependencyCycle(aliases: readonly string[]): string {\n  return aliases.join(' → ');\n}\n\n/**\n * Map each node id that participates in a dependency cycle to a schema diagnostic.\n * `params[0]` is the closed cycle path (`F3 → P1 → F3`).\n */\nexport function detectDependencyCycleDiagnostics(\n  graph: Graph,\n  resolveAlias: (id: number) => string\n): Map<number, CstDiagnostic> {\n  const result = new Map<number, CstDiagnostic>();\n  for (const cycle of graph.findCycles()) {\n    if (cycle.length < 2) {\n      continue;\n    }\n    const aliases = cycle.map(id => resolveAlias(id));\n    const cycleText = formatDependencyCycle(aliases);\n    const memberIds = new Set(cycle);\n    for (const id of memberIds) {\n      result.set(id, {\n        kind: DiagnosticKind.SCHEMA,\n        code: RSDiagnosticCode.schemaDependencyCycle,\n        params: [cycleText]\n      });\n    }\n  }\n  return result;\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 detectGroupedAliasDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string,\n  groupKey: (cst: Constituenta) => string | undefined,\n  code: RSDiagnosticCode\n): Map<number, CstDiagnostic> {\n  const groups = new Map<string, Constituenta[]>();\n  for (const cst of items) {\n    const key = groupKey(cst);\n    if (!key) {\n      continue;\n    }\n    const group = groups.get(key) ?? [];\n    group.push(cst);\n    groups.set(key, group);\n  }\n\n  const result = new Map<number, CstDiagnostic>();\n  for (const group of groups.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,\n        params: [aliases]\n      });\n    }\n  }\n  return result;\n}\n\nfunction detectHomonymDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string\n): Map<number, CstDiagnostic> {\n  return detectGroupedAliasDiagnostics(\n    items,\n    resolveAlias,\n    cst => {\n      const key = cst.term_resolved.trim().toLocaleLowerCase();\n      return key === '' ? undefined : key;\n    },\n    RSDiagnosticCode.schemaHomonym\n  );\n}\n\nfunction detectFormalDuplicateDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string,\n  normalizedDefinitions: ReadonlyMap<number, string>\n): Map<number, CstDiagnostic> {\n  return detectGroupedAliasDiagnostics(\n    items,\n    resolveAlias,\n    cst => normalizedDefinitions.get(cst.id),\n    RSDiagnosticCode.schemaFormalDuplicate\n  );\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":";;;;;;;;;;;;;;;;AAwCA,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;CAKA,OAAO,kCAJU,OAAO,SAAS,UAAU,YAAY;EACrD,UAAU,oBAAoB,OAAO;EACrC,UAAU,YAAY,QAAQ;CAChC,CACyC,GAAU,YAAY,QAAQ,KAAK;AAC9E;;;;;;;;;;;AAYA,SAAgB,kCACd,UACA,YACA,QACA,OACc;CACd,IAAI,SAAS,OAAO,WAAW,KAAK,CAAC,OAAO,OAC1C,OAAO;CAGT,MAAM,YAAY,QAAQ,OAAO,WAAW,IAAI,KAAK,CAAC,EAAE,KAAK;CAC7D,MAAM,oBAAoB,eAAe,UAAU;CACnD,MAAM,aACJ,cAAc,SAAY,0BAA0B,QAAQ,WAAW,iBAAiB,IAAI,OAAO;CAErG,IAAI,UAAU;CACd,MAAM,SAAS,SAAS,OAAO,KAAI,UAAS;EAC1C,IAAI,MAAM,SAAS,YAAY,kBAAkB,MAAM,SAAS,YAAY,uBAC1E,OAAO;EAET,MAAM,eAAe,MAAM,SAAS;EACpC,IAAI,CAAC,cACH,OAAO;EAET,MAAM,UAAU,OAAO,WAAW,IAAI,YAAY;EAClD,IAAI,CAAC,SACH,OAAO;EAET,MAAM,YAAY,2BAA2B,QAAQ,YAAY,WAAW,QAAQ,EAAE;EACtF,IAAI,CAAC,WACH,OAAO;EAET,UAAU;EACV,OAAO;GACL,GAAG;GACH,MAAM,iBAAiB;GACvB,QAAQ,CAAC,SAAS;EACpB;CACF,CAAC;CACD,OAAO,UAAU;EAAE,GAAG;EAAU;CAAO,IAAI;AAC7C;;;;;AAMA,SAAS,0BAA0B,QAAgB,WAAmB,mBAA+C;CACnH,MAAM,QAAQ,OAAO,MAAM,MAAM;CACjC,MAAM,OAAO,MAAM,GAAG,SAAS;CAC/B,IAAI,MACF,KAAK,MAAM,YAAY,CAAC,GAAG,KAAK,MAAM,GACpC,MAAM,WAAW,UAAU,SAAS;MAGtC,MAAM,QAAQ,SAAS;CAEzB,KAAK,MAAM,eAAe,mBAAmB;EAC3C,MAAM,SAAS,OAAO,WAAW,IAAI,WAAW;EAChD,IAAI,QACF,MAAM,QAAQ,OAAO,IAAI,SAAS;CAEtC;CACA,OAAO;AACT;AAEA,SAAS,2BACP,QACA,OACA,WACA,WACe;CACf,KAAK,MAAM,SAAS,MAAM,WAAW,GAAG;EACtC,MAAM,UAAU,IAAI,IAAI,KAAK;EAC7B,IAAI,CAAC,QAAQ,IAAI,SAAS,GACxB;EAEF,IAAI,cAAc,UAAa,CAAC,QAAQ,IAAI,SAAS,GACnD;EAEF,OAAO,sBAAsB,MAAM,KAAI,OAAM,OAAO,QAAQ,IAAI,EAAE,CAAC,EAAE,SAAS,OAAO,EAAE,CAAC,CAAC;CAC3F;CAEA,IAAI,cAAc,QAIhB,QAHkB,OAAO,QACtB,IAAI,SAAS,CAAC,EACb,YAAY,MAAK,SAAQ,KAAK,SAAS,iBAAiB,qBAAqB,EAC1E,EAAW,SAAS,MAAM;CAGnC,OAAO;AACT;;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,OAAO;EAC9B,IAAI,CAAC,IAAI,cACP;EAEF,MAAM,eAAe,2BAA2B,QAAQ,KAAK,OAAO,EAAE;EACtE,IAAI,cAAc,WAAW,KAAK,UAAU,aAAa,OAAO,GAAG,MAAM,MAAM,KAAK,EAAE,GACpF,OAAO;CAEX;CACA,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;AAEA,SAAS,2BAA2B,QAAgB,KAAmB,UAAmC;CACxG,IAAI,CAAC,IAAI,gBAAgB,IAAI,WAAW,MACtC,OAAO;CAET,IAAI,IAAI,YAAY,UAClB,OAAO,IAAI;CAGb,MAAM,OAAO,OAAO,WAAW,IAAI,IAAI,OAAO,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CAChF,MAAM,0BAAU,IAAI,IAAY,CAAC,IAAI,EAAE,CAAC;CACxC,IAAI,cAAwB,CAAC,GAAG,IAAI,YAAY;CAChD,IAAI,mBAAkC,IAAI;CAE1C,OAAO,oBAAoB,MAAM;EAC/B,IAAI,qBAAqB,UACvB,OAAO;EAET,IAAI,QAAQ,IAAI,gBAAgB,GAC9B,OAAO;EAET,QAAQ,IAAI,gBAAgB;EAE5B,MAAM,SAAS,KAAK,IAAI,gBAAgB;EACxC,IAAI,CAAC,QAAQ,gBAAgB,OAAO,WAAW,MAC7C,OAAO;EAGT,cAAc,CAAC,GAAG,OAAO,cAAc,GAAG,WAAW;EACrD,mBAAmB,OAAO;CAC5B;CAEA,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;;;;AC/tBA,MAAa,iBAAiB;CAC5B,YAAY;CACZ,QAAQ;CACR,OAAO;AACT;;AAIA,MAAa,mBAAmB;CAC9B,eAAe;CACf,uBAAuB;CACvB,yBAAyB;CACzB,mBAAmB;CACnB,oBAAoB;CACpB,uBAAuB;CAEvB,YAAY;CACZ,iBAAiB;CACjB,kBAAkB;CAClB,eAAe;AACjB;;AAYA,SAAgB,iBAAiB,KAAmB,MAAiC;CACnF,OAAO,IAAI,aAAa,MAAK,SAAQ,KAAK,SAAS,IAAI,KAAK;AAC9D;;;;;;;AAQA,SAAgB,wBACd,OACA,cACA,uBACA,OACM;CACN,MAAM,cAAc,yBAAyB,OAAO,YAAY;CAChE,MAAM,gBAAgB,iCAAiC,OAAO,cAAc,qBAAqB;CACjG,MAAM,YAAY,QAAQ,iCAAiC,OAAO,YAAY,oBAAI,IAAI,IAA2B;CAEjH,KAAK,MAAM,OAAO,OAAO;EACvB,MAAM,cAA+B,CAAC;EACtC,MAAM,QAAQ,UAAU,IAAI,IAAI,EAAE;EAClC,IAAI,OACF,YAAY,KAAK,KAAK;EAExB,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,sBAAsB,SAAoC;CACxE,OAAO,QAAQ,KAAK,KAAK;AAC3B;;;;;AAMA,SAAgB,iCACd,OACA,cAC4B;CAC5B,MAAM,yBAAS,IAAI,IAA2B;CAC9C,KAAK,MAAM,SAAS,MAAM,WAAW,GAAG;EACtC,IAAI,MAAM,SAAS,GACjB;EAGF,MAAM,YAAY,sBADF,MAAM,KAAI,OAAM,aAAa,EAAE,CACP,CAAO;EAC/C,MAAM,YAAY,IAAI,IAAI,KAAK;EAC/B,KAAK,MAAM,MAAM,WACf,OAAO,IAAI,IAAI;GACb,MAAM,eAAe;GACrB,MAAM,iBAAiB;GACvB,QAAQ,CAAC,SAAS;EACpB,CAAC;CAEL;CACA,OAAO;AACT;;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,8BACP,OACA,cACA,UACA,MAC4B;CAC5B,MAAM,yBAAS,IAAI,IAA4B;CAC/C,KAAK,MAAM,OAAO,OAAO;EACvB,MAAM,MAAM,SAAS,GAAG;EACxB,IAAI,CAAC,KACH;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;IACA,QAAQ,CAAC,OAAO;GAClB,CAAC;EACH;CACF;CACA,OAAO;AACT;AAEA,SAAS,yBACP,OACA,cAC4B;CAC5B,OAAO,8BACL,OACA,eACA,QAAO;EACL,MAAM,MAAM,IAAI,cAAc,KAAK,CAAC,CAAC,kBAAkB;EACvD,OAAO,QAAQ,KAAK,SAAY;CAClC,GACA,iBAAiB,aACnB;AACF;AAEA,SAAS,iCACP,OACA,cACA,uBAC4B;CAC5B,OAAO,8BACL,OACA,eACA,QAAO,sBAAsB,IAAI,IAAI,EAAE,GACvC,iBAAiB,qBACnB;AACF;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"}