agentsmesh 0.37.0 → 0.38.0

package/dist/engine.js

@@ -33966,6 +33966,28 @@ function collectFanout(graph, findings) {
 function normalizeRule(rule) {
   return rule.trim().replace(/\s+/g, " ").toLowerCase();
 }
+var TIED_TRIGGER_SET_THRESHOLD = 5;
+function collectTriggerSetCollisions(graph, findings) {
+  const bySet = /* @__PURE__ */ new Map();
+  for (const [id, lesson] of Object.entries(graph.lessons)) {
+    if (lesson.status !== "active") continue;
+    const key = [...lesson.triggers].sort().join(",");
+    if (key === "") continue;
+    const group = bySet.get(key);
+    if (group === void 0) bySet.set(key, [id]);
+    else group.push(id);
+  }
+  const contested = [...bySet.values()].filter((ids) => ids.length > TIED_TRIGGER_SET_THRESHOLD);
+  if (contested.length === 0) return;
+  const largest = contested.reduce((a, b) => b.length > a.length ? b : a);
+  const affected = contested.reduce((n, ids) => n + ids.length, 0);
+  findings.push({
+    level: "warning",
+    code: "TIED_TRIGGER_SETS",
+    message: `${contested.length} trigger set(s) are each shared by more than ${TIED_TRIGGER_SET_THRESHOLD} active lessons (largest ${largest.length}, ${affected} lessons in total). Identical triggers score identically on specificity, so recall picks among them by weaker signals \u2014 split the triggers so the lesson that matters for a given file can win.`,
+    lessonIds: largest.sort()
+  });
+}
 
 // src/lessons/ranking-text.ts
 var STOP = /* @__PURE__ */ new Set([
@@ -34200,6 +34222,7 @@ function validateLessonsGraph(graph, options = {}) {
   collectDuplicateTriggers(graph, findings);
   collectOrphans(graph, findings);
   collectFanout(graph, findings);
+  collectTriggerSetCollisions(graph, findings);
   collectLowSignalKeywords(graph, findings);
   collectStopwordKeywords(graph, findings);
   collectRunnerAnchoredPatterns(graph, findings);