@oneuptime/common 12.0.14 → 12.0.15

package/build/dist/Utils/Monitor/NetworkDeviceLinkRuleUtil.js

@@ -1,27 +1,71 @@
-/*
- * Turning label rules into uplinks.
- *
- * Pure data-in/data-out so the whole decision matrix — which is mostly about
- * REFUSING to draw things — is unit-testable without a database.
- *
- * The shape is a star, not a clique. A rule names a set of child labels and a
- * set of parent labels; every device carrying all the child labels gets one
- * edge to the single device carrying all the parent labels. Matching "devices
- * that share a label" symmetrically, which is what was originally asked for,
- * would turn one forty-device site label into 780 edges.
- */
-export default class NetworkDeviceLinkRuleUtil {
+import { NetworkDeviceLinkRuleScopeUtil } from "../../Types/NetworkDevice/NetworkDeviceLinkRuleScope";
+class NetworkDeviceLinkRuleUtil {
     /*
      * ALL of the rule's labels must be present on the device, not any. "Devices
      * that are both an access point AND on floor 1" is the question an operator
      * is asking; any-of would sweep in every access point in the building.
      */
-    static deviceMatches(device, requiredLabelIds) {
-        const owned = new Set(device.labelIds);
+    static matches(labelSet, requiredLabelIds) {
         return requiredLabelIds.every((labelId) => {
-            return owned.has(labelId);
+            return labelSet.has(labelId);
         });
     }
+    static resolveGroup(rule, group) {
+        const parents = group.filter((entry) => {
+            return NetworkDeviceLinkRuleUtil.matches(entry.labelSet, rule.parentLabelIds);
+        });
+        /*
+         * Counted before the parent branch, not after: a site that failed to
+         * resolve still has to report how many devices are floating there, and
+         * that number is the operator's damage assessment.
+         */
+        const childCandidates = group.filter((entry) => {
+            return NetworkDeviceLinkRuleUtil.matches(entry.labelSet, rule.childLabelIds);
+        });
+        const childMatchCount = childCandidates.length;
+        if (parents.length === 0) {
+            return {
+                links: [],
+                parentMatchCount: 0,
+                childMatchCount: childMatchCount,
+                failure: "noParentMatched",
+            };
+        }
+        /*
+         * Two candidate parents is not a tie to break — it is a question the
+         * labels do not answer. Drawing to either one would assert a cabling
+         * fact nobody stated.
+         */
+        if (parents.length > 1) {
+            return {
+                links: [],
+                parentMatchCount: parents.length,
+                childMatchCount: childMatchCount,
+                failure: "ambiguousParent",
+            };
+        }
+        const parent = parents[0];
+        // The parent is excluded even when it matches both sets: no self-links.
+        const children = childCandidates.filter((entry) => {
+            return entry.device.id !== parent.device.id;
+        });
+        if (children.length === 0) {
+            return {
+                links: [],
+                parentMatchCount: 1,
+                childMatchCount: childMatchCount,
+                failure: "noChildrenMatched",
+            };
+        }
+        return {
+            links: children.map((child) => {
+                return { fromDeviceId: child.device.id, toDeviceId: parent.device.id };
+            }),
+            parentMatchCount: 1,
+            childMatchCount: childMatchCount,
+            failure: null,
+        };
+    }
     static resolveRule(rule, devices) {
         const empty = (reason, parents = 0, children = 0) => {
             return {
@@ -33,6 +77,13 @@ export default class NetworkDeviceLinkRuleUtil {
                 matchedChildCount: children,
             };
         };
+        /*
+         * The three checks below are properties of the rule's TEXT, true in every
+         * site, so they are settled before scope is even read. A disabled rule is
+         * not "disabled in Unit 7", and partitioning a rule with an empty parent
+         * label set would make every site in the project ambiguous at once — the
+         * worst noise outcome available.
+         */
         if (rule.isEnabled === false) {
             return empty("disabled");
         }
@@ -47,38 +98,172 @@ export default class NetworkDeviceLinkRuleUtil {
         if (rule.parentLabelIds.length === 0) {
             return empty("noParentLabels");
         }
-        const parents = devices.filter((device) => {
-            return NetworkDeviceLinkRuleUtil.deviceMatches(device, rule.parentLabelIds);
+        const normalized = devices.map((device) => {
+            return {
+                device: device,
+                labelSet: new Set(device.labelIds),
+                siteKey: (device.siteId || "").toString().trim(),
+            };
         });
-        if (parents.length === 0) {
+        if (NetworkDeviceLinkRuleScopeUtil.isSiteScoped(rule.scope)) {
+            return NetworkDeviceLinkRuleUtil.resolvePerSite(rule, normalized);
+        }
+        return NetworkDeviceLinkRuleUtil.resolveProject(rule, normalized, empty);
+    }
+    static resolveProject(rule, normalized, empty) {
+        const result = NetworkDeviceLinkRuleUtil.resolveGroup(rule, normalized);
+        if (result.failure === "noParentMatched") {
             return empty("noParentMatched", 0);
         }
-        /*
-         * Two candidate parents is not a tie to break — it is a question the
-         * labels do not answer. Drawing to either one would assert a cabling
-         * fact nobody stated.
-         */
-        if (parents.length > 1) {
-            return empty("ambiguousParent", parents.length);
+        if (result.failure === "ambiguousParent") {
+            return empty("ambiguousParent", result.parentMatchCount);
         }
-        const parent = parents[0];
-        const children = devices.filter((device) => {
-            // The parent is excluded even when it matches both sets: no self-links.
-            return (device.id !== parent.id &&
-                NetworkDeviceLinkRuleUtil.deviceMatches(device, rule.childLabelIds));
-        });
-        if (children.length === 0) {
+        if (result.failure === "noChildrenMatched") {
             return empty("noChildrenMatched", 1);
         }
         return {
             ruleId: rule.id,
             ruleName: rule.name,
-            links: children.map((child) => {
-                return { fromDeviceId: child.id, toDeviceId: parent.id };
-            }),
+            links: result.links,
             matchedParentCount: 1,
-            matchedChildCount: children.length,
+            matchedChildCount: result.links.length,
+        };
+    }
+    static resolvePerSite(rule, normalized) {
+        /*
+         * Bucketed in ONE pass in first-appearance order. Never
+         * `devices.filter(...)` inside a loop over sites: that is O(devices x
+         * sites) per rule, and this endpoint runs at ten thousand devices.
+         */
+        const buckets = new Map();
+        let unsitedChildDeviceCount = 0;
+        for (const entry of normalized) {
+            /*
+             * A device with no site is EXCLUDED, not pooled with the other unsited
+             * ones and not given a group of its own. Pooling would ask "exactly one
+             * parent among all the unsited devices", a question nobody posed, and
+             * would draw an edge between two boxes whose only relationship is that
+             * neither has been assigned a site yet. Counted instead, so the map can
+             * say how many the rule walked past.
+             */
+            if (entry.siteKey === "") {
+                if (NetworkDeviceLinkRuleUtil.matches(entry.labelSet, rule.childLabelIds)) {
+                    unsitedChildDeviceCount++;
+                }
+                continue;
+            }
+            const bucket = buckets.get(entry.siteKey);
+            if (bucket) {
+                bucket.push(entry);
+            }
+            else {
+                buckets.set(entry.siteKey, [entry]);
+            }
+        }
+        const links = [];
+        const groupFailures = [];
+        let applicableSiteCount = 0;
+        let matchedParentCount = 0;
+        for (const [siteId, group] of buckets) {
+            const result = NetworkDeviceLinkRuleUtil.resolveGroup(rule, group);
+            if (result.links.length > 0) {
+                applicableSiteCount++;
+                matchedParentCount += result.parentMatchCount;
+                links.push(...result.links);
+                continue;
+            }
+            /*
+             * A site speaks only when it holds devices this rule wanted to place.
+             * Sites with nothing to place are not misconfigured — the rule simply
+             * does not apply there, and a parent label like `SubCategory:Router` is
+             * present in nearly every site by construction. Without this gate, site
+             * scoping would trade one loud failure for two hundred quiet ones and
+             * the banner would be ignored inside a week.
+             *
+             * `noChildrenMatched` lands here too: the only child candidate was the
+             * parent itself, so after the self-link exclusion there is nothing to
+             * place and nothing to report.
+             */
+            if (result.childMatchCount === 0 ||
+                result.failure === null ||
+                result.failure === "noChildrenMatched") {
+                continue;
+            }
+            applicableSiteCount++;
+            matchedParentCount += result.parentMatchCount;
+            groupFailures.push({
+                siteId: siteId,
+                siteName: NetworkDeviceLinkRuleUtil.siteNameOf(group),
+                reason: result.failure,
+                matchedParentCount: result.parentMatchCount,
+                matchedChildCount: result.childMatchCount,
+            });
+        }
+        const outcome = {
+            ruleId: rule.id,
+            ruleName: rule.name,
+            links: links,
+            matchedParentCount: matchedParentCount,
+            matchedChildCount: links.length,
+            applicableSiteCount: applicableSiteCount,
         };
+        /*
+         * Keeps `links.length === 0 <=> skipReason defined` true with no gaps, so
+         * describeOutcome can never fall through to "Draws 0 uplinks" on an empty
+         * outcome. The second arm covers both an empty device list and a rule
+         * whose labels match nothing anywhere.
+         */
+        if (links.length === 0) {
+            outcome.skipReason =
+                groupFailures.length > 0 ? "noSiteResolved" : "noChildrenMatched";
+        }
+        if (groupFailures.length > 0) {
+            outcome.groupFailures = groupFailures;
+        }
+        if (unsitedChildDeviceCount > 0) {
+            outcome.unsitedChildDeviceCount = unsitedChildDeviceCount;
+        }
+        return outcome;
+    }
+    /** First non-empty site name among a site's devices, if any of them carry one. */
+    static siteNameOf(group) {
+        for (const entry of group) {
+            if (entry.device.siteName) {
+                return entry.device.siteName;
+            }
+        }
+        return undefined;
+    }
+    /*
+     * "Unit 4, Unit 9 and 2 more sites".
+     *
+     * Sorted before naming, and that is load-bearing rather than cosmetic: the
+     * live view refetches every sixty seconds and the device query has no ORDER
+     * BY, so an unsorted list would reshuffle the banner on every poll and read
+     * as a change that did not happen. The count stays exact even when the names
+     * are elided, so the operator always knows the true blast radius.
+     */
+    static describeSiteList(failures) {
+        const sorted = [...failures].sort((a, b) => {
+            return ((a.siteName || "").localeCompare(b.siteName || "") ||
+                a.siteId.localeCompare(b.siteId));
+        });
+        const names = sorted
+            .slice(0, NetworkDeviceLinkRuleUtil.MAX_NAMED_SITES)
+            .map((failure) => {
+            const name = failure.siteName || NetworkDeviceLinkRuleUtil.UNNAMED_SITE;
+            return name.length > NetworkDeviceLinkRuleUtil.MAX_SITE_NAME_LENGTH
+                ? `${name.slice(0, NetworkDeviceLinkRuleUtil.MAX_SITE_NAME_LENGTH - 1)}…`
+                : name;
+        });
+        const remaining = sorted.length - names.length;
+        if (remaining > 0) {
+            return `${names.join(", ")} and ${remaining} more site${remaining === 1 ? "" : "s"}`;
+        }
+        if (names.length === 1) {
+            return names[0];
+        }
+        return `${names.slice(0, -1).join(", ")} and ${names[names.length - 1]}`;
     }
     static resolveRules(rules, devices) {
         return rules.map((rule) => {
@@ -100,9 +285,105 @@ export default class NetworkDeviceLinkRuleUtil {
                 return `${outcome.matchedParentCount} devices carry the parent labels. Exactly one must, or there is no way to tell which is the uplink.`;
             case "noChildrenMatched":
                 return "No device carries the child labels yet.";
+            case "noSiteResolved":
+                return "No site resolved this rule.";
             default:
                 return `Draws ${outcome.matchedChildCount} uplink${outcome.matchedChildCount === 1 ? "" : "s"}.`;
         }
     }
+    /**
+     * The operator-facing warning, or null when the rule needs no explanation.
+     *
+     * Singular on purpose: ONE bullet per rule, never one per site. The banner's
+     * length is then bounded by the number of rules the operator wrote — a small
+     * number they control — rather than by the number of sites in their project.
+     *
+     * This is also the only sanctioned "did this rule fail" predicate. A caller
+     * must not go back to testing `outcome.links.length === 0`, which a rule
+     * drawing thirteen of fourteen sites passes while genuinely failing.
+     */
+    static getWarning(outcome) {
+        const failures = outcome.groupFailures || [];
+        const unsited = outcome.unsitedChildDeviceCount || 0;
+        /*
+         * Project scope always lands here, and this branch is what the topology
+         * API used to compute inline: warn iff the rule drew nothing, using
+         * describeOutcome's own words. The `!skipReason` guard makes the old
+         * code's implicit assumption explicit rather than emitting a warning with
+         * an undefined reason.
+         */
+        if (failures.length === 0 && unsited === 0) {
+            if (outcome.links.length > 0 || !outcome.skipReason) {
+                return null;
+            }
+            return {
+                ruleId: outcome.ruleId,
+                ruleName: outcome.ruleName,
+                reason: outcome.skipReason,
+                message: NetworkDeviceLinkRuleUtil.describeOutcome(outcome),
+            };
+        }
+        const parts = [];
+        const applicableSiteCount = outcome.applicableSiteCount || 0;
+        if (outcome.links.length === 0) {
+            parts.push("No site resolved this rule.");
+        }
+        else if (applicableSiteCount > 1) {
+            // A single applicable site needs no coverage fraction.
+            parts.push(`Drawing in ${applicableSiteCount - failures.length} of ${applicableSiteCount} sites.`);
+        }
+        const ambiguous = failures.filter((failure) => {
+            return failure.reason === "ambiguousParent";
+        });
+        const parentless = failures.filter((failure) => {
+            return failure.reason === "noParentMatched";
+        });
+        if (ambiguous.length === 1) {
+            /*
+             * The trailing sentence deliberately echoes the project-scope wording so
+             * an operator's vocabulary does not fork between the two scopes.
+             */
+            parts.push(`${ambiguous[0].matchedParentCount} devices carry the parent labels in ${NetworkDeviceLinkRuleUtil.describeSiteList(ambiguous)}. Exactly one must, or there is no way to tell which is the uplink.`);
+        }
+        else if (ambiguous.length > 1) {
+            parts.push(`Several devices carry the parent labels in ${NetworkDeviceLinkRuleUtil.describeSiteList(ambiguous)}. Exactly one per site must, or there is no way to tell which is the uplink.`);
+        }
+        if (parentless.length > 0) {
+            const stranded = parentless.reduce((sum, failure) => {
+                return sum + failure.matchedChildCount;
+            }, 0);
+            parts.push(`No device carries the parent labels in ${NetworkDeviceLinkRuleUtil.describeSiteList(parentless)}, so ${stranded} ${stranded === 1 ? "device" : "devices"} there ${stranded === 1 ? "has" : "have"} no uplink.`);
+        }
+        /*
+         * Always last and always its own sentence: the fix here is "assign these
+         * devices to a site", not "fix your labels", so they are never folded into
+         * a site-name list.
+         */
+        if (unsited > 0) {
+            parts.push(`${unsited} ${unsited === 1 ? "device" : "devices"} carrying the child labels ${unsited === 1 ? "is" : "are"} not assigned to a site, so this site-scoped rule skips ${unsited === 1 ? "it" : "them"}.`);
+        }
+        return {
+            ruleId: outcome.ruleId,
+            ruleName: outcome.ruleName,
+            // Highest-ranked condition present. Ambiguity outranks a missing parent.
+            reason: ambiguous.length > 0
+                ? "ambiguousParent"
+                : parentless.length > 0
+                    ? "noParentMatched"
+                    : "devicesWithoutSite",
+            message: parts.join(" "),
+        };
+    }
 }
+/*
+ * Appended by the caller when the device list hit its row cap. Lives here so
+ * every operator-facing string this feature produces stays in one file.
+ */
+NetworkDeviceLinkRuleUtil.TRUNCATED_DEVICE_LIST_NOTE = "The device list was truncated, so some of these may be false alarms.";
+// Three names is enough to recognise a pattern; fourteen is a wall of text.
+NetworkDeviceLinkRuleUtil.MAX_NAMED_SITES = 3;
+// Site names are ShortText and can run to 100 characters.
+NetworkDeviceLinkRuleUtil.MAX_SITE_NAME_LENGTH = 40;
+NetworkDeviceLinkRuleUtil.UNNAMED_SITE = "an unnamed site";
+export default NetworkDeviceLinkRuleUtil;
 //# sourceMappingURL=NetworkDeviceLinkRuleUtil.js.map

package/build/dist/Utils/Monitor/NetworkDeviceLinkRuleUtil.js.map

@@ -1 +1 @@
-{"version":3,"file":"NetworkDeviceLinkRuleUtil.js","sourceRoot":"","sources":["../../../../Utils/Monitor/NetworkDeviceLinkRuleUtil.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAyCH,MAAM,CAAC,OAAO,OAAO,yBAAyB;IAC5C;;;;OAIG;IACK,MAAM,CAAC,aAAa,CAC1B,MAA2B,EAC3B,gBAA+B;QAE/B,MAAM,KAAK,GAAgB,IAAI,GAAG,CAAS,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC5D,OAAO,gBAAgB,CAAC,KAAK,CAAC,CAAC,OAAe,EAAE,EAAE;YAChD,OAAO,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,MAAM,CAAC,WAAW,CACvB,IAAmB,EACnB,OAAmC;QAEnC,MAAM,KAAK,GAIY,CACrB,MAA0B,EAC1B,UAAkB,CAAC,EACnB,WAAmB,CAAC,EACH,EAAE;YACnB,OAAO;gBACL,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,QAAQ,EAAE,IAAI,CAAC,IAAI;gBACnB,KAAK,EAAE,EAAE;gBACT,UAAU,EAAE,MAAM;gBAClB,kBAAkB,EAAE,OAAO;gBAC3B,iBAAiB,EAAE,QAAQ;aAC5B,CAAC;QACJ,CAAC,CAAC;QAEF,IAAI,IAAI,CAAC,SAAS,KAAK,KAAK,EAAE,CAAC;YAC7B,OAAO,KAAK,CAAC,UAAU,CAAC,CAAC;QAC3B,CAAC;QAED;;;;WAIG;QACH,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpC,OAAO,KAAK,CAAC,eAAe,CAAC,CAAC;QAChC,CAAC;QACD,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrC,OAAO,KAAK,CAAC,gBAAgB,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,OAAO,GAA+B,OAAO,CAAC,MAAM,CACxD,CAAC,MAA2B,EAAE,EAAE;YAC9B,OAAO,yBAAyB,CAAC,aAAa,CAC5C,MAAM,EACN,IAAI,CAAC,cAAc,CACpB,CAAC;QACJ,CAAC,CACF,CAAC;QAEF,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;QACrC,CAAC;QAED;;;;WAIG;QACH,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC,iBAAiB,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QAClD,CAAC;QAED,MAAM,MAAM,GAAwB,OAAO,CAAC,CAAC,CAAE,CAAC;QAEhD,MAAM,QAAQ,GAA+B,OAAO,CAAC,MAAM,CACzD,CAAC,MAA2B,EAAE,EAAE;YAC9B,wEAAwE;YACxE,OAAO,CACL,MAAM,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE;gBACvB,yBAAyB,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,CACpE,CAAC;QACJ,CAAC,CACF,CAAC;QAEF,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,KAAK,CAAC,mBAAmB,EAAE,CAAC,CAAC,CAAC;QACvC,CAAC;QAED,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,QAAQ,EAAE,IAAI,CAAC,IAAI;YACnB,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,KAA0B,EAAE,EAAE;gBACjD,OAAO,EAAE,YAAY,EAAE,KAAK,CAAC,EAAE,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC;YAC3D,CAAC,CAAC;YACF,kBAAkB,EAAE,CAAC;YACrB,iBAAiB,EAAE,QAAQ,CAAC,MAAM;SACnC,CAAC;IACJ,CAAC;IAEM,MAAM,CAAC,YAAY,CACxB,KAA2B,EAC3B,OAAmC;QAEnC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAmB,EAAE,EAAE;YACvC,OAAO,yBAAyB,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC9D,CAAC,CAAC,CAAC;IACL,CAAC;IAED,0DAA0D;IACnD,MAAM,CAAC,eAAe,CAAC,OAAwB;QACpD,QAAQ,OAAO,CAAC,UAAU,EAAE,CAAC;YAC3B,KAAK,UAAU;gBACb,OAAO,4BAA4B,CAAC;YACtC,KAAK,eAAe;gBAClB,OAAO,oDAAoD,CAAC;YAC9D,KAAK,gBAAgB;gBACnB,OAAO,qDAAqD,CAAC;YAC/D,KAAK,iBAAiB;gBACpB,OAAO,wEAAwE,CAAC;YAClF,KAAK,iBAAiB;gBACpB,OAAO,GAAG,OAAO,CAAC,kBAAkB,qGAAqG,CAAC;YAC5I,KAAK,mBAAmB;gBACtB,OAAO,yCAAyC,CAAC;YACnD;gBACE,OAAO,SAAS,OAAO,CAAC,iBAAiB,UACvC,OAAO,CAAC,iBAAiB,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GACzC,GAAG,CAAC;QACR,CAAC;IACH,CAAC;CACF"}
+{"version":3,"file":"NetworkDeviceLinkRuleUtil.js","sourceRoot":"","sources":["../../../../Utils/Monitor/NetworkDeviceLinkRuleUtil.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,8BAA8B,EAAE,MAAM,sDAAsD,CAAC;AAoMtG,MAAqB,yBAAyB;IAc5C;;;;OAIG;IACK,MAAM,CAAC,OAAO,CACpB,QAAqB,EACrB,gBAA+B;QAE/B,OAAO,gBAAgB,CAAC,KAAK,CAAC,CAAC,OAAe,EAAE,EAAE;YAChD,OAAO,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,MAAM,CAAC,YAAY,CACzB,IAAmB,EACnB,KAA8B;QAE9B,MAAM,OAAO,GAA4B,KAAK,CAAC,MAAM,CACnD,CAAC,KAAuB,EAAE,EAAE;YAC1B,OAAO,yBAAyB,CAAC,OAAO,CACtC,KAAK,CAAC,QAAQ,EACd,IAAI,CAAC,cAAc,CACpB,CAAC;QACJ,CAAC,CACF,CAAC;QAEF;;;;WAIG;QACH,MAAM,eAAe,GAA4B,KAAK,CAAC,MAAM,CAC3D,CAAC,KAAuB,EAAE,EAAE;YAC1B,OAAO,yBAAyB,CAAC,OAAO,CACtC,KAAK,CAAC,QAAQ,EACd,IAAI,CAAC,aAAa,CACnB,CAAC;QACJ,CAAC,CACF,CAAC;QACF,MAAM,eAAe,GAAW,eAAe,CAAC,MAAM,CAAC;QAEvD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO;gBACL,KAAK,EAAE,EAAE;gBACT,gBAAgB,EAAE,CAAC;gBACnB,eAAe,EAAE,eAAe;gBAChC,OAAO,EAAE,iBAAiB;aAC3B,CAAC;QACJ,CAAC;QAED;;;;WAIG;QACH,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO;gBACL,KAAK,EAAE,EAAE;gBACT,gBAAgB,EAAE,OAAO,CAAC,MAAM;gBAChC,eAAe,EAAE,eAAe;gBAChC,OAAO,EAAE,iBAAiB;aAC3B,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAAqB,OAAO,CAAC,CAAC,CAAE,CAAC;QAE7C,wEAAwE;QACxE,MAAM,QAAQ,GAA4B,eAAe,CAAC,MAAM,CAC9D,CAAC,KAAuB,EAAE,EAAE;YAC1B,OAAO,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QAC9C,CAAC,CACF,CAAC;QAEF,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO;gBACL,KAAK,EAAE,EAAE;gBACT,gBAAgB,EAAE,CAAC;gBACnB,eAAe,EAAE,eAAe;gBAChC,OAAO,EAAE,mBAAmB;aAC7B,CAAC;QACJ,CAAC;QAED,OAAO;YACL,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAuB,EAAE,EAAE;gBAC9C,OAAO,EAAE,YAAY,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,EAAE,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YACzE,CAAC,CAAC;YACF,gBAAgB,EAAE,CAAC;YACnB,eAAe,EAAE,eAAe;YAChC,OAAO,EAAE,IAAI;SACd,CAAC;IACJ,CAAC;IAEM,MAAM,CAAC,WAAW,CACvB,IAAmB,EACnB,OAAmC;QAEnC,MAAM,KAAK,GAIY,CACrB,MAA0B,EAC1B,UAAkB,CAAC,EACnB,WAAmB,CAAC,EACH,EAAE;YACnB,OAAO;gBACL,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,QAAQ,EAAE,IAAI,CAAC,IAAI;gBACnB,KAAK,EAAE,EAAE;gBACT,UAAU,EAAE,MAAM;gBAClB,kBAAkB,EAAE,OAAO;gBAC3B,iBAAiB,EAAE,QAAQ;aAC5B,CAAC;QACJ,CAAC,CAAC;QAEF;;;;;;WAMG;QACH,IAAI,IAAI,CAAC,SAAS,KAAK,KAAK,EAAE,CAAC;YAC7B,OAAO,KAAK,CAAC,UAAU,CAAC,CAAC;QAC3B,CAAC;QAED;;;;WAIG;QACH,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpC,OAAO,KAAK,CAAC,eAAe,CAAC,CAAC;QAChC,CAAC;QACD,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrC,OAAO,KAAK,CAAC,gBAAgB,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,UAAU,GAA4B,OAAO,CAAC,GAAG,CACrD,CAAC,MAA2B,EAAE,EAAE;YAC9B,OAAO;gBACL,MAAM,EAAE,MAAM;gBACd,QAAQ,EAAE,IAAI,GAAG,CAAS,MAAM,CAAC,QAAQ,CAAC;gBAC1C,OAAO,EAAE,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE;aACjD,CAAC;QACJ,CAAC,CACF,CAAC;QAEF,IAAI,8BAA8B,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5D,OAAO,yBAAyB,CAAC,cAAc,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACpE,CAAC;QAED,OAAO,yBAAyB,CAAC,cAAc,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;IAC3E,CAAC;IAEO,MAAM,CAAC,cAAc,CAC3B,IAAmB,EACnB,UAAmC,EACnC,KAIoB;QAEpB,MAAM,MAAM,GAAwB,yBAAyB,CAAC,YAAY,CACxE,IAAI,EACJ,UAAU,CACX,CAAC;QAEF,IAAI,MAAM,CAAC,OAAO,KAAK,iBAAiB,EAAE,CAAC;YACzC,OAAO,KAAK,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,MAAM,CAAC,OAAO,KAAK,iBAAiB,EAAE,CAAC;YACzC,OAAO,KAAK,CAAC,iBAAiB,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC;QAC3D,CAAC;QACD,IAAI,MAAM,CAAC,OAAO,KAAK,mBAAmB,EAAE,CAAC;YAC3C,OAAO,KAAK,CAAC,mBAAmB,EAAE,CAAC,CAAC,CAAC;QACvC,CAAC;QAED,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,QAAQ,EAAE,IAAI,CAAC,IAAI;YACnB,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,kBAAkB,EAAE,CAAC;YACrB,iBAAiB,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;SACvC,CAAC;IACJ,CAAC;IAEO,MAAM,CAAC,cAAc,CAC3B,IAAmB,EACnB,UAAmC;QAEnC;;;;WAIG;QACH,MAAM,OAAO,GAAyC,IAAI,GAAG,EAG1D,CAAC;QACJ,IAAI,uBAAuB,GAAW,CAAC,CAAC;QAExC,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B;;;;;;;eAOG;YACH,IAAI,KAAK,CAAC,OAAO,KAAK,EAAE,EAAE,CAAC;gBACzB,IACE,yBAAyB,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,aAAa,CAAC,EACrE,CAAC;oBACD,uBAAuB,EAAE,CAAC;gBAC5B,CAAC;gBACD,SAAS;YACX,CAAC;YAED,MAAM,MAAM,GAAwC,OAAO,CAAC,GAAG,CAC7D,KAAK,CAAC,OAAO,CACd,CAAC;YACF,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAwB,EAAE,CAAC;QACtC,MAAM,aAAa,GAAgC,EAAE,CAAC;QACtD,IAAI,mBAAmB,GAAW,CAAC,CAAC;QACpC,IAAI,kBAAkB,GAAW,CAAC,CAAC;QAEnC,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;YACtC,MAAM,MAAM,GACV,yBAAyB,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAEtD,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,mBAAmB,EAAE,CAAC;gBACtB,kBAAkB,IAAI,MAAM,CAAC,gBAAgB,CAAC;gBAC9C,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC5B,SAAS;YACX,CAAC;YAED;;;;;;;;;;;eAWG;YACH,IACE,MAAM,CAAC,eAAe,KAAK,CAAC;gBAC5B,MAAM,CAAC,OAAO,KAAK,IAAI;gBACvB,MAAM,CAAC,OAAO,KAAK,mBAAmB,EACtC,CAAC;gBACD,SAAS;YACX,CAAC;YAED,mBAAmB,EAAE,CAAC;YACtB,kBAAkB,IAAI,MAAM,CAAC,gBAAgB,CAAC;YAC9C,aAAa,CAAC,IAAI,CAAC;gBACjB,MAAM,EAAE,MAAM;gBACd,QAAQ,EAAE,yBAAyB,CAAC,UAAU,CAAC,KAAK,CAAC;gBACrD,MAAM,EAAE,MAAM,CAAC,OAAO;gBACtB,kBAAkB,EAAE,MAAM,CAAC,gBAAgB;gBAC3C,iBAAiB,EAAE,MAAM,CAAC,eAAe;aAC1C,CAAC,CAAC;QACL,CAAC;QAED,MAAM,OAAO,GAAoB;YAC/B,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,QAAQ,EAAE,IAAI,CAAC,IAAI;YACnB,KAAK,EAAE,KAAK;YACZ,kBAAkB,EAAE,kBAAkB;YACtC,iBAAiB,EAAE,KAAK,CAAC,MAAM;YAC/B,mBAAmB,EAAE,mBAAmB;SACzC,CAAC;QAEF;;;;;WAKG;QACH,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,CAAC,UAAU;gBAChB,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,mBAAmB,CAAC;QACtE,CAAC;QAED,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,OAAO,CAAC,aAAa,GAAG,aAAa,CAAC;QACxC,CAAC;QACD,IAAI,uBAAuB,GAAG,CAAC,EAAE,CAAC;YAChC,OAAO,CAAC,uBAAuB,GAAG,uBAAuB,CAAC;QAC5D,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,kFAAkF;IAC1E,MAAM,CAAC,UAAU,CACvB,KAA8B;QAE9B,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YAC1B,IAAI,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;gBAC1B,OAAO,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC;YAC/B,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;OAQG;IACK,MAAM,CAAC,gBAAgB,CAC7B,QAAqC;QAErC,MAAM,MAAM,GAAgC,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAC5D,CAAC,CAAuB,EAAE,CAAuB,EAAE,EAAE;YACnD,OAAO,CACL,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC;gBAClD,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CACjC,CAAC;QACJ,CAAC,CACF,CAAC;QAEF,MAAM,KAAK,GAAkB,MAAM;aAChC,KAAK,CAAC,CAAC,EAAE,yBAAyB,CAAC,eAAe,CAAC;aACnD,GAAG,CAAC,CAAC,OAA6B,EAAE,EAAE;YACrC,MAAM,IAAI,GACR,OAAO,CAAC,QAAQ,IAAI,yBAAyB,CAAC,YAAY,CAAC;YAC7D,OAAO,IAAI,CAAC,MAAM,GAAG,yBAAyB,CAAC,oBAAoB;gBACjE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CACX,CAAC,EACD,yBAAyB,CAAC,oBAAoB,GAAG,CAAC,CACnD,GAAG;gBACN,CAAC,CAAC,IAAI,CAAC;QACX,CAAC,CAAC,CAAC;QAEL,MAAM,SAAS,GAAW,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QAEvD,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YAClB,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,SAAS,aACzC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GACzB,EAAE,CAAC;QACL,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC,CAAC,CAAE,CAAC;QACnB,CAAC;QACD,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,EAAE,CAAC;IAC5E,CAAC;IAEM,MAAM,CAAC,YAAY,CACxB,KAA2B,EAC3B,OAAmC;QAEnC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAmB,EAAE,EAAE;YACvC,OAAO,yBAAyB,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC9D,CAAC,CAAC,CAAC;IACL,CAAC;IAED,0DAA0D;IACnD,MAAM,CAAC,eAAe,CAAC,OAAwB;QACpD,QAAQ,OAAO,CAAC,UAAU,EAAE,CAAC;YAC3B,KAAK,UAAU;gBACb,OAAO,4BAA4B,CAAC;YACtC,KAAK,eAAe;gBAClB,OAAO,oDAAoD,CAAC;YAC9D,KAAK,gBAAgB;gBACnB,OAAO,qDAAqD,CAAC;YAC/D,KAAK,iBAAiB;gBACpB,OAAO,wEAAwE,CAAC;YAClF,KAAK,iBAAiB;gBACpB,OAAO,GAAG,OAAO,CAAC,kBAAkB,qGAAqG,CAAC;YAC5I,KAAK,mBAAmB;gBACtB,OAAO,yCAAyC,CAAC;YACnD,KAAK,gBAAgB;gBACnB,OAAO,6BAA6B,CAAC;YACvC;gBACE,OAAO,SAAS,OAAO,CAAC,iBAAiB,UACvC,OAAO,CAAC,iBAAiB,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GACzC,GAAG,CAAC;QACR,CAAC;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACI,MAAM,CAAC,UAAU,CAAC,OAAwB;QAC/C,MAAM,QAAQ,GAAgC,OAAO,CAAC,aAAa,IAAI,EAAE,CAAC;QAC1E,MAAM,OAAO,GAAW,OAAO,CAAC,uBAAuB,IAAI,CAAC,CAAC;QAE7D;;;;;;WAMG;QACH,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,EAAE,CAAC;YAC3C,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;gBACpD,OAAO,IAAI,CAAC;YACd,CAAC;YACD,OAAO;gBACL,MAAM,EAAE,OAAO,CAAC,MAAM;gBACtB,QAAQ,EAAE,OAAO,CAAC,QAAQ;gBAC1B,MAAM,EAAE,OAAO,CAAC,UAAU;gBAC1B,OAAO,EAAE,yBAAyB,CAAC,eAAe,CAAC,OAAO,CAAC;aAC5D,CAAC;QACJ,CAAC;QAED,MAAM,KAAK,GAAkB,EAAE,CAAC;QAChC,MAAM,mBAAmB,GAAW,OAAO,CAAC,mBAAmB,IAAI,CAAC,CAAC;QAErE,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,KAAK,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;QAC5C,CAAC;aAAM,IAAI,mBAAmB,GAAG,CAAC,EAAE,CAAC;YACnC,uDAAuD;YACvD,KAAK,CAAC,IAAI,CACR,cACE,mBAAmB,GAAG,QAAQ,CAAC,MACjC,OAAO,mBAAmB,SAAS,CACpC,CAAC;QACJ,CAAC;QAED,MAAM,SAAS,GAAgC,QAAQ,CAAC,MAAM,CAC5D,CAAC,OAA6B,EAAE,EAAE;YAChC,OAAO,OAAO,CAAC,MAAM,KAAK,iBAAiB,CAAC;QAC9C,CAAC,CACF,CAAC;QACF,MAAM,UAAU,GAAgC,QAAQ,CAAC,MAAM,CAC7D,CAAC,OAA6B,EAAE,EAAE;YAChC,OAAO,OAAO,CAAC,MAAM,KAAK,iBAAiB,CAAC;QAC9C,CAAC,CACF,CAAC;QAEF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B;;;eAGG;YACH,KAAK,CAAC,IAAI,CACR,GACE,SAAS,CAAC,CAAC,CAAE,CAAC,kBAChB,uCAAuC,yBAAyB,CAAC,gBAAgB,CAC/E,SAAS,CACV,qEAAqE,CACvE,CAAC;QACJ,CAAC;aAAM,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChC,KAAK,CAAC,IAAI,CACR,8CAA8C,yBAAyB,CAAC,gBAAgB,CACtF,SAAS,CACV,8EAA8E,CAChF,CAAC;QACJ,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAW,UAAU,CAAC,MAAM,CACxC,CAAC,GAAW,EAAE,OAA6B,EAAE,EAAE;gBAC7C,OAAO,GAAG,GAAG,OAAO,CAAC,iBAAiB,CAAC;YACzC,CAAC,EACD,CAAC,CACF,CAAC;YACF,KAAK,CAAC,IAAI,CACR,0CAA0C,yBAAyB,CAAC,gBAAgB,CAClF,UAAU,CACX,QAAQ,QAAQ,IAAI,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,UACxD,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAC3B,aAAa,CACd,CAAC;QACJ,CAAC;QAED;;;;WAIG;QACH,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;YAChB,KAAK,CAAC,IAAI,CACR,GAAG,OAAO,IACR,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAC7B,8BACE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KACzB,2DACE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MACzB,GAAG,CACJ,CAAC;QACJ,CAAC;QAED,OAAO;YACL,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,QAAQ,EAAE,OAAO,CAAC,QAAQ;YAC1B,yEAAyE;YACzE,MAAM,EACJ,SAAS,CAAC,MAAM,GAAG,CAAC;gBAClB,CAAC,CAAC,iBAAiB;gBACnB,CAAC,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;oBACrB,CAAC,CAAC,iBAAiB;oBACnB,CAAC,CAAC,oBAAoB;YAC5B,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC;SACzB,CAAC;IACJ,CAAC;;AA1hBD;;;GAGG;AACoB,oDAA0B,GAC/C,sEAAsE,CAAC;AAEzE,4EAA4E;AACpD,yCAAe,GAAW,CAAC,CAAC;AACpD,0DAA0D;AAClC,8CAAoB,GAAW,EAAE,CAAC;AAClC,sCAAY,GAAW,iBAAiB,CAAC;eAZ9C,yBAAyB"}

package/build/dist/Utils/NetworkDiscovery/UnclaimedScanDiagnosis.js

@@ -0,0 +1,87 @@
+import OneUptimeDate from "../../Types/Date";
+import ColumnLength from "../../Types/Database/ColumnLength";
+/*
+ * Why a network discovery scan is still sitting in "Pending".
+ *
+ * A scan leaves "Pending" in exactly one place: the probe asks
+ * /probe/discovery-scan/list and the server claims a row for it
+ * (App/FeatureSet/Telemetry/API/ProbeIngest/DiscoveryScan.ts). Nothing on the
+ * server can make that happen — if the probe never asks, the row simply never
+ * moves.
+ *
+ * Until this existed, that outcome was completely silent. The scans list
+ * showed "Pending" and an em-dash in Responded Hosts, forever, with no
+ * timestamp, no probe state and no message anywhere in the product; the only
+ * evidence lived in the probe container's log, if the operator had it. That is
+ * what OneUptime issue #3287 reported: four scans submitted over an hour, all
+ * "Pending", nothing to act on.
+ *
+ * So this module writes the sentence the operator was missing. It is pure and
+ * lives in Common so the wording can be unit-tested without a database, the
+ * same way ScanTargetUtil's messages are.
+ *
+ * It deliberately does NOT fail the scan. A scan nobody has claimed is still
+ * perfectly runnable the moment the probe comes back, and a recurring one
+ * would tangle with the re-queue pass; what was missing was information, not a
+ * state change.
+ */
+/*
+ * How long a scan may sit unclaimed before the job says anything.
+ *
+ * The probe polls every minute, so this is fifteen consecutive failed polls —
+ * long enough that a restarting probe, a redeploy or a brief network blip
+ * never produces a message, short enough to be useful while the operator is
+ * still looking at the page they just submitted from.
+ *
+ * It is NOT the whole guard against false positives: a scan queued behind
+ * another scan on the same probe is legitimately Pending for as long as that
+ * sweep takes (the claim endpoint hands out one at a time), so the caller
+ * excludes probes that currently have a scan In Progress. This threshold only
+ * decides how long an IDLE probe gets before its silence is worth reporting.
+ */
+export const UNCLAIMED_PENDING_MINUTES = 15;
+/*
+ * The two cases below are genuinely different problems with different fixes,
+ * and telling them apart is the entire point of this message: a probe that is
+ * not connected is an infrastructure problem the operator can see and fix,
+ * whereas a probe that IS connected and still is not claiming scans means the
+ * probe is running but its discovery job is not — an old image, a wedged
+ * sweep, or a probe that cannot reach the probe-ingest route specifically.
+ */
+export function buildUnclaimedScanDiagnosis(probeState) {
+    const probeLabel = probeState.probeName
+        ? `Probe "${truncateProbeName(probeState.probeName)}"`
+        : "The assigned probe";
+    if (!probeState.isProbeConnected) {
+        const lastSeen = probeState.lastAliveAt
+            ? `It was last seen ${OneUptimeDate.fromNow(probeState.lastAliveAt)}.`
+            : "It has never connected.";
+        return (`Not started yet: ${probeLabel} is not connected to OneUptime, so it has not picked this scan up. ` +
+            `${lastSeen} The scan will run on its own as soon as the probe reconnects.`);
+    }
+    return (`Not started yet: ${probeLabel} is connected but has not picked this scan up for over ` +
+        `${UNCLAIMED_PENDING_MINUTES} minutes. Check that the probe is running a version that supports ` +
+        `network discovery, and that it can reach the probe-ingest endpoint. The scan will run on its own ` +
+        `once the probe starts claiming scans again.`);
+}
+/*
+ * statusMessage is a varchar(500) and this job writes through the full
+ * update pipeline, which does NOT clamp — an over-long value would throw and
+ * the diagnosis would be lost rather than truncated. The only unbounded part
+ * of the sentence is the probe's name (itself a ShortText column, so at most
+ * 100 characters), and it is cut here so the arithmetic holds for every
+ * possible name. See the test that asserts the worst case still fits.
+ */
+const MAX_PROBE_NAME_LENGTH = 60;
+function truncateProbeName(name) {
+    if (name.length <= MAX_PROBE_NAME_LENGTH) {
+        return name;
+    }
+    return name.substring(0, MAX_PROBE_NAME_LENGTH) + "…";
+}
+/*
+ * Exported so the job and its tests agree on the ceiling they are checking
+ * against, rather than both hard-coding 500.
+ */
+export const MAX_SCAN_STATUS_MESSAGE_LENGTH = ColumnLength.LongText;
+//# sourceMappingURL=UnclaimedScanDiagnosis.js.map

package/build/dist/Utils/NetworkDiscovery/UnclaimedScanDiagnosis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"UnclaimedScanDiagnosis.js","sourceRoot":"","sources":["../../../../Utils/NetworkDiscovery/UnclaimedScanDiagnosis.ts"],"names":[],"mappings":"AAAA,OAAO,aAAa,MAAM,kBAAkB,CAAC;AAC7C,OAAO,YAAY,MAAM,mCAAmC,CAAC;AAE7D;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAW,EAAE,CAAC;AAepD;;;;;;;GAOG;AACH,MAAM,UAAU,2BAA2B,CACzC,UAAmC;IAEnC,MAAM,UAAU,GAAW,UAAU,CAAC,SAAS;QAC7C,CAAC,CAAC,UAAU,iBAAiB,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG;QACtD,CAAC,CAAC,oBAAoB,CAAC;IAEzB,IAAI,CAAC,UAAU,CAAC,gBAAgB,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAW,UAAU,CAAC,WAAW;YAC7C,CAAC,CAAC,oBAAoB,aAAa,CAAC,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG;YACtE,CAAC,CAAC,yBAAyB,CAAC;QAE9B,OAAO,CACL,oBAAoB,UAAU,qEAAqE;YACnG,GAAG,QAAQ,gEAAgE,CAC5E,CAAC;IACJ,CAAC;IAED,OAAO,CACL,oBAAoB,UAAU,yDAAyD;QACvF,GAAG,yBAAyB,oEAAoE;QAChG,mGAAmG;QACnG,6CAA6C,CAC9C,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,qBAAqB,GAAW,EAAE,CAAC;AAEzC,SAAS,iBAAiB,CAAC,IAAY;IACrC,IAAI,IAAI,CAAC,MAAM,IAAI,qBAAqB,EAAE,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,qBAAqB,CAAC,GAAG,GAAG,CAAC;AACxD,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,8BAA8B,GAAW,YAAY,CAAC,QAAQ,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@oneuptime/common",
-  "version": "12.0.14",
+  "version": "12.0.15",
   "description": "",
   "repository": {
     "type": "git",