@rsconcept/domain 2.2.0 → 3.0.0

package/dist/diagnostics-B1OfMra1.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"diagnostics-B1OfMra1.js","names":[],"sources":["../src/library/rsform-api/cst-type.ts","../src/library/rsform-api/alias.ts","../src/library/rsform-api/analysis.ts","../src/library/rsform-api/expression.ts","../src/library/rsform-api/semantic-relations.ts","../src/library/rsform-api/formal-graph.ts","../src/library/rsform-api/stats.ts","../src/library/rsform-api/structure.ts","../src/library/rsform-api/synthesis.ts","../src/library/diagnostics.ts"],"sourcesContent":["/**\n * CstType classification, prefixes, and capability predicates.\n */\n\nimport { TypeClass, TypeID, type Typification } from '../../rslang';\nimport { type EchelonFunctional, isTypification } from '../../rslang/semantic/typification';\nimport { type Constituenta, CstClass, CstType } from '../rsform';\n\n/** Record of {@link CstType} prefixes. */\nconst CST_TYPE_PREFIX: Record<CstType, string> = {\n  [CstType.NOMINAL]: 'N',\n  [CstType.BASE]: 'X',\n  [CstType.CONSTANT]: 'C',\n  [CstType.STRUCTURED]: 'S',\n  [CstType.AXIOM]: 'A',\n  [CstType.TERM]: 'D',\n  [CstType.FUNCTION]: 'F',\n  [CstType.PREDICATE]: 'P',\n  [CstType.STATEMENT]: 'T'\n};\n\n/** Record of {@link CstType} to {@link CstClass} mapping. */\nconst CST_TYPE_TO_CLASS: Record<CstType, CstClass> = {\n  [CstType.NOMINAL]: CstClass.NOMINAL,\n  [CstType.BASE]: CstClass.BASIC,\n  [CstType.CONSTANT]: CstClass.BASIC,\n  [CstType.STRUCTURED]: CstClass.BASIC,\n  [CstType.TERM]: CstClass.DERIVED,\n  [CstType.FUNCTION]: CstClass.DERIVED,\n  [CstType.AXIOM]: CstClass.STATEMENT,\n  [CstType.PREDICATE]: CstClass.DERIVED,\n  [CstType.STATEMENT]: CstClass.STATEMENT\n};\n\n/** Prefix for alias indicating {@link CstType}. */\nexport function getCstTypePrefix(type: CstType): string {\n  return CST_TYPE_PREFIX[type];\n}\n\n/** Guess {@link CstType} from user input hint. */\nexport function guessCstType(hint: string): CstType | null {\n  if (hint.length !== 1) {\n    return null;\n  }\n  for (const [type, prefix] of Object.entries(CST_TYPE_PREFIX)) {\n    if (hint === prefix) {\n      return type as CstType;\n    }\n  }\n  return null;\n}\n\n/** Infers the {@link CstClass} based on the provided {@link CstType} and template status. */\nexport function inferClass(type: CstType, isTemplate: boolean = false): CstClass {\n  if (isTemplate) {\n    return CstClass.TEMPLATE;\n  }\n  return CST_TYPE_TO_CLASS[type];\n}\n\n/** Check if {@link Constituenta} is a template or a category. */\nexport function isTemplateCst(cst: Constituenta): boolean {\n  return cst.cst_type === CstType.FUNCTION || cst.cst_type === CstType.PREDICATE || cst.cst_type === CstType.STATEMENT;\n}\n\n/** Evaluate if {@link CstType} is basic concept. */\nexport function isBasicConcept(type: CstType): boolean {\n  switch (type) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n      return true;\n\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is base set or constant set. */\nexport function isBaseSet(type: CstType): boolean {\n  switch (type) {\n    case CstType.BASE:\n    case CstType.CONSTANT:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is a function. */\nexport function isFunctional(type: CstType): boolean {\n  switch (type) {\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n    case CstType.TERM:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is logical. */\nexport function isLogical(type: CstType): boolean {\n  switch (type) {\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} can have manual typification. */\nexport function canHaveManualTypification(type: CstType): boolean {\n  switch (type) {\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Checks whether a constituenta type supports formal definitions. */\nexport function canHaveFormalDefinition(cstType: CstType): boolean {\n  return cstType !== CstType.BASE && cstType !== CstType.CONSTANT;\n}\n\n/** Returns expected {@link TypeClass} of formal definition for {@link CstType}. */\nexport function typeClassForCstType(cstType: CstType): TypeClass {\n  switch (cstType) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n      return TypeClass.typification;\n    case CstType.FUNCTION:\n      return TypeClass.function;\n    case CstType.PREDICATE:\n      return TypeClass.predicate;\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return TypeClass.logic;\n  }\n}\n\n/** Evaluate if {@link Constituenta} can be used produce structure. */\nexport function canProduceStructure(cst: Constituenta): boolean {\n  switch (cst.cst_type) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n    case CstType.PREDICATE:\n      return false;\n  }\n  if (!cst.effectiveType) {\n    return false;\n  }\n  if (cst.cst_type === CstType.FUNCTION) {\n    const result = (cst.effectiveType as EchelonFunctional).result;\n    return typeCanProduceStructure(result);\n  }\n  if (!isTypification(cst.effectiveType)) {\n    return false;\n  }\n  return typeCanProduceStructure(cst.effectiveType as Typification);\n}\n\nfunction typeCanProduceStructure(type: Typification): boolean {\n  if (type.typeID === TypeID.basic || type.typeID === TypeID.integer || type.typeID === TypeID.anyTypification) {\n    return false;\n  } else if (type.typeID === TypeID.tuple) {\n    return true;\n  } else {\n    return (\n      type.base.typeID !== TypeID.basic &&\n      type.base.typeID !== TypeID.integer &&\n      type.base.typeID !== TypeID.anyTypification\n    );\n  }\n}\n","/**\n * Alias generation, validation, and remapping.\n */\n\nimport { applyEntityReferenceMapping } from '../../cctext/language-api';\nimport { type AliasMapping, applyAliasMapping, applyTypificationMapping } from '../../rslang/api';\nimport { type ArgumentValue, type CstType, type RSForm } from '../rsform';\n\nimport { getCstTypePrefix } from './cst-type';\n\n/** Fields of {@link Constituenta} updated in place by alias mapping. */\nexport interface ConstituentaMappableFields {\n  alias: string;\n  definition_formal: string;\n  typification_manual: string;\n  term_raw: string;\n  definition_raw: string;\n}\n\n/** Build alias mapping from template argument bindings. */\nexport function argumentValuesToMapping(args: ArgumentValue[]): AliasMapping {\n  const mapping: AliasMapping = {};\n  for (const arg of args) {\n    if (arg.value) {\n      mapping[arg.alias] = arg.value;\n    }\n  }\n  return mapping;\n}\n\n/** Validate alias format for a given {@link CstType} (prefix + digits, min length 2). */\nexport function validateAliasFormat(alias: string, type: CstType): boolean {\n  if (alias.length < 2) {\n    return false;\n  }\n  const prefix = getCstTypePrefix(type);\n  if (!alias.startsWith(prefix)) {\n    return false;\n  }\n  if (!/^\\d+$/.exec(alias.substring(prefix.length))) {\n    return false;\n  }\n  return true;\n}\n\n/** Validate new alias against {@link CstType} and {@link RSForm}. */\nexport function validateNewAlias(alias: string, type: CstType, schema: RSForm): boolean {\n  if (!validateAliasFormat(alias, type)) {\n    return false;\n  }\n  if (schema.cstByAlias.has(alias)) {\n    return false;\n  }\n  return true;\n}\n\n/** Generate alias for new {@link Constituenta} of a given {@link CstType} for current {@link RSForm}. */\nexport function generateAlias(type: CstType, schema: RSForm, takenAliases: string[] = []): string {\n  const prefix = getCstTypePrefix(type);\n  let index = schema.items.reduce((prev, cst) => {\n    if (cst.cst_type !== type) {\n      return prev;\n    }\n    const next = Number(cst.alias.substring(prefix.length)) + 1;\n    return Math.max(prev, next);\n  }, 1);\n  let alias = `${prefix}${index}`;\n  while (takenAliases.includes(alias)) {\n    index = index + 1;\n    alias = `${prefix}${index}`;\n  }\n  return alias;\n}\n\n/**\n * Remap formal expressions and terminological entity references in constituent fields.\n * Mutates each element of `items` in place; pass owned or cloned data only.\n */\nexport function applyMappingToConstituents<T extends ConstituentaMappableFields>(\n  items: T[],\n  mapping: AliasMapping,\n  changeAliases: boolean\n): void {\n  for (const cst of items) {\n    if (changeAliases && cst.alias in mapping) {\n      cst.alias = mapping[cst.alias];\n    }\n    cst.definition_formal = applyAliasMapping(cst.definition_formal, mapping);\n    cst.typification_manual = applyTypificationMapping(cst.typification_manual, mapping);\n    cst.term_raw = applyEntityReferenceMapping(cst.term_raw, mapping);\n    cst.definition_raw = applyEntityReferenceMapping(cst.definition_raw, mapping);\n  }\n}\n\n/** Remove alias from expression. */\nexport function removeAliasReference(expression: string, alias: string): string {\n  const escaped = alias.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n  return expression.replaceAll(new RegExp(`\\\\b${escaped}\\\\b`, 'g'), '').trim();\n}\n\n/** Add alias to expression. */\nexport function addAliasReference(expression: string, alias: string): string {\n  return expression + ' ' + alias;\n}\n","/**\n * Formal expression analysis against an RSForm schema.\n */\n\nimport { type Graph } from '../../graph';\nimport { type AnalysisFull, RSErrorCode, ValueClass } from '../../rslang';\nimport { extractGlobals } from '../../rslang/api';\nimport { basic, bool, constant } from '../../rslang/semantic/typification';\nimport { formatDependencyCycle, RSDiagnosticCode } from '../diagnostics';\nimport { CstType, type RSForm } from '../rsform';\n\nimport { canHaveFormalDefinition, typeClassForCstType } from './cst-type';\n\nexport function getAnalysisFor(expression: string, cstType: CstType, schema: RSForm, alias?: string): AnalysisFull {\n  if (!canHaveFormalDefinition(cstType)) {\n    if (expression.trim().length === 0) {\n      const fallbackAlias = alias && alias.length > 0 ? alias : 'X0';\n      const type = cstType === CstType.BASE ? bool(basic(fallbackAlias)) : bool(constant(fallbackAlias));\n      return {\n        success: true,\n        type,\n        valueClass: ValueClass.VALUE,\n        errors: [],\n        ast: null\n      };\n    }\n    return {\n      success: false,\n      type: null,\n      valueClass: null,\n      errors: [\n        {\n          code: RSErrorCode.definitionNotAllowed,\n          from: 0,\n          to: Math.max(expression.length, 1),\n          params: [cstType, alias ?? '']\n        }\n      ],\n      ast: null\n    };\n  }\n  const analysis = schema.analyzer.checkFull(expression, {\n    expected: typeClassForCstType(cstType),\n    isDomain: cstType === CstType.STRUCTURED\n  });\n  return refineAnalysisForDependencyCycles(analysis, expression, schema, alias);\n}\n\n/**\n * When an untyped / bare F·P reference names a constituent on a definition cycle with the\n * current expression, replace that error with {@link RSDiagnosticCode.schemaDependencyCycle}.\n *\n * Covers both semantic `globalNotTyped` (e.g. `F3[σ]`) and parser `globalFuncWithoutArgs`\n * (bare `P1` / `F1` treated as a call without arguments).\n *\n * Uses a draft dependency graph: incoming edges of the edited constituent are taken from\n * `expression`, so Check works before Save.\n */\nexport function refineAnalysisForDependencyCycles(\n  analysis: AnalysisFull,\n  expression: string,\n  schema: RSForm,\n  alias?: string\n): AnalysisFull {\n  if (analysis.errors.length === 0 || !schema.graph) {\n    return analysis;\n  }\n\n  const currentId = alias ? schema.cstByAlias.get(alias)?.id : undefined;\n  const expressionGlobals = extractGlobals(expression);\n  const draftGraph =\n    currentId !== undefined ? buildDraftDependencyGraph(schema, currentId, expressionGlobals) : schema.graph;\n\n  let changed = false;\n  const errors = analysis.errors.map(error => {\n    if (error.code !== RSErrorCode.globalNotTyped && error.code !== RSErrorCode.globalFuncWithoutArgs) {\n      return error;\n    }\n    const missingAlias = error.params?.[0];\n    if (!missingAlias) {\n      return error;\n    }\n    const missing = schema.cstByAlias.get(missingAlias);\n    if (!missing) {\n      return error;\n    }\n    const cycleText = resolveDependencyCycleText(schema, draftGraph, currentId, missing.id);\n    if (!cycleText) {\n      return error;\n    }\n    changed = true;\n    return {\n      ...error,\n      code: RSErrorCode.schemaDependencyCycle,\n      params: [cycleText]\n    };\n  });\n  return changed ? { ...analysis, errors } : analysis;\n}\n\n/**\n * Clone the schema graph and replace dependencies of `currentId` with globals from the\n * expression under check (unsaved draft).\n */\nfunction buildDraftDependencyGraph(schema: RSForm, currentId: number, expressionGlobals: ReadonlySet<string>): Graph {\n  const graph = schema.graph.clone();\n  const node = graph.at(currentId);\n  if (node) {\n    for (const parentId of [...node.inputs]) {\n      graph.removeEdge(parentId, currentId);\n    }\n  } else {\n    graph.addNode(currentId);\n  }\n  for (const globalAlias of expressionGlobals) {\n    const source = schema.cstByAlias.get(globalAlias);\n    if (source) {\n      graph.addEdge(source.id, currentId);\n    }\n  }\n  return graph;\n}\n\n/**\n * Resolve formatted cycle text for an untyped global reference in analysis.\n *\n * Uses `graph` (often a draft graph built from the expression under check). When\n * `currentId` is omitted, falls back to schema diagnostics on `missingId`.\n *\n * @returns Closed alias path such as `F3 → P1 → F3`, or `null` when no shared cycle exists.\n */\nfunction resolveDependencyCycleText(\n  schema: RSForm,\n  graph: Graph,\n  currentId: number | undefined,\n  missingId: number\n): string | null {\n  for (const cycle of graph.findCycles()) {\n    const members = new Set(cycle);\n    if (!members.has(missingId)) {\n      continue;\n    }\n    if (currentId !== undefined && !members.has(currentId)) {\n      continue;\n    }\n    return formatDependencyCycle(cycle.map(id => schema.cstByID.get(id)?.alias ?? String(id)));\n  }\n\n  if (currentId === undefined) {\n    const cycleDiag = schema.cstByID\n      .get(missingId)\n      ?.diagnostics.find(item => item.code === RSDiagnosticCode.schemaDependencyCycle);\n    return cycleDiag?.params?.[0] ?? null;\n  }\n\n  return null;\n}\n","/**\n * Formal expression helpers: normalization, templates, status.\n */\n\nimport { type AstNode } from '../../parsing';\nimport { ValueClass } from '../../rslang';\nimport { generateExpressionFromAst, parseRSLangExpression } from '../../rslang/api';\nimport { type ArgumentValue, type Constituenta, CstStatus, CstType } from '../rsform';\n\nimport { isBasicConcept } from './cst-type';\n\n/** Infers the status of an expression based on parsing and value information. */\nexport function inferStatus(parse: boolean, value?: ValueClass | null): CstStatus {\n  if (!parse) {\n    return CstStatus.INCORRECT;\n  }\n  if (value === null) {\n    return CstStatus.INCALCULABLE;\n  }\n  if (value === ValueClass.PROPERTY) {\n    return CstStatus.PROPERTY;\n  }\n  return CstStatus.VERIFIED;\n}\n\n/** Infers type of constituent for a given template and arguments. */\nexport function inferTemplatedType(templateType: CstType, args: ArgumentValue[]): CstType {\n  if (args.length === 0 || args.some(arg => !arg.value)) {\n    return templateType;\n  } else if (templateType === CstType.PREDICATE) {\n    return CstType.AXIOM;\n  } else {\n    return CstType.TERM;\n  }\n}\n\n/**\n * Normalize a RSLang expression for duplicate comparison.\n *\n * Returns `null` for basic concepts without formal definitions. Pass a pre-parsed `ast`\n * when the expression was already analyzed to avoid re-parsing.\n */\nexport function normalizeExpression(expression: string, cst_type: CstType, ast?: AstNode | null): string | null {\n  if (isBasicConcept(cst_type) && cst_type !== CstType.AXIOM) {\n    return null;\n  }\n  const parsed = ast ?? parseRSLangExpression(expression);\n  let normalized = '';\n  if (parsed && !parsed.hasError) {\n    normalized = generateExpressionFromAst(parsed, { normalize: true });\n  } else {\n    normalized = expression;\n  }\n  normalized = normalized.replace(/\\s+/g, '');\n  return normalized === '' ? null : normalized;\n}\n\n/** Checks if given expression is a template. */\nexport function inferTemplate(expression: string): boolean {\n  const match = expression.match(/R\\d+/g);\n  return (match && match?.length > 0) ?? false;\n}\n\n/** Apply filter based on start {@link Constituenta} type. */\nexport function applyFilterCategory(start: Constituenta, items: Constituenta[]): Constituenta[] {\n  const startIndex = items.indexOf(start);\n  if (startIndex === -1) {\n    return [];\n  }\n  const nextCategoryIndex = items.findIndex((cst, index) => index > startIndex && cst.cst_type === CstType.STATEMENT);\n\n  return items.filter((_, index) => index >= startIndex && (nextCategoryIndex === -1 || index < nextCategoryIndex));\n}\n","/**\n * Semantic parent/children used when restoring constituent order.\n */\n\nimport { type Graph } from '../../graph';\nimport { extractGlobals, isSimpleExpression, splitTemplateDefinition } from '../../rslang/api';\nimport { CstType } from '../rsform';\n\nimport { isBaseSet, isFunctional } from './cst-type';\nimport { inferTemplate } from './expression';\nimport { type OrderableConstituenta, type SemanticRelations } from './types';\n\n/**\n * Infer semantic parent/children used for clustering during restore order.\n * Port of backend {@code SemanticInfo}.\n */\nexport function computeSemanticRelations(\n  items: readonly OrderableConstituenta[],\n  graph: Graph<number>\n): SemanticRelations {\n  const byId = new Map(items.map(cst => [cst.id, cst]));\n  const byAlias = new Map(items.map(cst => [cst.alias, cst]));\n  const isTemplate = new Map<number, boolean>();\n  const isSimple = new Map<number, boolean>();\n  const parentOf = new Map<number, number>();\n  const childrenOf = new Map<number, number[]>();\n\n  for (const cst of items) {\n    parentOf.set(cst.id, cst.id);\n    childrenOf.set(cst.id, []);\n  }\n\n  function needCheckHead(sources: Set<number>, head: string): boolean {\n    if (sources.size === 0) {\n      return true;\n    }\n    if (sources.size !== 1) {\n      return false;\n    }\n    const base = byId.get([...sources][0])!;\n    return !isFunctional(base.cst_type) || splitTemplateDefinition(base.definition_formal).head !== head;\n  }\n\n  function extractSources(target: OrderableConstituenta): Set<number> {\n    const sources = new Set<number>();\n    if (!isFunctional(target.cst_type)) {\n      for (const parentId of graph.at(target.id)?.inputs ?? []) {\n        if (!(isTemplate.get(parentId) && isSimple.get(parentId))) {\n          sources.add(parentOf.get(parentId) ?? parentId);\n        }\n      }\n      return sources;\n    }\n\n    const expression = splitTemplateDefinition(target.definition_formal);\n    for (const alias of extractGlobals(expression.body)) {\n      const parent = byAlias.get(alias);\n      if (!parent) {\n        continue;\n      }\n      if (!(isTemplate.get(parent.id) && isSimple.get(parent.id))) {\n        sources.add(parentOf.get(parent.id) ?? parent.id);\n      }\n    }\n    if (needCheckHead(sources, expression.head)) {\n      for (const alias of extractGlobals(expression.head)) {\n        const parent = byAlias.get(alias);\n        if (!parent) {\n          continue;\n        }\n        if (!isBaseSet(parent.cst_type) && !(isTemplate.get(parent.id) && isSimple.get(parent.id))) {\n          sources.add(parentOf.get(parent.id) ?? parent.id);\n        }\n      }\n    }\n    return sources;\n  }\n\n  function inferSimple(target: OrderableConstituenta): boolean {\n    if (target.cst_type === CstType.STRUCTURED || isBaseSet(target.cst_type)) {\n      return false;\n    }\n    const dependencies = graph.at(target.id)?.inputs ?? [];\n    if (dependencies.some(id => isTemplate.get(id) && !isSimple.get(id))) {\n      return false;\n    }\n    const expression = isFunctional(target.cst_type)\n      ? splitTemplateDefinition(target.definition_formal).body\n      : target.definition_formal;\n    return isSimpleExpression(expression);\n  }\n\n  for (const cstId of graph.topologicalOrder()) {\n    const cst = byId.get(cstId);\n    if (!cst) {\n      continue;\n    }\n    isTemplate.set(cstId, inferTemplate(cst.definition_formal));\n    isSimple.set(cstId, inferSimple(cst));\n    if (!isSimple.get(cstId) || cst.cst_type === CstType.STRUCTURED) {\n      continue;\n    }\n    const sources = extractSources(cst);\n    if (sources.size !== 1) {\n      continue;\n    }\n    const parentId = [...sources][0];\n    const parent = byId.get(parentId);\n    if (!parent || isBaseSet(parent.cst_type)) {\n      continue;\n    }\n    parentOf.set(cstId, parentId);\n    childrenOf.get(parentId)!.push(cstId);\n  }\n\n  return { parentOf, childrenOf };\n}\n","/**\n * Formal dependency graph and declaration-order restore for RSForm constituents.\n */\n\nimport { Graph } from '../../graph';\nimport { extractGlobals } from '../../rslang/api';\nimport { CstType } from '../rsform';\n\nimport { computeSemanticRelations } from './semantic-relations';\nimport { type OrderableConstituenta, type SemanticRelations } from './types';\n\n/**\n * Build the formal dependency graph: supplier → dependent.\n * Matches backend {@code RSForm.graph_formal}.\n */\nexport function buildFormalDependencyGraph(items: readonly OrderableConstituenta[]): Graph<number> {\n  const graph = new Graph<number>();\n  const byAlias = new Map(items.map(cst => [cst.alias, cst]));\n  for (const cst of items) {\n    graph.addNode(cst.id);\n  }\n  for (const cst of items) {\n    for (const alias of extractGlobals(cst.definition_formal)) {\n      const supplier = byAlias.get(alias);\n      if (supplier) {\n        graph.addEdge(supplier.id, cst.id);\n      }\n    }\n  }\n  return graph;\n}\n\n/**\n * Reorder constituents: formal topology hard, semantic children sticky when ready,\n * otherwise stable against type/kernel preferred ranks.\n *\n * One Kahn pass over the formal dependency graph.\n */\nexport function restoreConstituentOrder<T extends OrderableConstituenta>(\n  items: readonly T[],\n  graph: Graph<number> = buildFormalDependencyGraph(items),\n  relations: SemanticRelations = computeSemanticRelations(items, graph)\n): T[] {\n  if (items.length <= 1) {\n    return [...items];\n  }\n\n  const byId = new Map(items.map(cst => [cst.id, cst]));\n  const preferred = kernelPriority(items, graph, relations.parentOf);\n  const rank = new Map(preferred.map((cst, index) => [cst.id, index]));\n\n  const remainingInputs = new Map<number, number>();\n  for (const cst of preferred) {\n    const inputs = graph.at(cst.id)?.inputs ?? [];\n    remainingInputs.set(\n      cst.id,\n      inputs.reduce((count, src) => count + (rank.has(src) ? 1 : 0), 0)\n    );\n  }\n\n  const ready = new Set<number>();\n  for (const cst of preferred) {\n    if ((remainingInputs.get(cst.id) ?? 0) === 0) {\n      ready.add(cst.id);\n    }\n  }\n\n  const children = new Map<number, number[]>();\n  for (const cst of preferred) {\n    children.set(\n      cst.id,\n      (relations.childrenOf.get(cst.id) ?? []).filter(childId => rank.has(childId))\n    );\n  }\n\n  const result: T[] = [];\n  const pendingChildren: number[] = [];\n\n  function enqueueSticky(candidateIds: readonly number[]): void {\n    const sticky = candidateIds.filter(\n      childId => ready.has(childId) && !pendingChildren.includes(childId)\n    );\n    sticky.sort((left, right) => (rank.get(left) ?? 0) - (rank.get(right) ?? 0));\n    pendingChildren.push(...sticky);\n  }\n\n  function pickReady(): number {\n    while (pendingChildren.length > 0) {\n      const childId = pendingChildren.shift()!;\n      if (ready.has(childId)) {\n        return childId;\n      }\n    }\n    let best = -1;\n    let bestRank = Number.POSITIVE_INFINITY;\n    for (const nodeId of ready) {\n      const nodeRank = rank.get(nodeId) ?? Number.POSITIVE_INFINITY;\n      if (nodeRank < bestRank) {\n        best = nodeId;\n        bestRank = nodeRank;\n      }\n    }\n    return best;\n  }\n\n  while (ready.size > 0 || pendingChildren.length > 0) {\n    if (ready.size === 0) {\n      pendingChildren.length = 0;\n      continue;\n    }\n    const nodeId = pickReady();\n    ready.delete(nodeId);\n    result.push(byId.get(nodeId)!);\n\n    for (const dependentId of graph.at(nodeId)?.outputs ?? []) {\n      if (!remainingInputs.has(dependentId)) {\n        continue;\n      }\n      const next = (remainingInputs.get(dependentId) ?? 0) - 1;\n      remainingInputs.set(dependentId, next);\n      if (next === 0) {\n        ready.add(dependentId);\n      }\n    }\n\n    enqueueSticky(children.get(nodeId) ?? []);\n  }\n\n  if (result.length < preferred.length) {\n    const placed = new Set(result.map(cst => cst.id));\n    for (const cst of preferred) {\n      if (!placed.has(cst.id)) {\n        result.push(cst);\n      }\n    }\n  }\n\n  return result;\n}\n\nfunction kernelPriority<T extends OrderableConstituenta>(\n  items: readonly T[],\n  graph: Graph<number>,\n  parentOf: Map<number, number>\n): T[] {\n  const byId = new Map(items.map(cst => [cst.id, cst]));\n  const seen = new Set<number>();\n  const result: T[] = [];\n\n  function push(cst: T): void {\n    if (seen.has(cst.id)) {\n      return;\n    }\n    seen.add(cst.id);\n    result.push(cst);\n  }\n\n  for (const cst of items) {\n    if (cst.cst_type === CstType.BASE) {\n      push(cst);\n    }\n  }\n  for (const cst of items) {\n    if (cst.cst_type === CstType.CONSTANT) {\n      push(cst);\n    }\n  }\n  for (const cst of items) {\n    if ((graph.at(cst.id)?.inputs.length ?? 0) === 0) {\n      push(cst);\n    }\n  }\n\n  const kernelSeeds = items\n    .filter(cst => {\n      const parentId = parentOf.get(cst.id) ?? cst.id;\n      const parent = byId.get(parentId);\n      return (\n        cst.cst_type === CstType.STRUCTURED ||\n        cst.cst_type === CstType.AXIOM ||\n        parent?.cst_type === CstType.STRUCTURED\n      );\n    })\n    .map(cst => cst.id);\n  const kernel = new Set<number>([...kernelSeeds, ...graph.expandAllInputs(kernelSeeds)]);\n  for (const cst of items) {\n    if (kernel.has(cst.id)) {\n      push(cst);\n    }\n  }\n  for (const cst of items) {\n    push(cst);\n  }\n  return result;\n}\n","/**\n * Schema-level statistics and issue flags.\n */\n\nimport { TypeID, type Typification, ValueClass } from '../../rslang';\nimport { hasCstDiagnostic, RSDiagnosticCode } from '../diagnostics';\nimport { type Constituenta, CstStatus, CstType, type RSForm, type RSFormStats } from '../rsform';\n\nimport { isBasicConcept, isLogical } from './cst-type';\n\n/** Checks if {@link Constituenta} is a schema issue. */\nexport function isSchemaIssue(cst: Constituenta): boolean {\n  return (\n    (cst.diagnostics?.length ?? 0) > 0 || cst.status === CstStatus.INCORRECT || cst.status === CstStatus.INCALCULABLE\n  );\n}\n\n/** Calculate statistics for {@link RSForm}. */\nexport function calculateSchemaStats(target: RSForm): RSFormStats {\n  const stats: RSFormStats = {\n    count_all: target.items.length,\n    count_crucial: 0,\n    step_complexity: 0,\n    count_problematic: 0,\n    count_homonyms: 0,\n    count_formal_duplicates: 0,\n    count_missing_basic_text: 0,\n    count_type_mismatch: 0,\n    count_incorrect: 0,\n    count_property: 0,\n    count_incalculable: 0,\n    count_inherited: 0,\n    count_text_term: 0,\n    count_definition: 0,\n    count_convention: 0,\n    count_comment: 0,\n    count_base: 0,\n    count_constant: 0,\n    count_structured: 0,\n    count_axiom: 0,\n    count_term: 0,\n    count_function: 0,\n    count_predicate: 0,\n    count_statement: 0,\n    count_nominal: 0\n  };\n\n  for (const cst of target.items) {\n    if (cst.crucial) {\n      stats.count_crucial += 1;\n    }\n    stats.step_complexity += calculateStepComplexity(cst);\n\n    if (isSchemaIssue(cst)) {\n      stats.count_problematic += 1;\n    }\n    if (hasCstDiagnostic(cst, RSDiagnosticCode.schemaHomonym)) {\n      stats.count_homonyms += 1;\n    }\n    if (hasCstDiagnostic(cst, RSDiagnosticCode.schemaFormalDuplicate)) {\n      stats.count_formal_duplicates += 1;\n    }\n    if (isMissingBasicText(cst)) {\n      stats.count_missing_basic_text += 1;\n    }\n    if (cst.is_type_mismatch) {\n      stats.count_type_mismatch += 1;\n    }\n    if (cst.status === CstStatus.INCORRECT) {\n      stats.count_incorrect += 1;\n    }\n    if (cst.analysis?.valueClass === ValueClass.PROPERTY) {\n      stats.count_property += 1;\n    }\n    if (cst.analysis?.success && cst.analysis.valueClass === null) {\n      stats.count_incalculable += 1;\n    }\n    if (cst.is_inherited) {\n      stats.count_inherited += 1;\n    }\n    if (cst.term_raw) {\n      stats.count_text_term += 1;\n    }\n    if (cst.definition_raw) {\n      stats.count_definition += 1;\n    }\n    if (isBasicConcept(cst.cst_type) && cst.convention) {\n      stats.count_convention += 1;\n    }\n    if (!isBasicConcept(cst.cst_type) && !cst.convention) {\n      stats.count_comment += 1;\n    }\n\n    switch (cst.cst_type) {\n      case CstType.BASE:\n        stats.count_base += 1;\n        break;\n      case CstType.CONSTANT:\n        stats.count_constant += 1;\n        break;\n      case CstType.STRUCTURED:\n        stats.count_structured += 1;\n        break;\n      case CstType.AXIOM:\n        stats.count_axiom += 1;\n        break;\n      case CstType.TERM:\n        stats.count_term += 1;\n        break;\n      case CstType.FUNCTION:\n        stats.count_function += 1;\n        break;\n      case CstType.PREDICATE:\n        stats.count_predicate += 1;\n        break;\n      case CstType.STATEMENT:\n        stats.count_statement += 1;\n        break;\n      case CstType.NOMINAL:\n        stats.count_nominal += 1;\n        break;\n    }\n  }\n\n  return stats;\n}\n\nfunction calculateStepComplexity(cst: Constituenta): number {\n  if (cst.cst_type === CstType.AXIOM || cst.cst_type === CstType.NOMINAL || !isBasicConcept(cst.cst_type)) {\n    return 0;\n  }\n  if (cst.cst_type === CstType.BASE || cst.cst_type === CstType.CONSTANT || !cst.effectiveType) {\n    return 1;\n  }\n\n  const type = cst.effectiveType as Typification;\n  return calculateTypificationComplexity(type) + 1;\n}\n\nfunction calculateTypificationComplexity(type: Typification): number {\n  switch (type.typeID) {\n    case TypeID.basic:\n    case TypeID.integer:\n    case TypeID.anyTypification:\n      return 0;\n    case TypeID.tuple:\n      return (\n        type.factors.length + type.factors.reduce((sum, factor) => sum + calculateTypificationComplexity(factor), 0)\n      );\n    case TypeID.collection:\n      if (type.base.typeID === TypeID.tuple) {\n        let sum = 0;\n        type.base.factors.forEach(factor => {\n          sum += calculateTypificationComplexity(factor);\n        });\n        return sum + type.base.factors.length;\n      } else if (type.base.typeID === TypeID.collection) {\n        return calculateTypificationComplexity(type.base) + 1;\n      }\n      return 0;\n  }\n}\n\n/** Non-logical basic concept missing convention and/or resolved term (trimmed). */\nfunction isMissingBasicText(cst: Constituenta): boolean {\n  if (!isBasicConcept(cst.cst_type) || isLogical(cst.cst_type)) {\n    return false;\n  }\n  return !cst.convention.trim() || !cst.term_resolved.trim();\n}\n","/**\n * Structure-path helpers for spawned constituents.\n */\n\nimport { TypeID, type TypePath, type Typification } from '../../rslang';\nimport { isTypification } from '../../rslang/semantic/typification';\nimport { applyPath } from '../../rslang/semantic/typification-api';\nimport { type Constituenta, type RSForm } from '../rsform';\n\n/**\n * Id to pass as `insert_after` when creating a new {@link Constituenta} spawned by `targetId`:\n * after the last existing child of that spawner, or after the spawner itself if none.\n */\nexport function inferNewSpawnPosition(schema: RSForm, targetId: number): number {\n  let last: number | null = null;\n  for (const cst of schema.items) {\n    if (cst.spawner === targetId) {\n      last = cst.id;\n    }\n  }\n  return last ?? targetId;\n}\n\n/** Finds {@link Constituenta} by structure path. */\nexport function findCstByStructure(schema: RSForm, target: Constituenta, path: TypePath): Constituenta | null {\n  const byId = schema.cstByID ?? new Map(schema.items.map(item => [item.id, item]));\n  for (const cst of schema.items) {\n    if (!cst.spawner_path) {\n      continue;\n    }\n    const absolutePath = resolveAbsoluteSpawnerPath(cst, target.id, byId);\n    if (absolutePath?.length === path.length && absolutePath.every((v, i) => v === path[i])) {\n      return cst;\n    }\n  }\n  return null;\n}\n\n/** Retrieves name for piece of target {@link Constituenta} structure. */\nexport function getStructureName(schema: RSForm, target: Constituenta, path: TypePath): string {\n  const representation = findCstByStructure(schema, target, path);\n  if (representation) {\n    return `${representation.alias}: ${representation.term_resolved}`;\n  }\n  if (!isTypification(target.effectiveType)) {\n    return '';\n  }\n  const type = applyPath(target.effectiveType as Typification, path);\n  if (type?.typeID === TypeID.basic) {\n    const cst = schema.cstByAlias.get(type.baseID);\n    if (cst?.term_resolved) {\n      return `${cst.alias}: ${cst.term_resolved}`;\n    }\n  }\n  return '';\n}\n\nfunction resolveAbsoluteSpawnerPath(\n  cst: Constituenta,\n  targetId: number,\n  byId: Map<number, Constituenta>\n): TypePath | null {\n  if (!cst.spawner_path || cst.spawner == null) {\n    return null;\n  }\n  if (cst.spawner === targetId) {\n    return cst.spawner_path;\n  }\n\n  const visited = new Set<number>([cst.id]);\n  let currentPath: number[] = [...cst.spawner_path];\n  let currentSpawnerId: number | null = cst.spawner;\n\n  while (currentSpawnerId != null) {\n    if (currentSpawnerId === targetId) {\n      return currentPath as TypePath;\n    }\n    if (visited.has(currentSpawnerId)) {\n      return null;\n    }\n    visited.add(currentSpawnerId);\n\n    const parent = byId.get(currentSpawnerId);\n    if (!parent?.spawner_path || parent.spawner == null) {\n      return null;\n    }\n\n    currentPath = [...parent.spawner_path, ...currentPath];\n    currentSpawnerId = parent.spawner;\n  }\n\n  return null;\n}\n","/**\n * Inline synthesis helpers for library item selection.\n */\n\nimport { type LibraryItem } from '../library';\nimport { type RSForm } from '../rsform';\n\n/** Sorts library items relevant for InlineSynthesis with specified {@link RSForm}. */\nexport function sortItemsForInlineSynthesis(receiver: RSForm, items: readonly LibraryItem[]): LibraryItem[] {\n  const result = items.filter(item => item.location === receiver.location);\n  for (const item of items) {\n    if (item.visible && item.owner === receiver.owner && !result.includes(item)) {\n      result.push(item);\n    }\n  }\n  for (const item of items) {\n    if (item.visible && !result.includes(item)) {\n      result.push(item);\n    }\n  }\n  for (const item of items) {\n    if (!result.includes(item)) {\n      result.push(item);\n    }\n  }\n  return result;\n}\n","/**\n * Module: Compact diagnostics for constituents (schema and model issue codes).\n */\n\nimport { type Graph } from '../graph';\nimport { labelType } from '../rslang/labels';\n\nimport { type Constituenta, type CstType } from './rsform';\nimport { isBasicConcept, isLogical } from './rsform-api';\nimport { EvalStatus } from './rsmodel';\n\n/** Origin of a diagnostic. */\nexport const DiagnosticKind = {\n  EXPRESSION: 'expression',\n  SCHEMA: 'schema',\n  MODEL: 'model'\n} as const;\nexport type DiagnosticKind = (typeof DiagnosticKind)[keyof typeof DiagnosticKind];\n\n/** Schema and model diagnostic codes (same numeric format as {@link RSErrorCode}). */\nexport const RSDiagnosticCode = {\n  schemaHomonym: 0x8901,\n  schemaFormalDuplicate: 0x8902,\n  schemaMissingConvention: 0x8903,\n  schemaMissingTerm: 0x8904,\n  schemaTypeMismatch: 0x8905,\n  schemaDependencyCycle: 0x8906,\n\n  modelEmpty: 0x8910,\n  modelAxiomFalse: 0x8911,\n  modelInvalidData: 0x8912,\n  modelEvalFail: 0x8913\n} as const;\nexport type RSDiagnosticCode = (typeof RSDiagnosticCode)[keyof typeof RSDiagnosticCode];\n\n/** Compact diagnostic stored on {@link Constituenta} after schema loading. */\nexport interface CstDiagnostic {\n  kind: DiagnosticKind;\n  code: number;\n  /** Positional message arguments (per-code; homonyms/duplicates use `[aliases]`). */\n  params?: readonly string[];\n}\n\n/** Whether a constituent has a schema/model diagnostic with the given code. */\nexport function hasCstDiagnostic(cst: Constituenta, code: RSDiagnosticCode): boolean {\n  return cst.diagnostics?.some(item => item.code === code) ?? false;\n}\n\n/**\n * Populate `diagnostics` on each constituent (homonyms, duplicates, metadata, type mismatch, cycles).\n *\n * Requires normalized formal definitions for duplicate detection (same as Portal loader).\n * When `graph` is provided, dependency cycles are reported as {@link RSDiagnosticCode.schemaDependencyCycle}.\n */\nexport function assignSchemaDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string,\n  normalizedDefinitions: ReadonlyMap<number, string>,\n  graph?: Graph\n): void {\n  const homonymById = detectHomonymDiagnostics(items, resolveAlias);\n  const duplicateById = detectFormalDuplicateDiagnostics(items, resolveAlias, normalizedDefinitions);\n  const cycleById = graph ? detectDependencyCycleDiagnostics(graph, resolveAlias) : new Map<number, CstDiagnostic>();\n\n  for (const cst of items) {\n    const diagnostics: CstDiagnostic[] = [];\n    const cycle = cycleById.get(cst.id);\n    if (cycle) {\n      diagnostics.push(cycle);\n    }\n    const homonym = homonymById.get(cst.id);\n    if (homonym) {\n      diagnostics.push(homonym);\n    }\n    const duplicate = duplicateById.get(cst.id);\n    if (duplicate) {\n      diagnostics.push(duplicate);\n    }\n    diagnostics.push(...collectLocalSchemaDiagnostics(cst));\n    cst.diagnostics = diagnostics;\n  }\n}\n\n/**\n * Format a closed dependency cycle as `A → B → A`.\n *\n * Rotates the path to start at the lexicographically smallest alias so the same\n * cycle always renders identically regardless of graph traversal order.\n *\n * @param aliases Closed or open alias path from {@link Graph.findCycles}.\n * @returns Human-readable cycle text joined with ` → `.\n */\nexport function formatDependencyCycle(aliases: readonly string[]): string {\n  if (aliases.length < 2) {\n    return aliases.join(' → ');\n  }\n\n  const closed = aliases[0] === aliases[aliases.length - 1];\n  const open = closed ? aliases.slice(0, -1) : [...aliases];\n  if (open.length === 0) {\n    return aliases.join(' → ');\n  }\n\n  let bestStart = 0;\n  for (let index = 1; index < open.length; index++) {\n    const alias = open[index];\n    const bestAlias = open[bestStart];\n    if (alias !== undefined && bestAlias !== undefined && alias < bestAlias) {\n      bestStart = index;\n    }\n  }\n  const rotated = [...open.slice(bestStart), ...open.slice(0, bestStart)];\n  if (closed) {\n    const first = rotated[0];\n    if (first !== undefined) {\n      rotated.push(first);\n    }\n  }\n  return rotated.join(' → ');\n}\n\n/**\n * Map each node id that participates in a dependency cycle to a schema diagnostic.\n *\n * `params[0]` is the closed cycle path (`F3 → P1 → F3`).\n *\n * @param graph Constituent dependency graph (provider → dependent edges).\n * @param resolveAlias Maps node id to display alias for cycle formatting.\n * @returns One {@link CstDiagnostic} per node on each cyclic SCC.\n */\nexport function detectDependencyCycleDiagnostics(\n  graph: Graph,\n  resolveAlias: (id: number) => string\n): Map<number, CstDiagnostic> {\n  const result = new Map<number, CstDiagnostic>();\n  for (const cycle of graph.findCycles()) {\n    if (cycle.length < 2) {\n      continue;\n    }\n    const aliases = cycle.map(id => resolveAlias(id));\n    const cycleText = formatDependencyCycle(aliases);\n    const memberIds = new Set(cycle);\n    for (const id of memberIds) {\n      result.set(id, {\n        kind: DiagnosticKind.SCHEMA,\n        code: RSDiagnosticCode.schemaDependencyCycle,\n        params: [cycleText]\n      });\n    }\n  }\n  return result;\n}\n\n/** Map a model evaluation status to a compact diagnostic, or `null` when not an issue. */\nexport function modelStatusCstDiagnostic(status: EvalStatus, cstType: CstType): CstDiagnostic | null {\n  const code = modelStatusToCode(status, cstType);\n  if (code === null) {\n    return null;\n  }\n  return { kind: DiagnosticKind.MODEL, code, params: [String(status)] };\n}\n\nfunction collectLocalSchemaDiagnostics(cst: Constituenta): CstDiagnostic[] {\n  const result: CstDiagnostic[] = [];\n  if (cst.is_type_mismatch) {\n    result.push({\n      kind: DiagnosticKind.SCHEMA,\n      code: RSDiagnosticCode.schemaTypeMismatch,\n      params: [cst.typification_manual, labelType(cst.analysis.type)]\n    });\n  }\n  if (isBasicConcept(cst.cst_type) && !isLogical(cst.cst_type)) {\n    if (!cst.convention.trim()) {\n      result.push({ kind: DiagnosticKind.SCHEMA, code: RSDiagnosticCode.schemaMissingConvention });\n    }\n    if (!cst.term_resolved.trim()) {\n      result.push({ kind: DiagnosticKind.SCHEMA, code: RSDiagnosticCode.schemaMissingTerm });\n    }\n  }\n  return result;\n}\n\nfunction detectGroupedAliasDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string,\n  groupKey: (cst: Constituenta) => string | undefined,\n  code: RSDiagnosticCode\n): Map<number, CstDiagnostic> {\n  const groups = new Map<string, Constituenta[]>();\n  for (const cst of items) {\n    const key = groupKey(cst);\n    if (!key) {\n      continue;\n    }\n    const group = groups.get(key) ?? [];\n    group.push(cst);\n    groups.set(key, group);\n  }\n\n  const result = new Map<number, CstDiagnostic>();\n  for (const group of groups.values()) {\n    if (group.length <= 1) {\n      continue;\n    }\n    for (const cst of group) {\n      const aliases = group\n        .filter(other => other.id !== cst.id)\n        .map(other => resolveAlias(other.id))\n        .join(', ');\n      result.set(cst.id, {\n        kind: DiagnosticKind.SCHEMA,\n        code,\n        params: [aliases]\n      });\n    }\n  }\n  return result;\n}\n\nfunction detectHomonymDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string\n): Map<number, CstDiagnostic> {\n  return detectGroupedAliasDiagnostics(\n    items,\n    resolveAlias,\n    cst => {\n      const key = cst.term_resolved.trim().toLocaleLowerCase();\n      return key === '' ? undefined : key;\n    },\n    RSDiagnosticCode.schemaHomonym\n  );\n}\n\nfunction detectFormalDuplicateDiagnostics(\n  items: Constituenta[],\n  resolveAlias: (id: number) => string,\n  normalizedDefinitions: ReadonlyMap<number, string>\n): Map<number, CstDiagnostic> {\n  return detectGroupedAliasDiagnostics(\n    items,\n    resolveAlias,\n    cst => normalizedDefinitions.get(cst.id),\n    RSDiagnosticCode.schemaFormalDuplicate\n  );\n}\n\nfunction modelStatusToCode(status: EvalStatus, cstType: CstType): RSDiagnosticCode | null {\n  switch (status) {\n    case EvalStatus.EMPTY:\n      return isBasicConcept(cstType) ? RSDiagnosticCode.modelEmpty : null;\n    case EvalStatus.AXIOM_FALSE:\n      return RSDiagnosticCode.modelAxiomFalse;\n    case EvalStatus.INVALID_DATA:\n      return RSDiagnosticCode.modelInvalidData;\n    case EvalStatus.EVAL_FAIL:\n      return RSDiagnosticCode.modelEvalFail;\n    default:\n      return null;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AASA,MAAM,kBAA2C;EAC9C,QAAQ,UAAU;EAClB,QAAQ,OAAO;EACf,QAAQ,WAAW;EACnB,QAAQ,aAAa;EACrB,QAAQ,QAAQ;EAChB,QAAQ,OAAO;EACf,QAAQ,WAAW;EACnB,QAAQ,YAAY;EACpB,QAAQ,YAAY;AACvB;;AAGA,MAAM,oBAA+C;EAClD,QAAQ,UAAU,SAAS;EAC3B,QAAQ,OAAO,SAAS;EACxB,QAAQ,WAAW,SAAS;EAC5B,QAAQ,aAAa,SAAS;EAC9B,QAAQ,OAAO,SAAS;EACxB,QAAQ,WAAW,SAAS;EAC5B,QAAQ,QAAQ,SAAS;EACzB,QAAQ,YAAY,SAAS;EAC7B,QAAQ,YAAY,SAAS;AAChC;;AAGA,SAAgB,iBAAiB,MAAuB;CACtD,OAAO,gBAAgB;AACzB;;AAGA,SAAgB,aAAa,MAA8B;CACzD,IAAI,KAAK,WAAW,GAClB,OAAO;CAET,KAAK,MAAM,CAAC,MAAM,WAAW,OAAO,QAAQ,eAAe,GACzD,IAAI,SAAS,QACX,OAAO;CAGX,OAAO;AACT;;AAGA,SAAgB,WAAW,MAAe,aAAsB,OAAiB;CAC/E,IAAI,YACF,OAAO,SAAS;CAElB,OAAO,kBAAkB;AAC3B;;AAGA,SAAgB,cAAc,KAA4B;CACxD,OAAO,IAAI,aAAa,QAAQ,YAAY,IAAI,aAAa,QAAQ,aAAa,IAAI,aAAa,QAAQ;AAC7G;;AAGA,SAAgB,eAAe,MAAwB;CACrD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,OACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,UAAU,MAAwB;CAChD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ,UACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,aAAa,MAAwB;CACnD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,UAAU,MAAwB;CAChD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,0BAA0B,MAAwB;CAChE,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,wBAAwB,SAA2B;CACjE,OAAO,YAAY,QAAQ,QAAQ,YAAY,QAAQ;AACzD;;AAGA,SAAgB,oBAAoB,SAA6B;CAC/D,QAAQ,SAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,MACX,OAAO,UAAU;EACnB,KAAK,QAAQ,UACX,OAAO,UAAU;EACnB,KAAK,QAAQ,WACX,OAAO,UAAU;EACnB,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO,UAAU;CACrB;AACF;;AAGA,SAAgB,oBAAoB,KAA4B;CAC9D,QAAQ,IAAI,UAAZ;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;CACA,IAAI,CAAC,IAAI,eACP,OAAO;CAET,IAAI,IAAI,aAAa,QAAQ,UAAU;EACrC,MAAM,SAAU,IAAI,cAAoC;EACxD,OAAO,wBAAwB,MAAM;CACvC;CACA,IAAI,CAAC,eAAe,IAAI,aAAa,GACnC,OAAO;CAET,OAAO,wBAAwB,IAAI,aAA6B;AAClE;AAEA,SAAS,wBAAwB,MAA6B;CAC5D,IAAI,KAAK,WAAW,OAAO,SAAS,KAAK,WAAW,OAAO,WAAW,KAAK,WAAW,OAAO,iBAC3F,OAAO;MACF,IAAI,KAAK,WAAW,OAAO,OAChC,OAAO;MAEP,OACE,KAAK,KAAK,WAAW,OAAO,SAC5B,KAAK,KAAK,WAAW,OAAO,WAC5B,KAAK,KAAK,WAAW,OAAO;AAGlC;;;;;;;ACnMA,SAAgB,wBAAwB,MAAqC;CAC3E,MAAM,UAAwB,CAAC;CAC/B,KAAK,MAAM,OAAO,MAChB,IAAI,IAAI,OACN,QAAQ,IAAI,SAAS,IAAI;CAG7B,OAAO;AACT;;AAGA,SAAgB,oBAAoB,OAAe,MAAwB;CACzE,IAAI,MAAM,SAAS,GACjB,OAAO;CAET,MAAM,SAAS,iBAAiB,IAAI;CACpC,IAAI,CAAC,MAAM,WAAW,MAAM,GAC1B,OAAO;CAET,IAAI,CAAC,QAAQ,KAAK,MAAM,UAAU,OAAO,MAAM,CAAC,GAC9C,OAAO;CAET,OAAO;AACT;;AAGA,SAAgB,iBAAiB,OAAe,MAAe,QAAyB;CACtF,IAAI,CAAC,oBAAoB,OAAO,IAAI,GAClC,OAAO;CAET,IAAI,OAAO,WAAW,IAAI,KAAK,GAC7B,OAAO;CAET,OAAO;AACT;;AAGA,SAAgB,cAAc,MAAe,QAAgB,eAAyB,CAAC,GAAW;CAChG,MAAM,SAAS,iBAAiB,IAAI;CACpC,IAAI,QAAQ,OAAO,MAAM,QAAQ,MAAM,QAAQ;EAC7C,IAAI,IAAI,aAAa,MACnB,OAAO;EAET,MAAM,OAAO,OAAO,IAAI,MAAM,UAAU,OAAO,MAAM,CAAC,IAAI;EAC1D,OAAO,KAAK,IAAI,MAAM,IAAI;CAC5B,GAAG,CAAC;CACJ,IAAI,QAAQ,GAAG,SAAS;CACxB,OAAO,aAAa,SAAS,KAAK,GAAG;EACnC,QAAQ,QAAQ;EAChB,QAAQ,GAAG,SAAS;CACtB;CACA,OAAO;AACT;;;;;AAMA,SAAgB,2BACd,OACA,SACA,eACM;CACN,KAAK,MAAM,OAAO,OAAO;EACvB,IAAI,iBAAiB,IAAI,SAAS,SAChC,IAAI,QAAQ,QAAQ,IAAI;EAE1B,IAAI,oBAAoB,kBAAkB,IAAI,mBAAmB,OAAO;EACxE,IAAI,sBAAsB,yBAAyB,IAAI,qBAAqB,OAAO;EACnF,IAAI,WAAW,4BAA4B,IAAI,UAAU,OAAO;EAChE,IAAI,iBAAiB,4BAA4B,IAAI,gBAAgB,OAAO;CAC9E;AACF;;AAGA,SAAgB,qBAAqB,YAAoB,OAAuB;CAC9E,MAAM,UAAU,MAAM,QAAQ,uBAAuB,MAAM;CAC3D,OAAO,WAAW,WAAW,IAAI,OAAO,MAAM,QAAQ,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,KAAK;AAC7E;;AAGA,SAAgB,kBAAkB,YAAoB,OAAuB;CAC3E,OAAO,aAAa,MAAM;AAC5B;;;AC1FA,SAAgB,eAAe,YAAoB,SAAkB,QAAgB,OAA8B;CACjH,IAAI,CAAC,wBAAwB,OAAO,GAAG;EACrC,IAAI,WAAW,KAAK,CAAC,CAAC,WAAW,GAAG;GAClC,MAAM,gBAAgB,SAAS,MAAM,SAAS,IAAI,QAAQ;GAE1D,OAAO;IACL,SAAS;IACT,MAHW,YAAY,QAAQ,OAAO,KAAK,MAAM,aAAa,CAAC,IAAI,KAAK,SAAS,aAAa,CAAC;IAI/F,YAAY,WAAW;IACvB,QAAQ,CAAC;IACT,KAAK;GACP;EACF;EACA,OAAO;GACL,SAAS;GACT,MAAM;GACN,YAAY;GACZ,QAAQ,CACN;IACE,MAAM,YAAY;IAClB,MAAM;IACN,IAAI,KAAK,IAAI,WAAW,QAAQ,CAAC;IACjC,QAAQ,CAAC,SAAS,SAAS,EAAE;GAC/B,CACF;GACA,KAAK;EACP;CACF;CAKA,OAAO,kCAJU,OAAO,SAAS,UAAU,YAAY;EACrD,UAAU,oBAAoB,OAAO;EACrC,UAAU,YAAY,QAAQ;CAChC,CACyC,GAAU,YAAY,QAAQ,KAAK;AAC9E;;;;;;;;;;;AAYA,SAAgB,kCACd,UACA,YACA,QACA,OACc;CACd,IAAI,SAAS,OAAO,WAAW,KAAK,CAAC,OAAO,OAC1C,OAAO;CAGT,MAAM,YAAY,QAAQ,OAAO,WAAW,IAAI,KAAK,CAAC,EAAE,KAAK;CAC7D,MAAM,oBAAoB,eAAe,UAAU;CACnD,MAAM,aACJ,cAAc,SAAY,0BAA0B,QAAQ,WAAW,iBAAiB,IAAI,OAAO;CAErG,IAAI,UAAU;CACd,MAAM,SAAS,SAAS,OAAO,KAAI,UAAS;EAC1C,IAAI,MAAM,SAAS,YAAY,kBAAkB,MAAM,SAAS,YAAY,uBAC1E,OAAO;EAET,MAAM,eAAe,MAAM,SAAS;EACpC,IAAI,CAAC,cACH,OAAO;EAET,MAAM,UAAU,OAAO,WAAW,IAAI,YAAY;EAClD,IAAI,CAAC,SACH,OAAO;EAET,MAAM,YAAY,2BAA2B,QAAQ,YAAY,WAAW,QAAQ,EAAE;EACtF,IAAI,CAAC,WACH,OAAO;EAET,UAAU;EACV,OAAO;GACL,GAAG;GACH,MAAM,YAAY;GAClB,QAAQ,CAAC,SAAS;EACpB;CACF,CAAC;CACD,OAAO,UAAU;EAAE,GAAG;EAAU;CAAO,IAAI;AAC7C;;;;;AAMA,SAAS,0BAA0B,QAAgB,WAAmB,mBAA+C;CACnH,MAAM,QAAQ,OAAO,MAAM,MAAM;CACjC,MAAM,OAAO,MAAM,GAAG,SAAS;CAC/B,IAAI,MACF,KAAK,MAAM,YAAY,CAAC,GAAG,KAAK,MAAM,GACpC,MAAM,WAAW,UAAU,SAAS;MAGtC,MAAM,QAAQ,SAAS;CAEzB,KAAK,MAAM,eAAe,mBAAmB;EAC3C,MAAM,SAAS,OAAO,WAAW,IAAI,WAAW;EAChD,IAAI,QACF,MAAM,QAAQ,OAAO,IAAI,SAAS;CAEtC;CACA,OAAO;AACT;;;;;;;;;AAUA,SAAS,2BACP,QACA,OACA,WACA,WACe;CACf,KAAK,MAAM,SAAS,MAAM,WAAW,GAAG;EACtC,MAAM,UAAU,IAAI,IAAI,KAAK;EAC7B,IAAI,CAAC,QAAQ,IAAI,SAAS,GACxB;EAEF,IAAI,cAAc,UAAa,CAAC,QAAQ,IAAI,SAAS,GACnD;EAEF,OAAO,sBAAsB,MAAM,KAAI,OAAM,OAAO,QAAQ,IAAI,EAAE,CAAC,EAAE,SAAS,OAAO,EAAE,CAAC,CAAC;CAC3F;CAEA,IAAI,cAAc,QAIhB,QAHkB,OAAO,QACtB,IAAI,SAAS,CAAC,EACb,YAAY,MAAK,SAAQ,KAAK,SAAS,iBAAiB,qBAAqB,EAC1E,EAAW,SAAS,MAAM;CAGnC,OAAO;AACT;;;;AChJA,SAAgB,YAAY,OAAgB,OAAsC;CAChF,IAAI,CAAC,OACH,OAAO,UAAU;CAEnB,IAAI,UAAU,MACZ,OAAO,UAAU;CAEnB,IAAI,UAAU,WAAW,UACvB,OAAO,UAAU;CAEnB,OAAO,UAAU;AACnB;;AAGA,SAAgB,mBAAmB,cAAuB,MAAgC;CACxF,IAAI,KAAK,WAAW,KAAK,KAAK,MAAK,QAAO,CAAC,IAAI,KAAK,GAClD,OAAO;MACF,IAAI,iBAAiB,QAAQ,WAClC,OAAO,QAAQ;MAEf,OAAO,QAAQ;AAEnB;;;;;;;AAQA,SAAgB,oBAAoB,YAAoB,UAAmB,KAAqC;CAC9G,IAAI,eAAe,QAAQ,KAAK,aAAa,QAAQ,OACnD,OAAO;CAET,MAAM,SAAS,OAAO,sBAAsB,UAAU;CACtD,IAAI,aAAa;CACjB,IAAI,UAAU,CAAC,OAAO,UACpB,aAAa,0BAA0B,QAAQ,EAAE,WAAW,KAAK,CAAC;MAElE,aAAa;CAEf,aAAa,WAAW,QAAQ,QAAQ,EAAE;CAC1C,OAAO,eAAe,KAAK,OAAO;AACpC;;AAGA,SAAgB,cAAc,YAA6B;CACzD,MAAM,QAAQ,WAAW,MAAM,OAAO;CACtC,QAAQ,SAAS,OAAO,SAAS,MAAM;AACzC;;AAGA,SAAgB,oBAAoB,OAAqB,OAAuC;CAC9F,MAAM,aAAa,MAAM,QAAQ,KAAK;CACtC,IAAI,eAAe,IACjB,OAAO,CAAC;CAEV,MAAM,oBAAoB,MAAM,WAAW,KAAK,UAAU,QAAQ,cAAc,IAAI,aAAa,QAAQ,SAAS;CAElH,OAAO,MAAM,QAAQ,GAAG,UAAU,SAAS,eAAe,sBAAsB,MAAM,QAAQ,kBAAkB;AAClH;;;;;;;ACxDA,SAAgB,yBACd,OACA,OACmB;CACnB,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;CACpD,MAAM,UAAU,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC;CAC1D,MAAM,6BAAa,IAAI,IAAqB;CAC5C,MAAM,2BAAW,IAAI,IAAqB;CAC1C,MAAM,2BAAW,IAAI,IAAoB;CACzC,MAAM,6BAAa,IAAI,IAAsB;CAE7C,KAAK,MAAM,OAAO,OAAO;EACvB,SAAS,IAAI,IAAI,IAAI,IAAI,EAAE;EAC3B,WAAW,IAAI,IAAI,IAAI,CAAC,CAAC;CAC3B;CAEA,SAAS,cAAc,SAAsB,MAAuB;EAClE,IAAI,QAAQ,SAAS,GACnB,OAAO;EAET,IAAI,QAAQ,SAAS,GACnB,OAAO;EAET,MAAM,OAAO,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE;EACrC,OAAO,CAAC,aAAa,KAAK,QAAQ,KAAK,wBAAwB,KAAK,iBAAiB,CAAC,CAAC,SAAS;CAClG;CAEA,SAAS,eAAe,QAA4C;EAClE,MAAM,0BAAU,IAAI,IAAY;EAChC,IAAI,CAAC,aAAa,OAAO,QAAQ,GAAG;GAClC,KAAK,MAAM,YAAY,MAAM,GAAG,OAAO,EAAE,CAAC,EAAE,UAAU,CAAC,GACrD,IAAI,EAAE,WAAW,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,IACrD,QAAQ,IAAI,SAAS,IAAI,QAAQ,KAAK,QAAQ;GAGlD,OAAO;EACT;EAEA,MAAM,aAAa,wBAAwB,OAAO,iBAAiB;EACnE,KAAK,MAAM,SAAS,eAAe,WAAW,IAAI,GAAG;GACnD,MAAM,SAAS,QAAQ,IAAI,KAAK;GAChC,IAAI,CAAC,QACH;GAEF,IAAI,EAAE,WAAW,IAAI,OAAO,EAAE,KAAK,SAAS,IAAI,OAAO,EAAE,IACvD,QAAQ,IAAI,SAAS,IAAI,OAAO,EAAE,KAAK,OAAO,EAAE;EAEpD;EACA,IAAI,cAAc,SAAS,WAAW,IAAI,GACxC,KAAK,MAAM,SAAS,eAAe,WAAW,IAAI,GAAG;GACnD,MAAM,SAAS,QAAQ,IAAI,KAAK;GAChC,IAAI,CAAC,QACH;GAEF,IAAI,CAAC,UAAU,OAAO,QAAQ,KAAK,EAAE,WAAW,IAAI,OAAO,EAAE,KAAK,SAAS,IAAI,OAAO,EAAE,IACtF,QAAQ,IAAI,SAAS,IAAI,OAAO,EAAE,KAAK,OAAO,EAAE;EAEpD;EAEF,OAAO;CACT;CAEA,SAAS,YAAY,QAAwC;EAC3D,IAAI,OAAO,aAAa,QAAQ,cAAc,UAAU,OAAO,QAAQ,GACrE,OAAO;EAGT,KADqB,MAAM,GAAG,OAAO,EAAE,CAAC,EAAE,UAAU,CAAC,EACjD,CAAa,MAAK,OAAM,WAAW,IAAI,EAAE,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC,GACjE,OAAO;EAKT,OAAO,mBAHY,aAAa,OAAO,QAAQ,IAC3C,wBAAwB,OAAO,iBAAiB,CAAC,CAAC,OAClD,OAAO,iBACyB;CACtC;CAEA,KAAK,MAAM,SAAS,MAAM,iBAAiB,GAAG;EAC5C,MAAM,MAAM,KAAK,IAAI,KAAK;EAC1B,IAAI,CAAC,KACH;EAEF,WAAW,IAAI,OAAO,cAAc,IAAI,iBAAiB,CAAC;EAC1D,SAAS,IAAI,OAAO,YAAY,GAAG,CAAC;EACpC,IAAI,CAAC,SAAS,IAAI,KAAK,KAAK,IAAI,aAAa,QAAQ,YACnD;EAEF,MAAM,UAAU,eAAe,GAAG;EAClC,IAAI,QAAQ,SAAS,GACnB;EAEF,MAAM,WAAW,CAAC,GAAG,OAAO,CAAC,CAAC;EAC9B,MAAM,SAAS,KAAK,IAAI,QAAQ;EAChC,IAAI,CAAC,UAAU,UAAU,OAAO,QAAQ,GACtC;EAEF,SAAS,IAAI,OAAO,QAAQ;EAC5B,WAAW,IAAI,QAAQ,CAAC,CAAE,KAAK,KAAK;CACtC;CAEA,OAAO;EAAE;EAAU;CAAW;AAChC;;;;;;;;;;ACrGA,SAAgB,2BAA2B,OAAwD;CACjG,MAAM,QAAQ,IAAI,MAAc;CAChC,MAAM,UAAU,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC;CAC1D,KAAK,MAAM,OAAO,OAChB,MAAM,QAAQ,IAAI,EAAE;CAEtB,KAAK,MAAM,OAAO,OAChB,KAAK,MAAM,SAAS,eAAe,IAAI,iBAAiB,GAAG;EACzD,MAAM,WAAW,QAAQ,IAAI,KAAK;EAClC,IAAI,UACF,MAAM,QAAQ,SAAS,IAAI,IAAI,EAAE;CAErC;CAEF,OAAO;AACT;;;;;;;AAQA,SAAgB,wBACd,OACA,QAAuB,2BAA2B,KAAK,GACvD,YAA+B,yBAAyB,OAAO,KAAK,GAC/D;CACL,IAAI,MAAM,UAAU,GAClB,OAAO,CAAC,GAAG,KAAK;CAGlB,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;CACpD,MAAM,YAAY,eAAe,OAAO,OAAO,UAAU,QAAQ;CACjE,MAAM,OAAO,IAAI,IAAI,UAAU,KAAK,KAAK,UAAU,CAAC,IAAI,IAAI,KAAK,CAAC,CAAC;CAEnE,MAAM,kCAAkB,IAAI,IAAoB;CAChD,KAAK,MAAM,OAAO,WAAW;EAC3B,MAAM,SAAS,MAAM,GAAG,IAAI,EAAE,CAAC,EAAE,UAAU,CAAC;EAC5C,gBAAgB,IACd,IAAI,IACJ,OAAO,QAAQ,OAAO,QAAQ,SAAS,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,CAClE;CACF;CAEA,MAAM,wBAAQ,IAAI,IAAY;CAC9B,KAAK,MAAM,OAAO,WAChB,KAAK,gBAAgB,IAAI,IAAI,EAAE,KAAK,OAAO,GACzC,MAAM,IAAI,IAAI,EAAE;CAIpB,MAAM,2BAAW,IAAI,IAAsB;CAC3C,KAAK,MAAM,OAAO,WAChB,SAAS,IACP,IAAI,KACH,UAAU,WAAW,IAAI,IAAI,EAAE,KAAK,CAAC,EAAA,CAAG,QAAO,YAAW,KAAK,IAAI,OAAO,CAAC,CAC9E;CAGF,MAAM,SAAc,CAAC;CACrB,MAAM,kBAA4B,CAAC;CAEnC,SAAS,cAAc,cAAuC;EAC5D,MAAM,SAAS,aAAa,QAC1B,YAAW,MAAM,IAAI,OAAO,KAAK,CAAC,gBAAgB,SAAS,OAAO,CACpE;EACA,OAAO,MAAM,MAAM,WAAW,KAAK,IAAI,IAAI,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK,EAAE;EAC3E,gBAAgB,KAAK,GAAG,MAAM;CAChC;CAEA,SAAS,YAAoB;EAC3B,OAAO,gBAAgB,SAAS,GAAG;GACjC,MAAM,UAAU,gBAAgB,MAAM;GACtC,IAAI,MAAM,IAAI,OAAO,GACnB,OAAO;EAEX;EACA,IAAI,OAAO;EACX,IAAI,WAAW,OAAO;EACtB,KAAK,MAAM,UAAU,OAAO;GAC1B,MAAM,WAAW,KAAK,IAAI,MAAM,KAAK,OAAO;GAC5C,IAAI,WAAW,UAAU;IACvB,OAAO;IACP,WAAW;GACb;EACF;EACA,OAAO;CACT;CAEA,OAAO,MAAM,OAAO,KAAK,gBAAgB,SAAS,GAAG;EACnD,IAAI,MAAM,SAAS,GAAG;GACpB,gBAAgB,SAAS;GACzB;EACF;EACA,MAAM,SAAS,UAAU;EACzB,MAAM,OAAO,MAAM;EACnB,OAAO,KAAK,KAAK,IAAI,MAAM,CAAE;EAE7B,KAAK,MAAM,eAAe,MAAM,GAAG,MAAM,CAAC,EAAE,WAAW,CAAC,GAAG;GACzD,IAAI,CAAC,gBAAgB,IAAI,WAAW,GAClC;GAEF,MAAM,QAAQ,gBAAgB,IAAI,WAAW,KAAK,KAAK;GACvD,gBAAgB,IAAI,aAAa,IAAI;GACrC,IAAI,SAAS,GACX,MAAM,IAAI,WAAW;EAEzB;EAEA,cAAc,SAAS,IAAI,MAAM,KAAK,CAAC,CAAC;CAC1C;CAEA,IAAI,OAAO,SAAS,UAAU,QAAQ;EACpC,MAAM,SAAS,IAAI,IAAI,OAAO,KAAI,QAAO,IAAI,EAAE,CAAC;EAChD,KAAK,MAAM,OAAO,WAChB,IAAI,CAAC,OAAO,IAAI,IAAI,EAAE,GACpB,OAAO,KAAK,GAAG;CAGrB;CAEA,OAAO;AACT;AAEA,SAAS,eACP,OACA,OACA,UACK;CACL,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,QAAO,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;CACpD,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,SAAc,CAAC;CAErB,SAAS,KAAK,KAAc;EAC1B,IAAI,KAAK,IAAI,IAAI,EAAE,GACjB;EAEF,KAAK,IAAI,IAAI,EAAE;EACf,OAAO,KAAK,GAAG;CACjB;CAEA,KAAK,MAAM,OAAO,OAChB,IAAI,IAAI,aAAa,QAAQ,MAC3B,KAAK,GAAG;CAGZ,KAAK,MAAM,OAAO,OAChB,IAAI,IAAI,aAAa,QAAQ,UAC3B,KAAK,GAAG;CAGZ,KAAK,MAAM,OAAO,OAChB,KAAK,MAAM,GAAG,IAAI,EAAE,CAAC,EAAE,OAAO,UAAU,OAAO,GAC7C,KAAK,GAAG;CAIZ,MAAM,cAAc,MACjB,QAAO,QAAO;EACb,MAAM,WAAW,SAAS,IAAI,IAAI,EAAE,KAAK,IAAI;EAC7C,MAAM,SAAS,KAAK,IAAI,QAAQ;EAChC,OACE,IAAI,aAAa,QAAQ,cACzB,IAAI,aAAa,QAAQ,SACzB,QAAQ,aAAa,QAAQ;CAEjC,CAAC,CAAC,CACD,KAAI,QAAO,IAAI,EAAE;CACpB,MAAM,yBAAS,IAAI,IAAY,CAAC,GAAG,aAAa,GAAG,MAAM,gBAAgB,WAAW,CAAC,CAAC;CACtF,KAAK,MAAM,OAAO,OAChB,IAAI,OAAO,IAAI,IAAI,EAAE,GACnB,KAAK,GAAG;CAGZ,KAAK,MAAM,OAAO,OAChB,KAAK,GAAG;CAEV,OAAO;AACT;;;;;;;ACvLA,SAAgB,cAAc,KAA4B;CACxD,QACG,IAAI,aAAa,UAAU,KAAK,KAAK,IAAI,WAAW,UAAU,aAAa,IAAI,WAAW,UAAU;AAEzG;;AAGA,SAAgB,qBAAqB,QAA6B;CAChE,MAAM,QAAqB;EACzB,WAAW,OAAO,MAAM;EACxB,eAAe;EACf,iBAAiB;EACjB,mBAAmB;EACnB,gBAAgB;EAChB,yBAAyB;EACzB,0BAA0B;EAC1B,qBAAqB;EACrB,iBAAiB;EACjB,gBAAgB;EAChB,oBAAoB;EACpB,iBAAiB;EACjB,iBAAiB;EACjB,kBAAkB;EAClB,kBAAkB;EAClB,eAAe;EACf,YAAY;EACZ,gBAAgB;EAChB,kBAAkB;EAClB,aAAa;EACb,YAAY;EACZ,gBAAgB;EAChB,iBAAiB;EACjB,iBAAiB;EACjB,eAAe;CACjB;CAEA,KAAK,MAAM,OAAO,OAAO,OAAO;EAC9B,IAAI,IAAI,SACN,MAAM,iBAAiB;EAEzB,MAAM,mBAAmB,wBAAwB,GAAG;EAEpD,IAAI,cAAc,GAAG,GACnB,MAAM,qBAAqB;EAE7B,IAAI,iBAAiB,KAAK,iBAAiB,aAAa,GACtD,MAAM,kBAAkB;EAE1B,IAAI,iBAAiB,KAAK,iBAAiB,qBAAqB,GAC9D,MAAM,2BAA2B;EAEnC,IAAI,mBAAmB,GAAG,GACxB,MAAM,4BAA4B;EAEpC,IAAI,IAAI,kBACN,MAAM,uBAAuB;EAE/B,IAAI,IAAI,WAAW,UAAU,WAC3B,MAAM,mBAAmB;EAE3B,IAAI,IAAI,UAAU,eAAe,WAAW,UAC1C,MAAM,kBAAkB;EAE1B,IAAI,IAAI,UAAU,WAAW,IAAI,SAAS,eAAe,MACvD,MAAM,sBAAsB;EAE9B,IAAI,IAAI,cACN,MAAM,mBAAmB;EAE3B,IAAI,IAAI,UACN,MAAM,mBAAmB;EAE3B,IAAI,IAAI,gBACN,MAAM,oBAAoB;EAE5B,IAAI,eAAe,IAAI,QAAQ,KAAK,IAAI,YACtC,MAAM,oBAAoB;EAE5B,IAAI,CAAC,eAAe,IAAI,QAAQ,KAAK,CAAC,IAAI,YACxC,MAAM,iBAAiB;EAGzB,QAAQ,IAAI,UAAZ;GACE,KAAK,QAAQ;IACX,MAAM,cAAc;IACpB;GACF,KAAK,QAAQ;IACX,MAAM,kBAAkB;IACxB;GACF,KAAK,QAAQ;IACX,MAAM,oBAAoB;IAC1B;GACF,KAAK,QAAQ;IACX,MAAM,eAAe;IACrB;GACF,KAAK,QAAQ;IACX,MAAM,cAAc;IACpB;GACF,KAAK,QAAQ;IACX,MAAM,kBAAkB;IACxB;GACF,KAAK,QAAQ;IACX,MAAM,mBAAmB;IACzB;GACF,KAAK,QAAQ;IACX,MAAM,mBAAmB;IACzB;GACF,KAAK,QAAQ;IACX,MAAM,iBAAiB;IACvB;EACJ;CACF;CAEA,OAAO;AACT;AAEA,SAAS,wBAAwB,KAA2B;CAC1D,IAAI,IAAI,aAAa,QAAQ,SAAS,IAAI,aAAa,QAAQ,WAAW,CAAC,eAAe,IAAI,QAAQ,GACpG,OAAO;CAET,IAAI,IAAI,aAAa,QAAQ,QAAQ,IAAI,aAAa,QAAQ,YAAY,CAAC,IAAI,eAC7E,OAAO;CAGT,MAAM,OAAO,IAAI;CACjB,OAAO,gCAAgC,IAAI,IAAI;AACjD;AAEA,SAAS,gCAAgC,MAA4B;CACnE,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO,OACV,OACE,KAAK,QAAQ,SAAS,KAAK,QAAQ,QAAQ,KAAK,WAAW,MAAM,gCAAgC,MAAM,GAAG,CAAC;EAE/G,KAAK,OAAO;GACV,IAAI,KAAK,KAAK,WAAW,OAAO,OAAO;IACrC,IAAI,MAAM;IACV,KAAK,KAAK,QAAQ,SAAQ,WAAU;KAClC,OAAO,gCAAgC,MAAM;IAC/C,CAAC;IACD,OAAO,MAAM,KAAK,KAAK,QAAQ;GACjC,OAAO,IAAI,KAAK,KAAK,WAAW,OAAO,YACrC,OAAO,gCAAgC,KAAK,IAAI,IAAI;GAEtD,OAAO;CACX;AACF;;AAGA,SAAS,mBAAmB,KAA4B;CACtD,IAAI,CAAC,eAAe,IAAI,QAAQ,KAAK,UAAU,IAAI,QAAQ,GACzD,OAAO;CAET,OAAO,CAAC,IAAI,WAAW,KAAK,KAAK,CAAC,IAAI,cAAc,KAAK;AAC3D;;;;;;;;;;AC5JA,SAAgB,sBAAsB,QAAgB,UAA0B;CAC9E,IAAI,OAAsB;CAC1B,KAAK,MAAM,OAAO,OAAO,OACvB,IAAI,IAAI,YAAY,UAClB,OAAO,IAAI;CAGf,OAAO,QAAQ;AACjB;;AAGA,SAAgB,mBAAmB,QAAgB,QAAsB,MAAqC;CAC5G,MAAM,OAAO,OAAO,WAAW,IAAI,IAAI,OAAO,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CAChF,KAAK,MAAM,OAAO,OAAO,OAAO;EAC9B,IAAI,CAAC,IAAI,cACP;EAEF,MAAM,eAAe,2BAA2B,KAAK,OAAO,IAAI,IAAI;EACpE,IAAI,cAAc,WAAW,KAAK,UAAU,aAAa,OAAO,GAAG,MAAM,MAAM,KAAK,EAAE,GACpF,OAAO;CAEX;CACA,OAAO;AACT;;AAGA,SAAgB,iBAAiB,QAAgB,QAAsB,MAAwB;CAC7F,MAAM,iBAAiB,mBAAmB,QAAQ,QAAQ,IAAI;CAC9D,IAAI,gBACF,OAAO,GAAG,eAAe,MAAM,IAAI,eAAe;CAEpD,IAAI,CAAC,eAAe,OAAO,aAAa,GACtC,OAAO;CAET,MAAM,OAAO,UAAU,OAAO,eAA+B,IAAI;CACjE,IAAI,MAAM,WAAW,OAAO,OAAO;EACjC,MAAM,MAAM,OAAO,WAAW,IAAI,KAAK,MAAM;EAC7C,IAAI,KAAK,eACP,OAAO,GAAG,IAAI,MAAM,IAAI,IAAI;CAEhC;CACA,OAAO;AACT;AAEA,SAAS,2BACP,KACA,UACA,MACiB;CACjB,IAAI,CAAC,IAAI,gBAAgB,IAAI,WAAW,MACtC,OAAO;CAET,IAAI,IAAI,YAAY,UAClB,OAAO,IAAI;CAGb,MAAM,0BAAU,IAAI,IAAY,CAAC,IAAI,EAAE,CAAC;CACxC,IAAI,cAAwB,CAAC,GAAG,IAAI,YAAY;CAChD,IAAI,mBAAkC,IAAI;CAE1C,OAAO,oBAAoB,MAAM;EAC/B,IAAI,qBAAqB,UACvB,OAAO;EAET,IAAI,QAAQ,IAAI,gBAAgB,GAC9B,OAAO;EAET,QAAQ,IAAI,gBAAgB;EAE5B,MAAM,SAAS,KAAK,IAAI,gBAAgB;EACxC,IAAI,CAAC,QAAQ,gBAAgB,OAAO,WAAW,MAC7C,OAAO;EAGT,cAAc,CAAC,GAAG,OAAO,cAAc,GAAG,WAAW;EACrD,mBAAmB,OAAO;CAC5B;CAEA,OAAO;AACT;;;;ACpFA,SAAgB,4BAA4B,UAAkB,OAA8C;CAC1G,MAAM,SAAS,MAAM,QAAO,SAAQ,KAAK,aAAa,SAAS,QAAQ;CACvE,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,WAAW,KAAK,UAAU,SAAS,SAAS,CAAC,OAAO,SAAS,IAAI,GACxE,OAAO,KAAK,IAAI;CAGpB,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,WAAW,CAAC,OAAO,SAAS,IAAI,GACvC,OAAO,KAAK,IAAI;CAGpB,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,OAAO,SAAS,IAAI,GACvB,OAAO,KAAK,IAAI;CAGpB,OAAO;AACT;;;;ACdA,MAAa,iBAAiB;CAC5B,YAAY;CACZ,QAAQ;CACR,OAAO;AACT;;AAIA,MAAa,mBAAmB;CAC9B,eAAe;CACf,uBAAuB;CACvB,yBAAyB;CACzB,mBAAmB;CACnB,oBAAoB;CACpB,uBAAuB;CAEvB,YAAY;CACZ,iBAAiB;CACjB,kBAAkB;CAClB,eAAe;AACjB;;AAYA,SAAgB,iBAAiB,KAAmB,MAAiC;CACnF,OAAO,IAAI,aAAa,MAAK,SAAQ,KAAK,SAAS,IAAI,KAAK;AAC9D;;;;;;;AAQA,SAAgB,wBACd,OACA,cACA,uBACA,OACM;CACN,MAAM,cAAc,yBAAyB,OAAO,YAAY;CAChE,MAAM,gBAAgB,iCAAiC,OAAO,cAAc,qBAAqB;CACjG,MAAM,YAAY,QAAQ,iCAAiC,OAAO,YAAY,oBAAI,IAAI,IAA2B;CAEjH,KAAK,MAAM,OAAO,OAAO;EACvB,MAAM,cAA+B,CAAC;EACtC,MAAM,QAAQ,UAAU,IAAI,IAAI,EAAE;EAClC,IAAI,OACF,YAAY,KAAK,KAAK;EAExB,MAAM,UAAU,YAAY,IAAI,IAAI,EAAE;EACtC,IAAI,SACF,YAAY,KAAK,OAAO;EAE1B,MAAM,YAAY,cAAc,IAAI,IAAI,EAAE;EAC1C,IAAI,WACF,YAAY,KAAK,SAAS;EAE5B,YAAY,KAAK,GAAG,8BAA8B,GAAG,CAAC;EACtD,IAAI,cAAc;CACpB;AACF;;;;;;;;;;AAWA,SAAgB,sBAAsB,SAAoC;CACxE,IAAI,QAAQ,SAAS,GACnB,OAAO,QAAQ,KAAK,KAAK;CAG3B,MAAM,SAAS,QAAQ,OAAO,QAAQ,QAAQ,SAAS;CACvD,MAAM,OAAO,SAAS,QAAQ,MAAM,GAAG,EAAE,IAAI,CAAC,GAAG,OAAO;CACxD,IAAI,KAAK,WAAW,GAClB,OAAO,QAAQ,KAAK,KAAK;CAG3B,IAAI,YAAY;CAChB,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS;EAChD,MAAM,QAAQ,KAAK;EACnB,MAAM,YAAY,KAAK;EACvB,IAAI,UAAU,UAAa,cAAc,UAAa,QAAQ,WAC5D,YAAY;CAEhB;CACA,MAAM,UAAU,CAAC,GAAG,KAAK,MAAM,SAAS,GAAG,GAAG,KAAK,MAAM,GAAG,SAAS,CAAC;CACtE,IAAI,QAAQ;EACV,MAAM,QAAQ,QAAQ;EACtB,IAAI,UAAU,QACZ,QAAQ,KAAK,KAAK;CAEtB;CACA,OAAO,QAAQ,KAAK,KAAK;AAC3B;;;;;;;;;;AAWA,SAAgB,iCACd,OACA,cAC4B;CAC5B,MAAM,yBAAS,IAAI,IAA2B;CAC9C,KAAK,MAAM,SAAS,MAAM,WAAW,GAAG;EACtC,IAAI,MAAM,SAAS,GACjB;EAGF,MAAM,YAAY,sBADF,MAAM,KAAI,OAAM,aAAa,EAAE,CACP,CAAO;EAC/C,MAAM,YAAY,IAAI,IAAI,KAAK;EAC/B,KAAK,MAAM,MAAM,WACf,OAAO,IAAI,IAAI;GACb,MAAM,eAAe;GACrB,MAAM,iBAAiB;GACvB,QAAQ,CAAC,SAAS;EACpB,CAAC;CAEL;CACA,OAAO;AACT;;AAGA,SAAgB,yBAAyB,QAAoB,SAAwC;CACnG,MAAM,OAAO,kBAAkB,QAAQ,OAAO;CAC9C,IAAI,SAAS,MACX,OAAO;CAET,OAAO;EAAE,MAAM,eAAe;EAAO;EAAM,QAAQ,CAAC,OAAO,MAAM,CAAC;CAAE;AACtE;AAEA,SAAS,8BAA8B,KAAoC;CACzE,MAAM,SAA0B,CAAC;CACjC,IAAI,IAAI,kBACN,OAAO,KAAK;EACV,MAAM,eAAe;EACrB,MAAM,iBAAiB;EACvB,QAAQ,CAAC,IAAI,qBAAqB,UAAU,IAAI,SAAS,IAAI,CAAC;CAChE,CAAC;CAEH,IAAI,eAAe,IAAI,QAAQ,KAAK,CAAC,UAAU,IAAI,QAAQ,GAAG;EAC5D,IAAI,CAAC,IAAI,WAAW,KAAK,GACvB,OAAO,KAAK;GAAE,MAAM,eAAe;GAAQ,MAAM,iBAAiB;EAAwB,CAAC;EAE7F,IAAI,CAAC,IAAI,cAAc,KAAK,GAC1B,OAAO,KAAK;GAAE,MAAM,eAAe;GAAQ,MAAM,iBAAiB;EAAkB,CAAC;CAEzF;CACA,OAAO;AACT;AAEA,SAAS,8BACP,OACA,cACA,UACA,MAC4B;CAC5B,MAAM,yBAAS,IAAI,IAA4B;CAC/C,KAAK,MAAM,OAAO,OAAO;EACvB,MAAM,MAAM,SAAS,GAAG;EACxB,IAAI,CAAC,KACH;EAEF,MAAM,QAAQ,OAAO,IAAI,GAAG,KAAK,CAAC;EAClC,MAAM,KAAK,GAAG;EACd,OAAO,IAAI,KAAK,KAAK;CACvB;CAEA,MAAM,yBAAS,IAAI,IAA2B;CAC9C,KAAK,MAAM,SAAS,OAAO,OAAO,GAAG;EACnC,IAAI,MAAM,UAAU,GAClB;EAEF,KAAK,MAAM,OAAO,OAAO;GACvB,MAAM,UAAU,MACb,QAAO,UAAS,MAAM,OAAO,IAAI,EAAE,CAAC,CACpC,KAAI,UAAS,aAAa,MAAM,EAAE,CAAC,CAAC,CACpC,KAAK,IAAI;GACZ,OAAO,IAAI,IAAI,IAAI;IACjB,MAAM,eAAe;IACrB;IACA,QAAQ,CAAC,OAAO;GAClB,CAAC;EACH;CACF;CACA,OAAO;AACT;AAEA,SAAS,yBACP,OACA,cAC4B;CAC5B,OAAO,8BACL,OACA,eACA,QAAO;EACL,MAAM,MAAM,IAAI,cAAc,KAAK,CAAC,CAAC,kBAAkB;EACvD,OAAO,QAAQ,KAAK,SAAY;CAClC,GACA,iBAAiB,aACnB;AACF;AAEA,SAAS,iCACP,OACA,cACA,uBAC4B;CAC5B,OAAO,8BACL,OACA,eACA,QAAO,sBAAsB,IAAI,IAAI,EAAE,GACvC,iBAAiB,qBACnB;AACF;AAEA,SAAS,kBAAkB,QAAoB,SAA2C;CACxF,QAAQ,QAAR;EACE,KAAK,WAAW,OACd,OAAO,eAAe,OAAO,IAAI,iBAAiB,aAAa;EACjE,KAAK,WAAW,aACd,OAAO,iBAAiB;EAC1B,KAAK,WAAW,cACd,OAAO,iBAAiB;EAC1B,KAAK,WAAW,WACd,OAAO,iBAAiB;EAC1B,SACE,OAAO;CACX;AACF"}