@rsconcept/domain 1.0.0 → 1.2.0

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

@@ -1 +1 @@
-{"version":3,"sources":["../../src/parsing/ast.ts","../../src/rslang/parser/token.ts","../../src/rslang/semantic/typification.ts","../../src/rslang/eval/value-api.ts","../../src/rslang/eval/value.ts","../../src/rslang/parser/parser.ts","../../src/rslang/parser/parser.terms.ts","../../src/rslang/parser/normalize.ts","../../src/rslang/labels.ts","../../src/rslang/semantic/typification-api.ts","../../src/rslang/semantic/value-class.ts","../../src/library/rsform.ts","../../src/library/rsform-api.ts","../../src/library/rsmodel.ts","../../src/library/rsmodel-api.ts"],"sourcesContent":["import { type TreeCursor } from './lezer-tree';\n\nexport const TOKEN_ERROR = 0;\n\n/** Represents AST node data. */\ninterface AstNodeData extends Record<string, unknown> {\n  dataType: string;\n  value: unknown;\n}\n\n/** Represents AST structured node base. */\nexport interface AstNodeBase {\n  typeID: number;\n  data: AstNodeData;\n  annotation?: Record<string, unknown>;\n}\n\n/** Represents AST structured node. */\nexport interface AstNode extends Record<string, unknown>, AstNodeBase {\n  uid: number;\n  from: number;\n  to: number;\n  hasError: boolean;\n  parenthesis?: boolean;\n  parent: AstNode | null;\n  children: AstNode[];\n}\n\n/** Represents AST node. */\nexport interface FlatAstNode extends Record<string, unknown>, AstNodeBase {\n  uid: number;\n  parent: number | null;\n  from: number;\n  to: number;\n}\n\n/** Represents Syntax tree flat representation. */\nexport type FlatAST = FlatAstNode[];\n\n/** Builds AST tree from a given tree cursor, generating unique uids for each node. */\nexport function buildTree(cursor: TreeCursor): AstNode {\n  let nextUid = 1;\n  function genUid() {\n    return nextUid++;\n  }\n  return buildTreeInternal(cursor, null, genUid);\n}\n\n/** Flattens AST tree to a array form. */\nexport function flattenAst(node: AstNode, parent: number | null = null, out: FlatAST = []): FlatAST {\n  out.push({\n    uid: node.uid,\n    parent: parent,\n    typeID: node.typeID,\n    from: node.from,\n    to: node.to,\n    data: node.data,\n    annotation: node.annotation\n  });\n  for (const child of node.children) {\n    flattenAst(child, node.uid, out);\n  }\n  return out;\n}\n\n/** Visits AST tree in depth-first order. */\nexport function visitAstDFS(node: AstNode, callback: (node: AstNode) => void) {\n  for (const child of node.children) {\n    visitAstDFS(child, callback);\n  }\n  callback(node);\n}\n\n/** Finds and returns the AstNode with the given ui. */\nexport function findByUid(root: AstNode, uid: number): AstNode | null {\n  let found: AstNode | null = null;\n  visitAstDFS(root, node => {\n    if (node.uid === uid && !found) {\n      found = node;\n    }\n  });\n  return found;\n}\n\n/** Prints AST tree. */\nexport function printAst(node: AstNode, printNode: (node: AstNode) => string): string {\n  let children: string = '';\n  for (const child of node.children) {\n    children += `${printAst(child, printNode)}`;\n  }\n  return `[${printNode(node)}${children}]`;\n}\n\n/** Extracts node text. */\nexport function getNodeText(node: AstNode): string {\n  if (node.data.dataType === 'string' && typeof node.data.value === 'string') {\n    return node.data.value;\n  }\n  return `NO DATA NODE: ${node.typeID}`;\n}\n\n/** Extracts node indices. */\nexport function getNodeIndices(node: AstNode): number[] {\n  if (node.data.dataType === 'string[]' && Array.isArray(node.data.value)) {\n    return (node.data.value as string[]).map(s => parseInt(s, 10)).filter(n => !isNaN(n));\n  }\n  return [];\n}\n\n// ======== Internals ========\nfunction buildTreeInternal(cursor: TreeCursor, parent: AstNode | null = null, genUid: () => number): AstNode {\n  const node = cursor.node;\n\n  const result: AstNode = {\n    uid: genUid(),\n    typeID: node.type.isError ? 0 : node.type.id,\n    from: node.from,\n    to: node.to,\n    hasError: node.type.isError,\n    data: node.type.isError ? { dataType: 'null', value: null } : { dataType: 'string', value: node.type.name },\n    parent,\n    children: []\n  };\n\n  if (cursor.firstChild()) {\n    do {\n      const child = buildTreeInternal(cursor, result, genUid);\n      if (child.hasError) {\n        result.hasError = true;\n      }\n      result.children.push(child);\n    } while (cursor.nextSibling());\n    cursor.parent();\n  }\n  return result;\n}\n","import { TOKEN_ERROR } from '../../parsing';\n\n/** Represents RSLang token types. */\nexport const TokenID = {\n  // Global, local IDs and literals\n  ERROR: TOKEN_ERROR,\n\n  ID_LOCAL: 258,\n  ID_GLOBAL: 259,\n  ID_FUNCTION: 260,\n  ID_PREDICATE: 261,\n  ID_RADICAL: 262,\n  LIT_INTEGER: 263,\n  LIT_WHOLE_NUMBERS: 264,\n  LIT_EMPTYSET: 265,\n\n  // Arithmetic\n  PLUS: 266,\n  MINUS: 267,\n  MULTIPLY: 268,\n\n  // Integer predicate symbols\n  GREATER: 269,\n  LESSER: 270,\n  GREATER_OR_EQ: 271,\n  LESSER_OR_EQ: 272,\n\n  // Equality comparison\n  EQUAL: 273,\n  NOTEQUAL: 274,\n\n  // Logic predicate symbols\n  QUANTOR_UNIVERSAL: 275,\n  QUANTOR_EXISTS: 276,\n  LOGIC_NOT: 277,\n  LOGIC_EQUIVALENT: 278,\n  LOGIC_IMPLICATION: 279,\n  LOGIC_OR: 280,\n  LOGIC_AND: 281,\n\n  // Set theory predicate symbols\n  SET_IN: 282,\n  SET_NOT_IN: 283,\n  SUBSET: 284,\n  SUBSET_OR_EQ: 285,\n  NOT_SUBSET: 286,\n\n  // Set theory operators\n  DECART: 287,\n  SET_UNION: 288,\n  SET_INTERSECTION: 289,\n  SET_MINUS: 290,\n  SET_SYMMETRIC_MINUS: 291,\n  BOOLEAN: 292,\n\n  // Structure operations\n  BIGPR: 293,\n  SMALLPR: 294,\n  FILTER: 295,\n  CARD: 296,\n  BOOL: 297,\n  DEBOOL: 298,\n  REDUCE: 299,\n\n  // Term constructions prefixes\n  DECLARATIVE: 300,\n  RECURSIVE: 301,\n  IMPERATIVE: 302,\n\n  ITERATE: 303,\n  ASSIGN: 304,\n\n  // Punctuation\n  PUNCTUATION_DEFINE: 305,\n  PUNCTUATION_STRUCT: 306,\n  PUNCTUATION_PL: 307,\n  PUNCTUATION_PR: 308,\n  PUNCTUATION_CL: 309,\n  PUNCTUATION_CR: 310,\n  PUNCTUATION_SL: 311,\n  PUNCTUATION_SR: 312,\n  PUNCTUATION_BAR: 313,\n  PUNCTUATION_COMMA: 314,\n  PUNCTUATION_SEMICOLON: 315,\n\n  // ======= Non-terminal tokens =========\n  NT_ENUM_DECL: 316,\n  NT_TUPLE: 317,\n  NT_ENUMERATION: 318,\n  NT_TUPLE_DECL: 319,\n  NT_ARG_DECL: 320,\n\n  NT_FUNC_DEFINITION: 321,\n  NT_ARGUMENTS: 322,\n  NT_FUNC_CALL: 323,\n\n  NT_DECLARATIVE_EXPR: 324,\n  NT_IMPERATIVE_EXPR: 325,\n  NT_RECURSIVE_FULL: 326,\n  NT_RECURSIVE_SHORT: 327,\n\n  // ======= Helper tokens ========\n  INTERRUPT: 328,\n  END: 329\n} as const;\nexport type TokenID = (typeof TokenID)[keyof typeof TokenID];\n","/*\n * Module: Typification for RSLang.\n */\n\nimport { type Branded } from '../../shared';\n\n/** Typification structure enumeration. */\nexport const TypeID = {\n  anyTypification: 1,\n  integer: 2,\n  basic: 3,\n  tuple: 4,\n  collection: 5,\n  logic: 6,\n  function: 7,\n  predicate: 8\n} as const;\nexport type TypeID = (typeof TypeID)[keyof typeof TypeID];\n\n/** Represents type class. */\nexport const TypeClass = {\n  logic: 1,\n  typification: 2,\n  function: 3,\n  predicate: 4\n} as const;\nexport type TypeClass = (typeof TypeClass)[keyof typeof TypeClass];\n\n/** Logic type object. */\nexport const LogicT = { typeID: TypeID.logic } as const;\n\n/** Integer type object. */\nexport const IntegerT = {\n  typeID: TypeID.integer,\n  isOrdered: true,\n  isArithmetic: true,\n  isIntegerCompatible: true\n} as const;\n\n/** Type transformation path. */\nexport type TypePath = Branded<number[], 'TypePath'>;\n\n/** Creates type path. */\nexport function makeTypePath(path: number[]): TypePath {\n  return path as TypePath;\n}\n\n/** AnyTyped type object. */\nexport const AnyTypificationT = { typeID: TypeID.anyTypification } as const;\n\n/** Empty set typification. */\nexport const EmptySetT = bool(AnyTypificationT);\n\n/** Parametrized typification. */\nexport type Parametrized = EchelonFunctional | EchelonPredicate;\n\n/** General expression types. */\nexport type ExpressionType =\n  | EchelonLogic\n  | EchelonBase\n  | EchelonTuple\n  | EchelonCollection\n  | EchelonFunctional\n  | EchelonPredicate\n  | EchelonAnyTyped\n  | EchelonInteger;\n\n/** Setexpr type. */\nexport type Typification = EchelonBase | EchelonAnyTyped | EchelonInteger | EchelonCollection | EchelonTuple;\n\n/** Typification context. */\nexport type TypeContext = Map<string, ExpressionType>;\n\n/** Functional argument. */\nexport interface Argument {\n  readonly alias: string;\n  readonly type: Typification;\n}\n\n/** Type: Logic. */\nexport interface EchelonLogic {\n  readonly typeID: typeof TypeID.logic;\n}\n\n/** Type: AnyTyped. */\nexport interface EchelonAnyTyped {\n  readonly typeID: typeof TypeID.anyTypification;\n}\n\n/** Type: Integer. */\nexport interface EchelonInteger {\n  readonly typeID: typeof TypeID.integer;\n  readonly isOrdered: true;\n  readonly isArithmetic: true;\n  readonly isIntegerCompatible: true;\n}\n\n/** Type: Element of basic set. */\nexport interface EchelonBase {\n  readonly typeID: typeof TypeID.basic;\n  readonly baseID: string;\n  readonly isOrdered?: boolean;\n  readonly isArithmetic?: boolean;\n  readonly isIntegerCompatible?: boolean;\n}\n\n/** Type: Tuple. */\nexport interface EchelonTuple {\n  readonly typeID: typeof TypeID.tuple;\n  readonly factors: readonly Typification[];\n}\n\n/** Type: Collection. */\nexport interface EchelonCollection {\n  readonly typeID: typeof TypeID.collection;\n  readonly base: Typification;\n}\n\n/** Type: Functional. */\nexport interface EchelonFunctional {\n  readonly typeID: typeof TypeID.function;\n  readonly result: Typification;\n  readonly args: readonly Argument[];\n}\n\n/** Type: Predicate. */\nexport interface EchelonPredicate {\n  readonly typeID: typeof TypeID.predicate;\n  readonly result: EchelonLogic;\n  readonly args: readonly Argument[];\n}\n\n/** Create basic element typification. */\nexport function basic(alias: string): EchelonBase {\n  return { typeID: TypeID.basic, baseID: alias };\n}\n\n/** Create constant element typification. */\nexport function constant(alias: string): EchelonBase {\n  return { typeID: TypeID.basic, baseID: alias, isOrdered: true, isArithmetic: true, isIntegerCompatible: true };\n}\n\n/** Create boolean typification. */\nexport function bool(base: Typification): EchelonCollection {\n  return { typeID: TypeID.collection, base };\n}\n\n/** Create tuple typification. */\nexport function tuple(factors: Typification[]): EchelonTuple {\n  if (factors.length < 2) {\n    throw new Error('Tuple with less than two factors is not allowed');\n  }\n  return { typeID: TypeID.tuple, factors };\n}\n\n/** Remove boolean from typification. */\nexport function debool(target: EchelonCollection): Typification {\n  return target.base;\n}\n\n/** Extract component from tuple. */\nexport function component(target: EchelonTuple, index: number): Typification | null {\n  return target.factors[index - 1] ?? null;\n}\n\n/** Checks if given type is typification. */\nexport function isTypification(type: ExpressionType | null): boolean {\n  return (\n    type?.typeID === TypeID.basic ||\n    type?.typeID === TypeID.anyTypification ||\n    type?.typeID === TypeID.integer ||\n    type?.typeID === TypeID.collection ||\n    type?.typeID === TypeID.tuple\n  );\n}\n\n/** Checks if given type is radical. */\nexport function isRadical(alias: string): boolean {\n  return alias.length > 0 && alias.startsWith('R') && alias[1] !== '0';\n}\n","import { generateStub } from '../../shared';\nimport { type ExpressionType, TypeID, type TypePath, type Typification } from '../semantic/typification';\n\nimport {\n  BOOL_INFINITY,\n  compare,\n  EmptySetV,\n  INVALID_ELEMENT,\n  makeValuePath,\n  set,\n  SET_INFINITY,\n  tuple,\n  TUPLE_ID,\n  type Value,\n  VALUE_FALSE,\n  VALUE_TRUE,\n  type ValueContext,\n  type ValuePath\n} from './value';\n\n/** Cartesian product of factor sets. */\nexport function cartesianProduct(factors: Value[][]): Value[] | null {\n  const cardinality = factors.reduce((acc, f) => acc * f.length, 1);\n  if (cardinality > SET_INFINITY) {\n    return null;\n  }\n  if (cardinality === 0 || factors.length === 0) {\n    return EmptySetV;\n  }\n\n  let accumulator: Value[][] = [[]];\n  for (const factor of factors) {\n    const next: Value[][] = [];\n    for (const prefix of accumulator) {\n      for (const value of factor) {\n        next.push([...prefix, value]);\n      }\n    }\n    accumulator = next;\n  }\n  return accumulator.map(tuple);\n}\n\n/** Boolean power set ℬ(X). No cache - materialized. */\nexport function boolean(base: Value[]): Value[] | null {\n  if (base.length > BOOL_INFINITY) {\n    return null;\n  }\n  return powerset(base);\n}\n\n/** Powerset of array. */\nfunction powerset(arr: readonly Value[]): Value[][] {\n  const result: Value[][] = [[]];\n  if (arr.length === 0) {\n    return result;\n  }\n\n  let current: Value[][] = [[]];\n  let maxIndex: number[] = [-1];\n  while (current.length > 0) {\n    const next: Value[][] = [];\n    const nextMaxIndex: number[] = [];\n    for (let i = 0; i < current.length; i++) {\n      for (let j = maxIndex[i] + 1; j < arr.length; j++) {\n        const subset = [...current[i], arr[j]];\n        result.push(subset);\n        if (j < arr.length - 1) {\n          next.push(subset);\n          nextMaxIndex.push(j);\n        }\n      }\n    }\n    current = next;\n    maxIndex = nextMaxIndex;\n  }\n  return result;\n}\n\n/** Check if set contains element. */\nexport function contains(setData: Value[], element: Value): boolean {\n  let left = 0;\n  let right = setData.length - 1;\n  while (left <= right) {\n    const mid = Math.floor((left + right) / 2);\n    const cmp = compare(setData[mid], element);\n    if (cmp === 0) {\n      return true;\n    } else if (cmp < 0) {\n      left = mid + 1;\n    } else {\n      right = mid - 1;\n    }\n  }\n  return false;\n}\n\n/** Is A ⊆ B. */\nexport function isSubsetOrEq(a: Value[], b: Value[]): boolean {\n  let i = 0,\n    j = 0;\n  while (i < a.length && j < b.length) {\n    const cmp = compare(a[i], b[j]);\n    if (cmp === 0) {\n      i++;\n      j++;\n    } else if (cmp > 0) {\n      j++;\n    } else {\n      return false;\n    }\n  }\n  return i === a.length;\n}\n\n/** Reduce: flatten double boolean to single boolean. */\nexport function reduce(target: Value[][]): Value[] {\n  const result: Value[] = [];\n  for (const element of target) {\n    result.push(...element);\n  }\n  return set(result);\n}\n\n/** Union A ∪ B. */\nexport function setUnion(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  let i = 0,\n    j = 0;\n  while (i < set1.length && j < set2.length) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      result.push(set1[i]);\n      i++;\n    } else if (cmp > 0) {\n      result.push(set2[j]);\n      j++;\n    } else {\n      result.push(set1[i]);\n      i++;\n      j++;\n    }\n  }\n  while (i < set1.length) {\n    result.push(set1[i]);\n    i++;\n  }\n  while (j < set2.length) {\n    result.push(set2[j]);\n    j++;\n  }\n  return result;\n}\n\n/** Intersection A ∩ B. */\nexport function setIntersection(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  for (let i = 0, j = 0; i < set1.length && j < set2.length; ) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      i++;\n    } else if (cmp > 0) {\n      j++;\n    } else {\n      result.push(set1[i]);\n      i++;\n      j++;\n    }\n  }\n  return result;\n}\n\n/** Difference A \\ B. */\nexport function setDiff(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  let i = 0,\n    j = 0;\n  while (i < set1.length && j < set2.length) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      result.push(set1[i]);\n      i++;\n    } else if (cmp > 0) {\n      j++;\n    } else {\n      i++;\n      j++;\n    }\n  }\n  while (i < set1.length) {\n    result.push(set1[i]);\n    i++;\n  }\n  return result;\n}\n\n/** Symmetric difference A ∆ B. */\nexport function setSymDiff(set1: Value[], set2: Value[]): Value[] {\n  const result: Value[] = [];\n  let i = 0,\n    j = 0;\n  while (i < set1.length && j < set2.length) {\n    const cmp = compare(set1[i], set2[j]);\n    if (cmp < 0) {\n      result.push(set1[i]);\n      i++;\n    } else if (cmp > 0) {\n      result.push(set2[j]);\n      j++;\n    } else {\n      i++;\n      j++;\n    }\n  }\n  while (i < set1.length) {\n    result.push(set1[i]);\n    i++;\n  }\n  while (j < set2.length) {\n    result.push(set2[j]);\n    j++;\n  }\n  return result;\n}\n\n/** Projection of set by indices (BigPr). */\nexport function projection(target: Value[][], indices: number[]): Value[] {\n  const projectedElements: Value[] = target.map(element => {\n    const newComponents = indices.map(idx => element[idx]);\n    return indices.length === 1 ? newComponents[0] : tuple(newComponents);\n  });\n  return set(projectedElements);\n}\n\n/** Condensed string representation. */\nexport function printValue(data: Value | null): string {\n  if (!Array.isArray(data)) {\n    return String(data);\n  }\n  const len = data.length;\n  if (data.length === 0) {\n    return '{}';\n  }\n\n  const isTuple = data[0] === TUPLE_ID;\n  const start = isTuple ? 1 : 0;\n\n  let result = isTuple ? '(' : '{';\n  for (let i = start; i < len; i++) {\n    if (i > start) result += ', ';\n    result += printValue(data[i]);\n  }\n  result += isTuple ? ')' : '}';\n  return result;\n}\n\n/** Generates stub ID for value. */\nexport function valueStub(value: Value | null): string {\n  if (value == null) {\n    return '';\n  }\n  const str = printValue(value);\n  return generateStub(str);\n}\n\n/** Checks if value is a set representation, not a tuple representation. */\nexport function isSetValue(data: Value | null): data is Value[] {\n  return Array.isArray(data) && (data.length === 0 || data[0] !== TUPLE_ID);\n}\n\n/** Checks if value is a tuple representation. */\nexport function isTupleValue(data: Value | null): data is Value[] {\n  return Array.isArray(data) && data.length > 1 && data[0] === TUPLE_ID;\n}\n\n/** Normalize unsorted array of values. */\nexport function normalizeValue(data: Value): void {\n  if (!Array.isArray(data) || data.length === 0) {\n    return;\n  }\n\n  if (data[0] === TUPLE_ID) {\n    for (let i = 1; i < data.length; i++) {\n      normalizeValue(data[i]);\n    }\n    return;\n  }\n\n  for (const item of data) {\n    normalizeValue(item);\n  }\n\n  data.sort((a, b) => compare(a, b));\n  let i = 1;\n  while (i < data.length) {\n    if (compare(data[i - 1], data[i]) === 0) {\n      data.splice(i, 1);\n    } else {\n      i++;\n    }\n  }\n}\n\n/** Validates value for {@link ExpressionType} and value of basic sets. */\nexport function validateValue(value: Value, type: ExpressionType, basics: ValueContext): boolean {\n  switch (type.typeID) {\n    case TypeID.integer:\n      return typeof value === 'number';\n    case TypeID.logic: {\n      if (typeof value !== 'number') {\n        return false;\n      }\n      return value === VALUE_TRUE || value === VALUE_FALSE;\n    }\n    case TypeID.basic: {\n      if (typeof value !== 'number') {\n        return false;\n      }\n      const domain = basics.get(type.baseID);\n      return !!domain && Array.isArray(domain) && domain.includes(value);\n    }\n\n    case TypeID.tuple: {\n      if (!Array.isArray(value) || value.length !== type.factors.length + 1 || value[0] !== TUPLE_ID) {\n        return false;\n      }\n      for (let i = 0; i < type.factors.length; i++) {\n        if (!validateValue(value[i + 1], type.factors[i], basics)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    case TypeID.collection: {\n      if (!isSetValue(value)) {\n        return false;\n      }\n      for (const item of value) {\n        if (!validateValue(item, type.base, basics)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    case TypeID.anyTypification:\n    case TypeID.predicate:\n    case TypeID.function:\n      return false;\n  }\n}\n\n/** Converts value path to type path. */\nexport function convertPathToType(path: ValuePath, type: Typification): TypePath | null {\n  const result: number[] = [];\n  if (path.length === 0) {\n    return result as TypePath;\n  }\n\n  let curType = type;\n  let index = 0;\n  while (index < path.length) {\n    switch (curType.typeID) {\n      case TypeID.collection: {\n        result.push(0);\n        curType = curType.base;\n        index++;\n        break;\n      }\n      case TypeID.tuple: {\n        const tupleIdx = path[index];\n        if (typeof tupleIdx !== 'number' || tupleIdx < 1 || tupleIdx > curType.factors.length) {\n          return null;\n        }\n        result.push(tupleIdx);\n        curType = curType.factors[tupleIdx - 1];\n        index++;\n        break;\n      }\n      case TypeID.basic:\n      case TypeID.integer:\n      case TypeID.anyTypification:\n        return null;\n    }\n  }\n  return result as TypePath;\n}\n\n/** Extracts value from a target by path. */\nexport function extractValue(target: Value, path: ValuePath): Value | null {\n  let current: Value = target;\n  let i = 0;\n  while (i < path.length) {\n    if (!Array.isArray(current) || current.length <= path[i]) {\n      return null;\n    }\n    current = current[path[i]];\n    i++;\n  }\n  return current;\n}\n\n/** Makes default value for a type. */\nexport function makeDefaultValue(type: Typification): Value {\n  switch (type.typeID) {\n    case TypeID.anyTypification:\n    case TypeID.integer:\n    case TypeID.basic:\n      return INVALID_ELEMENT;\n    case TypeID.collection:\n      return [];\n    case TypeID.tuple:\n      return tuple(type.factors.map(item => makeDefaultValue(item)));\n  }\n}\n\n/** Perform immutable deep copy update. */\nexport function setNestedValue(target: Value | null, path: ValuePath, newVal: Value): Value {\n  if (path.length === 0) {\n    return newVal;\n  }\n  const [head, ...rest] = path;\n  const arr = Array.isArray(target) ? [...target] : [];\n  arr[head] = setNestedValue(arr[head], makeValuePath(rest), newVal);\n  return arr;\n}\n\n/** Test if value contains invalid elements. */\nexport function testInvalid(value: Value): boolean {\n  const stack = [value];\n  while (stack.length > 0) {\n    const current = stack.pop();\n    if (current === INVALID_ELEMENT) {\n      return true;\n    }\n    if (Array.isArray(current)) {\n      for (const element of current) {\n        stack.push(element);\n      }\n    }\n  }\n  return false;\n}\n","/**\n * Module: Structured data for RSLang expression evaluation.\n */\n\nimport { type Branded } from '../../shared';\n\nimport { printValue } from './value-api';\n\n/** Tuple ID for array distinction. */\nexport const TUPLE_ID = -111;\n\n/** Invalid value for structured data. */\nexport const INVALID_ELEMENT = -1;\n\n/** Boolean values: true. */\nexport const VALUE_TRUE = 1;\n\n/** Boolean values: false. */\nexport const VALUE_FALSE = 0;\n\n/** Cardinality threshold for \"infinite\" sets (e.g. Z). */\nexport const SET_INFINITY = 10_000_000;\n\n/** Cardinality threshold for Boolean power set. */\nexport const BOOL_INFINITY = 18;\n\n/** Expression evaluation result: structured data. */\nexport type Value = number | Value[];\n\n/** Values context. */\nexport type ValueContext = Map<string, Value>;\n\n/** Value extraction path. */\nexport type ValuePath = Branded<number[], 'ValuePath'>;\n\n/** Creates value path. */\nexport function makeValuePath(path: number[]): ValuePath {\n  return path as ValuePath;\n}\n\n/** Empty set ∅. */\nexport const EmptySetV = [];\n\n/** Compare two structured data without recursive calls. */\nexport function compare(v1: Value, v2: Value): number {\n  const stack1: Value[] = [v1];\n  const stack2: Value[] = [v2];\n\n  while (stack1.length > 0 && stack2.length > 0) {\n    const el1 = stack1.pop();\n    const el2 = stack2.pop();\n    if (el1 === el2) {\n      continue;\n    }\n\n    const type1 = typeof el1;\n    const type2 = typeof el2;\n    if (type1 === 'number' && type2 === 'number') {\n      const numDiff = (el1 as number) - (el2 as number);\n      if (numDiff !== 0) return numDiff;\n      continue;\n    }\n\n    const isArray1 = Array.isArray(el1);\n    const isArray2 = Array.isArray(el2);\n    if (!isArray1 || !isArray2) {\n      throw new Error(`Cannot compare different types ${printValue(el1!)} and ${printValue(el2!)}`);\n    }\n\n    const arr1 = el1;\n    const arr2 = el2;\n    const len1 = arr1.length;\n    const len2 = arr2.length;\n    if (len1 !== len2) {\n      return len1 - len2;\n    }\n\n    for (let i = len1 - 1; i >= 0; i--) {\n      stack1.push(arr1[i]);\n      stack2.push(arr2[i]);\n    }\n  }\n  return 0;\n}\n\n/** Tuple from components. */\nexport function tuple(components: Value[]): Value {\n  return [TUPLE_ID, ...components];\n}\n\n/** Set from elements (unique). Value[] - materialized. */\nexport function set(elements: Value[]): Value[] {\n  const sorted = [...elements].sort(compare);\n  for (let i = 1; i < sorted.length; ) {\n    if (compare(sorted[i - 1], sorted[i]) === 0) {\n      sorted.splice(i, 1);\n    } else {\n      i++;\n    }\n  }\n  return sorted;\n}\n","// This file was generated by lezer-generator. You probably shouldn't edit it.\nimport {LRParser} from \"@lezer/lr\"\nexport const parser = LRParser.deserialize({\n  version: 14,\n  states: \"2lO!sQPOOOVQPO'#CdO$qQPO'#C`O&pQPO'#C`O*bQPO'#C_Q*jQPOOO,TQPO'#CyOVQPO'#CtO,]QPO'#CtOOQO'#Ct'#CtOOQO'#C^'#C^OOQO'#ES'#ESOOQO'#ET'#ETO,bQPO'#DeO,iQPO'#DfO,qQPO'#DhO,vQPO'#DjO,{QPO'#DnO-QQPO'#DrOOQO'#EU'#EUOOQO'#EV'#EVOOQO'#DS'#DSO-VQPO'#DSO-[QPO'#DSOOQO'#EQ'#EQO,TQPO'#DzQOQPOOO-aQPO'#ERO-nQPO,59OO-vQPO'#CeO-{QPO,58xO/lQPO,59tOVQPO,58yOVQPO,58yOVQPO,59iOVQPO,59iOVQPO,59iOVQPO,59iOVQPO,59tOVQPO,59tOVQPO,59tOVQPO,59tOVQPO,59tOVQPO,59tOVQPO,59tOVQPO,59tOVQPO'#CdOOQO'#C`'#C`OOQO'#C{'#C{O1]QPO,59eO2rQPO,59`OVQPO,59`OOQO'#ER'#ERO5TQPO,5:PO5]QPO,5:UOVQPO,5:QOOQO,5:Q,5:QOVQPO,5:SO,TQPO,5:UOVQPO,5:YO,TQPO,5:^OVQPO,59nOVQPO,59nO5dQPO'#D|OOQO'#D{'#D{O5iQPO,5:fOOQO1G.j1G.jOVQPO,59POOQO1G.d1G.dOOQO1G/`1G/`O5qQPO1G.eO7vQPO1G.eO:zQPO1G/TO=]QPO1G/TO?nQPO1G/TOBPQPO1G/TOGyQPO1G/`OHQQPO1G/`OKpQPO1G/`O! `QPO1G/`O! gQPO1G/`O! nQPO1G/`O! uQPO1G/`O,TQPO,59gOVQPO1G/PO!%aQPO1G.zOOQO1G/k1G/kOVQPO1G/pO!%iQPO1G/lO!%pQPO1G/nO!%xQPO1G/pO!%}QPO1G/tO!&UQPO1G/xO!&ZQPO1G/YO!&cQPO1G/YOVQPO,5:hO,TQPO,5:gOVQPO1G0QO!&jQPO1G.kOOQO1G/R1G/RO!&zQPO7+$kOOQO7+$f7+$fO!(gQPO7+%[OOQO7+%W7+%WO!(nQPO7+%YOVQPO7+%[OVQPO7+%`OVQPO7+%dOOQO7+$t7+$tO!(sQPO1G0SOOQO1G0R1G0RO!(}QPO7+%lO!)UQPO<<HVOVQPO<<HvOVQPO<<HtO!+gQPO<<HvO!+nQPO'#DoO!+xQPO<<HzO!,QQPO<<IOO!,XQPOAN>bO!,`QPOAN>`OVQPOAN>bOVQPO,5:ZOOQOAN>fAN>fOVQPOAN>jOOQOG23|G23|OOQOG23zG23zO!,gQPOG23|O!,nQPO1G/uO!,xQPOG24UOOQOLD)hLD)hOOQOLD)pLD)pOVQPOLD)pO!-SQPO!$'M[OOQO!)9Bv!)9Bv\",\n  stateData: \"!-l~O!sOS~OTQOVPOiVOjWOnUOpUOwZOxZOyZOz[O{[O!W]O!Z^O!]_O!``O!aaO!ebO!gfO!hdO!idO!jdO!kdO!ldO!mdO~OkiO~PVOZSX[SX]!wX^!wX_!wX`!wXa!wXb!wXc!wXd!wXe!wXf!wXg!wXr!wXs!wXt!wXu!wX}!wX!O!wX!P!wX!Q!wX!R!wX!S!wX!T!wX!U!wXY!wX!V!wX~O!q!wXU!wXl!wX!_!wXT!wXV!wXi!wXj!wXn!wXp!wXw!wXx!wXy!wXz!wX{!wX!W!wX!Z!wX!]!wX!`!wX!a!wX!e!wX!g!wX!h!wX!i!wX!j!wX!k!wX!l!wX!m!wX!d!wX~P!zOZSX[SX]!xX^!xX_!xX`!xXa!xXb!xXc!xXd!xXe!xXf!xXg!xXr!xXs!xXt!xXu!xX}!xX!O!xX!P!xX!Q!xX!R!xX!S!xX!T!xX!U!xX!q!xXY!xX!V!xXU!xXl!xX!_!xXT!xXV!xXi!xXj!xXn!xXp!xXw!xXx!xXy!xXz!xX{!xX!W!xX!Z!xX!]!xX!`!xX!a!xX!e!xX!g!xX!h!xX!i!xX!j!xX!k!xX!l!xX!m!xX!d!xX~OZpO[pO~O]qO^qO_qO`qOaqObqOcqOdqOeqOfqOgqOrrOssOttOuuO}vO!OwO!PxO!QyO!RzO!S{O!T|O!U}O~OT!POV!OO~Ok!TO~OT!WO~PYOV!XO!Z^O~Ok!ZO~O!W![O~O!W!]O~O!W!^O~Ok!_O~OV!`O~OY!uX!V!uXl!uX~P*jOU!dOY!uX~OY!eO~OU!fOY!tX]!tX^!tX_!tX`!tXa!tXb!tXc!tXd!tXe!tXf!tXg!tXr!tXs!tXt!tXu!tX}!tX!O!tX!P!tX!Q!tX!R!tX!S!tX!T!tX!U!tX~OU!gOYvX]vX^vX_vX`vXavXbvXcvXdvXevXfvXgvXrvXsvXtvXuvX}vX!OvX!PvX!QvX!RvX!SvX!TvX!UvX~OY!uO]!vO~O]qO^qO_qO`qOaqObqOcqOdqOeqOfqOgqO}vO!OwO!PxO!QyO!RzO!S{O!T|O!U}O~Orhashathauha!qhaUhaYha!Vhalha!_haThaVhaihajhanhaphawhaxhayhazha{ha!Wha!Zha!]ha!`ha!aha!eha!gha!hha!iha!jha!kha!lha!mha!dha~P1eOY!eO!V!xO~O]!yO~P!zO]#RO~OY#SOl#TO~O!qRiURiYRi!VRilRi!_RiTRiVRiiRijRinRipRiwRixRiyRizRi{Ri!WRi!ZRi!]Ri!`Ri!aRi!eRi!gRi!hRi!iRi!jRi!kRi!lRi!mRi!dRi~P*jO]Ri^Ri_Ri`RiaRibRicRidRieRifRigRirRisRitRiuRi!qRiURiYRi!VRilRi!_RiTRiVRiiRijRinRipRiwRixRiyRizRi{Ri!WRi!ZRi!]Ri!`Ri!aRi!eRi!gRi!hRi!iRi!jRi!kRi!lRi!mRi!dRi~P+iOssOttOuuOrqi!qqiUqiYqi!Vqilqi!_qiTqiVqiiqijqinqipqiwqixqiyqizqi{qi!Wqi!Zqi!]qi!`qi!aqi!eqi!gqi!hqi!iqi!jqi!kqi!lqi!mqi!dqi~P1eOttOuuOrqisqi!qqiUqiYqi!Vqilqi!_qiTqiVqiiqijqinqipqiwqixqiyqizqi{qi!Wqi!Zqi!]qi!`qi!aqi!eqi!gqi!hqi!iqi!jqi!kqi!lqi!mqi!dqi~P1eOuuOrqisqitqi!qqiUqiYqi!Vqilqi!_qiTqiVqiiqijqinqipqiwqixqiyqizqi{qi!Wqi!Zqi!]qi!`qi!aqi!eqi!gqi!hqi!iqi!jqi!kqi!lqi!mqi!dqi~P1eOrqisqitqiuqi!qqiUqiYqi!Vqilqi!_qiTqiVqiiqijqinqipqiwqixqiyqizqi{qi!Wqi!Zqi!]qi!`qi!aqi!eqi!gqi!hqi!iqi!jqi!kqi!lqi!mqi!dqi~P1eO}vO]|i^|i_|i`|ia|ib|ic|id|ie|if|ig|ir|is|it|iu|i!P|i!Q|i!R|i!S|i!T|i!U|i!q|iU|iY|i!V|il|i!_|iT|iV|ii|ij|in|ip|iw|ix|iy|iz|i{|i!W|i!Z|i!]|i!`|i!a|i!e|i!g|i!h|i!i|i!j|i!k|i!l|i!m|i!d|i~O!O|i~PDbO!OwO~PDbO}vO!OwO!PxO!U}O]|i^|i_|i`|ia|ib|ic|id|ie|if|ig|ir|is|it|iu|i!R|i!S|i!T|i!q|iU|iY|i!V|il|i!_|iT|iV|ii|ij|in|ip|iw|ix|iy|iz|i{|i!W|i!Z|i!]|i!`|i!a|i!e|i!g|i!h|i!i|i!j|i!k|i!l|i!m|i!d|i~O!Q|i~PHXO}vO!OwO!PxO!QyO!T|O!U}O]|i^|i_|i`|ia|ib|ic|id|ie|if|ig|ir|is|it|iu|i!S|i!q|iU|iY|i!V|il|i!_|iT|iV|ii|ij|in|ip|iw|ix|iy|iz|i{|i!W|i!Z|i!]|i!`|i!a|i!e|i!g|i!h|i!i|i!j|i!k|i!l|i!m|i!d|i~O!R|i~PKwO!RzO~PKwO!QyO~PHXO}vO!OwO!PxO]|i^|i_|i`|ia|ib|ic|id|ie|if|ig|ir|is|it|iu|i!Q|i!R|i!S|i!T|i!U|i!q|iU|iY|i!V|il|i!_|iT|iV|ii|ij|in|ip|iw|ix|iy|iz|i{|i!W|i!Z|i!]|i!`|i!a|i!e|i!g|i!h|i!i|i!j|i!k|i!l|i!m|i!d|i~OY!eOl#XO~OU#ZO~P*jOY!eOl#[O~O]#]O~O!_#^O~P*jO[#_O~OY!eOl#`O~OU#`O~P*jOUXiYXi!VXilXi~P*jO]qO^qO_qO`qOaqObqOcqOdqOeqOfqOgqOrrOssOttOuuO}vO!OwO!PxO!QyO!RzO!S{O!T|O!U}O~PVO!_#eO~P*jOV#fO~OY!pil!pi~P*jO!q!nq~P*jOrmysmytmyumy!qmyUmyYmy!Vmylmy!_myTmyVmyimyjmynmypmywmyxmyymyzmy{my!Wmy!Zmy!]my!`my!amy!emy!gmy!hmy!imy!jmy!kmy!lmy!mmy!dmy~P1eO!_#mO~P*jO!V!cX!d!cX~P*jO!V#oO!d#nO~O!_#pO~P*jO!V#qO~P*jOU#rO~P*jO!V#vO~P*jO!V!ci!d!ci~P*jO!V#wO!_#xO~P*jO!V#zO~P*jO!]!hj!gz{!j!k!l!m!iT!e!a!`!a~\",\n  goto: \"1O!zPP!{#y$uPPP&R'VPPPPPPPPPPPPPP#yPPPP'aP(]P#yPPPP(`PPPPP)[PPPPPPPPPP*Y+UP*YP*YPPP*Y,TPP*YPPPPPPP,W,Z,^PPP,d.v/W/W/W0S!phOV]pqrstuvwxyz{|}!O!T!X!Z!]!_!`!e!v!y#R#T#W#]#^#_#e#f#m#n#p#xRnP!sYOPV]pqrstuvwxyz{|}!O!T!X!Z!]!_!`!e!v!y#R#T#W#]#^#_#e#f#m#n#p#x!rSOPV]pqrstuvwxyz{|}!O!T!X!Z!]!_!`!e!v!y#R#T#W#]#^#_#e#f#m#n#p#xQ!QUS!ai#SQ!|![Q#O!^R#V!u!rROPV]pqrstuvwxyz{|}!O!T!X!Z!]!_!`!e!v!y#R#T#W#]#^#_#e#f#m#n#p#x]!PUi![!^!u#SSlP!OX!U]!T!Z!_!sXOPV]pqrstuvwxyz{|}!O!T!X!Z!]!_!`!e!v!y#R#T#W#]#^#_#e#f#m#n#p#xR!RU!shOPV]pqrstuvwxyz{|}!O!T!X!Z!]!_!`!e!v!y#R#T#W#]#^#_#e#f#m#n#p#x!peOV]pqrstuvwxyz{|}!O!T!X!Z!]!_!`!e!v!y#R#T#W#]#^#_#e#f#m#n#p#xRoP!scOPV]pqrstuvwxyz{|}!O!T!X!Z!]!_!`!e!v!y#R#T#W#]#^#_#e#f#m#n#p#x!rcOPV]pqrstuvwxyz{|}!O!T!X!Z!]!_!`!e!v!y#R#T#W#]#^#_#e#f#m#n#p#xR!Y^R#i#^RjOR!ciQ!biR#b#SQTO[kP]!O!T!Z!_Q!SVQ!gvQ!hpQ!iqQ!jrQ!ksQ!ltQ!muQ!nwQ!oxQ!pyQ!qzQ!r{Q!s|Q!t}Q!z!XQ!}!]Q#Q!`Q#U!eQ#W!vQ#Y!yQ#a#RQ#c#TQ#d#WQ#g#]Q#h#^Q#j#_Q#k#eQ#l#fQ#s#mQ#t#nQ#u#pR#y#xSmP!OQ!V]Q!w!TQ!{!ZR#P!_!seOPV]pqrstuvwxyz{|}!O!T!X!Z!]!_!`!e!v!y#R#T#W#]#^#_#e#f#m#n#p#x!sgOPV]pqrstuvwxyz{|}!O!T!X!Z!]!_!`!e!v!y#R#T#W#]#^#_#e#f#m#n#p#x\",\n  nodeNames: \"⚠ Expression Logic Logic_predicates Variable Local ) ( Tuple Expr_enum_min2 , :∈ := ∈ ∉ ⊆ ⊄ ⊂ > ≥ < ≤ ≠ = Logic_unary ¬ Predicate [ ] Logic_quantor ∀ Variable_pack ∃ Logic_binary ⇔ ⇒ ∨ & Setexpr Integer EmptySet IntegerSet Global Radical Setexpr_binary * + - ∪ \\\\ ∆ ∩ × } { Enumeration Boolean ℬ Filter_expression Filter Declarative | PrefixD PrefixI Imperative Imp_blocks ; PrefixR Recursion Function BigPr SmallPr Card Bool Debool Red Function_decl Arguments Declaration\",\n  maxTerm: 87,\n  nodeProps: [\n    [\"openedBy\", 6,\"(\",53,\"{\"],\n    [\"closedBy\", 7,\")\",54,\"}\"]\n  ],\n  skippedNodes: [0],\n  repeatNodeCount: 0,\n  tokenData: \"6j~R!jX^%spq%svw&hxy&myz&rz{&w{|&||}'R}!O'W!Q![']![!]'e!]!^'x!^!_'}!_!`(S!`!a(X!c!d(^!e!f(^!f!g(l!h!i(t!k!l)h!p!q(^!r!s)m!t!u*a!u!v(^!v!w(^!z!{(^!|!}*q!}#O*v#O#P*{#P#Q+Q#R#S+V#T#U+V#U#V+m#V#W-]#W#X.x#X#d+V#d#e1b#e#f+V#f#g2w#g#o+V#o#p4R#p#q4W#q#r4]#y#z%s$f$g%s$r$s4b%o%p4g5i6S+V#BY#BZ%s$IS$I_%s$I|$JO%s$JT$JU%s$KV$KW%s% l% m4l%%Y%%Z4q%%[%%]4v%&Y%&Z4{%&]%&^5Q%&_%&`5V%&`%&a5[%&b%&c5a%&c%&d5f%'S%'T5k%'T%'U5p%'U%'V5u%(^%(_5z%(b%(c6P%(c%(d6U%)Q%)R6Z%)S%)T6`%)U%)V6e&FU&FV%s~%xY!s~X^%spq%s#y#z%s$f$g%s#BY#BZ%s$IS$I_%s$I|$JO%s$JT$JU%s$KV$KW%s&FU&FV%s~&mOu~~&rOV~~&wOU~~&|O}~~'RO!O~~'WOY~~']O!P~~'bPw~!Q![']~'hQ!_!`'n%&b%&c's~'sO[~~'xOZ~~'}O!d~~(SOd~~(XOg~~(^Ob~~(aP!Q![(d~(iPz~!Q![(d~(qP!`~!Q![(d~(wQ!Q![(}#]#^)V~)SP!g~!Q![(}~)YP!R![)]~)bQ!]~|})V!Q![)]~)mO!a~~)pQ!Q![)v#f#g*O~){Pj~!Q![)v~*RP!R![*U~*ZQ!h~|}*O!Q![*U~*fP!e~!Q![*i~*nP{~!Q![*i~*vOy~~*{Ok~~+QO!R~~+VOl~~+[RT~!Q![+e#T#o+V5i6S+V~+jPT~!Q![+e~+rTT~!Q![+e#T#c+V#c#d,R#d#o+V5i6S+V~,WTT~!Q![+e#T#c+V#c#d,g#d#o+V5i6S+V~,lTT~!Q![+e#T#`+V#`#a,{#a#o+V5i6S+V~-SR!k~T~!Q![+e#T#o+V5i6S+V~-bST~!Q![+e#T#U-n#U#o+V5i6S+V~-sTT~!Q![+e#T#f+V#f#g.S#g#o+V5i6S+V~.XTT~!Q![+e#T#W+V#W#X.h#X#o+V5i6S+V~.oR!j~T~!Q![+e#T#o+V5i6S+V~.}TT~!Q![+e#T#X+V#X#Y/^#Y#o+V5i6S+V~/cTT~!Q![+e#T#U+V#U#V/r#V#o+V5i6S+V~/wTT~!Q![+e#T#c+V#c#d0W#d#o+V5i6S+V~0]TT~!Q![+e#T#c+V#c#d0l#d#o+V5i6S+V~0qTT~!Q![+e#T#`+V#`#a1Q#a#o+V5i6S+V~1XR!l~T~!Q![+e#T#o+V5i6S+V~1gTT~!Q![+e#T#f+V#f#g1v#g#o+V5i6S+V~1{ST~!Q!R+e!R![2X#T#o+V5i6S+V~2`Q!i~T~|}2f!Q![2X~2iP!R![2l~2qQ!i~|}2f!Q![2l~2|TT~!Q![+e#T#X+V#X#Y3]#Y#o+V5i6S+V~3bTT~!Q![+e#T#W+V#W#X3q#X#o+V5i6S+V~3xR!m~T~!Q![+e#T#o+V5i6S+V~4WO!W~~4]O!_~~4bO!V~~4gOi~~4lO!U~~4qO!Z~~4vOs~~4{Or~~5QOn~~5VOp~~5[Ox~~5aO!S~~5fO]~~5kO^~~5pOt~~5uO!T~~5zO!Q~~6POf~~6UOe~~6ZOc~~6`Oa~~6eO`~~6jO_~\",\n  tokenizers: [0],\n  topRules: {\"Expression\":[0,1]},\n  tokenPrec: 2679\n})\n","// This file was generated by lezer-generator. You probably shouldn't edit it.\nexport const\n  Expression = 1,\n  Logic = 2,\n  Logic_predicates = 3,\n  Variable = 4,\n  Local = 5,\n  Tuple = 8,\n  Expr_enum_min2 = 9,\n  Logic_unary = 24,\n  Predicate = 26,\n  Logic_quantor = 29,\n  Variable_pack = 31,\n  Logic_binary = 33,\n  Setexpr = 38,\n  Integer = 39,\n  EmptySet = 40,\n  IntegerSet = 41,\n  Global = 42,\n  Radical = 43,\n  Setexpr_binary = 44,\n  Enumeration = 55,\n  Boolean = 56,\n  Filter_expression = 58,\n  Filter = 59,\n  Declarative = 60,\n  PrefixD = 62,\n  PrefixI = 63,\n  Imperative = 64,\n  Imp_blocks = 65,\n  PrefixR = 67,\n  Recursion = 68,\n  Function = 69,\n  BigPr = 70,\n  SmallPr = 71,\n  Card = 72,\n  Bool = 73,\n  Debool = 74,\n  Red = 75,\n  Function_decl = 76,\n  Arguments = 77,\n  Declaration = 78\n","/**\n * Module: Transforming AST to a simple form.\n */\n\nimport { type AstNode, visitAstDFS } from '../../parsing';\n\nimport {\n  Arguments,\n  BigPr,\n  Bool,\n  Boolean,\n  Card,\n  Debool,\n  Declaration,\n  Declarative,\n  EmptySet,\n  Enumeration,\n  Expr_enum_min2,\n  Expression,\n  Filter,\n  Filter_expression,\n  Function,\n  Function_decl,\n  Global,\n  Imp_blocks,\n  Imperative,\n  Integer,\n  IntegerSet,\n  Local,\n  Logic,\n  Logic_binary,\n  Logic_predicates,\n  Logic_quantor,\n  Logic_unary,\n  Predicate,\n  PrefixD,\n  Radical,\n  Recursion,\n  Red,\n  Setexpr,\n  Setexpr_binary,\n  SmallPr,\n  Tuple,\n  Variable,\n  Variable_pack\n} from './parser.terms';\nimport { TokenID } from './token';\n\n/** Normalizes AST to a simple form. */\nexport function normalizeAST(ast: AstNode, input: string) {\n  visitAstDFS(ast, node => normalizeNode(node, input));\n}\n\n// ====== Internals =========\nconst idRecord: Record<number, TokenID> = {\n  [Global]: TokenID.ID_GLOBAL,\n  [Local]: TokenID.ID_LOCAL,\n  [Radical]: TokenID.ID_RADICAL,\n  [Function]: TokenID.ID_FUNCTION,\n  [Predicate]: TokenID.ID_PREDICATE,\n  [Integer]: TokenID.LIT_INTEGER,\n  [EmptySet]: TokenID.LIT_EMPTYSET,\n  [IntegerSet]: TokenID.LIT_WHOLE_NUMBERS,\n\n  [Boolean]: TokenID.BOOLEAN,\n\n  [BigPr]: TokenID.BIGPR,\n  [SmallPr]: TokenID.SMALLPR,\n  [Filter]: TokenID.FILTER,\n\n  [Bool]: TokenID.BOOL,\n  [Debool]: TokenID.DEBOOL,\n  [Red]: TokenID.REDUCE,\n  [Card]: TokenID.CARD,\n\n  [Enumeration]: TokenID.NT_ENUMERATION,\n  [Tuple]: TokenID.NT_TUPLE,\n  [Arguments]: TokenID.NT_ARGUMENTS,\n  [Declaration]: TokenID.NT_ARG_DECL,\n  [Function_decl]: TokenID.NT_FUNC_DEFINITION,\n  [Variable_pack]: TokenID.NT_ENUM_DECL,\n  [Declarative]: TokenID.NT_DECLARATIVE_EXPR,\n  [Imperative]: TokenID.NT_IMPERATIVE_EXPR\n};\n\nfunction normalizeNode(node: AstNode, input: string) {\n  if (node.hasError) {\n    return;\n  }\n  switch (node.typeID) {\n    case 0:\n      return;\n\n    case Expression:\n      promoteSingleChild(node);\n      return;\n\n    case EmptySet:\n    case IntegerSet:\n      node.typeID = idRecord[node.typeID];\n      clearData(node);\n      return;\n\n    case Integer:\n      node.typeID = idRecord[node.typeID];\n      node.data.dataType = 'number';\n      node.data.value = Number(input.slice(node.from, node.to));\n      return;\n\n    case Function:\n    case Predicate:\n    case Global:\n    case Local:\n    case Radical:\n    case Integer:\n      node.typeID = idRecord[node.typeID];\n      node.data.dataType = 'string';\n      node.data.value = input.slice(node.from, node.to);\n      return;\n\n    case Boolean:\n      node.typeID = idRecord[node.typeID];\n      if (node.children.length === 4) {\n        node.children = [node.children[2]];\n      } else {\n        node.children = [node.children[1]];\n      }\n      clearData(node);\n      return;\n\n    case Filter:\n    case BigPr:\n    case SmallPr:\n      node.typeID = idRecord[node.typeID];\n      node.data.dataType = 'string[]';\n      node.data.value = parseIndex(input.slice(node.from + 2, node.to));\n      return;\n\n    case Red:\n    case Debool:\n    case Bool:\n    case Card:\n      node.typeID = idRecord[node.typeID];\n      clearData(node);\n      return;\n\n    case Function_decl:\n      node.typeID = idRecord[node.typeID];\n      clearData(node);\n      node.children = [node.children[1], node.children[3]];\n      return;\n    case Declaration:\n      node.typeID = idRecord[node.typeID];\n      clearData(node);\n      node.children = [node.children[0], node.children[2]];\n      return;\n\n    case Arguments:\n      node.typeID = idRecord[node.typeID];\n      clearData(node);\n      if (node.children.length === 3) {\n        processLeftEnum(node);\n      }\n      return;\n\n    case Expr_enum_min2:\n      processLeftEnum(node);\n      return;\n\n    case Setexpr:\n      if (node.children.length === 1) {\n        promoteSingleChild(node);\n      } else if (node.children.length === 4) {\n        processTextFunction(node);\n      }\n      return;\n\n    case Tuple:\n    case Enumeration:\n      node.typeID = idRecord[node.typeID];\n      clearData(node);\n      if (node.children[1].typeID === Expr_enum_min2) {\n        for (const child of node.children[1].children) {\n          child.parent = node;\n        }\n        node.children = node.children[1].children;\n      } else {\n        node.children = [node.children[1]];\n      }\n      return;\n\n    case Logic_binary:\n    case Logic_predicates:\n    case Setexpr_binary:\n      if (node.children[0].data.value === '(') {\n        processParenthesis(node);\n      } else {\n        clearData(node);\n        node.typeID = symbolToToken(node.children[1].data.value as string);\n        if (node.typeID === TokenID.DECART) {\n          processDecartChildren(node);\n        } else {\n          node.children = [node.children[0], node.children[2]];\n        }\n      }\n      return;\n\n    case Filter_expression:\n      processFilter(node);\n      return;\n\n    case Logic:\n      if (node.children[0].data.value === '(') {\n        processParenthesis(node);\n      } else {\n        promoteSingleChild(node);\n      }\n      return;\n\n    case Logic_unary:\n      if (node.children[0].data.value === '¬') {\n        clearData(node);\n        node.typeID = TokenID.LOGIC_NOT;\n        node.children = [node.children[1]];\n      } else if (node.children[0].typeID === TokenID.ID_PREDICATE) {\n        processTextFunction(node);\n      } else {\n        promoteSingleChild(node);\n      }\n      return;\n\n    case Logic_quantor:\n      clearData(node);\n      node.typeID = symbolToToken(node.children[0].data.value as string);\n      node.children = [node.children[1], node.children[3], node.children[4]];\n      return;\n\n    case Variable:\n      convertTupleDeclaration(node.children[0]);\n      promoteSingleChild(node);\n      return;\n\n    case Variable_pack:\n      if (node.children.length === 1) {\n        promoteSingleChild(node);\n      } else {\n        node.typeID = idRecord[node.typeID];\n        processLeftEnum(node);\n      }\n      return;\n\n    case Declarative:\n      node.typeID = idRecord[node.typeID];\n      clearData(node);\n      if (node.children[0].typeID === PrefixD) {\n        node.children = [node.children[2], node.children[4], node.children[6]];\n      } else {\n        node.children = [node.children[1], node.children[3], node.children[5]];\n      }\n      return;\n\n    case Imp_blocks:\n      if (node.children.length === 1) {\n        if (node.parent?.typeID === Imp_blocks) {\n          promoteSingleChild(node);\n        }\n      } else {\n        processLeftEnum(node);\n      }\n      return;\n\n    case Imperative:\n      node.typeID = idRecord[node.typeID];\n      clearData(node);\n      for (const child of node.children[4].children) {\n        child.parent = node;\n      }\n      node.children = [node.children[2], ...node.children[4].children];\n      return;\n\n    case Recursion:\n      if (node.children.length > 9) {\n        node.typeID = TokenID.NT_RECURSIVE_FULL;\n        node.children = [node.children[2], node.children[4], node.children[6], node.children[8]];\n      } else {\n        node.typeID = TokenID.NT_RECURSIVE_SHORT;\n        node.children = [node.children[2], node.children[4], node.children[6]];\n      }\n      return;\n  }\n}\n\nfunction convertTupleDeclaration(node: AstNode) {\n  if (node.typeID !== TokenID.NT_TUPLE) {\n    return;\n  }\n  node.typeID = TokenID.NT_TUPLE_DECL;\n  for (const child of node.children) {\n    convertTupleDeclaration(child);\n  }\n}\n\nfunction clearData(node: AstNode) {\n  node.data.value = null;\n  node.data.dataType = 'null';\n}\n\nfunction promoteSingleChild(node: AstNode, index: number = 0) {\n  for (const child of node.children[index].children) {\n    child.parent = node;\n  }\n  node.typeID = node.children[index].typeID;\n  node.data = node.children[index].data;\n  node.parenthesis = node.children[index].parenthesis;\n  node.children = node.children[index].children;\n}\n\nfunction parseIndex(text: string): string[] {\n  return text.split(',');\n}\n\nfunction symbolToToken(symbol: string): TokenID {\n  switch (symbol) {\n    case '+':\n      return TokenID.PLUS;\n    case '-':\n      return TokenID.MINUS;\n    case '*':\n      return TokenID.MULTIPLY;\n\n    case '∪':\n      return TokenID.SET_UNION;\n    case '\\\\':\n      return TokenID.SET_MINUS;\n    case '∆':\n      return TokenID.SET_SYMMETRIC_MINUS;\n    case '∩':\n      return TokenID.SET_INTERSECTION;\n    case '×':\n      return TokenID.DECART;\n\n    case '∈':\n      return TokenID.SET_IN;\n    case '∉':\n      return TokenID.SET_NOT_IN;\n    case '⊆':\n      return TokenID.SUBSET_OR_EQ;\n    case '⊄':\n      return TokenID.NOT_SUBSET;\n    case '⊂':\n      return TokenID.SUBSET;\n\n    case '>':\n      return TokenID.GREATER;\n    case '≥':\n      return TokenID.GREATER_OR_EQ;\n    case '<':\n      return TokenID.LESSER;\n    case '≤':\n      return TokenID.LESSER_OR_EQ;\n\n    case '≠':\n      return TokenID.NOTEQUAL;\n    case '=':\n      return TokenID.EQUAL;\n\n    case ':∈':\n      return TokenID.ITERATE;\n    case ':=':\n      return TokenID.ASSIGN;\n\n    case '¬':\n      return TokenID.LOGIC_NOT;\n\n    case '⇔':\n      return TokenID.LOGIC_EQUIVALENT;\n    case '⇒':\n      return TokenID.LOGIC_IMPLICATION;\n    case '∨':\n      return TokenID.LOGIC_OR;\n    case '&':\n      return TokenID.LOGIC_AND;\n\n    case '∀':\n      return TokenID.QUANTOR_UNIVERSAL;\n    case '∃':\n      return TokenID.QUANTOR_EXISTS;\n  }\n  return TokenID.ERROR;\n}\n\nfunction processParenthesis(node: AstNode) {\n  promoteSingleChild(node, 1);\n  node.parenthesis = true;\n}\n\nfunction processLeftEnum(node: AstNode) {\n  if (node.children[0].typeID === node.typeID) {\n    for (const child of node.children[0].children) {\n      child.parent = node;\n    }\n    node.children = [...node.children[0].children, node.children[2]];\n  } else {\n    node.children = [node.children[0], node.children[2]];\n  }\n}\n\nfunction processDecartChildren(node: AstNode) {\n  const newChildren: AstNode[] = [];\n  if (node.children[0].typeID === TokenID.DECART && !node.children[0].parenthesis) {\n    for (const child of node.children[0].children) {\n      child.parent = node;\n      newChildren.push(child);\n    }\n  } else {\n    newChildren.push(node.children[0]);\n  }\n\n  if (node.children[2].typeID === TokenID.DECART && !node.children[2].parenthesis) {\n    for (const child of node.children[2].children) {\n      child.parent = node;\n      newChildren.push(child);\n    }\n  } else {\n    newChildren.push(node.children[2]);\n  }\n  node.children = newChildren;\n}\n\nfunction processTextFunction(node: AstNode) {\n  if (node.children[0].typeID === TokenID.ID_FUNCTION || node.children[0].typeID === TokenID.ID_PREDICATE) {\n    node.typeID = TokenID.NT_FUNC_CALL;\n    clearData(node);\n    if (node.children[2].typeID === Expr_enum_min2) {\n      for (const child of node.children[2].children) {\n        child.parent = node;\n      }\n      node.children = [node.children[0], ...node.children[2].children];\n    } else {\n      node.children = [node.children[0], node.children[2]];\n    }\n  } else {\n    node.typeID = node.children[0].typeID;\n    node.data = node.children[0].data;\n    node.children = [node.children[2]];\n  }\n}\n\nfunction processFilter(node: AstNode) {\n  const children: AstNode[] = [];\n  if (node.children[2].typeID === Expr_enum_min2) {\n    for (const child of node.children[2].children) {\n      child.parent = node;\n      children.push(child);\n    }\n  } else {\n    children.push(node.children[2]);\n  }\n  children.push(node.children[5]);\n  promoteSingleChild(node);\n  node.children = children;\n}\n","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.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}. */\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","/**\n * Module: Typification API for RSLang.\n */\n\nimport {\n  bool,\n  component,\n  type EchelonBase,\n  type EchelonCollection,\n  type EchelonTuple,\n  type ExpressionType,\n  IntegerT,\n  isRadical,\n  isTypification,\n  tuple,\n  TypeClass,\n  TypeID,\n  type TypePath,\n  type Typification\n} from './typification';\n\n/** Record map from typeID to typeClass. */\nconst TypeIDToClass: Record<TypeID, TypeClass> = {\n  [TypeID.anyTypification]: TypeClass.typification,\n  [TypeID.integer]: TypeClass.typification,\n  [TypeID.basic]: TypeClass.typification,\n  [TypeID.tuple]: TypeClass.typification,\n  [TypeID.collection]: TypeClass.typification,\n  [TypeID.logic]: TypeClass.logic,\n  [TypeID.function]: TypeClass.function,\n  [TypeID.predicate]: TypeClass.predicate\n};\n\n/** Returns the TypeClass associated with the given TypeID. */\nexport function getTypeClass(typeID: TypeID): TypeClass {\n  return TypeIDToClass[typeID];\n}\n\n/** Returns true if the given typification is generic. */\nexport function hasGenerics(type: Typification): boolean {\n  switch (type.typeID) {\n    case TypeID.anyTypification:\n      return true;\n    case TypeID.integer:\n      return false;\n    case TypeID.basic:\n      return isRadical(type.baseID);\n    case TypeID.collection:\n      return hasGenerics(type.base);\n    case TypeID.tuple:\n      for (const factor of type.factors) {\n        if (hasGenerics(factor)) {\n          return true;\n        }\n      }\n      return false;\n  }\n}\n\n/** Checks if two typifications are equal. */\nexport function checkEquality(type1: Typification, type2: Typification): boolean {\n  if (type1 === type2) {\n    return true;\n  }\n  if (type1.typeID !== type2.typeID) {\n    return false;\n  }\n  switch (type1.typeID) {\n    case TypeID.integer:\n    case TypeID.anyTypification:\n      return true;\n    case TypeID.basic:\n      return type1.baseID === (type2 as EchelonBase).baseID;\n    case TypeID.collection:\n      return checkEquality(type1.base, (type2 as EchelonCollection).base);\n    case TypeID.tuple: {\n      if (type1.factors.length !== (type2 as EchelonTuple).factors.length) {\n        return false;\n      }\n      for (let index = 0; index < type1.factors.length; ++index) {\n        if (!checkEquality(type1.factors[index], (type2 as EchelonTuple).factors[index])) {\n          return false;\n        }\n      }\n      return true;\n    }\n  }\n}\n\n/** Merge two types to get result of binary operation. */\nexport function mergeTypifications(type1: Typification, type2: Typification): Typification | null {\n  if (type1 === type2) {\n    return type1;\n  }\n  if (type1.typeID === TypeID.anyTypification) {\n    return isTypification(type2) ? type2 : null;\n  }\n  if (type2.typeID === TypeID.anyTypification) {\n    return isTypification(type1) ? type1 : null;\n  }\n\n  switch (type1.typeID) {\n    case TypeID.integer:\n    case TypeID.basic:\n      return commonType(type1, type2);\n    case TypeID.collection:\n      if (type2.typeID !== TypeID.collection) {\n        return null;\n      }\n      const base = mergeTypifications(type1.base, type2.base);\n      return base ? bool(base) : null;\n    case TypeID.tuple:\n      if (type2.typeID !== TypeID.tuple) {\n        return null;\n      }\n      if (type1.factors.length !== type2.factors.length) {\n        return null;\n      }\n      const components: Typification[] = [];\n      for (let index = 0; index < type1.factors.length; ++index) {\n        const component = mergeTypifications(type1.factors[index], type2.factors[index]);\n        if (component === null) {\n          return null;\n        }\n        components.push(component);\n      }\n      return tuple(components);\n  }\n}\n\n/** Check compatibility of typifications. */\nexport function checkCompatibility(type1: ExpressionType, type2: ExpressionType): boolean {\n  if (type1 === type2) {\n    return true;\n  }\n  if (type1.typeID === TypeID.anyTypification) {\n    return isTypification(type2);\n  }\n  if (type2.typeID === TypeID.anyTypification) {\n    return isTypification(type1);\n  }\n  if (isTypification(type1) !== isTypification(type2)) {\n    return false;\n  }\n  if (\n    type1.typeID === TypeID.integer ||\n    type1.typeID === TypeID.basic ||\n    type2.typeID === TypeID.integer ||\n    type2.typeID === TypeID.basic\n  ) {\n    return commonType(type1 as Typification, type2 as Typification) !== null;\n  }\n\n  if (type1.typeID !== type2.typeID) {\n    return false;\n  }\n  switch (type1.typeID) {\n    case TypeID.collection:\n      return checkCompatibility(type1.base, (type2 as EchelonCollection).base);\n    case TypeID.tuple:\n      if (type1.factors.length !== (type2 as EchelonTuple).factors.length) {\n        return false;\n      }\n      for (let index = 0; index < type1.factors.length; ++index) {\n        if (!checkCompatibility(type1.factors[index], (type2 as EchelonTuple).factors[index])) {\n          return false;\n        }\n      }\n      return true;\n    case TypeID.logic:\n    case TypeID.predicate:\n    case TypeID.function:\n      return false;\n  }\n}\n\n/** Compare typification with substitutions. */\nexport function compareTemplated(\n  substitutes: Map<string, Typification>,\n  arg: Typification,\n  value: Typification\n): boolean {\n  if (arg === value) {\n    return true;\n  }\n  if (arg.typeID === TypeID.basic && isRadical(arg.baseID)) {\n    if (!substitutes.has(arg.baseID)) {\n      substitutes.set(arg.baseID, value);\n      return true;\n    } else {\n      const mergeType = mergeTypifications(substitutes.get(arg.baseID)!, value);\n      if (mergeType === null) {\n        return false;\n      }\n      substitutes.set(arg.baseID, mergeType);\n      return true;\n    }\n  }\n  if (value.typeID === TypeID.anyTypification) {\n    return true;\n  }\n  if (\n    arg.typeID === TypeID.integer ||\n    arg.typeID === TypeID.basic ||\n    value.typeID === TypeID.integer ||\n    value.typeID === TypeID.basic\n  ) {\n    return commonType(arg, value) !== null;\n  }\n  if (arg.typeID !== value.typeID) {\n    return false;\n  }\n  switch (arg.typeID) {\n    case TypeID.collection:\n      return compareTemplated(substitutes, arg.base, (value as EchelonCollection).base);\n    case TypeID.tuple: {\n      if (arg.factors.length !== (value as EchelonTuple).factors.length) {\n        return false;\n      }\n      for (let index = 0; index < arg.factors.length; ++index) {\n        if (!compareTemplated(substitutes, arg.factors[index], (value as EchelonTuple).factors[index])) {\n          return false;\n        }\n      }\n      return true;\n    }\n  }\n}\n\n/** Apply substitutions to typification. */\nexport function substituteBase(target: Typification, substitutes: Map<string, Typification>): void {\n  switch (target.typeID) {\n    case TypeID.basic: {\n      if (substitutes.has(target.baseID)) {\n        Object.assign(target, substitutes.get(target.baseID)!);\n      }\n      return;\n    }\n    case TypeID.collection: {\n      substituteBase(target.base, substitutes);\n      return;\n    }\n    case TypeID.tuple: {\n      for (const factor of target.factors) {\n        substituteBase(factor, substitutes);\n      }\n      return;\n    }\n  }\n}\n\n/** Extract bases from typification. */\nexport function extractBases(target: ExpressionType): Set<string> {\n  return new Set(extractBasesImpl(target));\n}\n\n/** Apply type path to typification. */\nexport function applyPath(target: Typification, path: TypePath, index = 0): Typification | null {\n  let current: Typification | null = target;\n  let i = index;\n  while (i < path.length && current) {\n    switch (current.typeID) {\n      case TypeID.anyTypification:\n      case TypeID.integer:\n      case TypeID.basic:\n        return null;\n      case TypeID.collection:\n        current = current.base;\n        i++;\n        break;\n      case TypeID.tuple:\n        current = component(current, path[i]);\n        if (current === null) {\n          return null;\n        }\n        i++;\n        break;\n    }\n  }\n  return current;\n}\n\n// ===== Internals =====\nfunction commonType(type1: Typification, type2: Typification): Typification | null {\n  if (type1 === type2) {\n    return type1;\n  }\n  const int1 = 'isIntegerCompatible' in type1 && type1.isIntegerCompatible;\n  const int2 = 'isIntegerCompatible' in type2 && type2.isIntegerCompatible;\n  if (!int1 || !int2) {\n    if (type1.typeID === TypeID.basic && type2.typeID === TypeID.basic) {\n      return type1.baseID === type2.baseID ? type1 : null;\n    }\n    return null;\n  }\n  if (type1.typeID === TypeID.integer) {\n    return type2;\n  } else if (type2.typeID === TypeID.integer) {\n    return type1;\n  } else {\n    return IntegerT;\n  }\n}\n\nfunction extractBasesImpl(target: ExpressionType): string[] {\n  switch (target.typeID) {\n    case TypeID.basic:\n      return [target.baseID];\n    case TypeID.collection:\n      return extractBasesImpl(target.base);\n    case TypeID.tuple:\n      return target.factors.reduce((result, factor) => result.concat(extractBasesImpl(factor)), [] as string[]);\n    case TypeID.function:\n      const result = extractBasesImpl(target.result);\n      return target.args.reduce((result, arg) => result.concat(extractBasesImpl(arg.type)), result);\n    case TypeID.predicate:\n      return target.args.reduce((result, arg) => result.concat(extractBasesImpl(arg.type)), [] as string[]);\n    default:\n      return [];\n  }\n}\n","/* Module: Calculation for RSLang. */\n\n/** Represents computability class. */\nexport const ValueClass = {\n  VALUE: 'value',\n  PROPERTY: 'property'\n} as const;\nexport type ValueClass = (typeof ValueClass)[keyof typeof ValueClass];\n\n/** ValueClass context. */\nexport type ValueClassContext = Map<string, ValueClass>;\n","/**\n * Module: Models for formal representation for systems of concepts.\n */\n\nimport { type Graph } from '../graph';\nimport { type AnalysisBase, type ExpressionType, type RSLangAnalyzer, type TypePath } from '../rslang';\n\nimport { type CurrentVersion, type LibraryItem, type LibraryItemReference, type VersionInfo } from './library';\n\n/** Represents {@link Constituenta} type. */\nexport const CstType = {\n  NOMINAL: 'nominal',\n  BASE: 'basic',\n  STRUCTURED: 'structure',\n  TERM: 'term',\n  AXIOM: 'axiom',\n  FUNCTION: 'function',\n  PREDICATE: 'predicate',\n  CONSTANT: 'constant',\n  STATEMENT: 'statement'\n} as const;\nexport type CstType = (typeof CstType)[keyof typeof CstType];\n\n/** Represents attribution of a {@link Constituenta} to another {@link Constituenta}. */\nexport interface Attribution {\n  container: number;\n  attribute: number;\n}\n\n/** Represents global identifier type info. */\nexport interface TypeInfo {\n  alias: string;\n  type: ExpressionType;\n}\n\n/** Represents function argument value. */\nexport interface ArgumentValue {\n  alias: string;\n  typification: string;\n  value?: string;\n}\n\n/** Represents Constituenta classification in terms of system of concepts. */\nexport const CstClass = {\n  NOMINAL: 'nominal',\n  BASIC: 'basic',\n  DERIVED: 'derived',\n  STATEMENT: 'statement',\n  TEMPLATE: 'template'\n} as const;\nexport type CstClass = (typeof CstClass)[keyof typeof CstClass];\n\n/** Represents formal expression Status. */\nexport const CstStatus = {\n  VERIFIED: 'verified',\n  INCORRECT: 'incorrect',\n  INCALCULABLE: 'incalculable',\n  PROPERTY: 'property',\n  UNKNOWN: 'unknown'\n} as const;\nexport type CstStatus = (typeof CstStatus)[keyof typeof CstStatus];\n\n/** Represents substitution of {@link Constituenta}. */\nexport interface Substitution {\n  original: number;\n  substitution: number;\n}\n\n/** Represents word form for natural language. */\ninterface TermForm {\n  text: string;\n  tags: string;\n}\n\n/** Represents Constituenta. */\nexport interface Constituenta {\n  id: number;\n  crucial: boolean;\n  alias: string;\n  convention: string;\n  cst_type: CstType;\n  definition_formal: string;\n  definition_raw: string;\n  definition_resolved: string;\n  term_raw: string;\n  term_resolved: string;\n  term_forms: TermForm[];\n  attributes: number[];\n\n  /** Manual typification of the constituent */\n  typification_manual: string;\n\n  /** Controls whether base concepts expose property values or full values */\n  value_is_property: boolean;\n\n  homonyms: number[];\n  formalDuplicates: number[];\n  analysis: AnalysisBase;\n\n  /** Typification used for dependents, model values, and display (manual when it overrides computed). */\n  effectiveType: ExpressionType | null;\n\n  /**\n   * True when manual typification is non-empty, parses to a type, and its label differs from the\n   * typification inferred from the formal definition ({@link Constituenta.analysis}.type).\n   */\n  is_type_mismatch: boolean;\n\n  /** Identifier of {@link LibraryItem} containing this {@link Constituenta}. */\n  schema: number;\n\n  /** {@link CstClass} of this {@link Constituenta}. */\n  cst_class: CstClass;\n  /** {@link CstStatus} of this {@link Constituenta}. */\n  status: CstStatus;\n\n  /** Indicates if this {@link Constituenta} is a template. */\n  is_template: boolean;\n  /** Indicates if this {@link Constituenta} has a simple expression. */\n  is_simple_expression: boolean;\n\n  /** Index of {@link LibraryItem} that contains this cst (or inheritance parent).\n   *  0 - not inherited, 1 - inherited by 1st schema, 2 - inherited by 2nd schema, etc.\n   */\n  parent_schema_index: number;\n  /** {@link LibraryItem} that contains parent of this inherited {@link Constituenta}. */\n  parent_schema: number | null;\n  /** Indicates if this {@link Constituenta} is inherited. */\n  is_inherited: boolean;\n  /** Indicates if this {@link Constituenta} has children that are inherited. */\n  has_inherited_children: boolean;\n\n  /** {@link Constituenta} that spawned this one. */\n  spawner?: number;\n  /** Alias of {@link Constituenta} that spawned this one. */\n  spawner_alias?: string;\n  /** Structure path that spawned this one. */\n  spawner_path?: TypePath;\n\n  /** List of {@link Constituenta} that are spawned by this one. */\n  spawn: number[];\n  /** List of aliases of {@link Constituenta} that are spawned by this one. */\n  spawn_alias: string[];\n}\n\n/** Represents {@link RSForm} statistics. */\nexport interface RSFormStats {\n  step_complexity: number;\n\n  /** Total number of constituents in the RSForm. */\n  count_all: number;\n  /** Number of crucial constituents in the RSForm. */\n  count_crucial: number;\n\n  count_problematic: number;\n  /** Constituents that have same term. */\n  count_homonyms: number;\n  /** Constituents that have same formal definition and term. */\n  count_formal_duplicates: number;\n  /** Base constituents with no convention and alias. */\n  count_missing_convention: number;\n  /** Constituents with non-empty manual typification that disagrees with inferred typification. */\n  count_type_mismatch: number;\n\n  count_incorrect: number;\n  count_property: number;\n  count_incalculable: number;\n  count_inherited: number;\n\n  count_text_term: number;\n  count_definition: number;\n  count_convention: number;\n  count_comment: number;\n\n  count_base: number;\n  count_constant: number;\n  count_structured: number;\n  count_axiom: number;\n  count_term: number;\n  count_function: number;\n  count_predicate: number;\n  count_statement: number;\n  count_nominal: number;\n}\n\n/** Represents inheritance data for {@link RSForm}. */\ninterface InheritanceInfo {\n  child: number;\n  child_source: number;\n  parent: number;\n  parent_source: number;\n}\n\n/** Represents formal explication for set of concepts. */\nexport interface RSForm extends LibraryItem {\n  /** Whether this RSForm was produced (vs imported or inherited) */\n  is_produced: boolean;\n  /** Whether this RSForm has attribution feature */\n  is_attributive: boolean;\n  /** List of user IDs who can edit this RSForm */\n  editors: number[];\n  /** Information about the current version of this RSForm */\n  version: CurrentVersion;\n  /** Full version history of this RSForm */\n  versions: VersionInfo[];\n\n  /** Full list of constituents in the RSForm */\n  items: Constituenta[];\n  /** List of inheritance relationships between constituents */\n  inheritance: InheritanceInfo[];\n  /** List of constituent attribution relationships */\n  attribution: Attribution[];\n  /** References to Operational Schemes/Systems associated with the RSForm */\n  oss: LibraryItemReference[];\n  /** References to conceptual models associated with the RSForm */\n  models: LibraryItemReference[];\n\n  /** Analyzer instance for RS language features and validation */\n  analyzer: RSLangAnalyzer;\n  /** Graph structure representing formal dependencies between constituents */\n  graph: Graph;\n  /** Graph structure representing attribution relationships */\n  attribution_graph: Graph;\n  /** Map for quick lookup of constituents by alias */\n  cstByAlias: Map<string, Constituenta>;\n  /** Map for quick lookup of constituents by ID */\n  cstByID: Map<number, Constituenta>;\n}\n","/**\n * Module: API for formal representation for systems of concepts.\n */\n\nimport {\n  type AnalysisFull,\n  RSErrorCode,\n  TypeClass,\n  TypeID,\n  type TypePath,\n  type Typification,\n  ValueClass\n} from '../rslang';\nimport { basic, bool, constant, type EchelonFunctional, isTypification } from '../rslang/semantic/typification';\nimport { applyPath } from '../rslang/semantic/typification-api';\n\nimport { type LibraryItem } from './library';\nimport {\n  type ArgumentValue,\n  type Constituenta,\n  CstClass,\n  CstStatus,\n  CstType,\n  type RSForm,\n  type RSFormStats\n} from './rsform';\n\n/** Record of {@link CstType} prefixes. */\nconst CST_TYPE_PREFIX: Record<CstType, string> = {\n  [CstType.NOMINAL]: 'N',\n  [CstType.BASE]: 'X',\n  [CstType.CONSTANT]: 'C',\n  [CstType.STRUCTURED]: 'S',\n  [CstType.AXIOM]: 'A',\n  [CstType.TERM]: 'D',\n  [CstType.FUNCTION]: 'F',\n  [CstType.PREDICATE]: 'P',\n  [CstType.STATEMENT]: 'T'\n};\n\n/** Record of {@link CstType} to {@link CstClass} mapping. */\nconst CST_TYPE_TO_CLASS: Record<CstType, CstClass> = {\n  [CstType.NOMINAL]: CstClass.NOMINAL,\n  [CstType.BASE]: CstClass.BASIC,\n  [CstType.CONSTANT]: CstClass.BASIC,\n  [CstType.STRUCTURED]: CstClass.BASIC,\n  [CstType.TERM]: CstClass.DERIVED,\n  [CstType.FUNCTION]: CstClass.DERIVED,\n  [CstType.AXIOM]: CstClass.STATEMENT,\n  [CstType.PREDICATE]: CstClass.DERIVED,\n  [CstType.STATEMENT]: CstClass.STATEMENT\n};\n\n/** Checks if {@link Constituenta} is a schema issue. */\nexport function isSchemaIssue(cst: Constituenta): boolean {\n  if (\n    cst.homonyms.length > 0 ||\n    cst.formalDuplicates.length > 0 ||\n    cst.status === CstStatus.INCORRECT ||\n    cst.status === CstStatus.INCALCULABLE ||\n    cst.is_type_mismatch\n  ) {\n    return true;\n  }\n  if (isBasicConcept(cst.cst_type) && !isLogical(cst.cst_type)) {\n    if (!cst.convention || !cst.term_resolved) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/** Infers the status of an expression based on parsing and value information. */\nexport function inferStatus(parse: boolean, value?: ValueClass | null): CstStatus {\n  if (!parse) {\n    return CstStatus.INCORRECT;\n  }\n  if (value === null) {\n    return CstStatus.INCALCULABLE;\n  }\n  if (value === ValueClass.PROPERTY) {\n    return CstStatus.PROPERTY;\n  }\n  return CstStatus.VERIFIED;\n}\n\n/** Infers type of constituent for a given template and arguments. */\nexport function inferTemplatedType(templateType: CstType, args: ArgumentValue[]): CstType {\n  if (args.length === 0 || args.some(arg => !arg.value)) {\n    return templateType;\n  } else if (templateType === CstType.PREDICATE) {\n    return CstType.AXIOM;\n  } else {\n    return CstType.TERM;\n  }\n}\n\n/** Checks if given expression is a template. */\nexport function inferTemplate(expression: string): boolean {\n  const match = expression.match(/R\\d+/g);\n  return (match && match?.length > 0) ?? false;\n}\n\n/** Infers the {@link CstClass} based on the provided {@link CstType} and template status. */\nexport function inferClass(type: CstType, isTemplate: boolean = false): CstClass {\n  if (isTemplate) {\n    return CstClass.TEMPLATE;\n  }\n  return CST_TYPE_TO_CLASS[type];\n}\n\n/** Check if {@link Constituenta} is a template or a category. */\nexport function isTemplateCst(cst: Constituenta): boolean {\n  return cst.cst_type === CstType.FUNCTION || cst.cst_type === CstType.PREDICATE || cst.cst_type === CstType.STATEMENT;\n}\n\n/** Apply filter based on start {@link Constituenta} type. */\nexport function applyFilterCategory(start: Constituenta, items: Constituenta[]): Constituenta[] {\n  const startIndex = items.indexOf(start);\n  if (startIndex === -1) {\n    return [];\n  }\n  const nextCategoryIndex = items.findIndex((cst, index) => index > startIndex && cst.cst_type === CstType.STATEMENT);\n\n  return items.filter((_, index) => index >= startIndex && (nextCategoryIndex === -1 || index < nextCategoryIndex));\n}\n\n/** Prefix for alias indicating {@link CstType}. */\nexport function getCstTypePrefix(type: CstType): string {\n  return CST_TYPE_PREFIX[type];\n}\n\n/** Guess {@link CstType} from user input hint. */\nexport function guessCstType(hint: string): CstType | null {\n  if (hint.length !== 1) {\n    return null;\n  }\n  for (const [type, prefix] of Object.entries(CST_TYPE_PREFIX)) {\n    if (hint === prefix) {\n      return type as CstType;\n    }\n  }\n  return null;\n}\n\n/** Evaluate if {@link CstType} is basic concept. */\nexport function isBasicConcept(type: CstType): boolean {\n  switch (type) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n      return true;\n\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is base set or constant set. */\nexport function isBaseSet(type: CstType): boolean {\n  switch (type) {\n    case CstType.BASE:\n    case CstType.CONSTANT:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is a function. */\nexport function isFunctional(type: CstType): boolean {\n  switch (type) {\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n    case CstType.TERM:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is logical. */\nexport function isLogical(type: CstType): boolean {\n  switch (type) {\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return false;\n  }\n}\n\n/** Evaluate if {@link Constituenta} can be used produce structure. */\nexport function canProduceStructure(cst: Constituenta): boolean {\n  switch (cst.cst_type) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n    case CstType.PREDICATE:\n      return false;\n  }\n  if (!cst.effectiveType) {\n    return false;\n  }\n  if (cst.cst_type === CstType.FUNCTION) {\n    const result = (cst.effectiveType as EchelonFunctional).result;\n    return typeCanProduceStructure(result);\n  }\n  if (!isTypification(cst.effectiveType)) {\n    return false;\n  }\n  return typeCanProduceStructure(cst.effectiveType as Typification);\n}\n\n/** Evaluate if {@link CstType} can have manual typification. */\nexport function canHaveManualTypification(type: CstType): boolean {\n  switch (type) {\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Validate new alias against {@link CstType} and {@link RSForm}. */\nexport function validateNewAlias(alias: string, type: CstType, schema: RSForm): boolean {\n  if (alias.length < 2) {\n    return false;\n  }\n  const prefix = getCstTypePrefix(type);\n  if (!alias.startsWith(prefix)) {\n    return false;\n  }\n  if (schema.cstByAlias.has(alias)) {\n    return false;\n  }\n  if (!/^\\d+$/.exec(alias.substring(prefix.length))) {\n    return false;\n  }\n  return true;\n}\n\n/** Generate alias for new {@link Constituenta} of a given {@link CstType} for current {@link RSForm}. */\nexport function generateAlias(type: CstType, schema: RSForm, takenAliases: string[] = []): string {\n  const prefix = getCstTypePrefix(type);\n  if (schema.items.length <= 0) {\n    return `${prefix}1`;\n  }\n  let index = schema.items.reduce((prev, cst, index) => {\n    if (cst.cst_type !== type) {\n      return prev;\n    }\n    index = Number(cst.alias.slice(1 - cst.alias.length)) + 1;\n    return Math.max(prev, index);\n  }, 1);\n  let alias = `${prefix}${index}`;\n  while (takenAliases.includes(alias)) {\n    index = index + 1;\n    alias = `${prefix}${index}`;\n  }\n  return alias;\n}\n\n/**\n * Id to pass as `insert_after` when creating a new {@link Constituenta} spawned by `targetId`:\n * after the last existing child of that spawner, or after the spawner itself if none.\n */\nexport function inferNewSpawnPosition(schema: RSForm, targetId: number): number {\n  let last: number | null = null;\n  for (const cst of schema.items) {\n    if (cst.spawner === targetId) {\n      last = cst.id;\n    }\n  }\n  return last ?? targetId;\n}\n\n/** Sorts library items relevant for InlineSynthesis with specified {@link RSForm}. */\nexport function sortItemsForInlineSynthesis(receiver: RSForm, items: readonly LibraryItem[]): LibraryItem[] {\n  const result = items.filter(item => item.location === receiver.location);\n  for (const item of items) {\n    if (item.visible && item.owner === item.owner && !result.includes(item)) {\n      result.push(item);\n    }\n  }\n  for (const item of items) {\n    if (item.visible && !result.includes(item)) {\n      result.push(item);\n    }\n  }\n  for (const item of items) {\n    if (!result.includes(item)) {\n      result.push(item);\n    }\n  }\n  return result;\n}\n\n/** Remove alias from expression. */\nexport function removeAliasReference(expression: string, alias: string): string {\n  const result = expression.replaceAll(new RegExp(`\\\\b${alias}\\\\b`, 'g'), 'DEL');\n  return result === 'DEL' ? '' : result;\n}\n\n/** Add alias to expression. */\nexport function addAliasReference(expression: string, alias: string): string {\n  return expression + ' ' + alias;\n}\n\n/** Returns expected {@link TypeClass} of formal definition for {@link CstType}. */\nexport function typeClassForCstType(cstType: CstType): TypeClass {\n  switch (cstType) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n      return TypeClass.typification;\n    case CstType.FUNCTION:\n      return TypeClass.function;\n    case CstType.PREDICATE:\n      return TypeClass.predicate;\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return TypeClass.logic;\n  }\n}\n\n/** Checks whether a constituenta type supports formal definitions. */\nexport function canHaveFormalDefinition(cstType: CstType): boolean {\n  return cstType !== CstType.BASE && cstType !== CstType.CONSTANT;\n}\n\n/** Analyze expression for {@link RSForm}. */\nexport function getAnalysisFor(expression: string, cstType: CstType, schema: RSForm, alias?: string): AnalysisFull {\n  if (!canHaveFormalDefinition(cstType)) {\n    if (expression.trim().length === 0) {\n      const fallbackAlias = alias && alias.length > 0 ? alias : 'X0';\n      const type = cstType === CstType.BASE ? bool(basic(fallbackAlias)) : bool(constant(fallbackAlias));\n      return {\n        success: true,\n        type,\n        valueClass: ValueClass.VALUE,\n        errors: [],\n        ast: null\n      };\n    }\n    return {\n      success: false,\n      type: null,\n      valueClass: null,\n      errors: [\n        {\n          code: RSErrorCode.definitionNotAllowed,\n          from: 0,\n          to: Math.max(0, expression.length - 1)\n        }\n      ],\n      ast: null\n    };\n  }\n  return schema.analyzer.checkFull(expression, {\n    expected: typeClassForCstType(cstType),\n    isDomain: cstType === CstType.STRUCTURED\n  });\n}\n\n/** Calculate statistics for {@link RSForm}. */\nexport function calculateSchemaStats(target: RSForm): RSFormStats {\n  const items = target.items;\n  return {\n    count_all: items.length,\n    count_crucial: items.reduce((sum, cst) => sum + (cst.crucial ? 1 : 0), 0),\n\n    step_complexity: items.reduce((sum, cst) => sum + calculateStepComplexity(cst), 0),\n\n    count_problematic: items.reduce((sum, cst) => sum + (isSchemaIssue(cst) ? 1 : 0), 0),\n    count_homonyms: items.reduce((sum, cst) => sum + (cst.homonyms.length > 0 ? 1 : 0), 0),\n    count_formal_duplicates: items.reduce((sum, cst) => sum + (cst.formalDuplicates.length > 0 ? 1 : 0), 0),\n    count_missing_convention: items.reduce((sum, cst) => sum + (isMissingConvention(cst) ? 1 : 0), 0),\n    count_type_mismatch: items.reduce((sum, cst) => sum + (cst.is_type_mismatch ? 1 : 0), 0),\n\n    count_incorrect: items.reduce((sum, cst) => sum + (cst.status === CstStatus.INCORRECT ? 1 : 0), 0),\n    count_property: items.reduce((sum, cst) => sum + (cst.analysis?.valueClass === ValueClass.PROPERTY ? 1 : 0), 0),\n    count_incalculable: items.reduce(\n      (sum, cst) => sum + (cst.analysis?.success && cst.analysis.valueClass === null ? 1 : 0),\n      0\n    ),\n    count_inherited: items.reduce((sum, cst) => sum + (cst.is_inherited ? 1 : 0), 0),\n\n    count_text_term: items.reduce((sum, cst) => sum + (cst.term_raw ? 1 : 0), 0),\n    count_definition: items.reduce((sum, cst) => sum + (cst.definition_raw ? 1 : 0), 0),\n    count_convention: items.reduce((sum, cst) => sum + (isBasicConcept(cst.cst_type) && cst.convention ? 1 : 0), 0),\n    count_comment: items.reduce((sum, cst) => sum + (!isBasicConcept(cst.cst_type) && !cst.convention ? 1 : 0), 0),\n\n    count_base: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.BASE ? 1 : 0), 0),\n    count_constant: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.CONSTANT ? 1 : 0), 0),\n    count_structured: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.STRUCTURED ? 1 : 0), 0),\n    count_axiom: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.AXIOM ? 1 : 0), 0),\n    count_term: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.TERM ? 1 : 0), 0),\n    count_function: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.FUNCTION ? 1 : 0), 0),\n    count_predicate: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.PREDICATE ? 1 : 0), 0),\n    count_statement: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.STATEMENT ? 1 : 0), 0),\n    count_nominal: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.NOMINAL ? 1 : 0), 0)\n  };\n}\n\n/** Finds {@link Constituenta} by structure path. */\nexport function findCstByStructure(schema: RSForm, target: Constituenta, path: TypePath): Constituenta | null {\n  for (const cst of schema.items) {\n    if (cst.spawner === target.id && cst.spawner_path) {\n      if (cst.spawner_path.length === path.length && cst.spawner_path.every((v, i) => v === path[i])) {\n        return cst;\n      }\n    }\n  }\n  return null;\n}\n\n/** Retrieves name for piece of target {@link Constituenta} structure. */\nexport function getStructureName(schema: RSForm, target: Constituenta, path: TypePath): string {\n  const representation = findCstByStructure(schema, target, path);\n  if (representation) {\n    return `${representation.alias}: ${representation.term_resolved}`;\n  }\n  if (!isTypification(target.effectiveType)) {\n    return '';\n  }\n  const type = applyPath(target.effectiveType as Typification, path);\n  if (type?.typeID === TypeID.basic) {\n    const cst = schema.cstByAlias.get(type.baseID);\n    if (cst?.term_resolved) {\n      return `${cst.alias}: ${cst.term_resolved}`;\n    }\n  }\n  return '';\n}\n\n// ========= Internals =====\nfunction calculateStepComplexity(cst: Constituenta): number {\n  if (cst.cst_type === CstType.AXIOM || cst.cst_type === CstType.NOMINAL || !isBasicConcept(cst.cst_type)) {\n    return 0;\n  }\n  if (cst.cst_type === CstType.BASE || cst.cst_type === CstType.CONSTANT || !cst.effectiveType) {\n    return 1;\n  }\n\n  const type = cst.effectiveType as Typification;\n  return calculateTypificationComplexity(type) + 1;\n}\n\nfunction calculateTypificationComplexity(type: Typification): number {\n  switch (type.typeID) {\n    case TypeID.basic:\n    case TypeID.integer:\n    case TypeID.anyTypification:\n      return 0;\n    case TypeID.tuple:\n      return (\n        type.factors.length + type.factors.reduce((sum, factor) => sum + calculateTypificationComplexity(factor), 0)\n      );\n    case TypeID.collection:\n      if (type.base.typeID === TypeID.tuple) {\n        let sum = 0;\n        type.base.factors.forEach(factor => {\n          sum += calculateTypificationComplexity(factor);\n        });\n        return sum + type.base.factors.length;\n      } else if (type.base.typeID === TypeID.collection) {\n        return calculateTypificationComplexity(type.base) + 1;\n      }\n      return 0;\n  }\n}\n\nfunction isMissingConvention(cst: Constituenta): boolean {\n  if (isBasicConcept(cst.cst_type) && !isLogical(cst.cst_type)) {\n    if (!cst.convention || !cst.term_resolved) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/** Evaluate if {@link Typification} can be used to produce structure. */\nfunction typeCanProduceStructure(type: Typification): boolean {\n  if (type.typeID === TypeID.basic || type.typeID === TypeID.integer || type.typeID === TypeID.anyTypification) {\n    return false;\n  } else if (type.typeID === TypeID.tuple) {\n    return true;\n  } else {\n    return (\n      type.base.typeID !== TypeID.basic &&\n      type.base.typeID !== TypeID.integer &&\n      type.base.typeID !== TypeID.anyTypification\n    );\n  }\n}\n","import { type Value } from '../rslang';\n\nimport { type LibraryItem } from './library';\nimport { type RSFormStats } from './rsform';\n\nexport const TYPE_BASIC = 'basic';\n\n/** Evaluation status enumeration. */\nexport const EvalStatus = {\n  NO_EVAL: 1, // не вычисляется\n  NOT_PROCESSED: 2, // Интерпретация не вычислялась\n  INVALID_DATA: 3, // Неверные данные\n  EVAL_FAIL: 4, // Ошибка при вычислении\n  AXIOM_FALSE: 5, // Значение аксиомы = FALSE\n  EMPTY: 6, // Значение пусто\n  HAS_DATA: 7 // Интерпретация вычислена и не пуста\n} as const;\nexport type EvalStatus = (typeof EvalStatus)[keyof typeof EvalStatus];\n\n/** Represents basic element binding. */\nexport type BasicBinding = Record<number, string>;\n\n/** Represents {@link RSModel} basic sets binding. */\nexport type BasicsContext = Map<number, BasicBinding>;\n\n/** Default value for structured data. */\nexport const DEFAULT_VALUE_TEXT = 'N/A';\n\ninterface RSModelData extends LibraryItem {\n  editors: number[];\n  schema: number;\n  items: {\n    id: number;\n    type: string;\n    value: Value | BasicBinding;\n  }[];\n}\n\n/** Represents {@link RSModel} structured data. */\nexport type RSModel = RSModelData;\n\n/** Represents {@link RSModel} statistics. */\nexport interface RSModelStats extends RSFormStats {\n  count_missing_base: number;\n  count_false_axioms: number;\n  count_invalid_data: number;\n  count_invalid_calculations: number;\n  count_empty_terms: number;\n  base_elements: number;\n}\n","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":";AAEO,IAAM,cAAc;;;ACCpB,IAAM,UAAU;AAAA;AAAA,EAErB,OAAO;AAAA,EAEP,UAAU;AAAA,EACV,WAAW;AAAA,EACX,aAAa;AAAA,EACb,cAAc;AAAA,EACd,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,mBAAmB;AAAA,EACnB,cAAc;AAAA;AAAA,EAGd,MAAM;AAAA,EACN,OAAO;AAAA,EACP,UAAU;AAAA;AAAA,EAGV,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,eAAe;AAAA,EACf,cAAc;AAAA;AAAA,EAGd,OAAO;AAAA,EACP,UAAU;AAAA;AAAA,EAGV,mBAAmB;AAAA,EACnB,gBAAgB;AAAA,EAChB,WAAW;AAAA,EACX,kBAAkB;AAAA,EAClB,mBAAmB;AAAA,EACnB,UAAU;AAAA,EACV,WAAW;AAAA;AAAA,EAGX,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,QAAQ;AAAA,EACR,cAAc;AAAA,EACd,YAAY;AAAA;AAAA,EAGZ,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,kBAAkB;AAAA,EAClB,WAAW;AAAA,EACX,qBAAqB;AAAA,EACrB,SAAS;AAAA;AAAA,EAGT,OAAO;AAAA,EACP,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,QAAQ;AAAA;AAAA,EAGR,aAAa;AAAA,EACb,WAAW;AAAA,EACX,YAAY;AAAA,EAEZ,SAAS;AAAA,EACT,QAAQ;AAAA;AAAA,EAGR,oBAAoB;AAAA,EACpB,oBAAoB;AAAA,EACpB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,uBAAuB;AAAA;AAAA,EAGvB,cAAc;AAAA,EACd,UAAU;AAAA,EACV,gBAAgB;AAAA,EAChB,eAAe;AAAA,EACf,aAAa;AAAA,EAEb,oBAAoB;AAAA,EACpB,cAAc;AAAA,EACd,cAAc;AAAA,EAEd,qBAAqB;AAAA,EACrB,oBAAoB;AAAA,EACpB,mBAAmB;AAAA,EACnB,oBAAoB;AAAA;AAAA,EAGpB,WAAW;AAAA,EACX,KAAK;AACP;;;ACjGO,IAAM,SAAS;AAAA,EACpB,iBAAiB;AAAA,EACjB,SAAS;AAAA,EACT,OAAO;AAAA,EACP,OAAO;AAAA,EACP,YAAY;AAAA,EACZ,OAAO;AAAA,EACP,UAAU;AAAA,EACV,WAAW;AACb;AAIO,IAAM,YAAY;AAAA,EACvB,OAAO;AAAA,EACP,cAAc;AAAA,EACd,UAAU;AAAA,EACV,WAAW;AACb;AAIO,IAAM,SAAS,EAAE,QAAQ,OAAO,MAAM;AAGtC,IAAM,WAAW;AAAA,EACtB,QAAQ,OAAO;AAAA,EACf,WAAW;AAAA,EACX,cAAc;AAAA,EACd,qBAAqB;AACvB;AAWO,IAAM,mBAAmB,EAAE,QAAQ,OAAO,gBAAgB;AAG1D,IAAM,YAAY,KAAK,gBAAgB;AA4FvC,SAAS,KAAK,MAAuC;AAC1D,SAAO,EAAE,QAAQ,OAAO,YAAY,KAAK;AAC3C;;;AC0FO,SAAS,WAAW,MAA4B;AACrD,MAAI,CAAC,MAAM,QAAQ,IAAI,GAAG;AACxB,WAAO,OAAO,IAAI;AAAA,EACpB;AACA,QAAM,MAAM,KAAK;AACjB,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,KAAK,CAAC,MAAM;AAC5B,QAAM,QAAQ,UAAU,IAAI;AAE5B,MAAI,SAAS,UAAU,MAAM;AAC7B,WAAS,IAAI,OAAO,IAAI,KAAK,KAAK;AAChC,QAAI,IAAI,MAAO,WAAU;AACzB,cAAU,WAAW,KAAK,CAAC,CAAC;AAAA,EAC9B;AACA,YAAU,UAAU,MAAM;AAC1B,SAAO;AACT;AAiBO,SAAS,aAAa,MAAqC;AAChE,SAAO,MAAM,QAAQ,IAAI,KAAK,KAAK,SAAS,KAAK,KAAK,CAAC,MAAM;AAC/D;AAqHO,SAAS,aAAa,QAAe,MAA+B;AACzE,MAAI,UAAiB;AACrB,MAAI,IAAI;AACR,SAAO,IAAI,KAAK,QAAQ;AACtB,QAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,QAAQ,UAAU,KAAK,CAAC,GAAG;AACxD,aAAO;AAAA,IACT;AACA,cAAU,QAAQ,KAAK,CAAC,CAAC;AACzB;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,iBAAiB,MAA2B;AAC1D,UAAQ,KAAK,QAAQ;AAAA,IACnB,KAAK,OAAO;AAAA,IACZ,KAAK,OAAO;AAAA,IACZ,KAAK,OAAO;AACV,aAAO;AAAA,IACT,KAAK,OAAO;AACV,aAAO,CAAC;AAAA,IACV,KAAK,OAAO;AACV,aAAO,MAAM,KAAK,QAAQ,IAAI,UAAQ,iBAAiB,IAAI,CAAC,CAAC;AAAA,EACjE;AACF;AAGO,SAAS,eAAe,QAAsB,MAAiB,QAAsB;AAC1F,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO;AAAA,EACT;AACA,QAAM,CAAC,MAAM,GAAG,IAAI,IAAI;AACxB,QAAM,MAAM,MAAM,QAAQ,MAAM,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC;AACnD,MAAI,IAAI,IAAI,eAAe,IAAI,IAAI,GAAG,cAAc,IAAI,GAAG,MAAM;AACjE,SAAO;AACT;;;ACjaO,IAAM,WAAW;AAGjB,IAAM,kBAAkB;AAGxB,IAAM,aAAa;AAqBnB,SAAS,cAAc,MAA2B;AACvD,SAAO;AACT;AAMO,SAAS,QAAQ,IAAW,IAAmB;AACpD,QAAM,SAAkB,CAAC,EAAE;AAC3B,QAAM,SAAkB,CAAC,EAAE;AAE3B,SAAO,OAAO,SAAS,KAAK,OAAO,SAAS,GAAG;AAC7C,UAAM,MAAM,OAAO,IAAI;AACvB,UAAM,MAAM,OAAO,IAAI;AACvB,QAAI,QAAQ,KAAK;AACf;AAAA,IACF;AAEA,UAAM,QAAQ,OAAO;AACrB,UAAM,QAAQ,OAAO;AACrB,QAAI,UAAU,YAAY,UAAU,UAAU;AAC5C,YAAM,UAAW,MAAkB;AACnC,UAAI,YAAY,EAAG,QAAO;AAC1B;AAAA,IACF;AAEA,UAAM,WAAW,MAAM,QAAQ,GAAG;AAClC,UAAM,WAAW,MAAM,QAAQ,GAAG;AAClC,QAAI,CAAC,YAAY,CAAC,UAAU;AAC1B,YAAM,IAAI,MAAM,kCAAkC,WAAW,GAAI,CAAC,QAAQ,WAAW,GAAI,CAAC,EAAE;AAAA,IAC9F;AAEA,UAAM,OAAO;AACb,UAAM,OAAO;AACb,UAAM,OAAO,KAAK;AAClB,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS,MAAM;AACjB,aAAO,OAAO;AAAA,IAChB;AAEA,aAAS,IAAI,OAAO,GAAG,KAAK,GAAG,KAAK;AAClC,aAAO,KAAK,KAAK,CAAC,CAAC;AACnB,aAAO,KAAK,KAAK,CAAC,CAAC;AAAA,IACrB;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,MAAM,YAA4B;AAChD,SAAO,CAAC,UAAU,GAAG,UAAU;AACjC;;;ACvFA,SAAQ,gBAAe;AAChB,IAAM,SAAS,SAAS,YAAY;AAAA,EACzC,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM;AAAA,EACN,WAAW;AAAA,EACX,SAAS;AAAA,EACT,WAAW;AAAA,IACT,CAAC,YAAY,GAAE,KAAI,IAAG,GAAG;AAAA,IACzB,CAAC,YAAY,GAAE,KAAI,IAAG,GAAG;AAAA,EAC3B;AAAA,EACA,cAAc,CAAC,CAAC;AAAA,EAChB,iBAAiB;AAAA,EACjB,WAAW;AAAA,EACX,YAAY,CAAC,CAAC;AAAA,EACd,UAAU,EAAC,cAAa,CAAC,GAAE,CAAC,EAAC;AAAA,EAC7B,WAAW;AACb,CAAC;;;AClBM,IAKL,QAAQ;AALH,IAML,QAAQ;AANH,IASL,YAAY;AATP,IAWL,gBAAgB;AAXX,IAcL,UAAU;AAdL,IAeL,WAAW;AAfN,IAgBL,aAAa;AAhBR,IAiBL,SAAS;AAjBJ,IAkBL,UAAU;AAlBL,IAoBL,cAAc;AApBT,IAqBL,UAAU;AArBL,IAuBL,SAAS;AAvBJ,IAwBL,cAAc;AAxBT,IA2BL,aAAa;AA3BR,IA+BL,WAAW;AA/BN,IAgCL,QAAQ;AAhCH,IAiCL,UAAU;AAjCL,IAkCL,OAAO;AAlCF,IAmCL,OAAO;AAnCF,IAoCL,SAAS;AApCJ,IAqCL,MAAM;AArCD,IAsCL,gBAAgB;AAtCX,IAuCL,YAAY;AAvCP,IAwCL,cAAc;;;ACahB,IAAM,WAAoC;AAAA,EACxC,CAAC,MAAM,GAAG,QAAQ;AAAA,EAClB,CAAC,KAAK,GAAG,QAAQ;AAAA,EACjB,CAAC,OAAO,GAAG,QAAQ;AAAA,EACnB,CAAC,QAAQ,GAAG,QAAQ;AAAA,EACpB,CAAC,SAAS,GAAG,QAAQ;AAAA,EACrB,CAAC,OAAO,GAAG,QAAQ;AAAA,EACnB,CAAC,QAAQ,GAAG,QAAQ;AAAA,EACpB,CAAC,UAAU,GAAG,QAAQ;AAAA,EAEtB,CAAC,OAAO,GAAG,QAAQ;AAAA,EAEnB,CAAC,KAAK,GAAG,QAAQ;AAAA,EACjB,CAAC,OAAO,GAAG,QAAQ;AAAA,EACnB,CAAC,MAAM,GAAG,QAAQ;AAAA,EAElB,CAAC,IAAI,GAAG,QAAQ;AAAA,EAChB,CAAC,MAAM,GAAG,QAAQ;AAAA,EAClB,CAAC,GAAG,GAAG,QAAQ;AAAA,EACf,CAAC,IAAI,GAAG,QAAQ;AAAA,EAEhB,CAAC,WAAW,GAAG,QAAQ;AAAA,EACvB,CAAC,KAAK,GAAG,QAAQ;AAAA,EACjB,CAAC,SAAS,GAAG,QAAQ;AAAA,EACrB,CAAC,WAAW,GAAG,QAAQ;AAAA,EACvB,CAAC,aAAa,GAAG,QAAQ;AAAA,EACzB,CAAC,aAAa,GAAG,QAAQ;AAAA,EACzB,CAAC,WAAW,GAAG,QAAQ;AAAA,EACvB,CAAC,UAAU,GAAG,QAAQ;AACxB;;;AC1EA,IAAM,mBAAqD;AAAA,EACzD,CAAC,QAAQ,MAAM,GAAG;AAAA,EAClB,CAAC,QAAQ,cAAc,GAAG;AAAA,EAC1B,CAAC,QAAQ,cAAc,GAAG;AAAA,EAC1B,CAAC,QAAQ,iBAAiB,GAAG;AAAA,EAC7B,CAAC,QAAQ,cAAc,GAAG;AAAA,EAC1B,CAAC,QAAQ,SAAS,GAAG;AAAA,EACrB,CAAC,QAAQ,SAAS,GAAG;AAAA,EACrB,CAAC,QAAQ,QAAQ,GAAG;AAAA,EACpB,CAAC,QAAQ,iBAAiB,GAAG;AAAA,EAC7B,CAAC,QAAQ,gBAAgB,GAAG;AAAA,EAC5B,CAAC,QAAQ,YAAY,GAAG;AAAA,EACxB,CAAC,QAAQ,iBAAiB,GAAG;AAAA,EAC7B,CAAC,QAAQ,QAAQ,GAAG;AAAA,EACpB,CAAC,QAAQ,KAAK,GAAG;AAAA,EACjB,CAAC,QAAQ,QAAQ,GAAG;AAAA,EACpB,CAAC,QAAQ,aAAa,GAAG;AAAA,EACzB,CAAC,QAAQ,YAAY,GAAG;AAAA,EACxB,CAAC,QAAQ,MAAM,GAAG;AAAA,EAClB,CAAC,QAAQ,UAAU,GAAG;AAAA,EACtB,CAAC,QAAQ,YAAY,GAAG;AAAA,EACxB,CAAC,QAAQ,MAAM,GAAG;AAAA,EAClB,CAAC,QAAQ,UAAU,GAAG;AAAA,EACtB,CAAC,QAAQ,gBAAgB,GAAG;AAAA,EAC5B,CAAC,QAAQ,SAAS,GAAG;AAAA,EACrB,CAAC,QAAQ,SAAS,GAAG;AAAA,EACrB,CAAC,QAAQ,mBAAmB,GAAG;AAAA,EAC/B,CAAC,QAAQ,OAAO,GAAG;AAAA,EACnB,CAAC,QAAQ,mBAAmB,GAAG;AAAA,EAC/B,CAAC,QAAQ,kBAAkB,GAAG;AAAA,EAC9B,CAAC,QAAQ,iBAAiB,GAAG;AAAA,EAC7B,CAAC,QAAQ,KAAK,GAAG;AAAA,EACjB,CAAC,QAAQ,OAAO,GAAG;AAAA,EACnB,CAAC,QAAQ,MAAM,GAAG;AAAA,EAClB,CAAC,QAAQ,MAAM,GAAG;AAAA,EAClB,CAAC,QAAQ,IAAI,GAAG;AAAA,EAChB,CAAC,QAAQ,IAAI,GAAG;AAAA,EAChB,CAAC,QAAQ,MAAM,GAAG;AAAA,EAClB,CAAC,QAAQ,MAAM,GAAG;AAAA,EAClB,CAAC,QAAQ,OAAO,GAAG;AACrB;;;AC3BA,IAAM,gBAA2C;AAAA,EAC/C,CAAC,OAAO,eAAe,GAAG,UAAU;AAAA,EACpC,CAAC,OAAO,OAAO,GAAG,UAAU;AAAA,EAC5B,CAAC,OAAO,KAAK,GAAG,UAAU;AAAA,EAC1B,CAAC,OAAO,KAAK,GAAG,UAAU;AAAA,EAC1B,CAAC,OAAO,UAAU,GAAG,UAAU;AAAA,EAC/B,CAAC,OAAO,KAAK,GAAG,UAAU;AAAA,EAC1B,CAAC,OAAO,QAAQ,GAAG,UAAU;AAAA,EAC7B,CAAC,OAAO,SAAS,GAAG,UAAU;AAChC;;;AC5BO,IAAM,aAAa;AAAA,EACxB,OAAO;AAAA,EACP,UAAU;AACZ;;;ACIO,IAAM,UAAU;AAAA,EACrB,SAAS;AAAA,EACT,MAAM;AAAA,EACN,YAAY;AAAA,EACZ,MAAM;AAAA,EACN,OAAO;AAAA,EACP,UAAU;AAAA,EACV,WAAW;AAAA,EACX,UAAU;AAAA,EACV,WAAW;AACb;AAuBO,IAAM,WAAW;AAAA,EACtB,SAAS;AAAA,EACT,OAAO;AAAA,EACP,SAAS;AAAA,EACT,WAAW;AAAA,EACX,UAAU;AACZ;AAIO,IAAM,YAAY;AAAA,EACvB,UAAU;AAAA,EACV,WAAW;AAAA,EACX,cAAc;AAAA,EACd,UAAU;AAAA,EACV,SAAS;AACX;;;AC/BA,IAAM,kBAA2C;AAAA,EAC/C,CAAC,QAAQ,OAAO,GAAG;AAAA,EACnB,CAAC,QAAQ,IAAI,GAAG;AAAA,EAChB,CAAC,QAAQ,QAAQ,GAAG;AAAA,EACpB,CAAC,QAAQ,UAAU,GAAG;AAAA,EACtB,CAAC,QAAQ,KAAK,GAAG;AAAA,EACjB,CAAC,QAAQ,IAAI,GAAG;AAAA,EAChB,CAAC,QAAQ,QAAQ,GAAG;AAAA,EACpB,CAAC,QAAQ,SAAS,GAAG;AAAA,EACrB,CAAC,QAAQ,SAAS,GAAG;AACvB;AAGA,IAAM,oBAA+C;AAAA,EACnD,CAAC,QAAQ,OAAO,GAAG,SAAS;AAAA,EAC5B,CAAC,QAAQ,IAAI,GAAG,SAAS;AAAA,EACzB,CAAC,QAAQ,QAAQ,GAAG,SAAS;AAAA,EAC7B,CAAC,QAAQ,UAAU,GAAG,SAAS;AAAA,EAC/B,CAAC,QAAQ,IAAI,GAAG,SAAS;AAAA,EACzB,CAAC,QAAQ,QAAQ,GAAG,SAAS;AAAA,EAC7B,CAAC,QAAQ,KAAK,GAAG,SAAS;AAAA,EAC1B,CAAC,QAAQ,SAAS,GAAG,SAAS;AAAA,EAC9B,CAAC,QAAQ,SAAS,GAAG,SAAS;AAChC;AAGO,SAAS,cAAc,KAA4B;AACxD,MACE,IAAI,SAAS,SAAS,KACtB,IAAI,iBAAiB,SAAS,KAC9B,IAAI,WAAW,UAAU,aACzB,IAAI,WAAW,UAAU,gBACzB,IAAI,kBACJ;AACA,WAAO;AAAA,EACT;AACA,MAAI,eAAe,IAAI,QAAQ,KAAK,CAAC,UAAU,IAAI,QAAQ,GAAG;AAC5D,QAAI,CAAC,IAAI,cAAc,CAAC,IAAI,eAAe;AACzC,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AA4EO,SAAS,eAAe,MAAwB;AACrD,UAAQ,MAAM;AAAA,IACZ,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,aAAO;AAAA,IAET,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,aAAO;AAAA,EACX;AACF;AAGO,SAAS,UAAU,MAAwB;AAChD,UAAQ,MAAM;AAAA,IACZ,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,aAAO;AAAA,IAET,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,aAAO;AAAA,EACX;AACF;AAqBO,SAAS,UAAU,MAAwB;AAChD,UAAQ,MAAM;AAAA,IACZ,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,aAAO;AAAA,IAET,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,aAAO;AAAA,EACX;AACF;AA4LO,SAAS,qBAAqB,QAA6B;AAChE,QAAM,QAAQ,OAAO;AACrB,SAAO;AAAA,IACL,WAAW,MAAM;AAAA,IACjB,eAAe,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,UAAU,IAAI,IAAI,CAAC;AAAA,IAExE,iBAAiB,MAAM,OAAO,CAAC,KAAK,QAAQ,MAAM,wBAAwB,GAAG,GAAG,CAAC;AAAA,IAEjF,mBAAmB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,cAAc,GAAG,IAAI,IAAI,IAAI,CAAC;AAAA,IACnF,gBAAgB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,SAAS,SAAS,IAAI,IAAI,IAAI,CAAC;AAAA,IACrF,yBAAyB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,iBAAiB,SAAS,IAAI,IAAI,IAAI,CAAC;AAAA,IACtG,0BAA0B,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,oBAAoB,GAAG,IAAI,IAAI,IAAI,CAAC;AAAA,IAChG,qBAAqB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,mBAAmB,IAAI,IAAI,CAAC;AAAA,IAEvF,iBAAiB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,WAAW,UAAU,YAAY,IAAI,IAAI,CAAC;AAAA,IACjG,gBAAgB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,UAAU,eAAe,WAAW,WAAW,IAAI,IAAI,CAAC;AAAA,IAC9G,oBAAoB,MAAM;AAAA,MACxB,CAAC,KAAK,QAAQ,OAAO,IAAI,UAAU,WAAW,IAAI,SAAS,eAAe,OAAO,IAAI;AAAA,MACrF;AAAA,IACF;AAAA,IACA,iBAAiB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,eAAe,IAAI,IAAI,CAAC;AAAA,IAE/E,iBAAiB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,WAAW,IAAI,IAAI,CAAC;AAAA,IAC3E,kBAAkB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,iBAAiB,IAAI,IAAI,CAAC;AAAA,IAClF,kBAAkB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,eAAe,IAAI,QAAQ,KAAK,IAAI,aAAa,IAAI,IAAI,CAAC;AAAA,IAC9G,eAAe,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,CAAC,eAAe,IAAI,QAAQ,KAAK,CAAC,IAAI,aAAa,IAAI,IAAI,CAAC;AAAA,IAE7G,YAAY,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,OAAO,IAAI,IAAI,CAAC;AAAA,IACvF,gBAAgB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,WAAW,IAAI,IAAI,CAAC;AAAA,IAC/F,kBAAkB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,aAAa,IAAI,IAAI,CAAC;AAAA,IACnG,aAAa,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,QAAQ,IAAI,IAAI,CAAC;AAAA,IACzF,YAAY,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,OAAO,IAAI,IAAI,CAAC;AAAA,IACvF,gBAAgB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,WAAW,IAAI,IAAI,CAAC;AAAA,IAC/F,iBAAiB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,YAAY,IAAI,IAAI,CAAC;AAAA,IACjG,iBAAiB,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,YAAY,IAAI,IAAI,CAAC;AAAA,IACjG,eAAe,MAAM,OAAO,CAAC,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,UAAU,IAAI,IAAI,CAAC;AAAA,EAC/F;AACF;AAkCA,SAAS,wBAAwB,KAA2B;AAC1D,MAAI,IAAI,aAAa,QAAQ,SAAS,IAAI,aAAa,QAAQ,WAAW,CAAC,eAAe,IAAI,QAAQ,GAAG;AACvG,WAAO;AAAA,EACT;AACA,MAAI,IAAI,aAAa,QAAQ,QAAQ,IAAI,aAAa,QAAQ,YAAY,CAAC,IAAI,eAAe;AAC5F,WAAO;AAAA,EACT;AAEA,QAAM,OAAO,IAAI;AACjB,SAAO,gCAAgC,IAAI,IAAI;AACjD;AAEA,SAAS,gCAAgC,MAA4B;AACnE,UAAQ,KAAK,QAAQ;AAAA,IACnB,KAAK,OAAO;AAAA,IACZ,KAAK,OAAO;AAAA,IACZ,KAAK,OAAO;AACV,aAAO;AAAA,IACT,KAAK,OAAO;AACV,aACE,KAAK,QAAQ,SAAS,KAAK,QAAQ,OAAO,CAAC,KAAK,WAAW,MAAM,gCAAgC,MAAM,GAAG,CAAC;AAAA,IAE/G,KAAK,OAAO;AACV,UAAI,KAAK,KAAK,WAAW,OAAO,OAAO;AACrC,YAAI,MAAM;AACV,aAAK,KAAK,QAAQ,QAAQ,YAAU;AAClC,iBAAO,gCAAgC,MAAM;AAAA,QAC/C,CAAC;AACD,eAAO,MAAM,KAAK,KAAK,QAAQ;AAAA,MACjC,WAAW,KAAK,KAAK,WAAW,OAAO,YAAY;AACjD,eAAO,gCAAgC,KAAK,IAAI,IAAI;AAAA,MACtD;AACA,aAAO;AAAA,EACX;AACF;AAEA,SAAS,oBAAoB,KAA4B;AACvD,MAAI,eAAe,IAAI,QAAQ,KAAK,CAAC,UAAU,IAAI,QAAQ,GAAG;AAC5D,QAAI,CAAC,IAAI,cAAc,CAAC,IAAI,eAAe;AACzC,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;;;AC7fO,IAAM,aAAa;AAAA,EACxB,SAAS;AAAA;AAAA,EACT,eAAe;AAAA;AAAA,EACf,cAAc;AAAA;AAAA,EACd,WAAW;AAAA;AAAA,EACX,aAAa;AAAA;AAAA,EACb,OAAO;AAAA;AAAA,EACP,UAAU;AAAA;AACZ;;;ACNA,IAAM,qBAAqB;AAC3B,IAAM,qBAAqB;AAC3B,IAAM,oCAAoC;AAGnC,SAAS,yBAAyB,MAA+C;AACtF,MAAI,CAAC,QAAQ,OAAO,SAAS,YAAY,MAAM,QAAQ,IAAI,GAAG;AAC5D,WAAO;AAAA,EACT;AACA,SAAO,OAAO,QAAQ,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,KAAK,MAAM,OAAO,UAAU,YAAY,OAAO,UAAU,OAAO,GAAG,CAAC,CAAC;AAChH;AAGO,SAAS,eAAe,MAAqD;AAClF,QAAM,SAAuB,CAAC;AAC9B,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,IAAI,GAAG;AACzC,WAAO,OAAO,CAAC,CAAC,IAAI;AAAA,EACtB;AACA,SAAO;AACT;AAGO,SAAS,kBAAkB,MAA8B;AAC9D,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO,OAAO,SAAS,IAAI;AAAA,EAC7B;AACA,MAAI,CAAC,MAAM,QAAQ,IAAI,GAAG;AACxB,WAAO;AAAA,EACT;AACA,SAAO,KAAK,MAAM,UAAQ,kBAAkB,IAAI,CAAC;AACnD;AAEO,SAAS,oBACd,MACA,QACA,YACA,mBAA2B,mCACb;AACd,UAAQ,KAAK,QAAQ;AAAA,IACnB,KAAK,OAAO;AACV,aAAO,KAAK,MAAM,KAAK,OAAO,KAAK,qBAAqB,qBAAqB,EAAE,IAAI;AAAA,IACrF,KAAK,OAAO,OAAO;AACjB,YAAM,MAAM,WAAW,IAAI,KAAK,MAAM;AACtC,YAAM,UAAU,MAAM,OAAO,IAAI,IAAI,EAAE,IAAI;AAC3C,YAAM,MAAM,OAAO,KAAK,WAAW,CAAC,CAAC,EAAE,IAAI,MAAM;AACjD,UAAI,IAAI,WAAW,GAAG;AACpB,eAAO;AAAA,MACT;AACA,aAAO,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM,CAAC;AAAA,IACnD;AAAA,IACA,KAAK,OAAO,OAAO;AACjB,YAAM,UAAmB,CAAC;AAC1B,iBAAW,UAAU,KAAK,SAAS;AACjC,cAAM,SAAS,oBAAoB,QAAQ,QAAQ,YAAY,gBAAgB;AAC/E,YAAI,WAAW,MAAM;AACnB,iBAAO;AAAA,QACT;AACA,gBAAQ,KAAK,MAAM;AAAA,MACrB;AACA,aAAO,MAAM,OAAO;AAAA,IACtB;AAAA,IACA,KAAK,OAAO,YAAY;AACtB,YAAM,SAAkB,CAAC;AACzB,YAAM,sBAAsB,KAAK,MAAM,KAAK,OAAO,KAAK,mBAAmB,EAAE;AAC7E,eAAS,IAAI,GAAG,IAAI,qBAAqB,KAAK;AAC5C,cAAM,SAAS,oBAAoB,KAAK,MAAM,QAAQ,YAAY,gBAAgB;AAClF,YAAI,WAAW,MAAM;AACnB,iBAAO;AAAA,QACT;AACA,eAAO,KAAK,MAAM;AAAA,MACpB;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK,OAAO;AACV,aAAO;AAAA,EACX;AACF;AAGO,SAAS,oBAAoB,QAAgB,QAAkB,mBAA0C;AAC9G,QAAM,QAAQ,OAAO;AACrB,QAAM,aAAa,oBAAI,IAAwB;AAC/C,aAAW,OAAO,OAAO;AACvB,eAAW,IAAI,IAAI,IAAI,OAAO,aAAa,IAAI,EAAE,CAAC;AAAA,EACpD;AACA,SAAO;AAAA,IACL,GAAG,qBAAqB,MAAM;AAAA,IAC9B,eAAe,MAAM,OAAO,CAAC,KAAK,QAAQ,MAAM,kBAAkB,KAAK,MAAM,GAAG,CAAC;AAAA,IACjF,oBAAoB,MAAM;AAAA,MACxB,CAAC,KAAK,QAAQ,OAAO,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,SAAS,eAAe,IAAI,QAAQ,IAAI,IAAI;AAAA,MACvG;AAAA,IACF;AAAA,IACA,oBAAoB,MAAM;AAAA,MACxB,CAAC,KAAK,QAAQ,OAAO,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,cAAc,IAAI;AAAA,MAC7E;AAAA,IACF;AAAA,IACA,oBAAoB,MAAM;AAAA,MACxB,CAAC,KAAK,QAAQ,OAAO,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,eAAe,IAAI;AAAA,MAC9E;AAAA,IACF;AAAA,IACA,4BAA4B,MAAM;AAAA,MAChC,CAAC,KAAK,QACJ,OACC,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,aAAa,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,gBACtF,IACA;AAAA,MACN;AAAA,IACF;AAAA,IACA,mBAAmB,MAAM;AAAA,MACvB,CAAC,KAAK,QAAQ,OAAO,WAAW,IAAI,IAAI,EAAE,MAAM,WAAW,SAAS,IAAI,aAAa,QAAQ,OAAO,IAAI;AAAA,MACxG;AAAA,IACF;AAAA,EACF;AACF;AAGO,SAAS,aAAa,QAAkB,KAA4B;AACzE,QAAM,SAAS,OAAO,aAAa,IAAI,EAAE;AACzC,QAAM,UAAU,eAAe,IAAI,QAAQ;AAC3C,SACE,WAAW,WAAW,aACtB,WAAW,WAAW,eACtB,WAAW,WAAW,gBACrB,WAAW,WAAW,WAAW;AAEtC;AAGO,SAAS,gBAAgB,MAAwB;AACtD,UAAQ,MAAM;AAAA,IACZ,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,aAAO;AAAA,IAET,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,aAAO;AAAA,EACX;AACF;AAGO,SAAS,aAAa,MAAwB;AACnD,UAAQ,MAAM;AAAA,IACZ,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,aAAO;AAAA,IAET,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AAAA,IACb,KAAK,QAAQ;AACX,aAAO;AAAA,EACX;AACF;AAGO,SAAS,gBACd,OACA,SACA,gBAAyB,MACzB,YAAqB,OACT;AACZ,MAAI,UAAU,OAAO,KAAK,YAAY,QAAQ,YAAY;AACxD,QAAI,WAAW;AACb,aAAO,WAAW;AAAA,IACpB;AACA,QAAI,UAAU,QAAS,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,GAAI;AAClE,aAAO,WAAW;AAAA,IACpB;AACA,WAAO,WAAW;AAAA,EACpB;AACA,MAAI,CAAC,aAAa,OAAO,GAAG;AAC1B,WAAO,WAAW;AAAA,EACpB;AACA,MAAI,CAAC,eAAe;AAClB,WAAO,WAAW;AAAA,EACpB;AACA,MAAI,UAAU,MAAM;AAClB,WAAO,WAAW;AAAA,EACpB;AACA,MAAI,YAAY,QAAQ,SAAS,UAAU,YAAY;AACrD,WAAO,WAAW;AAAA,EACpB;AACA,MAAI,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,GAAG;AAC9C,WAAO,WAAW;AAAA,EACpB;AACA,SAAO,WAAW;AACpB;AAOO,SAAS,YACd,OACA,MACA,aACA,aACgB;AAChB,UAAQ,KAAK,QAAQ;AAAA,IACnB,KAAK,OAAO;AACV,aAAO;AAAA,IACT,KAAK,OAAO;AACV,UAAI,KAAK,WAAW,aAAa;AAC/B,eAAO;AAAA,MACT;AACA,UAAI,OAAO,UAAU,UAAU;AAC7B,eAAO;AAAA,MACT;AACA,UAAI,CAAC,YAAY,SAAS,KAAK,GAAG;AAChC,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT,KAAK,OAAO,OAAO;AACjB,UAAI,CAAC,aAAa,KAAK,GAAG;AACxB,eAAO;AAAA,MACT;AACA,UAAIA,cAAa;AACjB,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KAAK;AAC5C,cAAM,mBAAmB,YAAY,MAAM,IAAI,CAAC,GAAG,KAAK,QAAQ,CAAC,GAAG,aAAa,WAAW;AAC5F,YAAI,qBAAqB,MAAM;AAC7B,iBAAO;AAAA,QACT;AACA,YAAI,kBAAkB;AACpB,UAAAA,cAAa;AAAA,QACf;AAAA,MACF;AACA,aAAOA;AAAA,IACT;AAAA,IACA,KAAK,OAAO;AACV,UAAI,CAAC,MAAM,QAAQ,KAAK,KAAM,MAAM,SAAS,KAAK,MAAM,CAAC,MAAM,UAAW;AACxE,eAAO;AAAA,MACT;AACA,UAAI,aAAa;AACjB,YAAM,iBAA0B,CAAC;AACjC,iBAAW,QAAQ,OAAO;AACxB,cAAM,iBAAiB,YAAY,MAAM,KAAK,MAAM,aAAa,WAAW;AAC5E,YAAI,mBAAmB,QAAQ,mBAAmB,MAAM;AACtD,uBAAa;AACb,cAAI,mBAAmB,MAAM;AAC3B,2BAAe,KAAK,IAAI;AAAA,UAC1B;AAAA,QACF;AAAA,MACF;AACA,iBAAW,QAAQ,gBAAgB;AACjC,cAAM,QAAQ,MAAM,QAAQ,IAAI;AAChC,YAAI,UAAU,IAAI;AAChB,gBAAM,OAAO,OAAO,CAAC;AAAA,QACvB;AAAA,MACF;AACA,UAAI,YAAY;AACd,cAAM,KAAK,CAAC,GAAG,MAAM,QAAQ,GAAG,CAAC,CAAC;AAClC,YAAI,IAAI;AACR,eAAO,IAAI,MAAM,QAAQ;AACvB,cAAI,QAAQ,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,MAAM,GAAG;AACzC,kBAAM,OAAO,GAAG,CAAC;AAAA,UACnB,OAAO;AACL;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IAET,KAAK,OAAO;AAAA,IACZ,KAAK,OAAO;AAAA,IACZ,KAAK,OAAO;AAAA,IACZ,KAAK,OAAO;AACV,aAAO;AAAA,EACX;AACF;AAEO,SAAS,mBAAmB,OAAqB,MAAiB,UAAgC;AACvG,SAAO,eAAe,OAAO,MAAM,QAAQ;AAC7C;AAEO,SAAS,mBACd,OACA,MACA,MACA,QACc;AACd,MAAI,KAAK,WAAW,KAAK,KAAK,WAAW,OAAO,YAAY;AAC1D,WAAO;AAAA,EACT;AAEA,QAAM,aAAa,aAAa,OAAQ,IAAI;AAC5C,QAAM,eAAe,CAAC,GAAG,WAAW,MAAM,GAAG,MAAM,GAAG,GAAG,WAAW,MAAM,SAAS,CAAC,CAAC;AACrF,SAAO,eAAe,OAAO,MAAM,YAAY;AACjD;AAEO,SAAS,gBACd,OACA,MACA,MACA,aACc;AACd,MAAI,KAAK,WAAW,KAAK,KAAK,WAAW,OAAO,YAAY;AAC1D,WAAO,iBAAiB,IAAI;AAAA,EAC9B;AAEA,QAAM,UAAU,iBAAkB,YAAkC,IAAI;AACxE,QAAM,aAAc,aAAa,OAAQ,IAAI,KAAwB,CAAC;AACtE,QAAM,eAAe,CAAC,SAAS,GAAG,UAAU;AAC5C,SAAO,eAAe,OAAO,MAAM,YAAY;AACjD;AAIA,SAAS,kBAAkB,KAAmB,QAA0B;AACtE,MAAI,CAAC,eAAe,IAAI,QAAQ,GAAG;AACjC,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,OAAO,YAAY,IAAI,EAAE;AACvC,MAAI,UAAU,MAAM;AAClB,WAAO;AAAA,EACT;AACA,MAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,CAAC,MAAM,UAAU;AAClD,WAAO;AAAA,EACT;AACA,SAAO,MAAM;AACf;","names":["wasChanged"]}
+{"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"}

package/dist/library/rsmodel.d.ts

@@ -1,25 +1,18 @@
-import { Value } from '../rslang/eval/value.js';
-import { LibraryItem } from './library.js';
-import { RSFormStats } from './rsform.js';
-import '../shared/branded.js';
-import '../graph/graph.js';
-import '../rslang/semantic/typification.js';
-import '../rslang/semantic/analyzer.js';
-import '../parsing/ast.js';
-import '@lezer/common';
-import '../rslang/error.js';
-import '../rslang/semantic/value-class.js';
+import { r as LibraryItem } from "../library-CYun28Xz.js";
+import { c as Value } from "../value-CTjX6825.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;
+  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. */
@@ -29,24 +22,25 @@ 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;
-    }[];
+  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;
+  count_missing_base: number;
+  count_false_axioms: number;
+  count_invalid_data: number;
+  count_invalid_calculations: number;
+  count_empty_terms: number;
+  base_elements: number;
 }
-
-export { type BasicBinding, type BasicsContext, DEFAULT_VALUE_TEXT, EvalStatus, type RSModel, type RSModelStats, TYPE_BASIC };
+//#endregion
+export { BasicBinding, BasicsContext, DEFAULT_VALUE_TEXT, EvalStatus, RSModel, RSModelStats, TYPE_BASIC };
+//# sourceMappingURL=rsmodel.d.ts.map

package/dist/library/rsmodel.js

@@ -1,25 +1,18 @@
-// src/library/rsmodel.ts
-var TYPE_BASIC = "basic";
-var EvalStatus = {
-  NO_EVAL: 1,
-  // не вычисляется
-  NOT_PROCESSED: 2,
-  // Интерпретация не вычислялась
-  INVALID_DATA: 3,
-  // Неверные данные
-  EVAL_FAIL: 4,
-  // Ошибка при вычислении
-  AXIOM_FALSE: 5,
-  // Значение аксиомы = FALSE
-  EMPTY: 6,
-  // Значение пусто
-  HAS_DATA: 7
-  // Интерпретация вычислена и не пуста
-};
-var DEFAULT_VALUE_TEXT = "N/A";
-export {
-  DEFAULT_VALUE_TEXT,
-  EvalStatus,
-  TYPE_BASIC
+//#region src/library/rsmodel.ts
+const TYPE_BASIC = "basic";
+/** Evaluation status enumeration. */
+const EvalStatus = {
+	NO_EVAL: 1,
+	NOT_PROCESSED: 2,
+	INVALID_DATA: 3,
+	EVAL_FAIL: 4,
+	AXIOM_FALSE: 5,
+	EMPTY: 6,
+	HAS_DATA: 7
 };
+/** Default value for structured data. */
+const DEFAULT_VALUE_TEXT = "N/A";
+//#endregion
+export { DEFAULT_VALUE_TEXT, EvalStatus, TYPE_BASIC };
+
 //# sourceMappingURL=rsmodel.js.map

package/dist/library/rsmodel.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/library/rsmodel.ts"],"sourcesContent":["import { type Value } from '../rslang';\n\nimport { type LibraryItem } from './library';\nimport { type RSFormStats } from './rsform';\n\nexport const TYPE_BASIC = 'basic';\n\n/** Evaluation status enumeration. */\nexport const EvalStatus = {\n  NO_EVAL: 1, // не вычисляется\n  NOT_PROCESSED: 2, // Интерпретация не вычислялась\n  INVALID_DATA: 3, // Неверные данные\n  EVAL_FAIL: 4, // Ошибка при вычислении\n  AXIOM_FALSE: 5, // Значение аксиомы = FALSE\n  EMPTY: 6, // Значение пусто\n  HAS_DATA: 7 // Интерпретация вычислена и не пуста\n} as const;\nexport type EvalStatus = (typeof EvalStatus)[keyof typeof EvalStatus];\n\n/** Represents basic element binding. */\nexport type BasicBinding = Record<number, string>;\n\n/** Represents {@link RSModel} basic sets binding. */\nexport type BasicsContext = Map<number, BasicBinding>;\n\n/** Default value for structured data. */\nexport const DEFAULT_VALUE_TEXT = 'N/A';\n\ninterface RSModelData extends LibraryItem {\n  editors: number[];\n  schema: number;\n  items: {\n    id: number;\n    type: string;\n    value: Value | BasicBinding;\n  }[];\n}\n\n/** Represents {@link RSModel} structured data. */\nexport type RSModel = RSModelData;\n\n/** Represents {@link RSModel} statistics. */\nexport interface RSModelStats extends RSFormStats {\n  count_missing_base: number;\n  count_false_axioms: number;\n  count_invalid_data: number;\n  count_invalid_calculations: number;\n  count_empty_terms: number;\n  base_elements: number;\n}\n"],"mappings":";AAKO,IAAM,aAAa;AAGnB,IAAM,aAAa;AAAA,EACxB,SAAS;AAAA;AAAA,EACT,eAAe;AAAA;AAAA,EACf,cAAc;AAAA;AAAA,EACd,WAAW;AAAA;AAAA,EACX,aAAa;AAAA;AAAA,EACb,OAAO;AAAA;AAAA,EACP,UAAU;AAAA;AACZ;AAUO,IAAM,qBAAqB;","names":[]}
+{"version":3,"file":"rsmodel.js","names":[],"sources":["../../src/library/rsmodel.ts"],"sourcesContent":["import { type Value } from '../rslang';\n\nimport { type LibraryItem } from './library';\nimport { type RSFormStats } from './rsform';\n\nexport const TYPE_BASIC = 'basic';\n\n/** Evaluation status enumeration. */\nexport const EvalStatus = {\n  NO_EVAL: 1, // не вычисляется\n  NOT_PROCESSED: 2, // Интерпретация не вычислялась\n  INVALID_DATA: 3, // Неверные данные\n  EVAL_FAIL: 4, // Ошибка при вычислении\n  AXIOM_FALSE: 5, // Значение аксиомы = FALSE\n  EMPTY: 6, // Значение пусто\n  HAS_DATA: 7 // Интерпретация вычислена и не пуста\n} as const;\nexport type EvalStatus = (typeof EvalStatus)[keyof typeof EvalStatus];\n\n/** Represents basic element binding. */\nexport type BasicBinding = Record<number, string>;\n\n/** Represents {@link RSModel} basic sets binding. */\nexport type BasicsContext = Map<number, BasicBinding>;\n\n/** Default value for structured data. */\nexport const DEFAULT_VALUE_TEXT = 'N/A';\n\ninterface RSModelData extends LibraryItem {\n  editors: number[];\n  schema: number;\n  items: {\n    id: number;\n    type: string;\n    value: Value | BasicBinding;\n  }[];\n}\n\n/** Represents {@link RSModel} structured data. */\nexport type RSModel = RSModelData;\n\n/** Represents {@link RSModel} statistics. */\nexport interface RSModelStats extends RSFormStats {\n  count_missing_base: number;\n  count_false_axioms: number;\n  count_invalid_data: number;\n  count_invalid_calculations: number;\n  count_empty_terms: number;\n  base_elements: number;\n}\n"],"mappings":";AAKA,MAAa,aAAa;;AAG1B,MAAa,aAAa;CACxB,SAAS;CACT,eAAe;CACf,cAAc;CACd,WAAW;CACX,aAAa;CACb,OAAO;CACP,UAAU;AACZ;;AAUA,MAAa,qBAAqB"}

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

@@ -1,33 +1,27 @@
-import { TypePath, Typification } from '../rslang/semantic/typification.js';
-import { Constituenta, RSForm } from './rsform.js';
-import '../shared/branded.js';
-import '../graph/graph.js';
-import '../rslang/semantic/analyzer.js';
-import '../parsing/ast.js';
-import '@lezer/common';
-import '../rslang/error.js';
-import '../rslang/semantic/value-class.js';
-import './library.js';
+import { b as Typification, y as TypePath } from "../typification-Dk-fisgO.js";
+import { Constituenta, RSForm } from "./rsform.js";
 
+//#region src/library/structure-planner.d.ts
 /** Represents a node in the structure planner. */
 interface SPNode {
-    key: string;
-    path: TypePath;
-    type: Typification;
-    parent: number | null;
-    definition: string;
-    existing: Constituenta | null;
+  key: string;
+  path: TypePath;
+  type: Typification;
+  parent: number | null;
+  definition: string;
+  existing: Constituenta | null;
 }
 /** Structure planner for {@link Constituenta}. */
 declare class StructurePlanner {
-    private items;
-    private schema;
-    private target;
-    private rootType;
-    constructor(schema: RSForm, target: Constituenta);
-    build(): SPNode[];
-    private visit;
-    private pushNode;
+  private items;
+  private schema;
+  private target;
+  private rootType;
+  constructor(schema: RSForm, target: Constituenta);
+  build(): SPNode[];
+  private visit;
+  private pushNode;
 }
-
-export { type SPNode, StructurePlanner };
+//#endregion
+export { SPNode, StructurePlanner };
+//# sourceMappingURL=structure-planner.d.ts.map