@oneuptime/common 12.0.29 → 12.0.31

package/build/dist/Types/Monitor/SnmpMonitor/SnmpOidListUtil.js

@@ -0,0 +1,253 @@
+import BadDataException from "../../Exception/BadDataException";
+/*
+ * The one place that decides what a network device actually polls.
+ *
+ * A device's health OIDs come from two places now: the OID Collection
+ * Template it is linked to, and its own `snmpOids` column. Nothing is ever
+ * copied between them — the two lists are merged fresh on every poll in
+ * NetworkDevicePoll, which is why editing a template changes collection for
+ * every linked device without a single write to NetworkDevice.
+ *
+ * That makes this file load-bearing in three places at once: the poll path
+ * that builds the probe payload, the two service validators that reject a
+ * bad list at save time, and the dashboard, which has to show an operator
+ * the same effective list the probe will receive. Keep it pure so all three
+ * can share it.
+ */
+/*
+ * A numeric dotted OID: at least two arcs, digits only. Deliberately not a
+ * MIB-name parser — the probe issues these verbatim to net-snmp, which
+ * accepts nothing else, and a symbolic name that reaches it is a silent
+ * "no such object" rather than an error.
+ */
+const OID_SYNTAX = /^\d+(\.\d+)+$/;
+/*
+ * The three caps COMPOSE, and that is the whole point of the numbers.
+ *
+ * A template may hold 150 OIDs and a device may add 50 of its own, so the
+ * merged list can never exceed 200. Both write paths validate their own side
+ * against their own cap, and together they make the poll-time truncation
+ * further down unreachable - which matters because truncation drops from the
+ * END, and template entries are deliberately the stable prefix, so the
+ * entries lost would always be the operator's own device-specific ones.
+ * Somebody growing a shared template must never be able to silently stop a
+ * device collecting an OID they never touched.
+ *
+ * Validating each side independently against one 200 cap would NOT compose:
+ * 200 plus 200 is 400, and the operator who loses OIDs is not the operator
+ * who made the edit.
+ */
+export const MAX_OIDS_PER_TEMPLATE = 150;
+export const MAX_DEVICE_SPECIFIC_OIDS = 50;
+export const MAX_EFFECTIVE_OIDS_PER_DEVICE = MAX_OIDS_PER_TEMPLATE + MAX_DEVICE_SPECIFIC_OIDS;
+/*
+ * A name is carried to the probe and lands on every metric row as an
+ * attribute, so it is bounded here rather than left an unbounded string
+ * multiplied by every device in a poll batch.
+ */
+export const MAX_OID_NAME_LENGTH = 100;
+/*
+ * Per-walk metric caps, previously a private const in
+ * NetworkDeviceMetricUtil and a bare literal in MonitorMetricUtil. Both now
+ * import these. The OID cap was 50 while nothing capped how many OIDs a
+ * device could be configured with, so a long list silently charted its first
+ * 50 in jsonb array order and warned to a log nobody reads.
+ */
+export const MAX_OID_METRIC_SERIES = MAX_EFFECTIVE_OIDS_PER_DEVICE;
+export const MAX_INTERFACE_METRIC_SERIES = 200;
+/*
+ * The specific OIDs the poll already turns into a real, per-port metric
+ * series - and ONLY those.
+ *
+ * Deliberately a short list of columns rather than the whole ifTable
+ * subtree. The walk parses twelve ifTable columns, but most of them go
+ * nowhere a user can reach: in and out errors are emitted only as a COMBINED
+ * rate, discards are parsed and dropped, and speed and admin status are
+ * stored on NetworkInterface without ever becoming metrics. For those,
+ * typing the OID by hand is currently the only way to get a series, so
+ * warning "this is already collected" would be false and would talk an
+ * operator out of the only thing that works.
+ *
+ * What IS listed here is the set behind issue #3507: the reporter was about
+ * to hand-type a hundred per-port OIDs for exactly these counters, which the
+ * interface walk already emits per port, keyed by interfaceName and
+ * interfaceIndex.
+ */
+const ALREADY_COLLECTED_OID_COLUMNS = [
+    {
+        // ifOperStatus
+        prefix: "1.3.6.1.2.1.2.2.1.8.",
+        collectedBy: "an up/down series for every port",
+    },
+    {
+        // ifInOctets
+        prefix: "1.3.6.1.2.1.2.2.1.10.",
+        collectedBy: "an inbound bits/second series for every port",
+    },
+    {
+        // ifOutOctets
+        prefix: "1.3.6.1.2.1.2.2.1.16.",
+        collectedBy: "an outbound bits/second series for every port",
+    },
+    {
+        // ifHCInOctets
+        prefix: "1.3.6.1.2.1.31.1.1.1.6.",
+        collectedBy: "an inbound bits/second series for every port",
+    },
+    {
+        // ifHCOutOctets
+        prefix: "1.3.6.1.2.1.31.1.1.1.10.",
+        collectedBy: "an outbound bits/second series for every port",
+    },
+];
+export default class SnmpOidListUtil {
+    /**
+     * Canonical form of an OID string, for comparison and for storage.
+     *
+     * The single leading dot is the one that matters: ".1.3.6.1" and "1.3.6.1"
+     * are the same object, operators type both, and net-snmp answers with the
+     * dotless form. Storing the canonical form is what lets criteria compare
+     * a configured OID against a walk response with ===.
+     */
+    static normalizeOid(oid) {
+        let normalized = (oid || "").trim();
+        if (normalized.startsWith(".")) {
+            normalized = normalized.slice(1);
+        }
+        return normalized;
+    }
+    static isValidOid(oid) {
+        return OID_SYNTAX.test(SnmpOidListUtil.normalizeOid(oid));
+    }
+    /**
+     * What the poll already collects this OID as, or undefined. Advisory only:
+     * the editor warns, it never blocks, because an operator may still want an
+     * undimensioned scalar series for one specific port.
+     */
+    static getAlreadyCollectedBy(oid) {
+        const normalized = SnmpOidListUtil.normalizeOid(oid);
+        for (const entry of ALREADY_COLLECTED_OID_COLUMNS) {
+            if (normalized.startsWith(entry.prefix)) {
+                return entry.collectedBy;
+            }
+        }
+        return undefined;
+    }
+    /**
+     * Sanitize an OID list at save time, refusing what an operator has to fix
+     * by hand and quietly dropping what is only an editor artifact.
+     *
+     * Both write paths use this: the template service and the device service.
+     * Nothing validated snmpOids before, which was survivable when one bad row
+     * broke one device; with a template it would break every device linked to
+     * it.
+     *
+     * The split between dropping and throwing is deliberate, and it is about
+     * NOT locking anyone out of a settings card they need. Blank rows are what
+     * SnmpOidEditor's "Add OID" button leaves behind when a user clicks it and
+     * changes their mind, and duplicates can already exist in data written
+     * before any of this validation did - both are dropped silently, because
+     * refusing them would mean a device carrying one legacy artifact could
+     * never be linked to a template until somebody hunted the row down. A
+     * genuinely malformed OID does throw: it has never collected anything, the
+     * message names it, and the editor that reports the error is on the same
+     * card.
+     */
+    static validateOidList(oids, options) {
+        var _a;
+        const list = oids || [];
+        const seen = new Set();
+        const sanitized = [];
+        for (const entry of list) {
+            const normalized = SnmpOidListUtil.normalizeOid(entry.oid);
+            // Editor artifact, not user intent.
+            if (!normalized) {
+                continue;
+            }
+            if (!OID_SYNTAX.test(normalized)) {
+                throw new BadDataException(`${options.label}: "${entry.oid}" is not a numeric OID. Use dotted numbers, for example 1.3.6.1.2.1.1.3.0.`);
+            }
+            // Keep the first spelling of a duplicate, drop the rest.
+            if (seen.has(normalized)) {
+                continue;
+            }
+            seen.add(normalized);
+            const name = ((_a = entry.name) === null || _a === void 0 ? void 0 : _a.trim())
+                ? entry.name.trim().substring(0, MAX_OID_NAME_LENGTH)
+                : undefined;
+            sanitized.push(Object.assign(Object.assign(Object.assign({}, entry), { oid: normalized }), (name === undefined ? {} : { name: name })));
+        }
+        /*
+         * Counted AFTER sanitizing, so blank rows and duplicates cannot push a
+         * legitimate list over the limit.
+         */
+        if (sanitized.length > options.max) {
+            throw new BadDataException(`${options.label}: ${sanitized.length} OIDs is more than the limit of ${options.max}. Remove some, or move them to another template.`);
+        }
+        return sanitized;
+    }
+    /**
+     * Merge a template's OIDs with a device's own into the list the probe
+     * receives.
+     *
+     * Template entries come FIRST, in template order, and that ordering is
+     * load-bearing rather than cosmetic: the effective cap truncates from the
+     * end, so the shared items a whole device type depends on have to be the
+     * stable prefix. If device additions came first, adding one local OID
+     * could silently push a template OID off the end of every device that has
+     * one.
+     *
+     * A duplicate resolves to the DEVICE's entry — it keeps whatever name and
+     * description the operator gave it — but it stays at the TEMPLATE's
+     * position, for the same reason.
+     *
+     * Malformed rows are dropped rather than thrown on, because this runs on
+     * the poll path against data that was already persisted. The validators
+     * above are where a bad row is refused; here, one bad row must not stop a
+     * device polling the other ninety-nine.
+     */
+    static mergeOidLists(templateOids, deviceOids) {
+        const merged = [];
+        const indexByOid = new Map();
+        const all = [
+            ...(templateOids || []),
+            ...(deviceOids || []),
+        ];
+        for (const entry of all) {
+            const normalized = SnmpOidListUtil.normalizeOid(entry.oid);
+            if (!normalized || !OID_SYNTAX.test(normalized)) {
+                continue;
+            }
+            const normalizedEntry = Object.assign(Object.assign({}, entry), { oid: normalized });
+            const existingIndex = indexByOid.get(normalized);
+            if (existingIndex === undefined) {
+                indexByOid.set(normalized, merged.length);
+                merged.push(normalizedEntry);
+                continue;
+            }
+            // Device entry wins on content, template keeps the position.
+            merged[existingIndex] = normalizedEntry;
+        }
+        return merged;
+    }
+    /**
+     * What this device polls, capped. The cap should be unreachable — both
+     * write paths reject an over-cap list with an error the operator can see —
+     * so this is the backstop for a template that grew after devices linked to
+     * it.
+     */
+    static resolveEffectiveOids(data) {
+        const merged = SnmpOidListUtil.mergeOidLists(data.templateOids, data.deviceOids);
+        if (merged.length <= MAX_EFFECTIVE_OIDS_PER_DEVICE) {
+            return {
+                oids: merged,
+                truncatedCount: 0,
+            };
+        }
+        return {
+            oids: merged.slice(0, MAX_EFFECTIVE_OIDS_PER_DEVICE),
+            truncatedCount: merged.length - MAX_EFFECTIVE_OIDS_PER_DEVICE,
+        };
+    }
+}
+//# sourceMappingURL=SnmpOidListUtil.js.map

package/build/dist/Types/Monitor/SnmpMonitor/SnmpOidListUtil.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SnmpOidListUtil.js","sourceRoot":"","sources":["../../../../../Types/Monitor/SnmpMonitor/SnmpOidListUtil.ts"],"names":[],"mappings":"AAAA,OAAO,gBAAgB,MAAM,kCAAkC,CAAC;AAGhE;;;;;;;;;;;;;;GAcG;AAEH;;;;;GAKG;AACH,MAAM,UAAU,GAAW,eAAe,CAAC;AAE3C;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAW,GAAG,CAAC;AACjD,MAAM,CAAC,MAAM,wBAAwB,GAAW,EAAE,CAAC;AACnD,MAAM,CAAC,MAAM,6BAA6B,GACxC,qBAAqB,GAAG,wBAAwB,CAAC;AAEnD;;;;GAIG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAW,GAAG,CAAC;AAE/C;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAW,6BAA6B,CAAC;AAC3E,MAAM,CAAC,MAAM,2BAA2B,GAAW,GAAG,CAAC;AAEvD;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,6BAA6B,GAG9B;IACH;QACE,eAAe;QACf,MAAM,EAAE,sBAAsB;QAC9B,WAAW,EAAE,kCAAkC;KAChD;IACD;QACE,aAAa;QACb,MAAM,EAAE,uBAAuB;QAC/B,WAAW,EAAE,8CAA8C;KAC5D;IACD;QACE,cAAc;QACd,MAAM,EAAE,uBAAuB;QAC/B,WAAW,EAAE,+CAA+C;KAC7D;IACD;QACE,eAAe;QACf,MAAM,EAAE,yBAAyB;QACjC,WAAW,EAAE,8CAA8C;KAC5D;IACD;QACE,gBAAgB;QAChB,MAAM,EAAE,0BAA0B;QAClC,WAAW,EAAE,+CAA+C;KAC7D;CACF,CAAC;AAmBF,MAAM,CAAC,OAAO,OAAO,eAAe;IAClC;;;;;;;OAOG;IACI,MAAM,CAAC,YAAY,CAAC,GAAuB;QAChD,IAAI,UAAU,GAAW,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAE5C,IAAI,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YAC/B,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAEM,MAAM,CAAC,UAAU,CAAC,GAAuB;QAC9C,OAAO,UAAU,CAAC,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,qBAAqB,CACjC,GAAuB;QAEvB,MAAM,UAAU,GAAW,eAAe,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QAE7D,KAAK,MAAM,KAAK,IAAI,6BAA6B,EAAE,CAAC;YAClD,IAAI,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;gBACxC,OAAO,KAAK,CAAC,WAAW,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACI,MAAM,CAAC,eAAe,CAC3B,IAAgC,EAChC,OAA+B;;QAE/B,MAAM,IAAI,GAAmB,IAAI,IAAI,EAAE,CAAC;QAExC,MAAM,IAAI,GAAgB,IAAI,GAAG,EAAE,CAAC;QACpC,MAAM,SAAS,GAAmB,EAAE,CAAC;QAErC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,UAAU,GAAW,eAAe,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAEnE,oCAAoC;YACpC,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,SAAS;YACX,CAAC;YAED,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;gBACjC,MAAM,IAAI,gBAAgB,CACxB,GAAG,OAAO,CAAC,KAAK,MAAM,KAAK,CAAC,GAAG,4EAA4E,CAC5G,CAAC;YACJ,CAAC;YAED,yDAAyD;YACzD,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBACzB,SAAS;YACX,CAAC;YAED,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAErB,MAAM,IAAI,GAAuB,CAAA,MAAA,KAAK,CAAC,IAAI,0CAAE,IAAI,EAAE;gBACjD,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,mBAAmB,CAAC;gBACrD,CAAC,CAAC,SAAS,CAAC;YAEd,SAAS,CAAC,IAAI,+CACT,KAAK,KACR,GAAG,EAAE,UAAU,KACZ,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAC7C,CAAC;QACL,CAAC;QAED;;;WAGG;QACH,IAAI,SAAS,CAAC,MAAM,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC;YACnC,MAAM,IAAI,gBAAgB,CACxB,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,MAAM,mCAAmC,OAAO,CAAC,GAAG,kDAAkD,CACtI,CAAC;QACJ,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACI,MAAM,CAAC,aAAa,CACzB,YAAwC,EACxC,UAAsC;QAEtC,MAAM,MAAM,GAAmB,EAAE,CAAC;QAClC,MAAM,UAAU,GAAwB,IAAI,GAAG,EAAE,CAAC;QAElD,MAAM,GAAG,GAAmB;YAC1B,GAAG,CAAC,YAAY,IAAI,EAAE,CAAC;YACvB,GAAG,CAAC,UAAU,IAAI,EAAE,CAAC;SACtB,CAAC;QAEF,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE,CAAC;YACxB,MAAM,UAAU,GAAW,eAAe,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAEnE,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;gBAChD,SAAS;YACX,CAAC;YAED,MAAM,eAAe,mCAChB,KAAK,KACR,GAAG,EAAE,UAAU,GAChB,CAAC;YAEF,MAAM,aAAa,GAAuB,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAErE,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBAChC,UAAU,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;gBAC7B,SAAS;YACX,CAAC;YAED,6DAA6D;YAC7D,MAAM,CAAC,aAAa,CAAC,GAAG,eAAe,CAAC;QAC1C,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAChC,IAA8B;QAE9B,MAAM,MAAM,GAAmB,eAAe,CAAC,aAAa,CAC1D,IAAI,CAAC,YAAY,EACjB,IAAI,CAAC,UAAU,CAChB,CAAC;QAEF,IAAI,MAAM,CAAC,MAAM,IAAI,6BAA6B,EAAE,CAAC;YACnD,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,cAAc,EAAE,CAAC;aAClB,CAAC;QACJ,CAAC;QAED,OAAO;YACL,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,6BAA6B,CAAC;YACpD,cAAc,EAAE,MAAM,CAAC,MAAM,GAAG,6BAA6B;SAC9D,CAAC;IACJ,CAAC;CACF"}

package/build/dist/Types/NotificationSetting/NotificationSettingEventType.js

@@ -56,6 +56,9 @@ var NotificationSettingEventType;
     NotificationSettingEventType["SEND_WHEN_USER_IS_ADDED_TO_ON_CALL_POLICY"] = "When user is added to on-call policy";
     NotificationSettingEventType["SEND_WHEN_USER_IS_REMOVED_FROM_ON_CALL_POLICY"] = "When user is removed from on-call policy";
     NotificationSettingEventType["SEND_WHEN_USER_IS_NO_LONGER_ACTIVE_ON_ON_CALL_ROSTER"] = "When user is no longer active on on-call roster";
+    // On Call Shift Reminders (see UserOnCallShiftReminder)
+    NotificationSettingEventType["SEND_BEFORE_USER_ON_CALL_SHIFT_STARTS"] = "Before user's on-call shift starts";
+    NotificationSettingEventType["SEND_WHEN_USER_ON_CALL_SHIFT_IS_REASSIGNED"] = "User's upcoming on-call shift is reassigned";
 })(NotificationSettingEventType || (NotificationSettingEventType = {}));
 export default NotificationSettingEventType;
 //# sourceMappingURL=NotificationSettingEventType.js.map

package/build/dist/Types/NotificationSetting/NotificationSettingEventType.js.map

@@ -1 +1 @@
-{"version":3,"file":"NotificationSettingEventType.js","sourceRoot":"","sources":["../../../../Types/NotificationSetting/NotificationSettingEventType.ts"],"names":[],"mappings":"AAAA,IAAK,4BAsEJ;AAtED,WAAK,4BAA4B;IAC/B,WAAW;IACX,mJAAmH,CAAA;IACnH,2JAA2H,CAAA;IAC3H,+JAA+H,CAAA;IAC/H,uIAAuG,CAAA;IACvG,2IAA2G,CAAA;IAC3G,6IAA6G,CAAA;IAE7G,SAAS;IAET,0IAA0G,CAAA;IAC1G,kJAAkH,CAAA;IAClH,sJAAsH,CAAA;IACtH,iIAAiG,CAAA;IACjG,uIAAuG,CAAA;IAEvG,iBAAiB;IAEjB,kKAAkI,CAAA;IAClI,0KAA0I,CAAA;IAC1I,8KAA8I,CAAA;IAC9I,iJAAiH,CAAA;IACjH,wJAAwH,CAAA;IAExH,oBAAoB;IAEpB,2KAA2I,CAAA;IAC3I,mLAAmJ,CAAA;IACnJ,uLAAuJ,CAAA;IACvJ,uJAAuH,CAAA;IACvH,iKAAiI,CAAA;IAEjI,WAAW;IACX,qIAAqG,CAAA;IACrG,gJAAgH,CAAA;IAChH,8JAA8H,CAAA;IAC9H,2IAA2G,CAAA;IAC3G,2KAA2I,CAAA;IAE3I,wBAAwB;IACxB,0JAA0H,CAAA;IAC1H,kKAAkI,CAAA;IAClI,iJAAiH,CAAA;IACjH,sKAAsI,CAAA;IACtI,oLAAoJ,CAAA;IAEpJ,cAAc;IACd,sLAAsJ,CAAA;IACtJ,4JAA4H,CAAA;IAC5H,6IAA6G,CAAA;IAE7G,mCAAmC;IACnC,wJAAwH,CAAA;IACxH,iIAAiG,CAAA;IAEjG,sCAAsC;IACtC,iKAAiI,CAAA;IACjI,uIAAuG,CAAA;IAEvG,MAAM;IACN,gJAAgH,CAAA;IAChH,6HAA6F,CAAA;IAE7F,wBAAwB;IACxB,gGAAgE,CAAA;IAChE,0GAA0E,CAAA;IAC1E,kHAAkF,CAAA;IAClF,0HAA0F,CAAA;IAC1F,wIAAwG,CAAA;AAC1G,CAAC,EAtEI,4BAA4B,KAA5B,4BAA4B,QAsEhC;AAED,eAAe,4BAA4B,CAAC"}
+{"version":3,"file":"NotificationSettingEventType.js","sourceRoot":"","sources":["../../../../Types/NotificationSetting/NotificationSettingEventType.ts"],"names":[],"mappings":"AAAA,IAAK,4BA0EJ;AA1ED,WAAK,4BAA4B;IAC/B,WAAW;IACX,mJAAmH,CAAA;IACnH,2JAA2H,CAAA;IAC3H,+JAA+H,CAAA;IAC/H,uIAAuG,CAAA;IACvG,2IAA2G,CAAA;IAC3G,6IAA6G,CAAA;IAE7G,SAAS;IAET,0IAA0G,CAAA;IAC1G,kJAAkH,CAAA;IAClH,sJAAsH,CAAA;IACtH,iIAAiG,CAAA;IACjG,uIAAuG,CAAA;IAEvG,iBAAiB;IAEjB,kKAAkI,CAAA;IAClI,0KAA0I,CAAA;IAC1I,8KAA8I,CAAA;IAC9I,iJAAiH,CAAA;IACjH,wJAAwH,CAAA;IAExH,oBAAoB;IAEpB,2KAA2I,CAAA;IAC3I,mLAAmJ,CAAA;IACnJ,uLAAuJ,CAAA;IACvJ,uJAAuH,CAAA;IACvH,iKAAiI,CAAA;IAEjI,WAAW;IACX,qIAAqG,CAAA;IACrG,gJAAgH,CAAA;IAChH,8JAA8H,CAAA;IAC9H,2IAA2G,CAAA;IAC3G,2KAA2I,CAAA;IAE3I,wBAAwB;IACxB,0JAA0H,CAAA;IAC1H,kKAAkI,CAAA;IAClI,iJAAiH,CAAA;IACjH,sKAAsI,CAAA;IACtI,oLAAoJ,CAAA;IAEpJ,cAAc;IACd,sLAAsJ,CAAA;IACtJ,4JAA4H,CAAA;IAC5H,6IAA6G,CAAA;IAE7G,mCAAmC;IACnC,wJAAwH,CAAA;IACxH,iIAAiG,CAAA;IAEjG,sCAAsC;IACtC,iKAAiI,CAAA;IACjI,uIAAuG,CAAA;IAEvG,MAAM;IACN,gJAAgH,CAAA;IAChH,6HAA6F,CAAA;IAE7F,wBAAwB;IACxB,gGAAgE,CAAA;IAChE,0GAA0E,CAAA;IAC1E,kHAAkF,CAAA;IAClF,0HAA0F,CAAA;IAC1F,wIAAwG,CAAA;IAExG,wDAAwD;IACxD,4GAA4E,CAAA;IAC5E,0HAA0F,CAAA;AAC5F,CAAC,EA1EI,4BAA4B,KAA5B,4BAA4B,QA0EhC;AAED,eAAe,4BAA4B,CAAC"}

package/build/dist/Types/OnCallDutyPolicy/CalendarFeedWindow.js

@@ -0,0 +1,97 @@
+/*
+ * Window and cost constants for the on-call calendar feeds.
+ *
+ * These are deliberately constants rather than environment variables: they
+ * bound how much work one feed fetch can cause and how large a body a
+ * calendar client has to swallow, and an operator tuning them per install
+ * would only move the failure elsewhere (Google skips events in very large
+ * feeds; Proton rejects oversized feeds outright).
+ */
+// Furthest a feed may look ahead, in days.
+export const MAX_FUTURE_DAYS = 180;
+// Shortest look-ahead a subscriber may pick, in days.
+export const MIN_FUTURE_DAYS = 7;
+// Look-ahead used when a feed row has no explicit setting.
+export const DEFAULT_FUTURE_DAYS = 90;
+// Furthest a feed may look back, in days. History is opt-in beyond 2 days.
+export const MAX_PAST_DAYS = 60;
+// Look-back used when a feed row has no explicit setting.
+export const DEFAULT_PAST_DAYS = 2;
+/*
+ * Hard cap on VEVENTs in one feed. When a feed would exceed it, futureDays is
+ * shrunk until it fits (see OnCallCalendarFeedUtil.shrinkWindowToFit).
+ */
+export const MAX_EVENTS = 5000;
+// Hard cap on "No coverage" events per feed (oldest first).
+export const MAX_GAP_EVENTS = 100;
+// A rotated-out token keeps serving an EMPTY calendar for this long.
+export const PREVIOUS_TOKEN_GRACE_DAYS = 30;
+// Rendered body cache TTL, in seconds (also the Cache-Control max-age).
+export const BODY_CACHE_TTL_SECONDS = 300;
+// Schedule-level materialized-shift cache TTL, in seconds.
+export const SCHEDULE_CACHE_TTL_SECONDS = 3600;
+// Maximum concurrent uncached renders per process.
+export const RENDER_CONCURRENCY = 4;
+/*
+ * Per-layer rotation-period budget for feed rendering (LayerUtil's
+ * maxSimulationIterations). Well above any realistic schedule age at hourly
+ * granularity, far below the engine's 5,000,000 ceiling.
+ */
+export const FEED_SIMULATION_ITERATION_CAP = 200000;
+const MILLISECONDS_PER_DAY = 24 * 60 * 60 * 1000;
+export default class CalendarFeedWindow {
+    /*
+     * Coerce a stored / user-supplied pastDays value into the allowed range.
+     * Anything that is not a finite number falls back to the default rather
+     * than to 0, so a missing column never silently hides the current shift.
+     */
+    static clampPastDays(value) {
+        const parsed = CalendarFeedWindow.toFiniteInteger(value);
+        if (Number.isNaN(parsed)) {
+            return DEFAULT_PAST_DAYS;
+        }
+        return Math.min(MAX_PAST_DAYS, Math.max(0, parsed));
+    }
+    static clampFutureDays(value) {
+        const parsed = CalendarFeedWindow.toFiniteInteger(value);
+        if (Number.isNaN(parsed)) {
+            return DEFAULT_FUTURE_DAYS;
+        }
+        return Math.min(MAX_FUTURE_DAYS, Math.max(MIN_FUTURE_DAYS, parsed));
+    }
+    /*
+     * The feed window for a fetch at `now`. Both edges sit on UTC midnights so
+     * every fetch inside the same UTC day produces the same window — which is
+     * what makes the rendered body cacheable across polls.
+     */
+    static computeFeedWindow(data) {
+        const pastDays = CalendarFeedWindow.clampPastDays(data.pastDays);
+        const futureDays = CalendarFeedWindow.clampFutureDays(data.futureDays);
+        const todayUtc = CalendarFeedWindow.startOfUtcDay(data.now);
+        return {
+            feedStart: new Date(todayUtc - pastDays * MILLISECONDS_PER_DAY),
+            feedEnd: new Date(todayUtc + (futureDays + 1) * MILLISECONDS_PER_DAY),
+        };
+    }
+    // 00:00:00.000 UTC of the day containing `date`, as epoch milliseconds.
+    static startOfUtcDay(date) {
+        return Date.UTC(date.getUTCFullYear(), date.getUTCMonth(), date.getUTCDate());
+    }
+    // "YYYY-MM-DD" of the UTC day containing `date`, for cache keys.
+    static getUtcDayBucket(date) {
+        return new Date(CalendarFeedWindow.startOfUtcDay(date))
+            .toISOString()
+            .slice(0, 10);
+    }
+    static toFiniteInteger(value) {
+        if (typeof value === "number") {
+            return Number.isFinite(value) ? Math.floor(value) : Number.NaN;
+        }
+        if (typeof value === "string" && value.trim() !== "") {
+            const parsed = Number(value);
+            return Number.isFinite(parsed) ? Math.floor(parsed) : Number.NaN;
+        }
+        return Number.NaN;
+    }
+}
+//# sourceMappingURL=CalendarFeedWindow.js.map

package/build/dist/Types/OnCallDutyPolicy/CalendarFeedWindow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CalendarFeedWindow.js","sourceRoot":"","sources":["../../../../Types/OnCallDutyPolicy/CalendarFeedWindow.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,2CAA2C;AAC3C,MAAM,CAAC,MAAM,eAAe,GAAW,GAAG,CAAC;AAE3C,sDAAsD;AACtD,MAAM,CAAC,MAAM,eAAe,GAAW,CAAC,CAAC;AAEzC,2DAA2D;AAC3D,MAAM,CAAC,MAAM,mBAAmB,GAAW,EAAE,CAAC;AAE9C,2EAA2E;AAC3E,MAAM,CAAC,MAAM,aAAa,GAAW,EAAE,CAAC;AAExC,0DAA0D;AAC1D,MAAM,CAAC,MAAM,iBAAiB,GAAW,CAAC,CAAC;AAE3C;;;GAGG;AACH,MAAM,CAAC,MAAM,UAAU,GAAW,IAAI,CAAC;AAEvC,4DAA4D;AAC5D,MAAM,CAAC,MAAM,cAAc,GAAW,GAAG,CAAC;AAE1C,qEAAqE;AACrE,MAAM,CAAC,MAAM,yBAAyB,GAAW,EAAE,CAAC;AAEpD,wEAAwE;AACxE,MAAM,CAAC,MAAM,sBAAsB,GAAW,GAAG,CAAC;AAElD,2DAA2D;AAC3D,MAAM,CAAC,MAAM,0BAA0B,GAAW,IAAI,CAAC;AAEvD,mDAAmD;AACnD,MAAM,CAAC,MAAM,kBAAkB,GAAW,CAAC,CAAC;AAE5C;;;;GAIG;AACH,MAAM,CAAC,MAAM,6BAA6B,GAAW,MAAM,CAAC;AAE5D,MAAM,oBAAoB,GAAW,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AASzD,MAAM,CAAC,OAAO,OAAO,kBAAkB;IACrC;;;;OAIG;IACI,MAAM,CAAC,aAAa,CAAC,KAAc;QACxC,MAAM,MAAM,GAAW,kBAAkB,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAEjE,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;YACzB,OAAO,iBAAiB,CAAC;QAC3B,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IACtD,CAAC;IAEM,MAAM,CAAC,eAAe,CAAC,KAAc;QAC1C,MAAM,MAAM,GAAW,kBAAkB,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAEjE,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;YACzB,OAAO,mBAAmB,CAAC;QAC7B,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,MAAM,CAAC,CAAC,CAAC;IACtE,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,iBAAiB,CAAC,IAI/B;QACC,MAAM,QAAQ,GAAW,kBAAkB,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzE,MAAM,UAAU,GAAW,kBAAkB,CAAC,eAAe,CAC3D,IAAI,CAAC,UAAU,CAChB,CAAC;QAEF,MAAM,QAAQ,GAAW,kBAAkB,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEpE,OAAO;YACL,SAAS,EAAE,IAAI,IAAI,CAAC,QAAQ,GAAG,QAAQ,GAAG,oBAAoB,CAAC;YAC/D,OAAO,EAAE,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,oBAAoB,CAAC;SACtE,CAAC;IACJ,CAAC;IAED,wEAAwE;IACjE,MAAM,CAAC,aAAa,CAAC,IAAU;QACpC,OAAO,IAAI,CAAC,GAAG,CACb,IAAI,CAAC,cAAc,EAAE,EACrB,IAAI,CAAC,WAAW,EAAE,EAClB,IAAI,CAAC,UAAU,EAAE,CAClB,CAAC;IACJ,CAAC;IAED,iEAAiE;IAC1D,MAAM,CAAC,eAAe,CAAC,IAAU;QACtC,OAAO,IAAI,IAAI,CAAC,kBAAkB,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;aACpD,WAAW,EAAE;aACb,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAClB,CAAC;IAEO,MAAM,CAAC,eAAe,CAAC,KAAc;QAC3C,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;QACjE,CAAC;QAED,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACrD,MAAM,MAAM,GAAW,MAAM,CAAC,KAAK,CAAC,CAAC;YACrC,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;QACnE,CAAC;QAED,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;CACF"}