@flanksource/clicky-ui 0.3.44 → 0.3.45

package/dist/data/call-graph/call-graph-model.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"call-graph-model.cjs","sources":["../../../src/data/call-graph/call-graph-model.ts"],"sourcesContent":["// Pure mapping from a call graph to what GraphDiagram draws, and how a `+N` expansion merges into the\n// held graph. It decides what is shown and leaves drawing a glyph to the DiagramGlyphs it is handed,\n// so it renders nothing itself.\nimport type { ReactNode } from \"react\";\nimport type { BadgeTone } from \"../Badge\";\nimport type { GraphDiagramEdge, GraphDiagramGroup, GraphDiagramNode } from \"../graph-diagram-model\";\nimport { edgeLabel, edgeTitle, groupCaption, isConditional, type PillOptions } from \"./call-graph-labels\";\nimport { nodeTitle, siteKey, type CallGraphVocabulary } from \"./call-graph-vocabulary\";\nimport {\n  CALL_GRAPH_ACCESS,\n  type CallGraph,\n  type CallGraphAccess,\n  type CallGraphDirection,\n  type CallGraphEdge,\n  type CallGraphEdgeLabels,\n  type CallGraphEdgeType,\n  type CallGraphGroup,\n  type CallGraphNode,\n  type CallGraphSite,\n} from \"./types\";\n\n/** The deepest graph uir builds (graph.MaxDepth). */\nexport const CALL_GRAPH_MAX_DEPTH = 8;\n/** The depth uir builds when none is asked for (graph.DefaultDepth). */\nexport const CALL_GRAPH_DEFAULT_DEPTH = 2;\n\nexport const DEFAULT_EDGE_LABELS: CallGraphEdgeLabels = { call: \"call\", dispatch: \"dispatch\", read: \"read\", write: \"write\" };\n\n/** The tone each edge type but a plain call is drawn in: dispatch blue, a read green, a write amber. */\nconst EDGE_TONE: Record<Exclude<CallGraphEdgeType, \"call\">, BadgeTone> = { dispatch: \"info\", read: \"success\", write: \"warning\" };\n\n/** Turns one access type on or off, in the usual order. Turning the last one off fails: a graph follows something. */\nexport function toggleAccess(access: readonly CallGraphAccess[], type: CallGraphAccess): CallGraphAccess[] {\n  const on = !access.includes(type);\n  if (!on && access.length === 1) throw new Error(`call graph: ${type} is the only access type on`);\n  return CALL_GRAPH_ACCESS.filter((entry) => (entry === type ? on : access.includes(entry)));\n}\n\nexport interface GraphView {\n  direction: CallGraphDirection;\n  /** Nodes further than this many hops from the root are hidden. */\n  depth: number;\n  /** Node ids shown regardless of `depth`, because a `+N` expansion revealed them. */\n  revealed: readonly string[];\n}\n\nexport interface VisibleGraph {\n  nodes: CallGraphNode[];\n  edges: CallGraphEdge[];\n}\n\nexport interface DiagramOptions extends PillOptions {\n  /** Box nodes by their `group`. */\n  grouped: boolean;\n}\n\nexport type DiagramNode = GraphDiagramNode & { label: string; level: number; title: string };\nexport type DiagramEdge = GraphDiagramEdge & { dashed: boolean };\nexport type DiagramGroup = GraphDiagramGroup & { title: string };\n\nexport interface Diagram {\n  nodes: DiagramNode[];\n  edges: DiagramEdge[];\n  groups: DiagramGroup[];\n}\n\n/** Draws the glyphs the model chooses. The component supplies icons; the tests supply strings. */\nexport interface DiagramGlyphs {\n  /** `words` is the icon's name for a screen reader, such as `external function`. */\n  node(glyph: string, words: string): ReactNode;\n  /** The pill icon of an edge type; a plain call has none. */\n  edge(type: CallGraphEdgeType): ReactNode | undefined;\n  group(caption: string): ReactNode;\n}\n\nexport interface DiagramInput {\n  graph: CallGraph;\n  visible: VisibleGraph;\n  direction: CallGraphDirection;\n  options: DiagramOptions;\n  glyphs: DiagramGlyphs;\n  vocabulary: CallGraphVocabulary;\n  edgeLabels: CallGraphEdgeLabels;\n}\n\nexport function requireNode(graph: CallGraph, id: string): CallGraphNode {\n  const node = graph.nodes.find((candidate) => candidate.id === id);\n  if (!node) throw new Error(`call graph: no node \"${id}\"`);\n  return node;\n}\n\nfunction inDirection(depth: number, direction: CallGraphDirection): boolean {\n  if (direction === \"both\" || depth === 0) return true;\n  return direction === \"callees\" ? depth > 0 : depth < 0;\n}\n\n/** The nodes on the requested side within `depth`, plus revealed ones, and the edges between them. */\nexport function visibleGraph(graph: CallGraph, view: GraphView): VisibleGraph {\n  const revealed = new Set(view.revealed);\n  const nodes = graph.nodes.filter(\n    (node) => inDirection(node.depth, view.direction) && (Math.abs(node.depth) <= view.depth || revealed.has(node.id)),\n  );\n  const ids = new Set(nodes.map((node) => node.id));\n  return { nodes, edges: graph.edges.filter((edge) => ids.has(edge.from) && ids.has(edge.to)) };\n}\n\n/** A caller grows toward its own callers; the root and callees grow toward their callees. */\nfunction outerSide(node: CallGraphNode): \"in\" | \"out\" {\n  return node.depth < 0 ? \"in\" : \"out\";\n}\n\n/** The direction a `+N` expansion of the node walks: its outer side, the side `+N` counts. */\nexport function expansionDirection(node: CallGraphNode): Exclude<CallGraphDirection, \"both\"> {\n  return outerSide(node) === \"in\" ? \"callers\" : \"callees\";\n}\n\n/** The ids at the far end of a node's edges on its outer side, as the response holds them. */\nfunction outerNeighbours(graph: CallGraph, node: CallGraphNode): string[] {\n  const side = outerSide(node);\n  return graph.edges.filter((edge) => (side === \"out\" ? edge.from : edge.to) === node.id).map((edge) => (side === \"out\" ? edge.to : edge.from));\n}\n\n/** The neighbours on a node's outer side that the response holds and are not drawn. */\nexport function hiddenNeighbours(graph: CallGraph, visible: VisibleGraph, nodeId: string): string[] {\n  const drawn = new Set(visible.nodes.map((node) => node.id));\n  return outerNeighbours(graph, requireNode(graph, nodeId)).filter((id, index, all) => !drawn.has(id) && all.indexOf(id) === index);\n}\n\n/**\n * The `+N` on a node: how many more edges there are to load on its outer side. Only that side's count\n * is a total (`out` for the root and callees, `in` for callers); the other equals the edges in the\n * response. Excluded neighbours are in neither. From it come off the edges drawn. A node without a\n * source cannot be expanded, nor can the side the direction hides.\n */\nexport function expandCount(\n  graph: CallGraph,\n  visible: VisibleGraph,\n  nodeId: string,\n  direction: CallGraphDirection,\n  vocabulary: Pick<CallGraphVocabulary, \"hasSource\">,\n): number {\n  const node = requireNode(graph, nodeId);\n  const side = outerSide(node);\n  if (!vocabulary.hasSource(node) || direction === (side === \"out\" ? \"callers\" : \"callees\")) return 0;\n  const drawn = new Set(visible.nodes.map((entry) => entry.id));\n  const accounted = outerNeighbours(graph, node).filter((id) => drawn.has(id)).length;\n  return Math.max(0, (side === \"out\" ? node.out : node.in) - accounted);\n}\n\nexport interface NodeTotals {\n  callers?: number;\n  callees?: number;\n  readers?: number;\n  writers?: number;\n}\n\n/**\n * A data node's readers, writers and callers: the edges into it the graph holds, by type, each left\n * out when there are none.\n */\nfunction accessTotals(graph: CallGraph, node: CallGraphNode): NodeTotals {\n  const into = (types: readonly CallGraphEdgeType[]) => graph.edges.filter((edge) => edge.to === node.id && types.includes(edge.type)).length;\n  const totals: [keyof NodeTotals, number][] = [[\"readers\", into([\"read\"])], [\"writers\", into([\"write\"])], [\"callers\", into([\"call\", \"dispatch\"])]];\n  return Object.fromEntries(totals.filter(([, count]) => count > 0));\n}\n\n/**\n * A node's call totals on the sides the response walked: callees at depth >= 0, callers at depth <= 0.\n * A data node counts who reads, writes and calls it instead.\n */\nexport function walkedTotals(graph: CallGraph, node: CallGraphNode, vocabulary: Pick<CallGraphVocabulary, \"isData\">): NodeTotals {\n  if (vocabulary.isData(node)) return accessTotals(graph, node);\n  const walked = (sign: number) => graph.nodes.some((other) => Math.sign(other.depth) === sign);\n  return {\n    ...(node.depth <= 0 && walked(-1) ? { callers: node.in } : {}),\n    ...(node.depth >= 0 && walked(1) ? { callees: node.out } : {}),\n  };\n}\n\nfunction distinctSites(sites: CallGraphSite[]): CallGraphSite[] {\n  return sites.filter((site, index) => sites.findIndex((other) => siteKey(other) === siteKey(site)) === index);\n}\n\nconst edgeKey = (edge: CallGraphEdge) => `${edge.from}|${edge.to}|${edge.type}`;\n\n/**\n * Merges a one-hop expansion into the held graph. The expansion is rooted at a held node, so its\n * depths are re-signed from that node's depth. Held nodes keep their place; edges are keyed by\n * `from|to|type`, gain the call sites they did not hold and keep their first non-empty properties;\n * the held response's other fields stay.\n */\nexport function mergeGraph<T extends CallGraph>(held: T, expansion: CallGraph): T {\n  const [rootId] = expansion.roots;\n  const base = held.nodes.find((node) => node.id === rootId);\n  if (rootId === undefined || !base) throw new Error(`call graph: expansion root \"${rootId}\" is not in the held graph`);\n  const heldIds = new Set(held.nodes.map((node) => node.id));\n  const added = expansion.nodes.filter((node) => !heldIds.has(node.id)).map((node) => ({ ...node, depth: base.depth + node.depth }));\n  const incoming = new Map(expansion.edges.map((edge) => [edgeKey(edge), edge]));\n  const edges = held.edges.map((edge) => {\n    const more = incoming.get(edgeKey(edge));\n    incoming.delete(edgeKey(edge));\n    if (!more) return edge;\n    const properties = edge.properties && Object.keys(edge.properties).length > 0 ? edge.properties : more.properties;\n    return { ...edge, sites: distinctSites([...edge.sites, ...more.sites]), ...(properties ? { properties } : {}) };\n  });\n  const groupIds = new Set((held.groups ?? []).map((group) => group.id));\n  const groups: CallGraphGroup[] = [...(held.groups ?? []), ...(expansion.groups ?? []).filter((group) => !groupIds.has(group.id))];\n  return { ...held, nodes: [...held.nodes, ...added], edges: [...edges, ...incoming.values()], groups };\n}\n\n/**\n * The order nodes are handed to the diagram, which stacks groups in the order they first appear: the\n * root's group, then the other groups holding nodes with a source, then the others, then nodes in no group.\n */\nfunction groupRank(graph: CallGraph, vocabulary: CallGraphVocabulary): (node: CallGraphNode) => number {\n  const rootGroups = new Set(graph.roots.map((id) => requireNode(graph, id).group));\n  const sourced = new Set(graph.nodes.filter((node) => vocabulary.hasSource(node)).map((node) => node.group));\n  return (node) => {\n    if (node.group === undefined) return 3;\n    if (rootGroups.has(node.group)) return 0;\n    return sourced.has(node.group) ? 1 : 2;\n  };\n}\n\nfunction toDiagramNode(node: CallGraphNode, { graph, visible, direction, options, glyphs, vocabulary }: DiagramInput): DiagramNode {\n  const count = expandCount(graph, visible, node.id, direction, vocabulary);\n  const isRoot = graph.roots.includes(node.id);\n  const tone = isRoot ? \"info\" : node.unresolved ? \"warning\" : undefined;\n  // A table, column, entity or field is a name its group box already places: one short line will do.\n  const compact = !isRoot && vocabulary.isData(node) && !vocabulary.hasSource(node);\n  return {\n    id: node.id,\n    label: node.label,\n    icon: glyphs.node(vocabulary.glyphOf(graph, node), vocabulary.kindOf(graph, node)),\n    title: nodeTitle(graph, node, vocabulary),\n    level: node.depth,\n    ...(options.grouped && node.group !== undefined ? { group: node.group } : {}),\n    ...(compact ? { size: \"compact\" as const } : {}),\n    ...(tone !== undefined ? { tone } : {}),\n    ...(vocabulary.muted(node) ? { muted: true } : {}),\n    ...(count > 0 ? { expandCount: count } : {}),\n  };\n}\n\nfunction toDiagramEdge(edge: CallGraphEdge, { options, glyphs, edgeLabels }: DiagramInput): DiagramEdge {\n  const label = edgeLabel(edge, options);\n  const title = edgeTitle(edge);\n  return {\n    id: edge.id,\n    from: edge.from,\n    to: edge.to,\n    dashed: isConditional(edge),\n    ...(edge.type === \"call\" ? {} : { tone: EDGE_TONE[edge.type], icon: glyphs.edge(edge.type), iconLabel: edgeLabels[edge.type] }),\n    ...(label !== undefined ? { label } : {}),\n    ...(title !== undefined ? { title } : {}),\n  };\n}\n\n/** Mean glyph advance of the 10px pill text, and the pill's padding plus a little air. */\nconst PILL_CHAR_WIDTH = 5.2;\nconst PILL_CHROME = 22;\n/** The room a pill's icon and its gap take, in characters. */\nconst PILL_ICON_CHARS = 3;\nconst MIN_COLUMN_GAP = 96;\n\n/**\n * The gap between columns: as wide as the longest pill on an edge between two columns, so no pill\n * covers a node. Wider gaps than the pills need make the diagram wider, and so smaller once fitted.\n */\nexport function columnGap({\n  nodes,\n  edges,\n}: {\n  nodes: readonly Pick<DiagramNode, \"id\" | \"level\">[];\n  edges: readonly Pick<DiagramEdge, \"id\" | \"from\" | \"to\" | \"label\" | \"icon\">[];\n}): number {\n  const level = new Map(nodes.map((node) => [node.id, node.level]));\n  const chars = edges\n    .filter((edge) => level.get(edge.from) !== level.get(edge.to))\n    .map((edge) => (edge.label?.length ?? 0) + (edge.icon != null ? PILL_ICON_CHARS : 0));\n  return Math.max(MIN_COLUMN_GAP, Math.round(Math.max(0, ...chars) * PILL_CHAR_WIDTH) + PILL_CHROME);\n}\n\nexport function toDiagram(input: DiagramInput): Diagram {\n  const { graph, visible, options, glyphs, vocabulary } = input;\n  const rank = groupRank(graph, vocabulary);\n  return {\n    nodes: [...visible.nodes].sort((a, b) => rank(a) - rank(b)).map((node) => toDiagramNode(node, input)),\n    edges: visible.edges.map((edge) => toDiagramEdge(edge, input)),\n    groups: options.grouped ? (graph.groups ?? []).map(({ id, label }) => ({ id, label: glyphs.group(groupCaption(label)), title: label })) : [],\n  };\n}\n"],"names":["CALL_GRAPH_ACCESS","types","siteKey","nodeTitle","edgeLabel","edgeTitle","isConditional","groupCaption"],"mappings":";;;;;AAsBO,MAAM,uBAAuB;AAE7B,MAAM,2BAA2B;AAEjC,MAAM,sBAA2C,EAAE,MAAM,QAAQ,UAAU,YAAY,MAAM,QAAQ,OAAO,QAAA;AAGnH,MAAM,YAAmE,EAAE,UAAU,QAAQ,MAAM,WAAW,OAAO,UAAA;AAG9G,SAAS,aAAa,QAAoC,MAA0C;AACzG,QAAM,KAAK,CAAC,OAAO,SAAS,IAAI;AAChC,MAAI,CAAC,MAAM,OAAO,WAAW,SAAS,IAAI,MAAM,eAAe,IAAI,6BAA6B;AAChG,SAAOA,wBAAkB,OAAO,CAAC,UAAW,UAAU,OAAO,KAAK,OAAO,SAAS,KAAK,CAAE;AAC3F;AAiDO,SAAS,YAAY,OAAkB,IAA2B;AACvE,QAAM,OAAO,MAAM,MAAM,KAAK,CAAC,cAAc,UAAU,OAAO,EAAE;AAChE,MAAI,CAAC,KAAM,OAAM,IAAI,MAAM,wBAAwB,EAAE,GAAG;AACxD,SAAO;AACT;AAEA,SAAS,YAAY,OAAe,WAAwC;AAC1E,MAAI,cAAc,UAAU,UAAU,EAAG,QAAO;AAChD,SAAO,cAAc,YAAY,QAAQ,IAAI,QAAQ;AACvD;AAGO,SAAS,aAAa,OAAkB,MAA+B;AAC5E,QAAM,WAAW,IAAI,IAAI,KAAK,QAAQ;AACtC,QAAM,QAAQ,MAAM,MAAM;AAAA,IACxB,CAAC,SAAS,YAAY,KAAK,OAAO,KAAK,SAAS,MAAM,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,SAAS,SAAS,IAAI,KAAK,EAAE;AAAA,EAAA;AAElH,QAAM,MAAM,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,KAAK,EAAE,CAAC;AAChD,SAAO,EAAE,OAAO,OAAO,MAAM,MAAM,OAAO,CAAC,SAAS,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,KAAK,EAAE,CAAC,EAAA;AAC5F;AAGA,SAAS,UAAU,MAAmC;AACpD,SAAO,KAAK,QAAQ,IAAI,OAAO;AACjC;AAGO,SAAS,mBAAmB,MAA0D;AAC3F,SAAO,UAAU,IAAI,MAAM,OAAO,YAAY;AAChD;AAGA,SAAS,gBAAgB,OAAkB,MAA+B;AACxE,QAAM,OAAO,UAAU,IAAI;AAC3B,SAAO,MAAM,MAAM,OAAO,CAAC,UAAU,SAAS,QAAQ,KAAK,OAAO,KAAK,QAAQ,KAAK,EAAE,EAAE,IAAI,CAAC,SAAU,SAAS,QAAQ,KAAK,KAAK,KAAK,IAAK;AAC9I;AAcO,SAAS,YACd,OACA,SACA,QACA,WACA,YACQ;AACR,QAAM,OAAO,YAAY,OAAO,MAAM;AACtC,QAAM,OAAO,UAAU,IAAI;AAC3B,MAAI,CAAC,WAAW,UAAU,IAAI,KAAK,eAAe,SAAS,QAAQ,YAAY,WAAY,QAAO;AAClG,QAAM,QAAQ,IAAI,IAAI,QAAQ,MAAM,IAAI,CAAC,UAAU,MAAM,EAAE,CAAC;AAC5D,QAAM,YAAY,gBAAgB,OAAO,IAAI,EAAE,OAAO,CAAC,OAAO,MAAM,IAAI,EAAE,CAAC,EAAE;AAC7E,SAAO,KAAK,IAAI,IAAI,SAAS,QAAQ,KAAK,MAAM,KAAK,MAAM,SAAS;AACtE;AAaA,SAAS,aAAa,OAAkB,MAAiC;AACvE,QAAM,OAAO,CAACC,WAAwC,MAAM,MAAM,OAAO,CAAC,SAAS,KAAK,OAAO,KAAK,MAAMA,OAAM,SAAS,KAAK,IAAI,CAAC,EAAE;AACrI,QAAM,SAAuC,CAAC,CAAC,WAAW,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,WAAW,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,WAAW,KAAK,CAAC,QAAQ,UAAU,CAAC,CAAC,CAAC;AAChJ,SAAO,OAAO,YAAY,OAAO,OAAO,CAAC,CAAA,EAAG,KAAK,MAAM,QAAQ,CAAC,CAAC;AACnE;AAMO,SAAS,aAAa,OAAkB,MAAqB,YAA6D;AAC/H,MAAI,WAAW,OAAO,IAAI,EAAG,QAAO,aAAa,OAAO,IAAI;AAC5D,QAAM,SAAS,CAAC,SAAiB,MAAM,MAAM,KAAK,CAAC,UAAU,KAAK,KAAK,MAAM,KAAK,MAAM,IAAI;AAC5F,SAAO;AAAA,IACL,GAAI,KAAK,SAAS,KAAK,OAAO,EAAE,IAAI,EAAE,SAAS,KAAK,GAAA,IAAO,CAAA;AAAA,IAC3D,GAAI,KAAK,SAAS,KAAK,OAAO,CAAC,IAAI,EAAE,SAAS,KAAK,QAAQ,CAAA;AAAA,EAAC;AAEhE;AAEA,SAAS,cAAc,OAAyC;AAC9D,SAAO,MAAM,OAAO,CAAC,MAAM,UAAU,MAAM,UAAU,CAAC,UAAUC,oBAAAA,QAAQ,KAAK,MAAMA,oBAAAA,QAAQ,IAAI,CAAC,MAAM,KAAK;AAC7G;AAEA,MAAM,UAAU,CAAC,SAAwB,GAAG,KAAK,IAAI,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI;AAQtE,SAAS,WAAgC,MAAS,WAAyB;AAChF,QAAM,CAAC,MAAM,IAAI,UAAU;AAC3B,QAAM,OAAO,KAAK,MAAM,KAAK,CAAC,SAAS,KAAK,OAAO,MAAM;AACzD,MAAI,WAAW,UAAa,CAAC,YAAY,IAAI,MAAM,+BAA+B,MAAM,4BAA4B;AACpH,QAAM,UAAU,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC,SAAS,KAAK,EAAE,CAAC;AACzD,QAAM,QAAQ,UAAU,MAAM,OAAO,CAAC,SAAS,CAAC,QAAQ,IAAI,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,UAAU,EAAE,GAAG,MAAM,OAAO,KAAK,QAAQ,KAAK,MAAA,EAAQ;AACjI,QAAM,WAAW,IAAI,IAAI,UAAU,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,IAAI,GAAG,IAAI,CAAC,CAAC;AAC7E,QAAM,QAAQ,KAAK,MAAM,IAAI,CAAC,SAAS;AACrC,UAAM,OAAO,SAAS,IAAI,QAAQ,IAAI,CAAC;AACvC,aAAS,OAAO,QAAQ,IAAI,CAAC;AAC7B,QAAI,CAAC,KAAM,QAAO;AAClB,UAAM,aAAa,KAAK,cAAc,OAAO,KAAK,KAAK,UAAU,EAAE,SAAS,IAAI,KAAK,aAAa,KAAK;AACvG,WAAO,EAAE,GAAG,MAAM,OAAO,cAAc,CAAC,GAAG,KAAK,OAAO,GAAG,KAAK,KAAK,CAAC,GAAG,GAAI,aAAa,EAAE,WAAA,IAAe,GAAC;AAAA,EAC7G,CAAC;AACD,QAAM,WAAW,IAAI,KAAK,KAAK,UAAU,IAAI,IAAI,CAAC,UAAU,MAAM,EAAE,CAAC;AACrE,QAAM,SAA2B,CAAC,GAAI,KAAK,UAAU,IAAK,IAAI,UAAU,UAAU,CAAA,GAAI,OAAO,CAAC,UAAU,CAAC,SAAS,IAAI,MAAM,EAAE,CAAC,CAAC;AAChI,SAAO,EAAE,GAAG,MAAM,OAAO,CAAC,GAAG,KAAK,OAAO,GAAG,KAAK,GAAG,OAAO,CAAC,GAAG,OAAO,GAAG,SAAS,OAAA,CAAQ,GAAG,OAAA;AAC/F;AAMA,SAAS,UAAU,OAAkB,YAAkE;AACrG,QAAM,aAAa,IAAI,IAAI,MAAM,MAAM,IAAI,CAAC,OAAO,YAAY,OAAO,EAAE,EAAE,KAAK,CAAC;AAChF,QAAM,UAAU,IAAI,IAAI,MAAM,MAAM,OAAO,CAAC,SAAS,WAAW,UAAU,IAAI,CAAC,EAAE,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC;AAC1G,SAAO,CAAC,SAAS;AACf,QAAI,KAAK,UAAU,OAAW,QAAO;AACrC,QAAI,WAAW,IAAI,KAAK,KAAK,EAAG,QAAO;AACvC,WAAO,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI;AAAA,EACvC;AACF;AAEA,SAAS,cAAc,MAAqB,EAAE,OAAO,SAAS,WAAW,SAAS,QAAQ,cAAyC;AACjI,QAAM,QAAQ,YAAY,OAAO,SAAS,KAAK,IAAI,WAAW,UAAU;AACxE,QAAM,SAAS,MAAM,MAAM,SAAS,KAAK,EAAE;AAC3C,QAAM,OAAO,SAAS,SAAS,KAAK,aAAa,YAAY;AAE7D,QAAM,UAAU,CAAC,UAAU,WAAW,OAAO,IAAI,KAAK,CAAC,WAAW,UAAU,IAAI;AAChF,SAAO;AAAA,IACL,IAAI,KAAK;AAAA,IACT,OAAO,KAAK;AAAA,IACZ,MAAM,OAAO,KAAK,WAAW,QAAQ,OAAO,IAAI,GAAG,WAAW,OAAO,OAAO,IAAI,CAAC;AAAA,IACjF,OAAOC,oBAAAA,UAAU,OAAO,MAAM,UAAU;AAAA,IACxC,OAAO,KAAK;AAAA,IACZ,GAAI,QAAQ,WAAW,KAAK,UAAU,SAAY,EAAE,OAAO,KAAK,MAAA,IAAU,CAAA;AAAA,IAC1E,GAAI,UAAU,EAAE,MAAM,UAAA,IAAuB,CAAA;AAAA,IAC7C,GAAI,SAAS,SAAY,EAAE,KAAA,IAAS,CAAA;AAAA,IACpC,GAAI,WAAW,MAAM,IAAI,IAAI,EAAE,OAAO,KAAA,IAAS,CAAA;AAAA,IAC/C,GAAI,QAAQ,IAAI,EAAE,aAAa,MAAA,IAAU,CAAA;AAAA,EAAC;AAE9C;AAEA,SAAS,cAAc,MAAqB,EAAE,SAAS,QAAQ,cAAyC;AACtG,QAAM,QAAQC,gBAAAA,UAAU,MAAM,OAAO;AACrC,QAAM,QAAQC,gBAAAA,UAAU,IAAI;AAC5B,SAAO;AAAA,IACL,IAAI,KAAK;AAAA,IACT,MAAM,KAAK;AAAA,IACX,IAAI,KAAK;AAAA,IACT,QAAQC,gBAAAA,cAAc,IAAI;AAAA,IAC1B,GAAI,KAAK,SAAS,SAAS,CAAA,IAAK,EAAE,MAAM,UAAU,KAAK,IAAI,GAAG,MAAM,OAAO,KAAK,KAAK,IAAI,GAAG,WAAW,WAAW,KAAK,IAAI,EAAA;AAAA,IAC3H,GAAI,UAAU,SAAY,EAAE,MAAA,IAAU,CAAA;AAAA,IACtC,GAAI,UAAU,SAAY,EAAE,UAAU,CAAA;AAAA,EAAC;AAE3C;AAGA,MAAM,kBAAkB;AACxB,MAAM,cAAc;AAEpB,MAAM,kBAAkB;AACxB,MAAM,iBAAiB;AAMhB,SAAS,UAAU;AAAA,EACxB;AAAA,EACA;AACF,GAGW;AACT,QAAM,QAAQ,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,KAAK,KAAK,CAAC,CAAC;AAChE,QAAM,QAAQ,MACX,OAAO,CAAC,SAAS,MAAM,IAAI,KAAK,IAAI,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC,EAC5D,IAAI,CAAC;;AAAU,wBAAK,UAAL,mBAAY,WAAU,MAAM,KAAK,QAAQ,OAAO,kBAAkB;AAAA,GAAE;AACtF,SAAO,KAAK,IAAI,gBAAgB,KAAK,MAAM,KAAK,IAAI,GAAG,GAAG,KAAK,IAAI,eAAe,IAAI,WAAW;AACnG;AAEO,SAAS,UAAU,OAA8B;AACtD,QAAM,EAAE,OAAO,SAAS,SAAS,QAAQ,eAAe;AACxD,QAAM,OAAO,UAAU,OAAO,UAAU;AACxC,SAAO;AAAA,IACL,OAAO,CAAC,GAAG,QAAQ,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,cAAc,MAAM,KAAK,CAAC;AAAA,IACpG,OAAO,QAAQ,MAAM,IAAI,CAAC,SAAS,cAAc,MAAM,KAAK,CAAC;AAAA,IAC7D,QAAQ,QAAQ,WAAW,MAAM,UAAU,CAAA,GAAI,IAAI,CAAC,EAAE,IAAI,MAAA,OAAa,EAAE,IAAI,OAAO,OAAO,MAAMC,gBAAAA,aAAa,KAAK,CAAC,GAAG,OAAO,MAAA,EAAQ,IAAI,CAAA;AAAA,EAAC;AAE/I;;;;;;;;;;;;;"}

package/dist/data/call-graph/call-graph-model.d.ts

@@ -0,0 +1,102 @@
+import { ReactNode } from 'react';
+import { GraphDiagramEdge, GraphDiagramGroup, GraphDiagramNode } from '../graph-diagram-model.js';
+import { PillOptions } from './call-graph-labels.js';
+import { CallGraphVocabulary } from './call-graph-vocabulary.js';
+import { CallGraph, CallGraphAccess, CallGraphDirection, CallGraphEdge, CallGraphEdgeLabels, CallGraphEdgeType, CallGraphNode } from './types.js';
+/** The deepest graph uir builds (graph.MaxDepth). */
+export declare const CALL_GRAPH_MAX_DEPTH = 8;
+/** The depth uir builds when none is asked for (graph.DefaultDepth). */
+export declare const CALL_GRAPH_DEFAULT_DEPTH = 2;
+export declare const DEFAULT_EDGE_LABELS: CallGraphEdgeLabels;
+/** Turns one access type on or off, in the usual order. Turning the last one off fails: a graph follows something. */
+export declare function toggleAccess(access: readonly CallGraphAccess[], type: CallGraphAccess): CallGraphAccess[];
+export interface GraphView {
+    direction: CallGraphDirection;
+    /** Nodes further than this many hops from the root are hidden. */
+    depth: number;
+    /** Node ids shown regardless of `depth`, because a `+N` expansion revealed them. */
+    revealed: readonly string[];
+}
+export interface VisibleGraph {
+    nodes: CallGraphNode[];
+    edges: CallGraphEdge[];
+}
+export interface DiagramOptions extends PillOptions {
+    /** Box nodes by their `group`. */
+    grouped: boolean;
+}
+export type DiagramNode = GraphDiagramNode & {
+    label: string;
+    level: number;
+    title: string;
+};
+export type DiagramEdge = GraphDiagramEdge & {
+    dashed: boolean;
+};
+export type DiagramGroup = GraphDiagramGroup & {
+    title: string;
+};
+export interface Diagram {
+    nodes: DiagramNode[];
+    edges: DiagramEdge[];
+    groups: DiagramGroup[];
+}
+/** Draws the glyphs the model chooses. The component supplies icons; the tests supply strings. */
+export interface DiagramGlyphs {
+    /** `words` is the icon's name for a screen reader, such as `external function`. */
+    node(glyph: string, words: string): ReactNode;
+    /** The pill icon of an edge type; a plain call has none. */
+    edge(type: CallGraphEdgeType): ReactNode | undefined;
+    group(caption: string): ReactNode;
+}
+export interface DiagramInput {
+    graph: CallGraph;
+    visible: VisibleGraph;
+    direction: CallGraphDirection;
+    options: DiagramOptions;
+    glyphs: DiagramGlyphs;
+    vocabulary: CallGraphVocabulary;
+    edgeLabels: CallGraphEdgeLabels;
+}
+export declare function requireNode(graph: CallGraph, id: string): CallGraphNode;
+/** The nodes on the requested side within `depth`, plus revealed ones, and the edges between them. */
+export declare function visibleGraph(graph: CallGraph, view: GraphView): VisibleGraph;
+/** The direction a `+N` expansion of the node walks: its outer side, the side `+N` counts. */
+export declare function expansionDirection(node: CallGraphNode): Exclude<CallGraphDirection, "both">;
+/** The neighbours on a node's outer side that the response holds and are not drawn. */
+export declare function hiddenNeighbours(graph: CallGraph, visible: VisibleGraph, nodeId: string): string[];
+/**
+ * The `+N` on a node: how many more edges there are to load on its outer side. Only that side's count
+ * is a total (`out` for the root and callees, `in` for callers); the other equals the edges in the
+ * response. Excluded neighbours are in neither. From it come off the edges drawn. A node without a
+ * source cannot be expanded, nor can the side the direction hides.
+ */
+export declare function expandCount(graph: CallGraph, visible: VisibleGraph, nodeId: string, direction: CallGraphDirection, vocabulary: Pick<CallGraphVocabulary, "hasSource">): number;
+export interface NodeTotals {
+    callers?: number;
+    callees?: number;
+    readers?: number;
+    writers?: number;
+}
+/**
+ * A node's call totals on the sides the response walked: callees at depth >= 0, callers at depth <= 0.
+ * A data node counts who reads, writes and calls it instead.
+ */
+export declare function walkedTotals(graph: CallGraph, node: CallGraphNode, vocabulary: Pick<CallGraphVocabulary, "isData">): NodeTotals;
+/**
+ * Merges a one-hop expansion into the held graph. The expansion is rooted at a held node, so its
+ * depths are re-signed from that node's depth. Held nodes keep their place; edges are keyed by
+ * `from|to|type`, gain the call sites they did not hold and keep their first non-empty properties;
+ * the held response's other fields stay.
+ */
+export declare function mergeGraph<T extends CallGraph>(held: T, expansion: CallGraph): T;
+/**
+ * The gap between columns: as wide as the longest pill on an edge between two columns, so no pill
+ * covers a node. Wider gaps than the pills need make the diagram wider, and so smaller once fitted.
+ */
+export declare function columnGap({ nodes, edges, }: {
+    nodes: readonly Pick<DiagramNode, "id" | "level">[];
+    edges: readonly Pick<DiagramEdge, "id" | "from" | "to" | "label" | "icon">[];
+}): number;
+export declare function toDiagram(input: DiagramInput): Diagram;
+//# sourceMappingURL=call-graph-model.d.ts.map

package/dist/data/call-graph/call-graph-model.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"call-graph-model.d.ts","sourceRoot":"","sources":["../../../src/data/call-graph/call-graph-model.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC;AAEvC,OAAO,KAAK,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AACpG,OAAO,EAAqD,KAAK,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAC1G,OAAO,EAAsB,KAAK,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AACvF,OAAO,EAEL,KAAK,SAAS,EACd,KAAK,eAAe,EACpB,KAAK,kBAAkB,EACvB,KAAK,aAAa,EAClB,KAAK,mBAAmB,EACxB,KAAK,iBAAiB,EAEtB,KAAK,aAAa,EAEnB,MAAM,SAAS,CAAC;AAEjB,qDAAqD;AACrD,eAAO,MAAM,oBAAoB,IAAI,CAAC;AACtC,wEAAwE;AACxE,eAAO,MAAM,wBAAwB,IAAI,CAAC;AAE1C,eAAO,MAAM,mBAAmB,EAAE,mBAA0F,CAAC;AAK7H,sHAAsH;AACtH,wBAAgB,YAAY,CAAC,MAAM,EAAE,SAAS,eAAe,EAAE,EAAE,IAAI,EAAE,eAAe,GAAG,eAAe,EAAE,CAIzG;AAED,MAAM,WAAW,SAAS;IACxB,SAAS,EAAE,kBAAkB,CAAC;IAC9B,kEAAkE;IAClE,KAAK,EAAE,MAAM,CAAC;IACd,oFAAoF;IACpF,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;CAC7B;AAED,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,KAAK,EAAE,aAAa,EAAE,CAAC;CACxB;AAED,MAAM,WAAW,cAAe,SAAQ,WAAW;IACjD,kCAAkC;IAClC,OAAO,EAAE,OAAO,CAAC;CAClB;AAED,MAAM,MAAM,WAAW,GAAG,gBAAgB,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAC7F,MAAM,MAAM,WAAW,GAAG,gBAAgB,GAAG;IAAE,MAAM,EAAE,OAAO,CAAA;CAAE,CAAC;AACjE,MAAM,MAAM,YAAY,GAAG,iBAAiB,GAAG;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAEjE,MAAM,WAAW,OAAO;IACtB,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,MAAM,EAAE,YAAY,EAAE,CAAC;CACxB;AAED,kGAAkG;AAClG,MAAM,WAAW,aAAa;IAC5B,mFAAmF;IACnF,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;IAC9C,4DAA4D;IAC5D,IAAI,CAAC,IAAI,EAAE,iBAAiB,GAAG,SAAS,GAAG,SAAS,CAAC;IACrD,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,SAAS,CAAC;CACnC;AAED,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,SAAS,CAAC;IACjB,OAAO,EAAE,YAAY,CAAC;IACtB,SAAS,EAAE,kBAAkB,CAAC;IAC9B,OAAO,EAAE,cAAc,CAAC;IACxB,MAAM,EAAE,aAAa,CAAC;IACtB,UAAU,EAAE,mBAAmB,CAAC;IAChC,UAAU,EAAE,mBAAmB,CAAC;CACjC;AAED,wBAAgB,WAAW,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,GAAG,aAAa,CAIvE;AAOD,sGAAsG;AACtG,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,GAAG,YAAY,CAO5E;AAOD,8FAA8F;AAC9F,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO,CAAC,kBAAkB,EAAE,MAAM,CAAC,CAE3F;AAQD,uFAAuF;AACvF,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAGlG;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,SAAS,EAChB,OAAO,EAAE,YAAY,EACrB,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,kBAAkB,EAC7B,UAAU,EAAE,IAAI,CAAC,mBAAmB,EAAE,WAAW,CAAC,GACjD,MAAM,CAOR;AAED,MAAM,WAAW,UAAU;IACzB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAYD;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,aAAa,EAAE,UAAU,EAAE,IAAI,CAAC,mBAAmB,EAAE,QAAQ,CAAC,GAAG,UAAU,CAO/H;AAQD;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,GAAG,CAAC,CAiBhF;AAyDD;;;GAGG;AACH,wBAAgB,SAAS,CAAC,EACxB,KAAK,EACL,KAAK,GACN,EAAE;IACD,KAAK,EAAE,SAAS,IAAI,CAAC,WAAW,EAAE,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC;IACpD,KAAK,EAAE,SAAS,IAAI,CAAC,WAAW,EAAE,IAAI,GAAG,MAAM,GAAG,IAAI,GAAG,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC;CAC9E,GAAG,MAAM,CAMT;AAED,wBAAgB,SAAS,CAAC,KAAK,EAAE,YAAY,GAAG,OAAO,CAQtD"}

package/dist/data/call-graph/call-graph-model.js

@@ -0,0 +1,161 @@
+import { groupCaption, edgeLabel, edgeTitle, isConditional } from "./call-graph-labels.js";
+import { siteKey, nodeTitle } from "./call-graph-vocabulary.js";
+import { CALL_GRAPH_ACCESS } from "./types.js";
+const CALL_GRAPH_MAX_DEPTH = 8;
+const CALL_GRAPH_DEFAULT_DEPTH = 2;
+const DEFAULT_EDGE_LABELS = { call: "call", dispatch: "dispatch", read: "read", write: "write" };
+const EDGE_TONE = { dispatch: "info", read: "success", write: "warning" };
+function toggleAccess(access, type) {
+  const on = !access.includes(type);
+  if (!on && access.length === 1) throw new Error(`call graph: ${type} is the only access type on`);
+  return CALL_GRAPH_ACCESS.filter((entry) => entry === type ? on : access.includes(entry));
+}
+function requireNode(graph, id) {
+  const node = graph.nodes.find((candidate) => candidate.id === id);
+  if (!node) throw new Error(`call graph: no node "${id}"`);
+  return node;
+}
+function inDirection(depth, direction) {
+  if (direction === "both" || depth === 0) return true;
+  return direction === "callees" ? depth > 0 : depth < 0;
+}
+function visibleGraph(graph, view) {
+  const revealed = new Set(view.revealed);
+  const nodes = graph.nodes.filter(
+    (node) => inDirection(node.depth, view.direction) && (Math.abs(node.depth) <= view.depth || revealed.has(node.id))
+  );
+  const ids = new Set(nodes.map((node) => node.id));
+  return { nodes, edges: graph.edges.filter((edge) => ids.has(edge.from) && ids.has(edge.to)) };
+}
+function outerSide(node) {
+  return node.depth < 0 ? "in" : "out";
+}
+function expansionDirection(node) {
+  return outerSide(node) === "in" ? "callers" : "callees";
+}
+function outerNeighbours(graph, node) {
+  const side = outerSide(node);
+  return graph.edges.filter((edge) => (side === "out" ? edge.from : edge.to) === node.id).map((edge) => side === "out" ? edge.to : edge.from);
+}
+function expandCount(graph, visible, nodeId, direction, vocabulary) {
+  const node = requireNode(graph, nodeId);
+  const side = outerSide(node);
+  if (!vocabulary.hasSource(node) || direction === (side === "out" ? "callers" : "callees")) return 0;
+  const drawn = new Set(visible.nodes.map((entry) => entry.id));
+  const accounted = outerNeighbours(graph, node).filter((id) => drawn.has(id)).length;
+  return Math.max(0, (side === "out" ? node.out : node.in) - accounted);
+}
+function accessTotals(graph, node) {
+  const into = (types) => graph.edges.filter((edge) => edge.to === node.id && types.includes(edge.type)).length;
+  const totals = [["readers", into(["read"])], ["writers", into(["write"])], ["callers", into(["call", "dispatch"])]];
+  return Object.fromEntries(totals.filter(([, count]) => count > 0));
+}
+function walkedTotals(graph, node, vocabulary) {
+  if (vocabulary.isData(node)) return accessTotals(graph, node);
+  const walked = (sign) => graph.nodes.some((other) => Math.sign(other.depth) === sign);
+  return {
+    ...node.depth <= 0 && walked(-1) ? { callers: node.in } : {},
+    ...node.depth >= 0 && walked(1) ? { callees: node.out } : {}
+  };
+}
+function distinctSites(sites) {
+  return sites.filter((site, index) => sites.findIndex((other) => siteKey(other) === siteKey(site)) === index);
+}
+const edgeKey = (edge) => `${edge.from}|${edge.to}|${edge.type}`;
+function mergeGraph(held, expansion) {
+  const [rootId] = expansion.roots;
+  const base = held.nodes.find((node) => node.id === rootId);
+  if (rootId === void 0 || !base) throw new Error(`call graph: expansion root "${rootId}" is not in the held graph`);
+  const heldIds = new Set(held.nodes.map((node) => node.id));
+  const added = expansion.nodes.filter((node) => !heldIds.has(node.id)).map((node) => ({ ...node, depth: base.depth + node.depth }));
+  const incoming = new Map(expansion.edges.map((edge) => [edgeKey(edge), edge]));
+  const edges = held.edges.map((edge) => {
+    const more = incoming.get(edgeKey(edge));
+    incoming.delete(edgeKey(edge));
+    if (!more) return edge;
+    const properties = edge.properties && Object.keys(edge.properties).length > 0 ? edge.properties : more.properties;
+    return { ...edge, sites: distinctSites([...edge.sites, ...more.sites]), ...properties ? { properties } : {} };
+  });
+  const groupIds = new Set((held.groups ?? []).map((group) => group.id));
+  const groups = [...held.groups ?? [], ...(expansion.groups ?? []).filter((group) => !groupIds.has(group.id))];
+  return { ...held, nodes: [...held.nodes, ...added], edges: [...edges, ...incoming.values()], groups };
+}
+function groupRank(graph, vocabulary) {
+  const rootGroups = new Set(graph.roots.map((id) => requireNode(graph, id).group));
+  const sourced = new Set(graph.nodes.filter((node) => vocabulary.hasSource(node)).map((node) => node.group));
+  return (node) => {
+    if (node.group === void 0) return 3;
+    if (rootGroups.has(node.group)) return 0;
+    return sourced.has(node.group) ? 1 : 2;
+  };
+}
+function toDiagramNode(node, { graph, visible, direction, options, glyphs, vocabulary }) {
+  const count = expandCount(graph, visible, node.id, direction, vocabulary);
+  const isRoot = graph.roots.includes(node.id);
+  const tone = isRoot ? "info" : node.unresolved ? "warning" : void 0;
+  const compact = !isRoot && vocabulary.isData(node) && !vocabulary.hasSource(node);
+  return {
+    id: node.id,
+    label: node.label,
+    icon: glyphs.node(vocabulary.glyphOf(graph, node), vocabulary.kindOf(graph, node)),
+    title: nodeTitle(graph, node, vocabulary),
+    level: node.depth,
+    ...options.grouped && node.group !== void 0 ? { group: node.group } : {},
+    ...compact ? { size: "compact" } : {},
+    ...tone !== void 0 ? { tone } : {},
+    ...vocabulary.muted(node) ? { muted: true } : {},
+    ...count > 0 ? { expandCount: count } : {}
+  };
+}
+function toDiagramEdge(edge, { options, glyphs, edgeLabels }) {
+  const label = edgeLabel(edge, options);
+  const title = edgeTitle(edge);
+  return {
+    id: edge.id,
+    from: edge.from,
+    to: edge.to,
+    dashed: isConditional(edge),
+    ...edge.type === "call" ? {} : { tone: EDGE_TONE[edge.type], icon: glyphs.edge(edge.type), iconLabel: edgeLabels[edge.type] },
+    ...label !== void 0 ? { label } : {},
+    ...title !== void 0 ? { title } : {}
+  };
+}
+const PILL_CHAR_WIDTH = 5.2;
+const PILL_CHROME = 22;
+const PILL_ICON_CHARS = 3;
+const MIN_COLUMN_GAP = 96;
+function columnGap({
+  nodes,
+  edges
+}) {
+  const level = new Map(nodes.map((node) => [node.id, node.level]));
+  const chars = edges.filter((edge) => level.get(edge.from) !== level.get(edge.to)).map((edge) => {
+    var _a;
+    return (((_a = edge.label) == null ? void 0 : _a.length) ?? 0) + (edge.icon != null ? PILL_ICON_CHARS : 0);
+  });
+  return Math.max(MIN_COLUMN_GAP, Math.round(Math.max(0, ...chars) * PILL_CHAR_WIDTH) + PILL_CHROME);
+}
+function toDiagram(input) {
+  const { graph, visible, options, glyphs, vocabulary } = input;
+  const rank = groupRank(graph, vocabulary);
+  return {
+    nodes: [...visible.nodes].sort((a, b) => rank(a) - rank(b)).map((node) => toDiagramNode(node, input)),
+    edges: visible.edges.map((edge) => toDiagramEdge(edge, input)),
+    groups: options.grouped ? (graph.groups ?? []).map(({ id, label }) => ({ id, label: glyphs.group(groupCaption(label)), title: label })) : []
+  };
+}
+export {
+  CALL_GRAPH_DEFAULT_DEPTH,
+  CALL_GRAPH_MAX_DEPTH,
+  DEFAULT_EDGE_LABELS,
+  columnGap,
+  expandCount,
+  expansionDirection,
+  mergeGraph,
+  requireNode,
+  toDiagram,
+  toggleAccess,
+  visibleGraph,
+  walkedTotals
+};
+//# sourceMappingURL=call-graph-model.js.map

package/dist/data/call-graph/call-graph-model.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"call-graph-model.js","sources":["../../../src/data/call-graph/call-graph-model.ts"],"sourcesContent":["// Pure mapping from a call graph to what GraphDiagram draws, and how a `+N` expansion merges into the\n// held graph. It decides what is shown and leaves drawing a glyph to the DiagramGlyphs it is handed,\n// so it renders nothing itself.\nimport type { ReactNode } from \"react\";\nimport type { BadgeTone } from \"../Badge\";\nimport type { GraphDiagramEdge, GraphDiagramGroup, GraphDiagramNode } from \"../graph-diagram-model\";\nimport { edgeLabel, edgeTitle, groupCaption, isConditional, type PillOptions } from \"./call-graph-labels\";\nimport { nodeTitle, siteKey, type CallGraphVocabulary } from \"./call-graph-vocabulary\";\nimport {\n  CALL_GRAPH_ACCESS,\n  type CallGraph,\n  type CallGraphAccess,\n  type CallGraphDirection,\n  type CallGraphEdge,\n  type CallGraphEdgeLabels,\n  type CallGraphEdgeType,\n  type CallGraphGroup,\n  type CallGraphNode,\n  type CallGraphSite,\n} from \"./types\";\n\n/** The deepest graph uir builds (graph.MaxDepth). */\nexport const CALL_GRAPH_MAX_DEPTH = 8;\n/** The depth uir builds when none is asked for (graph.DefaultDepth). */\nexport const CALL_GRAPH_DEFAULT_DEPTH = 2;\n\nexport const DEFAULT_EDGE_LABELS: CallGraphEdgeLabels = { call: \"call\", dispatch: \"dispatch\", read: \"read\", write: \"write\" };\n\n/** The tone each edge type but a plain call is drawn in: dispatch blue, a read green, a write amber. */\nconst EDGE_TONE: Record<Exclude<CallGraphEdgeType, \"call\">, BadgeTone> = { dispatch: \"info\", read: \"success\", write: \"warning\" };\n\n/** Turns one access type on or off, in the usual order. Turning the last one off fails: a graph follows something. */\nexport function toggleAccess(access: readonly CallGraphAccess[], type: CallGraphAccess): CallGraphAccess[] {\n  const on = !access.includes(type);\n  if (!on && access.length === 1) throw new Error(`call graph: ${type} is the only access type on`);\n  return CALL_GRAPH_ACCESS.filter((entry) => (entry === type ? on : access.includes(entry)));\n}\n\nexport interface GraphView {\n  direction: CallGraphDirection;\n  /** Nodes further than this many hops from the root are hidden. */\n  depth: number;\n  /** Node ids shown regardless of `depth`, because a `+N` expansion revealed them. */\n  revealed: readonly string[];\n}\n\nexport interface VisibleGraph {\n  nodes: CallGraphNode[];\n  edges: CallGraphEdge[];\n}\n\nexport interface DiagramOptions extends PillOptions {\n  /** Box nodes by their `group`. */\n  grouped: boolean;\n}\n\nexport type DiagramNode = GraphDiagramNode & { label: string; level: number; title: string };\nexport type DiagramEdge = GraphDiagramEdge & { dashed: boolean };\nexport type DiagramGroup = GraphDiagramGroup & { title: string };\n\nexport interface Diagram {\n  nodes: DiagramNode[];\n  edges: DiagramEdge[];\n  groups: DiagramGroup[];\n}\n\n/** Draws the glyphs the model chooses. The component supplies icons; the tests supply strings. */\nexport interface DiagramGlyphs {\n  /** `words` is the icon's name for a screen reader, such as `external function`. */\n  node(glyph: string, words: string): ReactNode;\n  /** The pill icon of an edge type; a plain call has none. */\n  edge(type: CallGraphEdgeType): ReactNode | undefined;\n  group(caption: string): ReactNode;\n}\n\nexport interface DiagramInput {\n  graph: CallGraph;\n  visible: VisibleGraph;\n  direction: CallGraphDirection;\n  options: DiagramOptions;\n  glyphs: DiagramGlyphs;\n  vocabulary: CallGraphVocabulary;\n  edgeLabels: CallGraphEdgeLabels;\n}\n\nexport function requireNode(graph: CallGraph, id: string): CallGraphNode {\n  const node = graph.nodes.find((candidate) => candidate.id === id);\n  if (!node) throw new Error(`call graph: no node \"${id}\"`);\n  return node;\n}\n\nfunction inDirection(depth: number, direction: CallGraphDirection): boolean {\n  if (direction === \"both\" || depth === 0) return true;\n  return direction === \"callees\" ? depth > 0 : depth < 0;\n}\n\n/** The nodes on the requested side within `depth`, plus revealed ones, and the edges between them. */\nexport function visibleGraph(graph: CallGraph, view: GraphView): VisibleGraph {\n  const revealed = new Set(view.revealed);\n  const nodes = graph.nodes.filter(\n    (node) => inDirection(node.depth, view.direction) && (Math.abs(node.depth) <= view.depth || revealed.has(node.id)),\n  );\n  const ids = new Set(nodes.map((node) => node.id));\n  return { nodes, edges: graph.edges.filter((edge) => ids.has(edge.from) && ids.has(edge.to)) };\n}\n\n/** A caller grows toward its own callers; the root and callees grow toward their callees. */\nfunction outerSide(node: CallGraphNode): \"in\" | \"out\" {\n  return node.depth < 0 ? \"in\" : \"out\";\n}\n\n/** The direction a `+N` expansion of the node walks: its outer side, the side `+N` counts. */\nexport function expansionDirection(node: CallGraphNode): Exclude<CallGraphDirection, \"both\"> {\n  return outerSide(node) === \"in\" ? \"callers\" : \"callees\";\n}\n\n/** The ids at the far end of a node's edges on its outer side, as the response holds them. */\nfunction outerNeighbours(graph: CallGraph, node: CallGraphNode): string[] {\n  const side = outerSide(node);\n  return graph.edges.filter((edge) => (side === \"out\" ? edge.from : edge.to) === node.id).map((edge) => (side === \"out\" ? edge.to : edge.from));\n}\n\n/** The neighbours on a node's outer side that the response holds and are not drawn. */\nexport function hiddenNeighbours(graph: CallGraph, visible: VisibleGraph, nodeId: string): string[] {\n  const drawn = new Set(visible.nodes.map((node) => node.id));\n  return outerNeighbours(graph, requireNode(graph, nodeId)).filter((id, index, all) => !drawn.has(id) && all.indexOf(id) === index);\n}\n\n/**\n * The `+N` on a node: how many more edges there are to load on its outer side. Only that side's count\n * is a total (`out` for the root and callees, `in` for callers); the other equals the edges in the\n * response. Excluded neighbours are in neither. From it come off the edges drawn. A node without a\n * source cannot be expanded, nor can the side the direction hides.\n */\nexport function expandCount(\n  graph: CallGraph,\n  visible: VisibleGraph,\n  nodeId: string,\n  direction: CallGraphDirection,\n  vocabulary: Pick<CallGraphVocabulary, \"hasSource\">,\n): number {\n  const node = requireNode(graph, nodeId);\n  const side = outerSide(node);\n  if (!vocabulary.hasSource(node) || direction === (side === \"out\" ? \"callers\" : \"callees\")) return 0;\n  const drawn = new Set(visible.nodes.map((entry) => entry.id));\n  const accounted = outerNeighbours(graph, node).filter((id) => drawn.has(id)).length;\n  return Math.max(0, (side === \"out\" ? node.out : node.in) - accounted);\n}\n\nexport interface NodeTotals {\n  callers?: number;\n  callees?: number;\n  readers?: number;\n  writers?: number;\n}\n\n/**\n * A data node's readers, writers and callers: the edges into it the graph holds, by type, each left\n * out when there are none.\n */\nfunction accessTotals(graph: CallGraph, node: CallGraphNode): NodeTotals {\n  const into = (types: readonly CallGraphEdgeType[]) => graph.edges.filter((edge) => edge.to === node.id && types.includes(edge.type)).length;\n  const totals: [keyof NodeTotals, number][] = [[\"readers\", into([\"read\"])], [\"writers\", into([\"write\"])], [\"callers\", into([\"call\", \"dispatch\"])]];\n  return Object.fromEntries(totals.filter(([, count]) => count > 0));\n}\n\n/**\n * A node's call totals on the sides the response walked: callees at depth >= 0, callers at depth <= 0.\n * A data node counts who reads, writes and calls it instead.\n */\nexport function walkedTotals(graph: CallGraph, node: CallGraphNode, vocabulary: Pick<CallGraphVocabulary, \"isData\">): NodeTotals {\n  if (vocabulary.isData(node)) return accessTotals(graph, node);\n  const walked = (sign: number) => graph.nodes.some((other) => Math.sign(other.depth) === sign);\n  return {\n    ...(node.depth <= 0 && walked(-1) ? { callers: node.in } : {}),\n    ...(node.depth >= 0 && walked(1) ? { callees: node.out } : {}),\n  };\n}\n\nfunction distinctSites(sites: CallGraphSite[]): CallGraphSite[] {\n  return sites.filter((site, index) => sites.findIndex((other) => siteKey(other) === siteKey(site)) === index);\n}\n\nconst edgeKey = (edge: CallGraphEdge) => `${edge.from}|${edge.to}|${edge.type}`;\n\n/**\n * Merges a one-hop expansion into the held graph. The expansion is rooted at a held node, so its\n * depths are re-signed from that node's depth. Held nodes keep their place; edges are keyed by\n * `from|to|type`, gain the call sites they did not hold and keep their first non-empty properties;\n * the held response's other fields stay.\n */\nexport function mergeGraph<T extends CallGraph>(held: T, expansion: CallGraph): T {\n  const [rootId] = expansion.roots;\n  const base = held.nodes.find((node) => node.id === rootId);\n  if (rootId === undefined || !base) throw new Error(`call graph: expansion root \"${rootId}\" is not in the held graph`);\n  const heldIds = new Set(held.nodes.map((node) => node.id));\n  const added = expansion.nodes.filter((node) => !heldIds.has(node.id)).map((node) => ({ ...node, depth: base.depth + node.depth }));\n  const incoming = new Map(expansion.edges.map((edge) => [edgeKey(edge), edge]));\n  const edges = held.edges.map((edge) => {\n    const more = incoming.get(edgeKey(edge));\n    incoming.delete(edgeKey(edge));\n    if (!more) return edge;\n    const properties = edge.properties && Object.keys(edge.properties).length > 0 ? edge.properties : more.properties;\n    return { ...edge, sites: distinctSites([...edge.sites, ...more.sites]), ...(properties ? { properties } : {}) };\n  });\n  const groupIds = new Set((held.groups ?? []).map((group) => group.id));\n  const groups: CallGraphGroup[] = [...(held.groups ?? []), ...(expansion.groups ?? []).filter((group) => !groupIds.has(group.id))];\n  return { ...held, nodes: [...held.nodes, ...added], edges: [...edges, ...incoming.values()], groups };\n}\n\n/**\n * The order nodes are handed to the diagram, which stacks groups in the order they first appear: the\n * root's group, then the other groups holding nodes with a source, then the others, then nodes in no group.\n */\nfunction groupRank(graph: CallGraph, vocabulary: CallGraphVocabulary): (node: CallGraphNode) => number {\n  const rootGroups = new Set(graph.roots.map((id) => requireNode(graph, id).group));\n  const sourced = new Set(graph.nodes.filter((node) => vocabulary.hasSource(node)).map((node) => node.group));\n  return (node) => {\n    if (node.group === undefined) return 3;\n    if (rootGroups.has(node.group)) return 0;\n    return sourced.has(node.group) ? 1 : 2;\n  };\n}\n\nfunction toDiagramNode(node: CallGraphNode, { graph, visible, direction, options, glyphs, vocabulary }: DiagramInput): DiagramNode {\n  const count = expandCount(graph, visible, node.id, direction, vocabulary);\n  const isRoot = graph.roots.includes(node.id);\n  const tone = isRoot ? \"info\" : node.unresolved ? \"warning\" : undefined;\n  // A table, column, entity or field is a name its group box already places: one short line will do.\n  const compact = !isRoot && vocabulary.isData(node) && !vocabulary.hasSource(node);\n  return {\n    id: node.id,\n    label: node.label,\n    icon: glyphs.node(vocabulary.glyphOf(graph, node), vocabulary.kindOf(graph, node)),\n    title: nodeTitle(graph, node, vocabulary),\n    level: node.depth,\n    ...(options.grouped && node.group !== undefined ? { group: node.group } : {}),\n    ...(compact ? { size: \"compact\" as const } : {}),\n    ...(tone !== undefined ? { tone } : {}),\n    ...(vocabulary.muted(node) ? { muted: true } : {}),\n    ...(count > 0 ? { expandCount: count } : {}),\n  };\n}\n\nfunction toDiagramEdge(edge: CallGraphEdge, { options, glyphs, edgeLabels }: DiagramInput): DiagramEdge {\n  const label = edgeLabel(edge, options);\n  const title = edgeTitle(edge);\n  return {\n    id: edge.id,\n    from: edge.from,\n    to: edge.to,\n    dashed: isConditional(edge),\n    ...(edge.type === \"call\" ? {} : { tone: EDGE_TONE[edge.type], icon: glyphs.edge(edge.type), iconLabel: edgeLabels[edge.type] }),\n    ...(label !== undefined ? { label } : {}),\n    ...(title !== undefined ? { title } : {}),\n  };\n}\n\n/** Mean glyph advance of the 10px pill text, and the pill's padding plus a little air. */\nconst PILL_CHAR_WIDTH = 5.2;\nconst PILL_CHROME = 22;\n/** The room a pill's icon and its gap take, in characters. */\nconst PILL_ICON_CHARS = 3;\nconst MIN_COLUMN_GAP = 96;\n\n/**\n * The gap between columns: as wide as the longest pill on an edge between two columns, so no pill\n * covers a node. Wider gaps than the pills need make the diagram wider, and so smaller once fitted.\n */\nexport function columnGap({\n  nodes,\n  edges,\n}: {\n  nodes: readonly Pick<DiagramNode, \"id\" | \"level\">[];\n  edges: readonly Pick<DiagramEdge, \"id\" | \"from\" | \"to\" | \"label\" | \"icon\">[];\n}): number {\n  const level = new Map(nodes.map((node) => [node.id, node.level]));\n  const chars = edges\n    .filter((edge) => level.get(edge.from) !== level.get(edge.to))\n    .map((edge) => (edge.label?.length ?? 0) + (edge.icon != null ? PILL_ICON_CHARS : 0));\n  return Math.max(MIN_COLUMN_GAP, Math.round(Math.max(0, ...chars) * PILL_CHAR_WIDTH) + PILL_CHROME);\n}\n\nexport function toDiagram(input: DiagramInput): Diagram {\n  const { graph, visible, options, glyphs, vocabulary } = input;\n  const rank = groupRank(graph, vocabulary);\n  return {\n    nodes: [...visible.nodes].sort((a, b) => rank(a) - rank(b)).map((node) => toDiagramNode(node, input)),\n    edges: visible.edges.map((edge) => toDiagramEdge(edge, input)),\n    groups: options.grouped ? (graph.groups ?? []).map(({ id, label }) => ({ id, label: glyphs.group(groupCaption(label)), title: label })) : [],\n  };\n}\n"],"names":[],"mappings":";;;AAsBO,MAAM,uBAAuB;AAE7B,MAAM,2BAA2B;AAEjC,MAAM,sBAA2C,EAAE,MAAM,QAAQ,UAAU,YAAY,MAAM,QAAQ,OAAO,QAAA;AAGnH,MAAM,YAAmE,EAAE,UAAU,QAAQ,MAAM,WAAW,OAAO,UAAA;AAG9G,SAAS,aAAa,QAAoC,MAA0C;AACzG,QAAM,KAAK,CAAC,OAAO,SAAS,IAAI;AAChC,MAAI,CAAC,MAAM,OAAO,WAAW,SAAS,IAAI,MAAM,eAAe,IAAI,6BAA6B;AAChG,SAAO,kBAAkB,OAAO,CAAC,UAAW,UAAU,OAAO,KAAK,OAAO,SAAS,KAAK,CAAE;AAC3F;AAiDO,SAAS,YAAY,OAAkB,IAA2B;AACvE,QAAM,OAAO,MAAM,MAAM,KAAK,CAAC,cAAc,UAAU,OAAO,EAAE;AAChE,MAAI,CAAC,KAAM,OAAM,IAAI,MAAM,wBAAwB,EAAE,GAAG;AACxD,SAAO;AACT;AAEA,SAAS,YAAY,OAAe,WAAwC;AAC1E,MAAI,cAAc,UAAU,UAAU,EAAG,QAAO;AAChD,SAAO,cAAc,YAAY,QAAQ,IAAI,QAAQ;AACvD;AAGO,SAAS,aAAa,OAAkB,MAA+B;AAC5E,QAAM,WAAW,IAAI,IAAI,KAAK,QAAQ;AACtC,QAAM,QAAQ,MAAM,MAAM;AAAA,IACxB,CAAC,SAAS,YAAY,KAAK,OAAO,KAAK,SAAS,MAAM,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,SAAS,SAAS,IAAI,KAAK,EAAE;AAAA,EAAA;AAElH,QAAM,MAAM,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,KAAK,EAAE,CAAC;AAChD,SAAO,EAAE,OAAO,OAAO,MAAM,MAAM,OAAO,CAAC,SAAS,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,KAAK,EAAE,CAAC,EAAA;AAC5F;AAGA,SAAS,UAAU,MAAmC;AACpD,SAAO,KAAK,QAAQ,IAAI,OAAO;AACjC;AAGO,SAAS,mBAAmB,MAA0D;AAC3F,SAAO,UAAU,IAAI,MAAM,OAAO,YAAY;AAChD;AAGA,SAAS,gBAAgB,OAAkB,MAA+B;AACxE,QAAM,OAAO,UAAU,IAAI;AAC3B,SAAO,MAAM,MAAM,OAAO,CAAC,UAAU,SAAS,QAAQ,KAAK,OAAO,KAAK,QAAQ,KAAK,EAAE,EAAE,IAAI,CAAC,SAAU,SAAS,QAAQ,KAAK,KAAK,KAAK,IAAK;AAC9I;AAcO,SAAS,YACd,OACA,SACA,QACA,WACA,YACQ;AACR,QAAM,OAAO,YAAY,OAAO,MAAM;AACtC,QAAM,OAAO,UAAU,IAAI;AAC3B,MAAI,CAAC,WAAW,UAAU,IAAI,KAAK,eAAe,SAAS,QAAQ,YAAY,WAAY,QAAO;AAClG,QAAM,QAAQ,IAAI,IAAI,QAAQ,MAAM,IAAI,CAAC,UAAU,MAAM,EAAE,CAAC;AAC5D,QAAM,YAAY,gBAAgB,OAAO,IAAI,EAAE,OAAO,CAAC,OAAO,MAAM,IAAI,EAAE,CAAC,EAAE;AAC7E,SAAO,KAAK,IAAI,IAAI,SAAS,QAAQ,KAAK,MAAM,KAAK,MAAM,SAAS;AACtE;AAaA,SAAS,aAAa,OAAkB,MAAiC;AACvE,QAAM,OAAO,CAAC,UAAwC,MAAM,MAAM,OAAO,CAAC,SAAS,KAAK,OAAO,KAAK,MAAM,MAAM,SAAS,KAAK,IAAI,CAAC,EAAE;AACrI,QAAM,SAAuC,CAAC,CAAC,WAAW,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,WAAW,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,WAAW,KAAK,CAAC,QAAQ,UAAU,CAAC,CAAC,CAAC;AAChJ,SAAO,OAAO,YAAY,OAAO,OAAO,CAAC,CAAA,EAAG,KAAK,MAAM,QAAQ,CAAC,CAAC;AACnE;AAMO,SAAS,aAAa,OAAkB,MAAqB,YAA6D;AAC/H,MAAI,WAAW,OAAO,IAAI,EAAG,QAAO,aAAa,OAAO,IAAI;AAC5D,QAAM,SAAS,CAAC,SAAiB,MAAM,MAAM,KAAK,CAAC,UAAU,KAAK,KAAK,MAAM,KAAK,MAAM,IAAI;AAC5F,SAAO;AAAA,IACL,GAAI,KAAK,SAAS,KAAK,OAAO,EAAE,IAAI,EAAE,SAAS,KAAK,GAAA,IAAO,CAAA;AAAA,IAC3D,GAAI,KAAK,SAAS,KAAK,OAAO,CAAC,IAAI,EAAE,SAAS,KAAK,QAAQ,CAAA;AAAA,EAAC;AAEhE;AAEA,SAAS,cAAc,OAAyC;AAC9D,SAAO,MAAM,OAAO,CAAC,MAAM,UAAU,MAAM,UAAU,CAAC,UAAU,QAAQ,KAAK,MAAM,QAAQ,IAAI,CAAC,MAAM,KAAK;AAC7G;AAEA,MAAM,UAAU,CAAC,SAAwB,GAAG,KAAK,IAAI,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI;AAQtE,SAAS,WAAgC,MAAS,WAAyB;AAChF,QAAM,CAAC,MAAM,IAAI,UAAU;AAC3B,QAAM,OAAO,KAAK,MAAM,KAAK,CAAC,SAAS,KAAK,OAAO,MAAM;AACzD,MAAI,WAAW,UAAa,CAAC,YAAY,IAAI,MAAM,+BAA+B,MAAM,4BAA4B;AACpH,QAAM,UAAU,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC,SAAS,KAAK,EAAE,CAAC;AACzD,QAAM,QAAQ,UAAU,MAAM,OAAO,CAAC,SAAS,CAAC,QAAQ,IAAI,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,UAAU,EAAE,GAAG,MAAM,OAAO,KAAK,QAAQ,KAAK,MAAA,EAAQ;AACjI,QAAM,WAAW,IAAI,IAAI,UAAU,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,IAAI,GAAG,IAAI,CAAC,CAAC;AAC7E,QAAM,QAAQ,KAAK,MAAM,IAAI,CAAC,SAAS;AACrC,UAAM,OAAO,SAAS,IAAI,QAAQ,IAAI,CAAC;AACvC,aAAS,OAAO,QAAQ,IAAI,CAAC;AAC7B,QAAI,CAAC,KAAM,QAAO;AAClB,UAAM,aAAa,KAAK,cAAc,OAAO,KAAK,KAAK,UAAU,EAAE,SAAS,IAAI,KAAK,aAAa,KAAK;AACvG,WAAO,EAAE,GAAG,MAAM,OAAO,cAAc,CAAC,GAAG,KAAK,OAAO,GAAG,KAAK,KAAK,CAAC,GAAG,GAAI,aAAa,EAAE,WAAA,IAAe,GAAC;AAAA,EAC7G,CAAC;AACD,QAAM,WAAW,IAAI,KAAK,KAAK,UAAU,IAAI,IAAI,CAAC,UAAU,MAAM,EAAE,CAAC;AACrE,QAAM,SAA2B,CAAC,GAAI,KAAK,UAAU,IAAK,IAAI,UAAU,UAAU,CAAA,GAAI,OAAO,CAAC,UAAU,CAAC,SAAS,IAAI,MAAM,EAAE,CAAC,CAAC;AAChI,SAAO,EAAE,GAAG,MAAM,OAAO,CAAC,GAAG,KAAK,OAAO,GAAG,KAAK,GAAG,OAAO,CAAC,GAAG,OAAO,GAAG,SAAS,OAAA,CAAQ,GAAG,OAAA;AAC/F;AAMA,SAAS,UAAU,OAAkB,YAAkE;AACrG,QAAM,aAAa,IAAI,IAAI,MAAM,MAAM,IAAI,CAAC,OAAO,YAAY,OAAO,EAAE,EAAE,KAAK,CAAC;AAChF,QAAM,UAAU,IAAI,IAAI,MAAM,MAAM,OAAO,CAAC,SAAS,WAAW,UAAU,IAAI,CAAC,EAAE,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC;AAC1G,SAAO,CAAC,SAAS;AACf,QAAI,KAAK,UAAU,OAAW,QAAO;AACrC,QAAI,WAAW,IAAI,KAAK,KAAK,EAAG,QAAO;AACvC,WAAO,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI;AAAA,EACvC;AACF;AAEA,SAAS,cAAc,MAAqB,EAAE,OAAO,SAAS,WAAW,SAAS,QAAQ,cAAyC;AACjI,QAAM,QAAQ,YAAY,OAAO,SAAS,KAAK,IAAI,WAAW,UAAU;AACxE,QAAM,SAAS,MAAM,MAAM,SAAS,KAAK,EAAE;AAC3C,QAAM,OAAO,SAAS,SAAS,KAAK,aAAa,YAAY;AAE7D,QAAM,UAAU,CAAC,UAAU,WAAW,OAAO,IAAI,KAAK,CAAC,WAAW,UAAU,IAAI;AAChF,SAAO;AAAA,IACL,IAAI,KAAK;AAAA,IACT,OAAO,KAAK;AAAA,IACZ,MAAM,OAAO,KAAK,WAAW,QAAQ,OAAO,IAAI,GAAG,WAAW,OAAO,OAAO,IAAI,CAAC;AAAA,IACjF,OAAO,UAAU,OAAO,MAAM,UAAU;AAAA,IACxC,OAAO,KAAK;AAAA,IACZ,GAAI,QAAQ,WAAW,KAAK,UAAU,SAAY,EAAE,OAAO,KAAK,MAAA,IAAU,CAAA;AAAA,IAC1E,GAAI,UAAU,EAAE,MAAM,UAAA,IAAuB,CAAA;AAAA,IAC7C,GAAI,SAAS,SAAY,EAAE,KAAA,IAAS,CAAA;AAAA,IACpC,GAAI,WAAW,MAAM,IAAI,IAAI,EAAE,OAAO,KAAA,IAAS,CAAA;AAAA,IAC/C,GAAI,QAAQ,IAAI,EAAE,aAAa,MAAA,IAAU,CAAA;AAAA,EAAC;AAE9C;AAEA,SAAS,cAAc,MAAqB,EAAE,SAAS,QAAQ,cAAyC;AACtG,QAAM,QAAQ,UAAU,MAAM,OAAO;AACrC,QAAM,QAAQ,UAAU,IAAI;AAC5B,SAAO;AAAA,IACL,IAAI,KAAK;AAAA,IACT,MAAM,KAAK;AAAA,IACX,IAAI,KAAK;AAAA,IACT,QAAQ,cAAc,IAAI;AAAA,IAC1B,GAAI,KAAK,SAAS,SAAS,CAAA,IAAK,EAAE,MAAM,UAAU,KAAK,IAAI,GAAG,MAAM,OAAO,KAAK,KAAK,IAAI,GAAG,WAAW,WAAW,KAAK,IAAI,EAAA;AAAA,IAC3H,GAAI,UAAU,SAAY,EAAE,MAAA,IAAU,CAAA;AAAA,IACtC,GAAI,UAAU,SAAY,EAAE,UAAU,CAAA;AAAA,EAAC;AAE3C;AAGA,MAAM,kBAAkB;AACxB,MAAM,cAAc;AAEpB,MAAM,kBAAkB;AACxB,MAAM,iBAAiB;AAMhB,SAAS,UAAU;AAAA,EACxB;AAAA,EACA;AACF,GAGW;AACT,QAAM,QAAQ,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,KAAK,KAAK,CAAC,CAAC;AAChE,QAAM,QAAQ,MACX,OAAO,CAAC,SAAS,MAAM,IAAI,KAAK,IAAI,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC,EAC5D,IAAI,CAAC;;AAAU,wBAAK,UAAL,mBAAY,WAAU,MAAM,KAAK,QAAQ,OAAO,kBAAkB;AAAA,GAAE;AACtF,SAAO,KAAK,IAAI,gBAAgB,KAAK,MAAM,KAAK,IAAI,GAAG,GAAG,KAAK,IAAI,eAAe,IAAI,WAAW;AACnG;AAEO,SAAS,UAAU,OAA8B;AACtD,QAAM,EAAE,OAAO,SAAS,SAAS,QAAQ,eAAe;AACxD,QAAM,OAAO,UAAU,OAAO,UAAU;AACxC,SAAO;AAAA,IACL,OAAO,CAAC,GAAG,QAAQ,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,cAAc,MAAM,KAAK,CAAC;AAAA,IACpG,OAAO,QAAQ,MAAM,IAAI,CAAC,SAAS,cAAc,MAAM,KAAK,CAAC;AAAA,IAC7D,QAAQ,QAAQ,WAAW,MAAM,UAAU,CAAA,GAAI,IAAI,CAAC,EAAE,IAAI,MAAA,OAAa,EAAE,IAAI,OAAO,OAAO,MAAM,aAAa,KAAK,CAAC,GAAG,OAAO,MAAA,EAAQ,IAAI,CAAA;AAAA,EAAC;AAE/I;"}

package/dist/data/call-graph/call-graph-vocabulary.cjs

@@ -0,0 +1,177 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const UiSqlTable = require("../../icons/components/UiSqlTable.cjs");
+const UiSqlColumn = require("../../icons/components/UiSqlColumn.cjs");
+const UiSqlStoredProc = require("../../icons/components/UiSqlStoredProc.cjs");
+const UiTableProperties = require("../../icons/components/UiTableProperties.cjs");
+const UiField = require("../../icons/components/UiField.cjs");
+const UiPackage = require("../../icons/components/UiPackage.cjs");
+const UiFunction = require("../../icons/components/UiFunction.cjs");
+const UiMethod = require("../../icons/components/UiMethod.cjs");
+const UiInterface = require("../../icons/components/UiInterface.cjs");
+const UiMethod11 = require("../../icons/components/UiMethod11.cjs");
+const UiFunction1 = require("../../icons/components/UiFunction1.cjs");
+const UiFunctionSquare = require("../../icons/components/UiFunctionSquare.cjs");
+const UiTypeParameter = require("../../icons/components/UiTypeParameter.cjs");
+const UiVariable = require("../../icons/components/UiVariable.cjs");
+const UiConstant = require("../../icons/components/UiConstant.cjs");
+const UiUnknown = require("../../icons/components/UiUnknown.cjs");
+const UiSymbol = require("../../icons/components/UiSymbol.cjs");
+function requireGlyph(vocabulary, id) {
+  const glyph = vocabulary.glyphs.find((candidate) => candidate.id === id);
+  if (!glyph) throw new Error(`call graph: the vocabulary has no glyph "${id}"`);
+  return glyph;
+}
+function usedGlyphs(graph, vocabulary) {
+  const used = new Set(graph.nodes.map((node) => vocabulary.glyphOf(graph, node)));
+  return vocabulary.glyphs.filter((glyph) => used.has(glyph.id));
+}
+function nodeTitle(graph, node, vocabulary) {
+  var _a, _b;
+  const group = ((_b = (_a = graph.groups) == null ? void 0 : _a.find((candidate) => candidate.id === node.group)) == null ? void 0 : _b.label) ?? node.group;
+  return `${vocabulary.kindOf(graph, node)} ${node.label}${group ? ` in ${group}` : ""}`;
+}
+function callsItself(graph, node) {
+  return graph.edges.some((edge) => edge.from === node.id && edge.to === node.id);
+}
+function siteKey(site) {
+  return `${site.path}:${site.line}:${site.column}`;
+}
+const UIR_KINDS = /* @__PURE__ */ new Map([
+  ["func", { glyph: "func", words: "function" }],
+  ["method", { glyph: "method", words: "method" }],
+  ["builtin", { glyph: "builtin", words: "builtin" }],
+  ["type", { glyph: "type", words: "type" }],
+  ["field", { glyph: "field", words: "field" }],
+  ["var", { glyph: "var", words: "variable" }],
+  ["const", { glyph: "const", words: "constant" }],
+  ["package", { glyph: "package", words: "package scope" }]
+]);
+const DATA_KIND_WORDS = {
+  table: "table",
+  column: "column",
+  procedure: "stored procedure",
+  entity: "entity",
+  field: "field"
+};
+const CALL_GRAPH_DATA_GLYPHS = [
+  { id: "table", name: "table", icon: UiSqlTable.UiSqlTable },
+  { id: "column", name: "column", icon: UiSqlColumn.UiSqlColumn },
+  { id: "procedure", name: "stored procedure", icon: UiSqlStoredProc.UiSqlStoredProc },
+  { id: "entity", name: "entity", icon: UiTableProperties.UiTableProperties },
+  { id: "field", name: "field", icon: UiField.UiField }
+];
+function isDataNode(node) {
+  return Object.hasOwn(DATA_KIND_WORDS, node.kind);
+}
+function dataName(node) {
+  const prefix = `${node.kind}:`;
+  return node.id.startsWith(prefix) ? node.id.slice(prefix.length) : node.label;
+}
+function dataNodeStatus(node) {
+  const name = dataName(node);
+  switch (node.kind) {
+    case "table":
+      return `Table ${name}`;
+    case "column":
+      return `Column ${name}`;
+    case "procedure":
+      return `Stored procedure ${name}`;
+    case "entity":
+      return `${name} fields`;
+  }
+  const entity = name.includes(".") ? name.slice(0, name.indexOf(".")) : node.group ?? "";
+  const { column, storage } = node.properties ?? {};
+  if (column) return `${entity} field → ${column}`;
+  if (storage) return `${entity} field, dynamic, stored in ${storage}`;
+  return `${entity} field`;
+}
+function dataNodeBacking(node) {
+  var _a;
+  const column = node.kind === "field" ? (_a = node.properties) == null ? void 0 : _a.column : void 0;
+  return column ? { id: `column:${column}`, label: column } : void 0;
+}
+function isBuiltin(node) {
+  return node.kind === "builtin";
+}
+function isPackageScope(node) {
+  return node.kind === "package";
+}
+function isExternal(node) {
+  return !node.location && !node.unresolved && !isBuiltin(node) && !isPackageScope(node) && !isDataNode(node);
+}
+function interfaceMethods(graph) {
+  const dispatched = new Set(
+    graph.edges.filter((edge) => edge.type === "dispatch").flatMap((edge) => edge.sites.map((site) => `${edge.from} ${siteKey(site)}`))
+  );
+  return new Set(
+    graph.edges.filter((edge) => edge.type === "call" && edge.sites.some((site) => dispatched.has(`${edge.from} ${siteKey(site)}`))).map((edge) => edge.to)
+  );
+}
+function uirGlyph(graph, node) {
+  var _a;
+  if (node.unresolved) return "unresolved";
+  if (isBuiltin(node)) return "builtin";
+  if (isPackageScope(node)) return "package";
+  if (isDataNode(node)) return node.kind;
+  if (callsItself(graph, node)) return "recursive";
+  if (isExternal(node) && node.kind === "func") return "external_func";
+  if (interfaceMethods(graph).has(node.id)) return "interface_method";
+  return ((_a = UIR_KINDS.get(node.kind)) == null ? void 0 : _a.glyph) ?? "symbol";
+}
+function uirKind(graph, node) {
+  var _a;
+  if (node.unresolved) return "unresolved call";
+  const kind = interfaceMethods(graph).has(node.id) ? "interface method" : ((_a = UIR_KINDS.get(node.kind)) == null ? void 0 : _a.words) ?? DATA_KIND_WORDS[node.kind] ?? node.kind.replaceAll("_", " ");
+  return [isExternal(node) ? "external" : "", callsItself(graph, node) ? "recursive" : "", kind].filter(Boolean).join(" ");
+}
+function uirStatus(node) {
+  if (node.unresolved) return "Unresolved: the index has no target for this call";
+  if (isBuiltin(node)) return "Builtin: no source";
+  if (isExternal(node)) return "External: declared outside the indexed snapshots";
+  if (node.location) return "Indexed";
+  return isDataNode(node) ? dataNodeStatus(node) : "Package scope: calls made outside any declaration";
+}
+const UIR_CALL_GRAPH_VOCABULARY = {
+  glyphs: [
+    { id: "func", name: "function", icon: UiFunction.UiFunction },
+    { id: "method", name: "method", icon: UiMethod.UiMethod },
+    { id: "interface_method", name: "interface method", icon: UiInterface.UiInterface },
+    { id: "recursive", name: "calls itself", icon: UiMethod11.UiMethod11, darkIcon: UiMethod11.UiMethod11Dark },
+    { id: "external_func", name: "external function", icon: UiFunction1.UiFunction1, darkIcon: UiFunction1.UiFunction1Dark },
+    { id: "builtin", name: "builtin", icon: UiFunctionSquare.UiFunctionSquare },
+    { id: "type", name: "type", icon: UiTypeParameter.UiTypeParameter },
+    { id: "field", name: "field", icon: UiField.UiField },
+    { id: "var", name: "variable", icon: UiVariable.UiVariable },
+    { id: "const", name: "constant", icon: UiConstant.UiConstant },
+    { id: "package", name: "package scope", icon: UiPackage.UiPackage },
+    // uir's `field` is already a glyph of its own: a struct field is data too.
+    ...CALL_GRAPH_DATA_GLYPHS.filter((glyph) => glyph.id !== "field"),
+    { id: "unresolved", name: "unresolved call", icon: UiUnknown.UiUnknown },
+    { id: "symbol", name: "other symbol", icon: UiSymbol.UiSymbol, darkIcon: UiSymbol.UiSymbolDark }
+  ],
+  glyphOf: uirGlyph,
+  kindOf: uirKind,
+  hasSource: (node) => Boolean(node.location),
+  canRoot: (node) => Boolean(node.location) || isDataNode(node),
+  isData: isDataNode,
+  muted: (node) => Boolean(node.unresolved) || isBuiltin(node) || isExternal(node),
+  status: uirStatus,
+  backing: dataNodeBacking,
+  group: { noun: "package", plural: "packages", icon: UiPackage.UiPackage, patternHint: "example.com/module/..." }
+};
+exports.CALL_GRAPH_DATA_GLYPHS = CALL_GRAPH_DATA_GLYPHS;
+exports.DATA_KIND_WORDS = DATA_KIND_WORDS;
+exports.UIR_CALL_GRAPH_VOCABULARY = UIR_CALL_GRAPH_VOCABULARY;
+exports.callsItself = callsItself;
+exports.dataNodeBacking = dataNodeBacking;
+exports.dataNodeStatus = dataNodeStatus;
+exports.interfaceMethods = interfaceMethods;
+exports.isBuiltin = isBuiltin;
+exports.isDataNode = isDataNode;
+exports.isExternal = isExternal;
+exports.nodeTitle = nodeTitle;
+exports.requireGlyph = requireGlyph;
+exports.siteKey = siteKey;
+exports.usedGlyphs = usedGlyphs;
+//# sourceMappingURL=call-graph-vocabulary.cjs.map

package/dist/data/call-graph/call-graph-vocabulary.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"call-graph-vocabulary.cjs","sources":["../../../src/data/call-graph/call-graph-vocabulary.ts"],"sourcesContent":["// What a node kind means and how it is drawn. A host whose source names its own kinds (OIPA's\n// transactions, copybooks and functions) passes its own vocabulary; the default is the one uir's\n// `graph.Build` reports without a Theme: uir node types, a builtin, a package scope and an index\n// location for every node with a source.\nimport {\n  UiConstant,\n  UiField,\n  UiFunction,\n  UiFunction1,\n  UiFunction1Dark,\n  UiFunctionSquare,\n  UiInterface,\n  UiMethod,\n  UiMethod11,\n  UiMethod11Dark,\n  UiPackage,\n  UiSqlColumn,\n  UiSqlStoredProc,\n  UiSqlTable,\n  UiSymbol,\n  UiSymbolDark,\n  UiTableProperties,\n  UiTypeParameter,\n  UiUnknown,\n  UiVariable,\n  type IconComponent,\n} from \"../../icons\";\nimport type { CallGraph, CallGraphNode } from \"./types\";\n\nexport interface CallGraphGlyph {\n  id: string;\n  /** The legend's name for it. */\n  name: string;\n  icon: IconComponent;\n  /** Drawn instead of `icon` in the dark theme, for coloured artwork. */\n  darkIcon?: IconComponent;\n}\n\nexport interface CallGraphVocabulary {\n  /** Every glyph the vocabulary draws, in legend order. */\n  glyphs: readonly CallGraphGlyph[];\n  /** The id of the one glyph a node shows. */\n  glyphOf(graph: CallGraph, node: CallGraphNode): string;\n  /** What the node is, in words: `method`, `external function`, `copybook`. */\n  kindOf(graph: CallGraph, node: CallGraphNode): string;\n  /** The node has a body the source walks: it can be expanded and opened. */\n  hasSource(node: CallGraphNode): boolean;\n  /** The graph can be drawn around the node: Focus is offered for it, with or without a source. */\n  canRoot(node: CallGraphNode): boolean;\n  /** A table, column, procedure, entity or field: its details count readers and writers. */\n  isData(node: CallGraphNode): boolean;\n  /** Drawn dimmed: the node leads nowhere further. */\n  muted(node: CallGraphNode): boolean;\n  /** The node's status line in its details. */\n  status(node: CallGraphNode): string;\n  /** The node a data node stands for, such as the column behind a field, offered as a Focus link. */\n  backing?(node: CallGraphNode): { id: string; label: string } | undefined;\n  /** What a group is, and the icon its box caption shows. */\n  group: { noun: string; plural: string; icon: IconComponent; patternHint: string };\n}\n\n/** The glyph with that id, failing on one the vocabulary does not list. */\nexport function requireGlyph(vocabulary: CallGraphVocabulary, id: string): CallGraphGlyph {\n  const glyph = vocabulary.glyphs.find((candidate) => candidate.id === id);\n  if (!glyph) throw new Error(`call graph: the vocabulary has no glyph \"${id}\"`);\n  return glyph;\n}\n\n/** The glyphs the graph's nodes use, once each, in legend order. */\nexport function usedGlyphs(graph: CallGraph, vocabulary: CallGraphVocabulary): CallGraphGlyph[] {\n  const used = new Set(graph.nodes.map((node) => vocabulary.glyphOf(graph, node)));\n  return vocabulary.glyphs.filter((glyph) => used.has(glyph.id));\n}\n\n/** The node's tooltip: its kind, its label and its group's full label. */\nexport function nodeTitle(graph: CallGraph, node: CallGraphNode, vocabulary: CallGraphVocabulary): string {\n  const group = graph.groups?.find((candidate) => candidate.id === node.group)?.label ?? node.group;\n  return `${vocabulary.kindOf(graph, node)} ${node.label}${group ? ` in ${group}` : \"\"}`;\n}\n\nexport function callsItself(graph: CallGraph, node: CallGraphNode): boolean {\n  return graph.edges.some((edge) => edge.from === node.id && edge.to === node.id);\n}\n\nexport function siteKey(site: { path?: string; line?: number; column?: number }): string {\n  return `${site.path}:${site.line}:${site.column}`;\n}\n\n// uir node types that have a glyph of their own, and the words for each.\nconst UIR_KINDS = new Map<string, { glyph: string; words: string }>([\n  [\"func\", { glyph: \"func\", words: \"function\" }],\n  [\"method\", { glyph: \"method\", words: \"method\" }],\n  [\"builtin\", { glyph: \"builtin\", words: \"builtin\" }],\n  [\"type\", { glyph: \"type\", words: \"type\" }],\n  [\"field\", { glyph: \"field\", words: \"field\" }],\n  [\"var\", { glyph: \"var\", words: \"variable\" }],\n  [\"const\", { glyph: \"const\", words: \"constant\" }],\n  [\"package\", { glyph: \"package\", words: \"package scope\" }],\n]);\n\n// Data access, as the graph's data model names it: `table:AsPolicy`, `column:AsPolicy.STATUSCODE`,\n// `procedure:Update_ClassGroup`, `entity:Policy` and `field:Policy.StatusCode`, a field carrying\n// `column` (its `x-oipa-column`) or `storage` (the table a dynamic field is kept in).\n\nexport const DATA_KIND_WORDS: Readonly<Record<string, string>> = {\n  table: \"table\",\n  column: \"column\",\n  procedure: \"stored procedure\",\n  entity: \"entity\",\n  field: \"field\",\n};\n\nexport const CALL_GRAPH_DATA_GLYPHS: readonly CallGraphGlyph[] = [\n  { id: \"table\", name: \"table\", icon: UiSqlTable },\n  { id: \"column\", name: \"column\", icon: UiSqlColumn },\n  { id: \"procedure\", name: \"stored procedure\", icon: UiSqlStoredProc },\n  { id: \"entity\", name: \"entity\", icon: UiTableProperties },\n  { id: \"field\", name: \"field\", icon: UiField },\n];\n\nexport function isDataNode(node: CallGraphNode): boolean {\n  return Object.hasOwn(DATA_KIND_WORDS, node.kind);\n}\n\n/** The data node's name: its id after `<kind>:`, else its label. */\nfunction dataName(node: CallGraphNode): string {\n  const prefix = `${node.kind}:`;\n  return node.id.startsWith(prefix) ? node.id.slice(prefix.length) : node.label;\n}\n\nexport function dataNodeStatus(node: CallGraphNode): string {\n  const name = dataName(node);\n  switch (node.kind) {\n    case \"table\": return `Table ${name}`;\n    case \"column\": return `Column ${name}`;\n    case \"procedure\": return `Stored procedure ${name}`;\n    case \"entity\": return `${name} fields`;\n  }\n  const entity = name.includes(\".\") ? name.slice(0, name.indexOf(\".\")) : (node.group ?? \"\");\n  const { column, storage } = node.properties ?? {};\n  if (column) return `${entity} field → ${column}`;\n  if (storage) return `${entity} field, dynamic, stored in ${storage}`;\n  return `${entity} field`;\n}\n\n/** The column behind a field, by its `column` property. */\nexport function dataNodeBacking(node: CallGraphNode): { id: string; label: string } | undefined {\n  const column = node.kind === \"field\" ? node.properties?.column : undefined;\n  return column ? { id: `column:${column}`, label: column } : undefined;\n}\n\nexport function isBuiltin(node: CallGraphNode): boolean {\n  return node.kind === \"builtin\";\n}\n\n/** The node standing for the calls a package makes outside any declaration. */\nfunction isPackageScope(node: CallGraphNode): boolean {\n  return node.kind === \"package\";\n}\n\n/** A symbol declared outside the indexed snapshots: it has no source, so it cannot be opened or expanded. */\nexport function isExternal(node: CallGraphNode): boolean {\n  return !node.location && !node.unresolved && !isBuiltin(node) && !isPackageScope(node) && !isDataNode(node);\n}\n\n/**\n * The index has no kind for an interface method: it is a `method`. It shows in the graph as the target\n * of a call whose site also carries a dispatch edge from the same caller, because the source adds that\n * dispatch edge to each implementation of the interface method called there.\n */\nexport function interfaceMethods(graph: CallGraph): Set<string> {\n  const dispatched = new Set(\n    graph.edges.filter((edge) => edge.type === \"dispatch\").flatMap((edge) => edge.sites.map((site) => `${edge.from} ${siteKey(site)}`)),\n  );\n  return new Set(\n    graph.edges\n      .filter((edge) => edge.type === \"call\" && edge.sites.some((site) => dispatched.has(`${edge.from} ${siteKey(site)}`)))\n      .map((edge) => edge.to),\n  );\n}\n\n/**\n * The one glyph a node shows. An unresolved call, a builtin and a package scope are what they are;\n * after those, a symbol that calls itself, an external function and an interface method outrank the\n * plain kind. An external method keeps the method glyph: its dimmed box already says it has no source.\n */\nfunction uirGlyph(graph: CallGraph, node: CallGraphNode): string {\n  if (node.unresolved) return \"unresolved\";\n  if (isBuiltin(node)) return \"builtin\";\n  if (isPackageScope(node)) return \"package\";\n  if (isDataNode(node)) return node.kind;\n  if (callsItself(graph, node)) return \"recursive\";\n  if (isExternal(node) && node.kind === \"func\") return \"external_func\";\n  if (interfaceMethods(graph).has(node.id)) return \"interface_method\";\n  return UIR_KINDS.get(node.kind)?.glyph ?? \"symbol\";\n}\n\nfunction uirKind(graph: CallGraph, node: CallGraphNode): string {\n  if (node.unresolved) return \"unresolved call\";\n  const kind = interfaceMethods(graph).has(node.id) ? \"interface method\" : (UIR_KINDS.get(node.kind)?.words ?? DATA_KIND_WORDS[node.kind] ?? node.kind.replaceAll(\"_\", \" \"));\n  return [isExternal(node) ? \"external\" : \"\", callsItself(graph, node) ? \"recursive\" : \"\", kind].filter(Boolean).join(\" \");\n}\n\nfunction uirStatus(node: CallGraphNode): string {\n  if (node.unresolved) return \"Unresolved: the index has no target for this call\";\n  if (isBuiltin(node)) return \"Builtin: no source\";\n  if (isExternal(node)) return \"External: declared outside the indexed snapshots\";\n  if (node.location) return \"Indexed\";\n  return isDataNode(node) ? dataNodeStatus(node) : \"Package scope: calls made outside any declaration\";\n}\n\nexport const UIR_CALL_GRAPH_VOCABULARY: CallGraphVocabulary = {\n  glyphs: [\n    { id: \"func\", name: \"function\", icon: UiFunction },\n    { id: \"method\", name: \"method\", icon: UiMethod },\n    { id: \"interface_method\", name: \"interface method\", icon: UiInterface },\n    { id: \"recursive\", name: \"calls itself\", icon: UiMethod11, darkIcon: UiMethod11Dark },\n    { id: \"external_func\", name: \"external function\", icon: UiFunction1, darkIcon: UiFunction1Dark },\n    { id: \"builtin\", name: \"builtin\", icon: UiFunctionSquare },\n    { id: \"type\", name: \"type\", icon: UiTypeParameter },\n    { id: \"field\", name: \"field\", icon: UiField },\n    { id: \"var\", name: \"variable\", icon: UiVariable },\n    { id: \"const\", name: \"constant\", icon: UiConstant },\n    { id: \"package\", name: \"package scope\", icon: UiPackage },\n    // uir's `field` is already a glyph of its own: a struct field is data too.\n    ...CALL_GRAPH_DATA_GLYPHS.filter((glyph) => glyph.id !== \"field\"),\n    { id: \"unresolved\", name: \"unresolved call\", icon: UiUnknown },\n    { id: \"symbol\", name: \"other symbol\", icon: UiSymbol, darkIcon: UiSymbolDark },\n  ],\n  glyphOf: uirGlyph,\n  kindOf: uirKind,\n  hasSource: (node) => Boolean(node.location),\n  canRoot: (node) => Boolean(node.location) || isDataNode(node),\n  isData: isDataNode,\n  muted: (node) => Boolean(node.unresolved) || isBuiltin(node) || isExternal(node),\n  status: uirStatus,\n  backing: dataNodeBacking,\n  group: { noun: \"package\", plural: \"packages\", icon: UiPackage, patternHint: \"example.com/module/...\" },\n};\n"],"names":["UiSqlTable","UiSqlColumn","UiSqlStoredProc","UiTableProperties","UiField","UiFunction","UiMethod","UiInterface","UiMethod11","UiMethod11Dark","UiFunction1","UiFunction1Dark","UiFunctionSquare","UiTypeParameter","UiVariable","UiConstant","UiPackage","UiUnknown","UiSymbol","UiSymbolDark"],"mappings":";;;;;;;;;;;;;;;;;;;AA8DO,SAAS,aAAa,YAAiC,IAA4B;AACxF,QAAM,QAAQ,WAAW,OAAO,KAAK,CAAC,cAAc,UAAU,OAAO,EAAE;AACvE,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,4CAA4C,EAAE,GAAG;AAC7E,SAAO;AACT;AAGO,SAAS,WAAW,OAAkB,YAAmD;AAC9F,QAAM,OAAO,IAAI,IAAI,MAAM,MAAM,IAAI,CAAC,SAAS,WAAW,QAAQ,OAAO,IAAI,CAAC,CAAC;AAC/E,SAAO,WAAW,OAAO,OAAO,CAAC,UAAU,KAAK,IAAI,MAAM,EAAE,CAAC;AAC/D;AAGO,SAAS,UAAU,OAAkB,MAAqB,YAAyC;;AACxG,QAAM,UAAQ,iBAAM,WAAN,mBAAc,KAAK,CAAC,cAAc,UAAU,OAAO,KAAK,WAAxD,mBAAgE,UAAS,KAAK;AAC5F,SAAO,GAAG,WAAW,OAAO,OAAO,IAAI,CAAC,IAAI,KAAK,KAAK,GAAG,QAAQ,OAAO,KAAK,KAAK,EAAE;AACtF;AAEO,SAAS,YAAY,OAAkB,MAA8B;AAC1E,SAAO,MAAM,MAAM,KAAK,CAAC,SAAS,KAAK,SAAS,KAAK,MAAM,KAAK,OAAO,KAAK,EAAE;AAChF;AAEO,SAAS,QAAQ,MAAiE;AACvF,SAAO,GAAG,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,MAAM;AACjD;AAGA,MAAM,gCAAgB,IAA8C;AAAA,EAClE,CAAC,QAAQ,EAAE,OAAO,QAAQ,OAAO,YAAY;AAAA,EAC7C,CAAC,UAAU,EAAE,OAAO,UAAU,OAAO,UAAU;AAAA,EAC/C,CAAC,WAAW,EAAE,OAAO,WAAW,OAAO,WAAW;AAAA,EAClD,CAAC,QAAQ,EAAE,OAAO,QAAQ,OAAO,QAAQ;AAAA,EACzC,CAAC,SAAS,EAAE,OAAO,SAAS,OAAO,SAAS;AAAA,EAC5C,CAAC,OAAO,EAAE,OAAO,OAAO,OAAO,YAAY;AAAA,EAC3C,CAAC,SAAS,EAAE,OAAO,SAAS,OAAO,YAAY;AAAA,EAC/C,CAAC,WAAW,EAAE,OAAO,WAAW,OAAO,iBAAiB;AAC1D,CAAC;AAMM,MAAM,kBAAoD;AAAA,EAC/D,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,QAAQ;AAAA,EACR,OAAO;AACT;AAEO,MAAM,yBAAoD;AAAA,EAC/D,EAAE,IAAI,SAAS,MAAM,SAAS,MAAMA,WAAAA,WAAA;AAAA,EACpC,EAAE,IAAI,UAAU,MAAM,UAAU,MAAMC,YAAAA,YAAA;AAAA,EACtC,EAAE,IAAI,aAAa,MAAM,oBAAoB,MAAMC,gBAAAA,gBAAA;AAAA,EACnD,EAAE,IAAI,UAAU,MAAM,UAAU,MAAMC,kBAAAA,kBAAA;AAAA,EACtC,EAAE,IAAI,SAAS,MAAM,SAAS,MAAMC,QAAAA,QAAA;AACtC;AAEO,SAAS,WAAW,MAA8B;AACvD,SAAO,OAAO,OAAO,iBAAiB,KAAK,IAAI;AACjD;AAGA,SAAS,SAAS,MAA6B;AAC7C,QAAM,SAAS,GAAG,KAAK,IAAI;AAC3B,SAAO,KAAK,GAAG,WAAW,MAAM,IAAI,KAAK,GAAG,MAAM,OAAO,MAAM,IAAI,KAAK;AAC1E;AAEO,SAAS,eAAe,MAA6B;AAC1D,QAAM,OAAO,SAAS,IAAI;AAC1B,UAAQ,KAAK,MAAA;AAAA,IACX,KAAK;AAAS,aAAO,SAAS,IAAI;AAAA,IAClC,KAAK;AAAU,aAAO,UAAU,IAAI;AAAA,IACpC,KAAK;AAAa,aAAO,oBAAoB,IAAI;AAAA,IACjD,KAAK;AAAU,aAAO,GAAG,IAAI;AAAA,EAAA;AAE/B,QAAM,SAAS,KAAK,SAAS,GAAG,IAAI,KAAK,MAAM,GAAG,KAAK,QAAQ,GAAG,CAAC,IAAK,KAAK,SAAS;AACtF,QAAM,EAAE,QAAQ,QAAA,IAAY,KAAK,cAAc,CAAA;AAC/C,MAAI,OAAQ,QAAO,GAAG,MAAM,YAAY,MAAM;AAC9C,MAAI,QAAS,QAAO,GAAG,MAAM,8BAA8B,OAAO;AAClE,SAAO,GAAG,MAAM;AAClB;AAGO,SAAS,gBAAgB,MAAgE;;AAC9F,QAAM,SAAS,KAAK,SAAS,WAAU,UAAK,eAAL,mBAAiB,SAAS;AACjE,SAAO,SAAS,EAAE,IAAI,UAAU,MAAM,IAAI,OAAO,WAAW;AAC9D;AAEO,SAAS,UAAU,MAA8B;AACtD,SAAO,KAAK,SAAS;AACvB;AAGA,SAAS,eAAe,MAA8B;AACpD,SAAO,KAAK,SAAS;AACvB;AAGO,SAAS,WAAW,MAA8B;AACvD,SAAO,CAAC,KAAK,YAAY,CAAC,KAAK,cAAc,CAAC,UAAU,IAAI,KAAK,CAAC,eAAe,IAAI,KAAK,CAAC,WAAW,IAAI;AAC5G;AAOO,SAAS,iBAAiB,OAA+B;AAC9D,QAAM,aAAa,IAAI;AAAA,IACrB,MAAM,MAAM,OAAO,CAAC,SAAS,KAAK,SAAS,UAAU,EAAE,QAAQ,CAAC,SAAS,KAAK,MAAM,IAAI,CAAC,SAAS,GAAG,KAAK,IAAI,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;AAAA,EAAA;AAEpI,SAAO,IAAI;AAAA,IACT,MAAM,MACH,OAAO,CAAC,SAAS,KAAK,SAAS,UAAU,KAAK,MAAM,KAAK,CAAC,SAAS,WAAW,IAAI,GAAG,KAAK,IAAI,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC,CAAC,EACnH,IAAI,CAAC,SAAS,KAAK,EAAE;AAAA,EAAA;AAE5B;AAOA,SAAS,SAAS,OAAkB,MAA6B;;AAC/D,MAAI,KAAK,WAAY,QAAO;AAC5B,MAAI,UAAU,IAAI,EAAG,QAAO;AAC5B,MAAI,eAAe,IAAI,EAAG,QAAO;AACjC,MAAI,WAAW,IAAI,EAAG,QAAO,KAAK;AAClC,MAAI,YAAY,OAAO,IAAI,EAAG,QAAO;AACrC,MAAI,WAAW,IAAI,KAAK,KAAK,SAAS,OAAQ,QAAO;AACrD,MAAI,iBAAiB,KAAK,EAAE,IAAI,KAAK,EAAE,EAAG,QAAO;AACjD,WAAO,eAAU,IAAI,KAAK,IAAI,MAAvB,mBAA0B,UAAS;AAC5C;AAEA,SAAS,QAAQ,OAAkB,MAA6B;;AAC9D,MAAI,KAAK,WAAY,QAAO;AAC5B,QAAM,OAAO,iBAAiB,KAAK,EAAE,IAAI,KAAK,EAAE,IAAI,uBAAsB,eAAU,IAAI,KAAK,IAAI,MAAvB,mBAA0B,UAAS,gBAAgB,KAAK,IAAI,KAAK,KAAK,KAAK,WAAW,KAAK,GAAG;AACxK,SAAO,CAAC,WAAW,IAAI,IAAI,aAAa,IAAI,YAAY,OAAO,IAAI,IAAI,cAAc,IAAI,IAAI,EAAE,OAAO,OAAO,EAAE,KAAK,GAAG;AACzH;AAEA,SAAS,UAAU,MAA6B;AAC9C,MAAI,KAAK,WAAY,QAAO;AAC5B,MAAI,UAAU,IAAI,EAAG,QAAO;AAC5B,MAAI,WAAW,IAAI,EAAG,QAAO;AAC7B,MAAI,KAAK,SAAU,QAAO;AAC1B,SAAO,WAAW,IAAI,IAAI,eAAe,IAAI,IAAI;AACnD;AAEO,MAAM,4BAAiD;AAAA,EAC5D,QAAQ;AAAA,IACN,EAAE,IAAI,QAAQ,MAAM,YAAY,MAAMC,WAAAA,WAAA;AAAA,IACtC,EAAE,IAAI,UAAU,MAAM,UAAU,MAAMC,SAAAA,SAAA;AAAA,IACtC,EAAE,IAAI,oBAAoB,MAAM,oBAAoB,MAAMC,YAAAA,YAAA;AAAA,IAC1D,EAAE,IAAI,aAAa,MAAM,gBAAgB,MAAMC,WAAAA,YAAY,UAAUC,0BAAA;AAAA,IACrE,EAAE,IAAI,iBAAiB,MAAM,qBAAqB,MAAMC,YAAAA,aAAa,UAAUC,4BAAA;AAAA,IAC/E,EAAE,IAAI,WAAW,MAAM,WAAW,MAAMC,iBAAAA,iBAAA;AAAA,IACxC,EAAE,IAAI,QAAQ,MAAM,QAAQ,MAAMC,gBAAAA,gBAAA;AAAA,IAClC,EAAE,IAAI,SAAS,MAAM,SAAS,MAAMT,QAAAA,QAAA;AAAA,IACpC,EAAE,IAAI,OAAO,MAAM,YAAY,MAAMU,WAAAA,WAAA;AAAA,IACrC,EAAE,IAAI,SAAS,MAAM,YAAY,MAAMC,WAAAA,WAAA;AAAA,IACvC,EAAE,IAAI,WAAW,MAAM,iBAAiB,MAAMC,UAAAA,UAAA;AAAA;AAAA,IAE9C,GAAG,uBAAuB,OAAO,CAAC,UAAU,MAAM,OAAO,OAAO;AAAA,IAChE,EAAE,IAAI,cAAc,MAAM,mBAAmB,MAAMC,UAAAA,UAAA;AAAA,IACnD,EAAE,IAAI,UAAU,MAAM,gBAAgB,MAAMC,SAAAA,UAAU,UAAUC,SAAAA,aAAA;AAAA,EAAa;AAAA,EAE/E,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,WAAW,CAAC,SAAS,QAAQ,KAAK,QAAQ;AAAA,EAC1C,SAAS,CAAC,SAAS,QAAQ,KAAK,QAAQ,KAAK,WAAW,IAAI;AAAA,EAC5D,QAAQ;AAAA,EACR,OAAO,CAAC,SAAS,QAAQ,KAAK,UAAU,KAAK,UAAU,IAAI,KAAK,WAAW,IAAI;AAAA,EAC/E,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,OAAO,EAAE,MAAM,WAAW,QAAQ,YAAY,MAAMH,qBAAW,aAAa,yBAAA;AAC9E;;;;;;;;;;;;;;;"}