@graphrefly/ts 0.0.1 → 0.0.3

package/dist/chunk-54WPEODM.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/graph/checkpoint.ts","../src/graph/operators.ts"],"sourcesContent":["/**\n * Graph checkpoint public data shape (D83/D86/D90/D116).\n *\n * Checkpoint is a graph lifecycle snapshot: strict-JSON-compatible data, no storage I/O,\n * no observe-log replay, and no restore runtime in this first TS slice.\n */\n\nimport { type StrictJsonValue, strictJsonCodec } from \"../json/codec.js\";\nimport type { Node } from \"../node/node.js\";\nimport type { NodeVersionJson } from \"../node/versioning.js\";\nimport { SENTINEL } from \"../protocol/messages.js\";\n\nexport const GRAPH_CHECKPOINT_VERSION = \"graphrefly.checkpoint.v1\" as const;\n\nexport type GraphCheckpointVersion = typeof GRAPH_CHECKPOINT_VERSION;\n\nexport type GraphCheckpointJson = StrictJsonValue;\n\nexport type GraphCheckpointValue =\n\t| { kind: \"SENTINEL\" }\n\t| { kind: \"DATA\"; data: GraphCheckpointJson };\n\nexport type GraphCheckpointTerminal =\n\t| { kind: \"none\" }\n\t| { kind: \"COMPLETE\" }\n\t| { kind: \"ERROR\"; error: GraphCheckpointJson };\n\nexport type GraphCheckpointFactory =\n\t| {\n\t\t\tkind: \"registry-ref\";\n\t\t\tref: string;\n\t\t\tconfig?: GraphCheckpointJson;\n\t\t\tconfigVersion?: GraphCheckpointJson;\n\t  }\n\t| { kind: \"local-only\"; name: string; reason: string };\n\nexport interface GraphCheckpointNode {\n\tid: string;\n\tname?: string;\n\tfactory: GraphCheckpointFactory;\n\tstatus: string;\n\tdeps: string[];\n\tvalue: GraphCheckpointValue;\n\tbackendState?: GraphCheckpointJson;\n\tversion?: NodeVersionJson;\n\tterminal: GraphCheckpointTerminal;\n\tlifecycle: { activated: boolean; hasCalledFnOnce: boolean };\n\tctxState: { persist: boolean; value: GraphCheckpointValue };\n\tmeta?: { [key: string]: GraphCheckpointJson };\n}\n\nexport interface GraphCheckpointEdge {\n\tfrom: string;\n\tto: string;\n}\n\nexport interface GraphCheckpointMount {\n\tat: string;\n\tcheckpoint: GraphCheckpoint;\n}\n\nexport interface GraphCheckpoint {\n\tversion: GraphCheckpointVersion;\n\tname?: string;\n\tnodes: GraphCheckpointNode[];\n\tedges: GraphCheckpointEdge[];\n\tmounts?: GraphCheckpointMount[];\n}\n\nexport function toCheckpointJson(value: unknown, path = \"$\"): GraphCheckpointJson {\n\ttry {\n\t\treturn strictJsonCodec.decode(strictJsonCodec.encode(value)) as GraphCheckpointJson;\n\t} catch (cause) {\n\t\tthrow new TypeError(`checkpoint: value at ${path} is not strict JSON compatible`, {\n\t\t\tcause,\n\t\t});\n\t}\n}\n\nexport function checkpointValue(\n\tvalue: unknown,\n\thasData: boolean,\n\tpath: string,\n): GraphCheckpointValue {\n\tif (!hasData || value === SENTINEL) return { kind: \"SENTINEL\" };\n\treturn { kind: \"DATA\", data: toCheckpointJson(value, path) };\n}\n\nexport function checkpointTerminal(value: unknown, path: string): GraphCheckpointTerminal {\n\tif (value === undefined) return { kind: \"none\" };\n\tif (value === true) return { kind: \"COMPLETE\" };\n\treturn { kind: \"ERROR\", error: toCheckpointJson(value, path) };\n}\n\ntype BackendStateContributor = () => unknown;\n\nconst backendStateContributors = new WeakMap<Node<unknown>, BackendStateContributor>();\n\n/** @internal D160: collection-owned backend checkpoint contributor for graph checkpoint. */\nexport function registerBackendStateContributor(\n\tnode: Node<unknown>,\n\tcontributor: BackendStateContributor,\n): void {\n\tbackendStateContributors.set(node, contributor);\n}\n\n/** @internal D160: capture a node's collection backend state when it has a contributor. */\nexport function checkpointBackendStateOfNode(\n\tnode: Node<unknown>,\n\tpath: string,\n): GraphCheckpointJson | undefined {\n\tconst contributor = backendStateContributors.get(node);\n\tif (contributor === undefined) return undefined;\n\treturn toCheckpointJson(contributor(), path);\n}\n","/**\n * Operators as free-standing factory definitions (D43 / D6 / D40 Catalog-first).\n *\n * Operators are `node` sugar (D6), NOT verbs (D4) and NEVER in parity (D24). Each is a\n * pure {@link Operator} spec — `{factory, body, opts}` — built on the bare `node` primitive\n * (NOT the `derived` verb): `body` reads ctx dep slots positionally and emits via\n * `ctx.down`. Two ways to instantiate:\n *\n *   - {@link initNode}(op, deps, opts?) — bare, no Graph; returns a working `Node<T>`.\n *   - `g.initNode(op, deps, opts?)` — graph-bound; the SAME call, plus inspection registration\n *     (the real factory name lands in the graph's `_entries`, so describe/observe/profile\n *     show it — D6/R-describe — while the node stays thin, R-node-thin).\n *\n * The D30 throw→ERROR boundary lives once, in the free {@link initNode} (which `g.initNode`\n * funnels through). The pure-ts `operatorOpts/partialOperatorOpts/gatedOperatorOpts` trio is\n * NOT ported: its sole job (`describeKind:\"derived\"`) is dead under D6/D39 (factory = the\n * REAL operator name); only the `partial`/`terminalAsRealInput` flags survive, carried\n * per-operator in `op.opts`.\n *\n * Config is folded into the factory (`map(fn)`, `scan(reducer, seed)`, `take(n)`, `merge()`),\n * so fn params are annotated where the source type can't be inferred (RxJS-pipe cost);\n * dep-type safety is recovered by the typed `g.initNode` overloads.\n */\n\nimport {\n\ttype Ctx,\n\tdepBatch,\n\tdepCount,\n\tdepLatest,\n\tdepTerminal,\n\tisTerminalComplete,\n\tisTerminalError,\n\ttype NodeFn,\n\tterminalErrorValue,\n} from \"../ctx/types.js\";\nimport type { NodeCore } from \"../node/core.js\";\nimport { Node, type NodeOptions, withNodeCore } from \"../node/node.js\";\nimport { errorPayload } from \"../protocol/messages.js\";\nimport { type GraphCheckpointJson, toCheckpointJson } from \"./checkpoint.js\";\nimport type { GraphRestoreDefinition, GraphRestoreEntry, GraphRestoreRegistry } from \"./restore.js\";\n\n/**\n * A free-standing operator definition (D43). `TIn` = the element type each dep delivers\n * (the operator reads `depLatest(ctx, i) as TIn`); `TOut` = the emitted value type.\n * `__in`/`__out` are phantom-only (never assigned) — they let `g.initNode` infer + check the\n * dep tuple against the operator without an explicit type argument.\n */\nexport interface Operator<TIn = unknown, TOut = unknown> {\n\t/** Real operator name shown in describe (D6/L1.5) — recorded at `_add` by `g.initNode`. */\n\treadonly factory: string;\n\t/** The ctx-body: reads ctx dep slots positionally, emits via `ctx.down`. */\n\treadonly body: (ctx: Ctx) => void;\n\t/** Behavioral node options the operator needs (e.g. `partial:true` for combine-family). */\n\treadonly opts?: Partial<NodeOptions<TOut>>;\n\t/**\n\t * D97/D100 restore metadata derived from a named definition or static built-in config.\n\t * This is semantic metadata only; dispatcher handles stay graph-local runtime state.\n\t */\n\treadonly restore?: {\n\t\tref: string;\n\t\tconfig?: GraphCheckpointJson;\n\t\tconfigVersion?: GraphCheckpointJson;\n\t};\n\t/** @internal phantom — never set; carries the dep element type for `g.initNode` inference. */\n\treadonly __in?: TIn;\n\t/** @internal phantom — never set; carries the output value type. */\n\treadonly __out?: TOut;\n}\n\ntype MutableRestoreRegistry = Map<string, GraphRestoreEntry> | Record<string, GraphRestoreEntry>;\n\nexport type RestoreRegistryEntry = GraphRestoreEntry;\n\nexport interface Definition<S = unknown, T = unknown> extends GraphRestoreDefinition<S, T> {\n\treadonly ref: string;\n\treadonly fn: (v: S) => T;\n}\n\nexport interface DefineOpts {\n\tregistry?: MutableRestoreRegistry;\n}\n\nfunction registryHas(registry: MutableRestoreRegistry, ref: string): boolean {\n\treturn registry instanceof Map ? registry.has(ref) : Object.hasOwn(registry, ref);\n}\n\nfunction registrySet(\n\tregistry: MutableRestoreRegistry,\n\tref: string,\n\tentry: GraphRestoreEntry,\n): void {\n\tif (registryHas(registry, ref)) {\n\t\tthrow new Error(`restoreRegistry: duplicate ref '${ref}'`);\n\t}\n\tif (registry instanceof Map) registry.set(ref, entry);\n\telse registry[ref] = entry;\n}\n\nexport function addToRestoreRegistry(\n\tregistry: MutableRestoreRegistry,\n\tentry: GraphRestoreEntry,\n): void {\n\tregistrySet(registry, entry.ref, entry);\n}\n\nexport function restoreRegistry(\n\tentries: readonly GraphRestoreEntry[] = [],\n\tbase?: GraphRestoreRegistry,\n): Map<string, GraphRestoreEntry> {\n\tconst out = new Map<string, GraphRestoreEntry>();\n\tif (base instanceof Map) {\n\t\tfor (const [ref, entry] of base) registrySet(out, ref, entry);\n\t} else if (base !== undefined) {\n\t\tfor (const [ref, entry] of Object.entries(base)) registrySet(out, ref, entry);\n\t}\n\tfor (const entry of entries) addToRestoreRegistry(out, entry);\n\treturn out;\n}\n\nfunction isDefinition<S, T>(fn: ((v: S) => T) | Definition<S, T>): fn is Definition<S, T> {\n\treturn typeof fn === \"object\" && fn !== null && (fn as Definition<S, T>).kind === \"definition\";\n}\n\nexport function define<S, T>(\n\tref: string,\n\tfn: (v: S) => T,\n\topts: DefineOpts = {},\n): Definition<S, T> {\n\tconst jsonRef = toCheckpointJson(ref, \"define.ref\");\n\tif (typeof jsonRef !== \"string\") throw new TypeError(\"define: ref must be a string\");\n\tconst definition: Definition<S, T> = {\n\t\tkind: \"definition\",\n\t\tref: jsonRef,\n\t\tfn,\n\t};\n\tif (opts.registry !== undefined) addToRestoreRegistry(opts.registry, definition);\n\treturn definition;\n}\n\n/**\n * Instantiate an operator as a bare `Node<T>` — NO Graph required (D43 bare-node path).\n * Wraps `op.body` in the D30 value-throw→ERROR boundary; merges `op.opts` with caller `opts`\n * (caller wins, so `partial`/`pool`/`dispatcher` overrides take effect). The\n * dispatcher defaults to the process-global (D26) unless `opts.dispatcher` is passed.\n *\n * `g.initNode` is the same call PLUS graph registration; graph inspection\n * (describe/observe/profile) requires that path — a node built bare here is not registered in\n * any graph's index.\n */\nexport function initNode<TIn, TOut>(\n\top: Operator<TIn, TOut>,\n\tdeps: readonly Node<unknown>[],\n\topts: NodeOptions<TOut> = {},\n): Node<TOut> {\n\treturn makeInitNode(op, deps, opts);\n}\n\n/** @internal Graph-bound operator instantiation into a graph-local B49 core. */\nexport function initNodeWithCore<TIn, TOut>(\n\tcore: NodeCore,\n\top: Operator<TIn, TOut>,\n\tdeps: readonly Node<unknown>[],\n\topts: NodeOptions<TOut> = {},\n): Node<TOut> {\n\treturn withNodeCore(core, () => makeInitNode(op, deps, opts));\n}\n\nfunction makeInitNode<TIn, TOut>(\n\top: Operator<TIn, TOut>,\n\tdeps: readonly Node<unknown>[],\n\topts: NodeOptions<TOut>,\n): Node<TOut> {\n\tconst body = operatorNodeFn(op);\n\t// D43-reserved / D51: stamp the operator's real factory onto the bare node so a runtime *Map\n\t// inner (created here via fromAny, NOT registered in any graph) is named in describe's\n\t// auto-discovery. A graph-bound g.initNode also records it in `_entries` (entry.factory wins\n\t// there); this field is only read for a node absent from the graph index. Caller opts win.\n\treturn new Node<TOut>([...deps], body, { factory: op.factory, ...op.opts, ...opts });\n}\n\n/** @internal Build the dispatcher body for an Operator spec. */\nexport function operatorNodeFn<TIn, TOut>(op: Operator<TIn, TOut>): NodeFn {\n\treturn (ctx) => {\n\t\ttry {\n\t\t\top.body(ctx);\n\t\t} catch (e) {\n\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"operator threw without a valid error payload\")]]); // D30: value-level throw → ERROR\n\t\t}\n\t};\n}\n\n// ── Slice 1 — single-dep map / take / control (CSP-2.7 catalog re-derive, D40) ──\n// All read dep 0 positionally + emit via ctx.down. Under D49 every occurrence is DATA (no\n// equals-absorption); a body that returns WITHOUT emitting gets a substrate-synthesized undirty\n// RESOLVED (R-resolved-undirty) — so a \"skip this wave\" is a bare `return`. Terminal-emitting\n// operators (reduce/last/find/elementAt) read `depTerminal(ctx, 0)` via the\n// `completeWhenDepsComplete:false + terminalAsRealInput:true` flags (R-deps-terminal): the fn fires\n// on the source's COMPLETE and emits its final value. NOT 1:1 pure-ts ports — the frozen reference\n// (D41) uses a producer + internal `subscribeOr`, the D45-banned describe island; these are\n// declared-dep nodes whose single edge `describe` shows truthfully.\n\n/**\n * Transform each upstream DATA value with a synchronous mapping function.\n *\n * @param fn - Mapping function, or a named `define()` definition for checkpoint restoration.\n * @returns An operator that emits `fn(value)` for each upstream value.\n * @example\n * ```ts\n * import { graph, map } from \"@graphrefly/ts\";\n *\n * const g = graph();\n * const count = g.state(1);\n * const doubled = g.initNode(map((value: number) => value * 2), [count]);\n * ```\n * @remarks **Restorable maps:** Passing a named `define()` registers semantic restore metadata.\n * @category operators\n */\nexport function map<S, T>(fn: ((v: S) => T) | Definition<S, T>): Operator<S, T> {\n\tif (isDefinition(fn)) {\n\t\treturn mapFromFunction(fn.fn, {\n\t\t\tref: \"map\",\n\t\t\tconfig: { fn: toCheckpointJson(fn.ref, `map.fn`) },\n\t\t});\n\t}\n\treturn mapFromFunction(fn);\n}\n\nfunction mapFromFunction<S, T>(\n\tfn: (v: S) => T,\n\trestore?: {\n\t\tref: string;\n\t\tconfig?: GraphCheckpointJson;\n\t\tconfigVersion?: GraphCheckpointJson;\n\t},\n): Operator<S, T> {\n\treturn {\n\t\tfactory: \"map\",\n\t\t...(restore ? { restore } : {}),\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tfor (const v of b) ctx.down([[\"DATA\", fn(v as S)]]);\n\t\t},\n\t};\n}\n\n/**\n * Pass through upstream values that satisfy a predicate.\n *\n * @param pred - Predicate evaluated for each upstream DATA value.\n * @returns An operator that emits matching values and stays quiet for non-matches.\n * @example\n * ```ts\n * import { filter, graph } from \"@graphrefly/ts\";\n *\n * const g = graph();\n * const count = g.state(0);\n * const even = g.initNode(filter((value: number) => value % 2 === 0), [count]);\n * ```\n * @category operators\n */\nexport function filter<S>(pred: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"filter\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tfor (const v of b) if (pred(v as S)) ctx.down([[\"DATA\", v]]);\n\t\t},\n\t};\n}\n\n/**\n * Accumulate upstream values and emit each intermediate accumulator.\n *\n * @param reducer - Reducer called with the previous accumulator and each upstream value.\n * @param seed - Initial accumulator value.\n * @returns An operator that emits the accumulator after every input value.\n * @example\n * ```ts\n * import { graph, scan } from \"@graphrefly/ts\";\n *\n * const g = graph();\n * const values = g.state(1);\n * const total = g.initNode(scan((sum: number, value: number) => sum + value, 0), [values]);\n * ```\n * @category operators\n */\nexport function scan<S, T>(reducer: (acc: T, v: S) => T, seed: T): Operator<S, T> {\n\treturn {\n\t\tfactory: \"scan\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tlet acc = ctx.state.get<T>() ?? seed;\n\t\t\tfor (const v of b) {\n\t\t\t\tacc = reducer(acc, v as S);\n\t\t\t\tctx.down([[\"DATA\", acc]]);\n\t\t\t}\n\t\t\tctx.state.set(acc);\n\t\t},\n\t};\n}\n\n/**\n * Emit the first `n` upstream values, then complete.\n *\n * @param n - Number of DATA values to pass before completion.\n * @returns An operator that forwards at most `n` values and then emits COMPLETE.\n * @example\n * ```ts\n * import { graph, take } from \"@graphrefly/ts\";\n *\n * const firstThree = graph().initNode(take<number>(3), [source]);\n * ```\n * @category operators\n */\nexport function take<S>(n: number): Operator<S, S> {\n\treturn {\n\t\tfactory: \"take\",\n\t\trestore: { ref: \"take\", config: { n: toCheckpointJson(n, \"take.n\") } },\n\t\tbody: (ctx) => {\n\t\t\tif (n <= 0) {\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tlet count = ctx.state.get<number>() ?? 0;\n\t\t\tif (count >= n) return; // already satisfied\n\t\t\tfor (const v of b) {\n\t\t\t\tif (count >= n) break;\n\t\t\t\tcount += 1;\n\t\t\t\tctx.down(count >= n ? [[\"DATA\", v], [\"COMPLETE\"]] : [[\"DATA\", v]]);\n\t\t\t}\n\t\t\tctx.state.set(count);\n\t\t},\n\t};\n}\n\n/**\n * Suppress consecutive duplicate values.\n *\n * @param eq - Equality predicate; defaults to `Object.is`.\n * @returns An operator that emits only when the next value differs from the previous emitted value.\n * @example\n * ```ts\n * import { distinctUntilChanged, graph } from \"@graphrefly/ts\";\n *\n * const stable = graph().initNode(distinctUntilChanged<number>(), [source]);\n * ```\n * @category operators\n */\nexport function distinctUntilChanged<S>(eq: (a: S, b: S) => boolean = Object.is): Operator<S, S> {\n\treturn {\n\t\tfactory: \"distinctUntilChanged\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tconst prev = ctx.state.get<{ v: S }>();\n\t\t\tlet last = prev?.v;\n\t\t\tlet hasLast = prev !== undefined;\n\t\t\tfor (const v of b as readonly S[]) {\n\t\t\t\tif (hasLast && eq(last as S, v)) continue;\n\t\t\t\tlast = v;\n\t\t\t\thasLast = true;\n\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t}\n\t\t\tif (hasLast) ctx.state.set({ v: last as S });\n\t\t},\n\t};\n}\n\n/**\n * merge: interleave several sources — emit each DATA from whichever dep fired. `partial:true`\n * (combine-family): fires on any single dep, not gated on all deps settling.\n *\n * @returns An operator that forwards DATA from any dependency.\n * @example\n * ```ts\n * import { graph, merge } from \"@graphrefly/ts\";\n *\n * const merged = graph().initNode(merge<number>(), [left, right]);\n * ```\n * @category operators\n */\nexport function merge<T>(): Operator<T, T> {\n\treturn {\n\t\tfactory: \"merge\",\n\t\topts: { partial: true },\n\t\tbody: (ctx) => {\n\t\t\tfor (let i = 0; i < depCount(ctx); i++) {\n\t\t\t\tconst b = depBatch(ctx, i);\n\t\t\t\tif (b && b.length > 0) {\n\t\t\t\t\tfor (const v of b) ctx.down([[\"DATA\", v]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t};\n}\n\n/**\n * reduce: accumulate over the whole source, emit ONE final value on the source's COMPLETE\n * (RxJS `reduce`). Unlike {@link scan} (which emits every step), reduce stays quiet until the\n * source terminates. `completeWhenDepsComplete:false + terminalAsRealInput:true`: the fn fires on\n * the source COMPLETE (reading `terminal===true`) and emits the accumulator + COMPLETE. An empty\n * source emits the seed (RxJS parity). A source ERROR auto-forwards (errorWhenDepsError default).\n *\n * @param reducer - Reducer called with the accumulator and each upstream DATA value.\n * @param seed - Initial accumulator value emitted if the source completes empty.\n * @returns An operator that emits one accumulated value when the source completes.\n * @example\n * ```ts\n * import { graph, reduce } from \"@graphrefly/ts\";\n *\n * const total = graph().initNode(reduce((sum: number, value: number) => sum + value, 0), [source]);\n * ```\n * @category operators\n */\nexport function reduce<S, T>(reducer: (acc: T, v: S) => T, seed: T): Operator<S, T> {\n\treturn {\n\t\tfactory: \"reduce\",\n\t\topts: { completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tlet acc = ctx.state.get<T>() ?? seed;\n\t\t\tif (b) for (const v of b) acc = reducer(acc, v as S);\n\t\t\tctx.state.set(acc);\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) ctx.down([[\"DATA\", acc], [\"COMPLETE\"]]);\n\t\t\t// else (live DATA wave): no emit → substrate-synthesized undirty RESOLVED (D49).\n\t\t},\n\t};\n}\n\n/**\n * pairwise: emit `[previous, current]` for each consecutive pair; the very first value produces no\n * pair (quiet → undirty RESOLVED). Previous value is kept in `ctx.state`.\n */\nexport function pairwise<S>(): Operator<S, readonly [S, S]> {\n\treturn {\n\t\tfactory: \"pairwise\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tconst st = ctx.state.get<{ prev: S }>();\n\t\t\tlet prev = st?.prev;\n\t\t\tlet hasPrev = st !== undefined;\n\t\t\tfor (const v of b as readonly S[]) {\n\t\t\t\tif (hasPrev) ctx.down([[\"DATA\", [prev as S, v] as const]]);\n\t\t\t\tprev = v;\n\t\t\t\thasPrev = true;\n\t\t\t}\n\t\t\tif (hasPrev) ctx.state.set({ prev: prev as S });\n\t\t},\n\t};\n}\n\n/** skip: drop the first `n` DATA values, then pass the rest through. */\nexport function skip<S>(n: number): Operator<S, S> {\n\treturn {\n\t\tfactory: \"skip\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tlet count = ctx.state.get<number>() ?? 0;\n\t\t\tfor (const v of b) {\n\t\t\t\tif (count < n) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t}\n\t\t\tctx.state.set(count);\n\t\t},\n\t};\n}\n\n/**\n * takeWhile: emit values while `pred` holds; on the first value that fails `pred`, COMPLETE\n * WITHOUT emitting it (RxJS default, non-inclusive). Terminal-is-forever once it completes.\n */\nexport function takeWhile<S>(pred: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"takeWhile\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tfor (const v of b as readonly S[]) {\n\t\t\t\tif (pred(v)) ctx.down([[\"DATA\", v]]);\n\t\t\t\telse {\n\t\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t};\n}\n\n/**\n * first: emit the first value matching `pred` (or simply the first value), then COMPLETE. EDGE\n * (RxJS divergence, flagged — same class as last/find/elementAt): if the source COMPLETEs with no\n * matching value, the substrate auto-cascades a bare COMPLETE (no value); RxJS `first()` throws\n * EmptyError. Could align to `[[ERROR, EmptyError]]` (expressible) if strict RxJS parity is wanted.\n */\nexport function first<S>(pred?: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"first\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tfor (const v of b as readonly S[]) {\n\t\t\t\tif (!pred || pred(v)) {\n\t\t\t\t\tctx.down([[\"DATA\", v], [\"COMPLETE\"]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// no match in this wave → undirty RESOLVED (await next match)\n\t\t},\n\t};\n}\n\n/**\n * last: emit the last value matching `pred` (or the last value) on the source's COMPLETE.\n * `completeWhenDepsComplete:false + terminalAsRealInput:true`. EDGE (RxJS divergence, flagged):\n * RxJS `last()` throws EmptyError when no value matched; we COMPLETE without a value (no throw) —\n * the clean-slate substrate has no \"complete-or-throw\" terminal and SENTINEL forbids emitting a\n * placeholder.\n */\nexport function last<S>(pred?: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"last\",\n\t\topts: { completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (b) for (const v of b) if (!pred || pred(v as S)) ctx.state.set({ v });\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) {\n\t\t\t\tconst st = ctx.state.get<{ v: S }>();\n\t\t\t\tctx.down(st ? [[\"DATA\", st.v], [\"COMPLETE\"]] : [[\"COMPLETE\"]]);\n\t\t\t}\n\t\t},\n\t};\n}\n\n/**\n * find: emit the first value matching `pred`, then COMPLETE. EDGE (RxJS divergence, flagged): RxJS\n * `find` emits `undefined` then COMPLETE when nothing matched — but `undefined` IS the SENTINEL\n * (R-sentinel), so a not-found source COMPLETE here emits a bare COMPLETE (no value).\n */\nexport function find<S>(pred: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"find\",\n\t\topts: { completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (b) {\n\t\t\t\tfor (const v of b) {\n\t\t\t\t\tif (pred(v as S)) {\n\t\t\t\t\t\tctx.down([[\"DATA\", v], [\"COMPLETE\"]]);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) ctx.down([[\"COMPLETE\"]]); // not found → bare COMPLETE\n\t\t},\n\t};\n}\n\n/**\n * elementAt: emit the value at zero-based `index`, then COMPLETE. EDGE (RxJS divergence, flagged):\n * RxJS throws ArgumentOutOfRangeError if the source completes before `index`; we COMPLETE without\n * a value (no throw), consistent with last/find.\n */\nexport function elementAt<S>(index: number): Operator<S, S> {\n\treturn {\n\t\tfactory: \"elementAt\",\n\t\topts: { completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tlet count = ctx.state.get<number>() ?? 0;\n\t\t\tif (b) {\n\t\t\t\tfor (const v of b) {\n\t\t\t\t\tif (count === index) {\n\t\t\t\t\t\tctx.down([[\"DATA\", v], [\"COMPLETE\"]]);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\tctx.state.set(count);\n\t\t\t}\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) ctx.down([[\"COMPLETE\"]]); // index out of range → bare COMPLETE\n\t\t},\n\t};\n}\n\n/** Observer object for {@link tap} — lifecycle-aware side effects (RxJS tap observer form). */\nexport interface TapObserver<T> {\n\tdata?: (value: T) => void;\n\terror?: (err: unknown) => void;\n\tcomplete?: () => void;\n}\n\n/**\n * tap: invoke a side effect on each DATA (function form) or on data/error/complete (observer form);\n * values pass through unchanged. The observer form reads source terminals\n * (`completeWhenDepsComplete:false + errorWhenDepsError:false + terminalAsRealInput:true`) so it can\n * call `error`/`complete` then forward the terminal; the function form lets the substrate\n * auto-cascade terminals.\n */\nexport function tap<S>(fnOrObserver: ((v: S) => void) | TapObserver<S>): Operator<S, S> {\n\tif (typeof fnOrObserver === \"function\") {\n\t\tconst fn = fnOrObserver;\n\t\treturn {\n\t\t\tfactory: \"tap\",\n\t\t\tbody: (ctx) => {\n\t\t\t\tconst b = depBatch(ctx, 0);\n\t\t\t\tif (b)\n\t\t\t\t\tfor (const v of b) {\n\t\t\t\t\t\tfn(v as S);\n\t\t\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t\t\t}\n\t\t\t},\n\t\t};\n\t}\n\tconst obs = fnOrObserver;\n\treturn {\n\t\tfactory: \"tap\",\n\t\topts: {\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t\tterminalAsRealInput: true,\n\t\t},\n\t\tbody: (ctx) => {\n\t\t\tconst terminal = depTerminal(ctx, 0);\n\t\t\tif (isTerminalComplete(terminal)) {\n\t\t\t\tobs.complete?.();\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (isTerminalError(terminal)) {\n\t\t\t\tconst err = terminalErrorValue(terminal);\n\t\t\t\tobs.error?.(err);\n\t\t\t\tctx.down([[\"ERROR\", err]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (b)\n\t\t\t\tfor (const v of b) {\n\t\t\t\t\tobs.data?.(v as S);\n\t\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t\t}\n\t\t},\n\t};\n}\n\n/**\n * onFirstData (alias `tapFirst`): invoke `fn` exactly once on the first qualifying value (default\n * `where: v => v != null` — null/undefined pass through without counting as \"first\"), then pass all\n * values through unchanged. The one-shot guard is per-node `ctx.state` (NOT a factory closure, so a\n * second instantiation of the same factory re-arms — R-ctx-state).\n */\nexport function onFirstData<S>(\n\tfn: (v: S) => void,\n\topts?: { where?: (v: S) => boolean },\n): Operator<S, S> {\n\tconst where = opts?.where ?? ((v: S) => v != null);\n\treturn {\n\t\tfactory: \"onFirstData\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tlet fired = ctx.state.get<boolean>() ?? false;\n\t\t\tfor (const v of b) {\n\t\t\t\tif (!fired && where(v as S)) {\n\t\t\t\t\tfired = true;\n\t\t\t\t\tfn(v as S);\n\t\t\t\t}\n\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t}\n\t\t\tctx.state.set(fired);\n\t\t},\n\t};\n}\n\n/** tapFirst: alias of {@link onFirstData} (the one-shot companion to {@link tap}). */\nexport const tapFirst = onFirstData;\n\n/** Options for {@link settle}. */\nexport interface SettleOpts<S> {\n\t/** Consecutive no-change waves before declaring convergence + COMPLETE. */\n\tquietWaves: number;\n\t/** Optional hard cap on total waves before forced COMPLETE. */\n\tmaxWaves?: number;\n\t/** Optional comparator; a DATA equal to the previous one does NOT reset the quiet counter. */\n\tequals?: (a: S, b: S) => boolean;\n}\n\n/** Internal settle accumulator state (per-node, R-ctx-state). */\ninterface SettleState<S> {\n\tlast: S | undefined;\n\thasValue: boolean;\n\tquiet: number;\n\twaves: number;\n\tdone: boolean;\n}\n\n/**\n * settle: forward each DATA unchanged, watch for convergence, COMPLETE once the source has been\n * quiet for `quietWaves` consecutive waves (or `maxWaves` elapsed). \"Wave\" = one fn invocation\n * (a DATA batch OR a bare undirty RESOLVED end-of-wave). No polling (R-no-polling) — the counter\n * advances only on real upstream waves. `settle`'s own `equals` is a body comparator, NOT the\n * removed substrate `equals` (D49).\n */\nexport function settle<S>(opts: SettleOpts<S>): Operator<S, S> {\n\tconst { quietWaves, maxWaves, equals } = opts;\n\tif (!Number.isInteger(quietWaves) || quietWaves < 1) {\n\t\tthrow new RangeError(`settle: quietWaves must be a positive integer (got ${quietWaves})`);\n\t}\n\tif (maxWaves != null && (!Number.isInteger(maxWaves) || maxWaves < 1)) {\n\t\tthrow new RangeError(`settle: maxWaves must be a positive integer when set (got ${maxWaves})`);\n\t}\n\treturn {\n\t\tfactory: \"settle\",\n\t\tbody: (ctx) => {\n\t\t\tconst st: SettleState<S> = ctx.state.get<SettleState<S>>() ?? {\n\t\t\t\tlast: undefined,\n\t\t\t\thasValue: false,\n\t\t\t\tquiet: 0,\n\t\t\t\twaves: 0,\n\t\t\t\tdone: false,\n\t\t\t};\n\t\t\tif (st.done) return;\n\t\t\tst.waves++;\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tlet sawChange = false;\n\t\t\tif (b && b.length > 0) {\n\t\t\t\tfor (const v of b) {\n\t\t\t\t\tconst next = v as S;\n\t\t\t\t\tconst isChange = !st.hasValue || equals == null || !equals(st.last as S, next);\n\t\t\t\t\tif (isChange) sawChange = true;\n\t\t\t\t\tst.last = next;\n\t\t\t\t\tst.hasValue = true;\n\t\t\t\t\tctx.down([[\"DATA\", next]]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tst.quiet = sawChange ? 0 : st.quiet + 1;\n\t\t\tconst settled = st.hasValue && st.quiet >= quietWaves;\n\t\t\tconst exhausted = maxWaves != null && st.waves >= maxWaves;\n\t\t\tif (settled || exhausted) {\n\t\t\t\tst.done = true;\n\t\t\t\tctx.state.set(st);\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tctx.state.set(st);\n\t\t\t// A no-DATA wave that didn't converge → bare undirty RESOLVED is synthesized by the\n\t\t\t// substrate (D49); nothing to emit here.\n\t\t},\n\t};\n}\n\n// ── Slice 3 — error-handling control (CSP-2.7, D40) ──\n// rescue/catchError ABSORB the source ERROR (errorWhenDepsError:false) and read the error payload\n// from `depTerminal(ctx, 0)` (R-deps-terminal). They set completeWhenDepsComplete:false so a\n// normal source COMPLETE is forwarded explicitly — which ALSO sidesteps B40 (the\n// completeWhenDepsComplete:true × absorbed-errored-dep auto-complete gap): there is no auto-complete\n// to block. valve is a [source, control] gate (state-verb-legitimate control input).\n\n/**\n * rescue (alias `catchError`): replace an upstream ERROR with a recovered value. On source DATA →\n * forward; on source ERROR → emit `recover(err)` as DATA (if `recover` throws, forward THAT as\n * ERROR); on source COMPLETE → COMPLETE. After recovery the source is terminal-errored (dead) so no\n * further values flow — the recovered value is the final cached value (matches the frozen pure-ts\n * reference; it does NOT auto-COMPLETE, RxJS-`catchError(()=>of(x))` divergence, flagged).\n */\nexport function rescue<S>(recover: (err: unknown) => S): Operator<S, S> {\n\treturn {\n\t\tfactory: \"rescue\",\n\t\topts: {\n\t\t\terrorWhenDepsError: false,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\tterminalAsRealInput: true,\n\t\t},\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tconst terminal = depTerminal(ctx, 0);\n\t\t\tif (b) for (const v of b) ctx.down([[\"DATA\", v]]);\n\t\t\tif (isTerminalComplete(terminal)) {\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t} else if (isTerminalError(terminal)) {\n\t\t\t\t// ERROR payload absorbed → recover.\n\t\t\t\ttry {\n\t\t\t\t\tctx.down([[\"DATA\", recover(terminalErrorValue(terminal))]]);\n\t\t\t\t} catch (e) {\n\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"rescue threw without a valid error payload\")]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t};\n}\n\n/** catchError: RxJS-named alias of {@link rescue}. */\nexport const catchError = rescue;\n\n/** Options for {@link valve}. */\nexport interface ValveOpts {\n\t/**\n\t * Optional AbortController (or a `() => AbortController | undefined` factory): on the control's\n\t * truthy→falsy edge, `valve` calls `controller.abort()` — cancel an in-flight async boundary\n\t * (LLM/fetch) the caller threaded `controller.signal` into. An external-resource cleanup (like\n\t * `ctx.onDeactivation`), NOT an imperative reactive trigger (R-no-imperative).\n\t */\n\tabortInFlight?: AbortController | (() => AbortController | undefined);\n}\n\n/**\n * valve: forward the source's DATA only while `control` (dep 1) is truthy; when closed, stay quiet\n * (undirty RESOLVED). `[source, control]` declared deps + `partial:true` (the control wave can fire\n * before the source ever delivers). `completeWhenDepsComplete:false` — closing the gate (control\n * terminating) does NOT complete the valve; only the SOURCE's terminal (read via\n * `terminalAsRealInput`) is forwarded. The `state`-verb control input is a legitimate external\n * boundary (D4 / D54), not a forbidden imperative trigger.\n */\nexport function valve<S>(opts?: ValveOpts): Operator<S, S> {\n\tconst abortInFlight = opts?.abortInFlight;\n\treturn {\n\t\tfactory: \"valve\",\n\t\topts: { partial: true, completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst srcBatch = depBatch(ctx, 0);\n\t\t\tconst ctlBatch = depBatch(ctx, 1);\n\t\t\tconst srcTerminal = depTerminal(ctx, 0);\n\t\t\tconst controlValue = depLatest(ctx, 1) as boolean | undefined;\n\n\t\t\tif (abortInFlight != null) {\n\t\t\t\t// Fire abort on the truthy→falsy edge only (never on activation / no prior state).\n\t\t\t\tconst prev = ctx.state.get<{ ctl: boolean | undefined }>();\n\t\t\t\tif (prev?.ctl === true && !controlValue) {\n\t\t\t\t\tconst c = typeof abortInFlight === \"function\" ? abortInFlight() : abortInFlight;\n\t\t\t\t\tc?.abort();\n\t\t\t\t}\n\t\t\t\tctx.state.set({\n\t\t\t\t\tctl: controlValue === true ? true : controlValue == null ? undefined : false,\n\t\t\t\t});\n\t\t\t}\n\n\t\t\t// Source terminal forwarding (control terminal is absorbed by completeWhenDepsComplete:false).\n\t\t\tif (isTerminalComplete(srcTerminal)) {\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (isTerminalError(srcTerminal)) {\n\t\t\t\tctx.down([[\"ERROR\", terminalErrorValue(srcTerminal)]]);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (!controlValue) return; // gate closed → quiet (undirty RESOLVED)\n\n\t\t\tif (srcBatch && srcBatch.length > 0) {\n\t\t\t\tfor (const v of srcBatch) ctx.down([[\"DATA\", v]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Gate just opened this wave (control fired, source didn't): re-emit the last source value.\n\t\t\tconst srcLatest = depLatest(ctx, 0);\n\t\t\tif (ctlBatch && ctlBatch.length > 0 && srcLatest !== undefined) {\n\t\t\t\tctx.down([[\"DATA\", srcLatest as S]]);\n\t\t\t}\n\t\t},\n\t};\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAYO,IAAM,2BAA2B;AAyDjC,SAAS,iBAAiB,OAAgB,OAAO,KAA0B;AACjF,MAAI;AACH,WAAO,gBAAgB,OAAO,gBAAgB,OAAO,KAAK,CAAC;AAAA,EAC5D,SAAS,OAAO;AACf,UAAM,IAAI,UAAU,wBAAwB,IAAI,kCAAkC;AAAA,MACjF;AAAA,IACD,CAAC;AAAA,EACF;AACD;AAEO,SAAS,gBACf,OACA,SACA,MACuB;AACvB,MAAI,CAAC,WAAW,UAAU,SAAU,QAAO,EAAE,MAAM,WAAW;AAC9D,SAAO,EAAE,MAAM,QAAQ,MAAM,iBAAiB,OAAO,IAAI,EAAE;AAC5D;AAEO,SAAS,mBAAmB,OAAgB,MAAuC;AACzF,MAAI,UAAU,OAAW,QAAO,EAAE,MAAM,OAAO;AAC/C,MAAI,UAAU,KAAM,QAAO,EAAE,MAAM,WAAW;AAC9C,SAAO,EAAE,MAAM,SAAS,OAAO,iBAAiB,OAAO,IAAI,EAAE;AAC9D;AAIA,IAAM,2BAA2B,oBAAI,QAAgD;AAG9E,SAAS,gCACf,MACA,aACO;AACP,2BAAyB,IAAI,MAAM,WAAW;AAC/C;AAGO,SAAS,6BACf,MACA,MACkC;AAClC,QAAM,cAAc,yBAAyB,IAAI,IAAI;AACrD,MAAI,gBAAgB,OAAW,QAAO;AACtC,SAAO,iBAAiB,YAAY,GAAG,IAAI;AAC5C;;;AChCA,SAAS,YAAY,UAAkC,KAAsB;AAC5E,SAAO,oBAAoB,MAAM,SAAS,IAAI,GAAG,IAAI,OAAO,OAAO,UAAU,GAAG;AACjF;AAEA,SAAS,YACR,UACA,KACA,OACO;AACP,MAAI,YAAY,UAAU,GAAG,GAAG;AAC/B,UAAM,IAAI,MAAM,mCAAmC,GAAG,GAAG;AAAA,EAC1D;AACA,MAAI,oBAAoB,IAAK,UAAS,IAAI,KAAK,KAAK;AAAA,MAC/C,UAAS,GAAG,IAAI;AACtB;AAEO,SAAS,qBACf,UACA,OACO;AACP,cAAY,UAAU,MAAM,KAAK,KAAK;AACvC;AAEO,SAAS,gBACf,UAAwC,CAAC,GACzC,MACiC;AACjC,QAAM,MAAM,oBAAI,IAA+B;AAC/C,MAAI,gBAAgB,KAAK;AACxB,eAAW,CAAC,KAAK,KAAK,KAAK,KAAM,aAAY,KAAK,KAAK,KAAK;AAAA,EAC7D,WAAW,SAAS,QAAW;AAC9B,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,IAAI,EAAG,aAAY,KAAK,KAAK,KAAK;AAAA,EAC7E;AACA,aAAW,SAAS,QAAS,sBAAqB,KAAK,KAAK;AAC5D,SAAO;AACR;AAEA,SAAS,aAAmB,IAA8D;AACzF,SAAO,OAAO,OAAO,YAAY,OAAO,QAAS,GAAwB,SAAS;AACnF;AAEO,SAAS,OACf,KACA,IACA,OAAmB,CAAC,GACD;AACnB,QAAM,UAAU,iBAAiB,KAAK,YAAY;AAClD,MAAI,OAAO,YAAY,SAAU,OAAM,IAAI,UAAU,8BAA8B;AACnF,QAAM,aAA+B;AAAA,IACpC,MAAM;AAAA,IACN,KAAK;AAAA,IACL;AAAA,EACD;AACA,MAAI,KAAK,aAAa,OAAW,sBAAqB,KAAK,UAAU,UAAU;AAC/E,SAAO;AACR;AAYO,SAAS,SACf,IACA,MACA,OAA0B,CAAC,GACd;AACb,SAAO,aAAa,IAAI,MAAM,IAAI;AACnC;AAGO,SAAS,iBACf,MACA,IACA,MACA,OAA0B,CAAC,GACd;AACb,SAAO,aAAa,MAAM,MAAM,aAAa,IAAI,MAAM,IAAI,CAAC;AAC7D;AAEA,SAAS,aACR,IACA,MACA,MACa;AACb,QAAM,OAAO,eAAe,EAAE;AAK9B,SAAO,IAAI,KAAW,CAAC,GAAG,IAAI,GAAG,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,GAAG,MAAM,GAAG,KAAK,CAAC;AACpF;AAGO,SAAS,eAA0B,IAAiC;AAC1E,SAAO,CAAC,QAAQ;AACf,QAAI;AACH,SAAG,KAAK,GAAG;AAAA,IACZ,SAAS,GAAG;AACX,UAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,8CAA8C,CAAC,CAAC,CAAC;AAAA,IACtF;AAAA,EACD;AACD;AA4BO,SAAS,IAAU,IAAsD;AAC/E,MAAI,aAAa,EAAE,GAAG;AACrB,WAAO,gBAAgB,GAAG,IAAI;AAAA,MAC7B,KAAK;AAAA,MACL,QAAQ,EAAE,IAAI,iBAAiB,GAAG,KAAK,QAAQ,EAAE;AAAA,IAClD,CAAC;AAAA,EACF;AACA,SAAO,gBAAgB,EAAE;AAC1B;AAEA,SAAS,gBACR,IACA,SAKiB;AACjB,SAAO;AAAA,IACN,SAAS;AAAA,IACT,GAAI,UAAU,EAAE,QAAQ,IAAI,CAAC;AAAA,IAC7B,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI,CAAC,EAAG;AACR,iBAAW,KAAK,EAAG,KAAI,KAAK,CAAC,CAAC,QAAQ,GAAG,CAAM,CAAC,CAAC,CAAC;AAAA,IACnD;AAAA,EACD;AACD;AAiBO,SAAS,OAAU,MAAyC;AAClE,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI,CAAC,EAAG;AACR,iBAAW,KAAK,EAAG,KAAI,KAAK,CAAM,EAAG,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAAA,IAC5D;AAAA,EACD;AACD;AAkBO,SAAS,KAAW,SAA8B,MAAyB;AACjF,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI,CAAC,EAAG;AACR,UAAI,MAAM,IAAI,MAAM,IAAO,KAAK;AAChC,iBAAW,KAAK,GAAG;AAClB,cAAM,QAAQ,KAAK,CAAM;AACzB,YAAI,KAAK,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC;AAAA,MACzB;AACA,UAAI,MAAM,IAAI,GAAG;AAAA,IAClB;AAAA,EACD;AACD;AAeO,SAAS,KAAQ,GAA2B;AAClD,SAAO;AAAA,IACN,SAAS;AAAA,IACT,SAAS,EAAE,KAAK,QAAQ,QAAQ,EAAE,GAAG,iBAAiB,GAAG,QAAQ,EAAE,EAAE;AAAA,IACrE,MAAM,CAAC,QAAQ;AACd,UAAI,KAAK,GAAG;AACX,YAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AACvB;AAAA,MACD;AACA,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI,CAAC,EAAG;AACR,UAAI,QAAQ,IAAI,MAAM,IAAY,KAAK;AACvC,UAAI,SAAS,EAAG;AAChB,iBAAW,KAAK,GAAG;AAClB,YAAI,SAAS,EAAG;AAChB,iBAAS;AACT,YAAI,KAAK,SAAS,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAAA,MAClE;AACA,UAAI,MAAM,IAAI,KAAK;AAAA,IACpB;AAAA,EACD;AACD;AAeO,SAAS,qBAAwB,KAA8B,OAAO,IAAoB;AAChG,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI,CAAC,EAAG;AACR,YAAM,OAAO,IAAI,MAAM,IAAc;AACrC,UAAIA,QAAO,MAAM;AACjB,UAAI,UAAU,SAAS;AACvB,iBAAW,KAAK,GAAmB;AAClC,YAAI,WAAW,GAAGA,OAAW,CAAC,EAAG;AACjC,QAAAA,QAAO;AACP,kBAAU;AACV,YAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAAA,MACvB;AACA,UAAI,QAAS,KAAI,MAAM,IAAI,EAAE,GAAGA,MAAU,CAAC;AAAA,IAC5C;AAAA,EACD;AACD;AAeO,SAAS,QAA2B;AAC1C,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,EAAE,SAAS,KAAK;AAAA,IACtB,MAAM,CAAC,QAAQ;AACd,eAAS,IAAI,GAAG,IAAI,SAAS,GAAG,GAAG,KAAK;AACvC,cAAM,IAAI,SAAS,KAAK,CAAC;AACzB,YAAI,KAAK,EAAE,SAAS,GAAG;AACtB,qBAAW,KAAK,EAAG,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAAA,QAC1C;AAAA,MACD;AAAA,IACD;AAAA,EACD;AACD;AAoBO,SAAS,OAAa,SAA8B,MAAyB;AACnF,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,EAAE,0BAA0B,OAAO,qBAAqB,KAAK;AAAA,IACnE,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI,MAAM,IAAI,MAAM,IAAO,KAAK;AAChC,UAAI,EAAG,YAAW,KAAK,EAAG,OAAM,QAAQ,KAAK,CAAM;AACnD,UAAI,MAAM,IAAI,GAAG;AACjB,UAAI,mBAAmB,YAAY,KAAK,CAAC,CAAC,EAAG,KAAI,KAAK,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC;AAAA,IAEpF;AAAA,EACD;AACD;AAMO,SAAS,WAA4C;AAC3D,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI,CAAC,EAAG;AACR,YAAM,KAAK,IAAI,MAAM,IAAiB;AACtC,UAAI,OAAO,IAAI;AACf,UAAI,UAAU,OAAO;AACrB,iBAAW,KAAK,GAAmB;AAClC,YAAI,QAAS,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,MAAW,CAAC,CAAU,CAAC,CAAC;AACzD,eAAO;AACP,kBAAU;AAAA,MACX;AACA,UAAI,QAAS,KAAI,MAAM,IAAI,EAAE,KAAgB,CAAC;AAAA,IAC/C;AAAA,EACD;AACD;AAGO,SAAS,KAAQ,GAA2B;AAClD,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI,CAAC,EAAG;AACR,UAAI,QAAQ,IAAI,MAAM,IAAY,KAAK;AACvC,iBAAW,KAAK,GAAG;AAClB,YAAI,QAAQ,GAAG;AACd,mBAAS;AACT;AAAA,QACD;AACA,YAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAAA,MACvB;AACA,UAAI,MAAM,IAAI,KAAK;AAAA,IACpB;AAAA,EACD;AACD;AAMO,SAAS,UAAa,MAAyC;AACrE,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI,CAAC,EAAG;AACR,iBAAW,KAAK,GAAmB;AAClC,YAAI,KAAK,CAAC,EAAG,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAAA,aAC9B;AACJ,cAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AACvB;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAAA,EACD;AACD;AAQO,SAAS,MAAS,MAA0C;AAClE,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI,CAAC,EAAG;AACR,iBAAW,KAAK,GAAmB;AAClC,YAAI,CAAC,QAAQ,KAAK,CAAC,GAAG;AACrB,cAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;AACpC;AAAA,QACD;AAAA,MACD;AAAA,IAED;AAAA,EACD;AACD;AASO,SAAS,KAAQ,MAA0C;AACjE,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,EAAE,0BAA0B,OAAO,qBAAqB,KAAK;AAAA,IACnE,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI;AAAG,mBAAW,KAAK,EAAG,KAAI,CAAC,QAAQ,KAAK,CAAM,EAAG,KAAI,MAAM,IAAI,EAAE,EAAE,CAAC;AAAA;AACxE,UAAI,mBAAmB,YAAY,KAAK,CAAC,CAAC,GAAG;AAC5C,cAAM,KAAK,IAAI,MAAM,IAAc;AACnC,YAAI,KAAK,KAAK,CAAC,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,MAC9D;AAAA,IACD;AAAA,EACD;AACD;AAOO,SAAS,KAAQ,MAAyC;AAChE,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,EAAE,0BAA0B,OAAO,qBAAqB,KAAK;AAAA,IACnE,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI,GAAG;AACN,mBAAW,KAAK,GAAG;AAClB,cAAI,KAAK,CAAM,GAAG;AACjB,gBAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;AACpC;AAAA,UACD;AAAA,QACD;AAAA,MACD;AACA,UAAI,mBAAmB,YAAY,KAAK,CAAC,CAAC,EAAG,KAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,IACrE;AAAA,EACD;AACD;AAOO,SAAS,UAAa,OAA+B;AAC3D,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,EAAE,0BAA0B,OAAO,qBAAqB,KAAK;AAAA,IACnE,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI,QAAQ,IAAI,MAAM,IAAY,KAAK;AACvC,UAAI,GAAG;AACN,mBAAW,KAAK,GAAG;AAClB,cAAI,UAAU,OAAO;AACpB,gBAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;AACpC;AAAA,UACD;AACA;AAAA,QACD;AACA,YAAI,MAAM,IAAI,KAAK;AAAA,MACpB;AACA,UAAI,mBAAmB,YAAY,KAAK,CAAC,CAAC,EAAG,KAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,IACrE;AAAA,EACD;AACD;AAgBO,SAAS,IAAO,cAAiE;AACvF,MAAI,OAAO,iBAAiB,YAAY;AACvC,UAAM,KAAK;AACX,WAAO;AAAA,MACN,SAAS;AAAA,MACT,MAAM,CAAC,QAAQ;AACd,cAAM,IAAI,SAAS,KAAK,CAAC;AACzB,YAAI;AACH,qBAAW,KAAK,GAAG;AAClB,eAAG,CAAM;AACT,gBAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAAA,UACvB;AAAA,MACF;AAAA,IACD;AAAA,EACD;AACA,QAAM,MAAM;AACZ,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM;AAAA,MACL,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,MACpB,qBAAqB;AAAA,IACtB;AAAA,IACA,MAAM,CAAC,QAAQ;AACd,YAAM,WAAW,YAAY,KAAK,CAAC;AACnC,UAAI,mBAAmB,QAAQ,GAAG;AACjC,YAAI,WAAW;AACf,YAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AACvB;AAAA,MACD;AACA,UAAI,gBAAgB,QAAQ,GAAG;AAC9B,cAAM,MAAM,mBAAmB,QAAQ;AACvC,YAAI,QAAQ,GAAG;AACf,YAAI,KAAK,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC;AACzB;AAAA,MACD;AACA,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI;AACH,mBAAW,KAAK,GAAG;AAClB,cAAI,OAAO,CAAM;AACjB,cAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAAA,QACvB;AAAA,IACF;AAAA,EACD;AACD;AAQO,SAAS,YACf,IACA,MACiB;AACjB,QAAM,QAAQ,MAAM,UAAU,CAAC,MAAS,KAAK;AAC7C,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI,CAAC,EAAG;AACR,UAAI,QAAQ,IAAI,MAAM,IAAa,KAAK;AACxC,iBAAW,KAAK,GAAG;AAClB,YAAI,CAAC,SAAS,MAAM,CAAM,GAAG;AAC5B,kBAAQ;AACR,aAAG,CAAM;AAAA,QACV;AACA,YAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAAA,MACvB;AACA,UAAI,MAAM,IAAI,KAAK;AAAA,IACpB;AAAA,EACD;AACD;AAGO,IAAM,WAAW;AA4BjB,SAAS,OAAU,MAAqC;AAC9D,QAAM,EAAE,YAAY,UAAU,OAAO,IAAI;AACzC,MAAI,CAAC,OAAO,UAAU,UAAU,KAAK,aAAa,GAAG;AACpD,UAAM,IAAI,WAAW,sDAAsD,UAAU,GAAG;AAAA,EACzF;AACA,MAAI,YAAY,SAAS,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW,IAAI;AACtE,UAAM,IAAI,WAAW,6DAA6D,QAAQ,GAAG;AAAA,EAC9F;AACA,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,CAAC,QAAQ;AACd,YAAM,KAAqB,IAAI,MAAM,IAAoB,KAAK;AAAA,QAC7D,MAAM;AAAA,QACN,UAAU;AAAA,QACV,OAAO;AAAA,QACP,OAAO;AAAA,QACP,MAAM;AAAA,MACP;AACA,UAAI,GAAG,KAAM;AACb,SAAG;AACH,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,UAAI,YAAY;AAChB,UAAI,KAAK,EAAE,SAAS,GAAG;AACtB,mBAAW,KAAK,GAAG;AAClB,gBAAM,OAAO;AACb,gBAAM,WAAW,CAAC,GAAG,YAAY,UAAU,QAAQ,CAAC,OAAO,GAAG,MAAW,IAAI;AAC7E,cAAI,SAAU,aAAY;AAC1B,aAAG,OAAO;AACV,aAAG,WAAW;AACd,cAAI,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC;AAAA,QAC1B;AAAA,MACD;AACA,SAAG,QAAQ,YAAY,IAAI,GAAG,QAAQ;AACtC,YAAM,UAAU,GAAG,YAAY,GAAG,SAAS;AAC3C,YAAM,YAAY,YAAY,QAAQ,GAAG,SAAS;AAClD,UAAI,WAAW,WAAW;AACzB,WAAG,OAAO;AACV,YAAI,MAAM,IAAI,EAAE;AAChB,YAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AACvB;AAAA,MACD;AACA,UAAI,MAAM,IAAI,EAAE;AAAA,IAGjB;AAAA,EACD;AACD;AAgBO,SAAS,OAAU,SAA8C;AACvE,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM;AAAA,MACL,oBAAoB;AAAA,MACpB,0BAA0B;AAAA,MAC1B,qBAAqB;AAAA,IACtB;AAAA,IACA,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,YAAM,WAAW,YAAY,KAAK,CAAC;AACnC,UAAI,EAAG,YAAW,KAAK,EAAG,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAChD,UAAI,mBAAmB,QAAQ,GAAG;AACjC,YAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,MACxB,WAAW,gBAAgB,QAAQ,GAAG;AAErC,YAAI;AACH,cAAI,KAAK,CAAC,CAAC,QAAQ,QAAQ,mBAAmB,QAAQ,CAAC,CAAC,CAAC,CAAC;AAAA,QAC3D,SAAS,GAAG;AACX,cAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,4CAA4C,CAAC,CAAC,CAAC;AAAA,QACpF;AAAA,MACD;AAAA,IACD;AAAA,EACD;AACD;AAGO,IAAM,aAAa;AAqBnB,SAAS,MAAS,MAAkC;AAC1D,QAAM,gBAAgB,MAAM;AAC5B,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,EAAE,SAAS,MAAM,0BAA0B,OAAO,qBAAqB,KAAK;AAAA,IAClF,MAAM,CAAC,QAAQ;AACd,YAAM,WAAW,SAAS,KAAK,CAAC;AAChC,YAAM,WAAW,SAAS,KAAK,CAAC;AAChC,YAAM,cAAc,YAAY,KAAK,CAAC;AACtC,YAAM,eAAe,UAAU,KAAK,CAAC;AAErC,UAAI,iBAAiB,MAAM;AAE1B,cAAM,OAAO,IAAI,MAAM,IAAkC;AACzD,YAAI,MAAM,QAAQ,QAAQ,CAAC,cAAc;AACxC,gBAAM,IAAI,OAAO,kBAAkB,aAAa,cAAc,IAAI;AAClE,aAAG,MAAM;AAAA,QACV;AACA,YAAI,MAAM,IAAI;AAAA,UACb,KAAK,iBAAiB,OAAO,OAAO,gBAAgB,OAAO,SAAY;AAAA,QACxE,CAAC;AAAA,MACF;AAGA,UAAI,mBAAmB,WAAW,GAAG;AACpC,YAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AACvB;AAAA,MACD;AACA,UAAI,gBAAgB,WAAW,GAAG;AACjC,YAAI,KAAK,CAAC,CAAC,SAAS,mBAAmB,WAAW,CAAC,CAAC,CAAC;AACrD;AAAA,MACD;AAEA,UAAI,CAAC,aAAc;AAEnB,UAAI,YAAY,SAAS,SAAS,GAAG;AACpC,mBAAW,KAAK,SAAU,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAChD;AAAA,MACD;AAEA,YAAM,YAAY,UAAU,KAAK,CAAC;AAClC,UAAI,YAAY,SAAS,SAAS,KAAK,cAAc,QAAW;AAC/D,YAAI,KAAK,CAAC,CAAC,QAAQ,SAAc,CAAC,CAAC;AAAA,MACpC;AAAA,IACD;AAAA,EACD;AACD;","names":["last"]}

package/dist/chunk-6E76H4OU.js

@@ -0,0 +1,132 @@
+import {
+  depLatest
+} from "./chunk-WQIA3GFB.js";
+
+// src/graph/policies/collection.ts
+var PolicyInputs = class {
+  deps;
+  constructor(initial = []) {
+    this.deps = [...initial];
+  }
+  add(node) {
+    if (node === void 0) return missingPolicyReader();
+    const index = this.deps.push(node) - 1;
+    return policyReader(index);
+  }
+};
+function missingPolicyReader() {
+  return {
+    index: -1,
+    read: (_ctx, current) => current
+  };
+}
+function policyReader(index) {
+  return {
+    index,
+    read(ctx, current) {
+      const latest = depLatest(ctx, index);
+      return latest === void 0 ? current : latest;
+    }
+  };
+}
+function lruKeys(keys) {
+  return {
+    keys: () => keys
+  };
+}
+function trimHeadOverflow(items, config) {
+  const { maxSize } = config;
+  if (maxSize === void 0) return [];
+  if (!Number.isInteger(maxSize) || maxSize < 1)
+    throw new RangeError(`maxSize must be a positive integer (got ${maxSize})`);
+  const size = "size" in config ? config.size : Array.isArray(items) ? items.length : void 0;
+  if (size === void 0) throw new Error("trimHeadOverflow requires size for non-array iterables");
+  const overflow = size - maxSize;
+  if (overflow <= 0) return [];
+  if (Array.isArray(items) && !("size" in config)) return items.splice(0, overflow);
+  const victims = [];
+  for (const item of items) {
+    victims.push(item);
+    if (victims.length === overflow) break;
+  }
+  return victims;
+}
+function deadlines() {
+  return new MinDeadlineHeap();
+}
+var MinDeadlineHeap = class {
+  items = [];
+  get size() {
+    return this.items.length;
+  }
+  push(item) {
+    this.items.push(item);
+    this.up(this.items.length - 1);
+  }
+  peek() {
+    return this.items[0];
+  }
+  pop() {
+    const top = this.items[0];
+    const last = this.items.pop();
+    if (top !== void 0 && last !== void 0 && this.items.length > 0) {
+      this.items[0] = last;
+      this.down(0);
+    }
+    return top;
+  }
+  up(i) {
+    while (i > 0) {
+      const p = i - 1 >> 1;
+      if (this.items[p].expiresAt <= this.items[i].expiresAt)
+        return;
+      [this.items[p], this.items[i]] = [
+        this.items[i],
+        this.items[p]
+      ];
+      i = p;
+    }
+  }
+  down(i) {
+    for (; ; ) {
+      const left = i * 2 + 1;
+      const right = left + 1;
+      let smallest = i;
+      if (left < this.items.length && this.expiresAt(left) < this.expiresAt(smallest))
+        smallest = left;
+      if (right < this.items.length && this.expiresAt(right) < this.expiresAt(smallest))
+        smallest = right;
+      if (smallest === i) return;
+      [this.items[i], this.items[smallest]] = [
+        this.items[smallest],
+        this.items[i]
+      ];
+      i = smallest;
+    }
+  }
+  expiresAt(i) {
+    return this.items[i].expiresAt;
+  }
+};
+function selectRetentionVictims(scoredEntries, config) {
+  const { maxSize } = config;
+  if (maxSize === void 0) return [];
+  if (!Number.isInteger(maxSize) || maxSize < 0)
+    throw new RangeError(`retention maxSize must be a non-negative integer (got ${maxSize})`);
+  const overflow = scoredEntries.length - maxSize;
+  if (overflow <= 0) return [];
+  return scoredEntries.map((item, index) => {
+    if (!Number.isFinite(item.score))
+      throw new RangeError(`retention score must be finite (got ${item.score})`);
+    return { ...item, index };
+  }).sort((a, b) => a.score - b.score || a.index - b.index).slice(0, overflow).map((item) => item.entry);
+}
+
+export {
+  PolicyInputs,
+  lruKeys,
+  trimHeadOverflow,
+  deadlines,
+  selectRetentionVictims
+};
+//# sourceMappingURL=chunk-6E76H4OU.js.map

package/dist/chunk-6E76H4OU.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/graph/policies/collection.ts"],"sourcesContent":["/**\n * Internal graph-layer policy helpers (D70).\n *\n * This module is deliberately NOT exported from the package index. It centralizes policy plumbing\n * shared by collection structures while each structure still owns backend mutation + delta emission\n * in its apply/mutation path (D60/D61/D68/D69).\n */\n\nimport { type Ctx, depLatest } from \"../../ctx/types.js\";\nimport type { Node } from \"../../node/node.js\";\n\nexport type PolicyOpt<T> = T | Node<T>;\n\nexport interface PolicyReader<T> {\n\treadonly index: number;\n\tread(ctx: Ctx, current: T | undefined): T | undefined;\n}\n\nexport class PolicyInputs {\n\treadonly deps: Node<unknown>[];\n\n\tconstructor(initial: readonly Node<unknown>[] = []) {\n\t\tthis.deps = [...initial];\n\t}\n\n\tadd<T>(node: Node<T> | undefined): PolicyReader<T> {\n\t\tif (node === undefined) return missingPolicyReader<T>();\n\t\tconst index = this.deps.push(node as Node<unknown>) - 1;\n\t\treturn policyReader<T>(index);\n\t}\n}\n\nfunction missingPolicyReader<T>(): PolicyReader<T> {\n\treturn {\n\t\tindex: -1,\n\t\tread: (_ctx, current) => current,\n\t};\n}\n\nfunction policyReader<T>(index: number): PolicyReader<T> {\n\treturn {\n\t\tindex,\n\t\tread(ctx, current) {\n\t\t\tconst latest = depLatest(ctx, index);\n\t\t\treturn latest === undefined ? current : (latest as T);\n\t\t},\n\t};\n}\n\nexport interface KeyOrderPolicy<K> {\n\tkeys(): Iterable<K>;\n}\n\nexport function lruKeys<K>(keys: Iterable<K>): KeyOrderPolicy<K> {\n\treturn {\n\t\tkeys: () => keys,\n\t};\n}\n\nexport interface CapacityConfig {\n\treadonly maxSize?: number;\n}\n\nexport interface SizedCapacityConfig extends CapacityConfig {\n\treadonly size: number;\n}\n\nexport function trimHeadOverflow<T>(items: T[], config: CapacityConfig): T[];\nexport function trimHeadOverflow<T>(items: Iterable<T>, config: SizedCapacityConfig): T[];\nexport function trimHeadOverflow<T>(\n\titems: T[] | Iterable<T>,\n\tconfig: CapacityConfig | SizedCapacityConfig,\n): T[] {\n\tconst { maxSize } = config;\n\tif (maxSize === undefined) return [];\n\tif (!Number.isInteger(maxSize) || maxSize < 1)\n\t\tthrow new RangeError(`maxSize must be a positive integer (got ${maxSize})`);\n\n\tconst size = \"size\" in config ? config.size : Array.isArray(items) ? items.length : undefined;\n\tif (size === undefined) throw new Error(\"trimHeadOverflow requires size for non-array iterables\");\n\tconst overflow = size - maxSize;\n\tif (overflow <= 0) return [];\n\n\tif (Array.isArray(items) && !(\"size\" in config)) return items.splice(0, overflow);\n\n\tconst victims: T[] = [];\n\tfor (const item of items) {\n\t\tvictims.push(item);\n\t\tif (victims.length === overflow) break;\n\t}\n\treturn victims;\n}\n\nexport interface DeadlineEntry<K> {\n\treadonly key: K;\n\treadonly expiresAt: number;\n}\n\nexport interface DeadlinePolicy<K> {\n\treadonly size: number;\n\tpush(item: DeadlineEntry<K>): void;\n\tpeek(): DeadlineEntry<K> | undefined;\n\tpop(): DeadlineEntry<K> | undefined;\n}\n\nexport function deadlines<K>(): DeadlinePolicy<K> {\n\treturn new MinDeadlineHeap<K>();\n}\n\nclass MinDeadlineHeap<K> implements DeadlinePolicy<K> {\n\tprivate readonly items: DeadlineEntry<K>[] = [];\n\n\tget size(): number {\n\t\treturn this.items.length;\n\t}\n\n\tpush(item: DeadlineEntry<K>): void {\n\t\tthis.items.push(item);\n\t\tthis.up(this.items.length - 1);\n\t}\n\n\tpeek(): DeadlineEntry<K> | undefined {\n\t\treturn this.items[0];\n\t}\n\n\tpop(): DeadlineEntry<K> | undefined {\n\t\tconst top = this.items[0];\n\t\tconst last = this.items.pop();\n\t\tif (top !== undefined && last !== undefined && this.items.length > 0) {\n\t\t\tthis.items[0] = last;\n\t\t\tthis.down(0);\n\t\t}\n\t\treturn top;\n\t}\n\n\tprivate up(i: number): void {\n\t\twhile (i > 0) {\n\t\t\tconst p = (i - 1) >> 1;\n\t\t\tif (\n\t\t\t\t(this.items[p] as DeadlineEntry<K>).expiresAt <=\n\t\t\t\t(this.items[i] as DeadlineEntry<K>).expiresAt\n\t\t\t)\n\t\t\t\treturn;\n\t\t\t[this.items[p], this.items[i]] = [\n\t\t\t\tthis.items[i] as DeadlineEntry<K>,\n\t\t\t\tthis.items[p] as DeadlineEntry<K>,\n\t\t\t];\n\t\t\ti = p;\n\t\t}\n\t}\n\n\tprivate down(i: number): void {\n\t\tfor (;;) {\n\t\t\tconst left = i * 2 + 1;\n\t\t\tconst right = left + 1;\n\t\t\tlet smallest = i;\n\t\t\tif (left < this.items.length && this.expiresAt(left) < this.expiresAt(smallest))\n\t\t\t\tsmallest = left;\n\t\t\tif (right < this.items.length && this.expiresAt(right) < this.expiresAt(smallest))\n\t\t\t\tsmallest = right;\n\t\t\tif (smallest === i) return;\n\t\t\t[this.items[i], this.items[smallest]] = [\n\t\t\t\tthis.items[smallest] as DeadlineEntry<K>,\n\t\t\t\tthis.items[i] as DeadlineEntry<K>,\n\t\t\t];\n\t\t\ti = smallest;\n\t\t}\n\t}\n\n\tprivate expiresAt(i: number): number {\n\t\treturn (this.items[i] as DeadlineEntry<K>).expiresAt;\n\t}\n}\n\nexport interface ScoredEntry<T> {\n\treadonly entry: T;\n\treadonly score: number;\n}\n\nexport interface RetentionSelectionConfig {\n\treadonly maxSize?: number;\n}\n\nexport function selectRetentionVictims<T>(\n\tscoredEntries: readonly ScoredEntry<T>[],\n\tconfig: RetentionSelectionConfig,\n): T[] {\n\tconst { maxSize } = config;\n\tif (maxSize === undefined) return [];\n\tif (!Number.isInteger(maxSize) || maxSize < 0)\n\t\tthrow new RangeError(`retention maxSize must be a non-negative integer (got ${maxSize})`);\n\tconst overflow = scoredEntries.length - maxSize;\n\tif (overflow <= 0) return [];\n\n\treturn scoredEntries\n\t\t.map((item, index) => {\n\t\t\tif (!Number.isFinite(item.score))\n\t\t\t\tthrow new RangeError(`retention score must be finite (got ${item.score})`);\n\t\t\treturn { ...item, index };\n\t\t})\n\t\t.sort((a, b) => a.score - b.score || a.index - b.index)\n\t\t.slice(0, overflow)\n\t\t.map((item) => item.entry);\n}\n"],"mappings":";;;;;AAkBO,IAAM,eAAN,MAAmB;AAAA,EAChB;AAAA,EAET,YAAY,UAAoC,CAAC,GAAG;AACnD,SAAK,OAAO,CAAC,GAAG,OAAO;AAAA,EACxB;AAAA,EAEA,IAAO,MAA4C;AAClD,QAAI,SAAS,OAAW,QAAO,oBAAuB;AACtD,UAAM,QAAQ,KAAK,KAAK,KAAK,IAAqB,IAAI;AACtD,WAAO,aAAgB,KAAK;AAAA,EAC7B;AACD;AAEA,SAAS,sBAA0C;AAClD,SAAO;AAAA,IACN,OAAO;AAAA,IACP,MAAM,CAAC,MAAM,YAAY;AAAA,EAC1B;AACD;AAEA,SAAS,aAAgB,OAAgC;AACxD,SAAO;AAAA,IACN;AAAA,IACA,KAAK,KAAK,SAAS;AAClB,YAAM,SAAS,UAAU,KAAK,KAAK;AACnC,aAAO,WAAW,SAAY,UAAW;AAAA,IAC1C;AAAA,EACD;AACD;AAMO,SAAS,QAAW,MAAsC;AAChE,SAAO;AAAA,IACN,MAAM,MAAM;AAAA,EACb;AACD;AAYO,SAAS,iBACf,OACA,QACM;AACN,QAAM,EAAE,QAAQ,IAAI;AACpB,MAAI,YAAY,OAAW,QAAO,CAAC;AACnC,MAAI,CAAC,OAAO,UAAU,OAAO,KAAK,UAAU;AAC3C,UAAM,IAAI,WAAW,2CAA2C,OAAO,GAAG;AAE3E,QAAM,OAAO,UAAU,SAAS,OAAO,OAAO,MAAM,QAAQ,KAAK,IAAI,MAAM,SAAS;AACpF,MAAI,SAAS,OAAW,OAAM,IAAI,MAAM,wDAAwD;AAChG,QAAM,WAAW,OAAO;AACxB,MAAI,YAAY,EAAG,QAAO,CAAC;AAE3B,MAAI,MAAM,QAAQ,KAAK,KAAK,EAAE,UAAU,QAAS,QAAO,MAAM,OAAO,GAAG,QAAQ;AAEhF,QAAM,UAAe,CAAC;AACtB,aAAW,QAAQ,OAAO;AACzB,YAAQ,KAAK,IAAI;AACjB,QAAI,QAAQ,WAAW,SAAU;AAAA,EAClC;AACA,SAAO;AACR;AAcO,SAAS,YAAkC;AACjD,SAAO,IAAI,gBAAmB;AAC/B;AAEA,IAAM,kBAAN,MAAsD;AAAA,EACpC,QAA4B,CAAC;AAAA,EAE9C,IAAI,OAAe;AAClB,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA,EAEA,KAAK,MAA8B;AAClC,SAAK,MAAM,KAAK,IAAI;AACpB,SAAK,GAAG,KAAK,MAAM,SAAS,CAAC;AAAA,EAC9B;AAAA,EAEA,OAAqC;AACpC,WAAO,KAAK,MAAM,CAAC;AAAA,EACpB;AAAA,EAEA,MAAoC;AACnC,UAAM,MAAM,KAAK,MAAM,CAAC;AACxB,UAAM,OAAO,KAAK,MAAM,IAAI;AAC5B,QAAI,QAAQ,UAAa,SAAS,UAAa,KAAK,MAAM,SAAS,GAAG;AACrE,WAAK,MAAM,CAAC,IAAI;AAChB,WAAK,KAAK,CAAC;AAAA,IACZ;AACA,WAAO;AAAA,EACR;AAAA,EAEQ,GAAG,GAAiB;AAC3B,WAAO,IAAI,GAAG;AACb,YAAM,IAAK,IAAI,KAAM;AACrB,UACE,KAAK,MAAM,CAAC,EAAuB,aACnC,KAAK,MAAM,CAAC,EAAuB;AAEpC;AACD,OAAC,KAAK,MAAM,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,IAAI;AAAA,QAChC,KAAK,MAAM,CAAC;AAAA,QACZ,KAAK,MAAM,CAAC;AAAA,MACb;AACA,UAAI;AAAA,IACL;AAAA,EACD;AAAA,EAEQ,KAAK,GAAiB;AAC7B,eAAS;AACR,YAAM,OAAO,IAAI,IAAI;AACrB,YAAM,QAAQ,OAAO;AACrB,UAAI,WAAW;AACf,UAAI,OAAO,KAAK,MAAM,UAAU,KAAK,UAAU,IAAI,IAAI,KAAK,UAAU,QAAQ;AAC7E,mBAAW;AACZ,UAAI,QAAQ,KAAK,MAAM,UAAU,KAAK,UAAU,KAAK,IAAI,KAAK,UAAU,QAAQ;AAC/E,mBAAW;AACZ,UAAI,aAAa,EAAG;AACpB,OAAC,KAAK,MAAM,CAAC,GAAG,KAAK,MAAM,QAAQ,CAAC,IAAI;AAAA,QACvC,KAAK,MAAM,QAAQ;AAAA,QACnB,KAAK,MAAM,CAAC;AAAA,MACb;AACA,UAAI;AAAA,IACL;AAAA,EACD;AAAA,EAEQ,UAAU,GAAmB;AACpC,WAAQ,KAAK,MAAM,CAAC,EAAuB;AAAA,EAC5C;AACD;AAWO,SAAS,uBACf,eACA,QACM;AACN,QAAM,EAAE,QAAQ,IAAI;AACpB,MAAI,YAAY,OAAW,QAAO,CAAC;AACnC,MAAI,CAAC,OAAO,UAAU,OAAO,KAAK,UAAU;AAC3C,UAAM,IAAI,WAAW,yDAAyD,OAAO,GAAG;AACzF,QAAM,WAAW,cAAc,SAAS;AACxC,MAAI,YAAY,EAAG,QAAO,CAAC;AAE3B,SAAO,cACL,IAAI,CAAC,MAAM,UAAU;AACrB,QAAI,CAAC,OAAO,SAAS,KAAK,KAAK;AAC9B,YAAM,IAAI,WAAW,uCAAuC,KAAK,KAAK,GAAG;AAC1E,WAAO,EAAE,GAAG,MAAM,MAAM;AAAA,EACzB,CAAC,EACA,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EACrD,MAAM,GAAG,QAAQ,EACjB,IAAI,CAAC,SAAS,KAAK,KAAK;AAC3B;","names":[]}