@rsconcept/domain 3.0.0 → 3.0.1

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

@@ -1,8 +1,8 @@
-import { t as AstNode } from "./ast-C8sIpKdL.js";
-import { f as ExpressionType, g as TypeClass } from "./typification-9lNu9R4k.js";
+import { t as AstNode } from "./ast-D-D6Rq3T.js";
+import "./index-D5RahF1K.js";
+import { f as ExpressionType, g as TypeClass } from "./typification-hWUoWCba.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
 interface AnalysisBase {
   success: boolean;
@@ -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-fNhkwO-6.d.ts.map
+//# sourceMappingURL=analyzer-CzFaWR7w.d.ts.map

package/dist/{api-Bf0f_uiI.d.ts → api-DgecYHjR.d.ts}

@@ -1,5 +1,7 @@
-import { t as AstNode } from "./ast-C8sIpKdL.js";
-import { n as ArgumentsType } from "./arguments-extractor-ngatANBI.js";
+import { t as AstNode } from "./ast-D-D6Rq3T.js";
+import "./index-D5RahF1K.js";
+import { n as ArgumentsType } from "./arguments-extractor-CXWRT5Ou.js";
+import "./expression-generator-CADzBw-C.js";
 //#region src/rslang/api.d.ts
 /** Represents alias mapping. */
 type AliasMapping = Record<string, string>;
@@ -54,4 +56,4 @@ declare function applyAliasMapping(target: string, mapping: AliasMapping): strin
 declare function applyTypificationMapping(target: string, mapping: AliasMapping): string;
 //#endregion
 export { extractGlobals as a, isSimpleExpression as c, substituteLocalAliases as d, substituteTemplateArgs as f, extractArguments as i, parseRSLangExpression as l, applyAliasMapping as n, isGlobalAlias as o, applyTypificationMapping as r, isSetTypification as s, AliasMapping as t, splitTemplateDefinition as u };
-//# sourceMappingURL=api-Bf0f_uiI.d.ts.map
+//# sourceMappingURL=api-DgecYHjR.d.ts.map

package/dist/{arguments-extractor-ngatANBI.d.ts → arguments-extractor-CXWRT5Ou.d.ts}

@@ -1,6 +1,6 @@
-import { t as AstNode } from "./ast-C8sIpKdL.js";
-import { f as ExpressionType } from "./typification-9lNu9R4k.js";
-
+import { t as AstNode } from "./ast-D-D6Rq3T.js";
+import "./index-D5RahF1K.js";
+import { f as ExpressionType } from "./typification-hWUoWCba.js";
 //#region src/rslang/semantic/arguments-extractor.d.ts
 /** Represents function argument definition. */
 interface ArgumentsType {
@@ -35,4 +35,4 @@ declare class ArgumentsExtractor {
 }
 //#endregion
 export { ArgumentsType as n, ArgumentsExtractor as t };
-//# sourceMappingURL=arguments-extractor-ngatANBI.d.ts.map
+//# sourceMappingURL=arguments-extractor-CXWRT5Ou.d.ts.map

package/dist/{ast-C8sIpKdL.d.ts → ast-D-D6Rq3T.d.ts}

@@ -1,5 +1,4 @@
-import { n as TreeCursor } from "./lezer-tree-iS7LpLBJ.js";
-
+import { n as TreeCursor } from "./lezer-tree-BQZqBT5A.js";
 //#region src/parsing/ast.d.ts
 declare const TOKEN_ERROR = 0;
 /** Represents AST node data. */
@@ -48,4 +47,4 @@ declare function getNodeText(node: AstNode): string;
 declare function getNodeIndices(node: AstNode): number[];
 //#endregion
 export { TOKEN_ERROR as a, flattenAst as c, printAst as d, visitAstDFS as f, FlatAstNode as i, getNodeIndices as l, AstNodeBase as n, buildTree as o, FlatAST as r, findByUid as s, AstNode as t, getNodeText as u };
-//# sourceMappingURL=ast-C8sIpKdL.d.ts.map
+//# sourceMappingURL=ast-D-D6Rq3T.d.ts.map

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

@@ -1,7 +1,7 @@
-import { t as AstNode } from "./ast-C8sIpKdL.js";
-import { f as ExpressionType } from "./typification-9lNu9R4k.js";
+import { t as AstNode } from "./ast-D-D6Rq3T.js";
+import "./index-D5RahF1K.js";
+import { f as ExpressionType } from "./typification-hWUoWCba.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`. */
 declare function annotateType(node: AstNode, type: ExpressionType): void;
@@ -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-CiIx8qBM.d.ts.map
+//# sourceMappingURL=ast-annotations-x4PJ_Lhc.d.ts.map

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

@@ -1,8 +1,8 @@
-import { t as AstNode } from "./ast-C8sIpKdL.js";
-import { f as ExpressionType } from "./typification-9lNu9R4k.js";
+import { t as AstNode } from "./ast-D-D6Rq3T.js";
+import "./index-D5RahF1K.js";
+import { f as ExpressionType } from "./typification-hWUoWCba.js";
 import { i as RSErrorDescription } from "./error-B0EkIx4K.js";
-import { l as Value } from "./value-BduA_ZGp.js";
-
+import { l as Value } from "./value-XpJOVzMP.js";
 //#region src/rslang/eval/calculator.d.ts
 /** Result of calculator evaluation. */
 interface CalculatorResult {
@@ -36,4 +36,4 @@ declare class RSCalculator {
 }
 //#endregion
 export { CalculatorResult as n, RSCalculator as r, CalculatorEvaluateOptions as t };
-//# sourceMappingURL=calculator-DE89LtIM.d.ts.map
+//# sourceMappingURL=calculator-uPaTV3hc.d.ts.map

package/dist/cctext/language-api.d.ts

@@ -1,5 +1,4 @@
 import { EntityReference, Grammeme, IReference, SyntacticReference, TermContext, WordForm } from "./language.js";
-
 //#region src/cctext/language-api.d.ts
 /** Represents generated lexeme forms. */
 interface Lexeme {

package/dist/{diagnostics-ndGYbvgh.js → diagnostics-D1Cp21nP.js}

@@ -1090,7 +1090,7 @@ const DiagnosticKind = {
 	SCHEMA: "schema",
 	MODEL: "model"
 };
-/** Schema and model diagnostic codes (same numeric format as {@link RSErrorCode}). */
+/** Schema, model, and substitution-table diagnostic codes (same numeric format as {@link RSErrorCode}). */
 const RSDiagnosticCode = {
 	schemaHomonym: 35073,
 	schemaFormalDuplicate: 35074,
@@ -1101,7 +1101,20 @@ const RSDiagnosticCode = {
 	modelEmpty: 35088,
 	modelAxiomFalse: 35089,
 	modelInvalidData: 35090,
-	modelEvalFail: 35091
+	modelEvalFail: 35091,
+	substitutionInvalidIDs: 35104,
+	substitutionIncorrectCst: 35105,
+	substitutionInvalidClasses: 35106,
+	substitutionInvalidBasic: 35107,
+	substitutionInvalidConstant: 35108,
+	substitutionTypificationCycle: 35109,
+	substitutionBaseNotSet: 35110,
+	substitutionUnequalTypification: 35111,
+	/** Non-blocking warning: formal definitions differ after mapping. */
+	substitutionUnequalExpressions: 10536,
+	substitutionUnequalArgsCount: 35113,
+	substitutionUnequalArgs: 35114,
+	substitutionInvalidNominal: 35115
 };
 /** Whether an item has a schema/model diagnostic with the given code. */
 function hasCstDiagnostic(cst, code) {
@@ -1252,4 +1265,4 @@ function modelStatusToCode(status, cstType) {
 //#endregion
 export { isFunctional as $, normalizeExpression as A, buildSequentialAliasMapping as B, isSchemaIssue as C, inferStatus as D, applyFilterCategory as E, refineAnalysisForDependencyCycles as F, validateNewAlias as G, maxAliasIndex as H, addAliasReference as I, getCstTypePrefix as J, canHaveManualTypification as K, allocateImportAliases as L, importAttributions as M, remapAttributionsUnderSubstitution as N, inferTemplate as O, getAnalysisFor as P, isBasicConcept as Q, applyMappingToConstituents as R, calculateSchemaStats as S, restoreConstituentOrder as T, removeAliasReference as U, generateAlias as V, validateAliasFormat as W, inferClass as X, guessCstType as Y, isBaseSet as Z, applyConstituentSubstitutions as _, formatDependencyCycle as a, getStructureName as b, insertItemAfter as c, inlineSynthesis as d, isLogical as et, sortItemsForInlineSynthesis as f, resolveConstituentTextChange as g, resolveAllConstituentTexts as h, detectDependencyCycleDiagnostics as i, filterAttributions as j, inferTemplatedType as k, moveIdsInOrder as l, buildTermReferenceGraph as m, RSDiagnosticCode as n, typeClassForCstType as nt, hasCstDiagnostic as o, buildDefinitionReferenceGraph as p, canProduceStructure as q, assignSchemaDiagnostics as r, modelStatusCstDiagnostic as s, DiagnosticKind as t, isTemplateCst as tt, reorderItemsByIds as u, remapSubstitutionsAfterImport as v, buildFormalDependencyGraph as w, inferNewSpawnPosition as x, findCstByStructure as y, argumentValuesToMapping as z };
 
-//# sourceMappingURL=diagnostics-ndGYbvgh.js.map
+//# sourceMappingURL=diagnostics-D1Cp21nP.js.map

package/dist/{diagnostics-ndGYbvgh.js.map → diagnostics-D1Cp21nP.js.map}

@@ -1 +1 @@
-{"version":3,"file":"diagnostics-ndGYbvgh.js","names":[],"sources":["../src/library/rsform-api/cst-type.ts","../src/library/rsform-api/alias.ts","../src/library/rsform-api/analysis.ts","../src/library/rsform-api/attribution.ts","../src/library/rsform-api/expression.ts","../src/library/rsform-api/semantic-relations.ts","../src/library/rsform-api/formal-graph.ts","../src/library/rsform-api/stats.ts","../src/library/rsform-api/structure.ts","../src/library/rsform-api/substitution.ts","../src/library/rsform-api/text-resolution.ts","../src/library/rsform-api/synthesis.ts","../src/library/rsform-api/transforms.ts","../src/library/diagnostics.ts"],"sourcesContent":["/**\n * CstType classification, prefixes, and capability predicates.\n */\n\nimport { TypeClass, TypeID, type Typification } from '../../rslang';\nimport { type EchelonFunctional, isTypification } from '../../rslang/semantic/typification';\nimport { CstClass, CstType } from '../rsform';\n\nimport { type StructureCapableFields } from './types';\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/** 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/** 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 item type is a template or a category. */\nexport function isTemplateCst(cst: { cst_type: CstType }): boolean {\n  return cst.cst_type === CstType.FUNCTION || cst.cst_type === CstType.PREDICATE || cst.cst_type === CstType.STATEMENT;\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 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/** 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/** 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/** Evaluate if an item can be used to produce structure. */\nexport function canProduceStructure(cst: StructureCapableFields): 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\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 * Alias generation, validation, and remapping.\n */\n\nimport { applyEntityReferenceMapping } from '../../cctext/language-api';\nimport { type AliasMapping, applyAliasMapping, applyTypificationMapping } from '../../rslang/api';\nimport { type ArgumentValue, CstType, type RSForm } from '../rsform';\n\nimport { getCstTypePrefix } from './cst-type';\nimport { type AliasTypedFields } from './types';\n\n/** Fields updated in place by alias mapping. */\nexport interface MappableFields {\n  alias: string;\n  definition_formal: string;\n  typification_manual: string;\n  term_raw: string;\n  definition_raw: string;\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/** 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  let index = schema.items.reduce((prev, cst) => {\n    if (cst.cst_type !== type) {\n      return prev;\n    }\n    const next = Number(cst.alias.substring(prefix.length)) + 1;\n    return Math.max(prev, next);\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 * 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 MappableFields>(\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/** Highest numeric alias suffix for {@link type} among {@link items} (0 when none). */\nexport function maxAliasIndex(items: readonly AliasTypedFields[], type: CstType): number {\n  const prefix = getCstTypePrefix(type);\n  return items.reduce((max, cst) => {\n    if (cst.cst_type !== type) {\n      return max;\n    }\n    const index = Number(cst.alias.slice(prefix.length));\n    return Number.isFinite(index) ? Math.max(max, index) : max;\n  }, 0);\n}\n\n/**\n * Build alias → new-alias mapping that renumbers each type sequentially in list order.\n * Matches backend {@code RSFormCached.reset_aliases}.\n */\nexport function buildSequentialAliasMapping(items: readonly AliasTypedFields[]): AliasMapping {\n  const counts: Record<string, number> = {};\n  for (const value of Object.values(CstType)) {\n    counts[value] = 1;\n  }\n  const mapping: AliasMapping = {};\n  for (const cst of items) {\n    const alias = `${getCstTypePrefix(cst.cst_type)}${counts[cst.cst_type]}`;\n    counts[cst.cst_type] += 1;\n    if (cst.alias !== alias) {\n      mapping[cst.alias] = alias;\n    }\n  }\n  return mapping;\n}\n\n/**\n * Allocate fresh aliases for {@link source} constituents being imported into a non-empty receiver.\n * Returns an empty mapping when the receiver has no items (aliases kept as-is).\n */\nexport function allocateImportAliases(\n  receiver: readonly AliasTypedFields[],\n  source: readonly AliasTypedFields[]\n): AliasMapping {\n  if (receiver.length === 0) {\n    return {};\n  }\n  const counts: Record<string, number> = {};\n  for (const value of Object.values(CstType)) {\n    counts[value] = maxAliasIndex(receiver, value);\n  }\n  const mapping: AliasMapping = {};\n  for (const cst of source) {\n    counts[cst.cst_type] += 1;\n    mapping[cst.alias] = `${getCstTypePrefix(cst.cst_type)}${counts[cst.cst_type]}`;\n  }\n  return mapping;\n}\n\n/** Remove alias from expression. */\nexport function removeAliasReference(expression: string, alias: string): string {\n  const escaped = alias.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n  return expression.replaceAll(new RegExp(`\\\\b${escaped}\\\\b`, 'g'), '').trim();\n}\n\n/** Add alias to expression. */\nexport function addAliasReference(expression: string, alias: string): string {\n  return expression + ' ' + alias;\n}\n","/**\n * Formal expression analysis against an RSForm schema.\n */\n\nimport { type Graph } from '../../graph';\nimport { type AnalysisFull, RSErrorCode, ValueClass } from '../../rslang';\nimport { extractGlobals } from '../../rslang/api';\nimport { basic, bool, constant } from '../../rslang/semantic/typification';\nimport { formatDependencyCycle, RSDiagnosticCode } from '../diagnostics';\nimport { CstType, type RSForm } from '../rsform';\n\nimport { canHaveFormalDefinition, typeClassForCstType } from './cst-type';\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 * Attribution remapping helpers for substitution and schema embedding.\n */\n\nimport { type Attribution } from '../rsform';\n\nfunction attributionKey(attr: Attribution): string {\n  return `${attr.container}:${attr.attribute}`;\n}\n\n/**\n * Remap attributions when constituents are substituted (original → replacement).\n * Drops self-loops and duplicates. Matches sandbox / backend substitute attribution rewrite.\n */\nexport function remapAttributionsUnderSubstitution(\n  attributions: readonly Attribution[],\n  origToSub: ReadonlyMap<number, number>\n): Attribution[] {\n  const result: Attribution[] = [];\n  const seen = new Set<string>();\n\n  for (const attr of attributions) {\n    if (!origToSub.has(attr.container) && !origToSub.has(attr.attribute)) {\n      const key = attributionKey(attr);\n      if (!seen.has(key)) {\n        seen.add(key);\n        result.push({ ...attr });\n      }\n      continue;\n    }\n\n    const container = origToSub.get(attr.container) ?? attr.container;\n    const attribute = origToSub.get(attr.attribute) ?? attr.attribute;\n    if (container === attribute) {\n      continue;\n    }\n    const key = `${container}:${attribute}`;\n    if (seen.has(key)) {\n      continue;\n    }\n    seen.add(key);\n    result.push({ container, attribute });\n  }\n\n  return result;\n}\n\n/**\n * Copy attributions whose both endpoints are in {@link sourceIdSet}, remapping ids via {@link idMap}.\n * Appends onto a clone of {@link existing} with dedupe. Used by schema embedding / insert.\n */\nexport function importAttributions(\n  sourceAttributions: readonly Attribution[],\n  sourceIdSet: ReadonlySet<number>,\n  idMap: Readonly<Record<number, number>>,\n  existing: readonly Attribution[] = []\n): Attribution[] {\n  const result = existing.map(attr => ({ ...attr }));\n  const seen = new Set(result.map(attributionKey));\n\n  for (const attr of sourceAttributions) {\n    if (!sourceIdSet.has(attr.container) || !sourceIdSet.has(attr.attribute)) {\n      continue;\n    }\n    const container = idMap[attr.container];\n    const attribute = idMap[attr.attribute];\n    if (container === undefined || attribute === undefined || container === attribute) {\n      continue;\n    }\n    const key = `${container}:${attribute}`;\n    if (seen.has(key)) {\n      continue;\n    }\n    seen.add(key);\n    result.push({ container, attribute });\n  }\n\n  return result;\n}\n\n/** Drop attributions that reference any id in {@link deletedIds}. */\nexport function filterAttributions(\n  attributions: readonly Attribution[],\n  deletedIds: ReadonlySet<number>\n): Attribution[] {\n  return attributions.filter(attr => !deletedIds.has(attr.container) && !deletedIds.has(attr.attribute));\n}\n","/**\n * Formal expression helpers: normalization, templates, status.\n */\n\nimport { type AstNode } from '../../parsing';\nimport { ValueClass } from '../../rslang';\nimport { generateExpressionFromAst, parseRSLangExpression } from '../../rslang/api';\nimport { type ArgumentValue, CstStatus, CstType } from '../rsform';\n\nimport { isBasicConcept } from './cst-type';\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/**\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/** Apply filter based on start item type within an ordered list. */\nexport function applyFilterCategory<T extends { cst_type: CstType }>(start: T, items: readonly T[]): T[] {\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 * Semantic parent/children used when restoring constituent order.\n */\n\nimport { type Graph } from '../../graph';\nimport { extractGlobals, isSimpleExpression, splitTemplateDefinition } from '../../rslang/api';\nimport { CstType } from '../rsform';\n\nimport { isBaseSet, isFunctional } from './cst-type';\nimport { inferTemplate } from './expression';\nimport { type FormalOrderFields, type SemanticRelations } from './types';\n\n/**\n * Infer semantic parent/children used for clustering during restore order.\n * Port of backend {@code SemanticInfo}.\n */\nexport function computeSemanticRelations(items: readonly FormalOrderFields[], graph: Graph<number>): SemanticRelations {\n  const byId = new Map(items.map(cst => [cst.id, cst]));\n  const byAlias = new Map(items.map(cst => [cst.alias, cst]));\n  const isTemplate = new Map<number, boolean>();\n  const isSimple = new Map<number, boolean>();\n  const parentOf = new Map<number, number>();\n  const childrenOf = new Map<number, number[]>();\n\n  for (const cst of items) {\n    parentOf.set(cst.id, cst.id);\n    childrenOf.set(cst.id, []);\n  }\n\n  function needCheckHead(sources: Set<number>, head: string): boolean {\n    if (sources.size === 0) {\n      return true;\n    }\n    if (sources.size !== 1) {\n      return false;\n    }\n    const base = byId.get([...sources][0])!;\n    return !isFunctional(base.cst_type) || splitTemplateDefinition(base.definition_formal).head !== head;\n  }\n\n  function extractSources(target: FormalOrderFields): Set<number> {\n    const sources = new Set<number>();\n    if (!isFunctional(target.cst_type)) {\n      for (const parentId of graph.at(target.id)?.inputs ?? []) {\n        if (!(isTemplate.get(parentId) && isSimple.get(parentId))) {\n          sources.add(parentOf.get(parentId) ?? parentId);\n        }\n      }\n      return sources;\n    }\n\n    const expression = splitTemplateDefinition(target.definition_formal);\n    for (const alias of extractGlobals(expression.body)) {\n      const parent = byAlias.get(alias);\n      if (!parent) {\n        continue;\n      }\n      if (!(isTemplate.get(parent.id) && isSimple.get(parent.id))) {\n        sources.add(parentOf.get(parent.id) ?? parent.id);\n      }\n    }\n    if (needCheckHead(sources, expression.head)) {\n      for (const alias of extractGlobals(expression.head)) {\n        const parent = byAlias.get(alias);\n        if (!parent) {\n          continue;\n        }\n        if (!isBaseSet(parent.cst_type) && !(isTemplate.get(parent.id) && isSimple.get(parent.id))) {\n          sources.add(parentOf.get(parent.id) ?? parent.id);\n        }\n      }\n    }\n    return sources;\n  }\n\n  function inferSimple(target: FormalOrderFields): boolean {\n    if (target.cst_type === CstType.STRUCTURED || isBaseSet(target.cst_type)) {\n      return false;\n    }\n    const dependencies = graph.at(target.id)?.inputs ?? [];\n    if (dependencies.some(id => isTemplate.get(id) && !isSimple.get(id))) {\n      return false;\n    }\n    const expression = isFunctional(target.cst_type)\n      ? splitTemplateDefinition(target.definition_formal).body\n      : target.definition_formal;\n    return isSimpleExpression(expression);\n  }\n\n  for (const cstId of graph.topologicalOrder()) {\n    const cst = byId.get(cstId);\n    if (!cst) {\n      continue;\n    }\n    isTemplate.set(cstId, inferTemplate(cst.definition_formal));\n    isSimple.set(cstId, inferSimple(cst));\n    if (!isSimple.get(cstId) || cst.cst_type === CstType.STRUCTURED) {\n      continue;\n    }\n    const sources = extractSources(cst);\n    if (sources.size !== 1) {\n      continue;\n    }\n    const parentId = [...sources][0];\n    const parent = byId.get(parentId);\n    if (!parent || isBaseSet(parent.cst_type)) {\n      continue;\n    }\n    parentOf.set(cstId, parentId);\n    childrenOf.get(parentId)!.push(cstId);\n  }\n\n  return { parentOf, childrenOf };\n}\n","/**\n * Formal dependency graph and declaration-order restore for RSForm constituents.\n */\n\nimport { Graph } from '../../graph';\nimport { extractGlobals } from '../../rslang/api';\nimport { CstType } from '../rsform';\n\nimport { computeSemanticRelations } from './semantic-relations';\nimport { type FormalOrderFields, type SemanticRelations } from './types';\n\n/**\n * Build the formal dependency graph: supplier → dependent.\n * Matches backend {@code RSForm.graph_formal}.\n */\nexport function buildFormalDependencyGraph(items: readonly FormalOrderFields[]): Graph<number> {\n  const graph = new Graph<number>();\n  const byAlias = new Map(items.map(cst => [cst.alias, cst]));\n  for (const cst of items) {\n    graph.addNode(cst.id);\n  }\n  for (const cst of items) {\n    for (const alias of extractGlobals(cst.definition_formal)) {\n      const supplier = byAlias.get(alias);\n      if (supplier) {\n        graph.addEdge(supplier.id, cst.id);\n      }\n    }\n  }\n  return graph;\n}\n\n/**\n * Reorder constituents: formal topology hard, semantic children sticky when ready,\n * otherwise stable against type/kernel preferred ranks.\n *\n * One Kahn pass over the formal dependency graph.\n */\nexport function restoreConstituentOrder<T extends FormalOrderFields>(\n  items: readonly T[],\n  graph: Graph<number> = buildFormalDependencyGraph(items),\n  relations: SemanticRelations = computeSemanticRelations(items, graph)\n): T[] {\n  if (items.length <= 1) {\n    return [...items];\n  }\n\n  const byId = new Map(items.map(cst => [cst.id, cst]));\n  const preferred = kernelPriority(items, graph, relations.parentOf);\n  const rank = new Map(preferred.map((cst, index) => [cst.id, index]));\n\n  const remainingInputs = new Map<number, number>();\n  for (const cst of preferred) {\n    const inputs = graph.at(cst.id)?.inputs ?? [];\n    remainingInputs.set(\n      cst.id,\n      inputs.reduce((count, src) => count + (rank.has(src) ? 1 : 0), 0)\n    );\n  }\n\n  const ready = new Set<number>();\n  for (const cst of preferred) {\n    if ((remainingInputs.get(cst.id) ?? 0) === 0) {\n      ready.add(cst.id);\n    }\n  }\n\n  const children = new Map<number, number[]>();\n  for (const cst of preferred) {\n    children.set(\n      cst.id,\n      (relations.childrenOf.get(cst.id) ?? []).filter(childId => rank.has(childId))\n    );\n  }\n\n  const result: T[] = [];\n  const pendingChildren: number[] = [];\n\n  function enqueueSticky(candidateIds: readonly number[]): void {\n    const sticky = candidateIds.filter(childId => ready.has(childId) && !pendingChildren.includes(childId));\n    sticky.sort((left, right) => (rank.get(left) ?? 0) - (rank.get(right) ?? 0));\n    pendingChildren.push(...sticky);\n  }\n\n  function pickReady(): number {\n    while (pendingChildren.length > 0) {\n      const childId = pendingChildren.shift()!;\n      if (ready.has(childId)) {\n        return childId;\n      }\n    }\n    let best = -1;\n    let bestRank = Number.POSITIVE_INFINITY;\n    for (const nodeId of ready) {\n      const nodeRank = rank.get(nodeId) ?? Number.POSITIVE_INFINITY;\n      if (nodeRank < bestRank) {\n        best = nodeId;\n        bestRank = nodeRank;\n      }\n    }\n    return best;\n  }\n\n  while (ready.size > 0 || pendingChildren.length > 0) {\n    if (ready.size === 0) {\n      pendingChildren.length = 0;\n      continue;\n    }\n    const nodeId = pickReady();\n    ready.delete(nodeId);\n    result.push(byId.get(nodeId)!);\n\n    for (const dependentId of graph.at(nodeId)?.outputs ?? []) {\n      if (!remainingInputs.has(dependentId)) {\n        continue;\n      }\n      const next = (remainingInputs.get(dependentId) ?? 0) - 1;\n      remainingInputs.set(dependentId, next);\n      if (next === 0) {\n        ready.add(dependentId);\n      }\n    }\n\n    enqueueSticky(children.get(nodeId) ?? []);\n  }\n\n  if (result.length < preferred.length) {\n    const placed = new Set(result.map(cst => cst.id));\n    for (const cst of preferred) {\n      if (!placed.has(cst.id)) {\n        result.push(cst);\n      }\n    }\n  }\n\n  return result;\n}\n\nfunction kernelPriority<T extends FormalOrderFields>(\n  items: readonly T[],\n  graph: Graph<number>,\n  parentOf: Map<number, number>\n): T[] {\n  const byId = new Map(items.map(cst => [cst.id, cst]));\n  const seen = new Set<number>();\n  const result: T[] = [];\n\n  function push(cst: T): void {\n    if (seen.has(cst.id)) {\n      return;\n    }\n    seen.add(cst.id);\n    result.push(cst);\n  }\n\n  for (const cst of items) {\n    if (cst.cst_type === CstType.BASE) {\n      push(cst);\n    }\n  }\n  for (const cst of items) {\n    if (cst.cst_type === CstType.CONSTANT) {\n      push(cst);\n    }\n  }\n  for (const cst of items) {\n    if ((graph.at(cst.id)?.inputs.length ?? 0) === 0) {\n      push(cst);\n    }\n  }\n\n  const kernelSeeds = items\n    .filter(cst => {\n      const parentId = parentOf.get(cst.id) ?? cst.id;\n      const parent = byId.get(parentId);\n      return (\n        cst.cst_type === CstType.STRUCTURED || cst.cst_type === CstType.AXIOM || parent?.cst_type === CstType.STRUCTURED\n      );\n    })\n    .map(cst => cst.id);\n  const kernel = new Set<number>([...kernelSeeds, ...graph.expandAllInputs(kernelSeeds)]);\n  for (const cst of items) {\n    if (kernel.has(cst.id)) {\n      push(cst);\n    }\n  }\n  for (const cst of items) {\n    push(cst);\n  }\n  return result;\n}\n","/**\n * Schema-level statistics and issue flags.\n */\n\nimport { TypeID, type Typification, ValueClass } from '../../rslang';\nimport { hasCstDiagnostic, RSDiagnosticCode } from '../diagnostics';\nimport { CstStatus, CstType, type RSForm, type RSFormStats } from '../rsform';\n\nimport { isBasicConcept, isLogical } from './cst-type';\nimport { type BasicTextCheckFields, type SchemaIssueFields, type StructureCapableFields } from './types';\n\n/** Checks if an item is a schema issue. */\nexport function isSchemaIssue(cst: SchemaIssueFields): boolean {\n  return (\n    (cst.diagnostics?.length ?? 0) > 0 || cst.status === CstStatus.INCORRECT || cst.status === CstStatus.INCALCULABLE\n  );\n}\n\n/** Calculate statistics for {@link RSForm}. */\nexport function calculateSchemaStats(target: RSForm): RSFormStats {\n  const stats: RSFormStats = {\n    count_all: target.items.length,\n    count_crucial: 0,\n    step_complexity: 0,\n    count_problematic: 0,\n    count_homonyms: 0,\n    count_formal_duplicates: 0,\n    count_missing_basic_text: 0,\n    count_type_mismatch: 0,\n    count_incorrect: 0,\n    count_property: 0,\n    count_incalculable: 0,\n    count_inherited: 0,\n    count_text_term: 0,\n    count_definition: 0,\n    count_convention: 0,\n    count_comment: 0,\n    count_base: 0,\n    count_constant: 0,\n    count_structured: 0,\n    count_axiom: 0,\n    count_term: 0,\n    count_function: 0,\n    count_predicate: 0,\n    count_statement: 0,\n    count_nominal: 0\n  };\n\n  for (const cst of target.items) {\n    if (cst.crucial) {\n      stats.count_crucial += 1;\n    }\n    stats.step_complexity += calculateStepComplexity(cst);\n\n    if (isSchemaIssue(cst)) {\n      stats.count_problematic += 1;\n    }\n    if (hasCstDiagnostic(cst, RSDiagnosticCode.schemaHomonym)) {\n      stats.count_homonyms += 1;\n    }\n    if (hasCstDiagnostic(cst, RSDiagnosticCode.schemaFormalDuplicate)) {\n      stats.count_formal_duplicates += 1;\n    }\n    if (isMissingBasicText(cst)) {\n      stats.count_missing_basic_text += 1;\n    }\n    if (cst.is_type_mismatch) {\n      stats.count_type_mismatch += 1;\n    }\n    if (cst.status === CstStatus.INCORRECT) {\n      stats.count_incorrect += 1;\n    }\n    if (cst.analysis?.valueClass === ValueClass.PROPERTY) {\n      stats.count_property += 1;\n    }\n    if (cst.analysis?.success && cst.analysis.valueClass === null) {\n      stats.count_incalculable += 1;\n    }\n    if (cst.is_inherited) {\n      stats.count_inherited += 1;\n    }\n    if (cst.term_raw) {\n      stats.count_text_term += 1;\n    }\n    if (cst.definition_raw) {\n      stats.count_definition += 1;\n    }\n    if (isBasicConcept(cst.cst_type) && cst.convention) {\n      stats.count_convention += 1;\n    }\n    if (!isBasicConcept(cst.cst_type) && !cst.convention) {\n      stats.count_comment += 1;\n    }\n\n    switch (cst.cst_type) {\n      case CstType.BASE:\n        stats.count_base += 1;\n        break;\n      case CstType.CONSTANT:\n        stats.count_constant += 1;\n        break;\n      case CstType.STRUCTURED:\n        stats.count_structured += 1;\n        break;\n      case CstType.AXIOM:\n        stats.count_axiom += 1;\n        break;\n      case CstType.TERM:\n        stats.count_term += 1;\n        break;\n      case CstType.FUNCTION:\n        stats.count_function += 1;\n        break;\n      case CstType.PREDICATE:\n        stats.count_predicate += 1;\n        break;\n      case CstType.STATEMENT:\n        stats.count_statement += 1;\n        break;\n      case CstType.NOMINAL:\n        stats.count_nominal += 1;\n        break;\n    }\n  }\n\n  return stats;\n}\n\nfunction calculateStepComplexity(cst: StructureCapableFields): 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\n/** Non-logical basic concept missing convention and/or resolved term (trimmed). */\nfunction isMissingBasicText(cst: BasicTextCheckFields): boolean {\n  if (!isBasicConcept(cst.cst_type) || isLogical(cst.cst_type)) {\n    return false;\n  }\n  return !cst.convention.trim() || !cst.term_resolved.trim();\n}\n","/**\n * Structure-path helpers for spawned constituents.\n */\n\nimport { TypeID, type TypePath, type Typification } from '../../rslang';\nimport { isTypification } from '../../rslang/semantic/typification';\nimport { applyPath } from '../../rslang/semantic/typification-api';\nimport { type Constituenta, type RSForm } from '../rsform';\n\nimport { type SpawnPathFields, type StructureCapableFields } from './types';\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/** Finds schema item by absolute structure path under `targetId`. */\nexport function findCstByStructure(schema: RSForm, target: { id: number }, path: TypePath): Constituenta | null {\n  const byId = schema.cstByID ?? new Map(schema.items.map(item => [item.id, item]));\n  for (const cst of schema.items) {\n    if (!cst.spawner_path) {\n      continue;\n    }\n    const absolutePath = resolveAbsoluteSpawnerPath(cst, target.id, byId);\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 structure. */\nexport function getStructureName(\n  schema: RSForm,\n  target: StructureCapableFields & { id: number },\n  path: TypePath\n): 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\nfunction resolveAbsoluteSpawnerPath(\n  cst: SpawnPathFields,\n  targetId: number,\n  byId: Map<number, SpawnPathFields>\n): 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 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 * Constituenta substitution and post-import substitution remapping.\n */\n\nimport { type AliasMapping } from '../../rslang/api';\nimport { type Attribution, type Substitution } from '../rsform';\n\nimport { applyMappingToConstituents, type MappableFields } from './alias';\nimport { remapAttributionsUnderSubstitution } from './attribution';\n\n/** Result of applying substitutions to a schema fragment. */\nexport interface SubstitutionResult<T> {\n  items: T[];\n  attributions: Attribution[];\n  deletedIds: Set<number>;\n  /** Replacement constituent ids (survivors referenced by substitutions). */\n  replacementIds: number[];\n}\n\n/**\n * Apply constituenta substitutions: remap attributions, drop originals, rewrite aliases in survivors.\n * Does not resolve texts — call {@link resolveAllConstituentTexts} afterwards.\n */\nexport function applyConstituentSubstitutions<T extends MappableFields & { id: number; alias: string }>(\n  items: readonly T[],\n  attributions: readonly Attribution[],\n  substitutions: readonly Substitution[]\n): SubstitutionResult<T> {\n  if (substitutions.length === 0) {\n    return {\n      items: [...items],\n      attributions: attributions.map(attr => ({ ...attr })),\n      deletedIds: new Set(),\n      replacementIds: []\n    };\n  }\n\n  const byId = new Map(items.map(cst => [cst.id, cst]));\n  const mapping: AliasMapping = {};\n  const deletedIds = new Set<number>();\n  const origToSub = new Map<number, number>();\n  const replacementIds: number[] = [];\n\n  for (const { original, substitution } of substitutions) {\n    const originalCst = byId.get(original);\n    const substitutionCst = byId.get(substitution);\n    if (!originalCst || !substitutionCst) {\n      throw new Error(`applyConstituentSubstitutions: unknown constituenta ${original} -> ${substitution}`);\n    }\n    mapping[originalCst.alias] = substitutionCst.alias;\n    deletedIds.add(original);\n    origToSub.set(original, substitution);\n    replacementIds.push(substitution);\n  }\n\n  const nextItems = items.filter(cst => !deletedIds.has(cst.id));\n  applyMappingToConstituents(nextItems, mapping, false);\n\n  return {\n    items: nextItems,\n    attributions: remapAttributionsUnderSubstitution(attributions, origToSub),\n    deletedIds,\n    replacementIds\n  };\n}\n\n/**\n * Remap substitution endpoints after source constituents were inserted under new ids.\n * If {@link original} was imported, map it; otherwise map {@link substitution}.\n */\nexport function remapSubstitutionsAfterImport(\n  substitutions: readonly Substitution[],\n  sourceIdSet: ReadonlySet<number>,\n  idMap: Readonly<Record<number, number>>\n): Substitution[] {\n  return substitutions.map(sub => {\n    if (sourceIdSet.has(sub.original)) {\n      return { original: idMap[sub.original], substitution: sub.substitution };\n    }\n    return { original: sub.original, substitution: idMap[sub.substitution] };\n  });\n}\n","/**\n * Cascade resolution of constituenta term/definition entity references.\n * Matches backend {@code RSForm.resolve_all_text} / {@code resolve_term_change}.\n */\n\nimport { type TermContext } from '../../cctext/language';\nimport { extractEntities, parseGrammemes, resolveTextReferences } from '../../cctext/language-api';\nimport { Graph } from '../../graph';\n\nimport { type TextResolvableFields } from './types';\n\n/** Options controlling which texts to re-resolve after an edit. */\nexport interface TextChangeOptions {\n  termChanged: boolean;\n  termRawChanged: boolean;\n  definitionRawChanged: boolean;\n  clearTargetForms: boolean;\n}\n\n/** Build term-reference graph: referenced constituent → dependent (backend {@code graph_term}). */\nexport function buildTermReferenceGraph(items: readonly TextResolvableFields[]): Graph<number> {\n  return buildReferenceGraph(items, 'term_raw');\n}\n\n/** Build definition-reference graph: referenced constituent → dependent (backend {@code graph_text}). */\nexport function buildDefinitionReferenceGraph(items: readonly TextResolvableFields[]): Graph<number> {\n  return buildReferenceGraph(items, 'definition_raw');\n}\n\n/** Resolve all term and definition texts in topological order. Mutates items in place. */\nexport function resolveAllConstituentTexts(items: TextResolvableFields[]): void {\n  const graphTerm = buildTermReferenceGraph(items);\n  const idToItem = new Map(items.map(item => [item.id, item]));\n  const context = buildTermContext(items);\n\n  for (const id of graphTerm.topologicalOrder()) {\n    const row = idToItem.get(id);\n    if (!row) {\n      continue;\n    }\n    const resolved = resolveTextReferences(row.term_raw, context);\n    if (resolved !== row.term_resolved) {\n      row.term_resolved = resolved;\n      row.term_forms = [];\n      context[row.alias] = { nominal: row.term_resolved, forms: [] };\n    }\n  }\n\n  for (const row of items) {\n    row.definition_resolved = resolveTextReferences(row.definition_raw, context);\n  }\n}\n\n/**\n * Resolve texts after a single constituent change, cascading dependents when the term changed.\n * Mutates items in place.\n */\nexport function resolveConstituentTextChange(\n  items: TextResolvableFields[],\n  targetID: number,\n  options: TextChangeOptions\n): void {\n  const idToItem = new Map(items.map(item => [item.id, item]));\n  const target = idToItem.get(targetID);\n  if (!target) {\n    throw new Error(`resolveConstituentTextChange: unknown target ${targetID}`);\n  }\n\n  const context = buildTermContext(items);\n  if (options.termRawChanged) {\n    target.term_resolved = resolveTextReferences(target.term_raw, context);\n    if (options.clearTargetForms) {\n      target.term_forms = [];\n    }\n    context[target.alias] = toContextItem(target);\n  } else if (options.termChanged) {\n    context[target.alias] = toContextItem(target);\n  }\n\n  if (options.definitionRawChanged && !options.termChanged) {\n    target.definition_resolved = resolveTextReferences(target.definition_raw, context);\n  }\n\n  if (!options.termChanged) {\n    return;\n  }\n\n  const graphTerm = buildTermReferenceGraph(items);\n  const graphText = buildDefinitionReferenceGraph(items);\n  const expansion = graphTerm.expandAllOutputs([targetID]);\n  const expansionSet = new Set(expansion);\n\n  for (const id of graphTerm.topologicalOrder()) {\n    if (!expansionSet.has(id)) {\n      continue;\n    }\n    const expanded = idToItem.get(id);\n    if (!expanded) {\n      continue;\n    }\n    const resolved = resolveTextReferences(expanded.term_raw, context);\n    if (resolved !== expanded.term_resolved) {\n      expanded.term_resolved = resolved;\n      expanded.term_forms = [];\n      context[expanded.alias] = { nominal: expanded.term_resolved, forms: [] };\n    }\n  }\n\n  const updateDefs = new Set([targetID, ...expansion, ...graphText.expandAllOutputs([targetID, ...expansion])]);\n  for (const item of items) {\n    if (updateDefs.has(item.id)) {\n      item.definition_resolved = resolveTextReferences(item.definition_raw, context);\n    }\n  }\n}\n\n// ====== Internals =======\n\nfunction buildReferenceGraph(\n  items: readonly TextResolvableFields[],\n  field: 'definition_raw' | 'term_raw'\n): Graph<number> {\n  const graph = new Graph<number>();\n  const idByAlias = new Map(items.map(row => [row.alias, row.id]));\n  for (const row of items) {\n    graph.addNode(row.id);\n  }\n  for (const row of items) {\n    for (const entity of extractEntities(row[field])) {\n      const source = idByAlias.get(entity);\n      if (source !== undefined) {\n        graph.addEdge(source, row.id);\n      }\n    }\n  }\n  return graph;\n}\n\nfunction buildTermContext(items: readonly TextResolvableFields[]): TermContext {\n  const context: TermContext = {};\n  for (const row of items) {\n    context[row.alias] = toContextItem(row);\n  }\n  return context;\n}\n\nfunction toContextItem(row: TextResolvableFields): TermContext[string] {\n  return {\n    nominal: row.term_resolved,\n    forms: row.term_forms.map(form => ({ text: form.text, grams: parseGrammemes(form.tags) }))\n  };\n}\n","/**\n * Schema embedding (synthesis): insert constituents from a source schema into a receiver,\n * then apply an identification (substitution) table.\n *\n * Mirrors backend `inline_synthesis` / `insert_from` + `substitute`\n * (Portal UI: «Встраивание схемы»).\n */\n\nimport { type AliasMapping } from '../../rslang/api';\nimport { type LibraryItem } from '../library';\nimport { type Attribution, type CstType, type RSForm, type Substitution } from '../rsform';\n\nimport { allocateImportAliases, applyMappingToConstituents, type MappableFields } from './alias';\nimport { importAttributions } from './attribution';\nimport { applyConstituentSubstitutions, remapSubstitutionsAfterImport } from './substitution';\nimport { resolveAllConstituentTexts } from './text-resolution';\nimport { type AliasTypedFields, type TextResolvableFields } from './types';\n\n/** Field intersection required for embedding / synthesis transforms. */\nexport type SynthesizableFields = MappableFields &\n  TextResolvableFields &\n  AliasTypedFields & {\n    id: number;\n    alias: string;\n    cst_type: CstType;\n  };\n\n/** Input for {@link inlineSynthesis}. */\nexport interface InlineSynthesisInput<T extends SynthesizableFields> {\n  /** Receiver schema constituents (order preserved; imports append). */\n  receiverItems: readonly T[];\n  /** Receiver attributions (default empty). */\n  receiverAttributions?: readonly Attribution[];\n  /**\n   * Source constituents to insert (already filtered to the desired subset).\n   * Cloned; originals are not mutated.\n   */\n  sourceItems: readonly T[];\n  /** Source attributions whose both endpoints are among {@link sourceItems}. */\n  sourceAttributions?: readonly Attribution[];\n  /**\n   * Identification table using pre-import ids:\n   * one endpoint is a source id, the other a receiver id\n   * (same rules as backend embedding / InlineSynthesis).\n   */\n  substitutions?: readonly Substitution[];\n  /** Next free numeric id for inserted constituents. */\n  nextId: number;\n}\n\n/** Result of {@link inlineSynthesis}. */\nexport interface InlineSynthesisResult<T extends SynthesizableFields> {\n  items: T[];\n  attributions: Attribution[];\n  /** Updated next-id after inserts. */\n  nextId: number;\n  /** Source id → inserted id. */\n  idMap: Record<number, number>;\n  /** Alias remapping applied to imported constituents (empty when receiver was empty). */\n  aliasMapping: AliasMapping;\n  /** Ids removed by substitutions. */\n  deletedIds: Set<number>;\n  /** Ids of newly inserted constituents (before any were deleted by substitutions). */\n  insertedIds: number[];\n  /** Survivor ids referenced by applied substitutions. */\n  replacementIds: number[];\n}\n\n/**\n * Embed {@link InlineSynthesisInput.sourceItems} into the receiver and apply substitutions.\n * Resolves term/definition entity references on the result.\n * Does not mutate inputs.\n */\nexport function inlineSynthesis<T extends SynthesizableFields>(\n  input: InlineSynthesisInput<T>\n): InlineSynthesisResult<T> {\n  const sourceItems = input.sourceItems;\n  if (sourceItems.length === 0) {\n    return {\n      items: input.receiverItems.map(item => structuredClone(item)),\n      attributions: (input.receiverAttributions ?? []).map(attr => ({ ...attr })),\n      nextId: input.nextId,\n      idMap: {},\n      aliasMapping: {},\n      deletedIds: new Set(),\n      insertedIds: [],\n      replacementIds: []\n    };\n  }\n\n  const receiverItems = input.receiverItems.map(item => structuredClone(item));\n  let attributions = (input.receiverAttributions ?? []).map(attr => ({ ...attr }));\n  const aliasMapping = allocateImportAliases(receiverItems, sourceItems);\n  const idMap: Record<number, number> = {};\n  const inserted: T[] = [];\n  const sourceIdSet = new Set(sourceItems.map(cst => cst.id));\n  let nextId = input.nextId;\n\n  for (const cst of sourceItems) {\n    const newId = nextId;\n    nextId += 1;\n    idMap[cst.id] = newId;\n\n    const cloned = structuredClone(cst);\n    cloned.id = newId;\n    if (Object.keys(aliasMapping).length > 0) {\n      cloned.alias = aliasMapping[cst.alias];\n      applyMappingToConstituents([cloned], aliasMapping, false);\n    }\n    inserted.push(cloned);\n  }\n\n  attributions = importAttributions(input.sourceAttributions ?? [], sourceIdSet, idMap, attributions);\n  const items = receiverItems.concat(inserted);\n  resolveAllConstituentTexts(items);\n\n  const substitutions = input.substitutions ?? [];\n  if (substitutions.length === 0) {\n    return {\n      items,\n      attributions,\n      nextId,\n      idMap,\n      aliasMapping,\n      deletedIds: new Set(),\n      insertedIds: inserted.map(cst => cst.id),\n      replacementIds: []\n    };\n  }\n\n  const remapped = remapSubstitutionsAfterImport(substitutions, sourceIdSet, idMap);\n  const substituted = applyConstituentSubstitutions(items, attributions, remapped);\n  resolveAllConstituentTexts(substituted.items);\n\n  return {\n    items: substituted.items,\n    attributions: substituted.attributions,\n    nextId,\n    idMap,\n    aliasMapping,\n    deletedIds: substituted.deletedIds,\n    insertedIds: inserted.map(cst => cst.id),\n    replacementIds: substituted.replacementIds\n  };\n}\n\n/** Sorts library items relevant for schema embedding with specified {@link RSForm}. */\nexport function sortItemsForInlineSynthesis(receiver: RSForm, items: readonly LibraryItem[]): LibraryItem[] {\n  const result = items.filter(item => item.location === receiver.location);\n  const included = new Set(result);\n  for (const item of items) {\n    if (item.visible && item.owner === receiver.owner && !included.has(item)) {\n      result.push(item);\n      included.add(item);\n    }\n  }\n  for (const item of items) {\n    if (item.visible && !included.has(item)) {\n      result.push(item);\n      included.add(item);\n    }\n  }\n  for (const item of items) {\n    if (!included.has(item)) {\n      result.push(item);\n      included.add(item);\n    }\n  }\n  return result;\n}\n","/**\n * Pure constituenta list transforms: reorder, move, insert position.\n */\n\n/** Rebuild an item list following {@link orderedIds}. Throws if an id is missing. */\nexport function reorderItemsByIds<T extends { id: number }>(items: readonly T[], orderedIds: readonly number[]): T[] {\n  const byId = new Map(items.map(item => [item.id, item]));\n  return orderedIds.map(id => {\n    const item = byId.get(id);\n    if (!item) {\n      throw new Error(`reorderItemsByIds: missing id ${id}`);\n    }\n    return item;\n  });\n}\n\n/**\n * Move a subset of ids within an ordered id list.\n * {@link moveTo} is clamped to `[0, rest.length]` (index among non-moving items).\n */\nexport function moveIdsInOrder(ids: readonly number[], moving: readonly number[], moveTo: number): number[] {\n  const movingSet = new Set(moving);\n  const rest = ids.filter(id => !movingSet.has(id));\n  const movingItems = ids.filter(id => movingSet.has(id));\n  const clamped = Math.max(0, Math.min(moveTo, rest.length));\n  return [...rest.slice(0, clamped), ...movingItems, ...rest.slice(clamped)];\n}\n\n/** Insert {@link item} after {@link insertAfter}, or append when null/undefined/missing. Mutates {@link items}. */\nexport function insertItemAfter<T extends { id: number }>(\n  items: T[],\n  item: T,\n  insertAfter: number | null | undefined\n): void {\n  if (insertAfter === null || insertAfter === undefined) {\n    items.push(item);\n    return;\n  }\n  const idx = items.findIndex(row => row.id === insertAfter);\n  const insertAt = idx === -1 ? items.length : idx + 1;\n  items.splice(insertAt, 0, item);\n}\n","/**\n * Module: Compact diagnostics for constituents (schema and model issue codes).\n */\n\nimport { type Graph } from '../graph';\nimport { type ExpressionType } from '../rslang';\nimport { labelType } from '../rslang/labels';\n\nimport { type BasicTextCheckFields } from './rsform-api/types';\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 an item has a schema/model diagnostic with the given code. */\nexport function hasCstDiagnostic(\n  cst: { diagnostics?: readonly CstDiagnostic[] | null },\n  code: RSDiagnosticCode\n): 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(\n  cst: BasicTextCheckFields & {\n    is_type_mismatch: boolean;\n    typification_manual: string;\n    analysis: { type: ExpressionType | null };\n  }\n): 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<T extends { id: number }>(\n  items: readonly T[],\n  resolveAlias: (id: number) => string,\n  groupKey: (cst: T) => string | undefined,\n  code: RSDiagnosticCode\n): Map<number, CstDiagnostic> {\n  const groups = new Map<string, T[]>();\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: readonly { id: number; term_resolved: string }[],\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: readonly { id: number }[],\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":";;;;;;;;;;;;;;;;;;AAWA,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,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,WAAW,MAAe,aAAsB,OAAiB;CAC/E,IAAI,YACF,OAAO,SAAS;CAElB,OAAO,kBAAkB;AAC3B;;AAGA,SAAgB,cAAc,KAAqC;CACjE,OAAO,IAAI,aAAa,QAAQ,YAAY,IAAI,aAAa,QAAQ,aAAa,IAAI,aAAa,QAAQ;AAC7G;;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,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,wBAAwB,SAA2B;CACjE,OAAO,YAAY,QAAQ,QAAQ,YAAY,QAAQ;AACzD;;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,oBAAoB,KAAsC;CACxE,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;AAEA,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;;;;;;;ACpMA,SAAgB,wBAAwB,MAAqC;CAC3E,MAAM,UAAwB,CAAC;CAC/B,KAAK,MAAM,OAAO,MAChB,IAAI,IAAI,OACN,QAAQ,IAAI,SAAS,IAAI;CAG7B,OAAO;AACT;;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,QAAQ,OAAO,MAAM,QAAQ,MAAM,QAAQ;EAC7C,IAAI,IAAI,aAAa,MACnB,OAAO;EAET,MAAM,OAAO,OAAO,IAAI,MAAM,UAAU,OAAO,MAAM,CAAC,IAAI;EAC1D,OAAO,KAAK,IAAI,MAAM,IAAI;CAC5B,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,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,cAAc,OAAoC,MAAuB;CACvF,MAAM,SAAS,iBAAiB,IAAI;CACpC,OAAO,MAAM,QAAQ,KAAK,QAAQ;EAChC,IAAI,IAAI,aAAa,MACnB,OAAO;EAET,MAAM,QAAQ,OAAO,IAAI,MAAM,MAAM,OAAO,MAAM,CAAC;EACnD,OAAO,OAAO,SAAS,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI;CACzD,GAAG,CAAC;AACN;;;;;AAMA,SAAgB,4BAA4B,OAAkD;CAC5F,MAAM,SAAiC,CAAC;CACxC,KAAK,MAAM,SAAS,OAAO,OAAO,OAAO,GACvC,OAAO,SAAS;CAElB,MAAM,UAAwB,CAAC;CAC/B,KAAK,MAAM,OAAO,OAAO;EACvB,MAAM,QAAQ,GAAG,iBAAiB,IAAI,QAAQ,IAAI,OAAO,IAAI;EAC7D,OAAO,IAAI,aAAa;EACxB,IAAI,IAAI,UAAU,OAChB,QAAQ,IAAI,SAAS;CAEzB;CACA,OAAO;AACT;;;;;AAMA,SAAgB,sBACd,UACA,QACc;CACd,IAAI,SAAS,WAAW,GACtB,OAAO,CAAC;CAEV,MAAM,SAAiC,CAAC;CACxC,KAAK,MAAM,SAAS,OAAO,OAAO,OAAO,GACvC,OAAO,SAAS,cAAc,UAAU,KAAK;CAE/C,MAAM,UAAwB,CAAC;CAC/B,KAAK,MAAM,OAAO,QAAQ;EACxB,OAAO,IAAI,aAAa;EACxB,QAAQ,IAAI,SAAS,GAAG,iBAAiB,IAAI,QAAQ,IAAI,OAAO,IAAI;CACtE;CACA,OAAO;AACT;;AAGA,SAAgB,qBAAqB,YAAoB,OAAuB;CAC9E,MAAM,UAAU,MAAM,QAAQ,uBAAuB,MAAM;CAC3D,OAAO,WAAW,WAAW,IAAI,OAAO,MAAM,QAAQ,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,KAAK;AAC7E;;AAGA,SAAgB,kBAAkB,YAAoB,OAAuB;CAC3E,OAAO,aAAa,MAAM;AAC5B;;;AClJA,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;;;ACtJA,SAAS,eAAe,MAA2B;CACjD,OAAO,GAAG,KAAK,UAAU,GAAG,KAAK;AACnC;;;;;AAMA,SAAgB,mCACd,cACA,WACe;CACf,MAAM,SAAwB,CAAC;CAC/B,MAAM,uBAAO,IAAI,IAAY;CAE7B,KAAK,MAAM,QAAQ,cAAc;EAC/B,IAAI,CAAC,UAAU,IAAI,KAAK,SAAS,KAAK,CAAC,UAAU,IAAI,KAAK,SAAS,GAAG;GACpE,MAAM,MAAM,eAAe,IAAI;GAC/B,IAAI,CAAC,KAAK,IAAI,GAAG,GAAG;IAClB,KAAK,IAAI,GAAG;IACZ,OAAO,KAAK,EAAE,GAAG,KAAK,CAAC;GACzB;GACA;EACF;EAEA,MAAM,YAAY,UAAU,IAAI,KAAK,SAAS,KAAK,KAAK;EACxD,MAAM,YAAY,UAAU,IAAI,KAAK,SAAS,KAAK,KAAK;EACxD,IAAI,cAAc,WAChB;EAEF,MAAM,MAAM,GAAG,UAAU,GAAG;EAC5B,IAAI,KAAK,IAAI,GAAG,GACd;EAEF,KAAK,IAAI,GAAG;EACZ,OAAO,KAAK;GAAE;GAAW;EAAU,CAAC;CACtC;CAEA,OAAO;AACT;;;;;AAMA,SAAgB,mBACd,oBACA,aACA,OACA,WAAmC,CAAC,GACrB;CACf,MAAM,SAAS,SAAS,KAAI,UAAS,EAAE,GAAG,KAAK,EAAE;CACjD,MAAM,OAAO,IAAI,IAAI,OAAO,IAAI,cAAc,CAAC;CAE/C,KAAK,MAAM,QAAQ,oBAAoB;EACrC,IAAI,CAAC,YAAY,IAAI,KAAK,SAAS,KAAK,CAAC,YAAY,IAAI,KAAK,SAAS,GACrE;EAEF,MAAM,YAAY,MAAM,KAAK;EAC7B,MAAM,YAAY,MAAM,KAAK;EAC7B,IAAI,cAAc,UAAa,cAAc,UAAa,cAAc,WACtE;EAEF,MAAM,MAAM,GAAG,UAAU,GAAG;EAC5B,IAAI,KAAK,IAAI,GAAG,GACd;EAEF,KAAK,IAAI,GAAG;EACZ,OAAO,KAAK;GAAE;GAAW;EAAU,CAAC;CACtC;CAEA,OAAO;AACT;;AAGA,SAAgB,mBACd,cACA,YACe;CACf,OAAO,aAAa,QAAO,SAAQ,CAAC,WAAW,IAAI,KAAK,SAAS,KAAK,CAAC,WAAW,IAAI,KAAK,SAAS,CAAC;AACvG;;;;AC1EA,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;;;;;;;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,oBAAqD,OAAU,OAA0B;CACvG,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;;;;;;;ACxDA,SAAgB,yBAAyB,OAAqC,OAAyC;CACrH,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;CACpD,MAAM,UAAU,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC;CAC1D,MAAM,6BAAa,IAAI,IAAqB;CAC5C,MAAM,2BAAW,IAAI,IAAqB;CAC1C,MAAM,2BAAW,IAAI,IAAoB;CACzC,MAAM,6BAAa,IAAI,IAAsB;CAE7C,KAAK,MAAM,OAAO,OAAO;EACvB,SAAS,IAAI,IAAI,IAAI,IAAI,EAAE;EAC3B,WAAW,IAAI,IAAI,IAAI,CAAC,CAAC;CAC3B;CAEA,SAAS,cAAc,SAAsB,MAAuB;EAClE,IAAI,QAAQ,SAAS,GACnB,OAAO;EAET,IAAI,QAAQ,SAAS,GACnB,OAAO;EAET,MAAM,OAAO,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE;EACrC,OAAO,CAAC,aAAa,KAAK,QAAQ,KAAK,wBAAwB,KAAK,iBAAiB,CAAC,CAAC,SAAS;CAClG;CAEA,SAAS,eAAe,QAAwC;EAC9D,MAAM,0BAAU,IAAI,IAAY;EAChC,IAAI,CAAC,aAAa,OAAO,QAAQ,GAAG;GAClC,KAAK,MAAM,YAAY,MAAM,GAAG,OAAO,EAAE,CAAC,EAAE,UAAU,CAAC,GACrD,IAAI,EAAE,WAAW,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,IACrD,QAAQ,IAAI,SAAS,IAAI,QAAQ,KAAK,QAAQ;GAGlD,OAAO;EACT;EAEA,MAAM,aAAa,wBAAwB,OAAO,iBAAiB;EACnE,KAAK,MAAM,SAAS,eAAe,WAAW,IAAI,GAAG;GACnD,MAAM,SAAS,QAAQ,IAAI,KAAK;GAChC,IAAI,CAAC,QACH;GAEF,IAAI,EAAE,WAAW,IAAI,OAAO,EAAE,KAAK,SAAS,IAAI,OAAO,EAAE,IACvD,QAAQ,IAAI,SAAS,IAAI,OAAO,EAAE,KAAK,OAAO,EAAE;EAEpD;EACA,IAAI,cAAc,SAAS,WAAW,IAAI,GACxC,KAAK,MAAM,SAAS,eAAe,WAAW,IAAI,GAAG;GACnD,MAAM,SAAS,QAAQ,IAAI,KAAK;GAChC,IAAI,CAAC,QACH;GAEF,IAAI,CAAC,UAAU,OAAO,QAAQ,KAAK,EAAE,WAAW,IAAI,OAAO,EAAE,KAAK,SAAS,IAAI,OAAO,EAAE,IACtF,QAAQ,IAAI,SAAS,IAAI,OAAO,EAAE,KAAK,OAAO,EAAE;EAEpD;EAEF,OAAO;CACT;CAEA,SAAS,YAAY,QAAoC;EACvD,IAAI,OAAO,aAAa,QAAQ,cAAc,UAAU,OAAO,QAAQ,GACrE,OAAO;EAGT,KADqB,MAAM,GAAG,OAAO,EAAE,CAAC,EAAE,UAAU,CAAC,EACjD,CAAa,MAAK,OAAM,WAAW,IAAI,EAAE,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC,GACjE,OAAO;EAKT,OAAO,mBAHY,aAAa,OAAO,QAAQ,IAC3C,wBAAwB,OAAO,iBAAiB,CAAC,CAAC,OAClD,OAAO,iBACyB;CACtC;CAEA,KAAK,MAAM,SAAS,MAAM,iBAAiB,GAAG;EAC5C,MAAM,MAAM,KAAK,IAAI,KAAK;EAC1B,IAAI,CAAC,KACH;EAEF,WAAW,IAAI,OAAO,cAAc,IAAI,iBAAiB,CAAC;EAC1D,SAAS,IAAI,OAAO,YAAY,GAAG,CAAC;EACpC,IAAI,CAAC,SAAS,IAAI,KAAK,KAAK,IAAI,aAAa,QAAQ,YACnD;EAEF,MAAM,UAAU,eAAe,GAAG;EAClC,IAAI,QAAQ,SAAS,GACnB;EAEF,MAAM,WAAW,CAAC,GAAG,OAAO,CAAC,CAAC;EAC9B,MAAM,SAAS,KAAK,IAAI,QAAQ;EAChC,IAAI,CAAC,UAAU,UAAU,OAAO,QAAQ,GACtC;EAEF,SAAS,IAAI,OAAO,QAAQ;EAC5B,WAAW,IAAI,QAAQ,CAAC,CAAE,KAAK,KAAK;CACtC;CAEA,OAAO;EAAE;EAAU;CAAW;AAChC;;;;;;;;;;AClGA,SAAgB,2BAA2B,OAAoD;CAC7F,MAAM,QAAQ,IAAI,MAAc;CAChC,MAAM,UAAU,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC;CAC1D,KAAK,MAAM,OAAO,OAChB,MAAM,QAAQ,IAAI,EAAE;CAEtB,KAAK,MAAM,OAAO,OAChB,KAAK,MAAM,SAAS,eAAe,IAAI,iBAAiB,GAAG;EACzD,MAAM,WAAW,QAAQ,IAAI,KAAK;EAClC,IAAI,UACF,MAAM,QAAQ,SAAS,IAAI,IAAI,EAAE;CAErC;CAEF,OAAO;AACT;;;;;;;AAQA,SAAgB,wBACd,OACA,QAAuB,2BAA2B,KAAK,GACvD,YAA+B,yBAAyB,OAAO,KAAK,GAC/D;CACL,IAAI,MAAM,UAAU,GAClB,OAAO,CAAC,GAAG,KAAK;CAGlB,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;CACpD,MAAM,YAAY,eAAe,OAAO,OAAO,UAAU,QAAQ;CACjE,MAAM,OAAO,IAAI,IAAI,UAAU,KAAK,KAAK,UAAU,CAAC,IAAI,IAAI,KAAK,CAAC,CAAC;CAEnE,MAAM,kCAAkB,IAAI,IAAoB;CAChD,KAAK,MAAM,OAAO,WAAW;EAC3B,MAAM,SAAS,MAAM,GAAG,IAAI,EAAE,CAAC,EAAE,UAAU,CAAC;EAC5C,gBAAgB,IACd,IAAI,IACJ,OAAO,QAAQ,OAAO,QAAQ,SAAS,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,CAClE;CACF;CAEA,MAAM,wBAAQ,IAAI,IAAY;CAC9B,KAAK,MAAM,OAAO,WAChB,KAAK,gBAAgB,IAAI,IAAI,EAAE,KAAK,OAAO,GACzC,MAAM,IAAI,IAAI,EAAE;CAIpB,MAAM,2BAAW,IAAI,IAAsB;CAC3C,KAAK,MAAM,OAAO,WAChB,SAAS,IACP,IAAI,KACH,UAAU,WAAW,IAAI,IAAI,EAAE,KAAK,CAAC,EAAA,CAAG,QAAO,YAAW,KAAK,IAAI,OAAO,CAAC,CAC9E;CAGF,MAAM,SAAc,CAAC;CACrB,MAAM,kBAA4B,CAAC;CAEnC,SAAS,cAAc,cAAuC;EAC5D,MAAM,SAAS,aAAa,QAAO,YAAW,MAAM,IAAI,OAAO,KAAK,CAAC,gBAAgB,SAAS,OAAO,CAAC;EACtG,OAAO,MAAM,MAAM,WAAW,KAAK,IAAI,IAAI,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK,EAAE;EAC3E,gBAAgB,KAAK,GAAG,MAAM;CAChC;CAEA,SAAS,YAAoB;EAC3B,OAAO,gBAAgB,SAAS,GAAG;GACjC,MAAM,UAAU,gBAAgB,MAAM;GACtC,IAAI,MAAM,IAAI,OAAO,GACnB,OAAO;EAEX;EACA,IAAI,OAAO;EACX,IAAI,WAAW,OAAO;EACtB,KAAK,MAAM,UAAU,OAAO;GAC1B,MAAM,WAAW,KAAK,IAAI,MAAM,KAAK,OAAO;GAC5C,IAAI,WAAW,UAAU;IACvB,OAAO;IACP,WAAW;GACb;EACF;EACA,OAAO;CACT;CAEA,OAAO,MAAM,OAAO,KAAK,gBAAgB,SAAS,GAAG;EACnD,IAAI,MAAM,SAAS,GAAG;GACpB,gBAAgB,SAAS;GACzB;EACF;EACA,MAAM,SAAS,UAAU;EACzB,MAAM,OAAO,MAAM;EACnB,OAAO,KAAK,KAAK,IAAI,MAAM,CAAE;EAE7B,KAAK,MAAM,eAAe,MAAM,GAAG,MAAM,CAAC,EAAE,WAAW,CAAC,GAAG;GACzD,IAAI,CAAC,gBAAgB,IAAI,WAAW,GAClC;GAEF,MAAM,QAAQ,gBAAgB,IAAI,WAAW,KAAK,KAAK;GACvD,gBAAgB,IAAI,aAAa,IAAI;GACrC,IAAI,SAAS,GACX,MAAM,IAAI,WAAW;EAEzB;EAEA,cAAc,SAAS,IAAI,MAAM,KAAK,CAAC,CAAC;CAC1C;CAEA,IAAI,OAAO,SAAS,UAAU,QAAQ;EACpC,MAAM,SAAS,IAAI,IAAI,OAAO,KAAI,QAAO,IAAI,EAAE,CAAC;EAChD,KAAK,MAAM,OAAO,WAChB,IAAI,CAAC,OAAO,IAAI,IAAI,EAAE,GACpB,OAAO,KAAK,GAAG;CAGrB;CAEA,OAAO;AACT;AAEA,SAAS,eACP,OACA,OACA,UACK;CACL,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;CACpD,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,SAAc,CAAC;CAErB,SAAS,KAAK,KAAc;EAC1B,IAAI,KAAK,IAAI,IAAI,EAAE,GACjB;EAEF,KAAK,IAAI,IAAI,EAAE;EACf,OAAO,KAAK,GAAG;CACjB;CAEA,KAAK,MAAM,OAAO,OAChB,IAAI,IAAI,aAAa,QAAQ,MAC3B,KAAK,GAAG;CAGZ,KAAK,MAAM,OAAO,OAChB,IAAI,IAAI,aAAa,QAAQ,UAC3B,KAAK,GAAG;CAGZ,KAAK,MAAM,OAAO,OAChB,KAAK,MAAM,GAAG,IAAI,EAAE,CAAC,EAAE,OAAO,UAAU,OAAO,GAC7C,KAAK,GAAG;CAIZ,MAAM,cAAc,MACjB,QAAO,QAAO;EACb,MAAM,WAAW,SAAS,IAAI,IAAI,EAAE,KAAK,IAAI;EAC7C,MAAM,SAAS,KAAK,IAAI,QAAQ;EAChC,OACE,IAAI,aAAa,QAAQ,cAAc,IAAI,aAAa,QAAQ,SAAS,QAAQ,aAAa,QAAQ;CAE1G,CAAC,CAAC,CACD,KAAI,QAAO,IAAI,EAAE;CACpB,MAAM,yBAAS,IAAI,IAAY,CAAC,GAAG,aAAa,GAAG,MAAM,gBAAgB,WAAW,CAAC,CAAC;CACtF,KAAK,MAAM,OAAO,OAChB,IAAI,OAAO,IAAI,IAAI,EAAE,GACnB,KAAK,GAAG;CAGZ,KAAK,MAAM,OAAO,OAChB,KAAK,GAAG;CAEV,OAAO;AACT;;;;;;;AClLA,SAAgB,cAAc,KAAiC;CAC7D,QACG,IAAI,aAAa,UAAU,KAAK,KAAK,IAAI,WAAW,UAAU,aAAa,IAAI,WAAW,UAAU;AAEzG;;AAGA,SAAgB,qBAAqB,QAA6B;CAChE,MAAM,QAAqB;EACzB,WAAW,OAAO,MAAM;EACxB,eAAe;EACf,iBAAiB;EACjB,mBAAmB;EACnB,gBAAgB;EAChB,yBAAyB;EACzB,0BAA0B;EAC1B,qBAAqB;EACrB,iBAAiB;EACjB,gBAAgB;EAChB,oBAAoB;EACpB,iBAAiB;EACjB,iBAAiB;EACjB,kBAAkB;EAClB,kBAAkB;EAClB,eAAe;EACf,YAAY;EACZ,gBAAgB;EAChB,kBAAkB;EAClB,aAAa;EACb,YAAY;EACZ,gBAAgB;EAChB,iBAAiB;EACjB,iBAAiB;EACjB,eAAe;CACjB;CAEA,KAAK,MAAM,OAAO,OAAO,OAAO;EAC9B,IAAI,IAAI,SACN,MAAM,iBAAiB;EAEzB,MAAM,mBAAmB,wBAAwB,GAAG;EAEpD,IAAI,cAAc,GAAG,GACnB,MAAM,qBAAqB;EAE7B,IAAI,iBAAiB,KAAK,iBAAiB,aAAa,GACtD,MAAM,kBAAkB;EAE1B,IAAI,iBAAiB,KAAK,iBAAiB,qBAAqB,GAC9D,MAAM,2BAA2B;EAEnC,IAAI,mBAAmB,GAAG,GACxB,MAAM,4BAA4B;EAEpC,IAAI,IAAI,kBACN,MAAM,uBAAuB;EAE/B,IAAI,IAAI,WAAW,UAAU,WAC3B,MAAM,mBAAmB;EAE3B,IAAI,IAAI,UAAU,eAAe,WAAW,UAC1C,MAAM,kBAAkB;EAE1B,IAAI,IAAI,UAAU,WAAW,IAAI,SAAS,eAAe,MACvD,MAAM,sBAAsB;EAE9B,IAAI,IAAI,cACN,MAAM,mBAAmB;EAE3B,IAAI,IAAI,UACN,MAAM,mBAAmB;EAE3B,IAAI,IAAI,gBACN,MAAM,oBAAoB;EAE5B,IAAI,eAAe,IAAI,QAAQ,KAAK,IAAI,YACtC,MAAM,oBAAoB;EAE5B,IAAI,CAAC,eAAe,IAAI,QAAQ,KAAK,CAAC,IAAI,YACxC,MAAM,iBAAiB;EAGzB,QAAQ,IAAI,UAAZ;GACE,KAAK,QAAQ;IACX,MAAM,cAAc;IACpB;GACF,KAAK,QAAQ;IACX,MAAM,kBAAkB;IACxB;GACF,KAAK,QAAQ;IACX,MAAM,oBAAoB;IAC1B;GACF,KAAK,QAAQ;IACX,MAAM,eAAe;IACrB;GACF,KAAK,QAAQ;IACX,MAAM,cAAc;IACpB;GACF,KAAK,QAAQ;IACX,MAAM,kBAAkB;IACxB;GACF,KAAK,QAAQ;IACX,MAAM,mBAAmB;IACzB;GACF,KAAK,QAAQ;IACX,MAAM,mBAAmB;IACzB;GACF,KAAK,QAAQ;IACX,MAAM,iBAAiB;IACvB;EACJ;CACF;CAEA,OAAO;AACT;AAEA,SAAS,wBAAwB,KAAqC;CACpE,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;;AAGA,SAAS,mBAAmB,KAAoC;CAC9D,IAAI,CAAC,eAAe,IAAI,QAAQ,KAAK,UAAU,IAAI,QAAQ,GACzD,OAAO;CAET,OAAO,CAAC,IAAI,WAAW,KAAK,KAAK,CAAC,IAAI,cAAc,KAAK;AAC3D;;;;;;;;;;AC3JA,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,mBAAmB,QAAgB,QAAwB,MAAqC;CAC9G,MAAM,OAAO,OAAO,WAAW,IAAI,IAAI,OAAO,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CAChF,KAAK,MAAM,OAAO,OAAO,OAAO;EAC9B,IAAI,CAAC,IAAI,cACP;EAEF,MAAM,eAAe,2BAA2B,KAAK,OAAO,IAAI,IAAI;EACpE,IAAI,cAAc,WAAW,KAAK,UAAU,aAAa,OAAO,GAAG,MAAM,MAAM,KAAK,EAAE,GACpF,OAAO;CAEX;CACA,OAAO;AACT;;AAGA,SAAgB,iBACd,QACA,QACA,MACQ;CACR,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;AAEA,SAAS,2BACP,KACA,UACA,MACiB;CACjB,IAAI,CAAC,IAAI,gBAAgB,IAAI,WAAW,MACtC,OAAO;CAET,IAAI,IAAI,YAAY,UAClB,OAAO,IAAI;CAGb,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;;;;;;;AC3EA,SAAgB,8BACd,OACA,cACA,eACuB;CACvB,IAAI,cAAc,WAAW,GAC3B,OAAO;EACL,OAAO,CAAC,GAAG,KAAK;EAChB,cAAc,aAAa,KAAI,UAAS,EAAE,GAAG,KAAK,EAAE;EACpD,4BAAY,IAAI,IAAI;EACpB,gBAAgB,CAAC;CACnB;CAGF,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;CACpD,MAAM,UAAwB,CAAC;CAC/B,MAAM,6BAAa,IAAI,IAAY;CACnC,MAAM,4BAAY,IAAI,IAAoB;CAC1C,MAAM,iBAA2B,CAAC;CAElC,KAAK,MAAM,EAAE,UAAU,kBAAkB,eAAe;EACtD,MAAM,cAAc,KAAK,IAAI,QAAQ;EACrC,MAAM,kBAAkB,KAAK,IAAI,YAAY;EAC7C,IAAI,CAAC,eAAe,CAAC,iBACnB,MAAM,IAAI,MAAM,uDAAuD,SAAS,MAAM,cAAc;EAEtG,QAAQ,YAAY,SAAS,gBAAgB;EAC7C,WAAW,IAAI,QAAQ;EACvB,UAAU,IAAI,UAAU,YAAY;EACpC,eAAe,KAAK,YAAY;CAClC;CAEA,MAAM,YAAY,MAAM,QAAO,QAAO,CAAC,WAAW,IAAI,IAAI,EAAE,CAAC;CAC7D,2BAA2B,WAAW,SAAS,KAAK;CAEpD,OAAO;EACL,OAAO;EACP,cAAc,mCAAmC,cAAc,SAAS;EACxE;EACA;CACF;AACF;;;;;AAMA,SAAgB,8BACd,eACA,aACA,OACgB;CAChB,OAAO,cAAc,KAAI,QAAO;EAC9B,IAAI,YAAY,IAAI,IAAI,QAAQ,GAC9B,OAAO;GAAE,UAAU,MAAM,IAAI;GAAW,cAAc,IAAI;EAAa;EAEzE,OAAO;GAAE,UAAU,IAAI;GAAU,cAAc,MAAM,IAAI;EAAc;CACzE,CAAC;AACH;;;;AC7DA,SAAgB,wBAAwB,OAAuD;CAC7F,OAAO,oBAAoB,OAAO,UAAU;AAC9C;;AAGA,SAAgB,8BAA8B,OAAuD;CACnG,OAAO,oBAAoB,OAAO,gBAAgB;AACpD;;AAGA,SAAgB,2BAA2B,OAAqC;CAC9E,MAAM,YAAY,wBAAwB,KAAK;CAC/C,MAAM,WAAW,IAAI,IAAI,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CAC3D,MAAM,UAAU,iBAAiB,KAAK;CAEtC,KAAK,MAAM,MAAM,UAAU,iBAAiB,GAAG;EAC7C,MAAM,MAAM,SAAS,IAAI,EAAE;EAC3B,IAAI,CAAC,KACH;EAEF,MAAM,WAAW,sBAAsB,IAAI,UAAU,OAAO;EAC5D,IAAI,aAAa,IAAI,eAAe;GAClC,IAAI,gBAAgB;GACpB,IAAI,aAAa,CAAC;GAClB,QAAQ,IAAI,SAAS;IAAE,SAAS,IAAI;IAAe,OAAO,CAAC;GAAE;EAC/D;CACF;CAEA,KAAK,MAAM,OAAO,OAChB,IAAI,sBAAsB,sBAAsB,IAAI,gBAAgB,OAAO;AAE/E;;;;;AAMA,SAAgB,6BACd,OACA,UACA,SACM;CACN,MAAM,WAAW,IAAI,IAAI,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CAC3D,MAAM,SAAS,SAAS,IAAI,QAAQ;CACpC,IAAI,CAAC,QACH,MAAM,IAAI,MAAM,gDAAgD,UAAU;CAG5E,MAAM,UAAU,iBAAiB,KAAK;CACtC,IAAI,QAAQ,gBAAgB;EAC1B,OAAO,gBAAgB,sBAAsB,OAAO,UAAU,OAAO;EACrE,IAAI,QAAQ,kBACV,OAAO,aAAa,CAAC;EAEvB,QAAQ,OAAO,SAAS,cAAc,MAAM;CAC9C,OAAO,IAAI,QAAQ,aACjB,QAAQ,OAAO,SAAS,cAAc,MAAM;CAG9C,IAAI,QAAQ,wBAAwB,CAAC,QAAQ,aAC3C,OAAO,sBAAsB,sBAAsB,OAAO,gBAAgB,OAAO;CAGnF,IAAI,CAAC,QAAQ,aACX;CAGF,MAAM,YAAY,wBAAwB,KAAK;CAC/C,MAAM,YAAY,8BAA8B,KAAK;CACrD,MAAM,YAAY,UAAU,iBAAiB,CAAC,QAAQ,CAAC;CACvD,MAAM,eAAe,IAAI,IAAI,SAAS;CAEtC,KAAK,MAAM,MAAM,UAAU,iBAAiB,GAAG;EAC7C,IAAI,CAAC,aAAa,IAAI,EAAE,GACtB;EAEF,MAAM,WAAW,SAAS,IAAI,EAAE;EAChC,IAAI,CAAC,UACH;EAEF,MAAM,WAAW,sBAAsB,SAAS,UAAU,OAAO;EACjE,IAAI,aAAa,SAAS,eAAe;GACvC,SAAS,gBAAgB;GACzB,SAAS,aAAa,CAAC;GACvB,QAAQ,SAAS,SAAS;IAAE,SAAS,SAAS;IAAe,OAAO,CAAC;GAAE;EACzE;CACF;CAEA,MAAM,6BAAa,IAAI,IAAI;EAAC;EAAU,GAAG;EAAW,GAAG,UAAU,iBAAiB,CAAC,UAAU,GAAG,SAAS,CAAC;CAAC,CAAC;CAC5G,KAAK,MAAM,QAAQ,OACjB,IAAI,WAAW,IAAI,KAAK,EAAE,GACxB,KAAK,sBAAsB,sBAAsB,KAAK,gBAAgB,OAAO;AAGnF;AAIA,SAAS,oBACP,OACA,OACe;CACf,MAAM,QAAQ,IAAI,MAAc;CAChC,MAAM,YAAY,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,OAAO,IAAI,EAAE,CAAC,CAAC;CAC/D,KAAK,MAAM,OAAO,OAChB,MAAM,QAAQ,IAAI,EAAE;CAEtB,KAAK,MAAM,OAAO,OAChB,KAAK,MAAM,UAAU,gBAAgB,IAAI,MAAM,GAAG;EAChD,MAAM,SAAS,UAAU,IAAI,MAAM;EACnC,IAAI,WAAW,QACb,MAAM,QAAQ,QAAQ,IAAI,EAAE;CAEhC;CAEF,OAAO;AACT;AAEA,SAAS,iBAAiB,OAAqD;CAC7E,MAAM,UAAuB,CAAC;CAC9B,KAAK,MAAM,OAAO,OAChB,QAAQ,IAAI,SAAS,cAAc,GAAG;CAExC,OAAO;AACT;AAEA,SAAS,cAAc,KAAgD;CACrE,OAAO;EACL,SAAS,IAAI;EACb,OAAO,IAAI,WAAW,KAAI,UAAS;GAAE,MAAM,KAAK;GAAM,OAAO,eAAe,KAAK,IAAI;EAAE,EAAE;CAC3F;AACF;;;;;;;;AC9EA,SAAgB,gBACd,OAC0B;CAC1B,MAAM,cAAc,MAAM;CAC1B,IAAI,YAAY,WAAW,GACzB,OAAO;EACL,OAAO,MAAM,cAAc,KAAI,SAAQ,gBAAgB,IAAI,CAAC;EAC5D,eAAe,MAAM,wBAAwB,CAAC,EAAA,CAAG,KAAI,UAAS,EAAE,GAAG,KAAK,EAAE;EAC1E,QAAQ,MAAM;EACd,OAAO,CAAC;EACR,cAAc,CAAC;EACf,4BAAY,IAAI,IAAI;EACpB,aAAa,CAAC;EACd,gBAAgB,CAAC;CACnB;CAGF,MAAM,gBAAgB,MAAM,cAAc,KAAI,SAAQ,gBAAgB,IAAI,CAAC;CAC3E,IAAI,gBAAgB,MAAM,wBAAwB,CAAC,EAAA,CAAG,KAAI,UAAS,EAAE,GAAG,KAAK,EAAE;CAC/E,MAAM,eAAe,sBAAsB,eAAe,WAAW;CACrE,MAAM,QAAgC,CAAC;CACvC,MAAM,WAAgB,CAAC;CACvB,MAAM,cAAc,IAAI,IAAI,YAAY,KAAI,QAAO,IAAI,EAAE,CAAC;CAC1D,IAAI,SAAS,MAAM;CAEnB,KAAK,MAAM,OAAO,aAAa;EAC7B,MAAM,QAAQ;EACd,UAAU;EACV,MAAM,IAAI,MAAM;EAEhB,MAAM,SAAS,gBAAgB,GAAG;EAClC,OAAO,KAAK;EACZ,IAAI,OAAO,KAAK,YAAY,CAAC,CAAC,SAAS,GAAG;GACxC,OAAO,QAAQ,aAAa,IAAI;GAChC,2BAA2B,CAAC,MAAM,GAAG,cAAc,KAAK;EAC1D;EACA,SAAS,KAAK,MAAM;CACtB;CAEA,eAAe,mBAAmB,MAAM,sBAAsB,CAAC,GAAG,aAAa,OAAO,YAAY;CAClG,MAAM,QAAQ,cAAc,OAAO,QAAQ;CAC3C,2BAA2B,KAAK;CAEhC,MAAM,gBAAgB,MAAM,iBAAiB,CAAC;CAC9C,IAAI,cAAc,WAAW,GAC3B,OAAO;EACL;EACA;EACA;EACA;EACA;EACA,4BAAY,IAAI,IAAI;EACpB,aAAa,SAAS,KAAI,QAAO,IAAI,EAAE;EACvC,gBAAgB,CAAC;CACnB;CAGF,MAAM,WAAW,8BAA8B,eAAe,aAAa,KAAK;CAChF,MAAM,cAAc,8BAA8B,OAAO,cAAc,QAAQ;CAC/E,2BAA2B,YAAY,KAAK;CAE5C,OAAO;EACL,OAAO,YAAY;EACnB,cAAc,YAAY;EAC1B;EACA;EACA;EACA,YAAY,YAAY;EACxB,aAAa,SAAS,KAAI,QAAO,IAAI,EAAE;EACvC,gBAAgB,YAAY;CAC9B;AACF;;AAGA,SAAgB,4BAA4B,UAAkB,OAA8C;CAC1G,MAAM,SAAS,MAAM,QAAO,SAAQ,KAAK,aAAa,SAAS,QAAQ;CACvE,MAAM,WAAW,IAAI,IAAI,MAAM;CAC/B,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,WAAW,KAAK,UAAU,SAAS,SAAS,CAAC,SAAS,IAAI,IAAI,GAAG;EACxE,OAAO,KAAK,IAAI;EAChB,SAAS,IAAI,IAAI;CACnB;CAEF,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,WAAW,CAAC,SAAS,IAAI,IAAI,GAAG;EACvC,OAAO,KAAK,IAAI;EAChB,SAAS,IAAI,IAAI;CACnB;CAEF,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,SAAS,IAAI,IAAI,GAAG;EACvB,OAAO,KAAK,IAAI;EAChB,SAAS,IAAI,IAAI;CACnB;CAEF,OAAO;AACT;;;;;;;ACpKA,SAAgB,kBAA4C,OAAqB,YAAoC;CACnH,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CACvD,OAAO,WAAW,KAAI,OAAM;EAC1B,MAAM,OAAO,KAAK,IAAI,EAAE;EACxB,IAAI,CAAC,MACH,MAAM,IAAI,MAAM,iCAAiC,IAAI;EAEvD,OAAO;CACT,CAAC;AACH;;;;;AAMA,SAAgB,eAAe,KAAwB,QAA2B,QAA0B;CAC1G,MAAM,YAAY,IAAI,IAAI,MAAM;CAChC,MAAM,OAAO,IAAI,QAAO,OAAM,CAAC,UAAU,IAAI,EAAE,CAAC;CAChD,MAAM,cAAc,IAAI,QAAO,OAAM,UAAU,IAAI,EAAE,CAAC;CACtD,MAAM,UAAU,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,KAAK,MAAM,CAAC;CACzD,OAAO;EAAC,GAAG,KAAK,MAAM,GAAG,OAAO;EAAG,GAAG;EAAa,GAAG,KAAK,MAAM,OAAO;CAAC;AAC3E;;AAGA,SAAgB,gBACd,OACA,MACA,aACM;CACN,IAAI,gBAAgB,QAAQ,gBAAgB,QAAW;EACrD,MAAM,KAAK,IAAI;EACf;CACF;CACA,MAAM,MAAM,MAAM,WAAU,QAAO,IAAI,OAAO,WAAW;CACzD,MAAM,WAAW,QAAQ,KAAK,MAAM,SAAS,MAAM;CACnD,MAAM,OAAO,UAAU,GAAG,IAAI;AAChC;;;;AC3BA,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,iBACd,KACA,MACS;CACT,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,8BACP,KAKiB;CACjB,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,IAAiB;CACpC,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"}
+{"version":3,"file":"diagnostics-D1Cp21nP.js","names":[],"sources":["../src/library/rsform-api/cst-type.ts","../src/library/rsform-api/alias.ts","../src/library/rsform-api/analysis.ts","../src/library/rsform-api/attribution.ts","../src/library/rsform-api/expression.ts","../src/library/rsform-api/semantic-relations.ts","../src/library/rsform-api/formal-graph.ts","../src/library/rsform-api/stats.ts","../src/library/rsform-api/structure.ts","../src/library/rsform-api/substitution.ts","../src/library/rsform-api/text-resolution.ts","../src/library/rsform-api/synthesis.ts","../src/library/rsform-api/transforms.ts","../src/library/diagnostics.ts"],"sourcesContent":["/**\n * CstType classification, prefixes, and capability predicates.\n */\n\nimport { TypeClass, TypeID, type Typification } from '../../rslang';\nimport { type EchelonFunctional, isTypification } from '../../rslang/semantic/typification';\nimport { CstClass, CstType } from '../rsform';\n\nimport { type StructureCapableFields } from './types';\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/** 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/** 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 item type is a template or a category. */\nexport function isTemplateCst(cst: { cst_type: CstType }): boolean {\n  return cst.cst_type === CstType.FUNCTION || cst.cst_type === CstType.PREDICATE || cst.cst_type === CstType.STATEMENT;\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 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/** 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/** 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/** Evaluate if an item can be used to produce structure. */\nexport function canProduceStructure(cst: StructureCapableFields): 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\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 * Alias generation, validation, and remapping.\n */\n\nimport { applyEntityReferenceMapping } from '../../cctext/language-api';\nimport { type AliasMapping, applyAliasMapping, applyTypificationMapping } from '../../rslang/api';\nimport { type ArgumentValue, CstType, type RSForm } from '../rsform';\n\nimport { getCstTypePrefix } from './cst-type';\nimport { type AliasTypedFields } from './types';\n\n/** Fields updated in place by alias mapping. */\nexport interface MappableFields {\n  alias: string;\n  definition_formal: string;\n  typification_manual: string;\n  term_raw: string;\n  definition_raw: string;\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/** 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  let index = schema.items.reduce((prev, cst) => {\n    if (cst.cst_type !== type) {\n      return prev;\n    }\n    const next = Number(cst.alias.substring(prefix.length)) + 1;\n    return Math.max(prev, next);\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 * 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 MappableFields>(\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/** Highest numeric alias suffix for {@link type} among {@link items} (0 when none). */\nexport function maxAliasIndex(items: readonly AliasTypedFields[], type: CstType): number {\n  const prefix = getCstTypePrefix(type);\n  return items.reduce((max, cst) => {\n    if (cst.cst_type !== type) {\n      return max;\n    }\n    const index = Number(cst.alias.slice(prefix.length));\n    return Number.isFinite(index) ? Math.max(max, index) : max;\n  }, 0);\n}\n\n/**\n * Build alias → new-alias mapping that renumbers each type sequentially in list order.\n * Matches backend {@code RSFormCached.reset_aliases}.\n */\nexport function buildSequentialAliasMapping(items: readonly AliasTypedFields[]): AliasMapping {\n  const counts: Record<string, number> = {};\n  for (const value of Object.values(CstType)) {\n    counts[value] = 1;\n  }\n  const mapping: AliasMapping = {};\n  for (const cst of items) {\n    const alias = `${getCstTypePrefix(cst.cst_type)}${counts[cst.cst_type]}`;\n    counts[cst.cst_type] += 1;\n    if (cst.alias !== alias) {\n      mapping[cst.alias] = alias;\n    }\n  }\n  return mapping;\n}\n\n/**\n * Allocate fresh aliases for {@link source} constituents being imported into a non-empty receiver.\n * Returns an empty mapping when the receiver has no items (aliases kept as-is).\n */\nexport function allocateImportAliases(\n  receiver: readonly AliasTypedFields[],\n  source: readonly AliasTypedFields[]\n): AliasMapping {\n  if (receiver.length === 0) {\n    return {};\n  }\n  const counts: Record<string, number> = {};\n  for (const value of Object.values(CstType)) {\n    counts[value] = maxAliasIndex(receiver, value);\n  }\n  const mapping: AliasMapping = {};\n  for (const cst of source) {\n    counts[cst.cst_type] += 1;\n    mapping[cst.alias] = `${getCstTypePrefix(cst.cst_type)}${counts[cst.cst_type]}`;\n  }\n  return mapping;\n}\n\n/** Remove alias from expression. */\nexport function removeAliasReference(expression: string, alias: string): string {\n  const escaped = alias.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n  return expression.replaceAll(new RegExp(`\\\\b${escaped}\\\\b`, 'g'), '').trim();\n}\n\n/** Add alias to expression. */\nexport function addAliasReference(expression: string, alias: string): string {\n  return expression + ' ' + alias;\n}\n","/**\n * Formal expression analysis against an RSForm schema.\n */\n\nimport { type Graph } from '../../graph';\nimport { type AnalysisFull, RSErrorCode, ValueClass } from '../../rslang';\nimport { extractGlobals } from '../../rslang/api';\nimport { basic, bool, constant } from '../../rslang/semantic/typification';\nimport { formatDependencyCycle, RSDiagnosticCode } from '../diagnostics';\nimport { CstType, type RSForm } from '../rsform';\n\nimport { canHaveFormalDefinition, typeClassForCstType } from './cst-type';\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 * Attribution remapping helpers for substitution and schema embedding.\n */\n\nimport { type Attribution } from '../rsform';\n\nfunction attributionKey(attr: Attribution): string {\n  return `${attr.container}:${attr.attribute}`;\n}\n\n/**\n * Remap attributions when constituents are substituted (original → replacement).\n * Drops self-loops and duplicates. Matches sandbox / backend substitute attribution rewrite.\n */\nexport function remapAttributionsUnderSubstitution(\n  attributions: readonly Attribution[],\n  origToSub: ReadonlyMap<number, number>\n): Attribution[] {\n  const result: Attribution[] = [];\n  const seen = new Set<string>();\n\n  for (const attr of attributions) {\n    if (!origToSub.has(attr.container) && !origToSub.has(attr.attribute)) {\n      const key = attributionKey(attr);\n      if (!seen.has(key)) {\n        seen.add(key);\n        result.push({ ...attr });\n      }\n      continue;\n    }\n\n    const container = origToSub.get(attr.container) ?? attr.container;\n    const attribute = origToSub.get(attr.attribute) ?? attr.attribute;\n    if (container === attribute) {\n      continue;\n    }\n    const key = `${container}:${attribute}`;\n    if (seen.has(key)) {\n      continue;\n    }\n    seen.add(key);\n    result.push({ container, attribute });\n  }\n\n  return result;\n}\n\n/**\n * Copy attributions whose both endpoints are in {@link sourceIdSet}, remapping ids via {@link idMap}.\n * Appends onto a clone of {@link existing} with dedupe. Used by schema embedding / insert.\n */\nexport function importAttributions(\n  sourceAttributions: readonly Attribution[],\n  sourceIdSet: ReadonlySet<number>,\n  idMap: Readonly<Record<number, number>>,\n  existing: readonly Attribution[] = []\n): Attribution[] {\n  const result = existing.map(attr => ({ ...attr }));\n  const seen = new Set(result.map(attributionKey));\n\n  for (const attr of sourceAttributions) {\n    if (!sourceIdSet.has(attr.container) || !sourceIdSet.has(attr.attribute)) {\n      continue;\n    }\n    const container = idMap[attr.container];\n    const attribute = idMap[attr.attribute];\n    if (container === undefined || attribute === undefined || container === attribute) {\n      continue;\n    }\n    const key = `${container}:${attribute}`;\n    if (seen.has(key)) {\n      continue;\n    }\n    seen.add(key);\n    result.push({ container, attribute });\n  }\n\n  return result;\n}\n\n/** Drop attributions that reference any id in {@link deletedIds}. */\nexport function filterAttributions(\n  attributions: readonly Attribution[],\n  deletedIds: ReadonlySet<number>\n): Attribution[] {\n  return attributions.filter(attr => !deletedIds.has(attr.container) && !deletedIds.has(attr.attribute));\n}\n","/**\n * Formal expression helpers: normalization, templates, status.\n */\n\nimport { type AstNode } from '../../parsing';\nimport { ValueClass } from '../../rslang';\nimport { generateExpressionFromAst, parseRSLangExpression } from '../../rslang/api';\nimport { type ArgumentValue, CstStatus, CstType } from '../rsform';\n\nimport { isBasicConcept } from './cst-type';\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/**\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/** Apply filter based on start item type within an ordered list. */\nexport function applyFilterCategory<T extends { cst_type: CstType }>(start: T, items: readonly T[]): T[] {\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 * Semantic parent/children used when restoring constituent order.\n */\n\nimport { type Graph } from '../../graph';\nimport { extractGlobals, isSimpleExpression, splitTemplateDefinition } from '../../rslang/api';\nimport { CstType } from '../rsform';\n\nimport { isBaseSet, isFunctional } from './cst-type';\nimport { inferTemplate } from './expression';\nimport { type FormalOrderFields, type SemanticRelations } from './types';\n\n/**\n * Infer semantic parent/children used for clustering during restore order.\n * Port of backend {@code SemanticInfo}.\n */\nexport function computeSemanticRelations(items: readonly FormalOrderFields[], graph: Graph<number>): SemanticRelations {\n  const byId = new Map(items.map(cst => [cst.id, cst]));\n  const byAlias = new Map(items.map(cst => [cst.alias, cst]));\n  const isTemplate = new Map<number, boolean>();\n  const isSimple = new Map<number, boolean>();\n  const parentOf = new Map<number, number>();\n  const childrenOf = new Map<number, number[]>();\n\n  for (const cst of items) {\n    parentOf.set(cst.id, cst.id);\n    childrenOf.set(cst.id, []);\n  }\n\n  function needCheckHead(sources: Set<number>, head: string): boolean {\n    if (sources.size === 0) {\n      return true;\n    }\n    if (sources.size !== 1) {\n      return false;\n    }\n    const base = byId.get([...sources][0])!;\n    return !isFunctional(base.cst_type) || splitTemplateDefinition(base.definition_formal).head !== head;\n  }\n\n  function extractSources(target: FormalOrderFields): Set<number> {\n    const sources = new Set<number>();\n    if (!isFunctional(target.cst_type)) {\n      for (const parentId of graph.at(target.id)?.inputs ?? []) {\n        if (!(isTemplate.get(parentId) && isSimple.get(parentId))) {\n          sources.add(parentOf.get(parentId) ?? parentId);\n        }\n      }\n      return sources;\n    }\n\n    const expression = splitTemplateDefinition(target.definition_formal);\n    for (const alias of extractGlobals(expression.body)) {\n      const parent = byAlias.get(alias);\n      if (!parent) {\n        continue;\n      }\n      if (!(isTemplate.get(parent.id) && isSimple.get(parent.id))) {\n        sources.add(parentOf.get(parent.id) ?? parent.id);\n      }\n    }\n    if (needCheckHead(sources, expression.head)) {\n      for (const alias of extractGlobals(expression.head)) {\n        const parent = byAlias.get(alias);\n        if (!parent) {\n          continue;\n        }\n        if (!isBaseSet(parent.cst_type) && !(isTemplate.get(parent.id) && isSimple.get(parent.id))) {\n          sources.add(parentOf.get(parent.id) ?? parent.id);\n        }\n      }\n    }\n    return sources;\n  }\n\n  function inferSimple(target: FormalOrderFields): boolean {\n    if (target.cst_type === CstType.STRUCTURED || isBaseSet(target.cst_type)) {\n      return false;\n    }\n    const dependencies = graph.at(target.id)?.inputs ?? [];\n    if (dependencies.some(id => isTemplate.get(id) && !isSimple.get(id))) {\n      return false;\n    }\n    const expression = isFunctional(target.cst_type)\n      ? splitTemplateDefinition(target.definition_formal).body\n      : target.definition_formal;\n    return isSimpleExpression(expression);\n  }\n\n  for (const cstId of graph.topologicalOrder()) {\n    const cst = byId.get(cstId);\n    if (!cst) {\n      continue;\n    }\n    isTemplate.set(cstId, inferTemplate(cst.definition_formal));\n    isSimple.set(cstId, inferSimple(cst));\n    if (!isSimple.get(cstId) || cst.cst_type === CstType.STRUCTURED) {\n      continue;\n    }\n    const sources = extractSources(cst);\n    if (sources.size !== 1) {\n      continue;\n    }\n    const parentId = [...sources][0];\n    const parent = byId.get(parentId);\n    if (!parent || isBaseSet(parent.cst_type)) {\n      continue;\n    }\n    parentOf.set(cstId, parentId);\n    childrenOf.get(parentId)!.push(cstId);\n  }\n\n  return { parentOf, childrenOf };\n}\n","/**\n * Formal dependency graph and declaration-order restore for RSForm constituents.\n */\n\nimport { Graph } from '../../graph';\nimport { extractGlobals } from '../../rslang/api';\nimport { CstType } from '../rsform';\n\nimport { computeSemanticRelations } from './semantic-relations';\nimport { type FormalOrderFields, type SemanticRelations } from './types';\n\n/**\n * Build the formal dependency graph: supplier → dependent.\n * Matches backend {@code RSForm.graph_formal}.\n */\nexport function buildFormalDependencyGraph(items: readonly FormalOrderFields[]): Graph<number> {\n  const graph = new Graph<number>();\n  const byAlias = new Map(items.map(cst => [cst.alias, cst]));\n  for (const cst of items) {\n    graph.addNode(cst.id);\n  }\n  for (const cst of items) {\n    for (const alias of extractGlobals(cst.definition_formal)) {\n      const supplier = byAlias.get(alias);\n      if (supplier) {\n        graph.addEdge(supplier.id, cst.id);\n      }\n    }\n  }\n  return graph;\n}\n\n/**\n * Reorder constituents: formal topology hard, semantic children sticky when ready,\n * otherwise stable against type/kernel preferred ranks.\n *\n * One Kahn pass over the formal dependency graph.\n */\nexport function restoreConstituentOrder<T extends FormalOrderFields>(\n  items: readonly T[],\n  graph: Graph<number> = buildFormalDependencyGraph(items),\n  relations: SemanticRelations = computeSemanticRelations(items, graph)\n): T[] {\n  if (items.length <= 1) {\n    return [...items];\n  }\n\n  const byId = new Map(items.map(cst => [cst.id, cst]));\n  const preferred = kernelPriority(items, graph, relations.parentOf);\n  const rank = new Map(preferred.map((cst, index) => [cst.id, index]));\n\n  const remainingInputs = new Map<number, number>();\n  for (const cst of preferred) {\n    const inputs = graph.at(cst.id)?.inputs ?? [];\n    remainingInputs.set(\n      cst.id,\n      inputs.reduce((count, src) => count + (rank.has(src) ? 1 : 0), 0)\n    );\n  }\n\n  const ready = new Set<number>();\n  for (const cst of preferred) {\n    if ((remainingInputs.get(cst.id) ?? 0) === 0) {\n      ready.add(cst.id);\n    }\n  }\n\n  const children = new Map<number, number[]>();\n  for (const cst of preferred) {\n    children.set(\n      cst.id,\n      (relations.childrenOf.get(cst.id) ?? []).filter(childId => rank.has(childId))\n    );\n  }\n\n  const result: T[] = [];\n  const pendingChildren: number[] = [];\n\n  function enqueueSticky(candidateIds: readonly number[]): void {\n    const sticky = candidateIds.filter(childId => ready.has(childId) && !pendingChildren.includes(childId));\n    sticky.sort((left, right) => (rank.get(left) ?? 0) - (rank.get(right) ?? 0));\n    pendingChildren.push(...sticky);\n  }\n\n  function pickReady(): number {\n    while (pendingChildren.length > 0) {\n      const childId = pendingChildren.shift()!;\n      if (ready.has(childId)) {\n        return childId;\n      }\n    }\n    let best = -1;\n    let bestRank = Number.POSITIVE_INFINITY;\n    for (const nodeId of ready) {\n      const nodeRank = rank.get(nodeId) ?? Number.POSITIVE_INFINITY;\n      if (nodeRank < bestRank) {\n        best = nodeId;\n        bestRank = nodeRank;\n      }\n    }\n    return best;\n  }\n\n  while (ready.size > 0 || pendingChildren.length > 0) {\n    if (ready.size === 0) {\n      pendingChildren.length = 0;\n      continue;\n    }\n    const nodeId = pickReady();\n    ready.delete(nodeId);\n    result.push(byId.get(nodeId)!);\n\n    for (const dependentId of graph.at(nodeId)?.outputs ?? []) {\n      if (!remainingInputs.has(dependentId)) {\n        continue;\n      }\n      const next = (remainingInputs.get(dependentId) ?? 0) - 1;\n      remainingInputs.set(dependentId, next);\n      if (next === 0) {\n        ready.add(dependentId);\n      }\n    }\n\n    enqueueSticky(children.get(nodeId) ?? []);\n  }\n\n  if (result.length < preferred.length) {\n    const placed = new Set(result.map(cst => cst.id));\n    for (const cst of preferred) {\n      if (!placed.has(cst.id)) {\n        result.push(cst);\n      }\n    }\n  }\n\n  return result;\n}\n\nfunction kernelPriority<T extends FormalOrderFields>(\n  items: readonly T[],\n  graph: Graph<number>,\n  parentOf: Map<number, number>\n): T[] {\n  const byId = new Map(items.map(cst => [cst.id, cst]));\n  const seen = new Set<number>();\n  const result: T[] = [];\n\n  function push(cst: T): void {\n    if (seen.has(cst.id)) {\n      return;\n    }\n    seen.add(cst.id);\n    result.push(cst);\n  }\n\n  for (const cst of items) {\n    if (cst.cst_type === CstType.BASE) {\n      push(cst);\n    }\n  }\n  for (const cst of items) {\n    if (cst.cst_type === CstType.CONSTANT) {\n      push(cst);\n    }\n  }\n  for (const cst of items) {\n    if ((graph.at(cst.id)?.inputs.length ?? 0) === 0) {\n      push(cst);\n    }\n  }\n\n  const kernelSeeds = items\n    .filter(cst => {\n      const parentId = parentOf.get(cst.id) ?? cst.id;\n      const parent = byId.get(parentId);\n      return (\n        cst.cst_type === CstType.STRUCTURED || cst.cst_type === CstType.AXIOM || parent?.cst_type === CstType.STRUCTURED\n      );\n    })\n    .map(cst => cst.id);\n  const kernel = new Set<number>([...kernelSeeds, ...graph.expandAllInputs(kernelSeeds)]);\n  for (const cst of items) {\n    if (kernel.has(cst.id)) {\n      push(cst);\n    }\n  }\n  for (const cst of items) {\n    push(cst);\n  }\n  return result;\n}\n","/**\n * Schema-level statistics and issue flags.\n */\n\nimport { TypeID, type Typification, ValueClass } from '../../rslang';\nimport { hasCstDiagnostic, RSDiagnosticCode } from '../diagnostics';\nimport { CstStatus, CstType, type RSForm, type RSFormStats } from '../rsform';\n\nimport { isBasicConcept, isLogical } from './cst-type';\nimport { type BasicTextCheckFields, type SchemaIssueFields, type StructureCapableFields } from './types';\n\n/** Checks if an item is a schema issue. */\nexport function isSchemaIssue(cst: SchemaIssueFields): boolean {\n  return (\n    (cst.diagnostics?.length ?? 0) > 0 || cst.status === CstStatus.INCORRECT || cst.status === CstStatus.INCALCULABLE\n  );\n}\n\n/** Calculate statistics for {@link RSForm}. */\nexport function calculateSchemaStats(target: RSForm): RSFormStats {\n  const stats: RSFormStats = {\n    count_all: target.items.length,\n    count_crucial: 0,\n    step_complexity: 0,\n    count_problematic: 0,\n    count_homonyms: 0,\n    count_formal_duplicates: 0,\n    count_missing_basic_text: 0,\n    count_type_mismatch: 0,\n    count_incorrect: 0,\n    count_property: 0,\n    count_incalculable: 0,\n    count_inherited: 0,\n    count_text_term: 0,\n    count_definition: 0,\n    count_convention: 0,\n    count_comment: 0,\n    count_base: 0,\n    count_constant: 0,\n    count_structured: 0,\n    count_axiom: 0,\n    count_term: 0,\n    count_function: 0,\n    count_predicate: 0,\n    count_statement: 0,\n    count_nominal: 0\n  };\n\n  for (const cst of target.items) {\n    if (cst.crucial) {\n      stats.count_crucial += 1;\n    }\n    stats.step_complexity += calculateStepComplexity(cst);\n\n    if (isSchemaIssue(cst)) {\n      stats.count_problematic += 1;\n    }\n    if (hasCstDiagnostic(cst, RSDiagnosticCode.schemaHomonym)) {\n      stats.count_homonyms += 1;\n    }\n    if (hasCstDiagnostic(cst, RSDiagnosticCode.schemaFormalDuplicate)) {\n      stats.count_formal_duplicates += 1;\n    }\n    if (isMissingBasicText(cst)) {\n      stats.count_missing_basic_text += 1;\n    }\n    if (cst.is_type_mismatch) {\n      stats.count_type_mismatch += 1;\n    }\n    if (cst.status === CstStatus.INCORRECT) {\n      stats.count_incorrect += 1;\n    }\n    if (cst.analysis?.valueClass === ValueClass.PROPERTY) {\n      stats.count_property += 1;\n    }\n    if (cst.analysis?.success && cst.analysis.valueClass === null) {\n      stats.count_incalculable += 1;\n    }\n    if (cst.is_inherited) {\n      stats.count_inherited += 1;\n    }\n    if (cst.term_raw) {\n      stats.count_text_term += 1;\n    }\n    if (cst.definition_raw) {\n      stats.count_definition += 1;\n    }\n    if (isBasicConcept(cst.cst_type) && cst.convention) {\n      stats.count_convention += 1;\n    }\n    if (!isBasicConcept(cst.cst_type) && !cst.convention) {\n      stats.count_comment += 1;\n    }\n\n    switch (cst.cst_type) {\n      case CstType.BASE:\n        stats.count_base += 1;\n        break;\n      case CstType.CONSTANT:\n        stats.count_constant += 1;\n        break;\n      case CstType.STRUCTURED:\n        stats.count_structured += 1;\n        break;\n      case CstType.AXIOM:\n        stats.count_axiom += 1;\n        break;\n      case CstType.TERM:\n        stats.count_term += 1;\n        break;\n      case CstType.FUNCTION:\n        stats.count_function += 1;\n        break;\n      case CstType.PREDICATE:\n        stats.count_predicate += 1;\n        break;\n      case CstType.STATEMENT:\n        stats.count_statement += 1;\n        break;\n      case CstType.NOMINAL:\n        stats.count_nominal += 1;\n        break;\n    }\n  }\n\n  return stats;\n}\n\nfunction calculateStepComplexity(cst: StructureCapableFields): 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\n/** Non-logical basic concept missing convention and/or resolved term (trimmed). */\nfunction isMissingBasicText(cst: BasicTextCheckFields): boolean {\n  if (!isBasicConcept(cst.cst_type) || isLogical(cst.cst_type)) {\n    return false;\n  }\n  return !cst.convention.trim() || !cst.term_resolved.trim();\n}\n","/**\n * Structure-path helpers for spawned constituents.\n */\n\nimport { TypeID, type TypePath, type Typification } from '../../rslang';\nimport { isTypification } from '../../rslang/semantic/typification';\nimport { applyPath } from '../../rslang/semantic/typification-api';\nimport { type Constituenta, type RSForm } from '../rsform';\n\nimport { type SpawnPathFields, type StructureCapableFields } from './types';\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/** Finds schema item by absolute structure path under `targetId`. */\nexport function findCstByStructure(schema: RSForm, target: { id: number }, path: TypePath): Constituenta | null {\n  const byId = schema.cstByID ?? new Map(schema.items.map(item => [item.id, item]));\n  for (const cst of schema.items) {\n    if (!cst.spawner_path) {\n      continue;\n    }\n    const absolutePath = resolveAbsoluteSpawnerPath(cst, target.id, byId);\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 structure. */\nexport function getStructureName(\n  schema: RSForm,\n  target: StructureCapableFields & { id: number },\n  path: TypePath\n): 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\nfunction resolveAbsoluteSpawnerPath(\n  cst: SpawnPathFields,\n  targetId: number,\n  byId: Map<number, SpawnPathFields>\n): 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 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 * Constituenta substitution and post-import substitution remapping.\n */\n\nimport { type AliasMapping } from '../../rslang/api';\nimport { type Attribution, type Substitution } from '../rsform';\n\nimport { applyMappingToConstituents, type MappableFields } from './alias';\nimport { remapAttributionsUnderSubstitution } from './attribution';\n\n/** Result of applying substitutions to a schema fragment. */\nexport interface SubstitutionResult<T> {\n  items: T[];\n  attributions: Attribution[];\n  deletedIds: Set<number>;\n  /** Replacement constituent ids (survivors referenced by substitutions). */\n  replacementIds: number[];\n}\n\n/**\n * Apply constituenta substitutions: remap attributions, drop originals, rewrite aliases in survivors.\n * Does not resolve texts — call {@link resolveAllConstituentTexts} afterwards.\n */\nexport function applyConstituentSubstitutions<T extends MappableFields & { id: number; alias: string }>(\n  items: readonly T[],\n  attributions: readonly Attribution[],\n  substitutions: readonly Substitution[]\n): SubstitutionResult<T> {\n  if (substitutions.length === 0) {\n    return {\n      items: [...items],\n      attributions: attributions.map(attr => ({ ...attr })),\n      deletedIds: new Set(),\n      replacementIds: []\n    };\n  }\n\n  const byId = new Map(items.map(cst => [cst.id, cst]));\n  const mapping: AliasMapping = {};\n  const deletedIds = new Set<number>();\n  const origToSub = new Map<number, number>();\n  const replacementIds: number[] = [];\n\n  for (const { original, substitution } of substitutions) {\n    const originalCst = byId.get(original);\n    const substitutionCst = byId.get(substitution);\n    if (!originalCst || !substitutionCst) {\n      throw new Error(`applyConstituentSubstitutions: unknown constituenta ${original} -> ${substitution}`);\n    }\n    mapping[originalCst.alias] = substitutionCst.alias;\n    deletedIds.add(original);\n    origToSub.set(original, substitution);\n    replacementIds.push(substitution);\n  }\n\n  const nextItems = items.filter(cst => !deletedIds.has(cst.id));\n  applyMappingToConstituents(nextItems, mapping, false);\n\n  return {\n    items: nextItems,\n    attributions: remapAttributionsUnderSubstitution(attributions, origToSub),\n    deletedIds,\n    replacementIds\n  };\n}\n\n/**\n * Remap substitution endpoints after source constituents were inserted under new ids.\n * If {@link original} was imported, map it; otherwise map {@link substitution}.\n */\nexport function remapSubstitutionsAfterImport(\n  substitutions: readonly Substitution[],\n  sourceIdSet: ReadonlySet<number>,\n  idMap: Readonly<Record<number, number>>\n): Substitution[] {\n  return substitutions.map(sub => {\n    if (sourceIdSet.has(sub.original)) {\n      return { original: idMap[sub.original], substitution: sub.substitution };\n    }\n    return { original: sub.original, substitution: idMap[sub.substitution] };\n  });\n}\n","/**\n * Cascade resolution of constituenta term/definition entity references.\n * Matches backend {@code RSForm.resolve_all_text} / {@code resolve_term_change}.\n */\n\nimport { type TermContext } from '../../cctext/language';\nimport { extractEntities, parseGrammemes, resolveTextReferences } from '../../cctext/language-api';\nimport { Graph } from '../../graph';\n\nimport { type TextResolvableFields } from './types';\n\n/** Options controlling which texts to re-resolve after an edit. */\nexport interface TextChangeOptions {\n  termChanged: boolean;\n  termRawChanged: boolean;\n  definitionRawChanged: boolean;\n  clearTargetForms: boolean;\n}\n\n/** Build term-reference graph: referenced constituent → dependent (backend {@code graph_term}). */\nexport function buildTermReferenceGraph(items: readonly TextResolvableFields[]): Graph<number> {\n  return buildReferenceGraph(items, 'term_raw');\n}\n\n/** Build definition-reference graph: referenced constituent → dependent (backend {@code graph_text}). */\nexport function buildDefinitionReferenceGraph(items: readonly TextResolvableFields[]): Graph<number> {\n  return buildReferenceGraph(items, 'definition_raw');\n}\n\n/** Resolve all term and definition texts in topological order. Mutates items in place. */\nexport function resolveAllConstituentTexts(items: TextResolvableFields[]): void {\n  const graphTerm = buildTermReferenceGraph(items);\n  const idToItem = new Map(items.map(item => [item.id, item]));\n  const context = buildTermContext(items);\n\n  for (const id of graphTerm.topologicalOrder()) {\n    const row = idToItem.get(id);\n    if (!row) {\n      continue;\n    }\n    const resolved = resolveTextReferences(row.term_raw, context);\n    if (resolved !== row.term_resolved) {\n      row.term_resolved = resolved;\n      row.term_forms = [];\n      context[row.alias] = { nominal: row.term_resolved, forms: [] };\n    }\n  }\n\n  for (const row of items) {\n    row.definition_resolved = resolveTextReferences(row.definition_raw, context);\n  }\n}\n\n/**\n * Resolve texts after a single constituent change, cascading dependents when the term changed.\n * Mutates items in place.\n */\nexport function resolveConstituentTextChange(\n  items: TextResolvableFields[],\n  targetID: number,\n  options: TextChangeOptions\n): void {\n  const idToItem = new Map(items.map(item => [item.id, item]));\n  const target = idToItem.get(targetID);\n  if (!target) {\n    throw new Error(`resolveConstituentTextChange: unknown target ${targetID}`);\n  }\n\n  const context = buildTermContext(items);\n  if (options.termRawChanged) {\n    target.term_resolved = resolveTextReferences(target.term_raw, context);\n    if (options.clearTargetForms) {\n      target.term_forms = [];\n    }\n    context[target.alias] = toContextItem(target);\n  } else if (options.termChanged) {\n    context[target.alias] = toContextItem(target);\n  }\n\n  if (options.definitionRawChanged && !options.termChanged) {\n    target.definition_resolved = resolveTextReferences(target.definition_raw, context);\n  }\n\n  if (!options.termChanged) {\n    return;\n  }\n\n  const graphTerm = buildTermReferenceGraph(items);\n  const graphText = buildDefinitionReferenceGraph(items);\n  const expansion = graphTerm.expandAllOutputs([targetID]);\n  const expansionSet = new Set(expansion);\n\n  for (const id of graphTerm.topologicalOrder()) {\n    if (!expansionSet.has(id)) {\n      continue;\n    }\n    const expanded = idToItem.get(id);\n    if (!expanded) {\n      continue;\n    }\n    const resolved = resolveTextReferences(expanded.term_raw, context);\n    if (resolved !== expanded.term_resolved) {\n      expanded.term_resolved = resolved;\n      expanded.term_forms = [];\n      context[expanded.alias] = { nominal: expanded.term_resolved, forms: [] };\n    }\n  }\n\n  const updateDefs = new Set([targetID, ...expansion, ...graphText.expandAllOutputs([targetID, ...expansion])]);\n  for (const item of items) {\n    if (updateDefs.has(item.id)) {\n      item.definition_resolved = resolveTextReferences(item.definition_raw, context);\n    }\n  }\n}\n\n// ====== Internals =======\n\nfunction buildReferenceGraph(\n  items: readonly TextResolvableFields[],\n  field: 'definition_raw' | 'term_raw'\n): Graph<number> {\n  const graph = new Graph<number>();\n  const idByAlias = new Map(items.map(row => [row.alias, row.id]));\n  for (const row of items) {\n    graph.addNode(row.id);\n  }\n  for (const row of items) {\n    for (const entity of extractEntities(row[field])) {\n      const source = idByAlias.get(entity);\n      if (source !== undefined) {\n        graph.addEdge(source, row.id);\n      }\n    }\n  }\n  return graph;\n}\n\nfunction buildTermContext(items: readonly TextResolvableFields[]): TermContext {\n  const context: TermContext = {};\n  for (const row of items) {\n    context[row.alias] = toContextItem(row);\n  }\n  return context;\n}\n\nfunction toContextItem(row: TextResolvableFields): TermContext[string] {\n  return {\n    nominal: row.term_resolved,\n    forms: row.term_forms.map(form => ({ text: form.text, grams: parseGrammemes(form.tags) }))\n  };\n}\n","/**\n * Schema embedding (synthesis): insert constituents from a source schema into a receiver,\n * then apply an identification (substitution) table.\n *\n * Mirrors backend `inline_synthesis` / `insert_from` + `substitute`\n * (Portal UI: «Встраивание схемы»).\n */\n\nimport { type AliasMapping } from '../../rslang/api';\nimport { type LibraryItem } from '../library';\nimport { type Attribution, type CstType, type RSForm, type Substitution } from '../rsform';\n\nimport { allocateImportAliases, applyMappingToConstituents, type MappableFields } from './alias';\nimport { importAttributions } from './attribution';\nimport { applyConstituentSubstitutions, remapSubstitutionsAfterImport } from './substitution';\nimport { resolveAllConstituentTexts } from './text-resolution';\nimport { type AliasTypedFields, type TextResolvableFields } from './types';\n\n/** Field intersection required for embedding / synthesis transforms. */\nexport type SynthesizableFields = MappableFields &\n  TextResolvableFields &\n  AliasTypedFields & {\n    id: number;\n    alias: string;\n    cst_type: CstType;\n  };\n\n/** Input for {@link inlineSynthesis}. */\nexport interface InlineSynthesisInput<T extends SynthesizableFields> {\n  /** Receiver schema constituents (order preserved; imports append). */\n  receiverItems: readonly T[];\n  /** Receiver attributions (default empty). */\n  receiverAttributions?: readonly Attribution[];\n  /**\n   * Source constituents to insert (already filtered to the desired subset).\n   * Cloned; originals are not mutated.\n   */\n  sourceItems: readonly T[];\n  /** Source attributions whose both endpoints are among {@link sourceItems}. */\n  sourceAttributions?: readonly Attribution[];\n  /**\n   * Identification table using pre-import ids:\n   * one endpoint is a source id, the other a receiver id\n   * (same rules as backend embedding / InlineSynthesis).\n   */\n  substitutions?: readonly Substitution[];\n  /** Next free numeric id for inserted constituents. */\n  nextId: number;\n}\n\n/** Result of {@link inlineSynthesis}. */\nexport interface InlineSynthesisResult<T extends SynthesizableFields> {\n  items: T[];\n  attributions: Attribution[];\n  /** Updated next-id after inserts. */\n  nextId: number;\n  /** Source id → inserted id. */\n  idMap: Record<number, number>;\n  /** Alias remapping applied to imported constituents (empty when receiver was empty). */\n  aliasMapping: AliasMapping;\n  /** Ids removed by substitutions. */\n  deletedIds: Set<number>;\n  /** Ids of newly inserted constituents (before any were deleted by substitutions). */\n  insertedIds: number[];\n  /** Survivor ids referenced by applied substitutions. */\n  replacementIds: number[];\n}\n\n/**\n * Embed {@link InlineSynthesisInput.sourceItems} into the receiver and apply substitutions.\n * Resolves term/definition entity references on the result.\n * Does not mutate inputs.\n */\nexport function inlineSynthesis<T extends SynthesizableFields>(\n  input: InlineSynthesisInput<T>\n): InlineSynthesisResult<T> {\n  const sourceItems = input.sourceItems;\n  if (sourceItems.length === 0) {\n    return {\n      items: input.receiverItems.map(item => structuredClone(item)),\n      attributions: (input.receiverAttributions ?? []).map(attr => ({ ...attr })),\n      nextId: input.nextId,\n      idMap: {},\n      aliasMapping: {},\n      deletedIds: new Set(),\n      insertedIds: [],\n      replacementIds: []\n    };\n  }\n\n  const receiverItems = input.receiverItems.map(item => structuredClone(item));\n  let attributions = (input.receiverAttributions ?? []).map(attr => ({ ...attr }));\n  const aliasMapping = allocateImportAliases(receiverItems, sourceItems);\n  const idMap: Record<number, number> = {};\n  const inserted: T[] = [];\n  const sourceIdSet = new Set(sourceItems.map(cst => cst.id));\n  let nextId = input.nextId;\n\n  for (const cst of sourceItems) {\n    const newId = nextId;\n    nextId += 1;\n    idMap[cst.id] = newId;\n\n    const cloned = structuredClone(cst);\n    cloned.id = newId;\n    if (Object.keys(aliasMapping).length > 0) {\n      cloned.alias = aliasMapping[cst.alias];\n      applyMappingToConstituents([cloned], aliasMapping, false);\n    }\n    inserted.push(cloned);\n  }\n\n  attributions = importAttributions(input.sourceAttributions ?? [], sourceIdSet, idMap, attributions);\n  const items = receiverItems.concat(inserted);\n  resolveAllConstituentTexts(items);\n\n  const substitutions = input.substitutions ?? [];\n  if (substitutions.length === 0) {\n    return {\n      items,\n      attributions,\n      nextId,\n      idMap,\n      aliasMapping,\n      deletedIds: new Set(),\n      insertedIds: inserted.map(cst => cst.id),\n      replacementIds: []\n    };\n  }\n\n  const remapped = remapSubstitutionsAfterImport(substitutions, sourceIdSet, idMap);\n  const substituted = applyConstituentSubstitutions(items, attributions, remapped);\n  resolveAllConstituentTexts(substituted.items);\n\n  return {\n    items: substituted.items,\n    attributions: substituted.attributions,\n    nextId,\n    idMap,\n    aliasMapping,\n    deletedIds: substituted.deletedIds,\n    insertedIds: inserted.map(cst => cst.id),\n    replacementIds: substituted.replacementIds\n  };\n}\n\n/** Sorts library items relevant for schema embedding with specified {@link RSForm}. */\nexport function sortItemsForInlineSynthesis(receiver: RSForm, items: readonly LibraryItem[]): LibraryItem[] {\n  const result = items.filter(item => item.location === receiver.location);\n  const included = new Set(result);\n  for (const item of items) {\n    if (item.visible && item.owner === receiver.owner && !included.has(item)) {\n      result.push(item);\n      included.add(item);\n    }\n  }\n  for (const item of items) {\n    if (item.visible && !included.has(item)) {\n      result.push(item);\n      included.add(item);\n    }\n  }\n  for (const item of items) {\n    if (!included.has(item)) {\n      result.push(item);\n      included.add(item);\n    }\n  }\n  return result;\n}\n","/**\n * Pure constituenta list transforms: reorder, move, insert position.\n */\n\n/** Rebuild an item list following {@link orderedIds}. Throws if an id is missing. */\nexport function reorderItemsByIds<T extends { id: number }>(items: readonly T[], orderedIds: readonly number[]): T[] {\n  const byId = new Map(items.map(item => [item.id, item]));\n  return orderedIds.map(id => {\n    const item = byId.get(id);\n    if (!item) {\n      throw new Error(`reorderItemsByIds: missing id ${id}`);\n    }\n    return item;\n  });\n}\n\n/**\n * Move a subset of ids within an ordered id list.\n * {@link moveTo} is clamped to `[0, rest.length]` (index among non-moving items).\n */\nexport function moveIdsInOrder(ids: readonly number[], moving: readonly number[], moveTo: number): number[] {\n  const movingSet = new Set(moving);\n  const rest = ids.filter(id => !movingSet.has(id));\n  const movingItems = ids.filter(id => movingSet.has(id));\n  const clamped = Math.max(0, Math.min(moveTo, rest.length));\n  return [...rest.slice(0, clamped), ...movingItems, ...rest.slice(clamped)];\n}\n\n/** Insert {@link item} after {@link insertAfter}, or append when null/undefined/missing. Mutates {@link items}. */\nexport function insertItemAfter<T extends { id: number }>(\n  items: T[],\n  item: T,\n  insertAfter: number | null | undefined\n): void {\n  if (insertAfter === null || insertAfter === undefined) {\n    items.push(item);\n    return;\n  }\n  const idx = items.findIndex(row => row.id === insertAfter);\n  const insertAt = idx === -1 ? items.length : idx + 1;\n  items.splice(insertAt, 0, item);\n}\n","/**\n * Module: Compact diagnostics for constituents (schema and model issue codes).\n */\n\nimport { type Graph } from '../graph';\nimport { type ExpressionType } from '../rslang';\nimport { labelType } from '../rslang/labels';\n\nimport { type BasicTextCheckFields } from './rsform-api/types';\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, model, and substitution-table 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\n  substitutionInvalidIDs: 0x8920,\n  substitutionIncorrectCst: 0x8921,\n  substitutionInvalidClasses: 0x8922,\n  substitutionInvalidBasic: 0x8923,\n  substitutionInvalidConstant: 0x8924,\n  substitutionTypificationCycle: 0x8925,\n  substitutionBaseNotSet: 0x8926,\n  substitutionUnequalTypification: 0x8927,\n  /** Non-blocking warning: formal definitions differ after mapping. */\n  substitutionUnequalExpressions: 0x2928,\n  substitutionUnequalArgsCount: 0x8929,\n  substitutionUnequalArgs: 0x892a,\n  substitutionInvalidNominal: 0x892b\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 an item has a schema/model diagnostic with the given code. */\nexport function hasCstDiagnostic(\n  cst: { diagnostics?: readonly CstDiagnostic[] | null },\n  code: RSDiagnosticCode\n): 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(\n  cst: BasicTextCheckFields & {\n    is_type_mismatch: boolean;\n    typification_manual: string;\n    analysis: { type: ExpressionType | null };\n  }\n): 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<T extends { id: number }>(\n  items: readonly T[],\n  resolveAlias: (id: number) => string,\n  groupKey: (cst: T) => string | undefined,\n  code: RSDiagnosticCode\n): Map<number, CstDiagnostic> {\n  const groups = new Map<string, T[]>();\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: readonly { id: number; term_resolved: string }[],\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: readonly { id: number }[],\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":";;;;;;;;;;;;;;;;;;AAWA,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,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,WAAW,MAAe,aAAsB,OAAiB;CAC/E,IAAI,YACF,OAAO,SAAS;CAElB,OAAO,kBAAkB;AAC3B;;AAGA,SAAgB,cAAc,KAAqC;CACjE,OAAO,IAAI,aAAa,QAAQ,YAAY,IAAI,aAAa,QAAQ,aAAa,IAAI,aAAa,QAAQ;AAC7G;;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,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,wBAAwB,SAA2B;CACjE,OAAO,YAAY,QAAQ,QAAQ,YAAY,QAAQ;AACzD;;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,oBAAoB,KAAsC;CACxE,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;AAEA,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;;;;;;;ACpMA,SAAgB,wBAAwB,MAAqC;CAC3E,MAAM,UAAwB,CAAC;CAC/B,KAAK,MAAM,OAAO,MAChB,IAAI,IAAI,OACN,QAAQ,IAAI,SAAS,IAAI;CAG7B,OAAO;AACT;;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,QAAQ,OAAO,MAAM,QAAQ,MAAM,QAAQ;EAC7C,IAAI,IAAI,aAAa,MACnB,OAAO;EAET,MAAM,OAAO,OAAO,IAAI,MAAM,UAAU,OAAO,MAAM,CAAC,IAAI;EAC1D,OAAO,KAAK,IAAI,MAAM,IAAI;CAC5B,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,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,cAAc,OAAoC,MAAuB;CACvF,MAAM,SAAS,iBAAiB,IAAI;CACpC,OAAO,MAAM,QAAQ,KAAK,QAAQ;EAChC,IAAI,IAAI,aAAa,MACnB,OAAO;EAET,MAAM,QAAQ,OAAO,IAAI,MAAM,MAAM,OAAO,MAAM,CAAC;EACnD,OAAO,OAAO,SAAS,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI;CACzD,GAAG,CAAC;AACN;;;;;AAMA,SAAgB,4BAA4B,OAAkD;CAC5F,MAAM,SAAiC,CAAC;CACxC,KAAK,MAAM,SAAS,OAAO,OAAO,OAAO,GACvC,OAAO,SAAS;CAElB,MAAM,UAAwB,CAAC;CAC/B,KAAK,MAAM,OAAO,OAAO;EACvB,MAAM,QAAQ,GAAG,iBAAiB,IAAI,QAAQ,IAAI,OAAO,IAAI;EAC7D,OAAO,IAAI,aAAa;EACxB,IAAI,IAAI,UAAU,OAChB,QAAQ,IAAI,SAAS;CAEzB;CACA,OAAO;AACT;;;;;AAMA,SAAgB,sBACd,UACA,QACc;CACd,IAAI,SAAS,WAAW,GACtB,OAAO,CAAC;CAEV,MAAM,SAAiC,CAAC;CACxC,KAAK,MAAM,SAAS,OAAO,OAAO,OAAO,GACvC,OAAO,SAAS,cAAc,UAAU,KAAK;CAE/C,MAAM,UAAwB,CAAC;CAC/B,KAAK,MAAM,OAAO,QAAQ;EACxB,OAAO,IAAI,aAAa;EACxB,QAAQ,IAAI,SAAS,GAAG,iBAAiB,IAAI,QAAQ,IAAI,OAAO,IAAI;CACtE;CACA,OAAO;AACT;;AAGA,SAAgB,qBAAqB,YAAoB,OAAuB;CAC9E,MAAM,UAAU,MAAM,QAAQ,uBAAuB,MAAM;CAC3D,OAAO,WAAW,WAAW,IAAI,OAAO,MAAM,QAAQ,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,KAAK;AAC7E;;AAGA,SAAgB,kBAAkB,YAAoB,OAAuB;CAC3E,OAAO,aAAa,MAAM;AAC5B;;;AClJA,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;;;ACtJA,SAAS,eAAe,MAA2B;CACjD,OAAO,GAAG,KAAK,UAAU,GAAG,KAAK;AACnC;;;;;AAMA,SAAgB,mCACd,cACA,WACe;CACf,MAAM,SAAwB,CAAC;CAC/B,MAAM,uBAAO,IAAI,IAAY;CAE7B,KAAK,MAAM,QAAQ,cAAc;EAC/B,IAAI,CAAC,UAAU,IAAI,KAAK,SAAS,KAAK,CAAC,UAAU,IAAI,KAAK,SAAS,GAAG;GACpE,MAAM,MAAM,eAAe,IAAI;GAC/B,IAAI,CAAC,KAAK,IAAI,GAAG,GAAG;IAClB,KAAK,IAAI,GAAG;IACZ,OAAO,KAAK,EAAE,GAAG,KAAK,CAAC;GACzB;GACA;EACF;EAEA,MAAM,YAAY,UAAU,IAAI,KAAK,SAAS,KAAK,KAAK;EACxD,MAAM,YAAY,UAAU,IAAI,KAAK,SAAS,KAAK,KAAK;EACxD,IAAI,cAAc,WAChB;EAEF,MAAM,MAAM,GAAG,UAAU,GAAG;EAC5B,IAAI,KAAK,IAAI,GAAG,GACd;EAEF,KAAK,IAAI,GAAG;EACZ,OAAO,KAAK;GAAE;GAAW;EAAU,CAAC;CACtC;CAEA,OAAO;AACT;;;;;AAMA,SAAgB,mBACd,oBACA,aACA,OACA,WAAmC,CAAC,GACrB;CACf,MAAM,SAAS,SAAS,KAAI,UAAS,EAAE,GAAG,KAAK,EAAE;CACjD,MAAM,OAAO,IAAI,IAAI,OAAO,IAAI,cAAc,CAAC;CAE/C,KAAK,MAAM,QAAQ,oBAAoB;EACrC,IAAI,CAAC,YAAY,IAAI,KAAK,SAAS,KAAK,CAAC,YAAY,IAAI,KAAK,SAAS,GACrE;EAEF,MAAM,YAAY,MAAM,KAAK;EAC7B,MAAM,YAAY,MAAM,KAAK;EAC7B,IAAI,cAAc,UAAa,cAAc,UAAa,cAAc,WACtE;EAEF,MAAM,MAAM,GAAG,UAAU,GAAG;EAC5B,IAAI,KAAK,IAAI,GAAG,GACd;EAEF,KAAK,IAAI,GAAG;EACZ,OAAO,KAAK;GAAE;GAAW;EAAU,CAAC;CACtC;CAEA,OAAO;AACT;;AAGA,SAAgB,mBACd,cACA,YACe;CACf,OAAO,aAAa,QAAO,SAAQ,CAAC,WAAW,IAAI,KAAK,SAAS,KAAK,CAAC,WAAW,IAAI,KAAK,SAAS,CAAC;AACvG;;;;AC1EA,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;;;;;;;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,oBAAqD,OAAU,OAA0B;CACvG,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;;;;;;;ACxDA,SAAgB,yBAAyB,OAAqC,OAAyC;CACrH,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;CACpD,MAAM,UAAU,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC;CAC1D,MAAM,6BAAa,IAAI,IAAqB;CAC5C,MAAM,2BAAW,IAAI,IAAqB;CAC1C,MAAM,2BAAW,IAAI,IAAoB;CACzC,MAAM,6BAAa,IAAI,IAAsB;CAE7C,KAAK,MAAM,OAAO,OAAO;EACvB,SAAS,IAAI,IAAI,IAAI,IAAI,EAAE;EAC3B,WAAW,IAAI,IAAI,IAAI,CAAC,CAAC;CAC3B;CAEA,SAAS,cAAc,SAAsB,MAAuB;EAClE,IAAI,QAAQ,SAAS,GACnB,OAAO;EAET,IAAI,QAAQ,SAAS,GACnB,OAAO;EAET,MAAM,OAAO,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE;EACrC,OAAO,CAAC,aAAa,KAAK,QAAQ,KAAK,wBAAwB,KAAK,iBAAiB,CAAC,CAAC,SAAS;CAClG;CAEA,SAAS,eAAe,QAAwC;EAC9D,MAAM,0BAAU,IAAI,IAAY;EAChC,IAAI,CAAC,aAAa,OAAO,QAAQ,GAAG;GAClC,KAAK,MAAM,YAAY,MAAM,GAAG,OAAO,EAAE,CAAC,EAAE,UAAU,CAAC,GACrD,IAAI,EAAE,WAAW,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,IACrD,QAAQ,IAAI,SAAS,IAAI,QAAQ,KAAK,QAAQ;GAGlD,OAAO;EACT;EAEA,MAAM,aAAa,wBAAwB,OAAO,iBAAiB;EACnE,KAAK,MAAM,SAAS,eAAe,WAAW,IAAI,GAAG;GACnD,MAAM,SAAS,QAAQ,IAAI,KAAK;GAChC,IAAI,CAAC,QACH;GAEF,IAAI,EAAE,WAAW,IAAI,OAAO,EAAE,KAAK,SAAS,IAAI,OAAO,EAAE,IACvD,QAAQ,IAAI,SAAS,IAAI,OAAO,EAAE,KAAK,OAAO,EAAE;EAEpD;EACA,IAAI,cAAc,SAAS,WAAW,IAAI,GACxC,KAAK,MAAM,SAAS,eAAe,WAAW,IAAI,GAAG;GACnD,MAAM,SAAS,QAAQ,IAAI,KAAK;GAChC,IAAI,CAAC,QACH;GAEF,IAAI,CAAC,UAAU,OAAO,QAAQ,KAAK,EAAE,WAAW,IAAI,OAAO,EAAE,KAAK,SAAS,IAAI,OAAO,EAAE,IACtF,QAAQ,IAAI,SAAS,IAAI,OAAO,EAAE,KAAK,OAAO,EAAE;EAEpD;EAEF,OAAO;CACT;CAEA,SAAS,YAAY,QAAoC;EACvD,IAAI,OAAO,aAAa,QAAQ,cAAc,UAAU,OAAO,QAAQ,GACrE,OAAO;EAGT,KADqB,MAAM,GAAG,OAAO,EAAE,CAAC,EAAE,UAAU,CAAC,EACjD,CAAa,MAAK,OAAM,WAAW,IAAI,EAAE,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC,GACjE,OAAO;EAKT,OAAO,mBAHY,aAAa,OAAO,QAAQ,IAC3C,wBAAwB,OAAO,iBAAiB,CAAC,CAAC,OAClD,OAAO,iBACyB;CACtC;CAEA,KAAK,MAAM,SAAS,MAAM,iBAAiB,GAAG;EAC5C,MAAM,MAAM,KAAK,IAAI,KAAK;EAC1B,IAAI,CAAC,KACH;EAEF,WAAW,IAAI,OAAO,cAAc,IAAI,iBAAiB,CAAC;EAC1D,SAAS,IAAI,OAAO,YAAY,GAAG,CAAC;EACpC,IAAI,CAAC,SAAS,IAAI,KAAK,KAAK,IAAI,aAAa,QAAQ,YACnD;EAEF,MAAM,UAAU,eAAe,GAAG;EAClC,IAAI,QAAQ,SAAS,GACnB;EAEF,MAAM,WAAW,CAAC,GAAG,OAAO,CAAC,CAAC;EAC9B,MAAM,SAAS,KAAK,IAAI,QAAQ;EAChC,IAAI,CAAC,UAAU,UAAU,OAAO,QAAQ,GACtC;EAEF,SAAS,IAAI,OAAO,QAAQ;EAC5B,WAAW,IAAI,QAAQ,CAAC,CAAE,KAAK,KAAK;CACtC;CAEA,OAAO;EAAE;EAAU;CAAW;AAChC;;;;;;;;;;AClGA,SAAgB,2BAA2B,OAAoD;CAC7F,MAAM,QAAQ,IAAI,MAAc;CAChC,MAAM,UAAU,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC;CAC1D,KAAK,MAAM,OAAO,OAChB,MAAM,QAAQ,IAAI,EAAE;CAEtB,KAAK,MAAM,OAAO,OAChB,KAAK,MAAM,SAAS,eAAe,IAAI,iBAAiB,GAAG;EACzD,MAAM,WAAW,QAAQ,IAAI,KAAK;EAClC,IAAI,UACF,MAAM,QAAQ,SAAS,IAAI,IAAI,EAAE;CAErC;CAEF,OAAO;AACT;;;;;;;AAQA,SAAgB,wBACd,OACA,QAAuB,2BAA2B,KAAK,GACvD,YAA+B,yBAAyB,OAAO,KAAK,GAC/D;CACL,IAAI,MAAM,UAAU,GAClB,OAAO,CAAC,GAAG,KAAK;CAGlB,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;CACpD,MAAM,YAAY,eAAe,OAAO,OAAO,UAAU,QAAQ;CACjE,MAAM,OAAO,IAAI,IAAI,UAAU,KAAK,KAAK,UAAU,CAAC,IAAI,IAAI,KAAK,CAAC,CAAC;CAEnE,MAAM,kCAAkB,IAAI,IAAoB;CAChD,KAAK,MAAM,OAAO,WAAW;EAC3B,MAAM,SAAS,MAAM,GAAG,IAAI,EAAE,CAAC,EAAE,UAAU,CAAC;EAC5C,gBAAgB,IACd,IAAI,IACJ,OAAO,QAAQ,OAAO,QAAQ,SAAS,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,CAClE;CACF;CAEA,MAAM,wBAAQ,IAAI,IAAY;CAC9B,KAAK,MAAM,OAAO,WAChB,KAAK,gBAAgB,IAAI,IAAI,EAAE,KAAK,OAAO,GACzC,MAAM,IAAI,IAAI,EAAE;CAIpB,MAAM,2BAAW,IAAI,IAAsB;CAC3C,KAAK,MAAM,OAAO,WAChB,SAAS,IACP,IAAI,KACH,UAAU,WAAW,IAAI,IAAI,EAAE,KAAK,CAAC,EAAA,CAAG,QAAO,YAAW,KAAK,IAAI,OAAO,CAAC,CAC9E;CAGF,MAAM,SAAc,CAAC;CACrB,MAAM,kBAA4B,CAAC;CAEnC,SAAS,cAAc,cAAuC;EAC5D,MAAM,SAAS,aAAa,QAAO,YAAW,MAAM,IAAI,OAAO,KAAK,CAAC,gBAAgB,SAAS,OAAO,CAAC;EACtG,OAAO,MAAM,MAAM,WAAW,KAAK,IAAI,IAAI,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK,EAAE;EAC3E,gBAAgB,KAAK,GAAG,MAAM;CAChC;CAEA,SAAS,YAAoB;EAC3B,OAAO,gBAAgB,SAAS,GAAG;GACjC,MAAM,UAAU,gBAAgB,MAAM;GACtC,IAAI,MAAM,IAAI,OAAO,GACnB,OAAO;EAEX;EACA,IAAI,OAAO;EACX,IAAI,WAAW,OAAO;EACtB,KAAK,MAAM,UAAU,OAAO;GAC1B,MAAM,WAAW,KAAK,IAAI,MAAM,KAAK,OAAO;GAC5C,IAAI,WAAW,UAAU;IACvB,OAAO;IACP,WAAW;GACb;EACF;EACA,OAAO;CACT;CAEA,OAAO,MAAM,OAAO,KAAK,gBAAgB,SAAS,GAAG;EACnD,IAAI,MAAM,SAAS,GAAG;GACpB,gBAAgB,SAAS;GACzB;EACF;EACA,MAAM,SAAS,UAAU;EACzB,MAAM,OAAO,MAAM;EACnB,OAAO,KAAK,KAAK,IAAI,MAAM,CAAE;EAE7B,KAAK,MAAM,eAAe,MAAM,GAAG,MAAM,CAAC,EAAE,WAAW,CAAC,GAAG;GACzD,IAAI,CAAC,gBAAgB,IAAI,WAAW,GAClC;GAEF,MAAM,QAAQ,gBAAgB,IAAI,WAAW,KAAK,KAAK;GACvD,gBAAgB,IAAI,aAAa,IAAI;GACrC,IAAI,SAAS,GACX,MAAM,IAAI,WAAW;EAEzB;EAEA,cAAc,SAAS,IAAI,MAAM,KAAK,CAAC,CAAC;CAC1C;CAEA,IAAI,OAAO,SAAS,UAAU,QAAQ;EACpC,MAAM,SAAS,IAAI,IAAI,OAAO,KAAI,QAAO,IAAI,EAAE,CAAC;EAChD,KAAK,MAAM,OAAO,WAChB,IAAI,CAAC,OAAO,IAAI,IAAI,EAAE,GACpB,OAAO,KAAK,GAAG;CAGrB;CAEA,OAAO;AACT;AAEA,SAAS,eACP,OACA,OACA,UACK;CACL,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;CACpD,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,SAAc,CAAC;CAErB,SAAS,KAAK,KAAc;EAC1B,IAAI,KAAK,IAAI,IAAI,EAAE,GACjB;EAEF,KAAK,IAAI,IAAI,EAAE;EACf,OAAO,KAAK,GAAG;CACjB;CAEA,KAAK,MAAM,OAAO,OAChB,IAAI,IAAI,aAAa,QAAQ,MAC3B,KAAK,GAAG;CAGZ,KAAK,MAAM,OAAO,OAChB,IAAI,IAAI,aAAa,QAAQ,UAC3B,KAAK,GAAG;CAGZ,KAAK,MAAM,OAAO,OAChB,KAAK,MAAM,GAAG,IAAI,EAAE,CAAC,EAAE,OAAO,UAAU,OAAO,GAC7C,KAAK,GAAG;CAIZ,MAAM,cAAc,MACjB,QAAO,QAAO;EACb,MAAM,WAAW,SAAS,IAAI,IAAI,EAAE,KAAK,IAAI;EAC7C,MAAM,SAAS,KAAK,IAAI,QAAQ;EAChC,OACE,IAAI,aAAa,QAAQ,cAAc,IAAI,aAAa,QAAQ,SAAS,QAAQ,aAAa,QAAQ;CAE1G,CAAC,CAAC,CACD,KAAI,QAAO,IAAI,EAAE;CACpB,MAAM,yBAAS,IAAI,IAAY,CAAC,GAAG,aAAa,GAAG,MAAM,gBAAgB,WAAW,CAAC,CAAC;CACtF,KAAK,MAAM,OAAO,OAChB,IAAI,OAAO,IAAI,IAAI,EAAE,GACnB,KAAK,GAAG;CAGZ,KAAK,MAAM,OAAO,OAChB,KAAK,GAAG;CAEV,OAAO;AACT;;;;;;;AClLA,SAAgB,cAAc,KAAiC;CAC7D,QACG,IAAI,aAAa,UAAU,KAAK,KAAK,IAAI,WAAW,UAAU,aAAa,IAAI,WAAW,UAAU;AAEzG;;AAGA,SAAgB,qBAAqB,QAA6B;CAChE,MAAM,QAAqB;EACzB,WAAW,OAAO,MAAM;EACxB,eAAe;EACf,iBAAiB;EACjB,mBAAmB;EACnB,gBAAgB;EAChB,yBAAyB;EACzB,0BAA0B;EAC1B,qBAAqB;EACrB,iBAAiB;EACjB,gBAAgB;EAChB,oBAAoB;EACpB,iBAAiB;EACjB,iBAAiB;EACjB,kBAAkB;EAClB,kBAAkB;EAClB,eAAe;EACf,YAAY;EACZ,gBAAgB;EAChB,kBAAkB;EAClB,aAAa;EACb,YAAY;EACZ,gBAAgB;EAChB,iBAAiB;EACjB,iBAAiB;EACjB,eAAe;CACjB;CAEA,KAAK,MAAM,OAAO,OAAO,OAAO;EAC9B,IAAI,IAAI,SACN,MAAM,iBAAiB;EAEzB,MAAM,mBAAmB,wBAAwB,GAAG;EAEpD,IAAI,cAAc,GAAG,GACnB,MAAM,qBAAqB;EAE7B,IAAI,iBAAiB,KAAK,iBAAiB,aAAa,GACtD,MAAM,kBAAkB;EAE1B,IAAI,iBAAiB,KAAK,iBAAiB,qBAAqB,GAC9D,MAAM,2BAA2B;EAEnC,IAAI,mBAAmB,GAAG,GACxB,MAAM,4BAA4B;EAEpC,IAAI,IAAI,kBACN,MAAM,uBAAuB;EAE/B,IAAI,IAAI,WAAW,UAAU,WAC3B,MAAM,mBAAmB;EAE3B,IAAI,IAAI,UAAU,eAAe,WAAW,UAC1C,MAAM,kBAAkB;EAE1B,IAAI,IAAI,UAAU,WAAW,IAAI,SAAS,eAAe,MACvD,MAAM,sBAAsB;EAE9B,IAAI,IAAI,cACN,MAAM,mBAAmB;EAE3B,IAAI,IAAI,UACN,MAAM,mBAAmB;EAE3B,IAAI,IAAI,gBACN,MAAM,oBAAoB;EAE5B,IAAI,eAAe,IAAI,QAAQ,KAAK,IAAI,YACtC,MAAM,oBAAoB;EAE5B,IAAI,CAAC,eAAe,IAAI,QAAQ,KAAK,CAAC,IAAI,YACxC,MAAM,iBAAiB;EAGzB,QAAQ,IAAI,UAAZ;GACE,KAAK,QAAQ;IACX,MAAM,cAAc;IACpB;GACF,KAAK,QAAQ;IACX,MAAM,kBAAkB;IACxB;GACF,KAAK,QAAQ;IACX,MAAM,oBAAoB;IAC1B;GACF,KAAK,QAAQ;IACX,MAAM,eAAe;IACrB;GACF,KAAK,QAAQ;IACX,MAAM,cAAc;IACpB;GACF,KAAK,QAAQ;IACX,MAAM,kBAAkB;IACxB;GACF,KAAK,QAAQ;IACX,MAAM,mBAAmB;IACzB;GACF,KAAK,QAAQ;IACX,MAAM,mBAAmB;IACzB;GACF,KAAK,QAAQ;IACX,MAAM,iBAAiB;IACvB;EACJ;CACF;CAEA,OAAO;AACT;AAEA,SAAS,wBAAwB,KAAqC;CACpE,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;;AAGA,SAAS,mBAAmB,KAAoC;CAC9D,IAAI,CAAC,eAAe,IAAI,QAAQ,KAAK,UAAU,IAAI,QAAQ,GACzD,OAAO;CAET,OAAO,CAAC,IAAI,WAAW,KAAK,KAAK,CAAC,IAAI,cAAc,KAAK;AAC3D;;;;;;;;;;AC3JA,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,mBAAmB,QAAgB,QAAwB,MAAqC;CAC9G,MAAM,OAAO,OAAO,WAAW,IAAI,IAAI,OAAO,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CAChF,KAAK,MAAM,OAAO,OAAO,OAAO;EAC9B,IAAI,CAAC,IAAI,cACP;EAEF,MAAM,eAAe,2BAA2B,KAAK,OAAO,IAAI,IAAI;EACpE,IAAI,cAAc,WAAW,KAAK,UAAU,aAAa,OAAO,GAAG,MAAM,MAAM,KAAK,EAAE,GACpF,OAAO;CAEX;CACA,OAAO;AACT;;AAGA,SAAgB,iBACd,QACA,QACA,MACQ;CACR,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;AAEA,SAAS,2BACP,KACA,UACA,MACiB;CACjB,IAAI,CAAC,IAAI,gBAAgB,IAAI,WAAW,MACtC,OAAO;CAET,IAAI,IAAI,YAAY,UAClB,OAAO,IAAI;CAGb,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;;;;;;;AC3EA,SAAgB,8BACd,OACA,cACA,eACuB;CACvB,IAAI,cAAc,WAAW,GAC3B,OAAO;EACL,OAAO,CAAC,GAAG,KAAK;EAChB,cAAc,aAAa,KAAI,UAAS,EAAE,GAAG,KAAK,EAAE;EACpD,4BAAY,IAAI,IAAI;EACpB,gBAAgB,CAAC;CACnB;CAGF,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;CACpD,MAAM,UAAwB,CAAC;CAC/B,MAAM,6BAAa,IAAI,IAAY;CACnC,MAAM,4BAAY,IAAI,IAAoB;CAC1C,MAAM,iBAA2B,CAAC;CAElC,KAAK,MAAM,EAAE,UAAU,kBAAkB,eAAe;EACtD,MAAM,cAAc,KAAK,IAAI,QAAQ;EACrC,MAAM,kBAAkB,KAAK,IAAI,YAAY;EAC7C,IAAI,CAAC,eAAe,CAAC,iBACnB,MAAM,IAAI,MAAM,uDAAuD,SAAS,MAAM,cAAc;EAEtG,QAAQ,YAAY,SAAS,gBAAgB;EAC7C,WAAW,IAAI,QAAQ;EACvB,UAAU,IAAI,UAAU,YAAY;EACpC,eAAe,KAAK,YAAY;CAClC;CAEA,MAAM,YAAY,MAAM,QAAO,QAAO,CAAC,WAAW,IAAI,IAAI,EAAE,CAAC;CAC7D,2BAA2B,WAAW,SAAS,KAAK;CAEpD,OAAO;EACL,OAAO;EACP,cAAc,mCAAmC,cAAc,SAAS;EACxE;EACA;CACF;AACF;;;;;AAMA,SAAgB,8BACd,eACA,aACA,OACgB;CAChB,OAAO,cAAc,KAAI,QAAO;EAC9B,IAAI,YAAY,IAAI,IAAI,QAAQ,GAC9B,OAAO;GAAE,UAAU,MAAM,IAAI;GAAW,cAAc,IAAI;EAAa;EAEzE,OAAO;GAAE,UAAU,IAAI;GAAU,cAAc,MAAM,IAAI;EAAc;CACzE,CAAC;AACH;;;;AC7DA,SAAgB,wBAAwB,OAAuD;CAC7F,OAAO,oBAAoB,OAAO,UAAU;AAC9C;;AAGA,SAAgB,8BAA8B,OAAuD;CACnG,OAAO,oBAAoB,OAAO,gBAAgB;AACpD;;AAGA,SAAgB,2BAA2B,OAAqC;CAC9E,MAAM,YAAY,wBAAwB,KAAK;CAC/C,MAAM,WAAW,IAAI,IAAI,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CAC3D,MAAM,UAAU,iBAAiB,KAAK;CAEtC,KAAK,MAAM,MAAM,UAAU,iBAAiB,GAAG;EAC7C,MAAM,MAAM,SAAS,IAAI,EAAE;EAC3B,IAAI,CAAC,KACH;EAEF,MAAM,WAAW,sBAAsB,IAAI,UAAU,OAAO;EAC5D,IAAI,aAAa,IAAI,eAAe;GAClC,IAAI,gBAAgB;GACpB,IAAI,aAAa,CAAC;GAClB,QAAQ,IAAI,SAAS;IAAE,SAAS,IAAI;IAAe,OAAO,CAAC;GAAE;EAC/D;CACF;CAEA,KAAK,MAAM,OAAO,OAChB,IAAI,sBAAsB,sBAAsB,IAAI,gBAAgB,OAAO;AAE/E;;;;;AAMA,SAAgB,6BACd,OACA,UACA,SACM;CACN,MAAM,WAAW,IAAI,IAAI,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CAC3D,MAAM,SAAS,SAAS,IAAI,QAAQ;CACpC,IAAI,CAAC,QACH,MAAM,IAAI,MAAM,gDAAgD,UAAU;CAG5E,MAAM,UAAU,iBAAiB,KAAK;CACtC,IAAI,QAAQ,gBAAgB;EAC1B,OAAO,gBAAgB,sBAAsB,OAAO,UAAU,OAAO;EACrE,IAAI,QAAQ,kBACV,OAAO,aAAa,CAAC;EAEvB,QAAQ,OAAO,SAAS,cAAc,MAAM;CAC9C,OAAO,IAAI,QAAQ,aACjB,QAAQ,OAAO,SAAS,cAAc,MAAM;CAG9C,IAAI,QAAQ,wBAAwB,CAAC,QAAQ,aAC3C,OAAO,sBAAsB,sBAAsB,OAAO,gBAAgB,OAAO;CAGnF,IAAI,CAAC,QAAQ,aACX;CAGF,MAAM,YAAY,wBAAwB,KAAK;CAC/C,MAAM,YAAY,8BAA8B,KAAK;CACrD,MAAM,YAAY,UAAU,iBAAiB,CAAC,QAAQ,CAAC;CACvD,MAAM,eAAe,IAAI,IAAI,SAAS;CAEtC,KAAK,MAAM,MAAM,UAAU,iBAAiB,GAAG;EAC7C,IAAI,CAAC,aAAa,IAAI,EAAE,GACtB;EAEF,MAAM,WAAW,SAAS,IAAI,EAAE;EAChC,IAAI,CAAC,UACH;EAEF,MAAM,WAAW,sBAAsB,SAAS,UAAU,OAAO;EACjE,IAAI,aAAa,SAAS,eAAe;GACvC,SAAS,gBAAgB;GACzB,SAAS,aAAa,CAAC;GACvB,QAAQ,SAAS,SAAS;IAAE,SAAS,SAAS;IAAe,OAAO,CAAC;GAAE;EACzE;CACF;CAEA,MAAM,6BAAa,IAAI,IAAI;EAAC;EAAU,GAAG;EAAW,GAAG,UAAU,iBAAiB,CAAC,UAAU,GAAG,SAAS,CAAC;CAAC,CAAC;CAC5G,KAAK,MAAM,QAAQ,OACjB,IAAI,WAAW,IAAI,KAAK,EAAE,GACxB,KAAK,sBAAsB,sBAAsB,KAAK,gBAAgB,OAAO;AAGnF;AAIA,SAAS,oBACP,OACA,OACe;CACf,MAAM,QAAQ,IAAI,MAAc;CAChC,MAAM,YAAY,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,OAAO,IAAI,EAAE,CAAC,CAAC;CAC/D,KAAK,MAAM,OAAO,OAChB,MAAM,QAAQ,IAAI,EAAE;CAEtB,KAAK,MAAM,OAAO,OAChB,KAAK,MAAM,UAAU,gBAAgB,IAAI,MAAM,GAAG;EAChD,MAAM,SAAS,UAAU,IAAI,MAAM;EACnC,IAAI,WAAW,QACb,MAAM,QAAQ,QAAQ,IAAI,EAAE;CAEhC;CAEF,OAAO;AACT;AAEA,SAAS,iBAAiB,OAAqD;CAC7E,MAAM,UAAuB,CAAC;CAC9B,KAAK,MAAM,OAAO,OAChB,QAAQ,IAAI,SAAS,cAAc,GAAG;CAExC,OAAO;AACT;AAEA,SAAS,cAAc,KAAgD;CACrE,OAAO;EACL,SAAS,IAAI;EACb,OAAO,IAAI,WAAW,KAAI,UAAS;GAAE,MAAM,KAAK;GAAM,OAAO,eAAe,KAAK,IAAI;EAAE,EAAE;CAC3F;AACF;;;;;;;;AC9EA,SAAgB,gBACd,OAC0B;CAC1B,MAAM,cAAc,MAAM;CAC1B,IAAI,YAAY,WAAW,GACzB,OAAO;EACL,OAAO,MAAM,cAAc,KAAI,SAAQ,gBAAgB,IAAI,CAAC;EAC5D,eAAe,MAAM,wBAAwB,CAAC,EAAA,CAAG,KAAI,UAAS,EAAE,GAAG,KAAK,EAAE;EAC1E,QAAQ,MAAM;EACd,OAAO,CAAC;EACR,cAAc,CAAC;EACf,4BAAY,IAAI,IAAI;EACpB,aAAa,CAAC;EACd,gBAAgB,CAAC;CACnB;CAGF,MAAM,gBAAgB,MAAM,cAAc,KAAI,SAAQ,gBAAgB,IAAI,CAAC;CAC3E,IAAI,gBAAgB,MAAM,wBAAwB,CAAC,EAAA,CAAG,KAAI,UAAS,EAAE,GAAG,KAAK,EAAE;CAC/E,MAAM,eAAe,sBAAsB,eAAe,WAAW;CACrE,MAAM,QAAgC,CAAC;CACvC,MAAM,WAAgB,CAAC;CACvB,MAAM,cAAc,IAAI,IAAI,YAAY,KAAI,QAAO,IAAI,EAAE,CAAC;CAC1D,IAAI,SAAS,MAAM;CAEnB,KAAK,MAAM,OAAO,aAAa;EAC7B,MAAM,QAAQ;EACd,UAAU;EACV,MAAM,IAAI,MAAM;EAEhB,MAAM,SAAS,gBAAgB,GAAG;EAClC,OAAO,KAAK;EACZ,IAAI,OAAO,KAAK,YAAY,CAAC,CAAC,SAAS,GAAG;GACxC,OAAO,QAAQ,aAAa,IAAI;GAChC,2BAA2B,CAAC,MAAM,GAAG,cAAc,KAAK;EAC1D;EACA,SAAS,KAAK,MAAM;CACtB;CAEA,eAAe,mBAAmB,MAAM,sBAAsB,CAAC,GAAG,aAAa,OAAO,YAAY;CAClG,MAAM,QAAQ,cAAc,OAAO,QAAQ;CAC3C,2BAA2B,KAAK;CAEhC,MAAM,gBAAgB,MAAM,iBAAiB,CAAC;CAC9C,IAAI,cAAc,WAAW,GAC3B,OAAO;EACL;EACA;EACA;EACA;EACA;EACA,4BAAY,IAAI,IAAI;EACpB,aAAa,SAAS,KAAI,QAAO,IAAI,EAAE;EACvC,gBAAgB,CAAC;CACnB;CAGF,MAAM,WAAW,8BAA8B,eAAe,aAAa,KAAK;CAChF,MAAM,cAAc,8BAA8B,OAAO,cAAc,QAAQ;CAC/E,2BAA2B,YAAY,KAAK;CAE5C,OAAO;EACL,OAAO,YAAY;EACnB,cAAc,YAAY;EAC1B;EACA;EACA;EACA,YAAY,YAAY;EACxB,aAAa,SAAS,KAAI,QAAO,IAAI,EAAE;EACvC,gBAAgB,YAAY;CAC9B;AACF;;AAGA,SAAgB,4BAA4B,UAAkB,OAA8C;CAC1G,MAAM,SAAS,MAAM,QAAO,SAAQ,KAAK,aAAa,SAAS,QAAQ;CACvE,MAAM,WAAW,IAAI,IAAI,MAAM;CAC/B,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,WAAW,KAAK,UAAU,SAAS,SAAS,CAAC,SAAS,IAAI,IAAI,GAAG;EACxE,OAAO,KAAK,IAAI;EAChB,SAAS,IAAI,IAAI;CACnB;CAEF,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,WAAW,CAAC,SAAS,IAAI,IAAI,GAAG;EACvC,OAAO,KAAK,IAAI;EAChB,SAAS,IAAI,IAAI;CACnB;CAEF,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,SAAS,IAAI,IAAI,GAAG;EACvB,OAAO,KAAK,IAAI;EAChB,SAAS,IAAI,IAAI;CACnB;CAEF,OAAO;AACT;;;;;;;ACpKA,SAAgB,kBAA4C,OAAqB,YAAoC;CACnH,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CACvD,OAAO,WAAW,KAAI,OAAM;EAC1B,MAAM,OAAO,KAAK,IAAI,EAAE;EACxB,IAAI,CAAC,MACH,MAAM,IAAI,MAAM,iCAAiC,IAAI;EAEvD,OAAO;CACT,CAAC;AACH;;;;;AAMA,SAAgB,eAAe,KAAwB,QAA2B,QAA0B;CAC1G,MAAM,YAAY,IAAI,IAAI,MAAM;CAChC,MAAM,OAAO,IAAI,QAAO,OAAM,CAAC,UAAU,IAAI,EAAE,CAAC;CAChD,MAAM,cAAc,IAAI,QAAO,OAAM,UAAU,IAAI,EAAE,CAAC;CACtD,MAAM,UAAU,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,KAAK,MAAM,CAAC;CACzD,OAAO;EAAC,GAAG,KAAK,MAAM,GAAG,OAAO;EAAG,GAAG;EAAa,GAAG,KAAK,MAAM,OAAO;CAAC;AAC3E;;AAGA,SAAgB,gBACd,OACA,MACA,aACM;CACN,IAAI,gBAAgB,QAAQ,gBAAgB,QAAW;EACrD,MAAM,KAAK,IAAI;EACf;CACF;CACA,MAAM,MAAM,MAAM,WAAU,QAAO,IAAI,OAAO,WAAW;CACzD,MAAM,WAAW,QAAQ,KAAK,MAAM,SAAS,MAAM;CACnD,MAAM,OAAO,UAAU,GAAG,IAAI;AAChC;;;;AC3BA,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;CAEf,wBAAwB;CACxB,0BAA0B;CAC1B,4BAA4B;CAC5B,0BAA0B;CAC1B,6BAA6B;CAC7B,+BAA+B;CAC/B,wBAAwB;CACxB,iCAAiC;;CAEjC,gCAAgC;CAChC,8BAA8B;CAC9B,yBAAyB;CACzB,4BAA4B;AAC9B;;AAYA,SAAgB,iBACd,KACA,MACS;CACT,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,8BACP,KAKiB;CACjB,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,IAAiB;CACpC,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"}