@flanksource/clicky-ui 0.3.48 → 0.3.50

package/dist/data/traces/process-tree.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"process-tree.cjs","sources":["../../../src/data/traces/process-tree.ts"],"sourcesContent":["import type { ProcessNodeRow, ProcessSampleRow } from \"./types\";\n\nexport type ProcessTreeNode = {\n  row: ProcessNodeRow;\n  children: ProcessTreeNode[];\n  /** The process has exited: by its status, or because an exit time was recorded. */\n  exited: boolean;\n};\n\nconst byStart = (a: ProcessTreeNode, b: ProcessTreeNode) =>\n  Date.parse(a.row.startedAt) - Date.parse(b.row.startedAt) || a.row.pid - b.row.pid;\n\n/**\n * Builds the forest a `process_tree` stream describes: each row under its\n * `parentKey`. A row whose parent was never recorded (the capture began below\n * it) becomes a root. The stream holds each process once, so a repeated key or a\n * parent cycle is a corrupt capture and throws.\n */\nexport function buildProcessForest(rows: ProcessNodeRow[]): ProcessTreeNode[] {\n  const nodes = new Map<string, ProcessTreeNode>();\n  for (const row of rows) {\n    if (nodes.has(row.key)) throw new Error(`process tree key \"${row.key}\" appears twice`);\n    nodes.set(row.key, { row, children: [], exited: isProcessExited(row) });\n  }\n\n  const roots: ProcessTreeNode[] = [];\n  for (const node of nodes.values()) {\n    const parent = node.row.parentKey ? nodes.get(node.row.parentKey) : undefined;\n    (parent ? parent.children : roots).push(node);\n  }\n\n  roots.sort((a, b) => Number(Boolean(b.row.isRoot)) - Number(Boolean(a.row.isRoot)) || byStart(a, b));\n  const reached = flattenForest(roots);\n  if (reached.length !== nodes.size) {\n    const lost = [...nodes.keys()].filter((key) => !reached.some((node) => node.row.key === key));\n    throw new Error(`process tree has a parent cycle among keys ${lost.map((key) => `\"${key}\"`).join(\", \")}`);\n  }\n  for (const node of nodes.values()) node.children.sort(byStart);\n  return roots;\n}\n\n/**\n * Drops exited processes from a forest, keeping an exited process only while it\n * still has a live descendant to hang off. Returns new nodes; the input is not\n * modified.\n */\nexport function pruneExitedProcesses(roots: ProcessTreeNode[]): ProcessTreeNode[] {\n  return roots.flatMap((node) => {\n    const children = pruneExitedProcesses(node.children);\n    return node.exited && children.length === 0 ? [] : [{ ...node, children }];\n  });\n}\n\n/** How long the process lived: to its exit, else to the last time it was seen. */\nexport function processLifetimeMs(row: ProcessNodeRow): number {\n  return Date.parse(row.exitedAt ?? row.lastSeenAt) - Date.parse(row.startedAt);\n}\n\n/** A trace timestamp as local `YYYY-MM-DD HH:MM:SS`; text that is not a date is returned unchanged. */\nexport function formatProcessTimestamp(iso: string): string {\n  const date = new Date(iso);\n  if (Number.isNaN(date.getTime())) return iso;\n  const pad = (n: number) => String(n).padStart(2, \"0\");\n  return `${date.getFullYear()}-${pad(date.getMonth() + 1)}-${pad(date.getDate())} ${pad(date.getHours())}:${pad(date.getMinutes())}:${pad(date.getSeconds())}`;\n}\n\n/** The process has exited: by its status, or because an exit time was recorded. */\nexport function isProcessExited(row: ProcessNodeRow): boolean {\n  return row.status === \"exited\" || Boolean(row.exitedAt);\n}\n\n/** The forest depth-first, parents before children. */\nexport function flattenForest(roots: ProcessTreeNode[]): ProcessTreeNode[] {\n  const flat: ProcessTreeNode[] = [];\n  const visit = (node: ProcessTreeNode) => {\n    flat.push(node);\n    node.children.forEach(visit);\n  };\n  roots.forEach(visit);\n  return flat;\n}\n\n/** A CPU % for display, \"—\" while it is still unknown. */\nexport function formatCpuPercent(value: number | null | undefined): string {\n  return value == null ? \"—\" : `${value.toFixed(1)}%`;\n}\n\nfunction knownCpu(samples: ProcessSampleRow[]): number[] {\n  return samples.flatMap((sample) => (sample.cpuPercent == null ? [] : [sample.cpuPercent]));\n}\n\n/** Each process's known CPU % over its samples, in tick order. */\nexport function cpuSeriesByKey(samples: ProcessSampleRow[]): Map<string, number[]> {\n  const byKey = new Map<string, ProcessSampleRow[]>();\n  for (const sample of samples) byKey.set(sample.key, [...(byKey.get(sample.key) ?? []), sample]);\n  return new Map([...byKey].map(([key, list]) => [key, knownCpu(list.sort((a, b) => a.tick - b.tick))]));\n}\n\n/** One process's known CPU % and RSS bytes over its samples, in tick order. */\nexport function processSeries(samples: ProcessSampleRow[], key: string): { cpu: number[]; rss: number[] } {\n  const own = samples.filter((sample) => sample.key === key).sort((a, b) => a.tick - b.tick);\n  return { cpu: knownCpu(own), rss: own.map((sample) => sample.rssBytes) };\n}\n\n/** SVG polyline points for `values` in a `width` x `height` box, zero at the bottom and the maximum at the top. */\nexport function sparklinePoints(values: number[], width: number, height: number): string | undefined {\n  if (values.length < 2) return undefined;\n  const max = Math.max(...values);\n  return values\n    .map((value, index) => {\n      const x = (index / (values.length - 1)) * width;\n      const y = max === 0 ? height : height - (value / max) * height;\n      return `${x.toFixed(1)},${y.toFixed(1)}`;\n    })\n    .join(\" \");\n}\n"],"names":[],"mappings":";;AASA,MAAM,UAAU,CAAC,GAAoB,MACnC,KAAK,MAAM,EAAE,IAAI,SAAS,IAAI,KAAK,MAAM,EAAE,IAAI,SAAS,KAAK,EAAE,IAAI,MAAM,EAAE,IAAI;AAQ1E,SAAS,mBAAmB,MAA2C;AAC5E,QAAM,4BAAY,IAAA;AAClB,aAAW,OAAO,MAAM;AACtB,QAAI,MAAM,IAAI,IAAI,GAAG,EAAG,OAAM,IAAI,MAAM,qBAAqB,IAAI,GAAG,iBAAiB;AACrF,UAAM,IAAI,IAAI,KAAK,EAAE,KAAK,UAAU,CAAA,GAAI,QAAQ,gBAAgB,GAAG,EAAA,CAAG;AAAA,EACxE;AAEA,QAAM,QAA2B,CAAA;AACjC,aAAW,QAAQ,MAAM,UAAU;AACjC,UAAM,SAAS,KAAK,IAAI,YAAY,MAAM,IAAI,KAAK,IAAI,SAAS,IAAI;AACpE,KAAC,SAAS,OAAO,WAAW,OAAO,KAAK,IAAI;AAAA,EAC9C;AAEA,QAAM,KAAK,CAAC,GAAG,MAAM,OAAO,QAAQ,EAAE,IAAI,MAAM,CAAC,IAAI,OAAO,QAAQ,EAAE,IAAI,MAAM,CAAC,KAAK,QAAQ,GAAG,CAAC,CAAC;AACnG,QAAM,UAAU,cAAc,KAAK;AACnC,MAAI,QAAQ,WAAW,MAAM,MAAM;AACjC,UAAM,OAAO,CAAC,GAAG,MAAM,KAAA,CAAM,EAAE,OAAO,CAAC,QAAQ,CAAC,QAAQ,KAAK,CAAC,SAAS,KAAK,IAAI,QAAQ,GAAG,CAAC;AAC5F,UAAM,IAAI,MAAM,8CAA8C,KAAK,IAAI,CAAC,QAAQ,IAAI,GAAG,GAAG,EAAE,KAAK,IAAI,CAAC,EAAE;AAAA,EAC1G;AACA,aAAW,QAAQ,MAAM,OAAA,EAAU,MAAK,SAAS,KAAK,OAAO;AAC7D,SAAO;AACT;AAOO,SAAS,qBAAqB,OAA6C;AAChF,SAAO,MAAM,QAAQ,CAAC,SAAS;AAC7B,UAAM,WAAW,qBAAqB,KAAK,QAAQ;AACnD,WAAO,KAAK,UAAU,SAAS,WAAW,IAAI,CAAA,IAAK,CAAC,EAAE,GAAG,MAAM,UAAU;AAAA,EAC3E,CAAC;AACH;AAGO,SAAS,kBAAkB,KAA6B;AAC7D,SAAO,KAAK,MAAM,IAAI,YAAY,IAAI,UAAU,IAAI,KAAK,MAAM,IAAI,SAAS;AAC9E;AAGO,SAAS,uBAAuB,KAAqB;AAC1D,QAAM,OAAO,IAAI,KAAK,GAAG;AACzB,MAAI,OAAO,MAAM,KAAK,QAAA,CAAS,EAAG,QAAO;AACzC,QAAM,MAAM,CAAC,MAAc,OAAO,CAAC,EAAE,SAAS,GAAG,GAAG;AACpD,SAAO,GAAG,KAAK,YAAA,CAAa,IAAI,IAAI,KAAK,SAAA,IAAa,CAAC,CAAC,IAAI,IAAI,KAAK,SAAS,CAAC,IAAI,IAAI,KAAK,SAAA,CAAU,CAAC,IAAI,IAAI,KAAK,WAAA,CAAY,CAAC,IAAI,IAAI,KAAK,WAAA,CAAY,CAAC;AAC7J;AAGO,SAAS,gBAAgB,KAA8B;AAC5D,SAAO,IAAI,WAAW,YAAY,QAAQ,IAAI,QAAQ;AACxD;AAGO,SAAS,cAAc,OAA6C;AACzE,QAAM,OAA0B,CAAA;AAChC,QAAM,QAAQ,CAAC,SAA0B;AACvC,SAAK,KAAK,IAAI;AACd,SAAK,SAAS,QAAQ,KAAK;AAAA,EAC7B;AACA,QAAM,QAAQ,KAAK;AACnB,SAAO;AACT;AAGO,SAAS,iBAAiB,OAA0C;AACzE,SAAO,SAAS,OAAO,MAAM,GAAG,MAAM,QAAQ,CAAC,CAAC;AAClD;AAEA,SAAS,SAAS,SAAuC;AACvD,SAAO,QAAQ,QAAQ,CAAC,WAAY,OAAO,cAAc,OAAO,CAAA,IAAK,CAAC,OAAO,UAAU,CAAE;AAC3F;AAGO,SAAS,eAAe,SAAoD;AACjF,QAAM,4BAAY,IAAA;AAClB,aAAW,UAAU,QAAS,OAAM,IAAI,OAAO,KAAK,CAAC,GAAI,MAAM,IAAI,OAAO,GAAG,KAAK,CAAA,GAAK,MAAM,CAAC;AAC9F,SAAO,IAAI,IAAI,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,SAAS,KAAK,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;AACvG;AAGO,SAAS,cAAc,SAA6B,KAA+C;AACxG,QAAM,MAAM,QAAQ,OAAO,CAAC,WAAW,OAAO,QAAQ,GAAG,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;AACzF,SAAO,EAAE,KAAK,SAAS,GAAG,GAAG,KAAK,IAAI,IAAI,CAAC,WAAW,OAAO,QAAQ,EAAA;AACvE;AAGO,SAAS,gBAAgB,QAAkB,OAAe,QAAoC;AACnG,MAAI,OAAO,SAAS,EAAG,QAAO;AAC9B,QAAM,MAAM,KAAK,IAAI,GAAG,MAAM;AAC9B,SAAO,OACJ,IAAI,CAAC,OAAO,UAAU;AACrB,UAAM,IAAK,SAAS,OAAO,SAAS,KAAM;AAC1C,UAAM,IAAI,QAAQ,IAAI,SAAS,SAAU,QAAQ,MAAO;AACxD,WAAO,GAAG,EAAE,QAAQ,CAAC,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AAAA,EACxC,CAAC,EACA,KAAK,GAAG;AACb;;;;;;;;;;;"}

package/dist/data/traces/process-tree.d.ts

@@ -0,0 +1,40 @@
+import { ProcessNodeRow, ProcessSampleRow } from './types.js';
+export type ProcessTreeNode = {
+    row: ProcessNodeRow;
+    children: ProcessTreeNode[];
+    /** The process has exited: by its status, or because an exit time was recorded. */
+    exited: boolean;
+};
+/**
+ * Builds the forest a `process_tree` stream describes: each row under its
+ * `parentKey`. A row whose parent was never recorded (the capture began below
+ * it) becomes a root. The stream holds each process once, so a repeated key or a
+ * parent cycle is a corrupt capture and throws.
+ */
+export declare function buildProcessForest(rows: ProcessNodeRow[]): ProcessTreeNode[];
+/**
+ * Drops exited processes from a forest, keeping an exited process only while it
+ * still has a live descendant to hang off. Returns new nodes; the input is not
+ * modified.
+ */
+export declare function pruneExitedProcesses(roots: ProcessTreeNode[]): ProcessTreeNode[];
+/** How long the process lived: to its exit, else to the last time it was seen. */
+export declare function processLifetimeMs(row: ProcessNodeRow): number;
+/** A trace timestamp as local `YYYY-MM-DD HH:MM:SS`; text that is not a date is returned unchanged. */
+export declare function formatProcessTimestamp(iso: string): string;
+/** The process has exited: by its status, or because an exit time was recorded. */
+export declare function isProcessExited(row: ProcessNodeRow): boolean;
+/** The forest depth-first, parents before children. */
+export declare function flattenForest(roots: ProcessTreeNode[]): ProcessTreeNode[];
+/** A CPU % for display, "—" while it is still unknown. */
+export declare function formatCpuPercent(value: number | null | undefined): string;
+/** Each process's known CPU % over its samples, in tick order. */
+export declare function cpuSeriesByKey(samples: ProcessSampleRow[]): Map<string, number[]>;
+/** One process's known CPU % and RSS bytes over its samples, in tick order. */
+export declare function processSeries(samples: ProcessSampleRow[], key: string): {
+    cpu: number[];
+    rss: number[];
+};
+/** SVG polyline points for `values` in a `width` x `height` box, zero at the bottom and the maximum at the top. */
+export declare function sparklinePoints(values: number[], width: number, height: number): string | undefined;
+//# sourceMappingURL=process-tree.d.ts.map

package/dist/data/traces/process-tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"process-tree.d.ts","sourceRoot":"","sources":["../../../src/data/traces/process-tree.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAEhE,MAAM,MAAM,eAAe,GAAG;IAC5B,GAAG,EAAE,cAAc,CAAC;IACpB,QAAQ,EAAE,eAAe,EAAE,CAAC;IAC5B,mFAAmF;IACnF,MAAM,EAAE,OAAO,CAAC;CACjB,CAAC;AAKF;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,cAAc,EAAE,GAAG,eAAe,EAAE,CAqB5E;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG,eAAe,EAAE,CAKhF;AAED,kFAAkF;AAClF,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,cAAc,GAAG,MAAM,CAE7D;AAED,uGAAuG;AACvG,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAK1D;AAED,mFAAmF;AACnF,wBAAgB,eAAe,CAAC,GAAG,EAAE,cAAc,GAAG,OAAO,CAE5D;AAED,uDAAuD;AACvD,wBAAgB,aAAa,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG,eAAe,EAAE,CAQzE;AAED,0DAA0D;AAC1D,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,MAAM,CAEzE;AAMD,kEAAkE;AAClE,wBAAgB,cAAc,CAAC,OAAO,EAAE,gBAAgB,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAIjF;AAED,+EAA+E;AAC/E,wBAAgB,aAAa,CAAC,OAAO,EAAE,gBAAgB,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG;IAAE,GAAG,EAAE,MAAM,EAAE,CAAC;IAAC,GAAG,EAAE,MAAM,EAAE,CAAA;CAAE,CAGxG;AAED,mHAAmH;AACnH,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAUnG"}

package/dist/data/traces/process-tree.js

@@ -0,0 +1,85 @@
+const byStart = (a, b) => Date.parse(a.row.startedAt) - Date.parse(b.row.startedAt) || a.row.pid - b.row.pid;
+function buildProcessForest(rows) {
+  const nodes = /* @__PURE__ */ new Map();
+  for (const row of rows) {
+    if (nodes.has(row.key)) throw new Error(`process tree key "${row.key}" appears twice`);
+    nodes.set(row.key, { row, children: [], exited: isProcessExited(row) });
+  }
+  const roots = [];
+  for (const node of nodes.values()) {
+    const parent = node.row.parentKey ? nodes.get(node.row.parentKey) : void 0;
+    (parent ? parent.children : roots).push(node);
+  }
+  roots.sort((a, b) => Number(Boolean(b.row.isRoot)) - Number(Boolean(a.row.isRoot)) || byStart(a, b));
+  const reached = flattenForest(roots);
+  if (reached.length !== nodes.size) {
+    const lost = [...nodes.keys()].filter((key) => !reached.some((node) => node.row.key === key));
+    throw new Error(`process tree has a parent cycle among keys ${lost.map((key) => `"${key}"`).join(", ")}`);
+  }
+  for (const node of nodes.values()) node.children.sort(byStart);
+  return roots;
+}
+function pruneExitedProcesses(roots) {
+  return roots.flatMap((node) => {
+    const children = pruneExitedProcesses(node.children);
+    return node.exited && children.length === 0 ? [] : [{ ...node, children }];
+  });
+}
+function processLifetimeMs(row) {
+  return Date.parse(row.exitedAt ?? row.lastSeenAt) - Date.parse(row.startedAt);
+}
+function formatProcessTimestamp(iso) {
+  const date = new Date(iso);
+  if (Number.isNaN(date.getTime())) return iso;
+  const pad = (n) => String(n).padStart(2, "0");
+  return `${date.getFullYear()}-${pad(date.getMonth() + 1)}-${pad(date.getDate())} ${pad(date.getHours())}:${pad(date.getMinutes())}:${pad(date.getSeconds())}`;
+}
+function isProcessExited(row) {
+  return row.status === "exited" || Boolean(row.exitedAt);
+}
+function flattenForest(roots) {
+  const flat = [];
+  const visit = (node) => {
+    flat.push(node);
+    node.children.forEach(visit);
+  };
+  roots.forEach(visit);
+  return flat;
+}
+function formatCpuPercent(value) {
+  return value == null ? "—" : `${value.toFixed(1)}%`;
+}
+function knownCpu(samples) {
+  return samples.flatMap((sample) => sample.cpuPercent == null ? [] : [sample.cpuPercent]);
+}
+function cpuSeriesByKey(samples) {
+  const byKey = /* @__PURE__ */ new Map();
+  for (const sample of samples) byKey.set(sample.key, [...byKey.get(sample.key) ?? [], sample]);
+  return new Map([...byKey].map(([key, list]) => [key, knownCpu(list.sort((a, b) => a.tick - b.tick))]));
+}
+function processSeries(samples, key) {
+  const own = samples.filter((sample) => sample.key === key).sort((a, b) => a.tick - b.tick);
+  return { cpu: knownCpu(own), rss: own.map((sample) => sample.rssBytes) };
+}
+function sparklinePoints(values, width, height) {
+  if (values.length < 2) return void 0;
+  const max = Math.max(...values);
+  return values.map((value, index) => {
+    const x = index / (values.length - 1) * width;
+    const y = max === 0 ? height : height - value / max * height;
+    return `${x.toFixed(1)},${y.toFixed(1)}`;
+  }).join(" ");
+}
+export {
+  buildProcessForest,
+  cpuSeriesByKey,
+  flattenForest,
+  formatCpuPercent,
+  formatProcessTimestamp,
+  isProcessExited,
+  processLifetimeMs,
+  processSeries,
+  pruneExitedProcesses,
+  sparklinePoints
+};
+//# sourceMappingURL=process-tree.js.map

package/dist/data/traces/process-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"process-tree.js","sources":["../../../src/data/traces/process-tree.ts"],"sourcesContent":["import type { ProcessNodeRow, ProcessSampleRow } from \"./types\";\n\nexport type ProcessTreeNode = {\n  row: ProcessNodeRow;\n  children: ProcessTreeNode[];\n  /** The process has exited: by its status, or because an exit time was recorded. */\n  exited: boolean;\n};\n\nconst byStart = (a: ProcessTreeNode, b: ProcessTreeNode) =>\n  Date.parse(a.row.startedAt) - Date.parse(b.row.startedAt) || a.row.pid - b.row.pid;\n\n/**\n * Builds the forest a `process_tree` stream describes: each row under its\n * `parentKey`. A row whose parent was never recorded (the capture began below\n * it) becomes a root. The stream holds each process once, so a repeated key or a\n * parent cycle is a corrupt capture and throws.\n */\nexport function buildProcessForest(rows: ProcessNodeRow[]): ProcessTreeNode[] {\n  const nodes = new Map<string, ProcessTreeNode>();\n  for (const row of rows) {\n    if (nodes.has(row.key)) throw new Error(`process tree key \"${row.key}\" appears twice`);\n    nodes.set(row.key, { row, children: [], exited: isProcessExited(row) });\n  }\n\n  const roots: ProcessTreeNode[] = [];\n  for (const node of nodes.values()) {\n    const parent = node.row.parentKey ? nodes.get(node.row.parentKey) : undefined;\n    (parent ? parent.children : roots).push(node);\n  }\n\n  roots.sort((a, b) => Number(Boolean(b.row.isRoot)) - Number(Boolean(a.row.isRoot)) || byStart(a, b));\n  const reached = flattenForest(roots);\n  if (reached.length !== nodes.size) {\n    const lost = [...nodes.keys()].filter((key) => !reached.some((node) => node.row.key === key));\n    throw new Error(`process tree has a parent cycle among keys ${lost.map((key) => `\"${key}\"`).join(\", \")}`);\n  }\n  for (const node of nodes.values()) node.children.sort(byStart);\n  return roots;\n}\n\n/**\n * Drops exited processes from a forest, keeping an exited process only while it\n * still has a live descendant to hang off. Returns new nodes; the input is not\n * modified.\n */\nexport function pruneExitedProcesses(roots: ProcessTreeNode[]): ProcessTreeNode[] {\n  return roots.flatMap((node) => {\n    const children = pruneExitedProcesses(node.children);\n    return node.exited && children.length === 0 ? [] : [{ ...node, children }];\n  });\n}\n\n/** How long the process lived: to its exit, else to the last time it was seen. */\nexport function processLifetimeMs(row: ProcessNodeRow): number {\n  return Date.parse(row.exitedAt ?? row.lastSeenAt) - Date.parse(row.startedAt);\n}\n\n/** A trace timestamp as local `YYYY-MM-DD HH:MM:SS`; text that is not a date is returned unchanged. */\nexport function formatProcessTimestamp(iso: string): string {\n  const date = new Date(iso);\n  if (Number.isNaN(date.getTime())) return iso;\n  const pad = (n: number) => String(n).padStart(2, \"0\");\n  return `${date.getFullYear()}-${pad(date.getMonth() + 1)}-${pad(date.getDate())} ${pad(date.getHours())}:${pad(date.getMinutes())}:${pad(date.getSeconds())}`;\n}\n\n/** The process has exited: by its status, or because an exit time was recorded. */\nexport function isProcessExited(row: ProcessNodeRow): boolean {\n  return row.status === \"exited\" || Boolean(row.exitedAt);\n}\n\n/** The forest depth-first, parents before children. */\nexport function flattenForest(roots: ProcessTreeNode[]): ProcessTreeNode[] {\n  const flat: ProcessTreeNode[] = [];\n  const visit = (node: ProcessTreeNode) => {\n    flat.push(node);\n    node.children.forEach(visit);\n  };\n  roots.forEach(visit);\n  return flat;\n}\n\n/** A CPU % for display, \"—\" while it is still unknown. */\nexport function formatCpuPercent(value: number | null | undefined): string {\n  return value == null ? \"—\" : `${value.toFixed(1)}%`;\n}\n\nfunction knownCpu(samples: ProcessSampleRow[]): number[] {\n  return samples.flatMap((sample) => (sample.cpuPercent == null ? [] : [sample.cpuPercent]));\n}\n\n/** Each process's known CPU % over its samples, in tick order. */\nexport function cpuSeriesByKey(samples: ProcessSampleRow[]): Map<string, number[]> {\n  const byKey = new Map<string, ProcessSampleRow[]>();\n  for (const sample of samples) byKey.set(sample.key, [...(byKey.get(sample.key) ?? []), sample]);\n  return new Map([...byKey].map(([key, list]) => [key, knownCpu(list.sort((a, b) => a.tick - b.tick))]));\n}\n\n/** One process's known CPU % and RSS bytes over its samples, in tick order. */\nexport function processSeries(samples: ProcessSampleRow[], key: string): { cpu: number[]; rss: number[] } {\n  const own = samples.filter((sample) => sample.key === key).sort((a, b) => a.tick - b.tick);\n  return { cpu: knownCpu(own), rss: own.map((sample) => sample.rssBytes) };\n}\n\n/** SVG polyline points for `values` in a `width` x `height` box, zero at the bottom and the maximum at the top. */\nexport function sparklinePoints(values: number[], width: number, height: number): string | undefined {\n  if (values.length < 2) return undefined;\n  const max = Math.max(...values);\n  return values\n    .map((value, index) => {\n      const x = (index / (values.length - 1)) * width;\n      const y = max === 0 ? height : height - (value / max) * height;\n      return `${x.toFixed(1)},${y.toFixed(1)}`;\n    })\n    .join(\" \");\n}\n"],"names":[],"mappings":"AASA,MAAM,UAAU,CAAC,GAAoB,MACnC,KAAK,MAAM,EAAE,IAAI,SAAS,IAAI,KAAK,MAAM,EAAE,IAAI,SAAS,KAAK,EAAE,IAAI,MAAM,EAAE,IAAI;AAQ1E,SAAS,mBAAmB,MAA2C;AAC5E,QAAM,4BAAY,IAAA;AAClB,aAAW,OAAO,MAAM;AACtB,QAAI,MAAM,IAAI,IAAI,GAAG,EAAG,OAAM,IAAI,MAAM,qBAAqB,IAAI,GAAG,iBAAiB;AACrF,UAAM,IAAI,IAAI,KAAK,EAAE,KAAK,UAAU,CAAA,GAAI,QAAQ,gBAAgB,GAAG,EAAA,CAAG;AAAA,EACxE;AAEA,QAAM,QAA2B,CAAA;AACjC,aAAW,QAAQ,MAAM,UAAU;AACjC,UAAM,SAAS,KAAK,IAAI,YAAY,MAAM,IAAI,KAAK,IAAI,SAAS,IAAI;AACpE,KAAC,SAAS,OAAO,WAAW,OAAO,KAAK,IAAI;AAAA,EAC9C;AAEA,QAAM,KAAK,CAAC,GAAG,MAAM,OAAO,QAAQ,EAAE,IAAI,MAAM,CAAC,IAAI,OAAO,QAAQ,EAAE,IAAI,MAAM,CAAC,KAAK,QAAQ,GAAG,CAAC,CAAC;AACnG,QAAM,UAAU,cAAc,KAAK;AACnC,MAAI,QAAQ,WAAW,MAAM,MAAM;AACjC,UAAM,OAAO,CAAC,GAAG,MAAM,KAAA,CAAM,EAAE,OAAO,CAAC,QAAQ,CAAC,QAAQ,KAAK,CAAC,SAAS,KAAK,IAAI,QAAQ,GAAG,CAAC;AAC5F,UAAM,IAAI,MAAM,8CAA8C,KAAK,IAAI,CAAC,QAAQ,IAAI,GAAG,GAAG,EAAE,KAAK,IAAI,CAAC,EAAE;AAAA,EAC1G;AACA,aAAW,QAAQ,MAAM,OAAA,EAAU,MAAK,SAAS,KAAK,OAAO;AAC7D,SAAO;AACT;AAOO,SAAS,qBAAqB,OAA6C;AAChF,SAAO,MAAM,QAAQ,CAAC,SAAS;AAC7B,UAAM,WAAW,qBAAqB,KAAK,QAAQ;AACnD,WAAO,KAAK,UAAU,SAAS,WAAW,IAAI,CAAA,IAAK,CAAC,EAAE,GAAG,MAAM,UAAU;AAAA,EAC3E,CAAC;AACH;AAGO,SAAS,kBAAkB,KAA6B;AAC7D,SAAO,KAAK,MAAM,IAAI,YAAY,IAAI,UAAU,IAAI,KAAK,MAAM,IAAI,SAAS;AAC9E;AAGO,SAAS,uBAAuB,KAAqB;AAC1D,QAAM,OAAO,IAAI,KAAK,GAAG;AACzB,MAAI,OAAO,MAAM,KAAK,QAAA,CAAS,EAAG,QAAO;AACzC,QAAM,MAAM,CAAC,MAAc,OAAO,CAAC,EAAE,SAAS,GAAG,GAAG;AACpD,SAAO,GAAG,KAAK,YAAA,CAAa,IAAI,IAAI,KAAK,SAAA,IAAa,CAAC,CAAC,IAAI,IAAI,KAAK,SAAS,CAAC,IAAI,IAAI,KAAK,SAAA,CAAU,CAAC,IAAI,IAAI,KAAK,WAAA,CAAY,CAAC,IAAI,IAAI,KAAK,WAAA,CAAY,CAAC;AAC7J;AAGO,SAAS,gBAAgB,KAA8B;AAC5D,SAAO,IAAI,WAAW,YAAY,QAAQ,IAAI,QAAQ;AACxD;AAGO,SAAS,cAAc,OAA6C;AACzE,QAAM,OAA0B,CAAA;AAChC,QAAM,QAAQ,CAAC,SAA0B;AACvC,SAAK,KAAK,IAAI;AACd,SAAK,SAAS,QAAQ,KAAK;AAAA,EAC7B;AACA,QAAM,QAAQ,KAAK;AACnB,SAAO;AACT;AAGO,SAAS,iBAAiB,OAA0C;AACzE,SAAO,SAAS,OAAO,MAAM,GAAG,MAAM,QAAQ,CAAC,CAAC;AAClD;AAEA,SAAS,SAAS,SAAuC;AACvD,SAAO,QAAQ,QAAQ,CAAC,WAAY,OAAO,cAAc,OAAO,CAAA,IAAK,CAAC,OAAO,UAAU,CAAE;AAC3F;AAGO,SAAS,eAAe,SAAoD;AACjF,QAAM,4BAAY,IAAA;AAClB,aAAW,UAAU,QAAS,OAAM,IAAI,OAAO,KAAK,CAAC,GAAI,MAAM,IAAI,OAAO,GAAG,KAAK,CAAA,GAAK,MAAM,CAAC;AAC9F,SAAO,IAAI,IAAI,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,SAAS,KAAK,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;AACvG;AAGO,SAAS,cAAc,SAA6B,KAA+C;AACxG,QAAM,MAAM,QAAQ,OAAO,CAAC,WAAW,OAAO,QAAQ,GAAG,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;AACzF,SAAO,EAAE,KAAK,SAAS,GAAG,GAAG,KAAK,IAAI,IAAI,CAAC,WAAW,OAAO,QAAQ,EAAA;AACvE;AAGO,SAAS,gBAAgB,QAAkB,OAAe,QAAoC;AACnG,MAAI,OAAO,SAAS,EAAG,QAAO;AAC9B,QAAM,MAAM,KAAK,IAAI,GAAG,MAAM;AAC9B,SAAO,OACJ,IAAI,CAAC,OAAO,UAAU;AACrB,UAAM,IAAK,SAAS,OAAO,SAAS,KAAM;AAC1C,UAAM,IAAI,QAAQ,IAAI,SAAS,SAAU,QAAQ,MAAO;AACxD,WAAO,GAAG,EAAE,QAAQ,CAAC,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AAAA,EACxC,CAAC,EACA,KAAK,GAAG;AACb;"}

package/dist/data/traces/profile-aggregate.cjs

@@ -0,0 +1,78 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const format = require("../../lib/format.cjs");
+function profileValueTypes(samples) {
+  const seen = /* @__PURE__ */ new Map();
+  for (const sample of samples) {
+    if (!seen.has(sample.sampleType)) seen.set(sample.sampleType, { sampleType: sample.sampleType, unit: sample.unit });
+  }
+  return [...seen.values()];
+}
+function ofType(samples, sampleType) {
+  const own = samples.filter((sample) => sample.sampleType === sampleType);
+  const units = new Set(own.map((sample) => sample.unit));
+  if (units.size > 1) {
+    throw new Error(`sample type "${sampleType}" has mixed units ${[...units].map((unit) => `"${unit}"`).join(", ")}`);
+  }
+  for (const sample of own) {
+    if (sample.frames.length === 0) throw new Error(`a "${sampleType}" sample has no frames`);
+  }
+  return own;
+}
+function aggregateProfile(samples, sampleType) {
+  var _a;
+  const own = ofType(samples, sampleType);
+  const rows = /* @__PURE__ */ new Map();
+  let total = 0;
+  for (const sample of own) {
+    total += sample.value;
+    for (const frame of sample.frames) {
+      if (!rows.has(frame.func)) {
+        rows.set(frame.func, { func: frame.func, file: frame.file, line: frame.line, flat: 0, cum: 0 });
+      }
+    }
+    for (const func of new Set(sample.frames.map((frame) => frame.func))) rows.get(func).cum += sample.value;
+    rows.get(sample.frames[0].func).flat += sample.value;
+  }
+  return {
+    total,
+    unit: ((_a = own[0]) == null ? void 0 : _a.unit) ?? "",
+    functions: [...rows.values()].sort((a, b) => b.flat - a.flat || b.cum - a.cum || a.func.localeCompare(b.func))
+  };
+}
+function stacksThrough(samples, sampleType, func, limit) {
+  const stacks = /* @__PURE__ */ new Map();
+  for (const sample of ofType(samples, sampleType)) {
+    if (!sample.frames.some((frame) => frame.func === func)) continue;
+    const id = sample.frames.map((frame) => `${frame.func}@${frame.file}:${frame.line}`).join("\n");
+    const stack = stacks.get(id);
+    if (stack) stack.value += sample.value;
+    else stacks.set(id, { frames: sample.frames, value: sample.value });
+  }
+  return [...stacks.values()].sort((a, b) => b.value - a.value).slice(0, limit);
+}
+const NANOS_PER_MS = 1e6;
+function formatProfileValue(value, unit) {
+  switch (unit) {
+    case "bytes":
+      return format.formatBytes(value);
+    case "nanoseconds":
+      return Math.abs(value) < NANOS_PER_MS ? `${format.formatShort(value / 1e3)} µs` : format.formatDuration(value / NANOS_PER_MS);
+    case "microseconds":
+      return Math.abs(value) < 1e3 ? `${format.formatShort(value)} µs` : format.formatDuration(value / 1e3);
+    case "milliseconds":
+      return format.formatDuration(value);
+    case "seconds":
+      return format.formatDuration(value, { from: "s" });
+    case "count":
+    case "":
+      return format.formatShort(value);
+    default:
+      return `${format.formatShort(value)} ${unit}`;
+  }
+}
+exports.aggregateProfile = aggregateProfile;
+exports.formatProfileValue = formatProfileValue;
+exports.profileValueTypes = profileValueTypes;
+exports.stacksThrough = stacksThrough;
+//# sourceMappingURL=profile-aggregate.cjs.map

package/dist/data/traces/profile-aggregate.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"profile-aggregate.cjs","sources":["../../../src/data/traces/profile-aggregate.ts"],"sourcesContent":["import { formatBytes, formatDuration, formatShort } from \"../../lib/format\";\nimport type { ProfileSample, StackFrame } from \"./types\";\n\n/** A sample type of a profile with its unit, for example `cpu` in `nanoseconds`. */\nexport type ProfileValueType = { sampleType: string; unit: string };\n\n/** One function's share of a profile. */\nexport type ProfileFunctionRow = {\n  func: string;\n  /** Where the function was first seen in the samples. */\n  file: string;\n  line: number;\n  /** Value of the samples whose innermost frame is this function. */\n  flat: number;\n  /** Value of the samples whose stack contains this function at all, counted once per sample. */\n  cum: number;\n};\n\nexport type ProfileAggregate = {\n  total: number;\n  unit: string;\n  /** Every function, sorted by `flat` descending. */\n  functions: ProfileFunctionRow[];\n};\n\n/** A distinct stack and the value of all the samples that shared it. */\nexport type ProfileStack = { frames: StackFrame[]; value: number };\n\n/** The sample types present, in order of first appearance. */\nexport function profileValueTypes(samples: ProfileSample[]): ProfileValueType[] {\n  const seen = new Map<string, ProfileValueType>();\n  for (const sample of samples) {\n    if (!seen.has(sample.sampleType)) seen.set(sample.sampleType, { sampleType: sample.sampleType, unit: sample.unit });\n  }\n  return [...seen.values()];\n}\n\nfunction ofType(samples: ProfileSample[], sampleType: string): ProfileSample[] {\n  const own = samples.filter((sample) => sample.sampleType === sampleType);\n  const units = new Set(own.map((sample) => sample.unit));\n  if (units.size > 1) {\n    throw new Error(`sample type \"${sampleType}\" has mixed units ${[...units].map((unit) => `\"${unit}\"`).join(\", \")}`);\n  }\n  for (const sample of own) {\n    if (sample.frames.length === 0) throw new Error(`a \"${sampleType}\" sample has no frames`);\n  }\n  return own;\n}\n\n/**\n * Totals one sample type's samples per function: flat (the innermost frame) and\n * cumulative (anywhere in the stack, once per sample even when the function\n * recurses). Frames are innermost first.\n */\nexport function aggregateProfile(samples: ProfileSample[], sampleType: string): ProfileAggregate {\n  const own = ofType(samples, sampleType);\n  const rows = new Map<string, ProfileFunctionRow>();\n  let total = 0;\n  for (const sample of own) {\n    total += sample.value;\n    for (const frame of sample.frames) {\n      if (!rows.has(frame.func)) {\n        rows.set(frame.func, { func: frame.func, file: frame.file, line: frame.line, flat: 0, cum: 0 });\n      }\n    }\n    for (const func of new Set(sample.frames.map((frame) => frame.func))) rows.get(func)!.cum += sample.value;\n    rows.get(sample.frames[0]!.func)!.flat += sample.value;\n  }\n  return {\n    total,\n    unit: own[0]?.unit ?? \"\",\n    functions: [...rows.values()].sort((a, b) => b.flat - a.flat || b.cum - a.cum || a.func.localeCompare(b.func)),\n  };\n}\n\n/** The heaviest distinct stacks of one sample type that pass through `func`, heaviest first. */\nexport function stacksThrough(samples: ProfileSample[], sampleType: string, func: string, limit: number): ProfileStack[] {\n  const stacks = new Map<string, ProfileStack>();\n  for (const sample of ofType(samples, sampleType)) {\n    if (!sample.frames.some((frame) => frame.func === func)) continue;\n    const id = sample.frames.map((frame) => `${frame.func}@${frame.file}:${frame.line}`).join(\"\\n\");\n    const stack = stacks.get(id);\n    if (stack) stack.value += sample.value;\n    else stacks.set(id, { frames: sample.frames, value: sample.value });\n  }\n  return [...stacks.values()].sort((a, b) => b.value - a.value).slice(0, limit);\n}\n\nconst NANOS_PER_MS = 1e6;\n\n/** A profile value for display in its unit: bytes, durations and plain counts. */\nexport function formatProfileValue(value: number, unit: string): string {\n  switch (unit) {\n    case \"bytes\":\n      return formatBytes(value);\n    case \"nanoseconds\":\n      return Math.abs(value) < NANOS_PER_MS ? `${formatShort(value / 1e3)} µs` : formatDuration(value / NANOS_PER_MS);\n    case \"microseconds\":\n      return Math.abs(value) < 1e3 ? `${formatShort(value)} µs` : formatDuration(value / 1e3);\n    case \"milliseconds\":\n      return formatDuration(value);\n    case \"seconds\":\n      return formatDuration(value, { from: \"s\" });\n    case \"count\":\n    case \"\":\n      return formatShort(value);\n    default:\n      return `${formatShort(value)} ${unit}`;\n  }\n}\n"],"names":["formatBytes","formatShort","formatDuration"],"mappings":";;;AA6BO,SAAS,kBAAkB,SAA8C;AAC9E,QAAM,2BAAW,IAAA;AACjB,aAAW,UAAU,SAAS;AAC5B,QAAI,CAAC,KAAK,IAAI,OAAO,UAAU,EAAG,MAAK,IAAI,OAAO,YAAY,EAAE,YAAY,OAAO,YAAY,MAAM,OAAO,MAAM;AAAA,EACpH;AACA,SAAO,CAAC,GAAG,KAAK,QAAQ;AAC1B;AAEA,SAAS,OAAO,SAA0B,YAAqC;AAC7E,QAAM,MAAM,QAAQ,OAAO,CAAC,WAAW,OAAO,eAAe,UAAU;AACvE,QAAM,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC,WAAW,OAAO,IAAI,CAAC;AACtD,MAAI,MAAM,OAAO,GAAG;AAClB,UAAM,IAAI,MAAM,gBAAgB,UAAU,qBAAqB,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,SAAS,IAAI,IAAI,GAAG,EAAE,KAAK,IAAI,CAAC,EAAE;AAAA,EACnH;AACA,aAAW,UAAU,KAAK;AACxB,QAAI,OAAO,OAAO,WAAW,SAAS,IAAI,MAAM,MAAM,UAAU,wBAAwB;AAAA,EAC1F;AACA,SAAO;AACT;AAOO,SAAS,iBAAiB,SAA0B,YAAsC;;AAC/F,QAAM,MAAM,OAAO,SAAS,UAAU;AACtC,QAAM,2BAAW,IAAA;AACjB,MAAI,QAAQ;AACZ,aAAW,UAAU,KAAK;AACxB,aAAS,OAAO;AAChB,eAAW,SAAS,OAAO,QAAQ;AACjC,UAAI,CAAC,KAAK,IAAI,MAAM,IAAI,GAAG;AACzB,aAAK,IAAI,MAAM,MAAM,EAAE,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,GAAG,KAAK,GAAG;AAAA,MAChG;AAAA,IACF;AACA,eAAW,QAAQ,IAAI,IAAI,OAAO,OAAO,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC,EAAG,MAAK,IAAI,IAAI,EAAG,OAAO,OAAO;AACpG,SAAK,IAAI,OAAO,OAAO,CAAC,EAAG,IAAI,EAAG,QAAQ,OAAO;AAAA,EACnD;AACA,SAAO;AAAA,IACL;AAAA,IACA,QAAM,SAAI,CAAC,MAAL,mBAAQ,SAAQ;AAAA,IACtB,WAAW,CAAC,GAAG,KAAK,OAAA,CAAQ,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AAAA,EAAA;AAEjH;AAGO,SAAS,cAAc,SAA0B,YAAoB,MAAc,OAA+B;AACvH,QAAM,6BAAa,IAAA;AACnB,aAAW,UAAU,OAAO,SAAS,UAAU,GAAG;AAChD,QAAI,CAAC,OAAO,OAAO,KAAK,CAAC,UAAU,MAAM,SAAS,IAAI,EAAG;AACzD,UAAM,KAAK,OAAO,OAAO,IAAI,CAAC,UAAU,GAAG,MAAM,IAAI,IAAI,MAAM,IAAI,IAAI,MAAM,IAAI,EAAE,EAAE,KAAK,IAAI;AAC9F,UAAM,QAAQ,OAAO,IAAI,EAAE;AAC3B,QAAI,MAAO,OAAM,SAAS,OAAO;AAAA,QAC5B,QAAO,IAAI,IAAI,EAAE,QAAQ,OAAO,QAAQ,OAAO,OAAO,OAAO;AAAA,EACpE;AACA,SAAO,CAAC,GAAG,OAAO,OAAA,CAAQ,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,GAAG,KAAK;AAC9E;AAEA,MAAM,eAAe;AAGd,SAAS,mBAAmB,OAAe,MAAsB;AACtE,UAAQ,MAAA;AAAA,IACN,KAAK;AACH,aAAOA,OAAAA,YAAY,KAAK;AAAA,IAC1B,KAAK;AACH,aAAO,KAAK,IAAI,KAAK,IAAI,eAAe,GAAGC,OAAAA,YAAY,QAAQ,GAAG,CAAC,QAAQC,OAAAA,eAAe,QAAQ,YAAY;AAAA,IAChH,KAAK;AACH,aAAO,KAAK,IAAI,KAAK,IAAI,MAAM,GAAGD,mBAAY,KAAK,CAAC,QAAQC,OAAAA,eAAe,QAAQ,GAAG;AAAA,IACxF,KAAK;AACH,aAAOA,OAAAA,eAAe,KAAK;AAAA,IAC7B,KAAK;AACH,aAAOA,OAAAA,eAAe,OAAO,EAAE,MAAM,KAAK;AAAA,IAC5C,KAAK;AAAA,IACL,KAAK;AACH,aAAOD,OAAAA,YAAY,KAAK;AAAA,IAC1B;AACE,aAAO,GAAGA,OAAAA,YAAY,KAAK,CAAC,IAAI,IAAI;AAAA,EAAA;AAE1C;;;;;"}

package/dist/data/traces/profile-aggregate.d.ts

@@ -0,0 +1,41 @@
+import { ProfileSample, StackFrame } from './types.js';
+/** A sample type of a profile with its unit, for example `cpu` in `nanoseconds`. */
+export type ProfileValueType = {
+    sampleType: string;
+    unit: string;
+};
+/** One function's share of a profile. */
+export type ProfileFunctionRow = {
+    func: string;
+    /** Where the function was first seen in the samples. */
+    file: string;
+    line: number;
+    /** Value of the samples whose innermost frame is this function. */
+    flat: number;
+    /** Value of the samples whose stack contains this function at all, counted once per sample. */
+    cum: number;
+};
+export type ProfileAggregate = {
+    total: number;
+    unit: string;
+    /** Every function, sorted by `flat` descending. */
+    functions: ProfileFunctionRow[];
+};
+/** A distinct stack and the value of all the samples that shared it. */
+export type ProfileStack = {
+    frames: StackFrame[];
+    value: number;
+};
+/** The sample types present, in order of first appearance. */
+export declare function profileValueTypes(samples: ProfileSample[]): ProfileValueType[];
+/**
+ * Totals one sample type's samples per function: flat (the innermost frame) and
+ * cumulative (anywhere in the stack, once per sample even when the function
+ * recurses). Frames are innermost first.
+ */
+export declare function aggregateProfile(samples: ProfileSample[], sampleType: string): ProfileAggregate;
+/** The heaviest distinct stacks of one sample type that pass through `func`, heaviest first. */
+export declare function stacksThrough(samples: ProfileSample[], sampleType: string, func: string, limit: number): ProfileStack[];
+/** A profile value for display in its unit: bytes, durations and plain counts. */
+export declare function formatProfileValue(value: number, unit: string): string;
+//# sourceMappingURL=profile-aggregate.d.ts.map

package/dist/data/traces/profile-aggregate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"profile-aggregate.d.ts","sourceRoot":"","sources":["../../../src/data/traces/profile-aggregate.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAEzD,oFAAoF;AACpF,MAAM,MAAM,gBAAgB,GAAG;IAAE,UAAU,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC;AAEpE,yCAAyC;AACzC,MAAM,MAAM,kBAAkB,GAAG;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,wDAAwD;IACxD,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,mEAAmE;IACnE,IAAI,EAAE,MAAM,CAAC;IACb,+FAA+F;IAC/F,GAAG,EAAE,MAAM,CAAC;CACb,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,mDAAmD;IACnD,SAAS,EAAE,kBAAkB,EAAE,CAAC;CACjC,CAAC;AAEF,wEAAwE;AACxE,MAAM,MAAM,YAAY,GAAG;IAAE,MAAM,EAAE,UAAU,EAAE,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAEnE,8DAA8D;AAC9D,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,aAAa,EAAE,GAAG,gBAAgB,EAAE,CAM9E;AAcD;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,aAAa,EAAE,EAAE,UAAU,EAAE,MAAM,GAAG,gBAAgB,CAmB/F;AAED,gGAAgG;AAChG,wBAAgB,aAAa,CAAC,OAAO,EAAE,aAAa,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,YAAY,EAAE,CAUvH;AAID,kFAAkF;AAClF,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAkBtE"}

package/dist/data/traces/profile-aggregate.js

@@ -0,0 +1,78 @@
+import { formatShort, formatDuration, formatBytes } from "../../lib/format.js";
+function profileValueTypes(samples) {
+  const seen = /* @__PURE__ */ new Map();
+  for (const sample of samples) {
+    if (!seen.has(sample.sampleType)) seen.set(sample.sampleType, { sampleType: sample.sampleType, unit: sample.unit });
+  }
+  return [...seen.values()];
+}
+function ofType(samples, sampleType) {
+  const own = samples.filter((sample) => sample.sampleType === sampleType);
+  const units = new Set(own.map((sample) => sample.unit));
+  if (units.size > 1) {
+    throw new Error(`sample type "${sampleType}" has mixed units ${[...units].map((unit) => `"${unit}"`).join(", ")}`);
+  }
+  for (const sample of own) {
+    if (sample.frames.length === 0) throw new Error(`a "${sampleType}" sample has no frames`);
+  }
+  return own;
+}
+function aggregateProfile(samples, sampleType) {
+  var _a;
+  const own = ofType(samples, sampleType);
+  const rows = /* @__PURE__ */ new Map();
+  let total = 0;
+  for (const sample of own) {
+    total += sample.value;
+    for (const frame of sample.frames) {
+      if (!rows.has(frame.func)) {
+        rows.set(frame.func, { func: frame.func, file: frame.file, line: frame.line, flat: 0, cum: 0 });
+      }
+    }
+    for (const func of new Set(sample.frames.map((frame) => frame.func))) rows.get(func).cum += sample.value;
+    rows.get(sample.frames[0].func).flat += sample.value;
+  }
+  return {
+    total,
+    unit: ((_a = own[0]) == null ? void 0 : _a.unit) ?? "",
+    functions: [...rows.values()].sort((a, b) => b.flat - a.flat || b.cum - a.cum || a.func.localeCompare(b.func))
+  };
+}
+function stacksThrough(samples, sampleType, func, limit) {
+  const stacks = /* @__PURE__ */ new Map();
+  for (const sample of ofType(samples, sampleType)) {
+    if (!sample.frames.some((frame) => frame.func === func)) continue;
+    const id = sample.frames.map((frame) => `${frame.func}@${frame.file}:${frame.line}`).join("\n");
+    const stack = stacks.get(id);
+    if (stack) stack.value += sample.value;
+    else stacks.set(id, { frames: sample.frames, value: sample.value });
+  }
+  return [...stacks.values()].sort((a, b) => b.value - a.value).slice(0, limit);
+}
+const NANOS_PER_MS = 1e6;
+function formatProfileValue(value, unit) {
+  switch (unit) {
+    case "bytes":
+      return formatBytes(value);
+    case "nanoseconds":
+      return Math.abs(value) < NANOS_PER_MS ? `${formatShort(value / 1e3)} µs` : formatDuration(value / NANOS_PER_MS);
+    case "microseconds":
+      return Math.abs(value) < 1e3 ? `${formatShort(value)} µs` : formatDuration(value / 1e3);
+    case "milliseconds":
+      return formatDuration(value);
+    case "seconds":
+      return formatDuration(value, { from: "s" });
+    case "count":
+    case "":
+      return formatShort(value);
+    default:
+      return `${formatShort(value)} ${unit}`;
+  }
+}
+export {
+  aggregateProfile,
+  formatProfileValue,
+  profileValueTypes,
+  stacksThrough
+};
+//# sourceMappingURL=profile-aggregate.js.map

package/dist/data/traces/profile-aggregate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"profile-aggregate.js","sources":["../../../src/data/traces/profile-aggregate.ts"],"sourcesContent":["import { formatBytes, formatDuration, formatShort } from \"../../lib/format\";\nimport type { ProfileSample, StackFrame } from \"./types\";\n\n/** A sample type of a profile with its unit, for example `cpu` in `nanoseconds`. */\nexport type ProfileValueType = { sampleType: string; unit: string };\n\n/** One function's share of a profile. */\nexport type ProfileFunctionRow = {\n  func: string;\n  /** Where the function was first seen in the samples. */\n  file: string;\n  line: number;\n  /** Value of the samples whose innermost frame is this function. */\n  flat: number;\n  /** Value of the samples whose stack contains this function at all, counted once per sample. */\n  cum: number;\n};\n\nexport type ProfileAggregate = {\n  total: number;\n  unit: string;\n  /** Every function, sorted by `flat` descending. */\n  functions: ProfileFunctionRow[];\n};\n\n/** A distinct stack and the value of all the samples that shared it. */\nexport type ProfileStack = { frames: StackFrame[]; value: number };\n\n/** The sample types present, in order of first appearance. */\nexport function profileValueTypes(samples: ProfileSample[]): ProfileValueType[] {\n  const seen = new Map<string, ProfileValueType>();\n  for (const sample of samples) {\n    if (!seen.has(sample.sampleType)) seen.set(sample.sampleType, { sampleType: sample.sampleType, unit: sample.unit });\n  }\n  return [...seen.values()];\n}\n\nfunction ofType(samples: ProfileSample[], sampleType: string): ProfileSample[] {\n  const own = samples.filter((sample) => sample.sampleType === sampleType);\n  const units = new Set(own.map((sample) => sample.unit));\n  if (units.size > 1) {\n    throw new Error(`sample type \"${sampleType}\" has mixed units ${[...units].map((unit) => `\"${unit}\"`).join(\", \")}`);\n  }\n  for (const sample of own) {\n    if (sample.frames.length === 0) throw new Error(`a \"${sampleType}\" sample has no frames`);\n  }\n  return own;\n}\n\n/**\n * Totals one sample type's samples per function: flat (the innermost frame) and\n * cumulative (anywhere in the stack, once per sample even when the function\n * recurses). Frames are innermost first.\n */\nexport function aggregateProfile(samples: ProfileSample[], sampleType: string): ProfileAggregate {\n  const own = ofType(samples, sampleType);\n  const rows = new Map<string, ProfileFunctionRow>();\n  let total = 0;\n  for (const sample of own) {\n    total += sample.value;\n    for (const frame of sample.frames) {\n      if (!rows.has(frame.func)) {\n        rows.set(frame.func, { func: frame.func, file: frame.file, line: frame.line, flat: 0, cum: 0 });\n      }\n    }\n    for (const func of new Set(sample.frames.map((frame) => frame.func))) rows.get(func)!.cum += sample.value;\n    rows.get(sample.frames[0]!.func)!.flat += sample.value;\n  }\n  return {\n    total,\n    unit: own[0]?.unit ?? \"\",\n    functions: [...rows.values()].sort((a, b) => b.flat - a.flat || b.cum - a.cum || a.func.localeCompare(b.func)),\n  };\n}\n\n/** The heaviest distinct stacks of one sample type that pass through `func`, heaviest first. */\nexport function stacksThrough(samples: ProfileSample[], sampleType: string, func: string, limit: number): ProfileStack[] {\n  const stacks = new Map<string, ProfileStack>();\n  for (const sample of ofType(samples, sampleType)) {\n    if (!sample.frames.some((frame) => frame.func === func)) continue;\n    const id = sample.frames.map((frame) => `${frame.func}@${frame.file}:${frame.line}`).join(\"\\n\");\n    const stack = stacks.get(id);\n    if (stack) stack.value += sample.value;\n    else stacks.set(id, { frames: sample.frames, value: sample.value });\n  }\n  return [...stacks.values()].sort((a, b) => b.value - a.value).slice(0, limit);\n}\n\nconst NANOS_PER_MS = 1e6;\n\n/** A profile value for display in its unit: bytes, durations and plain counts. */\nexport function formatProfileValue(value: number, unit: string): string {\n  switch (unit) {\n    case \"bytes\":\n      return formatBytes(value);\n    case \"nanoseconds\":\n      return Math.abs(value) < NANOS_PER_MS ? `${formatShort(value / 1e3)} µs` : formatDuration(value / NANOS_PER_MS);\n    case \"microseconds\":\n      return Math.abs(value) < 1e3 ? `${formatShort(value)} µs` : formatDuration(value / 1e3);\n    case \"milliseconds\":\n      return formatDuration(value);\n    case \"seconds\":\n      return formatDuration(value, { from: \"s\" });\n    case \"count\":\n    case \"\":\n      return formatShort(value);\n    default:\n      return `${formatShort(value)} ${unit}`;\n  }\n}\n"],"names":[],"mappings":";AA6BO,SAAS,kBAAkB,SAA8C;AAC9E,QAAM,2BAAW,IAAA;AACjB,aAAW,UAAU,SAAS;AAC5B,QAAI,CAAC,KAAK,IAAI,OAAO,UAAU,EAAG,MAAK,IAAI,OAAO,YAAY,EAAE,YAAY,OAAO,YAAY,MAAM,OAAO,MAAM;AAAA,EACpH;AACA,SAAO,CAAC,GAAG,KAAK,QAAQ;AAC1B;AAEA,SAAS,OAAO,SAA0B,YAAqC;AAC7E,QAAM,MAAM,QAAQ,OAAO,CAAC,WAAW,OAAO,eAAe,UAAU;AACvE,QAAM,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC,WAAW,OAAO,IAAI,CAAC;AACtD,MAAI,MAAM,OAAO,GAAG;AAClB,UAAM,IAAI,MAAM,gBAAgB,UAAU,qBAAqB,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,SAAS,IAAI,IAAI,GAAG,EAAE,KAAK,IAAI,CAAC,EAAE;AAAA,EACnH;AACA,aAAW,UAAU,KAAK;AACxB,QAAI,OAAO,OAAO,WAAW,SAAS,IAAI,MAAM,MAAM,UAAU,wBAAwB;AAAA,EAC1F;AACA,SAAO;AACT;AAOO,SAAS,iBAAiB,SAA0B,YAAsC;;AAC/F,QAAM,MAAM,OAAO,SAAS,UAAU;AACtC,QAAM,2BAAW,IAAA;AACjB,MAAI,QAAQ;AACZ,aAAW,UAAU,KAAK;AACxB,aAAS,OAAO;AAChB,eAAW,SAAS,OAAO,QAAQ;AACjC,UAAI,CAAC,KAAK,IAAI,MAAM,IAAI,GAAG;AACzB,aAAK,IAAI,MAAM,MAAM,EAAE,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,GAAG,KAAK,GAAG;AAAA,MAChG;AAAA,IACF;AACA,eAAW,QAAQ,IAAI,IAAI,OAAO,OAAO,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC,EAAG,MAAK,IAAI,IAAI,EAAG,OAAO,OAAO;AACpG,SAAK,IAAI,OAAO,OAAO,CAAC,EAAG,IAAI,EAAG,QAAQ,OAAO;AAAA,EACnD;AACA,SAAO;AAAA,IACL;AAAA,IACA,QAAM,SAAI,CAAC,MAAL,mBAAQ,SAAQ;AAAA,IACtB,WAAW,CAAC,GAAG,KAAK,OAAA,CAAQ,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AAAA,EAAA;AAEjH;AAGO,SAAS,cAAc,SAA0B,YAAoB,MAAc,OAA+B;AACvH,QAAM,6BAAa,IAAA;AACnB,aAAW,UAAU,OAAO,SAAS,UAAU,GAAG;AAChD,QAAI,CAAC,OAAO,OAAO,KAAK,CAAC,UAAU,MAAM,SAAS,IAAI,EAAG;AACzD,UAAM,KAAK,OAAO,OAAO,IAAI,CAAC,UAAU,GAAG,MAAM,IAAI,IAAI,MAAM,IAAI,IAAI,MAAM,IAAI,EAAE,EAAE,KAAK,IAAI;AAC9F,UAAM,QAAQ,OAAO,IAAI,EAAE;AAC3B,QAAI,MAAO,OAAM,SAAS,OAAO;AAAA,QAC5B,QAAO,IAAI,IAAI,EAAE,QAAQ,OAAO,QAAQ,OAAO,OAAO,OAAO;AAAA,EACpE;AACA,SAAO,CAAC,GAAG,OAAO,OAAA,CAAQ,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,GAAG,KAAK;AAC9E;AAEA,MAAM,eAAe;AAGd,SAAS,mBAAmB,OAAe,MAAsB;AACtE,UAAQ,MAAA;AAAA,IACN,KAAK;AACH,aAAO,YAAY,KAAK;AAAA,IAC1B,KAAK;AACH,aAAO,KAAK,IAAI,KAAK,IAAI,eAAe,GAAG,YAAY,QAAQ,GAAG,CAAC,QAAQ,eAAe,QAAQ,YAAY;AAAA,IAChH,KAAK;AACH,aAAO,KAAK,IAAI,KAAK,IAAI,MAAM,GAAG,YAAY,KAAK,CAAC,QAAQ,eAAe,QAAQ,GAAG;AAAA,IACxF,KAAK;AACH,aAAO,eAAe,KAAK;AAAA,IAC7B,KAAK;AACH,aAAO,eAAe,OAAO,EAAE,MAAM,KAAK;AAAA,IAC5C,KAAK;AAAA,IACL,KAAK;AACH,aAAO,YAAY,KAAK;AAAA,IAC1B;AACE,aAAO,GAAG,YAAY,KAAK,CAAC,IAAI,IAAI;AAAA,EAAA;AAE1C;"}

package/dist/data/traces/sql-trace.cjs

@@ -0,0 +1,39 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const format = require("../../lib/format.cjs");
+function formatStatementDuration(ms) {
+  if (ms >= 100) return format.formatDuration(ms);
+  return `${Number(ms.toFixed(1))} ms`;
+}
+function sumKnownRows(statements) {
+  const known = statements.filter((statement) => statement.rows >= 0);
+  return known.length === 0 ? -1 : known.reduce((total, statement) => total + statement.rows, 0);
+}
+function toDisplayRow(id, statements) {
+  var _a;
+  const [first] = statements;
+  return {
+    id,
+    startedAt: first.startedAt,
+    op: first.op,
+    tables: first.tables,
+    sql: first.sql,
+    durationMs: statements.reduce((total, statement) => total + statement.durationMs, 0),
+    rows: sumKnownRows(statements),
+    error: ((_a = statements.find((statement) => statement.error)) == null ? void 0 : _a.error) ?? "",
+    failed: statements.filter((statement) => statement.error).length,
+    count: statements.length,
+    occurrences: statements
+  };
+}
+function groupStatements(statements, options) {
+  const groups = /* @__PURE__ */ new Map();
+  statements.forEach((statement, index) => {
+    const key = options.group && statement.repeatKey ? `repeat:${statement.repeatKey}` : `row:${index}`;
+    groups.set(key, [...groups.get(key) ?? [], statement]);
+  });
+  return [...groups].map(([key, members]) => toDisplayRow(key, members));
+}
+exports.formatStatementDuration = formatStatementDuration;
+exports.groupStatements = groupStatements;
+//# sourceMappingURL=sql-trace.cjs.map

package/dist/data/traces/sql-trace.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"sql-trace.cjs","sources":["../../../src/data/traces/sql-trace.ts"],"sourcesContent":["import { formatDuration } from \"../../lib/format\";\nimport type { SqlStatementRow } from \"./types\";\n\n/** One table row: a statement, or every execution of statements sharing a `repeatKey`. */\nexport type SqlDisplayRow = {\n  id: string;\n  startedAt: string;\n  op: string;\n  tables: string[];\n  sql: string;\n  /** Total of the executions. */\n  durationMs: number;\n  /** Rows the executions returned, or -1 when no driver could tell. */\n  rows: number;\n  /** The first error among the executions, or \"\". */\n  error: string;\n  /** How many executions returned an error. */\n  failed: number;\n  /** How many executions the row stands for. */\n  count: number;\n  occurrences: SqlStatementRow[];\n};\n\n/** A statement's duration: sub-100ms values keep a decimal (a fast query is 0.9 ms, not 1 ms), longer ones read as elsewhere. */\nexport function formatStatementDuration(ms: number): string {\n  if (ms >= 100) return formatDuration(ms);\n  return `${Number(ms.toFixed(1))} ms`;\n}\n\nfunction sumKnownRows(statements: SqlStatementRow[]): number {\n  const known = statements.filter((statement) => statement.rows >= 0);\n  return known.length === 0 ? -1 : known.reduce((total, statement) => total + statement.rows, 0);\n}\n\nfunction toDisplayRow(id: string, statements: SqlStatementRow[]): SqlDisplayRow {\n  const [first] = statements as [SqlStatementRow, ...SqlStatementRow[]];\n  return {\n    id,\n    startedAt: first.startedAt,\n    op: first.op,\n    tables: first.tables,\n    sql: first.sql,\n    durationMs: statements.reduce((total, statement) => total + statement.durationMs, 0),\n    rows: sumKnownRows(statements),\n    error: statements.find((statement) => statement.error)?.error ?? \"\",\n    failed: statements.filter((statement) => statement.error).length,\n    count: statements.length,\n    occurrences: statements,\n  };\n}\n\n/**\n * Turns statements into table rows. With `group`, statements sharing a\n * non-empty `repeatKey` (the same statement run with different values) become\n * one row, placed where the first of them ran.\n */\nexport function groupStatements(statements: SqlStatementRow[], options: { group: boolean }): SqlDisplayRow[] {\n  const groups = new Map<string, SqlStatementRow[]>();\n  statements.forEach((statement, index) => {\n    const key = options.group && statement.repeatKey ? `repeat:${statement.repeatKey}` : `row:${index}`;\n    groups.set(key, [...(groups.get(key) ?? []), statement]);\n  });\n  return [...groups].map(([key, members]) => toDisplayRow(key, members));\n}\n"],"names":["formatDuration"],"mappings":";;;AAwBO,SAAS,wBAAwB,IAAoB;AAC1D,MAAI,MAAM,IAAK,QAAOA,OAAAA,eAAe,EAAE;AACvC,SAAO,GAAG,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC;AACjC;AAEA,SAAS,aAAa,YAAuC;AAC3D,QAAM,QAAQ,WAAW,OAAO,CAAC,cAAc,UAAU,QAAQ,CAAC;AAClE,SAAO,MAAM,WAAW,IAAI,KAAK,MAAM,OAAO,CAAC,OAAO,cAAc,QAAQ,UAAU,MAAM,CAAC;AAC/F;AAEA,SAAS,aAAa,IAAY,YAA8C;;AAC9E,QAAM,CAAC,KAAK,IAAI;AAChB,SAAO;AAAA,IACL;AAAA,IACA,WAAW,MAAM;AAAA,IACjB,IAAI,MAAM;AAAA,IACV,QAAQ,MAAM;AAAA,IACd,KAAK,MAAM;AAAA,IACX,YAAY,WAAW,OAAO,CAAC,OAAO,cAAc,QAAQ,UAAU,YAAY,CAAC;AAAA,IACnF,MAAM,aAAa,UAAU;AAAA,IAC7B,SAAO,gBAAW,KAAK,CAAC,cAAc,UAAU,KAAK,MAA9C,mBAAiD,UAAS;AAAA,IACjE,QAAQ,WAAW,OAAO,CAAC,cAAc,UAAU,KAAK,EAAE;AAAA,IAC1D,OAAO,WAAW;AAAA,IAClB,aAAa;AAAA,EAAA;AAEjB;AAOO,SAAS,gBAAgB,YAA+B,SAA8C;AAC3G,QAAM,6BAAa,IAAA;AACnB,aAAW,QAAQ,CAAC,WAAW,UAAU;AACvC,UAAM,MAAM,QAAQ,SAAS,UAAU,YAAY,UAAU,UAAU,SAAS,KAAK,OAAO,KAAK;AACjG,WAAO,IAAI,KAAK,CAAC,GAAI,OAAO,IAAI,GAAG,KAAK,IAAK,SAAS,CAAC;AAAA,EACzD,CAAC;AACD,SAAO,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK,OAAO,MAAM,aAAa,KAAK,OAAO,CAAC;AACvE;;;"}

package/dist/data/traces/sql-trace.d.ts

@@ -0,0 +1,31 @@
+import { SqlStatementRow } from './types.js';
+/** One table row: a statement, or every execution of statements sharing a `repeatKey`. */
+export type SqlDisplayRow = {
+    id: string;
+    startedAt: string;
+    op: string;
+    tables: string[];
+    sql: string;
+    /** Total of the executions. */
+    durationMs: number;
+    /** Rows the executions returned, or -1 when no driver could tell. */
+    rows: number;
+    /** The first error among the executions, or "". */
+    error: string;
+    /** How many executions returned an error. */
+    failed: number;
+    /** How many executions the row stands for. */
+    count: number;
+    occurrences: SqlStatementRow[];
+};
+/** A statement's duration: sub-100ms values keep a decimal (a fast query is 0.9 ms, not 1 ms), longer ones read as elsewhere. */
+export declare function formatStatementDuration(ms: number): string;
+/**
+ * Turns statements into table rows. With `group`, statements sharing a
+ * non-empty `repeatKey` (the same statement run with different values) become
+ * one row, placed where the first of them ran.
+ */
+export declare function groupStatements(statements: SqlStatementRow[], options: {
+    group: boolean;
+}): SqlDisplayRow[];
+//# sourceMappingURL=sql-trace.d.ts.map

package/dist/data/traces/sql-trace.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sql-trace.d.ts","sourceRoot":"","sources":["../../../src/data/traces/sql-trace.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,SAAS,CAAC;AAE/C,0FAA0F;AAC1F,MAAM,MAAM,aAAa,GAAG;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,+BAA+B;IAC/B,UAAU,EAAE,MAAM,CAAC;IACnB,qEAAqE;IACrE,IAAI,EAAE,MAAM,CAAC;IACb,mDAAmD;IACnD,KAAK,EAAE,MAAM,CAAC;IACd,6CAA6C;IAC7C,MAAM,EAAE,MAAM,CAAC;IACf,8CAA8C;IAC9C,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,eAAe,EAAE,CAAC;CAChC,CAAC;AAEF,iIAAiI;AACjI,wBAAgB,uBAAuB,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAG1D;AAwBD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,eAAe,EAAE,EAAE,OAAO,EAAE;IAAE,KAAK,EAAE,OAAO,CAAA;CAAE,GAAG,aAAa,EAAE,CAO3G"}

package/dist/data/traces/sql-trace.js

@@ -0,0 +1,39 @@
+import { formatDuration } from "../../lib/format.js";
+function formatStatementDuration(ms) {
+  if (ms >= 100) return formatDuration(ms);
+  return `${Number(ms.toFixed(1))} ms`;
+}
+function sumKnownRows(statements) {
+  const known = statements.filter((statement) => statement.rows >= 0);
+  return known.length === 0 ? -1 : known.reduce((total, statement) => total + statement.rows, 0);
+}
+function toDisplayRow(id, statements) {
+  var _a;
+  const [first] = statements;
+  return {
+    id,
+    startedAt: first.startedAt,
+    op: first.op,
+    tables: first.tables,
+    sql: first.sql,
+    durationMs: statements.reduce((total, statement) => total + statement.durationMs, 0),
+    rows: sumKnownRows(statements),
+    error: ((_a = statements.find((statement) => statement.error)) == null ? void 0 : _a.error) ?? "",
+    failed: statements.filter((statement) => statement.error).length,
+    count: statements.length,
+    occurrences: statements
+  };
+}
+function groupStatements(statements, options) {
+  const groups = /* @__PURE__ */ new Map();
+  statements.forEach((statement, index) => {
+    const key = options.group && statement.repeatKey ? `repeat:${statement.repeatKey}` : `row:${index}`;
+    groups.set(key, [...groups.get(key) ?? [], statement]);
+  });
+  return [...groups].map(([key, members]) => toDisplayRow(key, members));
+}
+export {
+  formatStatementDuration,
+  groupStatements
+};
+//# sourceMappingURL=sql-trace.js.map

package/dist/data/traces/sql-trace.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sql-trace.js","sources":["../../../src/data/traces/sql-trace.ts"],"sourcesContent":["import { formatDuration } from \"../../lib/format\";\nimport type { SqlStatementRow } from \"./types\";\n\n/** One table row: a statement, or every execution of statements sharing a `repeatKey`. */\nexport type SqlDisplayRow = {\n  id: string;\n  startedAt: string;\n  op: string;\n  tables: string[];\n  sql: string;\n  /** Total of the executions. */\n  durationMs: number;\n  /** Rows the executions returned, or -1 when no driver could tell. */\n  rows: number;\n  /** The first error among the executions, or \"\". */\n  error: string;\n  /** How many executions returned an error. */\n  failed: number;\n  /** How many executions the row stands for. */\n  count: number;\n  occurrences: SqlStatementRow[];\n};\n\n/** A statement's duration: sub-100ms values keep a decimal (a fast query is 0.9 ms, not 1 ms), longer ones read as elsewhere. */\nexport function formatStatementDuration(ms: number): string {\n  if (ms >= 100) return formatDuration(ms);\n  return `${Number(ms.toFixed(1))} ms`;\n}\n\nfunction sumKnownRows(statements: SqlStatementRow[]): number {\n  const known = statements.filter((statement) => statement.rows >= 0);\n  return known.length === 0 ? -1 : known.reduce((total, statement) => total + statement.rows, 0);\n}\n\nfunction toDisplayRow(id: string, statements: SqlStatementRow[]): SqlDisplayRow {\n  const [first] = statements as [SqlStatementRow, ...SqlStatementRow[]];\n  return {\n    id,\n    startedAt: first.startedAt,\n    op: first.op,\n    tables: first.tables,\n    sql: first.sql,\n    durationMs: statements.reduce((total, statement) => total + statement.durationMs, 0),\n    rows: sumKnownRows(statements),\n    error: statements.find((statement) => statement.error)?.error ?? \"\",\n    failed: statements.filter((statement) => statement.error).length,\n    count: statements.length,\n    occurrences: statements,\n  };\n}\n\n/**\n * Turns statements into table rows. With `group`, statements sharing a\n * non-empty `repeatKey` (the same statement run with different values) become\n * one row, placed where the first of them ran.\n */\nexport function groupStatements(statements: SqlStatementRow[], options: { group: boolean }): SqlDisplayRow[] {\n  const groups = new Map<string, SqlStatementRow[]>();\n  statements.forEach((statement, index) => {\n    const key = options.group && statement.repeatKey ? `repeat:${statement.repeatKey}` : `row:${index}`;\n    groups.set(key, [...(groups.get(key) ?? []), statement]);\n  });\n  return [...groups].map(([key, members]) => toDisplayRow(key, members));\n}\n"],"names":[],"mappings":";AAwBO,SAAS,wBAAwB,IAAoB;AAC1D,MAAI,MAAM,IAAK,QAAO,eAAe,EAAE;AACvC,SAAO,GAAG,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC;AACjC;AAEA,SAAS,aAAa,YAAuC;AAC3D,QAAM,QAAQ,WAAW,OAAO,CAAC,cAAc,UAAU,QAAQ,CAAC;AAClE,SAAO,MAAM,WAAW,IAAI,KAAK,MAAM,OAAO,CAAC,OAAO,cAAc,QAAQ,UAAU,MAAM,CAAC;AAC/F;AAEA,SAAS,aAAa,IAAY,YAA8C;;AAC9E,QAAM,CAAC,KAAK,IAAI;AAChB,SAAO;AAAA,IACL;AAAA,IACA,WAAW,MAAM;AAAA,IACjB,IAAI,MAAM;AAAA,IACV,QAAQ,MAAM;AAAA,IACd,KAAK,MAAM;AAAA,IACX,YAAY,WAAW,OAAO,CAAC,OAAO,cAAc,QAAQ,UAAU,YAAY,CAAC;AAAA,IACnF,MAAM,aAAa,UAAU;AAAA,IAC7B,SAAO,gBAAW,KAAK,CAAC,cAAc,UAAU,KAAK,MAA9C,mBAAiD,UAAS;AAAA,IACjE,QAAQ,WAAW,OAAO,CAAC,cAAc,UAAU,KAAK,EAAE;AAAA,IAC1D,OAAO,WAAW;AAAA,IAClB,aAAa;AAAA,EAAA;AAEjB;AAOO,SAAS,gBAAgB,YAA+B,SAA8C;AAC3G,QAAM,6BAAa,IAAA;AACnB,aAAW,QAAQ,CAAC,WAAW,UAAU;AACvC,UAAM,MAAM,QAAQ,SAAS,UAAU,YAAY,UAAU,UAAU,SAAS,KAAK,OAAO,KAAK;AACjG,WAAO,IAAI,KAAK,CAAC,GAAI,OAAO,IAAI,GAAG,KAAK,IAAK,SAAS,CAAC;AAAA,EACzD,CAAC;AACD,SAAO,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK,OAAO,MAAM,aAAa,KAAK,OAAO,CAAC;AACvE;"}

package/dist/data/traces/stack-checkpoints.cjs

@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function stackCheckpoints(records, key) {
+  const byCheckpoint = /* @__PURE__ */ new Map();
+  for (const record of records) {
+    if (record.key !== key) continue;
+    byCheckpoint.set(record.checkpointId, [...byCheckpoint.get(record.checkpointId) ?? [], record]);
+  }
+  return [...byCheckpoint].map(([checkpointId, group]) => {
+    const [first] = group;
+    return {
+      checkpointId,
+      takenAt: first.takenAt,
+      reason: first.reason,
+      transport: first.transport,
+      failed: group.some((record) => record.error),
+      records: group
+    };
+  }).sort((a, b) => Date.parse(a.takenAt) - Date.parse(b.takenAt));
+}
+exports.stackCheckpoints = stackCheckpoints;
+//# sourceMappingURL=stack-checkpoints.cjs.map

package/dist/data/traces/stack-checkpoints.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack-checkpoints.cjs","sources":["../../../src/data/traces/stack-checkpoints.ts"],"sourcesContent":["import type { StackRecord } from \"./types\";\n\n/** The stack records one checkpoint took of one process. */\nexport type StackCheckpoint = {\n  checkpointId: string;\n  takenAt: string;\n  reason: string;\n  transport: string;\n  /** The checkpoint's dump failed: its single record carries an error. */\n  failed: boolean;\n  records: StackRecord[];\n};\n\n/**\n * Groups one process's `stacks` records by checkpoint, oldest first, so the\n * last entry is the latest. Records of other processes are ignored. A\n * checkpoint's time, reason and transport are those of its first record.\n */\nexport function stackCheckpoints(records: StackRecord[], key: string): StackCheckpoint[] {\n  const byCheckpoint = new Map<string, StackRecord[]>();\n  for (const record of records) {\n    if (record.key !== key) continue;\n    byCheckpoint.set(record.checkpointId, [...(byCheckpoint.get(record.checkpointId) ?? []), record]);\n  }\n  return [...byCheckpoint]\n    .map(([checkpointId, group]): StackCheckpoint => {\n      const [first] = group as [StackRecord, ...StackRecord[]];\n      return {\n        checkpointId,\n        takenAt: first.takenAt,\n        reason: first.reason,\n        transport: first.transport,\n        failed: group.some((record) => record.error),\n        records: group,\n      };\n    })\n    .sort((a, b) => Date.parse(a.takenAt) - Date.parse(b.takenAt));\n}\n"],"names":[],"mappings":";;AAkBO,SAAS,iBAAiB,SAAwB,KAAgC;AACvF,QAAM,mCAAmB,IAAA;AACzB,aAAW,UAAU,SAAS;AAC5B,QAAI,OAAO,QAAQ,IAAK;AACxB,iBAAa,IAAI,OAAO,cAAc,CAAC,GAAI,aAAa,IAAI,OAAO,YAAY,KAAK,CAAA,GAAK,MAAM,CAAC;AAAA,EAClG;AACA,SAAO,CAAC,GAAG,YAAY,EACpB,IAAI,CAAC,CAAC,cAAc,KAAK,MAAuB;AAC/C,UAAM,CAAC,KAAK,IAAI;AAChB,WAAO;AAAA,MACL;AAAA,MACA,SAAS,MAAM;AAAA,MACf,QAAQ,MAAM;AAAA,MACd,WAAW,MAAM;AAAA,MACjB,QAAQ,MAAM,KAAK,CAAC,WAAW,OAAO,KAAK;AAAA,MAC3C,SAAS;AAAA,IAAA;AAAA,EAEb,CAAC,EACA,KAAK,CAAC,GAAG,MAAM,KAAK,MAAM,EAAE,OAAO,IAAI,KAAK,MAAM,EAAE,OAAO,CAAC;AACjE;;"}

package/dist/data/traces/stack-checkpoints.d.ts

@@ -0,0 +1,18 @@
+import { StackRecord } from './types.js';
+/** The stack records one checkpoint took of one process. */
+export type StackCheckpoint = {
+    checkpointId: string;
+    takenAt: string;
+    reason: string;
+    transport: string;
+    /** The checkpoint's dump failed: its single record carries an error. */
+    failed: boolean;
+    records: StackRecord[];
+};
+/**
+ * Groups one process's `stacks` records by checkpoint, oldest first, so the
+ * last entry is the latest. Records of other processes are ignored. A
+ * checkpoint's time, reason and transport are those of its first record.
+ */
+export declare function stackCheckpoints(records: StackRecord[], key: string): StackCheckpoint[];
+//# sourceMappingURL=stack-checkpoints.d.ts.map

package/dist/data/traces/stack-checkpoints.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack-checkpoints.d.ts","sourceRoot":"","sources":["../../../src/data/traces/stack-checkpoints.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAE3C,4DAA4D;AAC5D,MAAM,MAAM,eAAe,GAAG;IAC5B,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,wEAAwE;IACxE,MAAM,EAAE,OAAO,CAAC;IAChB,OAAO,EAAE,WAAW,EAAE,CAAC;CACxB,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,WAAW,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,eAAe,EAAE,CAmBvF"}

package/dist/data/traces/stack-checkpoints.js

@@ -0,0 +1,22 @@
+function stackCheckpoints(records, key) {
+  const byCheckpoint = /* @__PURE__ */ new Map();
+  for (const record of records) {
+    if (record.key !== key) continue;
+    byCheckpoint.set(record.checkpointId, [...byCheckpoint.get(record.checkpointId) ?? [], record]);
+  }
+  return [...byCheckpoint].map(([checkpointId, group]) => {
+    const [first] = group;
+    return {
+      checkpointId,
+      takenAt: first.takenAt,
+      reason: first.reason,
+      transport: first.transport,
+      failed: group.some((record) => record.error),
+      records: group
+    };
+  }).sort((a, b) => Date.parse(a.takenAt) - Date.parse(b.takenAt));
+}
+export {
+  stackCheckpoints
+};
+//# sourceMappingURL=stack-checkpoints.js.map

package/dist/data/traces/stack-checkpoints.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack-checkpoints.js","sources":["../../../src/data/traces/stack-checkpoints.ts"],"sourcesContent":["import type { StackRecord } from \"./types\";\n\n/** The stack records one checkpoint took of one process. */\nexport type StackCheckpoint = {\n  checkpointId: string;\n  takenAt: string;\n  reason: string;\n  transport: string;\n  /** The checkpoint's dump failed: its single record carries an error. */\n  failed: boolean;\n  records: StackRecord[];\n};\n\n/**\n * Groups one process's `stacks` records by checkpoint, oldest first, so the\n * last entry is the latest. Records of other processes are ignored. A\n * checkpoint's time, reason and transport are those of its first record.\n */\nexport function stackCheckpoints(records: StackRecord[], key: string): StackCheckpoint[] {\n  const byCheckpoint = new Map<string, StackRecord[]>();\n  for (const record of records) {\n    if (record.key !== key) continue;\n    byCheckpoint.set(record.checkpointId, [...(byCheckpoint.get(record.checkpointId) ?? []), record]);\n  }\n  return [...byCheckpoint]\n    .map(([checkpointId, group]): StackCheckpoint => {\n      const [first] = group as [StackRecord, ...StackRecord[]];\n      return {\n        checkpointId,\n        takenAt: first.takenAt,\n        reason: first.reason,\n        transport: first.transport,\n        failed: group.some((record) => record.error),\n        records: group,\n      };\n    })\n    .sort((a, b) => Date.parse(a.takenAt) - Date.parse(b.takenAt));\n}\n"],"names":[],"mappings":"AAkBO,SAAS,iBAAiB,SAAwB,KAAgC;AACvF,QAAM,mCAAmB,IAAA;AACzB,aAAW,UAAU,SAAS;AAC5B,QAAI,OAAO,QAAQ,IAAK;AACxB,iBAAa,IAAI,OAAO,cAAc,CAAC,GAAI,aAAa,IAAI,OAAO,YAAY,KAAK,CAAA,GAAK,MAAM,CAAC;AAAA,EAClG;AACA,SAAO,CAAC,GAAG,YAAY,EACpB,IAAI,CAAC,CAAC,cAAc,KAAK,MAAuB;AAC/C,UAAM,CAAC,KAAK,IAAI;AAChB,WAAO;AAAA,MACL;AAAA,MACA,SAAS,MAAM;AAAA,MACf,QAAQ,MAAM;AAAA,MACd,WAAW,MAAM;AAAA,MACjB,QAAQ,MAAM,KAAK,CAAC,WAAW,OAAO,KAAK;AAAA,MAC3C,SAAS;AAAA,IAAA;AAAA,EAEb,CAAC,EACA,KAAK,CAAC,GAAG,MAAM,KAAK,MAAM,EAAE,OAAO,IAAI,KAAK,MAAM,EAAE,OAAO,CAAC;AACjE;"}