@flanksource/clicky-ui 0.3.49 → 0.3.50

package/dist/data/traces/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/data/traces/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,KAAK,cAAc,EAAE,MAAM,aAAa,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,KAAK,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACtE,OAAO,EAAE,kBAAkB,EAAE,KAAK,yBAAyB,EAAE,MAAM,eAAe,CAAC;AACnF,OAAO,EAAE,aAAa,EAAE,KAAK,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AACzE,OAAO,EAAE,eAAe,EAAE,uBAAuB,EAAE,KAAK,aAAa,EAAE,MAAM,aAAa,CAAC;AAC3F,OAAO,EAAE,kBAAkB,EAAE,KAAK,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AACxF,OAAO,EAAE,SAAS,EAAE,MAAM,QAAQ,CAAC;AACnC,OAAO,EAAE,gBAAgB,EAAE,KAAK,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAClF,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,KAAK,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACzF,OAAO,EAAE,SAAS,EAAE,KAAK,cAAc,EAAE,MAAM,aAAa,CAAC;AAC7D,YAAY,EACV,mBAAmB,EACnB,oBAAoB,EACpB,eAAe,EACf,cAAc,EACd,gBAAgB,EAChB,eAAe,EACf,aAAa,EACb,iBAAiB,EACjB,aAAa,EACb,QAAQ,GACT,MAAM,SAAS,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/data/traces/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,KAAK,cAAc,EAAE,MAAM,aAAa,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,KAAK,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACtE,OAAO,EAAE,kBAAkB,EAAE,KAAK,yBAAyB,EAAE,MAAM,eAAe,CAAC;AACnF,OAAO,EAAE,aAAa,EAAE,KAAK,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AACzE,OAAO,EAAE,eAAe,EAAE,uBAAuB,EAAE,KAAK,aAAa,EAAE,MAAM,aAAa,CAAC;AAC3F,OAAO,EAAE,kBAAkB,EAAE,KAAK,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AACxF,OAAO,EAAE,SAAS,EAAE,MAAM,QAAQ,CAAC;AACnC,OAAO,EAAE,gBAAgB,EAAE,KAAK,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAClF,OAAO,EAAE,kBAAkB,EAAE,KAAK,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AACxF,OAAO,EAAE,iBAAiB,EAAE,KAAK,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AACrF,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,KAAK,kBAAkB,EAAE,KAAK,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACrH,OAAO,EACL,gBAAgB,EAChB,kBAAkB,EAClB,iBAAiB,EACjB,aAAa,EACb,KAAK,gBAAgB,EACrB,KAAK,kBAAkB,EACvB,KAAK,YAAY,EACjB,KAAK,gBAAgB,GACtB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACL,aAAa,EACb,kBAAkB,EAClB,WAAW,EACX,UAAU,EACV,gBAAgB,EAChB,kBAAkB,EAClB,KAAK,YAAY,GAClB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,gBAAgB,EAAE,KAAK,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAC7E,OAAO,EACL,eAAe,EACf,KAAK,WAAW,EAChB,KAAK,oBAAoB,EACzB,KAAK,iBAAiB,GACvB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACL,kBAAkB,EAClB,aAAa,EACb,gBAAgB,EAChB,sBAAsB,EACtB,eAAe,EACf,iBAAiB,EACjB,aAAa,EACb,oBAAoB,EACpB,KAAK,eAAe,GACrB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAAE,KAAK,cAAc,EAAE,KAAK,qBAAqB,EAAE,MAAM,aAAa,CAAC;AAC3G,YAAY,EACV,mBAAmB,EACnB,oBAAoB,EACpB,eAAe,EACf,eAAe,EACf,iBAAiB,EACjB,UAAU,EACV,cAAc,EACd,kBAAkB,EAClB,gBAAgB,EAChB,qBAAqB,EACrB,aAAa,EACb,eAAe,EACf,WAAW,EACX,UAAU,EACV,WAAW,EACX,aAAa,EACb,iBAAiB,EACjB,aAAa,EACb,QAAQ,GACT,MAAM,SAAS,CAAC"}

package/dist/data/traces/process-facets.cjs

@@ -0,0 +1,48 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const SAMPLE_FACETS = {
+  openFiles: { label: "Open files", countKey: "openFiles", listKey: "openFileList", empty: "No open files" },
+  sockets: { label: "Sockets", countKey: "sockets", listKey: "socketList", empty: "No open sockets" },
+  ports: { label: "Ports", countKey: "ports", listKey: "portList", empty: "Not listening on any port" },
+  connections: {
+    label: "Connections",
+    countKey: "connections",
+    listKey: "connectionList",
+    empty: "No network connections"
+  }
+};
+const SAMPLE_FACET_ORDER = ["openFiles", "sockets", "ports", "connections"];
+const inTickOrder = (samples, key) => samples.filter((sample) => sample.key === key).sort((a, b) => a.tick - b.tick);
+function armedFacets(samples) {
+  return SAMPLE_FACET_ORDER.filter((facet) => samples.some((sample) => sample[SAMPLE_FACETS[facet].countKey] !== void 0));
+}
+function facetCountSeries(samples, key, facet) {
+  const { countKey } = SAMPLE_FACETS[facet];
+  return inTickOrder(samples, key).flatMap((sample) => sample[countKey] === void 0 ? [] : [sample[countKey]]);
+}
+function latestFacetReading(samples, key, facet) {
+  const { countKey, listKey } = SAMPLE_FACETS[facet];
+  let reading;
+  for (const sample of inTickOrder(samples, key)) {
+    const list = sample[listKey];
+    if (list) reading = { rows: list, readAt: sample.sampledAt };
+    else if (sample[countKey] === 0 && (!reading || reading.rows.length > 0)) {
+      reading = { rows: [], readAt: sample.sampledAt };
+    }
+  }
+  return reading;
+}
+function diskSeries(samples, key) {
+  const own = inTickOrder(samples, key);
+  return {
+    read: own.flatMap((sample) => sample.diskReadBytes === void 0 ? [] : [sample.diskReadBytes]),
+    write: own.flatMap((sample) => sample.diskWriteBytes === void 0 ? [] : [sample.diskWriteBytes])
+  };
+}
+exports.SAMPLE_FACETS = SAMPLE_FACETS;
+exports.SAMPLE_FACET_ORDER = SAMPLE_FACET_ORDER;
+exports.armedFacets = armedFacets;
+exports.diskSeries = diskSeries;
+exports.facetCountSeries = facetCountSeries;
+exports.latestFacetReading = latestFacetReading;
+//# sourceMappingURL=process-facets.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"process-facets.cjs","sources":["../../../src/data/traces/process-facets.ts"],"sourcesContent":["import type { ProcessDescriptor, ProcessSampleFacet, ProcessSampleRow } from \"./types\";\n\ntype FacetSpec = {\n  label: string;\n  countKey: \"openFiles\" | \"sockets\" | \"ports\" | \"connections\";\n  listKey: \"openFileList\" | \"socketList\" | \"portList\" | \"connectionList\";\n  empty: string;\n};\n\n/** The facets of `process_samples` in tab order, with the record fields that carry each one. */\nexport const SAMPLE_FACETS: Record<ProcessSampleFacet, FacetSpec> = {\n  openFiles: { label: \"Open files\", countKey: \"openFiles\", listKey: \"openFileList\", empty: \"No open files\" },\n  sockets: { label: \"Sockets\", countKey: \"sockets\", listKey: \"socketList\", empty: \"No open sockets\" },\n  ports: { label: \"Ports\", countKey: \"ports\", listKey: \"portList\", empty: \"Not listening on any port\" },\n  connections: {\n    label: \"Connections\",\n    countKey: \"connections\",\n    listKey: \"connectionList\",\n    empty: \"No network connections\",\n  },\n};\n\nexport const SAMPLE_FACET_ORDER: ProcessSampleFacet[] = [\"openFiles\", \"sockets\", \"ports\", \"connections\"];\n\nconst inTickOrder = (samples: ProcessSampleRow[], key: string) =>\n  samples.filter((sample) => sample.key === key).sort((a, b) => a.tick - b.tick);\n\n/**\n * The facets the session armed: those whose count some sample carries. A sample\n * carries a facet's count on every tick once it is armed and never otherwise, so\n * this is a property of the session, not of one process.\n */\nexport function armedFacets(samples: ProcessSampleRow[]): ProcessSampleFacet[] {\n  return SAMPLE_FACET_ORDER.filter((facet) => samples.some((sample) => sample[SAMPLE_FACETS[facet].countKey] !== undefined));\n}\n\n/** One process's count of a facet over its samples, in tick order. */\nexport function facetCountSeries(samples: ProcessSampleRow[], key: string, facet: ProcessSampleFacet): number[] {\n  const { countKey } = SAMPLE_FACETS[facet];\n  return inTickOrder(samples, key).flatMap((sample) => (sample[countKey] === undefined ? [] : [sample[countKey]]));\n}\n\nexport type FacetReading = {\n  rows: ProcessDescriptor[];\n  /** When this list was stored: the first tick it held, not the last tick it was still true. */\n  readAt: string;\n};\n\n/**\n * The latest stored list of a facet for one process. Lists are stored only when\n * they change, so this is the list on the latest sample that carries one. An\n * empty list is never stored, so a sample whose count is 0 with no list ends a\n * non-empty reading with an empty one. Undefined when nothing was stored and no\n * count says the list is empty.\n */\nexport function latestFacetReading(\n  samples: ProcessSampleRow[],\n  key: string,\n  facet: ProcessSampleFacet,\n): FacetReading | undefined {\n  const { countKey, listKey } = SAMPLE_FACETS[facet];\n  let reading: FacetReading | undefined;\n  for (const sample of inTickOrder(samples, key)) {\n    const list = sample[listKey];\n    if (list) reading = { rows: list, readAt: sample.sampledAt };\n    else if (sample[countKey] === 0 && (!reading || reading.rows.length > 0)) {\n      reading = { rows: [], readAt: sample.sampledAt };\n    }\n  }\n  return reading;\n}\n\n/** One process's cumulative disk read and write bytes over the samples that carry them, in tick order. */\nexport function diskSeries(samples: ProcessSampleRow[], key: string): { read: number[]; write: number[] } {\n  const own = inTickOrder(samples, key);\n  return {\n    read: own.flatMap((sample) => (sample.diskReadBytes === undefined ? [] : [sample.diskReadBytes])),\n    write: own.flatMap((sample) => (sample.diskWriteBytes === undefined ? [] : [sample.diskWriteBytes])),\n  };\n}\n"],"names":[],"mappings":";;AAUO,MAAM,gBAAuD;AAAA,EAClE,WAAW,EAAE,OAAO,cAAc,UAAU,aAAa,SAAS,gBAAgB,OAAO,gBAAA;AAAA,EACzF,SAAS,EAAE,OAAO,WAAW,UAAU,WAAW,SAAS,cAAc,OAAO,kBAAA;AAAA,EAChF,OAAO,EAAE,OAAO,SAAS,UAAU,SAAS,SAAS,YAAY,OAAO,4BAAA;AAAA,EACxE,aAAa;AAAA,IACX,OAAO;AAAA,IACP,UAAU;AAAA,IACV,SAAS;AAAA,IACT,OAAO;AAAA,EAAA;AAEX;AAEO,MAAM,qBAA2C,CAAC,aAAa,WAAW,SAAS,aAAa;AAEvG,MAAM,cAAc,CAAC,SAA6B,QAChD,QAAQ,OAAO,CAAC,WAAW,OAAO,QAAQ,GAAG,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;AAOxE,SAAS,YAAY,SAAmD;AAC7E,SAAO,mBAAmB,OAAO,CAAC,UAAU,QAAQ,KAAK,CAAC,WAAW,OAAO,cAAc,KAAK,EAAE,QAAQ,MAAM,MAAS,CAAC;AAC3H;AAGO,SAAS,iBAAiB,SAA6B,KAAa,OAAqC;AAC9G,QAAM,EAAE,SAAA,IAAa,cAAc,KAAK;AACxC,SAAO,YAAY,SAAS,GAAG,EAAE,QAAQ,CAAC,WAAY,OAAO,QAAQ,MAAM,SAAY,CAAA,IAAK,CAAC,OAAO,QAAQ,CAAC,CAAE;AACjH;AAeO,SAAS,mBACd,SACA,KACA,OAC0B;AAC1B,QAAM,EAAE,UAAU,YAAY,cAAc,KAAK;AACjD,MAAI;AACJ,aAAW,UAAU,YAAY,SAAS,GAAG,GAAG;AAC9C,UAAM,OAAO,OAAO,OAAO;AAC3B,QAAI,KAAM,WAAU,EAAE,MAAM,MAAM,QAAQ,OAAO,UAAA;AAAA,aACxC,OAAO,QAAQ,MAAM,MAAM,CAAC,WAAW,QAAQ,KAAK,SAAS,IAAI;AACxE,gBAAU,EAAE,MAAM,CAAA,GAAI,QAAQ,OAAO,UAAA;AAAA,IACvC;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,WAAW,SAA6B,KAAkD;AACxG,QAAM,MAAM,YAAY,SAAS,GAAG;AACpC,SAAO;AAAA,IACL,MAAM,IAAI,QAAQ,CAAC,WAAY,OAAO,kBAAkB,SAAY,CAAA,IAAK,CAAC,OAAO,aAAa,CAAE;AAAA,IAChG,OAAO,IAAI,QAAQ,CAAC,WAAY,OAAO,mBAAmB,SAAY,CAAA,IAAK,CAAC,OAAO,cAAc,CAAE;AAAA,EAAA;AAEvG;;;;;;;"}

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

@@ -0,0 +1,38 @@
+import { ProcessDescriptor, ProcessSampleFacet, ProcessSampleRow } from './types.js';
+type FacetSpec = {
+    label: string;
+    countKey: "openFiles" | "sockets" | "ports" | "connections";
+    listKey: "openFileList" | "socketList" | "portList" | "connectionList";
+    empty: string;
+};
+/** The facets of `process_samples` in tab order, with the record fields that carry each one. */
+export declare const SAMPLE_FACETS: Record<ProcessSampleFacet, FacetSpec>;
+export declare const SAMPLE_FACET_ORDER: ProcessSampleFacet[];
+/**
+ * The facets the session armed: those whose count some sample carries. A sample
+ * carries a facet's count on every tick once it is armed and never otherwise, so
+ * this is a property of the session, not of one process.
+ */
+export declare function armedFacets(samples: ProcessSampleRow[]): ProcessSampleFacet[];
+/** One process's count of a facet over its samples, in tick order. */
+export declare function facetCountSeries(samples: ProcessSampleRow[], key: string, facet: ProcessSampleFacet): number[];
+export type FacetReading = {
+    rows: ProcessDescriptor[];
+    /** When this list was stored: the first tick it held, not the last tick it was still true. */
+    readAt: string;
+};
+/**
+ * The latest stored list of a facet for one process. Lists are stored only when
+ * they change, so this is the list on the latest sample that carries one. An
+ * empty list is never stored, so a sample whose count is 0 with no list ends a
+ * non-empty reading with an empty one. Undefined when nothing was stored and no
+ * count says the list is empty.
+ */
+export declare function latestFacetReading(samples: ProcessSampleRow[], key: string, facet: ProcessSampleFacet): FacetReading | undefined;
+/** One process's cumulative disk read and write bytes over the samples that carry them, in tick order. */
+export declare function diskSeries(samples: ProcessSampleRow[], key: string): {
+    read: number[];
+    write: number[];
+};
+export {};
+//# sourceMappingURL=process-facets.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"process-facets.d.ts","sourceRoot":"","sources":["../../../src/data/traces/process-facets.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAEvF,KAAK,SAAS,GAAG;IACf,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,WAAW,GAAG,SAAS,GAAG,OAAO,GAAG,aAAa,CAAC;IAC5D,OAAO,EAAE,cAAc,GAAG,YAAY,GAAG,UAAU,GAAG,gBAAgB,CAAC;IACvE,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,gGAAgG;AAChG,eAAO,MAAM,aAAa,EAAE,MAAM,CAAC,kBAAkB,EAAE,SAAS,CAU/D,CAAC;AAEF,eAAO,MAAM,kBAAkB,EAAE,kBAAkB,EAAqD,CAAC;AAKzG;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,gBAAgB,EAAE,GAAG,kBAAkB,EAAE,CAE7E;AAED,sEAAsE;AACtE,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,gBAAgB,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,kBAAkB,GAAG,MAAM,EAAE,CAG9G;AAED,MAAM,MAAM,YAAY,GAAG;IACzB,IAAI,EAAE,iBAAiB,EAAE,CAAC;IAC1B,8FAA8F;IAC9F,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAEF;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,gBAAgB,EAAE,EAC3B,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,kBAAkB,GACxB,YAAY,GAAG,SAAS,CAW1B;AAED,0GAA0G;AAC1G,wBAAgB,UAAU,CAAC,OAAO,EAAE,gBAAgB,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG;IAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAAC,KAAK,EAAE,MAAM,EAAE,CAAA;CAAE,CAMxG"}

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

@@ -0,0 +1,48 @@
+const SAMPLE_FACETS = {
+  openFiles: { label: "Open files", countKey: "openFiles", listKey: "openFileList", empty: "No open files" },
+  sockets: { label: "Sockets", countKey: "sockets", listKey: "socketList", empty: "No open sockets" },
+  ports: { label: "Ports", countKey: "ports", listKey: "portList", empty: "Not listening on any port" },
+  connections: {
+    label: "Connections",
+    countKey: "connections",
+    listKey: "connectionList",
+    empty: "No network connections"
+  }
+};
+const SAMPLE_FACET_ORDER = ["openFiles", "sockets", "ports", "connections"];
+const inTickOrder = (samples, key) => samples.filter((sample) => sample.key === key).sort((a, b) => a.tick - b.tick);
+function armedFacets(samples) {
+  return SAMPLE_FACET_ORDER.filter((facet) => samples.some((sample) => sample[SAMPLE_FACETS[facet].countKey] !== void 0));
+}
+function facetCountSeries(samples, key, facet) {
+  const { countKey } = SAMPLE_FACETS[facet];
+  return inTickOrder(samples, key).flatMap((sample) => sample[countKey] === void 0 ? [] : [sample[countKey]]);
+}
+function latestFacetReading(samples, key, facet) {
+  const { countKey, listKey } = SAMPLE_FACETS[facet];
+  let reading;
+  for (const sample of inTickOrder(samples, key)) {
+    const list = sample[listKey];
+    if (list) reading = { rows: list, readAt: sample.sampledAt };
+    else if (sample[countKey] === 0 && (!reading || reading.rows.length > 0)) {
+      reading = { rows: [], readAt: sample.sampledAt };
+    }
+  }
+  return reading;
+}
+function diskSeries(samples, key) {
+  const own = inTickOrder(samples, key);
+  return {
+    read: own.flatMap((sample) => sample.diskReadBytes === void 0 ? [] : [sample.diskReadBytes]),
+    write: own.flatMap((sample) => sample.diskWriteBytes === void 0 ? [] : [sample.diskWriteBytes])
+  };
+}
+export {
+  SAMPLE_FACETS,
+  SAMPLE_FACET_ORDER,
+  armedFacets,
+  diskSeries,
+  facetCountSeries,
+  latestFacetReading
+};
+//# sourceMappingURL=process-facets.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"process-facets.js","sources":["../../../src/data/traces/process-facets.ts"],"sourcesContent":["import type { ProcessDescriptor, ProcessSampleFacet, ProcessSampleRow } from \"./types\";\n\ntype FacetSpec = {\n  label: string;\n  countKey: \"openFiles\" | \"sockets\" | \"ports\" | \"connections\";\n  listKey: \"openFileList\" | \"socketList\" | \"portList\" | \"connectionList\";\n  empty: string;\n};\n\n/** The facets of `process_samples` in tab order, with the record fields that carry each one. */\nexport const SAMPLE_FACETS: Record<ProcessSampleFacet, FacetSpec> = {\n  openFiles: { label: \"Open files\", countKey: \"openFiles\", listKey: \"openFileList\", empty: \"No open files\" },\n  sockets: { label: \"Sockets\", countKey: \"sockets\", listKey: \"socketList\", empty: \"No open sockets\" },\n  ports: { label: \"Ports\", countKey: \"ports\", listKey: \"portList\", empty: \"Not listening on any port\" },\n  connections: {\n    label: \"Connections\",\n    countKey: \"connections\",\n    listKey: \"connectionList\",\n    empty: \"No network connections\",\n  },\n};\n\nexport const SAMPLE_FACET_ORDER: ProcessSampleFacet[] = [\"openFiles\", \"sockets\", \"ports\", \"connections\"];\n\nconst inTickOrder = (samples: ProcessSampleRow[], key: string) =>\n  samples.filter((sample) => sample.key === key).sort((a, b) => a.tick - b.tick);\n\n/**\n * The facets the session armed: those whose count some sample carries. A sample\n * carries a facet's count on every tick once it is armed and never otherwise, so\n * this is a property of the session, not of one process.\n */\nexport function armedFacets(samples: ProcessSampleRow[]): ProcessSampleFacet[] {\n  return SAMPLE_FACET_ORDER.filter((facet) => samples.some((sample) => sample[SAMPLE_FACETS[facet].countKey] !== undefined));\n}\n\n/** One process's count of a facet over its samples, in tick order. */\nexport function facetCountSeries(samples: ProcessSampleRow[], key: string, facet: ProcessSampleFacet): number[] {\n  const { countKey } = SAMPLE_FACETS[facet];\n  return inTickOrder(samples, key).flatMap((sample) => (sample[countKey] === undefined ? [] : [sample[countKey]]));\n}\n\nexport type FacetReading = {\n  rows: ProcessDescriptor[];\n  /** When this list was stored: the first tick it held, not the last tick it was still true. */\n  readAt: string;\n};\n\n/**\n * The latest stored list of a facet for one process. Lists are stored only when\n * they change, so this is the list on the latest sample that carries one. An\n * empty list is never stored, so a sample whose count is 0 with no list ends a\n * non-empty reading with an empty one. Undefined when nothing was stored and no\n * count says the list is empty.\n */\nexport function latestFacetReading(\n  samples: ProcessSampleRow[],\n  key: string,\n  facet: ProcessSampleFacet,\n): FacetReading | undefined {\n  const { countKey, listKey } = SAMPLE_FACETS[facet];\n  let reading: FacetReading | undefined;\n  for (const sample of inTickOrder(samples, key)) {\n    const list = sample[listKey];\n    if (list) reading = { rows: list, readAt: sample.sampledAt };\n    else if (sample[countKey] === 0 && (!reading || reading.rows.length > 0)) {\n      reading = { rows: [], readAt: sample.sampledAt };\n    }\n  }\n  return reading;\n}\n\n/** One process's cumulative disk read and write bytes over the samples that carry them, in tick order. */\nexport function diskSeries(samples: ProcessSampleRow[], key: string): { read: number[]; write: number[] } {\n  const own = inTickOrder(samples, key);\n  return {\n    read: own.flatMap((sample) => (sample.diskReadBytes === undefined ? [] : [sample.diskReadBytes])),\n    write: own.flatMap((sample) => (sample.diskWriteBytes === undefined ? [] : [sample.diskWriteBytes])),\n  };\n}\n"],"names":[],"mappings":"AAUO,MAAM,gBAAuD;AAAA,EAClE,WAAW,EAAE,OAAO,cAAc,UAAU,aAAa,SAAS,gBAAgB,OAAO,gBAAA;AAAA,EACzF,SAAS,EAAE,OAAO,WAAW,UAAU,WAAW,SAAS,cAAc,OAAO,kBAAA;AAAA,EAChF,OAAO,EAAE,OAAO,SAAS,UAAU,SAAS,SAAS,YAAY,OAAO,4BAAA;AAAA,EACxE,aAAa;AAAA,IACX,OAAO;AAAA,IACP,UAAU;AAAA,IACV,SAAS;AAAA,IACT,OAAO;AAAA,EAAA;AAEX;AAEO,MAAM,qBAA2C,CAAC,aAAa,WAAW,SAAS,aAAa;AAEvG,MAAM,cAAc,CAAC,SAA6B,QAChD,QAAQ,OAAO,CAAC,WAAW,OAAO,QAAQ,GAAG,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;AAOxE,SAAS,YAAY,SAAmD;AAC7E,SAAO,mBAAmB,OAAO,CAAC,UAAU,QAAQ,KAAK,CAAC,WAAW,OAAO,cAAc,KAAK,EAAE,QAAQ,MAAM,MAAS,CAAC;AAC3H;AAGO,SAAS,iBAAiB,SAA6B,KAAa,OAAqC;AAC9G,QAAM,EAAE,SAAA,IAAa,cAAc,KAAK;AACxC,SAAO,YAAY,SAAS,GAAG,EAAE,QAAQ,CAAC,WAAY,OAAO,QAAQ,MAAM,SAAY,CAAA,IAAK,CAAC,OAAO,QAAQ,CAAC,CAAE;AACjH;AAeO,SAAS,mBACd,SACA,KACA,OAC0B;AAC1B,QAAM,EAAE,UAAU,YAAY,cAAc,KAAK;AACjD,MAAI;AACJ,aAAW,UAAU,YAAY,SAAS,GAAG,GAAG;AAC9C,UAAM,OAAO,OAAO,OAAO;AAC3B,QAAI,KAAM,WAAU,EAAE,MAAM,MAAM,QAAQ,OAAO,UAAA;AAAA,aACxC,OAAO,QAAQ,MAAM,MAAM,CAAC,WAAW,QAAQ,KAAK,SAAS,IAAI;AACxE,gBAAU,EAAE,MAAM,CAAA,GAAI,QAAQ,OAAO,UAAA;AAAA,IACvC;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,WAAW,SAA6B,KAAkD;AACxG,QAAM,MAAM,YAAY,SAAS,GAAG;AACpC,SAAO;AAAA,IACL,MAAM,IAAI,QAAQ,CAAC,WAAY,OAAO,kBAAkB,SAAY,CAAA,IAAK,CAAC,OAAO,aAAa,CAAE;AAAA,IAChG,OAAO,IAAI,QAAQ,CAAC,WAAY,OAAO,mBAAmB,SAAY,CAAA,IAAK,CAAC,OAAO,cAAc,CAAE;AAAA,EAAA;AAEvG;"}

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

@@ -5,7 +5,7 @@ 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: row.status === "exited" || Boolean(row.exitedAt) });
+    nodes.set(row.key, { row, children: [], exited: isProcessExited(row) });
   }
   const roots = [];
   for (const node of nodes.values()) {
@@ -21,6 +21,24 @@ function buildProcessForest(rows) {
   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) => {
@@ -30,12 +48,20 @@ function flattenForest(roots) {
   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, list.sort((a, b) => a.tick - b.tick).map((sample) => sample.cpuPercent)])
-  );
+  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;
@@ -49,5 +75,11 @@ function sparklinePoints(values, width, height) {
 exports.buildProcessForest = buildProcessForest;
 exports.cpuSeriesByKey = cpuSeriesByKey;
 exports.flattenForest = flattenForest;
+exports.formatCpuPercent = formatCpuPercent;
+exports.formatProcessTimestamp = formatProcessTimestamp;
+exports.isProcessExited = isProcessExited;
+exports.processLifetimeMs = processLifetimeMs;
+exports.processSeries = processSeries;
+exports.pruneExitedProcesses = pruneExitedProcesses;
 exports.sparklinePoints = sparklinePoints;
 //# sourceMappingURL=process-tree.cjs.map

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

@@ -1 +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: row.status === \"exited\" || Boolean(row.exitedAt) });\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/** 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/** Each process's 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(\n    [...byKey].map(([key, list]) => [key, list.sort((a, b) => a.tick - b.tick).map((sample) => sample.cpuPercent)]),\n  );\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,IAAI,WAAW,YAAY,QAAQ,IAAI,QAAQ,GAAG;AAAA,EACpG;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;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,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;AAAA,IACT,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,KAAK,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,WAAW,OAAO,UAAU,CAAC,CAAC;AAAA,EAAA;AAElH;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;;;;;"}
+{"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

@@ -12,10 +12,29 @@ export type ProcessTreeNode = {
  * 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[];
-/** Each process's CPU % over its samples, in tick order. */
+/** 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

@@ -1 +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,uDAAuD;AACvD,wBAAgB,aAAa,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG,eAAe,EAAE,CAQzE;AAED,4DAA4D;AAC5D,wBAAgB,cAAc,CAAC,OAAO,EAAE,gBAAgB,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAMjF;AAED,mHAAmH;AACnH,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAUnG"}
+{"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

@@ -3,7 +3,7 @@ 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: row.status === "exited" || Boolean(row.exitedAt) });
+    nodes.set(row.key, { row, children: [], exited: isProcessExited(row) });
   }
   const roots = [];
   for (const node of nodes.values()) {
@@ -19,6 +19,24 @@ function buildProcessForest(rows) {
   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) => {
@@ -28,12 +46,20 @@ function flattenForest(roots) {
   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, list.sort((a, b) => a.tick - b.tick).map((sample) => sample.cpuPercent)])
-  );
+  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;
@@ -48,6 +74,12 @@ export {
   buildProcessForest,
   cpuSeriesByKey,
   flattenForest,
+  formatCpuPercent,
+  formatProcessTimestamp,
+  isProcessExited,
+  processLifetimeMs,
+  processSeries,
+  pruneExitedProcesses,
   sparklinePoints
 };
 //# sourceMappingURL=process-tree.js.map

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

@@ -1 +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: row.status === \"exited\" || Boolean(row.exitedAt) });\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/** 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/** Each process's 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(\n    [...byKey].map(([key, list]) => [key, list.sort((a, b) => a.tick - b.tick).map((sample) => sample.cpuPercent)]),\n  );\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,IAAI,WAAW,YAAY,QAAQ,IAAI,QAAQ,GAAG;AAAA,EACpG;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;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,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;AAAA,IACT,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,KAAK,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,WAAW,OAAO,UAAU,CAAC,CAAC;AAAA,EAAA;AAElH;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;"}
+{"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"}