@graphrefly/graphrefly 0.25.0 → 0.27.0

package/dist/chunk-N6UR7YVY.js

@@ -0,0 +1,198 @@
+import {
+  batch,
+  dynamicNode,
+  state
+} from "./chunk-PHOUUNK7.js";
+import {
+  DATA,
+  ERROR,
+  __export
+} from "./chunk-SX52TAR4.js";
+
+// src/compat/nanostores/index.ts
+var nanostores_exports = {};
+__export(nanostores_exports, {
+  action: () => action,
+  atom: () => atom,
+  computed: () => computed,
+  getValue: () => getValue,
+  map: () => map,
+  onMount: () => onMount,
+  onStart: () => onStart,
+  onStop: () => onStop
+});
+var START_LISTENERS = /* @__PURE__ */ new WeakMap();
+var STOP_LISTENERS = /* @__PURE__ */ new WeakMap();
+function trigger(node, map2) {
+  const callbacks = map2.get(node);
+  if (callbacks) {
+    for (const cb of callbacks) cb();
+  }
+}
+function createStore(node, extra = {}) {
+  let listeners = 0;
+  const store = {
+    ...extra,
+    get: () => getVal(node),
+    subscribe: (cb) => {
+      if (listeners === 0) trigger(node, START_LISTENERS);
+      listeners++;
+      const sub = node.subscribe((msgs) => {
+        for (const [t, v] of msgs) {
+          if (t === DATA) cb(v);
+        }
+      });
+      return () => {
+        sub();
+        listeners--;
+        if (listeners === 0) trigger(node, STOP_LISTENERS);
+      };
+    },
+    listen: (cb) => {
+      if (listeners === 0) trigger(node, START_LISTENERS);
+      listeners++;
+      let initial = true;
+      const sub = node.subscribe((msgs) => {
+        for (const [t, v] of msgs) {
+          if (t === DATA) {
+            if (initial) {
+              initial = false;
+              continue;
+            }
+            cb(v);
+          }
+        }
+      });
+      return () => {
+        sub();
+        listeners--;
+        if (listeners === 0) trigger(node, STOP_LISTENERS);
+      };
+    },
+    _node: node
+  };
+  return store;
+}
+function pull(n) {
+  let val = n.cache;
+  let err;
+  const unsub = n.subscribe((msgs) => {
+    for (const [t, v] of msgs) {
+      if (t === DATA) val = v;
+      if (t === ERROR) err = v;
+    }
+  });
+  unsub();
+  if (err) throw err;
+  return val;
+}
+function getVal(n) {
+  if (n.status === "sentinel") {
+    return pull(n);
+  }
+  return n.cache;
+}
+function atom(initial) {
+  const n = state(initial, {
+    resubscribable: true,
+    resetOnTeardown: true
+  });
+  return createStore(n, {
+    // `n.emit` routes through the framed pipeline: `bundle()` auto-
+    // prefixes `[DIRTY]` (diamond-safe wave coordination) and the
+    // node's `equals` (default `Object.is`) folds same-value writes
+    // into `RESOLVED`. Matches nanostores' documented Object.is
+    // dedup semantics without any custom check.
+    set: (value) => n.emit(value)
+  });
+}
+function computed(stores, fn) {
+  const storeArray = Array.isArray(stores) ? stores : [stores];
+  const depNodes = storeArray.map((s) => s._node);
+  const n = dynamicNode(
+    depNodes,
+    (track) => {
+      const vals = storeArray.map((s) => {
+        const node = s._node;
+        if (node.status === "sentinel") {
+          pull(node);
+        }
+        return track(node);
+      });
+      return fn(...vals);
+    },
+    {
+      resubscribable: true,
+      resetOnTeardown: true,
+      equals: Object.is
+    }
+  );
+  return createStore(n);
+}
+function map(initial) {
+  const n = state(initial, {
+    resubscribable: true,
+    resetOnTeardown: true,
+    equals: () => false
+  });
+  return createStore(n, {
+    // `map`'s state node is configured with `equals: () => false`
+    // above, so every `emit` produces DATA (even for same-key same-
+    // value sets). The `emit` path is still required for diamond
+    // coordination (`[DIRTY]` auto-prefix via `bundle()`).
+    set: (value) => n.emit(value),
+    setKey: (key, value) => {
+      const current = getVal(n);
+      n.emit({ ...current, [key]: value });
+    }
+  });
+}
+function getValue(store) {
+  return store.get();
+}
+function onStart(store, cb) {
+  const node = store._node;
+  let callbacks = START_LISTENERS.get(node);
+  if (!callbacks) {
+    callbacks = /* @__PURE__ */ new Set();
+    START_LISTENERS.set(node, callbacks);
+  }
+  callbacks.add(cb);
+}
+function onStop(store, cb) {
+  const node = store._node;
+  let callbacks = STOP_LISTENERS.get(node);
+  if (!callbacks) {
+    callbacks = /* @__PURE__ */ new Set();
+    STOP_LISTENERS.set(node, callbacks);
+  }
+  callbacks.add(cb);
+}
+function onMount(store, cb) {
+  onStart(store, () => {
+    const stop = cb();
+    if (typeof stop === "function") onStop(store, stop);
+  });
+}
+function action(_store, _name, fn) {
+  return (...args) => {
+    let result;
+    batch(() => {
+      result = fn(...args);
+    });
+    return result;
+  };
+}
+
+export {
+  atom,
+  computed,
+  map,
+  getValue,
+  onStart,
+  onStop,
+  onMount,
+  action,
+  nanostores_exports
+};
+//# sourceMappingURL=chunk-N6UR7YVY.js.map

package/dist/chunk-N6UR7YVY.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/compat/nanostores/index.ts"],"sourcesContent":["import { batch } from \"../../core/batch.js\";\nimport { DATA, ERROR, type Messages } from \"../../core/messages.js\";\nimport type { Node } from \"../../core/node.js\";\nimport { dynamicNode, state, type TrackFn } from \"../../core/sugar.js\";\n\n/**\n * A Nanostores-compatible atom.\n *\n * @category compat\n */\nexport interface NanoAtom<T> {\n\t/** Get current value. */\n\tget(): T;\n\t/** Set a new value (writable atoms only). */\n\tset(value: T): void;\n\t/** Subscribe to value changes. Callback receives the new value.\n\t * Returns unsubscribe function. Called immediately with current value. */\n\tsubscribe(cb: (value: T) => void): () => void;\n\t/** Listen to value changes (no immediate call). Returns unsubscribe. */\n\tlisten(cb: (value: T) => void): () => void;\n\t/** The underlying GraphReFly node. */\n\treadonly _node: Node<T>;\n}\n\n/**\n * A Nanostores-compatible computed store.\n *\n * @category compat\n */\nexport interface NanoComputed<T> {\n\t/** Get current value. */\n\tget(): T;\n\t/** Subscribe to value changes. Called immediately with current value.\n\t * Returns unsubscribe function. */\n\tsubscribe(cb: (value: T) => void): () => void;\n\t/** Listen to value changes (no immediate call). Returns unsubscribe. */\n\tlisten(cb: (value: T) => void): () => void;\n\t/** The underlying GraphReFly node. */\n\treadonly _node: Node<T>;\n}\n\n/**\n * A Nanostores-compatible map.\n *\n * @category compat\n */\nexport interface NanoMap<T extends Record<string, unknown>> extends NanoAtom<T> {\n\t/** Set a single key. */\n\tsetKey<K extends keyof T>(key: K, value: T[K]): void;\n}\n\nconst START_LISTENERS = new WeakMap<Node<any>, Set<() => void>>();\nconst STOP_LISTENERS = new WeakMap<Node<any>, Set<() => void>>();\n\nfunction trigger(node: Node<any>, map: WeakMap<Node<any>, Set<() => void>>) {\n\tconst callbacks = map.get(node);\n\tif (callbacks) {\n\t\tfor (const cb of callbacks) cb();\n\t}\n}\n\nfunction createStore<T>(node: Node<T>, extra: any = {}): any {\n\tlet listeners = 0;\n\tconst store = {\n\t\t...extra,\n\t\tget: () => getVal(node),\n\t\tsubscribe: (cb: (value: T) => void) => {\n\t\t\tif (listeners === 0) trigger(node, START_LISTENERS);\n\t\t\tlisteners++;\n\t\t\t// Push-on-subscribe delivers the initial value via DATA — no explicit cb() needed.\n\t\t\tconst sub = node.subscribe((msgs: Messages) => {\n\t\t\t\tfor (const [t, v] of msgs) {\n\t\t\t\t\tif (t === DATA) cb(v as T);\n\t\t\t\t}\n\t\t\t});\n\t\t\treturn () => {\n\t\t\t\tsub();\n\t\t\t\tlisteners--;\n\t\t\t\tif (listeners === 0) trigger(node, STOP_LISTENERS);\n\t\t\t};\n\t\t},\n\t\tlisten: (cb: (value: T) => void) => {\n\t\t\tif (listeners === 0) trigger(node, START_LISTENERS);\n\t\t\tlisteners++;\n\t\t\t// Skip the initial push-on-subscribe DATA — listen() fires on changes only.\n\t\t\tlet initial = true;\n\t\t\tconst sub = node.subscribe((msgs: Messages) => {\n\t\t\t\tfor (const [t, v] of msgs) {\n\t\t\t\t\tif (t === DATA) {\n\t\t\t\t\t\tif (initial) {\n\t\t\t\t\t\t\tinitial = false;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcb(v as T);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\t\treturn () => {\n\t\t\t\tsub();\n\t\t\t\tlisteners--;\n\t\t\t\tif (listeners === 0) trigger(node, STOP_LISTENERS);\n\t\t\t};\n\t\t},\n\t\t_node: node,\n\t};\n\treturn store;\n}\n\nfunction pull<T>(n: Node<T>): T {\n\tlet val: T | undefined | null = n.cache;\n\tlet err: any;\n\tconst unsub = n.subscribe((msgs: Messages) => {\n\t\tfor (const [t, v] of msgs) {\n\t\t\tif (t === DATA) val = v as T;\n\t\t\tif (t === ERROR) err = v;\n\t\t}\n\t});\n\tunsub();\n\tif (err) throw err;\n\treturn val as T;\n}\n\nfunction getVal<T>(n: Node<T>): T {\n\tif (n.status === \"sentinel\") {\n\t\treturn pull(n);\n\t}\n\treturn n.cache as T;\n}\n\n/**\n * Creates a nanostores-compatible atom.\n *\n * @param initial - Initial value.\n * @returns `NanoAtom<T>`\n *\n * @category compat\n */\nexport function atom<T>(initial: T): NanoAtom<T> {\n\tconst n = state<T>(initial, {\n\t\tresubscribable: true,\n\t\tresetOnTeardown: true,\n\t});\n\n\treturn createStore(n, {\n\t\t// `n.emit` routes through the framed pipeline: `bundle()` auto-\n\t\t// prefixes `[DIRTY]` (diamond-safe wave coordination) and the\n\t\t// node's `equals` (default `Object.is`) folds same-value writes\n\t\t// into `RESOLVED`. Matches nanostores' documented Object.is\n\t\t// dedup semantics without any custom check.\n\t\tset: (value: T) => n.emit(value),\n\t});\n}\n\n/**\n * Creates a nanostores-compatible computed store.\n *\n * @param stores - One or more atoms/computed stores.\n * @param fn - Compute function.\n * @returns `NanoComputed<T>`\n *\n * @category compat\n */\nexport function computed<T, A>(\n\tstoreA: NanoAtom<A> | NanoComputed<A>,\n\tfn: (a: A) => T,\n): NanoComputed<T>;\nexport function computed<T, A, B>(\n\tstores: [NanoAtom<A> | NanoComputed<A>, NanoAtom<B> | NanoComputed<B>],\n\tfn: (a: A, b: B) => T,\n): NanoComputed<T>;\nexport function computed<T, A, B, C>(\n\tstores: [\n\t\tNanoAtom<A> | NanoComputed<A>,\n\t\tNanoAtom<B> | NanoComputed<B>,\n\t\tNanoAtom<C> | NanoComputed<C>,\n\t],\n\tfn: (a: A, b: B, c: C) => T,\n): NanoComputed<T>;\nexport function computed<T>(stores: any, fn: (...args: any[]) => T): NanoComputed<T> {\n\tconst storeArray: Array<NanoAtom<any> | NanoComputed<any>> = Array.isArray(stores)\n\t\t? stores\n\t\t: [stores];\n\n\tconst depNodes = storeArray.map((s) => s._node);\n\tconst n = dynamicNode(\n\t\tdepNodes,\n\t\t(track: TrackFn) => {\n\t\t\tconst vals = storeArray.map((s) => {\n\t\t\t\tconst node = s._node;\n\t\t\t\tif (node.status === \"sentinel\") {\n\t\t\t\t\tpull(node);\n\t\t\t\t}\n\t\t\t\treturn track(node);\n\t\t\t});\n\t\t\treturn fn(...vals);\n\t\t},\n\t\t{\n\t\t\tresubscribable: true,\n\t\t\tresetOnTeardown: true,\n\t\t\tequals: Object.is as any,\n\t\t},\n\t);\n\n\treturn createStore(n);\n}\n\n/**\n * Creates a nanostores-compatible map.\n *\n * @param initial - Initial object value.\n * @returns `NanoMap<T>`\n *\n * @category compat\n */\nexport function map<T extends Record<string, unknown>>(initial: T): NanoMap<T> {\n\tconst n = state<T>(initial, {\n\t\tresubscribable: true,\n\t\tresetOnTeardown: true,\n\t\tequals: () => false,\n\t});\n\n\treturn createStore(n, {\n\t\t// `map`'s state node is configured with `equals: () => false`\n\t\t// above, so every `emit` produces DATA (even for same-key same-\n\t\t// value sets). The `emit` path is still required for diamond\n\t\t// coordination (`[DIRTY]` auto-prefix via `bundle()`).\n\t\tset: (value: T) => n.emit(value),\n\t\tsetKey: <K extends keyof T>(key: K, value: T[K]) => {\n\t\t\tconst current = getVal(n);\n\t\t\tn.emit({ ...current, [key]: value });\n\t\t},\n\t});\n}\n\n/**\n * Returns the current value of the store.\n *\n * @category compat\n */\nexport function getValue<T>(store: NanoAtom<T> | NanoComputed<T>): T {\n\treturn store.get();\n}\n\n/**\n * Adds a listener for the store start (first listener connected).\n *\n * @category compat\n */\nexport function onStart(store: NanoAtom<any> | NanoComputed<any>, cb: () => void): void {\n\tconst node = store._node;\n\tlet callbacks = START_LISTENERS.get(node);\n\tif (!callbacks) {\n\t\tcallbacks = new Set();\n\t\tSTART_LISTENERS.set(node, callbacks);\n\t}\n\tcallbacks.add(cb);\n}\n\n/**\n * Adds a listener for the store stop (last listener disconnected).\n *\n * @category compat\n */\nexport function onStop(store: NanoAtom<any> | NanoComputed<any>, cb: () => void): void {\n\tconst node = store._node;\n\tlet callbacks = STOP_LISTENERS.get(node);\n\tif (!callbacks) {\n\t\tcallbacks = new Set();\n\t\tSTOP_LISTENERS.set(node, callbacks);\n\t}\n\tcallbacks.add(cb);\n}\n\n/**\n * Adds a listener for the store mount (first listener connected).\n *\n * @returns A cleanup function called when the last listener is removed.\n * @category compat\n */\nexport function onMount(\n\tstore: NanoAtom<any> | NanoComputed<any>,\n\tcb: () => (() => void) | undefined,\n): void {\n\tonStart(store, () => {\n\t\tconst stop = cb();\n\t\tif (typeof stop === \"function\") onStop(store, stop);\n\t});\n}\n\n/**\n * Batches multiple store updates.\n *\n * @category compat\n */\nexport function action<Args extends any[], Return>(\n\t_store: NanoAtom<any> | NanoComputed<any>,\n\t_name: string,\n\tfn: (...args: Args) => Return,\n): (...args: Args) => Return {\n\treturn (...args: Args) => {\n\t\tlet result: any;\n\t\tbatch(() => {\n\t\t\tresult = fn(...args);\n\t\t});\n\t\treturn result as Return;\n\t};\n}\n"],"mappings":";;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAmDA,IAAM,kBAAkB,oBAAI,QAAoC;AAChE,IAAM,iBAAiB,oBAAI,QAAoC;AAE/D,SAAS,QAAQ,MAAiBA,MAA0C;AAC3E,QAAM,YAAYA,KAAI,IAAI,IAAI;AAC9B,MAAI,WAAW;AACd,eAAW,MAAM,UAAW,IAAG;AAAA,EAChC;AACD;AAEA,SAAS,YAAe,MAAe,QAAa,CAAC,GAAQ;AAC5D,MAAI,YAAY;AAChB,QAAM,QAAQ;AAAA,IACb,GAAG;AAAA,IACH,KAAK,MAAM,OAAO,IAAI;AAAA,IACtB,WAAW,CAAC,OAA2B;AACtC,UAAI,cAAc,EAAG,SAAQ,MAAM,eAAe;AAClD;AAEA,YAAM,MAAM,KAAK,UAAU,CAAC,SAAmB;AAC9C,mBAAW,CAAC,GAAG,CAAC,KAAK,MAAM;AAC1B,cAAI,MAAM,KAAM,IAAG,CAAM;AAAA,QAC1B;AAAA,MACD,CAAC;AACD,aAAO,MAAM;AACZ,YAAI;AACJ;AACA,YAAI,cAAc,EAAG,SAAQ,MAAM,cAAc;AAAA,MAClD;AAAA,IACD;AAAA,IACA,QAAQ,CAAC,OAA2B;AACnC,UAAI,cAAc,EAAG,SAAQ,MAAM,eAAe;AAClD;AAEA,UAAI,UAAU;AACd,YAAM,MAAM,KAAK,UAAU,CAAC,SAAmB;AAC9C,mBAAW,CAAC,GAAG,CAAC,KAAK,MAAM;AAC1B,cAAI,MAAM,MAAM;AACf,gBAAI,SAAS;AACZ,wBAAU;AACV;AAAA,YACD;AACA,eAAG,CAAM;AAAA,UACV;AAAA,QACD;AAAA,MACD,CAAC;AACD,aAAO,MAAM;AACZ,YAAI;AACJ;AACA,YAAI,cAAc,EAAG,SAAQ,MAAM,cAAc;AAAA,MAClD;AAAA,IACD;AAAA,IACA,OAAO;AAAA,EACR;AACA,SAAO;AACR;AAEA,SAAS,KAAQ,GAAe;AAC/B,MAAI,MAA4B,EAAE;AAClC,MAAI;AACJ,QAAM,QAAQ,EAAE,UAAU,CAAC,SAAmB;AAC7C,eAAW,CAAC,GAAG,CAAC,KAAK,MAAM;AAC1B,UAAI,MAAM,KAAM,OAAM;AACtB,UAAI,MAAM,MAAO,OAAM;AAAA,IACxB;AAAA,EACD,CAAC;AACD,QAAM;AACN,MAAI,IAAK,OAAM;AACf,SAAO;AACR;AAEA,SAAS,OAAU,GAAe;AACjC,MAAI,EAAE,WAAW,YAAY;AAC5B,WAAO,KAAK,CAAC;AAAA,EACd;AACA,SAAO,EAAE;AACV;AAUO,SAAS,KAAQ,SAAyB;AAChD,QAAM,IAAI,MAAS,SAAS;AAAA,IAC3B,gBAAgB;AAAA,IAChB,iBAAiB;AAAA,EAClB,CAAC;AAED,SAAO,YAAY,GAAG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMrB,KAAK,CAAC,UAAa,EAAE,KAAK,KAAK;AAAA,EAChC,CAAC;AACF;AA2BO,SAAS,SAAY,QAAa,IAA4C;AACpF,QAAM,aAAuD,MAAM,QAAQ,MAAM,IAC9E,SACA,CAAC,MAAM;AAEV,QAAM,WAAW,WAAW,IAAI,CAAC,MAAM,EAAE,KAAK;AAC9C,QAAM,IAAI;AAAA,IACT;AAAA,IACA,CAAC,UAAmB;AACnB,YAAM,OAAO,WAAW,IAAI,CAAC,MAAM;AAClC,cAAM,OAAO,EAAE;AACf,YAAI,KAAK,WAAW,YAAY;AAC/B,eAAK,IAAI;AAAA,QACV;AACA,eAAO,MAAM,IAAI;AAAA,MAClB,CAAC;AACD,aAAO,GAAG,GAAG,IAAI;AAAA,IAClB;AAAA,IACA;AAAA,MACC,gBAAgB;AAAA,MAChB,iBAAiB;AAAA,MACjB,QAAQ,OAAO;AAAA,IAChB;AAAA,EACD;AAEA,SAAO,YAAY,CAAC;AACrB;AAUO,SAAS,IAAuC,SAAwB;AAC9E,QAAM,IAAI,MAAS,SAAS;AAAA,IAC3B,gBAAgB;AAAA,IAChB,iBAAiB;AAAA,IACjB,QAAQ,MAAM;AAAA,EACf,CAAC;AAED,SAAO,YAAY,GAAG;AAAA;AAAA;AAAA;AAAA;AAAA,IAKrB,KAAK,CAAC,UAAa,EAAE,KAAK,KAAK;AAAA,IAC/B,QAAQ,CAAoB,KAAQ,UAAgB;AACnD,YAAM,UAAU,OAAO,CAAC;AACxB,QAAE,KAAK,EAAE,GAAG,SAAS,CAAC,GAAG,GAAG,MAAM,CAAC;AAAA,IACpC;AAAA,EACD,CAAC;AACF;AAOO,SAAS,SAAY,OAAyC;AACpE,SAAO,MAAM,IAAI;AAClB;AAOO,SAAS,QAAQ,OAA0C,IAAsB;AACvF,QAAM,OAAO,MAAM;AACnB,MAAI,YAAY,gBAAgB,IAAI,IAAI;AACxC,MAAI,CAAC,WAAW;AACf,gBAAY,oBAAI,IAAI;AACpB,oBAAgB,IAAI,MAAM,SAAS;AAAA,EACpC;AACA,YAAU,IAAI,EAAE;AACjB;AAOO,SAAS,OAAO,OAA0C,IAAsB;AACtF,QAAM,OAAO,MAAM;AACnB,MAAI,YAAY,eAAe,IAAI,IAAI;AACvC,MAAI,CAAC,WAAW;AACf,gBAAY,oBAAI,IAAI;AACpB,mBAAe,IAAI,MAAM,SAAS;AAAA,EACnC;AACA,YAAU,IAAI,EAAE;AACjB;AAQO,SAAS,QACf,OACA,IACO;AACP,UAAQ,OAAO,MAAM;AACpB,UAAM,OAAO,GAAG;AAChB,QAAI,OAAO,SAAS,WAAY,QAAO,OAAO,IAAI;AAAA,EACnD,CAAC;AACF;AAOO,SAAS,OACf,QACA,OACA,IAC4B;AAC5B,SAAO,IAAI,SAAe;AACzB,QAAI;AACJ,UAAM,MAAM;AACX,eAAS,GAAG,GAAG,IAAI;AAAA,IACpB,CAAC;AACD,WAAO;AAAA,EACR;AACD;","names":["map"]}

package/dist/chunk-NC6S43JJ.js

@@ -0,0 +1,456 @@
+import {
+  TopicGraph
+} from "./chunk-X5R3GL6H.js";
+import {
+  domainMeta
+} from "./chunk-JSCT3CR4.js";
+import {
+  reactiveLog
+} from "./chunk-J2VBW3DZ.js";
+import {
+  keepalive
+} from "./chunk-BVZYTZ5H.js";
+import {
+  watchTopologyTree
+} from "./chunk-OU5CQKNW.js";
+import {
+  Graph
+} from "./chunk-PF7GRZMW.js";
+import {
+  NodeImpl,
+  defaultHash,
+  derived,
+  monotonicNs,
+  policyFromRules,
+  state,
+  wallClockNs
+} from "./chunk-PHOUUNK7.js";
+import {
+  DATA,
+  __export
+} from "./chunk-SX52TAR4.js";
+
+// src/patterns/audit.ts
+var audit_exports = {};
+__export(audit_exports, {
+  AuditTrailGraph: () => AuditTrailGraph,
+  PolicyEnforcerGraph: () => PolicyEnforcerGraph,
+  auditTrail: () => auditTrail,
+  complianceSnapshot: () => complianceSnapshot,
+  policyEnforcer: () => policyEnforcer,
+  reactiveExplainPath: () => reactiveExplainPath
+});
+function auditMeta(kind, extra) {
+  return domainMeta("audit", kind, extra);
+}
+var DEFAULT_INCLUDE_TYPES = /* @__PURE__ */ new Set([
+  "data",
+  "error",
+  "complete",
+  "teardown"
+]);
+var AuditTrailGraph = class extends Graph {
+  entries;
+  count;
+  _log;
+  _target;
+  constructor(target, opts) {
+    super(opts.name ?? `${target.name}_audit`, opts.graph);
+    this._target = target;
+    this._log = reactiveLog([], {
+      name: "entries",
+      ...opts.maxSize != null ? { maxSize: opts.maxSize } : {}
+    });
+    this.entries = this._log.entries;
+    this.add("entries", this.entries);
+    this.count = derived(
+      [this.entries],
+      ([snapshot]) => snapshot.length,
+      { name: "count", describeKind: "derived", meta: auditMeta("count") }
+    );
+    this.add("count", this.count);
+    this.addDisposer(keepalive(this.count));
+    const includeTypes = opts.includeTypes != null ? new Set(opts.includeTypes) : DEFAULT_INCLUDE_TYPES;
+    const filter = opts.filter;
+    let seq = 0;
+    const handle = target.observe({ timeline: true, structured: true });
+    const offEvent = handle.onEvent((event) => {
+      if (event.type === "derived") return;
+      const type = event.type;
+      if (!includeTypes.has(type)) return;
+      const path = event.path ?? "";
+      const entry = {
+        seq: seq++,
+        timestamp_ns: event.timestamp_ns ?? monotonicNs(),
+        wall_clock_ns: wallClockNs(),
+        path,
+        type
+      };
+      const node = path ? safeNode(target, path) : void 0;
+      const lastMutation = node?.lastMutation;
+      if (lastMutation != null) entry.actor = lastMutation.actor;
+      if (type === "data") entry.value = event.data;
+      if (type === "error") entry.error = event.data;
+      const reason = path ? safeAnnotation(target, path) : void 0;
+      if (reason != null) entry.reason = reason;
+      if (filter != null && !filter(entry)) return;
+      this._log.append(entry);
+    });
+    this.addDisposer(() => {
+      offEvent();
+      handle.dispose();
+    });
+    this.addDisposer(() => this._log.disposeAllViews());
+  }
+  /** All entries currently in the ring (snapshot). */
+  all() {
+    return this.entries.cache ?? [];
+  }
+  /** Entries matching `path`. Order preserved. */
+  byNode(path) {
+    return this.all().filter((e) => e.path === path);
+  }
+  /** Entries whose `actor.id` matches. Use `byActorType` for type filtering. */
+  byActor(actorId) {
+    return this.all().filter((e) => e.actor?.id === actorId);
+  }
+  /** Entries whose `actor.type` matches (e.g. `"llm"`, `"human"`). */
+  byActorType(type) {
+    return this.all().filter((e) => e.actor?.type === type);
+  }
+  /**
+   * Entries with `timestamp_ns` in `[start_ns, end_ns)` (end exclusive).
+   * Omit `end_ns` to query open-ended.
+   */
+  byTimeRange(start_ns, end_ns) {
+    return this.all().filter((e) => {
+      if (e.timestamp_ns < start_ns) return false;
+      if (end_ns != null && e.timestamp_ns >= end_ns) return false;
+      return true;
+    });
+  }
+  /** Reference to the audited graph (escape hatch for tooling). */
+  get target() {
+    return this._target;
+  }
+};
+function auditTrail(target, opts = {}) {
+  return new AuditTrailGraph(target, opts);
+}
+var PolicyEnforcerGraph = class extends Graph {
+  policies;
+  violations;
+  violationCount;
+  _target;
+  _mode;
+  _currentGuard;
+  constructor(target, policies, opts) {
+    super(opts.name ?? `${target.name}_policy`, opts.graph);
+    this._target = target;
+    this._mode = opts.mode ?? "audit";
+    const policiesNode = isNode(policies) ? policies : state(policies, { name: "policies" });
+    this.policies = policiesNode;
+    this.add("policies", this.policies);
+    this.violations = new TopicGraph("violations", {
+      retainedLimit: opts.violationsLimit ?? 1e3
+    });
+    this.mount("violations", this.violations);
+    this.violationCount = derived(
+      [this.violations.events],
+      ([snapshot]) => snapshot.length,
+      {
+        name: "violationCount",
+        describeKind: "derived",
+        meta: auditMeta("policy_violation_count")
+      }
+    );
+    this.add("violationCount", this.violationCount);
+    this.addDisposer(keepalive(this.violationCount));
+    const initialRules = policiesNode.cache ?? [];
+    let latestRules = initialRules;
+    this._currentGuard = policyFromRules(latestRules);
+    const offPolicies = policiesNode.subscribe((msgs) => {
+      for (const m of msgs) {
+        if (m[0] === DATA) {
+          latestRules = m[1] ?? [];
+          this._currentGuard = policyFromRules(latestRules);
+        }
+      }
+    });
+    this.addDisposer(offPolicies);
+    const paths = opts.paths != null ? [...opts.paths] : collectPaths(target);
+    if (this._mode === "enforce") {
+      const restorers = /* @__PURE__ */ new Map();
+      const wrapAndPush = (path) => {
+        if (restorers.has(path)) return;
+        const node = safeNode(target, path);
+        if (!(node instanceof NodeImpl)) return;
+        const pathGuard = (actor, action) => {
+          const ok = this._currentGuard(actor, action);
+          if (!ok) {
+            this._publishViolation(actor, action, path, "blocked");
+          }
+          return ok;
+        };
+        restorers.set(path, node._pushGuard(pathGuard));
+      };
+      for (const path of paths) wrapAndPush(path);
+      if (opts.paths == null) {
+        const offTopology = watchTopologyTree(target, (event, emitter, prefix) => {
+          if (event.kind === "added") {
+            if (event.nodeKind === "node") {
+              wrapAndPush(`${prefix}${event.name}`);
+            } else {
+              const child = emitter._mounts.get(event.name);
+              if (!(child instanceof Graph)) return;
+              const mountPrefix = `${prefix}${event.name}::`;
+              const localPaths = collectPaths(child);
+              for (const localPath of localPaths) {
+                wrapAndPush(
+                  localPath === "" ? `${prefix}${event.name}` : `${mountPrefix}${localPath}`
+                );
+              }
+            }
+          } else if (event.kind === "removed") {
+            if (event.nodeKind === "node") {
+              const qp = `${prefix}${event.name}`;
+              const r = restorers.get(qp);
+              if (r != null) {
+                r();
+                restorers.delete(qp);
+              }
+            } else {
+              const mountQp = `${prefix}${event.name}`;
+              const mountPrefix = `${mountQp}::`;
+              for (const [p, r] of restorers) {
+                if (p === mountQp || p.startsWith(mountPrefix)) {
+                  r();
+                  restorers.delete(p);
+                }
+              }
+            }
+          }
+        });
+        this.addDisposer(offTopology);
+      } else {
+        const offCleanup = target.topology.subscribe((msgs) => {
+          for (const m of msgs) {
+            if (m[0] !== DATA) continue;
+            const event = m[1];
+            if (event.kind !== "removed" || event.nodeKind !== "node") continue;
+            const r = restorers.get(event.name);
+            if (r != null) {
+              r();
+              restorers.delete(event.name);
+            }
+          }
+        });
+        this.addDisposer(offCleanup);
+      }
+      this.addDisposer(() => {
+        for (const r of restorers.values()) r();
+        restorers.clear();
+      });
+    } else {
+      const handle = target.observe({ timeline: true, structured: true });
+      const off = handle.onEvent((event) => {
+        if (event.type !== "data" && event.type !== "error") return;
+        const path = event.path ?? "";
+        if (!path) return;
+        if (opts.paths != null && !opts.paths.includes(path)) return;
+        const node = safeNode(target, path);
+        const lastMutation = node?.lastMutation;
+        if (lastMutation == null) return;
+        const action = "write";
+        if (this._currentGuard(lastMutation.actor, action)) return;
+        this._publishViolation(lastMutation.actor, action, path, "observed");
+      });
+      this.addDisposer(() => {
+        off();
+        handle.dispose();
+      });
+    }
+  }
+  _publishViolation(actor, action, path, result) {
+    this.violations.publish({
+      timestamp_ns: monotonicNs(),
+      wall_clock_ns: wallClockNs(),
+      path,
+      actor,
+      action,
+      mode: this._mode,
+      result
+    });
+  }
+  /** Snapshot of recorded violations. */
+  all() {
+    return this.violations.retained();
+  }
+  get mode() {
+    return this._mode;
+  }
+  get target() {
+    return this._target;
+  }
+};
+function policyEnforcer(target, policies, opts = {}) {
+  return new PolicyEnforcerGraph(target, policies, opts);
+}
+function reactiveExplainPath(target, from, to, opts) {
+  let v = 0;
+  const version = state(v, { name: "explain_version" });
+  const handle = target.observe({ timeline: true, structured: true });
+  const off = handle.onEvent((event) => {
+    const t = event.type;
+    if (t !== "data" && t !== "error" && t !== "complete" && t !== "teardown") return;
+    v += 1;
+    version.emit(v);
+  });
+  const explainOpts = {
+    ...opts?.maxDepth != null ? { maxDepth: opts.maxDepth } : {},
+    ...opts?.findCycle === true ? { findCycle: true } : {}
+  };
+  const node = derived([version], () => target.explain(from, to, explainOpts), {
+    name: opts?.name ?? "explain",
+    describeKind: "derived",
+    equals: (a, b) => a.found === b.found && a.reason === b.reason && a.steps.length === b.steps.length && causalStepsEqual(a.steps, b.steps),
+    meta: auditMeta("explain_path", { from, to })
+  });
+  const stopKeepalive = keepalive(node);
+  return {
+    node,
+    dispose() {
+      off();
+      handle.dispose();
+      stopKeepalive();
+    }
+  };
+}
+function causalStepsEqual(a, b) {
+  for (let i = 0; i < a.length; i++) {
+    const x = a[i];
+    const y = b[i];
+    if (x.path !== y.path) return false;
+    if (x.type !== y.type) return false;
+    if (x.status !== y.status) return false;
+    if (x.hop !== y.hop) return false;
+    if (x.dep_index !== y.dep_index) return false;
+    if (x.reason !== y.reason) return false;
+    if (x.value !== y.value) return false;
+    if (x.lastMutation !== y.lastMutation) return false;
+    const xv = x.v;
+    const yv = y.v;
+    if (xv !== yv) {
+      if (xv == null || yv == null) return false;
+      if (xv.id !== yv.id || xv.version !== yv.version) return false;
+    }
+  }
+  return true;
+}
+function complianceSnapshot(target, opts = {}) {
+  const result = {
+    format_version: 1,
+    timestamp_ns: monotonicNs(),
+    wall_clock_ns: wallClockNs(),
+    graph: target.snapshot()
+  };
+  if (opts.actor != null) result.actor = opts.actor;
+  if (opts.audit != null) {
+    const entries = [...opts.audit.all()];
+    result.audit = { count: entries.length, entries };
+  }
+  if (opts.policies != null) {
+    const rules = opts.policies.policies.cache ?? [];
+    result.policies = {
+      mode: opts.policies.mode,
+      rules,
+      violations: [...opts.policies.all()]
+    };
+  }
+  const fingerprint = computeFingerprint(result);
+  return { ...result, fingerprint };
+}
+function isNode(x) {
+  return typeof x === "object" && x !== null && "subscribe" in x;
+}
+function safeNode(target, path) {
+  try {
+    return target.node(path);
+  } catch {
+    return void 0;
+  }
+}
+function safeAnnotation(target, path) {
+  try {
+    return target.annotation(path);
+  } catch {
+    return void 0;
+  }
+}
+function collectPaths(target) {
+  const described = target.describe({ detail: "minimal" });
+  return Object.keys(described.nodes);
+}
+function computeFingerprint(value) {
+  return defaultHash(JSON.stringify(canonicalize(value)));
+}
+function canonicalize(value) {
+  const stack = /* @__PURE__ */ new Set();
+  const walk = (v) => {
+    if (v === void 0) return { __undefined: true };
+    if (v === null) return null;
+    const t = typeof v;
+    if (t === "bigint") return { __bigint: v.toString() };
+    if (t !== "object") return v;
+    const obj = v;
+    if (stack.has(obj)) return { __circular: true };
+    stack.add(obj);
+    try {
+      if (Array.isArray(obj)) {
+        return obj.map(walk);
+      }
+      if (obj instanceof Date) {
+        return { __date: obj.toISOString() };
+      }
+      if (obj instanceof RegExp) {
+        return { __regexp: { source: obj.source, flags: obj.flags } };
+      }
+      if (obj instanceof Map) {
+        const entries = [...obj.entries()].map(([k, mv]) => [
+          walk(k),
+          walk(mv)
+        ]);
+        return { __map: entries };
+      }
+      if (obj instanceof Set) {
+        const items = [...obj].map(walk);
+        return { __set: items };
+      }
+      if (ArrayBuffer.isView(obj)) {
+        const ta = obj;
+        const arr = new Array(ta.length);
+        for (let i = 0; i < ta.length; i++) arr[i] = ta[i] ?? 0;
+        return { __typed_array: { ctor: obj.constructor.name, data: arr } };
+      }
+      const out = {};
+      for (const k of Object.keys(obj).sort()) {
+        out[k] = walk(obj[k]);
+      }
+      return out;
+    } finally {
+      stack.delete(obj);
+    }
+  };
+  return walk(value);
+}
+
+export {
+  AuditTrailGraph,
+  auditTrail,
+  PolicyEnforcerGraph,
+  policyEnforcer,
+  reactiveExplainPath,
+  complianceSnapshot,
+  audit_exports
+};
+//# sourceMappingURL=chunk-NC6S43JJ.js.map