@flanksource/clicky-ui 0.3.44 → 0.3.46

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

@@ -0,0 +1,312 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const dataAccess = require("../data-access.cjs");
+const callGraphLabels = require("./call-graph-labels.cjs");
+const callGraphVocabulary = require("./call-graph-vocabulary.cjs");
+const types = require("./types.cjs");
+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 && type !== "variable" && baseAccess(access).length === 1) throw new Error(`call graph: ${type} is the only access type on`);
+  return ACCESS_ORDER.filter((entry) => entry === type ? on : access.includes(entry));
+}
+const ACCESS_ORDER = [...types.CALL_GRAPH_ACCESS, "variable"];
+function baseAccess(access) {
+  return access.filter((type) => types.CALL_GRAPH_ACCESS.includes(type));
+}
+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 outerEdges(graph, node) {
+  const side = outerSide(node);
+  return graph.edges.filter((edge) => (side === "out" ? edge.from : edge.to) === node.id);
+}
+function expandCount(graph, visible, nodeId, direction, vocabulary, merged = /* @__PURE__ */ new Map()) {
+  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 = outerEdges(graph, node).filter((edge) => drawn.has(side === "out" ? edge.to : edge.from)).reduce((sum, edge) => {
+    var _a;
+    return sum + (((_a = merged.get(edge.id)) == null ? void 0 : _a.sources.length) ?? 1);
+  }, 0);
+  return Math.max(0, (side === "out" ? node.out : node.in) - accounted);
+}
+function accessTotals(graph, node) {
+  const into = (types2) => graph.edges.filter((edge) => edge.to === node.id && types2.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) => callGraphVocabulary.siteKey(other) === callGraphVocabulary.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 rootGroups2 = 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 (rootGroups2.has(node.group)) return 0;
+    return sourced.has(node.group) ? 1 : 2;
+  };
+}
+function accessInto(edges, id) {
+  return edges.reduce((held, edge) => edge.to === id && (edge.type === "read" || edge.type === "write") ? dataAccess.mergeAccess(held, edge.type) : held, void 0);
+}
+function toDiagramNode(node, { direction, options, glyphs, vocabulary }, drawn, records) {
+  var _a;
+  const { graph, visible } = drawn;
+  const count = expandCount(graph, visible, node.id, direction, vocabulary, drawn.merged);
+  const isRoot = graph.roots.includes(node.id);
+  const tone = isRoot ? "info" : node.unresolved ? "warning" : void 0;
+  const compact = node.group !== void 0 && records.has(node.group) || !isRoot && vocabulary.isData(node) && !vocabulary.hasSource(node);
+  const aside = callGraphVocabulary.dataMemberAside(node);
+  const access = glyphs.access && accessInto(visible.edges, node.id);
+  return {
+    id: node.id,
+    label: node.label,
+    icon: glyphs.node(vocabulary.glyphOf(graph, node), vocabulary.kindOf(graph, node)),
+    title: callGraphVocabulary.nodeTitle(graph, node, vocabulary),
+    level: node.depth,
+    ...options.grouped && node.group !== void 0 ? { group: node.group } : {},
+    ...compact ? { size: "compact" } : {},
+    ...aside !== void 0 ? { aside } : {},
+    ...access ? { mark: (_a = glyphs.access) == null ? void 0 : _a.call(glyphs, access) } : {},
+    ...tone !== void 0 ? { tone } : {},
+    ...vocabulary.muted(node) ? { muted: true } : {},
+    ...count > 0 ? { expandCount: count } : {}
+  };
+}
+function toDiagramEdge(edge, { options, glyphs, edgeLabels, vocabulary }, drawn) {
+  const merge = drawn.merged.get(edge.id);
+  const label = [callGraphLabels.edgeLabel(edge, options), merge && countWords(merge.members, drawn.graph, vocabulary)].filter(Boolean).join(" · ") || void 0;
+  const title = callGraphLabels.edgeTitle(edge);
+  return {
+    id: edge.id,
+    from: edge.from,
+    to: edge.to,
+    dashed: callGraphLabels.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 recordGroups(visible, vocabulary) {
+  var _a;
+  const grouped = /* @__PURE__ */ new Map();
+  for (const node of visible.nodes) {
+    if (node.group !== void 0) grouped.set(node.group, [...grouped.get(node.group) ?? [], node]);
+  }
+  const records = /* @__PURE__ */ new Map();
+  for (const [group, nodes] of grouped) {
+    const kind = (_a = nodes[0]) == null ? void 0 : _a.kind;
+    if (kind !== void 0 && nodes.every((node) => vocabulary.isData(node) && callGraphVocabulary.isDataMember(node) && node.kind === kind)) {
+      const owner = callGraphVocabulary.DATA_MEMBER_OWNER[kind];
+      if (owner === void 0) throw new Error(`call graph: no owner kind for data member "${kind}"`);
+      records.set(group, owner);
+    }
+  }
+  return records;
+}
+const STAND_IN_PREFIX = "group:";
+function standInId(group) {
+  return `${STAND_IN_PREFIX}${group}`;
+}
+function rootGroups(graph) {
+  return new Set(graph.roots.map((id) => requireNode(graph, id).group));
+}
+function collapsibleGroups(graph, visible) {
+  const roots = rootGroups(graph);
+  return [...new Set(visible.nodes.map((node) => node.group))].filter((group) => group !== void 0 && !roots.has(group));
+}
+function countWords(members, graph, vocabulary) {
+  const [first] = members;
+  const kind = first && members.every((member) => member.kind === first.kind) ? vocabulary.kindOf(graph, first) : "member";
+  return `${members.length} ${kind}${members.length === 1 ? "" : "s"}`;
+}
+function memberProperties(members) {
+  const keys = { column: "columns", field: "fields" };
+  const names = /* @__PURE__ */ new Map();
+  for (const member of members) {
+    const key = keys[member.kind] ?? "members";
+    names.set(key, [...names.get(key) ?? [], member.label]);
+  }
+  return Object.fromEntries([...names].map(([key, list]) => [key, list.join(", ")]));
+}
+function mergeEdges(id, sources, standInOf, nodes) {
+  const [first] = sources;
+  if (!first) throw new Error(`call graph: merged edge "${id}" stands for no edge`);
+  const memberIds = [...new Set(sources.flatMap((edge2) => [edge2.from, edge2.to]).filter((end) => standInOf.has(end)))];
+  const members = memberIds.map((member) => {
+    const node = nodes.get(member);
+    if (!node) throw new Error(`call graph: no node "${member}"`);
+    return node;
+  });
+  const kind = sources.every((edge2) => edge2.kind === first.kind) ? first.kind : void 0;
+  const edge = {
+    id,
+    from: standInOf.get(first.from) ?? first.from,
+    to: standInOf.get(first.to) ?? first.to,
+    type: first.type,
+    ...kind !== void 0 ? { kind } : {},
+    sites: distinctSites(sources.flatMap((source) => source.sites)),
+    properties: memberProperties(members)
+  };
+  return [edge, { sources: [...sources], members }];
+}
+function foldEdges(edges, standInOf, nodes) {
+  const kept = [];
+  const grouped = /* @__PURE__ */ new Map();
+  for (const edge of edges) {
+    const from = standInOf.get(edge.from) ?? edge.from;
+    const to = standInOf.get(edge.to) ?? edge.to;
+    if (from === edge.from && to === edge.to) kept.push(edge);
+    else grouped.set(`${from}|${to}|${edge.type}`, [...grouped.get(`${from}|${to}|${edge.type}`) ?? [], edge]);
+  }
+  const merged = new Map([...grouped].map(([id, sources]) => mergeEdges(id, sources, standInOf, nodes)).map(([edge, merge]) => [edge.id, { edge, merge }]));
+  return { edges: [...kept, ...[...merged.values()].map(({ edge }) => edge)], merged: new Map([...merged].map(([id, { merge }]) => [id, merge])) };
+}
+function standInNode(id, fold, graph, records, edges) {
+  var _a, _b;
+  const [first, ...rest] = fold.members;
+  if (!first) throw new Error(`call graph: collapsed group "${fold.group}" holds no node`);
+  const nearest = rest.reduce((best, member) => Math.abs(member.depth) < Math.abs(best.depth) ? member : best, first);
+  return {
+    id,
+    identifier: {},
+    kind: records.get(fold.group) ?? first.kind,
+    label: ((_b = (_a = graph.groups) == null ? void 0 : _a.find((group) => group.id === fold.group)) == null ? void 0 : _b.label) ?? fold.group,
+    group: fold.group,
+    depth: nearest.depth,
+    in: edges.filter((edge) => edge.to === id).length,
+    out: edges.filter((edge) => edge.from === id).length
+  };
+}
+function foldGroups(graph, visible, collapsed, records) {
+  var _a;
+  const roots = rootGroups(graph);
+  const folds = /* @__PURE__ */ new Map();
+  const standInOf = /* @__PURE__ */ new Map();
+  for (const node of visible.nodes) {
+    if (node.group === void 0 || roots.has(node.group) || !collapsed.includes(node.group)) continue;
+    const id = standInId(node.group);
+    folds.set(id, { group: node.group, members: [...((_a = folds.get(id)) == null ? void 0 : _a.members) ?? [], node] });
+    standInOf.set(node.id, id);
+  }
+  if (folds.size === 0) return { graph, visible, folds, merged: /* @__PURE__ */ new Map() };
+  const { edges, merged } = foldEdges(graph.edges, standInOf, new Map(graph.nodes.map((node) => [node.id, node])));
+  const standIns = [...folds].map(([id, fold]) => standInNode(id, fold, graph, records, edges));
+  const nodes = [...visible.nodes.filter((node) => !standInOf.has(node.id)), ...standIns];
+  const drawnIds = new Set(nodes.map((node) => node.id));
+  return {
+    graph: { ...graph, nodes: [...graph.nodes.filter((node) => !standInOf.has(node.id)), ...standIns], edges },
+    visible: { nodes, edges: edges.filter((edge) => drawnIds.has(edge.from) && drawnIds.has(edge.to)) },
+    folds,
+    merged
+  };
+}
+function toDiagramGroup({ id, label }, { glyphs, graph, vocabulary }, drawn, records, collapsible) {
+  const fold = drawn.folds.get(standInId(id));
+  return {
+    id,
+    label: glyphs.group(callGraphLabels.groupCaption(label), records.get(id)),
+    title: label,
+    ...records.has(id) ? { variant: "record" } : {},
+    ...(collapsible == null ? void 0 : collapsible.has(id)) ? { collapsed: fold !== void 0 } : {},
+    ...fold ? { aside: countWords(fold.members, graph, vocabulary) } : {}
+  };
+}
+function toDiagram(input) {
+  const { graph, visible, options, vocabulary, collapsed } = input;
+  const records = options.grouped ? recordGroups(visible, vocabulary) : /* @__PURE__ */ new Map();
+  const drawn = options.grouped && collapsed ? foldGroups(graph, visible, collapsed, records) : { graph, visible, folds: /* @__PURE__ */ new Map(), merged: /* @__PURE__ */ new Map() };
+  const collapsible = options.grouped && collapsed ? new Set(collapsibleGroups(graph, visible)) : void 0;
+  const rank = groupRank(drawn.graph, vocabulary);
+  return {
+    nodes: [...drawn.visible.nodes].sort((a, b) => rank(a) - rank(b)).map((node) => toDiagramNode(node, input, drawn, records)),
+    edges: drawn.visible.edges.map((edge) => toDiagramEdge(edge, input, drawn)),
+    groups: options.grouped ? (graph.groups ?? []).map((group) => toDiagramGroup(group, input, drawn, records, collapsible)) : [],
+    drawn
+  };
+}
+exports.CALL_GRAPH_DEFAULT_DEPTH = CALL_GRAPH_DEFAULT_DEPTH;
+exports.CALL_GRAPH_MAX_DEPTH = CALL_GRAPH_MAX_DEPTH;
+exports.DEFAULT_EDGE_LABELS = DEFAULT_EDGE_LABELS;
+exports.baseAccess = baseAccess;
+exports.collapsibleGroups = collapsibleGroups;
+exports.columnGap = columnGap;
+exports.expandCount = expandCount;
+exports.expansionDirection = expansionDirection;
+exports.mergeGraph = mergeGraph;
+exports.recordGroups = recordGroups;
+exports.requireNode = requireNode;
+exports.standInId = standInId;
+exports.toDiagram = toDiagram;
+exports.toggleAccess = toggleAccess;
+exports.visibleGraph = visibleGraph;
+exports.walkedTotals = walkedTotals;
+//# sourceMappingURL=call-graph-model.cjs.map

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 { mergeAccess, type DataAccess } from \"../data-access\";\nimport type { GraphDiagramEdge, GraphDiagramGroup, GraphDiagramNode } from \"../graph-diagram-model\";\nimport { edgeLabel, edgeTitle, groupCaption, isConditional, type PillOptions } from \"./call-graph-labels\";\nimport { DATA_MEMBER_OWNER, dataMemberAside, isDataMember, 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 && type !== \"variable\" && baseAccess(access).length === 1) throw new Error(`call graph: ${type} is the only access type on`);\n  return ACCESS_ORDER.filter((entry) => (entry === type ? on : access.includes(entry)));\n}\n\n/** Every access type in the usual order: variables last, on top of the others. */\nconst ACCESS_ORDER: readonly CallGraphAccess[] = [...CALL_GRAPH_ACCESS, \"variable\"];\n\n/** The access types of `access` that are not variables, at least one of which a graph follows. */\nexport function baseAccess(access: readonly CallGraphAccess[]): CallGraphAccess[] {\n  return access.filter((type) => CALL_GRAPH_ACCESS.includes(type));\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; aside?: string };\n\nexport interface Diagram {\n  nodes: DiagramNode[];\n  edges: DiagramEdge[];\n  groups: DiagramGroup[];\n  /** The graph as drawn, collapsed groups folded into their stand-ins: what a selection is looked up in. */\n  drawn: DrawnGraph;\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, glyph?: string): ReactNode;\n  /** The mark of a node the reads and writes into it access; without it no node is marked. */\n  access?(access: DataAccess): 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   * The groups drawn as their header alone, by id: each folds into one stand-in node, and its members'\n   * edges merge onto it. The root's group never folds. Leave it out and no group can collapse.\n   */\n  collapsed?: readonly string[];\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/** A node's edges on its outer side, as the response holds them. */\nfunction outerEdges(graph: CallGraph, node: CallGraphNode): CallGraphEdge[] {\n  const side = outerSide(node);\n  return graph.edges.filter((edge) => (side === \"out\" ? edge.from : edge.to) === node.id);\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 outerEdges(graph, node).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 merged edge counting\n * every edge it stands for. A node without a 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  merged: ReadonlyMap<string, EdgeMerge> = new Map(),\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 = outerEdges(graph, node)\n    .filter((edge) => drawn.has(side === \"out\" ? edge.to : edge.from))\n    .reduce((sum, edge) => sum + (merged.get(edge.id)?.sources.length ?? 1), 0);\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\n/** How the reads and writes among `edges` into the node access it, or undefined when none do. */\nfunction accessInto(edges: readonly CallGraphEdge[], id: string): DataAccess | undefined {\n  return edges.reduce<DataAccess | undefined>((held, edge) => (edge.to === id && (edge.type === \"read\" || edge.type === \"write\") ? mergeAccess(held, edge.type) : held), undefined);\n}\n\nfunction toDiagramNode(node: CallGraphNode, { direction, options, glyphs, vocabulary }: DiagramInput, drawn: DrawnGraph, records: ReadonlyMap<string, string>): DiagramNode {\n  const { graph, visible } = drawn;\n  const count = expandCount(graph, visible, node.id, direction, vocabulary, drawn.merged);\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 = (node.group !== undefined && records.has(node.group)) || (!isRoot && vocabulary.isData(node) && !vocabulary.hasSource(node));\n  const aside = dataMemberAside(node);\n  const access = glyphs.access && accessInto(visible.edges, node.id);\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    ...(aside !== undefined ? { aside } : {}),\n    ...(access ? { mark: glyphs.access?.(access) } : {}),\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, vocabulary }: DiagramInput, drawn: DrawnGraph): DiagramEdge {\n  const merge = drawn.merged.get(edge.id);\n  const label = [edgeLabel(edge, options), merge && countWords(merge.members, drawn.graph, vocabulary)].filter(Boolean).join(\" · \") || undefined;\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 recordGroups(visible: VisibleGraph, vocabulary: CallGraphVocabulary): Map<string, string> {\n  const grouped = new Map<string, CallGraphNode[]>();\n  for (const node of visible.nodes) {\n    if (node.group !== undefined) grouped.set(node.group, [...(grouped.get(node.group) ?? []), node]);\n  }\n  const records = new Map<string, string>();\n  for (const [group, nodes] of grouped) {\n    const kind = nodes[0]?.kind;\n    if (kind !== undefined && nodes.every((node) => vocabulary.isData(node) && isDataMember(node) && node.kind === kind)) {\n      const owner = DATA_MEMBER_OWNER[kind];\n      if (owner === undefined) throw new Error(`call graph: no owner kind for data member \"${kind}\"`);\n      records.set(group, owner);\n    }\n  }\n  return records;\n}\n\n/** A collapsed group's members, and the stand-in node drawn for them. */\nexport interface GroupFold {\n  group: string;\n  members: CallGraphNode[];\n}\n\n/** One edge drawn for the edges of several members: the edges it stands for and the members at their ends. */\nexport interface EdgeMerge {\n  sources: CallGraphEdge[];\n  members: CallGraphNode[];\n}\n\nexport interface DrawnGraph {\n  graph: CallGraph;\n  visible: VisibleGraph;\n  /** By stand-in id. */\n  folds: ReadonlyMap<string, GroupFold>;\n  /** By the id of the edge drawn for them. */\n  merged: ReadonlyMap<string, EdgeMerge>;\n}\n\nconst STAND_IN_PREFIX = \"group:\";\n\n/** The id of the node a collapsed group is drawn as. */\nexport function standInId(group: string): string {\n  return `${STAND_IN_PREFIX}${group}`;\n}\n\nfunction rootGroups(graph: CallGraph): Set<string | undefined> {\n  return new Set(graph.roots.map((id) => requireNode(graph, id).group));\n}\n\n/** The groups that hold a drawn node and can collapse: every one but the root's, in first-drawn order. */\nexport function collapsibleGroups(graph: CallGraph, visible: VisibleGraph): string[] {\n  const roots = rootGroups(graph);\n  return [...new Set(visible.nodes.map((node) => node.group))].filter((group): group is string => group !== undefined && !roots.has(group));\n}\n\n/** \"10 columns\", \"2 fields\", \"3 variables\": how many members, in the words of their one kind, else \"members\". */\nfunction countWords(members: readonly CallGraphNode[], graph: CallGraph, vocabulary: CallGraphVocabulary): string {\n  const [first] = members;\n  const kind = first && members.every((member) => member.kind === first.kind) ? vocabulary.kindOf(graph, first) : \"member\";\n  return `${members.length} ${kind}${members.length === 1 ? \"\" : \"s\"}`;\n}\n\n/** A merged edge's properties: the names of the members it stands for, gathered as columns, fields or members. */\nfunction memberProperties(members: readonly CallGraphNode[]): Record<string, string> {\n  const keys: Record<string, string> = { column: \"columns\", field: \"fields\" };\n  const names = new Map<string, string[]>();\n  for (const member of members) {\n    const key = keys[member.kind] ?? \"members\";\n    names.set(key, [...(names.get(key) ?? []), member.label]);\n  }\n  return Object.fromEntries([...names].map(([key, list]) => [key, list.join(\", \")]));\n}\n\nfunction mergeEdges(id: string, sources: readonly CallGraphEdge[], standInOf: ReadonlyMap<string, string>, nodes: ReadonlyMap<string, CallGraphNode>): [CallGraphEdge, EdgeMerge] {\n  const [first] = sources;\n  if (!first) throw new Error(`call graph: merged edge \"${id}\" stands for no edge`);\n  const memberIds = [...new Set(sources.flatMap((edge) => [edge.from, edge.to]).filter((end) => standInOf.has(end)))];\n  const members = memberIds.map((member) => {\n    const node = nodes.get(member);\n    if (!node) throw new Error(`call graph: no node \"${member}\"`);\n    return node;\n  });\n  const kind = sources.every((edge) => edge.kind === first.kind) ? first.kind : undefined;\n  const edge: CallGraphEdge = {\n    id, from: standInOf.get(first.from) ?? first.from, to: standInOf.get(first.to) ?? first.to, type: first.type,\n    ...(kind !== undefined ? { kind } : {}),\n    sites: distinctSites(sources.flatMap((source) => source.sites)),\n    properties: memberProperties(members),\n  };\n  return [edge, { sources: [...sources], members }];\n}\n\n/** Edges with an end in a collapsed group, re-ended on its stand-in and merged per stand-in, other end and type. */\nfunction foldEdges(edges: readonly CallGraphEdge[], standInOf: ReadonlyMap<string, string>, nodes: ReadonlyMap<string, CallGraphNode>) {\n  const kept: CallGraphEdge[] = [];\n  const grouped = new Map<string, CallGraphEdge[]>();\n  for (const edge of edges) {\n    const from = standInOf.get(edge.from) ?? edge.from;\n    const to = standInOf.get(edge.to) ?? edge.to;\n    if (from === edge.from && to === edge.to) kept.push(edge);\n    else grouped.set(`${from}|${to}|${edge.type}`, [...(grouped.get(`${from}|${to}|${edge.type}`) ?? []), edge]);\n  }\n  const merged = new Map([...grouped].map(([id, sources]) => mergeEdges(id, sources, standInOf, nodes)).map(([edge, merge]) => [edge.id, { edge, merge }]));\n  return { edges: [...kept, ...[...merged.values()].map(({ edge }) => edge)], merged: new Map([...merged].map(([id, { merge }]) => [id, merge])) };\n}\n\n/** The node a collapsed group is drawn as: its owner's kind for a record, else its first member's, at the depth nearest the root. */\nfunction standInNode(id: string, fold: GroupFold, graph: CallGraph, records: ReadonlyMap<string, string>, edges: readonly CallGraphEdge[]): CallGraphNode {\n  const [first, ...rest] = fold.members;\n  if (!first) throw new Error(`call graph: collapsed group \"${fold.group}\" holds no node`);\n  const nearest = rest.reduce((best, member) => (Math.abs(member.depth) < Math.abs(best.depth) ? member : best), first);\n  return {\n    id, identifier: {}, kind: records.get(fold.group) ?? first.kind,\n    label: graph.groups?.find((group) => group.id === fold.group)?.label ?? fold.group,\n    group: fold.group, depth: nearest.depth,\n    in: edges.filter((edge) => edge.to === id).length, out: edges.filter((edge) => edge.from === id).length,\n  };\n}\n\n/** The graph with each collapsed group's drawn members folded into one stand-in. */\nfunction foldGroups(graph: CallGraph, visible: VisibleGraph, collapsed: readonly string[], records: ReadonlyMap<string, string>): DrawnGraph {\n  const roots = rootGroups(graph);\n  const folds = new Map<string, GroupFold>();\n  const standInOf = new Map<string, string>();\n  for (const node of visible.nodes) {\n    if (node.group === undefined || roots.has(node.group) || !collapsed.includes(node.group)) continue;\n    const id = standInId(node.group);\n    folds.set(id, { group: node.group, members: [...(folds.get(id)?.members ?? []), node] });\n    standInOf.set(node.id, id);\n  }\n  if (folds.size === 0) return { graph, visible, folds, merged: new Map() };\n  const { edges, merged } = foldEdges(graph.edges, standInOf, new Map(graph.nodes.map((node) => [node.id, node])));\n  const standIns = [...folds].map(([id, fold]) => standInNode(id, fold, graph, records, edges));\n  const nodes = [...visible.nodes.filter((node) => !standInOf.has(node.id)), ...standIns];\n  const drawnIds = new Set(nodes.map((node) => node.id));\n  return {\n    graph: { ...graph, nodes: [...graph.nodes.filter((node) => !standInOf.has(node.id)), ...standIns], edges },\n    visible: { nodes, edges: edges.filter((edge) => drawnIds.has(edge.from) && drawnIds.has(edge.to)) },\n    folds,\n    merged,\n  };\n}\n\nfunction toDiagramGroup({ id, label }: CallGraphGroup, { glyphs, graph, vocabulary }: DiagramInput, drawn: DrawnGraph, records: ReadonlyMap<string, string>, collapsible: ReadonlySet<string> | undefined): DiagramGroup {\n  const fold = drawn.folds.get(standInId(id));\n  return {\n    id, label: glyphs.group(groupCaption(label), records.get(id)), title: label,\n    ...(records.has(id) ? { variant: \"record\" as const } : {}),\n    ...(collapsible?.has(id) ? { collapsed: fold !== undefined } : {}),\n    ...(fold ? { aside: countWords(fold.members, graph, vocabulary) } : {}),\n  };\n}\n\nexport function toDiagram(input: DiagramInput): Diagram {\n  const { graph, visible, options, vocabulary, collapsed } = input;\n  const records = options.grouped ? recordGroups(visible, vocabulary) : new Map<string, string>();\n  const drawn = options.grouped && collapsed ? foldGroups(graph, visible, collapsed, records) : { graph, visible, folds: new Map(), merged: new Map() };\n  const collapsible = options.grouped && collapsed ? new Set(collapsibleGroups(graph, visible)) : undefined;\n  const rank = groupRank(drawn.graph, vocabulary);\n  return {\n    nodes: [...drawn.visible.nodes].sort((a, b) => rank(a) - rank(b)).map((node) => toDiagramNode(node, input, drawn, records)),\n    edges: drawn.visible.edges.map((edge) => toDiagramEdge(edge, input, drawn)),\n    groups: options.grouped ? (graph.groups ?? []).map((group) => toDiagramGroup(group, input, drawn, records, collapsible)) : [],\n    drawn,\n  };\n}\n"],"names":["CALL_GRAPH_ACCESS","types","siteKey","rootGroups","mergeAccess","dataMemberAside","nodeTitle","edgeLabel","edgeTitle","isConditional","isDataMember","DATA_MEMBER_OWNER","edge","groupCaption"],"mappings":";;;;;;AAuBO,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,SAAS,cAAc,WAAW,MAAM,EAAE,WAAW,EAAG,OAAM,IAAI,MAAM,eAAe,IAAI,6BAA6B;AACnI,SAAO,aAAa,OAAO,CAAC,UAAW,UAAU,OAAO,KAAK,OAAO,SAAS,KAAK,CAAE;AACtF;AAGA,MAAM,eAA2C,CAAC,GAAGA,MAAAA,mBAAmB,UAAU;AAG3E,SAAS,WAAW,QAAuD;AAChF,SAAO,OAAO,OAAO,CAAC,SAASA,MAAAA,kBAAkB,SAAS,IAAI,CAAC;AACjE;AA0DO,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,WAAW,OAAkB,MAAsC;AAC1E,QAAM,OAAO,UAAU,IAAI;AAC3B,SAAO,MAAM,MAAM,OAAO,CAAC,UAAU,SAAS,QAAQ,KAAK,OAAO,KAAK,QAAQ,KAAK,EAAE;AACxF;AAoBO,SAAS,YACd,OACA,SACA,QACA,WACA,YACA,SAAyC,oBAAI,OACrC;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,WAAW,OAAO,IAAI,EACrC,OAAO,CAAC,SAAS,MAAM,IAAI,SAAS,QAAQ,KAAK,KAAK,KAAK,IAAI,CAAC,EAChE,OAAO,CAAC,KAAK;;AAAS,oBAAO,YAAO,IAAI,KAAK,EAAE,MAAlB,mBAAqB,QAAQ,WAAU;AAAA,KAAI,CAAC;AAC5E,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,QAAMC,cAAa,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,QAAIA,YAAW,IAAI,KAAK,KAAK,EAAG,QAAO;AACvC,WAAO,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI;AAAA,EACvC;AACF;AAGA,SAAS,WAAW,OAAiC,IAAoC;AACvF,SAAO,MAAM,OAA+B,CAAC,MAAM,SAAU,KAAK,OAAO,OAAO,KAAK,SAAS,UAAU,KAAK,SAAS,WAAWC,WAAAA,YAAY,MAAM,KAAK,IAAI,IAAI,MAAO,MAAS;AAClL;AAEA,SAAS,cAAc,MAAqB,EAAE,WAAW,SAAS,QAAQ,WAAA,GAA4B,OAAmB,SAAmD;;AAC1K,QAAM,EAAE,OAAO,QAAA,IAAY;AAC3B,QAAM,QAAQ,YAAY,OAAO,SAAS,KAAK,IAAI,WAAW,YAAY,MAAM,MAAM;AACtF,QAAM,SAAS,MAAM,MAAM,SAAS,KAAK,EAAE;AAC3C,QAAM,OAAO,SAAS,SAAS,KAAK,aAAa,YAAY;AAE7D,QAAM,UAAW,KAAK,UAAU,UAAa,QAAQ,IAAI,KAAK,KAAK,KAAO,CAAC,UAAU,WAAW,OAAO,IAAI,KAAK,CAAC,WAAW,UAAU,IAAI;AAC1I,QAAM,QAAQC,oBAAAA,gBAAgB,IAAI;AAClC,QAAM,SAAS,OAAO,UAAU,WAAW,QAAQ,OAAO,KAAK,EAAE;AACjE,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,UAAU,SAAY,EAAE,MAAA,IAAU,CAAA;AAAA,IACtC,GAAI,SAAS,EAAE,OAAM,YAAO,WAAP,gCAAgB,QAAM,IAAM,CAAA;AAAA,IACjD,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,YAAY,WAAA,GAA4B,OAAgC;AACrI,QAAM,QAAQ,MAAM,OAAO,IAAI,KAAK,EAAE;AACtC,QAAM,QAAQ,CAACC,gBAAAA,UAAU,MAAM,OAAO,GAAG,SAAS,WAAW,MAAM,SAAS,MAAM,OAAO,UAAU,CAAC,EAAE,OAAO,OAAO,EAAE,KAAK,KAAK,KAAK;AACrI,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,aAAa,SAAuB,YAAsD;;AACxG,QAAM,8BAAc,IAAA;AACpB,aAAW,QAAQ,QAAQ,OAAO;AAChC,QAAI,KAAK,UAAU,OAAW,SAAQ,IAAI,KAAK,OAAO,CAAC,GAAI,QAAQ,IAAI,KAAK,KAAK,KAAK,CAAA,GAAK,IAAI,CAAC;AAAA,EAClG;AACA,QAAM,8BAAc,IAAA;AACpB,aAAW,CAAC,OAAO,KAAK,KAAK,SAAS;AACpC,UAAM,QAAO,WAAM,CAAC,MAAP,mBAAU;AACvB,QAAI,SAAS,UAAa,MAAM,MAAM,CAAC,SAAS,WAAW,OAAO,IAAI,KAAKC,oBAAAA,aAAa,IAAI,KAAK,KAAK,SAAS,IAAI,GAAG;AACpH,YAAM,QAAQC,oBAAAA,kBAAkB,IAAI;AACpC,UAAI,UAAU,OAAW,OAAM,IAAI,MAAM,8CAA8C,IAAI,GAAG;AAC9F,cAAQ,IAAI,OAAO,KAAK;AAAA,IAC1B;AAAA,EACF;AACA,SAAO;AACT;AAuBA,MAAM,kBAAkB;AAGjB,SAAS,UAAU,OAAuB;AAC/C,SAAO,GAAG,eAAe,GAAG,KAAK;AACnC;AAEA,SAAS,WAAW,OAA2C;AAC7D,SAAO,IAAI,IAAI,MAAM,MAAM,IAAI,CAAC,OAAO,YAAY,OAAO,EAAE,EAAE,KAAK,CAAC;AACtE;AAGO,SAAS,kBAAkB,OAAkB,SAAiC;AACnF,QAAM,QAAQ,WAAW,KAAK;AAC9B,SAAO,CAAC,GAAG,IAAI,IAAI,QAAQ,MAAM,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,UAA2B,UAAU,UAAa,CAAC,MAAM,IAAI,KAAK,CAAC;AAC1I;AAGA,SAAS,WAAW,SAAmC,OAAkB,YAAyC;AAChH,QAAM,CAAC,KAAK,IAAI;AAChB,QAAM,OAAO,SAAS,QAAQ,MAAM,CAAC,WAAW,OAAO,SAAS,MAAM,IAAI,IAAI,WAAW,OAAO,OAAO,KAAK,IAAI;AAChH,SAAO,GAAG,QAAQ,MAAM,IAAI,IAAI,GAAG,QAAQ,WAAW,IAAI,KAAK,GAAG;AACpE;AAGA,SAAS,iBAAiB,SAA2D;AACnF,QAAM,OAA+B,EAAE,QAAQ,WAAW,OAAO,SAAA;AACjE,QAAM,4BAAY,IAAA;AAClB,aAAW,UAAU,SAAS;AAC5B,UAAM,MAAM,KAAK,OAAO,IAAI,KAAK;AACjC,UAAM,IAAI,KAAK,CAAC,GAAI,MAAM,IAAI,GAAG,KAAK,CAAA,GAAK,OAAO,KAAK,CAAC;AAAA,EAC1D;AACA,SAAO,OAAO,YAAY,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC;AACnF;AAEA,SAAS,WAAW,IAAY,SAAmC,WAAwC,OAAuE;AAChL,QAAM,CAAC,KAAK,IAAI;AAChB,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,4BAA4B,EAAE,sBAAsB;AAChF,QAAM,YAAY,CAAC,GAAG,IAAI,IAAI,QAAQ,QAAQ,CAACC,UAAS,CAACA,MAAK,MAAMA,MAAK,EAAE,CAAC,EAAE,OAAO,CAAC,QAAQ,UAAU,IAAI,GAAG,CAAC,CAAC,CAAC;AAClH,QAAM,UAAU,UAAU,IAAI,CAAC,WAAW;AACxC,UAAM,OAAO,MAAM,IAAI,MAAM;AAC7B,QAAI,CAAC,KAAM,OAAM,IAAI,MAAM,wBAAwB,MAAM,GAAG;AAC5D,WAAO;AAAA,EACT,CAAC;AACD,QAAM,OAAO,QAAQ,MAAM,CAACA,UAASA,MAAK,SAAS,MAAM,IAAI,IAAI,MAAM,OAAO;AAC9E,QAAM,OAAsB;AAAA,IAC1B;AAAA,IAAI,MAAM,UAAU,IAAI,MAAM,IAAI,KAAK,MAAM;AAAA,IAAM,IAAI,UAAU,IAAI,MAAM,EAAE,KAAK,MAAM;AAAA,IAAI,MAAM,MAAM;AAAA,IACxG,GAAI,SAAS,SAAY,EAAE,KAAA,IAAS,CAAA;AAAA,IACpC,OAAO,cAAc,QAAQ,QAAQ,CAAC,WAAW,OAAO,KAAK,CAAC;AAAA,IAC9D,YAAY,iBAAiB,OAAO;AAAA,EAAA;AAEtC,SAAO,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG,OAAO,GAAG,SAAS;AAClD;AAGA,SAAS,UAAU,OAAiC,WAAwC,OAA2C;AACrI,QAAM,OAAwB,CAAA;AAC9B,QAAM,8BAAc,IAAA;AACpB,aAAW,QAAQ,OAAO;AACxB,UAAM,OAAO,UAAU,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9C,UAAM,KAAK,UAAU,IAAI,KAAK,EAAE,KAAK,KAAK;AAC1C,QAAI,SAAS,KAAK,QAAQ,OAAO,KAAK,GAAI,MAAK,KAAK,IAAI;AAAA,QACnD,SAAQ,IAAI,GAAG,IAAI,IAAI,EAAE,IAAI,KAAK,IAAI,IAAI,CAAC,GAAI,QAAQ,IAAI,GAAG,IAAI,IAAI,EAAE,IAAI,KAAK,IAAI,EAAE,KAAK,CAAA,GAAK,IAAI,CAAC;AAAA,EAC7G;AACA,QAAM,SAAS,IAAI,IAAI,CAAC,GAAG,OAAO,EAAE,IAAI,CAAC,CAAC,IAAI,OAAO,MAAM,WAAW,IAAI,SAAS,WAAW,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,IAAI,EAAE,MAAM,MAAA,CAAO,CAAC,CAAC;AACxJ,SAAO,EAAE,OAAO,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,OAAO,OAAA,CAAQ,EAAE,IAAI,CAAC,EAAE,KAAA,MAAW,IAAI,CAAC,GAAG,QAAQ,IAAI,IAAI,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,MAAA,CAAO,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,EAAA;AAC/I;AAGA,SAAS,YAAY,IAAY,MAAiB,OAAkB,SAAsC,OAAgD;;AACxJ,QAAM,CAAC,OAAO,GAAG,IAAI,IAAI,KAAK;AAC9B,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,gCAAgC,KAAK,KAAK,iBAAiB;AACvF,QAAM,UAAU,KAAK,OAAO,CAAC,MAAM,WAAY,KAAK,IAAI,OAAO,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,SAAS,MAAO,KAAK;AACpH,SAAO;AAAA,IACL;AAAA,IAAI,YAAY,CAAA;AAAA,IAAI,MAAM,QAAQ,IAAI,KAAK,KAAK,KAAK,MAAM;AAAA,IAC3D,SAAO,iBAAM,WAAN,mBAAc,KAAK,CAAC,UAAU,MAAM,OAAO,KAAK,WAAhD,mBAAwD,UAAS,KAAK;AAAA,IAC7E,OAAO,KAAK;AAAA,IAAO,OAAO,QAAQ;AAAA,IAClC,IAAI,MAAM,OAAO,CAAC,SAAS,KAAK,OAAO,EAAE,EAAE;AAAA,IAAQ,KAAK,MAAM,OAAO,CAAC,SAAS,KAAK,SAAS,EAAE,EAAE;AAAA,EAAA;AAErG;AAGA,SAAS,WAAW,OAAkB,SAAuB,WAA8B,SAAkD;;AAC3I,QAAM,QAAQ,WAAW,KAAK;AAC9B,QAAM,4BAAY,IAAA;AAClB,QAAM,gCAAgB,IAAA;AACtB,aAAW,QAAQ,QAAQ,OAAO;AAChC,QAAI,KAAK,UAAU,UAAa,MAAM,IAAI,KAAK,KAAK,KAAK,CAAC,UAAU,SAAS,KAAK,KAAK,EAAG;AAC1F,UAAM,KAAK,UAAU,KAAK,KAAK;AAC/B,UAAM,IAAI,IAAI,EAAE,OAAO,KAAK,OAAO,SAAS,CAAC,KAAI,WAAM,IAAI,EAAE,MAAZ,mBAAe,YAAW,CAAA,GAAK,IAAI,GAAG;AACvF,cAAU,IAAI,KAAK,IAAI,EAAE;AAAA,EAC3B;AACA,MAAI,MAAM,SAAS,EAAG,QAAO,EAAE,OAAO,SAAS,OAAO,QAAQ,oBAAI,MAAI;AACtE,QAAM,EAAE,OAAO,WAAW,UAAU,MAAM,OAAO,WAAW,IAAI,IAAI,MAAM,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC;AAC/G,QAAM,WAAW,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,IAAI,IAAI,MAAM,YAAY,IAAI,MAAM,OAAO,SAAS,KAAK,CAAC;AAC5F,QAAM,QAAQ,CAAC,GAAG,QAAQ,MAAM,OAAO,CAAC,SAAS,CAAC,UAAU,IAAI,KAAK,EAAE,CAAC,GAAG,GAAG,QAAQ;AACtF,QAAM,WAAW,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,KAAK,EAAE,CAAC;AACrD,SAAO;AAAA,IACL,OAAO,EAAE,GAAG,OAAO,OAAO,CAAC,GAAG,MAAM,MAAM,OAAO,CAAC,SAAS,CAAC,UAAU,IAAI,KAAK,EAAE,CAAC,GAAG,GAAG,QAAQ,GAAG,MAAA;AAAA,IACnG,SAAS,EAAE,OAAO,OAAO,MAAM,OAAO,CAAC,SAAS,SAAS,IAAI,KAAK,IAAI,KAAK,SAAS,IAAI,KAAK,EAAE,CAAC,EAAA;AAAA,IAChG;AAAA,IACA;AAAA,EAAA;AAEJ;AAEA,SAAS,eAAe,EAAE,IAAI,MAAA,GAAyB,EAAE,QAAQ,OAAO,WAAA,GAA4B,OAAmB,SAAsC,aAA4D;AACvN,QAAM,OAAO,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;AAC1C,SAAO;AAAA,IACL;AAAA,IAAI,OAAO,OAAO,MAAMC,gBAAAA,aAAa,KAAK,GAAG,QAAQ,IAAI,EAAE,CAAC;AAAA,IAAG,OAAO;AAAA,IACtE,GAAI,QAAQ,IAAI,EAAE,IAAI,EAAE,SAAS,SAAA,IAAsB,CAAA;AAAA,IACvD,IAAI,2CAAa,IAAI,OAAM,EAAE,WAAW,SAAS,OAAA,IAAc,CAAA;AAAA,IAC/D,GAAI,OAAO,EAAE,OAAO,WAAW,KAAK,SAAS,OAAO,UAAU,MAAM,CAAA;AAAA,EAAC;AAEzE;AAEO,SAAS,UAAU,OAA8B;AACtD,QAAM,EAAE,OAAO,SAAS,SAAS,YAAY,cAAc;AAC3D,QAAM,UAAU,QAAQ,UAAU,aAAa,SAAS,UAAU,wBAAQ,IAAA;AAC1E,QAAM,QAAQ,QAAQ,WAAW,YAAY,WAAW,OAAO,SAAS,WAAW,OAAO,IAAI,EAAE,OAAO,SAAS,OAAO,oBAAI,IAAA,GAAO,QAAQ,oBAAI,MAAI;AAClJ,QAAM,cAAc,QAAQ,WAAW,YAAY,IAAI,IAAI,kBAAkB,OAAO,OAAO,CAAC,IAAI;AAChG,QAAM,OAAO,UAAU,MAAM,OAAO,UAAU;AAC9C,SAAO;AAAA,IACL,OAAO,CAAC,GAAG,MAAM,QAAQ,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,cAAc,MAAM,OAAO,OAAO,OAAO,CAAC;AAAA,IAC1H,OAAO,MAAM,QAAQ,MAAM,IAAI,CAAC,SAAS,cAAc,MAAM,OAAO,KAAK,CAAC;AAAA,IAC1E,QAAQ,QAAQ,WAAW,MAAM,UAAU,CAAA,GAAI,IAAI,CAAC,UAAU,eAAe,OAAO,OAAO,OAAO,SAAS,WAAW,CAAC,IAAI,CAAA;AAAA,IAC3H;AAAA,EAAA;AAEJ;;;;;;;;;;;;;;;;;"}

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

@@ -0,0 +1,138 @@
+import { ReactNode } from 'react';
+import { DataAccess } from '../data-access.js';
+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[];
+/** The access types of `access` that are not variables, at least one of which a graph follows. */
+export declare function baseAccess(access: readonly 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;
+    aside?: string;
+};
+export interface Diagram {
+    nodes: DiagramNode[];
+    edges: DiagramEdge[];
+    groups: DiagramGroup[];
+    /** The graph as drawn, collapsed groups folded into their stand-ins: what a selection is looked up in. */
+    drawn: DrawnGraph;
+}
+/** 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, glyph?: string): ReactNode;
+    /** The mark of a node the reads and writes into it access; without it no node is marked. */
+    access?(access: DataAccess): ReactNode;
+}
+export interface DiagramInput {
+    graph: CallGraph;
+    visible: VisibleGraph;
+    direction: CallGraphDirection;
+    options: DiagramOptions;
+    glyphs: DiagramGlyphs;
+    vocabulary: CallGraphVocabulary;
+    edgeLabels: CallGraphEdgeLabels;
+    /**
+     * The groups drawn as their header alone, by id: each folds into one stand-in node, and its members'
+     * edges merge onto it. The root's group never folds. Leave it out and no group can collapse.
+     */
+    collapsed?: readonly string[];
+}
+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 merged edge counting
+ * every edge it stands for. 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">, merged?: ReadonlyMap<string, EdgeMerge>): 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 recordGroups(visible: VisibleGraph, vocabulary: CallGraphVocabulary): Map<string, string>;
+/** A collapsed group's members, and the stand-in node drawn for them. */
+export interface GroupFold {
+    group: string;
+    members: CallGraphNode[];
+}
+/** One edge drawn for the edges of several members: the edges it stands for and the members at their ends. */
+export interface EdgeMerge {
+    sources: CallGraphEdge[];
+    members: CallGraphNode[];
+}
+export interface DrawnGraph {
+    graph: CallGraph;
+    visible: VisibleGraph;
+    /** By stand-in id. */
+    folds: ReadonlyMap<string, GroupFold>;
+    /** By the id of the edge drawn for them. */
+    merged: ReadonlyMap<string, EdgeMerge>;
+}
+/** The id of the node a collapsed group is drawn as. */
+export declare function standInId(group: string): string;
+/** The groups that hold a drawn node and can collapse: every one but the root's, in first-drawn order. */
+export declare function collapsibleGroups(graph: CallGraph, visible: VisibleGraph): string[];
+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,EAAe,KAAK,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC9D,OAAO,KAAK,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AACpG,OAAO,EAAqD,KAAK,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAC1G,OAAO,EAAwE,KAAK,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AACzI,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;AAKD,kGAAkG;AAClG,wBAAgB,UAAU,CAAC,MAAM,EAAE,SAAS,eAAe,EAAE,GAAG,eAAe,EAAE,CAEhF;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,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC;AAEjF,MAAM,WAAW,OAAO;IACtB,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,MAAM,EAAE,YAAY,EAAE,CAAC;IACvB,0GAA0G;IAC1G,KAAK,EAAE,UAAU,CAAC;CACnB;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,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAClD,4FAA4F;IAC5F,MAAM,CAAC,CAAC,MAAM,EAAE,UAAU,GAAG,SAAS,CAAC;CACxC;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;IAChC;;;OAGG;IACH,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC/B;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;AAcD,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,EAClD,MAAM,GAAE,WAAW,CAAC,MAAM,EAAE,SAAS,CAAa,GACjD,MAAM,CASR;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;AAoED;;;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,YAAY,CAAC,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,mBAAmB,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAexG;AAED,yEAAyE;AACzE,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,aAAa,EAAE,CAAC;CAC1B;AAED,8GAA8G;AAC9G,MAAM,WAAW,SAAS;IACxB,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB,OAAO,EAAE,aAAa,EAAE,CAAC;CAC1B;AAED,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,SAAS,CAAC;IACjB,OAAO,EAAE,YAAY,CAAC;IACtB,sBAAsB;IACtB,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACtC,4CAA4C;IAC5C,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;CACxC;AAID,wDAAwD;AACxD,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE/C;AAMD,0GAA0G;AAC1G,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY,GAAG,MAAM,EAAE,CAGnF;AAoGD,wBAAgB,SAAS,CAAC,KAAK,EAAE,YAAY,GAAG,OAAO,CAYtD"}