@rsconcept/domain 1.4.4 → 1.4.6

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

@@ -1 +1 @@
-{"version":3,"file":"type-auditor.js","names":[],"sources":["../../../src/rslang/semantic/type-auditor.ts"],"sourcesContent":["/**\n * Module: Type auditor for AST type checking.\n */\n\nimport { type AstNode, getNodeIndices, getNodeText } from '../../parsing';\nimport { annotateError, annotateType } from '../ast-annotations';\nimport { type ErrorReporter, RSErrorCode } from '../error';\nimport { labelRSLangNode, labelToken, labelType } from '../labels';\nimport { TokenID } from '../parser/token';\n\nimport {\n  type Argument,\n  bool,\n  component,\n  debool,\n  type EchelonTuple,\n  EmptySetT,\n  type ExpressionType,\n  IntegerT,\n  isRadical,\n  isTypification,\n  LogicT,\n  type Parametrized,\n  tuple,\n  type TypeContext,\n  TypeID,\n  type Typification\n} from './typification';\nimport {\n  checkCompatibility,\n  checkEquality,\n  compareTemplated,\n  hasGenerics,\n  mergeTypifications,\n  substituteBase\n} from './typification-api';\n\n/** Type auditor for AST type checking. */\nexport class TypeAuditor {\n  private static readonly TYPE_DEDUCTION_DEPTH = 5;\n\n  private context: TypeContext;\n  private reporter?: ErrorReporter;\n  private locals: LocalContext;\n  private annotateTypes: boolean;\n  private annotateErrors: boolean;\n\n  constructor(context: TypeContext) {\n    this.annotateTypes = false;\n    this.annotateErrors = false;\n    this.context = context;\n    this.locals = new LocalContext(this.onError.bind(this));\n  }\n\n  public run(\n    ast: AstNode,\n    annotateTypes: boolean,\n    reporter?: ErrorReporter,\n    annotateErrors: boolean = false\n  ): ExpressionType | null {\n    if (ast.hasError) {\n      return null;\n    }\n    this.annotateTypes = annotateTypes;\n    this.annotateErrors = annotateErrors;\n    this.reporter = reporter;\n    this.clear();\n    return this.dispatchVisit(ast);\n  }\n\n  private clear(): void {\n    this.locals = new LocalContext(this.onError.bind(this));\n  }\n\n  private dispatchDeclare(node: AstNode, domain: Typification): boolean {\n    const result = this.processDeclare(node, domain);\n    if (result === true && this.annotateTypes) {\n      annotateType(node, domain);\n    }\n    return result;\n  }\n\n  private processDeclare(node: AstNode, domain: Typification): boolean {\n    switch (node.typeID) {\n      case TokenID.ID_LOCAL:\n        return this.declareLocal(node, domain);\n      case TokenID.NT_TUPLE_DECL:\n        return this.declareTuple(node, domain);\n      case TokenID.NT_ENUM_DECL:\n        return this.declareEnumeration(node, domain);\n    }\n    return false;\n  }\n\n  private declareLocal(node: AstNode, domain: Typification): boolean {\n    return this.locals.pushLocal(node, domain);\n  }\n\n  private declareTuple(node: AstNode, domain: Typification): boolean {\n    if (domain.typeID !== TypeID.tuple || domain.factors.length !== node.children.length) {\n      this.onError(RSErrorCode.invalidCortegeDeclare, node.children[0]);\n      return false;\n    }\n    for (let child = 0; child < node.children.length; child++) {\n      if (!this.visitChildDeclaration(node, child, component(domain, child + 1)!)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private declareEnumeration(node: AstNode, domain: Typification): boolean {\n    for (const child of node.children) {\n      if (!this.dispatchDeclare(child, domain)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private dispatchVisit(node: AstNode): ExpressionType | null {\n    const result = this.processVisit(node);\n    if (result !== null && this.annotateTypes) {\n      annotateType(node, result);\n    }\n    return result;\n  }\n\n  private processVisit(node: AstNode): ExpressionType | null {\n    switch (node.typeID) {\n      case TokenID.ID_GLOBAL:\n      case TokenID.ID_FUNCTION:\n      case TokenID.ID_PREDICATE:\n        return this.visitGlobal(node);\n\n      case TokenID.ID_LOCAL:\n        return this.visitLocal(node);\n      case TokenID.ID_RADICAL:\n        return this.visitRadical(node);\n\n      case TokenID.LIT_INTEGER:\n        return IntegerT;\n      case TokenID.LIT_WHOLE_NUMBERS:\n        return bool(IntegerT);\n      case TokenID.LIT_EMPTYSET:\n        return this.visitEmptySet(node);\n\n      case TokenID.NT_ARGUMENTS:\n        return this.visitArgumentsEnum(node);\n      case TokenID.NT_ARG_DECL:\n        return this.visitArgument(node);\n\n      case TokenID.PLUS:\n      case TokenID.MINUS:\n      case TokenID.MULTIPLY:\n        return this.visitArithmetic(node);\n\n      case TokenID.QUANTOR_UNIVERSAL:\n      case TokenID.QUANTOR_EXISTS:\n        return this.visitQuantifier(node);\n\n      case TokenID.LOGIC_NOT:\n        return this.visitNegation(node);\n\n      case TokenID.LOGIC_AND:\n      case TokenID.LOGIC_OR:\n      case TokenID.LOGIC_IMPLICATION:\n      case TokenID.LOGIC_EQUIVALENT:\n        return this.visitLogicBinary(node);\n\n      case TokenID.EQUAL:\n      case TokenID.NOTEQUAL:\n        return this.visitEquals(node);\n\n      case TokenID.GREATER:\n      case TokenID.LESSER:\n      case TokenID.GREATER_OR_EQ:\n      case TokenID.LESSER_OR_EQ:\n        return this.visitIntegerPredicate(node);\n\n      case TokenID.SET_IN:\n      case TokenID.SET_NOT_IN:\n      case TokenID.SUBSET:\n      case TokenID.SUBSET_OR_EQ:\n      case TokenID.NOT_SUBSET:\n        return this.visitSetexprPredicate(node);\n\n      case TokenID.DECART:\n        return this.visitDecart(node);\n      case TokenID.BOOLEAN:\n        return this.visitBoolean(node);\n\n      case TokenID.NT_TUPLE:\n        return this.visitTuple(node);\n      case TokenID.NT_ENUMERATION:\n        return this.visitEnumeration(node);\n\n      case TokenID.BIGPR:\n        return this.visitProjectSet(node);\n      case TokenID.SMALLPR:\n        return this.visitProjectTuple(node);\n      case TokenID.FILTER:\n        return this.visitFilter(node);\n\n      case TokenID.CARD:\n        return this.visitCard(node);\n      case TokenID.REDUCE:\n        return this.visitReduce(node);\n      case TokenID.BOOL:\n        return this.visitBool(node);\n      case TokenID.DEBOOL:\n        return this.visitDebool(node);\n\n      case TokenID.SET_UNION:\n      case TokenID.SET_INTERSECTION:\n      case TokenID.SET_MINUS:\n      case TokenID.SET_SYMMETRIC_MINUS:\n        return this.visitSetexprBinary(node);\n\n      case TokenID.NT_FUNC_DEFINITION:\n        return this.visitFunctionDefinition(node);\n\n      case TokenID.NT_FUNC_CALL:\n        return this.visitFunctionCall(node);\n\n      case TokenID.ITERATE:\n        return this.visitIterate(node);\n      case TokenID.ASSIGN:\n        return this.visitAssign(node);\n\n      case TokenID.NT_DECLARATIVE_EXPR:\n        return this.visitDeclarative(node);\n      case TokenID.NT_IMPERATIVE_EXPR:\n        return this.visitImperative(node);\n\n      case TokenID.NT_RECURSIVE_FULL:\n      case TokenID.NT_RECURSIVE_SHORT:\n        return this.visitRecursion(node);\n    }\n    return null;\n  }\n\n  private onError(code: RSErrorCode, node: AstNode, params?: string[]): null {\n    this.reporter?.({ code, from: node.from, to: node.to, params });\n    if (this.annotateErrors) {\n      annotateError(node, code, params);\n    }\n    return null;\n  }\n\n  private visitChild(node: AstNode, index: number): ExpressionType | null {\n    if (index >= node.children.length) {\n      return null;\n    }\n    return this.dispatchVisit(node.children[index]);\n  }\n\n  private visitChildDeclaration(node: AstNode, index: number, domain: Typification): boolean {\n    if (index >= node.children.length) {\n      return false;\n    }\n    if (!this.dispatchDeclare(node.children[index], domain)) {\n      return false;\n    }\n    return true;\n  }\n\n  private visitAllAndReturn(node: AstNode, type: ExpressionType | null): ExpressionType | null {\n    for (const child of node.children) {\n      if (!this.dispatchVisit(child)) {\n        return null;\n      }\n    }\n    return type;\n  }\n\n  private childTypification(node: AstNode, index: number): Typification | null {\n    const result = this.visitChild(node, index);\n    if (result === null) {\n      return null;\n    }\n    if (!isTypification(result)) {\n      this.onError(RSErrorCode.expectedSetexpr, node.children[index], [labelType(result)]);\n      return null;\n    }\n    return result as Typification;\n  }\n\n  private childLogic(node: AstNode, index: number): boolean {\n    const result = this.visitChild(node, index);\n    if (result === null) {\n      return false;\n    }\n    if (result.typeID !== TypeID.logic) {\n      this.onError(RSErrorCode.expectedLogic, node.children[index], [labelType(result)]);\n      return false;\n    }\n    return true;\n  }\n\n  private childTypeDebool(\n    node: AstNode,\n    index: number,\n    errorCode: RSErrorCode,\n    operation?: string\n  ): Typification | null {\n    const result = this.childTypification(node, index);\n    if (result === null) {\n      return null;\n    }\n    if (result.typeID === TypeID.anyTypification) {\n      return result;\n    }\n    if (result.typeID !== TypeID.collection) {\n      const params =\n        errorCode === RSErrorCode.invalidTypeOperation && operation !== undefined\n          ? [operation, labelType(result)]\n          : [labelType(result)];\n      this.onError(errorCode, node.children[index], params);\n      return null;\n    }\n    return debool(result);\n  }\n\n  private childQuantifierDomain(node: AstNode, index: number, operator: string): Typification | null {\n    const result = this.visitChild(node, index);\n    if (result === null) {\n      return null;\n    }\n    if (!isTypification(result)) {\n      this.onError(RSErrorCode.invalidQuantifierDomain, node.children[index], [operator, labelType(result)]);\n      return null;\n    }\n    if (result.typeID === TypeID.anyTypification) {\n      return result;\n    }\n    if (result.typeID !== TypeID.collection) {\n      this.onError(RSErrorCode.invalidQuantifierDomain, node.children[index], [operator, labelType(result)]);\n      return null;\n    }\n    return debool(result);\n  }\n\n  private visitLocal(node: AstNode): ExpressionType | null {\n    return this.locals.getLocalType(node);\n  }\n\n  private visitGlobal(node: AstNode): ExpressionType | null {\n    const alias = getNodeText(node);\n    const type = this.context.get(alias);\n    if (!type) {\n      return this.onError(RSErrorCode.globalNotTyped, node, [alias]);\n    }\n    return type;\n  }\n\n  private visitFunctionDefinition(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n    if (!this.visitChild(node, 0)) {\n      return null;\n    }\n\n    const args: Argument[] = [];\n    for (const local of this.locals.data) {\n      if (local.level === 1) {\n        args.push({ alias: local.alias, type: local.type });\n      }\n    }\n\n    const result = this.visitChild(node, 1);\n    if (result === null || result.typeID === TypeID.function || result.typeID === TypeID.predicate) {\n      return null;\n    }\n    this.locals.endScope(node.children[1]);\n    if (result.typeID === TypeID.logic) {\n      return {\n        typeID: TypeID.predicate,\n        result: result,\n        args: args\n      };\n    } else {\n      return {\n        typeID: TypeID.function,\n        result: result,\n        args: args\n      };\n    }\n  }\n\n  private visitFunctionCall(node: AstNode): ExpressionType | null {\n    const funcName = getNodeText(node.children[0]);\n    const funcType = this.context.get(funcName);\n    if (funcType?.typeID !== TypeID.function && funcType?.typeID !== TypeID.predicate) {\n      return this.onError(RSErrorCode.globalNotTyped, node.children[0], [funcName]);\n    }\n    if (this.annotateTypes) {\n      annotateType(node.children[0], funcType);\n    }\n\n    const substitutes = this.checkFuncArguments(node, funcName, funcType);\n    if (substitutes === null) {\n      return null;\n    }\n    if (funcType.result.typeID === TypeID.logic) {\n      return funcType.result;\n    } else {\n      const result = mangleRadicals(funcName, funcType.result);\n      if (substitutes.size > 0) {\n        substituteBase(result, substitutes);\n      }\n      return result;\n    }\n  }\n\n  private visitRadical(node: AstNode): ExpressionType | null {\n    const alias = getNodeText(node);\n    if (!this.isInsideFuncArgument(node)) {\n      return this.onError(RSErrorCode.radicalUsage, node, [alias]);\n    }\n    return bool({ typeID: TypeID.basic, baseID: alias });\n  }\n\n  private visitEmptySet(node: AstNode): ExpressionType | null {\n    const invalidParents: TokenID[] = [\n      TokenID.CARD,\n      TokenID.DEBOOL,\n      TokenID.SET_UNION,\n      TokenID.SET_INTERSECTION,\n      TokenID.SET_MINUS,\n      TokenID.SET_SYMMETRIC_MINUS,\n      TokenID.REDUCE,\n      TokenID.BIGPR,\n      TokenID.SMALLPR\n    ];\n    if (invalidParents.includes(node.parent?.typeID as TokenID)) {\n      return this.onError(RSErrorCode.invalidEmptySetUsage, node);\n    }\n    return EmptySetT;\n  }\n\n  private visitArgument(node: AstNode): ExpressionType | null {\n    const variable = node.children[0];\n    if (variable.typeID === TokenID.NT_TUPLE_DECL) {\n      return this.onError(RSErrorCode.invalidArgumentCortegeDeclare, variable);\n    }\n    const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, labelToken(TokenID.ITERATE));\n    if (domain === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    }\n    return domain;\n  }\n\n  private visitCard(node: AstNode): ExpressionType | null {\n    if (!this.childTypeDebool(node, 0, RSErrorCode.invalidCard)) {\n      return null;\n    }\n    return IntegerT;\n  }\n\n  private visitArithmetic(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n    if (!('isArithmetic' in type1 && type1.isArithmetic)) {\n      return this.onError(RSErrorCode.arithmeticNotSupported, node.children[0], [labelType(type1), operator]);\n    }\n\n    const type2 = this.childTypification(node, 1);\n    if (type2 === null) {\n      return null;\n    }\n    if (!('isArithmetic' in type2 && type2.isArithmetic)) {\n      return this.onError(RSErrorCode.arithmeticNotSupported, node.children[1], [labelType(type2), operator]);\n    }\n\n    const result = mergeTypifications(type1, type2);\n    if (result === null) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2), operator]);\n    }\n    return result;\n  }\n\n  private visitIntegerPredicate(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n    if (!('isOrdered' in type1 && type1.isOrdered)) {\n      return this.onError(RSErrorCode.orderingNotSupported, node.children[0], [labelType(type1), operator]);\n    }\n\n    const type2 = this.childTypification(node, 1);\n    if (type2 === null) {\n      return null;\n    }\n    if (!('isOrdered' in type2 && type2.isOrdered)) {\n      return this.onError(RSErrorCode.orderingNotSupported, node.children[1], [labelType(type2), operator]);\n    }\n\n    if (!checkCompatibility(type1, type2)) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2), operator]);\n    }\n    return LogicT;\n  }\n\n  private visitQuantifier(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const operator = labelRSLangNode(node);\n    const domain = this.childQuantifierDomain(node, 1, operator);\n    if (domain === null) {\n      return null;\n    } else if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    } else if (!this.childLogic(node, 2)) {\n      return null;\n    }\n\n    this.locals.endScope(node.children[2]);\n    return LogicT;\n  }\n\n  private visitNegation(node: AstNode): ExpressionType | null {\n    if (!this.childLogic(node, 0)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitLogicBinary(node: AstNode): ExpressionType | null {\n    if (!this.childLogic(node, 0) || !this.childLogic(node, 1)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitEquals(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n\n    const type2 = this.childTypification(node, 1);\n    if (type2 === null) {\n      return null;\n    }\n    if (!checkCompatibility(type1, type2)) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2), operator]);\n    }\n    return LogicT;\n  }\n\n  private visitSetexprPredicate(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    let type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, operator);\n    if (type2 === null) {\n      return null;\n    }\n    const isSubset = this.isSubset(node.typeID as TokenID);\n    if (isSubset) {\n      type2 = bool(type2);\n    }\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n\n    if (!checkCompatibility(type1, type2)) {\n      if (isSubset) {\n        return this.onError(RSErrorCode.typesNotEqual, node, [labelType(type1), labelType(type2), operator]);\n      } else {\n        return this.onError(RSErrorCode.invalidElementPredicate, node, [\n          labelType(type1),\n          operator,\n          labelType(bool(type2))\n        ]);\n      }\n    }\n    return LogicT;\n  }\n\n  private visitDecart(node: AstNode): ExpressionType | null {\n    const factors: Typification[] = [];\n    for (let child = 0; child < node.children.length; child++) {\n      const type = this.childTypeDebool(node, child, RSErrorCode.invalidDecart);\n      if (type === null) {\n        return null;\n      } else {\n        factors.push(type);\n      }\n    }\n    return bool(tuple(factors));\n  }\n\n  private visitBoolean(node: AstNode): ExpressionType | null {\n    const type = this.childTypeDebool(node, 0, RSErrorCode.invalidBoolean);\n    if (type === null) {\n      return null;\n    }\n    return bool(bool(type));\n  }\n\n  private visitTuple(node: AstNode): ExpressionType | null {\n    const components: Typification[] = [];\n    for (let child = 0; child < node.children.length; child++) {\n      const type = this.childTypification(node, child);\n      if (type === null) {\n        return null;\n      }\n      components.push(type);\n    }\n    return tuple(components);\n  }\n\n  private visitEnumeration(node: AstNode): ExpressionType | null {\n    let type: ExpressionType | null = this.childTypification(node, 0);\n    if (type === null) {\n      return null;\n    }\n    for (let child = 1; child < node.children.length; child++) {\n      const childType = this.childTypification(node, child);\n      if (childType === null) {\n        return null;\n      }\n\n      const merge = mergeTypifications(type, childType);\n      if (merge === null) {\n        return this.onError(RSErrorCode.invalidEnumeration, node.children[child], [\n          labelType(type),\n          labelType(childType)\n        ]);\n      }\n      type = merge;\n    }\n    return bool(type);\n  }\n\n  private visitBool(node: AstNode): ExpressionType | null {\n    return this.visitEnumeration(node);\n  }\n\n  private visitDebool(node: AstNode): ExpressionType | null {\n    return this.childTypeDebool(node, 0, RSErrorCode.invalidDebool);\n  }\n\n  private visitSetexprBinary(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypeDebool(node, 0, RSErrorCode.invalidTypeOperation, operator);\n    if (type1 === null) {\n      return null;\n    }\n\n    const type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, operator);\n    if (type2 === null) {\n      return null;\n    }\n\n    const result = mergeTypifications(type1, type2);\n    if (result === null) {\n      return this.onError(RSErrorCode.typesNotEqual, node, [labelType(bool(type1)), labelType(bool(type2)), operator]);\n    }\n    return bool(result);\n  }\n\n  private visitProjectSet(node: AstNode): ExpressionType | null {\n    const argument = this.childTypeDebool(node, 0, RSErrorCode.invalidProjectionSet);\n    if (argument === null) {\n      return null;\n    }\n    if (argument.typeID === TypeID.anyTypification) {\n      return EmptySetT;\n    }\n    if (argument.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.invalidProjectionSet, node.children[0], [\n        labelRSLangNode(node),\n        labelType(bool(argument))\n      ]);\n    }\n\n    const indices = getNodeIndices(node);\n    const components: Typification[] = [];\n    for (const index of indices) {\n      const newComponent = component(argument, index);\n      if (newComponent === null) {\n        return this.onError(RSErrorCode.invalidProjectionSet, node.children[0], [\n          labelRSLangNode(node),\n          labelType(bool(argument))\n        ]);\n      } else {\n        components.push(newComponent);\n      }\n    }\n    if (components.length === 1) {\n      return bool(components[0]);\n    } else {\n      return bool(tuple(components));\n    }\n  }\n\n  private visitProjectTuple(node: AstNode): ExpressionType | null {\n    const argument = this.childTypification(node, 0);\n    if (argument === null) {\n      return null;\n    }\n    if (argument.typeID === TypeID.anyTypification) {\n      return argument;\n    }\n    if (argument.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.invalidProjectionTuple, node.children[0], [\n        labelRSLangNode(node),\n        labelType(argument)\n      ]);\n    }\n\n    const indices = getNodeIndices(node);\n    const components: Typification[] = [];\n    for (const index of indices) {\n      const newComponent = component(argument, index);\n      if (newComponent === null) {\n        return this.onError(RSErrorCode.invalidProjectionTuple, node.children[0], [\n          labelRSLangNode(node),\n          labelType(argument)\n        ]);\n      } else {\n        components.push(newComponent);\n      }\n    }\n    if (components.length === 1) {\n      return components[0];\n    } else {\n      return tuple(components);\n    }\n  }\n\n  private visitFilter(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const indices = getNodeIndices(node);\n    const tupleParam = indices.length === node.children.length - 1;\n    if (!tupleParam && node.children.length > 2) {\n      return this.onError(RSErrorCode.invalidFilterArity, node);\n    }\n\n    const argument = this.childTypification(node, node.children.length - 1);\n    if (argument === null) {\n      return null;\n    }\n    if (\n      argument.typeID === TypeID.anyTypification ||\n      (argument.typeID === TypeID.collection && argument.base.typeID === TypeID.anyTypification)\n    ) {\n      return EmptySetT;\n    }\n    if (argument.typeID !== TypeID.collection || argument.base.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.invalidFilterArgumentType, node.children[node.children.length - 1], [\n        labelRSLangNode(node),\n        labelType(argument)\n      ]);\n    }\n\n    const argBase = debool(argument) as EchelonTuple;\n    const bases: Typification[] = [];\n    for (const index of indices) {\n      const newBase = component(argBase, index);\n      if (newBase === null) {\n        return this.onError(RSErrorCode.invalidFilterArgumentType, node.children[node.children.length - 1], [\n          labelRSLangNode(node),\n          labelType(argument)\n        ]);\n      }\n      bases.push(newBase);\n    }\n\n    if (tupleParam) {\n      for (let child = 0; child + 1 < node.children.length; child++) {\n        const param = this.childTypification(node, child);\n        if (param === null) {\n          return null;\n        }\n        if (param.typeID !== TypeID.collection || !checkCompatibility(bases[child], debool(param))) {\n          return this.onError(RSErrorCode.invalidFilterParameterType, node.children[child], [\n            labelType(param),\n            labelType(bool(bases[child])),\n            operator\n          ]);\n        }\n      }\n    } else {\n      const param = this.childTypification(node, 0);\n      if (param === null) {\n        return null;\n      }\n      const paramType = param;\n      const expected = bool(tuple(bases));\n      if (paramType.typeID !== TypeID.collection || !checkCompatibility(expected, paramType)) {\n        return this.onError(RSErrorCode.invalidFilterParameterType, node.children[0], [\n          labelType(paramType),\n          labelType(expected),\n          operator\n        ]);\n      }\n    }\n    return argument;\n  }\n\n  private visitReduce(node: AstNode): ExpressionType | null {\n    const argument = this.childTypification(node, 0);\n    if (argument === null) {\n      return null;\n    }\n    if (\n      argument.typeID === TypeID.anyTypification ||\n      (argument.typeID === TypeID.collection && argument.base.typeID === TypeID.anyTypification)\n    ) {\n      return EmptySetT;\n    }\n    if (argument.typeID !== TypeID.collection || argument.base.typeID !== TypeID.collection) {\n      return this.onError(RSErrorCode.invalidReduce, node.children[0], [labelType(argument)]);\n    }\n    return debool(argument);\n  }\n\n  private visitArgumentsEnum(node: AstNode): ExpressionType | null {\n    return this.visitAllAndReturn(node, LogicT);\n  }\n\n  private visitDeclarative(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const domain = this.childTypeDebool(\n      node,\n      1,\n      RSErrorCode.invalidTypeOperation,\n      labelToken(TokenID.NT_DECLARATIVE_EXPR)\n    );\n    if (domain === null) {\n      return null;\n    } else if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    } else if (!this.childLogic(node, 2)) {\n      return null;\n    }\n\n    this.locals.endScope(node.children[2]);\n    return bool(domain);\n  }\n\n  private visitImperative(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    for (let child = 1; child < node.children.length; child++) {\n      if (!this.childLogic(node, child)) {\n        return null;\n      }\n    }\n\n    const type = this.childTypification(node, 0);\n    if (type === null) {\n      return null;\n    }\n\n    this.locals.endScope(node);\n    return bool(type);\n  }\n\n  private visitIterate(node: AstNode): ExpressionType | null {\n    const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, labelToken(TokenID.ITERATE));\n    if (domain === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitAssign(node: AstNode): ExpressionType | null {\n    const domain = this.childTypification(node, 1);\n    if (domain === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitRecursion(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const initType = this.childTypification(node, 1);\n    if (initType === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, initType)) {\n      return null;\n    }\n\n    const isFull = node.typeID === TokenID.NT_RECURSIVE_FULL;\n    const iterationIndex = isFull ? 3 : 2;\n\n    let iterationValue = this.childTypification(node, iterationIndex);\n    if (iterationValue === null) {\n      return null;\n    }\n    if (!checkCompatibility(iterationValue, initType)) {\n      return this.onError(RSErrorCode.typesNotEqual, node.children[iterationIndex], [\n        labelType(iterationValue),\n        labelType(initType),\n        labelToken(node.typeID as TokenID)\n      ]);\n    }\n\n    if (hasGenerics(initType)) {\n      for (let retries = TypeAuditor.TYPE_DEDUCTION_DEPTH; retries > 0; retries--) {\n        this.locals.endScope(node);\n        this.locals.clearUnused();\n        this.locals.startScope();\n        if (!this.visitChildDeclaration(node, 0, iterationValue)) {\n          return null;\n        }\n        const newIteration = this.childTypification(node, iterationIndex);\n        if (newIteration === null) {\n          return null;\n        }\n        if (checkEquality(newIteration, iterationValue)) {\n          break;\n        }\n        iterationValue = newIteration;\n      }\n    }\n\n    if (isFull) {\n      if (!this.childLogic(node, 2)) {\n        return null;\n      }\n    }\n\n    this.locals.endScope(node);\n    return iterationValue;\n  }\n\n  private isSubset(token: TokenID): boolean {\n    return token === TokenID.SUBSET || token === TokenID.SUBSET_OR_EQ || token === TokenID.NOT_SUBSET;\n  }\n\n  private isInsideFuncArgument(node: AstNode): boolean {\n    while (node.parent && node.parent !== node) {\n      if (node.typeID === TokenID.NT_ARGUMENTS) return true;\n      node = node.parent;\n    }\n    return false;\n  }\n\n  private checkFuncArguments(node: AstNode, alias: string, type: Parametrized): Map<string, Typification> | null {\n    if (node.children.length - 1 !== type.args.length) {\n      return this.onError(RSErrorCode.invalidArgsArity, node.children[1], [\n        String(type.args.length),\n        String(node.children.length - 1)\n      ]);\n    }\n\n    const substitutes = new Map<string, Typification>();\n    for (let child = 1; child < node.children.length; child++) {\n      const childType = this.childTypification(node, child);\n      if (childType === null) {\n        return null;\n      }\n      const argType = mangleRadicals(alias, type.args[child - 1].type);\n      if (!compareTemplated(substitutes, argType, childType)) {\n        this.onError(RSErrorCode.invalidArgumentType, node.children[child], [\n          `${type.args[child - 1].alias}∈${labelType(argType)}`,\n          labelType(childType)\n        ]);\n        return null;\n      }\n    }\n    return substitutes;\n  }\n}\n\n// ========= Internals ========\nfunction mangleRadicals(funcName: string, type: Typification): Typification {\n  switch (type.typeID) {\n    default:\n      throw new Error(`Unexpected type for ${funcName}: ${JSON.stringify(type)}`);\n    case TypeID.anyTypification:\n    case TypeID.integer:\n      return type;\n    case TypeID.basic: {\n      if (isRadical(type.baseID)) {\n        return {\n          typeID: type.typeID,\n          baseID: type.baseID + funcName\n        };\n      }\n      return type;\n    }\n    case TypeID.collection: {\n      return {\n        typeID: type.typeID,\n        base: mangleRadicals(funcName, debool(type))\n      };\n    }\n    case TypeID.tuple: {\n      const factors: Typification[] = [];\n      for (let index = 1; index <= type.factors.length; ++index) {\n        factors.push(mangleRadicals(funcName, component(type, index)!));\n      }\n      return {\n        typeID: type.typeID,\n        factors: factors\n      };\n    }\n  }\n}\n\n/** Local variable data. */\ninterface LocalData {\n  alias: string;\n  level: number;\n  useCount: number;\n  type: Typification;\n}\n\n/** Local variables context. */\nclass LocalContext {\n  private onError: (code: RSErrorCode, node: AstNode, params: string[]) => null;\n\n  public data: LocalData[] = [];\n\n  constructor(onError: (code: RSErrorCode, node: AstNode, params: string[]) => null) {\n    this.onError = onError;\n  }\n\n  startScope(): void {\n    for (const local of this.data) {\n      if (local.level > 0) {\n        local.level = local.level + 1;\n      }\n    }\n  }\n\n  endScope(node: AstNode, skipUnused: boolean = false): void {\n    for (const local of this.data) {\n      local.level--;\n      if (!skipUnused && local.level === 0 && local.useCount === 0) {\n        this.onError(RSErrorCode.localNotUsed, node, [local.alias]);\n      }\n    }\n  }\n\n  clearUnused(): void {\n    this.data = this.data.filter(data => data.level > 0);\n  }\n\n  pushLocal(node: AstNode, type: Typification): boolean {\n    const alias = getNodeText(node);\n    const existing = this.data.find(data => data.alias === alias);\n    if (existing) {\n      if (existing.level > 0) {\n        this.onError(RSErrorCode.localShadowing, node, [alias]);\n        return false;\n      } else {\n        this.onError(RSErrorCode.localDoubleDeclare, node, [alias]);\n        const index = this.data.indexOf(existing);\n        if (index !== -1) {\n          this.data.splice(index, 1);\n        }\n      }\n    }\n    this.data.push({ alias, type, level: 1, useCount: 0 });\n    return true;\n  }\n\n  getLocalType(node: AstNode): Typification | null {\n    const alias = getNodeText(node);\n    const local = this.data.find(data => data.alias === alias);\n    if (local === undefined) {\n      this.onError(RSErrorCode.localUndeclared, node, [alias]);\n      return null;\n    } else if (local.level < 1) {\n      this.onError(RSErrorCode.localOutOfScope, node, [alias]);\n      return null;\n    } else {\n      local.useCount++;\n      return local.type;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AAsCA,IAAa,cAAb,MAAa,YAAY;CACvB,OAAwB,uBAAuB;CAE/C;CACA;CACA;CACA;CACA;CAEA,YAAY,SAAsB;EAChC,KAAK,gBAAgB;EACrB,KAAK,iBAAiB;EACtB,KAAK,UAAU;EACf,KAAK,SAAS,IAAI,aAAa,KAAK,QAAQ,KAAK,IAAI,CAAC;CACxD;CAEA,IACE,KACA,eACA,UACA,iBAA0B,OACH;EACvB,IAAI,IAAI,UACN,OAAO;EAET,KAAK,gBAAgB;EACrB,KAAK,iBAAiB;EACtB,KAAK,WAAW;EAChB,KAAK,MAAM;EACX,OAAO,KAAK,cAAc,GAAG;CAC/B;CAEA,QAAsB;EACpB,KAAK,SAAS,IAAI,aAAa,KAAK,QAAQ,KAAK,IAAI,CAAC;CACxD;CAEA,gBAAwB,MAAe,QAA+B;EACpE,MAAM,SAAS,KAAK,eAAe,MAAM,MAAM;EAC/C,IAAI,WAAW,QAAQ,KAAK,eAC1B,aAAa,MAAM,MAAM;EAE3B,OAAO;CACT;CAEA,eAAuB,MAAe,QAA+B;EACnE,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,UACX,OAAO,KAAK,aAAa,MAAM,MAAM;GACvC,KAAK,QAAQ,eACX,OAAO,KAAK,aAAa,MAAM,MAAM;GACvC,KAAK,QAAQ,cACX,OAAO,KAAK,mBAAmB,MAAM,MAAM;EAC/C;EACA,OAAO;CACT;CAEA,aAAqB,MAAe,QAA+B;EACjE,OAAO,KAAK,OAAO,UAAU,MAAM,MAAM;CAC3C;CAEA,aAAqB,MAAe,QAA+B;EACjE,IAAI,OAAO,WAAW,OAAO,SAAS,OAAO,QAAQ,WAAW,KAAK,SAAS,QAAQ;GACpF,KAAK,QAAQ,YAAY,uBAAuB,KAAK,SAAS,EAAE;GAChE,OAAO;EACT;EACA,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,IAAI,CAAC,KAAK,sBAAsB,MAAM,OAAO,UAAU,QAAQ,QAAQ,CAAC,CAAE,GACxE,OAAO;EAGX,OAAO;CACT;CAEA,mBAA2B,MAAe,QAA+B;EACvE,KAAK,MAAM,SAAS,KAAK,UACvB,IAAI,CAAC,KAAK,gBAAgB,OAAO,MAAM,GACrC,OAAO;EAGX,OAAO;CACT;CAEA,cAAsB,MAAsC;EAC1D,MAAM,SAAS,KAAK,aAAa,IAAI;EACrC,IAAI,WAAW,QAAQ,KAAK,eAC1B,aAAa,MAAM,MAAM;EAE3B,OAAO;CACT;CAEA,aAAqB,MAAsC;EACzD,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,cACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,UACX,OAAO,KAAK,WAAW,IAAI;GAC7B,KAAK,QAAQ,YACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,aACX,OAAO;GACT,KAAK,QAAQ,mBACX,OAAO,KAAK,QAAQ;GACtB,KAAK,QAAQ,cACX,OAAO,KAAK,cAAc,IAAI;GAEhC,KAAK,QAAQ,cACX,OAAO,KAAK,mBAAmB,IAAI;GACrC,KAAK,QAAQ,aACX,OAAO,KAAK,cAAc,IAAI;GAEhC,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,UACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ;GACb,KAAK,QAAQ,gBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,WACX,OAAO,KAAK,cAAc,IAAI;GAEhC,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,kBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ;GACb,KAAK,QAAQ,UACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,cACX,OAAO,KAAK,sBAAsB,IAAI;GAExC,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,YACX,OAAO,KAAK,sBAAsB,IAAI;GAExC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAC9B,KAAK,QAAQ,SACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,UACX,OAAO,KAAK,WAAW,IAAI;GAC7B,KAAK,QAAQ,gBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ,OACX,OAAO,KAAK,gBAAgB,IAAI;GAClC,KAAK,QAAQ,SACX,OAAO,KAAK,kBAAkB,IAAI;GACpC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAC5B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAC9B,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAC5B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,qBACX,OAAO,KAAK,mBAAmB,IAAI;GAErC,KAAK,QAAQ,oBACX,OAAO,KAAK,wBAAwB,IAAI;GAE1C,KAAK,QAAQ,cACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ,SACX,OAAO,KAAK,aAAa,IAAI;GAC/B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,qBACX,OAAO,KAAK,iBAAiB,IAAI;GACnC,KAAK,QAAQ,oBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ;GACb,KAAK,QAAQ,oBACX,OAAO,KAAK,eAAe,IAAI;EACnC;EACA,OAAO;CACT;CAEA,QAAgB,MAAmB,MAAe,QAAyB;EACzE,KAAK,WAAW;GAAE;GAAM,MAAM,KAAK;GAAM,IAAI,KAAK;GAAI;EAAO,CAAC;EAC9D,IAAI,KAAK,gBACP,cAAc,MAAM,MAAM,MAAM;EAElC,OAAO;CACT;CAEA,WAAmB,MAAe,OAAsC;EACtE,IAAI,SAAS,KAAK,SAAS,QACzB,OAAO;EAET,OAAO,KAAK,cAAc,KAAK,SAAS,MAAM;CAChD;CAEA,sBAA8B,MAAe,OAAe,QAA+B;EACzF,IAAI,SAAS,KAAK,SAAS,QACzB,OAAO;EAET,IAAI,CAAC,KAAK,gBAAgB,KAAK,SAAS,QAAQ,MAAM,GACpD,OAAO;EAET,OAAO;CACT;CAEA,kBAA0B,MAAe,MAAoD;EAC3F,KAAK,MAAM,SAAS,KAAK,UACvB,IAAI,CAAC,KAAK,cAAc,KAAK,GAC3B,OAAO;EAGX,OAAO;CACT;CAEA,kBAA0B,MAAe,OAAoC;EAC3E,MAAM,SAAS,KAAK,WAAW,MAAM,KAAK;EAC1C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,eAAe,MAAM,GAAG;GAC3B,KAAK,QAAQ,YAAY,iBAAiB,KAAK,SAAS,QAAQ,CAAC,UAAU,MAAM,CAAC,CAAC;GACnF,OAAO;EACT;EACA,OAAO;CACT;CAEA,WAAmB,MAAe,OAAwB;EACxD,MAAM,SAAS,KAAK,WAAW,MAAM,KAAK;EAC1C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,OAAO;GAClC,KAAK,QAAQ,YAAY,eAAe,KAAK,SAAS,QAAQ,CAAC,UAAU,MAAM,CAAC,CAAC;GACjF,OAAO;EACT;EACA,OAAO;CACT;CAEA,gBACE,MACA,OACA,WACA,WACqB;EACrB,MAAM,SAAS,KAAK,kBAAkB,MAAM,KAAK;EACjD,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,iBAC3B,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,YAAY;GACvC,MAAM,SACJ,cAAc,YAAY,wBAAwB,cAAc,SAC5D,CAAC,WAAW,UAAU,MAAM,CAAC,IAC7B,CAAC,UAAU,MAAM,CAAC;GACxB,KAAK,QAAQ,WAAW,KAAK,SAAS,QAAQ,MAAM;GACpD,OAAO;EACT;EACA,OAAO,OAAO,MAAM;CACtB;CAEA,sBAA8B,MAAe,OAAe,UAAuC;EACjG,MAAM,SAAS,KAAK,WAAW,MAAM,KAAK;EAC1C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,eAAe,MAAM,GAAG;GAC3B,KAAK,QAAQ,YAAY,yBAAyB,KAAK,SAAS,QAAQ,CAAC,UAAU,UAAU,MAAM,CAAC,CAAC;GACrG,OAAO;EACT;EACA,IAAI,OAAO,WAAW,OAAO,iBAC3B,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,YAAY;GACvC,KAAK,QAAQ,YAAY,yBAAyB,KAAK,SAAS,QAAQ,CAAC,UAAU,UAAU,MAAM,CAAC,CAAC;GACrG,OAAO;EACT;EACA,OAAO,OAAO,MAAM;CACtB;CAEA,WAAmB,MAAsC;EACvD,OAAO,KAAK,OAAO,aAAa,IAAI;CACtC;CAEA,YAAoB,MAAsC;EACxD,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,OAAO,KAAK,QAAQ,IAAI,KAAK;EACnC,IAAI,CAAC,MACH,OAAO,KAAK,QAAQ,YAAY,gBAAgB,MAAM,CAAC,KAAK,CAAC;EAE/D,OAAO;CACT;CAEA,wBAAgC,MAAsC;EACpE,KAAK,OAAO,WAAW;EACvB,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAGT,MAAM,OAAmB,CAAC;EAC1B,KAAK,MAAM,SAAS,KAAK,OAAO,MAC9B,IAAI,MAAM,UAAU,GAClB,KAAK,KAAK;GAAE,OAAO,MAAM;GAAO,MAAM,MAAM;EAAK,CAAC;EAItD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,QAAQ,OAAO,WAAW,OAAO,YAAY,OAAO,WAAW,OAAO,WACnF,OAAO;EAET,KAAK,OAAO,SAAS,KAAK,SAAS,EAAE;EACrC,IAAI,OAAO,WAAW,OAAO,OAC3B,OAAO;GACL,QAAQ,OAAO;GACP;GACF;EACR;OAEA,OAAO;GACL,QAAQ,OAAO;GACP;GACF;EACR;CAEJ;CAEA,kBAA0B,MAAsC;EAC9D,MAAM,WAAW,YAAY,KAAK,SAAS,EAAE;EAC7C,MAAM,WAAW,KAAK,QAAQ,IAAI,QAAQ;EAC1C,IAAI,UAAU,WAAW,OAAO,YAAY,UAAU,WAAW,OAAO,WACtE,OAAO,KAAK,QAAQ,YAAY,gBAAgB,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC;EAE9E,IAAI,KAAK,eACP,aAAa,KAAK,SAAS,IAAI,QAAQ;EAGzC,MAAM,cAAc,KAAK,mBAAmB,MAAM,UAAU,QAAQ;EACpE,IAAI,gBAAgB,MAClB,OAAO;EAET,IAAI,SAAS,OAAO,WAAW,OAAO,OACpC,OAAO,SAAS;OACX;GACL,MAAM,SAAS,eAAe,UAAU,SAAS,MAAM;GACvD,IAAI,YAAY,OAAO,GACrB,eAAe,QAAQ,WAAW;GAEpC,OAAO;EACT;CACF;CAEA,aAAqB,MAAsC;EACzD,MAAM,QAAQ,YAAY,IAAI;EAC9B,IAAI,CAAC,KAAK,qBAAqB,IAAI,GACjC,OAAO,KAAK,QAAQ,YAAY,cAAc,MAAM,CAAC,KAAK,CAAC;EAE7D,OAAO,KAAK;GAAE,QAAQ,OAAO;GAAO,QAAQ;EAAM,CAAC;CACrD;CAEA,cAAsB,MAAsC;EAY1D,IAAI;GAVF,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;EAEN,CAAA,CAAe,SAAS,KAAK,QAAQ,MAAiB,GACxD,OAAO,KAAK,QAAQ,YAAY,sBAAsB,IAAI;EAE5D,OAAO;CACT;CAEA,cAAsB,MAAsC;EAC1D,MAAM,WAAW,KAAK,SAAS;EAC/B,IAAI,SAAS,WAAW,QAAQ,eAC9B,OAAO,KAAK,QAAQ,YAAY,+BAA+B,QAAQ;EAEzE,MAAM,SAAS,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,WAAW,QAAQ,OAAO,CAAC;EAC1G,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GAC7C,OAAO;EAET,OAAO;CACT;CAEA,UAAkB,MAAsC;EACtD,IAAI,CAAC,KAAK,gBAAgB,MAAM,GAAG,YAAY,WAAW,GACxD,OAAO;EAET,OAAO;CACT;CAEA,gBAAwB,MAAsC;EAC5D,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,kBAAkB,SAAS,MAAM,eACrC,OAAO,KAAK,QAAQ,YAAY,wBAAwB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGxG,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,kBAAkB,SAAS,MAAM,eACrC,OAAO,KAAK,QAAQ,YAAY,wBAAwB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGxG,MAAM,SAAS,mBAAmB,OAAO,KAAK;EAC9C,IAAI,WAAW,MACb,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;EAE1G,OAAO;CACT;CAEA,sBAA8B,MAAsC;EAClE,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,eAAe,SAAS,MAAM,YAClC,OAAO,KAAK,QAAQ,YAAY,sBAAsB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGtG,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,eAAe,SAAS,MAAM,YAClC,OAAO,KAAK,QAAQ,YAAY,sBAAsB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGtG,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAClC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;EAE1G,OAAO;CACT;CAEA,gBAAwB,MAAsC;EAC5D,KAAK,OAAO,WAAW;EAEvB,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,SAAS,KAAK,sBAAsB,MAAM,GAAG,QAAQ;EAC3D,IAAI,WAAW,MACb,OAAO;OACF,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GACpD,OAAO;OACF,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GACjC,OAAO;EAGT,KAAK,OAAO,SAAS,KAAK,SAAS,EAAE;EACrC,OAAO;CACT;CAEA,cAAsB,MAAsC;EAC1D,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAET,OAAO;CACT;CAEA,iBAAyB,MAAsC;EAC7D,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,KAAK,CAAC,KAAK,WAAW,MAAM,CAAC,GACvD,OAAO;EAET,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAClC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;EAE1G,OAAO;CACT;CAEA,sBAA8B,MAAsC;EAClE,MAAM,WAAW,gBAAgB,IAAI;EACrC,IAAI,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,QAAQ;EACpF,IAAI,UAAU,MACZ,OAAO;EAET,MAAM,WAAW,KAAK,SAAS,KAAK,MAAiB;EACrD,IAAI,UACF,QAAQ,KAAK,KAAK;EAEpB,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAGT,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAClC,IAAI,UACF,OAAO,KAAK,QAAQ,YAAY,eAAe,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;OAEnG,OAAO,KAAK,QAAQ,YAAY,yBAAyB,MAAM;GAC7D,UAAU,KAAK;GACf;GACA,UAAU,KAAK,KAAK,CAAC;EACvB,CAAC;EAGL,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,MAAM,UAA0B,CAAC;EACjC,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,OAAO,KAAK,gBAAgB,MAAM,OAAO,YAAY,aAAa;GACxE,IAAI,SAAS,MACX,OAAO;QAEP,QAAQ,KAAK,IAAI;EAErB;EACA,OAAO,KAAK,MAAM,OAAO,CAAC;CAC5B;CAEA,aAAqB,MAAsC;EACzD,MAAM,OAAO,KAAK,gBAAgB,MAAM,GAAG,YAAY,cAAc;EACrE,IAAI,SAAS,MACX,OAAO;EAET,OAAO,KAAK,KAAK,IAAI,CAAC;CACxB;CAEA,WAAmB,MAAsC;EACvD,MAAM,aAA6B,CAAC;EACpC,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,OAAO,KAAK,kBAAkB,MAAM,KAAK;GAC/C,IAAI,SAAS,MACX,OAAO;GAET,WAAW,KAAK,IAAI;EACtB;EACA,OAAO,MAAM,UAAU;CACzB;CAEA,iBAAyB,MAAsC;EAC7D,IAAI,OAA8B,KAAK,kBAAkB,MAAM,CAAC;EAChE,IAAI,SAAS,MACX,OAAO;EAET,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,YAAY,KAAK,kBAAkB,MAAM,KAAK;GACpD,IAAI,cAAc,MAChB,OAAO;GAGT,MAAM,QAAQ,mBAAmB,MAAM,SAAS;GAChD,IAAI,UAAU,MACZ,OAAO,KAAK,QAAQ,YAAY,oBAAoB,KAAK,SAAS,QAAQ,CACxE,UAAU,IAAI,GACd,UAAU,SAAS,CACrB,CAAC;GAEH,OAAO;EACT;EACA,OAAO,KAAK,IAAI;CAClB;CAEA,UAAkB,MAAsC;EACtD,OAAO,KAAK,iBAAiB,IAAI;CACnC;CAEA,YAAoB,MAAsC;EACxD,OAAO,KAAK,gBAAgB,MAAM,GAAG,YAAY,aAAa;CAChE;CAEA,mBAA2B,MAAsC;EAC/D,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,QAAQ;EACtF,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,QAAQ;EACtF,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,SAAS,mBAAmB,OAAO,KAAK;EAC9C,IAAI,WAAW,MACb,OAAO,KAAK,QAAQ,YAAY,eAAe,MAAM;GAAC,UAAU,KAAK,KAAK,CAAC;GAAG,UAAU,KAAK,KAAK,CAAC;GAAG;EAAQ,CAAC;EAEjH,OAAO,KAAK,MAAM;CACpB;CAEA,gBAAwB,MAAsC;EAC5D,MAAM,WAAW,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC/E,IAAI,aAAa,MACf,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,iBAC7B,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,OAC7B,OAAO,KAAK,QAAQ,YAAY,sBAAsB,KAAK,SAAS,IAAI,CACtE,gBAAgB,IAAI,GACpB,UAAU,KAAK,QAAQ,CAAC,CAC1B,CAAC;EAGH,MAAM,UAAU,eAAe,IAAI;EACnC,MAAM,aAA6B,CAAC;EACpC,KAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,eAAe,UAAU,UAAU,KAAK;GAC9C,IAAI,iBAAiB,MACnB,OAAO,KAAK,QAAQ,YAAY,sBAAsB,KAAK,SAAS,IAAI,CACtE,gBAAgB,IAAI,GACpB,UAAU,KAAK,QAAQ,CAAC,CAC1B,CAAC;QAED,WAAW,KAAK,YAAY;EAEhC;EACA,IAAI,WAAW,WAAW,GACxB,OAAO,KAAK,WAAW,EAAE;OAEzB,OAAO,KAAK,MAAM,UAAU,CAAC;CAEjC;CAEA,kBAA0B,MAAsC;EAC9D,MAAM,WAAW,KAAK,kBAAkB,MAAM,CAAC;EAC/C,IAAI,aAAa,MACf,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,iBAC7B,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,OAC7B,OAAO,KAAK,QAAQ,YAAY,wBAAwB,KAAK,SAAS,IAAI,CACxE,gBAAgB,IAAI,GACpB,UAAU,QAAQ,CACpB,CAAC;EAGH,MAAM,UAAU,eAAe,IAAI;EACnC,MAAM,aAA6B,CAAC;EACpC,KAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,eAAe,UAAU,UAAU,KAAK;GAC9C,IAAI,iBAAiB,MACnB,OAAO,KAAK,QAAQ,YAAY,wBAAwB,KAAK,SAAS,IAAI,CACxE,gBAAgB,IAAI,GACpB,UAAU,QAAQ,CACpB,CAAC;QAED,WAAW,KAAK,YAAY;EAEhC;EACA,IAAI,WAAW,WAAW,GACxB,OAAO,WAAW;OAElB,OAAO,MAAM,UAAU;CAE3B;CAEA,YAAoB,MAAsC;EACxD,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,UAAU,eAAe,IAAI;EACnC,MAAM,aAAa,QAAQ,WAAW,KAAK,SAAS,SAAS;EAC7D,IAAI,CAAC,cAAc,KAAK,SAAS,SAAS,GACxC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,IAAI;EAG1D,MAAM,WAAW,KAAK,kBAAkB,MAAM,KAAK,SAAS,SAAS,CAAC;EACtE,IAAI,aAAa,MACf,OAAO;EAET,IACE,SAAS,WAAW,OAAO,mBAC1B,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,iBAE1E,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,OAC3E,OAAO,KAAK,QAAQ,YAAY,2BAA2B,KAAK,SAAS,KAAK,SAAS,SAAS,IAAI,CAClG,gBAAgB,IAAI,GACpB,UAAU,QAAQ,CACpB,CAAC;EAGH,MAAM,UAAU,OAAO,QAAQ;EAC/B,MAAM,QAAwB,CAAC;EAC/B,KAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,UAAU,UAAU,SAAS,KAAK;GACxC,IAAI,YAAY,MACd,OAAO,KAAK,QAAQ,YAAY,2BAA2B,KAAK,SAAS,KAAK,SAAS,SAAS,IAAI,CAClG,gBAAgB,IAAI,GACpB,UAAU,QAAQ,CACpB,CAAC;GAEH,MAAM,KAAK,OAAO;EACpB;EAEA,IAAI,YACF,KAAK,IAAI,QAAQ,GAAG,QAAQ,IAAI,KAAK,SAAS,QAAQ,SAAS;GAC7D,MAAM,QAAQ,KAAK,kBAAkB,MAAM,KAAK;GAChD,IAAI,UAAU,MACZ,OAAO;GAET,IAAI,MAAM,WAAW,OAAO,cAAc,CAAC,mBAAmB,MAAM,QAAQ,OAAO,KAAK,CAAC,GACvF,OAAO,KAAK,QAAQ,YAAY,4BAA4B,KAAK,SAAS,QAAQ;IAChF,UAAU,KAAK;IACf,UAAU,KAAK,MAAM,MAAM,CAAC;IAC5B;GACF,CAAC;EAEL;OACK;GACL,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;GAC5C,IAAI,UAAU,MACZ,OAAO;GAET,MAAM,YAAY;GAClB,MAAM,WAAW,KAAK,MAAM,KAAK,CAAC;GAClC,IAAI,UAAU,WAAW,OAAO,cAAc,CAAC,mBAAmB,UAAU,SAAS,GACnF,OAAO,KAAK,QAAQ,YAAY,4BAA4B,KAAK,SAAS,IAAI;IAC5E,UAAU,SAAS;IACnB,UAAU,QAAQ;IAClB;GACF,CAAC;EAEL;EACA,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,MAAM,WAAW,KAAK,kBAAkB,MAAM,CAAC;EAC/C,IAAI,aAAa,MACf,OAAO;EAET,IACE,SAAS,WAAW,OAAO,mBAC1B,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,iBAE1E,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,YAC3E,OAAO,KAAK,QAAQ,YAAY,eAAe,KAAK,SAAS,IAAI,CAAC,UAAU,QAAQ,CAAC,CAAC;EAExF,OAAO,OAAO,QAAQ;CACxB;CAEA,mBAA2B,MAAsC;EAC/D,OAAO,KAAK,kBAAkB,MAAM,MAAM;CAC5C;CAEA,iBAAyB,MAAsC;EAC7D,KAAK,OAAO,WAAW;EAEvB,MAAM,SAAS,KAAK,gBAClB,MACA,GACA,YAAY,sBACZ,WAAW,QAAQ,mBAAmB,CACxC;EACA,IAAI,WAAW,MACb,OAAO;OACF,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GACpD,OAAO;OACF,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GACjC,OAAO;EAGT,KAAK,OAAO,SAAS,KAAK,SAAS,EAAE;EACrC,OAAO,KAAK,MAAM;CACpB;CAEA,gBAAwB,MAAsC;EAC5D,KAAK,OAAO,WAAW;EAEvB,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,IAAI,CAAC,KAAK,WAAW,MAAM,KAAK,GAC9B,OAAO;EAIX,MAAM,OAAO,KAAK,kBAAkB,MAAM,CAAC;EAC3C,IAAI,SAAS,MACX,OAAO;EAGT,KAAK,OAAO,SAAS,IAAI;EACzB,OAAO,KAAK,IAAI;CAClB;CAEA,aAAqB,MAAsC;EACzD,MAAM,SAAS,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,WAAW,QAAQ,OAAO,CAAC;EAC1G,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GAC7C,OAAO;EAET,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,MAAM,SAAS,KAAK,kBAAkB,MAAM,CAAC;EAC7C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GAC7C,OAAO;EAET,OAAO;CACT;CAEA,eAAuB,MAAsC;EAC3D,KAAK,OAAO,WAAW;EAEvB,MAAM,WAAW,KAAK,kBAAkB,MAAM,CAAC;EAC/C,IAAI,aAAa,MACf,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,QAAQ,GAC/C,OAAO;EAGT,MAAM,SAAS,KAAK,WAAW,QAAQ;EACvC,MAAM,iBAAiB,SAAS,IAAI;EAEpC,IAAI,iBAAiB,KAAK,kBAAkB,MAAM,cAAc;EAChE,IAAI,mBAAmB,MACrB,OAAO;EAET,IAAI,CAAC,mBAAmB,gBAAgB,QAAQ,GAC9C,OAAO,KAAK,QAAQ,YAAY,eAAe,KAAK,SAAS,iBAAiB;GAC5E,UAAU,cAAc;GACxB,UAAU,QAAQ;GAClB,WAAW,KAAK,MAAiB;EACnC,CAAC;EAGH,IAAI,YAAY,QAAQ,GACtB,KAAK,IAAI,UAAU,YAAY,sBAAsB,UAAU,GAAG,WAAW;GAC3E,KAAK,OAAO,SAAS,IAAI;GACzB,KAAK,OAAO,YAAY;GACxB,KAAK,OAAO,WAAW;GACvB,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,cAAc,GACrD,OAAO;GAET,MAAM,eAAe,KAAK,kBAAkB,MAAM,cAAc;GAChE,IAAI,iBAAiB,MACnB,OAAO;GAET,IAAI,cAAc,cAAc,cAAc,GAC5C;GAEF,iBAAiB;EACnB;EAGF,IAAI,QACF;OAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EACT;EAGF,KAAK,OAAO,SAAS,IAAI;EACzB,OAAO;CACT;CAEA,SAAiB,OAAyB;EACxC,OAAO,UAAU,QAAQ,UAAU,UAAU,QAAQ,gBAAgB,UAAU,QAAQ;CACzF;CAEA,qBAA6B,MAAwB;EACnD,OAAO,KAAK,UAAU,KAAK,WAAW,MAAM;GAC1C,IAAI,KAAK,WAAW,QAAQ,cAAc,OAAO;GACjD,OAAO,KAAK;EACd;EACA,OAAO;CACT;CAEA,mBAA2B,MAAe,OAAe,MAAsD;EAC7G,IAAI,KAAK,SAAS,SAAS,MAAM,KAAK,KAAK,QACzC,OAAO,KAAK,QAAQ,YAAY,kBAAkB,KAAK,SAAS,IAAI,CAClE,OAAO,KAAK,KAAK,MAAM,GACvB,OAAO,KAAK,SAAS,SAAS,CAAC,CACjC,CAAC;EAGH,MAAM,8BAAc,IAAI,IAA0B;EAClD,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,YAAY,KAAK,kBAAkB,MAAM,KAAK;GACpD,IAAI,cAAc,MAChB,OAAO;GAET,MAAM,UAAU,eAAe,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC,IAAI;GAC/D,IAAI,CAAC,iBAAiB,aAAa,SAAS,SAAS,GAAG;IACtD,KAAK,QAAQ,YAAY,qBAAqB,KAAK,SAAS,QAAQ,CAClE,GAAG,KAAK,KAAK,QAAQ,EAAE,CAAC,MAAM,GAAG,UAAU,OAAO,KAClD,UAAU,SAAS,CACrB,CAAC;IACD,OAAO;GACT;EACF;EACA,OAAO;CACT;AACF;AAGA,SAAS,eAAe,UAAkB,MAAkC;CAC1E,QAAQ,KAAK,QAAb;EACE,SACE,MAAM,IAAI,MAAM,uBAAuB,SAAS,IAAI,KAAK,UAAU,IAAI,GAAG;EAC5E,KAAK,OAAO;EACZ,KAAK,OAAO,SACV,OAAO;EACT,KAAK,OAAO;GACV,IAAI,UAAU,KAAK,MAAM,GACvB,OAAO;IACL,QAAQ,KAAK;IACb,QAAQ,KAAK,SAAS;GACxB;GAEF,OAAO;EAET,KAAK,OAAO,YACV,OAAO;GACL,QAAQ,KAAK;GACb,MAAM,eAAe,UAAU,OAAO,IAAI,CAAC;EAC7C;EAEF,KAAK,OAAO,OAAO;GACjB,MAAM,UAA0B,CAAC;GACjC,KAAK,IAAI,QAAQ,GAAG,SAAS,KAAK,QAAQ,QAAQ,EAAE,OAClD,QAAQ,KAAK,eAAe,UAAU,UAAU,MAAM,KAAK,CAAE,CAAC;GAEhE,OAAO;IACL,QAAQ,KAAK;IACJ;GACX;EACF;CACF;AACF;;AAWA,IAAM,eAAN,MAAmB;CACjB;CAEA,OAA2B,CAAC;CAE5B,YAAY,SAAuE;EACjF,KAAK,UAAU;CACjB;CAEA,aAAmB;EACjB,KAAK,MAAM,SAAS,KAAK,MACvB,IAAI,MAAM,QAAQ,GAChB,MAAM,QAAQ,MAAM,QAAQ;CAGlC;CAEA,SAAS,MAAe,aAAsB,OAAa;EACzD,KAAK,MAAM,SAAS,KAAK,MAAM;GAC7B,MAAM;GACN,IAAI,CAAC,cAAc,MAAM,UAAU,KAAK,MAAM,aAAa,GACzD,KAAK,QAAQ,YAAY,cAAc,MAAM,CAAC,MAAM,KAAK,CAAC;EAE9D;CACF;CAEA,cAAoB;EAClB,KAAK,OAAO,KAAK,KAAK,QAAO,SAAQ,KAAK,QAAQ,CAAC;CACrD;CAEA,UAAU,MAAe,MAA6B;EACpD,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,WAAW,KAAK,KAAK,MAAK,SAAQ,KAAK,UAAU,KAAK;EAC5D,IAAI,UACF,IAAI,SAAS,QAAQ,GAAG;GACtB,KAAK,QAAQ,YAAY,gBAAgB,MAAM,CAAC,KAAK,CAAC;GACtD,OAAO;EACT,OAAO;GACL,KAAK,QAAQ,YAAY,oBAAoB,MAAM,CAAC,KAAK,CAAC;GAC1D,MAAM,QAAQ,KAAK,KAAK,QAAQ,QAAQ;GACxC,IAAI,UAAU,IACZ,KAAK,KAAK,OAAO,OAAO,CAAC;EAE7B;EAEF,KAAK,KAAK,KAAK;GAAE;GAAO;GAAM,OAAO;GAAG,UAAU;EAAE,CAAC;EACrD,OAAO;CACT;CAEA,aAAa,MAAoC;EAC/C,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,QAAQ,KAAK,KAAK,MAAK,SAAQ,KAAK,UAAU,KAAK;EACzD,IAAI,UAAU,QAAW;GACvB,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;GACvD,OAAO;EACT,OAAO,IAAI,MAAM,QAAQ,GAAG;GAC1B,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;GACvD,OAAO;EACT,OAAO;GACL,MAAM;GACN,OAAO,MAAM;EACf;CACF;AACF"}
+{"version":3,"file":"type-auditor.js","names":[],"sources":["../../../src/rslang/semantic/type-auditor.ts"],"sourcesContent":["/**\n * Module: Type auditor for AST type checking.\n */\n\nimport { type AstNode, getNodeIndices, getNodeText } from '../../parsing';\nimport { annotateError, annotateType } from '../ast-annotations';\nimport { type ErrorReporter, RSErrorCode } from '../error';\nimport { labelRSLangNode, labelToken, labelType } from '../labels';\nimport { TokenID } from '../parser/token';\n\nimport {\n  type Argument,\n  bool,\n  component,\n  debool,\n  type EchelonTuple,\n  EmptySetT,\n  type ExpressionType,\n  IntegerT,\n  isRadical,\n  isTypification,\n  LogicT,\n  type Parametrized,\n  tuple,\n  type TypeContext,\n  TypeID,\n  type Typification\n} from './typification';\nimport {\n  checkCompatibility,\n  checkEquality,\n  compareTemplated,\n  hasGenerics,\n  mergeTypifications,\n  substituteBase\n} from './typification-api';\n\n/** Type auditor for AST type checking. */\nexport class TypeAuditor {\n  private static readonly TYPE_DEDUCTION_DEPTH = 5;\n\n  private context: TypeContext;\n  private reporter?: ErrorReporter;\n  private locals: LocalContext;\n  private annotateTypes: boolean;\n  private annotateErrors: boolean;\n\n  constructor(context: TypeContext) {\n    this.annotateTypes = false;\n    this.annotateErrors = false;\n    this.context = context;\n    this.locals = new LocalContext(this.onError.bind(this));\n  }\n\n  public run(\n    ast: AstNode,\n    annotateTypes: boolean,\n    reporter?: ErrorReporter,\n    annotateErrors: boolean = false\n  ): ExpressionType | null {\n    if (ast.hasError) {\n      return null;\n    }\n    this.annotateTypes = annotateTypes;\n    this.annotateErrors = annotateErrors;\n    this.reporter = reporter;\n    this.clear();\n    return this.dispatchVisit(ast);\n  }\n\n  private clear(): void {\n    this.locals = new LocalContext(this.onError.bind(this));\n  }\n\n  private dispatchDeclare(node: AstNode, domain: Typification): boolean {\n    const result = this.processDeclare(node, domain);\n    if (result === true && this.annotateTypes) {\n      annotateType(node, domain);\n    }\n    return result;\n  }\n\n  private processDeclare(node: AstNode, domain: Typification): boolean {\n    switch (node.typeID) {\n      case TokenID.ID_LOCAL:\n        return this.declareLocal(node, domain);\n      case TokenID.NT_TUPLE_DECL:\n        return this.declareTuple(node, domain);\n      case TokenID.NT_ENUM_DECL:\n        return this.declareEnumeration(node, domain);\n    }\n    return false;\n  }\n\n  private declareLocal(node: AstNode, domain: Typification): boolean {\n    return this.locals.pushLocal(node, domain);\n  }\n\n  private declareTuple(node: AstNode, domain: Typification): boolean {\n    if (domain.typeID !== TypeID.tuple || domain.factors.length !== node.children.length) {\n      this.onError(RSErrorCode.invalidCortegeDeclare, node.children[0]);\n      return false;\n    }\n    for (let child = 0; child < node.children.length; child++) {\n      if (!this.visitChildDeclaration(node, child, component(domain, child + 1)!)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private declareEnumeration(node: AstNode, domain: Typification): boolean {\n    for (const child of node.children) {\n      if (!this.dispatchDeclare(child, domain)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private dispatchVisit(node: AstNode): ExpressionType | null {\n    const result = this.processVisit(node);\n    if (result !== null && this.annotateTypes) {\n      annotateType(node, result);\n    }\n    return result;\n  }\n\n  private processVisit(node: AstNode): ExpressionType | null {\n    switch (node.typeID) {\n      case TokenID.ID_GLOBAL:\n      case TokenID.ID_FUNCTION:\n      case TokenID.ID_PREDICATE:\n        return this.visitGlobal(node);\n\n      case TokenID.ID_LOCAL:\n        return this.visitLocal(node);\n      case TokenID.ID_RADICAL:\n        return this.visitRadical(node);\n\n      case TokenID.LIT_INTEGER:\n        return IntegerT;\n      case TokenID.LIT_WHOLE_NUMBERS:\n        return bool(IntegerT);\n      case TokenID.LIT_EMPTYSET:\n        return this.visitEmptySet(node);\n\n      case TokenID.NT_ARGUMENTS:\n        return this.visitArgumentsEnum(node);\n      case TokenID.NT_ARG_DECL:\n        return this.visitArgument(node);\n\n      case TokenID.PLUS:\n      case TokenID.MINUS:\n      case TokenID.MULTIPLY:\n        return this.visitArithmetic(node);\n\n      case TokenID.QUANTOR_UNIVERSAL:\n      case TokenID.QUANTOR_EXISTS:\n        return this.visitQuantifier(node);\n\n      case TokenID.LOGIC_NOT:\n        return this.visitNegation(node);\n\n      case TokenID.LOGIC_AND:\n      case TokenID.LOGIC_OR:\n      case TokenID.LOGIC_IMPLICATION:\n      case TokenID.LOGIC_EQUIVALENT:\n        return this.visitLogicBinary(node);\n\n      case TokenID.EQUAL:\n      case TokenID.NOTEQUAL:\n        return this.visitEquals(node);\n\n      case TokenID.GREATER:\n      case TokenID.LESSER:\n      case TokenID.GREATER_OR_EQ:\n      case TokenID.LESSER_OR_EQ:\n        return this.visitIntegerPredicate(node);\n\n      case TokenID.SET_IN:\n      case TokenID.SET_NOT_IN:\n      case TokenID.SUBSET:\n      case TokenID.SUBSET_OR_EQ:\n      case TokenID.NOT_SUBSET:\n        return this.visitSetexprPredicate(node);\n\n      case TokenID.DECART:\n        return this.visitDecart(node);\n      case TokenID.BOOLEAN:\n        return this.visitBoolean(node);\n\n      case TokenID.NT_TUPLE:\n        return this.visitTuple(node);\n      case TokenID.NT_ENUMERATION:\n        return this.visitEnumeration(node);\n\n      case TokenID.BIGPR:\n        return this.visitProjectSet(node);\n      case TokenID.SMALLPR:\n        return this.visitProjectTuple(node);\n      case TokenID.FILTER:\n        return this.visitFilter(node);\n\n      case TokenID.CARD:\n        return this.visitCard(node);\n      case TokenID.REDUCE:\n        return this.visitReduce(node);\n      case TokenID.BOOL:\n        return this.visitBool(node);\n      case TokenID.DEBOOL:\n        return this.visitDebool(node);\n\n      case TokenID.SET_UNION:\n      case TokenID.SET_INTERSECTION:\n      case TokenID.SET_MINUS:\n      case TokenID.SET_SYMMETRIC_MINUS:\n        return this.visitSetexprBinary(node);\n\n      case TokenID.NT_FUNC_DEFINITION:\n        return this.visitFunctionDefinition(node);\n\n      case TokenID.NT_FUNC_CALL:\n        return this.visitFunctionCall(node);\n\n      case TokenID.ITERATE:\n        return this.visitIterate(node);\n      case TokenID.ASSIGN:\n        return this.visitAssign(node);\n\n      case TokenID.NT_DECLARATIVE_EXPR:\n        return this.visitDeclarative(node);\n      case TokenID.NT_IMPERATIVE_EXPR:\n        return this.visitImperative(node);\n\n      case TokenID.NT_RECURSIVE_FULL:\n      case TokenID.NT_RECURSIVE_SHORT:\n        return this.visitRecursion(node);\n    }\n    return null;\n  }\n\n  private onError(code: RSErrorCode, node: AstNode, params?: string[]): null {\n    this.reporter?.({ code, from: node.from, to: node.to, params });\n    if (this.annotateErrors) {\n      annotateError(node, code, params);\n    }\n    return null;\n  }\n\n  private visitChild(node: AstNode, index: number): ExpressionType | null {\n    if (index >= node.children.length) {\n      return null;\n    }\n    return this.dispatchVisit(node.children[index]);\n  }\n\n  private visitChildDeclaration(node: AstNode, index: number, domain: Typification): boolean {\n    if (index >= node.children.length) {\n      return false;\n    }\n    if (!this.dispatchDeclare(node.children[index], domain)) {\n      return false;\n    }\n    return true;\n  }\n\n  private visitAllAndReturn(node: AstNode, type: ExpressionType | null): ExpressionType | null {\n    for (const child of node.children) {\n      if (!this.dispatchVisit(child)) {\n        return null;\n      }\n    }\n    return type;\n  }\n\n  private childTypification(node: AstNode, index: number): Typification | null {\n    const result = this.visitChild(node, index);\n    if (result === null) {\n      return null;\n    }\n    if (!isTypification(result)) {\n      this.onError(RSErrorCode.expectedSetexpr, node.children[index], [labelType(result)]);\n      return null;\n    }\n    return result as Typification;\n  }\n\n  private childLogic(node: AstNode, index: number): boolean {\n    const result = this.visitChild(node, index);\n    if (result === null) {\n      return false;\n    }\n    if (result.typeID !== TypeID.logic) {\n      this.onError(RSErrorCode.expectedLogic, node.children[index], [labelType(result)]);\n      return false;\n    }\n    return true;\n  }\n\n  private childTypeDebool(\n    node: AstNode,\n    index: number,\n    errorCode: RSErrorCode,\n    operation?: string\n  ): Typification | null {\n    const result = this.childTypification(node, index);\n    if (result === null) {\n      return null;\n    }\n    if (result.typeID === TypeID.anyTypification) {\n      return result;\n    }\n    if (result.typeID !== TypeID.collection) {\n      const params =\n        errorCode === RSErrorCode.invalidTypeOperation && operation !== undefined\n          ? [operation, labelType(result)]\n          : [labelType(result)];\n      this.onError(errorCode, node.children[index], params);\n      return null;\n    }\n    return debool(result);\n  }\n\n  private childQuantifierDomain(node: AstNode, index: number, operator: string): Typification | null {\n    const result = this.visitChild(node, index);\n    if (result === null) {\n      return null;\n    }\n    if (!isTypification(result)) {\n      this.onError(RSErrorCode.invalidQuantifierDomain, node.children[index], [operator, labelType(result)]);\n      return null;\n    }\n    if (result.typeID === TypeID.anyTypification) {\n      return result;\n    }\n    if (result.typeID !== TypeID.collection) {\n      this.onError(RSErrorCode.invalidQuantifierDomain, node.children[index], [operator, labelType(result)]);\n      return null;\n    }\n    return debool(result);\n  }\n\n  private visitLocal(node: AstNode): ExpressionType | null {\n    return this.locals.getLocalType(node);\n  }\n\n  private visitGlobal(node: AstNode): ExpressionType | null {\n    const alias = getNodeText(node);\n    const type = this.context.get(alias);\n    if (!type) {\n      return this.onError(RSErrorCode.globalNotTyped, node, [alias]);\n    }\n    if (type.typeID === TypeID.function || type.typeID === TypeID.predicate) {\n      return this.onError(RSErrorCode.globalFuncWithoutArgs, node, [alias]);\n    }\n    return type;\n  }\n\n  private visitFunctionDefinition(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n    if (!this.visitChild(node, 0)) {\n      return null;\n    }\n\n    const args: Argument[] = [];\n    for (const local of this.locals.data) {\n      if (local.level === 1) {\n        args.push({ alias: local.alias, type: local.type });\n      }\n    }\n\n    const result = this.visitChild(node, 1);\n    if (result === null || result.typeID === TypeID.function || result.typeID === TypeID.predicate) {\n      return null;\n    }\n    this.locals.endScope(node.children[1]);\n    if (result.typeID === TypeID.logic) {\n      return {\n        typeID: TypeID.predicate,\n        result: result,\n        args: args\n      };\n    } else {\n      return {\n        typeID: TypeID.function,\n        result: result,\n        args: args\n      };\n    }\n  }\n\n  private visitFunctionCall(node: AstNode): ExpressionType | null {\n    const funcName = getNodeText(node.children[0]);\n    const funcType = this.context.get(funcName);\n    if (funcType?.typeID !== TypeID.function && funcType?.typeID !== TypeID.predicate) {\n      return this.onError(RSErrorCode.globalNotTyped, node.children[0], [funcName]);\n    }\n    if (this.annotateTypes) {\n      annotateType(node.children[0], funcType);\n    }\n\n    const substitutes = this.checkFuncArguments(node, funcName, funcType);\n    if (substitutes === null) {\n      return null;\n    }\n    if (funcType.result.typeID === TypeID.logic) {\n      return funcType.result;\n    } else {\n      const result = mangleRadicals(funcName, funcType.result);\n      if (substitutes.size > 0) {\n        substituteBase(result, substitutes);\n      }\n      return result;\n    }\n  }\n\n  private visitRadical(node: AstNode): ExpressionType | null {\n    const alias = getNodeText(node);\n    if (!this.isInsideFuncArgument(node)) {\n      return this.onError(RSErrorCode.radicalUsage, node, [alias]);\n    }\n    return bool({ typeID: TypeID.basic, baseID: alias });\n  }\n\n  private visitEmptySet(node: AstNode): ExpressionType | null {\n    const invalidParents: TokenID[] = [\n      TokenID.CARD,\n      TokenID.DEBOOL,\n      TokenID.SET_UNION,\n      TokenID.SET_INTERSECTION,\n      TokenID.SET_MINUS,\n      TokenID.SET_SYMMETRIC_MINUS,\n      TokenID.REDUCE,\n      TokenID.BIGPR,\n      TokenID.SMALLPR\n    ];\n    if (invalidParents.includes(node.parent?.typeID as TokenID)) {\n      return this.onError(RSErrorCode.invalidEmptySetUsage, node);\n    }\n    return EmptySetT;\n  }\n\n  private visitArgument(node: AstNode): ExpressionType | null {\n    const variable = node.children[0];\n    if (variable.typeID === TokenID.NT_TUPLE_DECL) {\n      return this.onError(RSErrorCode.invalidArgumentCortegeDeclare, variable);\n    }\n    const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, labelToken(TokenID.ITERATE));\n    if (domain === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    }\n    return domain;\n  }\n\n  private visitCard(node: AstNode): ExpressionType | null {\n    if (!this.childTypeDebool(node, 0, RSErrorCode.invalidCard)) {\n      return null;\n    }\n    return IntegerT;\n  }\n\n  private visitArithmetic(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n    if (!('isArithmetic' in type1 && type1.isArithmetic)) {\n      return this.onError(RSErrorCode.arithmeticNotSupported, node.children[0], [labelType(type1), operator]);\n    }\n\n    const type2 = this.childTypification(node, 1);\n    if (type2 === null) {\n      return null;\n    }\n    if (!('isArithmetic' in type2 && type2.isArithmetic)) {\n      return this.onError(RSErrorCode.arithmeticNotSupported, node.children[1], [labelType(type2), operator]);\n    }\n\n    const result = mergeTypifications(type1, type2);\n    if (result === null) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2), operator]);\n    }\n    return result;\n  }\n\n  private visitIntegerPredicate(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n    if (!('isOrdered' in type1 && type1.isOrdered)) {\n      return this.onError(RSErrorCode.orderingNotSupported, node.children[0], [labelType(type1), operator]);\n    }\n\n    const type2 = this.childTypification(node, 1);\n    if (type2 === null) {\n      return null;\n    }\n    if (!('isOrdered' in type2 && type2.isOrdered)) {\n      return this.onError(RSErrorCode.orderingNotSupported, node.children[1], [labelType(type2), operator]);\n    }\n\n    if (!checkCompatibility(type1, type2)) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2), operator]);\n    }\n    return LogicT;\n  }\n\n  private visitQuantifier(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const operator = labelRSLangNode(node);\n    const domain = this.childQuantifierDomain(node, 1, operator);\n    if (domain === null) {\n      return null;\n    } else if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    } else if (!this.childLogic(node, 2)) {\n      return null;\n    }\n\n    this.locals.endScope(node.children[2]);\n    return LogicT;\n  }\n\n  private visitNegation(node: AstNode): ExpressionType | null {\n    if (!this.childLogic(node, 0)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitLogicBinary(node: AstNode): ExpressionType | null {\n    if (!this.childLogic(node, 0) || !this.childLogic(node, 1)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitEquals(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n\n    const type2 = this.childTypification(node, 1);\n    if (type2 === null) {\n      return null;\n    }\n    if (!checkCompatibility(type1, type2)) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2), operator]);\n    }\n    return LogicT;\n  }\n\n  private visitSetexprPredicate(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    let type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, operator);\n    if (type2 === null) {\n      return null;\n    }\n    const isSubset = this.isSubset(node.typeID as TokenID);\n    if (isSubset) {\n      type2 = bool(type2);\n    }\n    const type1 = this.childTypification(node, 0);\n    if (type1 === null) {\n      return null;\n    }\n\n    if (!checkCompatibility(type1, type2)) {\n      if (isSubset) {\n        return this.onError(RSErrorCode.typesNotEqual, node, [labelType(type1), labelType(type2), operator]);\n      } else {\n        return this.onError(RSErrorCode.invalidElementPredicate, node, [\n          labelType(type1),\n          operator,\n          labelType(bool(type2))\n        ]);\n      }\n    }\n    return LogicT;\n  }\n\n  private visitDecart(node: AstNode): ExpressionType | null {\n    const factors: Typification[] = [];\n    for (let child = 0; child < node.children.length; child++) {\n      const type = this.childTypeDebool(node, child, RSErrorCode.invalidDecart);\n      if (type === null) {\n        return null;\n      } else {\n        factors.push(type);\n      }\n    }\n    return bool(tuple(factors));\n  }\n\n  private visitBoolean(node: AstNode): ExpressionType | null {\n    const type = this.childTypeDebool(node, 0, RSErrorCode.invalidBoolean);\n    if (type === null) {\n      return null;\n    }\n    return bool(bool(type));\n  }\n\n  private visitTuple(node: AstNode): ExpressionType | null {\n    const components: Typification[] = [];\n    for (let child = 0; child < node.children.length; child++) {\n      const type = this.childTypification(node, child);\n      if (type === null) {\n        return null;\n      }\n      components.push(type);\n    }\n    return tuple(components);\n  }\n\n  private visitEnumeration(node: AstNode): ExpressionType | null {\n    let type: ExpressionType | null = this.childTypification(node, 0);\n    if (type === null) {\n      return null;\n    }\n    for (let child = 1; child < node.children.length; child++) {\n      const childType = this.childTypification(node, child);\n      if (childType === null) {\n        return null;\n      }\n\n      const merge = mergeTypifications(type, childType);\n      if (merge === null) {\n        return this.onError(RSErrorCode.invalidEnumeration, node.children[child], [\n          labelType(type),\n          labelType(childType)\n        ]);\n      }\n      type = merge;\n    }\n    return bool(type);\n  }\n\n  private visitBool(node: AstNode): ExpressionType | null {\n    return this.visitEnumeration(node);\n  }\n\n  private visitDebool(node: AstNode): ExpressionType | null {\n    return this.childTypeDebool(node, 0, RSErrorCode.invalidDebool);\n  }\n\n  private visitSetexprBinary(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const type1 = this.childTypeDebool(node, 0, RSErrorCode.invalidTypeOperation, operator);\n    if (type1 === null) {\n      return null;\n    }\n\n    const type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, operator);\n    if (type2 === null) {\n      return null;\n    }\n\n    const result = mergeTypifications(type1, type2);\n    if (result === null) {\n      return this.onError(RSErrorCode.typesNotEqual, node, [labelType(bool(type1)), labelType(bool(type2)), operator]);\n    }\n    return bool(result);\n  }\n\n  private visitProjectSet(node: AstNode): ExpressionType | null {\n    const argument = this.childTypeDebool(node, 0, RSErrorCode.invalidProjectionSet);\n    if (argument === null) {\n      return null;\n    }\n    if (argument.typeID === TypeID.anyTypification) {\n      return EmptySetT;\n    }\n    if (argument.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.invalidProjectionSet, node.children[0], [\n        labelRSLangNode(node),\n        labelType(bool(argument))\n      ]);\n    }\n\n    const indices = getNodeIndices(node);\n    const components: Typification[] = [];\n    for (const index of indices) {\n      const newComponent = component(argument, index);\n      if (newComponent === null) {\n        return this.onError(RSErrorCode.invalidProjectionSet, node.children[0], [\n          labelRSLangNode(node),\n          labelType(bool(argument))\n        ]);\n      } else {\n        components.push(newComponent);\n      }\n    }\n    if (components.length === 1) {\n      return bool(components[0]);\n    } else {\n      return bool(tuple(components));\n    }\n  }\n\n  private visitProjectTuple(node: AstNode): ExpressionType | null {\n    const argument = this.childTypification(node, 0);\n    if (argument === null) {\n      return null;\n    }\n    if (argument.typeID === TypeID.anyTypification) {\n      return argument;\n    }\n    if (argument.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.invalidProjectionTuple, node.children[0], [\n        labelRSLangNode(node),\n        labelType(argument)\n      ]);\n    }\n\n    const indices = getNodeIndices(node);\n    const components: Typification[] = [];\n    for (const index of indices) {\n      const newComponent = component(argument, index);\n      if (newComponent === null) {\n        return this.onError(RSErrorCode.invalidProjectionTuple, node.children[0], [\n          labelRSLangNode(node),\n          labelType(argument)\n        ]);\n      } else {\n        components.push(newComponent);\n      }\n    }\n    if (components.length === 1) {\n      return components[0];\n    } else {\n      return tuple(components);\n    }\n  }\n\n  private visitFilter(node: AstNode): ExpressionType | null {\n    const operator = labelRSLangNode(node);\n    const indices = getNodeIndices(node);\n    const tupleParam = indices.length === node.children.length - 1;\n    if (!tupleParam && node.children.length > 2) {\n      const extraParam = node.children[indices.length];\n      return this.onError(RSErrorCode.invalidFilterArity, extraParam ?? node, [\n        String(indices.length),\n        String(node.children.length - 1),\n        operator\n      ]);\n    }\n\n    const argument = this.childTypification(node, node.children.length - 1);\n    if (argument === null) {\n      return null;\n    }\n    if (\n      argument.typeID === TypeID.anyTypification ||\n      (argument.typeID === TypeID.collection && argument.base.typeID === TypeID.anyTypification)\n    ) {\n      return EmptySetT;\n    }\n    const expectedArgument = this.expectedFilterArgumentLabel(indices);\n    if (argument.typeID !== TypeID.collection || argument.base.typeID !== TypeID.tuple) {\n      return this.onError(RSErrorCode.invalidFilterArgumentType, node.children[node.children.length - 1], [\n        operator,\n        labelType(argument),\n        expectedArgument\n      ]);\n    }\n\n    const argBase = debool(argument) as EchelonTuple;\n    const bases: Typification[] = [];\n    for (const index of indices) {\n      const newBase = component(argBase, index);\n      if (newBase === null) {\n        return this.onError(RSErrorCode.invalidFilterIndex, node.children[node.children.length - 1], [\n          operator,\n          labelType(argument),\n          String(index),\n          String(argBase.factors.length)\n        ]);\n      }\n      bases.push(newBase);\n    }\n\n    if (tupleParam) {\n      for (let child = 0; child + 1 < node.children.length; child++) {\n        const param = this.childTypification(node, child);\n        if (param === null) {\n          return null;\n        }\n        const expectedParam = bool(bases[child]);\n        if (param.typeID !== TypeID.collection || !checkCompatibility(bases[child], debool(param))) {\n          return this.reportFilterParameterError(node, child, param, expectedParam, operator);\n        }\n      }\n    } else {\n      const param = this.childTypification(node, 0);\n      if (param === null) {\n        return null;\n      }\n      const paramType = param;\n      const expected = bool(tuple(bases));\n      if (paramType.typeID !== TypeID.collection || !checkCompatibility(expected, paramType)) {\n        return this.reportFilterParameterError(node, 0, paramType, expected, operator);\n      }\n    }\n    return argument;\n  }\n\n  private expectedFilterArgumentLabel(indices: number[]): string {\n    const maxIndex = Math.max(...indices, 0);\n    if (maxIndex <= 1) {\n      return labelType(bool({ typeID: TypeID.anyTypification }));\n    }\n    const factors: Typification[] = [];\n    for (let index = 1; index <= maxIndex; index++) {\n      factors.push({ typeID: TypeID.anyTypification });\n    }\n    return labelType(bool(tuple(factors)));\n  }\n\n  private reportFilterParameterError(\n    node: AstNode,\n    childIndex: number,\n    param: Typification,\n    expected: Typification,\n    operator: string\n  ): null {\n    const wrapped = bool(param);\n    if (checkEquality(wrapped, expected) || checkCompatibility(wrapped, expected)) {\n      return this.onError(RSErrorCode.invalidFilterBooleanEchelon, node.children[childIndex], [\n        operator,\n        labelType(param),\n        labelType(expected)\n      ]);\n    }\n    return this.onError(RSErrorCode.invalidFilterParameterType, node.children[childIndex], [\n      labelType(param),\n      labelType(expected),\n      operator\n    ]);\n  }\n\n  private visitReduce(node: AstNode): ExpressionType | null {\n    const argument = this.childTypification(node, 0);\n    if (argument === null) {\n      return null;\n    }\n    if (\n      argument.typeID === TypeID.anyTypification ||\n      (argument.typeID === TypeID.collection && argument.base.typeID === TypeID.anyTypification)\n    ) {\n      return EmptySetT;\n    }\n    if (argument.typeID !== TypeID.collection || argument.base.typeID !== TypeID.collection) {\n      return this.onError(RSErrorCode.invalidReduce, node.children[0], [labelType(argument)]);\n    }\n    return debool(argument);\n  }\n\n  private visitArgumentsEnum(node: AstNode): ExpressionType | null {\n    return this.visitAllAndReturn(node, LogicT);\n  }\n\n  private visitDeclarative(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const domain = this.childTypeDebool(\n      node,\n      1,\n      RSErrorCode.invalidTypeOperation,\n      labelToken(TokenID.NT_DECLARATIVE_EXPR)\n    );\n    if (domain === null) {\n      return null;\n    } else if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    } else if (!this.childLogic(node, 2)) {\n      return null;\n    }\n\n    this.locals.endScope(node.children[2]);\n    return bool(domain);\n  }\n\n  private visitImperative(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    for (let child = 1; child < node.children.length; child++) {\n      if (!this.childLogic(node, child)) {\n        return null;\n      }\n    }\n\n    const type = this.childTypification(node, 0);\n    if (type === null) {\n      return null;\n    }\n\n    this.locals.endScope(node);\n    return bool(type);\n  }\n\n  private visitIterate(node: AstNode): ExpressionType | null {\n    const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation, labelToken(TokenID.ITERATE));\n    if (domain === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitAssign(node: AstNode): ExpressionType | null {\n    const domain = this.childTypification(node, 1);\n    if (domain === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, domain)) {\n      return null;\n    }\n    return LogicT;\n  }\n\n  private visitRecursion(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const initType = this.childTypification(node, 1);\n    if (initType === null) {\n      return null;\n    }\n    if (!this.visitChildDeclaration(node, 0, initType)) {\n      return null;\n    }\n\n    const isFull = node.typeID === TokenID.NT_RECURSIVE_FULL;\n    const iterationIndex = isFull ? 3 : 2;\n\n    let iterationValue = this.childTypification(node, iterationIndex);\n    if (iterationValue === null) {\n      return null;\n    }\n    if (!checkCompatibility(iterationValue, initType)) {\n      return this.onError(RSErrorCode.typesNotEqual, node.children[iterationIndex], [\n        labelType(iterationValue),\n        labelType(initType),\n        labelToken(node.typeID as TokenID)\n      ]);\n    }\n\n    if (hasGenerics(initType)) {\n      for (let retries = TypeAuditor.TYPE_DEDUCTION_DEPTH; retries > 0; retries--) {\n        this.locals.endScope(node);\n        this.locals.clearUnused();\n        this.locals.startScope();\n        if (!this.visitChildDeclaration(node, 0, iterationValue)) {\n          return null;\n        }\n        const newIteration = this.childTypification(node, iterationIndex);\n        if (newIteration === null) {\n          return null;\n        }\n        if (checkEquality(newIteration, iterationValue)) {\n          break;\n        }\n        iterationValue = newIteration;\n      }\n    }\n\n    if (isFull) {\n      if (!this.childLogic(node, 2)) {\n        return null;\n      }\n    }\n\n    this.locals.endScope(node);\n    return iterationValue;\n  }\n\n  private isSubset(token: TokenID): boolean {\n    return token === TokenID.SUBSET || token === TokenID.SUBSET_OR_EQ || token === TokenID.NOT_SUBSET;\n  }\n\n  private isInsideFuncArgument(node: AstNode): boolean {\n    while (node.parent && node.parent !== node) {\n      if (node.typeID === TokenID.NT_ARGUMENTS) return true;\n      node = node.parent;\n    }\n    return false;\n  }\n\n  private checkFuncArguments(node: AstNode, alias: string, type: Parametrized): Map<string, Typification> | null {\n    if (node.children.length - 1 !== type.args.length) {\n      return this.onError(RSErrorCode.invalidArgsArity, node.children[1], [\n        String(type.args.length),\n        String(node.children.length - 1)\n      ]);\n    }\n\n    const substitutes = new Map<string, Typification>();\n    for (let child = 1; child < node.children.length; child++) {\n      const childType = this.childTypification(node, child);\n      if (childType === null) {\n        return null;\n      }\n      const argType = mangleRadicals(alias, type.args[child - 1].type);\n      if (!compareTemplated(substitutes, argType, childType)) {\n        this.onError(RSErrorCode.invalidArgumentType, node.children[child], [\n          `${type.args[child - 1].alias}∈${labelType(argType)}`,\n          labelType(childType)\n        ]);\n        return null;\n      }\n    }\n    return substitutes;\n  }\n}\n\n// ========= Internals ========\nfunction mangleRadicals(funcName: string, type: Typification): Typification {\n  switch (type.typeID) {\n    default:\n      throw new Error(`Unexpected type for ${funcName}: ${JSON.stringify(type)}`);\n    case TypeID.anyTypification:\n    case TypeID.integer:\n      return type;\n    case TypeID.basic: {\n      if (isRadical(type.baseID)) {\n        return {\n          typeID: type.typeID,\n          baseID: type.baseID + funcName\n        };\n      }\n      return type;\n    }\n    case TypeID.collection: {\n      return {\n        typeID: type.typeID,\n        base: mangleRadicals(funcName, debool(type))\n      };\n    }\n    case TypeID.tuple: {\n      const factors: Typification[] = [];\n      for (let index = 1; index <= type.factors.length; ++index) {\n        factors.push(mangleRadicals(funcName, component(type, index)!));\n      }\n      return {\n        typeID: type.typeID,\n        factors: factors\n      };\n    }\n  }\n}\n\n/** Local variable data. */\ninterface LocalData {\n  alias: string;\n  level: number;\n  useCount: number;\n  type: Typification;\n}\n\n/** Local variables context. */\nclass LocalContext {\n  private onError: (code: RSErrorCode, node: AstNode, params: string[]) => null;\n\n  public data: LocalData[] = [];\n\n  constructor(onError: (code: RSErrorCode, node: AstNode, params: string[]) => null) {\n    this.onError = onError;\n  }\n\n  startScope(): void {\n    for (const local of this.data) {\n      if (local.level > 0) {\n        local.level = local.level + 1;\n      }\n    }\n  }\n\n  endScope(node: AstNode, skipUnused: boolean = false): void {\n    for (const local of this.data) {\n      local.level--;\n      if (!skipUnused && local.level === 0 && local.useCount === 0) {\n        this.onError(RSErrorCode.localNotUsed, node, [local.alias]);\n      }\n    }\n  }\n\n  clearUnused(): void {\n    this.data = this.data.filter(data => data.level > 0);\n  }\n\n  pushLocal(node: AstNode, type: Typification): boolean {\n    const alias = getNodeText(node);\n    const existing = this.data.find(data => data.alias === alias);\n    if (existing) {\n      if (existing.level > 0) {\n        this.onError(RSErrorCode.localShadowing, node, [alias]);\n        return false;\n      } else {\n        this.onError(RSErrorCode.localDoubleDeclare, node, [alias]);\n        const index = this.data.indexOf(existing);\n        if (index !== -1) {\n          this.data.splice(index, 1);\n        }\n      }\n    }\n    this.data.push({ alias, type, level: 1, useCount: 0 });\n    return true;\n  }\n\n  getLocalType(node: AstNode): Typification | null {\n    const alias = getNodeText(node);\n    const local = this.data.find(data => data.alias === alias);\n    if (local === undefined) {\n      this.onError(RSErrorCode.localUndeclared, node, [alias]);\n      return null;\n    } else if (local.level < 1) {\n      this.onError(RSErrorCode.localOutOfScope, node, [alias]);\n      return null;\n    } else {\n      local.useCount++;\n      return local.type;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AAsCA,IAAa,cAAb,MAAa,YAAY;CACvB,OAAwB,uBAAuB;CAE/C;CACA;CACA;CACA;CACA;CAEA,YAAY,SAAsB;EAChC,KAAK,gBAAgB;EACrB,KAAK,iBAAiB;EACtB,KAAK,UAAU;EACf,KAAK,SAAS,IAAI,aAAa,KAAK,QAAQ,KAAK,IAAI,CAAC;CACxD;CAEA,IACE,KACA,eACA,UACA,iBAA0B,OACH;EACvB,IAAI,IAAI,UACN,OAAO;EAET,KAAK,gBAAgB;EACrB,KAAK,iBAAiB;EACtB,KAAK,WAAW;EAChB,KAAK,MAAM;EACX,OAAO,KAAK,cAAc,GAAG;CAC/B;CAEA,QAAsB;EACpB,KAAK,SAAS,IAAI,aAAa,KAAK,QAAQ,KAAK,IAAI,CAAC;CACxD;CAEA,gBAAwB,MAAe,QAA+B;EACpE,MAAM,SAAS,KAAK,eAAe,MAAM,MAAM;EAC/C,IAAI,WAAW,QAAQ,KAAK,eAC1B,aAAa,MAAM,MAAM;EAE3B,OAAO;CACT;CAEA,eAAuB,MAAe,QAA+B;EACnE,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,UACX,OAAO,KAAK,aAAa,MAAM,MAAM;GACvC,KAAK,QAAQ,eACX,OAAO,KAAK,aAAa,MAAM,MAAM;GACvC,KAAK,QAAQ,cACX,OAAO,KAAK,mBAAmB,MAAM,MAAM;EAC/C;EACA,OAAO;CACT;CAEA,aAAqB,MAAe,QAA+B;EACjE,OAAO,KAAK,OAAO,UAAU,MAAM,MAAM;CAC3C;CAEA,aAAqB,MAAe,QAA+B;EACjE,IAAI,OAAO,WAAW,OAAO,SAAS,OAAO,QAAQ,WAAW,KAAK,SAAS,QAAQ;GACpF,KAAK,QAAQ,YAAY,uBAAuB,KAAK,SAAS,EAAE;GAChE,OAAO;EACT;EACA,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,IAAI,CAAC,KAAK,sBAAsB,MAAM,OAAO,UAAU,QAAQ,QAAQ,CAAC,CAAE,GACxE,OAAO;EAGX,OAAO;CACT;CAEA,mBAA2B,MAAe,QAA+B;EACvE,KAAK,MAAM,SAAS,KAAK,UACvB,IAAI,CAAC,KAAK,gBAAgB,OAAO,MAAM,GACrC,OAAO;EAGX,OAAO;CACT;CAEA,cAAsB,MAAsC;EAC1D,MAAM,SAAS,KAAK,aAAa,IAAI;EACrC,IAAI,WAAW,QAAQ,KAAK,eAC1B,aAAa,MAAM,MAAM;EAE3B,OAAO;CACT;CAEA,aAAqB,MAAsC;EACzD,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,cACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,UACX,OAAO,KAAK,WAAW,IAAI;GAC7B,KAAK,QAAQ,YACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,aACX,OAAO;GACT,KAAK,QAAQ,mBACX,OAAO,KAAK,QAAQ;GACtB,KAAK,QAAQ,cACX,OAAO,KAAK,cAAc,IAAI;GAEhC,KAAK,QAAQ,cACX,OAAO,KAAK,mBAAmB,IAAI;GACrC,KAAK,QAAQ,aACX,OAAO,KAAK,cAAc,IAAI;GAEhC,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,UACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ;GACb,KAAK,QAAQ,gBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,WACX,OAAO,KAAK,cAAc,IAAI;GAEhC,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,kBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ;GACb,KAAK,QAAQ,UACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,cACX,OAAO,KAAK,sBAAsB,IAAI;GAExC,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,YACX,OAAO,KAAK,sBAAsB,IAAI;GAExC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAC9B,KAAK,QAAQ,SACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,UACX,OAAO,KAAK,WAAW,IAAI;GAC7B,KAAK,QAAQ,gBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ,OACX,OAAO,KAAK,gBAAgB,IAAI;GAClC,KAAK,QAAQ,SACX,OAAO,KAAK,kBAAkB,IAAI;GACpC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAC5B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAC9B,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAC5B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,qBACX,OAAO,KAAK,mBAAmB,IAAI;GAErC,KAAK,QAAQ,oBACX,OAAO,KAAK,wBAAwB,IAAI;GAE1C,KAAK,QAAQ,cACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ,SACX,OAAO,KAAK,aAAa,IAAI;GAC/B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,qBACX,OAAO,KAAK,iBAAiB,IAAI;GACnC,KAAK,QAAQ,oBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ;GACb,KAAK,QAAQ,oBACX,OAAO,KAAK,eAAe,IAAI;EACnC;EACA,OAAO;CACT;CAEA,QAAgB,MAAmB,MAAe,QAAyB;EACzE,KAAK,WAAW;GAAE;GAAM,MAAM,KAAK;GAAM,IAAI,KAAK;GAAI;EAAO,CAAC;EAC9D,IAAI,KAAK,gBACP,cAAc,MAAM,MAAM,MAAM;EAElC,OAAO;CACT;CAEA,WAAmB,MAAe,OAAsC;EACtE,IAAI,SAAS,KAAK,SAAS,QACzB,OAAO;EAET,OAAO,KAAK,cAAc,KAAK,SAAS,MAAM;CAChD;CAEA,sBAA8B,MAAe,OAAe,QAA+B;EACzF,IAAI,SAAS,KAAK,SAAS,QACzB,OAAO;EAET,IAAI,CAAC,KAAK,gBAAgB,KAAK,SAAS,QAAQ,MAAM,GACpD,OAAO;EAET,OAAO;CACT;CAEA,kBAA0B,MAAe,MAAoD;EAC3F,KAAK,MAAM,SAAS,KAAK,UACvB,IAAI,CAAC,KAAK,cAAc,KAAK,GAC3B,OAAO;EAGX,OAAO;CACT;CAEA,kBAA0B,MAAe,OAAoC;EAC3E,MAAM,SAAS,KAAK,WAAW,MAAM,KAAK;EAC1C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,eAAe,MAAM,GAAG;GAC3B,KAAK,QAAQ,YAAY,iBAAiB,KAAK,SAAS,QAAQ,CAAC,UAAU,MAAM,CAAC,CAAC;GACnF,OAAO;EACT;EACA,OAAO;CACT;CAEA,WAAmB,MAAe,OAAwB;EACxD,MAAM,SAAS,KAAK,WAAW,MAAM,KAAK;EAC1C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,OAAO;GAClC,KAAK,QAAQ,YAAY,eAAe,KAAK,SAAS,QAAQ,CAAC,UAAU,MAAM,CAAC,CAAC;GACjF,OAAO;EACT;EACA,OAAO;CACT;CAEA,gBACE,MACA,OACA,WACA,WACqB;EACrB,MAAM,SAAS,KAAK,kBAAkB,MAAM,KAAK;EACjD,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,iBAC3B,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,YAAY;GACvC,MAAM,SACJ,cAAc,YAAY,wBAAwB,cAAc,SAC5D,CAAC,WAAW,UAAU,MAAM,CAAC,IAC7B,CAAC,UAAU,MAAM,CAAC;GACxB,KAAK,QAAQ,WAAW,KAAK,SAAS,QAAQ,MAAM;GACpD,OAAO;EACT;EACA,OAAO,OAAO,MAAM;CACtB;CAEA,sBAA8B,MAAe,OAAe,UAAuC;EACjG,MAAM,SAAS,KAAK,WAAW,MAAM,KAAK;EAC1C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,eAAe,MAAM,GAAG;GAC3B,KAAK,QAAQ,YAAY,yBAAyB,KAAK,SAAS,QAAQ,CAAC,UAAU,UAAU,MAAM,CAAC,CAAC;GACrG,OAAO;EACT;EACA,IAAI,OAAO,WAAW,OAAO,iBAC3B,OAAO;EAET,IAAI,OAAO,WAAW,OAAO,YAAY;GACvC,KAAK,QAAQ,YAAY,yBAAyB,KAAK,SAAS,QAAQ,CAAC,UAAU,UAAU,MAAM,CAAC,CAAC;GACrG,OAAO;EACT;EACA,OAAO,OAAO,MAAM;CACtB;CAEA,WAAmB,MAAsC;EACvD,OAAO,KAAK,OAAO,aAAa,IAAI;CACtC;CAEA,YAAoB,MAAsC;EACxD,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,OAAO,KAAK,QAAQ,IAAI,KAAK;EACnC,IAAI,CAAC,MACH,OAAO,KAAK,QAAQ,YAAY,gBAAgB,MAAM,CAAC,KAAK,CAAC;EAE/D,IAAI,KAAK,WAAW,OAAO,YAAY,KAAK,WAAW,OAAO,WAC5D,OAAO,KAAK,QAAQ,YAAY,uBAAuB,MAAM,CAAC,KAAK,CAAC;EAEtE,OAAO;CACT;CAEA,wBAAgC,MAAsC;EACpE,KAAK,OAAO,WAAW;EACvB,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAGT,MAAM,OAAmB,CAAC;EAC1B,KAAK,MAAM,SAAS,KAAK,OAAO,MAC9B,IAAI,MAAM,UAAU,GAClB,KAAK,KAAK;GAAE,OAAO,MAAM;GAAO,MAAM,MAAM;EAAK,CAAC;EAItD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,QAAQ,OAAO,WAAW,OAAO,YAAY,OAAO,WAAW,OAAO,WACnF,OAAO;EAET,KAAK,OAAO,SAAS,KAAK,SAAS,EAAE;EACrC,IAAI,OAAO,WAAW,OAAO,OAC3B,OAAO;GACL,QAAQ,OAAO;GACP;GACF;EACR;OAEA,OAAO;GACL,QAAQ,OAAO;GACP;GACF;EACR;CAEJ;CAEA,kBAA0B,MAAsC;EAC9D,MAAM,WAAW,YAAY,KAAK,SAAS,EAAE;EAC7C,MAAM,WAAW,KAAK,QAAQ,IAAI,QAAQ;EAC1C,IAAI,UAAU,WAAW,OAAO,YAAY,UAAU,WAAW,OAAO,WACtE,OAAO,KAAK,QAAQ,YAAY,gBAAgB,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC;EAE9E,IAAI,KAAK,eACP,aAAa,KAAK,SAAS,IAAI,QAAQ;EAGzC,MAAM,cAAc,KAAK,mBAAmB,MAAM,UAAU,QAAQ;EACpE,IAAI,gBAAgB,MAClB,OAAO;EAET,IAAI,SAAS,OAAO,WAAW,OAAO,OACpC,OAAO,SAAS;OACX;GACL,MAAM,SAAS,eAAe,UAAU,SAAS,MAAM;GACvD,IAAI,YAAY,OAAO,GACrB,eAAe,QAAQ,WAAW;GAEpC,OAAO;EACT;CACF;CAEA,aAAqB,MAAsC;EACzD,MAAM,QAAQ,YAAY,IAAI;EAC9B,IAAI,CAAC,KAAK,qBAAqB,IAAI,GACjC,OAAO,KAAK,QAAQ,YAAY,cAAc,MAAM,CAAC,KAAK,CAAC;EAE7D,OAAO,KAAK;GAAE,QAAQ,OAAO;GAAO,QAAQ;EAAM,CAAC;CACrD;CAEA,cAAsB,MAAsC;EAY1D,IAAI;GAVF,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;GACR,QAAQ;EAEN,CAAA,CAAe,SAAS,KAAK,QAAQ,MAAiB,GACxD,OAAO,KAAK,QAAQ,YAAY,sBAAsB,IAAI;EAE5D,OAAO;CACT;CAEA,cAAsB,MAAsC;EAC1D,MAAM,WAAW,KAAK,SAAS;EAC/B,IAAI,SAAS,WAAW,QAAQ,eAC9B,OAAO,KAAK,QAAQ,YAAY,+BAA+B,QAAQ;EAEzE,MAAM,SAAS,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,WAAW,QAAQ,OAAO,CAAC;EAC1G,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GAC7C,OAAO;EAET,OAAO;CACT;CAEA,UAAkB,MAAsC;EACtD,IAAI,CAAC,KAAK,gBAAgB,MAAM,GAAG,YAAY,WAAW,GACxD,OAAO;EAET,OAAO;CACT;CAEA,gBAAwB,MAAsC;EAC5D,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,kBAAkB,SAAS,MAAM,eACrC,OAAO,KAAK,QAAQ,YAAY,wBAAwB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGxG,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,kBAAkB,SAAS,MAAM,eACrC,OAAO,KAAK,QAAQ,YAAY,wBAAwB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGxG,MAAM,SAAS,mBAAmB,OAAO,KAAK;EAC9C,IAAI,WAAW,MACb,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;EAE1G,OAAO;CACT;CAEA,sBAA8B,MAAsC;EAClE,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,eAAe,SAAS,MAAM,YAClC,OAAO,KAAK,QAAQ,YAAY,sBAAsB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGtG,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,EAAE,eAAe,SAAS,MAAM,YAClC,OAAO,KAAK,QAAQ,YAAY,sBAAsB,KAAK,SAAS,IAAI,CAAC,UAAU,KAAK,GAAG,QAAQ,CAAC;EAGtG,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAClC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;EAE1G,OAAO;CACT;CAEA,gBAAwB,MAAsC;EAC5D,KAAK,OAAO,WAAW;EAEvB,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,SAAS,KAAK,sBAAsB,MAAM,GAAG,QAAQ;EAC3D,IAAI,WAAW,MACb,OAAO;OACF,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GACpD,OAAO;OACF,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GACjC,OAAO;EAGT,KAAK,OAAO,SAAS,KAAK,SAAS,EAAE;EACrC,OAAO;CACT;CAEA,cAAsB,MAAsC;EAC1D,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EAET,OAAO;CACT;CAEA,iBAAyB,MAAsC;EAC7D,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,KAAK,CAAC,KAAK,WAAW,MAAM,CAAC,GACvD,OAAO;EAET,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAET,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAClC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;EAE1G,OAAO;CACT;CAEA,sBAA8B,MAAsC;EAClE,MAAM,WAAW,gBAAgB,IAAI;EACrC,IAAI,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,QAAQ;EACpF,IAAI,UAAU,MACZ,OAAO;EAET,MAAM,WAAW,KAAK,SAAS,KAAK,MAAiB;EACrD,IAAI,UACF,QAAQ,KAAK,KAAK;EAEpB,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;EAC5C,IAAI,UAAU,MACZ,OAAO;EAGT,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAClC,IAAI,UACF,OAAO,KAAK,QAAQ,YAAY,eAAe,MAAM;GAAC,UAAU,KAAK;GAAG,UAAU,KAAK;GAAG;EAAQ,CAAC;OAEnG,OAAO,KAAK,QAAQ,YAAY,yBAAyB,MAAM;GAC7D,UAAU,KAAK;GACf;GACA,UAAU,KAAK,KAAK,CAAC;EACvB,CAAC;EAGL,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,MAAM,UAA0B,CAAC;EACjC,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,OAAO,KAAK,gBAAgB,MAAM,OAAO,YAAY,aAAa;GACxE,IAAI,SAAS,MACX,OAAO;QAEP,QAAQ,KAAK,IAAI;EAErB;EACA,OAAO,KAAK,MAAM,OAAO,CAAC;CAC5B;CAEA,aAAqB,MAAsC;EACzD,MAAM,OAAO,KAAK,gBAAgB,MAAM,GAAG,YAAY,cAAc;EACrE,IAAI,SAAS,MACX,OAAO;EAET,OAAO,KAAK,KAAK,IAAI,CAAC;CACxB;CAEA,WAAmB,MAAsC;EACvD,MAAM,aAA6B,CAAC;EACpC,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,OAAO,KAAK,kBAAkB,MAAM,KAAK;GAC/C,IAAI,SAAS,MACX,OAAO;GAET,WAAW,KAAK,IAAI;EACtB;EACA,OAAO,MAAM,UAAU;CACzB;CAEA,iBAAyB,MAAsC;EAC7D,IAAI,OAA8B,KAAK,kBAAkB,MAAM,CAAC;EAChE,IAAI,SAAS,MACX,OAAO;EAET,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,YAAY,KAAK,kBAAkB,MAAM,KAAK;GACpD,IAAI,cAAc,MAChB,OAAO;GAGT,MAAM,QAAQ,mBAAmB,MAAM,SAAS;GAChD,IAAI,UAAU,MACZ,OAAO,KAAK,QAAQ,YAAY,oBAAoB,KAAK,SAAS,QAAQ,CACxE,UAAU,IAAI,GACd,UAAU,SAAS,CACrB,CAAC;GAEH,OAAO;EACT;EACA,OAAO,KAAK,IAAI;CAClB;CAEA,UAAkB,MAAsC;EACtD,OAAO,KAAK,iBAAiB,IAAI;CACnC;CAEA,YAAoB,MAAsC;EACxD,OAAO,KAAK,gBAAgB,MAAM,GAAG,YAAY,aAAa;CAChE;CAEA,mBAA2B,MAAsC;EAC/D,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,QAAQ;EACtF,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,QAAQ;EACtF,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,SAAS,mBAAmB,OAAO,KAAK;EAC9C,IAAI,WAAW,MACb,OAAO,KAAK,QAAQ,YAAY,eAAe,MAAM;GAAC,UAAU,KAAK,KAAK,CAAC;GAAG,UAAU,KAAK,KAAK,CAAC;GAAG;EAAQ,CAAC;EAEjH,OAAO,KAAK,MAAM;CACpB;CAEA,gBAAwB,MAAsC;EAC5D,MAAM,WAAW,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC/E,IAAI,aAAa,MACf,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,iBAC7B,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,OAC7B,OAAO,KAAK,QAAQ,YAAY,sBAAsB,KAAK,SAAS,IAAI,CACtE,gBAAgB,IAAI,GACpB,UAAU,KAAK,QAAQ,CAAC,CAC1B,CAAC;EAGH,MAAM,UAAU,eAAe,IAAI;EACnC,MAAM,aAA6B,CAAC;EACpC,KAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,eAAe,UAAU,UAAU,KAAK;GAC9C,IAAI,iBAAiB,MACnB,OAAO,KAAK,QAAQ,YAAY,sBAAsB,KAAK,SAAS,IAAI,CACtE,gBAAgB,IAAI,GACpB,UAAU,KAAK,QAAQ,CAAC,CAC1B,CAAC;QAED,WAAW,KAAK,YAAY;EAEhC;EACA,IAAI,WAAW,WAAW,GACxB,OAAO,KAAK,WAAW,EAAE;OAEzB,OAAO,KAAK,MAAM,UAAU,CAAC;CAEjC;CAEA,kBAA0B,MAAsC;EAC9D,MAAM,WAAW,KAAK,kBAAkB,MAAM,CAAC;EAC/C,IAAI,aAAa,MACf,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,iBAC7B,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,OAC7B,OAAO,KAAK,QAAQ,YAAY,wBAAwB,KAAK,SAAS,IAAI,CACxE,gBAAgB,IAAI,GACpB,UAAU,QAAQ,CACpB,CAAC;EAGH,MAAM,UAAU,eAAe,IAAI;EACnC,MAAM,aAA6B,CAAC;EACpC,KAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,eAAe,UAAU,UAAU,KAAK;GAC9C,IAAI,iBAAiB,MACnB,OAAO,KAAK,QAAQ,YAAY,wBAAwB,KAAK,SAAS,IAAI,CACxE,gBAAgB,IAAI,GACpB,UAAU,QAAQ,CACpB,CAAC;QAED,WAAW,KAAK,YAAY;EAEhC;EACA,IAAI,WAAW,WAAW,GACxB,OAAO,WAAW;OAElB,OAAO,MAAM,UAAU;CAE3B;CAEA,YAAoB,MAAsC;EACxD,MAAM,WAAW,gBAAgB,IAAI;EACrC,MAAM,UAAU,eAAe,IAAI;EACnC,MAAM,aAAa,QAAQ,WAAW,KAAK,SAAS,SAAS;EAC7D,IAAI,CAAC,cAAc,KAAK,SAAS,SAAS,GAAG;GAC3C,MAAM,aAAa,KAAK,SAAS,QAAQ;GACzC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,cAAc,MAAM;IACtE,OAAO,QAAQ,MAAM;IACrB,OAAO,KAAK,SAAS,SAAS,CAAC;IAC/B;GACF,CAAC;EACH;EAEA,MAAM,WAAW,KAAK,kBAAkB,MAAM,KAAK,SAAS,SAAS,CAAC;EACtE,IAAI,aAAa,MACf,OAAO;EAET,IACE,SAAS,WAAW,OAAO,mBAC1B,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,iBAE1E,OAAO;EAET,MAAM,mBAAmB,KAAK,4BAA4B,OAAO;EACjE,IAAI,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,OAC3E,OAAO,KAAK,QAAQ,YAAY,2BAA2B,KAAK,SAAS,KAAK,SAAS,SAAS,IAAI;GAClG;GACA,UAAU,QAAQ;GAClB;EACF,CAAC;EAGH,MAAM,UAAU,OAAO,QAAQ;EAC/B,MAAM,QAAwB,CAAC;EAC/B,KAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,UAAU,UAAU,SAAS,KAAK;GACxC,IAAI,YAAY,MACd,OAAO,KAAK,QAAQ,YAAY,oBAAoB,KAAK,SAAS,KAAK,SAAS,SAAS,IAAI;IAC3F;IACA,UAAU,QAAQ;IAClB,OAAO,KAAK;IACZ,OAAO,QAAQ,QAAQ,MAAM;GAC/B,CAAC;GAEH,MAAM,KAAK,OAAO;EACpB;EAEA,IAAI,YACF,KAAK,IAAI,QAAQ,GAAG,QAAQ,IAAI,KAAK,SAAS,QAAQ,SAAS;GAC7D,MAAM,QAAQ,KAAK,kBAAkB,MAAM,KAAK;GAChD,IAAI,UAAU,MACZ,OAAO;GAET,MAAM,gBAAgB,KAAK,MAAM,MAAM;GACvC,IAAI,MAAM,WAAW,OAAO,cAAc,CAAC,mBAAmB,MAAM,QAAQ,OAAO,KAAK,CAAC,GACvF,OAAO,KAAK,2BAA2B,MAAM,OAAO,OAAO,eAAe,QAAQ;EAEtF;OACK;GACL,MAAM,QAAQ,KAAK,kBAAkB,MAAM,CAAC;GAC5C,IAAI,UAAU,MACZ,OAAO;GAET,MAAM,YAAY;GAClB,MAAM,WAAW,KAAK,MAAM,KAAK,CAAC;GAClC,IAAI,UAAU,WAAW,OAAO,cAAc,CAAC,mBAAmB,UAAU,SAAS,GACnF,OAAO,KAAK,2BAA2B,MAAM,GAAG,WAAW,UAAU,QAAQ;EAEjF;EACA,OAAO;CACT;CAEA,4BAAoC,SAA2B;EAC7D,MAAM,WAAW,KAAK,IAAI,GAAG,SAAS,CAAC;EACvC,IAAI,YAAY,GACd,OAAO,UAAU,KAAK,EAAE,QAAQ,OAAO,gBAAgB,CAAC,CAAC;EAE3D,MAAM,UAA0B,CAAC;EACjC,KAAK,IAAI,QAAQ,GAAG,SAAS,UAAU,SACrC,QAAQ,KAAK,EAAE,QAAQ,OAAO,gBAAgB,CAAC;EAEjD,OAAO,UAAU,KAAK,MAAM,OAAO,CAAC,CAAC;CACvC;CAEA,2BACE,MACA,YACA,OACA,UACA,UACM;EACN,MAAM,UAAU,KAAK,KAAK;EAC1B,IAAI,cAAc,SAAS,QAAQ,KAAK,mBAAmB,SAAS,QAAQ,GAC1E,OAAO,KAAK,QAAQ,YAAY,6BAA6B,KAAK,SAAS,aAAa;GACtF;GACA,UAAU,KAAK;GACf,UAAU,QAAQ;EACpB,CAAC;EAEH,OAAO,KAAK,QAAQ,YAAY,4BAA4B,KAAK,SAAS,aAAa;GACrF,UAAU,KAAK;GACf,UAAU,QAAQ;GAClB;EACF,CAAC;CACH;CAEA,YAAoB,MAAsC;EACxD,MAAM,WAAW,KAAK,kBAAkB,MAAM,CAAC;EAC/C,IAAI,aAAa,MACf,OAAO;EAET,IACE,SAAS,WAAW,OAAO,mBAC1B,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,iBAE1E,OAAO;EAET,IAAI,SAAS,WAAW,OAAO,cAAc,SAAS,KAAK,WAAW,OAAO,YAC3E,OAAO,KAAK,QAAQ,YAAY,eAAe,KAAK,SAAS,IAAI,CAAC,UAAU,QAAQ,CAAC,CAAC;EAExF,OAAO,OAAO,QAAQ;CACxB;CAEA,mBAA2B,MAAsC;EAC/D,OAAO,KAAK,kBAAkB,MAAM,MAAM;CAC5C;CAEA,iBAAyB,MAAsC;EAC7D,KAAK,OAAO,WAAW;EAEvB,MAAM,SAAS,KAAK,gBAClB,MACA,GACA,YAAY,sBACZ,WAAW,QAAQ,mBAAmB,CACxC;EACA,IAAI,WAAW,MACb,OAAO;OACF,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GACpD,OAAO;OACF,IAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GACjC,OAAO;EAGT,KAAK,OAAO,SAAS,KAAK,SAAS,EAAE;EACrC,OAAO,KAAK,MAAM;CACpB;CAEA,gBAAwB,MAAsC;EAC5D,KAAK,OAAO,WAAW;EAEvB,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,IAAI,CAAC,KAAK,WAAW,MAAM,KAAK,GAC9B,OAAO;EAIX,MAAM,OAAO,KAAK,kBAAkB,MAAM,CAAC;EAC3C,IAAI,SAAS,MACX,OAAO;EAGT,KAAK,OAAO,SAAS,IAAI;EACzB,OAAO,KAAK,IAAI;CAClB;CAEA,aAAqB,MAAsC;EACzD,MAAM,SAAS,KAAK,gBAAgB,MAAM,GAAG,YAAY,sBAAsB,WAAW,QAAQ,OAAO,CAAC;EAC1G,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GAC7C,OAAO;EAET,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,MAAM,SAAS,KAAK,kBAAkB,MAAM,CAAC;EAC7C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,MAAM,GAC7C,OAAO;EAET,OAAO;CACT;CAEA,eAAuB,MAAsC;EAC3D,KAAK,OAAO,WAAW;EAEvB,MAAM,WAAW,KAAK,kBAAkB,MAAM,CAAC;EAC/C,IAAI,aAAa,MACf,OAAO;EAET,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,QAAQ,GAC/C,OAAO;EAGT,MAAM,SAAS,KAAK,WAAW,QAAQ;EACvC,MAAM,iBAAiB,SAAS,IAAI;EAEpC,IAAI,iBAAiB,KAAK,kBAAkB,MAAM,cAAc;EAChE,IAAI,mBAAmB,MACrB,OAAO;EAET,IAAI,CAAC,mBAAmB,gBAAgB,QAAQ,GAC9C,OAAO,KAAK,QAAQ,YAAY,eAAe,KAAK,SAAS,iBAAiB;GAC5E,UAAU,cAAc;GACxB,UAAU,QAAQ;GAClB,WAAW,KAAK,MAAiB;EACnC,CAAC;EAGH,IAAI,YAAY,QAAQ,GACtB,KAAK,IAAI,UAAU,YAAY,sBAAsB,UAAU,GAAG,WAAW;GAC3E,KAAK,OAAO,SAAS,IAAI;GACzB,KAAK,OAAO,YAAY;GACxB,KAAK,OAAO,WAAW;GACvB,IAAI,CAAC,KAAK,sBAAsB,MAAM,GAAG,cAAc,GACrD,OAAO;GAET,MAAM,eAAe,KAAK,kBAAkB,MAAM,cAAc;GAChE,IAAI,iBAAiB,MACnB,OAAO;GAET,IAAI,cAAc,cAAc,cAAc,GAC5C;GAEF,iBAAiB;EACnB;EAGF,IAAI,QACF;OAAI,CAAC,KAAK,WAAW,MAAM,CAAC,GAC1B,OAAO;EACT;EAGF,KAAK,OAAO,SAAS,IAAI;EACzB,OAAO;CACT;CAEA,SAAiB,OAAyB;EACxC,OAAO,UAAU,QAAQ,UAAU,UAAU,QAAQ,gBAAgB,UAAU,QAAQ;CACzF;CAEA,qBAA6B,MAAwB;EACnD,OAAO,KAAK,UAAU,KAAK,WAAW,MAAM;GAC1C,IAAI,KAAK,WAAW,QAAQ,cAAc,OAAO;GACjD,OAAO,KAAK;EACd;EACA,OAAO;CACT;CAEA,mBAA2B,MAAe,OAAe,MAAsD;EAC7G,IAAI,KAAK,SAAS,SAAS,MAAM,KAAK,KAAK,QACzC,OAAO,KAAK,QAAQ,YAAY,kBAAkB,KAAK,SAAS,IAAI,CAClE,OAAO,KAAK,KAAK,MAAM,GACvB,OAAO,KAAK,SAAS,SAAS,CAAC,CACjC,CAAC;EAGH,MAAM,8BAAc,IAAI,IAA0B;EAClD,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAAS;GACzD,MAAM,YAAY,KAAK,kBAAkB,MAAM,KAAK;GACpD,IAAI,cAAc,MAChB,OAAO;GAET,MAAM,UAAU,eAAe,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC,IAAI;GAC/D,IAAI,CAAC,iBAAiB,aAAa,SAAS,SAAS,GAAG;IACtD,KAAK,QAAQ,YAAY,qBAAqB,KAAK,SAAS,QAAQ,CAClE,GAAG,KAAK,KAAK,QAAQ,EAAE,CAAC,MAAM,GAAG,UAAU,OAAO,KAClD,UAAU,SAAS,CACrB,CAAC;IACD,OAAO;GACT;EACF;EACA,OAAO;CACT;AACF;AAGA,SAAS,eAAe,UAAkB,MAAkC;CAC1E,QAAQ,KAAK,QAAb;EACE,SACE,MAAM,IAAI,MAAM,uBAAuB,SAAS,IAAI,KAAK,UAAU,IAAI,GAAG;EAC5E,KAAK,OAAO;EACZ,KAAK,OAAO,SACV,OAAO;EACT,KAAK,OAAO;GACV,IAAI,UAAU,KAAK,MAAM,GACvB,OAAO;IACL,QAAQ,KAAK;IACb,QAAQ,KAAK,SAAS;GACxB;GAEF,OAAO;EAET,KAAK,OAAO,YACV,OAAO;GACL,QAAQ,KAAK;GACb,MAAM,eAAe,UAAU,OAAO,IAAI,CAAC;EAC7C;EAEF,KAAK,OAAO,OAAO;GACjB,MAAM,UAA0B,CAAC;GACjC,KAAK,IAAI,QAAQ,GAAG,SAAS,KAAK,QAAQ,QAAQ,EAAE,OAClD,QAAQ,KAAK,eAAe,UAAU,UAAU,MAAM,KAAK,CAAE,CAAC;GAEhE,OAAO;IACL,QAAQ,KAAK;IACJ;GACX;EACF;CACF;AACF;;AAWA,IAAM,eAAN,MAAmB;CACjB;CAEA,OAA2B,CAAC;CAE5B,YAAY,SAAuE;EACjF,KAAK,UAAU;CACjB;CAEA,aAAmB;EACjB,KAAK,MAAM,SAAS,KAAK,MACvB,IAAI,MAAM,QAAQ,GAChB,MAAM,QAAQ,MAAM,QAAQ;CAGlC;CAEA,SAAS,MAAe,aAAsB,OAAa;EACzD,KAAK,MAAM,SAAS,KAAK,MAAM;GAC7B,MAAM;GACN,IAAI,CAAC,cAAc,MAAM,UAAU,KAAK,MAAM,aAAa,GACzD,KAAK,QAAQ,YAAY,cAAc,MAAM,CAAC,MAAM,KAAK,CAAC;EAE9D;CACF;CAEA,cAAoB;EAClB,KAAK,OAAO,KAAK,KAAK,QAAO,SAAQ,KAAK,QAAQ,CAAC;CACrD;CAEA,UAAU,MAAe,MAA6B;EACpD,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,WAAW,KAAK,KAAK,MAAK,SAAQ,KAAK,UAAU,KAAK;EAC5D,IAAI,UACF,IAAI,SAAS,QAAQ,GAAG;GACtB,KAAK,QAAQ,YAAY,gBAAgB,MAAM,CAAC,KAAK,CAAC;GACtD,OAAO;EACT,OAAO;GACL,KAAK,QAAQ,YAAY,oBAAoB,MAAM,CAAC,KAAK,CAAC;GAC1D,MAAM,QAAQ,KAAK,KAAK,QAAQ,QAAQ;GACxC,IAAI,UAAU,IACZ,KAAK,KAAK,OAAO,OAAO,CAAC;EAE7B;EAEF,KAAK,KAAK,KAAK;GAAE;GAAO;GAAM,OAAO;GAAG,UAAU;EAAE,CAAC;EACrD,OAAO;CACT;CAEA,aAAa,MAAoC;EAC/C,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,QAAQ,KAAK,KAAK,MAAK,SAAQ,KAAK,UAAU,KAAK;EACzD,IAAI,UAAU,QAAW;GACvB,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;GACvD,OAAO;EACT,OAAO,IAAI,MAAM,QAAQ,GAAG;GAC1B,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;GACvD,OAAO;EACT,OAAO;GACL,MAAM;GACN,OAAO,MAAM;EACf;CACF;AACF"}

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

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

package/package.json

@@ -1,12 +1,12 @@
 {
   "name": "@rsconcept/domain",
-  "version": "1.4.4",
+  "version": "1.4.6",
   "description": "Shared TypeScript domain for RS language, RSForm, RSModel, RSEngine, OSS, and concept-text helpers.",
   "license": "MIT",
   "author": "IRBorisov",
   "repository": {
     "type": "git",
-    "url": "git+https://github.com/IRBorisov/ConceptPortal",
+    "url": "git+https://github.com/IRBorisov/ConceptPortal.git",
     "directory": "rsconcept/domain"
   },
   "homepage": "https://portal.acconcept.ru",
@@ -167,15 +167,15 @@
   },
   "devDependencies": {
     "@lezer/generator": "^1.8.0",
-    "@types/node": "^25.9.4",
+    "@types/node": "^26.0.1",
     "@typescript-eslint/parser": "^8.0.1",
     "eslint": "^9.39.4",
     "eslint-plugin-simple-import-sort": "^13.0.0",
-    "globals": "^17.6.0",
-    "prettier": "^3.8.4",
+    "globals": "^17.7.0",
+    "prettier": "^3.9.1",
     "tsdown": "^0.22.3",
     "typescript": "^6.0.3",
-    "typescript-eslint": "^8.61.1",
+    "typescript-eslint": "^8.62.0",
     "vitest": "^4.1.9"
   },
   "publishConfig": {

package/src/rslang/error.ts

@@ -28,12 +28,11 @@ export type ErrorReporter = (error: RSErrorDescription) => void;
 /** Represents RSLang expression error types. */
 export const RSErrorCode = {
   unknownSyntax: 0x8400, // 33792
-  missingParenthesis: 0x8406, // 33798
-  missingCurlyBrace: 0x8407, // 33799
-  missingSquareBracket: 0x8408, // 33800
   bracketMismatch: 0x8409, // 33801
   doubleParenthesis: 0x840a, // 33802
   missingOpenBracket: 0x840b, // 33803
+  missingCloseBracket: 0x840c, // 33804
+  invalidFilterSyntax: 0x8417, // 33815
   expectedLocal: 0x8415, // 33813
   expectedType: 0x8416, // 33814
 
@@ -73,6 +72,8 @@ export const RSErrorCode = {
   invalidArgumentCortegeDeclare: 0x8829, // 34857
   invalidQuantifierDomain: 0x882a, // 34858
   invalidFilterParameterType: 0x882b, // 34859
+  invalidFilterIndex: 0x882c, // 34860
+  invalidFilterBooleanEchelon: 0x882d, // 34861
 
   globalNoValue: 0x8840, // 34880
   invalidPropertyUsage: 0x8841, // 34881

package/src/rslang/parser/parser.test.ts

@@ -68,13 +68,20 @@ const testError = [
 ];
 
 const testErrorData = [
-  ['(', { code: RSErrorCode.missingParenthesis, from: 1, to: 1 }],
-  ['{X1', { code: RSErrorCode.missingCurlyBrace, from: 3, to: 3 }],
+  ['(', { code: RSErrorCode.missingCloseBracket, from: 0, to: 1, params: ['('] }],
+  ['{X1', { code: RSErrorCode.missingCloseBracket, from: 0, to: 1, params: ['{'] }],
   ['∀∈X1 (1=1)', { code: RSErrorCode.expectedLocal, from: 1, to: 1 }],
-  ['∀σ∈S2 ∀(ξ,δ,π)∈σ (ξ∈δ & δ∈{pr1(π), pr2(π)}', { code: RSErrorCode.missingParenthesis, from: 42, to: 42 }],
+  [
+    '∀σ∈S2 ∀(ξ,δ,π)∈σ (ξ∈δ & δ∈{pr1(π), pr2(π)}',
+    { code: RSErrorCode.missingCloseBracket, from: 17, to: 18, params: ['('] }
+  ],
   ['Fi1[X1) (X1)', { code: RSErrorCode.bracketMismatch, from: 6, to: 7, params: [']', ')'] }],
-  [')X1', { code: RSErrorCode.missingOpenBracket, from: 0, to: 1, params: ['('] }],
-  ['Fi1[X1(X1)', { code: RSErrorCode.missingSquareBracket, from: 10, to: 10 }]
+  [')X1', { code: RSErrorCode.missingOpenBracket, from: 0, to: 1, params: [')'] }],
+  ['Fi1[X1(X1)', { code: RSErrorCode.missingCloseBracket, from: 3, to: 4, params: ['['] }],
+  ['F1', { code: RSErrorCode.globalFuncWithoutArgs, from: 0, to: 2, params: ['F1'] }],
+  ['P1', { code: RSErrorCode.globalFuncWithoutArgs, from: 0, to: 2, params: ['P1'] }],
+  ['F1[]', { code: RSErrorCode.globalFuncWithoutArgs, from: 0, to: 2, params: ['F1'] }],
+  ['Fi1(S1)', { code: RSErrorCode.invalidFilterSyntax, from: 0, to: 4 }]
 ];
 
 describe('Testing RSParser correct inputs', () => {

package/src/rslang/parser/syntax-errors.ts

@@ -6,7 +6,7 @@ import { type AstNode, visitAstDFS } from '../../parsing';
 import { annotateError } from '../ast-annotations';
 import { type ErrorReporter, RSErrorCode, type RSErrorDescription } from '../error';
 
-import { Variable } from './parser.terms';
+import { Filter, Function, Predicate, Variable } from './parser.terms';
 import { TokenID } from './token';
 
 export function extractSyntaxErrors(
@@ -15,20 +15,30 @@ export function extractSyntaxErrors(
   reporter: ErrorReporter,
   annotateErrors: boolean = false
 ) {
+  const collected: RSErrorDescription[] = [];
+  const collect = (error: RSErrorDescription) => {
+    collected.push(error);
+  };
+
   const bracketError = extractBracketErrors(expression);
   if (bracketError !== null) {
-    reporter(bracketError);
+    collect(bracketError);
     if (annotateErrors) {
       annotateError(ast, bracketError.code, bracketError.params);
     }
   }
   const hasBracketErrors = bracketError !== null;
-  visitAstDFS(ast, node => extractInternal(node, reporter, annotateErrors, hasBracketErrors));
+  visitAstDFS(ast, node => extractInternal(node, expression, collect, annotateErrors, hasBracketErrors));
+
+  for (const error of deduplicateErrors(collected)) {
+    reporter(error);
+  }
 }
 
 // ====== Internals =========
 function extractInternal(
   node: AstNode,
+  expression: string,
   reporter: ErrorReporter,
   annotateErrors: boolean,
   ignoreUnknownErrors: boolean
@@ -37,11 +47,20 @@ function extractInternal(
     return;
   }
 
-  function emit(target: AstNode, code: RSErrorCode) {
-    reporter({ code: code, from: target.from, to: target.to });
+  function emit(target: AstNode, code: RSErrorCode, params?: readonly string[]) {
+    reporter({ code: code, from: target.from, to: target.to, params });
+    if (annotateErrors) {
+      annotateError(target, code, params);
+    }
+  }
+
+  const classified = classifyParseError(node, expression);
+  if (classified !== null) {
+    reporter(classified);
     if (annotateErrors) {
-      annotateError(target, code);
+      annotateError(node, classified.code, classified.params);
     }
+    return;
   }
 
   const parent = node.parent;
@@ -61,6 +80,172 @@ function extractInternal(
   }
 }
 
+function classifyParseError(node: AstNode, expression: string): RSErrorDescription | null {
+  const filterParen = detectFilterParenMismatch(node, expression);
+  if (filterParen !== null) {
+    return filterParen;
+  }
+
+  return detectGlobalFuncWithoutArgs(node, expression);
+}
+
+function detectFilterParenMismatch(node: AstNode, expression: string): RSErrorDescription | null {
+  const filterNode = findAncestor(node, isFilterNode) ?? findRelatedNode(node, isFilterNode);
+  if (filterNode === null) {
+    return null;
+  }
+
+  const nextChar = expression[filterNode.to];
+  if (nextChar === '(') {
+    return {
+      code: RSErrorCode.invalidFilterSyntax,
+      from: filterNode.from,
+      to: filterNode.to + 1
+    };
+  }
+  return null;
+}
+
+function detectGlobalFuncWithoutArgs(node: AstNode, expression: string): RSErrorDescription | null {
+  const funcNode =
+    findAncestor(node, n => isFunctionNode(n) || isPredicateNode(n)) ??
+    findRelatedNode(node, n => isFunctionNode(n) || isPredicateNode(n));
+  if (funcNode === null) {
+    return null;
+  }
+  return classifyFuncWithoutArgs(funcNode, expression);
+}
+
+function findRelatedNode(node: AstNode, predicate: (target: AstNode) => boolean): AstNode | null {
+  let current: AstNode | null = node.parent;
+  while (current !== null) {
+    for (const child of current.children) {
+      if (predicate(child)) {
+        return child;
+      }
+    }
+    current = current.parent;
+  }
+  return null;
+}
+
+function classifyFuncWithoutArgs(funcNode: AstNode, expression: string): RSErrorDescription | null {
+  const name = expression.slice(funcNode.from, funcNode.to);
+  const rest = expression.slice(funcNode.to);
+
+  if (!/^\s*\[/.test(rest)) {
+    return {
+      code: RSErrorCode.globalFuncWithoutArgs,
+      from: funcNode.from,
+      to: funcNode.to,
+      params: [name]
+    };
+  }
+
+  if (/^\s*\[\s*\]/.test(rest)) {
+    return {
+      code: RSErrorCode.globalFuncWithoutArgs,
+      from: funcNode.from,
+      to: funcNode.to,
+      params: [name]
+    };
+  }
+
+  const openBracket = /^\s*\[/.exec(rest);
+  if (openBracket !== null) {
+    const closeIdx = findMatchingCloseBracket(rest, openBracket[0].length - 1);
+    if (closeIdx >= 0) {
+      const inner = rest.slice(openBracket[0].length, closeIdx).trim();
+      if (inner.length === 0) {
+        return {
+          code: RSErrorCode.globalFuncWithoutArgs,
+          from: funcNode.from,
+          to: funcNode.to,
+          params: [name]
+        };
+      }
+    }
+  }
+
+  return null;
+}
+
+function findAncestor(node: AstNode, predicate: (node: AstNode) => boolean): AstNode | null {
+  let current: AstNode | null = node;
+  while (current !== null) {
+    if (predicate(current)) {
+      return current;
+    }
+    current = current.parent;
+  }
+  return null;
+}
+
+function isFunctionNode(node: AstNode): boolean {
+  return node.typeID === Function || node.typeID === TokenID.ID_FUNCTION;
+}
+
+function isPredicateNode(node: AstNode): boolean {
+  return node.typeID === Predicate || node.typeID === TokenID.ID_PREDICATE;
+}
+
+function isFilterNode(node: AstNode): boolean {
+  return node.typeID === Filter || node.typeID === TokenID.FILTER;
+}
+
+function findMatchingCloseBracket(expression: string, openPos: number): number {
+  const open = expression[openPos];
+  if (open !== '[') {
+    return -1;
+  }
+
+  let depth = 0;
+  for (let index = openPos; index < expression.length; index++) {
+    const symbol = expression[index];
+    if (symbol === '[') {
+      depth++;
+    } else if (symbol === ']') {
+      depth--;
+      if (depth === 0) {
+        return index;
+      }
+    }
+  }
+  return -1;
+}
+
+function deduplicateErrors(errors: RSErrorDescription[]): RSErrorDescription[] {
+  const result: RSErrorDescription[] = [];
+
+  for (const error of errors) {
+    const duplicate = result.some(
+      existing => existing.code === error.code && existing.from === error.from && existing.to === error.to
+    );
+    if (duplicate) {
+      continue;
+    }
+
+    if (error.code !== RSErrorCode.unknownSyntax) {
+      for (let index = result.length - 1; index >= 0; index--) {
+        if (result[index].code === RSErrorCode.unknownSyntax && rangesOverlap(error, result[index])) {
+          result.splice(index, 1);
+        }
+      }
+    }
+
+    result.push(error);
+  }
+
+  const specific = result.filter(error => error.code !== RSErrorCode.unknownSyntax);
+  return result.filter(
+    error => error.code !== RSErrorCode.unknownSyntax || !specific.some(item => rangesOverlap(error, item))
+  );
+}
+
+function rangesOverlap(a: RSErrorDescription, b: RSErrorDescription): boolean {
+  return a.from < b.to && b.from < a.to;
+}
+
 type OpenBracket = '(' | '[' | '{';
 type CloseBracket = ')' | ']' | '}';
 
@@ -96,7 +281,7 @@ function extractBracketErrors(expression: string): RSErrorDescription | null {
         code: RSErrorCode.missingOpenBracket,
         from: pos,
         to: pos + 1,
-        params: [expectedOpen]
+        params: [symbol]
       };
     }
 
@@ -114,28 +299,17 @@ function extractBracketErrors(expression: string): RSErrorDescription | null {
 
   if (stack.length > 0) {
     const unclosed = stack[0];
-    const code = missingBracketCode(unclosed.bracket);
     return {
-      code,
-      from: expression.length,
-      to: expression.length
+      code: RSErrorCode.missingCloseBracket,
+      from: unclosed.index,
+      to: unclosed.index + 1,
+      params: [unclosed.bracket]
     };
   }
 
   return null;
 }
 
-function missingBracketCode(bracket: OpenBracket): RSErrorCode {
-  switch (bracket) {
-    case '(':
-      return RSErrorCode.missingParenthesis;
-    case '[':
-      return RSErrorCode.missingSquareBracket;
-    case '{':
-      return RSErrorCode.missingCurlyBrace;
-  }
-}
-
 function isOpenBracket(symbol: string): symbol is OpenBracket {
   return symbol === '(' || symbol === '[' || symbol === '{';
 }
@@ -172,8 +346,8 @@ function isDoubleParenthesis(expression: string, pos: number): boolean {
     return false;
   }
 
-  const outerClose = findMatchingCloseBracket(expression, pos);
-  const innerClose = findMatchingCloseBracket(expression, pos + 1);
+  const outerClose = findMatchingCloseParen(expression, pos);
+  const innerClose = findMatchingCloseParen(expression, pos + 1);
   if (outerClose < 0 || innerClose < 0) {
     return false;
   }
@@ -181,7 +355,7 @@ function isDoubleParenthesis(expression: string, pos: number): boolean {
   return outerClose === innerClose + 1;
 }
 
-function findMatchingCloseBracket(expression: string, openPos: number): number {
+function findMatchingCloseParen(expression: string, openPos: number): number {
   if (expression[openPos] !== '(') {
     return -1;
   }