@rsconcept/domain 1.8.0 → 2.0.1

package/dist/library/rsmodel-api.js.map

@@ -1 +1 @@
-{"version":3,"file":"rsmodel-api.js","names":[],"sources":["../../src/library/rsmodel-api.ts"],"sourcesContent":["import { type ExpressionType, TypeID, type Typification, type Value } from '../rslang';\nimport { compare, tuple, TUPLE_ID, VALUE_TRUE, type ValuePath } from '../rslang/eval/value';\nimport { extractValue, isTupleValue, makeDefaultValue, setNestedValue } from '../rslang/eval/value-api';\nimport { type EchelonCollection } from '../rslang/semantic/typification';\n\nimport { type RSEngine } from './rsengine';\nimport { type Constituenta, CstType, type RSForm } from './rsform';\nimport { calculateSchemaStats, isBaseSet, isBasicConcept } from './rsform-api';\nimport { type BasicBinding, EvalStatus, type RSModelStats } from './rsmodel';\n\nconst RANDOM_INTEGER_MIN = -100;\nconst RANDOM_INTEGER_MAX = 100;\nconst DEFAULT_RANDOM_SET_ELEMENTS_COUNT = 5;\n\n/** Evaluate if parsed data is a basic binding data. */\nexport function validateBasicBindingData(data: unknown): data is Record<string, string> {\n  if (!data || typeof data !== 'object' || Array.isArray(data)) {\n    return false;\n  }\n  return Object.entries(data).every(([key, value]) => typeof value === 'string' && Number.isInteger(Number(key)));\n}\n\n/** Convert parsed data to a basic binding. */\nexport function toBasicBinding(data: Record<string | number, string>): BasicBinding {\n  const result: BasicBinding = {};\n  for (const [k, v] of Object.entries(data)) {\n    result[Number(k)] = v;\n  }\n  return result;\n}\n\n/** Evaluate if parsed data is a {@link Value} data. */\nexport function validateValueData(data: unknown): data is Value {\n  if (typeof data === 'number') {\n    return Number.isFinite(data);\n  }\n  if (!Array.isArray(data)) {\n    return false;\n  }\n  return data.every(item => validateValueData(item));\n}\n\nexport function generateRandomValue(\n  type: Typification,\n  basics: Map<number, BasicBinding>,\n  cstByAlias: Map<string, Constituenta>,\n  setElementsCount: number = DEFAULT_RANDOM_SET_ELEMENTS_COUNT\n): Value | null {\n  switch (type.typeID) {\n    case TypeID.integer:\n      return Math.floor(Math.random() * (RANDOM_INTEGER_MAX - RANDOM_INTEGER_MIN + 1)) + RANDOM_INTEGER_MIN;\n    case TypeID.basic: {\n      const cst = cstByAlias.get(type.baseID);\n      const binding = cst ? basics.get(cst.id) : undefined;\n      const ids = Object.keys(binding ?? {}).map(Number);\n      if (ids.length === 0) {\n        return null;\n      }\n      return ids[Math.floor(Math.random() * ids.length)];\n    }\n    case TypeID.tuple: {\n      const factors: Value[] = [];\n      for (const factor of type.factors) {\n        const sample = generateRandomValue(factor, basics, cstByAlias, setElementsCount);\n        if (sample === null) {\n          return null;\n        }\n        factors.push(sample);\n      }\n      return tuple(factors);\n    }\n    case TypeID.collection: {\n      const result: Value[] = [];\n      const randomElementsCount = Math.floor(Math.random() * (setElementsCount + 1));\n      for (let i = 0; i < randomElementsCount; i++) {\n        const sample = generateRandomValue(type.base, basics, cstByAlias, setElementsCount);\n        if (sample === null) {\n          return null;\n        }\n        result.push(sample);\n      }\n      return result;\n    }\n    case TypeID.anyTypification:\n      return null;\n  }\n}\n\n/** Calculate statistics for {@link RSModel}. */\nexport function calculateModelStats(schema: RSForm, engine: RSEngine, _engineGeneration?: number): RSModelStats {\n  const items = schema.items;\n  const statusByID = new Map<number, EvalStatus>();\n  for (const cst of items) {\n    statusByID.set(cst.id, engine.getCstStatus(cst.id));\n  }\n  return {\n    ...calculateSchemaStats(schema),\n    base_elements: items.reduce((sum, cst) => sum + countBaseElements(cst, engine), 0),\n    count_missing_base: items.reduce(\n      (sum, cst) => sum + (statusByID.get(cst.id) === EvalStatus.EMPTY && isBasicConcept(cst.cst_type) ? 1 : 0),\n      0\n    ),\n    count_false_axioms: items.reduce(\n      (sum, cst) => sum + (statusByID.get(cst.id) === EvalStatus.AXIOM_FALSE ? 1 : 0),\n      0\n    ),\n    count_invalid_data: items.reduce(\n      (sum, cst) => sum + (statusByID.get(cst.id) === EvalStatus.INVALID_DATA ? 1 : 0),\n      0\n    ),\n    count_invalid_calculations: items.reduce(\n      (sum, cst) =>\n        sum +\n        (statusByID.get(cst.id) === EvalStatus.EVAL_FAIL || statusByID.get(cst.id) === EvalStatus.NOT_PROCESSED\n          ? 1\n          : 0),\n      0\n    ),\n    count_empty_terms: items.reduce(\n      (sum, cst) => sum + (statusByID.get(cst.id) === EvalStatus.EMPTY && cst.cst_type === CstType.TERM ? 1 : 0),\n      0\n    )\n  };\n}\n\n/** Checks whether evaluation status contributes to model status issues. */\nexport function isModelIssue(engine: RSEngine, cst: Constituenta): boolean {\n  const status = engine.getCstStatus(cst.id);\n  const isBasic = isBasicConcept(cst.cst_type);\n  return (\n    status === EvalStatus.EVAL_FAIL ||\n    status === EvalStatus.AXIOM_FALSE ||\n    status === EvalStatus.INVALID_DATA ||\n    (isBasic && status === EvalStatus.EMPTY)\n  );\n}\n\n/** Evaluate if {@link CstType} is interpretable. */\nexport function isInterpretable(type: CstType): boolean {\n  switch (type) {\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n    case CstType.TERM:\n    case CstType.STATEMENT:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is inferrable. */\nexport function isInferrable(type: CstType): boolean {\n  switch (type) {\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n    case CstType.TERM:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return false;\n  }\n}\n\n/** Infers status of a given {@link Value} and {@link CstType}. */\nexport function inferEvalStatus(\n  value: Value | null,\n  cstType: CstType,\n  wasCalculated: boolean = true,\n  isInvalid: boolean = false\n): EvalStatus {\n  if (isBaseSet(cstType) || cstType === CstType.STRUCTURED) {\n    if (isInvalid) {\n      return EvalStatus.INVALID_DATA;\n    }\n    if (value === null || (Array.isArray(value) && value.length === 0)) {\n      return EvalStatus.EMPTY;\n    }\n    return EvalStatus.HAS_DATA;\n  }\n  if (!isInferrable(cstType)) {\n    return EvalStatus.NO_EVAL;\n  }\n  if (!wasCalculated) {\n    return EvalStatus.NOT_PROCESSED;\n  }\n  if (value === null) {\n    return EvalStatus.EVAL_FAIL;\n  }\n  if (cstType === CstType.AXIOM && value !== VALUE_TRUE) {\n    return EvalStatus.AXIOM_FALSE;\n  }\n  if (Array.isArray(value) && value.length === 0) {\n    return EvalStatus.EMPTY;\n  }\n  return EvalStatus.HAS_DATA;\n}\n\n/** Tries to fix value removing invalid base elements not present in the target value.\n * returns null if no fixing is possible.\n * returns true if fixing was successful.\n * returns false if fixing was not needed.\n */\nexport function tryFixValue(\n  value: Value,\n  type: ExpressionType,\n  targetAlias: string,\n  targetValue: Value[]\n): boolean | null {\n  switch (type.typeID) {\n    case TypeID.integer:\n      return false;\n    case TypeID.basic:\n      if (type.baseID !== targetAlias) {\n        return false;\n      }\n      if (typeof value !== 'number') {\n        return null;\n      }\n      if (!targetValue.includes(value)) {\n        return null;\n      }\n      return false;\n    case TypeID.tuple: {\n      if (!isTupleValue(value)) {\n        return null;\n      }\n      let wasChanged = false;\n      for (let i = 0; i < type.factors.length; i++) {\n        const componentChanged = tryFixValue(value[i + 1], type.factors[i], targetAlias, targetValue);\n        if (componentChanged === null) {\n          return null;\n        }\n        if (componentChanged) {\n          wasChanged = true;\n        }\n      }\n      return wasChanged;\n    }\n    case TypeID.collection:\n      if (!Array.isArray(value) || (value.length > 1 && value[0] === TUPLE_ID)) {\n        return null;\n      }\n      let wasChanged = false;\n      const removeElements: Value[] = [];\n      for (const item of value) {\n        const elementChanged = tryFixValue(item, type.base, targetAlias, targetValue);\n        if (elementChanged === null || elementChanged === true) {\n          wasChanged = true;\n          if (elementChanged === null) {\n            removeElements.push(item);\n          }\n        }\n      }\n      for (const item of removeElements) {\n        const index = value.indexOf(item);\n        if (index !== -1) {\n          value.splice(index, 1);\n        }\n      }\n      if (wasChanged) {\n        value.sort((a, b) => compare(a, b));\n        let i = 1;\n        while (i < value.length) {\n          if (compare(value[i], value[i - 1]) === 0) {\n            value.splice(i, 1);\n          } else {\n            i++;\n          }\n        }\n      }\n      return wasChanged;\n\n    case TypeID.logic:\n    case TypeID.anyTypification:\n    case TypeID.predicate:\n    case TypeID.function:\n      return null;\n  }\n}\n\nexport function updateValueElement(value: Value | null, path: ValuePath, newValue: number): Value | null {\n  return setNestedValue(value, path, newValue);\n}\n\nexport function deleteValueElement(\n  value: Value | null,\n  path: ValuePath,\n  type: Typification,\n  target: number\n): Value | null {\n  if (path.length === 0 && type.typeID !== TypeID.collection) {\n    return null;\n  }\n\n  const arrayValue = extractValue(value!, path)! as Value[];\n  const updatedArray = [...arrayValue.slice(0, target), ...arrayValue.slice(target + 1)];\n  return setNestedValue(value, path, updatedArray);\n}\n\nexport function addValueElement(\n  value: Value | null,\n  path: ValuePath,\n  type: Typification,\n  currentType: Typification\n): Value | null {\n  if (path.length === 0 && type.typeID !== TypeID.collection) {\n    return makeDefaultValue(type);\n  }\n\n  const newElem = makeDefaultValue((currentType as EchelonCollection).base);\n  const arrayValue = (extractValue(value!, path) as Value[] | null) ?? [];\n  const updatedArray = [newElem, ...arrayValue];\n  return setNestedValue(value, path, updatedArray);\n}\n\n// ========= Internal functions ==========\n\nfunction countBaseElements(cst: Constituenta, engine: RSEngine): number {\n  if (!isBasicConcept(cst.cst_type)) {\n    return 0;\n  }\n  const value = engine.getCstValue(cst.id);\n  if (value === null) {\n    return 0;\n  }\n  if (!Array.isArray(value) || value[0] === TUPLE_ID) {\n    return 1;\n  }\n  return value.length;\n}\n"],"mappings":";;;;;;;AAUA,MAAM,qBAAqB;AAE3B,MAAM,oCAAoC;;AAG1C,SAAgB,yBAAyB,MAA+C;CACtF,IAAI,CAAC,QAAQ,OAAO,SAAS,YAAY,MAAM,QAAQ,IAAI,GACzD,OAAO;CAET,OAAO,OAAO,QAAQ,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,WAAW,OAAO,UAAU,YAAY,OAAO,UAAU,OAAO,GAAG,CAAC,CAAC;AAChH;;AAGA,SAAgB,eAAe,MAAqD;CAClF,MAAM,SAAuB,CAAC;CAC9B,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,IAAI,GACtC,OAAO,OAAO,CAAC,KAAK;CAEtB,OAAO;AACT;;AAGA,SAAgB,kBAAkB,MAA8B;CAC9D,IAAI,OAAO,SAAS,UAClB,OAAO,OAAO,SAAS,IAAI;CAE7B,IAAI,CAAC,MAAM,QAAQ,IAAI,GACrB,OAAO;CAET,OAAO,KAAK,OAAM,SAAQ,kBAAkB,IAAI,CAAC;AACnD;AAEA,SAAgB,oBACd,MACA,QACA,YACA,mBAA2B,mCACb;CACd,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,SACV,OAAO,KAAK,MAAM,KAAK,OAAO,IAAK,GAA4C,IAAI;EACrF,KAAK,OAAO,OAAO;GACjB,MAAM,MAAM,WAAW,IAAI,KAAK,MAAM;GACtC,MAAM,UAAU,MAAM,OAAO,IAAI,IAAI,EAAE,IAAI;GAC3C,MAAM,MAAM,OAAO,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM;GACjD,IAAI,IAAI,WAAW,GACjB,OAAO;GAET,OAAO,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM;EAClD;EACA,KAAK,OAAO,OAAO;GACjB,MAAM,UAAmB,CAAC;GAC1B,KAAK,MAAM,UAAU,KAAK,SAAS;IACjC,MAAM,SAAS,oBAAoB,QAAQ,QAAQ,YAAY,gBAAgB;IAC/E,IAAI,WAAW,MACb,OAAO;IAET,QAAQ,KAAK,MAAM;GACrB;GACA,OAAO,MAAM,OAAO;EACtB;EACA,KAAK,OAAO,YAAY;GACtB,MAAM,SAAkB,CAAC;GACzB,MAAM,sBAAsB,KAAK,MAAM,KAAK,OAAO,KAAK,mBAAmB,EAAE;GAC7E,KAAK,IAAI,IAAI,GAAG,IAAI,qBAAqB,KAAK;IAC5C,MAAM,SAAS,oBAAoB,KAAK,MAAM,QAAQ,YAAY,gBAAgB;IAClF,IAAI,WAAW,MACb,OAAO;IAET,OAAO,KAAK,MAAM;GACpB;GACA,OAAO;EACT;EACA,KAAK,OAAO,iBACV,OAAO;CACX;AACF;;AAGA,SAAgB,oBAAoB,QAAgB,QAAkB,mBAA0C;CAC9G,MAAM,QAAQ,OAAO;CACrB,MAAM,6BAAa,IAAI,IAAwB;CAC/C,KAAK,MAAM,OAAO,OAChB,WAAW,IAAI,IAAI,IAAI,OAAO,aAAa,IAAI,EAAE,CAAC;CAEpD,OAAO;EACL,GAAG,qBAAqB,MAAM;EAC9B,eAAe,MAAM,QAAQ,KAAK,QAAQ,MAAM,kBAAkB,KAAK,MAAM,GAAG,CAAC;EACjF,oBAAoB,MAAM,QACvB,KAAK,QAAQ,OAAO,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,SAAS,eAAe,IAAI,QAAQ,IAAI,IAAI,IACvG,CACF;EACA,oBAAoB,MAAM,QACvB,KAAK,QAAQ,OAAO,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,cAAc,IAAI,IAC7E,CACF;EACA,oBAAoB,MAAM,QACvB,KAAK,QAAQ,OAAO,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,eAAe,IAAI,IAC9E,CACF;EACA,4BAA4B,MAAM,QAC/B,KAAK,QACJ,OACC,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,aAAa,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,gBACtF,IACA,IACN,CACF;EACA,mBAAmB,MAAM,QACtB,KAAK,QAAQ,OAAO,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,SAAS,IAAI,aAAa,QAAQ,OAAO,IAAI,IACxG,CACF;CACF;AACF;;AAGA,SAAgB,aAAa,QAAkB,KAA4B;CACzE,MAAM,SAAS,OAAO,aAAa,IAAI,EAAE;CACzC,MAAM,UAAU,eAAe,IAAI,QAAQ;CAC3C,OACE,WAAW,WAAW,aACtB,WAAW,WAAW,eACtB,WAAW,WAAW,gBACrB,WAAW,WAAW,WAAW;AAEtC;;AAGA,SAAgB,gBAAgB,MAAwB;CACtD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,aAAa,MAAwB;CACnD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,MACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,gBACd,OACA,SACA,gBAAyB,MACzB,YAAqB,OACT;CACZ,IAAI,UAAU,OAAO,KAAK,YAAY,QAAQ,YAAY;EACxD,IAAI,WACF,OAAO,WAAW;EAEpB,IAAI,UAAU,QAAS,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,GAC9D,OAAO,WAAW;EAEpB,OAAO,WAAW;CACpB;CACA,IAAI,CAAC,aAAa,OAAO,GACvB,OAAO,WAAW;CAEpB,IAAI,CAAC,eACH,OAAO,WAAW;CAEpB,IAAI,UAAU,MACZ,OAAO,WAAW;CAEpB,IAAI,YAAY,QAAQ,SAAS,UAAA,GAC/B,OAAO,WAAW;CAEpB,IAAI,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,GAC3C,OAAO,WAAW;CAEpB,OAAO,WAAW;AACpB;;;;;;AAOA,SAAgB,YACd,OACA,MACA,aACA,aACgB;CAChB,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,SACV,OAAO;EACT,KAAK,OAAO;GACV,IAAI,KAAK,WAAW,aAClB,OAAO;GAET,IAAI,OAAO,UAAU,UACnB,OAAO;GAET,IAAI,CAAC,YAAY,SAAS,KAAK,GAC7B,OAAO;GAET,OAAO;EACT,KAAK,OAAO,OAAO;GACjB,IAAI,CAAC,aAAa,KAAK,GACrB,OAAO;GAET,IAAI,aAAa;GACjB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KAAK;IAC5C,MAAM,mBAAmB,YAAY,MAAM,IAAI,IAAI,KAAK,QAAQ,IAAI,aAAa,WAAW;IAC5F,IAAI,qBAAqB,MACvB,OAAO;IAET,IAAI,kBACF,aAAa;GAEjB;GACA,OAAO;EACT;EACA,KAAK,OAAO;GACV,IAAI,CAAC,MAAM,QAAQ,KAAK,KAAM,MAAM,SAAS,KAAK,MAAM,OAAA,MACtD,OAAO;GAET,IAAI,aAAa;GACjB,MAAM,iBAA0B,CAAC;GACjC,KAAK,MAAM,QAAQ,OAAO;IACxB,MAAM,iBAAiB,YAAY,MAAM,KAAK,MAAM,aAAa,WAAW;IAC5E,IAAI,mBAAmB,QAAQ,mBAAmB,MAAM;KACtD,aAAa;KACb,IAAI,mBAAmB,MACrB,eAAe,KAAK,IAAI;IAE5B;GACF;GACA,KAAK,MAAM,QAAQ,gBAAgB;IACjC,MAAM,QAAQ,MAAM,QAAQ,IAAI;IAChC,IAAI,UAAU,IACZ,MAAM,OAAO,OAAO,CAAC;GAEzB;GACA,IAAI,YAAY;IACd,MAAM,MAAM,GAAG,MAAM,QAAQ,GAAG,CAAC,CAAC;IAClC,IAAI,IAAI;IACR,OAAO,IAAI,MAAM,QACf,IAAI,QAAQ,MAAM,IAAI,MAAM,IAAI,EAAE,MAAM,GACtC,MAAM,OAAO,GAAG,CAAC;SAEjB;GAGN;GACA,OAAO;EAET,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,UACV,OAAO;CACX;AACF;AAEA,SAAgB,mBAAmB,OAAqB,MAAiB,UAAgC;CACvG,OAAO,eAAe,OAAO,MAAM,QAAQ;AAC7C;AAEA,SAAgB,mBACd,OACA,MACA,MACA,QACc;CACd,IAAI,KAAK,WAAW,KAAK,KAAK,WAAW,OAAO,YAC9C,OAAO;CAGT,MAAM,aAAa,aAAa,OAAQ,IAAI;CAE5C,OAAO,eAAe,OAAO,MAAM,CADb,GAAG,WAAW,MAAM,GAAG,MAAM,GAAG,GAAG,WAAW,MAAM,SAAS,CAAC,CACjD,CAAY;AACjD;AAEA,SAAgB,gBACd,OACA,MACA,MACA,aACc;CACd,IAAI,KAAK,WAAW,KAAK,KAAK,WAAW,OAAO,YAC9C,OAAO,iBAAiB,IAAI;CAM9B,OAAO,eAAe,OAAO,MAAM,CAHnB,iBAAkB,YAAkC,IAE9C,GAAS,GADX,aAAa,OAAQ,IAAI,KAAwB,CAAC,CAEnC,CAAY;AACjD;AAIA,SAAS,kBAAkB,KAAmB,QAA0B;CACtE,IAAI,CAAC,eAAe,IAAI,QAAQ,GAC9B,OAAO;CAET,MAAM,QAAQ,OAAO,YAAY,IAAI,EAAE;CACvC,IAAI,UAAU,MACZ,OAAO;CAET,IAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,OAAA,MACjC,OAAO;CAET,OAAO,MAAM;AACf"}
+{"version":3,"file":"rsmodel-api.js","names":[],"sources":["../../src/library/rsmodel-api.ts"],"sourcesContent":["import { type ExpressionType, TypeID, type Typification, type Value } from '../rslang';\nimport { compare, tuple, TUPLE_ID, VALUE_TRUE, type ValuePath } from '../rslang/eval/value';\nimport { extractValue, isTupleValue, makeDefaultValue, setNestedValue } from '../rslang/eval/value-api';\nimport { type EchelonCollection } from '../rslang/semantic/typification';\n\nimport { modelStatusCstDiagnostic } from './diagnostics';\nimport { type RSEngine } from './rsengine';\nimport { type Constituenta, CstType, type RSForm } from './rsform';\nimport { calculateSchemaStats, isBaseSet, isBasicConcept } from './rsform-api';\nimport { type BasicBinding, EvalStatus, type RSModelStats } from './rsmodel';\n\nconst RANDOM_INTEGER_MIN = -100;\nconst RANDOM_INTEGER_MAX = 100;\nconst DEFAULT_RANDOM_SET_ELEMENTS_COUNT = 5;\n\n/** Evaluate if parsed data is a basic binding data. */\nexport function validateBasicBindingData(data: unknown): data is Record<string, string> {\n  if (!data || typeof data !== 'object' || Array.isArray(data)) {\n    return false;\n  }\n  return Object.entries(data).every(([key, value]) => typeof value === 'string' && Number.isInteger(Number(key)));\n}\n\n/** Convert parsed data to a basic binding. */\nexport function toBasicBinding(data: Record<string | number, string>): BasicBinding {\n  const result: BasicBinding = {};\n  for (const [k, v] of Object.entries(data)) {\n    result[Number(k)] = v;\n  }\n  return result;\n}\n\n/** Evaluate if parsed data is a {@link Value} data. */\nexport function validateValueData(data: unknown): data is Value {\n  if (typeof data === 'number') {\n    return Number.isFinite(data);\n  }\n  if (!Array.isArray(data)) {\n    return false;\n  }\n  return data.every(item => validateValueData(item));\n}\n\nexport function generateRandomValue(\n  type: Typification,\n  basics: Map<number, BasicBinding>,\n  cstByAlias: Map<string, Constituenta>,\n  setElementsCount: number = DEFAULT_RANDOM_SET_ELEMENTS_COUNT\n): Value | null {\n  switch (type.typeID) {\n    case TypeID.integer:\n      return Math.floor(Math.random() * (RANDOM_INTEGER_MAX - RANDOM_INTEGER_MIN + 1)) + RANDOM_INTEGER_MIN;\n    case TypeID.basic: {\n      const cst = cstByAlias.get(type.baseID);\n      const binding = cst ? basics.get(cst.id) : undefined;\n      const ids = Object.keys(binding ?? {}).map(Number);\n      if (ids.length === 0) {\n        return null;\n      }\n      return ids[Math.floor(Math.random() * ids.length)];\n    }\n    case TypeID.tuple: {\n      const factors: Value[] = [];\n      for (const factor of type.factors) {\n        const sample = generateRandomValue(factor, basics, cstByAlias, setElementsCount);\n        if (sample === null) {\n          return null;\n        }\n        factors.push(sample);\n      }\n      return tuple(factors);\n    }\n    case TypeID.collection: {\n      const result: Value[] = [];\n      const randomElementsCount = Math.floor(Math.random() * (setElementsCount + 1));\n      for (let i = 0; i < randomElementsCount; i++) {\n        const sample = generateRandomValue(type.base, basics, cstByAlias, setElementsCount);\n        if (sample === null) {\n          return null;\n        }\n        result.push(sample);\n      }\n      return result;\n    }\n    case TypeID.anyTypification:\n      return null;\n  }\n}\n\n/** Calculate statistics for {@link RSModel}. */\nexport function calculateModelStats(schema: RSForm, engine: RSEngine, _engineGeneration?: number): RSModelStats {\n  const items = schema.items;\n  const statusByID = new Map<number, EvalStatus>();\n  for (const cst of items) {\n    statusByID.set(cst.id, engine.getCstStatus(cst.id));\n  }\n  return {\n    ...calculateSchemaStats(schema),\n    base_elements: items.reduce((sum, cst) => sum + countBaseElements(cst, engine), 0),\n    count_missing_base: items.reduce(\n      (sum, cst) => sum + (statusByID.get(cst.id) === EvalStatus.EMPTY && isBasicConcept(cst.cst_type) ? 1 : 0),\n      0\n    ),\n    count_false_axioms: items.reduce(\n      (sum, cst) => sum + (statusByID.get(cst.id) === EvalStatus.AXIOM_FALSE ? 1 : 0),\n      0\n    ),\n    count_invalid_data: items.reduce(\n      (sum, cst) => sum + (statusByID.get(cst.id) === EvalStatus.INVALID_DATA ? 1 : 0),\n      0\n    ),\n    count_invalid_calculations: items.reduce(\n      (sum, cst) =>\n        sum +\n        (statusByID.get(cst.id) === EvalStatus.EVAL_FAIL || statusByID.get(cst.id) === EvalStatus.NOT_PROCESSED\n          ? 1\n          : 0),\n      0\n    ),\n    count_empty_terms: items.reduce(\n      (sum, cst) => sum + (statusByID.get(cst.id) === EvalStatus.EMPTY && cst.cst_type === CstType.TERM ? 1 : 0),\n      0\n    )\n  };\n}\n\n/** Checks whether evaluation status contributes to model status issues. */\nexport function isModelIssue(engine: RSEngine, cst: Constituenta): boolean {\n  return modelStatusCstDiagnostic(engine.getCstStatus(cst.id), cst.cst_type) !== null;\n}\n\n/** Evaluate if {@link CstType} is interpretable. */\nexport function isInterpretable(type: CstType): boolean {\n  switch (type) {\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n    case CstType.TERM:\n    case CstType.STATEMENT:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is inferrable. */\nexport function isInferrable(type: CstType): boolean {\n  switch (type) {\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n    case CstType.TERM:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return false;\n  }\n}\n\n/** Infers status of a given {@link Value} and {@link CstType}. */\nexport function inferEvalStatus(\n  value: Value | null,\n  cstType: CstType,\n  wasCalculated: boolean = true,\n  isInvalid: boolean = false\n): EvalStatus {\n  if (isBaseSet(cstType) || cstType === CstType.STRUCTURED) {\n    if (isInvalid) {\n      return EvalStatus.INVALID_DATA;\n    }\n    if (value === null || (Array.isArray(value) && value.length === 0)) {\n      return EvalStatus.EMPTY;\n    }\n    return EvalStatus.HAS_DATA;\n  }\n  if (!isInferrable(cstType)) {\n    return EvalStatus.NO_EVAL;\n  }\n  if (!wasCalculated) {\n    return EvalStatus.NOT_PROCESSED;\n  }\n  if (value === null) {\n    return EvalStatus.EVAL_FAIL;\n  }\n  if (cstType === CstType.AXIOM && value !== VALUE_TRUE) {\n    return EvalStatus.AXIOM_FALSE;\n  }\n  if (Array.isArray(value) && value.length === 0) {\n    return EvalStatus.EMPTY;\n  }\n  return EvalStatus.HAS_DATA;\n}\n\n/** Tries to fix value removing invalid base elements not present in the target value.\n * returns null if no fixing is possible.\n * returns true if fixing was successful.\n * returns false if fixing was not needed.\n */\nexport function tryFixValue(\n  value: Value,\n  type: ExpressionType,\n  targetAlias: string,\n  targetValue: Value[]\n): boolean | null {\n  switch (type.typeID) {\n    case TypeID.integer:\n      return false;\n    case TypeID.basic:\n      if (type.baseID !== targetAlias) {\n        return false;\n      }\n      if (typeof value !== 'number') {\n        return null;\n      }\n      if (!targetValue.includes(value)) {\n        return null;\n      }\n      return false;\n    case TypeID.tuple: {\n      if (!isTupleValue(value)) {\n        return null;\n      }\n      let wasChanged = false;\n      for (let i = 0; i < type.factors.length; i++) {\n        const componentChanged = tryFixValue(value[i + 1], type.factors[i], targetAlias, targetValue);\n        if (componentChanged === null) {\n          return null;\n        }\n        if (componentChanged) {\n          wasChanged = true;\n        }\n      }\n      return wasChanged;\n    }\n    case TypeID.collection:\n      if (!Array.isArray(value) || (value.length > 1 && value[0] === TUPLE_ID)) {\n        return null;\n      }\n      let wasChanged = false;\n      const removeElements: Value[] = [];\n      for (const item of value) {\n        const elementChanged = tryFixValue(item, type.base, targetAlias, targetValue);\n        if (elementChanged === null || elementChanged === true) {\n          wasChanged = true;\n          if (elementChanged === null) {\n            removeElements.push(item);\n          }\n        }\n      }\n      for (const item of removeElements) {\n        const index = value.indexOf(item);\n        if (index !== -1) {\n          value.splice(index, 1);\n        }\n      }\n      if (wasChanged) {\n        value.sort((a, b) => compare(a, b));\n        let i = 1;\n        while (i < value.length) {\n          if (compare(value[i], value[i - 1]) === 0) {\n            value.splice(i, 1);\n          } else {\n            i++;\n          }\n        }\n      }\n      return wasChanged;\n\n    case TypeID.logic:\n    case TypeID.anyTypification:\n    case TypeID.predicate:\n    case TypeID.function:\n      return null;\n  }\n}\n\nexport function updateValueElement(value: Value | null, path: ValuePath, newValue: number): Value | null {\n  return setNestedValue(value, path, newValue);\n}\n\nexport function deleteValueElement(\n  value: Value | null,\n  path: ValuePath,\n  type: Typification,\n  target: number\n): Value | null {\n  if (path.length === 0 && type.typeID !== TypeID.collection) {\n    return null;\n  }\n\n  const arrayValue = extractValue(value!, path)! as Value[];\n  const updatedArray = [...arrayValue.slice(0, target), ...arrayValue.slice(target + 1)];\n  return setNestedValue(value, path, updatedArray);\n}\n\nexport function addValueElement(\n  value: Value | null,\n  path: ValuePath,\n  type: Typification,\n  currentType: Typification\n): Value | null {\n  if (path.length === 0 && type.typeID !== TypeID.collection) {\n    return makeDefaultValue(type);\n  }\n\n  const newElem = makeDefaultValue((currentType as EchelonCollection).base);\n  const arrayValue = (extractValue(value!, path) as Value[] | null) ?? [];\n  const updatedArray = [newElem, ...arrayValue];\n  return setNestedValue(value, path, updatedArray);\n}\n\n// ========= Internal functions ==========\n\nfunction countBaseElements(cst: Constituenta, engine: RSEngine): number {\n  if (!isBasicConcept(cst.cst_type)) {\n    return 0;\n  }\n  const value = engine.getCstValue(cst.id);\n  if (value === null) {\n    return 0;\n  }\n  if (!Array.isArray(value) || value[0] === TUPLE_ID) {\n    return 1;\n  }\n  return value.length;\n}\n"],"mappings":";;;;;;;AAWA,MAAM,qBAAqB;AAE3B,MAAM,oCAAoC;;AAG1C,SAAgB,yBAAyB,MAA+C;CACtF,IAAI,CAAC,QAAQ,OAAO,SAAS,YAAY,MAAM,QAAQ,IAAI,GACzD,OAAO;CAET,OAAO,OAAO,QAAQ,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,WAAW,OAAO,UAAU,YAAY,OAAO,UAAU,OAAO,GAAG,CAAC,CAAC;AAChH;;AAGA,SAAgB,eAAe,MAAqD;CAClF,MAAM,SAAuB,CAAC;CAC9B,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,IAAI,GACtC,OAAO,OAAO,CAAC,KAAK;CAEtB,OAAO;AACT;;AAGA,SAAgB,kBAAkB,MAA8B;CAC9D,IAAI,OAAO,SAAS,UAClB,OAAO,OAAO,SAAS,IAAI;CAE7B,IAAI,CAAC,MAAM,QAAQ,IAAI,GACrB,OAAO;CAET,OAAO,KAAK,OAAM,SAAQ,kBAAkB,IAAI,CAAC;AACnD;AAEA,SAAgB,oBACd,MACA,QACA,YACA,mBAA2B,mCACb;CACd,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,SACV,OAAO,KAAK,MAAM,KAAK,OAAO,IAAK,GAA4C,IAAI;EACrF,KAAK,OAAO,OAAO;GACjB,MAAM,MAAM,WAAW,IAAI,KAAK,MAAM;GACtC,MAAM,UAAU,MAAM,OAAO,IAAI,IAAI,EAAE,IAAI;GAC3C,MAAM,MAAM,OAAO,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM;GACjD,IAAI,IAAI,WAAW,GACjB,OAAO;GAET,OAAO,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM;EAClD;EACA,KAAK,OAAO,OAAO;GACjB,MAAM,UAAmB,CAAC;GAC1B,KAAK,MAAM,UAAU,KAAK,SAAS;IACjC,MAAM,SAAS,oBAAoB,QAAQ,QAAQ,YAAY,gBAAgB;IAC/E,IAAI,WAAW,MACb,OAAO;IAET,QAAQ,KAAK,MAAM;GACrB;GACA,OAAO,MAAM,OAAO;EACtB;EACA,KAAK,OAAO,YAAY;GACtB,MAAM,SAAkB,CAAC;GACzB,MAAM,sBAAsB,KAAK,MAAM,KAAK,OAAO,KAAK,mBAAmB,EAAE;GAC7E,KAAK,IAAI,IAAI,GAAG,IAAI,qBAAqB,KAAK;IAC5C,MAAM,SAAS,oBAAoB,KAAK,MAAM,QAAQ,YAAY,gBAAgB;IAClF,IAAI,WAAW,MACb,OAAO;IAET,OAAO,KAAK,MAAM;GACpB;GACA,OAAO;EACT;EACA,KAAK,OAAO,iBACV,OAAO;CACX;AACF;;AAGA,SAAgB,oBAAoB,QAAgB,QAAkB,mBAA0C;CAC9G,MAAM,QAAQ,OAAO;CACrB,MAAM,6BAAa,IAAI,IAAwB;CAC/C,KAAK,MAAM,OAAO,OAChB,WAAW,IAAI,IAAI,IAAI,OAAO,aAAa,IAAI,EAAE,CAAC;CAEpD,OAAO;EACL,GAAG,qBAAqB,MAAM;EAC9B,eAAe,MAAM,QAAQ,KAAK,QAAQ,MAAM,kBAAkB,KAAK,MAAM,GAAG,CAAC;EACjF,oBAAoB,MAAM,QACvB,KAAK,QAAQ,OAAO,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,SAAS,eAAe,IAAI,QAAQ,IAAI,IAAI,IACvG,CACF;EACA,oBAAoB,MAAM,QACvB,KAAK,QAAQ,OAAO,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,cAAc,IAAI,IAC7E,CACF;EACA,oBAAoB,MAAM,QACvB,KAAK,QAAQ,OAAO,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,eAAe,IAAI,IAC9E,CACF;EACA,4BAA4B,MAAM,QAC/B,KAAK,QACJ,OACC,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,aAAa,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,gBACtF,IACA,IACN,CACF;EACA,mBAAmB,MAAM,QACtB,KAAK,QAAQ,OAAO,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,SAAS,IAAI,aAAa,QAAQ,OAAO,IAAI,IACxG,CACF;CACF;AACF;;AAGA,SAAgB,aAAa,QAAkB,KAA4B;CACzE,OAAO,yBAAyB,OAAO,aAAa,IAAI,EAAE,GAAG,IAAI,QAAQ,MAAM;AACjF;;AAGA,SAAgB,gBAAgB,MAAwB;CACtD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,aAAa,MAAwB;CACnD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,MACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,gBACd,OACA,SACA,gBAAyB,MACzB,YAAqB,OACT;CACZ,IAAI,UAAU,OAAO,KAAK,YAAY,QAAQ,YAAY;EACxD,IAAI,WACF,OAAO,WAAW;EAEpB,IAAI,UAAU,QAAS,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,GAC9D,OAAO,WAAW;EAEpB,OAAO,WAAW;CACpB;CACA,IAAI,CAAC,aAAa,OAAO,GACvB,OAAO,WAAW;CAEpB,IAAI,CAAC,eACH,OAAO,WAAW;CAEpB,IAAI,UAAU,MACZ,OAAO,WAAW;CAEpB,IAAI,YAAY,QAAQ,SAAS,UAAA,GAC/B,OAAO,WAAW;CAEpB,IAAI,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,GAC3C,OAAO,WAAW;CAEpB,OAAO,WAAW;AACpB;;;;;;AAOA,SAAgB,YACd,OACA,MACA,aACA,aACgB;CAChB,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO,SACV,OAAO;EACT,KAAK,OAAO;GACV,IAAI,KAAK,WAAW,aAClB,OAAO;GAET,IAAI,OAAO,UAAU,UACnB,OAAO;GAET,IAAI,CAAC,YAAY,SAAS,KAAK,GAC7B,OAAO;GAET,OAAO;EACT,KAAK,OAAO,OAAO;GACjB,IAAI,CAAC,aAAa,KAAK,GACrB,OAAO;GAET,IAAI,aAAa;GACjB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KAAK;IAC5C,MAAM,mBAAmB,YAAY,MAAM,IAAI,IAAI,KAAK,QAAQ,IAAI,aAAa,WAAW;IAC5F,IAAI,qBAAqB,MACvB,OAAO;IAET,IAAI,kBACF,aAAa;GAEjB;GACA,OAAO;EACT;EACA,KAAK,OAAO;GACV,IAAI,CAAC,MAAM,QAAQ,KAAK,KAAM,MAAM,SAAS,KAAK,MAAM,OAAA,MACtD,OAAO;GAET,IAAI,aAAa;GACjB,MAAM,iBAA0B,CAAC;GACjC,KAAK,MAAM,QAAQ,OAAO;IACxB,MAAM,iBAAiB,YAAY,MAAM,KAAK,MAAM,aAAa,WAAW;IAC5E,IAAI,mBAAmB,QAAQ,mBAAmB,MAAM;KACtD,aAAa;KACb,IAAI,mBAAmB,MACrB,eAAe,KAAK,IAAI;IAE5B;GACF;GACA,KAAK,MAAM,QAAQ,gBAAgB;IACjC,MAAM,QAAQ,MAAM,QAAQ,IAAI;IAChC,IAAI,UAAU,IACZ,MAAM,OAAO,OAAO,CAAC;GAEzB;GACA,IAAI,YAAY;IACd,MAAM,MAAM,GAAG,MAAM,QAAQ,GAAG,CAAC,CAAC;IAClC,IAAI,IAAI;IACR,OAAO,IAAI,MAAM,QACf,IAAI,QAAQ,MAAM,IAAI,MAAM,IAAI,EAAE,MAAM,GACtC,MAAM,OAAO,GAAG,CAAC;SAEjB;GAGN;GACA,OAAO;EAET,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,UACV,OAAO;CACX;AACF;AAEA,SAAgB,mBAAmB,OAAqB,MAAiB,UAAgC;CACvG,OAAO,eAAe,OAAO,MAAM,QAAQ;AAC7C;AAEA,SAAgB,mBACd,OACA,MACA,MACA,QACc;CACd,IAAI,KAAK,WAAW,KAAK,KAAK,WAAW,OAAO,YAC9C,OAAO;CAGT,MAAM,aAAa,aAAa,OAAQ,IAAI;CAE5C,OAAO,eAAe,OAAO,MAAM,CADb,GAAG,WAAW,MAAM,GAAG,MAAM,GAAG,GAAG,WAAW,MAAM,SAAS,CAAC,CACjD,CAAY;AACjD;AAEA,SAAgB,gBACd,OACA,MACA,MACA,aACc;CACd,IAAI,KAAK,WAAW,KAAK,KAAK,WAAW,OAAO,YAC9C,OAAO,iBAAiB,IAAI;CAM9B,OAAO,eAAe,OAAO,MAAM,CAHnB,iBAAkB,YAAkC,IAE9C,GAAS,GADX,aAAa,OAAQ,IAAI,KAAwB,CAAC,CAEnC,CAAY;AACjD;AAIA,SAAS,kBAAkB,KAAmB,QAA0B;CACtE,IAAI,CAAC,eAAe,IAAI,QAAQ,GAC9B,OAAO;CAET,MAAM,QAAQ,OAAO,YAAY,IAAI,EAAE;CACvC,IAAI,UAAU,MACZ,OAAO;CAET,IAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,OAAA,MACjC,OAAO;CAET,OAAO,MAAM;AACf"}

package/dist/library/rsmodel.d.ts

@@ -1,46 +1,2 @@
-import { r as LibraryItem } from "../library-CYun28Xz.js";
-import { l as Value } from "../value-BduA_ZGp.js";
-import { RSFormStats } from "./rsform.js";
-
-//#region src/library/rsmodel.d.ts
-declare const TYPE_BASIC = "basic";
-/** Evaluation status enumeration. */
-declare const EvalStatus: {
-  readonly NO_EVAL: 1;
-  readonly NOT_PROCESSED: 2;
-  readonly INVALID_DATA: 3;
-  readonly EVAL_FAIL: 4;
-  readonly AXIOM_FALSE: 5;
-  readonly EMPTY: 6;
-  readonly HAS_DATA: 7;
-};
-type EvalStatus = (typeof EvalStatus)[keyof typeof EvalStatus];
-/** Represents basic element binding. */
-type BasicBinding = Record<number, string>;
-/** Represents {@link RSModel} basic sets binding. */
-type BasicsContext = Map<number, BasicBinding>;
-/** Default value for structured data. */
-declare const DEFAULT_VALUE_TEXT = "N/A";
-interface RSModelData extends LibraryItem {
-  editors: number[];
-  schema: number;
-  items: {
-    id: number;
-    type: string;
-    value: Value | BasicBinding;
-  }[];
-}
-/** Represents {@link RSModel} structured data. */
-type RSModel = RSModelData;
-/** Represents {@link RSModel} statistics. */
-interface RSModelStats extends RSFormStats {
-  count_missing_base: number;
-  count_false_axioms: number;
-  count_invalid_data: number;
-  count_invalid_calculations: number;
-  count_empty_terms: number;
-  base_elements: number;
-}
-//#endregion
-export { BasicBinding, BasicsContext, DEFAULT_VALUE_TEXT, EvalStatus, RSModel, RSModelStats, TYPE_BASIC };
-//# sourceMappingURL=rsmodel.d.ts.map
+import { c as BasicsContext, d as RSModel, f as RSModelStats, l as DEFAULT_VALUE_TEXT, p as TYPE_BASIC, s as BasicBinding, u as EvalStatus } from "../diagnostics-Clo3mkba.js";
+export { BasicBinding, BasicsContext, DEFAULT_VALUE_TEXT, EvalStatus, RSModel, RSModelStats, TYPE_BASIC };

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

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

package/dist/library/structure-planner.js

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

package/dist/rslang/api.d.ts

@@ -1,5 +1,5 @@
 import { t as AstNode } from "../ast-C8sIpKdL.js";
-import { n as ArgumentsType } from "../arguments-extractor-Dd1lFom9.js";
+import { n as ArgumentsType } from "../arguments-extractor-ngatANBI.js";
 import { t as generateExpressionFromAst } from "../expression-generator-CoucLIkE.js";
 
 //#region src/rslang/api.d.ts

package/dist/rslang/api.js

@@ -11,11 +11,12 @@ import { generateExpressionFromAst } from "./parser/expression-generator.js";
 const LOCALS_REGEXP = /[_a-zα-ω][a-zα-ω]*\d*/g;
 const GLOBAL_ALIAS_SOURCE = "[XCSADFPTN]\\d+";
 const GLOBALS_REGEXP = new RegExp(GLOBAL_ALIAS_SOURCE, "g");
+const GLOBAL_ALIAS_ANCHORED_REGEXP = new RegExp(`^${GLOBAL_ALIAS_SOURCE}$`);
 const COMPLEX_SYMBOLS_REGEXP = /[∀∃×ℬ;|:]/g;
 const TYPIFICATION_SET = /^ℬ+\([ℬ\(((X|C)\d+|Z)\)×]*\)$/g;
 /** Whether {@link value} is a single schema global alias (e.g. `X1`, `F42`). */
 function isGlobalAlias(value) {
-	return new RegExp(`^${GLOBAL_ALIAS_SOURCE}$`).test(value);
+	return GLOBAL_ALIAS_ANCHORED_REGEXP.test(value);
 }
 /**
 * Parse a RSLang expression into a normalized AST.

package/dist/rslang/api.js.map

@@ -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"}
+{"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"}

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

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

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

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

package/dist/rslang/eval/evaluator.js

@@ -1,9 +1,9 @@
-import { annotateError } from "../ast-annotations.js";
-import { RSErrorCode } from "../error.js";
 import { getNodeIndices, getNodeText } from "../../parsing/ast.js";
 import "../../parsing/index.js";
 import { TokenID } from "../parser/token.js";
 import { labelRSLangNode } from "../labels.js";
+import { annotateError } from "../ast-annotations.js";
+import { RSErrorCode } from "../error.js";
 import { EvaluationCache, EvaluationMetadata } from "./evaluation-cache.js";
 import { A as setUnion, D as setIntersection, E as setDiff, T as reduce, a as SET_INFINITY, d as set, f as tuple, h as contains, k as setSymDiff, l as compare, m as cartesianProduct, n as CalcInvalidDataError, p as boolean, r as EmptySetV, w as projection, y as isSubsetOrEq } from "../../value-COprb2Je.js";
 //#region src/rslang/eval/evaluator.ts

package/dist/rslang/eval/value-api.d.ts

@@ -1,2 +1,2 @@
-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";
+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";
 export { boolean, cartesianProduct, contains, convertPathToType, extractValue, isSetValue, isSubsetOrEq, isTupleValue, makeDefaultValue, normalizeValue, printValue, projection, reduce, setDiff, setIntersection, setNestedValue, setSymDiff, setUnion, testInvalid, validateValue, valueStub };

package/dist/rslang/index.d.ts

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

package/dist/rslang/index.js

@@ -1,7 +1,7 @@
-import { readErrorAnnotation, readTypeAnnotation } from "./ast-annotations.js";
-import { RSErrorCode } from "./error.js";
 import { TokenID } from "./parser/token.js";
 import { AnyTypificationT, EmptySetT, LogicT, TypeClass, TypeID, makeTypePath } from "./semantic/typification.js";
+import { readErrorAnnotation, readTypeAnnotation } from "./ast-annotations.js";
+import { RSErrorCode } from "./error.js";
 import { C as printValue, u as makeValuePath } from "../value-COprb2Je.js";
 import { RSCalculator } from "./eval/calculator.js";
 import { parser } from "./parser/parser.js";

package/dist/rslang/labels.d.ts

@@ -1,5 +1,5 @@
 import { n as AstNodeBase } from "../ast-C8sIpKdL.js";
-import { f as ExpressionType } from "../typification-DDuv88ir.js";
+import { f as ExpressionType } from "../typification-9lNu9R4k.js";
 import { t as TokenID } from "../token-DeXAmzwr.js";
 
 //#region src/rslang/labels.d.ts
@@ -7,10 +7,12 @@ import { t as TokenID } from "../token-DeXAmzwr.js";
 declare function labelToken(id: TokenID): string;
 /** Generates label for {@link AstNodeBase}. Unnormalized grammar nodes fall through to `node.data.value` (Lezer name). */
 declare function labelRSLangNode(node: AstNodeBase): string;
+/** Formats a base-set alias for display (mangled radicals `func<R#>` → `<func>R#`). */
+declare function labelBaseId(baseID: string): string;
 /** Converts expression type to string. */
 declare function labelType(type: ExpressionType | null): string;
 /** Converts expression type to normalized string. */
 declare function normalizeType(type: ExpressionType | null): string;
 //#endregion
-export { labelRSLangNode, labelToken, labelType, normalizeType };
+export { labelBaseId, labelRSLangNode, labelToken, labelType, normalizeType };
 //# sourceMappingURL=labels.d.ts.map

package/dist/rslang/labels.js

@@ -116,13 +116,19 @@ function labelRSLangNode(node) {
 	if (node.data.value) return node.data.value;
 	return "UNKNOWN NODE: " + String(node.typeID);
 }
+/** Formats a base-set alias for display (mangled radicals `func<R#>` → `<func>R#`). */
+function labelBaseId(baseID) {
+	const match = /^([^<]+)<(R[1-9]\d*)>$/.exec(baseID);
+	if (match) return `<${match[1]}>${match[2]}`;
+	return baseID;
+}
 /** Converts expression type to string. */
 function labelType(type) {
 	if (!type) return "N/A";
 	switch (type.typeID) {
 		case TypeID.anyTypification: return ANY_TYPE_NAME;
 		case TypeID.integer: return INTEGER_TYPE_NAME;
-		case TypeID.basic: return type.baseID;
+		case TypeID.basic: return labelBaseId(type.baseID);
 		case TypeID.tuple: return type.factors.map((factor) => factor.typeID === TypeID.tuple ? `(${labelType(factor)})` : labelType(factor)).join("×");
 		case TypeID.collection: return type.base.typeID === TypeID.collection ? `ℬ${labelType(type.base)}` : `ℬ(${labelType(type.base)})`;
 		case TypeID.logic: return LOGIC_TYPE_NAME;
@@ -145,6 +151,6 @@ function normalizeType(type) {
 	}
 }
 //#endregion
-export { labelRSLangNode, labelToken, labelType, normalizeType };
+export { labelBaseId, labelRSLangNode, labelToken, labelType, normalizeType };
 
 //# sourceMappingURL=labels.js.map

package/dist/rslang/labels.js.map

@@ -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"}
+{"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"}

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

@@ -1,5 +1,5 @@
 import { t as AstNode } from "../../../ast-C8sIpKdL.js";
-import { g as TypeClass } from "../../../typification-DDuv88ir.js";
+import { g as TypeClass } from "../../../typification-9lNu9R4k.js";
 import { t as ErrorReporter } from "../../../error-CzIbnP-N.js";
 
 //#region src/rslang/parser/syntax-errors/index.d.ts

package/dist/rslang/parser/syntax-errors/index.js

@@ -1,2 +1,2 @@
-import { t as extractSyntaxErrors } from "../../../syntax-errors-B6c2vsan.js";
+import { t as extractSyntaxErrors } from "../../../syntax-errors-D_VV5hAM.js";
 export { extractSyntaxErrors };

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

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

package/dist/rslang/semantic/analyzer.js

@@ -1,10 +1,10 @@
-import { annotateError } from "../ast-annotations.js";
-import { RSErrorCode } from "../error.js";
 import { TokenID } from "../parser/token.js";
 import { TypeID, basic, bool, constant, debool } from "./typification.js";
 import { labelType } from "../labels.js";
+import { annotateError } from "../ast-annotations.js";
+import { RSErrorCode } from "../error.js";
 import { parseRSLangExpression } from "../api.js";
-import { t as extractSyntaxErrors } from "../../syntax-errors-B6c2vsan.js";
+import { t as extractSyntaxErrors } from "../../syntax-errors-D_VV5hAM.js";
 import { getTypeClass } from "./typification-api.js";
 import { TypeAuditor } from "./type-auditor.js";
 import { ValueClass } from "./value-class.js";

package/dist/rslang/semantic/arguments-extractor.d.ts

@@ -1,2 +1,2 @@
-import { n as ArgumentsType, t as ArgumentsExtractor } from "../../arguments-extractor-Dd1lFom9.js";
+import { n as ArgumentsType, t as ArgumentsExtractor } from "../../arguments-extractor-ngatANBI.js";
 export { ArgumentsExtractor, ArgumentsType };

package/dist/rslang/semantic/arguments-extractor.js

@@ -1,7 +1,7 @@
-import { readTypeAnnotation } from "../ast-annotations.js";
 import { getNodeText } from "../../parsing/ast.js";
 import "../../parsing/index.js";
 import { TokenID } from "../parser/token.js";
+import { readTypeAnnotation } from "../ast-annotations.js";
 //#region src/rslang/semantic/arguments-extractor.ts
 /**
 * Module: Type auditor for AST type checking.

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

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

package/dist/rslang/semantic/type-auditor.js

@@ -1,10 +1,10 @@
-import { annotateError, annotateType } from "../ast-annotations.js";
-import { RSErrorCode } from "../error.js";
 import { getNodeIndices, getNodeText } from "../../parsing/ast.js";
 import "../../parsing/index.js";
 import { TokenID } from "../parser/token.js";
-import { EmptySetT, IntegerT, LogicT, TypeID, bool, component, debool, isTemplateRadical, isTypification, mangleRadicalId, tuple } from "./typification.js";
+import { EmptySetT, IntegerT, LogicT, TypeID, bool, component, debool, isTemplateRadical, isTypification, mangleParamAlias, mangleRadicalId, tuple } from "./typification.js";
 import { labelRSLangNode, labelToken, labelType } from "../labels.js";
+import { annotateError, annotateType } from "../ast-annotations.js";
+import { RSErrorCode } from "../error.js";
 import { checkCompatibility, checkEquality, cloneTypification, compareTemplated, hasGenerics, mergeTypifications, substituteBase } from "./typification-api.js";
 //#region src/rslang/semantic/type-auditor.ts
 /**
@@ -609,7 +609,7 @@ var TypeAuditor = class TypeAuditor {
 			if (!compareTemplated(substitutes, argType, childType)) {
 				const expectedType = cloneTypification(argType);
 				if (substitutes.size > 0) substituteBase(expectedType, substitutes);
-				this.onError(RSErrorCode.invalidArgumentType, node.children[child], [`${type.args[child - 1].alias}∈${labelType(expectedType)}`, labelType(childType)]);
+				this.onError(RSErrorCode.invalidArgumentType, node.children[child], [`${mangleParamAlias(type.args[child - 1].alias, alias)}∈${labelType(expectedType)}`, labelType(childType)]);
 				return null;
 			}
 		}