@rsconcept/domain 2.0.2 → 2.1.0

package/dist/graph/graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph.js","names":[],"sources":["../../src/graph/graph.ts"],"sourcesContent":["/**\n * Module: Custom graph data structure.\n */\n\n/** Represents single node of a {@link Graph}, as implemented by storing outgoing and incoming connections. */\nexport class GraphNode<NodeID> {\n  /** Unique identifier of the node. */\n  id: NodeID;\n  /** List of outgoing nodes. */\n  outputs: NodeID[];\n  /** List of incoming nodes. */\n  inputs: NodeID[];\n\n  constructor(id: NodeID) {\n    this.id = id;\n    this.outputs = [];\n    this.inputs = [];\n  }\n\n  clone(): GraphNode<NodeID> {\n    const result = new GraphNode(this.id);\n    result.outputs = [...this.outputs];\n    result.inputs = [...this.inputs];\n    return result;\n  }\n\n  addOutput(node: NodeID): void {\n    this.outputs.push(node);\n  }\n\n  addInput(node: NodeID): void {\n    this.inputs.push(node);\n  }\n\n  removeInput(target: NodeID): NodeID | null {\n    const index = this.inputs.findIndex(node => node === target);\n    return index > -1 ? this.inputs.splice(index, 1)[0] : null;\n  }\n\n  removeOutput(target: NodeID): NodeID | null {\n    const index = this.outputs.findIndex(node => node === target);\n    return index > -1 ? this.outputs.splice(index, 1)[0] : null;\n  }\n}\n\n/**\n * Represents a Graph.\n *\n * This class is optimized for TermGraph use case and not supposed to be used as generic graph implementation.\n */\nexport class Graph<NodeID = number> {\n  /** Map of nodes. */\n  nodes = new Map<NodeID, GraphNode<NodeID>>();\n\n  constructor(arr?: NodeID[][]) {\n    if (!arr) {\n      return;\n    }\n    arr.forEach(edge => {\n      if (edge.length === 1) {\n        this.addNode(edge[0]);\n      } else {\n        this.addEdge(edge[0], edge[1]);\n      }\n    });\n  }\n\n  clone(): Graph<NodeID> {\n    const result = new Graph<NodeID>();\n    this.nodes.forEach(node => result.nodes.set(node.id, node.clone()));\n    return result;\n  }\n\n  at(target: NodeID): GraphNode<NodeID> | undefined {\n    return this.nodes.get(target);\n  }\n\n  addNode(target: NodeID): GraphNode<NodeID> {\n    let node = this.nodes.get(target);\n    if (!node) {\n      node = new GraphNode(target);\n      this.nodes.set(target, node);\n    }\n    return node;\n  }\n\n  hasNode(target: NodeID): boolean {\n    return !!this.nodes.get(target);\n  }\n\n  removeNode(target: NodeID): void {\n    this.nodes.forEach(node => {\n      node.removeInput(target);\n      node.removeOutput(target);\n    });\n    this.nodes.delete(target);\n  }\n\n  foldNode(target: NodeID): void {\n    const nodeToRemove = this.nodes.get(target);\n    if (!nodeToRemove) {\n      return;\n    }\n    nodeToRemove.inputs.forEach(input => {\n      nodeToRemove.outputs.forEach(output => {\n        this.addEdge(input, output);\n      });\n    });\n    this.removeNode(target);\n  }\n\n  removeIsolated(): GraphNode<NodeID>[] {\n    const result: GraphNode<NodeID>[] = [];\n    this.nodes.forEach(node => {\n      if (node.outputs.length === 0 && node.inputs.length === 0) {\n        result.push(node);\n        this.nodes.delete(node.id);\n      }\n    });\n    return result;\n  }\n\n  addEdge(source: NodeID, destination: NodeID): void {\n    if (this.hasEdge(source, destination)) {\n      return;\n    }\n    const sourceNode = this.addNode(source);\n    const destinationNode = this.addNode(destination);\n    sourceNode.addOutput(destinationNode.id);\n    destinationNode.addInput(sourceNode.id);\n  }\n\n  removeEdge(source: NodeID, destination: NodeID): void {\n    const sourceNode = this.nodes.get(source);\n    const destinationNode = this.nodes.get(destination);\n    if (sourceNode && destinationNode) {\n      sourceNode.removeOutput(destination);\n      destinationNode.removeInput(source);\n    }\n  }\n\n  hasEdge(source: NodeID, destination: NodeID): boolean {\n    const sourceNode = this.nodes.get(source);\n    if (!sourceNode) {\n      return false;\n    }\n    return !!sourceNode.outputs.find(id => id === destination);\n  }\n\n  isReachable(source: NodeID, destination: NodeID): boolean {\n    return this.expandAllOutputs([source]).includes(destination);\n  }\n\n  rootNodes(): NodeID[] {\n    return [...this.nodes.keys()].filter(id => !this.nodes.get(id)?.inputs.length);\n  }\n\n  expandOutputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = [];\n    origin.forEach(id => {\n      const node = this.nodes.get(id);\n      if (node) {\n        node.outputs.forEach(child => {\n          if (!origin.includes(child) && !result.includes(child)) {\n            result.push(child);\n          }\n        });\n      }\n    });\n    return result;\n  }\n\n  expandInputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = [];\n    origin.forEach(id => {\n      const node = this.nodes.get(id);\n      if (node) {\n        node.inputs.forEach(child => {\n          if (!origin.includes(child) && !result.includes(child)) {\n            result.push(child);\n          }\n        });\n      }\n    });\n    return result;\n  }\n\n  expandAllOutputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = this.expandOutputs(origin);\n    if (result.length === 0) {\n      return [];\n    }\n\n    const marked = new Map<NodeID, boolean>();\n    origin.forEach(id => marked.set(id, true));\n    let position = 0;\n    while (position < result.length) {\n      const node = this.nodes.get(result[position]);\n      if (node && !marked.get(node.id)) {\n        marked.set(node.id, true);\n        node.outputs.forEach(child => {\n          if (!marked.get(child) && !result.find(id => id === child)) {\n            result.push(child);\n          }\n        });\n      }\n      position += 1;\n    }\n    return result;\n  }\n\n  expandAllInputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = this.expandInputs(origin);\n    if (result.length === 0) {\n      return [];\n    }\n\n    const marked = new Map<NodeID, boolean>();\n    origin.forEach(id => marked.set(id, true));\n    let position = 0;\n    while (position < result.length) {\n      const node = this.nodes.get(result[position]);\n      if (node && !marked.get(node.id)) {\n        marked.set(node.id, true);\n        node.inputs.forEach(child => {\n          if (!marked.get(child) && !result.find(id => id === child)) {\n            result.push(child);\n          }\n        });\n      }\n      position += 1;\n    }\n    return result;\n  }\n\n  maximizePart(origin: NodeID[]): NodeID[] {\n    const outputs: NodeID[] = this.expandAllOutputs(origin);\n    const result = [...origin];\n    this.topologicalOrder()\n      .filter(id => outputs.includes(id))\n      .forEach(id => {\n        const node = this.nodes.get(id);\n        if (node?.inputs.every(parent => result.includes(parent))) {\n          result.push(id);\n        }\n      });\n    return result;\n  }\n\n  topologicalOrder(): NodeID[] {\n    const result: NodeID[] = [];\n    const marked = new Set<NodeID>();\n    const nodeStack: NodeID[] = [];\n    this.nodes.forEach(node => {\n      if (marked.has(node.id)) {\n        return;\n      }\n      nodeStack.push(node.id);\n      while (nodeStack.length > 0) {\n        const item = nodeStack[nodeStack.length - 1];\n        if (marked.has(item)) {\n          if (!result.find(id => id === item)) {\n            result.push(item);\n          }\n          nodeStack.pop();\n        } else {\n          marked.add(item);\n          const itemNode = this.nodes.get(item);\n          if (itemNode && itemNode.outputs.length > 0) {\n            itemNode.outputs.forEach(child => {\n              if (!marked.has(child)) {\n                nodeStack.push(child);\n              }\n            });\n          }\n        }\n      }\n    });\n    return result.reverse();\n  }\n\n  /**\n   * Stably reorders the given node ids so that, for this DAG, no node appears before a transitive\n   * successor (edges: source → dependent; {@link GraphNode.outputs} lists dependents).\n   */\n  sortStable(target: NodeID[]): NodeID[] {\n    if (target.length <= 1) {\n      return [...target];\n    }\n\n    const reachable = this.buildTransitiveClosureForSort();\n    const testSet = new Set<NodeID>();\n    const result: NodeID[] = [];\n\n    for (const nodeId of [...target].reverse()) {\n      const nodeReachable = reachable.get(nodeId) ?? new Set<NodeID>();\n      const needMove = testSet.has(nodeId);\n      for (const childId of nodeReachable) {\n        testSet.add(childId);\n      }\n\n      if (!needMove) {\n        result.push(nodeId);\n        continue;\n      }\n\n      let inserted = false;\n      for (let index = 0; index < result.length; index++) {\n        const parent = result[index];\n        const parentReachable = reachable.get(parent) ?? new Set<NodeID>();\n        if (nodeReachable.has(parent)) {\n          if (parentReachable.has(nodeId)) {\n            result.push(nodeId);\n          } else {\n            result.splice(index, 0, nodeId);\n          }\n          inserted = true;\n          break;\n        }\n      }\n      if (!inserted) {\n        result.push(nodeId);\n      }\n    }\n\n    result.reverse();\n    return result;\n  }\n\n  private buildTransitiveClosureForSort(): Map<NodeID, Set<NodeID>> {\n    const closure = new Map<NodeID, Set<NodeID>>();\n    for (const node of this.nodes.values()) {\n      closure.set(node.id, new Set(node.outputs));\n    }\n\n    const order = this.topologicalOrder();\n    for (const nodeId of [...order].reverse()) {\n      const node = this.at(nodeId);\n      if (!node) {\n        continue;\n      }\n      const nodeClosure = closure.get(nodeId) ?? new Set<NodeID>();\n      for (const parentId of node.inputs) {\n        const parentClosure = closure.get(parentId) ?? new Set<NodeID>();\n        for (const childId of nodeClosure) {\n          parentClosure.add(childId);\n        }\n        closure.set(parentId, parentClosure);\n      }\n    }\n\n    return closure;\n  }\n\n  transitiveReduction() {\n    const order = this.topologicalOrder();\n    const marked = new Map<NodeID, boolean>();\n    order.forEach(nodeID => {\n      if (marked.get(nodeID)) {\n        return;\n      }\n      const stack: { id: NodeID; parents: NodeID[] }[] = [];\n      stack.push({ id: nodeID, parents: [] });\n      while (stack.length > 0) {\n        const item = stack.splice(0, 1)[0];\n        const node = this.nodes.get(item.id);\n        if (node) {\n          node.outputs.forEach(child => {\n            item.parents.forEach(parent => this.removeEdge(parent, child));\n            stack.push({ id: child, parents: [item.id, ...item.parents] });\n          });\n        }\n        marked.set(item.id, true);\n      }\n    });\n  }\n\n  /**\n   * Finds a cycle in the graph.\n   *\n   * @returns {NodeID[] | null} The cycle if found, otherwise `null`.\n   * Uses non-recursive DFS.\n   */\n  findCycle(): NodeID[] | null {\n    const visited = new Set<NodeID>();\n    const nodeStack = new Set<NodeID>();\n    const parents = new Map<NodeID, NodeID>();\n\n    for (const nodeId of this.nodes.keys()) {\n      if (visited.has(nodeId)) {\n        continue;\n      }\n\n      const callStack: { nodeId: NodeID; parentId: NodeID | null }[] = [];\n      callStack.push({ nodeId: nodeId, parentId: null });\n      while (callStack.length > 0) {\n        const { nodeId, parentId } = callStack[callStack.length - 1];\n        if (visited.has(nodeId)) {\n          nodeStack.delete(nodeId);\n          callStack.pop();\n          continue;\n        }\n        visited.add(nodeId);\n        nodeStack.add(nodeId);\n        if (parentId !== null) {\n          parents.set(nodeId, parentId);\n        }\n\n        const currentNode = this.nodes.get(nodeId)!;\n        for (const child of currentNode.outputs) {\n          if (!visited.has(child)) {\n            callStack.push({ nodeId: child, parentId: nodeId });\n            continue;\n          }\n          if (!nodeStack.has(child)) {\n            continue;\n          }\n          const cycle: NodeID[] = [];\n          let current = nodeId;\n          cycle.push(child);\n          while (current !== child) {\n            cycle.push(current);\n            current = parents.get(current)!;\n          }\n          cycle.push(child);\n          cycle.reverse();\n          return cycle;\n        }\n      }\n    }\n    return null;\n  }\n}\n"],"mappings":";;;;;AAKA,IAAa,YAAb,MAAa,UAAkB;;CAE7B;;CAEA;;CAEA;CAEA,YAAY,IAAY;EACtB,KAAK,KAAK;EACV,KAAK,UAAU,CAAC;EAChB,KAAK,SAAS,CAAC;CACjB;CAEA,QAA2B;EACzB,MAAM,SAAS,IAAI,UAAU,KAAK,EAAE;EACpC,OAAO,UAAU,CAAC,GAAG,KAAK,OAAO;EACjC,OAAO,SAAS,CAAC,GAAG,KAAK,MAAM;EAC/B,OAAO;CACT;CAEA,UAAU,MAAoB;EAC5B,KAAK,QAAQ,KAAK,IAAI;CACxB;CAEA,SAAS,MAAoB;EAC3B,KAAK,OAAO,KAAK,IAAI;CACvB;CAEA,YAAY,QAA+B;EACzC,MAAM,QAAQ,KAAK,OAAO,WAAU,SAAQ,SAAS,MAAM;EAC3D,OAAO,QAAQ,KAAK,KAAK,OAAO,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK;CACxD;CAEA,aAAa,QAA+B;EAC1C,MAAM,QAAQ,KAAK,QAAQ,WAAU,SAAQ,SAAS,MAAM;EAC5D,OAAO,QAAQ,KAAK,KAAK,QAAQ,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK;CACzD;AACF;;;;;;AAOA,IAAa,QAAb,MAAa,MAAuB;;CAElC,wBAAQ,IAAI,IAA+B;CAE3C,YAAY,KAAkB;EAC5B,IAAI,CAAC,KACH;EAEF,IAAI,SAAQ,SAAQ;GAClB,IAAI,KAAK,WAAW,GAClB,KAAK,QAAQ,KAAK,EAAE;QAEpB,KAAK,QAAQ,KAAK,IAAI,KAAK,EAAE;EAEjC,CAAC;CACH;CAEA,QAAuB;EACrB,MAAM,SAAS,IAAI,MAAc;EACjC,KAAK,MAAM,SAAQ,SAAQ,OAAO,MAAM,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,CAAC;EAClE,OAAO;CACT;CAEA,GAAG,QAA+C;EAChD,OAAO,KAAK,MAAM,IAAI,MAAM;CAC9B;CAEA,QAAQ,QAAmC;EACzC,IAAI,OAAO,KAAK,MAAM,IAAI,MAAM;EAChC,IAAI,CAAC,MAAM;GACT,OAAO,IAAI,UAAU,MAAM;GAC3B,KAAK,MAAM,IAAI,QAAQ,IAAI;EAC7B;EACA,OAAO;CACT;CAEA,QAAQ,QAAyB;EAC/B,OAAO,CAAC,CAAC,KAAK,MAAM,IAAI,MAAM;CAChC;CAEA,WAAW,QAAsB;EAC/B,KAAK,MAAM,SAAQ,SAAQ;GACzB,KAAK,YAAY,MAAM;GACvB,KAAK,aAAa,MAAM;EAC1B,CAAC;EACD,KAAK,MAAM,OAAO,MAAM;CAC1B;CAEA,SAAS,QAAsB;EAC7B,MAAM,eAAe,KAAK,MAAM,IAAI,MAAM;EAC1C,IAAI,CAAC,cACH;EAEF,aAAa,OAAO,SAAQ,UAAS;GACnC,aAAa,QAAQ,SAAQ,WAAU;IACrC,KAAK,QAAQ,OAAO,MAAM;GAC5B,CAAC;EACH,CAAC;EACD,KAAK,WAAW,MAAM;CACxB;CAEA,iBAAsC;EACpC,MAAM,SAA8B,CAAC;EACrC,KAAK,MAAM,SAAQ,SAAQ;GACzB,IAAI,KAAK,QAAQ,WAAW,KAAK,KAAK,OAAO,WAAW,GAAG;IACzD,OAAO,KAAK,IAAI;IAChB,KAAK,MAAM,OAAO,KAAK,EAAE;GAC3B;EACF,CAAC;EACD,OAAO;CACT;CAEA,QAAQ,QAAgB,aAA2B;EACjD,IAAI,KAAK,QAAQ,QAAQ,WAAW,GAClC;EAEF,MAAM,aAAa,KAAK,QAAQ,MAAM;EACtC,MAAM,kBAAkB,KAAK,QAAQ,WAAW;EAChD,WAAW,UAAU,gBAAgB,EAAE;EACvC,gBAAgB,SAAS,WAAW,EAAE;CACxC;CAEA,WAAW,QAAgB,aAA2B;EACpD,MAAM,aAAa,KAAK,MAAM,IAAI,MAAM;EACxC,MAAM,kBAAkB,KAAK,MAAM,IAAI,WAAW;EAClD,IAAI,cAAc,iBAAiB;GACjC,WAAW,aAAa,WAAW;GACnC,gBAAgB,YAAY,MAAM;EACpC;CACF;CAEA,QAAQ,QAAgB,aAA8B;EACpD,MAAM,aAAa,KAAK,MAAM,IAAI,MAAM;EACxC,IAAI,CAAC,YACH,OAAO;EAET,OAAO,CAAC,CAAC,WAAW,QAAQ,MAAK,OAAM,OAAO,WAAW;CAC3D;CAEA,YAAY,QAAgB,aAA8B;EACxD,OAAO,KAAK,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,WAAW;CAC7D;CAEA,YAAsB;EACpB,OAAO,CAAC,GAAG,KAAK,MAAM,KAAK,CAAC,CAAC,CAAC,QAAO,OAAM,CAAC,KAAK,MAAM,IAAI,EAAE,CAAC,EAAE,OAAO,MAAM;CAC/E;CAEA,cAAc,QAA4B;EACxC,MAAM,SAAmB,CAAC;EAC1B,OAAO,SAAQ,OAAM;GACnB,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE;GAC9B,IAAI,MACF,KAAK,QAAQ,SAAQ,UAAS;IAC5B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GACnD,OAAO,KAAK,KAAK;GAErB,CAAC;EAEL,CAAC;EACD,OAAO;CACT;CAEA,aAAa,QAA4B;EACvC,MAAM,SAAmB,CAAC;EAC1B,OAAO,SAAQ,OAAM;GACnB,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE;GAC9B,IAAI,MACF,KAAK,OAAO,SAAQ,UAAS;IAC3B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GACnD,OAAO,KAAK,KAAK;GAErB,CAAC;EAEL,CAAC;EACD,OAAO;CACT;CAEA,iBAAiB,QAA4B;EAC3C,MAAM,SAAmB,KAAK,cAAc,MAAM;EAClD,IAAI,OAAO,WAAW,GACpB,OAAO,CAAC;EAGV,MAAM,yBAAS,IAAI,IAAqB;EACxC,OAAO,SAAQ,OAAM,OAAO,IAAI,IAAI,IAAI,CAAC;EACzC,IAAI,WAAW;EACf,OAAO,WAAW,OAAO,QAAQ;GAC/B,MAAM,OAAO,KAAK,MAAM,IAAI,OAAO,SAAS;GAC5C,IAAI,QAAQ,CAAC,OAAO,IAAI,KAAK,EAAE,GAAG;IAChC,OAAO,IAAI,KAAK,IAAI,IAAI;IACxB,KAAK,QAAQ,SAAQ,UAAS;KAC5B,IAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CAAC,OAAO,MAAK,OAAM,OAAO,KAAK,GACvD,OAAO,KAAK,KAAK;IAErB,CAAC;GACH;GACA,YAAY;EACd;EACA,OAAO;CACT;CAEA,gBAAgB,QAA4B;EAC1C,MAAM,SAAmB,KAAK,aAAa,MAAM;EACjD,IAAI,OAAO,WAAW,GACpB,OAAO,CAAC;EAGV,MAAM,yBAAS,IAAI,IAAqB;EACxC,OAAO,SAAQ,OAAM,OAAO,IAAI,IAAI,IAAI,CAAC;EACzC,IAAI,WAAW;EACf,OAAO,WAAW,OAAO,QAAQ;GAC/B,MAAM,OAAO,KAAK,MAAM,IAAI,OAAO,SAAS;GAC5C,IAAI,QAAQ,CAAC,OAAO,IAAI,KAAK,EAAE,GAAG;IAChC,OAAO,IAAI,KAAK,IAAI,IAAI;IACxB,KAAK,OAAO,SAAQ,UAAS;KAC3B,IAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CAAC,OAAO,MAAK,OAAM,OAAO,KAAK,GACvD,OAAO,KAAK,KAAK;IAErB,CAAC;GACH;GACA,YAAY;EACd;EACA,OAAO;CACT;CAEA,aAAa,QAA4B;EACvC,MAAM,UAAoB,KAAK,iBAAiB,MAAM;EACtD,MAAM,SAAS,CAAC,GAAG,MAAM;EACzB,KAAK,iBAAiB,CAAC,CACpB,QAAO,OAAM,QAAQ,SAAS,EAAE,CAAC,CAAC,CAClC,SAAQ,OAAM;GAEb,IADa,KAAK,MAAM,IAAI,EACxB,CAAA,EAAM,OAAO,OAAM,WAAU,OAAO,SAAS,MAAM,CAAC,GACtD,OAAO,KAAK,EAAE;EAElB,CAAC;EACH,OAAO;CACT;CAEA,mBAA6B;EAC3B,MAAM,SAAmB,CAAC;EAC1B,MAAM,yBAAS,IAAI,IAAY;EAC/B,MAAM,YAAsB,CAAC;EAC7B,KAAK,MAAM,SAAQ,SAAQ;GACzB,IAAI,OAAO,IAAI,KAAK,EAAE,GACpB;GAEF,UAAU,KAAK,KAAK,EAAE;GACtB,OAAO,UAAU,SAAS,GAAG;IAC3B,MAAM,OAAO,UAAU,UAAU,SAAS;IAC1C,IAAI,OAAO,IAAI,IAAI,GAAG;KACpB,IAAI,CAAC,OAAO,MAAK,OAAM,OAAO,IAAI,GAChC,OAAO,KAAK,IAAI;KAElB,UAAU,IAAI;IAChB,OAAO;KACL,OAAO,IAAI,IAAI;KACf,MAAM,WAAW,KAAK,MAAM,IAAI,IAAI;KACpC,IAAI,YAAY,SAAS,QAAQ,SAAS,GACxC,SAAS,QAAQ,SAAQ,UAAS;MAChC,IAAI,CAAC,OAAO,IAAI,KAAK,GACnB,UAAU,KAAK,KAAK;KAExB,CAAC;IAEL;GACF;EACF,CAAC;EACD,OAAO,OAAO,QAAQ;CACxB;;;;;CAMA,WAAW,QAA4B;EACrC,IAAI,OAAO,UAAU,GACnB,OAAO,CAAC,GAAG,MAAM;EAGnB,MAAM,YAAY,KAAK,8BAA8B;EACrD,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,SAAmB,CAAC;EAE1B,KAAK,MAAM,UAAU,CAAC,GAAG,MAAM,CAAC,CAAC,QAAQ,GAAG;GAC1C,MAAM,gBAAgB,UAAU,IAAI,MAAM,qBAAK,IAAI,IAAY;GAC/D,MAAM,WAAW,QAAQ,IAAI,MAAM;GACnC,KAAK,MAAM,WAAW,eACpB,QAAQ,IAAI,OAAO;GAGrB,IAAI,CAAC,UAAU;IACb,OAAO,KAAK,MAAM;IAClB;GACF;GAEA,IAAI,WAAW;GACf,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS;IAClD,MAAM,SAAS,OAAO;IACtB,MAAM,kBAAkB,UAAU,IAAI,MAAM,qBAAK,IAAI,IAAY;IACjE,IAAI,cAAc,IAAI,MAAM,GAAG;KAC7B,IAAI,gBAAgB,IAAI,MAAM,GAC5B,OAAO,KAAK,MAAM;UAElB,OAAO,OAAO,OAAO,GAAG,MAAM;KAEhC,WAAW;KACX;IACF;GACF;GACA,IAAI,CAAC,UACH,OAAO,KAAK,MAAM;EAEtB;EAEA,OAAO,QAAQ;EACf,OAAO;CACT;CAEA,gCAAkE;EAChE,MAAM,0BAAU,IAAI,IAAyB;EAC7C,KAAK,MAAM,QAAQ,KAAK,MAAM,OAAO,GACnC,QAAQ,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,OAAO,CAAC;EAG5C,MAAM,QAAQ,KAAK,iBAAiB;EACpC,KAAK,MAAM,UAAU,CAAC,GAAG,KAAK,CAAC,CAAC,QAAQ,GAAG;GACzC,MAAM,OAAO,KAAK,GAAG,MAAM;GAC3B,IAAI,CAAC,MACH;GAEF,MAAM,cAAc,QAAQ,IAAI,MAAM,qBAAK,IAAI,IAAY;GAC3D,KAAK,MAAM,YAAY,KAAK,QAAQ;IAClC,MAAM,gBAAgB,QAAQ,IAAI,QAAQ,qBAAK,IAAI,IAAY;IAC/D,KAAK,MAAM,WAAW,aACpB,cAAc,IAAI,OAAO;IAE3B,QAAQ,IAAI,UAAU,aAAa;GACrC;EACF;EAEA,OAAO;CACT;CAEA,sBAAsB;EACpB,MAAM,QAAQ,KAAK,iBAAiB;EACpC,MAAM,yBAAS,IAAI,IAAqB;EACxC,MAAM,SAAQ,WAAU;GACtB,IAAI,OAAO,IAAI,MAAM,GACnB;GAEF,MAAM,QAA6C,CAAC;GACpD,MAAM,KAAK;IAAE,IAAI;IAAQ,SAAS,CAAC;GAAE,CAAC;GACtC,OAAO,MAAM,SAAS,GAAG;IACvB,MAAM,OAAO,MAAM,OAAO,GAAG,CAAC,CAAC,CAAC;IAChC,MAAM,OAAO,KAAK,MAAM,IAAI,KAAK,EAAE;IACnC,IAAI,MACF,KAAK,QAAQ,SAAQ,UAAS;KAC5B,KAAK,QAAQ,SAAQ,WAAU,KAAK,WAAW,QAAQ,KAAK,CAAC;KAC7D,MAAM,KAAK;MAAE,IAAI;MAAO,SAAS,CAAC,KAAK,IAAI,GAAG,KAAK,OAAO;KAAE,CAAC;IAC/D,CAAC;IAEH,OAAO,IAAI,KAAK,IAAI,IAAI;GAC1B;EACF,CAAC;CACH;;;;;;;CAQA,YAA6B;EAC3B,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,4BAAY,IAAI,IAAY;EAClC,MAAM,0BAAU,IAAI,IAAoB;EAExC,KAAK,MAAM,UAAU,KAAK,MAAM,KAAK,GAAG;GACtC,IAAI,QAAQ,IAAI,MAAM,GACpB;GAGF,MAAM,YAA2D,CAAC;GAClE,UAAU,KAAK;IAAU;IAAQ,UAAU;GAAK,CAAC;GACjD,OAAO,UAAU,SAAS,GAAG;IAC3B,MAAM,EAAE,QAAQ,aAAa,UAAU,UAAU,SAAS;IAC1D,IAAI,QAAQ,IAAI,MAAM,GAAG;KACvB,UAAU,OAAO,MAAM;KACvB,UAAU,IAAI;KACd;IACF;IACA,QAAQ,IAAI,MAAM;IAClB,UAAU,IAAI,MAAM;IACpB,IAAI,aAAa,MACf,QAAQ,IAAI,QAAQ,QAAQ;IAG9B,MAAM,cAAc,KAAK,MAAM,IAAI,MAAM;IACzC,KAAK,MAAM,SAAS,YAAY,SAAS;KACvC,IAAI,CAAC,QAAQ,IAAI,KAAK,GAAG;MACvB,UAAU,KAAK;OAAE,QAAQ;OAAO,UAAU;MAAO,CAAC;MAClD;KACF;KACA,IAAI,CAAC,UAAU,IAAI,KAAK,GACtB;KAEF,MAAM,QAAkB,CAAC;KACzB,IAAI,UAAU;KACd,MAAM,KAAK,KAAK;KAChB,OAAO,YAAY,OAAO;MACxB,MAAM,KAAK,OAAO;MAClB,UAAU,QAAQ,IAAI,OAAO;KAC/B;KACA,MAAM,KAAK,KAAK;KAChB,MAAM,QAAQ;KACd,OAAO;IACT;GACF;EACF;EACA,OAAO;CACT;AACF"}
+{"version":3,"file":"graph.js","names":[],"sources":["../../src/graph/graph.ts"],"sourcesContent":["/**\n * Module: Custom graph data structure.\n */\n\n/** Represents single node of a {@link Graph}, as implemented by storing outgoing and incoming connections. */\nexport class GraphNode<NodeID> {\n  /** Unique identifier of the node. */\n  id: NodeID;\n  /** List of outgoing nodes. */\n  outputs: NodeID[];\n  /** List of incoming nodes. */\n  inputs: NodeID[];\n\n  constructor(id: NodeID) {\n    this.id = id;\n    this.outputs = [];\n    this.inputs = [];\n  }\n\n  clone(): GraphNode<NodeID> {\n    const result = new GraphNode(this.id);\n    result.outputs = [...this.outputs];\n    result.inputs = [...this.inputs];\n    return result;\n  }\n\n  addOutput(node: NodeID): void {\n    this.outputs.push(node);\n  }\n\n  addInput(node: NodeID): void {\n    this.inputs.push(node);\n  }\n\n  removeInput(target: NodeID): NodeID | null {\n    const index = this.inputs.findIndex(node => node === target);\n    return index > -1 ? this.inputs.splice(index, 1)[0] : null;\n  }\n\n  removeOutput(target: NodeID): NodeID | null {\n    const index = this.outputs.findIndex(node => node === target);\n    return index > -1 ? this.outputs.splice(index, 1)[0] : null;\n  }\n}\n\n/**\n * Represents a Graph.\n *\n * This class is optimized for TermGraph use case and not supposed to be used as generic graph implementation.\n */\nexport class Graph<NodeID = number> {\n  /** Map of nodes. */\n  nodes = new Map<NodeID, GraphNode<NodeID>>();\n\n  constructor(arr?: NodeID[][]) {\n    if (!arr) {\n      return;\n    }\n    arr.forEach(edge => {\n      if (edge.length === 1) {\n        this.addNode(edge[0]);\n      } else {\n        this.addEdge(edge[0], edge[1]);\n      }\n    });\n  }\n\n  clone(): Graph<NodeID> {\n    const result = new Graph<NodeID>();\n    this.nodes.forEach(node => result.nodes.set(node.id, node.clone()));\n    return result;\n  }\n\n  at(target: NodeID): GraphNode<NodeID> | undefined {\n    return this.nodes.get(target);\n  }\n\n  addNode(target: NodeID): GraphNode<NodeID> {\n    let node = this.nodes.get(target);\n    if (!node) {\n      node = new GraphNode(target);\n      this.nodes.set(target, node);\n    }\n    return node;\n  }\n\n  hasNode(target: NodeID): boolean {\n    return !!this.nodes.get(target);\n  }\n\n  removeNode(target: NodeID): void {\n    this.nodes.forEach(node => {\n      node.removeInput(target);\n      node.removeOutput(target);\n    });\n    this.nodes.delete(target);\n  }\n\n  foldNode(target: NodeID): void {\n    const nodeToRemove = this.nodes.get(target);\n    if (!nodeToRemove) {\n      return;\n    }\n    nodeToRemove.inputs.forEach(input => {\n      nodeToRemove.outputs.forEach(output => {\n        this.addEdge(input, output);\n      });\n    });\n    this.removeNode(target);\n  }\n\n  removeIsolated(): GraphNode<NodeID>[] {\n    const result: GraphNode<NodeID>[] = [];\n    this.nodes.forEach(node => {\n      if (node.outputs.length === 0 && node.inputs.length === 0) {\n        result.push(node);\n        this.nodes.delete(node.id);\n      }\n    });\n    return result;\n  }\n\n  addEdge(source: NodeID, destination: NodeID): void {\n    if (this.hasEdge(source, destination)) {\n      return;\n    }\n    const sourceNode = this.addNode(source);\n    const destinationNode = this.addNode(destination);\n    sourceNode.addOutput(destinationNode.id);\n    destinationNode.addInput(sourceNode.id);\n  }\n\n  removeEdge(source: NodeID, destination: NodeID): void {\n    const sourceNode = this.nodes.get(source);\n    const destinationNode = this.nodes.get(destination);\n    if (sourceNode && destinationNode) {\n      sourceNode.removeOutput(destination);\n      destinationNode.removeInput(source);\n    }\n  }\n\n  hasEdge(source: NodeID, destination: NodeID): boolean {\n    const sourceNode = this.nodes.get(source);\n    if (!sourceNode) {\n      return false;\n    }\n    return !!sourceNode.outputs.find(id => id === destination);\n  }\n\n  isReachable(source: NodeID, destination: NodeID): boolean {\n    return this.expandAllOutputs([source]).includes(destination);\n  }\n\n  rootNodes(): NodeID[] {\n    return [...this.nodes.keys()].filter(id => !this.nodes.get(id)?.inputs.length);\n  }\n\n  expandOutputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = [];\n    origin.forEach(id => {\n      const node = this.nodes.get(id);\n      if (node) {\n        node.outputs.forEach(child => {\n          if (!origin.includes(child) && !result.includes(child)) {\n            result.push(child);\n          }\n        });\n      }\n    });\n    return result;\n  }\n\n  expandInputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = [];\n    origin.forEach(id => {\n      const node = this.nodes.get(id);\n      if (node) {\n        node.inputs.forEach(child => {\n          if (!origin.includes(child) && !result.includes(child)) {\n            result.push(child);\n          }\n        });\n      }\n    });\n    return result;\n  }\n\n  expandAllOutputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = this.expandOutputs(origin);\n    if (result.length === 0) {\n      return [];\n    }\n\n    const marked = new Map<NodeID, boolean>();\n    origin.forEach(id => marked.set(id, true));\n    let position = 0;\n    while (position < result.length) {\n      const node = this.nodes.get(result[position]);\n      if (node && !marked.get(node.id)) {\n        marked.set(node.id, true);\n        node.outputs.forEach(child => {\n          if (!marked.get(child) && !result.find(id => id === child)) {\n            result.push(child);\n          }\n        });\n      }\n      position += 1;\n    }\n    return result;\n  }\n\n  expandAllInputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = this.expandInputs(origin);\n    if (result.length === 0) {\n      return [];\n    }\n\n    const marked = new Map<NodeID, boolean>();\n    origin.forEach(id => marked.set(id, true));\n    let position = 0;\n    while (position < result.length) {\n      const node = this.nodes.get(result[position]);\n      if (node && !marked.get(node.id)) {\n        marked.set(node.id, true);\n        node.inputs.forEach(child => {\n          if (!marked.get(child) && !result.find(id => id === child)) {\n            result.push(child);\n          }\n        });\n      }\n      position += 1;\n    }\n    return result;\n  }\n\n  maximizePart(origin: NodeID[]): NodeID[] {\n    const outputs: NodeID[] = this.expandAllOutputs(origin);\n    const result = [...origin];\n    this.topologicalOrder()\n      .filter(id => outputs.includes(id))\n      .forEach(id => {\n        const node = this.nodes.get(id);\n        if (node?.inputs.every(parent => result.includes(parent))) {\n          result.push(id);\n        }\n      });\n    return result;\n  }\n\n  topologicalOrder(): NodeID[] {\n    const result: NodeID[] = [];\n    const marked = new Set<NodeID>();\n    const nodeStack: NodeID[] = [];\n    this.nodes.forEach(node => {\n      if (marked.has(node.id)) {\n        return;\n      }\n      nodeStack.push(node.id);\n      while (nodeStack.length > 0) {\n        const item = nodeStack[nodeStack.length - 1];\n        if (marked.has(item)) {\n          if (!result.find(id => id === item)) {\n            result.push(item);\n          }\n          nodeStack.pop();\n        } else {\n          marked.add(item);\n          const itemNode = this.nodes.get(item);\n          if (itemNode && itemNode.outputs.length > 0) {\n            itemNode.outputs.forEach(child => {\n              if (!marked.has(child)) {\n                nodeStack.push(child);\n              }\n            });\n          }\n        }\n      }\n    });\n    return result.reverse();\n  }\n\n  /**\n   * Stably reorders the given node ids so that, for this DAG, no node appears before a transitive\n   * successor (edges: source → dependent; {@link GraphNode.outputs} lists dependents).\n   */\n  sortStable(target: NodeID[]): NodeID[] {\n    if (target.length <= 1) {\n      return [...target];\n    }\n\n    const reachable = this.buildTransitiveClosureForSort();\n    const testSet = new Set<NodeID>();\n    const result: NodeID[] = [];\n\n    for (const nodeId of [...target].reverse()) {\n      const nodeReachable = reachable.get(nodeId) ?? new Set<NodeID>();\n      const needMove = testSet.has(nodeId);\n      for (const childId of nodeReachable) {\n        testSet.add(childId);\n      }\n\n      if (!needMove) {\n        result.push(nodeId);\n        continue;\n      }\n\n      let inserted = false;\n      for (let index = 0; index < result.length; index++) {\n        const parent = result[index];\n        const parentReachable = reachable.get(parent) ?? new Set<NodeID>();\n        if (nodeReachable.has(parent)) {\n          if (parentReachable.has(nodeId)) {\n            result.push(nodeId);\n          } else {\n            result.splice(index, 0, nodeId);\n          }\n          inserted = true;\n          break;\n        }\n      }\n      if (!inserted) {\n        result.push(nodeId);\n      }\n    }\n\n    result.reverse();\n    return result;\n  }\n\n  private buildTransitiveClosureForSort(): Map<NodeID, Set<NodeID>> {\n    const closure = new Map<NodeID, Set<NodeID>>();\n    for (const node of this.nodes.values()) {\n      closure.set(node.id, new Set(node.outputs));\n    }\n\n    const order = this.topologicalOrder();\n    for (const nodeId of [...order].reverse()) {\n      const node = this.at(nodeId);\n      if (!node) {\n        continue;\n      }\n      const nodeClosure = closure.get(nodeId) ?? new Set<NodeID>();\n      for (const parentId of node.inputs) {\n        const parentClosure = closure.get(parentId) ?? new Set<NodeID>();\n        for (const childId of nodeClosure) {\n          parentClosure.add(childId);\n        }\n        closure.set(parentId, parentClosure);\n      }\n    }\n\n    return closure;\n  }\n\n  transitiveReduction() {\n    const order = this.topologicalOrder();\n    const marked = new Map<NodeID, boolean>();\n    order.forEach(nodeID => {\n      if (marked.get(nodeID)) {\n        return;\n      }\n      const stack: { id: NodeID; parents: NodeID[] }[] = [];\n      stack.push({ id: nodeID, parents: [] });\n      while (stack.length > 0) {\n        const item = stack.splice(0, 1)[0];\n        const node = this.nodes.get(item.id);\n        if (node) {\n          node.outputs.forEach(child => {\n            item.parents.forEach(parent => this.removeEdge(parent, child));\n            stack.push({ id: child, parents: [item.id, ...item.parents] });\n          });\n        }\n        marked.set(item.id, true);\n      }\n    });\n  }\n\n  /**\n   * Finds a cycle in the graph.\n   *\n   * @returns {NodeID[] | null} The cycle if found, otherwise `null`.\n   * Uses non-recursive DFS. The returned path is closed (first id equals last).\n   */\n  findCycle(): NodeID[] | null {\n    const visited = new Set<NodeID>();\n    const nodeStack = new Set<NodeID>();\n    const parents = new Map<NodeID, NodeID>();\n\n    for (const nodeId of this.nodes.keys()) {\n      if (visited.has(nodeId)) {\n        continue;\n      }\n\n      const callStack: { nodeId: NodeID; parentId: NodeID | null }[] = [];\n      callStack.push({ nodeId: nodeId, parentId: null });\n      while (callStack.length > 0) {\n        const { nodeId, parentId } = callStack[callStack.length - 1];\n        if (visited.has(nodeId)) {\n          nodeStack.delete(nodeId);\n          callStack.pop();\n          continue;\n        }\n        visited.add(nodeId);\n        nodeStack.add(nodeId);\n        if (parentId !== null) {\n          parents.set(nodeId, parentId);\n        }\n\n        const currentNode = this.nodes.get(nodeId)!;\n        for (const child of currentNode.outputs) {\n          if (!visited.has(child)) {\n            callStack.push({ nodeId: child, parentId: nodeId });\n            continue;\n          }\n          if (!nodeStack.has(child)) {\n            continue;\n          }\n          const cycle: NodeID[] = [];\n          let current = nodeId;\n          cycle.push(child);\n          while (current !== child) {\n            cycle.push(current);\n            current = parents.get(current)!;\n          }\n          cycle.push(child);\n          cycle.reverse();\n          return cycle;\n        }\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Finds one closed cycle path per cyclic strongly connected component.\n   *\n   * @returns Closed paths (first id equals last). Empty when the graph is acyclic.\n   */\n  findCycles(): NodeID[][] {\n    const components = this.stronglyConnectedComponents();\n    const result: NodeID[][] = [];\n    for (const component of components) {\n      if (component.length === 1) {\n        const id = component[0];\n        if (this.hasEdge(id, id)) {\n          result.push([id, id]);\n        }\n        continue;\n      }\n      const subgraph = new Graph<NodeID>();\n      const memberIds = new Set(component);\n      for (const id of component) {\n        subgraph.addNode(id);\n        const node = this.nodes.get(id);\n        if (!node) {\n          continue;\n        }\n        for (const child of node.outputs) {\n          if (memberIds.has(child)) {\n            subgraph.addEdge(id, child);\n          }\n        }\n      }\n      const cycle = subgraph.findCycle();\n      if (cycle) {\n        result.push(cycle);\n      }\n    }\n    return result;\n  }\n\n  /** Tarjan strongly connected components (non-recursive). */\n  stronglyConnectedComponents(): NodeID[][] {\n    let index = 0;\n    const indices = new Map<NodeID, number>();\n    const lowlink = new Map<NodeID, number>();\n    const onStack = new Set<NodeID>();\n    const stack: NodeID[] = [];\n    const components: NodeID[][] = [];\n\n    type Frame = { nodeId: NodeID; edgeIndex: number; entered: boolean };\n    for (const startId of this.nodes.keys()) {\n      if (indices.has(startId)) {\n        continue;\n      }\n      const callStack: Frame[] = [{ nodeId: startId, edgeIndex: 0, entered: false }];\n      while (callStack.length > 0) {\n        const frame = callStack[callStack.length - 1];\n        const node = this.nodes.get(frame.nodeId);\n        if (!node) {\n          callStack.pop();\n          continue;\n        }\n\n        if (!frame.entered) {\n          frame.entered = true;\n          indices.set(frame.nodeId, index);\n          lowlink.set(frame.nodeId, index);\n          index += 1;\n          stack.push(frame.nodeId);\n          onStack.add(frame.nodeId);\n        }\n\n        if (frame.edgeIndex < node.outputs.length) {\n          const child = node.outputs[frame.edgeIndex];\n          frame.edgeIndex += 1;\n          if (!indices.has(child)) {\n            callStack.push({ nodeId: child, edgeIndex: 0, entered: false });\n          } else if (onStack.has(child)) {\n            lowlink.set(frame.nodeId, Math.min(lowlink.get(frame.nodeId)!, indices.get(child)!));\n          }\n          continue;\n        }\n\n        callStack.pop();\n        if (callStack.length > 0) {\n          const parentId = callStack[callStack.length - 1].nodeId;\n          lowlink.set(parentId, Math.min(lowlink.get(parentId)!, lowlink.get(frame.nodeId)!));\n        }\n\n        if (lowlink.get(frame.nodeId) === indices.get(frame.nodeId)) {\n          const component: NodeID[] = [];\n          while (stack.length > 0) {\n            const id = stack.pop()!;\n            onStack.delete(id);\n            component.push(id);\n            if (id === frame.nodeId) {\n              break;\n            }\n          }\n          components.push(component);\n        }\n      }\n    }\n    return components;\n  }\n}\n"],"mappings":";;;;;AAKA,IAAa,YAAb,MAAa,UAAkB;;CAE7B;;CAEA;;CAEA;CAEA,YAAY,IAAY;EACtB,KAAK,KAAK;EACV,KAAK,UAAU,CAAC;EAChB,KAAK,SAAS,CAAC;CACjB;CAEA,QAA2B;EACzB,MAAM,SAAS,IAAI,UAAU,KAAK,EAAE;EACpC,OAAO,UAAU,CAAC,GAAG,KAAK,OAAO;EACjC,OAAO,SAAS,CAAC,GAAG,KAAK,MAAM;EAC/B,OAAO;CACT;CAEA,UAAU,MAAoB;EAC5B,KAAK,QAAQ,KAAK,IAAI;CACxB;CAEA,SAAS,MAAoB;EAC3B,KAAK,OAAO,KAAK,IAAI;CACvB;CAEA,YAAY,QAA+B;EACzC,MAAM,QAAQ,KAAK,OAAO,WAAU,SAAQ,SAAS,MAAM;EAC3D,OAAO,QAAQ,KAAK,KAAK,OAAO,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK;CACxD;CAEA,aAAa,QAA+B;EAC1C,MAAM,QAAQ,KAAK,QAAQ,WAAU,SAAQ,SAAS,MAAM;EAC5D,OAAO,QAAQ,KAAK,KAAK,QAAQ,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK;CACzD;AACF;;;;;;AAOA,IAAa,QAAb,MAAa,MAAuB;;CAElC,wBAAQ,IAAI,IAA+B;CAE3C,YAAY,KAAkB;EAC5B,IAAI,CAAC,KACH;EAEF,IAAI,SAAQ,SAAQ;GAClB,IAAI,KAAK,WAAW,GAClB,KAAK,QAAQ,KAAK,EAAE;QAEpB,KAAK,QAAQ,KAAK,IAAI,KAAK,EAAE;EAEjC,CAAC;CACH;CAEA,QAAuB;EACrB,MAAM,SAAS,IAAI,MAAc;EACjC,KAAK,MAAM,SAAQ,SAAQ,OAAO,MAAM,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,CAAC;EAClE,OAAO;CACT;CAEA,GAAG,QAA+C;EAChD,OAAO,KAAK,MAAM,IAAI,MAAM;CAC9B;CAEA,QAAQ,QAAmC;EACzC,IAAI,OAAO,KAAK,MAAM,IAAI,MAAM;EAChC,IAAI,CAAC,MAAM;GACT,OAAO,IAAI,UAAU,MAAM;GAC3B,KAAK,MAAM,IAAI,QAAQ,IAAI;EAC7B;EACA,OAAO;CACT;CAEA,QAAQ,QAAyB;EAC/B,OAAO,CAAC,CAAC,KAAK,MAAM,IAAI,MAAM;CAChC;CAEA,WAAW,QAAsB;EAC/B,KAAK,MAAM,SAAQ,SAAQ;GACzB,KAAK,YAAY,MAAM;GACvB,KAAK,aAAa,MAAM;EAC1B,CAAC;EACD,KAAK,MAAM,OAAO,MAAM;CAC1B;CAEA,SAAS,QAAsB;EAC7B,MAAM,eAAe,KAAK,MAAM,IAAI,MAAM;EAC1C,IAAI,CAAC,cACH;EAEF,aAAa,OAAO,SAAQ,UAAS;GACnC,aAAa,QAAQ,SAAQ,WAAU;IACrC,KAAK,QAAQ,OAAO,MAAM;GAC5B,CAAC;EACH,CAAC;EACD,KAAK,WAAW,MAAM;CACxB;CAEA,iBAAsC;EACpC,MAAM,SAA8B,CAAC;EACrC,KAAK,MAAM,SAAQ,SAAQ;GACzB,IAAI,KAAK,QAAQ,WAAW,KAAK,KAAK,OAAO,WAAW,GAAG;IACzD,OAAO,KAAK,IAAI;IAChB,KAAK,MAAM,OAAO,KAAK,EAAE;GAC3B;EACF,CAAC;EACD,OAAO;CACT;CAEA,QAAQ,QAAgB,aAA2B;EACjD,IAAI,KAAK,QAAQ,QAAQ,WAAW,GAClC;EAEF,MAAM,aAAa,KAAK,QAAQ,MAAM;EACtC,MAAM,kBAAkB,KAAK,QAAQ,WAAW;EAChD,WAAW,UAAU,gBAAgB,EAAE;EACvC,gBAAgB,SAAS,WAAW,EAAE;CACxC;CAEA,WAAW,QAAgB,aAA2B;EACpD,MAAM,aAAa,KAAK,MAAM,IAAI,MAAM;EACxC,MAAM,kBAAkB,KAAK,MAAM,IAAI,WAAW;EAClD,IAAI,cAAc,iBAAiB;GACjC,WAAW,aAAa,WAAW;GACnC,gBAAgB,YAAY,MAAM;EACpC;CACF;CAEA,QAAQ,QAAgB,aAA8B;EACpD,MAAM,aAAa,KAAK,MAAM,IAAI,MAAM;EACxC,IAAI,CAAC,YACH,OAAO;EAET,OAAO,CAAC,CAAC,WAAW,QAAQ,MAAK,OAAM,OAAO,WAAW;CAC3D;CAEA,YAAY,QAAgB,aAA8B;EACxD,OAAO,KAAK,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,WAAW;CAC7D;CAEA,YAAsB;EACpB,OAAO,CAAC,GAAG,KAAK,MAAM,KAAK,CAAC,CAAC,CAAC,QAAO,OAAM,CAAC,KAAK,MAAM,IAAI,EAAE,CAAC,EAAE,OAAO,MAAM;CAC/E;CAEA,cAAc,QAA4B;EACxC,MAAM,SAAmB,CAAC;EAC1B,OAAO,SAAQ,OAAM;GACnB,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE;GAC9B,IAAI,MACF,KAAK,QAAQ,SAAQ,UAAS;IAC5B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GACnD,OAAO,KAAK,KAAK;GAErB,CAAC;EAEL,CAAC;EACD,OAAO;CACT;CAEA,aAAa,QAA4B;EACvC,MAAM,SAAmB,CAAC;EAC1B,OAAO,SAAQ,OAAM;GACnB,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE;GAC9B,IAAI,MACF,KAAK,OAAO,SAAQ,UAAS;IAC3B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GACnD,OAAO,KAAK,KAAK;GAErB,CAAC;EAEL,CAAC;EACD,OAAO;CACT;CAEA,iBAAiB,QAA4B;EAC3C,MAAM,SAAmB,KAAK,cAAc,MAAM;EAClD,IAAI,OAAO,WAAW,GACpB,OAAO,CAAC;EAGV,MAAM,yBAAS,IAAI,IAAqB;EACxC,OAAO,SAAQ,OAAM,OAAO,IAAI,IAAI,IAAI,CAAC;EACzC,IAAI,WAAW;EACf,OAAO,WAAW,OAAO,QAAQ;GAC/B,MAAM,OAAO,KAAK,MAAM,IAAI,OAAO,SAAS;GAC5C,IAAI,QAAQ,CAAC,OAAO,IAAI,KAAK,EAAE,GAAG;IAChC,OAAO,IAAI,KAAK,IAAI,IAAI;IACxB,KAAK,QAAQ,SAAQ,UAAS;KAC5B,IAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CAAC,OAAO,MAAK,OAAM,OAAO,KAAK,GACvD,OAAO,KAAK,KAAK;IAErB,CAAC;GACH;GACA,YAAY;EACd;EACA,OAAO;CACT;CAEA,gBAAgB,QAA4B;EAC1C,MAAM,SAAmB,KAAK,aAAa,MAAM;EACjD,IAAI,OAAO,WAAW,GACpB,OAAO,CAAC;EAGV,MAAM,yBAAS,IAAI,IAAqB;EACxC,OAAO,SAAQ,OAAM,OAAO,IAAI,IAAI,IAAI,CAAC;EACzC,IAAI,WAAW;EACf,OAAO,WAAW,OAAO,QAAQ;GAC/B,MAAM,OAAO,KAAK,MAAM,IAAI,OAAO,SAAS;GAC5C,IAAI,QAAQ,CAAC,OAAO,IAAI,KAAK,EAAE,GAAG;IAChC,OAAO,IAAI,KAAK,IAAI,IAAI;IACxB,KAAK,OAAO,SAAQ,UAAS;KAC3B,IAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CAAC,OAAO,MAAK,OAAM,OAAO,KAAK,GACvD,OAAO,KAAK,KAAK;IAErB,CAAC;GACH;GACA,YAAY;EACd;EACA,OAAO;CACT;CAEA,aAAa,QAA4B;EACvC,MAAM,UAAoB,KAAK,iBAAiB,MAAM;EACtD,MAAM,SAAS,CAAC,GAAG,MAAM;EACzB,KAAK,iBAAiB,CAAC,CACpB,QAAO,OAAM,QAAQ,SAAS,EAAE,CAAC,CAAC,CAClC,SAAQ,OAAM;GAEb,IADa,KAAK,MAAM,IAAI,EACxB,CAAA,EAAM,OAAO,OAAM,WAAU,OAAO,SAAS,MAAM,CAAC,GACtD,OAAO,KAAK,EAAE;EAElB,CAAC;EACH,OAAO;CACT;CAEA,mBAA6B;EAC3B,MAAM,SAAmB,CAAC;EAC1B,MAAM,yBAAS,IAAI,IAAY;EAC/B,MAAM,YAAsB,CAAC;EAC7B,KAAK,MAAM,SAAQ,SAAQ;GACzB,IAAI,OAAO,IAAI,KAAK,EAAE,GACpB;GAEF,UAAU,KAAK,KAAK,EAAE;GACtB,OAAO,UAAU,SAAS,GAAG;IAC3B,MAAM,OAAO,UAAU,UAAU,SAAS;IAC1C,IAAI,OAAO,IAAI,IAAI,GAAG;KACpB,IAAI,CAAC,OAAO,MAAK,OAAM,OAAO,IAAI,GAChC,OAAO,KAAK,IAAI;KAElB,UAAU,IAAI;IAChB,OAAO;KACL,OAAO,IAAI,IAAI;KACf,MAAM,WAAW,KAAK,MAAM,IAAI,IAAI;KACpC,IAAI,YAAY,SAAS,QAAQ,SAAS,GACxC,SAAS,QAAQ,SAAQ,UAAS;MAChC,IAAI,CAAC,OAAO,IAAI,KAAK,GACnB,UAAU,KAAK,KAAK;KAExB,CAAC;IAEL;GACF;EACF,CAAC;EACD,OAAO,OAAO,QAAQ;CACxB;;;;;CAMA,WAAW,QAA4B;EACrC,IAAI,OAAO,UAAU,GACnB,OAAO,CAAC,GAAG,MAAM;EAGnB,MAAM,YAAY,KAAK,8BAA8B;EACrD,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,SAAmB,CAAC;EAE1B,KAAK,MAAM,UAAU,CAAC,GAAG,MAAM,CAAC,CAAC,QAAQ,GAAG;GAC1C,MAAM,gBAAgB,UAAU,IAAI,MAAM,qBAAK,IAAI,IAAY;GAC/D,MAAM,WAAW,QAAQ,IAAI,MAAM;GACnC,KAAK,MAAM,WAAW,eACpB,QAAQ,IAAI,OAAO;GAGrB,IAAI,CAAC,UAAU;IACb,OAAO,KAAK,MAAM;IAClB;GACF;GAEA,IAAI,WAAW;GACf,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS;IAClD,MAAM,SAAS,OAAO;IACtB,MAAM,kBAAkB,UAAU,IAAI,MAAM,qBAAK,IAAI,IAAY;IACjE,IAAI,cAAc,IAAI,MAAM,GAAG;KAC7B,IAAI,gBAAgB,IAAI,MAAM,GAC5B,OAAO,KAAK,MAAM;UAElB,OAAO,OAAO,OAAO,GAAG,MAAM;KAEhC,WAAW;KACX;IACF;GACF;GACA,IAAI,CAAC,UACH,OAAO,KAAK,MAAM;EAEtB;EAEA,OAAO,QAAQ;EACf,OAAO;CACT;CAEA,gCAAkE;EAChE,MAAM,0BAAU,IAAI,IAAyB;EAC7C,KAAK,MAAM,QAAQ,KAAK,MAAM,OAAO,GACnC,QAAQ,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,OAAO,CAAC;EAG5C,MAAM,QAAQ,KAAK,iBAAiB;EACpC,KAAK,MAAM,UAAU,CAAC,GAAG,KAAK,CAAC,CAAC,QAAQ,GAAG;GACzC,MAAM,OAAO,KAAK,GAAG,MAAM;GAC3B,IAAI,CAAC,MACH;GAEF,MAAM,cAAc,QAAQ,IAAI,MAAM,qBAAK,IAAI,IAAY;GAC3D,KAAK,MAAM,YAAY,KAAK,QAAQ;IAClC,MAAM,gBAAgB,QAAQ,IAAI,QAAQ,qBAAK,IAAI,IAAY;IAC/D,KAAK,MAAM,WAAW,aACpB,cAAc,IAAI,OAAO;IAE3B,QAAQ,IAAI,UAAU,aAAa;GACrC;EACF;EAEA,OAAO;CACT;CAEA,sBAAsB;EACpB,MAAM,QAAQ,KAAK,iBAAiB;EACpC,MAAM,yBAAS,IAAI,IAAqB;EACxC,MAAM,SAAQ,WAAU;GACtB,IAAI,OAAO,IAAI,MAAM,GACnB;GAEF,MAAM,QAA6C,CAAC;GACpD,MAAM,KAAK;IAAE,IAAI;IAAQ,SAAS,CAAC;GAAE,CAAC;GACtC,OAAO,MAAM,SAAS,GAAG;IACvB,MAAM,OAAO,MAAM,OAAO,GAAG,CAAC,CAAC,CAAC;IAChC,MAAM,OAAO,KAAK,MAAM,IAAI,KAAK,EAAE;IACnC,IAAI,MACF,KAAK,QAAQ,SAAQ,UAAS;KAC5B,KAAK,QAAQ,SAAQ,WAAU,KAAK,WAAW,QAAQ,KAAK,CAAC;KAC7D,MAAM,KAAK;MAAE,IAAI;MAAO,SAAS,CAAC,KAAK,IAAI,GAAG,KAAK,OAAO;KAAE,CAAC;IAC/D,CAAC;IAEH,OAAO,IAAI,KAAK,IAAI,IAAI;GAC1B;EACF,CAAC;CACH;;;;;;;CAQA,YAA6B;EAC3B,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,4BAAY,IAAI,IAAY;EAClC,MAAM,0BAAU,IAAI,IAAoB;EAExC,KAAK,MAAM,UAAU,KAAK,MAAM,KAAK,GAAG;GACtC,IAAI,QAAQ,IAAI,MAAM,GACpB;GAGF,MAAM,YAA2D,CAAC;GAClE,UAAU,KAAK;IAAU;IAAQ,UAAU;GAAK,CAAC;GACjD,OAAO,UAAU,SAAS,GAAG;IAC3B,MAAM,EAAE,QAAQ,aAAa,UAAU,UAAU,SAAS;IAC1D,IAAI,QAAQ,IAAI,MAAM,GAAG;KACvB,UAAU,OAAO,MAAM;KACvB,UAAU,IAAI;KACd;IACF;IACA,QAAQ,IAAI,MAAM;IAClB,UAAU,IAAI,MAAM;IACpB,IAAI,aAAa,MACf,QAAQ,IAAI,QAAQ,QAAQ;IAG9B,MAAM,cAAc,KAAK,MAAM,IAAI,MAAM;IACzC,KAAK,MAAM,SAAS,YAAY,SAAS;KACvC,IAAI,CAAC,QAAQ,IAAI,KAAK,GAAG;MACvB,UAAU,KAAK;OAAE,QAAQ;OAAO,UAAU;MAAO,CAAC;MAClD;KACF;KACA,IAAI,CAAC,UAAU,IAAI,KAAK,GACtB;KAEF,MAAM,QAAkB,CAAC;KACzB,IAAI,UAAU;KACd,MAAM,KAAK,KAAK;KAChB,OAAO,YAAY,OAAO;MACxB,MAAM,KAAK,OAAO;MAClB,UAAU,QAAQ,IAAI,OAAO;KAC/B;KACA,MAAM,KAAK,KAAK;KAChB,MAAM,QAAQ;KACd,OAAO;IACT;GACF;EACF;EACA,OAAO;CACT;;;;;;CAOA,aAAyB;EACvB,MAAM,aAAa,KAAK,4BAA4B;EACpD,MAAM,SAAqB,CAAC;EAC5B,KAAK,MAAM,aAAa,YAAY;GAClC,IAAI,UAAU,WAAW,GAAG;IAC1B,MAAM,KAAK,UAAU;IACrB,IAAI,KAAK,QAAQ,IAAI,EAAE,GACrB,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC;IAEtB;GACF;GACA,MAAM,WAAW,IAAI,MAAc;GACnC,MAAM,YAAY,IAAI,IAAI,SAAS;GACnC,KAAK,MAAM,MAAM,WAAW;IAC1B,SAAS,QAAQ,EAAE;IACnB,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE;IAC9B,IAAI,CAAC,MACH;IAEF,KAAK,MAAM,SAAS,KAAK,SACvB,IAAI,UAAU,IAAI,KAAK,GACrB,SAAS,QAAQ,IAAI,KAAK;GAGhC;GACA,MAAM,QAAQ,SAAS,UAAU;GACjC,IAAI,OACF,OAAO,KAAK,KAAK;EAErB;EACA,OAAO;CACT;;CAGA,8BAA0C;EACxC,IAAI,QAAQ;EACZ,MAAM,0BAAU,IAAI,IAAoB;EACxC,MAAM,0BAAU,IAAI,IAAoB;EACxC,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,QAAkB,CAAC;EACzB,MAAM,aAAyB,CAAC;EAGhC,KAAK,MAAM,WAAW,KAAK,MAAM,KAAK,GAAG;GACvC,IAAI,QAAQ,IAAI,OAAO,GACrB;GAEF,MAAM,YAAqB,CAAC;IAAE,QAAQ;IAAS,WAAW;IAAG,SAAS;GAAM,CAAC;GAC7E,OAAO,UAAU,SAAS,GAAG;IAC3B,MAAM,QAAQ,UAAU,UAAU,SAAS;IAC3C,MAAM,OAAO,KAAK,MAAM,IAAI,MAAM,MAAM;IACxC,IAAI,CAAC,MAAM;KACT,UAAU,IAAI;KACd;IACF;IAEA,IAAI,CAAC,MAAM,SAAS;KAClB,MAAM,UAAU;KAChB,QAAQ,IAAI,MAAM,QAAQ,KAAK;KAC/B,QAAQ,IAAI,MAAM,QAAQ,KAAK;KAC/B,SAAS;KACT,MAAM,KAAK,MAAM,MAAM;KACvB,QAAQ,IAAI,MAAM,MAAM;IAC1B;IAEA,IAAI,MAAM,YAAY,KAAK,QAAQ,QAAQ;KACzC,MAAM,QAAQ,KAAK,QAAQ,MAAM;KACjC,MAAM,aAAa;KACnB,IAAI,CAAC,QAAQ,IAAI,KAAK,GACpB,UAAU,KAAK;MAAE,QAAQ;MAAO,WAAW;MAAG,SAAS;KAAM,CAAC;UACzD,IAAI,QAAQ,IAAI,KAAK,GAC1B,QAAQ,IAAI,MAAM,QAAQ,KAAK,IAAI,QAAQ,IAAI,MAAM,MAAM,GAAI,QAAQ,IAAI,KAAK,CAAE,CAAC;KAErF;IACF;IAEA,UAAU,IAAI;IACd,IAAI,UAAU,SAAS,GAAG;KACxB,MAAM,WAAW,UAAU,UAAU,SAAS,EAAE,CAAC;KACjD,QAAQ,IAAI,UAAU,KAAK,IAAI,QAAQ,IAAI,QAAQ,GAAI,QAAQ,IAAI,MAAM,MAAM,CAAE,CAAC;IACpF;IAEA,IAAI,QAAQ,IAAI,MAAM,MAAM,MAAM,QAAQ,IAAI,MAAM,MAAM,GAAG;KAC3D,MAAM,YAAsB,CAAC;KAC7B,OAAO,MAAM,SAAS,GAAG;MACvB,MAAM,KAAK,MAAM,IAAI;MACrB,QAAQ,OAAO,EAAE;MACjB,UAAU,KAAK,EAAE;MACjB,IAAI,OAAO,MAAM,QACf;KAEJ;KACA,WAAW,KAAK,SAAS;IAC3B;GACF;EACF;EACA,OAAO;CACT;AACF"}

package/dist/graph/index.d.ts

@@ -1,2 +1,2 @@
-import { t as Graph } from "../graph-DR8rL2o3.js";
+import { t as Graph } from "../graph-DPOvglEm.js";
 export { Graph };

package/dist/{graph-DR8rL2o3.d.ts → graph-DPOvglEm.d.ts}

@@ -55,10 +55,18 @@ declare class Graph<NodeID = number> {
    * Finds a cycle in the graph.
    *
    * @returns {NodeID[] | null} The cycle if found, otherwise `null`.
-   * Uses non-recursive DFS.
+   * Uses non-recursive DFS. The returned path is closed (first id equals last).
    */
   findCycle(): NodeID[] | null;
+  /**
+   * Finds one closed cycle path per cyclic strongly connected component.
+   *
+   * @returns Closed paths (first id equals last). Empty when the graph is acyclic.
+   */
+  findCycles(): NodeID[][];
+  /** Tarjan strongly connected components (non-recursive). */
+  stronglyConnectedComponents(): NodeID[][];
 }
 //#endregion
 export { GraphNode as n, Graph as t };
-//# sourceMappingURL=graph-DR8rL2o3.d.ts.map
+//# sourceMappingURL=graph-DPOvglEm.d.ts.map

package/dist/index.d.ts

@@ -1,5 +1,5 @@
 import { EntityReference, Grammeme, ReferenceType, SyntacticReference, TermContext, WordForm, supportedGrammemes } from "./cctext/language.js";
-import { t as Graph } from "./graph-DR8rL2o3.js";
+import { t as Graph } from "./graph-DPOvglEm.js";
 import { r as printTree, t as CMSyntaxNode } from "./lezer-tree-iS7LpLBJ.js";
 import { a as TOKEN_ERROR, c as flattenAst, d as printAst, f as visitAstDFS, i as FlatAstNode, l as getNodeIndices, n as AstNodeBase, o as buildTree, r as FlatAST, s as findByUid, t as AstNode, u as getNodeText } from "./ast-C8sIpKdL.js";
 import { t as Branded } from "./branded-ZlzIcxzu.js";
@@ -18,9 +18,9 @@ import { n as ArgumentsType } from "./arguments-extractor-ngatANBI.js";
 import { n as applyAsciiTypeSubstitutions, r as parseTypeText } from "./typification-parser-Dytsv9CI.js";
 import { n as TypificationNodeData, t as TypificationGraph } from "./typification-graph-BY_oGT82.js";
 import { a as LibraryItemType, i as LibraryItemReference, n as CurrentVersion, o as LocationHead, r as LibraryItem, s as VersionInfo, t as AccessPolicy } from "./library-CYun28Xz.js";
-import { C as TypeInfo, S as Substitution, _ as CstClass, a as hasCstDiagnostic, b as RSForm, c as BasicsContext, d as RSModel, f as RSModelStats, g as Constituenta, h as Attribution, i as assignSchemaDiagnostics, l as DEFAULT_VALUE_TEXT, m as ArgumentValue, n as DiagnosticKind, o as modelStatusCstDiagnostic, r as RSDiagnosticCode, s as BasicBinding, t as CstDiagnostic, u as EvalStatus, v as CstStatus, x as RSFormStats, y as CstType } from "./diagnostics-Clo3mkba.js";
+import { C as RSFormStats, S as RSForm, T as TypeInfo, _ as Attribution, a as detectDependencyCycleDiagnostics, b as CstStatus, c as modelStatusCstDiagnostic, d as DEFAULT_VALUE_TEXT, f as EvalStatus, g as ArgumentValue, i as assignSchemaDiagnostics, l as BasicBinding, m as RSModelStats, n as DiagnosticKind, o as formatDependencyCycle, p as RSModel, r as RSDiagnosticCode, s as hasCstDiagnostic, t as CstDiagnostic, u as BasicsContext, v as Constituenta, w as Substitution, x as CstType, y as CstClass } from "./diagnostics-Dtzgj5Q9.js";
 import { FolderNode, FolderTree } from "./library/folder-tree.js";
 import { n as OssLayout, r as Position2D } from "./oss-layout-3glgAqfn.js";
 import { Block, CstSubstituteInfo, NodeType, Operation, OperationInput, OperationSchema, OperationSchemaStats, OperationSynthesis, OperationType, OssItem, SubstitutionErrorDescription, SubstitutionErrorType } from "./library/oss.js";
 import { RSEngine } from "./library/rsengine.js";
-export { AccessPolicy, type AnalysisBase, type AnalysisFast, type AnalysisFull, AnyTypificationT, type ArgumentValue, type ArgumentsType, type AstNode, type AstNodeBase, type Attribution, type BasicBinding, type BasicsContext, type Block, type Branded, type CMSyntaxNode, type CalculatorEvaluateOptions, type CalculatorResult, type Constituenta, CstClass, type CstDiagnostic, CstStatus, type CstSubstituteInfo, CstType, type CurrentVersion, DEFAULT_VALUE_TEXT, DiagnosticKind, EmptySetT, type EntityReference, EvalStatus, type ExpressionType, type FlatAST, type FlatAstNode, FolderNode, FolderTree, Grammeme, Graph, type LibraryItem, type LibraryItemReference, LibraryItemType, LocationHead, LogicT, NodeType, type Operation, type OperationInput, type OperationSchema, type OperationSchemaStats, type OperationSynthesis, OperationType, type OssItem, type OssLayout, type Position2D, RSCalculator, RSDiagnosticCode, RSEngine, RSErrorCode, type RSErrorDescription, type RSForm, type RSFormStats, RSLangAnalyzer, type RSModel, type RSModelStats, ReferenceType, type Substitution, type SubstitutionErrorDescription, SubstitutionErrorType, type SyntacticReference, TOKEN_ERROR, TUPLE_ID, type TermContext, TokenID, TypeClass, TypeID, type TypeInfo, type TypePath, type Typification, TypificationGraph, type TypificationNodeData, type Value, ValueClass, type ValuePath, type VersionInfo, type WordForm, applyAsciiTypeSubstitutions, applyHash_fnv1a, assignSchemaDiagnostics, buildTree, findByUid, flattenAst, generateStub, getNodeIndices, getNodeText, hasCstDiagnostic, makeTypePath, makeValuePath, modelStatusCstDiagnostic, parseTypeText, printAst, printTree, printValue, readErrorAnnotation, readTypeAnnotation, parser as rslangParser, supportedGrammemes, visitAstDFS };
+export { AccessPolicy, type AnalysisBase, type AnalysisFast, type AnalysisFull, AnyTypificationT, type ArgumentValue, type ArgumentsType, type AstNode, type AstNodeBase, type Attribution, type BasicBinding, type BasicsContext, type Block, type Branded, type CMSyntaxNode, type CalculatorEvaluateOptions, type CalculatorResult, type Constituenta, CstClass, type CstDiagnostic, CstStatus, type CstSubstituteInfo, CstType, type CurrentVersion, DEFAULT_VALUE_TEXT, DiagnosticKind, EmptySetT, type EntityReference, EvalStatus, type ExpressionType, type FlatAST, type FlatAstNode, FolderNode, FolderTree, Grammeme, Graph, type LibraryItem, type LibraryItemReference, LibraryItemType, LocationHead, LogicT, NodeType, type Operation, type OperationInput, type OperationSchema, type OperationSchemaStats, type OperationSynthesis, OperationType, type OssItem, type OssLayout, type Position2D, RSCalculator, RSDiagnosticCode, RSEngine, RSErrorCode, type RSErrorDescription, type RSForm, type RSFormStats, RSLangAnalyzer, type RSModel, type RSModelStats, ReferenceType, type Substitution, type SubstitutionErrorDescription, SubstitutionErrorType, type SyntacticReference, TOKEN_ERROR, TUPLE_ID, type TermContext, TokenID, TypeClass, TypeID, type TypeInfo, type TypePath, type Typification, TypificationGraph, type TypificationNodeData, type Value, ValueClass, type ValuePath, type VersionInfo, type WordForm, applyAsciiTypeSubstitutions, applyHash_fnv1a, assignSchemaDiagnostics, buildTree, detectDependencyCycleDiagnostics, findByUid, flattenAst, formatDependencyCycle, generateStub, getNodeIndices, getNodeText, hasCstDiagnostic, makeTypePath, makeValuePath, modelStatusCstDiagnostic, parseTypeText, printAst, printTree, printValue, readErrorAnnotation, readTypeAnnotation, parser as rslangParser, supportedGrammemes, visitAstDFS };

package/dist/index.js

@@ -15,10 +15,10 @@ import { RSLangAnalyzer } from "./rslang/semantic/analyzer.js";
 import { applyAsciiTypeSubstitutions, parseTypeText } from "./rslang/semantic/typification-parser.js";
 import { TypificationGraph } from "./rslang/typification-graph.js";
 import { CstClass, CstStatus, CstType } from "./library/rsform.js";
-import { a as modelStatusCstDiagnostic, i as hasCstDiagnostic, n as RSDiagnosticCode, r as assignSchemaDiagnostics, t as DiagnosticKind } from "./diagnostics-D7SiHAwW.js";
+import { a as formatDependencyCycle, i as detectDependencyCycleDiagnostics, n as RSDiagnosticCode, o as hasCstDiagnostic, r as assignSchemaDiagnostics, s as modelStatusCstDiagnostic, t as DiagnosticKind } from "./diagnostics-BSryP66e.js";
 import { DEFAULT_VALUE_TEXT, EvalStatus } from "./library/rsmodel.js";
 import { FolderNode, FolderTree } from "./library/folder-tree.js";
 import { AccessPolicy, LibraryItemType, LocationHead } from "./library/library.js";
 import { NodeType, OperationType, SubstitutionErrorType } from "./library/oss.js";
 import { RSEngine } from "./library/rsengine.js";
-export { AccessPolicy, AnyTypificationT, CstClass, CstStatus, CstType, DEFAULT_VALUE_TEXT, DiagnosticKind, EmptySetT, EvalStatus, FolderNode, FolderTree, Grammeme, Graph, LibraryItemType, LocationHead, LogicT, NodeType, OperationType, RSCalculator, RSDiagnosticCode, RSEngine, RSErrorCode, RSLangAnalyzer, ReferenceType, SubstitutionErrorType, TOKEN_ERROR, TUPLE_ID, TokenID, TypeClass, TypeID, TypificationGraph, ValueClass, applyAsciiTypeSubstitutions, applyHash_fnv1a, assignSchemaDiagnostics, buildTree, findByUid, flattenAst, generateStub, getNodeIndices, getNodeText, hasCstDiagnostic, makeTypePath, makeValuePath, modelStatusCstDiagnostic, parseTypeText, printAst, printTree, printValue, readErrorAnnotation, readTypeAnnotation, parser as rslangParser, supportedGrammemes, visitAstDFS };
+export { AccessPolicy, AnyTypificationT, CstClass, CstStatus, CstType, DEFAULT_VALUE_TEXT, DiagnosticKind, EmptySetT, EvalStatus, FolderNode, FolderTree, Grammeme, Graph, LibraryItemType, LocationHead, LogicT, NodeType, OperationType, RSCalculator, RSDiagnosticCode, RSEngine, RSErrorCode, RSLangAnalyzer, ReferenceType, SubstitutionErrorType, TOKEN_ERROR, TUPLE_ID, TokenID, TypeClass, TypeID, TypificationGraph, ValueClass, applyAsciiTypeSubstitutions, applyHash_fnv1a, assignSchemaDiagnostics, buildTree, detectDependencyCycleDiagnostics, findByUid, flattenAst, formatDependencyCycle, generateStub, getNodeIndices, getNodeText, hasCstDiagnostic, makeTypePath, makeValuePath, modelStatusCstDiagnostic, parseTypeText, printAst, printTree, printValue, readErrorAnnotation, readTypeAnnotation, parser as rslangParser, supportedGrammemes, visitAstDFS };

package/dist/library/diagnostics.d.ts

@@ -1,2 +1,2 @@
-import { a as hasCstDiagnostic, i as assignSchemaDiagnostics, n as DiagnosticKind, o as modelStatusCstDiagnostic, r as RSDiagnosticCode, t as CstDiagnostic } from "../diagnostics-Clo3mkba.js";
-export { CstDiagnostic, DiagnosticKind, RSDiagnosticCode, assignSchemaDiagnostics, hasCstDiagnostic, modelStatusCstDiagnostic };
+import { a as detectDependencyCycleDiagnostics, c as modelStatusCstDiagnostic, i as assignSchemaDiagnostics, n as DiagnosticKind, o as formatDependencyCycle, r as RSDiagnosticCode, s as hasCstDiagnostic, t as CstDiagnostic } from "../diagnostics-Dtzgj5Q9.js";
+export { CstDiagnostic, DiagnosticKind, RSDiagnosticCode, assignSchemaDiagnostics, detectDependencyCycleDiagnostics, formatDependencyCycle, hasCstDiagnostic, modelStatusCstDiagnostic };

package/dist/library/diagnostics.js

@@ -1,2 +1,2 @@
-import { a as modelStatusCstDiagnostic, i as hasCstDiagnostic, n as RSDiagnosticCode, r as assignSchemaDiagnostics, t as DiagnosticKind } from "../diagnostics-D7SiHAwW.js";
-export { DiagnosticKind, RSDiagnosticCode, assignSchemaDiagnostics, hasCstDiagnostic, modelStatusCstDiagnostic };
+import { a as formatDependencyCycle, i as detectDependencyCycleDiagnostics, n as RSDiagnosticCode, o as hasCstDiagnostic, r as assignSchemaDiagnostics, s as modelStatusCstDiagnostic, t as DiagnosticKind } from "../diagnostics-BSryP66e.js";
+export { DiagnosticKind, RSDiagnosticCode, assignSchemaDiagnostics, detectDependencyCycleDiagnostics, formatDependencyCycle, hasCstDiagnostic, modelStatusCstDiagnostic };

package/dist/library/index.d.ts

@@ -1,5 +1,5 @@
 import { a as LibraryItemType, i as LibraryItemReference, n as CurrentVersion, o as LocationHead, r as LibraryItem, s as VersionInfo, t as AccessPolicy } from "../library-CYun28Xz.js";
-import { C as TypeInfo, S as Substitution, _ as CstClass, a as hasCstDiagnostic, b as RSForm, c as BasicsContext, d as RSModel, f as RSModelStats, g as Constituenta, h as Attribution, i as assignSchemaDiagnostics, l as DEFAULT_VALUE_TEXT, m as ArgumentValue, n as DiagnosticKind, o as modelStatusCstDiagnostic, r as RSDiagnosticCode, s as BasicBinding, t as CstDiagnostic, u as EvalStatus, v as CstStatus, x as RSFormStats, y as CstType } from "../diagnostics-Clo3mkba.js";
+import { C as RSFormStats, S as RSForm, T as TypeInfo, _ as Attribution, a as detectDependencyCycleDiagnostics, b as CstStatus, c as modelStatusCstDiagnostic, d as DEFAULT_VALUE_TEXT, f as EvalStatus, g as ArgumentValue, i as assignSchemaDiagnostics, l as BasicBinding, m as RSModelStats, n as DiagnosticKind, o as formatDependencyCycle, p as RSModel, r as RSDiagnosticCode, s as hasCstDiagnostic, t as CstDiagnostic, u as BasicsContext, v as Constituenta, w as Substitution, x as CstType, y as CstClass } from "../diagnostics-Dtzgj5Q9.js";
 import { FolderNode, FolderTree } from "./folder-tree.js";
 import { n as OssLayout, r as Position2D } from "../oss-layout-3glgAqfn.js";
 import { Block, CstSubstituteInfo, NodeType, Operation, OperationInput, OperationSchema, OperationSchemaStats, OperationSynthesis, OperationType, OssItem, SubstitutionErrorDescription, SubstitutionErrorType } from "./oss.js";
@@ -99,5 +99,5 @@ declare class TemplateInstantiationPlanner {
   private collectDependencies;
 }
 //#endregion
-export { AccessPolicy, type ArgumentValue, type Attribution, type BasicBinding, type BasicsContext, type Block, type Constituenta, CstClass, type CstDiagnostic, CstStatus, type CstSubstituteInfo, CstType, type CurrentVersion, DEFAULT_VALUE_TEXT, DiagnosticKind, EvalStatus, FolderNode, FolderTree, type LibraryItem, type LibraryItemReference, LibraryItemType, LocationHead, NodeType, type Operation, type OperationInput, type OperationSchema, type OperationSchemaStats, type OperationSynthesis, OperationType, type OssItem, type OssLayout, type Position2D, RSDiagnosticCode, RSEngine, type RSForm, type RSFormStats, type RSModel, type RSModelStats, type Substitution, type SubstitutionErrorDescription, SubstitutionErrorType, type TemplateBindingConflict, type TemplateInstantiationInput, type TemplateInstantiationItem, type TemplateInstantiationPlan, TemplateInstantiationPlanner, type TypeInfo, type VersionInfo, assignSchemaDiagnostics, hasCstDiagnostic, modelStatusCstDiagnostic, planTemplateInstantiation };
+export { AccessPolicy, type ArgumentValue, type Attribution, type BasicBinding, type BasicsContext, type Block, type Constituenta, CstClass, type CstDiagnostic, CstStatus, type CstSubstituteInfo, CstType, type CurrentVersion, DEFAULT_VALUE_TEXT, DiagnosticKind, EvalStatus, FolderNode, FolderTree, type LibraryItem, type LibraryItemReference, LibraryItemType, LocationHead, NodeType, type Operation, type OperationInput, type OperationSchema, type OperationSchemaStats, type OperationSynthesis, OperationType, type OssItem, type OssLayout, type Position2D, RSDiagnosticCode, RSEngine, type RSForm, type RSFormStats, type RSModel, type RSModelStats, type Substitution, type SubstitutionErrorDescription, SubstitutionErrorType, type TemplateBindingConflict, type TemplateInstantiationInput, type TemplateInstantiationItem, type TemplateInstantiationPlan, TemplateInstantiationPlanner, type TypeInfo, type VersionInfo, assignSchemaDiagnostics, detectDependencyCycleDiagnostics, formatDependencyCycle, hasCstDiagnostic, modelStatusCstDiagnostic, planTemplateInstantiation };
 //# sourceMappingURL=index.d.ts.map

package/dist/library/index.js

@@ -5,7 +5,7 @@ import { TypeID } from "../rslang/semantic/typification.js";
 import { labelType } from "../rslang/labels.js";
 import { applyAliasMapping, isGlobalAlias, parseRSLangExpression, splitTemplateDefinition, substituteLocalAliases, substituteTemplateArgs } from "../rslang/api.js";
 import { CstClass, CstStatus, CstType } from "./rsform.js";
-import { D as isFunctional, a as modelStatusCstDiagnostic, c as applyMappingToConstituents, h as generateAlias, i as hasCstDiagnostic, j as normalizeExpression, l as argumentValuesToMapping, n as RSDiagnosticCode, r as assignSchemaDiagnostics, t as DiagnosticKind, w as inferTemplatedType } from "../diagnostics-D7SiHAwW.js";
+import { E as inferTemplatedType, N as normalizeExpression, _ as generateAlias, a as formatDependencyCycle, d as argumentValuesToMapping, i as detectDependencyCycleDiagnostics, k as isFunctional, n as RSDiagnosticCode, o as hasCstDiagnostic, r as assignSchemaDiagnostics, s as modelStatusCstDiagnostic, t as DiagnosticKind, u as applyMappingToConstituents } from "../diagnostics-BSryP66e.js";
 import { DEFAULT_VALUE_TEXT, EvalStatus } from "./rsmodel.js";
 import { FolderNode, FolderTree } from "./folder-tree.js";
 import { AccessPolicy, LibraryItemType, LocationHead } from "./library.js";
@@ -284,6 +284,6 @@ function topologicalSort(aliases, refs) {
 	return sorted;
 }
 //#endregion
-export { AccessPolicy, CstClass, CstStatus, CstType, DEFAULT_VALUE_TEXT, DiagnosticKind, EvalStatus, FolderNode, FolderTree, LibraryItemType, LocationHead, NodeType, OperationType, RSDiagnosticCode, RSEngine, SubstitutionErrorType, TemplateInstantiationPlanner, assignSchemaDiagnostics, hasCstDiagnostic, modelStatusCstDiagnostic, planTemplateInstantiation };
+export { AccessPolicy, CstClass, CstStatus, CstType, DEFAULT_VALUE_TEXT, DiagnosticKind, EvalStatus, FolderNode, FolderTree, LibraryItemType, LocationHead, NodeType, OperationType, RSDiagnosticCode, RSEngine, SubstitutionErrorType, TemplateInstantiationPlanner, assignSchemaDiagnostics, detectDependencyCycleDiagnostics, formatDependencyCycle, hasCstDiagnostic, modelStatusCstDiagnostic, planTemplateInstantiation };
 
 //# sourceMappingURL=index.js.map

package/dist/library/oss-api.d.ts

@@ -1,5 +1,5 @@
 import { r as LibraryItem } from "../library-CYun28Xz.js";
-import { S as Substitution, b as RSForm, g as Constituenta } from "../diagnostics-Clo3mkba.js";
+import { S as RSForm, v as Constituenta, w as Substitution } from "../diagnostics-Dtzgj5Q9.js";
 import { NodeType, OperationSchema, SubstitutionErrorDescription } from "./oss.js";
 
 //#region src/library/oss-api.d.ts

package/dist/library/oss.d.ts

@@ -1,4 +1,4 @@
-import { t as Graph } from "../graph-DR8rL2o3.js";
+import { t as Graph } from "../graph-DPOvglEm.js";
 import { r as LibraryItem } from "../library-CYun28Xz.js";
 import { n as OssLayout, t as NodePosition } from "../oss-layout-3glgAqfn.js";
 

package/dist/library/rsengine.d.ts

@@ -1,7 +1,7 @@
 import { t as AstNode } from "../ast-C8sIpKdL.js";
 import { l as Value } from "../value-BduA_ZGp.js";
 import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "../calculator-k8BGIKmj.js";
-import { b as RSForm, c as BasicsContext, d as RSModel, s as BasicBinding, u as EvalStatus, y as CstType } from "../diagnostics-Clo3mkba.js";
+import { S as RSForm, f as EvalStatus, l as BasicBinding, p as RSModel, u as BasicsContext, x as CstType } from "../diagnostics-Dtzgj5Q9.js";
 
 //#region src/library/rsengine.d.ts
 /** Services for {@link RSEngine}. */

package/dist/library/rsengine.js

@@ -4,7 +4,7 @@ import { l as compare } from "../value-COprb2Je.js";
 import { RSCalculator } from "../rslang/eval/calculator.js";
 import "../rslang/index.js";
 import { CstType } from "./rsform.js";
-import { D as isFunctional, E as isBasicConcept, T as isBaseSet, g as getAnalysisFor } from "../diagnostics-D7SiHAwW.js";
+import { D as isBaseSet, O as isBasicConcept, k as isFunctional, v as getAnalysisFor } from "../diagnostics-BSryP66e.js";
 import { TYPE_BASIC } from "./rsmodel.js";
 import { inferEvalStatus, isInferrable, tryFixValue } from "./rsmodel-api.js";
 //#region src/library/rsengine.ts

package/dist/library/rsform-api.d.ts

@@ -3,7 +3,7 @@ import { g as TypeClass, y as TypePath } from "../typification-9lNu9R4k.js";
 import { t as ValueClass } from "../value-class-CNI-lqXJ.js";
 import { r as AnalysisFull } from "../analyzer-iqAXyROE.js";
 import { r as LibraryItem } from "../library-CYun28Xz.js";
-import { _ as CstClass, b as RSForm, g as Constituenta, m as ArgumentValue, v as CstStatus, x as RSFormStats, y as CstType } from "../diagnostics-Clo3mkba.js";
+import { C as RSFormStats, S as RSForm, b as CstStatus, g as ArgumentValue, v as Constituenta, x as CstType, y as CstClass } from "../diagnostics-Dtzgj5Q9.js";
 import { AliasMapping } from "../rslang/api.js";
 
 //#region src/library/rsform-api.d.ts
@@ -82,6 +82,17 @@ declare function typeClassForCstType(cstType: CstType): TypeClass;
 declare function canHaveFormalDefinition(cstType: CstType): boolean;
 /** Analyze expression for {@link RSForm}. */
 declare function getAnalysisFor(expression: string, cstType: CstType, schema: RSForm, alias?: string): AnalysisFull;
+/**
+ * When an untyped / bare F·P reference names a constituent on a definition cycle with the
+ * current expression, replace that error with {@link RSDiagnosticCode.schemaDependencyCycle}.
+ *
+ * Covers both semantic `globalNotTyped` (e.g. `F3[σ]`) and parser `globalFuncWithoutArgs`
+ * (bare `P1` / `F1` treated as a call without arguments).
+ *
+ * Uses a draft dependency graph: incoming edges of the edited constituent are taken from
+ * `expression`, so Check works before Save.
+ */
+declare function refineAnalysisForDependencyCycles(analysis: AnalysisFull, expression: string, schema: RSForm, alias?: string): AnalysisFull;
 /** Calculate statistics for {@link RSForm}. */
 declare function calculateSchemaStats(target: RSForm): RSFormStats;
 /** Finds {@link Constituenta} by structure path. */
@@ -89,5 +100,5 @@ declare function findCstByStructure(schema: RSForm, target: Constituenta, path:
 /** Retrieves name for piece of target {@link Constituenta} structure. */
 declare function getStructureName(schema: RSForm, target: Constituenta, path: TypePath): string;
 //#endregion
-export { ConstituentaMappableFields, addAliasReference, applyFilterCategory, applyMappingToConstituents, argumentValuesToMapping, calculateSchemaStats, canHaveFormalDefinition, canHaveManualTypification, canProduceStructure, findCstByStructure, generateAlias, getAnalysisFor, getCstTypePrefix, getStructureName, guessCstType, inferClass, inferNewSpawnPosition, inferStatus, inferTemplate, inferTemplatedType, isBaseSet, isBasicConcept, isFunctional, isLogical, isSchemaIssue, isTemplateCst, normalizeExpression, removeAliasReference, sortItemsForInlineSynthesis, typeClassForCstType, validateAliasFormat, validateNewAlias };
+export { ConstituentaMappableFields, addAliasReference, applyFilterCategory, applyMappingToConstituents, argumentValuesToMapping, calculateSchemaStats, canHaveFormalDefinition, canHaveManualTypification, canProduceStructure, findCstByStructure, generateAlias, getAnalysisFor, getCstTypePrefix, getStructureName, guessCstType, inferClass, inferNewSpawnPosition, inferStatus, inferTemplate, inferTemplatedType, isBaseSet, isBasicConcept, isFunctional, isLogical, isSchemaIssue, isTemplateCst, normalizeExpression, refineAnalysisForDependencyCycles, removeAliasReference, sortItemsForInlineSynthesis, typeClassForCstType, validateAliasFormat, validateNewAlias };
 //# sourceMappingURL=rsform-api.d.ts.map

package/dist/library/rsform-api.js

@@ -1,2 +1,2 @@
-import { A as isTemplateCst, C as inferTemplate, D as isFunctional, E as isBasicConcept, F as validateAliasFormat, I as validateNewAlias, M as removeAliasReference, N as sortItemsForInlineSynthesis, O as isLogical, P as typeClassForCstType, S as inferStatus, T as isBaseSet, _ as getCstTypePrefix, b as inferClass, c as applyMappingToConstituents, d as canHaveFormalDefinition, f as canHaveManualTypification, g as getAnalysisFor, h as generateAlias, j as normalizeExpression, k as isSchemaIssue, l as argumentValuesToMapping, m as findCstByStructure, o as addAliasReference, p as canProduceStructure, s as applyFilterCategory, u as calculateSchemaStats, v as getStructureName, w as inferTemplatedType, x as inferNewSpawnPosition, y as guessCstType } from "../diagnostics-D7SiHAwW.js";
-export { addAliasReference, applyFilterCategory, applyMappingToConstituents, argumentValuesToMapping, calculateSchemaStats, canHaveFormalDefinition, canHaveManualTypification, canProduceStructure, findCstByStructure, generateAlias, getAnalysisFor, getCstTypePrefix, getStructureName, guessCstType, inferClass, inferNewSpawnPosition, inferStatus, inferTemplate, inferTemplatedType, isBaseSet, isBasicConcept, isFunctional, isLogical, isSchemaIssue, isTemplateCst, normalizeExpression, removeAliasReference, sortItemsForInlineSynthesis, typeClassForCstType, validateAliasFormat, validateNewAlias };
+import { A as isLogical, C as inferNewSpawnPosition, D as isBaseSet, E as inferTemplatedType, F as removeAliasReference, I as sortItemsForInlineSynthesis, L as typeClassForCstType, M as isTemplateCst, N as normalizeExpression, O as isBasicConcept, P as refineAnalysisForDependencyCycles, R as validateAliasFormat, S as inferClass, T as inferTemplate, _ as generateAlias, b as getStructureName, c as addAliasReference, d as argumentValuesToMapping, f as calculateSchemaStats, g as findCstByStructure, h as canProduceStructure, j as isSchemaIssue, k as isFunctional, l as applyFilterCategory, m as canHaveManualTypification, p as canHaveFormalDefinition, u as applyMappingToConstituents, v as getAnalysisFor, w as inferStatus, x as guessCstType, y as getCstTypePrefix, z as validateNewAlias } from "../diagnostics-BSryP66e.js";
+export { addAliasReference, applyFilterCategory, applyMappingToConstituents, argumentValuesToMapping, calculateSchemaStats, canHaveFormalDefinition, canHaveManualTypification, canProduceStructure, findCstByStructure, generateAlias, getAnalysisFor, getCstTypePrefix, getStructureName, guessCstType, inferClass, inferNewSpawnPosition, inferStatus, inferTemplate, inferTemplatedType, isBaseSet, isBasicConcept, isFunctional, isLogical, isSchemaIssue, isTemplateCst, normalizeExpression, refineAnalysisForDependencyCycles, removeAliasReference, sortItemsForInlineSynthesis, typeClassForCstType, validateAliasFormat, validateNewAlias };

package/dist/library/rsform.d.ts

@@ -1,2 +1,2 @@
-import { C as TypeInfo, S as Substitution, _ as CstClass, b as RSForm, g as Constituenta, h as Attribution, m as ArgumentValue, v as CstStatus, x as RSFormStats, y as CstType } from "../diagnostics-Clo3mkba.js";
+import { C as RSFormStats, S as RSForm, T as TypeInfo, _ as Attribution, b as CstStatus, g as ArgumentValue, v as Constituenta, w as Substitution, x as CstType, y as CstClass } from "../diagnostics-Dtzgj5Q9.js";
 export { ArgumentValue, Attribution, Constituenta, CstClass, CstStatus, CstType, RSForm, RSFormStats, Substitution, TypeInfo };

package/dist/library/rsmodel-api.d.ts

@@ -1,6 +1,6 @@
 import { b as Typification, f as ExpressionType } from "../typification-9lNu9R4k.js";
 import { d as ValuePath, l as Value } from "../value-BduA_ZGp.js";
-import { b as RSForm, f as RSModelStats, g as Constituenta, s as BasicBinding, u as EvalStatus, y as CstType } from "../diagnostics-Clo3mkba.js";
+import { S as RSForm, f as EvalStatus, l as BasicBinding, m as RSModelStats, v as Constituenta, x as CstType } from "../diagnostics-Dtzgj5Q9.js";
 import { RSEngine } from "./rsengine.js";
 
 //#region src/library/rsmodel-api.d.ts

package/dist/library/rsmodel-api.js

@@ -2,7 +2,7 @@ import { TypeID } from "../rslang/semantic/typification.js";
 import { O as setNestedValue, _ as extractValue, b as isTupleValue, f as tuple, l as compare, x as makeDefaultValue } from "../value-COprb2Je.js";
 import "../rslang/index.js";
 import { CstType } from "./rsform.js";
-import { E as isBasicConcept, T as isBaseSet, a as modelStatusCstDiagnostic, u as calculateSchemaStats } from "../diagnostics-D7SiHAwW.js";
+import { D as isBaseSet, O as isBasicConcept, f as calculateSchemaStats, s as modelStatusCstDiagnostic } from "../diagnostics-BSryP66e.js";
 import { EvalStatus } from "./rsmodel.js";
 //#region src/library/rsmodel-api.ts
 const RANDOM_INTEGER_MIN = -100;

package/dist/library/rsmodel.d.ts

@@ -1,2 +1,2 @@
-import { c as BasicsContext, d as RSModel, f as RSModelStats, l as DEFAULT_VALUE_TEXT, p as TYPE_BASIC, s as BasicBinding, u as EvalStatus } from "../diagnostics-Clo3mkba.js";
+import { d as DEFAULT_VALUE_TEXT, f as EvalStatus, h as TYPE_BASIC, l as BasicBinding, m as RSModelStats, p as RSModel, u as BasicsContext } from "../diagnostics-Dtzgj5Q9.js";
 export { BasicBinding, BasicsContext, DEFAULT_VALUE_TEXT, EvalStatus, RSModel, RSModelStats, TYPE_BASIC };

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

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

package/dist/library/structure-planner.js

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

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@rsconcept/domain",
-  "version": "2.0.2",
+  "version": "2.1.0",
   "description": "Shared TypeScript domain for RS language, RSForm, RSModel, RSEngine, OSS, and concept-text helpers.",
   "license": "MIT",
   "author": "IRBorisov",
@@ -154,6 +154,18 @@
     "README.md",
     "LICENSE"
   ],
+  "scripts": {
+    "generate": "lezer-generator src/rslang/parser/rslang.grammar -o src/rslang/parser/parser.ts",
+    "build": "tsdown",
+    "dev": "tsdown --watch",
+    "typecheck": "tsc -p tsconfig.json --noEmit",
+    "test": "vitest run",
+    "lint": "eslint . --report-unused-disable-directives --max-warnings 0",
+    "lintFix": "eslint . --report-unused-disable-directives --max-warnings 0 --fix",
+    "format": "prettier --write \"src/**/*.ts\" \"*.{ts,js}\"",
+    "format:check": "prettier --check \"src/**/*.ts\" \"*.{ts,js}\"",
+    "prepublishOnly": "pnpm run build"
+  },
   "dependencies": {
     "@lezer/common": "^1.5.2",
     "@lezer/lr": "^1.4.10"
@@ -174,16 +186,5 @@
   },
   "publishConfig": {
     "access": "public"
-  },
-  "scripts": {
-    "generate": "lezer-generator src/rslang/parser/rslang.grammar -o src/rslang/parser/parser.ts",
-    "build": "tsdown",
-    "dev": "tsdown --watch",
-    "typecheck": "tsc -p tsconfig.json --noEmit",
-    "test": "vitest run",
-    "lint": "eslint . --report-unused-disable-directives --max-warnings 0",
-    "lintFix": "eslint . --report-unused-disable-directives --max-warnings 0 --fix",
-    "format": "prettier --write \"src/**/*.ts\" \"*.{ts,js}\"",
-    "format:check": "prettier --check \"src/**/*.ts\" \"*.{ts,js}\""
   }
-}
+}

package/src/cctext/language-api.test.ts

@@ -112,6 +112,11 @@ describe('Testing reference parsing', () => {
     expect(parseReference('@{0|derived term}')).toBeNull();
     expect(parseReference('@{-0|derived term}')).toBeNull();
     expect(parseReference('@{1|}')).toBeNull();
+    // Cyrillic А (U+0410) is not a syntactic offset; treat as entity alias
+    expect(parseReference('@{А55|sing,datv}')).toStrictEqual({
+      type: 'entity',
+      data: { entity: 'А55', tags: ['sing', 'datv'] }
+    });
   });
 });
 

package/src/cctext/language-api.ts

@@ -81,7 +81,7 @@ export function parseEntityReference(text: string): EntityReference {
   if (ref?.type !== ReferenceType.ENTITY) {
     throw new Error(`Invalid entity reference: ${text}`);
   }
-  return ref.data as EntityReference;
+  return ref.data;
 }
 
 /**
@@ -94,7 +94,7 @@ export function parseSyntacticReference(text: string): SyntacticReference {
   if (ref?.type !== ReferenceType.SYNTACTIC) {
     throw new Error(`Invalid syntactic reference: ${text}`);
   }
-  return ref.data as SyntacticReference;
+  return ref.data;
 }
 
 /** Extracts a validated reference from string representation. */
@@ -172,12 +172,12 @@ export function resolveTextReferences(text: string, context: TermContext): strin
 
   for (const ref of references) {
     if (ref.ref.type === ReferenceType.ENTITY) {
-      ref.resolved = resolveEntity(ref.ref.data as EntityReference, context);
+      ref.resolved = resolveEntity(ref.ref.data, context);
     }
   }
   references.forEach((ref, index) => {
     if (ref.ref.type === ReferenceType.SYNTACTIC) {
-      ref.resolved = resolveSyntactic(ref.ref.data as SyntacticReference, index, references);
+      ref.resolved = resolveSyntactic(ref.ref.data, index, references);
     }
   });
 
@@ -196,11 +196,11 @@ export function resolveTextReferences(text: string, context: TermContext): strin
 export function referenceToString(ref: IReference): string {
   switch (ref.type) {
     case ReferenceType.ENTITY: {
-      const entity = ref.data as EntityReference;
+      const entity = ref.data;
       return `@{${entity.entity}|${entity.tags.join(',')}}`;
     }
     case ReferenceType.SYNTACTIC: {
-      const syntactic = ref.data as SyntacticReference;
+      const syntactic = ref.data;
       return `@{${syntactic.offset}|${syntactic.nominal}}`;
     }
   }

package/src/cctext/language.ts

@@ -74,7 +74,6 @@ export interface SyntacticReference {
 }
 
 /** Represents abstract reference data. */
-export interface IReference {
-  type: ReferenceType;
-  data: EntityReference | SyntacticReference;
-}
+export type IReference =
+  | { type: typeof ReferenceType.ENTITY; data: EntityReference }
+  | { type: typeof ReferenceType.SYNTACTIC; data: SyntacticReference };

package/src/graph/graph.test.ts

@@ -374,6 +374,28 @@ describe('Testing Graph queries', () => {
     expect(graph.findCycle()).toStrictEqual(null);
   });
 
+  it('findCycles returns one closed path per cyclic SCC', () => {
+    const graph = new Graph([[1, 2], [2, 1], [3, 4], [4, 3], [5]]);
+    const cycles = graph.findCycles();
+    expect(cycles).toHaveLength(2);
+    expect(cycles.some(cycle => cycle[0] === cycle[cycle.length - 1] && cycle.includes(1) && cycle.includes(2))).toBe(
+      true
+    );
+    expect(cycles.some(cycle => cycle[0] === cycle[cycle.length - 1] && cycle.includes(3) && cycle.includes(4))).toBe(
+      true
+    );
+  });
+
+  it('findCycles reports self-loop', () => {
+    const graph = new Graph([[1, 1], [2]]);
+    expect(graph.findCycles()).toStrictEqual([[1, 1]]);
+  });
+
+  it('findCycles returns empty for acyclic graph', () => {
+    const graph = new Graph([[1, 2], [2, 3], [3]]);
+    expect(graph.findCycles()).toStrictEqual([]);
+  });
+
   it('sortStable should stably reorder node ids according to topological order', () => {
     const graph = new Graph([
       [1, 2],