@flanksource/clicky-ui 0.3.47 → 0.3.49

package/dist/data/traces/fixtures.d.ts

@@ -0,0 +1,8 @@
+import { HttpExchangeRow, ProcessNodeRow, ProcessSampleRow, SqlStatementRow, TerminalEvent } from './types.js';
+export declare const httpExchangeRows: HttpExchangeRow[];
+export declare const sqlStatementRows: SqlStatementRow[];
+/** A short build log: colour, a progress line redrawn with a carriage return, a resize, and a settled screen. */
+export declare const terminalEvents: TerminalEvent[];
+export declare const processNodeRows: ProcessNodeRow[];
+export declare const processSampleRows: ProcessSampleRow[];
+//# sourceMappingURL=fixtures.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"fixtures.d.ts","sourceRoot":"","sources":["../../../src/data/traces/fixtures.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,eAAe,EACf,cAAc,EACd,gBAAgB,EAChB,eAAe,EACf,aAAa,EACd,MAAM,SAAS,CAAC;AAEjB,eAAO,MAAM,gBAAgB,EAAE,eAAe,EA8E7C,CAAC;AAEF,eAAO,MAAM,gBAAgB,EAAE,eAAe,EA4D7C,CAAC;AAIF,iHAAiH;AACjH,eAAO,MAAM,cAAc,EAAE,aAAa,EAiBzC,CAAC;AAEF,eAAO,MAAM,eAAe,EAAE,cAAc,EA+D3C,CAAC;AAEF,eAAO,MAAM,iBAAiB,EAAE,gBAAgB,EAQ7C,CAAC"}

package/dist/data/traces/har-adapter.cjs

@@ -0,0 +1,83 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const format = require("../../lib/format.cjs");
+const REQUEST_BODY_PATH = "request.postData.text";
+const RESPONSE_BODY_PATH = "response.content.text";
+function bodyText(body) {
+  if (body === void 0 || body === null) return void 0;
+  return typeof body === "string" ? body : JSON.stringify(body, null, 2);
+}
+function mimeTypeOf(body, declared) {
+  if (declared) return declared;
+  return body !== void 0 && body !== null && typeof body !== "string" ? "application/json" : void 0;
+}
+function headers(list) {
+  return list ? { headers: list } : {};
+}
+function requireObject(value, part, row) {
+  if (value === void 0 || value === null || typeof value !== "object") {
+    throw new Error(`HTTP exchange ${row.method ?? "?"} ${row.url ?? "?"} has no ${part} object`);
+  }
+  return value;
+}
+function harRequest(request, bodySize) {
+  var _a, _b, _c;
+  const text = bodyText((_a = request.postData) == null ? void 0 : _a.text);
+  return {
+    method: request.method,
+    url: request.url,
+    ...request.httpVersion ? { httpVersion: request.httpVersion } : {},
+    ...headers(request.headers),
+    ...request.queryString ? { queryString: request.queryString } : {},
+    ...text !== void 0 ? { postData: { mimeType: mimeTypeOf((_b = request.postData) == null ? void 0 : _b.text, (_c = request.postData) == null ? void 0 : _c.mimeType) ?? "", text } } : {},
+    ...request.headersSize !== void 0 ? { headersSize: request.headersSize } : {},
+    ...bodySize !== void 0 ? { bodySize } : {}
+  };
+}
+function harResponse(response, text, mimeType, bodySize, truncated) {
+  var _a;
+  return {
+    status: response.status,
+    ...response.statusText ? { statusText: response.statusText } : {},
+    ...response.httpVersion ? { httpVersion: response.httpVersion } : {},
+    ...headers(response.headers),
+    content: {
+      size: ((_a = response.content) == null ? void 0 : _a.size) ?? bodySize,
+      ...mimeType ? { mimeType } : {},
+      ...text !== void 0 ? { text } : {},
+      ...truncated ? { truncated } : {}
+    },
+    ...response.redirectURL ? { redirectURL: response.redirectURL } : {},
+    ...response.headersSize !== void 0 ? { headersSize: response.headersSize } : {},
+    bodySize
+  };
+}
+function tunnelSummary(row) {
+  return `Tunnelled CONNECT relayed without decrypting it: ${format.formatBytes(row.bytesIn ?? 0)} in from the server, ${format.formatBytes(row.bytesOut ?? 0)} out from the client.`;
+}
+function exchangeToHarEntry(row, options = {}) {
+  var _a, _b, _c, _d;
+  const request = requireObject(row.request, "request", row);
+  const response = requireObject(row.response, "response", row);
+  const cut = new Set(row.truncated ?? []);
+  const tunnelled = row.tunnelled === true;
+  const responseBody = tunnelled ? tunnelSummary(row) : bodyText((_a = response.content) == null ? void 0 : _a.text);
+  const responseMime = tunnelled ? "text/plain" : mimeTypeOf((_b = response.content) == null ? void 0 : _b.text, (_c = response.content) == null ? void 0 : _c.mimeType);
+  const responseSize = tunnelled ? row.bytesIn ?? 0 : response.bodySize ?? ((_d = response.content) == null ? void 0 : _d.size) ?? 0;
+  return {
+    startedDateTime: row.startedAt,
+    time: row.durationMs,
+    request: harRequest(request, tunnelled ? row.bytesOut ?? 0 : request.bodySize),
+    response: harResponse(response, responseBody, responseMime, responseSize, cut.has(RESPONSE_BODY_PATH)),
+    ...row.timings ? { timings: row.timings } : {},
+    ...options.id ? { _id: options.id } : {},
+    ...row.error ? { _error: row.error } : {},
+    ...row.serverIPAddress ? { serverIPAddress: row.serverIPAddress } : {},
+    ...tunnelled ? { _tunnelled: true, _bytesIn: row.bytesIn ?? 0, _bytesOut: row.bytesOut ?? 0 } : {},
+    ...row.comment ? { _comment: row.comment } : {},
+    ...row.encoding ? { _encoding: row.encoding } : {},
+    ...cut.has(REQUEST_BODY_PATH) ? { _requestBodyTruncated: true } : {}
+  };
+}
+exports.exchangeToHarEntry = exchangeToHarEntry;
+//# sourceMappingURL=har-adapter.cjs.map

package/dist/data/traces/har-adapter.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"har-adapter.cjs","sources":["../../../src/data/traces/har-adapter.ts"],"sourcesContent":["import { formatBytes } from \"../../lib/format\";\nimport type { HAREntry, HARHeader, HARRequest, HARResponse } from \"../har/types\";\nimport type { HttpExchangeRequest, HttpExchangeResponse, HttpExchangeRow, TraceBodyText } from \"./types\";\n\nconst REQUEST_BODY_PATH = \"request.postData.text\";\nconst RESPONSE_BODY_PATH = \"response.content.text\";\n\nexport type ExchangeToHarEntryOptions = {\n  /** Stable per-request id, so an expanded HarPanel row survives a re-render. */\n  id?: string;\n};\n\n/** A body as text: stored text verbatim, a body the store parsed into structure as indented JSON. */\nfunction bodyText(body: TraceBodyText | null | undefined): string | undefined {\n  if (body === undefined || body === null) return undefined;\n  return typeof body === \"string\" ? body : JSON.stringify(body, null, 2);\n}\n\nfunction mimeTypeOf(body: TraceBodyText | null | undefined, declared: string | undefined): string | undefined {\n  if (declared) return declared;\n  return body !== undefined && body !== null && typeof body !== \"string\" ? \"application/json\" : undefined;\n}\n\nfunction headers(list: HARHeader[] | null | undefined): { headers?: HARHeader[] } {\n  return list ? { headers: list } : {};\n}\n\nfunction requireObject<T>(value: T | undefined | null, part: string, row: HttpExchangeRow): T {\n  if (value === undefined || value === null || typeof value !== \"object\") {\n    throw new Error(`HTTP exchange ${row.method ?? \"?\"} ${row.url ?? \"?\"} has no ${part} object`);\n  }\n  return value;\n}\n\nfunction harRequest(request: HttpExchangeRequest, bodySize: number | undefined): HARRequest {\n  const text = bodyText(request.postData?.text);\n  return {\n    method: request.method,\n    url: request.url,\n    ...(request.httpVersion ? { httpVersion: request.httpVersion } : {}),\n    ...headers(request.headers),\n    ...(request.queryString ? { queryString: request.queryString } : {}),\n    ...(text !== undefined\n      ? { postData: { mimeType: mimeTypeOf(request.postData?.text, request.postData?.mimeType) ?? \"\", text } }\n      : {}),\n    ...(request.headersSize !== undefined ? { headersSize: request.headersSize } : {}),\n    ...(bodySize !== undefined ? { bodySize } : {}),\n  };\n}\n\nfunction harResponse(\n  response: HttpExchangeResponse,\n  text: string | undefined,\n  mimeType: string | undefined,\n  bodySize: number,\n  truncated: boolean,\n): HARResponse {\n  return {\n    status: response.status,\n    ...(response.statusText ? { statusText: response.statusText } : {}),\n    ...(response.httpVersion ? { httpVersion: response.httpVersion } : {}),\n    ...headers(response.headers),\n    content: {\n      size: response.content?.size ?? bodySize,\n      ...(mimeType ? { mimeType } : {}),\n      ...(text !== undefined ? { text } : {}),\n      ...(truncated ? { truncated } : {}),\n    },\n    ...(response.redirectURL ? { redirectURL: response.redirectURL } : {}),\n    ...(response.headersSize !== undefined ? { headersSize: response.headersSize } : {}),\n    bodySize,\n  };\n}\n\nfunction tunnelSummary(row: HttpExchangeRow): string {\n  return `Tunnelled CONNECT relayed without decrypting it: ${formatBytes(row.bytesIn ?? 0)} in from the server, ${formatBytes(row.bytesOut ?? 0)} out from the client.`;\n}\n\n/**\n * Adapts one `http` / `http_proxy` trace row to the HAR entry `HarPanel`\n * renders. A tunnelled CONNECT has no request or response body to show, so its\n * byte counts stand in for the response body and fill the size columns.\n */\nexport function exchangeToHarEntry(row: HttpExchangeRow, options: ExchangeToHarEntryOptions = {}): HAREntry {\n  const request = requireObject(row.request, \"request\", row);\n  const response = requireObject(row.response, \"response\", row);\n  const cut = new Set(row.truncated ?? []);\n  const tunnelled = row.tunnelled === true;\n\n  const responseBody = tunnelled ? tunnelSummary(row) : bodyText(response.content?.text);\n  const responseMime = tunnelled ? \"text/plain\" : mimeTypeOf(response.content?.text, response.content?.mimeType);\n  const responseSize = tunnelled ? (row.bytesIn ?? 0) : (response.bodySize ?? response.content?.size ?? 0);\n\n  return {\n    startedDateTime: row.startedAt,\n    time: row.durationMs,\n    request: harRequest(request, tunnelled ? (row.bytesOut ?? 0) : request.bodySize),\n    response: harResponse(response, responseBody, responseMime, responseSize, cut.has(RESPONSE_BODY_PATH)),\n    ...(row.timings ? { timings: row.timings } : {}),\n    ...(options.id ? { _id: options.id } : {}),\n    ...(row.error ? { _error: row.error } : {}),\n    ...(row.serverIPAddress ? { serverIPAddress: row.serverIPAddress } : {}),\n    ...(tunnelled ? { _tunnelled: true, _bytesIn: row.bytesIn ?? 0, _bytesOut: row.bytesOut ?? 0 } : {}),\n    ...(row.comment ? { _comment: row.comment } : {}),\n    ...(row.encoding ? { _encoding: row.encoding } : {}),\n    ...(cut.has(REQUEST_BODY_PATH) ? { _requestBodyTruncated: true } : {}),\n  };\n}\n"],"names":["formatBytes"],"mappings":";;;AAIA,MAAM,oBAAoB;AAC1B,MAAM,qBAAqB;AAQ3B,SAAS,SAAS,MAA4D;AAC5E,MAAI,SAAS,UAAa,SAAS,KAAM,QAAO;AAChD,SAAO,OAAO,SAAS,WAAW,OAAO,KAAK,UAAU,MAAM,MAAM,CAAC;AACvE;AAEA,SAAS,WAAW,MAAwC,UAAkD;AAC5G,MAAI,SAAU,QAAO;AACrB,SAAO,SAAS,UAAa,SAAS,QAAQ,OAAO,SAAS,WAAW,qBAAqB;AAChG;AAEA,SAAS,QAAQ,MAAiE;AAChF,SAAO,OAAO,EAAE,SAAS,KAAA,IAAS,CAAA;AACpC;AAEA,SAAS,cAAiB,OAA6B,MAAc,KAAyB;AAC5F,MAAI,UAAU,UAAa,UAAU,QAAQ,OAAO,UAAU,UAAU;AACtE,UAAM,IAAI,MAAM,iBAAiB,IAAI,UAAU,GAAG,IAAI,IAAI,OAAO,GAAG,WAAW,IAAI,SAAS;AAAA,EAC9F;AACA,SAAO;AACT;AAEA,SAAS,WAAW,SAA8B,UAA0C;;AAC1F,QAAM,OAAO,UAAS,aAAQ,aAAR,mBAAkB,IAAI;AAC5C,SAAO;AAAA,IACL,QAAQ,QAAQ;AAAA,IAChB,KAAK,QAAQ;AAAA,IACb,GAAI,QAAQ,cAAc,EAAE,aAAa,QAAQ,YAAA,IAAgB,CAAA;AAAA,IACjE,GAAG,QAAQ,QAAQ,OAAO;AAAA,IAC1B,GAAI,QAAQ,cAAc,EAAE,aAAa,QAAQ,YAAA,IAAgB,CAAA;AAAA,IACjE,GAAI,SAAS,SACT,EAAE,UAAU,EAAE,UAAU,YAAW,aAAQ,aAAR,mBAAkB,OAAM,aAAQ,aAAR,mBAAkB,QAAQ,KAAK,IAAI,KAAA,EAAK,IACnG,CAAA;AAAA,IACJ,GAAI,QAAQ,gBAAgB,SAAY,EAAE,aAAa,QAAQ,YAAA,IAAgB,CAAA;AAAA,IAC/E,GAAI,aAAa,SAAY,EAAE,aAAa,CAAA;AAAA,EAAC;AAEjD;AAEA,SAAS,YACP,UACA,MACA,UACA,UACA,WACa;;AACb,SAAO;AAAA,IACL,QAAQ,SAAS;AAAA,IACjB,GAAI,SAAS,aAAa,EAAE,YAAY,SAAS,WAAA,IAAe,CAAA;AAAA,IAChE,GAAI,SAAS,cAAc,EAAE,aAAa,SAAS,YAAA,IAAgB,CAAA;AAAA,IACnE,GAAG,QAAQ,SAAS,OAAO;AAAA,IAC3B,SAAS;AAAA,MACP,QAAM,cAAS,YAAT,mBAAkB,SAAQ;AAAA,MAChC,GAAI,WAAW,EAAE,SAAA,IAAa,CAAA;AAAA,MAC9B,GAAI,SAAS,SAAY,EAAE,KAAA,IAAS,CAAA;AAAA,MACpC,GAAI,YAAY,EAAE,cAAc,CAAA;AAAA,IAAC;AAAA,IAEnC,GAAI,SAAS,cAAc,EAAE,aAAa,SAAS,YAAA,IAAgB,CAAA;AAAA,IACnE,GAAI,SAAS,gBAAgB,SAAY,EAAE,aAAa,SAAS,YAAA,IAAgB,CAAA;AAAA,IACjF;AAAA,EAAA;AAEJ;AAEA,SAAS,cAAc,KAA8B;AACnD,SAAO,oDAAoDA,OAAAA,YAAY,IAAI,WAAW,CAAC,CAAC,wBAAwBA,OAAAA,YAAY,IAAI,YAAY,CAAC,CAAC;AAChJ;AAOO,SAAS,mBAAmB,KAAsB,UAAqC,IAAc;;AAC1G,QAAM,UAAU,cAAc,IAAI,SAAS,WAAW,GAAG;AACzD,QAAM,WAAW,cAAc,IAAI,UAAU,YAAY,GAAG;AAC5D,QAAM,MAAM,IAAI,IAAI,IAAI,aAAa,CAAA,CAAE;AACvC,QAAM,YAAY,IAAI,cAAc;AAEpC,QAAM,eAAe,YAAY,cAAc,GAAG,IAAI,UAAS,cAAS,YAAT,mBAAkB,IAAI;AACrF,QAAM,eAAe,YAAY,eAAe,YAAW,cAAS,YAAT,mBAAkB,OAAM,cAAS,YAAT,mBAAkB,QAAQ;AAC7G,QAAM,eAAe,YAAa,IAAI,WAAW,IAAM,SAAS,cAAY,cAAS,YAAT,mBAAkB,SAAQ;AAEtG,SAAO;AAAA,IACL,iBAAiB,IAAI;AAAA,IACrB,MAAM,IAAI;AAAA,IACV,SAAS,WAAW,SAAS,YAAa,IAAI,YAAY,IAAK,QAAQ,QAAQ;AAAA,IAC/E,UAAU,YAAY,UAAU,cAAc,cAAc,cAAc,IAAI,IAAI,kBAAkB,CAAC;AAAA,IACrG,GAAI,IAAI,UAAU,EAAE,SAAS,IAAI,QAAA,IAAY,CAAA;AAAA,IAC7C,GAAI,QAAQ,KAAK,EAAE,KAAK,QAAQ,GAAA,IAAO,CAAA;AAAA,IACvC,GAAI,IAAI,QAAQ,EAAE,QAAQ,IAAI,MAAA,IAAU,CAAA;AAAA,IACxC,GAAI,IAAI,kBAAkB,EAAE,iBAAiB,IAAI,gBAAA,IAAoB,CAAA;AAAA,IACrE,GAAI,YAAY,EAAE,YAAY,MAAM,UAAU,IAAI,WAAW,GAAG,WAAW,IAAI,YAAY,EAAA,IAAM,CAAA;AAAA,IACjG,GAAI,IAAI,UAAU,EAAE,UAAU,IAAI,QAAA,IAAY,CAAA;AAAA,IAC9C,GAAI,IAAI,WAAW,EAAE,WAAW,IAAI,SAAA,IAAa,CAAA;AAAA,IACjD,GAAI,IAAI,IAAI,iBAAiB,IAAI,EAAE,uBAAuB,SAAS,CAAA;AAAA,EAAC;AAExE;;"}

package/dist/data/traces/har-adapter.d.ts

@@ -0,0 +1,13 @@
+import { HAREntry } from '../har/types.js';
+import { HttpExchangeRow } from './types.js';
+export type ExchangeToHarEntryOptions = {
+    /** Stable per-request id, so an expanded HarPanel row survives a re-render. */
+    id?: string;
+};
+/**
+ * Adapts one `http` / `http_proxy` trace row to the HAR entry `HarPanel`
+ * renders. A tunnelled CONNECT has no request or response body to show, so its
+ * byte counts stand in for the response body and fill the size columns.
+ */
+export declare function exchangeToHarEntry(row: HttpExchangeRow, options?: ExchangeToHarEntryOptions): HAREntry;
+//# sourceMappingURL=har-adapter.d.ts.map

package/dist/data/traces/har-adapter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"har-adapter.d.ts","sourceRoot":"","sources":["../../../src/data/traces/har-adapter.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAsC,MAAM,cAAc,CAAC;AACjF,OAAO,KAAK,EAA6C,eAAe,EAAiB,MAAM,SAAS,CAAC;AAKzG,MAAM,MAAM,yBAAyB,GAAG;IACtC,+EAA+E;IAC/E,EAAE,CAAC,EAAE,MAAM,CAAC;CACb,CAAC;AAoEF;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,eAAe,EAAE,OAAO,GAAE,yBAA8B,GAAG,QAAQ,CAwB1G"}

package/dist/data/traces/har-adapter.js

@@ -0,0 +1,83 @@
+import { formatBytes } from "../../lib/format.js";
+const REQUEST_BODY_PATH = "request.postData.text";
+const RESPONSE_BODY_PATH = "response.content.text";
+function bodyText(body) {
+  if (body === void 0 || body === null) return void 0;
+  return typeof body === "string" ? body : JSON.stringify(body, null, 2);
+}
+function mimeTypeOf(body, declared) {
+  if (declared) return declared;
+  return body !== void 0 && body !== null && typeof body !== "string" ? "application/json" : void 0;
+}
+function headers(list) {
+  return list ? { headers: list } : {};
+}
+function requireObject(value, part, row) {
+  if (value === void 0 || value === null || typeof value !== "object") {
+    throw new Error(`HTTP exchange ${row.method ?? "?"} ${row.url ?? "?"} has no ${part} object`);
+  }
+  return value;
+}
+function harRequest(request, bodySize) {
+  var _a, _b, _c;
+  const text = bodyText((_a = request.postData) == null ? void 0 : _a.text);
+  return {
+    method: request.method,
+    url: request.url,
+    ...request.httpVersion ? { httpVersion: request.httpVersion } : {},
+    ...headers(request.headers),
+    ...request.queryString ? { queryString: request.queryString } : {},
+    ...text !== void 0 ? { postData: { mimeType: mimeTypeOf((_b = request.postData) == null ? void 0 : _b.text, (_c = request.postData) == null ? void 0 : _c.mimeType) ?? "", text } } : {},
+    ...request.headersSize !== void 0 ? { headersSize: request.headersSize } : {},
+    ...bodySize !== void 0 ? { bodySize } : {}
+  };
+}
+function harResponse(response, text, mimeType, bodySize, truncated) {
+  var _a;
+  return {
+    status: response.status,
+    ...response.statusText ? { statusText: response.statusText } : {},
+    ...response.httpVersion ? { httpVersion: response.httpVersion } : {},
+    ...headers(response.headers),
+    content: {
+      size: ((_a = response.content) == null ? void 0 : _a.size) ?? bodySize,
+      ...mimeType ? { mimeType } : {},
+      ...text !== void 0 ? { text } : {},
+      ...truncated ? { truncated } : {}
+    },
+    ...response.redirectURL ? { redirectURL: response.redirectURL } : {},
+    ...response.headersSize !== void 0 ? { headersSize: response.headersSize } : {},
+    bodySize
+  };
+}
+function tunnelSummary(row) {
+  return `Tunnelled CONNECT relayed without decrypting it: ${formatBytes(row.bytesIn ?? 0)} in from the server, ${formatBytes(row.bytesOut ?? 0)} out from the client.`;
+}
+function exchangeToHarEntry(row, options = {}) {
+  var _a, _b, _c, _d;
+  const request = requireObject(row.request, "request", row);
+  const response = requireObject(row.response, "response", row);
+  const cut = new Set(row.truncated ?? []);
+  const tunnelled = row.tunnelled === true;
+  const responseBody = tunnelled ? tunnelSummary(row) : bodyText((_a = response.content) == null ? void 0 : _a.text);
+  const responseMime = tunnelled ? "text/plain" : mimeTypeOf((_b = response.content) == null ? void 0 : _b.text, (_c = response.content) == null ? void 0 : _c.mimeType);
+  const responseSize = tunnelled ? row.bytesIn ?? 0 : response.bodySize ?? ((_d = response.content) == null ? void 0 : _d.size) ?? 0;
+  return {
+    startedDateTime: row.startedAt,
+    time: row.durationMs,
+    request: harRequest(request, tunnelled ? row.bytesOut ?? 0 : request.bodySize),
+    response: harResponse(response, responseBody, responseMime, responseSize, cut.has(RESPONSE_BODY_PATH)),
+    ...row.timings ? { timings: row.timings } : {},
+    ...options.id ? { _id: options.id } : {},
+    ...row.error ? { _error: row.error } : {},
+    ...row.serverIPAddress ? { serverIPAddress: row.serverIPAddress } : {},
+    ...tunnelled ? { _tunnelled: true, _bytesIn: row.bytesIn ?? 0, _bytesOut: row.bytesOut ?? 0 } : {},
+    ...row.comment ? { _comment: row.comment } : {},
+    ...row.encoding ? { _encoding: row.encoding } : {},
+    ...cut.has(REQUEST_BODY_PATH) ? { _requestBodyTruncated: true } : {}
+  };
+}
+export {
+  exchangeToHarEntry
+};
+//# sourceMappingURL=har-adapter.js.map

package/dist/data/traces/har-adapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"har-adapter.js","sources":["../../../src/data/traces/har-adapter.ts"],"sourcesContent":["import { formatBytes } from \"../../lib/format\";\nimport type { HAREntry, HARHeader, HARRequest, HARResponse } from \"../har/types\";\nimport type { HttpExchangeRequest, HttpExchangeResponse, HttpExchangeRow, TraceBodyText } from \"./types\";\n\nconst REQUEST_BODY_PATH = \"request.postData.text\";\nconst RESPONSE_BODY_PATH = \"response.content.text\";\n\nexport type ExchangeToHarEntryOptions = {\n  /** Stable per-request id, so an expanded HarPanel row survives a re-render. */\n  id?: string;\n};\n\n/** A body as text: stored text verbatim, a body the store parsed into structure as indented JSON. */\nfunction bodyText(body: TraceBodyText | null | undefined): string | undefined {\n  if (body === undefined || body === null) return undefined;\n  return typeof body === \"string\" ? body : JSON.stringify(body, null, 2);\n}\n\nfunction mimeTypeOf(body: TraceBodyText | null | undefined, declared: string | undefined): string | undefined {\n  if (declared) return declared;\n  return body !== undefined && body !== null && typeof body !== \"string\" ? \"application/json\" : undefined;\n}\n\nfunction headers(list: HARHeader[] | null | undefined): { headers?: HARHeader[] } {\n  return list ? { headers: list } : {};\n}\n\nfunction requireObject<T>(value: T | undefined | null, part: string, row: HttpExchangeRow): T {\n  if (value === undefined || value === null || typeof value !== \"object\") {\n    throw new Error(`HTTP exchange ${row.method ?? \"?\"} ${row.url ?? \"?\"} has no ${part} object`);\n  }\n  return value;\n}\n\nfunction harRequest(request: HttpExchangeRequest, bodySize: number | undefined): HARRequest {\n  const text = bodyText(request.postData?.text);\n  return {\n    method: request.method,\n    url: request.url,\n    ...(request.httpVersion ? { httpVersion: request.httpVersion } : {}),\n    ...headers(request.headers),\n    ...(request.queryString ? { queryString: request.queryString } : {}),\n    ...(text !== undefined\n      ? { postData: { mimeType: mimeTypeOf(request.postData?.text, request.postData?.mimeType) ?? \"\", text } }\n      : {}),\n    ...(request.headersSize !== undefined ? { headersSize: request.headersSize } : {}),\n    ...(bodySize !== undefined ? { bodySize } : {}),\n  };\n}\n\nfunction harResponse(\n  response: HttpExchangeResponse,\n  text: string | undefined,\n  mimeType: string | undefined,\n  bodySize: number,\n  truncated: boolean,\n): HARResponse {\n  return {\n    status: response.status,\n    ...(response.statusText ? { statusText: response.statusText } : {}),\n    ...(response.httpVersion ? { httpVersion: response.httpVersion } : {}),\n    ...headers(response.headers),\n    content: {\n      size: response.content?.size ?? bodySize,\n      ...(mimeType ? { mimeType } : {}),\n      ...(text !== undefined ? { text } : {}),\n      ...(truncated ? { truncated } : {}),\n    },\n    ...(response.redirectURL ? { redirectURL: response.redirectURL } : {}),\n    ...(response.headersSize !== undefined ? { headersSize: response.headersSize } : {}),\n    bodySize,\n  };\n}\n\nfunction tunnelSummary(row: HttpExchangeRow): string {\n  return `Tunnelled CONNECT relayed without decrypting it: ${formatBytes(row.bytesIn ?? 0)} in from the server, ${formatBytes(row.bytesOut ?? 0)} out from the client.`;\n}\n\n/**\n * Adapts one `http` / `http_proxy` trace row to the HAR entry `HarPanel`\n * renders. A tunnelled CONNECT has no request or response body to show, so its\n * byte counts stand in for the response body and fill the size columns.\n */\nexport function exchangeToHarEntry(row: HttpExchangeRow, options: ExchangeToHarEntryOptions = {}): HAREntry {\n  const request = requireObject(row.request, \"request\", row);\n  const response = requireObject(row.response, \"response\", row);\n  const cut = new Set(row.truncated ?? []);\n  const tunnelled = row.tunnelled === true;\n\n  const responseBody = tunnelled ? tunnelSummary(row) : bodyText(response.content?.text);\n  const responseMime = tunnelled ? \"text/plain\" : mimeTypeOf(response.content?.text, response.content?.mimeType);\n  const responseSize = tunnelled ? (row.bytesIn ?? 0) : (response.bodySize ?? response.content?.size ?? 0);\n\n  return {\n    startedDateTime: row.startedAt,\n    time: row.durationMs,\n    request: harRequest(request, tunnelled ? (row.bytesOut ?? 0) : request.bodySize),\n    response: harResponse(response, responseBody, responseMime, responseSize, cut.has(RESPONSE_BODY_PATH)),\n    ...(row.timings ? { timings: row.timings } : {}),\n    ...(options.id ? { _id: options.id } : {}),\n    ...(row.error ? { _error: row.error } : {}),\n    ...(row.serverIPAddress ? { serverIPAddress: row.serverIPAddress } : {}),\n    ...(tunnelled ? { _tunnelled: true, _bytesIn: row.bytesIn ?? 0, _bytesOut: row.bytesOut ?? 0 } : {}),\n    ...(row.comment ? { _comment: row.comment } : {}),\n    ...(row.encoding ? { _encoding: row.encoding } : {}),\n    ...(cut.has(REQUEST_BODY_PATH) ? { _requestBodyTruncated: true } : {}),\n  };\n}\n"],"names":[],"mappings":";AAIA,MAAM,oBAAoB;AAC1B,MAAM,qBAAqB;AAQ3B,SAAS,SAAS,MAA4D;AAC5E,MAAI,SAAS,UAAa,SAAS,KAAM,QAAO;AAChD,SAAO,OAAO,SAAS,WAAW,OAAO,KAAK,UAAU,MAAM,MAAM,CAAC;AACvE;AAEA,SAAS,WAAW,MAAwC,UAAkD;AAC5G,MAAI,SAAU,QAAO;AACrB,SAAO,SAAS,UAAa,SAAS,QAAQ,OAAO,SAAS,WAAW,qBAAqB;AAChG;AAEA,SAAS,QAAQ,MAAiE;AAChF,SAAO,OAAO,EAAE,SAAS,KAAA,IAAS,CAAA;AACpC;AAEA,SAAS,cAAiB,OAA6B,MAAc,KAAyB;AAC5F,MAAI,UAAU,UAAa,UAAU,QAAQ,OAAO,UAAU,UAAU;AACtE,UAAM,IAAI,MAAM,iBAAiB,IAAI,UAAU,GAAG,IAAI,IAAI,OAAO,GAAG,WAAW,IAAI,SAAS;AAAA,EAC9F;AACA,SAAO;AACT;AAEA,SAAS,WAAW,SAA8B,UAA0C;;AAC1F,QAAM,OAAO,UAAS,aAAQ,aAAR,mBAAkB,IAAI;AAC5C,SAAO;AAAA,IACL,QAAQ,QAAQ;AAAA,IAChB,KAAK,QAAQ;AAAA,IACb,GAAI,QAAQ,cAAc,EAAE,aAAa,QAAQ,YAAA,IAAgB,CAAA;AAAA,IACjE,GAAG,QAAQ,QAAQ,OAAO;AAAA,IAC1B,GAAI,QAAQ,cAAc,EAAE,aAAa,QAAQ,YAAA,IAAgB,CAAA;AAAA,IACjE,GAAI,SAAS,SACT,EAAE,UAAU,EAAE,UAAU,YAAW,aAAQ,aAAR,mBAAkB,OAAM,aAAQ,aAAR,mBAAkB,QAAQ,KAAK,IAAI,KAAA,EAAK,IACnG,CAAA;AAAA,IACJ,GAAI,QAAQ,gBAAgB,SAAY,EAAE,aAAa,QAAQ,YAAA,IAAgB,CAAA;AAAA,IAC/E,GAAI,aAAa,SAAY,EAAE,aAAa,CAAA;AAAA,EAAC;AAEjD;AAEA,SAAS,YACP,UACA,MACA,UACA,UACA,WACa;;AACb,SAAO;AAAA,IACL,QAAQ,SAAS;AAAA,IACjB,GAAI,SAAS,aAAa,EAAE,YAAY,SAAS,WAAA,IAAe,CAAA;AAAA,IAChE,GAAI,SAAS,cAAc,EAAE,aAAa,SAAS,YAAA,IAAgB,CAAA;AAAA,IACnE,GAAG,QAAQ,SAAS,OAAO;AAAA,IAC3B,SAAS;AAAA,MACP,QAAM,cAAS,YAAT,mBAAkB,SAAQ;AAAA,MAChC,GAAI,WAAW,EAAE,SAAA,IAAa,CAAA;AAAA,MAC9B,GAAI,SAAS,SAAY,EAAE,KAAA,IAAS,CAAA;AAAA,MACpC,GAAI,YAAY,EAAE,cAAc,CAAA;AAAA,IAAC;AAAA,IAEnC,GAAI,SAAS,cAAc,EAAE,aAAa,SAAS,YAAA,IAAgB,CAAA;AAAA,IACnE,GAAI,SAAS,gBAAgB,SAAY,EAAE,aAAa,SAAS,YAAA,IAAgB,CAAA;AAAA,IACjF;AAAA,EAAA;AAEJ;AAEA,SAAS,cAAc,KAA8B;AACnD,SAAO,oDAAoD,YAAY,IAAI,WAAW,CAAC,CAAC,wBAAwB,YAAY,IAAI,YAAY,CAAC,CAAC;AAChJ;AAOO,SAAS,mBAAmB,KAAsB,UAAqC,IAAc;;AAC1G,QAAM,UAAU,cAAc,IAAI,SAAS,WAAW,GAAG;AACzD,QAAM,WAAW,cAAc,IAAI,UAAU,YAAY,GAAG;AAC5D,QAAM,MAAM,IAAI,IAAI,IAAI,aAAa,CAAA,CAAE;AACvC,QAAM,YAAY,IAAI,cAAc;AAEpC,QAAM,eAAe,YAAY,cAAc,GAAG,IAAI,UAAS,cAAS,YAAT,mBAAkB,IAAI;AACrF,QAAM,eAAe,YAAY,eAAe,YAAW,cAAS,YAAT,mBAAkB,OAAM,cAAS,YAAT,mBAAkB,QAAQ;AAC7G,QAAM,eAAe,YAAa,IAAI,WAAW,IAAM,SAAS,cAAY,cAAS,YAAT,mBAAkB,SAAQ;AAEtG,SAAO;AAAA,IACL,iBAAiB,IAAI;AAAA,IACrB,MAAM,IAAI;AAAA,IACV,SAAS,WAAW,SAAS,YAAa,IAAI,YAAY,IAAK,QAAQ,QAAQ;AAAA,IAC/E,UAAU,YAAY,UAAU,cAAc,cAAc,cAAc,IAAI,IAAI,kBAAkB,CAAC;AAAA,IACrG,GAAI,IAAI,UAAU,EAAE,SAAS,IAAI,QAAA,IAAY,CAAA;AAAA,IAC7C,GAAI,QAAQ,KAAK,EAAE,KAAK,QAAQ,GAAA,IAAO,CAAA;AAAA,IACvC,GAAI,IAAI,QAAQ,EAAE,QAAQ,IAAI,MAAA,IAAU,CAAA;AAAA,IACxC,GAAI,IAAI,kBAAkB,EAAE,iBAAiB,IAAI,gBAAA,IAAoB,CAAA;AAAA,IACrE,GAAI,YAAY,EAAE,YAAY,MAAM,UAAU,IAAI,WAAW,GAAG,WAAW,IAAI,YAAY,EAAA,IAAM,CAAA;AAAA,IACjG,GAAI,IAAI,UAAU,EAAE,UAAU,IAAI,QAAA,IAAY,CAAA;AAAA,IAC9C,GAAI,IAAI,WAAW,EAAE,WAAW,IAAI,SAAA,IAAa,CAAA;AAAA,IACjD,GAAI,IAAI,IAAI,iBAAiB,IAAI,EAAE,uBAAuB,SAAS,CAAA;AAAA,EAAC;AAExE;"}

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

@@ -0,0 +1,12 @@
+export { TraceView, type TraceViewProps } from './TraceView.js';
+export { TraceHarView, type TraceHarViewProps } from './TraceHarView.js';
+export { exchangeToHarEntry, type ExchangeToHarEntryOptions } from './har-adapter.js';
+export { SqlTraceTable, type SqlTraceTableProps } from './SqlTraceTable.js';
+export { groupStatements, formatStatementDuration, type SqlDisplayRow } from './sql-trace.js';
+export { TerminalCastPlayer, type TerminalCastPlayerProps } from './TerminalCastPlayer.js';
+export { parseCast } from './cast.js';
+export { ProcessTraceTree, type ProcessTraceTreeProps } from './ProcessTraceTree.js';
+export { buildProcessForest, flattenForest, type ProcessTreeNode } from './process-tree.js';
+export { Sparkline, type SparklineProps } from './Sparkline.js';
+export type { HttpExchangeRequest, HttpExchangeResponse, HttpExchangeRow, ProcessNodeRow, ProcessSampleRow, SqlStatementRow, TerminalEvent, TerminalEventKind, TraceBodyText, TraceRow, } from './types.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +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"}

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

@@ -0,0 +1,53 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+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: row.status === "exited" || Boolean(row.exitedAt) });
+  }
+  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 flattenForest(roots) {
+  const flat = [];
+  const visit = (node) => {
+    flat.push(node);
+    node.children.forEach(visit);
+  };
+  roots.forEach(visit);
+  return flat;
+}
+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)])
+  );
+}
+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(" ");
+}
+exports.buildProcessForest = buildProcessForest;
+exports.cpuSeriesByKey = cpuSeriesByKey;
+exports.flattenForest = flattenForest;
+exports.sparklinePoints = sparklinePoints;
+//# sourceMappingURL=process-tree.cjs.map

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: 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;;;;;"}

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

@@ -0,0 +1,21 @@
+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[];
+/** The forest depth-first, parents before children. */
+export declare function flattenForest(roots: ProcessTreeNode[]): ProcessTreeNode[];
+/** Each process's CPU % over its samples, in tick order. */
+export declare function cpuSeriesByKey(samples: ProcessSampleRow[]): Map<string, 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,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"}

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

@@ -0,0 +1,53 @@
+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: row.status === "exited" || Boolean(row.exitedAt) });
+  }
+  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 flattenForest(roots) {
+  const flat = [];
+  const visit = (node) => {
+    flat.push(node);
+    node.children.forEach(visit);
+  };
+  roots.forEach(visit);
+  return flat;
+}
+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)])
+  );
+}
+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,
+  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: 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;"}

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;"}