@rsconcept/domain 1.2.0 → 1.4.0

package/dist/rslang/eval/evaluator.js.map

@@ -1 +1 @@
-{"version":3,"file":"evaluator.js","names":[],"sources":["../../../src/rslang/eval/evaluator.ts"],"sourcesContent":["/**\n * Module: AST evaluation - visitor-pattern evaluator for RS expressions.\n */\n\nimport { type AstNode, getNodeIndices, getNodeText } from '../../parsing';\nimport { annotateError } from '../ast-annotations';\nimport { type ErrorReporter, RSErrorCode } from '../error';\nimport { TokenID } from '../parser/token';\n\nimport { EvaluationCache, EvaluationMetadata } from './evaluation-cache';\nimport {\n  BOOL_INFINITY,\n  compare,\n  EmptySetV,\n  set,\n  SET_INFINITY,\n  tuple,\n  type Value,\n  VALUE_FALSE,\n  VALUE_TRUE,\n  type ValueContext\n} from './value';\nimport {\n  boolean,\n  cartesianProduct,\n  contains,\n  isSubsetOrEq,\n  projection,\n  reduce,\n  setDiff,\n  setIntersection,\n  setSymDiff,\n  setUnion\n} from './value-api';\n\n/** Maximum iterations to prevent infinite loops (recursion, quantifiers, etc.). */\nconst MAX_ITERATIONS = 1_000_000;\n\nconst TICK_PER_FUNCTION = 3;\nconst TICK_PER_RECURSION = 3;\nconst TICK_PER_IMPERATIVE = 1;\nconst TICK_PER_DECLARATIVE = 1;\nconst TICK_PER_QUANTIFIER = 1;\n\n/** AST context. */\nexport type ASTContext = Map<string, AstNode>;\n\n/** AST calculator - evaluates RS expressions via visitor pattern and provides updates via listeners.\n * Not safe for concurrent {@link run} calls on the same instance; use separate evaluators instead. */\nexport class Evaluator {\n  private reporter?: ErrorReporter;\n  private annotateErrors = false;\n  private disableCache = false;\n  private locals: LocalContext = new LocalContext();\n  private nodeMetadata: EvaluationMetadata = new EvaluationMetadata();\n  private evalCache: EvaluationCache = new EvaluationCache();\n  private callSiteStack: AstNode[] = [];\n  private context: ValueContext;\n  private treeContext: ASTContext;\n\n  public iterationCounter = 0;\n\n  /** Cache hits in the current evaluation run (for tests/diagnostics). */\n  public get cacheHits(): number {\n    return this.evalCache.hits;\n  }\n\n  constructor(context: ValueContext, astContext: ASTContext) {\n    this.treeContext = astContext;\n    this.context = context;\n  }\n\n  public run(\n    ast: AstNode,\n    reporter?: ErrorReporter,\n    annotateErrors: boolean = false,\n    disableCache: boolean = false\n  ): Value | null {\n    if (ast.hasError) {\n      return null;\n    }\n    this.reporter = reporter;\n    this.annotateErrors = annotateErrors;\n    this.disableCache = disableCache;\n    this.clear();\n    return this.dispatchVisit(ast);\n  }\n\n  private clear(): void {\n    this.locals = new LocalContext();\n    this.evalCache.clear();\n    this.callSiteStack = [];\n    this.iterationCounter = 0;\n  }\n\n  private errorNode(node: AstNode): AstNode {\n    if (this.callSiteStack.length > 0) {\n      return this.callSiteStack[this.callSiteStack.length - 1];\n    }\n    return node;\n  }\n\n  private onError(code: RSErrorCode, node: AstNode, params?: string[]): null {\n    const target = this.errorNode(node);\n    this.reporter?.({ code, from: target.from, to: target.to, params });\n    if (this.annotateErrors) {\n      annotateError(target, code, params);\n    }\n    return null;\n  }\n\n  private tick(node: AstNode, counter: number = 1): boolean {\n    this.iterationCounter += counter;\n    if (this.iterationCounter > MAX_ITERATIONS) {\n      this.onError(RSErrorCode.iterationsLimit, node, [String(MAX_ITERATIONS)]);\n      return false;\n    }\n    return true;\n  }\n\n  private dispatchDeclare(node: AstNode, value: Value): void {\n    switch (node.typeID) {\n      case TokenID.ID_LOCAL:\n        return this.declareLocal(node, value);\n      case TokenID.NT_TUPLE_DECL:\n        return this.declareTuple(node, value as Value[]);\n      case TokenID.NT_ARG_DECL:\n        return this.dispatchDeclare(node.children[0], value);\n    }\n  }\n\n  private declareLocal(node: AstNode, value: Value): void {\n    const alias = getNodeText(node);\n    this.locals.setLocal(alias, value);\n  }\n\n  private declareTuple(node: AstNode, value: Value[]): void {\n    for (let child = 0; child < node.children.length; child++) {\n      this.dispatchDeclare(node.children[child], value[child + 1]);\n    }\n  }\n\n  private dispatchVisit(node: AstNode): Value | null {\n    const info = this.nodeMetadata.get(node);\n    let stamp: string | null = null;\n    if (info.cacheable && !this.disableCache) {\n      stamp = this.locals.buildDependencyStamp(info.reads);\n      if (stamp !== null) {\n        const cached = this.evalCache.lookup(info.structuralKey, stamp);\n        if (cached !== undefined) {\n          return cached;\n        }\n      }\n    }\n\n    const result = this.dispatchVisitImpl(node);\n    if (!this.disableCache && result !== null && info.cacheable && stamp !== null) {\n      this.evalCache.store(info.structuralKey, stamp, result);\n    }\n    return result;\n  }\n\n  private dispatchVisitImpl(node: AstNode): Value | null {\n    switch (node.typeID) {\n      case TokenID.ID_GLOBAL:\n        return this.visitGlobal(node);\n\n      case TokenID.NT_FUNC_CALL:\n        return this.visitFunctionCall(node);\n\n      case TokenID.ID_LOCAL:\n      case TokenID.ID_RADICAL:\n        return this.visitLocal(node);\n\n      case TokenID.LIT_INTEGER:\n        return this.visitInteger(node);\n\n      case TokenID.LIT_WHOLE_NUMBERS:\n        return this.onError(RSErrorCode.iterateInfinity, node);\n\n      case TokenID.LIT_EMPTYSET:\n        return EmptySetV;\n\n      case TokenID.PLUS:\n      case TokenID.MINUS:\n      case TokenID.MULTIPLY:\n        return this.visitArithmetic(node);\n\n      case TokenID.CARD:\n        return this.visitCard(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\n      case TokenID.BOOLEAN:\n        return this.visitBoolean(node);\n\n      case TokenID.NT_TUPLE:\n        return this.visitTuple(node);\n\n      case TokenID.NT_ENUMERATION:\n        return this.visitEnumeration(node);\n\n      case TokenID.BOOL:\n        return this.visitBool(node);\n\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.BIGPR:\n        return this.visitProjectSet(node);\n\n      case TokenID.SMALLPR:\n        return this.visitProjectTuple(node);\n\n      case TokenID.FILTER:\n        return this.visitFilter(node);\n\n      case TokenID.REDUCE:\n        return this.visitReduce(node);\n\n      case TokenID.NT_DECLARATIVE_EXPR:\n        return this.visitDeclarative(node);\n\n      case TokenID.NT_IMPERATIVE_EXPR:\n        return this.visitImperative(node);\n\n      case TokenID.ASSIGN:\n        return this.visitAssign(node);\n\n      case TokenID.NT_RECURSIVE_FULL:\n      case TokenID.NT_RECURSIVE_SHORT:\n        return this.visitRecursion(node);\n\n      case TokenID.NT_FUNC_DEFINITION:\n        return this.onError(RSErrorCode.calculationNotSupported, node);\n    }\n    return null;\n  }\n\n  private visitChild(node: AstNode, index: number): Value | null {\n    return this.dispatchVisit(node.children[index]);\n  }\n\n  private visitGlobal(node: AstNode): Value | null {\n    const alias = getNodeText(node);\n    const value = this.context.get(alias);\n    if (value === undefined) {\n      return this.onError(RSErrorCode.calcGlobalMissing, node, [alias]);\n    }\n    return value;\n  }\n\n  private visitLocal(node: AstNode): Value | null {\n    const alias = getNodeText(node);\n    return this.locals.getLocal(alias);\n  }\n\n  private visitFunctionCall(node: AstNode): Value | null {\n    const funcName = getNodeText(node.children[0]);\n    const ast = this.treeContext.get(funcName);\n    if (!ast) {\n      return this.onError(RSErrorCode.calcGlobalMissing, node.children[0], [funcName]);\n    }\n    if (!this.tick(node, TICK_PER_FUNCTION)) {\n      return null;\n    }\n\n    const args: Value[] = [];\n    for (let i = 1; i < node.children.length; i++) {\n      const arg = this.visitChild(node, i);\n      if (arg === null) {\n        return null;\n      }\n      args.push(arg);\n    }\n\n    this.locals.startScope();\n    for (let i = 0; i < args.length; i++) {\n      this.dispatchDeclare(ast.children[0].children[i], args[i]);\n    }\n    this.callSiteStack.push(node);\n    let result: Value | null;\n    try {\n      result = this.visitChild(ast, 1);\n    } finally {\n      this.callSiteStack.pop();\n    }\n    this.locals.endScope();\n    return result;\n  }\n\n  private visitInteger(node: AstNode): Value | null {\n    const value = node.data.dataType === 'number' ? (node.data.value as number) : Number(node.data.value);\n    return Math.floor(value);\n  }\n\n  private visitArithmetic(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    const v2 = this.visitChild(node, 1);\n    if (v1 === null || v2 === null) {\n      return null;\n    }\n    const a = v1 as number;\n    const b = v2 as number;\n    switch (node.typeID) {\n      case TokenID.PLUS:\n        return a + b;\n      case TokenID.MINUS:\n        return a - b;\n      case TokenID.MULTIPLY:\n        return a * b;\n    }\n    return null;\n  }\n\n  private visitCard(node: AstNode): Value | null {\n    const base = this.visitChild(node, 0);\n    if (base === null || !Array.isArray(base)) {\n      return null;\n    }\n    return base.length;\n  }\n\n  private visitQuantifier(node: AstNode): Value | null {\n    const domain = this.visitChild(node, 1) as Value[];\n    if (domain === null) {\n      return null;\n    }\n    const isUniversal = node.typeID === TokenID.QUANTOR_UNIVERSAL;\n    if (domain.length === 0) {\n      return isUniversal ? VALUE_TRUE : VALUE_FALSE;\n    }\n\n    const varNodes = node.children[0].typeID === TokenID.NT_ENUM_DECL ? node.children[0].children : [node.children[0]];\n    const count = domain.length;\n    const iterators: number[] = [];\n    for (const declaration of varNodes) {\n      iterators.push(0);\n      this.dispatchDeclare(declaration, domain[0]);\n    }\n    let finishIteration = false;\n    while (!finishIteration) {\n      const iterationValue = this.visitChild(node, 2);\n      if (iterationValue === null) {\n        return null;\n      }\n      if ((iterationValue === VALUE_TRUE) !== isUniversal) {\n        return !isUniversal ? VALUE_TRUE : VALUE_FALSE;\n      }\n      let incrementIndex = iterators.length - 1;\n      while (true) {\n        if (iterators[incrementIndex] < count - 1) {\n          iterators[incrementIndex]++;\n          if (!this.tick(node, TICK_PER_QUANTIFIER)) {\n            return null;\n          }\n          this.dispatchDeclare(varNodes[incrementIndex], domain[iterators[incrementIndex]]);\n          incrementIndex = iterators.length - 1;\n          break;\n        } else if (incrementIndex === 0) {\n          finishIteration = true;\n          break;\n        } else {\n          iterators[incrementIndex] = 0;\n          this.dispatchDeclare(varNodes[incrementIndex], domain[0]);\n          incrementIndex--;\n        }\n      }\n    }\n    return isUniversal ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitNegation(node: AstNode): Value | null {\n    const value = this.visitChild(node, 0);\n    if (value === null) {\n      return null;\n    }\n    return (value as number) === VALUE_TRUE ? VALUE_FALSE : VALUE_TRUE;\n  }\n\n  private tryEvaluateFromFirstArg(op: number, first: boolean): Value | null {\n    if ((op === TokenID.LOGIC_AND && !first) || (op === TokenID.LOGIC_OR && first)) {\n      return first ? VALUE_TRUE : VALUE_FALSE;\n    }\n    if (op === TokenID.LOGIC_IMPLICATION && !first) {\n      return VALUE_TRUE;\n    }\n    return null;\n  }\n\n  private visitLogicBinary(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const b1 = v1 === VALUE_TRUE;\n    const attempt = this.tryEvaluateFromFirstArg(node.typeID, b1);\n    if (attempt !== null) {\n      return attempt;\n    }\n\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    const b2 = v2 === VALUE_TRUE;\n    let result: boolean;\n    switch (node.typeID) {\n      case TokenID.LOGIC_AND:\n        result = b1 && b2;\n        break;\n      case TokenID.LOGIC_OR:\n        result = b1 || b2;\n        break;\n      case TokenID.LOGIC_IMPLICATION:\n        result = !b1 || b2;\n        break;\n      case TokenID.LOGIC_EQUIVALENT:\n        result = b1 === b2;\n        break;\n      default:\n        return null;\n    }\n    return result ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitEquals(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    const areEqual = compare(v1, v2) === 0;\n    return areEqual === (node.typeID !== TokenID.NOTEQUAL) ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitIntegerPredicate(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    const a = v1 as number;\n    const b = v2 as number;\n    let result: boolean;\n    switch (node.typeID) {\n      case TokenID.GREATER:\n        result = a > b;\n        break;\n      case TokenID.LESSER:\n        result = a < b;\n        break;\n      case TokenID.GREATER_OR_EQ:\n        result = a >= b;\n        break;\n      case TokenID.LESSER_OR_EQ:\n        result = a <= b;\n        break;\n      default:\n        return null;\n    }\n    return result ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitSetexprPredicate(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    let result: boolean;\n    switch (node.typeID) {\n      case TokenID.SET_IN:\n        result = contains(v2 as Value[], v1);\n        break;\n      case TokenID.SET_NOT_IN:\n        result = !contains(v2 as Value[], v1);\n        break;\n      case TokenID.SUBSET:\n        result = compare(v1, v2) !== 0 && isSubsetOrEq(v1 as Value[], v2 as Value[]);\n        break;\n      case TokenID.NOT_SUBSET:\n        result = compare(v1, v2) === 0 || !isSubsetOrEq(v1 as Value[], v2 as Value[]);\n        break;\n      case TokenID.SUBSET_OR_EQ:\n        result = isSubsetOrEq(v1 as Value[], v2 as Value[]);\n        break;\n      default:\n        return null;\n    }\n    return result ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitDecart(node: AstNode): Value | null {\n    const args: Value[] = [];\n    for (let i = 0; i < node.children.length; i++) {\n      const component = this.visitChild(node, i) as Value[];\n      if (component === null) {\n        return null;\n      }\n      if (component.length === 0) {\n        return EmptySetV;\n      }\n      args.push(component);\n    }\n    const result = cartesianProduct(args as Value[][]);\n    if (result === null) {\n      this.onError(RSErrorCode.setOverflow, node, [String(SET_INFINITY)]);\n      return null;\n    }\n    return result;\n  }\n\n  private visitBoolean(node: AstNode): Value | null {\n    const base = this.visitChild(node, 0) as Value[];\n    if (base === null) {\n      return null;\n    }\n    const result = boolean(base);\n    if (result === null) {\n      this.onError(RSErrorCode.booleanBaseLimit, node.children[0], [String(BOOL_INFINITY)]);\n      return null;\n    }\n    return result;\n  }\n\n  private visitTuple(node: AstNode): Value | null {\n    const args: Value[] = [];\n    for (let i = 0; i < node.children.length; i++) {\n      const component = this.visitChild(node, i);\n      if (component === null) {\n        return null;\n      }\n      args.push(component);\n    }\n    return tuple(args);\n  }\n\n  private visitEnumeration(node: AstNode): Value | null {\n    const args: Value[] = [];\n    for (let i = 0; i < node.children.length; i++) {\n      const element = this.visitChild(node, i);\n      if (element === null) {\n        return null;\n      }\n      args.push(element);\n    }\n    return set(args);\n  }\n\n  private visitBool(node: AstNode): Value | null {\n    const element = this.visitChild(node, 0);\n    if (element === null) {\n      return null;\n    }\n    return [element];\n  }\n\n  private visitDebool(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0) as Value[];\n    if (target === null) {\n      return null;\n    }\n    if (target.length !== 1) {\n      return this.onError(RSErrorCode.calcInvalidDebool, node.children[0]);\n    }\n    return target[0];\n  }\n\n  private visitSetexprBinary(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    switch (node.typeID) {\n      case TokenID.SET_UNION:\n        return setUnion(v1 as Value[], v2 as Value[]);\n      case TokenID.SET_INTERSECTION:\n        return setIntersection(v1 as Value[], v2 as Value[]);\n      case TokenID.SET_MINUS:\n        return setDiff(v1 as Value[], v2 as Value[]);\n      case TokenID.SET_SYMMETRIC_MINUS:\n        return setSymDiff(v1 as Value[], v2 as Value[]);\n    }\n    return null;\n  }\n\n  private visitProjectSet(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0);\n    if (target === null) {\n      return null;\n    }\n    const indices = getNodeIndices(node);\n    return projection(target as Value[][], indices);\n  }\n\n  private visitProjectTuple(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0) as Value[];\n    if (target === null) {\n      return null;\n    }\n    const indices = getNodeIndices(node);\n    const components = indices.map(i => target[i]);\n    return components.length === 1 ? components[0] : tuple(components);\n  }\n\n  private visitFilter(node: AstNode): Value | null {\n    const lastIdx = node.children.length - 1;\n    const argVal = this.visitChild(node, lastIdx) as Value[][];\n    if (argVal === null) {\n      return null;\n    }\n    if (argVal.length === 0) {\n      return EmptySetV;\n    }\n\n    const indices = getNodeIndices(node);\n    const tupleParam = indices.length === lastIdx;\n    if (tupleParam) {\n      const params: Value[] = [];\n      for (let i = 0; i < lastIdx; i++) {\n        const param = this.visitChild(node, i) as Value[];\n        if (param === null) {\n          return null;\n        }\n        if (param.length === 0) {\n          return EmptySetV;\n        }\n        params.push(param);\n      }\n      const result: Value[] = [];\n      for (const element of argVal) {\n        let valid = true;\n        for (let j = 0; j < indices.length; j++) {\n          const comp = element[indices[j]];\n          const paramSet = params[j] as Value[];\n          if (!contains(paramSet, comp)) {\n            valid = false;\n            break;\n          }\n        }\n        if (valid) {\n          result.push(element);\n        }\n      }\n      return result;\n    } else {\n      const paramVal = this.visitChild(node, 0) as Value[];\n      if (paramVal === null) {\n        return null;\n      }\n      if (paramVal.length === 0) {\n        return EmptySetV;\n      }\n\n      const result: Value[] = [];\n      for (const element of argVal) {\n        const comps = indices.map(i => element[i]);\n        const testElement = comps.length === 1 ? comps[0] : tuple(comps);\n        if (contains(paramVal, testElement)) result.push(element);\n      }\n      return result;\n    }\n  }\n\n  private visitReduce(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0);\n    if (target === null) {\n      return null;\n    }\n    return reduce(target as Value[][]);\n  }\n\n  private visitDeclarative(node: AstNode): Value | null {\n    const domain = this.visitChild(node, 1);\n    if (domain === null) {\n      return null;\n    }\n\n    const elements = [];\n    for (const element of domain as Value[]) {\n      if (!this.tick(node, TICK_PER_DECLARATIVE)) {\n        return null;\n      }\n      this.dispatchDeclare(node.children[0], element);\n      const value = this.visitChild(node, 2);\n      if (value === null) {\n        return null;\n      }\n      if (value === VALUE_TRUE) {\n        elements.push(element);\n      }\n    }\n    return elements.length === 0 ? EmptySetV : elements;\n  }\n\n  private visitImperative(node: AstNode): Value | null {\n    const result: Value[] = [];\n    const frames: IterationFrame[] = [];\n\n    let currentChild = 1;\n\n    // Advance to next iteration\n    const advanceIterator = (): boolean => {\n      while (frames.length > 0) {\n        const top = frames[frames.length - 1];\n        if (top.valueID < top.domain.length - 1) {\n          top.valueID++;\n          const nextValue = top.domain[top.valueID];\n          if (!this.tick(node.children[top.childID], TICK_PER_IMPERATIVE)) {\n            return false;\n          }\n          this.dispatchDeclare(node.children[top.childID].children[0], nextValue);\n          currentChild = top.childID + 1;\n          return true;\n        }\n        frames.pop();\n      }\n      return false;\n    };\n\n    while (true) {\n      // Iteration end - create element and pop up stack\n      if (currentChild >= node.children.length) {\n        const element = this.visitChild(node, 0);\n        if (element === null) {\n          return null;\n        }\n        result.push(element);\n        if (!advanceIterator()) {\n          break;\n        }\n        continue;\n      }\n\n      // Iteration node\n      const child = node.children[currentChild];\n      if (child.typeID === TokenID.ITERATE) {\n        const domain = this.visitChild(child, 1) as Value[];\n        if (domain === null) {\n          return null;\n        }\n        if (domain.length === 0) {\n          if (!advanceIterator()) {\n            break;\n          }\n          continue;\n        }\n        if (!this.tick(child, TICK_PER_IMPERATIVE)) {\n          return null;\n        }\n        frames.push({\n          childID: currentChild,\n          domain,\n          valueID: 0\n        });\n        this.dispatchDeclare(child.children[0], domain[0]);\n        currentChild++;\n        continue;\n      }\n\n      // Guard expression\n      const value = this.dispatchVisit(child);\n      if (value === null) {\n        return null;\n      }\n      if (value === VALUE_FALSE) {\n        if (!advanceIterator()) {\n          break;\n        }\n        continue;\n      }\n      currentChild++;\n    }\n    return set(result);\n  }\n\n  private visitAssign(node: AstNode): Value | null {\n    const value = this.visitChild(node, 1);\n    if (value === null) {\n      return null;\n    }\n    this.dispatchDeclare(node.children[0], value);\n    return VALUE_TRUE;\n  }\n\n  private visitRecursion(node: AstNode): Value | null {\n    const initialValue = this.visitChild(node, 1);\n    if (initialValue === null) {\n      return null;\n    }\n    const bodyIndex = node.typeID === TokenID.NT_RECURSIVE_FULL ? 3 : 2;\n    let current: Value = initialValue;\n    while (true) {\n      if (!this.tick(node, TICK_PER_RECURSION)) {\n        return null;\n      }\n\n      this.dispatchDeclare(node.children[0], current);\n      if (node.typeID === TokenID.NT_RECURSIVE_FULL) {\n        const pred = this.visitChild(node, 2);\n        if (pred === null) {\n          return null;\n        }\n        if (pred !== VALUE_TRUE) {\n          break;\n        }\n      }\n\n      const next = this.visitChild(node, bodyIndex);\n      if (next === null) {\n        return null;\n      }\n      if (compare(current, next) === 0) {\n        break;\n      }\n      current = next;\n    }\n\n    return current;\n  }\n}\n\n/** Imperative iteration block data. */\ninterface IterationFrame {\n  childID: number;\n  domain: Value[];\n  valueID: number;\n}\n\n/** Local variable binding with version for cache invalidation. */\ninterface LocalBinding {\n  id: number;\n  version: number;\n  value: Value;\n}\n\n/** Local variables context. */\nclass LocalContext {\n  private nextBindingId = 1;\n  private data = new Map<string, LocalBinding>();\n  private callStack: Map<string, LocalBinding>[] = [];\n\n  startScope(): void {\n    this.callStack.push(this.data);\n    this.data = new Map();\n  }\n\n  endScope(): void {\n    this.data = this.callStack.pop()!;\n  }\n\n  setLocal(alias: string, value: Value): void {\n    const existing = this.data.get(alias);\n    if (existing) {\n      existing.value = value;\n      existing.version++;\n    } else {\n      this.data.set(alias, { id: this.nextBindingId++, version: 0, value });\n    }\n  }\n\n  getLocal(alias: string): Value {\n    const binding = this.data.get(alias);\n    if (binding === undefined) {\n      throw new Error(`Local variable \"${alias}\" not found`);\n    }\n    return binding.value;\n  }\n\n  buildDependencyStamp(reads: ReadonlySet<string>): string | null {\n    if (reads.size === 0) {\n      return '';\n    }\n    const parts: string[] = [];\n    for (const alias of [...reads].sort()) {\n      const binding = this.data.get(alias);\n      if (binding === undefined) {\n        return null;\n      }\n      parts.push(`${binding.id}:${binding.version}`);\n    }\n    return parts.join('|');\n  }\n}\n"],"mappings":";;;;;;;;;;;;AAoCA,MAAM,iBAAiB;AAEvB,MAAM,oBAAoB;AAC1B,MAAM,qBAAqB;AAC3B,MAAM,sBAAsB;AAC5B,MAAM,uBAAuB;AAC7B,MAAM,sBAAsB;;;AAO5B,IAAa,YAAb,MAAuB;CACrB;CACA,iBAAyB;CACzB,eAAuB;CACvB,SAA+B,IAAI,aAAa;CAChD,eAA2C,IAAI,mBAAmB;CAClE,YAAqC,IAAI,gBAAgB;CACzD,gBAAmC,CAAC;CACpC;CACA;CAEA,mBAA0B;;CAG1B,IAAW,YAAoB;EAC7B,OAAO,KAAK,UAAU;CACxB;CAEA,YAAY,SAAuB,YAAwB;EACzD,KAAK,cAAc;EACnB,KAAK,UAAU;CACjB;CAEA,IACE,KACA,UACA,iBAA0B,OAC1B,eAAwB,OACV;EACd,IAAI,IAAI,UACN,OAAO;EAET,KAAK,WAAW;EAChB,KAAK,iBAAiB;EACtB,KAAK,eAAe;EACpB,KAAK,MAAM;EACX,OAAO,KAAK,cAAc,GAAG;CAC/B;CAEA,QAAsB;EACpB,KAAK,SAAS,IAAI,aAAa;EAC/B,KAAK,UAAU,MAAM;EACrB,KAAK,gBAAgB,CAAC;EACtB,KAAK,mBAAmB;CAC1B;CAEA,UAAkB,MAAwB;EACxC,IAAI,KAAK,cAAc,SAAS,GAC9B,OAAO,KAAK,cAAc,KAAK,cAAc,SAAS;EAExD,OAAO;CACT;CAEA,QAAgB,MAAmB,MAAe,QAAyB;EACzE,MAAM,SAAS,KAAK,UAAU,IAAI;EAClC,KAAK,WAAW;GAAE;GAAM,MAAM,OAAO;GAAM,IAAI,OAAO;GAAI;EAAO,CAAC;EAClE,IAAI,KAAK,gBACP,cAAc,QAAQ,MAAM,MAAM;EAEpC,OAAO;CACT;CAEA,KAAa,MAAe,UAAkB,GAAY;EACxD,KAAK,oBAAoB;EACzB,IAAI,KAAK,mBAAmB,gBAAgB;GAC1C,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,OAAO,cAAc,CAAC,CAAC;GACxE,OAAO;EACT;EACA,OAAO;CACT;CAEA,gBAAwB,MAAe,OAAoB;EACzD,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,UACX,OAAO,KAAK,aAAa,MAAM,KAAK;GACtC,KAAK,QAAQ,eACX,OAAO,KAAK,aAAa,MAAM,KAAgB;GACjD,KAAK,QAAQ,aACX,OAAO,KAAK,gBAAgB,KAAK,SAAS,IAAI,KAAK;EACvD;CACF;CAEA,aAAqB,MAAe,OAAoB;EACtD,MAAM,QAAQ,YAAY,IAAI;EAC9B,KAAK,OAAO,SAAS,OAAO,KAAK;CACnC;CAEA,aAAqB,MAAe,OAAsB;EACxD,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,KAAK,gBAAgB,KAAK,SAAS,QAAQ,MAAM,QAAQ,EAAE;CAE/D;CAEA,cAAsB,MAA6B;EACjD,MAAM,OAAO,KAAK,aAAa,IAAI,IAAI;EACvC,IAAI,QAAuB;EAC3B,IAAI,KAAK,aAAa,CAAC,KAAK,cAAc;GACxC,QAAQ,KAAK,OAAO,qBAAqB,KAAK,KAAK;GACnD,IAAI,UAAU,MAAM;IAClB,MAAM,SAAS,KAAK,UAAU,OAAO,KAAK,eAAe,KAAK;IAC9D,IAAI,WAAW,QACb,OAAO;GAEX;EACF;EAEA,MAAM,SAAS,KAAK,kBAAkB,IAAI;EAC1C,IAAI,CAAC,KAAK,gBAAgB,WAAW,QAAQ,KAAK,aAAa,UAAU,MACvE,KAAK,UAAU,MAAM,KAAK,eAAe,OAAO,MAAM;EAExD,OAAO;CACT;CAEA,kBAA0B,MAA6B;EACrD,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,WACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,cACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ;GACb,KAAK,QAAQ,YACX,OAAO,KAAK,WAAW,IAAI;GAE7B,KAAK,QAAQ,aACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,mBACX,OAAO,KAAK,QAAQ,YAAY,iBAAiB,IAAI;GAEvD,KAAK,QAAQ,cACX,OAAO;GAET,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,UACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAE5B,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;GAE9B,KAAK,QAAQ,SACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,UACX,OAAO,KAAK,WAAW,IAAI;GAE7B,KAAK,QAAQ,gBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAE5B,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,OACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,SACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,qBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ,oBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ;GACb,KAAK,QAAQ,oBACX,OAAO,KAAK,eAAe,IAAI;GAEjC,KAAK,QAAQ,oBACX,OAAO,KAAK,QAAQ,YAAY,yBAAyB,IAAI;EACjE;EACA,OAAO;CACT;CAEA,WAAmB,MAAe,OAA6B;EAC7D,OAAO,KAAK,cAAc,KAAK,SAAS,MAAM;CAChD;CAEA,YAAoB,MAA6B;EAC/C,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,QAAQ,KAAK,QAAQ,IAAI,KAAK;EACpC,IAAI,UAAU,QACZ,OAAO,KAAK,QAAQ,YAAY,mBAAmB,MAAM,CAAC,KAAK,CAAC;EAElE,OAAO;CACT;CAEA,WAAmB,MAA6B;EAC9C,MAAM,QAAQ,YAAY,IAAI;EAC9B,OAAO,KAAK,OAAO,SAAS,KAAK;CACnC;CAEA,kBAA0B,MAA6B;EACrD,MAAM,WAAW,YAAY,KAAK,SAAS,EAAE;EAC7C,MAAM,MAAM,KAAK,YAAY,IAAI,QAAQ;EACzC,IAAI,CAAC,KACH,OAAO,KAAK,QAAQ,YAAY,mBAAmB,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC;EAEjF,IAAI,CAAC,KAAK,KAAK,MAAM,iBAAiB,GACpC,OAAO;EAGT,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,MAAM,KAAK,WAAW,MAAM,CAAC;GACnC,IAAI,QAAQ,MACV,OAAO;GAET,KAAK,KAAK,GAAG;EACf;EAEA,KAAK,OAAO,WAAW;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,KAAK,gBAAgB,IAAI,SAAS,EAAE,CAAC,SAAS,IAAI,KAAK,EAAE;EAE3D,KAAK,cAAc,KAAK,IAAI;EAC5B,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,WAAW,KAAK,CAAC;EACjC,UAAU;GACR,KAAK,cAAc,IAAI;EACzB;EACA,KAAK,OAAO,SAAS;EACrB,OAAO;CACT;CAEA,aAAqB,MAA6B;EAChD,MAAM,QAAQ,KAAK,KAAK,aAAa,WAAY,KAAK,KAAK,QAAmB,OAAO,KAAK,KAAK,KAAK;EACpG,OAAO,KAAK,MAAM,KAAK;CACzB;CAEA,gBAAwB,MAA6B;EACnD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,QAAQ,OAAO,MACxB,OAAO;EAET,MAAM,IAAI;EACV,MAAM,IAAI;EACV,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,MACX,OAAO,IAAI;GACb,KAAK,QAAQ,OACX,OAAO,IAAI;GACb,KAAK,QAAQ,UACX,OAAO,IAAI;EACf;EACA,OAAO;CACT;CAEA,UAAkB,MAA6B;EAC7C,MAAM,OAAO,KAAK,WAAW,MAAM,CAAC;EACpC,IAAI,SAAS,QAAQ,CAAC,MAAM,QAAQ,IAAI,GACtC,OAAO;EAET,OAAO,KAAK;CACd;CAEA,gBAAwB,MAA6B;EACnD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAET,MAAM,cAAc,KAAK,WAAW,QAAQ;EAC5C,IAAI,OAAO,WAAW,GACpB,OAAO,cAAA,IAAA;EAGT,MAAM,WAAW,KAAK,SAAS,EAAE,CAAC,WAAW,QAAQ,eAAe,KAAK,SAAS,EAAE,CAAC,WAAW,CAAC,KAAK,SAAS,EAAE;EACjH,MAAM,QAAQ,OAAO;EACrB,MAAM,YAAsB,CAAC;EAC7B,KAAK,MAAM,eAAe,UAAU;GAClC,UAAU,KAAK,CAAC;GAChB,KAAK,gBAAgB,aAAa,OAAO,EAAE;EAC7C;EACA,IAAI,kBAAkB;EACtB,OAAO,CAAC,iBAAiB;GACvB,MAAM,iBAAiB,KAAK,WAAW,MAAM,CAAC;GAC9C,IAAI,mBAAmB,MACrB,OAAO;GAET,IAAK,mBAAA,MAAmC,aACtC,OAAO,CAAC,cAAA,IAAA;GAEV,IAAI,iBAAiB,UAAU,SAAS;GACxC,OAAO,MACL,IAAI,UAAU,kBAAkB,QAAQ,GAAG;IACzC,UAAU,eAAe;IACzB,IAAI,CAAC,KAAK,KAAK,MAAM,mBAAmB,GACtC,OAAO;IAET,KAAK,gBAAgB,SAAS,iBAAiB,OAAO,UAAU,gBAAgB;IAChF,iBAAiB,UAAU,SAAS;IACpC;GACF,OAAO,IAAI,mBAAmB,GAAG;IAC/B,kBAAkB;IAClB;GACF,OAAO;IACL,UAAU,kBAAkB;IAC5B,KAAK,gBAAgB,SAAS,iBAAiB,OAAO,EAAE;IACxD;GACF;EAEJ;EACA,OAAO,cAAA,IAAA;CACT;CAEA,cAAsB,MAA6B;EACjD,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;EACrC,IAAI,UAAU,MACZ,OAAO;EAET,OAAQ,UAAA,IAAA,IAAA;CACV;CAEA,wBAAgC,IAAY,OAA8B;EACxE,IAAK,OAAO,QAAQ,aAAa,CAAC,SAAW,OAAO,QAAQ,YAAY,OACtE,OAAO,QAAA,IAAA;EAET,IAAI,OAAO,QAAQ,qBAAqB,CAAC,OACvC,OAAA;EAEF,OAAO;CACT;CAEA,iBAAyB,MAA6B;EACpD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,OAAA;EACX,MAAM,UAAU,KAAK,wBAAwB,KAAK,QAAQ,EAAE;EAC5D,IAAI,YAAY,MACd,OAAO;EAGT,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,OAAA;EACX,IAAI;EACJ,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;IACX,SAAS,MAAM;IACf;GACF,KAAK,QAAQ;IACX,SAAS,MAAM;IACf;GACF,KAAK,QAAQ;IACX,SAAS,CAAC,MAAM;IAChB;GACF,KAAK,QAAQ;IACX,SAAS,OAAO;IAChB;GACF,SACE,OAAO;EACX;EACA,OAAO,SAAA,IAAA;CACT;CAEA,YAAoB,MAA6B;EAC/C,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAGT,OADiB,QAAQ,IAAI,EAAE,MAAM,OAChB,KAAK,WAAW,QAAQ,YAAA,IAAA;CAC/C;CAEA,sBAA8B,MAA6B;EACzD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,IAAI;EACV,MAAM,IAAI;EACV,IAAI;EACJ,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;IACX,SAAS,IAAI;IACb;GACF,KAAK,QAAQ;IACX,SAAS,IAAI;IACb;GACF,KAAK,QAAQ;IACX,SAAS,KAAK;IACd;GACF,KAAK,QAAQ;IACX,SAAS,KAAK;IACd;GACF,SACE,OAAO;EACX;EACA,OAAO,SAAA,IAAA;CACT;CAEA,sBAA8B,MAA6B;EACzD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,IAAI;EACJ,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;IACX,SAAS,SAAS,IAAe,EAAE;IACnC;GACF,KAAK,QAAQ;IACX,SAAS,CAAC,SAAS,IAAe,EAAE;IACpC;GACF,KAAK,QAAQ;IACX,SAAS,QAAQ,IAAI,EAAE,MAAM,KAAK,aAAa,IAAe,EAAa;IAC3E;GACF,KAAK,QAAQ;IACX,SAAS,QAAQ,IAAI,EAAE,MAAM,KAAK,CAAC,aAAa,IAAe,EAAa;IAC5E;GACF,KAAK,QAAQ;IACX,SAAS,aAAa,IAAe,EAAa;IAClD;GACF,SACE,OAAO;EACX;EACA,OAAO,SAAA,IAAA;CACT;CAEA,YAAoB,MAA6B;EAC/C,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,YAAY,KAAK,WAAW,MAAM,CAAC;GACzC,IAAI,cAAc,MAChB,OAAO;GAET,IAAI,UAAU,WAAW,GACvB,OAAO;GAET,KAAK,KAAK,SAAS;EACrB;EACA,MAAM,SAAS,iBAAiB,IAAiB;EACjD,IAAI,WAAW,MAAM;GACnB,KAAK,QAAQ,YAAY,aAAa,MAAM,CAAC,OAAO,YAAY,CAAC,CAAC;GAClE,OAAO;EACT;EACA,OAAO;CACT;CAEA,aAAqB,MAA6B;EAChD,MAAM,OAAO,KAAK,WAAW,MAAM,CAAC;EACpC,IAAI,SAAS,MACX,OAAO;EAET,MAAM,SAAS,QAAQ,IAAI;EAC3B,IAAI,WAAW,MAAM;GACnB,KAAK,QAAQ,YAAY,kBAAkB,KAAK,SAAS,IAAI,CAAC,OAAA,EAAoB,CAAC,CAAC;GACpF,OAAO;EACT;EACA,OAAO;CACT;CAEA,WAAmB,MAA6B;EAC9C,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,YAAY,KAAK,WAAW,MAAM,CAAC;GACzC,IAAI,cAAc,MAChB,OAAO;GAET,KAAK,KAAK,SAAS;EACrB;EACA,OAAO,MAAM,IAAI;CACnB;CAEA,iBAAyB,MAA6B;EACpD,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,UAAU,KAAK,WAAW,MAAM,CAAC;GACvC,IAAI,YAAY,MACd,OAAO;GAET,KAAK,KAAK,OAAO;EACnB;EACA,OAAO,IAAI,IAAI;CACjB;CAEA,UAAkB,MAA6B;EAC7C,MAAM,UAAU,KAAK,WAAW,MAAM,CAAC;EACvC,IAAI,YAAY,MACd,OAAO;EAET,OAAO,CAAC,OAAO;CACjB;CAEA,YAAoB,MAA6B;EAC/C,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,GACpB,OAAO,KAAK,QAAQ,YAAY,mBAAmB,KAAK,SAAS,EAAE;EAErE,OAAO,OAAO;CAChB;CAEA,mBAA2B,MAA6B;EACtD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,WACX,OAAO,SAAS,IAAe,EAAa;GAC9C,KAAK,QAAQ,kBACX,OAAO,gBAAgB,IAAe,EAAa;GACrD,KAAK,QAAQ,WACX,OAAO,QAAQ,IAAe,EAAa;GAC7C,KAAK,QAAQ,qBACX,OAAO,WAAW,IAAe,EAAa;EAClD;EACA,OAAO;CACT;CAEA,gBAAwB,MAA6B;EACnD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAGT,OAAO,WAAW,QADF,eAAe,IACQ,CAAO;CAChD;CAEA,kBAA0B,MAA6B;EACrD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAGT,MAAM,aADU,eAAe,IACZ,CAAA,CAAQ,KAAI,MAAK,OAAO,EAAE;EAC7C,OAAO,WAAW,WAAW,IAAI,WAAW,KAAK,MAAM,UAAU;CACnE;CAEA,YAAoB,MAA6B;EAC/C,MAAM,UAAU,KAAK,SAAS,SAAS;EACvC,MAAM,SAAS,KAAK,WAAW,MAAM,OAAO;EAC5C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,GACpB,OAAO;EAGT,MAAM,UAAU,eAAe,IAAI;EAEnC,IADmB,QAAQ,WAAW,SACtB;GACd,MAAM,SAAkB,CAAC;GACzB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;IAChC,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;IACrC,IAAI,UAAU,MACZ,OAAO;IAET,IAAI,MAAM,WAAW,GACnB,OAAO;IAET,OAAO,KAAK,KAAK;GACnB;GACA,MAAM,SAAkB,CAAC;GACzB,KAAK,MAAM,WAAW,QAAQ;IAC5B,IAAI,QAAQ;IACZ,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;KACvC,MAAM,OAAO,QAAQ,QAAQ;KAC7B,MAAM,WAAW,OAAO;KACxB,IAAI,CAAC,SAAS,UAAU,IAAI,GAAG;MAC7B,QAAQ;MACR;KACF;IACF;IACA,IAAI,OACF,OAAO,KAAK,OAAO;GAEvB;GACA,OAAO;EACT,OAAO;GACL,MAAM,WAAW,KAAK,WAAW,MAAM,CAAC;GACxC,IAAI,aAAa,MACf,OAAO;GAET,IAAI,SAAS,WAAW,GACtB,OAAO;GAGT,MAAM,SAAkB,CAAC;GACzB,KAAK,MAAM,WAAW,QAAQ;IAC5B,MAAM,QAAQ,QAAQ,KAAI,MAAK,QAAQ,EAAE;IAEzC,IAAI,SAAS,UADO,MAAM,WAAW,IAAI,MAAM,KAAK,MAAM,KAAK,CAC7B,GAAG,OAAO,KAAK,OAAO;GAC1D;GACA,OAAO;EACT;CACF;CAEA,YAAoB,MAA6B;EAC/C,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAET,OAAO,OAAO,MAAmB;CACnC;CAEA,iBAAyB,MAA6B;EACpD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAGT,MAAM,WAAW,CAAC;EAClB,KAAK,MAAM,WAAW,QAAmB;GACvC,IAAI,CAAC,KAAK,KAAK,MAAM,oBAAoB,GACvC,OAAO;GAET,KAAK,gBAAgB,KAAK,SAAS,IAAI,OAAO;GAC9C,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;GACrC,IAAI,UAAU,MACZ,OAAO;GAET,IAAI,UAAA,GACF,SAAS,KAAK,OAAO;EAEzB;EACA,OAAO,SAAS,WAAW,IAAI,YAAY;CAC7C;CAEA,gBAAwB,MAA6B;EACnD,MAAM,SAAkB,CAAC;EACzB,MAAM,SAA2B,CAAC;EAElC,IAAI,eAAe;EAGnB,MAAM,wBAAiC;GACrC,OAAO,OAAO,SAAS,GAAG;IACxB,MAAM,MAAM,OAAO,OAAO,SAAS;IACnC,IAAI,IAAI,UAAU,IAAI,OAAO,SAAS,GAAG;KACvC,IAAI;KACJ,MAAM,YAAY,IAAI,OAAO,IAAI;KACjC,IAAI,CAAC,KAAK,KAAK,KAAK,SAAS,IAAI,UAAU,mBAAmB,GAC5D,OAAO;KAET,KAAK,gBAAgB,KAAK,SAAS,IAAI,QAAQ,CAAC,SAAS,IAAI,SAAS;KACtE,eAAe,IAAI,UAAU;KAC7B,OAAO;IACT;IACA,OAAO,IAAI;GACb;GACA,OAAO;EACT;EAEA,OAAO,MAAM;GAEX,IAAI,gBAAgB,KAAK,SAAS,QAAQ;IACxC,MAAM,UAAU,KAAK,WAAW,MAAM,CAAC;IACvC,IAAI,YAAY,MACd,OAAO;IAET,OAAO,KAAK,OAAO;IACnB,IAAI,CAAC,gBAAgB,GACnB;IAEF;GACF;GAGA,MAAM,QAAQ,KAAK,SAAS;GAC5B,IAAI,MAAM,WAAW,QAAQ,SAAS;IACpC,MAAM,SAAS,KAAK,WAAW,OAAO,CAAC;IACvC,IAAI,WAAW,MACb,OAAO;IAET,IAAI,OAAO,WAAW,GAAG;KACvB,IAAI,CAAC,gBAAgB,GACnB;KAEF;IACF;IACA,IAAI,CAAC,KAAK,KAAK,OAAO,mBAAmB,GACvC,OAAO;IAET,OAAO,KAAK;KACV,SAAS;KACT;KACA,SAAS;IACX,CAAC;IACD,KAAK,gBAAgB,MAAM,SAAS,IAAI,OAAO,EAAE;IACjD;IACA;GACF;GAGA,MAAM,QAAQ,KAAK,cAAc,KAAK;GACtC,IAAI,UAAU,MACZ,OAAO;GAET,IAAI,UAAA,GAAuB;IACzB,IAAI,CAAC,gBAAgB,GACnB;IAEF;GACF;GACA;EACF;EACA,OAAO,IAAI,MAAM;CACnB;CAEA,YAAoB,MAA6B;EAC/C,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;EACrC,IAAI,UAAU,MACZ,OAAO;EAET,KAAK,gBAAgB,KAAK,SAAS,IAAI,KAAK;EAC5C,OAAA;CACF;CAEA,eAAuB,MAA6B;EAClD,MAAM,eAAe,KAAK,WAAW,MAAM,CAAC;EAC5C,IAAI,iBAAiB,MACnB,OAAO;EAET,MAAM,YAAY,KAAK,WAAW,QAAQ,oBAAoB,IAAI;EAClE,IAAI,UAAiB;EACrB,OAAO,MAAM;GACX,IAAI,CAAC,KAAK,KAAK,MAAM,kBAAkB,GACrC,OAAO;GAGT,KAAK,gBAAgB,KAAK,SAAS,IAAI,OAAO;GAC9C,IAAI,KAAK,WAAW,QAAQ,mBAAmB;IAC7C,MAAM,OAAO,KAAK,WAAW,MAAM,CAAC;IACpC,IAAI,SAAS,MACX,OAAO;IAET,IAAI,SAAA,GACF;GAEJ;GAEA,MAAM,OAAO,KAAK,WAAW,MAAM,SAAS;GAC5C,IAAI,SAAS,MACX,OAAO;GAET,IAAI,QAAQ,SAAS,IAAI,MAAM,GAC7B;GAEF,UAAU;EACZ;EAEA,OAAO;CACT;AACF;;AAiBA,IAAM,eAAN,MAAmB;CACjB,gBAAwB;CACxB,uBAAe,IAAI,IAA0B;CAC7C,YAAiD,CAAC;CAElD,aAAmB;EACjB,KAAK,UAAU,KAAK,KAAK,IAAI;EAC7B,KAAK,uBAAO,IAAI,IAAI;CACtB;CAEA,WAAiB;EACf,KAAK,OAAO,KAAK,UAAU,IAAI;CACjC;CAEA,SAAS,OAAe,OAAoB;EAC1C,MAAM,WAAW,KAAK,KAAK,IAAI,KAAK;EACpC,IAAI,UAAU;GACZ,SAAS,QAAQ;GACjB,SAAS;EACX,OACE,KAAK,KAAK,IAAI,OAAO;GAAE,IAAI,KAAK;GAAiB,SAAS;GAAG;EAAM,CAAC;CAExE;CAEA,SAAS,OAAsB;EAC7B,MAAM,UAAU,KAAK,KAAK,IAAI,KAAK;EACnC,IAAI,YAAY,QACd,MAAM,IAAI,MAAM,mBAAmB,MAAM,YAAY;EAEvD,OAAO,QAAQ;CACjB;CAEA,qBAAqB,OAA2C;EAC9D,IAAI,MAAM,SAAS,GACjB,OAAO;EAET,MAAM,QAAkB,CAAC;EACzB,KAAK,MAAM,SAAS,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,GAAG;GACrC,MAAM,UAAU,KAAK,KAAK,IAAI,KAAK;GACnC,IAAI,YAAY,QACd,OAAO;GAET,MAAM,KAAK,GAAG,QAAQ,GAAG,GAAG,QAAQ,SAAS;EAC/C;EACA,OAAO,MAAM,KAAK,GAAG;CACvB;AACF"}
+{"version":3,"file":"evaluator.js","names":[],"sources":["../../../src/rslang/eval/evaluator.ts"],"sourcesContent":["/**\n * Module: AST evaluation - visitor-pattern evaluator for RS expressions.\n */\n\nimport { type AstNode, getNodeIndices, getNodeText } from '../../parsing';\nimport { annotateError } from '../ast-annotations';\nimport { type ErrorReporter, RSErrorCode } from '../error';\nimport { TokenID } from '../parser/token';\n\nimport { EvaluationCache, EvaluationMetadata } from './evaluation-cache';\nimport {\n  BOOL_INFINITY,\n  CalcInvalidDataError,\n  compare,\n  EmptySetV,\n  set,\n  SET_INFINITY,\n  tuple,\n  type Value,\n  VALUE_FALSE,\n  VALUE_TRUE,\n  type ValueContext\n} from './value';\nimport {\n  boolean,\n  cartesianProduct,\n  contains,\n  isSubsetOrEq,\n  projection,\n  reduce,\n  setDiff,\n  setIntersection,\n  setSymDiff,\n  setUnion\n} from './value-api';\n\n/** Maximum iterations to prevent infinite loops (recursion, quantifiers, etc.). */\nconst MAX_ITERATIONS = 1_000_000;\n\nconst TICK_PER_FUNCTION = 3;\nconst TICK_PER_RECURSION = 3;\nconst TICK_PER_IMPERATIVE = 1;\nconst TICK_PER_DECLARATIVE = 1;\nconst TICK_PER_QUANTIFIER = 1;\n\n/** AST context. */\nexport type ASTContext = Map<string, AstNode>;\n\n/** AST calculator - evaluates RS expressions via visitor pattern and provides updates via listeners.\n * Not safe for concurrent {@link run} calls on the same instance; use separate evaluators instead. */\nexport class Evaluator {\n  private reporter?: ErrorReporter;\n  private annotateErrors = false;\n  private disableCache = false;\n  private locals: LocalContext = new LocalContext();\n  private nodeMetadata: EvaluationMetadata = new EvaluationMetadata();\n  private evalCache: EvaluationCache = new EvaluationCache();\n  private callSiteStack: AstNode[] = [];\n  private context: ValueContext;\n  private treeContext: ASTContext;\n\n  public iterationCounter = 0;\n\n  /** Cache hits in the current evaluation run (for tests/diagnostics). */\n  public get cacheHits(): number {\n    return this.evalCache.hits;\n  }\n\n  constructor(context: ValueContext, astContext: ASTContext) {\n    this.treeContext = astContext;\n    this.context = context;\n  }\n\n  public run(\n    ast: AstNode,\n    reporter?: ErrorReporter,\n    annotateErrors: boolean = false,\n    disableCache: boolean = false\n  ): Value | null {\n    if (ast.hasError) {\n      return null;\n    }\n    this.reporter = reporter;\n    this.annotateErrors = annotateErrors;\n    this.disableCache = disableCache;\n    this.clear();\n    return this.dispatchVisit(ast);\n  }\n\n  private clear(): void {\n    this.locals = new LocalContext();\n    this.evalCache.clear();\n    this.callSiteStack = [];\n    this.iterationCounter = 0;\n  }\n\n  private errorNode(node: AstNode): AstNode {\n    if (this.callSiteStack.length > 0) {\n      return this.callSiteStack[this.callSiteStack.length - 1];\n    }\n    return node;\n  }\n\n  private onError(code: RSErrorCode, node: AstNode, params?: string[]): null {\n    const target = this.errorNode(node);\n    this.reporter?.({ code, from: target.from, to: target.to, params });\n    if (this.annotateErrors) {\n      annotateError(target, code, params);\n    }\n    return null;\n  }\n\n  private tick(node: AstNode, counter: number = 1): boolean {\n    this.iterationCounter += counter;\n    if (this.iterationCounter > MAX_ITERATIONS) {\n      this.onError(RSErrorCode.iterationsLimit, node, [String(MAX_ITERATIONS)]);\n      return false;\n    }\n    return true;\n  }\n\n  private dispatchDeclare(node: AstNode, value: Value): void {\n    switch (node.typeID) {\n      case TokenID.ID_LOCAL:\n        return this.declareLocal(node, value);\n      case TokenID.NT_TUPLE_DECL:\n        return this.declareTuple(node, value as Value[]);\n      case TokenID.NT_ARG_DECL:\n        return this.dispatchDeclare(node.children[0], value);\n    }\n  }\n\n  private declareLocal(node: AstNode, value: Value): void {\n    const alias = getNodeText(node);\n    this.locals.setLocal(alias, value);\n  }\n\n  private declareTuple(node: AstNode, value: Value[]): void {\n    for (let child = 0; child < node.children.length; child++) {\n      this.dispatchDeclare(node.children[child], value[child + 1]);\n    }\n  }\n\n  private dispatchVisit(node: AstNode): Value | null {\n    const info = this.nodeMetadata.get(node);\n    let stamp: string | null = null;\n    if (info.cacheable && !this.disableCache) {\n      stamp = this.locals.buildDependencyStamp(info.reads);\n      if (stamp !== null) {\n        const cached = this.evalCache.lookup(info.structuralKey, stamp);\n        if (cached !== undefined) {\n          return cached;\n        }\n      }\n    }\n\n    try {\n      const result = this.dispatchVisitImpl(node);\n      if (!this.disableCache && result !== null && info.cacheable && stamp !== null) {\n        this.evalCache.store(info.structuralKey, stamp, result);\n      }\n      return result;\n    } catch (error) {\n      if (error instanceof CalcInvalidDataError) {\n        return this.onError(RSErrorCode.calcInvalidData, node, [error.left, error.right]);\n      }\n      this.onError(RSErrorCode.calcUnknownError, node);\n      return null;\n    }\n  }\n\n  private dispatchVisitImpl(node: AstNode): Value | null {\n    switch (node.typeID) {\n      case TokenID.ID_GLOBAL:\n        return this.visitGlobal(node);\n\n      case TokenID.NT_FUNC_CALL:\n        return this.visitFunctionCall(node);\n\n      case TokenID.ID_LOCAL:\n      case TokenID.ID_RADICAL:\n        return this.visitLocal(node);\n\n      case TokenID.LIT_INTEGER:\n        return this.visitInteger(node);\n\n      case TokenID.LIT_WHOLE_NUMBERS:\n        return this.onError(RSErrorCode.iterateInfinity, node);\n\n      case TokenID.LIT_EMPTYSET:\n        return EmptySetV;\n\n      case TokenID.PLUS:\n      case TokenID.MINUS:\n      case TokenID.MULTIPLY:\n        return this.visitArithmetic(node);\n\n      case TokenID.CARD:\n        return this.visitCard(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\n      case TokenID.BOOLEAN:\n        return this.visitBoolean(node);\n\n      case TokenID.NT_TUPLE:\n        return this.visitTuple(node);\n\n      case TokenID.NT_ENUMERATION:\n        return this.visitEnumeration(node);\n\n      case TokenID.BOOL:\n        return this.visitBool(node);\n\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.BIGPR:\n        return this.visitProjectSet(node);\n\n      case TokenID.SMALLPR:\n        return this.visitProjectTuple(node);\n\n      case TokenID.FILTER:\n        return this.visitFilter(node);\n\n      case TokenID.REDUCE:\n        return this.visitReduce(node);\n\n      case TokenID.NT_DECLARATIVE_EXPR:\n        return this.visitDeclarative(node);\n\n      case TokenID.NT_IMPERATIVE_EXPR:\n        return this.visitImperative(node);\n\n      case TokenID.ASSIGN:\n        return this.visitAssign(node);\n\n      case TokenID.NT_RECURSIVE_FULL:\n      case TokenID.NT_RECURSIVE_SHORT:\n        return this.visitRecursion(node);\n\n      case TokenID.NT_FUNC_DEFINITION:\n        return this.onError(RSErrorCode.calculationNotSupported, node);\n    }\n    return null;\n  }\n\n  private visitChild(node: AstNode, index: number): Value | null {\n    return this.dispatchVisit(node.children[index]);\n  }\n\n  private visitGlobal(node: AstNode): Value | null {\n    const alias = getNodeText(node);\n    const value = this.context.get(alias) ?? null;\n    if (value === null) {\n      return this.onError(RSErrorCode.calcGlobalMissing, node, [alias]);\n    }\n    return value;\n  }\n\n  private visitLocal(node: AstNode): Value | null {\n    const alias = getNodeText(node);\n    const value = this.locals.findLocal(alias);\n    if (value === null) {\n      return this.onError(RSErrorCode.localUndeclared, node, [alias]);\n    }\n    return value;\n  }\n\n  private visitFunctionCall(node: AstNode): Value | null {\n    const funcName = getNodeText(node.children[0]);\n    const ast = this.treeContext.get(funcName);\n    if (!ast) {\n      return this.onError(RSErrorCode.calcGlobalMissing, node.children[0], [funcName]);\n    }\n    if (!this.tick(node, TICK_PER_FUNCTION)) {\n      return null;\n    }\n\n    const args: Value[] = [];\n    for (let i = 1; i < node.children.length; i++) {\n      const arg = this.visitChild(node, i);\n      if (arg === null) {\n        return null;\n      }\n      args.push(arg);\n    }\n\n    this.locals.startScope();\n    for (let i = 0; i < args.length; i++) {\n      this.dispatchDeclare(ast.children[0].children[i], args[i]);\n    }\n    this.callSiteStack.push(node);\n    let result: Value | null;\n    try {\n      result = this.visitChild(ast, 1);\n    } finally {\n      this.callSiteStack.pop();\n    }\n    this.locals.endScope();\n    return result;\n  }\n\n  private visitInteger(node: AstNode): Value | null {\n    const value = node.data.dataType === 'number' ? (node.data.value as number) : Number(node.data.value);\n    return Math.floor(value);\n  }\n\n  private visitArithmetic(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    const v2 = this.visitChild(node, 1);\n    if (v1 === null || v2 === null) {\n      return null;\n    }\n    const a = v1 as number;\n    const b = v2 as number;\n    switch (node.typeID) {\n      case TokenID.PLUS:\n        return a + b;\n      case TokenID.MINUS:\n        return a - b;\n      case TokenID.MULTIPLY:\n        return a * b;\n    }\n    return null;\n  }\n\n  private visitCard(node: AstNode): Value | null {\n    const base = this.visitChild(node, 0);\n    if (base === null || !Array.isArray(base)) {\n      return null;\n    }\n    return base.length;\n  }\n\n  private visitQuantifier(node: AstNode): Value | null {\n    const domain = this.visitChild(node, 1) as Value[];\n    if (domain === null) {\n      return null;\n    }\n    const isUniversal = node.typeID === TokenID.QUANTOR_UNIVERSAL;\n    if (domain.length === 0) {\n      return isUniversal ? VALUE_TRUE : VALUE_FALSE;\n    }\n\n    const varNodes = node.children[0].typeID === TokenID.NT_ENUM_DECL ? node.children[0].children : [node.children[0]];\n    const count = domain.length;\n    const iterators: number[] = [];\n    for (const declaration of varNodes) {\n      iterators.push(0);\n      this.dispatchDeclare(declaration, domain[0]);\n    }\n    let finishIteration = false;\n    while (!finishIteration) {\n      const iterationValue = this.visitChild(node, 2);\n      if (iterationValue === null) {\n        return null;\n      }\n      if ((iterationValue === VALUE_TRUE) !== isUniversal) {\n        return !isUniversal ? VALUE_TRUE : VALUE_FALSE;\n      }\n      let incrementIndex = iterators.length - 1;\n      while (true) {\n        if (iterators[incrementIndex] < count - 1) {\n          iterators[incrementIndex]++;\n          if (!this.tick(node, TICK_PER_QUANTIFIER)) {\n            return null;\n          }\n          this.dispatchDeclare(varNodes[incrementIndex], domain[iterators[incrementIndex]]);\n          incrementIndex = iterators.length - 1;\n          break;\n        } else if (incrementIndex === 0) {\n          finishIteration = true;\n          break;\n        } else {\n          iterators[incrementIndex] = 0;\n          this.dispatchDeclare(varNodes[incrementIndex], domain[0]);\n          incrementIndex--;\n        }\n      }\n    }\n    return isUniversal ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitNegation(node: AstNode): Value | null {\n    const value = this.visitChild(node, 0);\n    if (value === null) {\n      return null;\n    }\n    return (value as number) === VALUE_TRUE ? VALUE_FALSE : VALUE_TRUE;\n  }\n\n  private tryEvaluateFromFirstArg(op: number, first: boolean): Value | null {\n    if ((op === TokenID.LOGIC_AND && !first) || (op === TokenID.LOGIC_OR && first)) {\n      return first ? VALUE_TRUE : VALUE_FALSE;\n    }\n    if (op === TokenID.LOGIC_IMPLICATION && !first) {\n      return VALUE_TRUE;\n    }\n    return null;\n  }\n\n  private visitLogicBinary(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const b1 = v1 === VALUE_TRUE;\n    const attempt = this.tryEvaluateFromFirstArg(node.typeID, b1);\n    if (attempt !== null) {\n      return attempt;\n    }\n\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    const b2 = v2 === VALUE_TRUE;\n    let result: boolean;\n    switch (node.typeID) {\n      case TokenID.LOGIC_AND:\n        result = b1 && b2;\n        break;\n      case TokenID.LOGIC_OR:\n        result = b1 || b2;\n        break;\n      case TokenID.LOGIC_IMPLICATION:\n        result = !b1 || b2;\n        break;\n      case TokenID.LOGIC_EQUIVALENT:\n        result = b1 === b2;\n        break;\n      default:\n        return null;\n    }\n    return result ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitEquals(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    const areEqual = compare(v1, v2) === 0;\n    return areEqual === (node.typeID !== TokenID.NOTEQUAL) ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitIntegerPredicate(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    const a = v1 as number;\n    const b = v2 as number;\n    let result: boolean;\n    switch (node.typeID) {\n      case TokenID.GREATER:\n        result = a > b;\n        break;\n      case TokenID.LESSER:\n        result = a < b;\n        break;\n      case TokenID.GREATER_OR_EQ:\n        result = a >= b;\n        break;\n      case TokenID.LESSER_OR_EQ:\n        result = a <= b;\n        break;\n      default:\n        return null;\n    }\n    return result ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitSetexprPredicate(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    let result: boolean;\n    switch (node.typeID) {\n      case TokenID.SET_IN:\n        result = contains(v2 as Value[], v1);\n        break;\n      case TokenID.SET_NOT_IN:\n        result = !contains(v2 as Value[], v1);\n        break;\n      case TokenID.SUBSET:\n        result = compare(v1, v2) !== 0 && isSubsetOrEq(v1 as Value[], v2 as Value[]);\n        break;\n      case TokenID.NOT_SUBSET:\n        result = compare(v1, v2) === 0 || !isSubsetOrEq(v1 as Value[], v2 as Value[]);\n        break;\n      case TokenID.SUBSET_OR_EQ:\n        result = isSubsetOrEq(v1 as Value[], v2 as Value[]);\n        break;\n      default:\n        return null;\n    }\n    return result ? VALUE_TRUE : VALUE_FALSE;\n  }\n\n  private visitDecart(node: AstNode): Value | null {\n    const args: Value[] = [];\n    for (let i = 0; i < node.children.length; i++) {\n      const component = this.visitChild(node, i) as Value[];\n      if (component === null) {\n        return null;\n      }\n      if (component.length === 0) {\n        return EmptySetV;\n      }\n      args.push(component);\n    }\n    const result = cartesianProduct(args as Value[][]);\n    if (result === null) {\n      this.onError(RSErrorCode.setOverflow, node, [String(SET_INFINITY)]);\n      return null;\n    }\n    return result;\n  }\n\n  private visitBoolean(node: AstNode): Value | null {\n    const base = this.visitChild(node, 0) as Value[];\n    if (base === null) {\n      return null;\n    }\n    const result = boolean(base);\n    if (result === null) {\n      this.onError(RSErrorCode.booleanBaseLimit, node.children[0], [String(BOOL_INFINITY)]);\n      return null;\n    }\n    return result;\n  }\n\n  private visitTuple(node: AstNode): Value | null {\n    const args: Value[] = [];\n    for (let i = 0; i < node.children.length; i++) {\n      const component = this.visitChild(node, i);\n      if (component === null) {\n        return null;\n      }\n      args.push(component);\n    }\n    return tuple(args);\n  }\n\n  private visitEnumeration(node: AstNode): Value | null {\n    const args: Value[] = [];\n    for (let i = 0; i < node.children.length; i++) {\n      const element = this.visitChild(node, i);\n      if (element === null) {\n        return null;\n      }\n      args.push(element);\n    }\n    return set(args);\n  }\n\n  private visitBool(node: AstNode): Value | null {\n    const element = this.visitChild(node, 0);\n    if (element === null) {\n      return null;\n    }\n    return [element];\n  }\n\n  private visitDebool(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0) as Value[];\n    if (target === null) {\n      return null;\n    }\n    if (target.length !== 1) {\n      return this.onError(RSErrorCode.calcInvalidDebool, node.children[0]);\n    }\n    return target[0];\n  }\n\n  private visitSetexprBinary(node: AstNode): Value | null {\n    const v1 = this.visitChild(node, 0);\n    if (v1 === null) {\n      return null;\n    }\n    const v2 = this.visitChild(node, 1);\n    if (v2 === null) {\n      return null;\n    }\n    switch (node.typeID) {\n      case TokenID.SET_UNION:\n        return setUnion(v1 as Value[], v2 as Value[]);\n      case TokenID.SET_INTERSECTION:\n        return setIntersection(v1 as Value[], v2 as Value[]);\n      case TokenID.SET_MINUS:\n        return setDiff(v1 as Value[], v2 as Value[]);\n      case TokenID.SET_SYMMETRIC_MINUS:\n        return setSymDiff(v1 as Value[], v2 as Value[]);\n    }\n    return null;\n  }\n\n  private visitProjectSet(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0);\n    if (target === null) {\n      return null;\n    }\n    const indices = getNodeIndices(node);\n    return projection(target as Value[][], indices);\n  }\n\n  private visitProjectTuple(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0) as Value[];\n    if (target === null) {\n      return null;\n    }\n    const indices = getNodeIndices(node);\n    const components = indices.map(i => target[i]);\n    return components.length === 1 ? components[0] : tuple(components);\n  }\n\n  private visitFilter(node: AstNode): Value | null {\n    const lastIdx = node.children.length - 1;\n    const argVal = this.visitChild(node, lastIdx) as Value[][];\n    if (argVal === null) {\n      return null;\n    }\n    if (argVal.length === 0) {\n      return EmptySetV;\n    }\n\n    const indices = getNodeIndices(node);\n    const tupleParam = indices.length === lastIdx;\n    if (tupleParam) {\n      const params: Value[] = [];\n      for (let i = 0; i < lastIdx; i++) {\n        const param = this.visitChild(node, i) as Value[];\n        if (param === null) {\n          return null;\n        }\n        if (param.length === 0) {\n          return EmptySetV;\n        }\n        params.push(param);\n      }\n      const result: Value[] = [];\n      for (const element of argVal) {\n        let valid = true;\n        for (let j = 0; j < indices.length; j++) {\n          const comp = element[indices[j]];\n          const paramSet = params[j] as Value[];\n          if (!contains(paramSet, comp)) {\n            valid = false;\n            break;\n          }\n        }\n        if (valid) {\n          result.push(element);\n        }\n      }\n      return result;\n    } else {\n      const paramVal = this.visitChild(node, 0) as Value[];\n      if (paramVal === null) {\n        return null;\n      }\n      if (paramVal.length === 0) {\n        return EmptySetV;\n      }\n\n      const result: Value[] = [];\n      for (const element of argVal) {\n        const comps = indices.map(i => element[i]);\n        const testElement = comps.length === 1 ? comps[0] : tuple(comps);\n        if (contains(paramVal, testElement)) result.push(element);\n      }\n      return result;\n    }\n  }\n\n  private visitReduce(node: AstNode): Value | null {\n    const target = this.visitChild(node, 0);\n    if (target === null) {\n      return null;\n    }\n    return reduce(target as Value[][]);\n  }\n\n  private visitDeclarative(node: AstNode): Value | null {\n    const domain = this.visitChild(node, 1);\n    if (domain === null) {\n      return null;\n    }\n\n    const elements = [];\n    for (const element of domain as Value[]) {\n      if (!this.tick(node, TICK_PER_DECLARATIVE)) {\n        return null;\n      }\n      this.dispatchDeclare(node.children[0], element);\n      const value = this.visitChild(node, 2);\n      if (value === null) {\n        return null;\n      }\n      if (value === VALUE_TRUE) {\n        elements.push(element);\n      }\n    }\n    return elements.length === 0 ? EmptySetV : elements;\n  }\n\n  private visitImperative(node: AstNode): Value | null {\n    const result: Value[] = [];\n    const frames: IterationFrame[] = [];\n\n    let currentChild = 1;\n\n    // Advance to next iteration\n    const advanceIterator = (): boolean => {\n      while (frames.length > 0) {\n        const top = frames[frames.length - 1];\n        if (top.valueID < top.domain.length - 1) {\n          top.valueID++;\n          const nextValue = top.domain[top.valueID];\n          if (!this.tick(node.children[top.childID], TICK_PER_IMPERATIVE)) {\n            return false;\n          }\n          this.dispatchDeclare(node.children[top.childID].children[0], nextValue);\n          currentChild = top.childID + 1;\n          return true;\n        }\n        frames.pop();\n      }\n      return false;\n    };\n\n    while (true) {\n      // Iteration end - create element and pop up stack\n      if (currentChild >= node.children.length) {\n        const element = this.visitChild(node, 0);\n        if (element === null) {\n          return null;\n        }\n        result.push(element);\n        if (!advanceIterator()) {\n          break;\n        }\n        continue;\n      }\n\n      // Iteration node\n      const child = node.children[currentChild];\n      if (child.typeID === TokenID.ITERATE) {\n        const domain = this.visitChild(child, 1) as Value[];\n        if (domain === null) {\n          return null;\n        }\n        if (domain.length === 0) {\n          if (!advanceIterator()) {\n            break;\n          }\n          continue;\n        }\n        if (!this.tick(child, TICK_PER_IMPERATIVE)) {\n          return null;\n        }\n        frames.push({\n          childID: currentChild,\n          domain,\n          valueID: 0\n        });\n        this.dispatchDeclare(child.children[0], domain[0]);\n        currentChild++;\n        continue;\n      }\n\n      // Guard expression\n      const value = this.dispatchVisit(child);\n      if (value === null) {\n        return null;\n      }\n      if (value === VALUE_FALSE) {\n        if (!advanceIterator()) {\n          break;\n        }\n        continue;\n      }\n      currentChild++;\n    }\n    return set(result);\n  }\n\n  private visitAssign(node: AstNode): Value | null {\n    const value = this.visitChild(node, 1);\n    if (value === null) {\n      return null;\n    }\n    this.dispatchDeclare(node.children[0], value);\n    return VALUE_TRUE;\n  }\n\n  private visitRecursion(node: AstNode): Value | null {\n    const initialValue = this.visitChild(node, 1);\n    if (initialValue === null) {\n      return null;\n    }\n    const bodyIndex = node.typeID === TokenID.NT_RECURSIVE_FULL ? 3 : 2;\n    let current: Value = initialValue;\n    while (true) {\n      if (!this.tick(node, TICK_PER_RECURSION)) {\n        return null;\n      }\n\n      this.dispatchDeclare(node.children[0], current);\n      if (node.typeID === TokenID.NT_RECURSIVE_FULL) {\n        const pred = this.visitChild(node, 2);\n        if (pred === null) {\n          return null;\n        }\n        if (pred !== VALUE_TRUE) {\n          break;\n        }\n      }\n\n      const next = this.visitChild(node, bodyIndex);\n      if (next === null) {\n        return null;\n      }\n      if (compare(current, next) === 0) {\n        break;\n      }\n      current = next;\n    }\n\n    return current;\n  }\n}\n\n/** Imperative iteration block data. */\ninterface IterationFrame {\n  childID: number;\n  domain: Value[];\n  valueID: number;\n}\n\n/** Local variable binding with version for cache invalidation. */\ninterface LocalBinding {\n  id: number;\n  version: number;\n  value: Value;\n}\n\n/** Local variables context. */\nclass LocalContext {\n  private nextBindingId = 1;\n  private data = new Map<string, LocalBinding>();\n  private callStack: Map<string, LocalBinding>[] = [];\n\n  startScope(): void {\n    this.callStack.push(this.data);\n    this.data = new Map();\n  }\n\n  endScope(): void {\n    this.data = this.callStack.pop()!;\n  }\n\n  setLocal(alias: string, value: Value): void {\n    const existing = this.data.get(alias);\n    if (existing) {\n      existing.value = value;\n      existing.version++;\n    } else {\n      this.data.set(alias, { id: this.nextBindingId++, version: 0, value });\n    }\n  }\n\n  findLocal(alias: string): Value | null {\n    return this.data.get(alias)?.value ?? null;\n  }\n\n  buildDependencyStamp(reads: ReadonlySet<string>): string | null {\n    if (reads.size === 0) {\n      return '';\n    }\n    const parts: string[] = [];\n    for (const alias of [...reads].sort()) {\n      const binding = this.data.get(alias);\n      if (binding === undefined) {\n        return null;\n      }\n      parts.push(`${binding.id}:${binding.version}`);\n    }\n    return parts.join('|');\n  }\n}\n"],"mappings":";;;;;;;;;;;;AAqCA,MAAM,iBAAiB;AAEvB,MAAM,oBAAoB;AAC1B,MAAM,qBAAqB;AAC3B,MAAM,sBAAsB;AAC5B,MAAM,uBAAuB;AAC7B,MAAM,sBAAsB;;;AAO5B,IAAa,YAAb,MAAuB;CACrB;CACA,iBAAyB;CACzB,eAAuB;CACvB,SAA+B,IAAI,aAAa;CAChD,eAA2C,IAAI,mBAAmB;CAClE,YAAqC,IAAI,gBAAgB;CACzD,gBAAmC,CAAC;CACpC;CACA;CAEA,mBAA0B;;CAG1B,IAAW,YAAoB;EAC7B,OAAO,KAAK,UAAU;CACxB;CAEA,YAAY,SAAuB,YAAwB;EACzD,KAAK,cAAc;EACnB,KAAK,UAAU;CACjB;CAEA,IACE,KACA,UACA,iBAA0B,OAC1B,eAAwB,OACV;EACd,IAAI,IAAI,UACN,OAAO;EAET,KAAK,WAAW;EAChB,KAAK,iBAAiB;EACtB,KAAK,eAAe;EACpB,KAAK,MAAM;EACX,OAAO,KAAK,cAAc,GAAG;CAC/B;CAEA,QAAsB;EACpB,KAAK,SAAS,IAAI,aAAa;EAC/B,KAAK,UAAU,MAAM;EACrB,KAAK,gBAAgB,CAAC;EACtB,KAAK,mBAAmB;CAC1B;CAEA,UAAkB,MAAwB;EACxC,IAAI,KAAK,cAAc,SAAS,GAC9B,OAAO,KAAK,cAAc,KAAK,cAAc,SAAS;EAExD,OAAO;CACT;CAEA,QAAgB,MAAmB,MAAe,QAAyB;EACzE,MAAM,SAAS,KAAK,UAAU,IAAI;EAClC,KAAK,WAAW;GAAE;GAAM,MAAM,OAAO;GAAM,IAAI,OAAO;GAAI;EAAO,CAAC;EAClE,IAAI,KAAK,gBACP,cAAc,QAAQ,MAAM,MAAM;EAEpC,OAAO;CACT;CAEA,KAAa,MAAe,UAAkB,GAAY;EACxD,KAAK,oBAAoB;EACzB,IAAI,KAAK,mBAAmB,gBAAgB;GAC1C,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,OAAO,cAAc,CAAC,CAAC;GACxE,OAAO;EACT;EACA,OAAO;CACT;CAEA,gBAAwB,MAAe,OAAoB;EACzD,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,UACX,OAAO,KAAK,aAAa,MAAM,KAAK;GACtC,KAAK,QAAQ,eACX,OAAO,KAAK,aAAa,MAAM,KAAgB;GACjD,KAAK,QAAQ,aACX,OAAO,KAAK,gBAAgB,KAAK,SAAS,IAAI,KAAK;EACvD;CACF;CAEA,aAAqB,MAAe,OAAoB;EACtD,MAAM,QAAQ,YAAY,IAAI;EAC9B,KAAK,OAAO,SAAS,OAAO,KAAK;CACnC;CAEA,aAAqB,MAAe,OAAsB;EACxD,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS,QAAQ,SAChD,KAAK,gBAAgB,KAAK,SAAS,QAAQ,MAAM,QAAQ,EAAE;CAE/D;CAEA,cAAsB,MAA6B;EACjD,MAAM,OAAO,KAAK,aAAa,IAAI,IAAI;EACvC,IAAI,QAAuB;EAC3B,IAAI,KAAK,aAAa,CAAC,KAAK,cAAc;GACxC,QAAQ,KAAK,OAAO,qBAAqB,KAAK,KAAK;GACnD,IAAI,UAAU,MAAM;IAClB,MAAM,SAAS,KAAK,UAAU,OAAO,KAAK,eAAe,KAAK;IAC9D,IAAI,WAAW,QACb,OAAO;GAEX;EACF;EAEA,IAAI;GACF,MAAM,SAAS,KAAK,kBAAkB,IAAI;GAC1C,IAAI,CAAC,KAAK,gBAAgB,WAAW,QAAQ,KAAK,aAAa,UAAU,MACvE,KAAK,UAAU,MAAM,KAAK,eAAe,OAAO,MAAM;GAExD,OAAO;EACT,SAAS,OAAO;GACd,IAAI,iBAAiB,sBACnB,OAAO,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,MAAM,MAAM,MAAM,KAAK,CAAC;GAElF,KAAK,QAAQ,YAAY,kBAAkB,IAAI;GAC/C,OAAO;EACT;CACF;CAEA,kBAA0B,MAA6B;EACrD,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,WACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,cACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ;GACb,KAAK,QAAQ,YACX,OAAO,KAAK,WAAW,IAAI;GAE7B,KAAK,QAAQ,aACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,mBACX,OAAO,KAAK,QAAQ,YAAY,iBAAiB,IAAI;GAEvD,KAAK,QAAQ,cACX,OAAO;GAET,KAAK,QAAQ;GACb,KAAK,QAAQ;GACb,KAAK,QAAQ,UACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAE5B,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;GAE9B,KAAK,QAAQ,SACX,OAAO,KAAK,aAAa,IAAI;GAE/B,KAAK,QAAQ,UACX,OAAO,KAAK,WAAW,IAAI;GAE7B,KAAK,QAAQ,gBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ,MACX,OAAO,KAAK,UAAU,IAAI;GAE5B,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,OACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,SACX,OAAO,KAAK,kBAAkB,IAAI;GAEpC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ,qBACX,OAAO,KAAK,iBAAiB,IAAI;GAEnC,KAAK,QAAQ,oBACX,OAAO,KAAK,gBAAgB,IAAI;GAElC,KAAK,QAAQ,QACX,OAAO,KAAK,YAAY,IAAI;GAE9B,KAAK,QAAQ;GACb,KAAK,QAAQ,oBACX,OAAO,KAAK,eAAe,IAAI;GAEjC,KAAK,QAAQ,oBACX,OAAO,KAAK,QAAQ,YAAY,yBAAyB,IAAI;EACjE;EACA,OAAO;CACT;CAEA,WAAmB,MAAe,OAA6B;EAC7D,OAAO,KAAK,cAAc,KAAK,SAAS,MAAM;CAChD;CAEA,YAAoB,MAA6B;EAC/C,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,QAAQ,KAAK,QAAQ,IAAI,KAAK,KAAK;EACzC,IAAI,UAAU,MACZ,OAAO,KAAK,QAAQ,YAAY,mBAAmB,MAAM,CAAC,KAAK,CAAC;EAElE,OAAO;CACT;CAEA,WAAmB,MAA6B;EAC9C,MAAM,QAAQ,YAAY,IAAI;EAC9B,MAAM,QAAQ,KAAK,OAAO,UAAU,KAAK;EACzC,IAAI,UAAU,MACZ,OAAO,KAAK,QAAQ,YAAY,iBAAiB,MAAM,CAAC,KAAK,CAAC;EAEhE,OAAO;CACT;CAEA,kBAA0B,MAA6B;EACrD,MAAM,WAAW,YAAY,KAAK,SAAS,EAAE;EAC7C,MAAM,MAAM,KAAK,YAAY,IAAI,QAAQ;EACzC,IAAI,CAAC,KACH,OAAO,KAAK,QAAQ,YAAY,mBAAmB,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC;EAEjF,IAAI,CAAC,KAAK,KAAK,MAAM,iBAAiB,GACpC,OAAO;EAGT,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,MAAM,KAAK,WAAW,MAAM,CAAC;GACnC,IAAI,QAAQ,MACV,OAAO;GAET,KAAK,KAAK,GAAG;EACf;EAEA,KAAK,OAAO,WAAW;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,KAAK,gBAAgB,IAAI,SAAS,EAAE,CAAC,SAAS,IAAI,KAAK,EAAE;EAE3D,KAAK,cAAc,KAAK,IAAI;EAC5B,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,WAAW,KAAK,CAAC;EACjC,UAAU;GACR,KAAK,cAAc,IAAI;EACzB;EACA,KAAK,OAAO,SAAS;EACrB,OAAO;CACT;CAEA,aAAqB,MAA6B;EAChD,MAAM,QAAQ,KAAK,KAAK,aAAa,WAAY,KAAK,KAAK,QAAmB,OAAO,KAAK,KAAK,KAAK;EACpG,OAAO,KAAK,MAAM,KAAK;CACzB;CAEA,gBAAwB,MAA6B;EACnD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,QAAQ,OAAO,MACxB,OAAO;EAET,MAAM,IAAI;EACV,MAAM,IAAI;EACV,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,MACX,OAAO,IAAI;GACb,KAAK,QAAQ,OACX,OAAO,IAAI;GACb,KAAK,QAAQ,UACX,OAAO,IAAI;EACf;EACA,OAAO;CACT;CAEA,UAAkB,MAA6B;EAC7C,MAAM,OAAO,KAAK,WAAW,MAAM,CAAC;EACpC,IAAI,SAAS,QAAQ,CAAC,MAAM,QAAQ,IAAI,GACtC,OAAO;EAET,OAAO,KAAK;CACd;CAEA,gBAAwB,MAA6B;EACnD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAET,MAAM,cAAc,KAAK,WAAW,QAAQ;EAC5C,IAAI,OAAO,WAAW,GACpB,OAAO,cAAA,IAAA;EAGT,MAAM,WAAW,KAAK,SAAS,EAAE,CAAC,WAAW,QAAQ,eAAe,KAAK,SAAS,EAAE,CAAC,WAAW,CAAC,KAAK,SAAS,EAAE;EACjH,MAAM,QAAQ,OAAO;EACrB,MAAM,YAAsB,CAAC;EAC7B,KAAK,MAAM,eAAe,UAAU;GAClC,UAAU,KAAK,CAAC;GAChB,KAAK,gBAAgB,aAAa,OAAO,EAAE;EAC7C;EACA,IAAI,kBAAkB;EACtB,OAAO,CAAC,iBAAiB;GACvB,MAAM,iBAAiB,KAAK,WAAW,MAAM,CAAC;GAC9C,IAAI,mBAAmB,MACrB,OAAO;GAET,IAAK,mBAAA,MAAmC,aACtC,OAAO,CAAC,cAAA,IAAA;GAEV,IAAI,iBAAiB,UAAU,SAAS;GACxC,OAAO,MACL,IAAI,UAAU,kBAAkB,QAAQ,GAAG;IACzC,UAAU,eAAe;IACzB,IAAI,CAAC,KAAK,KAAK,MAAM,mBAAmB,GACtC,OAAO;IAET,KAAK,gBAAgB,SAAS,iBAAiB,OAAO,UAAU,gBAAgB;IAChF,iBAAiB,UAAU,SAAS;IACpC;GACF,OAAO,IAAI,mBAAmB,GAAG;IAC/B,kBAAkB;IAClB;GACF,OAAO;IACL,UAAU,kBAAkB;IAC5B,KAAK,gBAAgB,SAAS,iBAAiB,OAAO,EAAE;IACxD;GACF;EAEJ;EACA,OAAO,cAAA,IAAA;CACT;CAEA,cAAsB,MAA6B;EACjD,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;EACrC,IAAI,UAAU,MACZ,OAAO;EAET,OAAQ,UAAA,IAAA,IAAA;CACV;CAEA,wBAAgC,IAAY,OAA8B;EACxE,IAAK,OAAO,QAAQ,aAAa,CAAC,SAAW,OAAO,QAAQ,YAAY,OACtE,OAAO,QAAA,IAAA;EAET,IAAI,OAAO,QAAQ,qBAAqB,CAAC,OACvC,OAAA;EAEF,OAAO;CACT;CAEA,iBAAyB,MAA6B;EACpD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,OAAA;EACX,MAAM,UAAU,KAAK,wBAAwB,KAAK,QAAQ,EAAE;EAC5D,IAAI,YAAY,MACd,OAAO;EAGT,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,OAAA;EACX,IAAI;EACJ,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;IACX,SAAS,MAAM;IACf;GACF,KAAK,QAAQ;IACX,SAAS,MAAM;IACf;GACF,KAAK,QAAQ;IACX,SAAS,CAAC,MAAM;IAChB;GACF,KAAK,QAAQ;IACX,SAAS,OAAO;IAChB;GACF,SACE,OAAO;EACX;EACA,OAAO,SAAA,IAAA;CACT;CAEA,YAAoB,MAA6B;EAC/C,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAGT,OADiB,QAAQ,IAAI,EAAE,MAAM,OAChB,KAAK,WAAW,QAAQ,YAAA,IAAA;CAC/C;CAEA,sBAA8B,MAA6B;EACzD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,IAAI;EACV,MAAM,IAAI;EACV,IAAI;EACJ,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;IACX,SAAS,IAAI;IACb;GACF,KAAK,QAAQ;IACX,SAAS,IAAI;IACb;GACF,KAAK,QAAQ;IACX,SAAS,KAAK;IACd;GACF,KAAK,QAAQ;IACX,SAAS,KAAK;IACd;GACF,SACE,OAAO;EACX;EACA,OAAO,SAAA,IAAA;CACT;CAEA,sBAA8B,MAA6B;EACzD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,IAAI;EACJ,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ;IACX,SAAS,SAAS,IAAe,EAAE;IACnC;GACF,KAAK,QAAQ;IACX,SAAS,CAAC,SAAS,IAAe,EAAE;IACpC;GACF,KAAK,QAAQ;IACX,SAAS,QAAQ,IAAI,EAAE,MAAM,KAAK,aAAa,IAAe,EAAa;IAC3E;GACF,KAAK,QAAQ;IACX,SAAS,QAAQ,IAAI,EAAE,MAAM,KAAK,CAAC,aAAa,IAAe,EAAa;IAC5E;GACF,KAAK,QAAQ;IACX,SAAS,aAAa,IAAe,EAAa;IAClD;GACF,SACE,OAAO;EACX;EACA,OAAO,SAAA,IAAA;CACT;CAEA,YAAoB,MAA6B;EAC/C,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,YAAY,KAAK,WAAW,MAAM,CAAC;GACzC,IAAI,cAAc,MAChB,OAAO;GAET,IAAI,UAAU,WAAW,GACvB,OAAO;GAET,KAAK,KAAK,SAAS;EACrB;EACA,MAAM,SAAS,iBAAiB,IAAiB;EACjD,IAAI,WAAW,MAAM;GACnB,KAAK,QAAQ,YAAY,aAAa,MAAM,CAAC,OAAO,YAAY,CAAC,CAAC;GAClE,OAAO;EACT;EACA,OAAO;CACT;CAEA,aAAqB,MAA6B;EAChD,MAAM,OAAO,KAAK,WAAW,MAAM,CAAC;EACpC,IAAI,SAAS,MACX,OAAO;EAET,MAAM,SAAS,QAAQ,IAAI;EAC3B,IAAI,WAAW,MAAM;GACnB,KAAK,QAAQ,YAAY,kBAAkB,KAAK,SAAS,IAAI,CAAC,OAAA,EAAoB,CAAC,CAAC;GACpF,OAAO;EACT;EACA,OAAO;CACT;CAEA,WAAmB,MAA6B;EAC9C,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,YAAY,KAAK,WAAW,MAAM,CAAC;GACzC,IAAI,cAAc,MAChB,OAAO;GAET,KAAK,KAAK,SAAS;EACrB;EACA,OAAO,MAAM,IAAI;CACnB;CAEA,iBAAyB,MAA6B;EACpD,MAAM,OAAgB,CAAC;EACvB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;GAC7C,MAAM,UAAU,KAAK,WAAW,MAAM,CAAC;GACvC,IAAI,YAAY,MACd,OAAO;GAET,KAAK,KAAK,OAAO;EACnB;EACA,OAAO,IAAI,IAAI;CACjB;CAEA,UAAkB,MAA6B;EAC7C,MAAM,UAAU,KAAK,WAAW,MAAM,CAAC;EACvC,IAAI,YAAY,MACd,OAAO;EAET,OAAO,CAAC,OAAO;CACjB;CAEA,YAAoB,MAA6B;EAC/C,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,GACpB,OAAO,KAAK,QAAQ,YAAY,mBAAmB,KAAK,SAAS,EAAE;EAErE,OAAO,OAAO;CAChB;CAEA,mBAA2B,MAA6B;EACtD,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;EAClC,IAAI,OAAO,MACT,OAAO;EAET,QAAQ,KAAK,QAAb;GACE,KAAK,QAAQ,WACX,OAAO,SAAS,IAAe,EAAa;GAC9C,KAAK,QAAQ,kBACX,OAAO,gBAAgB,IAAe,EAAa;GACrD,KAAK,QAAQ,WACX,OAAO,QAAQ,IAAe,EAAa;GAC7C,KAAK,QAAQ,qBACX,OAAO,WAAW,IAAe,EAAa;EAClD;EACA,OAAO;CACT;CAEA,gBAAwB,MAA6B;EACnD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAGT,OAAO,WAAW,QADF,eAAe,IACQ,CAAO;CAChD;CAEA,kBAA0B,MAA6B;EACrD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAGT,MAAM,aADU,eAAe,IACZ,CAAA,CAAQ,KAAI,MAAK,OAAO,EAAE;EAC7C,OAAO,WAAW,WAAW,IAAI,WAAW,KAAK,MAAM,UAAU;CACnE;CAEA,YAAoB,MAA6B;EAC/C,MAAM,UAAU,KAAK,SAAS,SAAS;EACvC,MAAM,SAAS,KAAK,WAAW,MAAM,OAAO;EAC5C,IAAI,WAAW,MACb,OAAO;EAET,IAAI,OAAO,WAAW,GACpB,OAAO;EAGT,MAAM,UAAU,eAAe,IAAI;EAEnC,IADmB,QAAQ,WAAW,SACtB;GACd,MAAM,SAAkB,CAAC;GACzB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;IAChC,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;IACrC,IAAI,UAAU,MACZ,OAAO;IAET,IAAI,MAAM,WAAW,GACnB,OAAO;IAET,OAAO,KAAK,KAAK;GACnB;GACA,MAAM,SAAkB,CAAC;GACzB,KAAK,MAAM,WAAW,QAAQ;IAC5B,IAAI,QAAQ;IACZ,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;KACvC,MAAM,OAAO,QAAQ,QAAQ;KAC7B,MAAM,WAAW,OAAO;KACxB,IAAI,CAAC,SAAS,UAAU,IAAI,GAAG;MAC7B,QAAQ;MACR;KACF;IACF;IACA,IAAI,OACF,OAAO,KAAK,OAAO;GAEvB;GACA,OAAO;EACT,OAAO;GACL,MAAM,WAAW,KAAK,WAAW,MAAM,CAAC;GACxC,IAAI,aAAa,MACf,OAAO;GAET,IAAI,SAAS,WAAW,GACtB,OAAO;GAGT,MAAM,SAAkB,CAAC;GACzB,KAAK,MAAM,WAAW,QAAQ;IAC5B,MAAM,QAAQ,QAAQ,KAAI,MAAK,QAAQ,EAAE;IAEzC,IAAI,SAAS,UADO,MAAM,WAAW,IAAI,MAAM,KAAK,MAAM,KAAK,CAC7B,GAAG,OAAO,KAAK,OAAO;GAC1D;GACA,OAAO;EACT;CACF;CAEA,YAAoB,MAA6B;EAC/C,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAET,OAAO,OAAO,MAAmB;CACnC;CAEA,iBAAyB,MAA6B;EACpD,MAAM,SAAS,KAAK,WAAW,MAAM,CAAC;EACtC,IAAI,WAAW,MACb,OAAO;EAGT,MAAM,WAAW,CAAC;EAClB,KAAK,MAAM,WAAW,QAAmB;GACvC,IAAI,CAAC,KAAK,KAAK,MAAM,oBAAoB,GACvC,OAAO;GAET,KAAK,gBAAgB,KAAK,SAAS,IAAI,OAAO;GAC9C,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;GACrC,IAAI,UAAU,MACZ,OAAO;GAET,IAAI,UAAA,GACF,SAAS,KAAK,OAAO;EAEzB;EACA,OAAO,SAAS,WAAW,IAAI,YAAY;CAC7C;CAEA,gBAAwB,MAA6B;EACnD,MAAM,SAAkB,CAAC;EACzB,MAAM,SAA2B,CAAC;EAElC,IAAI,eAAe;EAGnB,MAAM,wBAAiC;GACrC,OAAO,OAAO,SAAS,GAAG;IACxB,MAAM,MAAM,OAAO,OAAO,SAAS;IACnC,IAAI,IAAI,UAAU,IAAI,OAAO,SAAS,GAAG;KACvC,IAAI;KACJ,MAAM,YAAY,IAAI,OAAO,IAAI;KACjC,IAAI,CAAC,KAAK,KAAK,KAAK,SAAS,IAAI,UAAU,mBAAmB,GAC5D,OAAO;KAET,KAAK,gBAAgB,KAAK,SAAS,IAAI,QAAQ,CAAC,SAAS,IAAI,SAAS;KACtE,eAAe,IAAI,UAAU;KAC7B,OAAO;IACT;IACA,OAAO,IAAI;GACb;GACA,OAAO;EACT;EAEA,OAAO,MAAM;GAEX,IAAI,gBAAgB,KAAK,SAAS,QAAQ;IACxC,MAAM,UAAU,KAAK,WAAW,MAAM,CAAC;IACvC,IAAI,YAAY,MACd,OAAO;IAET,OAAO,KAAK,OAAO;IACnB,IAAI,CAAC,gBAAgB,GACnB;IAEF;GACF;GAGA,MAAM,QAAQ,KAAK,SAAS;GAC5B,IAAI,MAAM,WAAW,QAAQ,SAAS;IACpC,MAAM,SAAS,KAAK,WAAW,OAAO,CAAC;IACvC,IAAI,WAAW,MACb,OAAO;IAET,IAAI,OAAO,WAAW,GAAG;KACvB,IAAI,CAAC,gBAAgB,GACnB;KAEF;IACF;IACA,IAAI,CAAC,KAAK,KAAK,OAAO,mBAAmB,GACvC,OAAO;IAET,OAAO,KAAK;KACV,SAAS;KACT;KACA,SAAS;IACX,CAAC;IACD,KAAK,gBAAgB,MAAM,SAAS,IAAI,OAAO,EAAE;IACjD;IACA;GACF;GAGA,MAAM,QAAQ,KAAK,cAAc,KAAK;GACtC,IAAI,UAAU,MACZ,OAAO;GAET,IAAI,UAAA,GAAuB;IACzB,IAAI,CAAC,gBAAgB,GACnB;IAEF;GACF;GACA;EACF;EACA,OAAO,IAAI,MAAM;CACnB;CAEA,YAAoB,MAA6B;EAC/C,MAAM,QAAQ,KAAK,WAAW,MAAM,CAAC;EACrC,IAAI,UAAU,MACZ,OAAO;EAET,KAAK,gBAAgB,KAAK,SAAS,IAAI,KAAK;EAC5C,OAAA;CACF;CAEA,eAAuB,MAA6B;EAClD,MAAM,eAAe,KAAK,WAAW,MAAM,CAAC;EAC5C,IAAI,iBAAiB,MACnB,OAAO;EAET,MAAM,YAAY,KAAK,WAAW,QAAQ,oBAAoB,IAAI;EAClE,IAAI,UAAiB;EACrB,OAAO,MAAM;GACX,IAAI,CAAC,KAAK,KAAK,MAAM,kBAAkB,GACrC,OAAO;GAGT,KAAK,gBAAgB,KAAK,SAAS,IAAI,OAAO;GAC9C,IAAI,KAAK,WAAW,QAAQ,mBAAmB;IAC7C,MAAM,OAAO,KAAK,WAAW,MAAM,CAAC;IACpC,IAAI,SAAS,MACX,OAAO;IAET,IAAI,SAAA,GACF;GAEJ;GAEA,MAAM,OAAO,KAAK,WAAW,MAAM,SAAS;GAC5C,IAAI,SAAS,MACX,OAAO;GAET,IAAI,QAAQ,SAAS,IAAI,MAAM,GAC7B;GAEF,UAAU;EACZ;EAEA,OAAO;CACT;AACF;;AAiBA,IAAM,eAAN,MAAmB;CACjB,gBAAwB;CACxB,uBAAe,IAAI,IAA0B;CAC7C,YAAiD,CAAC;CAElD,aAAmB;EACjB,KAAK,UAAU,KAAK,KAAK,IAAI;EAC7B,KAAK,uBAAO,IAAI,IAAI;CACtB;CAEA,WAAiB;EACf,KAAK,OAAO,KAAK,UAAU,IAAI;CACjC;CAEA,SAAS,OAAe,OAAoB;EAC1C,MAAM,WAAW,KAAK,KAAK,IAAI,KAAK;EACpC,IAAI,UAAU;GACZ,SAAS,QAAQ;GACjB,SAAS;EACX,OACE,KAAK,KAAK,IAAI,OAAO;GAAE,IAAI,KAAK;GAAiB,SAAS;GAAG;EAAM,CAAC;CAExE;CAEA,UAAU,OAA6B;EACrC,OAAO,KAAK,KAAK,IAAI,KAAK,CAAC,EAAE,SAAS;CACxC;CAEA,qBAAqB,OAA2C;EAC9D,IAAI,MAAM,SAAS,GACjB,OAAO;EAET,MAAM,QAAkB,CAAC;EACzB,KAAK,MAAM,SAAS,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,GAAG;GACrC,MAAM,UAAU,KAAK,KAAK,IAAI,KAAK;GACnC,IAAI,YAAY,QACd,OAAO;GAET,MAAM,KAAK,GAAG,QAAQ,GAAG,GAAG,QAAQ,SAAS;EAC/C;EACA,OAAO,MAAM,KAAK,GAAG;CACvB;AACF"}

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

@@ -1,2 +1,2 @@
-import { _ as setSymDiff, a as extractValue, b as validateValue, c as isTupleValue, d as printValue, f as projection, g as setNestedValue, h as setIntersection, i as convertPathToType, l as makeDefaultValue, m as setDiff, n as cartesianProduct, o as isSetValue, p as reduce, r as contains, s as isSubsetOrEq, t as boolean, u as normalizeValue, v as setUnion, x as valueStub, y as testInvalid } from "../../value-api-Bw-SgaYY.js";
+import { _ as setSymDiff, a as extractValue, b as validateValue, c as isTupleValue, d as printValue, f as projection, g as setNestedValue, h as setIntersection, i as convertPathToType, l as makeDefaultValue, m as setDiff, n as cartesianProduct, o as isSetValue, p as reduce, r as contains, s as isSubsetOrEq, t as boolean, u as normalizeValue, v as setUnion, x as valueStub, y as testInvalid } from "../../value-api-B6T6f4Ia.js";
 export { boolean, cartesianProduct, contains, convertPathToType, extractValue, isSetValue, isSubsetOrEq, isTupleValue, makeDefaultValue, normalizeValue, printValue, projection, reduce, setDiff, setIntersection, setNestedValue, setSymDiff, setUnion, testInvalid, validateValue, valueStub };

package/dist/rslang/eval/value-api.js

@@ -1,2 +1,2 @@
-import { A as testInvalid, C as projection, D as setNestedValue, E as setIntersection, M as valueStub, O as setSymDiff, S as printValue, T as setDiff, _ as isSetValue, b as makeDefaultValue, f as boolean, g as extractValue, h as convertPathToType, j as validateValue, k as setUnion, m as contains, p as cartesianProduct, v as isSubsetOrEq, w as reduce, x as normalizeValue, y as isTupleValue } from "../../value-B8UtCqaK.js";
+import { A as setUnion, C as printValue, D as setIntersection, E as setDiff, M as validateValue, N as valueStub, O as setNestedValue, S as normalizeValue, T as reduce, _ as extractValue, b as isTupleValue, g as convertPathToType, h as contains, j as testInvalid, k as setSymDiff, m as cartesianProduct, p as boolean, v as isSetValue, w as projection, x as makeDefaultValue, y as isSubsetOrEq } from "../../value-ybFBRuz6.js";
 export { boolean, cartesianProduct, contains, convertPathToType, extractValue, isSetValue, isSubsetOrEq, isTupleValue, makeDefaultValue, normalizeValue, printValue, projection, reduce, setDiff, setIntersection, setNestedValue, setSymDiff, setUnion, testInvalid, validateValue, valueStub };

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

@@ -1,2 +1,2 @@
-import { a as TUPLE_ID, c as Value, d as compare, f as makeValuePath, i as SET_INFINITY, l as ValueContext, m as tuple, n as EmptySetV, o as VALUE_FALSE, p as set, r as INVALID_ELEMENT, s as VALUE_TRUE, t as BOOL_INFINITY, u as ValuePath } from "../../value-CTjX6825.js";
-export { BOOL_INFINITY, EmptySetV, INVALID_ELEMENT, SET_INFINITY, TUPLE_ID, VALUE_FALSE, VALUE_TRUE, Value, ValueContext, ValuePath, compare, makeValuePath, set, tuple };
+import { a as SET_INFINITY, c as VALUE_TRUE, d as ValuePath, f as compare, h as tuple, i as INVALID_ELEMENT, l as Value, m as set, n as CalcInvalidDataError, o as TUPLE_ID, p as makeValuePath, r as EmptySetV, s as VALUE_FALSE, t as BOOL_INFINITY, u as ValueContext } from "../../value-BduA_ZGp.js";
+export { BOOL_INFINITY, CalcInvalidDataError, EmptySetV, INVALID_ELEMENT, SET_INFINITY, TUPLE_ID, VALUE_FALSE, VALUE_TRUE, Value, ValueContext, ValuePath, compare, makeValuePath, set, tuple };

package/dist/rslang/eval/value.js

@@ -1,2 +1,2 @@
-import { a as TUPLE_ID, c as compare, d as tuple, i as SET_INFINITY, l as makeValuePath, n as EmptySetV, o as VALUE_FALSE, r as INVALID_ELEMENT, s as VALUE_TRUE, t as BOOL_INFINITY, u as set } from "../../value-B8UtCqaK.js";
-export { BOOL_INFINITY, EmptySetV, INVALID_ELEMENT, SET_INFINITY, TUPLE_ID, VALUE_FALSE, VALUE_TRUE, compare, makeValuePath, set, tuple };
+import { a as SET_INFINITY, c as VALUE_TRUE, d as set, f as tuple, i as INVALID_ELEMENT, l as compare, n as CalcInvalidDataError, o as TUPLE_ID, r as EmptySetV, s as VALUE_FALSE, t as BOOL_INFINITY, u as makeValuePath } from "../../value-ybFBRuz6.js";
+export { BOOL_INFINITY, CalcInvalidDataError, EmptySetV, INVALID_ELEMENT, SET_INFINITY, TUPLE_ID, VALUE_FALSE, VALUE_TRUE, compare, makeValuePath, set, tuple };

package/dist/rslang/index.d.ts

@@ -1,13 +1,13 @@
 import { O as makeTypePath, b as Typification, d as EmptySetT, f as ExpressionType, g as TypeClass, m as LogicT, t as AnyTypificationT, v as TypeID, y as TypePath } from "../typification-Dk-fisgO.js";
-import { i as RSErrorDescription, r as RSErrorCode } from "../error-E1LVq_3w.js";
-import { i as readTypeAnnotation, r as readErrorAnnotation } from "../ast-annotations-BiMjkKvz.js";
-import { c as Value, f as makeValuePath, u as ValuePath } from "../value-CTjX6825.js";
-import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-C9W2jkSx.js";
-import { d as printValue } from "../value-api-Bw-SgaYY.js";
+import { i as RSErrorDescription, r as RSErrorCode } from "../error-deey7EiC.js";
+import { i as readTypeAnnotation, r as readErrorAnnotation } from "../ast-annotations-GOkbNN8F.js";
+import { d as ValuePath, l as Value, p as makeValuePath } from "../value-BduA_ZGp.js";
+import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-DFevxZyV.js";
+import { d as printValue } from "../value-api-B6T6f4Ia.js";
 import { t as parser } from "../parser-Bwd8LxJ1.js";
 import { t as TokenID } from "../token-DeXAmzwr.js";
 import { t as ValueClass } from "../value-class-CNI-lqXJ.js";
-import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "../analyzer-DlSq3Y3r.js";
+import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "../analyzer-BliNe3pV.js";
 import { n as ArgumentsType } from "../arguments-extractor-1acwjQNc.js";
 import { n as applyAsciiTypeSubstitutions, r as parseTypeText } from "../typification-parser-BBVx1RxP.js";
 import { n as TypificationNodeData, t as TypificationGraph } from "../typification-graph-6HcZ-rKH.js";

package/dist/rslang/index.js

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

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

@@ -1,5 +1,5 @@
 import { t as AstNode } from "../../ast-C8sIpKdL.js";
-import { t as ErrorReporter } from "../../error-E1LVq_3w.js";
+import { t as ErrorReporter } from "../../error-deey7EiC.js";
 
 //#region src/rslang/parser/syntax-errors.d.ts
 declare function extractSyntaxErrors(ast: AstNode, expression: string, reporter: ErrorReporter, annotateErrors?: boolean): void;

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

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

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

@@ -1,6 +1,6 @@
 import { t as AstNode } from "../../ast-C8sIpKdL.js";
 import { _ as TypeContext, f as ExpressionType } from "../../typification-Dk-fisgO.js";
-import { t as ErrorReporter } from "../../error-E1LVq_3w.js";
+import { t as ErrorReporter } from "../../error-deey7EiC.js";
 
 //#region src/rslang/semantic/type-auditor.d.ts
 /** Type auditor for AST type checking. */

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

@@ -519,7 +519,8 @@ var TypeAuditor = class TypeAuditor {
 };
 function mangleRadicals(funcName, type) {
 	switch (type.typeID) {
-		default: throw new Error(`Unexpected type: ${type.typeID}`);
+		default: throw new Error(`Unexpected type for ${funcName}: ${JSON.stringify(type)}`);
+		case TypeID.anyTypification:
 		case TypeID.integer: return type;
 		case TypeID.basic:
 			if (isRadical(type.baseID)) return {

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(node: AstNode, index: number, errorCode: RSErrorCode): 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      this.onError(errorCode, node.children[index], [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);\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 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)]);\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)]);\n    }\n\n    const result = mergeTypifications(type1, type2);\n    if (result === null) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2)]);\n    }\n    return result;\n  }\n\n  private visitIntegerPredicate(node: AstNode): ExpressionType | null {\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)]);\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)]);\n    }\n\n    if (!checkCompatibility(type1, type2)) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2)]);\n    }\n    return LogicT;\n  }\n\n  private visitQuantifier(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);\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 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)]);\n    }\n    return LogicT;\n  }\n\n  private visitSetexprPredicate(node: AstNode): ExpressionType | null {\n    let type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);\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)]);\n      } else {\n        return this.onError(RSErrorCode.invalidElementPredicate, node, [\n          labelType(type1),\n          labelToken(node.typeID as TokenID),\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 type1 = this.childTypeDebool(node, 0, RSErrorCode.invalidTypeOperation);\n    if (type1 === null) {\n      return null;\n    }\n\n    const type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);\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))]);\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 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.typesNotEqual, node.children[child], [\n            labelType(param),\n            labelType(bool(bases[child]))\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.typesNotEqual, node.children[0], [labelType(paramType), labelType(expected)]);\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(node, 1, RSErrorCode.invalidTypeOperation);\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);\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      ]);\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: ${type.typeID}`);\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,gBAAwB,MAAe,OAAe,WAA6C;EACjG,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,KAAK,QAAQ,WAAW,KAAK,SAAS,QAAQ,CAAC,UAAU,MAAM,CAAC,CAAC;GACjE,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,oBAAoB;EAC7E,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,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,CAAC,CAAC;EAG9F,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,CAAC,CAAC;EAG9F,MAAM,SAAS,mBAAmB,OAAO,KAAK;EAC9C,IAAI,WAAW,MACb,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM,CAAC,UAAU,KAAK,GAAG,UAAU,KAAK,CAAC,CAAC;EAEhG,OAAO;CACT;CAEA,sBAA8B,MAAsC;EAClE,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,CAAC,CAAC;EAG5F,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,CAAC,CAAC;EAG5F,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAClC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM,CAAC,UAAU,KAAK,GAAG,UAAU,KAAK,CAAC,CAAC;EAEhG,OAAO;CACT;CAEA,gBAAwB,MAAsC;EAC5D,KAAK,OAAO,WAAW;EAEvB,MAAM,SAAS,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC7E,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,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,CAAC,UAAU,KAAK,GAAG,UAAU,KAAK,CAAC,CAAC;EAEhG,OAAO;CACT;CAEA,sBAA8B,MAAsC;EAClE,IAAI,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC1E,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,CAAC,UAAU,KAAK,GAAG,UAAU,KAAK,CAAC,CAAC;OAEzF,OAAO,KAAK,QAAQ,YAAY,yBAAyB,MAAM;GAC7D,UAAU,KAAK;GACf,WAAW,KAAK,MAAiB;GACjC,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,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC5E,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC5E,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,SAAS,mBAAmB,OAAO,KAAK;EAC9C,IAAI,WAAW,MACb,OAAO,KAAK,QAAQ,YAAY,eAAe,MAAM,CAAC,UAAU,KAAK,KAAK,CAAC,GAAG,UAAU,KAAK,KAAK,CAAC,CAAC,CAAC;EAEvG,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,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,eAAe,KAAK,SAAS,QAAQ,CACnE,UAAU,KAAK,GACf,UAAU,KAAK,MAAM,MAAM,CAAC,CAC9B,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,eAAe,KAAK,SAAS,IAAI,CAAC,UAAU,SAAS,GAAG,UAAU,QAAQ,CAAC,CAAC;EAEhH;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,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC7E,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,oBAAoB;EAC7E,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,CAC5E,UAAU,cAAc,GACxB,UAAU,QAAQ,CACpB,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,oBAAoB,KAAK,QAAQ;EACnD,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(node: AstNode, index: number, errorCode: RSErrorCode): 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      this.onError(errorCode, node.children[index], [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);\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 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)]);\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)]);\n    }\n\n    const result = mergeTypifications(type1, type2);\n    if (result === null) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2)]);\n    }\n    return result;\n  }\n\n  private visitIntegerPredicate(node: AstNode): ExpressionType | null {\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)]);\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)]);\n    }\n\n    if (!checkCompatibility(type1, type2)) {\n      return this.onError(RSErrorCode.typesNotCompatible, node, [labelType(type1), labelType(type2)]);\n    }\n    return LogicT;\n  }\n\n  private visitQuantifier(node: AstNode): ExpressionType | null {\n    this.locals.startScope();\n\n    const domain = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);\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 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)]);\n    }\n    return LogicT;\n  }\n\n  private visitSetexprPredicate(node: AstNode): ExpressionType | null {\n    let type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);\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)]);\n      } else {\n        return this.onError(RSErrorCode.invalidElementPredicate, node, [\n          labelType(type1),\n          labelToken(node.typeID as TokenID),\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 type1 = this.childTypeDebool(node, 0, RSErrorCode.invalidTypeOperation);\n    if (type1 === null) {\n      return null;\n    }\n\n    const type2 = this.childTypeDebool(node, 1, RSErrorCode.invalidTypeOperation);\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))]);\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 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.typesNotEqual, node.children[child], [\n            labelType(param),\n            labelType(bool(bases[child]))\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.typesNotEqual, node.children[0], [labelType(paramType), labelType(expected)]);\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(node, 1, RSErrorCode.invalidTypeOperation);\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);\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      ]);\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,gBAAwB,MAAe,OAAe,WAA6C;EACjG,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,KAAK,QAAQ,WAAW,KAAK,SAAS,QAAQ,CAAC,UAAU,MAAM,CAAC,CAAC;GACjE,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,oBAAoB;EAC7E,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,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,CAAC,CAAC;EAG9F,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,CAAC,CAAC;EAG9F,MAAM,SAAS,mBAAmB,OAAO,KAAK;EAC9C,IAAI,WAAW,MACb,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM,CAAC,UAAU,KAAK,GAAG,UAAU,KAAK,CAAC,CAAC;EAEhG,OAAO;CACT;CAEA,sBAA8B,MAAsC;EAClE,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,CAAC,CAAC;EAG5F,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,CAAC,CAAC;EAG5F,IAAI,CAAC,mBAAmB,OAAO,KAAK,GAClC,OAAO,KAAK,QAAQ,YAAY,oBAAoB,MAAM,CAAC,UAAU,KAAK,GAAG,UAAU,KAAK,CAAC,CAAC;EAEhG,OAAO;CACT;CAEA,gBAAwB,MAAsC;EAC5D,KAAK,OAAO,WAAW;EAEvB,MAAM,SAAS,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC7E,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,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,CAAC,UAAU,KAAK,GAAG,UAAU,KAAK,CAAC,CAAC;EAEhG,OAAO;CACT;CAEA,sBAA8B,MAAsC;EAClE,IAAI,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC1E,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,CAAC,UAAU,KAAK,GAAG,UAAU,KAAK,CAAC,CAAC;OAEzF,OAAO,KAAK,QAAQ,YAAY,yBAAyB,MAAM;GAC7D,UAAU,KAAK;GACf,WAAW,KAAK,MAAiB;GACjC,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,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC5E,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,QAAQ,KAAK,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC5E,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,SAAS,mBAAmB,OAAO,KAAK;EAC9C,IAAI,WAAW,MACb,OAAO,KAAK,QAAQ,YAAY,eAAe,MAAM,CAAC,UAAU,KAAK,KAAK,CAAC,GAAG,UAAU,KAAK,KAAK,CAAC,CAAC,CAAC;EAEvG,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,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,eAAe,KAAK,SAAS,QAAQ,CACnE,UAAU,KAAK,GACf,UAAU,KAAK,MAAM,MAAM,CAAC,CAC9B,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,eAAe,KAAK,SAAS,IAAI,CAAC,UAAU,SAAS,GAAG,UAAU,QAAQ,CAAC,CAAC;EAEhH;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,gBAAgB,MAAM,GAAG,YAAY,oBAAoB;EAC7E,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,oBAAoB;EAC7E,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,CAC5E,UAAU,cAAc,GACxB,UAAU,QAAQ,CACpB,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/typification-api.js

@@ -100,7 +100,7 @@ function compareTemplated(substitutes, arg, value) {
 		substitutes.set(arg.baseID, mergeType);
 		return true;
 	}
-	if (value.typeID === TypeID.anyTypification) return true;
+	if (arg.typeID === TypeID.anyTypification || value.typeID === TypeID.anyTypification) return true;
 	if (arg.typeID === TypeID.integer || arg.typeID === TypeID.basic || value.typeID === TypeID.integer || value.typeID === TypeID.basic) return commonType(arg, value) !== null;
 	if (arg.typeID !== value.typeID) return false;
 	switch (arg.typeID) {