@flanksource/clicky-ui 0.3.43 → 0.3.45

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

@@ -0,0 +1,31 @@
+import { CallGraph, CallGraphGroupFact } from './types.js';
+export declare const EXCLUDE_EXTERNAL = "external";
+/** The URL token for "exclude nothing", since an empty URL value stands for the host's defaults. */
+export declare const EXCLUDE_NONE = "none";
+/** Whether one pattern excludes the group. */
+export type ExcludeMatcher = (pattern: string, group: CallGraphGroupFact) => boolean;
+export declare const matchesExclude: ExcludeMatcher;
+/** A URL value as patterns: empty is undefined, the host's defaults; `none` is no patterns. */
+export declare function parseExclude(text: string): string[] | undefined;
+/** The URL value for these patterns: undefined (the defaults) is empty, and no patterns is `none`. */
+export declare function formatExclude(patterns: readonly string[] | undefined): string;
+/** Excludes one group by its exact name. */
+export declare function excludeGroup(patterns: readonly string[], name: string): string[];
+/**
+ * Brings a group back. Every pattern that excludes it goes; a keyword or a /... pattern that also
+ * covered other reached groups is replaced by their exact names, so they stay excluded.
+ */
+export declare function includeGroup(patterns: readonly string[], target: CallGraphGroupFact, groups: readonly CallGraphGroupFact[], matches?: ExcludeMatcher): string[];
+/** Adds or removes the `external` keyword behind "Hide all external". */
+export declare function setExternalHidden(patterns: readonly string[], hidden: boolean): string[];
+/** Why a typed pattern cannot be added, or undefined when it can. The host checks the name itself. */
+export declare function excludePatternError(patterns: readonly string[], pattern: string): string | undefined;
+export declare function addExcludePattern(patterns: readonly string[], pattern: string): string[];
+export declare function removeExcludePattern(patterns: readonly string[], pattern: string): string[];
+/**
+ * The groups a graph reached, for a host whose responses carry no group facts of their own: each
+ * drawn group with its node count, and each group `omitted.excluded` tallies, which is excluded when
+ * none of its nodes is drawn.
+ */
+export declare function callGraphGroupFacts(graph: CallGraph): CallGraphGroupFact[];
+//# sourceMappingURL=call-graph-exclude.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"call-graph-exclude.d.ts","sourceRoot":"","sources":["../../../src/data/call-graph/call-graph-exclude.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,SAAS,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AAE7D,eAAO,MAAM,gBAAgB,aAAa,CAAC;AAC3C,oGAAoG;AACpG,eAAO,MAAM,YAAY,SAAS,CAAC;AAEnC,8CAA8C;AAC9C,MAAM,MAAM,cAAc,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,kBAAkB,KAAK,OAAO,CAAC;AAErF,eAAO,MAAM,cAAc,EAAE,cAO5B,CAAC;AAEF,+FAA+F;AAC/F,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,SAAS,CAG/D;AAED,sGAAsG;AACtG,wBAAgB,aAAa,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,GAAG,MAAM,CAG7E;AAED,4CAA4C;AAC5C,wBAAgB,YAAY,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAEhF;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAC1B,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,MAAM,EAAE,kBAAkB,EAC1B,MAAM,EAAE,SAAS,kBAAkB,EAAE,EACrC,OAAO,GAAE,cAA+B,GACvC,MAAM,EAAE,CAUV;AAED,yEAAyE;AACzE,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM,EAAE,CAGxF;AAED,sGAAsG;AACtG,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAMpG;AAED,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,CAExF;AAED,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,CAE3F;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,SAAS,GAAG,kBAAkB,EAAE,CAU1E"}

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

@@ -0,0 +1,75 @@
+const EXCLUDE_EXTERNAL = "external";
+const EXCLUDE_NONE = "none";
+const matchesExclude = (pattern, group) => {
+  if (pattern === EXCLUDE_EXTERNAL) return group.external === true;
+  if (pattern.endsWith("/...")) {
+    const base = pattern.slice(0, -"/...".length);
+    return group.name === base || group.name.startsWith(`${base}/`);
+  }
+  return group.name === pattern;
+};
+function parseExclude(text) {
+  if (text === "") return void 0;
+  return text === EXCLUDE_NONE ? [] : text.split(",");
+}
+function formatExclude(patterns) {
+  if (patterns === void 0) return "";
+  return patterns.length === 0 ? EXCLUDE_NONE : patterns.join(",");
+}
+function excludeGroup(patterns, name) {
+  return [...patterns, name];
+}
+function includeGroup(patterns, target, groups, matches = matchesExclude) {
+  if (!target.excluded) throw new Error(`Group ${target.name} is not excluded`);
+  const covering = patterns.filter((pattern) => matches(pattern, target));
+  if (covering.length === 0) throw new Error(`Group ${target.name} is reported excluded, but none of ${patterns.join(", ")} matches it`);
+  const rest = patterns.filter((pattern) => !covering.includes(pattern));
+  const replacements = groups.filter(
+    (group) => group.name !== target.name && covering.some((pattern) => matches(pattern, group)) && !rest.some((pattern) => matches(pattern, group))
+  );
+  return [...rest, ...replacements.map((group) => group.name)];
+}
+function setExternalHidden(patterns, hidden) {
+  const others = patterns.filter((pattern) => pattern !== EXCLUDE_EXTERNAL);
+  return hidden ? [...others, EXCLUDE_EXTERNAL] : others;
+}
+function excludePatternError(patterns, pattern) {
+  if (pattern === "") return "Enter a name or a name ending in /...";
+  if (/[\s,]/.test(pattern)) return `One pattern at a time: ${pattern} has a comma or a space`;
+  if (pattern === EXCLUDE_NONE) return "Use Show all to exclude nothing";
+  if (patterns.includes(pattern)) return `${pattern} is already excluded`;
+  return void 0;
+}
+function addExcludePattern(patterns, pattern) {
+  return [...patterns, pattern];
+}
+function removeExcludePattern(patterns, pattern) {
+  return patterns.filter((candidate) => candidate !== pattern);
+}
+function callGraphGroupFacts(graph) {
+  const drawn = /* @__PURE__ */ new Map();
+  for (const node of graph.nodes) if (node.group !== void 0) drawn.set(node.group, (drawn.get(node.group) ?? 0) + 1);
+  const excluded = graph.omitted.excluded ?? {};
+  const names = [.../* @__PURE__ */ new Set([...drawn.keys(), ...Object.keys(excluded)])];
+  return names.map((name) => {
+    var _a, _b;
+    const label = (_b = (_a = graph.groups) == null ? void 0 : _a.find((group) => group.id === name)) == null ? void 0 : _b.label;
+    const shown = drawn.get(name) ?? 0;
+    return { name, ...label !== void 0 && label !== name ? { label } : {}, nodes: shown + (excluded[name] ?? 0), excluded: shown === 0 };
+  });
+}
+export {
+  EXCLUDE_EXTERNAL,
+  EXCLUDE_NONE,
+  addExcludePattern,
+  callGraphGroupFacts,
+  excludeGroup,
+  excludePatternError,
+  formatExclude,
+  includeGroup,
+  matchesExclude,
+  parseExclude,
+  removeExcludePattern,
+  setExternalHidden
+};
+//# sourceMappingURL=call-graph-exclude.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"call-graph-exclude.js","sources":["../../../src/data/call-graph/call-graph-exclude.ts"],"sourcesContent":["// Editing the call graph's group exclusions. A pattern is a group name, a name ending in /... (that\n// group and every group below it), or `external` (every group outside the indexed scope). A host\n// whose source knows more keywords passes a matcher that understands them and falls back to this one.\n// No patterns excludes nothing; the host's defaults are asked for with `undefined`, never with [].\nimport type { CallGraph, CallGraphGroupFact } from \"./types\";\n\nexport const EXCLUDE_EXTERNAL = \"external\";\n/** The URL token for \"exclude nothing\", since an empty URL value stands for the host's defaults. */\nexport const EXCLUDE_NONE = \"none\";\n\n/** Whether one pattern excludes the group. */\nexport type ExcludeMatcher = (pattern: string, group: CallGraphGroupFact) => boolean;\n\nexport const matchesExclude: ExcludeMatcher = (pattern, group) => {\n  if (pattern === EXCLUDE_EXTERNAL) return group.external === true;\n  if (pattern.endsWith(\"/...\")) {\n    const base = pattern.slice(0, -\"/...\".length);\n    return group.name === base || group.name.startsWith(`${base}/`);\n  }\n  return group.name === pattern;\n};\n\n/** A URL value as patterns: empty is undefined, the host's defaults; `none` is no patterns. */\nexport function parseExclude(text: string): string[] | undefined {\n  if (text === \"\") return undefined;\n  return text === EXCLUDE_NONE ? [] : text.split(\",\");\n}\n\n/** The URL value for these patterns: undefined (the defaults) is empty, and no patterns is `none`. */\nexport function formatExclude(patterns: readonly string[] | undefined): string {\n  if (patterns === undefined) return \"\";\n  return patterns.length === 0 ? EXCLUDE_NONE : patterns.join(\",\");\n}\n\n/** Excludes one group by its exact name. */\nexport function excludeGroup(patterns: readonly string[], name: string): string[] {\n  return [...patterns, name];\n}\n\n/**\n * Brings a group back. Every pattern that excludes it goes; a keyword or a /... pattern that also\n * covered other reached groups is replaced by their exact names, so they stay excluded.\n */\nexport function includeGroup(\n  patterns: readonly string[],\n  target: CallGraphGroupFact,\n  groups: readonly CallGraphGroupFact[],\n  matches: ExcludeMatcher = matchesExclude,\n): string[] {\n  if (!target.excluded) throw new Error(`Group ${target.name} is not excluded`);\n  const covering = patterns.filter((pattern) => matches(pattern, target));\n  if (covering.length === 0) throw new Error(`Group ${target.name} is reported excluded, but none of ${patterns.join(\", \")} matches it`);\n  const rest = patterns.filter((pattern) => !covering.includes(pattern));\n  const replacements = groups.filter(\n    (group) =>\n      group.name !== target.name && covering.some((pattern) => matches(pattern, group)) && !rest.some((pattern) => matches(pattern, group)),\n  );\n  return [...rest, ...replacements.map((group) => group.name)];\n}\n\n/** Adds or removes the `external` keyword behind \"Hide all external\". */\nexport function setExternalHidden(patterns: readonly string[], hidden: boolean): string[] {\n  const others = patterns.filter((pattern) => pattern !== EXCLUDE_EXTERNAL);\n  return hidden ? [...others, EXCLUDE_EXTERNAL] : others;\n}\n\n/** Why a typed pattern cannot be added, or undefined when it can. The host checks the name itself. */\nexport function excludePatternError(patterns: readonly string[], pattern: string): string | undefined {\n  if (pattern === \"\") return \"Enter a name or a name ending in /...\";\n  if (/[\\s,]/.test(pattern)) return `One pattern at a time: ${pattern} has a comma or a space`;\n  if (pattern === EXCLUDE_NONE) return \"Use Show all to exclude nothing\";\n  if (patterns.includes(pattern)) return `${pattern} is already excluded`;\n  return undefined;\n}\n\nexport function addExcludePattern(patterns: readonly string[], pattern: string): string[] {\n  return [...patterns, pattern];\n}\n\nexport function removeExcludePattern(patterns: readonly string[], pattern: string): string[] {\n  return patterns.filter((candidate) => candidate !== pattern);\n}\n\n/**\n * The groups a graph reached, for a host whose responses carry no group facts of their own: each\n * drawn group with its node count, and each group `omitted.excluded` tallies, which is excluded when\n * none of its nodes is drawn.\n */\nexport function callGraphGroupFacts(graph: CallGraph): CallGraphGroupFact[] {\n  const drawn = new Map<string, number>();\n  for (const node of graph.nodes) if (node.group !== undefined) drawn.set(node.group, (drawn.get(node.group) ?? 0) + 1);\n  const excluded = graph.omitted.excluded ?? {};\n  const names = [...new Set([...drawn.keys(), ...Object.keys(excluded)])];\n  return names.map((name) => {\n    const label = graph.groups?.find((group) => group.id === name)?.label;\n    const shown = drawn.get(name) ?? 0;\n    return { name, ...(label !== undefined && label !== name ? { label } : {}), nodes: shown + (excluded[name] ?? 0), excluded: shown === 0 };\n  });\n}\n"],"names":[],"mappings":"AAMO,MAAM,mBAAmB;AAEzB,MAAM,eAAe;AAKrB,MAAM,iBAAiC,CAAC,SAAS,UAAU;AAChE,MAAI,YAAY,iBAAkB,QAAO,MAAM,aAAa;AAC5D,MAAI,QAAQ,SAAS,MAAM,GAAG;AAC5B,UAAM,OAAO,QAAQ,MAAM,GAAG,CAAC,OAAO,MAAM;AAC5C,WAAO,MAAM,SAAS,QAAQ,MAAM,KAAK,WAAW,GAAG,IAAI,GAAG;AAAA,EAChE;AACA,SAAO,MAAM,SAAS;AACxB;AAGO,SAAS,aAAa,MAAoC;AAC/D,MAAI,SAAS,GAAI,QAAO;AACxB,SAAO,SAAS,eAAe,CAAA,IAAK,KAAK,MAAM,GAAG;AACpD;AAGO,SAAS,cAAc,UAAiD;AAC7E,MAAI,aAAa,OAAW,QAAO;AACnC,SAAO,SAAS,WAAW,IAAI,eAAe,SAAS,KAAK,GAAG;AACjE;AAGO,SAAS,aAAa,UAA6B,MAAwB;AAChF,SAAO,CAAC,GAAG,UAAU,IAAI;AAC3B;AAMO,SAAS,aACd,UACA,QACA,QACA,UAA0B,gBAChB;AACV,MAAI,CAAC,OAAO,SAAU,OAAM,IAAI,MAAM,SAAS,OAAO,IAAI,kBAAkB;AAC5E,QAAM,WAAW,SAAS,OAAO,CAAC,YAAY,QAAQ,SAAS,MAAM,CAAC;AACtE,MAAI,SAAS,WAAW,EAAG,OAAM,IAAI,MAAM,SAAS,OAAO,IAAI,sCAAsC,SAAS,KAAK,IAAI,CAAC,aAAa;AACrI,QAAM,OAAO,SAAS,OAAO,CAAC,YAAY,CAAC,SAAS,SAAS,OAAO,CAAC;AACrE,QAAM,eAAe,OAAO;AAAA,IAC1B,CAAC,UACC,MAAM,SAAS,OAAO,QAAQ,SAAS,KAAK,CAAC,YAAY,QAAQ,SAAS,KAAK,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,YAAY,QAAQ,SAAS,KAAK,CAAC;AAAA,EAAA;AAExI,SAAO,CAAC,GAAG,MAAM,GAAG,aAAa,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC;AAC7D;AAGO,SAAS,kBAAkB,UAA6B,QAA2B;AACxF,QAAM,SAAS,SAAS,OAAO,CAAC,YAAY,YAAY,gBAAgB;AACxE,SAAO,SAAS,CAAC,GAAG,QAAQ,gBAAgB,IAAI;AAClD;AAGO,SAAS,oBAAoB,UAA6B,SAAqC;AACpG,MAAI,YAAY,GAAI,QAAO;AAC3B,MAAI,QAAQ,KAAK,OAAO,EAAG,QAAO,0BAA0B,OAAO;AACnE,MAAI,YAAY,aAAc,QAAO;AACrC,MAAI,SAAS,SAAS,OAAO,EAAG,QAAO,GAAG,OAAO;AACjD,SAAO;AACT;AAEO,SAAS,kBAAkB,UAA6B,SAA2B;AACxF,SAAO,CAAC,GAAG,UAAU,OAAO;AAC9B;AAEO,SAAS,qBAAqB,UAA6B,SAA2B;AAC3F,SAAO,SAAS,OAAO,CAAC,cAAc,cAAc,OAAO;AAC7D;AAOO,SAAS,oBAAoB,OAAwC;AAC1E,QAAM,4BAAY,IAAA;AAClB,aAAW,QAAQ,MAAM,MAAO,KAAI,KAAK,UAAU,OAAW,OAAM,IAAI,KAAK,QAAQ,MAAM,IAAI,KAAK,KAAK,KAAK,KAAK,CAAC;AACpH,QAAM,WAAW,MAAM,QAAQ,YAAY,CAAA;AAC3C,QAAM,QAAQ,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAG,MAAM,KAAA,GAAQ,GAAG,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC;AACtE,SAAO,MAAM,IAAI,CAAC,SAAS;AAvFtB;AAwFH,UAAM,SAAQ,iBAAM,WAAN,mBAAc,KAAK,CAAC,UAAU,MAAM,OAAO,UAA3C,mBAAkD;AAChE,UAAM,QAAQ,MAAM,IAAI,IAAI,KAAK;AACjC,WAAO,EAAE,MAAM,GAAI,UAAU,UAAa,UAAU,OAAO,EAAE,UAAU,CAAA,GAAK,OAAO,SAAS,SAAS,IAAI,KAAK,IAAI,UAAU,UAAU,EAAA;AAAA,EACxI,CAAC;AACH;"}

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

@@ -0,0 +1,96 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const EDGE_ICON_CHARS = 3;
+function capitalize(text) {
+  return text.charAt(0).toUpperCase() + text.slice(1);
+}
+function counted(count, one, many) {
+  return `${count} ${count === 1 ? one : many}`;
+}
+function excludedTally(omitted) {
+  return Object.entries(omitted.excluded ?? {}).map(([group, count]) => ({ group, count })).sort((a, b) => b.count - a.count || a.group.localeCompare(b.group));
+}
+function omittedParts(omitted) {
+  var _a;
+  const unreadable = ((_a = omitted.unreadable_source) == null ? void 0 : _a.length) ?? 0;
+  const excluded = excludedTally(omitted).reduce((total, { count }) => total + count, 0);
+  return [
+    omitted.node_limit ? "node limit reached" : "",
+    omitted.beyond_depth ? `${omitted.beyond_depth} beyond depth` : "",
+    omitted.unresolved ? `${omitted.unresolved} unresolved` : "",
+    unreadable > 0 ? counted(unreadable, "unreadable file", "unreadable files") : "",
+    excluded > 0 ? `${excluded} excluded` : ""
+  ].filter(Boolean);
+}
+function groupCaption(label) {
+  return label.split("/").slice(-2).join("/");
+}
+function guardsOf(site) {
+  return site.guards ?? [];
+}
+function isConditional(edge) {
+  return edge.sites.length > 0 && edge.sites.every((site) => guardsOf(site).length > 0);
+}
+function truncate(text, max) {
+  return text.length <= max ? text : `${text.slice(0, max - 1).trimEnd()}…`;
+}
+function guardCount(edge) {
+  const counts = edge.sites.map((site) => guardsOf(site).length);
+  const least = Math.min(...counts);
+  const most = Math.max(...counts);
+  if (least === most) return `${most} ${most === 1 ? "guard" : "guards"}`;
+  return `${least}–${most} guards`;
+}
+function guardText(edge, { guardLabel, truncateAt }) {
+  if (!isConditional(edge) || guardLabel === "none") return "";
+  if (guardLabel === "count") return guardCount(edge);
+  const chosen = new Set(edge.sites.map((site) => guardsOf(site).at(guardLabel === "innermost" ? -1 : 0)));
+  const [only] = chosen;
+  if (chosen.size > 1 || only === void 0) return `${chosen.size} conditions`;
+  return truncate(only, truncateAt - (edge.type === "call" ? 0 : EDGE_ICON_CHARS));
+}
+function edgeLabel(edge, options) {
+  const text = [guardText(edge, options), edge.sites.length > 1 ? `×${edge.sites.length}` : ""].filter(Boolean).join(" ");
+  return text === "" ? void 0 : text;
+}
+function memberChips(properties) {
+  const { columns, fields, ...rest } = properties ?? {};
+  const split = (members) => (members ?? "").split(",").map((member) => member.trim()).filter(Boolean);
+  return { columns: split(columns), fields: split(fields), rest };
+}
+function memberAccess(edges) {
+  const members = /* @__PURE__ */ new Map();
+  for (const edge of edges) {
+    if (edge.type !== "read" && edge.type !== "write") continue;
+    const { columns, fields } = memberChips(edge.properties);
+    const touched = [...columns.map((name) => ({ name, kind: "column" })), ...fields.map((name) => ({ name, kind: "field" }))];
+    for (const { name, kind } of touched) {
+      const key = `${kind}:${name}`;
+      const held = members.get(key);
+      members.set(key, { name, kind, access: held && held.access !== edge.type ? "both" : edge.type });
+    }
+  }
+  return [...members.values()];
+}
+function propertyLines(properties) {
+  return Object.entries(properties ?? {}).sort(([a], [b]) => a.localeCompare(b)).map(([key, value]) => `${key}: ${value}`);
+}
+function edgeTitle(edge) {
+  const chains = new Set(
+    edge.sites.map(guardsOf).filter((guards) => guards.length > 0).map((guards) => guards.join(" ∧ "))
+  );
+  const lines = [...chains, ...propertyLines(edge.properties)];
+  return lines.length === 0 ? void 0 : lines.join("\n");
+}
+exports.capitalize = capitalize;
+exports.edgeLabel = edgeLabel;
+exports.edgeTitle = edgeTitle;
+exports.excludedTally = excludedTally;
+exports.groupCaption = groupCaption;
+exports.isConditional = isConditional;
+exports.memberAccess = memberAccess;
+exports.memberChips = memberChips;
+exports.omittedParts = omittedParts;
+exports.propertyLines = propertyLines;
+exports.truncate = truncate;
+//# sourceMappingURL=call-graph-labels.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"call-graph-labels.cjs","sources":["../../../src/data/call-graph/call-graph-labels.ts"],"sourcesContent":["// What the call graph says about an edge, a group and what it left out, as text: pill labels,\n// tooltips, chips. Pure, with no React and no layout; call-graph-model.ts maps it onto the diagram.\nimport type { CallGraphEdge, CallGraphOmitted, CallGraphSite } from \"./types\";\n\n/** The room an edge type's icon (every type but a plain call has one) takes in a pill, in characters of guard text. */\nconst EDGE_ICON_CHARS = 3;\n\nexport function capitalize(text: string): string {\n  return text.charAt(0).toUpperCase() + text.slice(1);\n}\n\nfunction counted(count: number, one: string, many: string): string {\n  return `${count} ${count === 1 ? one : many}`;\n}\n\n/** The excluded nodes per group, most first, then by name. */\nexport function excludedTally(omitted: CallGraphOmitted): { group: string; count: number }[] {\n  return Object.entries(omitted.excluded ?? {})\n    .map(([group, count]) => ({ group, count }))\n    .sort((a, b) => b.count - a.count || a.group.localeCompare(b.group));\n}\n\n/** The omitted chip's parts: what the response left out, with the excluded nodes as one total. */\nexport function omittedParts(omitted: CallGraphOmitted): string[] {\n  const unreadable = omitted.unreadable_source?.length ?? 0;\n  const excluded = excludedTally(omitted).reduce((total, { count }) => total + count, 0);\n  return [\n    omitted.node_limit ? \"node limit reached\" : \"\",\n    omitted.beyond_depth ? `${omitted.beyond_depth} beyond depth` : \"\",\n    omitted.unresolved ? `${omitted.unresolved} unresolved` : \"\",\n    unreadable > 0 ? counted(unreadable, \"unreadable file\", \"unreadable files\") : \"\",\n    excluded > 0 ? `${excluded} excluded` : \"\",\n  ].filter(Boolean);\n}\n\n/** A group box caption: a path's last two segments. The full label is the caption's tooltip. */\nexport function groupCaption(label: string): string {\n  return label.split(\"/\").slice(-2).join(\"/\");\n}\n\n/** Which of a site's nested guards the pill shows, how many there are, or none: the tooltip still names them. */\nexport type GuardLabel = \"innermost\" | \"outermost\" | \"count\" | \"none\";\n\nexport interface PillOptions {\n  guardLabel: GuardLabel;\n  /** Longest guard text a pill shows before it is cut with an ellipsis. */\n  truncateAt: number;\n}\n\nfunction guardsOf(site: CallGraphSite): string[] {\n  return site.guards ?? [];\n}\n\n/** An edge is conditional when no call site behind it can be reached unguarded. */\nexport function isConditional(edge: Pick<CallGraphEdge, \"sites\">): boolean {\n  return edge.sites.length > 0 && edge.sites.every((site) => guardsOf(site).length > 0);\n}\n\nexport function truncate(text: string, max: number): string {\n  return text.length <= max ? text : `${text.slice(0, max - 1).trimEnd()}…`;\n}\n\nfunction guardCount(edge: CallGraphEdge): string {\n  const counts = edge.sites.map((site) => guardsOf(site).length);\n  const least = Math.min(...counts);\n  const most = Math.max(...counts);\n  if (least === most) return `${most} ${most === 1 ? \"guard\" : \"guards\"}`;\n  return `${least}–${most} guards`;\n}\n\n/** The guard a conditional edge's sites share, or how many different ones they have. */\nfunction guardText(edge: CallGraphEdge, { guardLabel, truncateAt }: PillOptions): string {\n  if (!isConditional(edge) || guardLabel === \"none\") return \"\";\n  if (guardLabel === \"count\") return guardCount(edge);\n  const chosen = new Set(edge.sites.map((site) => guardsOf(site).at(guardLabel === \"innermost\" ? -1 : 0)));\n  const [only] = chosen;\n  if (chosen.size > 1 || only === undefined) return `${chosen.size} conditions`;\n  return truncate(only, truncateAt - (edge.type === \"call\" ? 0 : EDGE_ICON_CHARS));\n}\n\n/**\n * The pill's text: the guard the edge's call sites share, then `×N` when there are several sites.\n * Sites with different guards show how many conditions there are instead of one of them, which would\n * read as if it covered every site. A dispatch edge's guard is cut shorter by the room its icon takes.\n */\nexport function edgeLabel(edge: CallGraphEdge, options: PillOptions): string | undefined {\n  const text = [guardText(edge, options), edge.sites.length > 1 ? `×${edge.sites.length}` : \"\"].filter(Boolean).join(\" \");\n  return text === \"\" ? undefined : text;\n}\n\n/** The columns and fields a collapsed read or write touches, apart from the edge's other properties. */\nexport function memberChips(properties: Record<string, string> | undefined): { columns: string[]; fields: string[]; rest: Record<string, string> } {\n  const { columns, fields, ...rest } = properties ?? {};\n  const split = (members: string | undefined) => (members ?? \"\").split(\",\").map((member) => member.trim()).filter(Boolean);\n  return { columns: split(columns), fields: split(fields), rest };\n}\n\nexport type MemberAccessKind = \"read\" | \"write\" | \"both\";\n\n/** A column or field a collapsed read or write touches, and whether it is read, written or both. */\nexport interface MemberAccess {\n  name: string;\n  kind: \"column\" | \"field\";\n  access: MemberAccessKind;\n}\n\n/**\n * The columns and fields the reads and writes among `edges` touch, each once in first-seen order,\n * marked \"both\" when a read and a write both touch it. Other edges are passed over.\n */\nexport function memberAccess(edges: readonly CallGraphEdge[]): MemberAccess[] {\n  const members = new Map<string, MemberAccess>();\n  for (const edge of edges) {\n    if (edge.type !== \"read\" && edge.type !== \"write\") continue;\n    const { columns, fields } = memberChips(edge.properties);\n    const touched = [...columns.map((name) => ({ name, kind: \"column\" as const })), ...fields.map((name) => ({ name, kind: \"field\" as const }))];\n    for (const { name, kind } of touched) {\n      const key = `${kind}:${name}`;\n      const held = members.get(key);\n      members.set(key, { name, kind, access: held && held.access !== edge.type ? \"both\" : edge.type });\n    }\n  }\n  return [...members.values()];\n}\n\n/** The edge's properties as `key: value` lines, in key order. */\nexport function propertyLines(properties: Record<string, string> | undefined): string[] {\n  return Object.entries(properties ?? {})\n    .sort(([a], [b]) => a.localeCompare(b))\n    .map(([key, value]) => `${key}: ${value}`);\n}\n\n/**\n * The edge's tooltip: one line per distinct guard chain behind it, outermost first and joined with ∧,\n * then its properties.\n */\nexport function edgeTitle(edge: CallGraphEdge): string | undefined {\n  const chains = new Set(\n    edge.sites\n      .map(guardsOf)\n      .filter((guards) => guards.length > 0)\n      .map((guards) => guards.join(\" ∧ \")),\n  );\n  const lines = [...chains, ...propertyLines(edge.properties)];\n  return lines.length === 0 ? undefined : lines.join(\"\\n\");\n}\n"],"names":[],"mappings":";;AAKA,MAAM,kBAAkB;AAEjB,SAAS,WAAW,MAAsB;AAC/C,SAAO,KAAK,OAAO,CAAC,EAAE,gBAAgB,KAAK,MAAM,CAAC;AACpD;AAEA,SAAS,QAAQ,OAAe,KAAa,MAAsB;AACjE,SAAO,GAAG,KAAK,IAAI,UAAU,IAAI,MAAM,IAAI;AAC7C;AAGO,SAAS,cAAc,SAA+D;AAC3F,SAAO,OAAO,QAAQ,QAAQ,YAAY,CAAA,CAAE,EACzC,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,EAAE,OAAO,MAAA,EAAQ,EAC1C,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,EAAE,KAAK,CAAC;AACvE;AAGO,SAAS,aAAa,SAAqC;;AAChE,QAAM,eAAa,aAAQ,sBAAR,mBAA2B,WAAU;AACxD,QAAM,WAAW,cAAc,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,MAAA,MAAY,QAAQ,OAAO,CAAC;AACrF,SAAO;AAAA,IACL,QAAQ,aAAa,uBAAuB;AAAA,IAC5C,QAAQ,eAAe,GAAG,QAAQ,YAAY,kBAAkB;AAAA,IAChE,QAAQ,aAAa,GAAG,QAAQ,UAAU,gBAAgB;AAAA,IAC1D,aAAa,IAAI,QAAQ,YAAY,mBAAmB,kBAAkB,IAAI;AAAA,IAC9E,WAAW,IAAI,GAAG,QAAQ,cAAc;AAAA,EAAA,EACxC,OAAO,OAAO;AAClB;AAGO,SAAS,aAAa,OAAuB;AAClD,SAAO,MAAM,MAAM,GAAG,EAAE,MAAM,EAAE,EAAE,KAAK,GAAG;AAC5C;AAWA,SAAS,SAAS,MAA+B;AAC/C,SAAO,KAAK,UAAU,CAAA;AACxB;AAGO,SAAS,cAAc,MAA6C;AACzE,SAAO,KAAK,MAAM,SAAS,KAAK,KAAK,MAAM,MAAM,CAAC,SAAS,SAAS,IAAI,EAAE,SAAS,CAAC;AACtF;AAEO,SAAS,SAAS,MAAc,KAAqB;AAC1D,SAAO,KAAK,UAAU,MAAM,OAAO,GAAG,KAAK,MAAM,GAAG,MAAM,CAAC,EAAE,QAAA,CAAS;AACxE;AAEA,SAAS,WAAW,MAA6B;AAC/C,QAAM,SAAS,KAAK,MAAM,IAAI,CAAC,SAAS,SAAS,IAAI,EAAE,MAAM;AAC7D,QAAM,QAAQ,KAAK,IAAI,GAAG,MAAM;AAChC,QAAM,OAAO,KAAK,IAAI,GAAG,MAAM;AAC/B,MAAI,UAAU,KAAM,QAAO,GAAG,IAAI,IAAI,SAAS,IAAI,UAAU,QAAQ;AACrE,SAAO,GAAG,KAAK,IAAI,IAAI;AACzB;AAGA,SAAS,UAAU,MAAqB,EAAE,YAAY,cAAmC;AACvF,MAAI,CAAC,cAAc,IAAI,KAAK,eAAe,OAAQ,QAAO;AAC1D,MAAI,eAAe,QAAS,QAAO,WAAW,IAAI;AAClD,QAAM,SAAS,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC,SAAS,SAAS,IAAI,EAAE,GAAG,eAAe,cAAc,KAAK,CAAC,CAAC,CAAC;AACvG,QAAM,CAAC,IAAI,IAAI;AACf,MAAI,OAAO,OAAO,KAAK,SAAS,OAAW,QAAO,GAAG,OAAO,IAAI;AAChE,SAAO,SAAS,MAAM,cAAc,KAAK,SAAS,SAAS,IAAI,gBAAgB;AACjF;AAOO,SAAS,UAAU,MAAqB,SAA0C;AACvF,QAAM,OAAO,CAAC,UAAU,MAAM,OAAO,GAAG,KAAK,MAAM,SAAS,IAAI,IAAI,KAAK,MAAM,MAAM,KAAK,EAAE,EAAE,OAAO,OAAO,EAAE,KAAK,GAAG;AACtH,SAAO,SAAS,KAAK,SAAY;AACnC;AAGO,SAAS,YAAY,YAAuH;AACjJ,QAAM,EAAE,SAAS,QAAQ,GAAG,KAAA,IAAS,cAAc,CAAA;AACnD,QAAM,QAAQ,CAAC,aAAiC,WAAW,IAAI,MAAM,GAAG,EAAE,IAAI,CAAC,WAAW,OAAO,KAAA,CAAM,EAAE,OAAO,OAAO;AACvH,SAAO,EAAE,SAAS,MAAM,OAAO,GAAG,QAAQ,MAAM,MAAM,GAAG,KAAA;AAC3D;AAeO,SAAS,aAAa,OAAiD;AAC5E,QAAM,8BAAc,IAAA;AACpB,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,SAAS,UAAU,KAAK,SAAS,QAAS;AACnD,UAAM,EAAE,SAAS,OAAA,IAAW,YAAY,KAAK,UAAU;AACvD,UAAM,UAAU,CAAC,GAAG,QAAQ,IAAI,CAAC,UAAU,EAAE,MAAM,MAAM,SAAA,EAAoB,GAAG,GAAG,OAAO,IAAI,CAAC,UAAU,EAAE,MAAM,MAAM,QAAA,EAAmB,CAAC;AAC3I,eAAW,EAAE,MAAM,KAAA,KAAU,SAAS;AACpC,YAAM,MAAM,GAAG,IAAI,IAAI,IAAI;AAC3B,YAAM,OAAO,QAAQ,IAAI,GAAG;AAC5B,cAAQ,IAAI,KAAK,EAAE,MAAM,MAAM,QAAQ,QAAQ,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,MAAM;AAAA,IACjG;AAAA,EACF;AACA,SAAO,CAAC,GAAG,QAAQ,QAAQ;AAC7B;AAGO,SAAS,cAAc,YAA0D;AACtF,SAAO,OAAO,QAAQ,cAAc,EAAE,EACnC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,EACrC,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,GAAG,GAAG,KAAK,KAAK,EAAE;AAC7C;AAMO,SAAS,UAAU,MAAyC;AACjE,QAAM,SAAS,IAAI;AAAA,IACjB,KAAK,MACF,IAAI,QAAQ,EACZ,OAAO,CAAC,WAAW,OAAO,SAAS,CAAC,EACpC,IAAI,CAAC,WAAW,OAAO,KAAK,KAAK,CAAC;AAAA,EAAA;AAEvC,QAAM,QAAQ,CAAC,GAAG,QAAQ,GAAG,cAAc,KAAK,UAAU,CAAC;AAC3D,SAAO,MAAM,WAAW,IAAI,SAAY,MAAM,KAAK,IAAI;AACzD;;;;;;;;;;;;"}

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

@@ -0,0 +1,53 @@
+import { CallGraphEdge, CallGraphOmitted } from './types.js';
+export declare function capitalize(text: string): string;
+/** The excluded nodes per group, most first, then by name. */
+export declare function excludedTally(omitted: CallGraphOmitted): {
+    group: string;
+    count: number;
+}[];
+/** The omitted chip's parts: what the response left out, with the excluded nodes as one total. */
+export declare function omittedParts(omitted: CallGraphOmitted): string[];
+/** A group box caption: a path's last two segments. The full label is the caption's tooltip. */
+export declare function groupCaption(label: string): string;
+/** Which of a site's nested guards the pill shows, how many there are, or none: the tooltip still names them. */
+export type GuardLabel = "innermost" | "outermost" | "count" | "none";
+export interface PillOptions {
+    guardLabel: GuardLabel;
+    /** Longest guard text a pill shows before it is cut with an ellipsis. */
+    truncateAt: number;
+}
+/** An edge is conditional when no call site behind it can be reached unguarded. */
+export declare function isConditional(edge: Pick<CallGraphEdge, "sites">): boolean;
+export declare function truncate(text: string, max: number): string;
+/**
+ * The pill's text: the guard the edge's call sites share, then `×N` when there are several sites.
+ * Sites with different guards show how many conditions there are instead of one of them, which would
+ * read as if it covered every site. A dispatch edge's guard is cut shorter by the room its icon takes.
+ */
+export declare function edgeLabel(edge: CallGraphEdge, options: PillOptions): string | undefined;
+/** The columns and fields a collapsed read or write touches, apart from the edge's other properties. */
+export declare function memberChips(properties: Record<string, string> | undefined): {
+    columns: string[];
+    fields: string[];
+    rest: Record<string, string>;
+};
+export type MemberAccessKind = "read" | "write" | "both";
+/** A column or field a collapsed read or write touches, and whether it is read, written or both. */
+export interface MemberAccess {
+    name: string;
+    kind: "column" | "field";
+    access: MemberAccessKind;
+}
+/**
+ * The columns and fields the reads and writes among `edges` touch, each once in first-seen order,
+ * marked "both" when a read and a write both touch it. Other edges are passed over.
+ */
+export declare function memberAccess(edges: readonly CallGraphEdge[]): MemberAccess[];
+/** The edge's properties as `key: value` lines, in key order. */
+export declare function propertyLines(properties: Record<string, string> | undefined): string[];
+/**
+ * The edge's tooltip: one line per distinct guard chain behind it, outermost first and joined with ∧,
+ * then its properties.
+ */
+export declare function edgeTitle(edge: CallGraphEdge): string | undefined;
+//# sourceMappingURL=call-graph-labels.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"call-graph-labels.d.ts","sourceRoot":"","sources":["../../../src/data/call-graph/call-graph-labels.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,aAAa,EAAE,gBAAgB,EAAiB,MAAM,SAAS,CAAC;AAK9E,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAE/C;AAMD,8DAA8D;AAC9D,wBAAgB,aAAa,CAAC,OAAO,EAAE,gBAAgB,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,EAAE,CAI3F;AAED,kGAAkG;AAClG,wBAAgB,YAAY,CAAC,OAAO,EAAE,gBAAgB,GAAG,MAAM,EAAE,CAUhE;AAED,gGAAgG;AAChG,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAElD;AAED,iHAAiH;AACjH,MAAM,MAAM,UAAU,GAAG,WAAW,GAAG,WAAW,GAAG,OAAO,GAAG,MAAM,CAAC;AAEtE,MAAM,WAAW,WAAW;IAC1B,UAAU,EAAE,UAAU,CAAC;IACvB,yEAAyE;IACzE,UAAU,EAAE,MAAM,CAAC;CACpB;AAMD,mFAAmF;AACnF,wBAAgB,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,aAAa,EAAE,OAAO,CAAC,GAAG,OAAO,CAEzE;AAED,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAE1D;AAoBD;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,WAAW,GAAG,MAAM,GAAG,SAAS,CAGvF;AAED,wGAAwG;AACxG,wBAAgB,WAAW,CAAC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,GAAG;IAAE,OAAO,EAAE,MAAM,EAAE,CAAC;IAAC,MAAM,EAAE,MAAM,EAAE,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,CAIjJ;AAED,MAAM,MAAM,gBAAgB,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM,CAAC;AAEzD,oGAAoG;AACpG,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,QAAQ,GAAG,OAAO,CAAC;IACzB,MAAM,EAAE,gBAAgB,CAAC;CAC1B;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,GAAG,YAAY,EAAE,CAa5E;AAED,iEAAiE;AACjE,wBAAgB,aAAa,CAAC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,GAAG,MAAM,EAAE,CAItF;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,aAAa,GAAG,MAAM,GAAG,SAAS,CASjE"}

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

@@ -0,0 +1,96 @@
+const EDGE_ICON_CHARS = 3;
+function capitalize(text) {
+  return text.charAt(0).toUpperCase() + text.slice(1);
+}
+function counted(count, one, many) {
+  return `${count} ${count === 1 ? one : many}`;
+}
+function excludedTally(omitted) {
+  return Object.entries(omitted.excluded ?? {}).map(([group, count]) => ({ group, count })).sort((a, b) => b.count - a.count || a.group.localeCompare(b.group));
+}
+function omittedParts(omitted) {
+  var _a;
+  const unreadable = ((_a = omitted.unreadable_source) == null ? void 0 : _a.length) ?? 0;
+  const excluded = excludedTally(omitted).reduce((total, { count }) => total + count, 0);
+  return [
+    omitted.node_limit ? "node limit reached" : "",
+    omitted.beyond_depth ? `${omitted.beyond_depth} beyond depth` : "",
+    omitted.unresolved ? `${omitted.unresolved} unresolved` : "",
+    unreadable > 0 ? counted(unreadable, "unreadable file", "unreadable files") : "",
+    excluded > 0 ? `${excluded} excluded` : ""
+  ].filter(Boolean);
+}
+function groupCaption(label) {
+  return label.split("/").slice(-2).join("/");
+}
+function guardsOf(site) {
+  return site.guards ?? [];
+}
+function isConditional(edge) {
+  return edge.sites.length > 0 && edge.sites.every((site) => guardsOf(site).length > 0);
+}
+function truncate(text, max) {
+  return text.length <= max ? text : `${text.slice(0, max - 1).trimEnd()}…`;
+}
+function guardCount(edge) {
+  const counts = edge.sites.map((site) => guardsOf(site).length);
+  const least = Math.min(...counts);
+  const most = Math.max(...counts);
+  if (least === most) return `${most} ${most === 1 ? "guard" : "guards"}`;
+  return `${least}–${most} guards`;
+}
+function guardText(edge, { guardLabel, truncateAt }) {
+  if (!isConditional(edge) || guardLabel === "none") return "";
+  if (guardLabel === "count") return guardCount(edge);
+  const chosen = new Set(edge.sites.map((site) => guardsOf(site).at(guardLabel === "innermost" ? -1 : 0)));
+  const [only] = chosen;
+  if (chosen.size > 1 || only === void 0) return `${chosen.size} conditions`;
+  return truncate(only, truncateAt - (edge.type === "call" ? 0 : EDGE_ICON_CHARS));
+}
+function edgeLabel(edge, options) {
+  const text = [guardText(edge, options), edge.sites.length > 1 ? `×${edge.sites.length}` : ""].filter(Boolean).join(" ");
+  return text === "" ? void 0 : text;
+}
+function memberChips(properties) {
+  const { columns, fields, ...rest } = properties ?? {};
+  const split = (members) => (members ?? "").split(",").map((member) => member.trim()).filter(Boolean);
+  return { columns: split(columns), fields: split(fields), rest };
+}
+function memberAccess(edges) {
+  const members = /* @__PURE__ */ new Map();
+  for (const edge of edges) {
+    if (edge.type !== "read" && edge.type !== "write") continue;
+    const { columns, fields } = memberChips(edge.properties);
+    const touched = [...columns.map((name) => ({ name, kind: "column" })), ...fields.map((name) => ({ name, kind: "field" }))];
+    for (const { name, kind } of touched) {
+      const key = `${kind}:${name}`;
+      const held = members.get(key);
+      members.set(key, { name, kind, access: held && held.access !== edge.type ? "both" : edge.type });
+    }
+  }
+  return [...members.values()];
+}
+function propertyLines(properties) {
+  return Object.entries(properties ?? {}).sort(([a], [b]) => a.localeCompare(b)).map(([key, value]) => `${key}: ${value}`);
+}
+function edgeTitle(edge) {
+  const chains = new Set(
+    edge.sites.map(guardsOf).filter((guards) => guards.length > 0).map((guards) => guards.join(" ∧ "))
+  );
+  const lines = [...chains, ...propertyLines(edge.properties)];
+  return lines.length === 0 ? void 0 : lines.join("\n");
+}
+export {
+  capitalize,
+  edgeLabel,
+  edgeTitle,
+  excludedTally,
+  groupCaption,
+  isConditional,
+  memberAccess,
+  memberChips,
+  omittedParts,
+  propertyLines,
+  truncate
+};
+//# sourceMappingURL=call-graph-labels.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"call-graph-labels.js","sources":["../../../src/data/call-graph/call-graph-labels.ts"],"sourcesContent":["// What the call graph says about an edge, a group and what it left out, as text: pill labels,\n// tooltips, chips. Pure, with no React and no layout; call-graph-model.ts maps it onto the diagram.\nimport type { CallGraphEdge, CallGraphOmitted, CallGraphSite } from \"./types\";\n\n/** The room an edge type's icon (every type but a plain call has one) takes in a pill, in characters of guard text. */\nconst EDGE_ICON_CHARS = 3;\n\nexport function capitalize(text: string): string {\n  return text.charAt(0).toUpperCase() + text.slice(1);\n}\n\nfunction counted(count: number, one: string, many: string): string {\n  return `${count} ${count === 1 ? one : many}`;\n}\n\n/** The excluded nodes per group, most first, then by name. */\nexport function excludedTally(omitted: CallGraphOmitted): { group: string; count: number }[] {\n  return Object.entries(omitted.excluded ?? {})\n    .map(([group, count]) => ({ group, count }))\n    .sort((a, b) => b.count - a.count || a.group.localeCompare(b.group));\n}\n\n/** The omitted chip's parts: what the response left out, with the excluded nodes as one total. */\nexport function omittedParts(omitted: CallGraphOmitted): string[] {\n  const unreadable = omitted.unreadable_source?.length ?? 0;\n  const excluded = excludedTally(omitted).reduce((total, { count }) => total + count, 0);\n  return [\n    omitted.node_limit ? \"node limit reached\" : \"\",\n    omitted.beyond_depth ? `${omitted.beyond_depth} beyond depth` : \"\",\n    omitted.unresolved ? `${omitted.unresolved} unresolved` : \"\",\n    unreadable > 0 ? counted(unreadable, \"unreadable file\", \"unreadable files\") : \"\",\n    excluded > 0 ? `${excluded} excluded` : \"\",\n  ].filter(Boolean);\n}\n\n/** A group box caption: a path's last two segments. The full label is the caption's tooltip. */\nexport function groupCaption(label: string): string {\n  return label.split(\"/\").slice(-2).join(\"/\");\n}\n\n/** Which of a site's nested guards the pill shows, how many there are, or none: the tooltip still names them. */\nexport type GuardLabel = \"innermost\" | \"outermost\" | \"count\" | \"none\";\n\nexport interface PillOptions {\n  guardLabel: GuardLabel;\n  /** Longest guard text a pill shows before it is cut with an ellipsis. */\n  truncateAt: number;\n}\n\nfunction guardsOf(site: CallGraphSite): string[] {\n  return site.guards ?? [];\n}\n\n/** An edge is conditional when no call site behind it can be reached unguarded. */\nexport function isConditional(edge: Pick<CallGraphEdge, \"sites\">): boolean {\n  return edge.sites.length > 0 && edge.sites.every((site) => guardsOf(site).length > 0);\n}\n\nexport function truncate(text: string, max: number): string {\n  return text.length <= max ? text : `${text.slice(0, max - 1).trimEnd()}…`;\n}\n\nfunction guardCount(edge: CallGraphEdge): string {\n  const counts = edge.sites.map((site) => guardsOf(site).length);\n  const least = Math.min(...counts);\n  const most = Math.max(...counts);\n  if (least === most) return `${most} ${most === 1 ? \"guard\" : \"guards\"}`;\n  return `${least}–${most} guards`;\n}\n\n/** The guard a conditional edge's sites share, or how many different ones they have. */\nfunction guardText(edge: CallGraphEdge, { guardLabel, truncateAt }: PillOptions): string {\n  if (!isConditional(edge) || guardLabel === \"none\") return \"\";\n  if (guardLabel === \"count\") return guardCount(edge);\n  const chosen = new Set(edge.sites.map((site) => guardsOf(site).at(guardLabel === \"innermost\" ? -1 : 0)));\n  const [only] = chosen;\n  if (chosen.size > 1 || only === undefined) return `${chosen.size} conditions`;\n  return truncate(only, truncateAt - (edge.type === \"call\" ? 0 : EDGE_ICON_CHARS));\n}\n\n/**\n * The pill's text: the guard the edge's call sites share, then `×N` when there are several sites.\n * Sites with different guards show how many conditions there are instead of one of them, which would\n * read as if it covered every site. A dispatch edge's guard is cut shorter by the room its icon takes.\n */\nexport function edgeLabel(edge: CallGraphEdge, options: PillOptions): string | undefined {\n  const text = [guardText(edge, options), edge.sites.length > 1 ? `×${edge.sites.length}` : \"\"].filter(Boolean).join(\" \");\n  return text === \"\" ? undefined : text;\n}\n\n/** The columns and fields a collapsed read or write touches, apart from the edge's other properties. */\nexport function memberChips(properties: Record<string, string> | undefined): { columns: string[]; fields: string[]; rest: Record<string, string> } {\n  const { columns, fields, ...rest } = properties ?? {};\n  const split = (members: string | undefined) => (members ?? \"\").split(\",\").map((member) => member.trim()).filter(Boolean);\n  return { columns: split(columns), fields: split(fields), rest };\n}\n\nexport type MemberAccessKind = \"read\" | \"write\" | \"both\";\n\n/** A column or field a collapsed read or write touches, and whether it is read, written or both. */\nexport interface MemberAccess {\n  name: string;\n  kind: \"column\" | \"field\";\n  access: MemberAccessKind;\n}\n\n/**\n * The columns and fields the reads and writes among `edges` touch, each once in first-seen order,\n * marked \"both\" when a read and a write both touch it. Other edges are passed over.\n */\nexport function memberAccess(edges: readonly CallGraphEdge[]): MemberAccess[] {\n  const members = new Map<string, MemberAccess>();\n  for (const edge of edges) {\n    if (edge.type !== \"read\" && edge.type !== \"write\") continue;\n    const { columns, fields } = memberChips(edge.properties);\n    const touched = [...columns.map((name) => ({ name, kind: \"column\" as const })), ...fields.map((name) => ({ name, kind: \"field\" as const }))];\n    for (const { name, kind } of touched) {\n      const key = `${kind}:${name}`;\n      const held = members.get(key);\n      members.set(key, { name, kind, access: held && held.access !== edge.type ? \"both\" : edge.type });\n    }\n  }\n  return [...members.values()];\n}\n\n/** The edge's properties as `key: value` lines, in key order. */\nexport function propertyLines(properties: Record<string, string> | undefined): string[] {\n  return Object.entries(properties ?? {})\n    .sort(([a], [b]) => a.localeCompare(b))\n    .map(([key, value]) => `${key}: ${value}`);\n}\n\n/**\n * The edge's tooltip: one line per distinct guard chain behind it, outermost first and joined with ∧,\n * then its properties.\n */\nexport function edgeTitle(edge: CallGraphEdge): string | undefined {\n  const chains = new Set(\n    edge.sites\n      .map(guardsOf)\n      .filter((guards) => guards.length > 0)\n      .map((guards) => guards.join(\" ∧ \")),\n  );\n  const lines = [...chains, ...propertyLines(edge.properties)];\n  return lines.length === 0 ? undefined : lines.join(\"\\n\");\n}\n"],"names":[],"mappings":"AAKA,MAAM,kBAAkB;AAEjB,SAAS,WAAW,MAAsB;AAC/C,SAAO,KAAK,OAAO,CAAC,EAAE,gBAAgB,KAAK,MAAM,CAAC;AACpD;AAEA,SAAS,QAAQ,OAAe,KAAa,MAAsB;AACjE,SAAO,GAAG,KAAK,IAAI,UAAU,IAAI,MAAM,IAAI;AAC7C;AAGO,SAAS,cAAc,SAA+D;AAC3F,SAAO,OAAO,QAAQ,QAAQ,YAAY,CAAA,CAAE,EACzC,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,EAAE,OAAO,MAAA,EAAQ,EAC1C,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,EAAE,KAAK,CAAC;AACvE;AAGO,SAAS,aAAa,SAAqC;AAlBlE;AAmBE,QAAM,eAAa,aAAQ,sBAAR,mBAA2B,WAAU;AACxD,QAAM,WAAW,cAAc,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,MAAA,MAAY,QAAQ,OAAO,CAAC;AACrF,SAAO;AAAA,IACL,QAAQ,aAAa,uBAAuB;AAAA,IAC5C,QAAQ,eAAe,GAAG,QAAQ,YAAY,kBAAkB;AAAA,IAChE,QAAQ,aAAa,GAAG,QAAQ,UAAU,gBAAgB;AAAA,IAC1D,aAAa,IAAI,QAAQ,YAAY,mBAAmB,kBAAkB,IAAI;AAAA,IAC9E,WAAW,IAAI,GAAG,QAAQ,cAAc;AAAA,EAAA,EACxC,OAAO,OAAO;AAClB;AAGO,SAAS,aAAa,OAAuB;AAClD,SAAO,MAAM,MAAM,GAAG,EAAE,MAAM,EAAE,EAAE,KAAK,GAAG;AAC5C;AAWA,SAAS,SAAS,MAA+B;AAC/C,SAAO,KAAK,UAAU,CAAA;AACxB;AAGO,SAAS,cAAc,MAA6C;AACzE,SAAO,KAAK,MAAM,SAAS,KAAK,KAAK,MAAM,MAAM,CAAC,SAAS,SAAS,IAAI,EAAE,SAAS,CAAC;AACtF;AAEO,SAAS,SAAS,MAAc,KAAqB;AAC1D,SAAO,KAAK,UAAU,MAAM,OAAO,GAAG,KAAK,MAAM,GAAG,MAAM,CAAC,EAAE,QAAA,CAAS;AACxE;AAEA,SAAS,WAAW,MAA6B;AAC/C,QAAM,SAAS,KAAK,MAAM,IAAI,CAAC,SAAS,SAAS,IAAI,EAAE,MAAM;AAC7D,QAAM,QAAQ,KAAK,IAAI,GAAG,MAAM;AAChC,QAAM,OAAO,KAAK,IAAI,GAAG,MAAM;AAC/B,MAAI,UAAU,KAAM,QAAO,GAAG,IAAI,IAAI,SAAS,IAAI,UAAU,QAAQ;AACrE,SAAO,GAAG,KAAK,IAAI,IAAI;AACzB;AAGA,SAAS,UAAU,MAAqB,EAAE,YAAY,cAAmC;AACvF,MAAI,CAAC,cAAc,IAAI,KAAK,eAAe,OAAQ,QAAO;AAC1D,MAAI,eAAe,QAAS,QAAO,WAAW,IAAI;AAClD,QAAM,SAAS,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC,SAAS,SAAS,IAAI,EAAE,GAAG,eAAe,cAAc,KAAK,CAAC,CAAC,CAAC;AACvG,QAAM,CAAC,IAAI,IAAI;AACf,MAAI,OAAO,OAAO,KAAK,SAAS,OAAW,QAAO,GAAG,OAAO,IAAI;AAChE,SAAO,SAAS,MAAM,cAAc,KAAK,SAAS,SAAS,IAAI,gBAAgB;AACjF;AAOO,SAAS,UAAU,MAAqB,SAA0C;AACvF,QAAM,OAAO,CAAC,UAAU,MAAM,OAAO,GAAG,KAAK,MAAM,SAAS,IAAI,IAAI,KAAK,MAAM,MAAM,KAAK,EAAE,EAAE,OAAO,OAAO,EAAE,KAAK,GAAG;AACtH,SAAO,SAAS,KAAK,SAAY;AACnC;AAGO,SAAS,YAAY,YAAuH;AACjJ,QAAM,EAAE,SAAS,QAAQ,GAAG,KAAA,IAAS,cAAc,CAAA;AACnD,QAAM,QAAQ,CAAC,aAAiC,WAAW,IAAI,MAAM,GAAG,EAAE,IAAI,CAAC,WAAW,OAAO,KAAA,CAAM,EAAE,OAAO,OAAO;AACvH,SAAO,EAAE,SAAS,MAAM,OAAO,GAAG,QAAQ,MAAM,MAAM,GAAG,KAAA;AAC3D;AAeO,SAAS,aAAa,OAAiD;AAC5E,QAAM,8BAAc,IAAA;AACpB,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,SAAS,UAAU,KAAK,SAAS,QAAS;AACnD,UAAM,EAAE,SAAS,OAAA,IAAW,YAAY,KAAK,UAAU;AACvD,UAAM,UAAU,CAAC,GAAG,QAAQ,IAAI,CAAC,UAAU,EAAE,MAAM,MAAM,SAAA,EAAoB,GAAG,GAAG,OAAO,IAAI,CAAC,UAAU,EAAE,MAAM,MAAM,QAAA,EAAmB,CAAC;AAC3I,eAAW,EAAE,MAAM,KAAA,KAAU,SAAS;AACpC,YAAM,MAAM,GAAG,IAAI,IAAI,IAAI;AAC3B,YAAM,OAAO,QAAQ,IAAI,GAAG;AAC5B,cAAQ,IAAI,KAAK,EAAE,MAAM,MAAM,QAAQ,QAAQ,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,MAAM;AAAA,IACjG;AAAA,EACF;AACA,SAAO,CAAC,GAAG,QAAQ,QAAQ;AAC7B;AAGO,SAAS,cAAc,YAA0D;AACtF,SAAO,OAAO,QAAQ,cAAc,EAAE,EACnC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,EACrC,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,GAAG,GAAG,KAAK,KAAK,EAAE;AAC7C;AAMO,SAAS,UAAU,MAAyC;AACjE,QAAM,SAAS,IAAI;AAAA,IACjB,KAAK,MACF,IAAI,QAAQ,EACZ,OAAO,CAAC,WAAW,OAAO,SAAS,CAAC,EACpC,IAAI,CAAC,WAAW,OAAO,KAAK,KAAK,CAAC;AAAA,EAAA;AAEvC,QAAM,QAAQ,CAAC,GAAG,QAAQ,GAAG,cAAc,KAAK,UAAU,CAAC;AAC3D,SAAO,MAAM,WAAW,IAAI,SAAY,MAAM,KAAK,IAAI;AACzD;"}

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

@@ -0,0 +1,161 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+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 && access.length === 1) throw new Error(`call graph: ${type} is the only access type on`);
+  return types.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 = (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 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: callGraphVocabulary.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 = callGraphLabels.edgeLabel(edge, options);
+  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 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(callGraphLabels.groupCaption(label)), title: label })) : []
+  };
+}
+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.columnGap = columnGap;
+exports.expandCount = expandCount;
+exports.expansionDirection = expansionDirection;
+exports.mergeGraph = mergeGraph;
+exports.requireNode = requireNode;
+exports.toDiagram = toDiagram;
+exports.toggleAccess = toggleAccess;
+exports.visibleGraph = visibleGraph;
+exports.walkedTotals = walkedTotals;
+//# sourceMappingURL=call-graph-model.cjs.map