@graphrefly/graphrefly 0.27.0 → 0.29.0

package/dist/chunk-X5R3GL6H.js

@@ -1,525 +0,0 @@
-import {
-  domainMeta
-} from "./chunk-JSCT3CR4.js";
-import {
-  reactiveList,
-  reactiveMap
-} from "./chunk-WKNUIZOY.js";
-import {
-  reactiveLog
-} from "./chunk-J2VBW3DZ.js";
-import {
-  keepalive
-} from "./chunk-BVZYTZ5H.js";
-import {
-  Graph
-} from "./chunk-PF7GRZMW.js";
-import {
-  batch,
-  derived,
-  node,
-  state
-} from "./chunk-PHOUUNK7.js";
-import {
-  COMPLETE,
-  DATA,
-  __export
-} from "./chunk-SX52TAR4.js";
-
-// src/patterns/messaging.ts
-var messaging_exports = {};
-__export(messaging_exports, {
-  JobFlowGraph: () => JobFlowGraph,
-  JobQueueGraph: () => JobQueueGraph,
-  MessagingHubGraph: () => MessagingHubGraph,
-  SubscriptionGraph: () => SubscriptionGraph,
-  TopicBridgeGraph: () => TopicBridgeGraph,
-  TopicGraph: () => TopicGraph,
-  jobFlow: () => jobFlow,
-  jobQueue: () => jobQueue,
-  messagingHub: () => messagingHub,
-  subscription: () => subscription,
-  topic: () => topic,
-  topicBridge: () => topicBridge
-});
-var DEFAULT_MAX_PER_PUMP = 2147483647;
-function requireNonNegativeInt(value, label) {
-  if (!Number.isFinite(value) || !Number.isInteger(value) || value < 0) {
-    throw new Error(`${label} must be a non-negative integer`);
-  }
-  return value;
-}
-function messagingMeta(kind, extra) {
-  return domainMeta("messaging", kind, extra);
-}
-var TopicGraph = class extends Graph {
-  _log;
-  events;
-  /**
-   * Most recently published value, or `null` when the topic has no entries
-   * yet. Spec §5.12 reserves `undefined` as the protocol-internal "never
-   * sent DATA" sentinel — `null` is the idiomatic "empty / no value" signal
-   * for domain nodes. F7.
-   *
-   * **Caveat when `T` itself includes `null`** (e.g., `topic<number | null>`):
-   * `latest === null` is ambiguous — it could mean "no publish yet" OR "a
-   * `null` value was published". Use {@link hasLatest} to disambiguate, or
-   * observe {@link events} directly and track length yourself.
-   */
-  latest;
-  /**
-   * Reactive `true` once the topic has at least one published entry.
-   * Disambiguates "`null` never published" from "`null` was published" when
-   * `T` includes `null`.
-   */
-  hasLatest;
-  constructor(name, opts = {}) {
-    super(name, opts.graph);
-    this._log = reactiveLog([], { name: "events", maxSize: opts.retainedLimit });
-    this.events = this._log.entries;
-    this.add("events", this.events);
-    this.latest = derived(
-      [this.events],
-      ([snapshot]) => {
-        const entries = snapshot;
-        return entries.length === 0 ? null : entries[entries.length - 1];
-      },
-      {
-        name: "latest",
-        describeKind: "derived",
-        meta: messagingMeta("topic_latest")
-      }
-    );
-    this.add("latest", this.latest);
-    this.addDisposer(keepalive(this.latest));
-    this.hasLatest = derived(
-      [this.events],
-      ([snapshot]) => snapshot.length > 0,
-      {
-        name: "hasLatest",
-        describeKind: "derived",
-        meta: messagingMeta("topic_has_latest")
-      }
-    );
-    this.add("hasLatest", this.hasLatest);
-    this.addDisposer(keepalive(this.hasLatest));
-    this.addDisposer(() => {
-      this.events.down([[COMPLETE]]);
-    });
-    this.addDisposer(() => this._log.disposeAllViews());
-  }
-  publish(value) {
-    this._log.append(value);
-  }
-  retained() {
-    return this.events.cache;
-  }
-};
-var SubscriptionGraph = class extends Graph {
-  source;
-  cursor;
-  available;
-  /**
-   * Reference to the upstream topic graph. Intentionally NOT mounted
-   * under this subscription: a subscription is a VIEW over an
-   * externally-owned topic. Double-mounting (e.g. hub-owned topic +
-   * sub-mount here) would make either-side teardown leave the other
-   * holding a dead reference. Node-level `derived([topicEvents], …)`
-   * still wires the data dependency across graph boundaries. D1(e).
-   */
-  topic;
-  constructor(name, topicGraph, opts = {}) {
-    super(name, opts.graph);
-    const initialCursor = requireNonNegativeInt(opts.cursor ?? 0, "subscription cursor");
-    this.topic = topicGraph;
-    const topicEvents = topicGraph.events;
-    this.source = derived([topicEvents], ([snapshot]) => snapshot, {
-      name: "source",
-      describeKind: "derived",
-      meta: messagingMeta("subscription_source"),
-      initial: topicEvents.cache
-    });
-    this.add("source", this.source);
-    this.cursor = state(initialCursor, {
-      name: "cursor",
-      describeKind: "state",
-      meta: messagingMeta("subscription_cursor")
-    });
-    this.add("cursor", this.cursor);
-    this.available = derived(
-      [this.source, this.cursor],
-      ([sourceSnapshot, cursor]) => {
-        const entries = sourceSnapshot;
-        const start = Math.max(0, Math.trunc(cursor ?? 0));
-        return entries.slice(start);
-      },
-      {
-        name: "available",
-        describeKind: "derived",
-        meta: messagingMeta("subscription_available"),
-        initial: []
-      }
-    );
-    this.add("available", this.available);
-    this.addDisposer(keepalive(this.source));
-    this.addDisposer(keepalive(this.available));
-  }
-  ack(count) {
-    const available = this.available.cache;
-    const requested = count === void 0 ? available.length : requireNonNegativeInt(count, "subscription ack count");
-    const step = Math.min(requested, available.length);
-    if (step <= 0) return this.cursor.cache;
-    const next = this.cursor.cache + step;
-    this.cursor.emit(next);
-    return next;
-  }
-  pull(limit, opts = {}) {
-    const available = this.available.cache;
-    const max = limit === void 0 ? available.length : requireNonNegativeInt(limit, "subscription pull limit");
-    const out = available.slice(0, max);
-    if (opts.ack && out.length > 0) this.ack(out.length);
-    return out;
-  }
-};
-var JobQueueGraph = class extends Graph {
-  _pending;
-  _jobs;
-  _seq = 0;
-  pending;
-  jobs;
-  depth;
-  constructor(name, opts = {}) {
-    super(name, opts.graph);
-    this._pending = reactiveList([], { name: "pending" });
-    this._jobs = reactiveMap({ name: "jobs" });
-    this.pending = this._pending.items;
-    this.jobs = this._jobs.entries;
-    this.add("pending", this.pending);
-    this.add("jobs", this.jobs);
-    this.depth = derived([this.pending], ([snapshot]) => snapshot.length, {
-      name: "depth",
-      describeKind: "derived",
-      meta: messagingMeta("queue_depth"),
-      initial: 0
-    });
-    this.add("depth", this.depth);
-    this.addDisposer(keepalive(this.depth));
-  }
-  enqueue(payload, opts = {}) {
-    const id = opts.id ?? `${this.name}-${++this._seq}`;
-    if (this._jobs.get(id) !== void 0) {
-      throw new Error(`jobQueue("${this.name}"): duplicate job id "${id}"`);
-    }
-    const job = {
-      id,
-      payload,
-      attempts: 0,
-      metadata: Object.freeze({ ...opts.metadata ?? {} }),
-      state: "queued"
-    };
-    this._jobs.set(id, job);
-    this._pending.append(id);
-    return id;
-  }
-  claim(limit = 1) {
-    const max = requireNonNegativeInt(limit, "job queue claim limit");
-    if (max === 0) return [];
-    const out = [];
-    while (out.length < max) {
-      const ids = this.pending.cache;
-      if (ids.length === 0) break;
-      const id = this._pending.pop(0);
-      const job = this._jobs.get(id);
-      if (!job || job.state !== "queued") continue;
-      const inflight = {
-        ...job,
-        state: "inflight",
-        attempts: job.attempts + 1
-      };
-      this._jobs.set(id, inflight);
-      out.push(inflight);
-    }
-    return out;
-  }
-  ack(id) {
-    const job = this._jobs.get(id);
-    if (!job || job.state !== "inflight") return false;
-    this._jobs.delete(id);
-    return true;
-  }
-  nack(id, opts = {}) {
-    const job = this._jobs.get(id);
-    if (!job || job.state !== "inflight") return false;
-    if (opts.requeue ?? true) {
-      this._jobs.set(id, { ...job, state: "queued" });
-      this._pending.append(id);
-      return true;
-    }
-    this._jobs.delete(id);
-    return true;
-  }
-};
-var JobFlowGraph = class extends Graph {
-  _stageNames;
-  _queues = /* @__PURE__ */ new Map();
-  _completed;
-  completed;
-  completedCount;
-  constructor(name, opts = {}) {
-    super(name, opts.graph);
-    const stages = (opts.stages ?? ["incoming", "processing", "done"]).map((v) => v.trim());
-    if (stages.length < 2) {
-      throw new Error(`jobFlow("${name}"): requires at least 2 stages`);
-    }
-    const unique = new Set(stages);
-    if (unique.size !== stages.length) {
-      throw new Error(`jobFlow("${name}"): stage names must be unique`);
-    }
-    this._stageNames = Object.freeze([...stages]);
-    for (const stage of this._stageNames) {
-      const q = jobQueue(`${name}-${stage}`);
-      this._queues.set(stage, q);
-      this.mount(stage, q);
-    }
-    this._completed = reactiveLog([], { name: "completed" });
-    this.completed = this._completed.entries;
-    this.add("completed", this.completed);
-    this.completedCount = derived(
-      [this.completed],
-      ([snapshot]) => snapshot.length,
-      {
-        name: "completedCount",
-        describeKind: "derived",
-        meta: messagingMeta("job_flow_completed_count"),
-        initial: 0
-      }
-    );
-    this.add("completedCount", this.completedCount);
-    this.addDisposer(keepalive(this.completedCount));
-    const maxPerPump = Math.max(
-      1,
-      requireNonNegativeInt(opts.maxPerPump ?? DEFAULT_MAX_PER_PUMP, "job flow maxPerPump")
-    );
-    for (let i = 0; i < this._stageNames.length; i += 1) {
-      const stage = this._stageNames[i];
-      const current = this.queue(stage);
-      const next = i + 1 < this._stageNames.length ? this.queue(this._stageNames[i + 1]) : null;
-      const pump = node(
-        [current.pending],
-        () => {
-          let moved = 0;
-          while (moved < maxPerPump) {
-            const claim = current.claim(1);
-            if (claim.length === 0) break;
-            const job = claim[0];
-            if (!job) break;
-            if (next) {
-              next.enqueue(job.payload, {
-                metadata: {
-                  ...job.metadata,
-                  job_flow_from: stage
-                }
-              });
-            } else {
-              this._completed.append(job);
-            }
-            current.ack(job.id);
-            moved += 1;
-          }
-        },
-        {
-          name: `pump_${stage}`,
-          describeKind: "effect",
-          meta: messagingMeta("job_flow_pump")
-        }
-      );
-      this.add(`pump_${stage}`, pump);
-      this.addDisposer(keepalive(pump));
-    }
-  }
-  stages() {
-    return this._stageNames;
-  }
-  queue(stage) {
-    const q = this._queues.get(stage);
-    if (!q) throw new Error(`jobFlow("${this.name}"): unknown stage "${stage}"`);
-    return q;
-  }
-  enqueue(payload, opts = {}) {
-    return this.queue(this._stageNames[0]).enqueue(payload, opts);
-  }
-  retainedCompleted() {
-    return this.completed.cache;
-  }
-};
-var TopicBridgeGraph = class extends Graph {
-  _sourceSub;
-  _target;
-  bridgedCount;
-  constructor(name, sourceTopic, targetTopic, opts = {}) {
-    super(name, opts.graph);
-    this._sourceSub = subscription(`${name}-subscription`, sourceTopic, {
-      cursor: opts.cursor
-    });
-    this._target = targetTopic;
-    this.mount("subscription", this._sourceSub);
-    this.bridgedCount = state(0, {
-      name: "bridgedCount",
-      describeKind: "state",
-      meta: messagingMeta("topic_bridge_count")
-    });
-    this.add("bridgedCount", this.bridgedCount);
-    const maxPerPump = Math.max(
-      1,
-      requireNonNegativeInt(opts.maxPerPump ?? DEFAULT_MAX_PER_PUMP, "topic bridge maxPerPump")
-    );
-    const mapValue = opts.map ?? ((value) => value);
-    const pump = node(
-      [this._sourceSub.available],
-      () => {
-        const available = this._sourceSub.pull(maxPerPump, { ack: true });
-        if (available.length === 0) return;
-        let bridged = 0;
-        for (const value of available) {
-          const mapped = mapValue(value);
-          if (mapped === void 0) continue;
-          this._target.publish(mapped);
-          bridged += 1;
-        }
-        if (bridged > 0) {
-          const current = this.bridgedCount.cache;
-          this.bridgedCount.down([[DATA, current + bridged]]);
-        }
-      },
-      {
-        name: "pump",
-        describeKind: "effect",
-        meta: messagingMeta("topic_bridge_pump")
-      }
-    );
-    this.add("pump", pump);
-    this.addDisposer(keepalive(pump));
-  }
-};
-var MessagingHubGraph = class extends Graph {
-  _topics = /* @__PURE__ */ new Map();
-  _version = 0;
-  _defaultTopicOptions;
-  constructor(name, opts = {}) {
-    super(name, opts.graph);
-    this._defaultTopicOptions = { ...opts.defaultTopicOptions ?? {} };
-  }
-  /** Monotonic counter advancing on topic create/remove. */
-  get version() {
-    return this._version;
-  }
-  /** Number of topics currently in the hub. */
-  get size() {
-    return this._topics.size;
-  }
-  /** Checks topic existence without creating. */
-  has(name) {
-    return this._topics.has(name);
-  }
-  /** Iterator over topic names. */
-  topicNames() {
-    return this._topics.keys();
-  }
-  /**
-   * Returns the {@link TopicGraph} for `name`, creating lazily on first call.
-   * Subsequent calls with the same name return the same instance (options on
-   * repeat calls are ignored — the topic is already configured).
-   */
-  topic(name, opts) {
-    let t = this._topics.get(name);
-    if (t === void 0) {
-      const effective = { ...this._defaultTopicOptions, ...opts ?? {} };
-      t = new TopicGraph(name, effective);
-      this._topics.set(name, t);
-      this.mount(name, t);
-      this._version += 1;
-    }
-    return t;
-  }
-  /**
-   * Publishes a value to the topic, lazily creating it on first publish.
-   *
-   * **Late-subscriber caveat:** the topic is created lazily, so subscribers
-   * that attach AFTER a publish only see the retained window (governed by
-   * `retainedLimit` on `TopicOptions` / `defaultTopicOptions`). If
-   * `retainedLimit === 0` is set explicitly, early publishes are
-   * effectively dropped — prefer an unset `retainedLimit` (unbounded
-   * retention) or subscribe before publishing when late-subscribers matter.
-   */
-  publish(name, value) {
-    this.topic(name).publish(value);
-  }
-  /**
-   * Bulk publish — issues all publishes inside one outer batch. New topics
-   * are created on demand. No-op if `entries` yields nothing.
-   *
-   * **Iterable consumption (F6):** `entries` is consumed once (single-pass)
-   * INSIDE the batch frame. If the iterator throws mid-way, the batch is
-   * discarded and NO publishes are visible to subscribers (all-or-nothing).
-   * Pass an array or `Set` for multi-shot callers.
-   */
-  publishMany(entries) {
-    batch(() => {
-      for (const [name, value] of entries) {
-        this.topic(name).publish(value);
-      }
-    });
-  }
-  /**
-   * Creates a {@link SubscriptionGraph} over a named topic. The topic is
-   * lazily created if missing. Subscription lifecycle is owned by the caller —
-   * the hub does NOT mount the subscription.
-   *
-   * @param subName - Local name for the subscription graph.
-   * @param topicName - Hub topic to subscribe to.
-   * @param opts - `SubscriptionOptions` (initial cursor, etc.).
-   */
-  subscribe(subName, topicName, opts) {
-    const t = this.topic(topicName);
-    return new SubscriptionGraph(subName, t, opts);
-  }
-  /**
-   * Unmounts and tears down the topic's graph. Returns `true` if the topic
-   * existed. Subscribers receive `TEARDOWN` via {@link Graph.remove}.
-   */
-  removeTopic(name) {
-    if (!this._topics.has(name)) return false;
-    try {
-      this.remove(name);
-    } finally {
-      this._topics.delete(name);
-      this._version += 1;
-    }
-    return true;
-  }
-};
-function topic(name, opts) {
-  return new TopicGraph(name, opts);
-}
-function messagingHub(name, opts) {
-  return new MessagingHubGraph(name, opts);
-}
-function subscription(name, topicGraph, opts) {
-  return new SubscriptionGraph(name, topicGraph, opts);
-}
-function jobQueue(name, opts) {
-  return new JobQueueGraph(name, opts);
-}
-function jobFlow(name, opts) {
-  return new JobFlowGraph(name, opts);
-}
-function topicBridge(name, sourceTopic, targetTopic, opts) {
-  return new TopicBridgeGraph(name, sourceTopic, targetTopic, opts);
-}
-
-export {
-  TopicGraph,
-  topic,
-  messaging_exports
-};
-//# sourceMappingURL=chunk-X5R3GL6H.js.map

package/dist/chunk-X5R3GL6H.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/patterns/messaging.ts"],"sourcesContent":["/**\n * Messaging patterns (roadmap §4.2).\n *\n * Pulsar-inspired messaging features modeled as graph factories:\n * - `topic()` for append-only topic streams\n * - `subscription()` for cursor-based consumers\n * - `jobQueue()` for queue claim/ack flow\n */\n\nimport { batch, COMPLETE, DATA, derived, type Node, node, state } from \"../core/index.js\";\nimport { reactiveList } from \"../extra/reactive-list.js\";\nimport { reactiveLog } from \"../extra/reactive-log.js\";\nimport { reactiveMap } from \"../extra/reactive-map.js\";\nimport { Graph, type GraphOptions } from \"../graph/index.js\";\n\nconst DEFAULT_MAX_PER_PUMP = 2_147_483_647;\n\nfunction requireNonNegativeInt(value: number, label: string): number {\n\tif (!Number.isFinite(value) || !Number.isInteger(value) || value < 0) {\n\t\tthrow new Error(`${label} must be a non-negative integer`);\n\t}\n\treturn value;\n}\n\nimport { domainMeta, keepalive } from \"./_internal.js\";\n\nfunction messagingMeta(kind: string, extra?: Record<string, unknown>): Record<string, unknown> {\n\treturn domainMeta(\"messaging\", kind, extra);\n}\n\nexport type TopicOptions = {\n\tgraph?: GraphOptions;\n\tretainedLimit?: number;\n};\n\nexport class TopicGraph<T> extends Graph {\n\tprivate readonly _log;\n\treadonly events: Node<readonly T[]>;\n\t/**\n\t * Most recently published value, or `null` when the topic has no entries\n\t * yet. Spec §5.12 reserves `undefined` as the protocol-internal \"never\n\t * sent DATA\" sentinel — `null` is the idiomatic \"empty / no value\" signal\n\t * for domain nodes. F7.\n\t *\n\t * **Caveat when `T` itself includes `null`** (e.g., `topic<number | null>`):\n\t * `latest === null` is ambiguous — it could mean \"no publish yet\" OR \"a\n\t * `null` value was published\". Use {@link hasLatest} to disambiguate, or\n\t * observe {@link events} directly and track length yourself.\n\t */\n\treadonly latest: Node<T | null>;\n\t/**\n\t * Reactive `true` once the topic has at least one published entry.\n\t * Disambiguates \"`null` never published\" from \"`null` was published\" when\n\t * `T` includes `null`.\n\t */\n\treadonly hasLatest: Node<boolean>;\n\n\tconstructor(name: string, opts: TopicOptions = {}) {\n\t\tsuper(name, opts.graph);\n\t\tthis._log = reactiveLog<T>([], { name: \"events\", maxSize: opts.retainedLimit });\n\t\tthis.events = this._log.entries;\n\t\tthis.add(\"events\", this.events);\n\t\tthis.latest = derived<T | null>(\n\t\t\t[this.events],\n\t\t\t([snapshot]) => {\n\t\t\t\tconst entries = snapshot as readonly T[];\n\t\t\t\treturn entries.length === 0 ? null : (entries[entries.length - 1] as T);\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"latest\",\n\t\t\t\tdescribeKind: \"derived\",\n\t\t\t\tmeta: messagingMeta(\"topic_latest\"),\n\t\t\t},\n\t\t);\n\t\tthis.add(\"latest\", this.latest);\n\t\tthis.addDisposer(keepalive(this.latest));\n\n\t\tthis.hasLatest = derived<boolean>(\n\t\t\t[this.events],\n\t\t\t([snapshot]) => (snapshot as readonly T[]).length > 0,\n\t\t\t{\n\t\t\t\tname: \"hasLatest\",\n\t\t\t\tdescribeKind: \"derived\",\n\t\t\t\tmeta: messagingMeta(\"topic_has_latest\"),\n\t\t\t},\n\t\t);\n\t\tthis.add(\"hasLatest\", this.hasLatest);\n\t\tthis.addDisposer(keepalive(this.hasLatest));\n\n\t\t// D1(a): on teardown, propagate COMPLETE on `events` so downstream\n\t\t// derived chains (including any externally-held SubscriptionGraph\n\t\t// sources) see the termination via their `terminalDeps` and can stop\n\t\t// serving stale caches. Tier-3 terminal per spec §2.2.\n\t\tthis.addDisposer(() => {\n\t\t\tthis.events.down([[COMPLETE]]);\n\t\t});\n\t\t// P9: release any memoized tail/slice view keepalives held by the log.\n\t\t// TopicGraph itself doesn't call log.tail/slice, but plugins may have\n\t\t// attached views via `_log` — defensive.\n\t\tthis.addDisposer(() => this._log.disposeAllViews());\n\t}\n\n\tpublish(value: T): void {\n\t\tthis._log.append(value);\n\t}\n\n\tretained(): readonly T[] {\n\t\treturn this.events.cache as readonly T[];\n\t}\n}\n\nexport type SubscriptionOptions = {\n\tgraph?: GraphOptions;\n\tcursor?: number;\n};\n\nexport class SubscriptionGraph<T> extends Graph {\n\treadonly source: Node<readonly T[]>;\n\treadonly cursor: Node<number>;\n\treadonly available: Node<readonly T[]>;\n\t/**\n\t * Reference to the upstream topic graph. Intentionally NOT mounted\n\t * under this subscription: a subscription is a VIEW over an\n\t * externally-owned topic. Double-mounting (e.g. hub-owned topic +\n\t * sub-mount here) would make either-side teardown leave the other\n\t * holding a dead reference. Node-level `derived([topicEvents], …)`\n\t * still wires the data dependency across graph boundaries. D1(e).\n\t */\n\treadonly topic: TopicGraph<T>;\n\n\tconstructor(name: string, topicGraph: TopicGraph<T>, opts: SubscriptionOptions = {}) {\n\t\tsuper(name, opts.graph);\n\t\tconst initialCursor = requireNonNegativeInt(opts.cursor ?? 0, \"subscription cursor\");\n\t\tthis.topic = topicGraph;\n\t\tconst topicEvents = topicGraph.events;\n\t\tthis.source = derived([topicEvents], ([snapshot]) => snapshot as readonly T[], {\n\t\t\tname: \"source\",\n\t\t\tdescribeKind: \"derived\",\n\t\t\tmeta: messagingMeta(\"subscription_source\"),\n\t\t\tinitial: topicEvents.cache as readonly T[],\n\t\t});\n\t\tthis.add(\"source\", this.source);\n\t\tthis.cursor = state(initialCursor, {\n\t\t\tname: \"cursor\",\n\t\t\tdescribeKind: \"state\",\n\t\t\tmeta: messagingMeta(\"subscription_cursor\"),\n\t\t});\n\t\tthis.add(\"cursor\", this.cursor);\n\t\tthis.available = derived(\n\t\t\t[this.source, this.cursor],\n\t\t\t([sourceSnapshot, cursor]) => {\n\t\t\t\tconst entries = sourceSnapshot as readonly T[];\n\t\t\t\tconst start = Math.max(0, Math.trunc((cursor as number) ?? 0));\n\t\t\t\treturn entries.slice(start);\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"available\",\n\t\t\t\tdescribeKind: \"derived\",\n\t\t\t\tmeta: messagingMeta(\"subscription_available\"),\n\t\t\t\tinitial: [],\n\t\t\t},\n\t\t);\n\t\tthis.add(\"available\", this.available);\n\t\t// No `connect(\"topic::events\", \"source\")` — topic is not mounted here.\n\t\t// The node-level dep `derived([topicEvents], …)` above is the live wire.\n\t\tthis.addDisposer(keepalive(this.source));\n\t\tthis.addDisposer(keepalive(this.available));\n\t}\n\n\tack(count?: number): number {\n\t\tconst available = this.available.cache as readonly T[];\n\t\tconst requested =\n\t\t\tcount === undefined\n\t\t\t\t? available.length\n\t\t\t\t: requireNonNegativeInt(count, \"subscription ack count\");\n\t\tconst step = Math.min(requested, available.length);\n\t\tif (step <= 0) return this.cursor.cache as number;\n\t\tconst next = (this.cursor.cache as number) + step;\n\t\t// F8: use emit() so the pipeline auto-prefixes DIRTY, runs equals\n\t\t// substitution, and produces a proper two-phase wave (the raw\n\t\t// `down([[DATA, next]])` path bypassed those contracts).\n\t\tthis.cursor.emit(next);\n\t\treturn next;\n\t}\n\n\tpull(limit?: number, opts: { ack?: boolean } = {}): readonly T[] {\n\t\tconst available = this.available.cache as readonly T[];\n\t\tconst max =\n\t\t\tlimit === undefined\n\t\t\t\t? available.length\n\t\t\t\t: requireNonNegativeInt(limit, \"subscription pull limit\");\n\t\tconst out = available.slice(0, max);\n\t\tif (opts.ack && out.length > 0) this.ack(out.length);\n\t\treturn out;\n\t}\n}\n\nexport type JobState = \"queued\" | \"inflight\";\n\nexport type JobEnvelope<T> = {\n\tid: string;\n\tpayload: T;\n\tattempts: number;\n\tmetadata: Readonly<Record<string, unknown>>;\n\tstate: JobState;\n};\n\nexport type JobQueueOptions = {\n\tgraph?: GraphOptions;\n};\n\nexport class JobQueueGraph<T> extends Graph {\n\tprivate readonly _pending;\n\tprivate readonly _jobs;\n\tprivate _seq = 0;\n\treadonly pending: Node<readonly string[]>;\n\treadonly jobs: Node<ReadonlyMap<string, JobEnvelope<T>>>;\n\treadonly depth: Node<number>;\n\n\tconstructor(name: string, opts: JobQueueOptions = {}) {\n\t\tsuper(name, opts.graph);\n\t\tthis._pending = reactiveList<string>([], { name: \"pending\" });\n\t\tthis._jobs = reactiveMap<string, JobEnvelope<T>>({ name: \"jobs\" });\n\t\tthis.pending = this._pending.items;\n\t\tthis.jobs = this._jobs.entries;\n\t\tthis.add(\"pending\", this.pending);\n\t\tthis.add(\"jobs\", this.jobs);\n\t\tthis.depth = derived([this.pending], ([snapshot]) => (snapshot as readonly string[]).length, {\n\t\t\tname: \"depth\",\n\t\t\tdescribeKind: \"derived\",\n\t\t\tmeta: messagingMeta(\"queue_depth\"),\n\t\t\tinitial: 0,\n\t\t});\n\t\tthis.add(\"depth\", this.depth);\n\t\tthis.addDisposer(keepalive(this.depth));\n\t}\n\n\tenqueue(payload: T, opts: { id?: string; metadata?: Record<string, unknown> } = {}): string {\n\t\tconst id = opts.id ?? `${this.name}-${++this._seq}`;\n\t\tif (this._jobs.get(id) !== undefined) {\n\t\t\tthrow new Error(`jobQueue(\"${this.name}\"): duplicate job id \"${id}\"`);\n\t\t}\n\t\tconst job: JobEnvelope<T> = {\n\t\t\tid,\n\t\t\tpayload,\n\t\t\tattempts: 0,\n\t\t\tmetadata: Object.freeze({ ...(opts.metadata ?? {}) }),\n\t\t\tstate: \"queued\",\n\t\t};\n\t\tthis._jobs.set(id, job);\n\t\tthis._pending.append(id);\n\t\treturn id;\n\t}\n\n\tclaim(limit = 1): readonly JobEnvelope<T>[] {\n\t\tconst max = requireNonNegativeInt(limit, \"job queue claim limit\");\n\t\tif (max === 0) return [];\n\t\tconst out: JobEnvelope<T>[] = [];\n\t\twhile (out.length < max) {\n\t\t\tconst ids = this.pending.cache as readonly string[];\n\t\t\tif (ids.length === 0) break;\n\t\t\tconst id = this._pending.pop(0);\n\t\t\tconst job = this._jobs.get(id);\n\t\t\tif (!job || job.state !== \"queued\") continue;\n\t\t\tconst inflight: JobEnvelope<T> = {\n\t\t\t\t...job,\n\t\t\t\tstate: \"inflight\",\n\t\t\t\tattempts: job.attempts + 1,\n\t\t\t};\n\t\t\tthis._jobs.set(id, inflight);\n\t\t\tout.push(inflight);\n\t\t}\n\t\treturn out;\n\t}\n\n\tack(id: string): boolean {\n\t\tconst job = this._jobs.get(id);\n\t\tif (!job || job.state !== \"inflight\") return false;\n\t\tthis._jobs.delete(id);\n\t\treturn true;\n\t}\n\n\tnack(id: string, opts: { requeue?: boolean } = {}): boolean {\n\t\tconst job = this._jobs.get(id);\n\t\tif (!job || job.state !== \"inflight\") return false;\n\t\tif (opts.requeue ?? true) {\n\t\t\tthis._jobs.set(id, { ...job, state: \"queued\" });\n\t\t\tthis._pending.append(id);\n\t\t\treturn true;\n\t\t}\n\t\tthis._jobs.delete(id);\n\t\treturn true;\n\t}\n}\n\nexport type JobFlowOptions = {\n\tgraph?: GraphOptions;\n\tstages?: readonly string[];\n\tmaxPerPump?: number;\n};\n\nexport class JobFlowGraph<T> extends Graph {\n\tprivate readonly _stageNames: readonly string[];\n\tprivate readonly _queues = new Map<string, JobQueueGraph<T>>();\n\tprivate readonly _completed;\n\treadonly completed: Node<readonly JobEnvelope<T>[]>;\n\treadonly completedCount: Node<number>;\n\n\tconstructor(name: string, opts: JobFlowOptions = {}) {\n\t\tsuper(name, opts.graph);\n\t\tconst stages = (opts.stages ?? [\"incoming\", \"processing\", \"done\"]).map((v) => v.trim());\n\t\tif (stages.length < 2) {\n\t\t\tthrow new Error(`jobFlow(\"${name}\"): requires at least 2 stages`);\n\t\t}\n\t\tconst unique = new Set(stages);\n\t\tif (unique.size !== stages.length) {\n\t\t\tthrow new Error(`jobFlow(\"${name}\"): stage names must be unique`);\n\t\t}\n\t\tthis._stageNames = Object.freeze([...stages]);\n\t\tfor (const stage of this._stageNames) {\n\t\t\tconst q = jobQueue<T>(`${name}-${stage}`);\n\t\t\tthis._queues.set(stage, q);\n\t\t\tthis.mount(stage, q);\n\t\t}\n\t\tthis._completed = reactiveLog<JobEnvelope<T>>([], { name: \"completed\" });\n\t\tthis.completed = this._completed.entries;\n\t\tthis.add(\"completed\", this.completed);\n\t\tthis.completedCount = derived(\n\t\t\t[this.completed],\n\t\t\t([snapshot]) => (snapshot as readonly JobEnvelope<T>[]).length,\n\t\t\t{\n\t\t\t\tname: \"completedCount\",\n\t\t\t\tdescribeKind: \"derived\",\n\t\t\t\tmeta: messagingMeta(\"job_flow_completed_count\"),\n\t\t\t\tinitial: 0,\n\t\t\t},\n\t\t);\n\t\tthis.add(\"completedCount\", this.completedCount);\n\t\tthis.addDisposer(keepalive(this.completedCount));\n\n\t\tconst maxPerPump = Math.max(\n\t\t\t1,\n\t\t\trequireNonNegativeInt(opts.maxPerPump ?? DEFAULT_MAX_PER_PUMP, \"job flow maxPerPump\"),\n\t\t);\n\t\tfor (let i = 0; i < this._stageNames.length; i += 1) {\n\t\t\tconst stage = this._stageNames[i] as string;\n\t\t\tconst current = this.queue(stage);\n\t\t\tconst next =\n\t\t\t\ti + 1 < this._stageNames.length ? this.queue(this._stageNames[i + 1] as string) : null;\n\t\t\tconst pump = node<unknown>(\n\t\t\t\t[current.pending],\n\t\t\t\t() => {\n\t\t\t\t\tlet moved = 0;\n\t\t\t\t\twhile (moved < maxPerPump) {\n\t\t\t\t\t\tconst claim = current.claim(1);\n\t\t\t\t\t\tif (claim.length === 0) break;\n\t\t\t\t\t\tconst job = claim[0] as JobEnvelope<T>;\n\t\t\t\t\t\tif (!job) break;\n\t\t\t\t\t\tif (next) {\n\t\t\t\t\t\t\tnext.enqueue(job.payload, {\n\t\t\t\t\t\t\t\tmetadata: {\n\t\t\t\t\t\t\t\t\t...job.metadata,\n\t\t\t\t\t\t\t\t\tjob_flow_from: stage,\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tthis._completed.append(job);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcurrent.ack(job.id);\n\t\t\t\t\t\tmoved += 1;\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tname: `pump_${stage}`,\n\t\t\t\t\tdescribeKind: \"effect\",\n\t\t\t\t\tmeta: messagingMeta(\"job_flow_pump\"),\n\t\t\t\t},\n\t\t\t);\n\t\t\tthis.add(`pump_${stage}`, pump);\n\t\t\tthis.addDisposer(keepalive(pump));\n\t\t}\n\t}\n\n\tstages(): readonly string[] {\n\t\treturn this._stageNames;\n\t}\n\n\tqueue(stage: string): JobQueueGraph<T> {\n\t\tconst q = this._queues.get(stage);\n\t\tif (!q) throw new Error(`jobFlow(\"${this.name}\"): unknown stage \"${stage}\"`);\n\t\treturn q;\n\t}\n\n\tenqueue(payload: T, opts: { id?: string; metadata?: Record<string, unknown> } = {}): string {\n\t\treturn this.queue(this._stageNames[0] as string).enqueue(payload, opts);\n\t}\n\n\tretainedCompleted(): readonly JobEnvelope<T>[] {\n\t\treturn this.completed.cache as readonly JobEnvelope<T>[];\n\t}\n}\n\nexport type TopicBridgeOptions<TIn, TOut> = {\n\tgraph?: GraphOptions;\n\tcursor?: number;\n\tmaxPerPump?: number;\n\tmap?: (value: TIn) => TOut | undefined;\n};\n\nexport class TopicBridgeGraph<TIn, TOut = TIn> extends Graph {\n\tprivate readonly _sourceSub;\n\tprivate readonly _target;\n\treadonly bridgedCount: Node<number>;\n\n\tconstructor(\n\t\tname: string,\n\t\tsourceTopic: TopicGraph<TIn>,\n\t\ttargetTopic: TopicGraph<TOut>,\n\t\topts: TopicBridgeOptions<TIn, TOut> = {},\n\t) {\n\t\tsuper(name, opts.graph);\n\t\tthis._sourceSub = subscription<TIn>(`${name}-subscription`, sourceTopic, {\n\t\t\tcursor: opts.cursor,\n\t\t});\n\t\tthis._target = targetTopic;\n\t\tthis.mount(\"subscription\", this._sourceSub);\n\t\tthis.bridgedCount = state(0, {\n\t\t\tname: \"bridgedCount\",\n\t\t\tdescribeKind: \"state\",\n\t\t\tmeta: messagingMeta(\"topic_bridge_count\"),\n\t\t});\n\t\tthis.add(\"bridgedCount\", this.bridgedCount);\n\n\t\tconst maxPerPump = Math.max(\n\t\t\t1,\n\t\t\trequireNonNegativeInt(opts.maxPerPump ?? DEFAULT_MAX_PER_PUMP, \"topic bridge maxPerPump\"),\n\t\t);\n\t\tconst mapValue = opts.map ?? ((value: TIn) => value as unknown as TOut);\n\t\tconst pump = node<unknown>(\n\t\t\t[this._sourceSub.available],\n\t\t\t() => {\n\t\t\t\tconst available = this._sourceSub.pull(maxPerPump, { ack: true });\n\t\t\t\tif (available.length === 0) return;\n\t\t\t\tlet bridged = 0;\n\t\t\t\tfor (const value of available) {\n\t\t\t\t\tconst mapped = mapValue(value as TIn);\n\t\t\t\t\tif (mapped === undefined) continue;\n\t\t\t\t\tthis._target.publish(mapped);\n\t\t\t\t\tbridged += 1;\n\t\t\t\t}\n\t\t\t\tif (bridged > 0) {\n\t\t\t\t\tconst current = this.bridgedCount.cache as number;\n\t\t\t\t\tthis.bridgedCount.down([[DATA, current + bridged]]);\n\t\t\t\t}\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"pump\",\n\t\t\t\tdescribeKind: \"effect\",\n\t\t\t\tmeta: messagingMeta(\"topic_bridge_pump\"),\n\t\t\t},\n\t\t);\n\t\tthis.add(\"pump\", pump);\n\t\tthis.addDisposer(keepalive(pump));\n\t}\n}\n\n// ── MessagingHubGraph ─────────────────────────────────────────────────────\n\nexport type MessagingHubOptions = {\n\tgraph?: GraphOptions;\n\t/**\n\t * Default `TopicOptions` applied to every topic created via `topic(name)`\n\t * without explicit options. Per-call opts override. Default: `{}`\n\t * (unbounded retention per topic unless `retainedLimit` is set per call).\n\t */\n\tdefaultTopicOptions?: TopicOptions;\n};\n\n/**\n * Lazy Pulsar-inspired topic registry. Manages a named set of {@link TopicGraph}\n * instances with retention + cursor semantics. Topics are created on first\n * access; `removeTopic(name)` unmounts and tears down via {@link Graph.remove}.\n *\n * **Relationship to `pubsub()` in `src/extra/pubsub.ts`:** `pubsub` is a\n * lightweight last-value state hub (no retention, no cursors). `MessagingHubGraph`\n * is the full messaging hub — retained message logs, cursor-based subscriptions,\n * and pattern-layer lifecycle management.\n *\n * @category patterns\n */\nexport class MessagingHubGraph extends Graph {\n\tprivate readonly _topics = new Map<string, TopicGraph<unknown>>();\n\tprivate _version = 0;\n\tprivate readonly _defaultTopicOptions: TopicOptions;\n\n\tconstructor(name: string, opts: MessagingHubOptions = {}) {\n\t\tsuper(name, opts.graph);\n\t\t// P8: shallow-copy caller-provided defaults so post-construction\n\t\t// mutations by the caller don't leak into every future `topic()` call.\n\t\tthis._defaultTopicOptions = { ...(opts.defaultTopicOptions ?? {}) };\n\t}\n\n\t/** Monotonic counter advancing on topic create/remove. */\n\tget version(): number {\n\t\treturn this._version;\n\t}\n\n\t/** Number of topics currently in the hub. */\n\tget size(): number {\n\t\treturn this._topics.size;\n\t}\n\n\t/** Checks topic existence without creating. */\n\thas(name: string): boolean {\n\t\treturn this._topics.has(name);\n\t}\n\n\t/** Iterator over topic names. */\n\ttopicNames(): IterableIterator<string> {\n\t\treturn this._topics.keys();\n\t}\n\n\t/**\n\t * Returns the {@link TopicGraph} for `name`, creating lazily on first call.\n\t * Subsequent calls with the same name return the same instance (options on\n\t * repeat calls are ignored — the topic is already configured).\n\t */\n\ttopic<T = unknown>(name: string, opts?: TopicOptions): TopicGraph<T> {\n\t\tlet t = this._topics.get(name) as TopicGraph<T> | undefined;\n\t\tif (t === undefined) {\n\t\t\tconst effective: TopicOptions = { ...this._defaultTopicOptions, ...(opts ?? {}) };\n\t\t\tt = new TopicGraph<T>(name, effective);\n\t\t\tthis._topics.set(name, t as TopicGraph<unknown>);\n\t\t\tthis.mount(name, t);\n\t\t\tthis._version += 1;\n\t\t}\n\t\treturn t;\n\t}\n\n\t/**\n\t * Publishes a value to the topic, lazily creating it on first publish.\n\t *\n\t * **Late-subscriber caveat:** the topic is created lazily, so subscribers\n\t * that attach AFTER a publish only see the retained window (governed by\n\t * `retainedLimit` on `TopicOptions` / `defaultTopicOptions`). If\n\t * `retainedLimit === 0` is set explicitly, early publishes are\n\t * effectively dropped — prefer an unset `retainedLimit` (unbounded\n\t * retention) or subscribe before publishing when late-subscribers matter.\n\t */\n\tpublish<T = unknown>(name: string, value: T): void {\n\t\tthis.topic<T>(name).publish(value);\n\t}\n\n\t/**\n\t * Bulk publish — issues all publishes inside one outer batch. New topics\n\t * are created on demand. No-op if `entries` yields nothing.\n\t *\n\t * **Iterable consumption (F6):** `entries` is consumed once (single-pass)\n\t * INSIDE the batch frame. If the iterator throws mid-way, the batch is\n\t * discarded and NO publishes are visible to subscribers (all-or-nothing).\n\t * Pass an array or `Set` for multi-shot callers.\n\t */\n\tpublishMany(entries: Iterable<[string, unknown]>): void {\n\t\t// P2: iterate inside batch — no `[...entries]` materialization so large\n\t\t// / infinite iterables don't OOM, and iterator throws are contained.\n\t\tbatch(() => {\n\t\t\tfor (const [name, value] of entries) {\n\t\t\t\tthis.topic(name).publish(value);\n\t\t\t}\n\t\t});\n\t}\n\n\t/**\n\t * Creates a {@link SubscriptionGraph} over a named topic. The topic is\n\t * lazily created if missing. Subscription lifecycle is owned by the caller —\n\t * the hub does NOT mount the subscription.\n\t *\n\t * @param subName - Local name for the subscription graph.\n\t * @param topicName - Hub topic to subscribe to.\n\t * @param opts - `SubscriptionOptions` (initial cursor, etc.).\n\t */\n\tsubscribe<T = unknown>(\n\t\tsubName: string,\n\t\ttopicName: string,\n\t\topts?: SubscriptionOptions,\n\t): SubscriptionGraph<T> {\n\t\tconst t = this.topic<T>(topicName);\n\t\treturn new SubscriptionGraph<T>(subName, t, opts);\n\t}\n\n\t/**\n\t * Unmounts and tears down the topic's graph. Returns `true` if the topic\n\t * existed. Subscribers receive `TEARDOWN` via {@link Graph.remove}.\n\t */\n\tremoveTopic(name: string): boolean {\n\t\tif (!this._topics.has(name)) return false;\n\t\t// P1 / P3: Graph.remove first — if it throws, `_topics` must NOT still\n\t\t// hold the broken half-disposed topic (otherwise the next\n\t\t// `hub.topic(name)` returns the corrupted reference). Wrap in\n\t\t// try/finally so `_topics` / `_version` converge to a consistent state\n\t\t// regardless of whether `remove` throws. Mount-orphan safety is\n\t\t// preserved by removing before deleting.\n\t\ttry {\n\t\t\tthis.remove(name); // unmounts, drops edges, tears down\n\t\t} finally {\n\t\t\tthis._topics.delete(name);\n\t\t\tthis._version += 1;\n\t\t}\n\t\treturn true;\n\t}\n}\n\n/**\n * Creates a Pulsar-inspired topic graph (append-only retained stream + latest value).\n */\nexport function topic<T>(name: string, opts?: TopicOptions): TopicGraph<T> {\n\treturn new TopicGraph<T>(name, opts);\n}\n\n/**\n * Creates a lazy Pulsar-inspired messaging hub. Topics are created on first access\n * via `hub.topic(name)`; `hub.publish(name, value)` shortcuts through the registry.\n *\n * @example\n * ```ts\n * import { messagingHub } from \"@graphrefly/graphrefly-ts\";\n *\n * const hub = messagingHub(\"main\", { defaultTopicOptions: { retainedLimit: 256 } });\n * hub.publish(\"orders\", { id: 1 });\n * hub.publishMany([[\"shipments\", { id: 1 }], [\"orders\", { id: 2 }]]);\n * const sub = hub.subscribe(\"orders-worker\", \"orders\", { cursor: 0 });\n * ```\n */\nexport function messagingHub(name: string, opts?: MessagingHubOptions): MessagingHubGraph {\n\treturn new MessagingHubGraph(name, opts);\n}\n\n/**\n * Creates a cursor-based subscription graph over a topic.\n */\nexport function subscription<T>(\n\tname: string,\n\ttopicGraph: TopicGraph<T>,\n\topts?: SubscriptionOptions,\n): SubscriptionGraph<T> {\n\treturn new SubscriptionGraph<T>(name, topicGraph, opts);\n}\n\n/**\n * Creates a Pulsar-inspired job queue graph with claim/ack/nack workflow.\n */\nexport function jobQueue<T>(name: string, opts?: JobQueueOptions): JobQueueGraph<T> {\n\treturn new JobQueueGraph<T>(name, opts);\n}\n\n/**\n * Creates an autonomous multi-stage queue chain graph.\n */\nexport function jobFlow<T>(name: string, opts?: JobFlowOptions): JobFlowGraph<T> {\n\treturn new JobFlowGraph<T>(name, opts);\n}\n\n/**\n * Creates an autonomous cursor-based topic relay graph.\n */\nexport function topicBridge<TIn, TOut = TIn>(\n\tname: string,\n\tsourceTopic: TopicGraph<TIn>,\n\ttargetTopic: TopicGraph<TOut>,\n\topts?: TopicBridgeOptions<TIn, TOut>,\n): TopicBridgeGraph<TIn, TOut> {\n\treturn new TopicBridgeGraph<TIn, TOut>(name, sourceTopic, targetTopic, opts);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAeA,IAAM,uBAAuB;AAE7B,SAAS,sBAAsB,OAAe,OAAuB;AACpE,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG;AACrE,UAAM,IAAI,MAAM,GAAG,KAAK,iCAAiC;AAAA,EAC1D;AACA,SAAO;AACR;AAIA,SAAS,cAAc,MAAc,OAA0D;AAC9F,SAAO,WAAW,aAAa,MAAM,KAAK;AAC3C;AAOO,IAAM,aAAN,cAA4B,MAAM;AAAA,EACvB;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA;AAAA,EAET,YAAY,MAAc,OAAqB,CAAC,GAAG;AAClD,UAAM,MAAM,KAAK,KAAK;AACtB,SAAK,OAAO,YAAe,CAAC,GAAG,EAAE,MAAM,UAAU,SAAS,KAAK,cAAc,CAAC;AAC9E,SAAK,SAAS,KAAK,KAAK;AACxB,SAAK,IAAI,UAAU,KAAK,MAAM;AAC9B,SAAK,SAAS;AAAA,MACb,CAAC,KAAK,MAAM;AAAA,MACZ,CAAC,CAAC,QAAQ,MAAM;AACf,cAAM,UAAU;AAChB,eAAO,QAAQ,WAAW,IAAI,OAAQ,QAAQ,QAAQ,SAAS,CAAC;AAAA,MACjE;AAAA,MACA;AAAA,QACC,MAAM;AAAA,QACN,cAAc;AAAA,QACd,MAAM,cAAc,cAAc;AAAA,MACnC;AAAA,IACD;AACA,SAAK,IAAI,UAAU,KAAK,MAAM;AAC9B,SAAK,YAAY,UAAU,KAAK,MAAM,CAAC;AAEvC,SAAK,YAAY;AAAA,MAChB,CAAC,KAAK,MAAM;AAAA,MACZ,CAAC,CAAC,QAAQ,MAAO,SAA0B,SAAS;AAAA,MACpD;AAAA,QACC,MAAM;AAAA,QACN,cAAc;AAAA,QACd,MAAM,cAAc,kBAAkB;AAAA,MACvC;AAAA,IACD;AACA,SAAK,IAAI,aAAa,KAAK,SAAS;AACpC,SAAK,YAAY,UAAU,KAAK,SAAS,CAAC;AAM1C,SAAK,YAAY,MAAM;AACtB,WAAK,OAAO,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,IAC9B,CAAC;AAID,SAAK,YAAY,MAAM,KAAK,KAAK,gBAAgB,CAAC;AAAA,EACnD;AAAA,EAEA,QAAQ,OAAgB;AACvB,SAAK,KAAK,OAAO,KAAK;AAAA,EACvB;AAAA,EAEA,WAAyB;AACxB,WAAO,KAAK,OAAO;AAAA,EACpB;AACD;AAOO,IAAM,oBAAN,cAAmC,MAAM;AAAA,EACtC;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA;AAAA,EAET,YAAY,MAAc,YAA2B,OAA4B,CAAC,GAAG;AACpF,UAAM,MAAM,KAAK,KAAK;AACtB,UAAM,gBAAgB,sBAAsB,KAAK,UAAU,GAAG,qBAAqB;AACnF,SAAK,QAAQ;AACb,UAAM,cAAc,WAAW;AAC/B,SAAK,SAAS,QAAQ,CAAC,WAAW,GAAG,CAAC,CAAC,QAAQ,MAAM,UAA0B;AAAA,MAC9E,MAAM;AAAA,MACN,cAAc;AAAA,MACd,MAAM,cAAc,qBAAqB;AAAA,MACzC,SAAS,YAAY;AAAA,IACtB,CAAC;AACD,SAAK,IAAI,UAAU,KAAK,MAAM;AAC9B,SAAK,SAAS,MAAM,eAAe;AAAA,MAClC,MAAM;AAAA,MACN,cAAc;AAAA,MACd,MAAM,cAAc,qBAAqB;AAAA,IAC1C,CAAC;AACD,SAAK,IAAI,UAAU,KAAK,MAAM;AAC9B,SAAK,YAAY;AAAA,MAChB,CAAC,KAAK,QAAQ,KAAK,MAAM;AAAA,MACzB,CAAC,CAAC,gBAAgB,MAAM,MAAM;AAC7B,cAAM,UAAU;AAChB,cAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAO,UAAqB,CAAC,CAAC;AAC7D,eAAO,QAAQ,MAAM,KAAK;AAAA,MAC3B;AAAA,MACA;AAAA,QACC,MAAM;AAAA,QACN,cAAc;AAAA,QACd,MAAM,cAAc,wBAAwB;AAAA,QAC5C,SAAS,CAAC;AAAA,MACX;AAAA,IACD;AACA,SAAK,IAAI,aAAa,KAAK,SAAS;AAGpC,SAAK,YAAY,UAAU,KAAK,MAAM,CAAC;AACvC,SAAK,YAAY,UAAU,KAAK,SAAS,CAAC;AAAA,EAC3C;AAAA,EAEA,IAAI,OAAwB;AAC3B,UAAM,YAAY,KAAK,UAAU;AACjC,UAAM,YACL,UAAU,SACP,UAAU,SACV,sBAAsB,OAAO,wBAAwB;AACzD,UAAM,OAAO,KAAK,IAAI,WAAW,UAAU,MAAM;AACjD,QAAI,QAAQ,EAAG,QAAO,KAAK,OAAO;AAClC,UAAM,OAAQ,KAAK,OAAO,QAAmB;AAI7C,SAAK,OAAO,KAAK,IAAI;AACrB,WAAO;AAAA,EACR;AAAA,EAEA,KAAK,OAAgB,OAA0B,CAAC,GAAiB;AAChE,UAAM,YAAY,KAAK,UAAU;AACjC,UAAM,MACL,UAAU,SACP,UAAU,SACV,sBAAsB,OAAO,yBAAyB;AAC1D,UAAM,MAAM,UAAU,MAAM,GAAG,GAAG;AAClC,QAAI,KAAK,OAAO,IAAI,SAAS,EAAG,MAAK,IAAI,IAAI,MAAM;AACnD,WAAO;AAAA,EACR;AACD;AAgBO,IAAM,gBAAN,cAA+B,MAAM;AAAA,EAC1B;AAAA,EACA;AAAA,EACT,OAAO;AAAA,EACN;AAAA,EACA;AAAA,EACA;AAAA,EAET,YAAY,MAAc,OAAwB,CAAC,GAAG;AACrD,UAAM,MAAM,KAAK,KAAK;AACtB,SAAK,WAAW,aAAqB,CAAC,GAAG,EAAE,MAAM,UAAU,CAAC;AAC5D,SAAK,QAAQ,YAAoC,EAAE,MAAM,OAAO,CAAC;AACjE,SAAK,UAAU,KAAK,SAAS;AAC7B,SAAK,OAAO,KAAK,MAAM;AACvB,SAAK,IAAI,WAAW,KAAK,OAAO;AAChC,SAAK,IAAI,QAAQ,KAAK,IAAI;AAC1B,SAAK,QAAQ,QAAQ,CAAC,KAAK,OAAO,GAAG,CAAC,CAAC,QAAQ,MAAO,SAA+B,QAAQ;AAAA,MAC5F,MAAM;AAAA,MACN,cAAc;AAAA,MACd,MAAM,cAAc,aAAa;AAAA,MACjC,SAAS;AAAA,IACV,CAAC;AACD,SAAK,IAAI,SAAS,KAAK,KAAK;AAC5B,SAAK,YAAY,UAAU,KAAK,KAAK,CAAC;AAAA,EACvC;AAAA,EAEA,QAAQ,SAAY,OAA4D,CAAC,GAAW;AAC3F,UAAM,KAAK,KAAK,MAAM,GAAG,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI;AACjD,QAAI,KAAK,MAAM,IAAI,EAAE,MAAM,QAAW;AACrC,YAAM,IAAI,MAAM,aAAa,KAAK,IAAI,yBAAyB,EAAE,GAAG;AAAA,IACrE;AACA,UAAM,MAAsB;AAAA,MAC3B;AAAA,MACA;AAAA,MACA,UAAU;AAAA,MACV,UAAU,OAAO,OAAO,EAAE,GAAI,KAAK,YAAY,CAAC,EAAG,CAAC;AAAA,MACpD,OAAO;AAAA,IACR;AACA,SAAK,MAAM,IAAI,IAAI,GAAG;AACtB,SAAK,SAAS,OAAO,EAAE;AACvB,WAAO;AAAA,EACR;AAAA,EAEA,MAAM,QAAQ,GAA8B;AAC3C,UAAM,MAAM,sBAAsB,OAAO,uBAAuB;AAChE,QAAI,QAAQ,EAAG,QAAO,CAAC;AACvB,UAAM,MAAwB,CAAC;AAC/B,WAAO,IAAI,SAAS,KAAK;AACxB,YAAM,MAAM,KAAK,QAAQ;AACzB,UAAI,IAAI,WAAW,EAAG;AACtB,YAAM,KAAK,KAAK,SAAS,IAAI,CAAC;AAC9B,YAAM,MAAM,KAAK,MAAM,IAAI,EAAE;AAC7B,UAAI,CAAC,OAAO,IAAI,UAAU,SAAU;AACpC,YAAM,WAA2B;AAAA,QAChC,GAAG;AAAA,QACH,OAAO;AAAA,QACP,UAAU,IAAI,WAAW;AAAA,MAC1B;AACA,WAAK,MAAM,IAAI,IAAI,QAAQ;AAC3B,UAAI,KAAK,QAAQ;AAAA,IAClB;AACA,WAAO;AAAA,EACR;AAAA,EAEA,IAAI,IAAqB;AACxB,UAAM,MAAM,KAAK,MAAM,IAAI,EAAE;AAC7B,QAAI,CAAC,OAAO,IAAI,UAAU,WAAY,QAAO;AAC7C,SAAK,MAAM,OAAO,EAAE;AACpB,WAAO;AAAA,EACR;AAAA,EAEA,KAAK,IAAY,OAA8B,CAAC,GAAY;AAC3D,UAAM,MAAM,KAAK,MAAM,IAAI,EAAE;AAC7B,QAAI,CAAC,OAAO,IAAI,UAAU,WAAY,QAAO;AAC7C,QAAI,KAAK,WAAW,MAAM;AACzB,WAAK,MAAM,IAAI,IAAI,EAAE,GAAG,KAAK,OAAO,SAAS,CAAC;AAC9C,WAAK,SAAS,OAAO,EAAE;AACvB,aAAO;AAAA,IACR;AACA,SAAK,MAAM,OAAO,EAAE;AACpB,WAAO;AAAA,EACR;AACD;AAQO,IAAM,eAAN,cAA8B,MAAM;AAAA,EACzB;AAAA,EACA,UAAU,oBAAI,IAA8B;AAAA,EAC5C;AAAA,EACR;AAAA,EACA;AAAA,EAET,YAAY,MAAc,OAAuB,CAAC,GAAG;AACpD,UAAM,MAAM,KAAK,KAAK;AACtB,UAAM,UAAU,KAAK,UAAU,CAAC,YAAY,cAAc,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;AACtF,QAAI,OAAO,SAAS,GAAG;AACtB,YAAM,IAAI,MAAM,YAAY,IAAI,gCAAgC;AAAA,IACjE;AACA,UAAM,SAAS,IAAI,IAAI,MAAM;AAC7B,QAAI,OAAO,SAAS,OAAO,QAAQ;AAClC,YAAM,IAAI,MAAM,YAAY,IAAI,gCAAgC;AAAA,IACjE;AACA,SAAK,cAAc,OAAO,OAAO,CAAC,GAAG,MAAM,CAAC;AAC5C,eAAW,SAAS,KAAK,aAAa;AACrC,YAAM,IAAI,SAAY,GAAG,IAAI,IAAI,KAAK,EAAE;AACxC,WAAK,QAAQ,IAAI,OAAO,CAAC;AACzB,WAAK,MAAM,OAAO,CAAC;AAAA,IACpB;AACA,SAAK,aAAa,YAA4B,CAAC,GAAG,EAAE,MAAM,YAAY,CAAC;AACvE,SAAK,YAAY,KAAK,WAAW;AACjC,SAAK,IAAI,aAAa,KAAK,SAAS;AACpC,SAAK,iBAAiB;AAAA,MACrB,CAAC,KAAK,SAAS;AAAA,MACf,CAAC,CAAC,QAAQ,MAAO,SAAuC;AAAA,MACxD;AAAA,QACC,MAAM;AAAA,QACN,cAAc;AAAA,QACd,MAAM,cAAc,0BAA0B;AAAA,QAC9C,SAAS;AAAA,MACV;AAAA,IACD;AACA,SAAK,IAAI,kBAAkB,KAAK,cAAc;AAC9C,SAAK,YAAY,UAAU,KAAK,cAAc,CAAC;AAE/C,UAAM,aAAa,KAAK;AAAA,MACvB;AAAA,MACA,sBAAsB,KAAK,cAAc,sBAAsB,qBAAqB;AAAA,IACrF;AACA,aAAS,IAAI,GAAG,IAAI,KAAK,YAAY,QAAQ,KAAK,GAAG;AACpD,YAAM,QAAQ,KAAK,YAAY,CAAC;AAChC,YAAM,UAAU,KAAK,MAAM,KAAK;AAChC,YAAM,OACL,IAAI,IAAI,KAAK,YAAY,SAAS,KAAK,MAAM,KAAK,YAAY,IAAI,CAAC,CAAW,IAAI;AACnF,YAAM,OAAO;AAAA,QACZ,CAAC,QAAQ,OAAO;AAAA,QAChB,MAAM;AACL,cAAI,QAAQ;AACZ,iBAAO,QAAQ,YAAY;AAC1B,kBAAM,QAAQ,QAAQ,MAAM,CAAC;AAC7B,gBAAI,MAAM,WAAW,EAAG;AACxB,kBAAM,MAAM,MAAM,CAAC;AACnB,gBAAI,CAAC,IAAK;AACV,gBAAI,MAAM;AACT,mBAAK,QAAQ,IAAI,SAAS;AAAA,gBACzB,UAAU;AAAA,kBACT,GAAG,IAAI;AAAA,kBACP,eAAe;AAAA,gBAChB;AAAA,cACD,CAAC;AAAA,YACF,OAAO;AACN,mBAAK,WAAW,OAAO,GAAG;AAAA,YAC3B;AACA,oBAAQ,IAAI,IAAI,EAAE;AAClB,qBAAS;AAAA,UACV;AAAA,QACD;AAAA,QACA;AAAA,UACC,MAAM,QAAQ,KAAK;AAAA,UACnB,cAAc;AAAA,UACd,MAAM,cAAc,eAAe;AAAA,QACpC;AAAA,MACD;AACA,WAAK,IAAI,QAAQ,KAAK,IAAI,IAAI;AAC9B,WAAK,YAAY,UAAU,IAAI,CAAC;AAAA,IACjC;AAAA,EACD;AAAA,EAEA,SAA4B;AAC3B,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,MAAM,OAAiC;AACtC,UAAM,IAAI,KAAK,QAAQ,IAAI,KAAK;AAChC,QAAI,CAAC,EAAG,OAAM,IAAI,MAAM,YAAY,KAAK,IAAI,sBAAsB,KAAK,GAAG;AAC3E,WAAO;AAAA,EACR;AAAA,EAEA,QAAQ,SAAY,OAA4D,CAAC,GAAW;AAC3F,WAAO,KAAK,MAAM,KAAK,YAAY,CAAC,CAAW,EAAE,QAAQ,SAAS,IAAI;AAAA,EACvE;AAAA,EAEA,oBAA+C;AAC9C,WAAO,KAAK,UAAU;AAAA,EACvB;AACD;AASO,IAAM,mBAAN,cAAgD,MAAM;AAAA,EAC3C;AAAA,EACA;AAAA,EACR;AAAA,EAET,YACC,MACA,aACA,aACA,OAAsC,CAAC,GACtC;AACD,UAAM,MAAM,KAAK,KAAK;AACtB,SAAK,aAAa,aAAkB,GAAG,IAAI,iBAAiB,aAAa;AAAA,MACxE,QAAQ,KAAK;AAAA,IACd,CAAC;AACD,SAAK,UAAU;AACf,SAAK,MAAM,gBAAgB,KAAK,UAAU;AAC1C,SAAK,eAAe,MAAM,GAAG;AAAA,MAC5B,MAAM;AAAA,MACN,cAAc;AAAA,MACd,MAAM,cAAc,oBAAoB;AAAA,IACzC,CAAC;AACD,SAAK,IAAI,gBAAgB,KAAK,YAAY;AAE1C,UAAM,aAAa,KAAK;AAAA,MACvB;AAAA,MACA,sBAAsB,KAAK,cAAc,sBAAsB,yBAAyB;AAAA,IACzF;AACA,UAAM,WAAW,KAAK,QAAQ,CAAC,UAAe;AAC9C,UAAM,OAAO;AAAA,MACZ,CAAC,KAAK,WAAW,SAAS;AAAA,MAC1B,MAAM;AACL,cAAM,YAAY,KAAK,WAAW,KAAK,YAAY,EAAE,KAAK,KAAK,CAAC;AAChE,YAAI,UAAU,WAAW,EAAG;AAC5B,YAAI,UAAU;AACd,mBAAW,SAAS,WAAW;AAC9B,gBAAM,SAAS,SAAS,KAAY;AACpC,cAAI,WAAW,OAAW;AAC1B,eAAK,QAAQ,QAAQ,MAAM;AAC3B,qBAAW;AAAA,QACZ;AACA,YAAI,UAAU,GAAG;AAChB,gBAAM,UAAU,KAAK,aAAa;AAClC,eAAK,aAAa,KAAK,CAAC,CAAC,MAAM,UAAU,OAAO,CAAC,CAAC;AAAA,QACnD;AAAA,MACD;AAAA,MACA;AAAA,QACC,MAAM;AAAA,QACN,cAAc;AAAA,QACd,MAAM,cAAc,mBAAmB;AAAA,MACxC;AAAA,IACD;AACA,SAAK,IAAI,QAAQ,IAAI;AACrB,SAAK,YAAY,UAAU,IAAI,CAAC;AAAA,EACjC;AACD;AA0BO,IAAM,oBAAN,cAAgC,MAAM;AAAA,EAC3B,UAAU,oBAAI,IAAiC;AAAA,EACxD,WAAW;AAAA,EACF;AAAA,EAEjB,YAAY,MAAc,OAA4B,CAAC,GAAG;AACzD,UAAM,MAAM,KAAK,KAAK;AAGtB,SAAK,uBAAuB,EAAE,GAAI,KAAK,uBAAuB,CAAC,EAAG;AAAA,EACnE;AAAA;AAAA,EAGA,IAAI,UAAkB;AACrB,WAAO,KAAK;AAAA,EACb;AAAA;AAAA,EAGA,IAAI,OAAe;AAClB,WAAO,KAAK,QAAQ;AAAA,EACrB;AAAA;AAAA,EAGA,IAAI,MAAuB;AAC1B,WAAO,KAAK,QAAQ,IAAI,IAAI;AAAA,EAC7B;AAAA;AAAA,EAGA,aAAuC;AACtC,WAAO,KAAK,QAAQ,KAAK;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAmB,MAAc,MAAoC;AACpE,QAAI,IAAI,KAAK,QAAQ,IAAI,IAAI;AAC7B,QAAI,MAAM,QAAW;AACpB,YAAM,YAA0B,EAAE,GAAG,KAAK,sBAAsB,GAAI,QAAQ,CAAC,EAAG;AAChF,UAAI,IAAI,WAAc,MAAM,SAAS;AACrC,WAAK,QAAQ,IAAI,MAAM,CAAwB;AAC/C,WAAK,MAAM,MAAM,CAAC;AAClB,WAAK,YAAY;AAAA,IAClB;AACA,WAAO;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,QAAqB,MAAc,OAAgB;AAClD,SAAK,MAAS,IAAI,EAAE,QAAQ,KAAK;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,YAAY,SAA4C;AAGvD,UAAM,MAAM;AACX,iBAAW,CAAC,MAAM,KAAK,KAAK,SAAS;AACpC,aAAK,MAAM,IAAI,EAAE,QAAQ,KAAK;AAAA,MAC/B;AAAA,IACD,CAAC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,UACC,SACA,WACA,MACuB;AACvB,UAAM,IAAI,KAAK,MAAS,SAAS;AACjC,WAAO,IAAI,kBAAqB,SAAS,GAAG,IAAI;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,MAAuB;AAClC,QAAI,CAAC,KAAK,QAAQ,IAAI,IAAI,EAAG,QAAO;AAOpC,QAAI;AACH,WAAK,OAAO,IAAI;AAAA,IACjB,UAAE;AACD,WAAK,QAAQ,OAAO,IAAI;AACxB,WAAK,YAAY;AAAA,IAClB;AACA,WAAO;AAAA,EACR;AACD;AAKO,SAAS,MAAS,MAAc,MAAoC;AAC1E,SAAO,IAAI,WAAc,MAAM,IAAI;AACpC;AAgBO,SAAS,aAAa,MAAc,MAA+C;AACzF,SAAO,IAAI,kBAAkB,MAAM,IAAI;AACxC;AAKO,SAAS,aACf,MACA,YACA,MACuB;AACvB,SAAO,IAAI,kBAAqB,MAAM,YAAY,IAAI;AACvD;AAKO,SAAS,SAAY,MAAc,MAA0C;AACnF,SAAO,IAAI,cAAiB,MAAM,IAAI;AACvC;AAKO,SAAS,QAAW,MAAc,MAAwC;AAChF,SAAO,IAAI,aAAgB,MAAM,IAAI;AACtC;AAKO,SAAS,YACf,MACA,aACA,aACA,MAC8B;AAC9B,SAAO,IAAI,iBAA4B,MAAM,aAAa,aAAa,IAAI;AAC5E;","names":[]}