@graphrefly/graphrefly 0.20.0 → 0.21.0

package/dist/index.cjs

@@ -1354,7 +1354,7 @@ var NodeImpl = class extends NodeBase {
         try {
           const consumed = this._onMessage(msg, index, this._actions);
           if (consumed) {
-            if (t === START) {
+            if (t === START || t === DATA || t === RESOLVED) {
               this._depDirtyMask.clear(index);
               if (this._depDirtyMask.any() && this._depSettledMask.covers(this._depDirtyMask)) {
                 this._depDirtyMask.reset();
@@ -10700,9 +10700,11 @@ function scan(source, reducer, seed, opts) {
 function reduce(source, reducer, seed, opts) {
   let acc = seed;
   let sawData = false;
+  let depHasData = false;
   return node(
     [source],
     ([v]) => {
+      if (!depHasData) return void 0;
       sawData = true;
       acc = reducer(acc, v);
       return void 0;
@@ -10713,8 +10715,10 @@ function reduce(source, reducer, seed, opts) {
       onResubscribe: opts?.resubscribable === true ? () => {
         acc = seed;
         sawData = false;
+        depHasData = false;
       } : void 0,
       onMessage(msg, _i, a) {
+        if (msg[0] === DATA) depHasData = true;
         if (msg[0] === COMPLETE) {
           if (!sawData) acc = seed;
           a.emit(acc);
@@ -10833,9 +10837,11 @@ function skip(source, count, opts) {
 }
 function takeWhile(source, predicate, opts) {
   let done = false;
+  let depHasData = false;
   return node(
     [source],
     ([v], a) => {
+      if (!depHasData) return void 0;
       if (done) return void 0;
       if (!predicate(v)) {
         done = true;
@@ -10848,6 +10854,7 @@ function takeWhile(source, predicate, opts) {
       ...operatorOpts3(opts),
       completeWhenDepsComplete: false,
       onMessage(msg, _i, a) {
+        if (msg[0] === DATA) depHasData = true;
         if (done) {
           if (msg[0] === COMPLETE) {
             a.down([[COMPLETE]]);
@@ -10900,9 +10907,11 @@ function last(source, options) {
   const useDefault = options != null && Object.hasOwn(options, "defaultValue");
   let lastVal;
   let has = false;
+  let depHasData = false;
   return node(
     [source],
     ([v]) => {
+      if (!depHasData) return void 0;
       lastVal = v;
       has = true;
       return void 0;
@@ -10911,6 +10920,7 @@ function last(source, options) {
       ...operatorOpts3(rest),
       completeWhenDepsComplete: false,
       onMessage(msg, _i, a) {
+        if (msg[0] === DATA) depHasData = true;
         if (msg[0] === COMPLETE) {
           if (has) {
             a.emit(lastVal);
@@ -11297,120 +11307,101 @@ function forwardInner(inner, a, onInnerComplete) {
 function switchMap(source, project, opts) {
   let innerUnsub;
   let sourceDone = false;
-  let attached = false;
   function clearInner() {
     innerUnsub?.();
     innerUnsub = void 0;
   }
   function attach(v, a) {
-    attached = true;
     clearInner();
     innerUnsub = forwardInner(fromAny(project(v)), a, () => {
       clearInner();
       if (sourceDone) a.down([[COMPLETE]]);
     });
   }
-  return node(
-    [source],
-    ([v], a) => {
-      if (!attached) attach(v, a);
-      return clearInner;
-    },
-    {
-      ...operatorOpts3(opts),
-      completeWhenDepsComplete: false,
-      onMessage(msg, _i, a) {
-        const t = msg[0];
-        if (t === ERROR) {
-          clearInner();
-          a.down([msg]);
-          return true;
-        }
-        if (t === COMPLETE) {
-          sourceDone = true;
-          if (innerUnsub === void 0) a.down([[COMPLETE]]);
-          return true;
-        }
-        if (t === DIRTY) {
-          a.down([[DIRTY]]);
-          return true;
-        }
-        if (t === RESOLVED) {
-          a.down([[RESOLVED]]);
-          return true;
-        }
-        if (t === DATA) {
-          attach(msg[1], a);
-          return true;
-        }
-        return false;
+  return node([source], () => clearInner, {
+    ...operatorOpts3(opts),
+    completeWhenDepsComplete: false,
+    onMessage(msg, _i, a) {
+      const t = msg[0];
+      if (t === ERROR) {
+        clearInner();
+        a.down([msg]);
+        return true;
+      }
+      if (t === COMPLETE) {
+        sourceDone = true;
+        if (innerUnsub === void 0) a.down([[COMPLETE]]);
+        return true;
       }
+      if (t === DIRTY) {
+        a.down([[DIRTY]]);
+        return true;
+      }
+      if (t === RESOLVED) {
+        a.down([[RESOLVED]]);
+        return true;
+      }
+      if (t === DATA) {
+        attach(msg[1], a);
+        return true;
+      }
+      return false;
     }
-  );
+  });
 }
 function exhaustMap(source, project, opts) {
   let innerUnsub;
   let sourceDone = false;
-  let attached = false;
   function clearInner() {
     innerUnsub?.();
     innerUnsub = void 0;
   }
   function attach(v, a) {
-    attached = true;
     innerUnsub = forwardInner(fromAny(project(v)), a, () => {
       clearInner();
       if (sourceDone) a.down([[COMPLETE]]);
     });
   }
-  return node(
-    [source],
-    ([v], a) => {
-      if (!attached && innerUnsub === void 0) attach(v, a);
-      return clearInner;
-    },
-    {
-      ...operatorOpts3(opts),
-      completeWhenDepsComplete: false,
-      onMessage(msg, _i, a) {
-        const t = msg[0];
-        if (t === ERROR) {
-          clearInner();
-          a.down([msg]);
-          return true;
-        }
-        if (t === COMPLETE) {
-          sourceDone = true;
-          if (innerUnsub === void 0) a.down([[COMPLETE]]);
-          return true;
-        }
-        if (t === DIRTY) {
-          a.down([[DIRTY]]);
-          return true;
-        }
-        if (t === RESOLVED) {
+  return node([source], () => clearInner, {
+    ...operatorOpts3(opts),
+    completeWhenDepsComplete: false,
+    onMessage(msg, _i, a) {
+      const t = msg[0];
+      if (t === ERROR) {
+        clearInner();
+        a.down([msg]);
+        return true;
+      }
+      if (t === COMPLETE) {
+        sourceDone = true;
+        if (innerUnsub === void 0) a.down([[COMPLETE]]);
+        return true;
+      }
+      if (t === DIRTY) {
+        a.down([[DIRTY]]);
+        return true;
+      }
+      if (t === RESOLVED) {
+        a.down([[RESOLVED]]);
+        return true;
+      }
+      if (t === DATA) {
+        if (innerUnsub !== void 0) {
           a.down([[RESOLVED]]);
           return true;
         }
-        if (t === DATA) {
-          if (innerUnsub !== void 0) {
-            a.down([[RESOLVED]]);
-            return true;
-          }
-          attach(msg[1], a);
-          return true;
-        }
-        return false;
+        attach(msg[1], a);
+        return true;
       }
+      return false;
     }
-  );
+  });
 }
 function concatMap(source, project, opts) {
   const { maxBuffer: maxBuf, ...concatNodeOpts } = opts ?? {};
   const queue = [];
   let innerUnsub;
   let sourceDone = false;
-  let attached = false;
   function clearInner() {
     innerUnsub?.();
     innerUnsub = void 0;
@@ -11428,49 +11419,41 @@ function concatMap(source, project, opts) {
     });
   }
   function enqueue(v, a) {
-    attached = true;
     if (maxBuf && maxBuf > 0 && queue.length >= maxBuf) queue.shift();
     queue.push(v);
     tryPump(a);
   }
-  return node(
-    [source],
-    ([v], a) => {
-      if (!attached) enqueue(v, a);
-      return clearInner;
-    },
-    {
-      ...operatorOpts3(concatNodeOpts),
-      completeWhenDepsComplete: false,
-      onMessage(msg, _i, a) {
-        const t = msg[0];
-        if (t === ERROR) {
-          clearInner();
-          queue.length = 0;
-          a.down([msg]);
-          return true;
-        }
-        if (t === COMPLETE) {
-          sourceDone = true;
-          tryPump(a);
-          return true;
-        }
-        if (t === DIRTY) {
-          a.down([[DIRTY]]);
-          return true;
-        }
-        if (t === RESOLVED) {
-          a.down([[RESOLVED]]);
-          return true;
-        }
-        if (t === DATA) {
-          enqueue(msg[1], a);
-          return true;
-        }
-        return false;
+  return node([source], () => clearInner, {
+    ...operatorOpts3(concatNodeOpts),
+    completeWhenDepsComplete: false,
+    onMessage(msg, _i, a) {
+      const t = msg[0];
+      if (t === ERROR) {
+        clearInner();
+        queue.length = 0;
+        a.down([msg]);
+        return true;
+      }
+      if (t === COMPLETE) {
+        sourceDone = true;
+        tryPump(a);
+        return true;
+      }
+      if (t === DIRTY) {
+        a.down([[DIRTY]]);
+        return true;
+      }
+      if (t === RESOLVED) {
+        a.down([[RESOLVED]]);
+        return true;
+      }
+      if (t === DATA) {
+        enqueue(msg[1], a);
+        return true;
       }
+      return false;
     }
-  );
+  });
 }
 function mergeMap(source, project, opts) {
   const { concurrent: concurrentOpt, ...mergeNodeOpts } = opts ?? {};
@@ -11526,47 +11509,36 @@ function mergeMap(source, project, opts) {
     active = 0;
     buffer2.length = 0;
   }
-  let attached = false;
-  return node(
-    [source],
-    ([v], a) => {
-      if (!attached) {
-        attached = true;
-        enqueue(v, a);
+  return node([source], () => clearAll, {
+    ...operatorOpts3(mergeNodeOpts),
+    completeWhenDepsComplete: false,
+    onMessage(msg, _i, a) {
+      const t = msg[0];
+      if (t === ERROR) {
+        clearAll();
+        a.down([msg]);
+        return true;
       }
-      return clearAll;
-    },
-    {
-      ...operatorOpts3(mergeNodeOpts),
-      completeWhenDepsComplete: false,
-      onMessage(msg, _i, a) {
-        const t = msg[0];
-        if (t === ERROR) {
-          clearAll();
-          a.down([msg]);
-          return true;
-        }
-        if (t === COMPLETE) {
-          sourceDone = true;
-          tryComplete(a);
-          return true;
-        }
-        if (t === DIRTY) {
-          a.down([[DIRTY]]);
-          return true;
-        }
-        if (t === RESOLVED) {
-          a.down([[RESOLVED]]);
-          return true;
-        }
-        if (t === DATA) {
-          enqueue(msg[1], a);
-          return true;
-        }
-        return false;
+      if (t === COMPLETE) {
+        sourceDone = true;
+        tryComplete(a);
+        return true;
+      }
+      if (t === DIRTY) {
+        a.down([[DIRTY]]);
+        return true;
+      }
+      if (t === RESOLVED) {
+        a.down([[RESOLVED]]);
+        return true;
+      }
+      if (t === DATA) {
+        enqueue(msg[1], a);
+        return true;
       }
+      return false;
     }
-  );
+  });
 }
 var flatMap = mergeMap;
 function delay(source, ms, opts) {
@@ -11885,53 +11857,39 @@ function buffer(source, notifier, opts) {
 function bufferCount(source, count, opts) {
   if (count <= 0) throw new RangeError("bufferCount expects count > 0");
   const buf = [];
-  let started = false;
-  return node(
-    [source],
-    ([v], a) => {
-      if (!started) {
-        started = true;
-        buf.push(v);
+  return node([source], () => void 0, {
+    ...operatorOpts3(opts),
+    completeWhenDepsComplete: false,
+    onMessage(msg, _i, a) {
+      const t = msg[0];
+      if (t === ERROR) {
+        a.down([msg]);
+        return true;
+      }
+      if (t === COMPLETE) {
+        if (buf.length > 0) a.emit([...buf]);
+        buf.length = 0;
+        a.down([[COMPLETE]]);
+        return true;
+      }
+      if (t === DIRTY) {
+        a.down([[DIRTY]]);
+        return true;
+      }
+      if (t === RESOLVED) {
+        a.down([[RESOLVED]]);
+        return true;
+      }
+      if (t === DATA) {
+        buf.push(msg[1]);
         if (buf.length >= count) {
           a.emit(buf.splice(0, buf.length));
         }
+        return true;
       }
-      return void 0;
-    },
-    {
-      ...operatorOpts3(opts),
-      completeWhenDepsComplete: false,
-      onMessage(msg, _i, a) {
-        const t = msg[0];
-        if (t === ERROR) {
-          a.down([msg]);
-          return true;
-        }
-        if (t === COMPLETE) {
-          if (buf.length > 0) a.emit([...buf]);
-          buf.length = 0;
-          a.down([[COMPLETE]]);
-          return true;
-        }
-        if (t === DIRTY) {
-          a.down([[DIRTY]]);
-          return true;
-        }
-        if (t === RESOLVED) {
-          a.down([[RESOLVED]]);
-          return true;
-        }
-        if (t === DATA) {
-          buf.push(msg[1]);
-          if (buf.length >= count) {
-            a.emit(buf.splice(0, buf.length));
-          }
-          return true;
-        }
-        return false;
-      }
+      return false;
     }
-  );
+  });
 }
 function windowCount(source, count, opts) {
   if (count <= 0) throw new RangeError("windowCount expects count > 0");
@@ -13190,6 +13148,7 @@ __export(ai_exports, {
   agentLoop: () => agentLoop,
   agentMemory: () => agentMemory,
   chatStream: () => chatStream,
+  contentGate: () => contentGate,
   costMeterExtractor: () => costMeterExtractor,
   fromLLM: () => fromLLM,
   gatedStream: () => gatedStream,
@@ -13200,6 +13159,7 @@ __export(ai_exports, {
   llmConsolidator: () => llmConsolidator,
   llmExtractor: () => llmExtractor,
   promptNode: () => promptNode,
+  redactor: () => redactor,
   streamExtractor: () => streamExtractor,
   streamingPromptNode: () => streamingPromptNode,
   suggestStrategy: () => suggestStrategy,
@@ -14696,6 +14656,53 @@ function costMeterExtractor(streamTopic, opts) {
     }
   );
 }
+function redactor(streamTopic, patterns, replaceFn, opts) {
+  const replace = replaceFn ?? (() => "[REDACTED]");
+  function sanitize(text) {
+    let result = text;
+    for (const pat of patterns) {
+      const global = pat.global ? pat : new RegExp(pat.source, `${pat.flags}g`);
+      result = result.replace(global, (m) => replace(m, pat));
+    }
+    return result;
+  }
+  return derived(
+    [streamTopic.latest],
+    ([chunk]) => {
+      if (chunk == null) {
+        return { source: "", token: "", accumulated: "", index: -1 };
+      }
+      const c = chunk;
+      const sanitizedAccumulated = sanitize(c.accumulated);
+      const sanitizedToken = sanitize(c.token);
+      return {
+        source: c.source,
+        token: sanitizedToken,
+        accumulated: sanitizedAccumulated,
+        index: c.index
+      };
+    },
+    { name: opts?.name ?? "redactor" }
+  );
+}
+function contentGate(streamTopic, classifier, threshold, opts) {
+  const hardThreshold = threshold * (opts?.hardMultiplier ?? 1.5);
+  const isNodeClassifier = typeof classifier !== "function";
+  const deps = [streamTopic.latest];
+  if (isNodeClassifier) deps.push(classifier);
+  return derived(
+    deps,
+    (values) => {
+      const chunk = values[0];
+      if (chunk == null) return "allow";
+      const score = isNodeClassifier ? values[1] ?? 0 : classifier(chunk.accumulated);
+      if (score >= hardThreshold) return "block";
+      if (score >= threshold) return "review";
+      return "allow";
+    },
+    { name: opts?.name ?? "content-gate", initial: "allow" }
+  );
+}
 function gatedStream(graph, name, adapter, deps, prompt, opts) {
   const cancelSignal = state(0, { name: `${name}/cancel` });
   let cancelCounter = 0;
@@ -18691,12 +18698,17 @@ __export(harness_exports, {
   DEFAULT_SEVERITY_WEIGHTS: () => DEFAULT_SEVERITY_WEIGHTS,
   HarnessGraph: () => HarnessGraph,
   QUEUE_NAMES: () => QUEUE_NAMES,
+  affectedTaskFilter: () => affectedTaskFilter,
+  beforeAfterCompare: () => beforeAfterCompare,
+  codeChangeBridge: () => codeChangeBridge,
   createIntakeBridge: () => createIntakeBridge,
   defaultErrorClassifier: () => defaultErrorClassifier,
   evalIntakeBridge: () => evalIntakeBridge,
+  evalSource: () => evalSource,
   harnessLoop: () => harnessLoop,
   harnessProfile: () => harnessProfile,
   harnessTrace: () => harnessTrace,
+  notifyEffect: () => notifyEffect,
   priorityScore: () => priorityScore,
   strategyKey: () => strategyKey,
   strategyModel: () => strategyModel
@@ -18716,10 +18728,10 @@ function createIntakeBridge(source, intakeTopic, parser, opts) {
     { name: opts?.name ?? "intake-bridge" }
   );
 }
-function evalIntakeBridge(evalSource, intakeTopic, opts) {
+function evalIntakeBridge(evalSource2, intakeTopic, opts) {
   const defaultSeverity = opts?.defaultSeverity ?? "medium";
   return effect(
-    [evalSource],
+    [evalSource2],
     ([results]) => {
       if (results == null) return;
       const runs = Array.isArray(results) ? results : [results];
@@ -18756,6 +18768,110 @@ function evalIntakeBridge(evalSource, intakeTopic, opts) {
     { name: opts?.name ?? "eval-intake-bridge" }
   );
 }
+function evalSource(trigger2, runner) {
+  return switchMap(trigger2, () => fromAny(runner()));
+}
+function beforeAfterCompare(before, after) {
+  return derived(
+    [before, after],
+    ([b, a]) => {
+      const bRes = b;
+      const aRes = a;
+      const beforeMap = new Map(bRes.tasks.map((t) => [t.task_id, t]));
+      const afterMap = new Map(aRes.tasks.map((t) => [t.task_id, t]));
+      const allIds = /* @__PURE__ */ new Set([...beforeMap.keys(), ...afterMap.keys()]);
+      const taskDeltas = [];
+      const newFailures = [];
+      const resolved = [];
+      for (const id of allIds) {
+        const bt = beforeMap.get(id);
+        const at = afterMap.get(id);
+        const beforeValid = bt?.valid ?? false;
+        const afterValid = at?.valid ?? false;
+        const beforeScore = bt?.judge_scores ? bt.judge_scores.filter((s) => s.pass).length : void 0;
+        const afterScore = at?.judge_scores ? at.judge_scores.filter((s) => s.pass).length : void 0;
+        const scoreDiff = beforeScore !== void 0 && afterScore !== void 0 ? afterScore - beforeScore : void 0;
+        taskDeltas.push({ taskId: id, before: beforeValid, after: afterValid, scoreDiff });
+        if (beforeValid && !afterValid) newFailures.push(id);
+        if (!beforeValid && afterValid) resolved.push(id);
+      }
+      return {
+        newFailures,
+        resolved,
+        taskDeltas,
+        overallImproved: resolved.length > newFailures.length
+      };
+    },
+    { name: "eval-delta" }
+  );
+}
+function affectedTaskFilter(issues, fullTaskSet) {
+  const taskSetNode = fullTaskSet == null ? null : Array.isArray(fullTaskSet) ? state(fullTaskSet) : fullTaskSet;
+  const deps = [issues];
+  if (taskSetNode) deps.push(taskSetNode);
+  return derived(
+    deps,
+    (values) => {
+      const items = values[0];
+      const all = taskSetNode ? new Set(values[1]) : null;
+      const affected = /* @__PURE__ */ new Set();
+      for (const item of items) {
+        for (const id of item.affectsEvalTasks ?? []) {
+          if (all == null || all.has(id)) affected.add(id);
+        }
+      }
+      return [...affected].sort();
+    },
+    { name: "affected-task-filter" }
+  );
+}
+function codeChangeBridge(source, intakeTopic, parser, opts) {
+  const defaultSeverity = opts?.defaultSeverity ?? "high";
+  function defaultParser(change) {
+    const items = [];
+    for (const err of change.lintErrors ?? []) {
+      items.push({
+        source: "code-change",
+        summary: `Lint: ${err.rule} in ${err.file}:${err.line}`,
+        evidence: err.message,
+        affectsAreas: [err.file],
+        severity: defaultSeverity
+      });
+    }
+    for (const fail of change.testFailures ?? []) {
+      items.push({
+        source: "test",
+        summary: `Test failure: ${fail.testId}`,
+        evidence: fail.message,
+        affectsAreas: [fail.file],
+        affectsEvalTasks: [fail.testId],
+        severity: defaultSeverity
+      });
+    }
+    return items;
+  }
+  const resolve = parser ?? defaultParser;
+  return effect(
+    [source],
+    ([change]) => {
+      if (change == null) return;
+      for (const item of resolve(change)) {
+        intakeTopic.publish(item);
+      }
+    },
+    { name: opts?.name ?? "code-change-bridge" }
+  );
+}
+function notifyEffect(topic2, transport, opts) {
+  return effect(
+    [topic2.latest],
+    ([item]) => {
+      if (item == null) return;
+      void transport(item);
+    },
+    { name: opts?.name ?? "notify-effect" }
+  );
+}
 
 // src/patterns/harness/types.ts
 var QUEUE_NAMES = [