@worker-manager/metrics 1.0.0 → 1.1.0

package/dist/StoreHistoryProvider.d.ts

@@ -0,0 +1,27 @@
+import type { MetricsHistoryPoint, MetricsHistoryProvider, MetricsHistoryQuery, MetricsLatencyPoint, MetricsLatencyQuery } from '@worker-manager/api/typings/app';
+import type { HistoryStats, PurgeOptions, PurgeResult } from './HistoryAdmin';
+import type { MetricsStore, Retention } from './store';
+/**
+ * The `MetricsHistoryProvider` contract over any `MetricsStore`. Everything that decides what
+ * a chart receives lives here, once: span clamping, day-start alignment, the empty-history
+ * rule and percentile merging. The stores only fetch buckets, so a Redis and a PostgreSQL
+ * board answer the same query with the same points.
+ */
+export declare class StoreHistoryProvider implements MetricsHistoryProvider {
+    private readonly counters;
+    private readonly latency;
+    private readonly admin;
+    private readonly retentionDays;
+    constructor(store: MetricsStore, retention: Retention);
+    /** Backs the board's storage panel. See MetricsHistoryAdmin.stats. */
+    getUsage(): Promise<HistoryStats>;
+    /** Backs the board's "clear history" action. See MetricsHistoryAdmin.purge. */
+    purge(options?: PurgeOptions): Promise<PurgeResult>;
+    getHistory(query: MetricsHistoryQuery): Promise<MetricsHistoryPoint[]>;
+    getLatency(query: MetricsLatencyQuery): Promise<MetricsLatencyPoint[]>;
+    /**
+     * Clamps the span to the retention window so an unbounded `from` (e.g. 0) can't make
+     * dayRange produce an unbounded number of day buckets -- older data doesn't exist anyway.
+     */
+    private daysFor;
+}

package/dist/StoreHistoryProvider.js

@@ -0,0 +1,127 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.StoreHistoryProvider = void 0;
+const histogram_1 = require("./histogram");
+const keys_1 = require("./keys");
+const MS_PER_HOUR = 3600000;
+/**
+ * The `MetricsHistoryProvider` contract over any `MetricsStore`. Everything that decides what
+ * a chart receives lives here, once: span clamping, day-start alignment, the empty-history
+ * rule and percentile merging. The stores only fetch buckets, so a Redis and a PostgreSQL
+ * board answer the same query with the same points.
+ */
+class StoreHistoryProvider {
+    constructor(store, retention) {
+        this.retentionDays = retention.days;
+        this.counters = store.counterStore(retention);
+        this.latency = store.latencyStore(retention);
+        this.admin = store.administration();
+    }
+    /** Backs the board's storage panel. See MetricsHistoryAdmin.stats. */
+    async getUsage() {
+        return this.admin.stats();
+    }
+    /** Backs the board's "clear history" action. See MetricsHistoryAdmin.purge. */
+    async purge(options = {}) {
+        return this.admin.purge(options);
+    }
+    async getHistory(query) {
+        var _a;
+        const queue = (_a = query.queue) !== null && _a !== void 0 ? _a : keys_1.GLOBAL_QUEUE;
+        const days = this.daysFor(query);
+        if (query.metric === 'queueage') {
+            const ages = await this.latency.readQueueAge(queue, query.granularity, days);
+            // Day points are stamped at the day's start, so an intraday `from` would drop the day
+            // it falls in. Floored, exactly as the counter path below does it.
+            const lowerBound = query.granularity === 'day' ? dayFloor(query.from) : query.from;
+            return Object.keys(ages)
+                .map((key) => ({
+                ts: query.granularity === 'day' ? (0, keys_1.dayToStartMs)(key) : Number(key) * MS_PER_HOUR,
+                value: ages[key],
+            }))
+                .filter((p) => p.ts >= lowerBound && p.ts <= query.to)
+                .sort((a, b) => a.ts - b.ts);
+        }
+        if (query.granularity === 'day') {
+            const totals = await this.counters.readDailyTotals(queue, query.metric, days);
+            // Empty history only when no day in range was ever recorded (all fields missing).
+            // A day with a stored 0 still counts as recorded -- otherwise the UI's empty
+            // state would be unreachable once any data exists.
+            if (totals.every((value) => value == null)) {
+                return [];
+            }
+            return days
+                .map((day, i) => { var _a; return ({ ts: (0, keys_1.dayToStartMs)(day), value: (_a = totals[i]) !== null && _a !== void 0 ? _a : 0 }); })
+                .filter((p) => p.ts >= dayFloor(query.from) && p.ts <= query.to);
+        }
+        const hours = await this.counters.readHours(queue, query.metric, days);
+        return Object.keys(hours)
+            .map((field) => ({ ts: Number(field) * MS_PER_HOUR, value: hours[field] }))
+            .filter((p) => p.ts >= query.from && p.ts <= query.to)
+            .sort((a, b) => a.ts - b.ts);
+    }
+    async getLatency(query) {
+        var _a;
+        const queue = (_a = query.queue) !== null && _a !== void 0 ? _a : keys_1.GLOBAL_QUEUE;
+        const days = this.daysFor(query);
+        if (query.granularity === 'range') {
+            // Percentiles don't merge: averaging per-day p95s isn't the same number as the p95 of
+            // the whole range. Read the day tier's bucket vectors and merge them, then compute each
+            // requested percentile once from the summed vector.
+            const raw = await this.latency.readRange(queue, query.metric, 'day', days);
+            let merged = (0, histogram_1.emptyVector)();
+            for (const day of days) {
+                const vector = raw[day];
+                if (vector) {
+                    merged = (0, histogram_1.mergeVectors)(merged, vector);
+                }
+            }
+            const count = (0, histogram_1.vectorTotal)(merged);
+            if (count === 0) {
+                return [];
+            }
+            const values = {};
+            for (const p of query.percentiles) {
+                values[String(p)] = (0, histogram_1.quantile)(merged, p);
+            }
+            return [{ ts: query.from, count: Math.round(count), values }];
+        }
+        const raw = await this.latency.readRange(queue, query.metric, query.granularity, days);
+        // Same day-start alignment as getHistory: comparing a day bucket against a raw `from`
+        // would drop the oldest day and leave this chart one bucket shorter than the throughput
+        // chart drawn for the same range.
+        const lowerBound = query.granularity === 'day' ? dayFloor(query.from) : query.from;
+        const points = [];
+        for (const key of Object.keys(raw)) {
+            const ts = query.granularity === 'day' ? (0, keys_1.dayToStartMs)(key) : Number(key) * MS_PER_HOUR;
+            if (ts < lowerBound || ts > query.to) {
+                continue;
+            }
+            const vector = raw[key];
+            const count = (0, histogram_1.vectorTotal)(vector);
+            if (count === 0) {
+                continue;
+            }
+            const values = {};
+            for (const p of query.percentiles) {
+                values[String(p)] = (0, histogram_1.quantile)(vector, p);
+            }
+            points.push({ ts, count: Math.round(count), values });
+        }
+        return points.sort((a, b) => a.ts - b.ts);
+    }
+    /**
+     * Clamps the span to the retention window so an unbounded `from` (e.g. 0) can't make
+     * dayRange produce an unbounded number of day buckets -- older data doesn't exist anyway.
+     */
+    daysFor(query) {
+        const maxSpanMs = (this.retentionDays + 1) * 86400000;
+        return (0, keys_1.dayRange)(Math.max(query.from, query.to - maxSpanMs), query.to);
+    }
+}
+exports.StoreHistoryProvider = StoreHistoryProvider;
+function dayFloor(ms) {
+    const d = new Date(ms);
+    return Date.UTC(d.getUTCFullYear(), d.getUTCMonth(), d.getUTCDate());
+}
+//# sourceMappingURL=StoreHistoryProvider.js.map

package/dist/StoreHistoryProvider.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"StoreHistoryProvider.js","sourceRoot":"","sources":["../src/StoreHistoryProvider.ts"],"names":[],"mappings":";;;AAOA,2CAA+E;AAE/E,iCAA8D;AAS9D,MAAM,WAAW,GAAG,OAAO,CAAC;AAE5B;;;;;GAKG;AACH,MAAa,oBAAoB;IAM/B,YAAY,KAAmB,EAAE,SAAoB;QACnD,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC,IAAI,CAAC;QACpC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAC7C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;IACtC,CAAC;IAED,sEAAsE;IACtE,KAAK,CAAC,QAAQ;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;IAED,+EAA+E;IAC/E,KAAK,CAAC,KAAK,CAAC,UAAwB,EAAE;QACpC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,KAA0B;;QACzC,MAAM,KAAK,GAAG,MAAA,KAAK,CAAC,KAAK,mCAAI,mBAAY,CAAC;QAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAEjC,IAAI,KAAK,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;YAC7E,sFAAsF;YACtF,mEAAmE;YACnE,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;YACnF,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;iBACrB,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;gBACb,EAAE,EAAE,KAAK,CAAC,WAAW,KAAK,KAAK,CAAC,CAAC,CAAC,IAAA,mBAAY,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,WAAW;gBAC/E,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC;aACjB,CAAC,CAAC;iBACF,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,UAAU,IAAI,CAAC,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC;iBACrD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QACjC,CAAC;QAED,IAAI,KAAK,CAAC,WAAW,KAAK,KAAK,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC9E,kFAAkF;YAClF,6EAA6E;YAC7E,mDAAmD;YACnD,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,IAAI,IAAI,CAAC,EAAE,CAAC;gBAC3C,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,OAAO,IAAI;iBACR,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,WAAC,OAAA,CAAC,EAAE,EAAE,EAAE,IAAA,mBAAY,EAAC,GAAG,CAAC,EAAE,KAAK,EAAE,MAAA,MAAM,CAAC,CAAC,CAAC,mCAAI,CAAC,EAAE,CAAC,CAAA,EAAA,CAAC;iBACnE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC;QACrE,CAAC;QAED,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACvE,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;aACtB,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;aAC1E,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC;aACrD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,KAA0B;;QACzC,MAAM,KAAK,GAAG,MAAA,KAAK,CAAC,KAAK,mCAAI,mBAAY,CAAC;QAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAEjC,IAAI,KAAK,CAAC,WAAW,KAAK,OAAO,EAAE,CAAC;YAClC,sFAAsF;YACtF,wFAAwF;YACxF,oDAAoD;YACpD,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YAC3E,IAAI,MAAM,GAAG,IAAA,uBAAW,GAAE,CAAC;YAC3B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;gBACxB,IAAI,MAAM,EAAE,CAAC;oBACX,MAAM,GAAG,IAAA,wBAAY,EAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;YACD,MAAM,KAAK,GAAG,IAAA,uBAAW,EAAC,MAAM,CAAC,CAAC;YAClC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,MAAM,MAAM,GAA2B,EAAE,CAAC;YAC1C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;gBAClC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,IAAA,oBAAQ,EAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC1C,CAAC;YACD,OAAO,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;QAChE,CAAC;QAED,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;QACvF,sFAAsF;QACtF,wFAAwF;QACxF,kCAAkC;QAClC,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;QAEnF,MAAM,MAAM,GAA0B,EAAE,CAAC;QACzC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACnC,MAAM,EAAE,GAAG,KAAK,CAAC,WAAW,KAAK,KAAK,CAAC,CAAC,CAAC,IAAA,mBAAY,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC;YACvF,IAAI,EAAE,GAAG,UAAU,IAAI,EAAE,GAAG,KAAK,CAAC,EAAE,EAAE,CAAC;gBACrC,SAAS;YACX,CAAC;YACD,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YACxB,MAAM,KAAK,GAAG,IAAA,uBAAW,EAAC,MAAM,CAAC,CAAC;YAClC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,SAAS;YACX,CAAC;YACD,MAAM,MAAM,GAA2B,EAAE,CAAC;YAC1C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;gBAClC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,IAAA,oBAAQ,EAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC1C,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACK,OAAO,CAAC,KAAmC;QACjD,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;QACtD,OAAO,IAAA,eAAQ,EAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;IACxE,CAAC;CACF;AA1HD,oDA0HC;AAED,SAAS,QAAQ,CAAC,EAAU;IAC1B,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC;IACvB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;AACvE,CAAC"}

package/dist/index.d.ts

@@ -1,10 +1,18 @@
 export { MetricsHistoryAdmin } from './HistoryAdmin';
-export type { HistoryQueueStats, HistoryStats, MetricsHistoryAdminOptions, PurgeOptions, PurgeResult, } from './HistoryAdmin';
+export type { HistoryQueueStats, HistoryStats, HistoryTier, MetricsHistoryAdminOptions, PurgeOptions, PurgeResult, TierStats, } from './HistoryAdmin';
 export { MetricsRecorder } from './MetricsRecorder';
 export type { MetricsRecorderOptions } from './MetricsRecorder';
-export type { Retention } from './HistoryStore';
+export type { MetricsStore, Retention } from './store';
+export { RedisMetricsStore } from './RedisMetricsStore';
+export type { RedisMetricsStoreOptions } from './RedisMetricsStore';
 export { RedisMetricsHistoryProvider } from './RedisMetricsHistoryProvider';
 export type { RedisMetricsHistoryProviderOptions } from './RedisMetricsHistoryProvider';
+export { PostgresMetricsStore, migratePostgresMetrics } from './postgres/PostgresMetricsStore';
+export type { MigratePostgresMetricsOptions, PostgresMetricsStoreOptions, } from './postgres/PostgresMetricsStore';
+export { PostgresMetricsHistoryProvider } from './postgres/PostgresMetricsHistoryProvider';
+export type { PostgresMetricsHistoryProviderOptions } from './postgres/PostgresMetricsHistoryProvider';
+export type { PgPool, PostgresConnection, PostgresPoolConfig } from './postgres/connection';
+export { SCHEMA_VERSION as POSTGRES_METRICS_SCHEMA_VERSION } from './postgres/schema';
 export { LatencySampler } from './LatencySampler';
 export type { LatencySamplerOptions } from './LatencySampler';
 export { LatencyStore, QUEUE_AGE_METRIC } from './LatencyStore';

package/dist/index.js

@@ -1,12 +1,21 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.quantile = exports.BUCKET_COUNT = exports.BUCKET_BOUNDS = exports.QUEUE_AGE_METRIC = exports.LatencyStore = exports.LatencySampler = exports.RedisMetricsHistoryProvider = exports.MetricsRecorder = exports.MetricsHistoryAdmin = void 0;
+exports.quantile = exports.BUCKET_COUNT = exports.BUCKET_BOUNDS = exports.QUEUE_AGE_METRIC = exports.LatencyStore = exports.LatencySampler = exports.POSTGRES_METRICS_SCHEMA_VERSION = exports.PostgresMetricsHistoryProvider = exports.migratePostgresMetrics = exports.PostgresMetricsStore = exports.RedisMetricsHistoryProvider = exports.RedisMetricsStore = exports.MetricsRecorder = exports.MetricsHistoryAdmin = void 0;
 var HistoryAdmin_1 = require("./HistoryAdmin");
 Object.defineProperty(exports, "MetricsHistoryAdmin", { enumerable: true, get: function () { return HistoryAdmin_1.MetricsHistoryAdmin; } });
 var MetricsRecorder_1 = require("./MetricsRecorder");
 Object.defineProperty(exports, "MetricsRecorder", { enumerable: true, get: function () { return MetricsRecorder_1.MetricsRecorder; } });
+var RedisMetricsStore_1 = require("./RedisMetricsStore");
+Object.defineProperty(exports, "RedisMetricsStore", { enumerable: true, get: function () { return RedisMetricsStore_1.RedisMetricsStore; } });
 var RedisMetricsHistoryProvider_1 = require("./RedisMetricsHistoryProvider");
 Object.defineProperty(exports, "RedisMetricsHistoryProvider", { enumerable: true, get: function () { return RedisMetricsHistoryProvider_1.RedisMetricsHistoryProvider; } });
+var PostgresMetricsStore_1 = require("./postgres/PostgresMetricsStore");
+Object.defineProperty(exports, "PostgresMetricsStore", { enumerable: true, get: function () { return PostgresMetricsStore_1.PostgresMetricsStore; } });
+Object.defineProperty(exports, "migratePostgresMetrics", { enumerable: true, get: function () { return PostgresMetricsStore_1.migratePostgresMetrics; } });
+var PostgresMetricsHistoryProvider_1 = require("./postgres/PostgresMetricsHistoryProvider");
+Object.defineProperty(exports, "PostgresMetricsHistoryProvider", { enumerable: true, get: function () { return PostgresMetricsHistoryProvider_1.PostgresMetricsHistoryProvider; } });
+var schema_1 = require("./postgres/schema");
+Object.defineProperty(exports, "POSTGRES_METRICS_SCHEMA_VERSION", { enumerable: true, get: function () { return schema_1.SCHEMA_VERSION; } });
 var LatencySampler_1 = require("./LatencySampler");
 Object.defineProperty(exports, "LatencySampler", { enumerable: true, get: function () { return LatencySampler_1.LatencySampler; } });
 var LatencyStore_1 = require("./LatencyStore");

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;AAAA,+CAAqD;AAA5C,mHAAA,mBAAmB,OAAA;AAQ5B,qDAAoD;AAA3C,kHAAA,eAAe,OAAA;AAGxB,6EAA4E;AAAnE,0IAAA,2BAA2B,OAAA;AAEpC,mDAAkD;AAAzC,gHAAA,cAAc,OAAA;AAEvB,+CAAgE;AAAvD,4GAAA,YAAY,OAAA;AAAE,gHAAA,gBAAgB,OAAA;AAEvC,yCAAoE;AAA3D,0GAAA,aAAa,OAAA;AAAE,yGAAA,YAAY,OAAA;AAAE,qGAAA,QAAQ,OAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;AAAA,+CAAqD;AAA5C,mHAAA,mBAAmB,OAAA;AAU5B,qDAAoD;AAA3C,kHAAA,eAAe,OAAA;AAGxB,yDAAwD;AAA/C,sHAAA,iBAAiB,OAAA;AAE1B,6EAA4E;AAAnE,0IAAA,2BAA2B,OAAA;AAEpC,wEAA+F;AAAtF,4HAAA,oBAAoB,OAAA;AAAE,8HAAA,sBAAsB,OAAA;AAKrD,4FAA2F;AAAlF,gJAAA,8BAA8B,OAAA;AAGvC,4CAAsF;AAA7E,yHAAA,cAAc,OAAmC;AAC1D,mDAAkD;AAAzC,gHAAA,cAAc,OAAA;AAEvB,+CAAgE;AAAvD,4GAAA,YAAY,OAAA;AAAE,gHAAA,gBAAgB,OAAA;AAEvC,yCAAoE;AAA3D,0GAAA,aAAa,OAAA;AAAE,yGAAA,YAAY,OAAA;AAAE,qGAAA,QAAQ,OAAA"}

package/dist/jobSources.d.ts

@@ -0,0 +1,97 @@
+import type { BaseAdapter } from '@worker-manager/api/baseAdapter';
+import type { MetricsClient } from './connection';
+import { type PgQueryable } from './postgres/connection';
+/** The timing fields of one finished job, as the latency sampler needs them. */
+export interface FinishedJob {
+    /** Creation time, `null` when the job carries none. */
+    timestamp: number | null;
+    processedOn: number;
+    finishedOn: number;
+    /** Attempts made, counting the one that finished. */
+    attempts: number;
+}
+export interface FinishedJobs {
+    /** Jobs that finished in the range, before any subsampling. */
+    total: number;
+    /** How many of them were selected for reading. `total / sampled` scales counts back up. */
+    sampled: number;
+    jobs: FinishedJob[];
+}
+/**
+ * Where the sampler reads job timings from: the queue's own datastore, which is independent
+ * of where history is stored. A PostgreSQL-backed queue can record into Redis and vice versa.
+ */
+export interface JobSource {
+    /**
+     * Jobs whose finish time is in `(afterMs, upToMs]`. Above `maxSamples` a uniform subset is
+     * read rather than the first N, which would bias towards the start of the range.
+     */
+    finishedJobs(afterMs: number, upToMs: number, maxSamples: number): Promise<FinishedJobs>;
+    /**
+     * Age of the oldest waiting job, 0 for an empty backlog, and `null` when the backlog could
+     * not be read cleanly: a gap in the series reads as "not measured", a zero as "healthy".
+     */
+    oldestWaitingAge(now: number): Promise<number | null>;
+}
+interface AdapterWithKeys extends BaseAdapter {
+    getQueueKey(set: string): string;
+}
+/**
+ * A BullMQ queue stored in Redis, read with the same commands BullMQ itself writes.
+ *
+ * BullMQ's moveToFinished does `ZADD targetSet, timestamp, jobId` and writes the same value to
+ * finishedOn, so the completed and failed sets are sorted sets scored by finish time.
+ */
+export declare class RedisJobSource implements JobSource {
+    private readonly redis;
+    private readonly adapter;
+    constructor(redis: MetricsClient, adapter: AdapterWithKeys);
+    finishedJobs(afterMs: number, upToMs: number, maxSamples: number): Promise<FinishedJobs>;
+    /**
+     * The backlog is not all in one place. `wait` holds it while the queue is running, but
+     * pausing RENAMEs that list to `paused` and routes new jobs there, and anything added with
+     * a priority goes to the `prioritized` sorted set instead, which can leave `wait`
+     * permanently empty. Reading only `wait` reports a healthy zero for a queue that is badly
+     * backed up, which is the opposite of what this gauge is for, so all three are consulted
+     * and the worst age wins.
+     */
+    oldestWaitingAge(now: number): Promise<number | null>;
+}
+/**
+ * A BullMQ v6 queue stored in PostgreSQL. BullMQ keeps every job in one `job` table with a
+ * `state` column, and indexes finished jobs on `(queue, state, finished_at_ms)`, which is the
+ * exact shape of the range scan below.
+ */
+export declare class PostgresJobSource implements JobSource {
+    private readonly pool;
+    private readonly queueName;
+    private readonly job;
+    constructor(pool: PgQueryable, schema: string, queueName: string);
+    /**
+     * One round trip. The selection is the same evenly spaced pick the Redis source makes,
+     * done in SQL so a busy tick transfers at most `maxSamples` rows: row `i` of `total` is
+     * kept when it is `floor(k * total / max)` for some `k`, which integer arithmetic decides
+     * without enumerating the `k`s.
+     */
+    finishedJobs(afterMs: number, upToMs: number, maxSamples: number): Promise<FinishedJobs>;
+    /**
+     * Paused and prioritized are not physical states here: a paused queue's jobs stay
+     * `waiting`, and a prioritized job is a waiting job with `priority > 0`. The ready index
+     * orders waiting jobs by `(priority, seq)`, so the three ends read below are index probes,
+     * not a scan of the backlog: the next job to run, the far end of the prioritized range, and
+     * the far end of the unprioritized range, which holds the oldest job of a LIFO queue.
+     * Like the Redis prioritized read, this is an approximation that never reads the whole set.
+     */
+    oldestWaitingAge(now: number): Promise<number | null>;
+}
+/**
+ * The PostgreSQL pool behind a BullMQ v6 queue, or `null` for anything else.
+ *
+ * This is a structural probe of BullMQAdapter's queue and BullMQ's backend rather than a
+ * public API of either, so every step is optional and a shape it does not recognise simply
+ * reads as "not PostgreSQL". The pool is used directly rather than through the backend's
+ * `query()`, which parks a query forever once the queue starts closing and would leave a
+ * recorder tick hanging on a queue that was just removed from the board.
+ */
+export declare function postgresSourceOf(adapter: BaseAdapter): PostgresJobSource | null;
+export {};

package/dist/jobSources.js

@@ -0,0 +1,248 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PostgresJobSource = exports.RedisJobSource = void 0;
+exports.postgresSourceOf = postgresSourceOf;
+const connection_1 = require("./postgres/connection");
+/**
+ * A BullMQ queue stored in Redis, read with the same commands BullMQ itself writes.
+ *
+ * BullMQ's moveToFinished does `ZADD targetSet, timestamp, jobId` and writes the same value to
+ * finishedOn, so the completed and failed sets are sorted sets scored by finish time.
+ */
+class RedisJobSource {
+    constructor(redis, adapter) {
+        this.redis = redis;
+        this.adapter = adapter;
+    }
+    async finishedJobs(afterMs, upToMs, maxSamples) {
+        var _a;
+        const ids = [];
+        for (const set of ['completed', 'failed']) {
+            const found = await this.redis.zrangebyscore(this.adapter.getQueueKey(set), `(${afterMs}`, upToMs);
+            ids.push(...found);
+        }
+        if (ids.length === 0) {
+            return { total: 0, sampled: 0, jobs: [] };
+        }
+        // The id list is one cheap round trip; the HMGETs are the real cost.
+        const selected = ids.length > maxSamples ? sampleUniformly(ids, maxSamples) : ids;
+        const pipeline = this.redis.pipeline();
+        for (const id of selected) {
+            pipeline.hmget(this.adapter.getQueueKey(String(id)), 'timestamp', 'processedOn', 'finishedOn', 
+            // BullMQ 5 counts attempts in `atm`; `attemptsMade` is the pre-v5 name and is read
+            // as a fallback exactly the way Job.fromJSON does.
+            'atm', 'attemptsMade');
+        }
+        const rows = await pipeline.exec();
+        const jobs = [];
+        for (const row of rows !== null && rows !== void 0 ? rows : []) {
+            const values = row === null || row === void 0 ? void 0 : row[1];
+            if (!values) {
+                continue;
+            }
+            const [timestamp, processedOn, finishedOn, atm, attemptsMade] = values;
+            if (!processedOn || !finishedOn) {
+                continue;
+            }
+            jobs.push({
+                timestamp: timestamp ? Number(timestamp) : null,
+                processedOn: Number(processedOn),
+                finishedOn: Number(finishedOn),
+                attempts: Number((_a = atm !== null && atm !== void 0 ? atm : attemptsMade) !== null && _a !== void 0 ? _a : 0),
+            });
+        }
+        return { total: ids.length, sampled: selected.length, jobs };
+    }
+    /**
+     * The backlog is not all in one place. `wait` holds it while the queue is running, but
+     * pausing RENAMEs that list to `paused` and routes new jobs there, and anything added with
+     * a priority goes to the `prioritized` sorted set instead, which can leave `wait`
+     * permanently empty. Reading only `wait` reports a healthy zero for a queue that is badly
+     * backed up, which is the opposite of what this gauge is for, so all three are consulted
+     * and the worst age wins.
+     */
+    async oldestWaitingAge(now) {
+        var _a;
+        const candidates = await this.redis
+            .pipeline()
+            // BullMQ LPUSHes to the wait list and workers RPOPLPUSH from it, so the tail is oldest.
+            .lrange(this.adapter.getQueueKey('wait'), -1, -1)
+            .lrange(this.adapter.getQueueKey('paused'), -1, -1)
+            // The prioritized set is scored by priority, not by time, so neither end is guaranteed
+            // to hold the oldest job. Both ends are an approximation, and a cheap one: the true
+            // oldest would mean fetching the whole set every tick.
+            // String indices: ioredis v6 types `zrange`'s stop arg as string-only (Redis coerces
+            // either way), so numeric literals no longer typecheck. '0'/'-1' are the first/last members.
+            .zrange(this.adapter.getQueueKey('prioritized'), '0', '0')
+            .zrange(this.adapter.getQueueKey('prioritized'), '-1', '-1')
+            .exec();
+        // A pipeline reports failures per command: a Redis error arrives in the entry's error
+        // slot next to a null result, rather than as a throw. Reading only the result slot turns
+        // a failed read into an empty backlog and records an age of 0, which is the most
+        // reassuring number this gauge can produce, at the moment it is least entitled to.
+        if (!candidates || candidates.some(([error]) => error)) {
+            return null;
+        }
+        const ids = new Set();
+        for (const entry of candidates) {
+            for (const id of (_a = entry[1]) !== null && _a !== void 0 ? _a : []) {
+                ids.add(String(id));
+            }
+        }
+        if (ids.size === 0) {
+            return 0;
+        }
+        const stamps = this.redis.pipeline();
+        for (const id of ids) {
+            stamps.hget(this.adapter.getQueueKey(id), 'timestamp');
+        }
+        const rows = await stamps.exec();
+        // Same reasoning: a failed timestamp read does not zero the gauge, it understates it,
+        // which is the same wrong-but-reassuring answer in a quieter form.
+        if (!rows || rows.some(([error]) => error)) {
+            return null;
+        }
+        let oldest = 0;
+        for (const row of rows) {
+            const raw = row[1];
+            if (!raw) {
+                continue;
+            }
+            const enqueuedAt = Number(raw);
+            if (!Number.isFinite(enqueuedAt)) {
+                continue;
+            }
+            oldest = Math.max(oldest, now - enqueuedAt);
+        }
+        return Math.max(0, oldest);
+    }
+}
+exports.RedisJobSource = RedisJobSource;
+/**
+ * A BullMQ v6 queue stored in PostgreSQL. BullMQ keeps every job in one `job` table with a
+ * `state` column, and indexes finished jobs on `(queue, state, finished_at_ms)`, which is the
+ * exact shape of the range scan below.
+ */
+class PostgresJobSource {
+    constructor(pool, schema, queueName) {
+        this.pool = pool;
+        this.queueName = queueName;
+        this.job = `${(0, connection_1.quoteIdentifier)(schema)}.job`;
+    }
+    /**
+     * One round trip. The selection is the same evenly spaced pick the Redis source makes,
+     * done in SQL so a busy tick transfers at most `maxSamples` rows: row `i` of `total` is
+     * kept when it is `floor(k * total / max)` for some `k`, which integer arithmetic decides
+     * without enumerating the `k`s.
+     */
+    async finishedJobs(afterMs, upToMs, maxSamples) {
+        var _a;
+        const max = Math.max(1, Math.floor(maxSamples));
+        const { rows } = await this.pool.query(`WITH finished AS (
+         SELECT added_at_ms, processed_at_ms, finished_at_ms, attempts_made,
+                row_number() OVER (ORDER BY finished_at_ms, id) - 1 AS i,
+                count(*) OVER () AS total
+           FROM ${this.job}
+          WHERE queue = $1
+            AND state IN ('completed', 'failed')
+            AND finished_at_ms > $2
+            AND finished_at_ms <= $3
+       )
+       SELECT added_at_ms, processed_at_ms, finished_at_ms, attempts_made, total
+         FROM finished
+        WHERE total <= $4
+           OR ((i * $4 + total - 1) / total) * total / $4 = i`, [this.queueName, afterMs, upToMs, max]);
+        if (rows.length === 0) {
+            return { total: 0, sampled: 0, jobs: [] };
+        }
+        const total = Number(rows[0].total);
+        const jobs = [];
+        for (const row of rows) {
+            if (row.processed_at_ms == null || row.finished_at_ms == null) {
+                continue;
+            }
+            jobs.push({
+                timestamp: row.added_at_ms == null ? null : Number(row.added_at_ms),
+                processedOn: Number(row.processed_at_ms),
+                finishedOn: Number(row.finished_at_ms),
+                attempts: Number((_a = row.attempts_made) !== null && _a !== void 0 ? _a : 0),
+            });
+        }
+        return { total, sampled: rows.length, jobs };
+    }
+    /**
+     * Paused and prioritized are not physical states here: a paused queue's jobs stay
+     * `waiting`, and a prioritized job is a waiting job with `priority > 0`. The ready index
+     * orders waiting jobs by `(priority, seq)`, so the three ends read below are index probes,
+     * not a scan of the backlog: the next job to run, the far end of the prioritized range, and
+     * the far end of the unprioritized range, which holds the oldest job of a LIFO queue.
+     * Like the Redis prioritized read, this is an approximation that never reads the whole set.
+     */
+    async oldestWaitingAge(now) {
+        var _a;
+        const { rows } = await this.pool.query(`SELECT min(added_at_ms) AS oldest FROM (
+         (SELECT added_at_ms FROM ${this.job}
+           WHERE queue = $1 AND state = 'waiting' ORDER BY priority, seq LIMIT 1)
+         UNION ALL
+         (SELECT added_at_ms FROM ${this.job}
+           WHERE queue = $1 AND state = 'waiting' ORDER BY priority DESC, seq DESC LIMIT 1)
+         UNION ALL
+         (SELECT added_at_ms FROM ${this.job}
+           WHERE queue = $1 AND state = 'waiting' AND priority = 0 ORDER BY seq DESC LIMIT 1)
+       ) AS ends`, [this.queueName]);
+        const oldest = (_a = rows[0]) === null || _a === void 0 ? void 0 : _a.oldest;
+        if (oldest == null) {
+            return 0;
+        }
+        return Math.max(0, now - Number(oldest));
+    }
+}
+exports.PostgresJobSource = PostgresJobSource;
+/**
+ * The PostgreSQL pool behind a BullMQ v6 queue, or `null` for anything else.
+ *
+ * This is a structural probe of BullMQAdapter's queue and BullMQ's backend rather than a
+ * public API of either, so every step is optional and a shape it does not recognise simply
+ * reads as "not PostgreSQL". The pool is used directly rather than through the backend's
+ * `query()`, which parks a query forever once the queue starts closing and would leave a
+ * recorder tick hanging on a queue that was just removed from the board.
+ */
+function postgresSourceOf(adapter) {
+    var _a, _b, _c, _d, _e;
+    const queue = adapter.queue;
+    if (!queue || typeof queue.getBackend !== 'function') {
+        return null;
+    }
+    let backend;
+    try {
+        backend = queue.getBackend();
+    }
+    catch {
+        return null;
+    }
+    const pool = (_a = backend === null || backend === void 0 ? void 0 : backend.connection) === null || _a === void 0 ? void 0 : _a.pool;
+    if (!pool || typeof pool.query !== 'function') {
+        return null;
+    }
+    const schema = (_d = (_b = backend === null || backend === void 0 ? void 0 : backend.schema) !== null && _b !== void 0 ? _b : (_c = backend === null || backend === void 0 ? void 0 : backend.connection) === null || _c === void 0 ? void 0 : _c.schema) !== null && _d !== void 0 ? _d : 'bullmq';
+    const name = (_e = backend === null || backend === void 0 ? void 0 : backend.queueName) !== null && _e !== void 0 ? _e : queue.name;
+    if (typeof schema !== 'string' || typeof name !== 'string') {
+        return null;
+    }
+    try {
+        return new PostgresJobSource(pool, schema, name);
+    }
+    catch {
+        return null; // a schema name BullMQ itself would have refused
+    }
+}
+/** Evenly spaced pick across the list, which preserves the distribution's shape. */
+function sampleUniformly(ids, target) {
+    const stride = ids.length / target;
+    const out = [];
+    for (let i = 0; i < target; i++) {
+        out.push(ids[Math.floor(i * stride)]);
+    }
+    return out;
+}
+//# sourceMappingURL=jobSources.js.map

package/dist/jobSources.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"jobSources.js","sourceRoot":"","sources":["../src/jobSources.ts"],"names":[],"mappings":";;;AA6RA,4CAyBC;AApTD,sDAA0E;AAyC1E;;;;;GAKG;AACH,MAAa,cAAc;IACzB,YACmB,KAAoB,EACpB,OAAwB;QADxB,UAAK,GAAL,KAAK,CAAe;QACpB,YAAO,GAAP,OAAO,CAAiB;IACxC,CAAC;IAEJ,KAAK,CAAC,YAAY,CAAC,OAAe,EAAE,MAAc,EAAE,UAAkB;;QACpE,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,QAAQ,CAAC,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,aAAa,CAC1C,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,EAC7B,IAAI,OAAO,EAAE,EACb,MAAM,CACP,CAAC;YACF,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;QACrB,CAAC;QACD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;QAC5C,CAAC;QAED,qEAAqE;QACrE,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,eAAe,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAElF,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACvC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,QAAQ,CAAC,KAAK,CACZ,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EACpC,WAAW,EACX,aAAa,EACb,YAAY;YACZ,mFAAmF;YACnF,mDAAmD;YACnD,KAAK,EACL,cAAc,CACf,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;QAEnC,MAAM,IAAI,GAAkB,EAAE,CAAC;QAC/B,KAAK,MAAM,GAAG,IAAI,IAAI,aAAJ,IAAI,cAAJ,IAAI,GAAI,EAAE,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAG,CAAC,CAAkC,CAAC;YACzD,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,SAAS;YACX,CAAC;YACD,MAAM,CAAC,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,GAAG,EAAE,YAAY,CAAC,GAAG,MAAM,CAAC;YACvE,IAAI,CAAC,WAAW,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChC,SAAS;YACX,CAAC;YACD,IAAI,CAAC,IAAI,CAAC;gBACR,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI;gBAC/C,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC;gBAChC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC;gBAC9B,QAAQ,EAAE,MAAM,CAAC,MAAA,GAAG,aAAH,GAAG,cAAH,GAAG,GAAI,YAAY,mCAAI,CAAC,CAAC;aAC3C,CAAC,CAAC;QACL,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC;IAC/D,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,gBAAgB,CAAC,GAAW;;QAChC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,KAAK;aAChC,QAAQ,EAAE;YACX,wFAAwF;aACvF,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;aAChD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnD,uFAAuF;YACvF,oFAAoF;YACpF,uDAAuD;YACvD,qFAAqF;YACrF,6FAA6F;aAC5F,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,aAAa,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC;aACzD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,aAAa,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;aAC3D,IAAI,EAAE,CAAC;QAEV,sFAAsF;QACtF,yFAAyF;QACzF,iFAAiF;QACjF,mFAAmF;QACnF,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YACvD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,KAAK,MAAM,EAAE,IAAI,MAAC,KAAK,CAAC,CAAC,CAAqB,mCAAI,EAAE,EAAE,CAAC;gBACrD,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QACD,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,CAAC;QACX,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;QACzD,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,IAAI,EAAE,CAAC;QACjC,sFAAsF;QACtF,mEAAmE;QACnE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAA8B,CAAC;YAChD,IAAI,CAAC,GAAG,EAAE,CAAC;gBACT,SAAS;YACX,CAAC;YACD,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;gBACjC,SAAS;YACX,CAAC;YACD,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,GAAG,UAAU,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC7B,CAAC;CACF;AA5HD,wCA4HC;AAED;;;;GAIG;AACH,MAAa,iBAAiB;IAG5B,YACmB,IAAiB,EAClC,MAAc,EACG,SAAiB;QAFjB,SAAI,GAAJ,IAAI,CAAa;QAEjB,cAAS,GAAT,SAAS,CAAQ;QAElC,IAAI,CAAC,GAAG,GAAG,GAAG,IAAA,4BAAe,EAAC,MAAM,CAAC,MAAM,CAAC;IAC9C,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,YAAY,CAAC,OAAe,EAAE,MAAc,EAAE,UAAkB;;QACpE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;QAChD,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CACpC;;;;kBAIY,IAAI,CAAC,GAAG;;;;;;;;;8DASoC,EACxD,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,CACvC,CAAC;QACF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;QAC5C,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACpC,MAAM,IAAI,GAAkB,EAAE,CAAC;QAC/B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,GAAG,CAAC,eAAe,IAAI,IAAI,IAAI,GAAG,CAAC,cAAc,IAAI,IAAI,EAAE,CAAC;gBAC9D,SAAS;YACX,CAAC;YACD,IAAI,CAAC,IAAI,CAAC;gBACR,SAAS,EAAE,GAAG,CAAC,WAAW,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC;gBACnE,WAAW,EAAE,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC;gBACxC,UAAU,EAAE,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC;gBACtC,QAAQ,EAAE,MAAM,CAAC,MAAA,GAAG,CAAC,aAAa,mCAAI,CAAC,CAAC;aACzC,CAAC,CAAC;QACL,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC;IAC/C,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,gBAAgB,CAAC,GAAW;;QAChC,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CACpC;oCAC8B,IAAI,CAAC,GAAG;;;oCAGR,IAAI,CAAC,GAAG;;;oCAGR,IAAI,CAAC,GAAG;;iBAE3B,EACX,CAAC,IAAI,CAAC,SAAS,CAAC,CACjB,CAAC;QACF,MAAM,MAAM,GAAG,MAAA,IAAI,CAAC,CAAC,CAAC,0CAAE,MAAM,CAAC;QAC/B,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACnB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAC3C,CAAC;CACF;AAnFD,8CAmFC;AAaD;;;;;;;;GAQG;AACH,SAAgB,gBAAgB,CAAC,OAAoB;;IACnD,MAAM,KAAK,GAAI,OAA4C,CAAC,KAAK,CAAC;IAClE,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,CAAC,UAAU,KAAK,UAAU,EAAE,CAAC;QACrD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,OAAwC,CAAC;IAC7C,IAAI,CAAC;QACH,OAAO,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;IAC/B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,IAAI,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,UAAU,0CAAE,IAAI,CAAC;IACvC,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;QAC9C,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,MAAM,GAAG,MAAA,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,MAAM,mCAAI,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,UAAU,0CAAE,MAAM,mCAAI,QAAQ,CAAC;IAC1E,MAAM,IAAI,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,SAAS,mCAAI,KAAK,CAAC,IAAI,CAAC;IAC9C,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC3D,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC;QACH,OAAO,IAAI,iBAAiB,CAAC,IAAmB,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IAClE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC,CAAC,iDAAiD;IAChE,CAAC;AACH,CAAC;AAED,oFAAoF;AACpF,SAAS,eAAe,CAAC,GAAa,EAAE,MAAc;IACpD,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC;IACnC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/keys.d.ts

@@ -2,11 +2,16 @@ export declare const DEFAULT_NAMESPACE = "bull-board:metrics";
 export declare const GLOBAL_QUEUE = "__global__";
 /** Marks the hourly rollup key so it can't be mistaken for a minute-level day hash. */
 export declare const HOUR_TIER = "hour";
+export declare const DAY_PATTERN: RegExp;
+export declare function msToDay(ms: number): string;
 export declare function minuteToDay(minute: number): string;
 /** Absolute hour index, the hourly counterpart of the absolute minute index. */
 export declare function minuteToHour(minute: number): number;
 export declare function shiftDay(day: string, offsetDays: number): string;
 export declare function dayToStartMs(day: string): number;
+/** Days since the epoch, the integer form of an ISO day that SQL buckets use. */
+export declare function dayToIndex(day: string): number;
+export declare function indexToDay(index: number): string;
 export declare function dayRange(fromMs: number, toMs: number): string[];
 export declare function resolveNamespace(prefix: string | undefined, clustered: boolean): string;
 export interface MetricsKeys {
@@ -19,3 +24,5 @@ export interface MetricsKeys {
     scanPattern: string;
 }
 export declare function metricsKeys(namespace: string): MetricsKeys;
+/** An ISO `YYYY-MM-DD` day, validated, from a day string or a Date (UTC). */
+export declare function toDay(value: Date | string): string;