@rsconcept/domain 1.8.0 → 1.8.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (50) hide show
  1. package/dist/{analyzer-DpE0qknt.d.ts → analyzer-iqAXyROE.d.ts} +2 -2
  2. package/dist/{arguments-extractor-Dd1lFom9.d.ts → arguments-extractor-ngatANBI.d.ts} +2 -2
  3. package/dist/{ast-annotations-CZCzs9Uk.d.ts → ast-annotations-D6KZDu12.d.ts} +2 -2
  4. package/dist/{calculator-Dt03dsnd.d.ts → calculator-k8BGIKmj.d.ts} +2 -2
  5. package/dist/index.d.ts +8 -8
  6. package/dist/library/index.d.ts +13 -3
  7. package/dist/library/index.js +36 -8
  8. package/dist/library/index.js.map +1 -1
  9. package/dist/library/rsengine.d.ts +1 -1
  10. package/dist/library/rsform-api.d.ts +2 -2
  11. package/dist/library/rsform.d.ts +2 -2
  12. package/dist/library/rsmodel-api.d.ts +1 -1
  13. package/dist/library/structure-planner.d.ts +1 -1
  14. package/dist/rslang/api.d.ts +1 -1
  15. package/dist/rslang/api.js +2 -1
  16. package/dist/rslang/api.js.map +1 -1
  17. package/dist/rslang/ast-annotations.d.ts +1 -1
  18. package/dist/rslang/eval/calculator.d.ts +1 -1
  19. package/dist/rslang/eval/value-api.d.ts +1 -1
  20. package/dist/rslang/index.d.ts +8 -8
  21. package/dist/rslang/labels.d.ts +4 -2
  22. package/dist/rslang/labels.js +8 -2
  23. package/dist/rslang/labels.js.map +1 -1
  24. package/dist/rslang/parser/syntax-errors/index.d.ts +1 -1
  25. package/dist/rslang/semantic/analyzer.d.ts +1 -1
  26. package/dist/rslang/semantic/arguments-extractor.d.ts +1 -1
  27. package/dist/rslang/semantic/type-auditor.d.ts +1 -1
  28. package/dist/rslang/semantic/type-auditor.js +2 -2
  29. package/dist/rslang/semantic/type-auditor.js.map +1 -1
  30. package/dist/rslang/semantic/typification-api.d.ts +1 -1
  31. package/dist/rslang/semantic/typification-parser.d.ts +1 -1
  32. package/dist/rslang/semantic/typification.d.ts +2 -2
  33. package/dist/rslang/semantic/typification.js +14 -6
  34. package/dist/rslang/semantic/typification.js.map +1 -1
  35. package/dist/rslang/typification-graph.d.ts +1 -1
  36. package/dist/{typification-DDuv88ir.d.ts → typification-9lNu9R4k.d.ts} +8 -4
  37. package/dist/{typification-graph-8VdK6_Fh.d.ts → typification-graph-BY_oGT82.d.ts} +2 -2
  38. package/dist/{typification-parser-DHO42ZRc.d.ts → typification-parser-Dytsv9CI.d.ts} +2 -2
  39. package/dist/{value-api-C2X4Pom5.d.ts → value-api-CXLl_zg0.d.ts} +2 -2
  40. package/package.json +1 -1
  41. package/src/library/index.ts +1 -0
  42. package/src/library/template-instantiation.test.ts +122 -3
  43. package/src/library/template-instantiation.ts +42 -12
  44. package/src/rslang/api.ts +2 -1
  45. package/src/rslang/labels.ts +10 -1
  46. package/src/rslang/semantic/type-auditor.test.ts +25 -6
  47. package/src/rslang/semantic/type-auditor.ts +2 -1
  48. package/src/rslang/semantic/typification-api.test.ts +21 -5
  49. package/src/rslang/semantic/typification-parser.test.ts +6 -1
  50. package/src/rslang/semantic/typification.ts +16 -6
@@ -1,5 +1,5 @@
1
1
  import { t as AstNode } from "./ast-C8sIpKdL.js";
2
- import { f as ExpressionType, g as TypeClass } from "./typification-DDuv88ir.js";
2
+ import { f as ExpressionType, g as TypeClass } from "./typification-9lNu9R4k.js";
3
3
  import { i as RSErrorDescription } from "./error-CzIbnP-N.js";
4
4
  import { t as ValueClass } from "./value-class-CNI-lqXJ.js";
5
5
 
@@ -35,4 +35,4 @@ declare class RSLangAnalyzer {
35
35
  }
36
36
  //#endregion
37
37
  export { RSLangAnalyzer as a, AnalysisOptions as i, AnalysisFast as n, AnalysisFull as r, AnalysisBase as t };
38
- //# sourceMappingURL=analyzer-DpE0qknt.d.ts.map
38
+ //# sourceMappingURL=analyzer-iqAXyROE.d.ts.map
@@ -1,5 +1,5 @@
1
1
  import { t as AstNode } from "./ast-C8sIpKdL.js";
2
- import { f as ExpressionType } from "./typification-DDuv88ir.js";
2
+ import { f as ExpressionType } from "./typification-9lNu9R4k.js";
3
3
 
4
4
  //#region src/rslang/semantic/arguments-extractor.d.ts
5
5
  /** Represents function argument definition. */
@@ -35,4 +35,4 @@ declare class ArgumentsExtractor {
35
35
  }
36
36
  //#endregion
37
37
  export { ArgumentsType as n, ArgumentsExtractor as t };
38
- //# sourceMappingURL=arguments-extractor-Dd1lFom9.d.ts.map
38
+ //# sourceMappingURL=arguments-extractor-ngatANBI.d.ts.map
@@ -1,5 +1,5 @@
1
1
  import { t as AstNode } from "./ast-C8sIpKdL.js";
2
- import { f as ExpressionType } from "./typification-DDuv88ir.js";
2
+ import { f as ExpressionType } from "./typification-9lNu9R4k.js";
3
3
  import { a as RSErrorInfo, r as RSErrorCode } from "./error-CzIbnP-N.js";
4
4
 
5
5
  //#region src/rslang/ast-annotations.d.ts
@@ -13,4 +13,4 @@ declare function annotateError(node: AstNode, code: RSErrorCode, params?: readon
13
13
  declare function readErrorAnnotation(node: AstNode): RSErrorInfo | null;
14
14
  //#endregion
15
15
  export { readTypeAnnotation as i, annotateType as n, readErrorAnnotation as r, annotateError as t };
16
- //# sourceMappingURL=ast-annotations-CZCzs9Uk.d.ts.map
16
+ //# sourceMappingURL=ast-annotations-D6KZDu12.d.ts.map
@@ -1,5 +1,5 @@
1
1
  import { t as AstNode } from "./ast-C8sIpKdL.js";
2
- import { f as ExpressionType } from "./typification-DDuv88ir.js";
2
+ import { f as ExpressionType } from "./typification-9lNu9R4k.js";
3
3
  import { i as RSErrorDescription } from "./error-CzIbnP-N.js";
4
4
  import { l as Value } from "./value-BduA_ZGp.js";
5
5
 
@@ -36,4 +36,4 @@ declare class RSCalculator {
36
36
  }
37
37
  //#endregion
38
38
  export { CalculatorResult as n, RSCalculator as r, CalculatorEvaluateOptions as t };
39
- //# sourceMappingURL=calculator-Dt03dsnd.d.ts.map
39
+ //# sourceMappingURL=calculator-k8BGIKmj.d.ts.map
package/dist/index.d.ts CHANGED
@@ -8,19 +8,19 @@ import { r as printTree, t as CMSyntaxNode } from "./lezer-tree-iS7LpLBJ.js";
8
8
  import { a as TOKEN_ERROR, c as flattenAst, d as printAst, f as visitAstDFS, i as FlatAstNode, l as getNodeIndices, n as AstNodeBase, o as buildTree, r as FlatAST, s as findByUid, t as AstNode, u as getNodeText } from "./ast-C8sIpKdL.js";
9
9
  import { t as Branded } from "./branded-ZlzIcxzu.js";
10
10
  import { n as generateStub, t as applyHash_fnv1a } from "./hash-Y8I4c6Al.js";
11
- import { b as Typification, d as EmptySetT, f as ExpressionType, g as TypeClass, k as makeTypePath, m as LogicT, t as AnyTypificationT, v as TypeID, y as TypePath } from "./typification-DDuv88ir.js";
11
+ import { A as makeTypePath, b as Typification, d as EmptySetT, f as ExpressionType, g as TypeClass, m as LogicT, t as AnyTypificationT, v as TypeID, y as TypePath } from "./typification-9lNu9R4k.js";
12
12
  import { i as RSErrorDescription, r as RSErrorCode } from "./error-CzIbnP-N.js";
13
- import { i as readTypeAnnotation, r as readErrorAnnotation } from "./ast-annotations-CZCzs9Uk.js";
13
+ import { i as readTypeAnnotation, r as readErrorAnnotation } from "./ast-annotations-D6KZDu12.js";
14
14
  import { d as ValuePath, l as Value, o as TUPLE_ID, p as makeValuePath } from "./value-BduA_ZGp.js";
15
- import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "./calculator-Dt03dsnd.js";
16
- import { d as printValue } from "./value-api-C2X4Pom5.js";
15
+ import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "./calculator-k8BGIKmj.js";
16
+ import { d as printValue } from "./value-api-CXLl_zg0.js";
17
17
  import { t as parser } from "./parser-Bwd8LxJ1.js";
18
18
  import { t as TokenID } from "./token-DeXAmzwr.js";
19
19
  import { t as ValueClass } from "./value-class-CNI-lqXJ.js";
20
- import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "./analyzer-DpE0qknt.js";
21
- import { n as ArgumentsType } from "./arguments-extractor-Dd1lFom9.js";
22
- import { n as applyAsciiTypeSubstitutions, r as parseTypeText } from "./typification-parser-DHO42ZRc.js";
23
- import { n as TypificationNodeData, t as TypificationGraph } from "./typification-graph-8VdK6_Fh.js";
20
+ import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "./analyzer-iqAXyROE.js";
21
+ import { n as ArgumentsType } from "./arguments-extractor-ngatANBI.js";
22
+ import { n as applyAsciiTypeSubstitutions, r as parseTypeText } from "./typification-parser-Dytsv9CI.js";
23
+ import { n as TypificationNodeData, t as TypificationGraph } from "./typification-graph-BY_oGT82.js";
24
24
  import { ArgumentValue, Attribution, Constituenta, CstClass, CstStatus, CstType, RSForm, RSFormStats, Substitution, TypeInfo } from "./library/rsform.js";
25
25
  import { BasicBinding, BasicsContext, DEFAULT_VALUE_TEXT, EvalStatus, RSModel, RSModelStats } from "./library/rsmodel.js";
26
26
  import { RSEngine } from "./library/rsengine.js";
@@ -27,11 +27,18 @@ interface TemplateInstantiationItem {
27
27
  typification_manual: string;
28
28
  value_is_property: boolean;
29
29
  }
30
+ /** Conflicting argument bindings inferred for the same template dependency. */
31
+ interface TemplateBindingConflict {
32
+ templateAlias: string;
33
+ paramAlias: string;
34
+ existing: string;
35
+ incoming: string;
36
+ }
30
37
  /**
31
38
  * Batch create plan: dependencies first, selected template constituent last.
32
39
  *
33
- * Skips bank functions/predicates whose alias already exists in the target schema, and
34
- * constituents whose substituted formal definition already exists (normalized comparison).
40
+ * Reuses constituents whose substituted formal definition already exists in the target schema
41
+ * (normalized comparison), even when the bank alias differs from the matched target alias.
35
42
  * {@link TemplateInstantiationPlan.mainDuplicateAlias} reports when the selected template is a duplicate.
36
43
  * Does not set `insert_after`; the caller supplies insertion on the batch DTO.
37
44
  */
@@ -39,6 +46,8 @@ interface TemplateInstantiationPlan {
39
46
  items: TemplateInstantiationItem[];
40
47
  /** Set when the selected template expression already exists in the target schema. */
41
48
  mainDuplicateAlias: string | null;
49
+ /** Set when nested template calls bind the same parameter to different global aliases. */
50
+ bindingConflict: TemplateBindingConflict | null;
42
51
  }
43
52
  /**
44
53
  * Input for planning template instantiation into a conceptual schema.
@@ -80,6 +89,7 @@ declare class TemplateInstantiationPlanner {
80
89
  private readonly userMapping;
81
90
  private readonly depBindings;
82
91
  private readonly depRefs;
92
+ private bindingConflict;
83
93
  /** @param input - See {@link TemplateInstantiationInput}. */
84
94
  constructor(input: TemplateInstantiationInput);
85
95
  /** @returns Dependency items in topological order, then the main template item when it is not a duplicate. */
@@ -90,5 +100,5 @@ declare class TemplateInstantiationPlanner {
90
100
  private collectDependencies;
91
101
  }
92
102
  //#endregion
93
- export { AccessPolicy, type ArgumentValue, type Attribution, type BasicBinding, type BasicsContext, type Block, type Constituenta, CstClass, CstStatus, type CstSubstituteInfo, CstType, type CurrentVersion, DEFAULT_VALUE_TEXT, EvalStatus, FolderNode, FolderTree, type LibraryItem, type LibraryItemReference, LibraryItemType, LocationHead, NodeType, type Operation, type OperationInput, type OperationSchema, type OperationSchemaStats, type OperationSynthesis, OperationType, type OssItem, type OssLayout, type Position2D, RSEngine, type RSForm, type RSFormStats, type RSModel, type RSModelStats, type Substitution, type SubstitutionErrorDescription, SubstitutionErrorType, type TemplateInstantiationInput, type TemplateInstantiationItem, type TemplateInstantiationPlan, TemplateInstantiationPlanner, type TypeInfo, type VersionInfo, planTemplateInstantiation };
103
+ export { AccessPolicy, type ArgumentValue, type Attribution, type BasicBinding, type BasicsContext, type Block, type Constituenta, CstClass, CstStatus, type CstSubstituteInfo, CstType, type CurrentVersion, DEFAULT_VALUE_TEXT, EvalStatus, FolderNode, FolderTree, type LibraryItem, type LibraryItemReference, LibraryItemType, LocationHead, NodeType, type Operation, type OperationInput, type OperationSchema, type OperationSchemaStats, type OperationSynthesis, OperationType, type OssItem, type OssLayout, type Position2D, RSEngine, type RSForm, type RSFormStats, type RSModel, type RSModelStats, type Substitution, type SubstitutionErrorDescription, SubstitutionErrorType, type TemplateBindingConflict, type TemplateInstantiationInput, type TemplateInstantiationItem, type TemplateInstantiationPlan, TemplateInstantiationPlanner, type TypeInfo, type VersionInfo, planTemplateInstantiation };
94
104
  //# sourceMappingURL=index.d.ts.map
@@ -39,6 +39,7 @@ var TemplateInstantiationPlanner = class {
39
39
  userMapping;
40
40
  depBindings = /* @__PURE__ */ new Map();
41
41
  depRefs = /* @__PURE__ */ new Map();
42
+ bindingConflict = null;
42
43
  /** @param input - See {@link TemplateInstantiationInput}. */
43
44
  constructor(input) {
44
45
  this.targetSchema = input.targetSchema;
@@ -52,12 +53,18 @@ var TemplateInstantiationPlanner = class {
52
53
  plan() {
53
54
  const mainDefinition = substituteTemplateArgs(this.prototype.definition_formal, this.userMapping);
54
55
  this.collectDependencies(mainDefinition, this.userMapping);
56
+ if (this.bindingConflict) return {
57
+ items: [],
58
+ mainDuplicateAlias: null,
59
+ bindingConflict: this.bindingConflict
60
+ };
55
61
  const definitionIndex = createFormalDefinitionIndex(this.targetSchema);
56
62
  const dependencyItems = this.buildDependencyItems(definitionIndex);
57
63
  const { item: mainItem, duplicateAlias: mainDuplicateAlias } = this.buildMainItem(mainDefinition, dependencyItems.takenAliases, dependencyItems.aliasMapping, definitionIndex);
58
64
  return {
59
65
  items: mainItem ? [...dependencyItems.items, mainItem] : dependencyItems.items,
60
- mainDuplicateAlias
66
+ mainDuplicateAlias,
67
+ bindingConflict: null
61
68
  };
62
69
  }
63
70
  buildDependencyItems(definitionIndex) {
@@ -113,13 +120,22 @@ var TemplateInstantiationPlanner = class {
113
120
  };
114
121
  }
115
122
  ensureDep(templateAlias, bindings, referrer) {
116
- if (targetHasAlias(this.targetSchema, templateAlias) || !this.templateByAlias.has(templateAlias)) return;
123
+ if (this.bindingConflict) return;
124
+ if (!this.templateByAlias.has(templateAlias)) return;
117
125
  if (referrer && this.depBindings.has(referrer)) {
118
126
  const refs = this.depRefs.get(referrer) ?? /* @__PURE__ */ new Set();
119
127
  refs.add(templateAlias);
120
128
  this.depRefs.set(referrer, refs);
121
129
  }
122
- const merged = mergeBindings(this.depBindings.get(templateAlias), bindings);
130
+ const mergeResult = mergeBindings(this.depBindings.get(templateAlias), bindings);
131
+ if (!mergeResult.ok) {
132
+ this.bindingConflict = {
133
+ templateAlias,
134
+ ...mergeResult.conflict
135
+ };
136
+ return;
137
+ }
138
+ const merged = mergeResult.bindings;
123
139
  const changed = !this.depBindings.has(templateAlias) || merged.size !== (this.depBindings.get(templateAlias)?.size ?? 0);
124
140
  this.depBindings.set(templateAlias, merged);
125
141
  if (!changed && referrer) return;
@@ -129,6 +145,7 @@ var TemplateInstantiationPlanner = class {
129
145
  this.collectDependencies(definition, argumentValuesToMapping(args), templateAlias);
130
146
  }
131
147
  collectDependencies(expression, scope, referrer) {
148
+ if (this.bindingConflict) return;
132
149
  const ast = parseRSLangExpression(expression);
133
150
  if (!ast) return;
134
151
  for (const call of extractFuncCalls(ast, expression)) {
@@ -190,8 +207,22 @@ function resolveArgBinding(argExpr, scope) {
190
207
  }
191
208
  function mergeBindings(existing, incoming) {
192
209
  const result = new Map(existing);
193
- for (const [alias, value] of incoming) if (!result.has(alias)) result.set(alias, value);
194
- return result;
210
+ for (const [alias, value] of incoming) {
211
+ const existingValue = result.get(alias);
212
+ if (existingValue === void 0) result.set(alias, value);
213
+ else if (existingValue !== value) return {
214
+ ok: false,
215
+ conflict: {
216
+ paramAlias: alias,
217
+ existing: existingValue,
218
+ incoming: value
219
+ }
220
+ };
221
+ }
222
+ return {
223
+ ok: true,
224
+ bindings: result
225
+ };
195
226
  }
196
227
  function bindingMapToArgs(params, bindings) {
197
228
  return params.map((param) => ({
@@ -236,9 +267,6 @@ function extractFuncCalls(ast, expression) {
236
267
  });
237
268
  return result;
238
269
  }
239
- function targetHasAlias(schema, alias) {
240
- return schema.items.some((cst) => cst.alias === alias);
241
- }
242
270
  function topologicalSort(aliases, refs) {
243
271
  const remaining = new Set(aliases);
244
272
  const sorted = [];
@@ -1 +1 @@
1
- {"version":3,"file":"index.js","names":[],"sources":["../../src/library/template-instantiation.ts"],"sourcesContent":["/**\n * Module: template instantiation from the expression bank into a target {@link RSForm}.\n */\n\nimport { type AstNode, visitAstDFS } from '../parsing';\nimport {\n type AliasMapping,\n applyAliasMapping,\n isGlobalAlias,\n parseRSLangExpression,\n splitTemplateDefinition,\n substituteLocalAliases,\n substituteTemplateArgs\n} from '../rslang/api';\nimport { labelType } from '../rslang/labels';\nimport { TokenID } from '../rslang/parser/token';\nimport { TypeID } from '../rslang/semantic/typification';\n\nimport { type ArgumentValue, type Constituenta, type CstType, type RSForm } from './rsform';\nimport {\n applyMappingToConstituents,\n argumentValuesToMapping,\n generateAlias,\n inferTemplatedType,\n isFunctional,\n normalizeExpression\n} from './rsform-api';\n\n/**\n * Payload for one {@link Constituenta} to create when instantiating an expression-bank template.\n *\n * Aliases are generated for the target schema. Formal definitions and typifications already\n * reflect user argument substitution and remapping of bank aliases to those new aliases.\n */\nexport interface TemplateInstantiationItem {\n /** Alias to assign in the target schema. */\n alias: string;\n /** Inferred type after argument substitution (function/predicate may become term/axiom). */\n cst_type: CstType;\n crucial: boolean;\n convention: string;\n definition_formal: string;\n definition_raw: string;\n term_raw: string;\n term_forms: Constituenta['term_forms'];\n typification_manual: string;\n value_is_property: boolean;\n}\n\n/**\n * Batch create plan: dependencies first, selected template constituent last.\n *\n * Skips bank functions/predicates whose alias already exists in the target schema, and\n * constituents whose substituted formal definition already exists (normalized comparison).\n * {@link TemplateInstantiationPlan.mainDuplicateAlias} reports when the selected template is a duplicate.\n * Does not set `insert_after`; the caller supplies insertion on the batch DTO.\n */\nexport interface TemplateInstantiationPlan {\n items: TemplateInstantiationItem[];\n /** Set when the selected template expression already exists in the target schema. */\n mainDuplicateAlias: string | null;\n}\n\n/**\n * Input for planning template instantiation into a conceptual schema.\n */\nexport interface TemplateInstantiationInput {\n /** Schema that will receive new constituents. */\n targetSchema: RSForm;\n /** All constituents of the selected expression-bank RSForm (not only the prototype). */\n templateItems: Constituenta[];\n /** Template constituent chosen in the UI (main expression to add). */\n prototype: Constituenta;\n /** User bindings from template parameter aliases to target-schema global aliases. */\n userArgs: ArgumentValue[];\n /**\n * Main constituent attributes from the create dialog (alias, labels, flags).\n * `definition_formal` and `cst_type` may be overridden from `prototype` and `userArgs`.\n */\n mainItem: TemplateInstantiationItem;\n}\n\ninterface FuncCallRef {\n callee: string;\n args: string[];\n}\n\ninterface TemplateParam {\n alias: string;\n typification: string;\n}\n\n/**\n * Build a batch create plan for a template expression and its bank dependencies.\n *\n * Walks nested `F#` / `P#` calls in the substituted expression, collects missing term-functions\n * and predicate-functions from `templateItems`, propagates argument bindings into nested calls,\n * topologically orders dependencies, and remaps bank aliases to freshly generated target aliases.\n */\nexport function planTemplateInstantiation(input: TemplateInstantiationInput): TemplateInstantiationPlan {\n return new TemplateInstantiationPlanner(input).plan();\n}\n\n/**\n * Stateful planner for {@link planTemplateInstantiation}.\n *\n * Prefer the function wrapper unless you need to hold or reuse planner state between calls.\n */\nexport class TemplateInstantiationPlanner {\n private readonly targetSchema: RSForm;\n private readonly prototype: Constituenta;\n private readonly userArgs: ArgumentValue[];\n private readonly mainItemTemplate: TemplateInstantiationItem;\n private readonly templateByAlias: Map<string, Constituenta>;\n private readonly userMapping: AliasMapping;\n private readonly depBindings = new Map<string, Map<string, string>>();\n private readonly depRefs = new Map<string, Set<string>>();\n\n /** @param input - See {@link TemplateInstantiationInput}. */\n constructor(input: TemplateInstantiationInput) {\n this.targetSchema = input.targetSchema;\n this.prototype = input.prototype;\n this.userArgs = input.userArgs;\n this.mainItemTemplate = input.mainItem;\n this.templateByAlias = new Map(\n input.templateItems.filter(cst => isFunctional(cst.cst_type)).map(cst => [cst.alias, cst])\n );\n this.userMapping = argumentValuesToMapping(input.userArgs);\n }\n\n /** @returns Dependency items in topological order, then the main template item when it is not a duplicate. */\n plan(): TemplateInstantiationPlan {\n const mainDefinition = substituteTemplateArgs(this.prototype.definition_formal, this.userMapping);\n this.collectDependencies(mainDefinition, this.userMapping);\n\n const definitionIndex = createFormalDefinitionIndex(this.targetSchema);\n const dependencyItems = this.buildDependencyItems(definitionIndex);\n const { item: mainItem, duplicateAlias: mainDuplicateAlias } = this.buildMainItem(\n mainDefinition,\n dependencyItems.takenAliases,\n dependencyItems.aliasMapping,\n definitionIndex\n );\n\n return {\n items: mainItem ? [...dependencyItems.items, mainItem] : dependencyItems.items,\n mainDuplicateAlias\n };\n }\n\n private buildDependencyItems(definitionIndex: FormalDefinitionIndex): {\n items: TemplateInstantiationItem[];\n aliasMapping: AliasMapping;\n takenAliases: string[];\n } {\n const dependencyAliases = topologicalSort([...this.depBindings.keys()], this.depRefs);\n const aliasMapping: AliasMapping = {};\n const takenAliases: string[] = [];\n const reservedAliases = [this.mainItemTemplate.alias];\n const items: TemplateInstantiationItem[] = [];\n\n for (const templateAlias of dependencyAliases) {\n const template = this.templateByAlias.get(templateAlias)!;\n const bindings = this.depBindings.get(templateAlias)!;\n const args = bindingMapToArgs(getTemplateParams(template), bindings);\n const cst_type = inferTemplatedType(template.cst_type, args);\n const definition = applyAliasMapping(\n substituteTemplateArgs(template.definition_formal, argumentValuesToMapping(args)),\n aliasMapping\n );\n\n const existingAlias = definitionIndex.find(cst_type, definition);\n if (existingAlias) {\n aliasMapping[templateAlias] = existingAlias;\n continue;\n }\n\n const alias = generateAlias(template.cst_type, this.targetSchema, [...reservedAliases, ...takenAliases]);\n takenAliases.push(alias);\n aliasMapping[templateAlias] = alias;\n\n const item = instantiateTemplateItem(template, args, alias);\n item.definition_formal = definition;\n applyMappingToConstituents([item], aliasMapping, false);\n definitionIndex.register(cst_type, item.definition_formal, alias);\n items.push(item);\n }\n\n return { items, aliasMapping, takenAliases };\n }\n\n private buildMainItem(\n mainDefinition: string,\n takenAliases: string[],\n aliasMapping: AliasMapping,\n definitionIndex: FormalDefinitionIndex\n ): { item: TemplateInstantiationItem | null; duplicateAlias: string | null } {\n const mappedDefinition = applyAliasMapping(mainDefinition, aliasMapping);\n const cst_type = inferTemplatedType(this.prototype.cst_type, this.userArgs);\n\n const duplicateAlias = definitionIndex.find(cst_type, mappedDefinition);\n if (duplicateAlias) {\n return { item: null, duplicateAlias };\n }\n\n const mainItem: TemplateInstantiationItem = {\n ...this.mainItemTemplate,\n definition_formal: mappedDefinition,\n cst_type\n };\n applyMappingToConstituents([mainItem], aliasMapping, false);\n\n if (takenAliases.includes(mainItem.alias)) {\n mainItem.alias = generateAlias(mainItem.cst_type, this.targetSchema, [\n ...takenAliases,\n this.mainItemTemplate.alias\n ]);\n }\n\n return { item: mainItem, duplicateAlias: null };\n }\n\n private ensureDep(templateAlias: string, bindings: Map<string, string>, referrer?: string): void {\n if (targetHasAlias(this.targetSchema, templateAlias) || !this.templateByAlias.has(templateAlias)) {\n return;\n }\n if (referrer && this.depBindings.has(referrer)) {\n const refs = this.depRefs.get(referrer) ?? new Set<string>();\n refs.add(templateAlias);\n this.depRefs.set(referrer, refs);\n }\n const merged = mergeBindings(this.depBindings.get(templateAlias), bindings);\n const changed =\n !this.depBindings.has(templateAlias) || merged.size !== (this.depBindings.get(templateAlias)?.size ?? 0);\n this.depBindings.set(templateAlias, merged);\n if (!changed && referrer) {\n return;\n }\n const template = this.templateByAlias.get(templateAlias)!;\n const args = bindingMapToArgs(getTemplateParams(template), merged);\n const definition = substituteTemplateArgs(template.definition_formal, argumentValuesToMapping(args));\n this.collectDependencies(definition, argumentValuesToMapping(args), templateAlias);\n }\n\n private collectDependencies(expression: string, scope: AliasMapping, referrer?: string): void {\n const ast = parseRSLangExpression(expression);\n if (!ast) {\n return;\n }\n for (const call of extractFuncCalls(ast, expression)) {\n const template = this.templateByAlias.get(call.callee);\n if (!template) {\n continue;\n }\n const scopedArgs = call.args.map(arg => substituteLocalAliases(arg, scope));\n const bindings = bindingsFromCall(getTemplateParams(template), scopedArgs, scope);\n this.ensureDep(call.callee, bindings, referrer);\n }\n }\n}\n\n// ======= Internals ========\n\n/** Normalized formal definitions in the target schema and in the current plan. */\nclass FormalDefinitionIndex {\n private readonly byKey = new Map<string, string>();\n\n register(cst_type: CstType, definition_formal: string, alias: string): void {\n const normalized = normalizeExpression(definition_formal, cst_type);\n if (!normalized) {\n return;\n }\n this.byKey.set(formalDefinitionKey(cst_type, normalized), alias);\n }\n\n find(cst_type: CstType, definition_formal: string): string | null {\n const normalized = normalizeExpression(definition_formal, cst_type);\n if (!normalized) {\n return null;\n }\n return this.byKey.get(formalDefinitionKey(cst_type, normalized)) ?? null;\n }\n}\n\nfunction createFormalDefinitionIndex(schema: RSForm): FormalDefinitionIndex {\n const index = new FormalDefinitionIndex();\n for (const cst of schema.items) {\n index.register(cst.cst_type, cst.definition_formal, cst.alias);\n }\n return index;\n}\n\nfunction formalDefinitionKey(cst_type: CstType, normalized: string): string {\n return `${cst_type}\\0${normalized}`;\n}\n\nfunction instantiateTemplateItem(\n template: Constituenta,\n args: ArgumentValue[],\n alias: string\n): TemplateInstantiationItem {\n return {\n alias,\n cst_type: inferTemplatedType(template.cst_type, args),\n crucial: template.crucial,\n convention: template.convention,\n definition_formal: substituteTemplateArgs(template.definition_formal, argumentValuesToMapping(args)),\n definition_raw: template.definition_raw,\n term_raw: template.term_raw,\n term_forms: [...template.term_forms],\n typification_manual: template.typification_manual,\n value_is_property: template.value_is_property\n };\n}\n\nfunction bindingsFromCall(params: TemplateParam[], callArgs: string[], scope: AliasMapping): Map<string, string> {\n const bindings = new Map<string, string>();\n params.forEach((param, index) => {\n const value = resolveArgBinding(callArgs[index] ?? '', scope);\n if (value) {\n bindings.set(param.alias, value);\n }\n });\n return bindings;\n}\n\nfunction resolveArgBinding(argExpr: string, scope: AliasMapping): string | undefined {\n const scoped = substituteLocalAliases(argExpr, scope).trim();\n if (isGlobalAlias(scoped)) {\n return scoped;\n }\n return undefined;\n}\n\nfunction mergeBindings(existing: Map<string, string> | undefined, incoming: Map<string, string>): Map<string, string> {\n const result = new Map(existing);\n for (const [alias, value] of incoming) {\n if (!result.has(alias)) {\n result.set(alias, value);\n }\n }\n return result;\n}\n\nfunction bindingMapToArgs(params: TemplateParam[], bindings: Map<string, string>): ArgumentValue[] {\n return params.map(param => ({\n alias: param.alias,\n typification: param.typification,\n value: bindings.get(param.alias)\n }));\n}\n\nfunction getTemplateParams(template: Constituenta): TemplateParam[] {\n const effectiveType = template.effectiveType;\n if (effectiveType && (effectiveType.typeID === TypeID.function || effectiveType.typeID === TypeID.predicate)) {\n return effectiveType.args.map(arg => ({\n alias: arg.alias,\n typification: labelType(arg.type)\n }));\n }\n const { head } = splitTemplateDefinition(template.definition_formal);\n if (!head) {\n return [];\n }\n return head.split(',').map(part => {\n const trimmed = part.trim();\n const separator = trimmed.indexOf('∈');\n if (separator === -1) {\n return { alias: trimmed, typification: '' };\n }\n return {\n alias: trimmed.slice(0, separator).trim(),\n typification: trimmed.slice(separator + 1).trim()\n };\n });\n}\n\nfunction extractFuncCalls(ast: AstNode, expression: string): FuncCallRef[] {\n const result: FuncCallRef[] = [];\n visitAstDFS(ast, node => {\n if (node.typeID !== TokenID.NT_FUNC_CALL || node.children.length < 1) {\n return;\n }\n const calleeNode = node.children[0];\n if (\n calleeNode.typeID !== TokenID.ID_FUNCTION &&\n calleeNode.typeID !== TokenID.ID_PREDICATE &&\n calleeNode.typeID !== TokenID.ID_GLOBAL\n ) {\n return;\n }\n const callee = expression.slice(calleeNode.from, calleeNode.to);\n if (!/^[FP]\\d+$/.test(callee)) {\n return;\n }\n result.push({\n callee,\n args: node.children.slice(1).map(child => expression.slice(child.from, child.to).trim())\n });\n });\n return result;\n}\n\nfunction targetHasAlias(schema: RSForm, alias: string): boolean {\n return schema.items.some(cst => cst.alias === alias);\n}\n\nfunction topologicalSort(aliases: string[], refs: Map<string, Set<string>>): string[] {\n const remaining = new Set(aliases);\n const sorted: string[] = [];\n while (remaining.size > 0) {\n const ready = [...remaining].filter(alias => {\n const deps = refs.get(alias) ?? new Set<string>();\n return [...deps].every(dep => !remaining.has(dep));\n });\n if (ready.length === 0) {\n return [...remaining, ...sorted].reverse();\n }\n ready.sort();\n for (const alias of ready) {\n sorted.push(alias);\n remaining.delete(alias);\n }\n }\n return sorted;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAmGA,SAAgB,0BAA0B,OAA8D;CACtG,OAAO,IAAI,6BAA6B,KAAK,CAAC,CAAC,KAAK;AACtD;;;;;;AAOA,IAAa,+BAAb,MAA0C;CACxC;CACA;CACA;CACA;CACA;CACA;CACA,8BAA+B,IAAI,IAAiC;CACpE,0BAA2B,IAAI,IAAyB;;CAGxD,YAAY,OAAmC;EAC7C,KAAK,eAAe,MAAM;EAC1B,KAAK,YAAY,MAAM;EACvB,KAAK,WAAW,MAAM;EACtB,KAAK,mBAAmB,MAAM;EAC9B,KAAK,kBAAkB,IAAI,IACzB,MAAM,cAAc,QAAO,QAAO,aAAa,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAI,QAAO,CAAC,IAAI,OAAO,GAAG,CAAC,CAC3F;EACA,KAAK,cAAc,wBAAwB,MAAM,QAAQ;CAC3D;;CAGA,OAAkC;EAChC,MAAM,iBAAiB,uBAAuB,KAAK,UAAU,mBAAmB,KAAK,WAAW;EAChG,KAAK,oBAAoB,gBAAgB,KAAK,WAAW;EAEzD,MAAM,kBAAkB,4BAA4B,KAAK,YAAY;EACrE,MAAM,kBAAkB,KAAK,qBAAqB,eAAe;EACjE,MAAM,EAAE,MAAM,UAAU,gBAAgB,uBAAuB,KAAK,cAClE,gBACA,gBAAgB,cAChB,gBAAgB,cAChB,eACF;EAEA,OAAO;GACL,OAAO,WAAW,CAAC,GAAG,gBAAgB,OAAO,QAAQ,IAAI,gBAAgB;GACzE;EACF;CACF;CAEA,qBAA6B,iBAI3B;EACA,MAAM,oBAAoB,gBAAgB,CAAC,GAAG,KAAK,YAAY,KAAK,CAAC,GAAG,KAAK,OAAO;EACpF,MAAM,eAA6B,CAAC;EACpC,MAAM,eAAyB,CAAC;EAChC,MAAM,kBAAkB,CAAC,KAAK,iBAAiB,KAAK;EACpD,MAAM,QAAqC,CAAC;EAE5C,KAAK,MAAM,iBAAiB,mBAAmB;GAC7C,MAAM,WAAW,KAAK,gBAAgB,IAAI,aAAa;GACvD,MAAM,WAAW,KAAK,YAAY,IAAI,aAAa;GACnD,MAAM,OAAO,iBAAiB,kBAAkB,QAAQ,GAAG,QAAQ;GACnE,MAAM,WAAW,mBAAmB,SAAS,UAAU,IAAI;GAC3D,MAAM,aAAa,kBACjB,uBAAuB,SAAS,mBAAmB,wBAAwB,IAAI,CAAC,GAChF,YACF;GAEA,MAAM,gBAAgB,gBAAgB,KAAK,UAAU,UAAU;GAC/D,IAAI,eAAe;IACjB,aAAa,iBAAiB;IAC9B;GACF;GAEA,MAAM,QAAQ,cAAc,SAAS,UAAU,KAAK,cAAc,CAAC,GAAG,iBAAiB,GAAG,YAAY,CAAC;GACvG,aAAa,KAAK,KAAK;GACvB,aAAa,iBAAiB;GAE9B,MAAM,OAAO,wBAAwB,UAAU,MAAM,KAAK;GAC1D,KAAK,oBAAoB;GACzB,2BAA2B,CAAC,IAAI,GAAG,cAAc,KAAK;GACtD,gBAAgB,SAAS,UAAU,KAAK,mBAAmB,KAAK;GAChE,MAAM,KAAK,IAAI;EACjB;EAEA,OAAO;GAAE;GAAO;GAAc;EAAa;CAC7C;CAEA,cACE,gBACA,cACA,cACA,iBAC2E;EAC3E,MAAM,mBAAmB,kBAAkB,gBAAgB,YAAY;EACvE,MAAM,WAAW,mBAAmB,KAAK,UAAU,UAAU,KAAK,QAAQ;EAE1E,MAAM,iBAAiB,gBAAgB,KAAK,UAAU,gBAAgB;EACtE,IAAI,gBACF,OAAO;GAAE,MAAM;GAAM;EAAe;EAGtC,MAAM,WAAsC;GAC1C,GAAG,KAAK;GACR,mBAAmB;GACnB;EACF;EACA,2BAA2B,CAAC,QAAQ,GAAG,cAAc,KAAK;EAE1D,IAAI,aAAa,SAAS,SAAS,KAAK,GACtC,SAAS,QAAQ,cAAc,SAAS,UAAU,KAAK,cAAc,CACnE,GAAG,cACH,KAAK,iBAAiB,KACxB,CAAC;EAGH,OAAO;GAAE,MAAM;GAAU,gBAAgB;EAAK;CAChD;CAEA,UAAkB,eAAuB,UAA+B,UAAyB;EAC/F,IAAI,eAAe,KAAK,cAAc,aAAa,KAAK,CAAC,KAAK,gBAAgB,IAAI,aAAa,GAC7F;EAEF,IAAI,YAAY,KAAK,YAAY,IAAI,QAAQ,GAAG;GAC9C,MAAM,OAAO,KAAK,QAAQ,IAAI,QAAQ,qBAAK,IAAI,IAAY;GAC3D,KAAK,IAAI,aAAa;GACtB,KAAK,QAAQ,IAAI,UAAU,IAAI;EACjC;EACA,MAAM,SAAS,cAAc,KAAK,YAAY,IAAI,aAAa,GAAG,QAAQ;EAC1E,MAAM,UACJ,CAAC,KAAK,YAAY,IAAI,aAAa,KAAK,OAAO,UAAU,KAAK,YAAY,IAAI,aAAa,CAAC,EAAE,QAAQ;EACxG,KAAK,YAAY,IAAI,eAAe,MAAM;EAC1C,IAAI,CAAC,WAAW,UACd;EAEF,MAAM,WAAW,KAAK,gBAAgB,IAAI,aAAa;EACvD,MAAM,OAAO,iBAAiB,kBAAkB,QAAQ,GAAG,MAAM;EACjE,MAAM,aAAa,uBAAuB,SAAS,mBAAmB,wBAAwB,IAAI,CAAC;EACnG,KAAK,oBAAoB,YAAY,wBAAwB,IAAI,GAAG,aAAa;CACnF;CAEA,oBAA4B,YAAoB,OAAqB,UAAyB;EAC5F,MAAM,MAAM,sBAAsB,UAAU;EAC5C,IAAI,CAAC,KACH;EAEF,KAAK,MAAM,QAAQ,iBAAiB,KAAK,UAAU,GAAG;GACpD,MAAM,WAAW,KAAK,gBAAgB,IAAI,KAAK,MAAM;GACrD,IAAI,CAAC,UACH;GAEF,MAAM,aAAa,KAAK,KAAK,KAAI,QAAO,uBAAuB,KAAK,KAAK,CAAC;GAC1E,MAAM,WAAW,iBAAiB,kBAAkB,QAAQ,GAAG,YAAY,KAAK;GAChF,KAAK,UAAU,KAAK,QAAQ,UAAU,QAAQ;EAChD;CACF;AACF;;AAKA,IAAM,wBAAN,MAA4B;CAC1B,wBAAyB,IAAI,IAAoB;CAEjD,SAAS,UAAmB,mBAA2B,OAAqB;EAC1E,MAAM,aAAa,oBAAoB,mBAAmB,QAAQ;EAClE,IAAI,CAAC,YACH;EAEF,KAAK,MAAM,IAAI,oBAAoB,UAAU,UAAU,GAAG,KAAK;CACjE;CAEA,KAAK,UAAmB,mBAA0C;EAChE,MAAM,aAAa,oBAAoB,mBAAmB,QAAQ;EAClE,IAAI,CAAC,YACH,OAAO;EAET,OAAO,KAAK,MAAM,IAAI,oBAAoB,UAAU,UAAU,CAAC,KAAK;CACtE;AACF;AAEA,SAAS,4BAA4B,QAAuC;CAC1E,MAAM,QAAQ,IAAI,sBAAsB;CACxC,KAAK,MAAM,OAAO,OAAO,OACvB,MAAM,SAAS,IAAI,UAAU,IAAI,mBAAmB,IAAI,KAAK;CAE/D,OAAO;AACT;AAEA,SAAS,oBAAoB,UAAmB,YAA4B;CAC1E,OAAO,GAAG,SAAS,IAAI;AACzB;AAEA,SAAS,wBACP,UACA,MACA,OAC2B;CAC3B,OAAO;EACL;EACA,UAAU,mBAAmB,SAAS,UAAU,IAAI;EACpD,SAAS,SAAS;EAClB,YAAY,SAAS;EACrB,mBAAmB,uBAAuB,SAAS,mBAAmB,wBAAwB,IAAI,CAAC;EACnG,gBAAgB,SAAS;EACzB,UAAU,SAAS;EACnB,YAAY,CAAC,GAAG,SAAS,UAAU;EACnC,qBAAqB,SAAS;EAC9B,mBAAmB,SAAS;CAC9B;AACF;AAEA,SAAS,iBAAiB,QAAyB,UAAoB,OAA0C;CAC/G,MAAM,2BAAW,IAAI,IAAoB;CACzC,OAAO,SAAS,OAAO,UAAU;EAC/B,MAAM,QAAQ,kBAAkB,SAAS,UAAU,IAAI,KAAK;EAC5D,IAAI,OACF,SAAS,IAAI,MAAM,OAAO,KAAK;CAEnC,CAAC;CACD,OAAO;AACT;AAEA,SAAS,kBAAkB,SAAiB,OAAyC;CACnF,MAAM,SAAS,uBAAuB,SAAS,KAAK,CAAC,CAAC,KAAK;CAC3D,IAAI,cAAc,MAAM,GACtB,OAAO;AAGX;AAEA,SAAS,cAAc,UAA2C,UAAoD;CACpH,MAAM,SAAS,IAAI,IAAI,QAAQ;CAC/B,KAAK,MAAM,CAAC,OAAO,UAAU,UAC3B,IAAI,CAAC,OAAO,IAAI,KAAK,GACnB,OAAO,IAAI,OAAO,KAAK;CAG3B,OAAO;AACT;AAEA,SAAS,iBAAiB,QAAyB,UAAgD;CACjG,OAAO,OAAO,KAAI,WAAU;EAC1B,OAAO,MAAM;EACb,cAAc,MAAM;EACpB,OAAO,SAAS,IAAI,MAAM,KAAK;CACjC,EAAE;AACJ;AAEA,SAAS,kBAAkB,UAAyC;CAClE,MAAM,gBAAgB,SAAS;CAC/B,IAAI,kBAAkB,cAAc,WAAW,OAAO,YAAY,cAAc,WAAW,OAAO,YAChG,OAAO,cAAc,KAAK,KAAI,SAAQ;EACpC,OAAO,IAAI;EACX,cAAc,UAAU,IAAI,IAAI;CAClC,EAAE;CAEJ,MAAM,EAAE,SAAS,wBAAwB,SAAS,iBAAiB;CACnE,IAAI,CAAC,MACH,OAAO,CAAC;CAEV,OAAO,KAAK,MAAM,GAAG,CAAC,CAAC,KAAI,SAAQ;EACjC,MAAM,UAAU,KAAK,KAAK;EAC1B,MAAM,YAAY,QAAQ,QAAQ,GAAG;EACrC,IAAI,cAAc,IAChB,OAAO;GAAE,OAAO;GAAS,cAAc;EAAG;EAE5C,OAAO;GACL,OAAO,QAAQ,MAAM,GAAG,SAAS,CAAC,CAAC,KAAK;GACxC,cAAc,QAAQ,MAAM,YAAY,CAAC,CAAC,CAAC,KAAK;EAClD;CACF,CAAC;AACH;AAEA,SAAS,iBAAiB,KAAc,YAAmC;CACzE,MAAM,SAAwB,CAAC;CAC/B,YAAY,MAAK,SAAQ;EACvB,IAAI,KAAK,WAAW,QAAQ,gBAAgB,KAAK,SAAS,SAAS,GACjE;EAEF,MAAM,aAAa,KAAK,SAAS;EACjC,IACE,WAAW,WAAW,QAAQ,eAC9B,WAAW,WAAW,QAAQ,gBAC9B,WAAW,WAAW,QAAQ,WAE9B;EAEF,MAAM,SAAS,WAAW,MAAM,WAAW,MAAM,WAAW,EAAE;EAC9D,IAAI,CAAC,YAAY,KAAK,MAAM,GAC1B;EAEF,OAAO,KAAK;GACV;GACA,MAAM,KAAK,SAAS,MAAM,CAAC,CAAC,CAAC,KAAI,UAAS,WAAW,MAAM,MAAM,MAAM,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC;EACzF,CAAC;CACH,CAAC;CACD,OAAO;AACT;AAEA,SAAS,eAAe,QAAgB,OAAwB;CAC9D,OAAO,OAAO,MAAM,MAAK,QAAO,IAAI,UAAU,KAAK;AACrD;AAEA,SAAS,gBAAgB,SAAmB,MAA0C;CACpF,MAAM,YAAY,IAAI,IAAI,OAAO;CACjC,MAAM,SAAmB,CAAC;CAC1B,OAAO,UAAU,OAAO,GAAG;EACzB,MAAM,QAAQ,CAAC,GAAG,SAAS,CAAC,CAAC,QAAO,UAAS;GAE3C,OAAO,CAAC,GADK,KAAK,IAAI,KAAK,qBAAK,IAAI,IAAY,CACjC,CAAC,CAAC,OAAM,QAAO,CAAC,UAAU,IAAI,GAAG,CAAC;EACnD,CAAC;EACD,IAAI,MAAM,WAAW,GACnB,OAAO,CAAC,GAAG,WAAW,GAAG,MAAM,CAAC,CAAC,QAAQ;EAE3C,MAAM,KAAK;EACX,KAAK,MAAM,SAAS,OAAO;GACzB,OAAO,KAAK,KAAK;GACjB,UAAU,OAAO,KAAK;EACxB;CACF;CACA,OAAO;AACT"}
1
+ {"version":3,"file":"index.js","names":[],"sources":["../../src/library/template-instantiation.ts"],"sourcesContent":["/**\n * Module: template instantiation from the expression bank into a target {@link RSForm}.\n */\n\nimport { type AstNode, visitAstDFS } from '../parsing';\nimport {\n type AliasMapping,\n applyAliasMapping,\n isGlobalAlias,\n parseRSLangExpression,\n splitTemplateDefinition,\n substituteLocalAliases,\n substituteTemplateArgs\n} from '../rslang/api';\nimport { labelType } from '../rslang/labels';\nimport { TokenID } from '../rslang/parser/token';\nimport { TypeID } from '../rslang/semantic/typification';\n\nimport { type ArgumentValue, type Constituenta, type CstType, type RSForm } from './rsform';\nimport {\n applyMappingToConstituents,\n argumentValuesToMapping,\n generateAlias,\n inferTemplatedType,\n isFunctional,\n normalizeExpression\n} from './rsform-api';\n\n/**\n * Payload for one {@link Constituenta} to create when instantiating an expression-bank template.\n *\n * Aliases are generated for the target schema. Formal definitions and typifications already\n * reflect user argument substitution and remapping of bank aliases to those new aliases.\n */\nexport interface TemplateInstantiationItem {\n /** Alias to assign in the target schema. */\n alias: string;\n /** Inferred type after argument substitution (function/predicate may become term/axiom). */\n cst_type: CstType;\n crucial: boolean;\n convention: string;\n definition_formal: string;\n definition_raw: string;\n term_raw: string;\n term_forms: Constituenta['term_forms'];\n typification_manual: string;\n value_is_property: boolean;\n}\n\n/** Conflicting argument bindings inferred for the same template dependency. */\nexport interface TemplateBindingConflict {\n templateAlias: string;\n paramAlias: string;\n existing: string;\n incoming: string;\n}\n\n/**\n * Batch create plan: dependencies first, selected template constituent last.\n *\n * Reuses constituents whose substituted formal definition already exists in the target schema\n * (normalized comparison), even when the bank alias differs from the matched target alias.\n * {@link TemplateInstantiationPlan.mainDuplicateAlias} reports when the selected template is a duplicate.\n * Does not set `insert_after`; the caller supplies insertion on the batch DTO.\n */\nexport interface TemplateInstantiationPlan {\n items: TemplateInstantiationItem[];\n /** Set when the selected template expression already exists in the target schema. */\n mainDuplicateAlias: string | null;\n /** Set when nested template calls bind the same parameter to different global aliases. */\n bindingConflict: TemplateBindingConflict | null;\n}\n\n/**\n * Input for planning template instantiation into a conceptual schema.\n */\nexport interface TemplateInstantiationInput {\n /** Schema that will receive new constituents. */\n targetSchema: RSForm;\n /** All constituents of the selected expression-bank RSForm (not only the prototype). */\n templateItems: Constituenta[];\n /** Template constituent chosen in the UI (main expression to add). */\n prototype: Constituenta;\n /** User bindings from template parameter aliases to target-schema global aliases. */\n userArgs: ArgumentValue[];\n /**\n * Main constituent attributes from the create dialog (alias, labels, flags).\n * `definition_formal` and `cst_type` may be overridden from `prototype` and `userArgs`.\n */\n mainItem: TemplateInstantiationItem;\n}\n\ninterface FuncCallRef {\n callee: string;\n args: string[];\n}\n\ninterface TemplateParam {\n alias: string;\n typification: string;\n}\n\n/**\n * Build a batch create plan for a template expression and its bank dependencies.\n *\n * Walks nested `F#` / `P#` calls in the substituted expression, collects missing term-functions\n * and predicate-functions from `templateItems`, propagates argument bindings into nested calls,\n * topologically orders dependencies, and remaps bank aliases to freshly generated target aliases.\n */\nexport function planTemplateInstantiation(input: TemplateInstantiationInput): TemplateInstantiationPlan {\n return new TemplateInstantiationPlanner(input).plan();\n}\n\n/**\n * Stateful planner for {@link planTemplateInstantiation}.\n *\n * Prefer the function wrapper unless you need to hold or reuse planner state between calls.\n */\nexport class TemplateInstantiationPlanner {\n private readonly targetSchema: RSForm;\n private readonly prototype: Constituenta;\n private readonly userArgs: ArgumentValue[];\n private readonly mainItemTemplate: TemplateInstantiationItem;\n private readonly templateByAlias: Map<string, Constituenta>;\n private readonly userMapping: AliasMapping;\n private readonly depBindings = new Map<string, Map<string, string>>();\n private readonly depRefs = new Map<string, Set<string>>();\n private bindingConflict: TemplateBindingConflict | null = null;\n\n /** @param input - See {@link TemplateInstantiationInput}. */\n constructor(input: TemplateInstantiationInput) {\n this.targetSchema = input.targetSchema;\n this.prototype = input.prototype;\n this.userArgs = input.userArgs;\n this.mainItemTemplate = input.mainItem;\n this.templateByAlias = new Map(\n input.templateItems.filter(cst => isFunctional(cst.cst_type)).map(cst => [cst.alias, cst])\n );\n this.userMapping = argumentValuesToMapping(input.userArgs);\n }\n\n /** @returns Dependency items in topological order, then the main template item when it is not a duplicate. */\n plan(): TemplateInstantiationPlan {\n const mainDefinition = substituteTemplateArgs(this.prototype.definition_formal, this.userMapping);\n this.collectDependencies(mainDefinition, this.userMapping);\n\n if (this.bindingConflict) {\n return { items: [], mainDuplicateAlias: null, bindingConflict: this.bindingConflict };\n }\n\n const definitionIndex = createFormalDefinitionIndex(this.targetSchema);\n const dependencyItems = this.buildDependencyItems(definitionIndex);\n const { item: mainItem, duplicateAlias: mainDuplicateAlias } = this.buildMainItem(\n mainDefinition,\n dependencyItems.takenAliases,\n dependencyItems.aliasMapping,\n definitionIndex\n );\n\n return {\n items: mainItem ? [...dependencyItems.items, mainItem] : dependencyItems.items,\n mainDuplicateAlias,\n bindingConflict: null\n };\n }\n\n private buildDependencyItems(definitionIndex: FormalDefinitionIndex): {\n items: TemplateInstantiationItem[];\n aliasMapping: AliasMapping;\n takenAliases: string[];\n } {\n const dependencyAliases = topologicalSort([...this.depBindings.keys()], this.depRefs);\n const aliasMapping: AliasMapping = {};\n const takenAliases: string[] = [];\n const reservedAliases = [this.mainItemTemplate.alias];\n const items: TemplateInstantiationItem[] = [];\n\n for (const templateAlias of dependencyAliases) {\n const template = this.templateByAlias.get(templateAlias)!;\n const bindings = this.depBindings.get(templateAlias)!;\n const args = bindingMapToArgs(getTemplateParams(template), bindings);\n const cst_type = inferTemplatedType(template.cst_type, args);\n const definition = applyAliasMapping(\n substituteTemplateArgs(template.definition_formal, argumentValuesToMapping(args)),\n aliasMapping\n );\n\n const existingAlias = definitionIndex.find(cst_type, definition);\n if (existingAlias) {\n aliasMapping[templateAlias] = existingAlias;\n continue;\n }\n\n const alias = generateAlias(template.cst_type, this.targetSchema, [...reservedAliases, ...takenAliases]);\n takenAliases.push(alias);\n aliasMapping[templateAlias] = alias;\n\n const item = instantiateTemplateItem(template, args, alias);\n item.definition_formal = definition;\n applyMappingToConstituents([item], aliasMapping, false);\n definitionIndex.register(cst_type, item.definition_formal, alias);\n items.push(item);\n }\n\n return { items, aliasMapping, takenAliases };\n }\n\n private buildMainItem(\n mainDefinition: string,\n takenAliases: string[],\n aliasMapping: AliasMapping,\n definitionIndex: FormalDefinitionIndex\n ): { item: TemplateInstantiationItem | null; duplicateAlias: string | null } {\n const mappedDefinition = applyAliasMapping(mainDefinition, aliasMapping);\n const cst_type = inferTemplatedType(this.prototype.cst_type, this.userArgs);\n\n const duplicateAlias = definitionIndex.find(cst_type, mappedDefinition);\n if (duplicateAlias) {\n return { item: null, duplicateAlias };\n }\n\n const mainItem: TemplateInstantiationItem = {\n ...this.mainItemTemplate,\n definition_formal: mappedDefinition,\n cst_type\n };\n applyMappingToConstituents([mainItem], aliasMapping, false);\n\n if (takenAliases.includes(mainItem.alias)) {\n mainItem.alias = generateAlias(mainItem.cst_type, this.targetSchema, [\n ...takenAliases,\n this.mainItemTemplate.alias\n ]);\n }\n\n return { item: mainItem, duplicateAlias: null };\n }\n\n private ensureDep(templateAlias: string, bindings: Map<string, string>, referrer?: string): void {\n if (this.bindingConflict) {\n return;\n }\n if (!this.templateByAlias.has(templateAlias)) {\n return;\n }\n if (referrer && this.depBindings.has(referrer)) {\n const refs = this.depRefs.get(referrer) ?? new Set<string>();\n refs.add(templateAlias);\n this.depRefs.set(referrer, refs);\n }\n const mergeResult = mergeBindings(this.depBindings.get(templateAlias), bindings);\n if (!mergeResult.ok) {\n this.bindingConflict = { templateAlias, ...mergeResult.conflict };\n return;\n }\n const merged = mergeResult.bindings;\n const changed =\n !this.depBindings.has(templateAlias) || merged.size !== (this.depBindings.get(templateAlias)?.size ?? 0);\n this.depBindings.set(templateAlias, merged);\n if (!changed && referrer) {\n return;\n }\n const template = this.templateByAlias.get(templateAlias)!;\n const args = bindingMapToArgs(getTemplateParams(template), merged);\n const definition = substituteTemplateArgs(template.definition_formal, argumentValuesToMapping(args));\n this.collectDependencies(definition, argumentValuesToMapping(args), templateAlias);\n }\n\n private collectDependencies(expression: string, scope: AliasMapping, referrer?: string): void {\n if (this.bindingConflict) {\n return;\n }\n const ast = parseRSLangExpression(expression);\n if (!ast) {\n return;\n }\n for (const call of extractFuncCalls(ast, expression)) {\n const template = this.templateByAlias.get(call.callee);\n if (!template) {\n continue;\n }\n const scopedArgs = call.args.map(arg => substituteLocalAliases(arg, scope));\n const bindings = bindingsFromCall(getTemplateParams(template), scopedArgs, scope);\n this.ensureDep(call.callee, bindings, referrer);\n }\n }\n}\n\n// ======= Internals ========\n\n/** Normalized formal definitions in the target schema and in the current plan. */\nclass FormalDefinitionIndex {\n private readonly byKey = new Map<string, string>();\n\n register(cst_type: CstType, definition_formal: string, alias: string): void {\n const normalized = normalizeExpression(definition_formal, cst_type);\n if (!normalized) {\n return;\n }\n this.byKey.set(formalDefinitionKey(cst_type, normalized), alias);\n }\n\n find(cst_type: CstType, definition_formal: string): string | null {\n const normalized = normalizeExpression(definition_formal, cst_type);\n if (!normalized) {\n return null;\n }\n return this.byKey.get(formalDefinitionKey(cst_type, normalized)) ?? null;\n }\n}\n\nfunction createFormalDefinitionIndex(schema: RSForm): FormalDefinitionIndex {\n const index = new FormalDefinitionIndex();\n for (const cst of schema.items) {\n index.register(cst.cst_type, cst.definition_formal, cst.alias);\n }\n return index;\n}\n\nfunction formalDefinitionKey(cst_type: CstType, normalized: string): string {\n return `${cst_type}\\0${normalized}`;\n}\n\nfunction instantiateTemplateItem(\n template: Constituenta,\n args: ArgumentValue[],\n alias: string\n): TemplateInstantiationItem {\n return {\n alias,\n cst_type: inferTemplatedType(template.cst_type, args),\n crucial: template.crucial,\n convention: template.convention,\n definition_formal: substituteTemplateArgs(template.definition_formal, argumentValuesToMapping(args)),\n definition_raw: template.definition_raw,\n term_raw: template.term_raw,\n term_forms: [...template.term_forms],\n typification_manual: template.typification_manual,\n value_is_property: template.value_is_property\n };\n}\n\nfunction bindingsFromCall(params: TemplateParam[], callArgs: string[], scope: AliasMapping): Map<string, string> {\n const bindings = new Map<string, string>();\n params.forEach((param, index) => {\n const value = resolveArgBinding(callArgs[index] ?? '', scope);\n if (value) {\n bindings.set(param.alias, value);\n }\n });\n return bindings;\n}\n\nfunction resolveArgBinding(argExpr: string, scope: AliasMapping): string | undefined {\n const scoped = substituteLocalAliases(argExpr, scope).trim();\n if (isGlobalAlias(scoped)) {\n return scoped;\n }\n return undefined;\n}\n\ntype MergeBindingsResult =\n | { ok: true; bindings: Map<string, string> }\n | { ok: false; conflict: { paramAlias: string; existing: string; incoming: string } };\n\nfunction mergeBindings(existing: Map<string, string> | undefined, incoming: Map<string, string>): MergeBindingsResult {\n const result = new Map(existing);\n for (const [alias, value] of incoming) {\n const existingValue = result.get(alias);\n if (existingValue === undefined) {\n result.set(alias, value);\n } else if (existingValue !== value) {\n return { ok: false, conflict: { paramAlias: alias, existing: existingValue, incoming: value } };\n }\n }\n return { ok: true, bindings: result };\n}\n\nfunction bindingMapToArgs(params: TemplateParam[], bindings: Map<string, string>): ArgumentValue[] {\n return params.map(param => ({\n alias: param.alias,\n typification: param.typification,\n value: bindings.get(param.alias)\n }));\n}\n\nfunction getTemplateParams(template: Constituenta): TemplateParam[] {\n const effectiveType = template.effectiveType;\n if (effectiveType && (effectiveType.typeID === TypeID.function || effectiveType.typeID === TypeID.predicate)) {\n return effectiveType.args.map(arg => ({\n alias: arg.alias,\n typification: labelType(arg.type)\n }));\n }\n const { head } = splitTemplateDefinition(template.definition_formal);\n if (!head) {\n return [];\n }\n return head.split(',').map(part => {\n const trimmed = part.trim();\n const separator = trimmed.indexOf('∈');\n if (separator === -1) {\n return { alias: trimmed, typification: '' };\n }\n return {\n alias: trimmed.slice(0, separator).trim(),\n typification: trimmed.slice(separator + 1).trim()\n };\n });\n}\n\nfunction extractFuncCalls(ast: AstNode, expression: string): FuncCallRef[] {\n const result: FuncCallRef[] = [];\n visitAstDFS(ast, node => {\n if (node.typeID !== TokenID.NT_FUNC_CALL || node.children.length < 1) {\n return;\n }\n const calleeNode = node.children[0];\n if (\n calleeNode.typeID !== TokenID.ID_FUNCTION &&\n calleeNode.typeID !== TokenID.ID_PREDICATE &&\n calleeNode.typeID !== TokenID.ID_GLOBAL\n ) {\n return;\n }\n const callee = expression.slice(calleeNode.from, calleeNode.to);\n if (!/^[FP]\\d+$/.test(callee)) {\n return;\n }\n result.push({\n callee,\n args: node.children.slice(1).map(child => expression.slice(child.from, child.to).trim())\n });\n });\n return result;\n}\n\nfunction topologicalSort(aliases: string[], refs: Map<string, Set<string>>): string[] {\n const remaining = new Set(aliases);\n const sorted: string[] = [];\n while (remaining.size > 0) {\n const ready = [...remaining].filter(alias => {\n const deps = refs.get(alias) ?? new Set<string>();\n return [...deps].every(dep => !remaining.has(dep));\n });\n if (ready.length === 0) {\n return [...remaining, ...sorted].reverse();\n }\n ready.sort();\n for (const alias of ready) {\n sorted.push(alias);\n remaining.delete(alias);\n }\n }\n return sorted;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AA6GA,SAAgB,0BAA0B,OAA8D;CACtG,OAAO,IAAI,6BAA6B,KAAK,CAAC,CAAC,KAAK;AACtD;;;;;;AAOA,IAAa,+BAAb,MAA0C;CACxC;CACA;CACA;CACA;CACA;CACA;CACA,8BAA+B,IAAI,IAAiC;CACpE,0BAA2B,IAAI,IAAyB;CACxD,kBAA0D;;CAG1D,YAAY,OAAmC;EAC7C,KAAK,eAAe,MAAM;EAC1B,KAAK,YAAY,MAAM;EACvB,KAAK,WAAW,MAAM;EACtB,KAAK,mBAAmB,MAAM;EAC9B,KAAK,kBAAkB,IAAI,IACzB,MAAM,cAAc,QAAO,QAAO,aAAa,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAI,QAAO,CAAC,IAAI,OAAO,GAAG,CAAC,CAC3F;EACA,KAAK,cAAc,wBAAwB,MAAM,QAAQ;CAC3D;;CAGA,OAAkC;EAChC,MAAM,iBAAiB,uBAAuB,KAAK,UAAU,mBAAmB,KAAK,WAAW;EAChG,KAAK,oBAAoB,gBAAgB,KAAK,WAAW;EAEzD,IAAI,KAAK,iBACP,OAAO;GAAE,OAAO,CAAC;GAAG,oBAAoB;GAAM,iBAAiB,KAAK;EAAgB;EAGtF,MAAM,kBAAkB,4BAA4B,KAAK,YAAY;EACrE,MAAM,kBAAkB,KAAK,qBAAqB,eAAe;EACjE,MAAM,EAAE,MAAM,UAAU,gBAAgB,uBAAuB,KAAK,cAClE,gBACA,gBAAgB,cAChB,gBAAgB,cAChB,eACF;EAEA,OAAO;GACL,OAAO,WAAW,CAAC,GAAG,gBAAgB,OAAO,QAAQ,IAAI,gBAAgB;GACzE;GACA,iBAAiB;EACnB;CACF;CAEA,qBAA6B,iBAI3B;EACA,MAAM,oBAAoB,gBAAgB,CAAC,GAAG,KAAK,YAAY,KAAK,CAAC,GAAG,KAAK,OAAO;EACpF,MAAM,eAA6B,CAAC;EACpC,MAAM,eAAyB,CAAC;EAChC,MAAM,kBAAkB,CAAC,KAAK,iBAAiB,KAAK;EACpD,MAAM,QAAqC,CAAC;EAE5C,KAAK,MAAM,iBAAiB,mBAAmB;GAC7C,MAAM,WAAW,KAAK,gBAAgB,IAAI,aAAa;GACvD,MAAM,WAAW,KAAK,YAAY,IAAI,aAAa;GACnD,MAAM,OAAO,iBAAiB,kBAAkB,QAAQ,GAAG,QAAQ;GACnE,MAAM,WAAW,mBAAmB,SAAS,UAAU,IAAI;GAC3D,MAAM,aAAa,kBACjB,uBAAuB,SAAS,mBAAmB,wBAAwB,IAAI,CAAC,GAChF,YACF;GAEA,MAAM,gBAAgB,gBAAgB,KAAK,UAAU,UAAU;GAC/D,IAAI,eAAe;IACjB,aAAa,iBAAiB;IAC9B;GACF;GAEA,MAAM,QAAQ,cAAc,SAAS,UAAU,KAAK,cAAc,CAAC,GAAG,iBAAiB,GAAG,YAAY,CAAC;GACvG,aAAa,KAAK,KAAK;GACvB,aAAa,iBAAiB;GAE9B,MAAM,OAAO,wBAAwB,UAAU,MAAM,KAAK;GAC1D,KAAK,oBAAoB;GACzB,2BAA2B,CAAC,IAAI,GAAG,cAAc,KAAK;GACtD,gBAAgB,SAAS,UAAU,KAAK,mBAAmB,KAAK;GAChE,MAAM,KAAK,IAAI;EACjB;EAEA,OAAO;GAAE;GAAO;GAAc;EAAa;CAC7C;CAEA,cACE,gBACA,cACA,cACA,iBAC2E;EAC3E,MAAM,mBAAmB,kBAAkB,gBAAgB,YAAY;EACvE,MAAM,WAAW,mBAAmB,KAAK,UAAU,UAAU,KAAK,QAAQ;EAE1E,MAAM,iBAAiB,gBAAgB,KAAK,UAAU,gBAAgB;EACtE,IAAI,gBACF,OAAO;GAAE,MAAM;GAAM;EAAe;EAGtC,MAAM,WAAsC;GAC1C,GAAG,KAAK;GACR,mBAAmB;GACnB;EACF;EACA,2BAA2B,CAAC,QAAQ,GAAG,cAAc,KAAK;EAE1D,IAAI,aAAa,SAAS,SAAS,KAAK,GACtC,SAAS,QAAQ,cAAc,SAAS,UAAU,KAAK,cAAc,CACnE,GAAG,cACH,KAAK,iBAAiB,KACxB,CAAC;EAGH,OAAO;GAAE,MAAM;GAAU,gBAAgB;EAAK;CAChD;CAEA,UAAkB,eAAuB,UAA+B,UAAyB;EAC/F,IAAI,KAAK,iBACP;EAEF,IAAI,CAAC,KAAK,gBAAgB,IAAI,aAAa,GACzC;EAEF,IAAI,YAAY,KAAK,YAAY,IAAI,QAAQ,GAAG;GAC9C,MAAM,OAAO,KAAK,QAAQ,IAAI,QAAQ,qBAAK,IAAI,IAAY;GAC3D,KAAK,IAAI,aAAa;GACtB,KAAK,QAAQ,IAAI,UAAU,IAAI;EACjC;EACA,MAAM,cAAc,cAAc,KAAK,YAAY,IAAI,aAAa,GAAG,QAAQ;EAC/E,IAAI,CAAC,YAAY,IAAI;GACnB,KAAK,kBAAkB;IAAE;IAAe,GAAG,YAAY;GAAS;GAChE;EACF;EACA,MAAM,SAAS,YAAY;EAC3B,MAAM,UACJ,CAAC,KAAK,YAAY,IAAI,aAAa,KAAK,OAAO,UAAU,KAAK,YAAY,IAAI,aAAa,CAAC,EAAE,QAAQ;EACxG,KAAK,YAAY,IAAI,eAAe,MAAM;EAC1C,IAAI,CAAC,WAAW,UACd;EAEF,MAAM,WAAW,KAAK,gBAAgB,IAAI,aAAa;EACvD,MAAM,OAAO,iBAAiB,kBAAkB,QAAQ,GAAG,MAAM;EACjE,MAAM,aAAa,uBAAuB,SAAS,mBAAmB,wBAAwB,IAAI,CAAC;EACnG,KAAK,oBAAoB,YAAY,wBAAwB,IAAI,GAAG,aAAa;CACnF;CAEA,oBAA4B,YAAoB,OAAqB,UAAyB;EAC5F,IAAI,KAAK,iBACP;EAEF,MAAM,MAAM,sBAAsB,UAAU;EAC5C,IAAI,CAAC,KACH;EAEF,KAAK,MAAM,QAAQ,iBAAiB,KAAK,UAAU,GAAG;GACpD,MAAM,WAAW,KAAK,gBAAgB,IAAI,KAAK,MAAM;GACrD,IAAI,CAAC,UACH;GAEF,MAAM,aAAa,KAAK,KAAK,KAAI,QAAO,uBAAuB,KAAK,KAAK,CAAC;GAC1E,MAAM,WAAW,iBAAiB,kBAAkB,QAAQ,GAAG,YAAY,KAAK;GAChF,KAAK,UAAU,KAAK,QAAQ,UAAU,QAAQ;EAChD;CACF;AACF;;AAKA,IAAM,wBAAN,MAA4B;CAC1B,wBAAyB,IAAI,IAAoB;CAEjD,SAAS,UAAmB,mBAA2B,OAAqB;EAC1E,MAAM,aAAa,oBAAoB,mBAAmB,QAAQ;EAClE,IAAI,CAAC,YACH;EAEF,KAAK,MAAM,IAAI,oBAAoB,UAAU,UAAU,GAAG,KAAK;CACjE;CAEA,KAAK,UAAmB,mBAA0C;EAChE,MAAM,aAAa,oBAAoB,mBAAmB,QAAQ;EAClE,IAAI,CAAC,YACH,OAAO;EAET,OAAO,KAAK,MAAM,IAAI,oBAAoB,UAAU,UAAU,CAAC,KAAK;CACtE;AACF;AAEA,SAAS,4BAA4B,QAAuC;CAC1E,MAAM,QAAQ,IAAI,sBAAsB;CACxC,KAAK,MAAM,OAAO,OAAO,OACvB,MAAM,SAAS,IAAI,UAAU,IAAI,mBAAmB,IAAI,KAAK;CAE/D,OAAO;AACT;AAEA,SAAS,oBAAoB,UAAmB,YAA4B;CAC1E,OAAO,GAAG,SAAS,IAAI;AACzB;AAEA,SAAS,wBACP,UACA,MACA,OAC2B;CAC3B,OAAO;EACL;EACA,UAAU,mBAAmB,SAAS,UAAU,IAAI;EACpD,SAAS,SAAS;EAClB,YAAY,SAAS;EACrB,mBAAmB,uBAAuB,SAAS,mBAAmB,wBAAwB,IAAI,CAAC;EACnG,gBAAgB,SAAS;EACzB,UAAU,SAAS;EACnB,YAAY,CAAC,GAAG,SAAS,UAAU;EACnC,qBAAqB,SAAS;EAC9B,mBAAmB,SAAS;CAC9B;AACF;AAEA,SAAS,iBAAiB,QAAyB,UAAoB,OAA0C;CAC/G,MAAM,2BAAW,IAAI,IAAoB;CACzC,OAAO,SAAS,OAAO,UAAU;EAC/B,MAAM,QAAQ,kBAAkB,SAAS,UAAU,IAAI,KAAK;EAC5D,IAAI,OACF,SAAS,IAAI,MAAM,OAAO,KAAK;CAEnC,CAAC;CACD,OAAO;AACT;AAEA,SAAS,kBAAkB,SAAiB,OAAyC;CACnF,MAAM,SAAS,uBAAuB,SAAS,KAAK,CAAC,CAAC,KAAK;CAC3D,IAAI,cAAc,MAAM,GACtB,OAAO;AAGX;AAMA,SAAS,cAAc,UAA2C,UAAoD;CACpH,MAAM,SAAS,IAAI,IAAI,QAAQ;CAC/B,KAAK,MAAM,CAAC,OAAO,UAAU,UAAU;EACrC,MAAM,gBAAgB,OAAO,IAAI,KAAK;EACtC,IAAI,kBAAkB,QACpB,OAAO,IAAI,OAAO,KAAK;OAClB,IAAI,kBAAkB,OAC3B,OAAO;GAAE,IAAI;GAAO,UAAU;IAAE,YAAY;IAAO,UAAU;IAAe,UAAU;GAAM;EAAE;CAElG;CACA,OAAO;EAAE,IAAI;EAAM,UAAU;CAAO;AACtC;AAEA,SAAS,iBAAiB,QAAyB,UAAgD;CACjG,OAAO,OAAO,KAAI,WAAU;EAC1B,OAAO,MAAM;EACb,cAAc,MAAM;EACpB,OAAO,SAAS,IAAI,MAAM,KAAK;CACjC,EAAE;AACJ;AAEA,SAAS,kBAAkB,UAAyC;CAClE,MAAM,gBAAgB,SAAS;CAC/B,IAAI,kBAAkB,cAAc,WAAW,OAAO,YAAY,cAAc,WAAW,OAAO,YAChG,OAAO,cAAc,KAAK,KAAI,SAAQ;EACpC,OAAO,IAAI;EACX,cAAc,UAAU,IAAI,IAAI;CAClC,EAAE;CAEJ,MAAM,EAAE,SAAS,wBAAwB,SAAS,iBAAiB;CACnE,IAAI,CAAC,MACH,OAAO,CAAC;CAEV,OAAO,KAAK,MAAM,GAAG,CAAC,CAAC,KAAI,SAAQ;EACjC,MAAM,UAAU,KAAK,KAAK;EAC1B,MAAM,YAAY,QAAQ,QAAQ,GAAG;EACrC,IAAI,cAAc,IAChB,OAAO;GAAE,OAAO;GAAS,cAAc;EAAG;EAE5C,OAAO;GACL,OAAO,QAAQ,MAAM,GAAG,SAAS,CAAC,CAAC,KAAK;GACxC,cAAc,QAAQ,MAAM,YAAY,CAAC,CAAC,CAAC,KAAK;EAClD;CACF,CAAC;AACH;AAEA,SAAS,iBAAiB,KAAc,YAAmC;CACzE,MAAM,SAAwB,CAAC;CAC/B,YAAY,MAAK,SAAQ;EACvB,IAAI,KAAK,WAAW,QAAQ,gBAAgB,KAAK,SAAS,SAAS,GACjE;EAEF,MAAM,aAAa,KAAK,SAAS;EACjC,IACE,WAAW,WAAW,QAAQ,eAC9B,WAAW,WAAW,QAAQ,gBAC9B,WAAW,WAAW,QAAQ,WAE9B;EAEF,MAAM,SAAS,WAAW,MAAM,WAAW,MAAM,WAAW,EAAE;EAC9D,IAAI,CAAC,YAAY,KAAK,MAAM,GAC1B;EAEF,OAAO,KAAK;GACV;GACA,MAAM,KAAK,SAAS,MAAM,CAAC,CAAC,CAAC,KAAI,UAAS,WAAW,MAAM,MAAM,MAAM,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC;EACzF,CAAC;CACH,CAAC;CACD,OAAO;AACT;AAEA,SAAS,gBAAgB,SAAmB,MAA0C;CACpF,MAAM,YAAY,IAAI,IAAI,OAAO;CACjC,MAAM,SAAmB,CAAC;CAC1B,OAAO,UAAU,OAAO,GAAG;EACzB,MAAM,QAAQ,CAAC,GAAG,SAAS,CAAC,CAAC,QAAO,UAAS;GAE3C,OAAO,CAAC,GADK,KAAK,IAAI,KAAK,qBAAK,IAAI,IAAY,CACjC,CAAC,CAAC,OAAM,QAAO,CAAC,UAAU,IAAI,GAAG,CAAC;EACnD,CAAC;EACD,IAAI,MAAM,WAAW,GACnB,OAAO,CAAC,GAAG,WAAW,GAAG,MAAM,CAAC,CAAC,QAAQ;EAE3C,MAAM,KAAK;EACX,KAAK,MAAM,SAAS,OAAO;GACzB,OAAO,KAAK,KAAK;GACjB,UAAU,OAAO,KAAK;EACxB;CACF;CACA,OAAO;AACT"}
@@ -1,6 +1,6 @@
1
1
  import { t as AstNode } from "../ast-C8sIpKdL.js";
2
2
  import { l as Value } from "../value-BduA_ZGp.js";
3
- import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-Dt03dsnd.js";
3
+ import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-k8BGIKmj.js";
4
4
  import { CstType, RSForm } from "./rsform.js";
5
5
  import { BasicBinding, BasicsContext, EvalStatus, RSModel } from "./rsmodel.js";
6
6
 
@@ -1,8 +1,8 @@
1
1
  import { r as LibraryItem } from "../library-CYun28Xz.js";
2
2
  import { t as AstNode } from "../ast-C8sIpKdL.js";
3
- import { g as TypeClass, y as TypePath } from "../typification-DDuv88ir.js";
3
+ import { g as TypeClass, y as TypePath } from "../typification-9lNu9R4k.js";
4
4
  import { t as ValueClass } from "../value-class-CNI-lqXJ.js";
5
- import { r as AnalysisFull } from "../analyzer-DpE0qknt.js";
5
+ import { r as AnalysisFull } from "../analyzer-iqAXyROE.js";
6
6
  import { ArgumentValue, Constituenta, CstClass, CstStatus, CstType, RSForm, RSFormStats } from "./rsform.js";
7
7
  import { AliasMapping } from "../rslang/api.js";
8
8
 
@@ -1,7 +1,7 @@
1
1
  import { t as Graph } from "../graph-DR8rL2o3.js";
2
2
  import { i as LibraryItemReference, n as CurrentVersion, r as LibraryItem, s as VersionInfo } from "../library-CYun28Xz.js";
3
- import { f as ExpressionType, y as TypePath } from "../typification-DDuv88ir.js";
4
- import { a as RSLangAnalyzer, t as AnalysisBase } from "../analyzer-DpE0qknt.js";
3
+ import { f as ExpressionType, y as TypePath } from "../typification-9lNu9R4k.js";
4
+ import { a as RSLangAnalyzer, t as AnalysisBase } from "../analyzer-iqAXyROE.js";
5
5
  //#region src/library/rsform.d.ts
6
6
  /** Represents {@link Constituenta} type. */
7
7
  declare const CstType: {
@@ -1,4 +1,4 @@
1
- import { b as Typification, f as ExpressionType } from "../typification-DDuv88ir.js";
1
+ import { b as Typification, f as ExpressionType } from "../typification-9lNu9R4k.js";
2
2
  import { d as ValuePath, l as Value } from "../value-BduA_ZGp.js";
3
3
  import { Constituenta, CstType, RSForm } from "./rsform.js";
4
4
  import { BasicBinding, EvalStatus, RSModelStats } from "./rsmodel.js";
@@ -1,4 +1,4 @@
1
- import { b as Typification, y as TypePath } from "../typification-DDuv88ir.js";
1
+ import { b as Typification, y as TypePath } from "../typification-9lNu9R4k.js";
2
2
  import { Constituenta, RSForm } from "./rsform.js";
3
3
 
4
4
  //#region src/library/structure-planner.d.ts
@@ -1,5 +1,5 @@
1
1
  import { t as AstNode } from "../ast-C8sIpKdL.js";
2
- import { n as ArgumentsType } from "../arguments-extractor-Dd1lFom9.js";
2
+ import { n as ArgumentsType } from "../arguments-extractor-ngatANBI.js";
3
3
  import { t as generateExpressionFromAst } from "../expression-generator-CoucLIkE.js";
4
4
 
5
5
  //#region src/rslang/api.d.ts
@@ -11,11 +11,12 @@ import { generateExpressionFromAst } from "./parser/expression-generator.js";
11
11
  const LOCALS_REGEXP = /[_a-zα-ω][a-zα-ω]*\d*/g;
12
12
  const GLOBAL_ALIAS_SOURCE = "[XCSADFPTN]\\d+";
13
13
  const GLOBALS_REGEXP = new RegExp(GLOBAL_ALIAS_SOURCE, "g");
14
+ const GLOBAL_ALIAS_ANCHORED_REGEXP = new RegExp(`^${GLOBAL_ALIAS_SOURCE}$`);
14
15
  const COMPLEX_SYMBOLS_REGEXP = /[∀∃×ℬ;|:]/g;
15
16
  const TYPIFICATION_SET = /^ℬ+\([ℬ\(((X|C)\d+|Z)\)×]*\)$/g;
16
17
  /** Whether {@link value} is a single schema global alias (e.g. `X1`, `F42`). */
17
18
  function isGlobalAlias(value) {
18
- return new RegExp(`^${GLOBAL_ALIAS_SOURCE}$`).test(value);
19
+ return GLOBAL_ALIAS_ANCHORED_REGEXP.test(value);
19
20
  }
20
21
  /**
21
22
  * Parse a RSLang expression into a normalized AST.
@@ -1 +1 @@
1
- {"version":3,"file":"api.js","names":["rslangParser"],"sources":["../../src/rslang/api.ts"],"sourcesContent":["/**\n * Module: API for RSLanguage.\n */\nimport { type AstNode, buildTree } from '../parsing';\n\nimport { normalizeAST } from './parser/normalize';\nimport { parser as rslangParser } from './parser/parser';\nimport { ArgumentsExtractor, type ArgumentsType } from './semantic/arguments-extractor';\nexport { generateExpressionFromAst } from './parser/expression-generator';\n\n/** Represents alias mapping. */\nexport type AliasMapping = Record<string, string>;\n\n// cspell:disable\nconst LOCALS_REGEXP = /[_a-zα-ω][a-zα-ω]*\\d*/g;\nconst GLOBAL_ALIAS_SOURCE = '[XCSADFPTN]\\\\d+';\nconst GLOBALS_REGEXP = new RegExp(GLOBAL_ALIAS_SOURCE, 'g');\nconst COMPLEX_SYMBOLS_REGEXP = /[∀∃×ℬ;|:]/g;\nconst TYPIFICATION_SET = /^ℬ+\\([ℬ\\(((X|C)\\d+|Z)\\)×]*\\)$/g;\n// cspell:enable\n\n/** Whether {@link value} is a single schema global alias (e.g. `X1`, `F42`). */\nexport function isGlobalAlias(value: string): boolean {\n return new RegExp(`^${GLOBAL_ALIAS_SOURCE}$`).test(value);\n}\n\n/**\n * Parse a RSLang expression into a normalized AST.\n *\n * Returns `null` for blank input. Parses the original `expression` string so node\n * offsets match the source text (required for slice-based AST walks).\n */\nexport function parseRSLangExpression(expression: string): AstNode | null {\n if (!expression.trim()) {\n return null;\n }\n const tree = rslangParser.parse(expression);\n const ast = buildTree(tree.cursor());\n normalizeAST(ast, expression);\n return ast;\n}\n\n/** Extract arguments from AST. */\nexport function extractArguments(ast: AstNode): ArgumentsType[] {\n return new ArgumentsExtractor().run(ast);\n}\n\n/** Extracts global variable names from a given expression. */\nexport function extractGlobals(expression: string): Set<string> {\n return new Set(expression.match(GLOBALS_REGEXP) ?? []);\n}\n\n/** Check if expression is simple derivation. */\nexport function isSimpleExpression(text: string): boolean {\n return !text.match(COMPLEX_SYMBOLS_REGEXP);\n}\n\n/** Check if expression is set typification. */\nexport function isSetTypification(text: string): boolean {\n return !!text.match(TYPIFICATION_SET);\n}\n\n/**\n * Splits a string containing a template definition into its head and body parts.\n *\n * A template definition is expected to have the following format: `[head] body`.\n * If the input string does not contain the opening square bracket '[', the entire\n * string is treated as the body, and an empty string is assigned to the head.\n * If the opening bracket is present, the function attempts to find the matching\n * closing bracket ']' to determine the head and body parts.\n *\n * @example\n * const template = '[header] body content';\n * const result = splitTemplateDefinition(template);\n * // result: `{ head: 'header', body: 'body content' }`\n */\nexport function splitTemplateDefinition(target: string) {\n let start = 0;\n for (; start < target.length && target[start] !== '['; ++start);\n if (start < target.length) {\n for (let counter = 0, end = start + 1; end < target.length; ++end) {\n if (target[end] === '[') {\n ++counter;\n } else if (target[end] === ']') {\n if (counter !== 0) {\n --counter;\n } else {\n return {\n head: target.substring(start + 1, end).trim(),\n body: target.substring(end + 1).trim()\n };\n }\n }\n }\n }\n return {\n head: '',\n body: target\n };\n}\n\n/**\n * Substitutes values for template arguments in a given expression.\n *\n * This function takes an input mathematical expression and a list of argument values.\n * It replaces template argument placeholders in the expression with their corresponding values\n * from the provided arguments.\n */\nexport function substituteTemplateArgs(expression: string, mapping: AliasMapping): string {\n if (Object.keys(mapping).length === 0) {\n return expression;\n }\n let { head, body } = splitTemplateDefinition(expression);\n body = applyPattern(body, mapping, LOCALS_REGEXP);\n const argTexts = head.split(',').map(text => text.trim());\n head = argTexts\n .filter(arg => [...arg.matchAll(LOCALS_REGEXP)].every(local => local.every(match => !(match in mapping))))\n .join(', ');\n\n if (!head) {\n return body;\n } else {\n return `[${head}] ${body}`;\n }\n}\n\n/** Substitute local parameter aliases in an expression fragment. */\nexport function substituteLocalAliases(expression: string, mapping: AliasMapping): string {\n return applyPattern(expression, mapping, LOCALS_REGEXP);\n}\n\n/** Apply alias mapping. */\nexport function applyAliasMapping(target: string, mapping: AliasMapping): string {\n return applyPattern(target, mapping, GLOBALS_REGEXP);\n}\n\n/** Apply alias typification mapping. */\nexport function applyTypificationMapping(target: string, mapping: AliasMapping): string {\n const modified = applyAliasMapping(target, mapping);\n if (modified === target) {\n return target;\n }\n\n const deleteBrackets: number[] = [];\n const positions: number[] = [];\n const booleans: number[] = [];\n let boolCount: number = 0;\n let stackSize: number = 0;\n\n for (let i = 0; i < modified.length; i++) {\n const char = modified[i];\n if (char === 'ℬ') {\n boolCount++;\n continue;\n }\n if (char === '(') {\n stackSize++;\n positions.push(i);\n booleans.push(boolCount);\n }\n boolCount = 0;\n if (char === ')') {\n if (\n i < modified.length - 1 &&\n modified[i + 1] === ')' &&\n stackSize > 1 &&\n positions[stackSize - 2] + booleans[stackSize - 1] + 1 === positions[stackSize - 1]\n ) {\n deleteBrackets.push(i);\n deleteBrackets.push(positions[stackSize - 2]);\n }\n if (i === modified.length - 1 && stackSize === 1 && positions[0] === 0) {\n deleteBrackets.push(i);\n deleteBrackets.push(positions[0]);\n }\n stackSize--;\n positions.pop();\n booleans.pop();\n }\n }\n\n let result = '';\n for (let i = 0; i < modified.length; i++) {\n if (!deleteBrackets.includes(i)) {\n result += modified[i];\n }\n }\n\n return result;\n}\n\n// ====== Internals =========\n/** Text substitution guided by mapping and regular expression. */\nfunction applyPattern(text: string, mapping: AliasMapping, pattern: RegExp): string {\n if (text === '' || pattern === null) {\n return text;\n }\n let posInput = 0;\n let output = '';\n const patternMatches = text.matchAll(pattern);\n for (const segment of patternMatches) {\n const entity = segment[0];\n const start = segment.index ?? 0;\n if (entity in mapping) {\n output += text.substring(posInput, start);\n output += mapping[entity];\n posInput = start + segment[0].length;\n }\n }\n output += text.substring(posInput);\n return output;\n}\n"],"mappings":";;;;;;;;;;AAcA,MAAM,gBAAgB;AACtB,MAAM,sBAAsB;AAC5B,MAAM,iBAAiB,IAAI,OAAO,qBAAqB,GAAG;AAC1D,MAAM,yBAAyB;AAC/B,MAAM,mBAAmB;;AAIzB,SAAgB,cAAc,OAAwB;CACpD,OAAO,IAAI,OAAO,IAAI,oBAAoB,EAAE,CAAC,CAAC,KAAK,KAAK;AAC1D;;;;;;;AAQA,SAAgB,sBAAsB,YAAoC;CACxE,IAAI,CAAC,WAAW,KAAK,GACnB,OAAO;CAGT,MAAM,MAAM,UADCA,OAAa,MAAM,UACV,CAAA,CAAK,OAAO,CAAC;CACnC,aAAa,KAAK,UAAU;CAC5B,OAAO;AACT;;AAGA,SAAgB,iBAAiB,KAA+B;CAC9D,OAAO,IAAI,mBAAmB,CAAC,CAAC,IAAI,GAAG;AACzC;;AAGA,SAAgB,eAAe,YAAiC;CAC9D,OAAO,IAAI,IAAI,WAAW,MAAM,cAAc,KAAK,CAAC,CAAC;AACvD;;AAGA,SAAgB,mBAAmB,MAAuB;CACxD,OAAO,CAAC,KAAK,MAAM,sBAAsB;AAC3C;;AAGA,SAAgB,kBAAkB,MAAuB;CACvD,OAAO,CAAC,CAAC,KAAK,MAAM,gBAAgB;AACtC;;;;;;;;;;;;;;;AAgBA,SAAgB,wBAAwB,QAAgB;CACtD,IAAI,QAAQ;CACZ,OAAO,QAAQ,OAAO,UAAU,OAAO,WAAW,KAAK,EAAE;CACzD,IAAI,QAAQ,OAAO,QACjB;OAAK,IAAI,UAAU,GAAG,MAAM,QAAQ,GAAG,MAAM,OAAO,QAAQ,EAAE,KAC5D,IAAI,OAAO,SAAS,KAClB,EAAE;OACG,IAAI,OAAO,SAAS,KACzB,IAAI,YAAY,GACd,EAAE;OAEF,OAAO;GACL,MAAM,OAAO,UAAU,QAAQ,GAAG,GAAG,CAAC,CAAC,KAAK;GAC5C,MAAM,OAAO,UAAU,MAAM,CAAC,CAAC,CAAC,KAAK;EACvC;CAGN;CAEF,OAAO;EACL,MAAM;EACN,MAAM;CACR;AACF;;;;;;;;AASA,SAAgB,uBAAuB,YAAoB,SAA+B;CACxF,IAAI,OAAO,KAAK,OAAO,CAAC,CAAC,WAAW,GAClC,OAAO;CAET,IAAI,EAAE,MAAM,SAAS,wBAAwB,UAAU;CACvD,OAAO,aAAa,MAAM,SAAS,aAAa;CAEhD,OADiB,KAAK,MAAM,GAAG,CAAC,CAAC,KAAI,SAAQ,KAAK,KAAK,CAChD,CAAA,CACJ,QAAO,QAAO,CAAC,GAAG,IAAI,SAAS,aAAa,CAAC,CAAC,CAAC,OAAM,UAAS,MAAM,OAAM,UAAS,EAAE,SAAS,QAAQ,CAAC,CAAC,CAAC,CACzG,KAAK,IAAI;CAEZ,IAAI,CAAC,MACH,OAAO;MAEP,OAAO,IAAI,KAAK,IAAI;AAExB;;AAGA,SAAgB,uBAAuB,YAAoB,SAA+B;CACxF,OAAO,aAAa,YAAY,SAAS,aAAa;AACxD;;AAGA,SAAgB,kBAAkB,QAAgB,SAA+B;CAC/E,OAAO,aAAa,QAAQ,SAAS,cAAc;AACrD;;AAGA,SAAgB,yBAAyB,QAAgB,SAA+B;CACtF,MAAM,WAAW,kBAAkB,QAAQ,OAAO;CAClD,IAAI,aAAa,QACf,OAAO;CAGT,MAAM,iBAA2B,CAAC;CAClC,MAAM,YAAsB,CAAC;CAC7B,MAAM,WAAqB,CAAC;CAC5B,IAAI,YAAoB;CACxB,IAAI,YAAoB;CAExB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,OAAO,SAAS;EACtB,IAAI,SAAS,KAAK;GAChB;GACA;EACF;EACA,IAAI,SAAS,KAAK;GAChB;GACA,UAAU,KAAK,CAAC;GAChB,SAAS,KAAK,SAAS;EACzB;EACA,YAAY;EACZ,IAAI,SAAS,KAAK;GAChB,IACE,IAAI,SAAS,SAAS,KACtB,SAAS,IAAI,OAAO,OACpB,YAAY,KACZ,UAAU,YAAY,KAAK,SAAS,YAAY,KAAK,MAAM,UAAU,YAAY,IACjF;IACA,eAAe,KAAK,CAAC;IACrB,eAAe,KAAK,UAAU,YAAY,EAAE;GAC9C;GACA,IAAI,MAAM,SAAS,SAAS,KAAK,cAAc,KAAK,UAAU,OAAO,GAAG;IACtE,eAAe,KAAK,CAAC;IACrB,eAAe,KAAK,UAAU,EAAE;GAClC;GACA;GACA,UAAU,IAAI;GACd,SAAS,IAAI;EACf;CACF;CAEA,IAAI,SAAS;CACb,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,IAAI,CAAC,eAAe,SAAS,CAAC,GAC5B,UAAU,SAAS;CAIvB,OAAO;AACT;;AAIA,SAAS,aAAa,MAAc,SAAuB,SAAyB;CAClF,IAAI,SAAS,MAAM,YAAY,MAC7B,OAAO;CAET,IAAI,WAAW;CACf,IAAI,SAAS;CACb,MAAM,iBAAiB,KAAK,SAAS,OAAO;CAC5C,KAAK,MAAM,WAAW,gBAAgB;EACpC,MAAM,SAAS,QAAQ;EACvB,MAAM,QAAQ,QAAQ,SAAS;EAC/B,IAAI,UAAU,SAAS;GACrB,UAAU,KAAK,UAAU,UAAU,KAAK;GACxC,UAAU,QAAQ;GAClB,WAAW,QAAQ,QAAQ,EAAE,CAAC;EAChC;CACF;CACA,UAAU,KAAK,UAAU,QAAQ;CACjC,OAAO;AACT"}
1
+ {"version":3,"file":"api.js","names":["rslangParser"],"sources":["../../src/rslang/api.ts"],"sourcesContent":["/**\n * Module: API for RSLanguage.\n */\nimport { type AstNode, buildTree } from '../parsing';\n\nimport { normalizeAST } from './parser/normalize';\nimport { parser as rslangParser } from './parser/parser';\nimport { ArgumentsExtractor, type ArgumentsType } from './semantic/arguments-extractor';\nexport { generateExpressionFromAst } from './parser/expression-generator';\n\n/** Represents alias mapping. */\nexport type AliasMapping = Record<string, string>;\n\n// cspell:disable\nconst LOCALS_REGEXP = /[_a-zα-ω][a-zα-ω]*\\d*/g;\nconst GLOBAL_ALIAS_SOURCE = '[XCSADFPTN]\\\\d+';\nconst GLOBALS_REGEXP = new RegExp(GLOBAL_ALIAS_SOURCE, 'g');\nconst GLOBAL_ALIAS_ANCHORED_REGEXP = new RegExp(`^${GLOBAL_ALIAS_SOURCE}$`);\nconst COMPLEX_SYMBOLS_REGEXP = /[∀∃×ℬ;|:]/g;\nconst TYPIFICATION_SET = /^ℬ+\\([ℬ\\(((X|C)\\d+|Z)\\)×]*\\)$/g;\n// cspell:enable\n\n/** Whether {@link value} is a single schema global alias (e.g. `X1`, `F42`). */\nexport function isGlobalAlias(value: string): boolean {\n return GLOBAL_ALIAS_ANCHORED_REGEXP.test(value);\n}\n\n/**\n * Parse a RSLang expression into a normalized AST.\n *\n * Returns `null` for blank input. Parses the original `expression` string so node\n * offsets match the source text (required for slice-based AST walks).\n */\nexport function parseRSLangExpression(expression: string): AstNode | null {\n if (!expression.trim()) {\n return null;\n }\n const tree = rslangParser.parse(expression);\n const ast = buildTree(tree.cursor());\n normalizeAST(ast, expression);\n return ast;\n}\n\n/** Extract arguments from AST. */\nexport function extractArguments(ast: AstNode): ArgumentsType[] {\n return new ArgumentsExtractor().run(ast);\n}\n\n/** Extracts global variable names from a given expression. */\nexport function extractGlobals(expression: string): Set<string> {\n return new Set(expression.match(GLOBALS_REGEXP) ?? []);\n}\n\n/** Check if expression is simple derivation. */\nexport function isSimpleExpression(text: string): boolean {\n return !text.match(COMPLEX_SYMBOLS_REGEXP);\n}\n\n/** Check if expression is set typification. */\nexport function isSetTypification(text: string): boolean {\n return !!text.match(TYPIFICATION_SET);\n}\n\n/**\n * Splits a string containing a template definition into its head and body parts.\n *\n * A template definition is expected to have the following format: `[head] body`.\n * If the input string does not contain the opening square bracket '[', the entire\n * string is treated as the body, and an empty string is assigned to the head.\n * If the opening bracket is present, the function attempts to find the matching\n * closing bracket ']' to determine the head and body parts.\n *\n * @example\n * const template = '[header] body content';\n * const result = splitTemplateDefinition(template);\n * // result: `{ head: 'header', body: 'body content' }`\n */\nexport function splitTemplateDefinition(target: string) {\n let start = 0;\n for (; start < target.length && target[start] !== '['; ++start);\n if (start < target.length) {\n for (let counter = 0, end = start + 1; end < target.length; ++end) {\n if (target[end] === '[') {\n ++counter;\n } else if (target[end] === ']') {\n if (counter !== 0) {\n --counter;\n } else {\n return {\n head: target.substring(start + 1, end).trim(),\n body: target.substring(end + 1).trim()\n };\n }\n }\n }\n }\n return {\n head: '',\n body: target\n };\n}\n\n/**\n * Substitutes values for template arguments in a given expression.\n *\n * This function takes an input mathematical expression and a list of argument values.\n * It replaces template argument placeholders in the expression with their corresponding values\n * from the provided arguments.\n */\nexport function substituteTemplateArgs(expression: string, mapping: AliasMapping): string {\n if (Object.keys(mapping).length === 0) {\n return expression;\n }\n let { head, body } = splitTemplateDefinition(expression);\n body = applyPattern(body, mapping, LOCALS_REGEXP);\n const argTexts = head.split(',').map(text => text.trim());\n head = argTexts\n .filter(arg => [...arg.matchAll(LOCALS_REGEXP)].every(local => local.every(match => !(match in mapping))))\n .join(', ');\n\n if (!head) {\n return body;\n } else {\n return `[${head}] ${body}`;\n }\n}\n\n/** Substitute local parameter aliases in an expression fragment. */\nexport function substituteLocalAliases(expression: string, mapping: AliasMapping): string {\n return applyPattern(expression, mapping, LOCALS_REGEXP);\n}\n\n/** Apply alias mapping. */\nexport function applyAliasMapping(target: string, mapping: AliasMapping): string {\n return applyPattern(target, mapping, GLOBALS_REGEXP);\n}\n\n/** Apply alias typification mapping. */\nexport function applyTypificationMapping(target: string, mapping: AliasMapping): string {\n const modified = applyAliasMapping(target, mapping);\n if (modified === target) {\n return target;\n }\n\n const deleteBrackets: number[] = [];\n const positions: number[] = [];\n const booleans: number[] = [];\n let boolCount: number = 0;\n let stackSize: number = 0;\n\n for (let i = 0; i < modified.length; i++) {\n const char = modified[i];\n if (char === 'ℬ') {\n boolCount++;\n continue;\n }\n if (char === '(') {\n stackSize++;\n positions.push(i);\n booleans.push(boolCount);\n }\n boolCount = 0;\n if (char === ')') {\n if (\n i < modified.length - 1 &&\n modified[i + 1] === ')' &&\n stackSize > 1 &&\n positions[stackSize - 2] + booleans[stackSize - 1] + 1 === positions[stackSize - 1]\n ) {\n deleteBrackets.push(i);\n deleteBrackets.push(positions[stackSize - 2]);\n }\n if (i === modified.length - 1 && stackSize === 1 && positions[0] === 0) {\n deleteBrackets.push(i);\n deleteBrackets.push(positions[0]);\n }\n stackSize--;\n positions.pop();\n booleans.pop();\n }\n }\n\n let result = '';\n for (let i = 0; i < modified.length; i++) {\n if (!deleteBrackets.includes(i)) {\n result += modified[i];\n }\n }\n\n return result;\n}\n\n// ====== Internals =========\n/** Text substitution guided by mapping and regular expression. */\nfunction applyPattern(text: string, mapping: AliasMapping, pattern: RegExp): string {\n if (text === '' || pattern === null) {\n return text;\n }\n let posInput = 0;\n let output = '';\n const patternMatches = text.matchAll(pattern);\n for (const segment of patternMatches) {\n const entity = segment[0];\n const start = segment.index ?? 0;\n if (entity in mapping) {\n output += text.substring(posInput, start);\n output += mapping[entity];\n posInput = start + segment[0].length;\n }\n }\n output += text.substring(posInput);\n return output;\n}\n"],"mappings":";;;;;;;;;;AAcA,MAAM,gBAAgB;AACtB,MAAM,sBAAsB;AAC5B,MAAM,iBAAiB,IAAI,OAAO,qBAAqB,GAAG;AAC1D,MAAM,+BAA+B,IAAI,OAAO,IAAI,oBAAoB,EAAE;AAC1E,MAAM,yBAAyB;AAC/B,MAAM,mBAAmB;;AAIzB,SAAgB,cAAc,OAAwB;CACpD,OAAO,6BAA6B,KAAK,KAAK;AAChD;;;;;;;AAQA,SAAgB,sBAAsB,YAAoC;CACxE,IAAI,CAAC,WAAW,KAAK,GACnB,OAAO;CAGT,MAAM,MAAM,UADCA,OAAa,MAAM,UACV,CAAA,CAAK,OAAO,CAAC;CACnC,aAAa,KAAK,UAAU;CAC5B,OAAO;AACT;;AAGA,SAAgB,iBAAiB,KAA+B;CAC9D,OAAO,IAAI,mBAAmB,CAAC,CAAC,IAAI,GAAG;AACzC;;AAGA,SAAgB,eAAe,YAAiC;CAC9D,OAAO,IAAI,IAAI,WAAW,MAAM,cAAc,KAAK,CAAC,CAAC;AACvD;;AAGA,SAAgB,mBAAmB,MAAuB;CACxD,OAAO,CAAC,KAAK,MAAM,sBAAsB;AAC3C;;AAGA,SAAgB,kBAAkB,MAAuB;CACvD,OAAO,CAAC,CAAC,KAAK,MAAM,gBAAgB;AACtC;;;;;;;;;;;;;;;AAgBA,SAAgB,wBAAwB,QAAgB;CACtD,IAAI,QAAQ;CACZ,OAAO,QAAQ,OAAO,UAAU,OAAO,WAAW,KAAK,EAAE;CACzD,IAAI,QAAQ,OAAO,QACjB;OAAK,IAAI,UAAU,GAAG,MAAM,QAAQ,GAAG,MAAM,OAAO,QAAQ,EAAE,KAC5D,IAAI,OAAO,SAAS,KAClB,EAAE;OACG,IAAI,OAAO,SAAS,KACzB,IAAI,YAAY,GACd,EAAE;OAEF,OAAO;GACL,MAAM,OAAO,UAAU,QAAQ,GAAG,GAAG,CAAC,CAAC,KAAK;GAC5C,MAAM,OAAO,UAAU,MAAM,CAAC,CAAC,CAAC,KAAK;EACvC;CAGN;CAEF,OAAO;EACL,MAAM;EACN,MAAM;CACR;AACF;;;;;;;;AASA,SAAgB,uBAAuB,YAAoB,SAA+B;CACxF,IAAI,OAAO,KAAK,OAAO,CAAC,CAAC,WAAW,GAClC,OAAO;CAET,IAAI,EAAE,MAAM,SAAS,wBAAwB,UAAU;CACvD,OAAO,aAAa,MAAM,SAAS,aAAa;CAEhD,OADiB,KAAK,MAAM,GAAG,CAAC,CAAC,KAAI,SAAQ,KAAK,KAAK,CAChD,CAAA,CACJ,QAAO,QAAO,CAAC,GAAG,IAAI,SAAS,aAAa,CAAC,CAAC,CAAC,OAAM,UAAS,MAAM,OAAM,UAAS,EAAE,SAAS,QAAQ,CAAC,CAAC,CAAC,CACzG,KAAK,IAAI;CAEZ,IAAI,CAAC,MACH,OAAO;MAEP,OAAO,IAAI,KAAK,IAAI;AAExB;;AAGA,SAAgB,uBAAuB,YAAoB,SAA+B;CACxF,OAAO,aAAa,YAAY,SAAS,aAAa;AACxD;;AAGA,SAAgB,kBAAkB,QAAgB,SAA+B;CAC/E,OAAO,aAAa,QAAQ,SAAS,cAAc;AACrD;;AAGA,SAAgB,yBAAyB,QAAgB,SAA+B;CACtF,MAAM,WAAW,kBAAkB,QAAQ,OAAO;CAClD,IAAI,aAAa,QACf,OAAO;CAGT,MAAM,iBAA2B,CAAC;CAClC,MAAM,YAAsB,CAAC;CAC7B,MAAM,WAAqB,CAAC;CAC5B,IAAI,YAAoB;CACxB,IAAI,YAAoB;CAExB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,OAAO,SAAS;EACtB,IAAI,SAAS,KAAK;GAChB;GACA;EACF;EACA,IAAI,SAAS,KAAK;GAChB;GACA,UAAU,KAAK,CAAC;GAChB,SAAS,KAAK,SAAS;EACzB;EACA,YAAY;EACZ,IAAI,SAAS,KAAK;GAChB,IACE,IAAI,SAAS,SAAS,KACtB,SAAS,IAAI,OAAO,OACpB,YAAY,KACZ,UAAU,YAAY,KAAK,SAAS,YAAY,KAAK,MAAM,UAAU,YAAY,IACjF;IACA,eAAe,KAAK,CAAC;IACrB,eAAe,KAAK,UAAU,YAAY,EAAE;GAC9C;GACA,IAAI,MAAM,SAAS,SAAS,KAAK,cAAc,KAAK,UAAU,OAAO,GAAG;IACtE,eAAe,KAAK,CAAC;IACrB,eAAe,KAAK,UAAU,EAAE;GAClC;GACA;GACA,UAAU,IAAI;GACd,SAAS,IAAI;EACf;CACF;CAEA,IAAI,SAAS;CACb,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,IAAI,CAAC,eAAe,SAAS,CAAC,GAC5B,UAAU,SAAS;CAIvB,OAAO;AACT;;AAIA,SAAS,aAAa,MAAc,SAAuB,SAAyB;CAClF,IAAI,SAAS,MAAM,YAAY,MAC7B,OAAO;CAET,IAAI,WAAW;CACf,IAAI,SAAS;CACb,MAAM,iBAAiB,KAAK,SAAS,OAAO;CAC5C,KAAK,MAAM,WAAW,gBAAgB;EACpC,MAAM,SAAS,QAAQ;EACvB,MAAM,QAAQ,QAAQ,SAAS;EAC/B,IAAI,UAAU,SAAS;GACrB,UAAU,KAAK,UAAU,UAAU,KAAK;GACxC,UAAU,QAAQ;GAClB,WAAW,QAAQ,QAAQ,EAAE,CAAC;EAChC;CACF;CACA,UAAU,KAAK,UAAU,QAAQ;CACjC,OAAO;AACT"}
@@ -1,2 +1,2 @@
1
- import { i as readTypeAnnotation, n as annotateType, r as readErrorAnnotation, t as annotateError } from "../ast-annotations-CZCzs9Uk.js";
1
+ import { i as readTypeAnnotation, n as annotateType, r as readErrorAnnotation, t as annotateError } from "../ast-annotations-D6KZDu12.js";
2
2
  export { annotateError, annotateType, readErrorAnnotation, readTypeAnnotation };
@@ -1,2 +1,2 @@
1
- import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../../calculator-Dt03dsnd.js";
1
+ import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../../calculator-k8BGIKmj.js";
2
2
  export { CalculatorEvaluateOptions, CalculatorResult, RSCalculator };
@@ -1,2 +1,2 @@
1
- import { _ as setSymDiff, a as extractValue, b as validateValue, c as isTupleValue, d as printValue, f as projection, g as setNestedValue, h as setIntersection, i as convertPathToType, l as makeDefaultValue, m as setDiff, n as cartesianProduct, o as isSetValue, p as reduce, r as contains, s as isSubsetOrEq, t as boolean, u as normalizeValue, v as setUnion, x as valueStub, y as testInvalid } from "../../value-api-C2X4Pom5.js";
1
+ import { _ as setSymDiff, a as extractValue, b as validateValue, c as isTupleValue, d as printValue, f as projection, g as setNestedValue, h as setIntersection, i as convertPathToType, l as makeDefaultValue, m as setDiff, n as cartesianProduct, o as isSetValue, p as reduce, r as contains, s as isSubsetOrEq, t as boolean, u as normalizeValue, v as setUnion, x as valueStub, y as testInvalid } from "../../value-api-CXLl_zg0.js";
2
2
  export { boolean, cartesianProduct, contains, convertPathToType, extractValue, isSetValue, isSubsetOrEq, isTupleValue, makeDefaultValue, normalizeValue, printValue, projection, reduce, setDiff, setIntersection, setNestedValue, setSymDiff, setUnion, testInvalid, validateValue, valueStub };
@@ -1,14 +1,14 @@
1
- import { b as Typification, d as EmptySetT, f as ExpressionType, g as TypeClass, k as makeTypePath, m as LogicT, t as AnyTypificationT, v as TypeID, y as TypePath } from "../typification-DDuv88ir.js";
1
+ import { A as makeTypePath, b as Typification, d as EmptySetT, f as ExpressionType, g as TypeClass, m as LogicT, t as AnyTypificationT, v as TypeID, y as TypePath } from "../typification-9lNu9R4k.js";
2
2
  import { i as RSErrorDescription, r as RSErrorCode } from "../error-CzIbnP-N.js";
3
- import { i as readTypeAnnotation, r as readErrorAnnotation } from "../ast-annotations-CZCzs9Uk.js";
3
+ import { i as readTypeAnnotation, r as readErrorAnnotation } from "../ast-annotations-D6KZDu12.js";
4
4
  import { d as ValuePath, l as Value, p as makeValuePath } from "../value-BduA_ZGp.js";
5
- import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-Dt03dsnd.js";
6
- import { d as printValue } from "../value-api-C2X4Pom5.js";
5
+ import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-k8BGIKmj.js";
6
+ import { d as printValue } from "../value-api-CXLl_zg0.js";
7
7
  import { t as parser } from "../parser-Bwd8LxJ1.js";
8
8
  import { t as TokenID } from "../token-DeXAmzwr.js";
9
9
  import { t as ValueClass } from "../value-class-CNI-lqXJ.js";
10
- import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "../analyzer-DpE0qknt.js";
11
- import { n as ArgumentsType } from "../arguments-extractor-Dd1lFom9.js";
12
- import { n as applyAsciiTypeSubstitutions, r as parseTypeText } from "../typification-parser-DHO42ZRc.js";
13
- import { n as TypificationNodeData, t as TypificationGraph } from "../typification-graph-8VdK6_Fh.js";
10
+ import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "../analyzer-iqAXyROE.js";
11
+ import { n as ArgumentsType } from "../arguments-extractor-ngatANBI.js";
12
+ import { n as applyAsciiTypeSubstitutions, r as parseTypeText } from "../typification-parser-Dytsv9CI.js";
13
+ import { n as TypificationNodeData, t as TypificationGraph } from "../typification-graph-BY_oGT82.js";
14
14
  export { type AnalysisBase, type AnalysisFast, type AnalysisFull, AnyTypificationT, type ArgumentsType, type CalculatorEvaluateOptions, type CalculatorResult, EmptySetT, type ExpressionType, LogicT, RSCalculator, RSErrorCode, type RSErrorDescription, RSLangAnalyzer, TokenID, TypeClass, TypeID, type TypePath, type Typification, TypificationGraph, type TypificationNodeData, type Value, ValueClass, type ValuePath, applyAsciiTypeSubstitutions, makeTypePath, makeValuePath, parseTypeText, printValue, readErrorAnnotation, readTypeAnnotation, parser as rslangParser };
@@ -1,5 +1,5 @@
1
1
  import { n as AstNodeBase } from "../ast-C8sIpKdL.js";
2
- import { f as ExpressionType } from "../typification-DDuv88ir.js";
2
+ import { f as ExpressionType } from "../typification-9lNu9R4k.js";
3
3
  import { t as TokenID } from "../token-DeXAmzwr.js";
4
4
 
5
5
  //#region src/rslang/labels.d.ts
@@ -7,10 +7,12 @@ import { t as TokenID } from "../token-DeXAmzwr.js";
7
7
  declare function labelToken(id: TokenID): string;
8
8
  /** Generates label for {@link AstNodeBase}. Unnormalized grammar nodes fall through to `node.data.value` (Lezer name). */
9
9
  declare function labelRSLangNode(node: AstNodeBase): string;
10
+ /** Formats a base-set alias for display (mangled radicals `func<R#>` → `<func>R#`). */
11
+ declare function labelBaseId(baseID: string): string;
10
12
  /** Converts expression type to string. */
11
13
  declare function labelType(type: ExpressionType | null): string;
12
14
  /** Converts expression type to normalized string. */
13
15
  declare function normalizeType(type: ExpressionType | null): string;
14
16
  //#endregion
15
- export { labelRSLangNode, labelToken, labelType, normalizeType };
17
+ export { labelBaseId, labelRSLangNode, labelToken, labelType, normalizeType };
16
18
  //# sourceMappingURL=labels.d.ts.map
@@ -116,13 +116,19 @@ function labelRSLangNode(node) {
116
116
  if (node.data.value) return node.data.value;
117
117
  return "UNKNOWN NODE: " + String(node.typeID);
118
118
  }
119
+ /** Formats a base-set alias for display (mangled radicals `func<R#>` → `<func>R#`). */
120
+ function labelBaseId(baseID) {
121
+ const match = /^([^<]+)<(R[1-9]\d*)>$/.exec(baseID);
122
+ if (match) return `<${match[1]}>${match[2]}`;
123
+ return baseID;
124
+ }
119
125
  /** Converts expression type to string. */
120
126
  function labelType(type) {
121
127
  if (!type) return "N/A";
122
128
  switch (type.typeID) {
123
129
  case TypeID.anyTypification: return ANY_TYPE_NAME;
124
130
  case TypeID.integer: return INTEGER_TYPE_NAME;
125
- case TypeID.basic: return type.baseID;
131
+ case TypeID.basic: return labelBaseId(type.baseID);
126
132
  case TypeID.tuple: return type.factors.map((factor) => factor.typeID === TypeID.tuple ? `(${labelType(factor)})` : labelType(factor)).join("×");
127
133
  case TypeID.collection: return type.base.typeID === TypeID.collection ? `ℬ${labelType(type.base)}` : `ℬ(${labelType(type.base)})`;
128
134
  case TypeID.logic: return LOGIC_TYPE_NAME;
@@ -145,6 +151,6 @@ function normalizeType(type) {
145
151
  }
146
152
  }
147
153
  //#endregion
148
- export { labelRSLangNode, labelToken, labelType, normalizeType };
154
+ export { labelBaseId, labelRSLangNode, labelToken, labelType, normalizeType };
149
155
 
150
156
  //# sourceMappingURL=labels.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"labels.js","names":[],"sources":["../../src/rslang/labels.ts"],"sourcesContent":["import { type AstNodeBase } from '../parsing';\n\nimport { TokenID } from './parser/token';\nimport { type ExpressionType, TypeID } from './semantic/typification';\n\nconst INTEGER_TYPE_NAME = 'Z';\nconst ANY_TYPE_NAME = 'R0';\nconst LOGIC_TYPE_NAME = 'Logic';\n\nconst labelTokenRecord: Partial<Record<TokenID, string>> = {\n [TokenID.DECART]: '×',\n [TokenID.PUNCTUATION_PL]: '( )',\n [TokenID.PUNCTUATION_SL]: '[ ]',\n [TokenID.QUANTOR_UNIVERSAL]: '∀',\n [TokenID.QUANTOR_EXISTS]: '∃',\n [TokenID.LOGIC_NOT]: '¬',\n [TokenID.LOGIC_AND]: '&',\n [TokenID.LOGIC_OR]: '∨',\n [TokenID.LOGIC_IMPLICATION]: '⇒',\n [TokenID.LOGIC_EQUIVALENT]: '⇔',\n [TokenID.LIT_EMPTYSET]: '∅',\n [TokenID.LIT_WHOLE_NUMBERS]: 'Z',\n [TokenID.MULTIPLY]: '*',\n [TokenID.EQUAL]: '=',\n [TokenID.NOTEQUAL]: '≠',\n [TokenID.GREATER_OR_EQ]: '≥',\n [TokenID.LESSER_OR_EQ]: '≤',\n [TokenID.SET_IN]: '∈',\n [TokenID.SET_NOT_IN]: '∉',\n [TokenID.SUBSET_OR_EQ]: '⊆',\n [TokenID.SUBSET]: '⊂',\n [TokenID.NOT_SUBSET]: '⊄',\n [TokenID.SET_INTERSECTION]: '∩',\n [TokenID.SET_UNION]: '∪',\n [TokenID.SET_MINUS]: '\\\\',\n [TokenID.SET_SYMMETRIC_MINUS]: '∆',\n [TokenID.BOOLEAN]: 'ℬ()',\n [TokenID.NT_DECLARATIVE_EXPR]: 'D{}',\n [TokenID.NT_IMPERATIVE_EXPR]: 'I{}',\n [TokenID.NT_RECURSIVE_FULL]: 'R{}',\n [TokenID.NT_RECURSIVE_SHORT]: 'R{}',\n [TokenID.BIGPR]: 'Pr1()',\n [TokenID.SMALLPR]: 'pr1()',\n [TokenID.FILTER]: 'Fi1[]()',\n [TokenID.REDUCE]: 'red()',\n [TokenID.CARD]: 'card()',\n [TokenID.BOOL]: 'bool()',\n [TokenID.DEBOOL]: 'debool()',\n [TokenID.ASSIGN]: ':=',\n [TokenID.ITERATE]: ':∈'\n};\n\n/** Retrieves label for {@link TokenID}. */\nexport function labelToken(id: TokenID): string {\n const text = labelTokenRecord[id];\n return text ?? 'UNKNOWN TOKEN: ' + String(id);\n}\n\n/** Generates label for {@link AstNodeBase}. Unnormalized grammar nodes fall through to `node.data.value` (Lezer name). */\nexport function labelRSLangNode(node: AstNodeBase): string {\n // prettier-ignore\n switch (node.typeID) {\n case TokenID.ERROR: return '[ERROR]';\n case TokenID.ID_LOCAL:\n case TokenID.ID_GLOBAL:\n case TokenID.ID_FUNCTION:\n case TokenID.ID_PREDICATE:\n case TokenID.ID_RADICAL:\n return node.data.value as string;\n\n case TokenID.LIT_INTEGER: return String(node.data.value);\n\n case TokenID.BIGPR: return 'Pr' + (node.data.value as string[]).toString();\n case TokenID.SMALLPR: return 'pr' + (node.data.value as string[]).toString();\n case TokenID.FILTER: return 'Fi' + (node.data.value as string[]).toString();\n\n case TokenID.NT_DECLARATIVE_EXPR: return 'DECLARATIVE';\n case TokenID.NT_IMPERATIVE_EXPR: return 'IMPERATIVE';\n case TokenID.NT_RECURSIVE_FULL: return 'RECURSIVE';\n case TokenID.NT_RECURSIVE_SHORT: return 'RECURSIVE';\n\n case TokenID.BOOLEAN: return 'ℬ';\n case TokenID.REDUCE: return 'red';\n case TokenID.CARD: return 'card';\n case TokenID.BOOL: return 'bool';\n case TokenID.DEBOOL: return 'debool';\n\n case TokenID.PLUS: return '+';\n case TokenID.MINUS: return '-';\n case TokenID.MULTIPLY: return '*';\n case TokenID.GREATER: return '>';\n case TokenID.LESSER: return '<';\n\n case TokenID.NT_TUPLE: return 'TUPLE';\n case TokenID.NT_ENUMERATION: return 'ENUM';\n\n case TokenID.NT_ENUM_DECL: return 'ENUM_DECLARE';\n case TokenID.NT_TUPLE_DECL: return 'TUPLE_DECLARE';\n case TokenID.PUNCTUATION_DEFINE: return 'DEFINITION';\n case TokenID.PUNCTUATION_STRUCT: return 'STRUCTURE_DEFINE';\n\n case TokenID.NT_ARG_DECL: return 'ARG';\n case TokenID.NT_FUNC_CALL: return 'CALL';\n case TokenID.NT_ARGUMENTS: return 'ARGS';\n\n case TokenID.NT_FUNC_DEFINITION: return 'FUNCTION_DEFINE';\n\n case TokenID.DECART:\n case TokenID.QUANTOR_UNIVERSAL:\n case TokenID.QUANTOR_EXISTS:\n case TokenID.LOGIC_NOT:\n case TokenID.LOGIC_AND:\n case TokenID.LOGIC_OR:\n case TokenID.LOGIC_IMPLICATION:\n case TokenID.LOGIC_EQUIVALENT:\n case TokenID.LIT_EMPTYSET:\n case TokenID.LIT_WHOLE_NUMBERS:\n case TokenID.EQUAL:\n case TokenID.NOTEQUAL:\n case TokenID.GREATER_OR_EQ:\n case TokenID.LESSER_OR_EQ:\n case TokenID.SET_IN:\n case TokenID.SET_NOT_IN:\n case TokenID.SUBSET_OR_EQ:\n case TokenID.SUBSET:\n case TokenID.NOT_SUBSET:\n case TokenID.SET_INTERSECTION:\n case TokenID.SET_UNION:\n case TokenID.SET_MINUS:\n case TokenID.SET_SYMMETRIC_MINUS:\n case TokenID.ASSIGN:\n case TokenID.ITERATE:\n return labelToken(node.typeID);\n }\n if (node.data.value) {\n return node.data.value as string;\n }\n return 'UNKNOWN NODE: ' + String(node.typeID);\n}\n\n/** Converts expression type to string. */\nexport function labelType(type: ExpressionType | null): string {\n if (!type) {\n return 'N/A';\n }\n switch (type.typeID) {\n case TypeID.anyTypification:\n return ANY_TYPE_NAME;\n case TypeID.integer:\n return INTEGER_TYPE_NAME;\n case TypeID.basic:\n return type.baseID;\n case TypeID.tuple:\n return type.factors\n .map(factor => (factor.typeID === TypeID.tuple ? `(${labelType(factor)})` : labelType(factor)))\n .join('×');\n case TypeID.collection:\n return type.base.typeID === TypeID.collection ? `ℬ${labelType(type.base)}` : `ℬ(${labelType(type.base)})`;\n case TypeID.logic:\n return LOGIC_TYPE_NAME;\n case TypeID.predicate:\n case TypeID.function:\n const argsText = type.args.map(arg => labelType(arg.type)).join(', ');\n return `[${argsText}] → ${labelType(type.result)}`;\n }\n}\n\n/** Converts expression type to normalized string. */\nexport function normalizeType(type: ExpressionType | null): string {\n if (!type) {\n return 'N/A';\n }\n switch (type.typeID) {\n case TypeID.anyTypification:\n return ANY_TYPE_NAME;\n case TypeID.integer:\n case TypeID.basic:\n return 'X1';\n case TypeID.tuple:\n return type.factors\n .map(factor => (factor.typeID === TypeID.tuple ? `(${normalizeType(factor)})` : normalizeType(factor)))\n .join('×');\n case TypeID.collection:\n return type.base.typeID === TypeID.collection ? `ℬ${normalizeType(type.base)}` : `ℬ(${normalizeType(type.base)})`;\n case TypeID.logic:\n return LOGIC_TYPE_NAME;\n case TypeID.predicate:\n case TypeID.function:\n const argsText = type.args.map(arg => normalizeType(arg.type)).join(', ');\n return `[${argsText}] → ${normalizeType(type.result)}`;\n }\n}\n"],"mappings":";;;AAKA,MAAM,oBAAoB;AAC1B,MAAM,gBAAgB;AACtB,MAAM,kBAAkB;AAExB,MAAM,mBAAqD;EACxD,QAAQ,SAAS;EACjB,QAAQ,iBAAiB;EACzB,QAAQ,iBAAiB;EACzB,QAAQ,oBAAoB;EAC5B,QAAQ,iBAAiB;EACzB,QAAQ,YAAY;EACpB,QAAQ,YAAY;EACpB,QAAQ,WAAW;EACnB,QAAQ,oBAAoB;EAC5B,QAAQ,mBAAmB;EAC3B,QAAQ,eAAe;EACvB,QAAQ,oBAAoB;EAC5B,QAAQ,WAAW;EACnB,QAAQ,QAAQ;EAChB,QAAQ,WAAW;EACnB,QAAQ,gBAAgB;EACxB,QAAQ,eAAe;EACvB,QAAQ,SAAS;EACjB,QAAQ,aAAa;EACrB,QAAQ,eAAe;EACvB,QAAQ,SAAS;EACjB,QAAQ,aAAa;EACrB,QAAQ,mBAAmB;EAC3B,QAAQ,YAAY;EACpB,QAAQ,YAAY;EACpB,QAAQ,sBAAsB;EAC9B,QAAQ,UAAU;EAClB,QAAQ,sBAAsB;EAC9B,QAAQ,qBAAqB;EAC7B,QAAQ,oBAAoB;EAC5B,QAAQ,qBAAqB;EAC7B,QAAQ,QAAQ;EAChB,QAAQ,UAAU;EAClB,QAAQ,SAAS;EACjB,QAAQ,SAAS;EACjB,QAAQ,OAAO;EACf,QAAQ,OAAO;EACf,QAAQ,SAAS;EACjB,QAAQ,SAAS;EACjB,QAAQ,UAAU;AACrB;;AAGA,SAAgB,WAAW,IAAqB;CAE9C,OADa,iBAAiB,OACf,oBAAoB,OAAO,EAAE;AAC9C;;AAGA,SAAgB,gBAAgB,MAA2B;CAEzD,QAAQ,KAAK,QAAb;EACE,KAAK,QAAQ,OAAO,OAAO;EAC3B,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,YACX,OAAO,KAAK,KAAK;EAEnB,KAAK,QAAQ,aAAa,OAAO,OAAO,KAAK,KAAK,KAAK;EAEvD,KAAK,QAAQ,OAAO,OAAO,OAAQ,KAAK,KAAK,MAAmB,SAAS;EACzE,KAAK,QAAQ,SAAS,OAAO,OAAQ,KAAK,KAAK,MAAmB,SAAS;EAC3E,KAAK,QAAQ,QAAQ,OAAO,OAAQ,KAAK,KAAK,MAAmB,SAAS;EAE1E,KAAK,QAAQ,qBAAqB,OAAO;EACzC,KAAK,QAAQ,oBAAoB,OAAO;EACxC,KAAK,QAAQ,mBAAmB,OAAO;EACvC,KAAK,QAAQ,oBAAoB,OAAO;EAExC,KAAK,QAAQ,SAAS,OAAO;EAC7B,KAAK,QAAQ,QAAQ,OAAO;EAC5B,KAAK,QAAQ,MAAM,OAAO;EAC1B,KAAK,QAAQ,MAAM,OAAO;EAC1B,KAAK,QAAQ,QAAQ,OAAO;EAE5B,KAAK,QAAQ,MAAM,OAAO;EAC1B,KAAK,QAAQ,OAAO,OAAO;EAC3B,KAAK,QAAQ,UAAU,OAAO;EAC9B,KAAK,QAAQ,SAAS,OAAO;EAC7B,KAAK,QAAQ,QAAQ,OAAO;EAE5B,KAAK,QAAQ,UAAU,OAAO;EAC9B,KAAK,QAAQ,gBAAgB,OAAO;EAEpC,KAAK,QAAQ,cAAc,OAAO;EAClC,KAAK,QAAQ,eAAe,OAAO;EACnC,KAAK,QAAQ,oBAAoB,OAAO;EACxC,KAAK,QAAQ,oBAAoB,OAAO;EAExC,KAAK,QAAQ,aAAa,OAAO;EACjC,KAAK,QAAQ,cAAc,OAAO;EAClC,KAAK,QAAQ,cAAc,OAAO;EAElC,KAAK,QAAQ,oBAAoB,OAAO;EAExC,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,SACX,OAAO,WAAW,KAAK,MAAM;CACjC;CACA,IAAI,KAAK,KAAK,OACZ,OAAO,KAAK,KAAK;CAEnB,OAAO,mBAAmB,OAAO,KAAK,MAAM;AAC9C;;AAGA,SAAgB,UAAU,MAAqC;CAC7D,IAAI,CAAC,MACH,OAAO;CAET,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO,SACV,OAAO;EACT,KAAK,OAAO,OACV,OAAO,KAAK;EACd,KAAK,OAAO,OACV,OAAO,KAAK,QACT,KAAI,WAAW,OAAO,WAAW,OAAO,QAAQ,IAAI,UAAU,MAAM,EAAE,KAAK,UAAU,MAAM,CAAE,CAAC,CAC9F,KAAK,GAAG;EACb,KAAK,OAAO,YACV,OAAO,KAAK,KAAK,WAAW,OAAO,aAAa,IAAI,UAAU,KAAK,IAAI,MAAM,KAAK,UAAU,KAAK,IAAI,EAAE;EACzG,KAAK,OAAO,OACV,OAAO;EACT,KAAK,OAAO;EACZ,KAAK,OAAO,UAEV,OAAO,IADU,KAAK,KAAK,KAAI,QAAO,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IACrD,EAAS,MAAM,UAAU,KAAK,MAAM;CACnD;AACF;;AAGA,SAAgB,cAAc,MAAqC;CACjE,IAAI,CAAC,MACH,OAAO;CAET,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO;EACZ,KAAK,OAAO,OACV,OAAO;EACT,KAAK,OAAO,OACV,OAAO,KAAK,QACT,KAAI,WAAW,OAAO,WAAW,OAAO,QAAQ,IAAI,cAAc,MAAM,EAAE,KAAK,cAAc,MAAM,CAAE,CAAC,CACtG,KAAK,GAAG;EACb,KAAK,OAAO,YACV,OAAO,KAAK,KAAK,WAAW,OAAO,aAAa,IAAI,cAAc,KAAK,IAAI,MAAM,KAAK,cAAc,KAAK,IAAI,EAAE;EACjH,KAAK,OAAO,OACV,OAAO;EACT,KAAK,OAAO;EACZ,KAAK,OAAO,UAEV,OAAO,IADU,KAAK,KAAK,KAAI,QAAO,cAAc,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IACzD,EAAS,MAAM,cAAc,KAAK,MAAM;CACvD;AACF"}
1
+ {"version":3,"file":"labels.js","names":[],"sources":["../../src/rslang/labels.ts"],"sourcesContent":["import { type AstNodeBase } from '../parsing';\n\nimport { TokenID } from './parser/token';\nimport { type ExpressionType, TypeID } from './semantic/typification';\n\nconst INTEGER_TYPE_NAME = 'Z';\nconst ANY_TYPE_NAME = 'R0';\nconst LOGIC_TYPE_NAME = 'Logic';\n\nconst labelTokenRecord: Partial<Record<TokenID, string>> = {\n [TokenID.DECART]: '×',\n [TokenID.PUNCTUATION_PL]: '( )',\n [TokenID.PUNCTUATION_SL]: '[ ]',\n [TokenID.QUANTOR_UNIVERSAL]: '∀',\n [TokenID.QUANTOR_EXISTS]: '∃',\n [TokenID.LOGIC_NOT]: '¬',\n [TokenID.LOGIC_AND]: '&',\n [TokenID.LOGIC_OR]: '∨',\n [TokenID.LOGIC_IMPLICATION]: '⇒',\n [TokenID.LOGIC_EQUIVALENT]: '⇔',\n [TokenID.LIT_EMPTYSET]: '∅',\n [TokenID.LIT_WHOLE_NUMBERS]: 'Z',\n [TokenID.MULTIPLY]: '*',\n [TokenID.EQUAL]: '=',\n [TokenID.NOTEQUAL]: '≠',\n [TokenID.GREATER_OR_EQ]: '≥',\n [TokenID.LESSER_OR_EQ]: '≤',\n [TokenID.SET_IN]: '∈',\n [TokenID.SET_NOT_IN]: '∉',\n [TokenID.SUBSET_OR_EQ]: '⊆',\n [TokenID.SUBSET]: '⊂',\n [TokenID.NOT_SUBSET]: '⊄',\n [TokenID.SET_INTERSECTION]: '∩',\n [TokenID.SET_UNION]: '∪',\n [TokenID.SET_MINUS]: '\\\\',\n [TokenID.SET_SYMMETRIC_MINUS]: '∆',\n [TokenID.BOOLEAN]: 'ℬ()',\n [TokenID.NT_DECLARATIVE_EXPR]: 'D{}',\n [TokenID.NT_IMPERATIVE_EXPR]: 'I{}',\n [TokenID.NT_RECURSIVE_FULL]: 'R{}',\n [TokenID.NT_RECURSIVE_SHORT]: 'R{}',\n [TokenID.BIGPR]: 'Pr1()',\n [TokenID.SMALLPR]: 'pr1()',\n [TokenID.FILTER]: 'Fi1[]()',\n [TokenID.REDUCE]: 'red()',\n [TokenID.CARD]: 'card()',\n [TokenID.BOOL]: 'bool()',\n [TokenID.DEBOOL]: 'debool()',\n [TokenID.ASSIGN]: ':=',\n [TokenID.ITERATE]: ':∈'\n};\n\n/** Retrieves label for {@link TokenID}. */\nexport function labelToken(id: TokenID): string {\n const text = labelTokenRecord[id];\n return text ?? 'UNKNOWN TOKEN: ' + String(id);\n}\n\n/** Generates label for {@link AstNodeBase}. Unnormalized grammar nodes fall through to `node.data.value` (Lezer name). */\nexport function labelRSLangNode(node: AstNodeBase): string {\n // prettier-ignore\n switch (node.typeID) {\n case TokenID.ERROR: return '[ERROR]';\n case TokenID.ID_LOCAL:\n case TokenID.ID_GLOBAL:\n case TokenID.ID_FUNCTION:\n case TokenID.ID_PREDICATE:\n case TokenID.ID_RADICAL:\n return node.data.value as string;\n\n case TokenID.LIT_INTEGER: return String(node.data.value);\n\n case TokenID.BIGPR: return 'Pr' + (node.data.value as string[]).toString();\n case TokenID.SMALLPR: return 'pr' + (node.data.value as string[]).toString();\n case TokenID.FILTER: return 'Fi' + (node.data.value as string[]).toString();\n\n case TokenID.NT_DECLARATIVE_EXPR: return 'DECLARATIVE';\n case TokenID.NT_IMPERATIVE_EXPR: return 'IMPERATIVE';\n case TokenID.NT_RECURSIVE_FULL: return 'RECURSIVE';\n case TokenID.NT_RECURSIVE_SHORT: return 'RECURSIVE';\n\n case TokenID.BOOLEAN: return 'ℬ';\n case TokenID.REDUCE: return 'red';\n case TokenID.CARD: return 'card';\n case TokenID.BOOL: return 'bool';\n case TokenID.DEBOOL: return 'debool';\n\n case TokenID.PLUS: return '+';\n case TokenID.MINUS: return '-';\n case TokenID.MULTIPLY: return '*';\n case TokenID.GREATER: return '>';\n case TokenID.LESSER: return '<';\n\n case TokenID.NT_TUPLE: return 'TUPLE';\n case TokenID.NT_ENUMERATION: return 'ENUM';\n\n case TokenID.NT_ENUM_DECL: return 'ENUM_DECLARE';\n case TokenID.NT_TUPLE_DECL: return 'TUPLE_DECLARE';\n case TokenID.PUNCTUATION_DEFINE: return 'DEFINITION';\n case TokenID.PUNCTUATION_STRUCT: return 'STRUCTURE_DEFINE';\n\n case TokenID.NT_ARG_DECL: return 'ARG';\n case TokenID.NT_FUNC_CALL: return 'CALL';\n case TokenID.NT_ARGUMENTS: return 'ARGS';\n\n case TokenID.NT_FUNC_DEFINITION: return 'FUNCTION_DEFINE';\n\n case TokenID.DECART:\n case TokenID.QUANTOR_UNIVERSAL:\n case TokenID.QUANTOR_EXISTS:\n case TokenID.LOGIC_NOT:\n case TokenID.LOGIC_AND:\n case TokenID.LOGIC_OR:\n case TokenID.LOGIC_IMPLICATION:\n case TokenID.LOGIC_EQUIVALENT:\n case TokenID.LIT_EMPTYSET:\n case TokenID.LIT_WHOLE_NUMBERS:\n case TokenID.EQUAL:\n case TokenID.NOTEQUAL:\n case TokenID.GREATER_OR_EQ:\n case TokenID.LESSER_OR_EQ:\n case TokenID.SET_IN:\n case TokenID.SET_NOT_IN:\n case TokenID.SUBSET_OR_EQ:\n case TokenID.SUBSET:\n case TokenID.NOT_SUBSET:\n case TokenID.SET_INTERSECTION:\n case TokenID.SET_UNION:\n case TokenID.SET_MINUS:\n case TokenID.SET_SYMMETRIC_MINUS:\n case TokenID.ASSIGN:\n case TokenID.ITERATE:\n return labelToken(node.typeID);\n }\n if (node.data.value) {\n return node.data.value as string;\n }\n return 'UNKNOWN NODE: ' + String(node.typeID);\n}\n\n/** Formats a base-set alias for display (mangled radicals `func<R#>` → `<func>R#`). */\nexport function labelBaseId(baseID: string): string {\n const match = /^([^<]+)<(R[1-9]\\d*)>$/.exec(baseID);\n if (match) {\n return `<${match[1]}>${match[2]}`;\n }\n return baseID;\n}\n\n/** Converts expression type to string. */\nexport function labelType(type: ExpressionType | null): string {\n if (!type) {\n return 'N/A';\n }\n switch (type.typeID) {\n case TypeID.anyTypification:\n return ANY_TYPE_NAME;\n case TypeID.integer:\n return INTEGER_TYPE_NAME;\n case TypeID.basic:\n return labelBaseId(type.baseID);\n case TypeID.tuple:\n return type.factors\n .map(factor => (factor.typeID === TypeID.tuple ? `(${labelType(factor)})` : labelType(factor)))\n .join('×');\n case TypeID.collection:\n return type.base.typeID === TypeID.collection ? `ℬ${labelType(type.base)}` : `ℬ(${labelType(type.base)})`;\n case TypeID.logic:\n return LOGIC_TYPE_NAME;\n case TypeID.predicate:\n case TypeID.function:\n const argsText = type.args.map(arg => labelType(arg.type)).join(', ');\n return `[${argsText}] → ${labelType(type.result)}`;\n }\n}\n\n/** Converts expression type to normalized string. */\nexport function normalizeType(type: ExpressionType | null): string {\n if (!type) {\n return 'N/A';\n }\n switch (type.typeID) {\n case TypeID.anyTypification:\n return ANY_TYPE_NAME;\n case TypeID.integer:\n case TypeID.basic:\n return 'X1';\n case TypeID.tuple:\n return type.factors\n .map(factor => (factor.typeID === TypeID.tuple ? `(${normalizeType(factor)})` : normalizeType(factor)))\n .join('×');\n case TypeID.collection:\n return type.base.typeID === TypeID.collection ? `ℬ${normalizeType(type.base)}` : `ℬ(${normalizeType(type.base)})`;\n case TypeID.logic:\n return LOGIC_TYPE_NAME;\n case TypeID.predicate:\n case TypeID.function:\n const argsText = type.args.map(arg => normalizeType(arg.type)).join(', ');\n return `[${argsText}] → ${normalizeType(type.result)}`;\n }\n}\n"],"mappings":";;;AAKA,MAAM,oBAAoB;AAC1B,MAAM,gBAAgB;AACtB,MAAM,kBAAkB;AAExB,MAAM,mBAAqD;EACxD,QAAQ,SAAS;EACjB,QAAQ,iBAAiB;EACzB,QAAQ,iBAAiB;EACzB,QAAQ,oBAAoB;EAC5B,QAAQ,iBAAiB;EACzB,QAAQ,YAAY;EACpB,QAAQ,YAAY;EACpB,QAAQ,WAAW;EACnB,QAAQ,oBAAoB;EAC5B,QAAQ,mBAAmB;EAC3B,QAAQ,eAAe;EACvB,QAAQ,oBAAoB;EAC5B,QAAQ,WAAW;EACnB,QAAQ,QAAQ;EAChB,QAAQ,WAAW;EACnB,QAAQ,gBAAgB;EACxB,QAAQ,eAAe;EACvB,QAAQ,SAAS;EACjB,QAAQ,aAAa;EACrB,QAAQ,eAAe;EACvB,QAAQ,SAAS;EACjB,QAAQ,aAAa;EACrB,QAAQ,mBAAmB;EAC3B,QAAQ,YAAY;EACpB,QAAQ,YAAY;EACpB,QAAQ,sBAAsB;EAC9B,QAAQ,UAAU;EAClB,QAAQ,sBAAsB;EAC9B,QAAQ,qBAAqB;EAC7B,QAAQ,oBAAoB;EAC5B,QAAQ,qBAAqB;EAC7B,QAAQ,QAAQ;EAChB,QAAQ,UAAU;EAClB,QAAQ,SAAS;EACjB,QAAQ,SAAS;EACjB,QAAQ,OAAO;EACf,QAAQ,OAAO;EACf,QAAQ,SAAS;EACjB,QAAQ,SAAS;EACjB,QAAQ,UAAU;AACrB;;AAGA,SAAgB,WAAW,IAAqB;CAE9C,OADa,iBAAiB,OACf,oBAAoB,OAAO,EAAE;AAC9C;;AAGA,SAAgB,gBAAgB,MAA2B;CAEzD,QAAQ,KAAK,QAAb;EACE,KAAK,QAAQ,OAAO,OAAO;EAC3B,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,YACX,OAAO,KAAK,KAAK;EAEnB,KAAK,QAAQ,aAAa,OAAO,OAAO,KAAK,KAAK,KAAK;EAEvD,KAAK,QAAQ,OAAO,OAAO,OAAQ,KAAK,KAAK,MAAmB,SAAS;EACzE,KAAK,QAAQ,SAAS,OAAO,OAAQ,KAAK,KAAK,MAAmB,SAAS;EAC3E,KAAK,QAAQ,QAAQ,OAAO,OAAQ,KAAK,KAAK,MAAmB,SAAS;EAE1E,KAAK,QAAQ,qBAAqB,OAAO;EACzC,KAAK,QAAQ,oBAAoB,OAAO;EACxC,KAAK,QAAQ,mBAAmB,OAAO;EACvC,KAAK,QAAQ,oBAAoB,OAAO;EAExC,KAAK,QAAQ,SAAS,OAAO;EAC7B,KAAK,QAAQ,QAAQ,OAAO;EAC5B,KAAK,QAAQ,MAAM,OAAO;EAC1B,KAAK,QAAQ,MAAM,OAAO;EAC1B,KAAK,QAAQ,QAAQ,OAAO;EAE5B,KAAK,QAAQ,MAAM,OAAO;EAC1B,KAAK,QAAQ,OAAO,OAAO;EAC3B,KAAK,QAAQ,UAAU,OAAO;EAC9B,KAAK,QAAQ,SAAS,OAAO;EAC7B,KAAK,QAAQ,QAAQ,OAAO;EAE5B,KAAK,QAAQ,UAAU,OAAO;EAC9B,KAAK,QAAQ,gBAAgB,OAAO;EAEpC,KAAK,QAAQ,cAAc,OAAO;EAClC,KAAK,QAAQ,eAAe,OAAO;EACnC,KAAK,QAAQ,oBAAoB,OAAO;EACxC,KAAK,QAAQ,oBAAoB,OAAO;EAExC,KAAK,QAAQ,aAAa,OAAO;EACjC,KAAK,QAAQ,cAAc,OAAO;EAClC,KAAK,QAAQ,cAAc,OAAO;EAElC,KAAK,QAAQ,oBAAoB,OAAO;EAExC,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,SACX,OAAO,WAAW,KAAK,MAAM;CACjC;CACA,IAAI,KAAK,KAAK,OACZ,OAAO,KAAK,KAAK;CAEnB,OAAO,mBAAmB,OAAO,KAAK,MAAM;AAC9C;;AAGA,SAAgB,YAAY,QAAwB;CAClD,MAAM,QAAQ,yBAAyB,KAAK,MAAM;CAClD,IAAI,OACF,OAAO,IAAI,MAAM,GAAG,GAAG,MAAM;CAE/B,OAAO;AACT;;AAGA,SAAgB,UAAU,MAAqC;CAC7D,IAAI,CAAC,MACH,OAAO;CAET,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO,SACV,OAAO;EACT,KAAK,OAAO,OACV,OAAO,YAAY,KAAK,MAAM;EAChC,KAAK,OAAO,OACV,OAAO,KAAK,QACT,KAAI,WAAW,OAAO,WAAW,OAAO,QAAQ,IAAI,UAAU,MAAM,EAAE,KAAK,UAAU,MAAM,CAAE,CAAC,CAC9F,KAAK,GAAG;EACb,KAAK,OAAO,YACV,OAAO,KAAK,KAAK,WAAW,OAAO,aAAa,IAAI,UAAU,KAAK,IAAI,MAAM,KAAK,UAAU,KAAK,IAAI,EAAE;EACzG,KAAK,OAAO,OACV,OAAO;EACT,KAAK,OAAO;EACZ,KAAK,OAAO,UAEV,OAAO,IADU,KAAK,KAAK,KAAI,QAAO,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IACrD,EAAS,MAAM,UAAU,KAAK,MAAM;CACnD;AACF;;AAGA,SAAgB,cAAc,MAAqC;CACjE,IAAI,CAAC,MACH,OAAO;CAET,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO;EACZ,KAAK,OAAO,OACV,OAAO;EACT,KAAK,OAAO,OACV,OAAO,KAAK,QACT,KAAI,WAAW,OAAO,WAAW,OAAO,QAAQ,IAAI,cAAc,MAAM,EAAE,KAAK,cAAc,MAAM,CAAE,CAAC,CACtG,KAAK,GAAG;EACb,KAAK,OAAO,YACV,OAAO,KAAK,KAAK,WAAW,OAAO,aAAa,IAAI,cAAc,KAAK,IAAI,MAAM,KAAK,cAAc,KAAK,IAAI,EAAE;EACjH,KAAK,OAAO,OACV,OAAO;EACT,KAAK,OAAO;EACZ,KAAK,OAAO,UAEV,OAAO,IADU,KAAK,KAAK,KAAI,QAAO,cAAc,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IACzD,EAAS,MAAM,cAAc,KAAK,MAAM;CACvD;AACF"}