@callable-recharge/callbag-recharge 0.1.0

package/dist/extra/empty.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/extra/empty.ts","../../src/core/protocol.ts","../../src/core/inspector.ts","../../src/core/producer.ts"],"sourcesContent":["import { producer } from \"../core/producer\";\nimport type { ProducerStore } from \"../core/types\";\n\n/**\n * Creates a source that completes immediately without emitting any values.\n *\n * Stateful: get() always returns undefined — no values are ever emitted.\n *\n * v3: Tier 2 Producer — sends END immediately on start. Tests validate\n * that END propagation works with no preceding DATA.\n */\nexport function empty<T = never>(): ProducerStore<T> {\n\treturn producer<T>(({ complete }) => {\n\t\tcomplete();\n\t\treturn undefined;\n\t});\n}\n","// ---------------------------------------------------------------------------\n// Protocol — v3 type 3 control channel\n// ---------------------------------------------------------------------------\n// Type 3 (STATE) carries control signals: DIRTY, RESOLVED\n// Type 1 (DATA) carries only real values — never sentinels\n// ---------------------------------------------------------------------------\n\n/** Control signal: \"my value is about to change\" */\nexport const DIRTY = Symbol(\"DIRTY\");\n\n/** Control signal: \"I was dirty but my value didn't change\" */\nexport const RESOLVED = Symbol(\"RESOLVED\");\n\nexport type Signal = typeof DIRTY | typeof RESOLVED;\n\n/** Node status — tracks current lifecycle state (v4) */\nexport type NodeStatus =\n\t| \"DISCONNECTED\"\n\t| \"DIRTY\"\n\t| \"SETTLED\"\n\t| \"RESOLVED\"\n\t| \"COMPLETED\"\n\t| \"ERRORED\";\n\n// ---------------------------------------------------------------------------\n// Integer status constants — pack into _flags for hot-path performance.\n// 3 bits (7-9) encode 6 statuses. Use STATUS_MASK to read/write.\n// ---------------------------------------------------------------------------\nexport const S_DISCONNECTED = 0;\nexport const S_DIRTY = 1;\nexport const S_SETTLED = 2;\nexport const S_RESOLVED = 3;\nexport const S_COMPLETED = 4;\nexport const S_ERRORED = 5;\nexport const STATUS_SHIFT = 7;\nexport const STATUS_MASK = 0b111 << STATUS_SHIFT; // bits 7-9\n\nconst STATUS_STRINGS: NodeStatus[] = [\n\t\"DISCONNECTED\",\n\t\"DIRTY\",\n\t\"SETTLED\",\n\t\"RESOLVED\",\n\t\"COMPLETED\",\n\t\"ERRORED\",\n];\n\n/** Decode integer status bits back to string (for Inspector / tests) */\nexport function decodeStatus(flags: number): NodeStatus {\n\treturn STATUS_STRINGS[(flags & STATUS_MASK) >>> STATUS_SHIFT];\n}\n\n/** Callbag signal types */\nexport const START = 0;\nexport const DATA = 1;\nexport const END = 2;\nexport const STATE = 3;\n\n// ---------------------------------------------------------------------------\n// Batch — defers type 1 value emissions; type 3 DIRTY propagates immediately\n// ---------------------------------------------------------------------------\n\nlet batchDepth = 0;\nconst deferredEmissions: Array<() => void> = [];\n\n// `draining` prevents re-entrant drain when a nested batch() call ends while\n// the outer drain loop is already running. Without it, the inner batch's\n// finally block would see batchDepth===0 and start a second drain, racing the\n// outer loop — potentially double-processing items or clearing the array mid-\n// iteration. With draining=true, the inner batch skips its drain; any items it\n// pushes are picked up by the outer loop (the `for` condition re-evaluates\n// `deferredEmissions.length` on every iteration, so appends during drain are\n// naturally included in the same pass).\nlet draining = false;\n\nexport function batch<T>(fn: () => T): T {\n\tbatchDepth++;\n\ttry {\n\t\treturn fn();\n\t} finally {\n\t\tbatchDepth--;\n\t\tif (batchDepth === 0 && !draining) {\n\t\t\tdraining = true;\n\t\t\tfor (let i = 0; i < deferredEmissions.length; i++) {\n\t\t\t\tdeferredEmissions[i]();\n\t\t\t}\n\t\t\tdeferredEmissions.length = 0;\n\t\t\tdraining = false;\n\t\t}\n\t}\n}\n\nexport function isBatching(): boolean {\n\treturn batchDepth > 0;\n}\n\nexport function deferEmission(fn: () => void): void {\n\tdeferredEmissions.push(fn);\n}\n\n// ---------------------------------------------------------------------------\n// Connection batching (producer start deferral) — unchanged from v2\n// ---------------------------------------------------------------------------\n\nlet connectDepth = 0;\nconst pendingStarts: Array<() => void> = [];\n\nexport function beginDeferredStart(): void {\n\tconnectDepth++;\n}\n\nexport function endDeferredStart(): void {\n\tconnectDepth--;\n\tif (connectDepth === 0) {\n\t\tfor (let i = 0; i < pendingStarts.length; i++) {\n\t\t\tpendingStarts[i]();\n\t\t}\n\t\tpendingStarts.length = 0;\n\t}\n}\n\nexport function deferStart(start: () => void): void {\n\tif (connectDepth > 0) {\n\t\tpendingStarts.push(start);\n\t} else {\n\t\tstart();\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// teardown — protocol-level graph destruction\n// ---------------------------------------------------------------------------\n// Sends END to all downstream sinks of a store node, cascading through the\n// entire subgraph. After teardown, the node is in COMPLETED state and won't\n// accept new values or subscriptions.\n//\n// Works with any node that uses the output slot model:\n// - ProducerImpl / StateImpl / OperatorImpl → calls .complete()\n// - DerivedImpl → calls ._handleEnd() (no public complete() on derived)\n// ---------------------------------------------------------------------------\n\nexport function teardown(store: { source: (type: number, payload?: any) => void }): void {\n\tconst node = store as any;\n\tif (typeof node.complete === \"function\") {\n\t\tnode.complete();\n\t} else if (typeof node._handleEnd === \"function\") {\n\t\tnode._handleEnd(undefined);\n\t}\n}\n","// ---------------------------------------------------------------------------\n// Inspector — static class for observability\n// ---------------------------------------------------------------------------\n// All debug metadata lives here in WeakMaps, not on the store objects.\n// Stores stay lean. Inspector is opt-in overhead.\n//\n// v5: Zero intrusion into primitives. No hooks in hot paths. All methods\n// are static — call directly as Inspector.observe(), Inspector.tap(), etc.\n// - register/registerEdge: metadata collection (called from constructors)\n// - inspect/graph/dumpGraph/snapshot: read-only graph queries\n// - observe/spy/trace: callbag sinks for debugging (subscribe externally)\n// - tap: transparent passthrough wrapper for graph visualization\n// ---------------------------------------------------------------------------\n\nimport type { NodeStatus, Signal } from \"./protocol\";\nimport { DATA, DIRTY, END, RESOLVED, START, STATE } from \"./protocol\";\nimport type { Store } from \"./types\";\n\nexport interface StoreInfo<T = unknown> {\n\tname: string | undefined;\n\tkind: string;\n\tvalue: T;\n\t/** v4: node lifecycle status */\n\tstatus: NodeStatus | undefined;\n}\n\nexport interface ObserveResult<T> {\n\t/** All DATA (type 1) values received, in order */\n\tvalues: T[];\n\t/** All STATE (type 3) payloads received (DIRTY, RESOLVED, or unknown) */\n\tsignals: Signal[];\n\t/** All events in protocol order: { type, data } */\n\tevents: Array<{ type: \"data\" | \"signal\" | \"end\"; data: unknown }>;\n\t/** Whether END (type 2) has been received */\n\tended: boolean;\n\t/** Error payload from END, if any */\n\tendError: unknown;\n\t/** Count of DIRTY signals received */\n\tdirtyCount: number;\n\t/** Count of RESOLVED signals received */\n\tresolvedCount: number;\n\t/** Store name (from Inspector, if registered) */\n\tname: string | undefined;\n\t/** Disconnect the observer */\n\tdispose: () => void;\n}\n\n// Static-only class is intentional API for Inspector namespace\n// biome-ignore lint/complexity/noStaticOnlyClass: public API surface\nexport class Inspector {\n\t// WeakMaps for metadata — keyed by any graph node (stores, effects, etc.)\n\tprivate static _names = new WeakMap<object, string>();\n\tprivate static _kinds = new WeakMap<object, string>();\n\tprivate static _keys = new WeakMap<object, string>();\n\n\t// WeakRef set for graph() — allows GC of unused nodes\n\tprivate static _stores = new Set<WeakRef<object>>();\n\n\t// Dependency edges: parent key → child keys\n\tprivate static _edges = new Map<string, string[]>();\n\n\t// Unique key generation\n\tprivate static _nextId = 0;\n\tprivate static _usedKeys = new Set<string>();\n\n\t// Enabled flag — when false, register/getName are no-ops\n\tprivate static _explicitEnabled: boolean | null = null;\n\tprivate static _cachedDefault: boolean | null = null;\n\n\tstatic get enabled(): boolean {\n\t\tif (Inspector._explicitEnabled !== null) return Inspector._explicitEnabled;\n\t\tif (Inspector._cachedDefault !== null) return Inspector._cachedDefault;\n\t\ttry {\n\t\t\tInspector._cachedDefault = (globalThis as any).process?.env?.NODE_ENV !== \"production\";\n\t\t} catch {\n\t\t\tInspector._cachedDefault = true;\n\t\t}\n\t\treturn Inspector._cachedDefault;\n\t}\n\n\tstatic set enabled(value: boolean) {\n\t\tInspector._explicitEnabled = value;\n\t}\n\n\t/** Compute a dep-name-based suffix for unique key generation */\n\tprivate static _depSuffix(deps?: object[]): string | undefined {\n\t\tif (!deps?.length) return undefined;\n\t\tconst names = deps.map((d) => Inspector._names.get(d) ?? \"?\");\n\t\tconst joined = names.join(\",\");\n\t\treturn joined.length > 40 ? `${joined.slice(0, 37)}...` : joined;\n\t}\n\n\t/** Resolve a node to its unique graph key */\n\tprivate static _resolveKey(node: object): string {\n\t\treturn Inspector._keys.get(node) ?? Inspector._names.get(node) ?? \"anonymous\";\n\t}\n\n\t/** Register a graph node (store, effect, etc.) with the inspector */\n\tstatic register(node: object, opts?: { name?: string; kind?: string; deps?: object[] }): void {\n\t\tif (!Inspector.enabled) return;\n\t\tif (opts?.name) Inspector._names.set(node, opts.name);\n\t\tif (opts?.kind) Inspector._kinds.set(node, opts.kind);\n\n\t\t// Compute unique key\n\t\tconst id = Inspector._nextId++;\n\t\tlet key = opts?.name;\n\t\tif (key && !Inspector._usedKeys.has(key)) {\n\t\t\t// Unique name — use as-is\n\t\t} else if (key) {\n\t\t\t// Name collision — differentiate with dep names or ID\n\t\t\tconst depSuffix = Inspector._depSuffix(opts?.deps);\n\t\t\tkey = depSuffix ? `${key}(${depSuffix})` : `${key}_${id}`;\n\t\t\tif (Inspector._usedKeys.has(key)) key = `${key}_${id}`;\n\t\t} else {\n\t\t\t// Unnamed — use kind + dep names or ID\n\t\t\tconst kind = opts?.kind ?? \"store\";\n\t\t\tconst depSuffix = Inspector._depSuffix(opts?.deps);\n\t\t\tkey = depSuffix ? `${kind}(${depSuffix})` : `${kind}_${id}`;\n\t\t\tif (Inspector._usedKeys.has(key)) key = `${key}_${id}`;\n\t\t}\n\n\t\tInspector._usedKeys.add(key);\n\t\tInspector._keys.set(node, key);\n\t\tInspector._stores.add(new WeakRef(node));\n\t}\n\n\t/** Register a dependency edge between parent and child nodes */\n\tstatic registerEdge(parent: object, child: object): void {\n\t\tif (!Inspector.enabled) return;\n\t\tconst parentKey = Inspector._resolveKey(parent);\n\t\tconst childKey = Inspector._resolveKey(child);\n\t\tconst children = Inspector._edges.get(parentKey);\n\t\tif (children) {\n\t\t\tif (!children.includes(childKey)) children.push(childKey);\n\t\t} else {\n\t\t\tInspector._edges.set(parentKey, [childKey]);\n\t\t}\n\t}\n\n\t/** Get dependency edges: parent → children */\n\tstatic getEdges(): Map<string, string[]> {\n\t\treturn new Map(Inspector._edges);\n\t}\n\n\t/** Get the name of a node */\n\tstatic getName(node: object): string | undefined {\n\t\tif (!Inspector.enabled) return undefined;\n\t\treturn Inspector._names.get(node);\n\t}\n\n\t/** Get the kind of a node */\n\tstatic getKind(node: object): string | undefined {\n\t\treturn Inspector._kinds.get(node);\n\t}\n\n\t/** Inspect a single graph node — includes status and value (if available) */\n\tstatic inspect<T = unknown>(node: object): StoreInfo<T> {\n\t\treturn {\n\t\t\tname: Inspector._names.get(node),\n\t\t\tkind: Inspector._kinds.get(node) ?? \"unknown\",\n\t\t\tvalue: (typeof (node as any).get === \"function\" ? (node as any).get() : undefined) as T,\n\t\t\tstatus: (node as any)._status,\n\t\t};\n\t}\n\n\t/** Get all living nodes as a Map. Also prunes dead edges from GC'd nodes. */\n\tstatic graph(): Map<string, StoreInfo> {\n\t\tconst result = new Map<string, StoreInfo>();\n\t\tconst livingKeys = new Set<string>();\n\t\tfor (const ref of Inspector._stores) {\n\t\t\tconst node = ref.deref();\n\t\t\tif (!node) {\n\t\t\t\tInspector._stores.delete(ref); // cleanup GC'd refs\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst key = Inspector._resolveKey(node);\n\t\t\tlivingKeys.add(key);\n\t\t\tresult.set(key, Inspector.inspect(node));\n\t\t}\n\t\t// Prune edges referencing GC'd stores\n\t\tfor (const [key, children] of Inspector._edges) {\n\t\t\tif (!livingKeys.has(key)) {\n\t\t\t\tInspector._edges.delete(key);\n\t\t\t\tInspector._usedKeys.delete(key);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst alive = children.filter((c) => livingKeys.has(c));\n\t\t\tif (alive.length === 0) {\n\t\t\t\tInspector._edges.delete(key);\n\t\t\t} else if (alive.length !== children.length) {\n\t\t\t\tInspector._edges.set(key, alive);\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\t/** Trace a specific store's value changes (raw callbag — no extra/ dependency) */\n\tstatic trace<T>(store: Store<T>, cb: (value: T, prev: T | undefined) => void): () => void {\n\t\tlet talkback: ((type: number) => void) | null = null;\n\t\tlet prev: T | undefined = store.get();\n\t\tstore.source(START, (type: number, data: any) => {\n\t\t\tif (type === START) talkback = data;\n\t\t\tif (type === END) {\n\t\t\t\ttalkback = null;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (type === 1) {\n\t\t\t\tconst next = data as T;\n\t\t\t\tif (!Object.is(next, prev)) {\n\t\t\t\t\tconst p = prev;\n\t\t\t\t\tprev = next;\n\t\t\t\t\tcb(next, p);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\treturn () => talkback?.(END);\n\t}\n\n\t/** Pretty-print the entire store graph for console/CLI debugging */\n\tstatic dumpGraph(): string {\n\t\tconst g = Inspector.graph();\n\t\tconst edges = Inspector.getEdges();\n\n\t\t// Build reverse map: child key → parent keys (deps)\n\t\tconst depsMap = new Map<string, string[]>();\n\t\tfor (const [parent, children] of edges) {\n\t\t\tfor (const child of children) {\n\t\t\t\tconst deps = depsMap.get(child);\n\t\t\t\tif (deps) {\n\t\t\t\t\tif (!deps.includes(parent)) deps.push(parent);\n\t\t\t\t} else {\n\t\t\t\t\tdepsMap.set(child, [parent]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tconst lines: string[] = [];\n\t\tfor (const [key, info] of g) {\n\t\t\tconst deps = depsMap.get(key);\n\t\t\tconst children = edges.get(key);\n\t\t\tconst depsStr = deps?.length ? `  ← [${deps.join(\", \")}]` : \"\";\n\t\t\tconst childStr = children?.length ? `  → [${children.join(\", \")}]` : \"\";\n\t\t\tlines.push(\n\t\t\t\t`  ${key} (${info.kind}) = ${JSON.stringify(info.value)}  [${info.status ?? \"?\"}]${depsStr}${childStr}`,\n\t\t\t);\n\t\t}\n\t\tconst header = `Store Graph (${g.size} nodes):`;\n\t\treturn [header, ...lines].join(\"\\n\");\n\t}\n\n\t/**\n\t * Internal observe implementation shared by observe() and spy().\n\t */\n\tprivate static _observe<T>(\n\t\tstore: Store<T>,\n\t\tlabel?: string,\n\t\tlog?: (...args: any[]) => void,\n\t): ObserveResult<T> {\n\t\tlet talkback: ((type: number) => void) | null = null;\n\t\tconst name = label ?? Inspector.getName(store);\n\t\tconst result: ObserveResult<T> = {\n\t\t\tvalues: [],\n\t\t\tsignals: [],\n\t\t\tevents: [],\n\t\t\tended: false,\n\t\t\tendError: undefined,\n\t\t\tdirtyCount: 0,\n\t\t\tresolvedCount: 0,\n\t\t\tname,\n\t\t\tdispose: () => talkback?.(END),\n\t\t};\n\n\t\tstore.source(START, (type: number, data: any) => {\n\t\t\tif (type === START) {\n\t\t\t\ttalkback = data;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (type === DATA) {\n\t\t\t\tresult.values.push(data);\n\t\t\t\tresult.events.push({ type: \"data\", data });\n\t\t\t\tif (log) log(`[${name}] DATA:`, data);\n\t\t\t} else if (type === STATE) {\n\t\t\t\tresult.signals.push(data);\n\t\t\t\tresult.events.push({ type: \"signal\", data });\n\t\t\t\tif (data === DIRTY) result.dirtyCount++;\n\t\t\t\telse if (data === RESOLVED) result.resolvedCount++;\n\t\t\t\tif (log) log(`[${name}] STATE:`, data);\n\t\t\t} else if (type === END) {\n\t\t\t\tresult.ended = true;\n\t\t\t\tresult.endError = data;\n\t\t\t\tresult.events.push({ type: \"end\", data });\n\t\t\t\tif (log) log(`[${name}] END`, data !== undefined ? data : \"\");\n\t\t\t\ttalkback = null;\n\t\t\t}\n\t\t});\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Observe a store's full callbag protocol — the test-friendly alternative\n\t * to hooks. Captures DATA values, STATE signals, END, and provides\n\t * convenience accessors.\n\t *\n\t * Returns a live observation object — arrays grow as the store emits.\n\t *\n\t * ```ts\n\t * const obs = Inspector.observe(myStore);\n\t * myState.set(5);\n\t * obs.values       // [5]\n\t * obs.signals       // [DIRTY]\n\t * obs.ended         // false\n\t * obs.dirtyCount    // 1\n\t * obs.dispose()     // stop observing\n\t * ```\n\t */\n\tstatic observe<T>(store: Store<T>): ObserveResult<T> {\n\t\treturn Inspector._observe(store);\n\t}\n\n\t/**\n\t * Create a transparent passthrough wrapper for graph visualization.\n\t * The wrapper delegates `get()` and `source()` to the original store,\n\t * appearing as a distinct node in the Inspector graph. Zero overhead —\n\t * subscribers connect directly to the original store's source.\n\t */\n\tstatic tap<T>(store: Store<T>, name?: string): Store<T> {\n\t\tconst tapName = name ?? `tap(${Inspector.getName(store) ?? \"anon\"})`;\n\t\tconst wrapper: Store<T> = {\n\t\t\tget: () => store.get(),\n\t\t\tsource: store.source,\n\t\t};\n\t\tInspector.register(wrapper, { name: tapName, kind: \"tap\" });\n\t\tInspector.registerEdge(store, wrapper);\n\t\treturn wrapper;\n\t}\n\n\t/**\n\t * Enhanced observe() with logging — for interactive debugging.\n\t * Returns the same observation object as observe(), but also logs each\n\t * event as it happens. Pass a custom logger or defaults to console.log.\n\t */\n\tstatic spy<T>(\n\t\tstore: Store<T>,\n\t\topts?: { name?: string; log?: (...args: any[]) => void },\n\t): ObserveResult<T> {\n\t\tconst label = opts?.name ?? Inspector.getName(store) ?? \"spy\";\n\t\tconst log = opts?.log ?? console.log;\n\t\treturn Inspector._observe(store, label, log);\n\t}\n\n\t/**\n\t * JSON-serializable snapshot of the entire graph — nodes + edges.\n\t * Designed for AI consumption during debugging sessions.\n\t */\n\tstatic snapshot(): {\n\t\tnodes: Array<{ name: string; kind: string; value: unknown; status: string | undefined }>;\n\t\tedges: Array<{ from: string; to: string }>;\n\t} {\n\t\tconst g = Inspector.graph();\n\t\tconst edgeMap = Inspector.getEdges();\n\t\tconst nodes: Array<{ name: string; kind: string; value: unknown; status: string | undefined }> =\n\t\t\t[];\n\t\tfor (const [key, info] of g) {\n\t\t\tnodes.push({ name: key, kind: info.kind, value: info.value, status: info.status });\n\t\t}\n\t\tconst edges: Array<{ from: string; to: string }> = [];\n\t\tfor (const [parent, children] of edgeMap) {\n\t\t\tfor (const child of children) {\n\t\t\t\tedges.push({ from: parent, to: child });\n\t\t\t}\n\t\t}\n\t\treturn { nodes, edges };\n\t}\n\n\t/** Reset all state (for testing) */\n\tstatic _reset(): void {\n\t\tInspector._names = new WeakMap<object, string>();\n\t\tInspector._kinds = new WeakMap<object, string>();\n\t\tInspector._keys = new WeakMap<object, string>();\n\t\tInspector._stores = new Set<WeakRef<object>>();\n\t\tInspector._edges = new Map();\n\t\tInspector._usedKeys = new Set();\n\t\tInspector._nextId = 0;\n\t\tInspector._explicitEnabled = null;\n\t\tInspector._cachedDefault = null;\n\t}\n}\n","/**\n * General-purpose source primitive. Can emit values, send control signals,\n * complete, and error. Lazy start on first sink, auto-cleanup on last\n * sink disconnect.\n *\n * Stateful: maintains currentValue. get() returns currentValue (or\n * getter(currentValue) when getter option is provided).\n *\n * v4: Output slot model replaces _sinks Set. _output is null (no sinks),\n * a function (single sink — P0 optimization), or a Set (multi sink).\n * _status tracks node lifecycle. autoDirty (default true) sends DIRTY on\n * type 3 before each type 1 DATA. equals option guards emit();\n * resetOnTeardown resets value on stop.\n *\n * v5: _status packed into _flags bits 7-9 for hot-path performance.\n * String status exposed via getter for Inspector/test backward compat.\n *\n * Class-based for V8 hidden class optimization and prototype method sharing.\n * Boolean fields packed into _flags bitmask to reduce hidden class size.\n */\n\nimport { Inspector } from \"./inspector\";\nimport type { Signal } from \"./protocol\";\nimport {\n\tDATA,\n\tDIRTY,\n\tdecodeStatus,\n\tdeferEmission,\n\tdeferStart,\n\tEND,\n\tisBatching,\n\tRESOLVED,\n\tS_COMPLETED,\n\tS_DIRTY,\n\tS_DISCONNECTED,\n\tS_ERRORED,\n\tS_RESOLVED,\n\tS_SETTLED,\n\tSTART,\n\tSTATE,\n\tSTATUS_MASK,\n\tSTATUS_SHIFT,\n} from \"./protocol\";\nimport type { ProducerStore, SourceOptions, Store } from \"./types\";\n\nexport type ProducerFn<T> = (actions: {\n\temit: (value: T) => void;\n\tsignal: (s: Signal) => void;\n\tcomplete: () => void;\n\terror: (e: unknown) => void;\n}) => (() => void) | undefined;\n\nexport type ProducerOpts<T> = SourceOptions<T> & {\n\tautoDirty?: boolean;\n\t_skipInspect?: boolean;\n};\n\n// Flag bits for _flags bitmask (bits 0-6)\nconst P_STARTED = 1;\nconst P_MULTI = 64;\n\n// Exported for subclass fast paths (StateImpl)\nexport const P_COMPLETED = 2;\nexport const P_AUTO_DIRTY = 4;\nconst P_RESET = 8;\nconst P_RESUB = 16;\nexport const P_PENDING = 32;\n\n// Status bits (bits 7-9) — exported for StateImpl fast path\nexport const _STATUS_MASK = STATUS_MASK;\nexport const _S_DIRTY = S_DIRTY << STATUS_SHIFT;\nexport const _S_SETTLED = S_SETTLED << STATUS_SHIFT;\nexport const _S_DISCONNECTED = S_DISCONNECTED << STATUS_SHIFT;\nexport const _S_COMPLETED = S_COMPLETED << STATUS_SHIFT;\nexport const _S_ERRORED = S_ERRORED << STATUS_SHIFT;\nexport const _S_RESOLVED = S_RESOLVED << STATUS_SHIFT;\n\nexport class ProducerImpl<T> {\n\t_value: T | undefined;\n\t_output: ((type: number, data?: any) => void) | Set<any> | null = null;\n\t_flags: number;\n\n\tget _status() {\n\t\treturn decodeStatus(this._flags);\n\t}\n\t_cleanup: (() => void) | undefined;\n\t_fn: ProducerFn<T> | undefined;\n\t_eqFn: ((a: T, b: T) => boolean) | undefined;\n\t_getterFn: ((cached: T | undefined) => T) | undefined;\n\t_initial: T | undefined;\n\n\tconstructor(fn?: ProducerFn<T>, opts?: ProducerOpts<T>) {\n\t\tthis._value = opts?.initial;\n\t\tthis._fn = fn;\n\t\tthis._eqFn = opts?.equals;\n\t\tthis._getterFn = opts?.getter;\n\t\tthis._initial = opts?.initial;\n\n\t\tlet flags = 0;\n\t\tif (opts?.autoDirty !== false) flags |= P_AUTO_DIRTY;\n\t\tif (opts?.resetOnTeardown) flags |= P_RESET;\n\t\tif (opts?.resubscribable) flags |= P_RESUB;\n\t\t// S_DISCONNECTED = 0, so no need to set status bits\n\t\tthis._flags = flags;\n\n\t\t// Bind public API methods so they work when detached (callbag interop,\n\t\t// destructuring, etc.). Replaces per-instance closure functions.\n\t\tthis.source = this.source.bind(this);\n\t\tthis.emit = this.emit.bind(this);\n\t\tthis.signal = this.signal.bind(this);\n\t\tthis.complete = this.complete.bind(this);\n\t\tthis.error = this.error.bind(this);\n\n\t\tif (!opts?._skipInspect) Inspector.register(this as any, { kind: \"producer\", ...opts });\n\t}\n\n\tget(): T | undefined {\n\t\treturn this._getterFn ? this._getterFn(this._value) : this._value;\n\t}\n\n\t/**\n\t * Dispatch a signal to all current subscribers via the output slot.\n\t *\n\t * Safety: P_MULTI flag and _output type are always updated together.\n\t * No reentrancy can occur between the two assignments (source() doesn't\n\t * trigger dispatch, and dispatch doesn't trigger source()). The null-check\n\t * provides an additional guard for the MULTI→null transition path.\n\t */\n\t_dispatch(type: number, data?: any): void {\n\t\tconst output = this._output;\n\t\tif (!output) return;\n\t\tif (this._flags & P_MULTI) {\n\t\t\tfor (const sink of output as Set<any>) sink(type, data);\n\t\t} else {\n\t\t\t(output as (type: number, data?: any) => void)(type, data);\n\t\t}\n\t}\n\n\temit(value: T): void {\n\t\tif (this._flags & P_COMPLETED) return;\n\t\tif (this._eqFn && this._value !== undefined && this._eqFn(this._value as T, value)) return;\n\t\tthis._value = value;\n\t\tif (!this._output) return;\n\t\tif (isBatching()) {\n\t\t\tif (!(this._flags & P_PENDING)) {\n\t\t\t\tthis._flags |= P_PENDING;\n\t\t\t\tif (this._flags & P_AUTO_DIRTY) {\n\t\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_DIRTY;\n\t\t\t\t\tthis._dispatch(STATE, DIRTY);\n\t\t\t\t}\n\t\t\t\tdeferEmission(() => {\n\t\t\t\t\tthis._flags &= ~P_PENDING;\n\t\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_SETTLED;\n\t\t\t\t\tthis._dispatch(DATA, this._value);\n\t\t\t\t});\n\t\t\t}\n\t\t} else {\n\t\t\tif (this._flags & P_AUTO_DIRTY) {\n\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_DIRTY;\n\t\t\t\tthis._dispatch(STATE, DIRTY);\n\t\t\t}\n\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_SETTLED;\n\t\t\tthis._dispatch(DATA, this._value);\n\t\t}\n\t}\n\n\tsignal(s: Signal): void {\n\t\tif (this._flags & P_COMPLETED || !this._output) return;\n\t\tif (s === DIRTY) this._flags = (this._flags & ~_STATUS_MASK) | _S_DIRTY;\n\t\telse if (s === RESOLVED) this._flags = (this._flags & ~_STATUS_MASK) | _S_RESOLVED;\n\t\t// Unknown signals: dispatch without _status change (v4 forward-compat)\n\t\tthis._dispatch(STATE, s);\n\t}\n\n\tcomplete(): void {\n\t\tif (this._flags & P_COMPLETED) return;\n\t\tthis._flags = ((this._flags | P_COMPLETED) & ~_STATUS_MASK) | _S_COMPLETED;\n\t\tconst output = this._output;\n\t\tconst wasMulti = this._flags & P_MULTI;\n\t\tthis._output = null;\n\t\tthis._flags &= ~P_MULTI;\n\t\tthis._stop();\n\t\tif (output) {\n\t\t\tif (wasMulti) {\n\t\t\t\tfor (const sink of output as Set<any>) sink(END);\n\t\t\t} else {\n\t\t\t\t(output as (type: number, data?: any) => void)(END);\n\t\t\t}\n\t\t}\n\t}\n\n\terror(e: unknown): void {\n\t\tif (this._flags & P_COMPLETED) return;\n\t\tthis._flags = ((this._flags | P_COMPLETED) & ~_STATUS_MASK) | _S_ERRORED;\n\t\tconst output = this._output;\n\t\tconst wasMulti = this._flags & P_MULTI;\n\t\tthis._output = null;\n\t\tthis._flags &= ~P_MULTI;\n\t\tthis._stop();\n\t\tif (output) {\n\t\t\tif (wasMulti) {\n\t\t\t\tfor (const sink of output as Set<any>) sink(END, e);\n\t\t\t} else {\n\t\t\t\t(output as (type: number, data?: any) => void)(END, e);\n\t\t\t}\n\t\t}\n\t}\n\n\t_start(): void {\n\t\tif (this._flags & P_STARTED || !this._fn) return;\n\t\tthis._flags |= P_STARTED;\n\t\tconst result = this._fn(this as any);\n\t\tthis._cleanup = typeof result === \"function\" ? result : undefined;\n\t}\n\n\t_stop(): void {\n\t\tif (!(this._flags & P_STARTED)) return;\n\t\tthis._flags &= ~P_STARTED;\n\t\tif (this._cleanup) this._cleanup();\n\t\tthis._cleanup = undefined;\n\t\tif (this._flags & P_RESET) this._value = this._initial;\n\t\tif (!(this._flags & P_COMPLETED)) this._flags = (this._flags & ~_STATUS_MASK) | _S_DISCONNECTED;\n\t}\n\n\tsource(type: number, payload?: any): void {\n\t\tif (type === START) {\n\t\t\tconst sink = payload;\n\t\t\tif (this._flags & P_COMPLETED) {\n\t\t\t\tif (this._flags & P_RESUB && this._output === null) {\n\t\t\t\t\tthis._flags = (this._flags & ~(P_COMPLETED | _STATUS_MASK)) | _S_DISCONNECTED;\n\t\t\t\t} else {\n\t\t\t\t\tsink(START, (_t: number) => {});\n\t\t\t\t\tsink(END);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (this._output === null) {\n\t\t\t\tthis._output = sink;\n\t\t\t} else if (!(this._flags & P_MULTI)) {\n\t\t\t\tconst set = new Set<any>();\n\t\t\t\tset.add(this._output);\n\t\t\t\tset.add(sink);\n\t\t\t\tthis._output = set;\n\t\t\t\tthis._flags |= P_MULTI;\n\t\t\t} else {\n\t\t\t\t(this._output as Set<any>).add(sink);\n\t\t\t}\n\t\t\tsink(START, (t: number) => {\n\t\t\t\tif (t === DATA) sink(DATA, this._value);\n\t\t\t\tif (t === END) {\n\t\t\t\t\tif (this._output === null) return;\n\t\t\t\t\tif (this._flags & P_MULTI) {\n\t\t\t\t\t\tconst set = this._output as Set<any>;\n\t\t\t\t\t\tset.delete(sink);\n\t\t\t\t\t\tif (set.size === 1) {\n\t\t\t\t\t\t\tthis._output = set.values().next().value;\n\t\t\t\t\t\t\tthis._flags &= ~P_MULTI;\n\t\t\t\t\t\t} else if (set.size === 0) {\n\t\t\t\t\t\t\tthis._output = null;\n\t\t\t\t\t\t\tthis._flags &= ~P_MULTI;\n\t\t\t\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_DISCONNECTED;\n\t\t\t\t\t\t\tthis._stop();\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (this._output === sink) {\n\t\t\t\t\t\tthis._output = null;\n\t\t\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_DISCONNECTED;\n\t\t\t\t\t\tthis._stop();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\t\tdeferStart(() => this._start());\n\t\t}\n\t}\n}\n\nexport function producer<T>(\n\tfn: ProducerFn<T> | undefined,\n\topts: ProducerOpts<T> & { initial: T },\n): ProducerStore<T> & Store<T>;\nexport function producer<T>(fn?: ProducerFn<T>, opts?: ProducerOpts<T>): ProducerStore<T>;\nexport function producer<T>(fn?: ProducerFn<T>, opts?: ProducerOpts<T>): ProducerStore<T> {\n\treturn new ProducerImpl<T>(fn, opts) as any;\n}\n"],"mappings":"yaAAA,IAAAA,GAAA,GAAAC,EAAAD,GAAA,WAAAE,KAAA,eAAAC,EAAAH,ICQO,IAAMI,EAAQ,OAAO,OAAO,EAGtBC,EAAW,OAAO,UAAU,EAiB5BC,EAAiB,EACjBC,EAAU,EACVC,EAAY,EACZC,EAAa,EACbC,EAAc,EACdC,EAAY,EACZC,EAAe,EACfC,EAAc,GAASD,EAE9BE,EAA+B,CACpC,eACA,QACA,UACA,WACA,YACA,SACD,EAGO,SAASC,EAAaC,EAA2B,CACvD,OAAOF,GAAgBE,EAAQH,KAAiBD,CAAY,CAC7D,CAGO,IAAMK,EAAQ,EACRC,EAAO,EACPC,EAAM,EACNC,EAAQ,EAMjBC,EAAa,EACXC,EAAuC,CAAC,EA6BvC,SAASC,GAAsB,CACrC,OAAOC,EAAa,CACrB,CAEO,SAASC,EAAcC,EAAsB,CACnDC,EAAkB,KAAKD,CAAE,CAC1B,CAMA,IAAIE,GAAe,EACbC,GAAmC,CAAC,EAgBnC,SAASC,EAAWC,EAAyB,CAC/CC,GAAe,EAClBC,GAAc,KAAKF,CAAK,EAExBA,EAAM,CAER,CC7EO,IAAMG,EAAN,MAAMC,CAAU,CAEtB,OAAe,OAAS,IAAI,QAC5B,OAAe,OAAS,IAAI,QAC5B,OAAe,MAAQ,IAAI,QAG3B,OAAe,QAAU,IAAI,IAG7B,OAAe,OAAS,IAAI,IAG5B,OAAe,QAAU,EACzB,OAAe,UAAY,IAAI,IAG/B,OAAe,iBAAmC,KAClD,OAAe,eAAiC,KAEhD,WAAW,SAAmB,CAC7B,GAAIA,EAAU,mBAAqB,KAAM,OAAOA,EAAU,iBAC1D,GAAIA,EAAU,iBAAmB,KAAM,OAAOA,EAAU,eACxD,GAAI,CACHA,EAAU,eAAkB,WAAmB,SAAS,KAAK,WAAa,YAC3E,MAAQ,CACPA,EAAU,eAAiB,EAC5B,CACA,OAAOA,EAAU,cAClB,CAEA,WAAW,QAAQC,EAAgB,CAClCD,EAAU,iBAAmBC,CAC9B,CAGA,OAAe,WAAWC,EAAqC,CAC9D,GAAI,CAACA,GAAM,OAAQ,OAEnB,IAAMC,EADQD,EAAK,IAAKE,GAAMJ,EAAU,OAAO,IAAII,CAAC,GAAK,GAAG,EACvC,KAAK,GAAG,EAC7B,OAAOD,EAAO,OAAS,GAAK,GAAGA,EAAO,MAAM,EAAG,EAAE,CAAC,MAAQA,CAC3D,CAGA,OAAe,YAAYE,EAAsB,CAChD,OAAOL,EAAU,MAAM,IAAIK,CAAI,GAAKL,EAAU,OAAO,IAAIK,CAAI,GAAK,WACnE,CAGA,OAAO,SAASA,EAAcC,EAAgE,CAC7F,GAAI,CAACN,EAAU,QAAS,OACpBM,GAAM,MAAMN,EAAU,OAAO,IAAIK,EAAMC,EAAK,IAAI,EAChDA,GAAM,MAAMN,EAAU,OAAO,IAAIK,EAAMC,EAAK,IAAI,EAGpD,IAAMC,EAAKP,EAAU,UACjBQ,EAAMF,GAAM,KAChB,GAAI,EAAAE,GAAO,CAACR,EAAU,UAAU,IAAIQ,CAAG,GAEhC,GAAIA,EAAK,CAEf,IAAMC,EAAYT,EAAU,WAAWM,GAAM,IAAI,EACjDE,EAAMC,EAAY,GAAGD,CAAG,IAAIC,CAAS,IAAM,GAAGD,CAAG,IAAID,CAAE,GACnDP,EAAU,UAAU,IAAIQ,CAAG,IAAGA,EAAM,GAAGA,CAAG,IAAID,CAAE,GACrD,KAAO,CAEN,IAAMG,EAAOJ,GAAM,MAAQ,QACrBG,EAAYT,EAAU,WAAWM,GAAM,IAAI,EACjDE,EAAMC,EAAY,GAAGC,CAAI,IAAID,CAAS,IAAM,GAAGC,CAAI,IAAIH,CAAE,GACrDP,EAAU,UAAU,IAAIQ,CAAG,IAAGA,EAAM,GAAGA,CAAG,IAAID,CAAE,GACrD,CAEAP,EAAU,UAAU,IAAIQ,CAAG,EAC3BR,EAAU,MAAM,IAAIK,EAAMG,CAAG,EAC7BR,EAAU,QAAQ,IAAI,IAAI,QAAQK,CAAI,CAAC,CACxC,CAGA,OAAO,aAAaM,EAAgBC,EAAqB,CACxD,GAAI,CAACZ,EAAU,QAAS,OACxB,IAAMa,EAAYb,EAAU,YAAYW,CAAM,EACxCG,EAAWd,EAAU,YAAYY,CAAK,EACtCG,EAAWf,EAAU,OAAO,IAAIa,CAAS,EAC3CE,EACEA,EAAS,SAASD,CAAQ,GAAGC,EAAS,KAAKD,CAAQ,EAExDd,EAAU,OAAO,IAAIa,EAAW,CAACC,CAAQ,CAAC,CAE5C,CAGA,OAAO,UAAkC,CACxC,OAAO,IAAI,IAAId,EAAU,MAAM,CAChC,CAGA,OAAO,QAAQK,EAAkC,CAChD,GAAKL,EAAU,QACf,OAAOA,EAAU,OAAO,IAAIK,CAAI,CACjC,CAGA,OAAO,QAAQA,EAAkC,CAChD,OAAOL,EAAU,OAAO,IAAIK,CAAI,CACjC,CAGA,OAAO,QAAqBA,EAA4B,CACvD,MAAO,CACN,KAAML,EAAU,OAAO,IAAIK,CAAI,EAC/B,KAAML,EAAU,OAAO,IAAIK,CAAI,GAAK,UACpC,MAAQ,OAAQA,EAAa,KAAQ,WAAcA,EAAa,IAAI,EAAI,OACxE,OAASA,EAAa,OACvB,CACD,CAGA,OAAO,OAAgC,CACtC,IAAMW,EAAS,IAAI,IACbC,EAAa,IAAI,IACvB,QAAWC,KAAOlB,EAAU,QAAS,CACpC,IAAMK,EAAOa,EAAI,MAAM,EACvB,GAAI,CAACb,EAAM,CACVL,EAAU,QAAQ,OAAOkB,CAAG,EAC5B,QACD,CACA,IAAMV,EAAMR,EAAU,YAAYK,CAAI,EACtCY,EAAW,IAAIT,CAAG,EAClBQ,EAAO,IAAIR,EAAKR,EAAU,QAAQK,CAAI,CAAC,CACxC,CAEA,OAAW,CAACG,EAAKO,CAAQ,IAAKf,EAAU,OAAQ,CAC/C,GAAI,CAACiB,EAAW,IAAIT,CAAG,EAAG,CACzBR,EAAU,OAAO,OAAOQ,CAAG,EAC3BR,EAAU,UAAU,OAAOQ,CAAG,EAC9B,QACD,CACA,IAAMW,EAAQJ,EAAS,OAAQK,GAAMH,EAAW,IAAIG,CAAC,CAAC,EAClDD,EAAM,SAAW,EACpBnB,EAAU,OAAO,OAAOQ,CAAG,EACjBW,EAAM,SAAWJ,EAAS,QACpCf,EAAU,OAAO,IAAIQ,EAAKW,CAAK,CAEjC,CACA,OAAOH,CACR,CAGA,OAAO,MAASK,EAAiBC,EAAyD,CACzF,IAAIC,EAA4C,KAC5CC,EAAsBH,EAAM,IAAI,EACpC,OAAAA,EAAM,OAAOI,EAAO,CAACC,EAAcC,IAAc,CAEhD,GADID,IAASD,IAAOF,EAAWI,GAC3BD,IAASE,EAAK,CACjBL,EAAW,KACX,MACD,CACA,GAAIG,IAAS,EAAG,CACf,IAAMG,EAAOF,EACb,GAAI,CAAC,OAAO,GAAGE,EAAML,CAAI,EAAG,CAC3B,IAAMM,EAAIN,EACVA,EAAOK,EACPP,EAAGO,EAAMC,CAAC,CACX,CACD,CACD,CAAC,EACM,IAAMP,IAAWK,CAAG,CAC5B,CAGA,OAAO,WAAoB,CAC1B,IAAMG,EAAI/B,EAAU,MAAM,EACpBgC,EAAQhC,EAAU,SAAS,EAG3BiC,EAAU,IAAI,IACpB,OAAW,CAACtB,EAAQI,CAAQ,IAAKiB,EAChC,QAAWpB,KAASG,EAAU,CAC7B,IAAMb,EAAO+B,EAAQ,IAAIrB,CAAK,EAC1BV,EACEA,EAAK,SAASS,CAAM,GAAGT,EAAK,KAAKS,CAAM,EAE5CsB,EAAQ,IAAIrB,EAAO,CAACD,CAAM,CAAC,CAE7B,CAGD,IAAMuB,EAAkB,CAAC,EACzB,OAAW,CAAC1B,EAAK2B,CAAI,IAAKJ,EAAG,CAC5B,IAAM7B,EAAO+B,EAAQ,IAAIzB,CAAG,EACtBO,EAAWiB,EAAM,IAAIxB,CAAG,EACxB4B,EAAUlC,GAAM,OAAS,aAAQA,EAAK,KAAK,IAAI,CAAC,IAAM,GACtDmC,EAAWtB,GAAU,OAAS,aAAQA,EAAS,KAAK,IAAI,CAAC,IAAM,GACrEmB,EAAM,KACL,KAAK1B,CAAG,KAAK2B,EAAK,IAAI,OAAO,KAAK,UAAUA,EAAK,KAAK,CAAC,MAAMA,EAAK,QAAU,GAAG,IAAIC,CAAO,GAAGC,CAAQ,EACtG,CACD,CAEA,MAAO,CADQ,gBAAgBN,EAAE,IAAI,WACrB,GAAGG,CAAK,EAAE,KAAK;AAAA,CAAI,CACpC,CAKA,OAAe,SACdb,EACAiB,EACAC,EACmB,CACnB,IAAIhB,EAA4C,KAC1CiB,EAAOF,GAAStC,EAAU,QAAQqB,CAAK,EACvCL,EAA2B,CAChC,OAAQ,CAAC,EACT,QAAS,CAAC,EACV,OAAQ,CAAC,EACT,MAAO,GACP,SAAU,OACV,WAAY,EACZ,cAAe,EACf,KAAAwB,EACA,QAAS,IAAMjB,IAAWK,CAAG,CAC9B,EAEA,OAAAP,EAAM,OAAOI,EAAO,CAACC,EAAcC,IAAc,CAChD,GAAID,IAASD,EAAO,CACnBF,EAAWI,EACX,MACD,CACID,IAASe,GACZzB,EAAO,OAAO,KAAKW,CAAI,EACvBX,EAAO,OAAO,KAAK,CAAE,KAAM,OAAQ,KAAAW,CAAK,CAAC,EACrCY,GAAKA,EAAI,IAAIC,CAAI,UAAWb,CAAI,GAC1BD,IAASgB,GACnB1B,EAAO,QAAQ,KAAKW,CAAI,EACxBX,EAAO,OAAO,KAAK,CAAE,KAAM,SAAU,KAAAW,CAAK,CAAC,EACvCA,IAASgB,EAAO3B,EAAO,aAClBW,IAASiB,GAAU5B,EAAO,gBAC/BuB,GAAKA,EAAI,IAAIC,CAAI,WAAYb,CAAI,GAC3BD,IAASE,IACnBZ,EAAO,MAAQ,GACfA,EAAO,SAAWW,EAClBX,EAAO,OAAO,KAAK,CAAE,KAAM,MAAO,KAAAW,CAAK,CAAC,EACpCY,GAAKA,EAAI,IAAIC,CAAI,QAASb,IAAS,OAAYA,EAAO,EAAE,EAC5DJ,EAAW,KAEb,CAAC,EAEMP,CACR,CAmBA,OAAO,QAAWK,EAAmC,CACpD,OAAOrB,EAAU,SAASqB,CAAK,CAChC,CAQA,OAAO,IAAOA,EAAiBmB,EAAyB,CACvD,IAAMK,EAAUL,GAAQ,OAAOxC,EAAU,QAAQqB,CAAK,GAAK,MAAM,IAC3DyB,EAAoB,CACzB,IAAK,IAAMzB,EAAM,IAAI,EACrB,OAAQA,EAAM,MACf,EACA,OAAArB,EAAU,SAAS8C,EAAS,CAAE,KAAMD,EAAS,KAAM,KAAM,CAAC,EAC1D7C,EAAU,aAAaqB,EAAOyB,CAAO,EAC9BA,CACR,CAOA,OAAO,IACNzB,EACAf,EACmB,CACnB,IAAMgC,EAAQhC,GAAM,MAAQN,EAAU,QAAQqB,CAAK,GAAK,MAClDkB,EAAMjC,GAAM,KAAO,QAAQ,IACjC,OAAON,EAAU,SAASqB,EAAOiB,EAAOC,CAAG,CAC5C,CAMA,OAAO,UAGL,CACD,IAAMR,EAAI/B,EAAU,MAAM,EACpB+C,EAAU/C,EAAU,SAAS,EAC7BgD,EACL,CAAC,EACF,OAAW,CAACxC,EAAK2B,CAAI,IAAKJ,EACzBiB,EAAM,KAAK,CAAE,KAAMxC,EAAK,KAAM2B,EAAK,KAAM,MAAOA,EAAK,MAAO,OAAQA,EAAK,MAAO,CAAC,EAElF,IAAMH,EAA6C,CAAC,EACpD,OAAW,CAACrB,EAAQI,CAAQ,IAAKgC,EAChC,QAAWnC,KAASG,EACnBiB,EAAM,KAAK,CAAE,KAAMrB,EAAQ,GAAIC,CAAM,CAAC,EAGxC,MAAO,CAAE,MAAAoC,EAAO,MAAAhB,CAAM,CACvB,CAGA,OAAO,QAAe,CACrBhC,EAAU,OAAS,IAAI,QACvBA,EAAU,OAAS,IAAI,QACvBA,EAAU,MAAQ,IAAI,QACtBA,EAAU,QAAU,IAAI,IACxBA,EAAU,OAAS,IAAI,IACvBA,EAAU,UAAY,IAAI,IAC1BA,EAAU,QAAU,EACpBA,EAAU,iBAAmB,KAC7BA,EAAU,eAAiB,IAC5B,CACD,ECzUA,IAAMiD,EAAY,EACZC,EAAU,GAGHC,EAAc,EACdC,EAAe,EACtBC,EAAU,EACVC,EAAU,GACHC,EAAY,GAGZC,EAAeC,EACfC,EAAWC,GAAWC,EACtBC,EAAaC,GAAaF,EAC1BG,EAAkBC,GAAkBJ,EACpCK,GAAeC,GAAeN,EAC9BO,GAAaC,GAAaR,EAC1BS,GAAcC,GAAcV,EAE5BW,EAAN,KAAsB,CAC5B,OACA,QAAkE,KAClE,OAEA,IAAI,SAAU,CACb,OAAOC,EAAa,KAAK,MAAM,CAChC,CACA,SACA,IACA,MACA,UACA,SAEA,YAAYC,EAAoBC,EAAwB,CACvD,KAAK,OAASA,GAAM,QACpB,KAAK,IAAMD,EACX,KAAK,MAAQC,GAAM,OACnB,KAAK,UAAYA,GAAM,OACvB,KAAK,SAAWA,GAAM,QAEtB,IAAIC,EAAQ,EACRD,GAAM,YAAc,KAAOC,GAASvB,GACpCsB,GAAM,kBAAiBC,GAAStB,GAChCqB,GAAM,iBAAgBC,GAASrB,GAEnC,KAAK,OAASqB,EAId,KAAK,OAAS,KAAK,OAAO,KAAK,IAAI,EACnC,KAAK,KAAO,KAAK,KAAK,KAAK,IAAI,EAC/B,KAAK,OAAS,KAAK,OAAO,KAAK,IAAI,EACnC,KAAK,SAAW,KAAK,SAAS,KAAK,IAAI,EACvC,KAAK,MAAQ,KAAK,MAAM,KAAK,IAAI,EAE5BD,GAAM,cAAcE,EAAU,SAAS,KAAa,CAAE,KAAM,WAAY,GAAGF,CAAK,CAAC,CACvF,CAEA,KAAqB,CACpB,OAAO,KAAK,UAAY,KAAK,UAAU,KAAK,MAAM,EAAI,KAAK,MAC5D,CAUA,UAAUG,EAAcC,EAAkB,CACzC,IAAMC,EAAS,KAAK,QACpB,GAAKA,EACL,GAAI,KAAK,OAAS7B,EACjB,QAAW8B,KAAQD,EAAoBC,EAAKH,EAAMC,CAAI,OAErDC,EAA8CF,EAAMC,CAAI,CAE3D,CAEA,KAAKG,EAAgB,CAChB,KAAK,OAAS9B,GACd,KAAK,OAAS,KAAK,SAAW,QAAa,KAAK,MAAM,KAAK,OAAa8B,CAAK,IACjF,KAAK,OAASA,EACT,KAAK,UACNC,EAAW,EACR,KAAK,OAAS3B,IACnB,KAAK,QAAUA,EACX,KAAK,OAASH,IACjB,KAAK,OAAU,KAAK,OAAS,CAACI,EAAgBE,EAC9C,KAAK,UAAUyB,EAAOC,CAAK,GAE5BC,EAAc,IAAM,CACnB,KAAK,QAAU,CAAC9B,EAChB,KAAK,OAAU,KAAK,OAAS,CAACC,EAAgBK,EAC9C,KAAK,UAAUyB,EAAM,KAAK,MAAM,CACjC,CAAC,IAGE,KAAK,OAASlC,IACjB,KAAK,OAAU,KAAK,OAAS,CAACI,EAAgBE,EAC9C,KAAK,UAAUyB,EAAOC,CAAK,GAE5B,KAAK,OAAU,KAAK,OAAS,CAAC5B,EAAgBK,EAC9C,KAAK,UAAUyB,EAAM,KAAK,MAAM,IAElC,CAEA,OAAOC,EAAiB,CACnB,KAAK,OAASpC,GAAe,CAAC,KAAK,UACnCoC,IAAMH,EAAO,KAAK,OAAU,KAAK,OAAS,CAAC5B,EAAgBE,EACtD6B,IAAMC,IAAU,KAAK,OAAU,KAAK,OAAS,CAAChC,EAAgBa,IAEvE,KAAK,UAAUc,EAAOI,CAAC,EACxB,CAEA,UAAiB,CAChB,GAAI,KAAK,OAASpC,EAAa,OAC/B,KAAK,QAAW,KAAK,OAASA,GAAe,CAACK,EAAgBS,GAC9D,IAAMc,EAAS,KAAK,QACdU,EAAW,KAAK,OAASvC,EAI/B,GAHA,KAAK,QAAU,KACf,KAAK,QAAU,CAACA,EAChB,KAAK,MAAM,EACP6B,EACH,GAAIU,EACH,QAAWT,KAAQD,EAAoBC,EAAKU,CAAG,OAE9CX,EAA8CW,CAAG,CAGrD,CAEA,MAAM,EAAkB,CACvB,GAAI,KAAK,OAASvC,EAAa,OAC/B,KAAK,QAAW,KAAK,OAASA,GAAe,CAACK,EAAgBW,GAC9D,IAAMY,EAAS,KAAK,QACdU,EAAW,KAAK,OAASvC,EAI/B,GAHA,KAAK,QAAU,KACf,KAAK,QAAU,CAACA,EAChB,KAAK,MAAM,EACP6B,EACH,GAAIU,EACH,QAAWT,KAAQD,EAAoBC,EAAKU,EAAK,CAAC,OAEjDX,EAA8CW,EAAK,CAAC,CAGxD,CAEA,QAAe,CACd,GAAI,KAAK,OAASzC,GAAa,CAAC,KAAK,IAAK,OAC1C,KAAK,QAAUA,EACf,IAAM0C,EAAS,KAAK,IAAI,IAAW,EACnC,KAAK,SAAW,OAAOA,GAAW,WAAaA,EAAS,MACzD,CAEA,OAAc,CACP,KAAK,OAAS1C,IACpB,KAAK,QAAU,CAACA,EACZ,KAAK,UAAU,KAAK,SAAS,EACjC,KAAK,SAAW,OACZ,KAAK,OAASI,IAAS,KAAK,OAAS,KAAK,UACxC,KAAK,OAASF,IAAc,KAAK,OAAU,KAAK,OAAS,CAACK,EAAgBO,GACjF,CAEA,OAAOc,EAAce,EAAqB,CACzC,GAAIf,IAASgB,EAAO,CACnB,IAAMb,EAAOY,EACb,GAAI,KAAK,OAASzC,EACjB,GAAI,KAAK,OAASG,GAAW,KAAK,UAAY,KAC7C,KAAK,OAAU,KAAK,OAAS,EAAEH,EAAcK,GAAiBO,MACxD,CACNiB,EAAKa,EAAQC,GAAe,CAAC,CAAC,EAC9Bd,EAAKU,CAAG,EACR,MACD,CAED,GAAI,KAAK,UAAY,KACpB,KAAK,QAAUV,UACH,KAAK,OAAS9B,EAOzB,KAAK,QAAqB,IAAI8B,CAAI,MAPC,CACpC,IAAMe,EAAM,IAAI,IAChBA,EAAI,IAAI,KAAK,OAAO,EACpBA,EAAI,IAAIf,CAAI,EACZ,KAAK,QAAUe,EACf,KAAK,QAAU7C,CAChB,CAGA8B,EAAKa,EAAQG,GAAc,CAE1B,GADIA,IAAMV,GAAMN,EAAKM,EAAM,KAAK,MAAM,EAClCU,IAAMN,EAAK,CACd,GAAI,KAAK,UAAY,KAAM,OAC3B,GAAI,KAAK,OAASxC,EAAS,CAC1B,IAAM6C,EAAM,KAAK,QACjBA,EAAI,OAAOf,CAAI,EACXe,EAAI,OAAS,GAChB,KAAK,QAAUA,EAAI,OAAO,EAAE,KAAK,EAAE,MACnC,KAAK,QAAU,CAAC7C,GACN6C,EAAI,OAAS,IACvB,KAAK,QAAU,KACf,KAAK,QAAU,CAAC7C,EAChB,KAAK,OAAU,KAAK,OAAS,CAACM,EAAgBO,EAC9C,KAAK,MAAM,EAEb,MAAW,KAAK,UAAYiB,IAC3B,KAAK,QAAU,KACf,KAAK,OAAU,KAAK,OAAS,CAACxB,EAAgBO,EAC9C,KAAK,MAAM,EAEb,CACD,CAAC,EACDkC,EAAW,IAAM,KAAK,OAAO,CAAC,CAC/B,CACD,CACD,EAOO,SAASC,EAAYzB,EAAoBC,EAA0C,CACzF,OAAO,IAAIH,EAAgBE,EAAIC,CAAI,CACpC,CH/QO,SAASyB,IAAqC,CACpD,OAAOC,EAAY,CAAC,CAAE,SAAAC,CAAS,IAAM,CACpCA,EAAS,CAEV,CAAC,CACF","names":["empty_exports","__export","empty","__toCommonJS","DIRTY","RESOLVED","S_DISCONNECTED","S_DIRTY","S_SETTLED","S_RESOLVED","S_COMPLETED","S_ERRORED","STATUS_SHIFT","STATUS_MASK","STATUS_STRINGS","decodeStatus","flags","START","DATA","END","STATE","batchDepth","deferredEmissions","isBatching","batchDepth","deferEmission","fn","deferredEmissions","connectDepth","pendingStarts","deferStart","start","connectDepth","pendingStarts","Inspector","_Inspector","value","deps","joined","d","node","opts","id","key","depSuffix","kind","parent","child","parentKey","childKey","children","result","livingKeys","ref","alive","c","store","cb","talkback","prev","START","type","data","END","next","p","g","edges","depsMap","lines","info","depsStr","childStr","label","log","name","DATA","STATE","DIRTY","RESOLVED","tapName","wrapper","edgeMap","nodes","P_STARTED","P_MULTI","P_COMPLETED","P_AUTO_DIRTY","P_RESET","P_RESUB","P_PENDING","_STATUS_MASK","STATUS_MASK","_S_DIRTY","S_DIRTY","STATUS_SHIFT","_S_SETTLED","S_SETTLED","_S_DISCONNECTED","S_DISCONNECTED","_S_COMPLETED","S_COMPLETED","_S_ERRORED","S_ERRORED","_S_RESOLVED","S_RESOLVED","ProducerImpl","decodeStatus","fn","opts","flags","Inspector","type","data","output","sink","value","isBatching","STATE","DIRTY","deferEmission","DATA","s","RESOLVED","wasMulti","END","result","payload","START","_t","set","t","deferStart","producer","empty","producer","complete"]}

package/dist/extra/empty.d.cts

@@ -0,0 +1,13 @@
+import { P as ProducerStore } from '../types-DsAN6Hga.cjs';
+
+/**
+ * Creates a source that completes immediately without emitting any values.
+ *
+ * Stateful: get() always returns undefined — no values are ever emitted.
+ *
+ * v3: Tier 2 Producer — sends END immediately on start. Tests validate
+ * that END propagation works with no preceding DATA.
+ */
+declare function empty<T = never>(): ProducerStore<T>;
+
+export { empty };

package/dist/extra/empty.d.ts

@@ -0,0 +1,13 @@
+import { P as ProducerStore } from '../types-DsAN6Hga.js';
+
+/**
+ * Creates a source that completes immediately without emitting any values.
+ *
+ * Stateful: get() always returns undefined — no values are ever emitted.
+ *
+ * v3: Tier 2 Producer — sends END immediately on start. Tests validate
+ * that END propagation works with no preceding DATA.
+ */
+declare function empty<T = never>(): ProducerStore<T>;
+
+export { empty };

package/dist/extra/empty.js

@@ -0,0 +1,2 @@
+import{a}from"../chunk-EMNGVHNM.js";import"../chunk-LM26JNAK.js";import"../chunk-7WTS4C5R.js";import"../chunk-QYUTDL4D.js";export{a as empty};
+//# sourceMappingURL=empty.js.map

package/dist/extra/empty.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/extra/exhaustMap.cjs

@@ -0,0 +1,3 @@
+"use strict";var w=Object.defineProperty;var Z=Object.getOwnPropertyDescriptor;var ee=Object.getOwnPropertyNames;var te=Object.prototype.hasOwnProperty;var ne=(e,t)=>{for(var i in t)w(e,i,{get:t[i],enumerable:!0})},se=(e,t,i,n)=>{if(t&&typeof t=="object"||typeof t=="function")for(let s of ee(t))!te.call(e,s)&&s!==i&&w(e,s,{get:()=>t[s],enumerable:!(n=Z(t,s))||n.enumerable});return e};var ie=e=>se(w({},"__esModule",{value:!0}),e);var ce={};ne(ce,{exhaustMap:()=>de});module.exports=ie(ce);var S=Symbol("DIRTY"),D=Symbol("RESOLVED"),C=0,L=1,B=2,K=3,F=4,V=5,h=7,N=7<<h,re=["DISCONNECTED","DIRTY","SETTLED","RESOLVED","COMPLETED","ERRORED"];function Y(e){return re[(e&N)>>>h]}var f=0,T=1,l=2,v=3,oe=0,ae=[];function U(){return oe>0}function W(e){ae.push(e)}var y=0,m=[];function q(){y++}function G(){if(y--,y===0){for(let e=0;e<m.length;e++)m[e]();m.length=0}}function z(e){y>0?m.push(e):e()}var E=class e{static _names=new WeakMap;static _kinds=new WeakMap;static _keys=new WeakMap;static _stores=new Set;static _edges=new Map;static _nextId=0;static _usedKeys=new Set;static _explicitEnabled=null;static _cachedDefault=null;static get enabled(){if(e._explicitEnabled!==null)return e._explicitEnabled;if(e._cachedDefault!==null)return e._cachedDefault;try{e._cachedDefault=globalThis.process?.env?.NODE_ENV!=="production"}catch{e._cachedDefault=!0}return e._cachedDefault}static set enabled(t){e._explicitEnabled=t}static _depSuffix(t){if(!t?.length)return;let n=t.map(s=>e._names.get(s)??"?").join(",");return n.length>40?`${n.slice(0,37)}...`:n}static _resolveKey(t){return e._keys.get(t)??e._names.get(t)??"anonymous"}static register(t,i){if(!e.enabled)return;i?.name&&e._names.set(t,i.name),i?.kind&&e._kinds.set(t,i.kind);let n=e._nextId++,s=i?.name;if(!(s&&!e._usedKeys.has(s)))if(s){let r=e._depSuffix(i?.deps);s=r?`${s}(${r})`:`${s}_${n}`,e._usedKeys.has(s)&&(s=`${s}_${n}`)}else{let r=i?.kind??"store",o=e._depSuffix(i?.deps);s=o?`${r}(${o})`:`${r}_${n}`,e._usedKeys.has(s)&&(s=`${s}_${n}`)}e._usedKeys.add(s),e._keys.set(t,s),e._stores.add(new WeakRef(t))}static registerEdge(t,i){if(!e.enabled)return;let n=e._resolveKey(t),s=e._resolveKey(i),r=e._edges.get(n);r?r.includes(s)||r.push(s):e._edges.set(n,[s])}static getEdges(){return new Map(e._edges)}static getName(t){if(e.enabled)return e._names.get(t)}static getKind(t){return e._kinds.get(t)}static inspect(t){return{name:e._names.get(t),kind:e._kinds.get(t)??"unknown",value:typeof t.get=="function"?t.get():void 0,status:t._status}}static graph(){let t=new Map,i=new Set;for(let n of e._stores){let s=n.deref();if(!s){e._stores.delete(n);continue}let r=e._resolveKey(s);i.add(r),t.set(r,e.inspect(s))}for(let[n,s]of e._edges){if(!i.has(n)){e._edges.delete(n),e._usedKeys.delete(n);continue}let r=s.filter(o=>i.has(o));r.length===0?e._edges.delete(n):r.length!==s.length&&e._edges.set(n,r)}return t}static trace(t,i){let n=null,s=t.get();return t.source(f,(r,o)=>{if(r===f&&(n=o),r===l){n=null;return}if(r===1){let u=o;if(!Object.is(u,s)){let a=s;s=u,i(u,a)}}}),()=>n?.(l)}static dumpGraph(){let t=e.graph(),i=e.getEdges(),n=new Map;for(let[o,u]of i)for(let a of u){let p=n.get(a);p?p.includes(o)||p.push(o):n.set(a,[o])}let s=[];for(let[o,u]of t){let a=n.get(o),p=i.get(o),R=a?.length?`  \u2190 [${a.join(", ")}]`:"",O=p?.length?`  \u2192 [${p.join(", ")}]`:"";s.push(`  ${o} (${u.kind}) = ${JSON.stringify(u.value)}  [${u.status??"?"}]${R}${O}`)}return[`Store Graph (${t.size} nodes):`,...s].join(`
+`)}static _observe(t,i,n){let s=null,r=i??e.getName(t),o={values:[],signals:[],events:[],ended:!1,endError:void 0,dirtyCount:0,resolvedCount:0,name:r,dispose:()=>s?.(l)};return t.source(f,(u,a)=>{if(u===f){s=a;return}u===T?(o.values.push(a),o.events.push({type:"data",data:a}),n&&n(`[${r}] DATA:`,a)):u===v?(o.signals.push(a),o.events.push({type:"signal",data:a}),a===S?o.dirtyCount++:a===D&&o.resolvedCount++,n&&n(`[${r}] STATE:`,a)):u===l&&(o.ended=!0,o.endError=a,o.events.push({type:"end",data:a}),n&&n(`[${r}] END`,a!==void 0?a:""),s=null)}),o}static observe(t){return e._observe(t)}static tap(t,i){let n=i??`tap(${e.getName(t)??"anon"})`,s={get:()=>t.get(),source:t.source};return e.register(s,{name:n,kind:"tap"}),e.registerEdge(t,s),s}static spy(t,i){let n=i?.name??e.getName(t)??"spy",s=i?.log??console.log;return e._observe(t,n,s)}static snapshot(){let t=e.graph(),i=e.getEdges(),n=[];for(let[r,o]of t)n.push({name:r,kind:o.kind,value:o.value,status:o.status});let s=[];for(let[r,o]of i)for(let u of o)s.push({from:r,to:u});return{nodes:n,edges:s}}static _reset(){e._names=new WeakMap,e._kinds=new WeakMap,e._keys=new WeakMap,e._stores=new Set,e._edges=new Map,e._usedKeys=new Set,e._nextId=0,e._explicitEnabled=null,e._cachedDefault=null}};var x=1,c=64,g=2,I=4,H=8,J=16,M=32,d=N,P=L<<h,Q=B<<h,k=C<<h,ue=F<<h,le=V<<h,fe=K<<h,$=class{_value;_output=null;_flags;get _status(){return Y(this._flags)}_cleanup;_fn;_eqFn;_getterFn;_initial;constructor(t,i){this._value=i?.initial,this._fn=t,this._eqFn=i?.equals,this._getterFn=i?.getter,this._initial=i?.initial;let n=0;i?.autoDirty!==!1&&(n|=I),i?.resetOnTeardown&&(n|=H),i?.resubscribable&&(n|=J),this._flags=n,this.source=this.source.bind(this),this.emit=this.emit.bind(this),this.signal=this.signal.bind(this),this.complete=this.complete.bind(this),this.error=this.error.bind(this),i?._skipInspect||E.register(this,{kind:"producer",...i})}get(){return this._getterFn?this._getterFn(this._value):this._value}_dispatch(t,i){let n=this._output;if(n)if(this._flags&c)for(let s of n)s(t,i);else n(t,i)}emit(t){this._flags&g||this._eqFn&&this._value!==void 0&&this._eqFn(this._value,t)||(this._value=t,this._output&&(U()?this._flags&M||(this._flags|=M,this._flags&I&&(this._flags=this._flags&~d|P,this._dispatch(v,S)),W(()=>{this._flags&=~M,this._flags=this._flags&~d|Q,this._dispatch(T,this._value)})):(this._flags&I&&(this._flags=this._flags&~d|P,this._dispatch(v,S)),this._flags=this._flags&~d|Q,this._dispatch(T,this._value))))}signal(t){this._flags&g||!this._output||(t===S?this._flags=this._flags&~d|P:t===D&&(this._flags=this._flags&~d|fe),this._dispatch(v,t))}complete(){if(this._flags&g)return;this._flags=(this._flags|g)&~d|ue;let t=this._output,i=this._flags&c;if(this._output=null,this._flags&=~c,this._stop(),t)if(i)for(let n of t)n(l);else t(l)}error(t){if(this._flags&g)return;this._flags=(this._flags|g)&~d|le;let i=this._output,n=this._flags&c;if(this._output=null,this._flags&=~c,this._stop(),i)if(n)for(let s of i)s(l,t);else i(l,t)}_start(){if(this._flags&x||!this._fn)return;this._flags|=x;let t=this._fn(this);this._cleanup=typeof t=="function"?t:void 0}_stop(){this._flags&x&&(this._flags&=~x,this._cleanup&&this._cleanup(),this._cleanup=void 0,this._flags&H&&(this._value=this._initial),this._flags&g||(this._flags=this._flags&~d|k))}source(t,i){if(t===f){let n=i;if(this._flags&g)if(this._flags&J&&this._output===null)this._flags=this._flags&~(g|d)|k;else{n(f,s=>{}),n(l);return}if(this._output===null)this._output=n;else if(this._flags&c)this._output.add(n);else{let s=new Set;s.add(this._output),s.add(n),this._output=s,this._flags|=c}n(f,s=>{if(s===T&&n(T,this._value),s===l){if(this._output===null)return;if(this._flags&c){let r=this._output;r.delete(n),r.size===1?(this._output=r.values().next().value,this._flags&=~c):r.size===0&&(this._output=null,this._flags&=~c,this._flags=this._flags&~d|k,this._stop())}else this._output===n&&(this._output=null,this._flags=this._flags&~d|k,this._stop())}}),z(()=>this._start())}}};function X(e,t){return new $(e,t)}function j(e,t,i){let n=null;q(),e.source(f,(r,o)=>{if(r===f&&(n=o),r===l){n=null,i?.onEnd?.(o);return}if(r===1){let u=o,a=s;s=u,t(u,a)}});let s=e.get();return G(),()=>n?.(l)}function de(e,t){return i=>{let n=X(({emit:s,error:r,complete:o})=>{let u=null,a=!1,p=!1;function R(_){a=!0,s(_.get()),_.source(f,(A,b)=>{A===f&&(u=b),A===1&&s(b),A===l&&(u=null,b!==void 0?r(b):(a=!1,p&&o()))})}let O=j(i,_=>{a||R(e(_))},{onEnd:_=>{_!==void 0?r(_):(p=!0,a||o())}});return()=>{u&&u(l),O()}},t&&"initial"in t?{initial:t.initial}:void 0);return E.register(n,{kind:"exhaustMap"}),n}}0&&(module.exports={exhaustMap});
+//# sourceMappingURL=exhaustMap.cjs.map

package/dist/extra/exhaustMap.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/extra/exhaustMap.ts","../../src/core/protocol.ts","../../src/core/inspector.ts","../../src/core/producer.ts","../../src/core/subscribe.ts"],"sourcesContent":["import { Inspector } from \"../core/inspector\";\nimport { producer } from \"../core/producer\";\nimport { END, START } from \"../core/protocol\";\nimport type { Store, StoreOperator } from \"../core/types\";\nimport { subscribe } from \"./subscribe\";\n\n/**\n * Maps each upstream value to an inner store via `fn`. While an inner is active,\n * new outer values are ignored. The next outer value is accepted only after the\n * current inner completes (sends END).\n *\n * v5 (Option D3): Purely reactive — does NOT eagerly evaluate fn(outer.get()).\n * Inner subscription is only created when outer emits. get() returns `initial`\n * (if provided) or undefined before first inner emission.\n *\n * Tier 2 — dynamic subscription operator. Each inner is a cycle boundary;\n * each emit starts a new DIRTY+value cycle. No built-in dedup.\n * Forwards inner errors and upstream completion.\n */\nexport function exhaustMap<A, B>(fn: (value: A) => Store<B>): StoreOperator<A, B | undefined>;\nexport function exhaustMap<A, B>(\n\tfn: (value: A) => Store<B>,\n\topts: { initial: B },\n): StoreOperator<A, B>;\nexport function exhaustMap<A, B>(\n\tfn: (value: A) => Store<B>,\n\topts?: { initial?: B },\n): StoreOperator<A, B | undefined> {\n\treturn (outer: Store<A>) => {\n\t\tconst store = producer<B>(\n\t\t\t({ emit, error, complete }) => {\n\t\t\t\tlet innerTalkback: ((type: number) => void) | null = null;\n\t\t\t\tlet innerActive = false;\n\t\t\t\tlet outerDone = false;\n\n\t\t\t\tfunction subscribeInner(innerStore: Store<B>) {\n\t\t\t\t\tinnerActive = true;\n\t\t\t\t\temit(innerStore.get());\n\t\t\t\t\tinnerStore.source(START, (type: number, data: unknown) => {\n\t\t\t\t\t\tif (type === START) innerTalkback = data as (type: number) => void;\n\t\t\t\t\t\tif (type === 1) emit(data as B);\n\t\t\t\t\t\tif (type === END) {\n\t\t\t\t\t\t\tinnerTalkback = null;\n\t\t\t\t\t\t\tif (data !== undefined) {\n\t\t\t\t\t\t\t\terror(data);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tinnerActive = false;\n\t\t\t\t\t\t\t\tif (outerDone) complete();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\t\t\t\t}\n\n\t\t\t\tconst outerUnsub = subscribe(\n\t\t\t\t\touter,\n\t\t\t\t\t(v) => {\n\t\t\t\t\t\tif (!innerActive) subscribeInner(fn(v));\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\tonEnd: (err) => {\n\t\t\t\t\t\t\tif (err !== undefined) {\n\t\t\t\t\t\t\t\terror(err);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\touterDone = true;\n\t\t\t\t\t\t\t\tif (!innerActive) complete();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t);\n\n\t\t\t\treturn () => {\n\t\t\t\t\tif (innerTalkback) innerTalkback(END);\n\t\t\t\t\touterUnsub();\n\t\t\t\t};\n\t\t\t},\n\t\t\topts && \"initial\" in opts ? { initial: opts.initial as B } : undefined,\n\t\t);\n\n\t\tInspector.register(store, { kind: \"exhaustMap\" });\n\t\treturn store;\n\t};\n}\n","// ---------------------------------------------------------------------------\n// Protocol — v3 type 3 control channel\n// ---------------------------------------------------------------------------\n// Type 3 (STATE) carries control signals: DIRTY, RESOLVED\n// Type 1 (DATA) carries only real values — never sentinels\n// ---------------------------------------------------------------------------\n\n/** Control signal: \"my value is about to change\" */\nexport const DIRTY = Symbol(\"DIRTY\");\n\n/** Control signal: \"I was dirty but my value didn't change\" */\nexport const RESOLVED = Symbol(\"RESOLVED\");\n\nexport type Signal = typeof DIRTY | typeof RESOLVED;\n\n/** Node status — tracks current lifecycle state (v4) */\nexport type NodeStatus =\n\t| \"DISCONNECTED\"\n\t| \"DIRTY\"\n\t| \"SETTLED\"\n\t| \"RESOLVED\"\n\t| \"COMPLETED\"\n\t| \"ERRORED\";\n\n// ---------------------------------------------------------------------------\n// Integer status constants — pack into _flags for hot-path performance.\n// 3 bits (7-9) encode 6 statuses. Use STATUS_MASK to read/write.\n// ---------------------------------------------------------------------------\nexport const S_DISCONNECTED = 0;\nexport const S_DIRTY = 1;\nexport const S_SETTLED = 2;\nexport const S_RESOLVED = 3;\nexport const S_COMPLETED = 4;\nexport const S_ERRORED = 5;\nexport const STATUS_SHIFT = 7;\nexport const STATUS_MASK = 0b111 << STATUS_SHIFT; // bits 7-9\n\nconst STATUS_STRINGS: NodeStatus[] = [\n\t\"DISCONNECTED\",\n\t\"DIRTY\",\n\t\"SETTLED\",\n\t\"RESOLVED\",\n\t\"COMPLETED\",\n\t\"ERRORED\",\n];\n\n/** Decode integer status bits back to string (for Inspector / tests) */\nexport function decodeStatus(flags: number): NodeStatus {\n\treturn STATUS_STRINGS[(flags & STATUS_MASK) >>> STATUS_SHIFT];\n}\n\n/** Callbag signal types */\nexport const START = 0;\nexport const DATA = 1;\nexport const END = 2;\nexport const STATE = 3;\n\n// ---------------------------------------------------------------------------\n// Batch — defers type 1 value emissions; type 3 DIRTY propagates immediately\n// ---------------------------------------------------------------------------\n\nlet batchDepth = 0;\nconst deferredEmissions: Array<() => void> = [];\n\n// `draining` prevents re-entrant drain when a nested batch() call ends while\n// the outer drain loop is already running. Without it, the inner batch's\n// finally block would see batchDepth===0 and start a second drain, racing the\n// outer loop — potentially double-processing items or clearing the array mid-\n// iteration. With draining=true, the inner batch skips its drain; any items it\n// pushes are picked up by the outer loop (the `for` condition re-evaluates\n// `deferredEmissions.length` on every iteration, so appends during drain are\n// naturally included in the same pass).\nlet draining = false;\n\nexport function batch<T>(fn: () => T): T {\n\tbatchDepth++;\n\ttry {\n\t\treturn fn();\n\t} finally {\n\t\tbatchDepth--;\n\t\tif (batchDepth === 0 && !draining) {\n\t\t\tdraining = true;\n\t\t\tfor (let i = 0; i < deferredEmissions.length; i++) {\n\t\t\t\tdeferredEmissions[i]();\n\t\t\t}\n\t\t\tdeferredEmissions.length = 0;\n\t\t\tdraining = false;\n\t\t}\n\t}\n}\n\nexport function isBatching(): boolean {\n\treturn batchDepth > 0;\n}\n\nexport function deferEmission(fn: () => void): void {\n\tdeferredEmissions.push(fn);\n}\n\n// ---------------------------------------------------------------------------\n// Connection batching (producer start deferral) — unchanged from v2\n// ---------------------------------------------------------------------------\n\nlet connectDepth = 0;\nconst pendingStarts: Array<() => void> = [];\n\nexport function beginDeferredStart(): void {\n\tconnectDepth++;\n}\n\nexport function endDeferredStart(): void {\n\tconnectDepth--;\n\tif (connectDepth === 0) {\n\t\tfor (let i = 0; i < pendingStarts.length; i++) {\n\t\t\tpendingStarts[i]();\n\t\t}\n\t\tpendingStarts.length = 0;\n\t}\n}\n\nexport function deferStart(start: () => void): void {\n\tif (connectDepth > 0) {\n\t\tpendingStarts.push(start);\n\t} else {\n\t\tstart();\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// teardown — protocol-level graph destruction\n// ---------------------------------------------------------------------------\n// Sends END to all downstream sinks of a store node, cascading through the\n// entire subgraph. After teardown, the node is in COMPLETED state and won't\n// accept new values or subscriptions.\n//\n// Works with any node that uses the output slot model:\n// - ProducerImpl / StateImpl / OperatorImpl → calls .complete()\n// - DerivedImpl → calls ._handleEnd() (no public complete() on derived)\n// ---------------------------------------------------------------------------\n\nexport function teardown(store: { source: (type: number, payload?: any) => void }): void {\n\tconst node = store as any;\n\tif (typeof node.complete === \"function\") {\n\t\tnode.complete();\n\t} else if (typeof node._handleEnd === \"function\") {\n\t\tnode._handleEnd(undefined);\n\t}\n}\n","// ---------------------------------------------------------------------------\n// Inspector — static class for observability\n// ---------------------------------------------------------------------------\n// All debug metadata lives here in WeakMaps, not on the store objects.\n// Stores stay lean. Inspector is opt-in overhead.\n//\n// v5: Zero intrusion into primitives. No hooks in hot paths. All methods\n// are static — call directly as Inspector.observe(), Inspector.tap(), etc.\n// - register/registerEdge: metadata collection (called from constructors)\n// - inspect/graph/dumpGraph/snapshot: read-only graph queries\n// - observe/spy/trace: callbag sinks for debugging (subscribe externally)\n// - tap: transparent passthrough wrapper for graph visualization\n// ---------------------------------------------------------------------------\n\nimport type { NodeStatus, Signal } from \"./protocol\";\nimport { DATA, DIRTY, END, RESOLVED, START, STATE } from \"./protocol\";\nimport type { Store } from \"./types\";\n\nexport interface StoreInfo<T = unknown> {\n\tname: string | undefined;\n\tkind: string;\n\tvalue: T;\n\t/** v4: node lifecycle status */\n\tstatus: NodeStatus | undefined;\n}\n\nexport interface ObserveResult<T> {\n\t/** All DATA (type 1) values received, in order */\n\tvalues: T[];\n\t/** All STATE (type 3) payloads received (DIRTY, RESOLVED, or unknown) */\n\tsignals: Signal[];\n\t/** All events in protocol order: { type, data } */\n\tevents: Array<{ type: \"data\" | \"signal\" | \"end\"; data: unknown }>;\n\t/** Whether END (type 2) has been received */\n\tended: boolean;\n\t/** Error payload from END, if any */\n\tendError: unknown;\n\t/** Count of DIRTY signals received */\n\tdirtyCount: number;\n\t/** Count of RESOLVED signals received */\n\tresolvedCount: number;\n\t/** Store name (from Inspector, if registered) */\n\tname: string | undefined;\n\t/** Disconnect the observer */\n\tdispose: () => void;\n}\n\n// Static-only class is intentional API for Inspector namespace\n// biome-ignore lint/complexity/noStaticOnlyClass: public API surface\nexport class Inspector {\n\t// WeakMaps for metadata — keyed by any graph node (stores, effects, etc.)\n\tprivate static _names = new WeakMap<object, string>();\n\tprivate static _kinds = new WeakMap<object, string>();\n\tprivate static _keys = new WeakMap<object, string>();\n\n\t// WeakRef set for graph() — allows GC of unused nodes\n\tprivate static _stores = new Set<WeakRef<object>>();\n\n\t// Dependency edges: parent key → child keys\n\tprivate static _edges = new Map<string, string[]>();\n\n\t// Unique key generation\n\tprivate static _nextId = 0;\n\tprivate static _usedKeys = new Set<string>();\n\n\t// Enabled flag — when false, register/getName are no-ops\n\tprivate static _explicitEnabled: boolean | null = null;\n\tprivate static _cachedDefault: boolean | null = null;\n\n\tstatic get enabled(): boolean {\n\t\tif (Inspector._explicitEnabled !== null) return Inspector._explicitEnabled;\n\t\tif (Inspector._cachedDefault !== null) return Inspector._cachedDefault;\n\t\ttry {\n\t\t\tInspector._cachedDefault = (globalThis as any).process?.env?.NODE_ENV !== \"production\";\n\t\t} catch {\n\t\t\tInspector._cachedDefault = true;\n\t\t}\n\t\treturn Inspector._cachedDefault;\n\t}\n\n\tstatic set enabled(value: boolean) {\n\t\tInspector._explicitEnabled = value;\n\t}\n\n\t/** Compute a dep-name-based suffix for unique key generation */\n\tprivate static _depSuffix(deps?: object[]): string | undefined {\n\t\tif (!deps?.length) return undefined;\n\t\tconst names = deps.map((d) => Inspector._names.get(d) ?? \"?\");\n\t\tconst joined = names.join(\",\");\n\t\treturn joined.length > 40 ? `${joined.slice(0, 37)}...` : joined;\n\t}\n\n\t/** Resolve a node to its unique graph key */\n\tprivate static _resolveKey(node: object): string {\n\t\treturn Inspector._keys.get(node) ?? Inspector._names.get(node) ?? \"anonymous\";\n\t}\n\n\t/** Register a graph node (store, effect, etc.) with the inspector */\n\tstatic register(node: object, opts?: { name?: string; kind?: string; deps?: object[] }): void {\n\t\tif (!Inspector.enabled) return;\n\t\tif (opts?.name) Inspector._names.set(node, opts.name);\n\t\tif (opts?.kind) Inspector._kinds.set(node, opts.kind);\n\n\t\t// Compute unique key\n\t\tconst id = Inspector._nextId++;\n\t\tlet key = opts?.name;\n\t\tif (key && !Inspector._usedKeys.has(key)) {\n\t\t\t// Unique name — use as-is\n\t\t} else if (key) {\n\t\t\t// Name collision — differentiate with dep names or ID\n\t\t\tconst depSuffix = Inspector._depSuffix(opts?.deps);\n\t\t\tkey = depSuffix ? `${key}(${depSuffix})` : `${key}_${id}`;\n\t\t\tif (Inspector._usedKeys.has(key)) key = `${key}_${id}`;\n\t\t} else {\n\t\t\t// Unnamed — use kind + dep names or ID\n\t\t\tconst kind = opts?.kind ?? \"store\";\n\t\t\tconst depSuffix = Inspector._depSuffix(opts?.deps);\n\t\t\tkey = depSuffix ? `${kind}(${depSuffix})` : `${kind}_${id}`;\n\t\t\tif (Inspector._usedKeys.has(key)) key = `${key}_${id}`;\n\t\t}\n\n\t\tInspector._usedKeys.add(key);\n\t\tInspector._keys.set(node, key);\n\t\tInspector._stores.add(new WeakRef(node));\n\t}\n\n\t/** Register a dependency edge between parent and child nodes */\n\tstatic registerEdge(parent: object, child: object): void {\n\t\tif (!Inspector.enabled) return;\n\t\tconst parentKey = Inspector._resolveKey(parent);\n\t\tconst childKey = Inspector._resolveKey(child);\n\t\tconst children = Inspector._edges.get(parentKey);\n\t\tif (children) {\n\t\t\tif (!children.includes(childKey)) children.push(childKey);\n\t\t} else {\n\t\t\tInspector._edges.set(parentKey, [childKey]);\n\t\t}\n\t}\n\n\t/** Get dependency edges: parent → children */\n\tstatic getEdges(): Map<string, string[]> {\n\t\treturn new Map(Inspector._edges);\n\t}\n\n\t/** Get the name of a node */\n\tstatic getName(node: object): string | undefined {\n\t\tif (!Inspector.enabled) return undefined;\n\t\treturn Inspector._names.get(node);\n\t}\n\n\t/** Get the kind of a node */\n\tstatic getKind(node: object): string | undefined {\n\t\treturn Inspector._kinds.get(node);\n\t}\n\n\t/** Inspect a single graph node — includes status and value (if available) */\n\tstatic inspect<T = unknown>(node: object): StoreInfo<T> {\n\t\treturn {\n\t\t\tname: Inspector._names.get(node),\n\t\t\tkind: Inspector._kinds.get(node) ?? \"unknown\",\n\t\t\tvalue: (typeof (node as any).get === \"function\" ? (node as any).get() : undefined) as T,\n\t\t\tstatus: (node as any)._status,\n\t\t};\n\t}\n\n\t/** Get all living nodes as a Map. Also prunes dead edges from GC'd nodes. */\n\tstatic graph(): Map<string, StoreInfo> {\n\t\tconst result = new Map<string, StoreInfo>();\n\t\tconst livingKeys = new Set<string>();\n\t\tfor (const ref of Inspector._stores) {\n\t\t\tconst node = ref.deref();\n\t\t\tif (!node) {\n\t\t\t\tInspector._stores.delete(ref); // cleanup GC'd refs\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst key = Inspector._resolveKey(node);\n\t\t\tlivingKeys.add(key);\n\t\t\tresult.set(key, Inspector.inspect(node));\n\t\t}\n\t\t// Prune edges referencing GC'd stores\n\t\tfor (const [key, children] of Inspector._edges) {\n\t\t\tif (!livingKeys.has(key)) {\n\t\t\t\tInspector._edges.delete(key);\n\t\t\t\tInspector._usedKeys.delete(key);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst alive = children.filter((c) => livingKeys.has(c));\n\t\t\tif (alive.length === 0) {\n\t\t\t\tInspector._edges.delete(key);\n\t\t\t} else if (alive.length !== children.length) {\n\t\t\t\tInspector._edges.set(key, alive);\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\t/** Trace a specific store's value changes (raw callbag — no extra/ dependency) */\n\tstatic trace<T>(store: Store<T>, cb: (value: T, prev: T | undefined) => void): () => void {\n\t\tlet talkback: ((type: number) => void) | null = null;\n\t\tlet prev: T | undefined = store.get();\n\t\tstore.source(START, (type: number, data: any) => {\n\t\t\tif (type === START) talkback = data;\n\t\t\tif (type === END) {\n\t\t\t\ttalkback = null;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (type === 1) {\n\t\t\t\tconst next = data as T;\n\t\t\t\tif (!Object.is(next, prev)) {\n\t\t\t\t\tconst p = prev;\n\t\t\t\t\tprev = next;\n\t\t\t\t\tcb(next, p);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\treturn () => talkback?.(END);\n\t}\n\n\t/** Pretty-print the entire store graph for console/CLI debugging */\n\tstatic dumpGraph(): string {\n\t\tconst g = Inspector.graph();\n\t\tconst edges = Inspector.getEdges();\n\n\t\t// Build reverse map: child key → parent keys (deps)\n\t\tconst depsMap = new Map<string, string[]>();\n\t\tfor (const [parent, children] of edges) {\n\t\t\tfor (const child of children) {\n\t\t\t\tconst deps = depsMap.get(child);\n\t\t\t\tif (deps) {\n\t\t\t\t\tif (!deps.includes(parent)) deps.push(parent);\n\t\t\t\t} else {\n\t\t\t\t\tdepsMap.set(child, [parent]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tconst lines: string[] = [];\n\t\tfor (const [key, info] of g) {\n\t\t\tconst deps = depsMap.get(key);\n\t\t\tconst children = edges.get(key);\n\t\t\tconst depsStr = deps?.length ? `  ← [${deps.join(\", \")}]` : \"\";\n\t\t\tconst childStr = children?.length ? `  → [${children.join(\", \")}]` : \"\";\n\t\t\tlines.push(\n\t\t\t\t`  ${key} (${info.kind}) = ${JSON.stringify(info.value)}  [${info.status ?? \"?\"}]${depsStr}${childStr}`,\n\t\t\t);\n\t\t}\n\t\tconst header = `Store Graph (${g.size} nodes):`;\n\t\treturn [header, ...lines].join(\"\\n\");\n\t}\n\n\t/**\n\t * Internal observe implementation shared by observe() and spy().\n\t */\n\tprivate static _observe<T>(\n\t\tstore: Store<T>,\n\t\tlabel?: string,\n\t\tlog?: (...args: any[]) => void,\n\t): ObserveResult<T> {\n\t\tlet talkback: ((type: number) => void) | null = null;\n\t\tconst name = label ?? Inspector.getName(store);\n\t\tconst result: ObserveResult<T> = {\n\t\t\tvalues: [],\n\t\t\tsignals: [],\n\t\t\tevents: [],\n\t\t\tended: false,\n\t\t\tendError: undefined,\n\t\t\tdirtyCount: 0,\n\t\t\tresolvedCount: 0,\n\t\t\tname,\n\t\t\tdispose: () => talkback?.(END),\n\t\t};\n\n\t\tstore.source(START, (type: number, data: any) => {\n\t\t\tif (type === START) {\n\t\t\t\ttalkback = data;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (type === DATA) {\n\t\t\t\tresult.values.push(data);\n\t\t\t\tresult.events.push({ type: \"data\", data });\n\t\t\t\tif (log) log(`[${name}] DATA:`, data);\n\t\t\t} else if (type === STATE) {\n\t\t\t\tresult.signals.push(data);\n\t\t\t\tresult.events.push({ type: \"signal\", data });\n\t\t\t\tif (data === DIRTY) result.dirtyCount++;\n\t\t\t\telse if (data === RESOLVED) result.resolvedCount++;\n\t\t\t\tif (log) log(`[${name}] STATE:`, data);\n\t\t\t} else if (type === END) {\n\t\t\t\tresult.ended = true;\n\t\t\t\tresult.endError = data;\n\t\t\t\tresult.events.push({ type: \"end\", data });\n\t\t\t\tif (log) log(`[${name}] END`, data !== undefined ? data : \"\");\n\t\t\t\ttalkback = null;\n\t\t\t}\n\t\t});\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Observe a store's full callbag protocol — the test-friendly alternative\n\t * to hooks. Captures DATA values, STATE signals, END, and provides\n\t * convenience accessors.\n\t *\n\t * Returns a live observation object — arrays grow as the store emits.\n\t *\n\t * ```ts\n\t * const obs = Inspector.observe(myStore);\n\t * myState.set(5);\n\t * obs.values       // [5]\n\t * obs.signals       // [DIRTY]\n\t * obs.ended         // false\n\t * obs.dirtyCount    // 1\n\t * obs.dispose()     // stop observing\n\t * ```\n\t */\n\tstatic observe<T>(store: Store<T>): ObserveResult<T> {\n\t\treturn Inspector._observe(store);\n\t}\n\n\t/**\n\t * Create a transparent passthrough wrapper for graph visualization.\n\t * The wrapper delegates `get()` and `source()` to the original store,\n\t * appearing as a distinct node in the Inspector graph. Zero overhead —\n\t * subscribers connect directly to the original store's source.\n\t */\n\tstatic tap<T>(store: Store<T>, name?: string): Store<T> {\n\t\tconst tapName = name ?? `tap(${Inspector.getName(store) ?? \"anon\"})`;\n\t\tconst wrapper: Store<T> = {\n\t\t\tget: () => store.get(),\n\t\t\tsource: store.source,\n\t\t};\n\t\tInspector.register(wrapper, { name: tapName, kind: \"tap\" });\n\t\tInspector.registerEdge(store, wrapper);\n\t\treturn wrapper;\n\t}\n\n\t/**\n\t * Enhanced observe() with logging — for interactive debugging.\n\t * Returns the same observation object as observe(), but also logs each\n\t * event as it happens. Pass a custom logger or defaults to console.log.\n\t */\n\tstatic spy<T>(\n\t\tstore: Store<T>,\n\t\topts?: { name?: string; log?: (...args: any[]) => void },\n\t): ObserveResult<T> {\n\t\tconst label = opts?.name ?? Inspector.getName(store) ?? \"spy\";\n\t\tconst log = opts?.log ?? console.log;\n\t\treturn Inspector._observe(store, label, log);\n\t}\n\n\t/**\n\t * JSON-serializable snapshot of the entire graph — nodes + edges.\n\t * Designed for AI consumption during debugging sessions.\n\t */\n\tstatic snapshot(): {\n\t\tnodes: Array<{ name: string; kind: string; value: unknown; status: string | undefined }>;\n\t\tedges: Array<{ from: string; to: string }>;\n\t} {\n\t\tconst g = Inspector.graph();\n\t\tconst edgeMap = Inspector.getEdges();\n\t\tconst nodes: Array<{ name: string; kind: string; value: unknown; status: string | undefined }> =\n\t\t\t[];\n\t\tfor (const [key, info] of g) {\n\t\t\tnodes.push({ name: key, kind: info.kind, value: info.value, status: info.status });\n\t\t}\n\t\tconst edges: Array<{ from: string; to: string }> = [];\n\t\tfor (const [parent, children] of edgeMap) {\n\t\t\tfor (const child of children) {\n\t\t\t\tedges.push({ from: parent, to: child });\n\t\t\t}\n\t\t}\n\t\treturn { nodes, edges };\n\t}\n\n\t/** Reset all state (for testing) */\n\tstatic _reset(): void {\n\t\tInspector._names = new WeakMap<object, string>();\n\t\tInspector._kinds = new WeakMap<object, string>();\n\t\tInspector._keys = new WeakMap<object, string>();\n\t\tInspector._stores = new Set<WeakRef<object>>();\n\t\tInspector._edges = new Map();\n\t\tInspector._usedKeys = new Set();\n\t\tInspector._nextId = 0;\n\t\tInspector._explicitEnabled = null;\n\t\tInspector._cachedDefault = null;\n\t}\n}\n","/**\n * General-purpose source primitive. Can emit values, send control signals,\n * complete, and error. Lazy start on first sink, auto-cleanup on last\n * sink disconnect.\n *\n * Stateful: maintains currentValue. get() returns currentValue (or\n * getter(currentValue) when getter option is provided).\n *\n * v4: Output slot model replaces _sinks Set. _output is null (no sinks),\n * a function (single sink — P0 optimization), or a Set (multi sink).\n * _status tracks node lifecycle. autoDirty (default true) sends DIRTY on\n * type 3 before each type 1 DATA. equals option guards emit();\n * resetOnTeardown resets value on stop.\n *\n * v5: _status packed into _flags bits 7-9 for hot-path performance.\n * String status exposed via getter for Inspector/test backward compat.\n *\n * Class-based for V8 hidden class optimization and prototype method sharing.\n * Boolean fields packed into _flags bitmask to reduce hidden class size.\n */\n\nimport { Inspector } from \"./inspector\";\nimport type { Signal } from \"./protocol\";\nimport {\n\tDATA,\n\tDIRTY,\n\tdecodeStatus,\n\tdeferEmission,\n\tdeferStart,\n\tEND,\n\tisBatching,\n\tRESOLVED,\n\tS_COMPLETED,\n\tS_DIRTY,\n\tS_DISCONNECTED,\n\tS_ERRORED,\n\tS_RESOLVED,\n\tS_SETTLED,\n\tSTART,\n\tSTATE,\n\tSTATUS_MASK,\n\tSTATUS_SHIFT,\n} from \"./protocol\";\nimport type { ProducerStore, SourceOptions, Store } from \"./types\";\n\nexport type ProducerFn<T> = (actions: {\n\temit: (value: T) => void;\n\tsignal: (s: Signal) => void;\n\tcomplete: () => void;\n\terror: (e: unknown) => void;\n}) => (() => void) | undefined;\n\nexport type ProducerOpts<T> = SourceOptions<T> & {\n\tautoDirty?: boolean;\n\t_skipInspect?: boolean;\n};\n\n// Flag bits for _flags bitmask (bits 0-6)\nconst P_STARTED = 1;\nconst P_MULTI = 64;\n\n// Exported for subclass fast paths (StateImpl)\nexport const P_COMPLETED = 2;\nexport const P_AUTO_DIRTY = 4;\nconst P_RESET = 8;\nconst P_RESUB = 16;\nexport const P_PENDING = 32;\n\n// Status bits (bits 7-9) — exported for StateImpl fast path\nexport const _STATUS_MASK = STATUS_MASK;\nexport const _S_DIRTY = S_DIRTY << STATUS_SHIFT;\nexport const _S_SETTLED = S_SETTLED << STATUS_SHIFT;\nexport const _S_DISCONNECTED = S_DISCONNECTED << STATUS_SHIFT;\nexport const _S_COMPLETED = S_COMPLETED << STATUS_SHIFT;\nexport const _S_ERRORED = S_ERRORED << STATUS_SHIFT;\nexport const _S_RESOLVED = S_RESOLVED << STATUS_SHIFT;\n\nexport class ProducerImpl<T> {\n\t_value: T | undefined;\n\t_output: ((type: number, data?: any) => void) | Set<any> | null = null;\n\t_flags: number;\n\n\tget _status() {\n\t\treturn decodeStatus(this._flags);\n\t}\n\t_cleanup: (() => void) | undefined;\n\t_fn: ProducerFn<T> | undefined;\n\t_eqFn: ((a: T, b: T) => boolean) | undefined;\n\t_getterFn: ((cached: T | undefined) => T) | undefined;\n\t_initial: T | undefined;\n\n\tconstructor(fn?: ProducerFn<T>, opts?: ProducerOpts<T>) {\n\t\tthis._value = opts?.initial;\n\t\tthis._fn = fn;\n\t\tthis._eqFn = opts?.equals;\n\t\tthis._getterFn = opts?.getter;\n\t\tthis._initial = opts?.initial;\n\n\t\tlet flags = 0;\n\t\tif (opts?.autoDirty !== false) flags |= P_AUTO_DIRTY;\n\t\tif (opts?.resetOnTeardown) flags |= P_RESET;\n\t\tif (opts?.resubscribable) flags |= P_RESUB;\n\t\t// S_DISCONNECTED = 0, so no need to set status bits\n\t\tthis._flags = flags;\n\n\t\t// Bind public API methods so they work when detached (callbag interop,\n\t\t// destructuring, etc.). Replaces per-instance closure functions.\n\t\tthis.source = this.source.bind(this);\n\t\tthis.emit = this.emit.bind(this);\n\t\tthis.signal = this.signal.bind(this);\n\t\tthis.complete = this.complete.bind(this);\n\t\tthis.error = this.error.bind(this);\n\n\t\tif (!opts?._skipInspect) Inspector.register(this as any, { kind: \"producer\", ...opts });\n\t}\n\n\tget(): T | undefined {\n\t\treturn this._getterFn ? this._getterFn(this._value) : this._value;\n\t}\n\n\t/**\n\t * Dispatch a signal to all current subscribers via the output slot.\n\t *\n\t * Safety: P_MULTI flag and _output type are always updated together.\n\t * No reentrancy can occur between the two assignments (source() doesn't\n\t * trigger dispatch, and dispatch doesn't trigger source()). The null-check\n\t * provides an additional guard for the MULTI→null transition path.\n\t */\n\t_dispatch(type: number, data?: any): void {\n\t\tconst output = this._output;\n\t\tif (!output) return;\n\t\tif (this._flags & P_MULTI) {\n\t\t\tfor (const sink of output as Set<any>) sink(type, data);\n\t\t} else {\n\t\t\t(output as (type: number, data?: any) => void)(type, data);\n\t\t}\n\t}\n\n\temit(value: T): void {\n\t\tif (this._flags & P_COMPLETED) return;\n\t\tif (this._eqFn && this._value !== undefined && this._eqFn(this._value as T, value)) return;\n\t\tthis._value = value;\n\t\tif (!this._output) return;\n\t\tif (isBatching()) {\n\t\t\tif (!(this._flags & P_PENDING)) {\n\t\t\t\tthis._flags |= P_PENDING;\n\t\t\t\tif (this._flags & P_AUTO_DIRTY) {\n\t\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_DIRTY;\n\t\t\t\t\tthis._dispatch(STATE, DIRTY);\n\t\t\t\t}\n\t\t\t\tdeferEmission(() => {\n\t\t\t\t\tthis._flags &= ~P_PENDING;\n\t\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_SETTLED;\n\t\t\t\t\tthis._dispatch(DATA, this._value);\n\t\t\t\t});\n\t\t\t}\n\t\t} else {\n\t\t\tif (this._flags & P_AUTO_DIRTY) {\n\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_DIRTY;\n\t\t\t\tthis._dispatch(STATE, DIRTY);\n\t\t\t}\n\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_SETTLED;\n\t\t\tthis._dispatch(DATA, this._value);\n\t\t}\n\t}\n\n\tsignal(s: Signal): void {\n\t\tif (this._flags & P_COMPLETED || !this._output) return;\n\t\tif (s === DIRTY) this._flags = (this._flags & ~_STATUS_MASK) | _S_DIRTY;\n\t\telse if (s === RESOLVED) this._flags = (this._flags & ~_STATUS_MASK) | _S_RESOLVED;\n\t\t// Unknown signals: dispatch without _status change (v4 forward-compat)\n\t\tthis._dispatch(STATE, s);\n\t}\n\n\tcomplete(): void {\n\t\tif (this._flags & P_COMPLETED) return;\n\t\tthis._flags = ((this._flags | P_COMPLETED) & ~_STATUS_MASK) | _S_COMPLETED;\n\t\tconst output = this._output;\n\t\tconst wasMulti = this._flags & P_MULTI;\n\t\tthis._output = null;\n\t\tthis._flags &= ~P_MULTI;\n\t\tthis._stop();\n\t\tif (output) {\n\t\t\tif (wasMulti) {\n\t\t\t\tfor (const sink of output as Set<any>) sink(END);\n\t\t\t} else {\n\t\t\t\t(output as (type: number, data?: any) => void)(END);\n\t\t\t}\n\t\t}\n\t}\n\n\terror(e: unknown): void {\n\t\tif (this._flags & P_COMPLETED) return;\n\t\tthis._flags = ((this._flags | P_COMPLETED) & ~_STATUS_MASK) | _S_ERRORED;\n\t\tconst output = this._output;\n\t\tconst wasMulti = this._flags & P_MULTI;\n\t\tthis._output = null;\n\t\tthis._flags &= ~P_MULTI;\n\t\tthis._stop();\n\t\tif (output) {\n\t\t\tif (wasMulti) {\n\t\t\t\tfor (const sink of output as Set<any>) sink(END, e);\n\t\t\t} else {\n\t\t\t\t(output as (type: number, data?: any) => void)(END, e);\n\t\t\t}\n\t\t}\n\t}\n\n\t_start(): void {\n\t\tif (this._flags & P_STARTED || !this._fn) return;\n\t\tthis._flags |= P_STARTED;\n\t\tconst result = this._fn(this as any);\n\t\tthis._cleanup = typeof result === \"function\" ? result : undefined;\n\t}\n\n\t_stop(): void {\n\t\tif (!(this._flags & P_STARTED)) return;\n\t\tthis._flags &= ~P_STARTED;\n\t\tif (this._cleanup) this._cleanup();\n\t\tthis._cleanup = undefined;\n\t\tif (this._flags & P_RESET) this._value = this._initial;\n\t\tif (!(this._flags & P_COMPLETED)) this._flags = (this._flags & ~_STATUS_MASK) | _S_DISCONNECTED;\n\t}\n\n\tsource(type: number, payload?: any): void {\n\t\tif (type === START) {\n\t\t\tconst sink = payload;\n\t\t\tif (this._flags & P_COMPLETED) {\n\t\t\t\tif (this._flags & P_RESUB && this._output === null) {\n\t\t\t\t\tthis._flags = (this._flags & ~(P_COMPLETED | _STATUS_MASK)) | _S_DISCONNECTED;\n\t\t\t\t} else {\n\t\t\t\t\tsink(START, (_t: number) => {});\n\t\t\t\t\tsink(END);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (this._output === null) {\n\t\t\t\tthis._output = sink;\n\t\t\t} else if (!(this._flags & P_MULTI)) {\n\t\t\t\tconst set = new Set<any>();\n\t\t\t\tset.add(this._output);\n\t\t\t\tset.add(sink);\n\t\t\t\tthis._output = set;\n\t\t\t\tthis._flags |= P_MULTI;\n\t\t\t} else {\n\t\t\t\t(this._output as Set<any>).add(sink);\n\t\t\t}\n\t\t\tsink(START, (t: number) => {\n\t\t\t\tif (t === DATA) sink(DATA, this._value);\n\t\t\t\tif (t === END) {\n\t\t\t\t\tif (this._output === null) return;\n\t\t\t\t\tif (this._flags & P_MULTI) {\n\t\t\t\t\t\tconst set = this._output as Set<any>;\n\t\t\t\t\t\tset.delete(sink);\n\t\t\t\t\t\tif (set.size === 1) {\n\t\t\t\t\t\t\tthis._output = set.values().next().value;\n\t\t\t\t\t\t\tthis._flags &= ~P_MULTI;\n\t\t\t\t\t\t} else if (set.size === 0) {\n\t\t\t\t\t\t\tthis._output = null;\n\t\t\t\t\t\t\tthis._flags &= ~P_MULTI;\n\t\t\t\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_DISCONNECTED;\n\t\t\t\t\t\t\tthis._stop();\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (this._output === sink) {\n\t\t\t\t\t\tthis._output = null;\n\t\t\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_DISCONNECTED;\n\t\t\t\t\t\tthis._stop();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\t\tdeferStart(() => this._start());\n\t\t}\n\t}\n}\n\nexport function producer<T>(\n\tfn: ProducerFn<T> | undefined,\n\topts: ProducerOpts<T> & { initial: T },\n): ProducerStore<T> & Store<T>;\nexport function producer<T>(fn?: ProducerFn<T>, opts?: ProducerOpts<T>): ProducerStore<T>;\nexport function producer<T>(fn?: ProducerFn<T>, opts?: ProducerOpts<T>): ProducerStore<T> {\n\treturn new ProducerImpl<T>(fn, opts) as any;\n}\n","/**\n * Core subscribe — reusable callbag sink connector.\n *\n * Used as the base for:\n * - External subscribe (extra/subscribe re-exports this)\n * - Derived's dep connections (STANDALONE mode)\n * - Effect's dep connections\n *\n * v4: Handles callbag START handshake, filters STATE for user callbacks,\n * provides prev-value tracking. Returns unsub function.\n */\n\nimport { beginDeferredStart, END, endDeferredStart, START } from \"./protocol\";\nimport type { Store } from \"./types\";\n\nexport function subscribe<T>(\n\tstore: Store<T>,\n\tcb: (value: T, prev: T | undefined) => void,\n\topts?: { onEnd?: (error?: unknown) => void },\n): () => void {\n\tlet talkback: ((type: number) => void) | null = null;\n\n\tbeginDeferredStart();\n\n\t// `prev` is declared after store.source() but the closure only reads it\n\t// after endDeferredStart() triggers producers. By that point prev is already\n\t// set to store.get(). Order: register sink → read baseline → start producers.\n\tstore.source(START, (type: number, data: any) => {\n\t\tif (type === START) talkback = data;\n\t\tif (type === END) {\n\t\t\ttalkback = null;\n\t\t\topts?.onEnd?.(data);\n\t\t\treturn;\n\t\t}\n\t\t// Transparent sink — forwards every DATA to the callback.\n\t\t// Dedup (if desired) belongs in the source (state's equals) or in\n\t\t// an explicit operator (distinctUntilChanged), not here.\n\t\tif (type === 1 /* DATA */) {\n\t\t\tconst next = data as T;\n\t\t\tconst p = prev;\n\t\t\tprev = next;\n\t\t\tcb(next, p);\n\t\t}\n\t});\n\n\t// Baseline: captures current value before producers start. Aligns with\n\t// RxJS Observable semantics — no initial-value callback on subscribe.\n\tlet prev: T | undefined = store.get();\n\n\tendDeferredStart();\n\n\treturn () => talkback?.(END);\n}\n"],"mappings":"ibAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,gBAAAE,KAAA,eAAAC,GAAAH,ICQO,IAAMI,EAAQ,OAAO,OAAO,EAGtBC,EAAW,OAAO,UAAU,EAiB5BC,EAAiB,EACjBC,EAAU,EACVC,EAAY,EACZC,EAAa,EACbC,EAAc,EACdC,EAAY,EACZC,EAAe,EACfC,EAAc,GAASD,EAE9BE,GAA+B,CACpC,eACA,QACA,UACA,WACA,YACA,SACD,EAGO,SAASC,EAAaC,EAA2B,CACvD,OAAOF,IAAgBE,EAAQH,KAAiBD,CAAY,CAC7D,CAGO,IAAMK,EAAQ,EACRC,EAAO,EACPC,EAAM,EACNC,EAAQ,EAMjBC,GAAa,EACXC,GAAuC,CAAC,EA6BvC,SAASC,GAAsB,CACrC,OAAOC,GAAa,CACrB,CAEO,SAASC,EAAcC,EAAsB,CACnDC,GAAkB,KAAKD,CAAE,CAC1B,CAMA,IAAIE,EAAe,EACbC,EAAmC,CAAC,EAEnC,SAASC,GAA2B,CAC1CF,GACD,CAEO,SAASG,GAAyB,CAExC,GADAH,IACIA,IAAiB,EAAG,CACvB,QAASI,EAAI,EAAGA,EAAIH,EAAc,OAAQG,IACzCH,EAAcG,CAAC,EAAE,EAElBH,EAAc,OAAS,CACxB,CACD,CAEO,SAASI,EAAWC,EAAyB,CAC/CN,EAAe,EAClBC,EAAc,KAAKK,CAAK,EAExBA,EAAM,CAER,CC7EO,IAAMC,EAAN,MAAMC,CAAU,CAEtB,OAAe,OAAS,IAAI,QAC5B,OAAe,OAAS,IAAI,QAC5B,OAAe,MAAQ,IAAI,QAG3B,OAAe,QAAU,IAAI,IAG7B,OAAe,OAAS,IAAI,IAG5B,OAAe,QAAU,EACzB,OAAe,UAAY,IAAI,IAG/B,OAAe,iBAAmC,KAClD,OAAe,eAAiC,KAEhD,WAAW,SAAmB,CAC7B,GAAIA,EAAU,mBAAqB,KAAM,OAAOA,EAAU,iBAC1D,GAAIA,EAAU,iBAAmB,KAAM,OAAOA,EAAU,eACxD,GAAI,CACHA,EAAU,eAAkB,WAAmB,SAAS,KAAK,WAAa,YAC3E,MAAQ,CACPA,EAAU,eAAiB,EAC5B,CACA,OAAOA,EAAU,cAClB,CAEA,WAAW,QAAQC,EAAgB,CAClCD,EAAU,iBAAmBC,CAC9B,CAGA,OAAe,WAAWC,EAAqC,CAC9D,GAAI,CAACA,GAAM,OAAQ,OAEnB,IAAMC,EADQD,EAAK,IAAKE,GAAMJ,EAAU,OAAO,IAAII,CAAC,GAAK,GAAG,EACvC,KAAK,GAAG,EAC7B,OAAOD,EAAO,OAAS,GAAK,GAAGA,EAAO,MAAM,EAAG,EAAE,CAAC,MAAQA,CAC3D,CAGA,OAAe,YAAYE,EAAsB,CAChD,OAAOL,EAAU,MAAM,IAAIK,CAAI,GAAKL,EAAU,OAAO,IAAIK,CAAI,GAAK,WACnE,CAGA,OAAO,SAASA,EAAcC,EAAgE,CAC7F,GAAI,CAACN,EAAU,QAAS,OACpBM,GAAM,MAAMN,EAAU,OAAO,IAAIK,EAAMC,EAAK,IAAI,EAChDA,GAAM,MAAMN,EAAU,OAAO,IAAIK,EAAMC,EAAK,IAAI,EAGpD,IAAMC,EAAKP,EAAU,UACjBQ,EAAMF,GAAM,KAChB,GAAI,EAAAE,GAAO,CAACR,EAAU,UAAU,IAAIQ,CAAG,GAEhC,GAAIA,EAAK,CAEf,IAAMC,EAAYT,EAAU,WAAWM,GAAM,IAAI,EACjDE,EAAMC,EAAY,GAAGD,CAAG,IAAIC,CAAS,IAAM,GAAGD,CAAG,IAAID,CAAE,GACnDP,EAAU,UAAU,IAAIQ,CAAG,IAAGA,EAAM,GAAGA,CAAG,IAAID,CAAE,GACrD,KAAO,CAEN,IAAMG,EAAOJ,GAAM,MAAQ,QACrBG,EAAYT,EAAU,WAAWM,GAAM,IAAI,EACjDE,EAAMC,EAAY,GAAGC,CAAI,IAAID,CAAS,IAAM,GAAGC,CAAI,IAAIH,CAAE,GACrDP,EAAU,UAAU,IAAIQ,CAAG,IAAGA,EAAM,GAAGA,CAAG,IAAID,CAAE,GACrD,CAEAP,EAAU,UAAU,IAAIQ,CAAG,EAC3BR,EAAU,MAAM,IAAIK,EAAMG,CAAG,EAC7BR,EAAU,QAAQ,IAAI,IAAI,QAAQK,CAAI,CAAC,CACxC,CAGA,OAAO,aAAaM,EAAgBC,EAAqB,CACxD,GAAI,CAACZ,EAAU,QAAS,OACxB,IAAMa,EAAYb,EAAU,YAAYW,CAAM,EACxCG,EAAWd,EAAU,YAAYY,CAAK,EACtCG,EAAWf,EAAU,OAAO,IAAIa,CAAS,EAC3CE,EACEA,EAAS,SAASD,CAAQ,GAAGC,EAAS,KAAKD,CAAQ,EAExDd,EAAU,OAAO,IAAIa,EAAW,CAACC,CAAQ,CAAC,CAE5C,CAGA,OAAO,UAAkC,CACxC,OAAO,IAAI,IAAId,EAAU,MAAM,CAChC,CAGA,OAAO,QAAQK,EAAkC,CAChD,GAAKL,EAAU,QACf,OAAOA,EAAU,OAAO,IAAIK,CAAI,CACjC,CAGA,OAAO,QAAQA,EAAkC,CAChD,OAAOL,EAAU,OAAO,IAAIK,CAAI,CACjC,CAGA,OAAO,QAAqBA,EAA4B,CACvD,MAAO,CACN,KAAML,EAAU,OAAO,IAAIK,CAAI,EAC/B,KAAML,EAAU,OAAO,IAAIK,CAAI,GAAK,UACpC,MAAQ,OAAQA,EAAa,KAAQ,WAAcA,EAAa,IAAI,EAAI,OACxE,OAASA,EAAa,OACvB,CACD,CAGA,OAAO,OAAgC,CACtC,IAAMW,EAAS,IAAI,IACbC,EAAa,IAAI,IACvB,QAAWC,KAAOlB,EAAU,QAAS,CACpC,IAAMK,EAAOa,EAAI,MAAM,EACvB,GAAI,CAACb,EAAM,CACVL,EAAU,QAAQ,OAAOkB,CAAG,EAC5B,QACD,CACA,IAAMV,EAAMR,EAAU,YAAYK,CAAI,EACtCY,EAAW,IAAIT,CAAG,EAClBQ,EAAO,IAAIR,EAAKR,EAAU,QAAQK,CAAI,CAAC,CACxC,CAEA,OAAW,CAACG,EAAKO,CAAQ,IAAKf,EAAU,OAAQ,CAC/C,GAAI,CAACiB,EAAW,IAAIT,CAAG,EAAG,CACzBR,EAAU,OAAO,OAAOQ,CAAG,EAC3BR,EAAU,UAAU,OAAOQ,CAAG,EAC9B,QACD,CACA,IAAMW,EAAQJ,EAAS,OAAQK,GAAMH,EAAW,IAAIG,CAAC,CAAC,EAClDD,EAAM,SAAW,EACpBnB,EAAU,OAAO,OAAOQ,CAAG,EACjBW,EAAM,SAAWJ,EAAS,QACpCf,EAAU,OAAO,IAAIQ,EAAKW,CAAK,CAEjC,CACA,OAAOH,CACR,CAGA,OAAO,MAASK,EAAiBC,EAAyD,CACzF,IAAIC,EAA4C,KAC5CC,EAAsBH,EAAM,IAAI,EACpC,OAAAA,EAAM,OAAOI,EAAO,CAACC,EAAcC,IAAc,CAEhD,GADID,IAASD,IAAOF,EAAWI,GAC3BD,IAASE,EAAK,CACjBL,EAAW,KACX,MACD,CACA,GAAIG,IAAS,EAAG,CACf,IAAMG,EAAOF,EACb,GAAI,CAAC,OAAO,GAAGE,EAAML,CAAI,EAAG,CAC3B,IAAMM,EAAIN,EACVA,EAAOK,EACPP,EAAGO,EAAMC,CAAC,CACX,CACD,CACD,CAAC,EACM,IAAMP,IAAWK,CAAG,CAC5B,CAGA,OAAO,WAAoB,CAC1B,IAAMG,EAAI/B,EAAU,MAAM,EACpBgC,EAAQhC,EAAU,SAAS,EAG3BiC,EAAU,IAAI,IACpB,OAAW,CAACtB,EAAQI,CAAQ,IAAKiB,EAChC,QAAWpB,KAASG,EAAU,CAC7B,IAAMb,EAAO+B,EAAQ,IAAIrB,CAAK,EAC1BV,EACEA,EAAK,SAASS,CAAM,GAAGT,EAAK,KAAKS,CAAM,EAE5CsB,EAAQ,IAAIrB,EAAO,CAACD,CAAM,CAAC,CAE7B,CAGD,IAAMuB,EAAkB,CAAC,EACzB,OAAW,CAAC1B,EAAK2B,CAAI,IAAKJ,EAAG,CAC5B,IAAM7B,EAAO+B,EAAQ,IAAIzB,CAAG,EACtBO,EAAWiB,EAAM,IAAIxB,CAAG,EACxB4B,EAAUlC,GAAM,OAAS,aAAQA,EAAK,KAAK,IAAI,CAAC,IAAM,GACtDmC,EAAWtB,GAAU,OAAS,aAAQA,EAAS,KAAK,IAAI,CAAC,IAAM,GACrEmB,EAAM,KACL,KAAK1B,CAAG,KAAK2B,EAAK,IAAI,OAAO,KAAK,UAAUA,EAAK,KAAK,CAAC,MAAMA,EAAK,QAAU,GAAG,IAAIC,CAAO,GAAGC,CAAQ,EACtG,CACD,CAEA,MAAO,CADQ,gBAAgBN,EAAE,IAAI,WACrB,GAAGG,CAAK,EAAE,KAAK;AAAA,CAAI,CACpC,CAKA,OAAe,SACdb,EACAiB,EACAC,EACmB,CACnB,IAAIhB,EAA4C,KAC1CiB,EAAOF,GAAStC,EAAU,QAAQqB,CAAK,EACvCL,EAA2B,CAChC,OAAQ,CAAC,EACT,QAAS,CAAC,EACV,OAAQ,CAAC,EACT,MAAO,GACP,SAAU,OACV,WAAY,EACZ,cAAe,EACf,KAAAwB,EACA,QAAS,IAAMjB,IAAWK,CAAG,CAC9B,EAEA,OAAAP,EAAM,OAAOI,EAAO,CAACC,EAAcC,IAAc,CAChD,GAAID,IAASD,EAAO,CACnBF,EAAWI,EACX,MACD,CACID,IAASe,GACZzB,EAAO,OAAO,KAAKW,CAAI,EACvBX,EAAO,OAAO,KAAK,CAAE,KAAM,OAAQ,KAAAW,CAAK,CAAC,EACrCY,GAAKA,EAAI,IAAIC,CAAI,UAAWb,CAAI,GAC1BD,IAASgB,GACnB1B,EAAO,QAAQ,KAAKW,CAAI,EACxBX,EAAO,OAAO,KAAK,CAAE,KAAM,SAAU,KAAAW,CAAK,CAAC,EACvCA,IAASgB,EAAO3B,EAAO,aAClBW,IAASiB,GAAU5B,EAAO,gBAC/BuB,GAAKA,EAAI,IAAIC,CAAI,WAAYb,CAAI,GAC3BD,IAASE,IACnBZ,EAAO,MAAQ,GACfA,EAAO,SAAWW,EAClBX,EAAO,OAAO,KAAK,CAAE,KAAM,MAAO,KAAAW,CAAK,CAAC,EACpCY,GAAKA,EAAI,IAAIC,CAAI,QAASb,IAAS,OAAYA,EAAO,EAAE,EAC5DJ,EAAW,KAEb,CAAC,EAEMP,CACR,CAmBA,OAAO,QAAWK,EAAmC,CACpD,OAAOrB,EAAU,SAASqB,CAAK,CAChC,CAQA,OAAO,IAAOA,EAAiBmB,EAAyB,CACvD,IAAMK,EAAUL,GAAQ,OAAOxC,EAAU,QAAQqB,CAAK,GAAK,MAAM,IAC3DyB,EAAoB,CACzB,IAAK,IAAMzB,EAAM,IAAI,EACrB,OAAQA,EAAM,MACf,EACA,OAAArB,EAAU,SAAS8C,EAAS,CAAE,KAAMD,EAAS,KAAM,KAAM,CAAC,EAC1D7C,EAAU,aAAaqB,EAAOyB,CAAO,EAC9BA,CACR,CAOA,OAAO,IACNzB,EACAf,EACmB,CACnB,IAAMgC,EAAQhC,GAAM,MAAQN,EAAU,QAAQqB,CAAK,GAAK,MAClDkB,EAAMjC,GAAM,KAAO,QAAQ,IACjC,OAAON,EAAU,SAASqB,EAAOiB,EAAOC,CAAG,CAC5C,CAMA,OAAO,UAGL,CACD,IAAMR,EAAI/B,EAAU,MAAM,EACpB+C,EAAU/C,EAAU,SAAS,EAC7BgD,EACL,CAAC,EACF,OAAW,CAACxC,EAAK2B,CAAI,IAAKJ,EACzBiB,EAAM,KAAK,CAAE,KAAMxC,EAAK,KAAM2B,EAAK,KAAM,MAAOA,EAAK,MAAO,OAAQA,EAAK,MAAO,CAAC,EAElF,IAAMH,EAA6C,CAAC,EACpD,OAAW,CAACrB,EAAQI,CAAQ,IAAKgC,EAChC,QAAWnC,KAASG,EACnBiB,EAAM,KAAK,CAAE,KAAMrB,EAAQ,GAAIC,CAAM,CAAC,EAGxC,MAAO,CAAE,MAAAoC,EAAO,MAAAhB,CAAM,CACvB,CAGA,OAAO,QAAe,CACrBhC,EAAU,OAAS,IAAI,QACvBA,EAAU,OAAS,IAAI,QACvBA,EAAU,MAAQ,IAAI,QACtBA,EAAU,QAAU,IAAI,IACxBA,EAAU,OAAS,IAAI,IACvBA,EAAU,UAAY,IAAI,IAC1BA,EAAU,QAAU,EACpBA,EAAU,iBAAmB,KAC7BA,EAAU,eAAiB,IAC5B,CACD,ECzUA,IAAMiD,EAAY,EACZC,EAAU,GAGHC,EAAc,EACdC,EAAe,EACtBC,EAAU,EACVC,EAAU,GACHC,EAAY,GAGZC,EAAeC,EACfC,EAAWC,GAAWC,EACtBC,EAAaC,GAAaF,EAC1BG,EAAkBC,GAAkBJ,EACpCK,GAAeC,GAAeN,EAC9BO,GAAaC,GAAaR,EAC1BS,GAAcC,GAAcV,EAE5BW,EAAN,KAAsB,CAC5B,OACA,QAAkE,KAClE,OAEA,IAAI,SAAU,CACb,OAAOC,EAAa,KAAK,MAAM,CAChC,CACA,SACA,IACA,MACA,UACA,SAEA,YAAYC,EAAoBC,EAAwB,CACvD,KAAK,OAASA,GAAM,QACpB,KAAK,IAAMD,EACX,KAAK,MAAQC,GAAM,OACnB,KAAK,UAAYA,GAAM,OACvB,KAAK,SAAWA,GAAM,QAEtB,IAAIC,EAAQ,EACRD,GAAM,YAAc,KAAOC,GAASvB,GACpCsB,GAAM,kBAAiBC,GAAStB,GAChCqB,GAAM,iBAAgBC,GAASrB,GAEnC,KAAK,OAASqB,EAId,KAAK,OAAS,KAAK,OAAO,KAAK,IAAI,EACnC,KAAK,KAAO,KAAK,KAAK,KAAK,IAAI,EAC/B,KAAK,OAAS,KAAK,OAAO,KAAK,IAAI,EACnC,KAAK,SAAW,KAAK,SAAS,KAAK,IAAI,EACvC,KAAK,MAAQ,KAAK,MAAM,KAAK,IAAI,EAE5BD,GAAM,cAAcE,EAAU,SAAS,KAAa,CAAE,KAAM,WAAY,GAAGF,CAAK,CAAC,CACvF,CAEA,KAAqB,CACpB,OAAO,KAAK,UAAY,KAAK,UAAU,KAAK,MAAM,EAAI,KAAK,MAC5D,CAUA,UAAUG,EAAcC,EAAkB,CACzC,IAAMC,EAAS,KAAK,QACpB,GAAKA,EACL,GAAI,KAAK,OAAS7B,EACjB,QAAW8B,KAAQD,EAAoBC,EAAKH,EAAMC,CAAI,OAErDC,EAA8CF,EAAMC,CAAI,CAE3D,CAEA,KAAKG,EAAgB,CAChB,KAAK,OAAS9B,GACd,KAAK,OAAS,KAAK,SAAW,QAAa,KAAK,MAAM,KAAK,OAAa8B,CAAK,IACjF,KAAK,OAASA,EACT,KAAK,UACNC,EAAW,EACR,KAAK,OAAS3B,IACnB,KAAK,QAAUA,EACX,KAAK,OAASH,IACjB,KAAK,OAAU,KAAK,OAAS,CAACI,EAAgBE,EAC9C,KAAK,UAAUyB,EAAOC,CAAK,GAE5BC,EAAc,IAAM,CACnB,KAAK,QAAU,CAAC9B,EAChB,KAAK,OAAU,KAAK,OAAS,CAACC,EAAgBK,EAC9C,KAAK,UAAUyB,EAAM,KAAK,MAAM,CACjC,CAAC,IAGE,KAAK,OAASlC,IACjB,KAAK,OAAU,KAAK,OAAS,CAACI,EAAgBE,EAC9C,KAAK,UAAUyB,EAAOC,CAAK,GAE5B,KAAK,OAAU,KAAK,OAAS,CAAC5B,EAAgBK,EAC9C,KAAK,UAAUyB,EAAM,KAAK,MAAM,IAElC,CAEA,OAAOC,EAAiB,CACnB,KAAK,OAASpC,GAAe,CAAC,KAAK,UACnCoC,IAAMH,EAAO,KAAK,OAAU,KAAK,OAAS,CAAC5B,EAAgBE,EACtD6B,IAAMC,IAAU,KAAK,OAAU,KAAK,OAAS,CAAChC,EAAgBa,IAEvE,KAAK,UAAUc,EAAOI,CAAC,EACxB,CAEA,UAAiB,CAChB,GAAI,KAAK,OAASpC,EAAa,OAC/B,KAAK,QAAW,KAAK,OAASA,GAAe,CAACK,EAAgBS,GAC9D,IAAMc,EAAS,KAAK,QACdU,EAAW,KAAK,OAASvC,EAI/B,GAHA,KAAK,QAAU,KACf,KAAK,QAAU,CAACA,EAChB,KAAK,MAAM,EACP6B,EACH,GAAIU,EACH,QAAWT,KAAQD,EAAoBC,EAAKU,CAAG,OAE9CX,EAA8CW,CAAG,CAGrD,CAEA,MAAMC,EAAkB,CACvB,GAAI,KAAK,OAASxC,EAAa,OAC/B,KAAK,QAAW,KAAK,OAASA,GAAe,CAACK,EAAgBW,GAC9D,IAAMY,EAAS,KAAK,QACdU,EAAW,KAAK,OAASvC,EAI/B,GAHA,KAAK,QAAU,KACf,KAAK,QAAU,CAACA,EAChB,KAAK,MAAM,EACP6B,EACH,GAAIU,EACH,QAAWT,KAAQD,EAAoBC,EAAKU,EAAKC,CAAC,OAEjDZ,EAA8CW,EAAKC,CAAC,CAGxD,CAEA,QAAe,CACd,GAAI,KAAK,OAAS1C,GAAa,CAAC,KAAK,IAAK,OAC1C,KAAK,QAAUA,EACf,IAAM2C,EAAS,KAAK,IAAI,IAAW,EACnC,KAAK,SAAW,OAAOA,GAAW,WAAaA,EAAS,MACzD,CAEA,OAAc,CACP,KAAK,OAAS3C,IACpB,KAAK,QAAU,CAACA,EACZ,KAAK,UAAU,KAAK,SAAS,EACjC,KAAK,SAAW,OACZ,KAAK,OAASI,IAAS,KAAK,OAAS,KAAK,UACxC,KAAK,OAASF,IAAc,KAAK,OAAU,KAAK,OAAS,CAACK,EAAgBO,GACjF,CAEA,OAAOc,EAAcgB,EAAqB,CACzC,GAAIhB,IAASiB,EAAO,CACnB,IAAMd,EAAOa,EACb,GAAI,KAAK,OAAS1C,EACjB,GAAI,KAAK,OAASG,GAAW,KAAK,UAAY,KAC7C,KAAK,OAAU,KAAK,OAAS,EAAEH,EAAcK,GAAiBO,MACxD,CACNiB,EAAKc,EAAQC,GAAe,CAAC,CAAC,EAC9Bf,EAAKU,CAAG,EACR,MACD,CAED,GAAI,KAAK,UAAY,KACpB,KAAK,QAAUV,UACH,KAAK,OAAS9B,EAOzB,KAAK,QAAqB,IAAI8B,CAAI,MAPC,CACpC,IAAMgB,EAAM,IAAI,IAChBA,EAAI,IAAI,KAAK,OAAO,EACpBA,EAAI,IAAIhB,CAAI,EACZ,KAAK,QAAUgB,EACf,KAAK,QAAU9C,CAChB,CAGA8B,EAAKc,EAAQG,GAAc,CAE1B,GADIA,IAAMX,GAAMN,EAAKM,EAAM,KAAK,MAAM,EAClCW,IAAMP,EAAK,CACd,GAAI,KAAK,UAAY,KAAM,OAC3B,GAAI,KAAK,OAASxC,EAAS,CAC1B,IAAM8C,EAAM,KAAK,QACjBA,EAAI,OAAOhB,CAAI,EACXgB,EAAI,OAAS,GAChB,KAAK,QAAUA,EAAI,OAAO,EAAE,KAAK,EAAE,MACnC,KAAK,QAAU,CAAC9C,GACN8C,EAAI,OAAS,IACvB,KAAK,QAAU,KACf,KAAK,QAAU,CAAC9C,EAChB,KAAK,OAAU,KAAK,OAAS,CAACM,EAAgBO,EAC9C,KAAK,MAAM,EAEb,MAAW,KAAK,UAAYiB,IAC3B,KAAK,QAAU,KACf,KAAK,OAAU,KAAK,OAAS,CAACxB,EAAgBO,EAC9C,KAAK,MAAM,EAEb,CACD,CAAC,EACDmC,EAAW,IAAM,KAAK,OAAO,CAAC,CAC/B,CACD,CACD,EAOO,SAASC,EAAY1B,EAAoBC,EAA0C,CACzF,OAAO,IAAIH,EAAgBE,EAAIC,CAAI,CACpC,CC3QO,SAAS0B,EACfC,EACAC,EACAC,EACa,CACb,IAAIC,EAA4C,KAEhDC,EAAmB,EAKnBJ,EAAM,OAAOK,EAAO,CAACC,EAAcC,IAAc,CAEhD,GADID,IAASD,IAAOF,EAAWI,GAC3BD,IAASE,EAAK,CACjBL,EAAW,KACXD,GAAM,QAAQK,CAAI,EAClB,MACD,CAIA,GAAID,IAAS,EAAc,CAC1B,IAAMG,EAAOF,EACPG,EAAIC,EACVA,EAAOF,EACPR,EAAGQ,EAAMC,CAAC,CACX,CACD,CAAC,EAID,IAAIC,EAAsBX,EAAM,IAAI,EAEpC,OAAAY,EAAiB,EAEV,IAAMT,IAAWK,CAAG,CAC5B,CJ5BO,SAASK,GACfC,EACAC,EACkC,CAClC,OAAQC,GAAoB,CAC3B,IAAMC,EAAQC,EACb,CAAC,CAAE,KAAAC,EAAM,MAAAC,EAAO,SAAAC,CAAS,IAAM,CAC9B,IAAIC,EAAiD,KACjDC,EAAc,GACdC,EAAY,GAEhB,SAASC,EAAeC,EAAsB,CAC7CH,EAAc,GACdJ,EAAKO,EAAW,IAAI,CAAC,EACrBA,EAAW,OAAOC,EAAO,CAACC,EAAcC,IAAkB,CACrDD,IAASD,IAAOL,EAAgBO,GAChCD,IAAS,GAAGT,EAAKU,CAAS,EAC1BD,IAASE,IACZR,EAAgB,KACZO,IAAS,OACZT,EAAMS,CAAI,GAEVN,EAAc,GACVC,GAAWH,EAAS,GAG3B,CAAC,CACF,CAEA,IAAMU,EAAaC,EAClBhB,EACCiB,GAAM,CACDV,GAAaE,EAAeX,EAAGmB,CAAC,CAAC,CACvC,EACA,CACC,MAAQC,GAAQ,CACXA,IAAQ,OACXd,EAAMc,CAAG,GAETV,EAAY,GACPD,GAAaF,EAAS,EAE7B,CACD,CACD,EAEA,MAAO,IAAM,CACRC,GAAeA,EAAcQ,CAAG,EACpCC,EAAW,CACZ,CACD,EACAhB,GAAQ,YAAaA,EAAO,CAAE,QAASA,EAAK,OAAa,EAAI,MAC9D,EAEA,OAAAoB,EAAU,SAASlB,EAAO,CAAE,KAAM,YAAa,CAAC,EACzCA,CACR,CACD","names":["exhaustMap_exports","__export","exhaustMap","__toCommonJS","DIRTY","RESOLVED","S_DISCONNECTED","S_DIRTY","S_SETTLED","S_RESOLVED","S_COMPLETED","S_ERRORED","STATUS_SHIFT","STATUS_MASK","STATUS_STRINGS","decodeStatus","flags","START","DATA","END","STATE","batchDepth","deferredEmissions","isBatching","batchDepth","deferEmission","fn","deferredEmissions","connectDepth","pendingStarts","beginDeferredStart","endDeferredStart","i","deferStart","start","Inspector","_Inspector","value","deps","joined","d","node","opts","id","key","depSuffix","kind","parent","child","parentKey","childKey","children","result","livingKeys","ref","alive","c","store","cb","talkback","prev","START","type","data","END","next","p","g","edges","depsMap","lines","info","depsStr","childStr","label","log","name","DATA","STATE","DIRTY","RESOLVED","tapName","wrapper","edgeMap","nodes","P_STARTED","P_MULTI","P_COMPLETED","P_AUTO_DIRTY","P_RESET","P_RESUB","P_PENDING","_STATUS_MASK","STATUS_MASK","_S_DIRTY","S_DIRTY","STATUS_SHIFT","_S_SETTLED","S_SETTLED","_S_DISCONNECTED","S_DISCONNECTED","_S_COMPLETED","S_COMPLETED","_S_ERRORED","S_ERRORED","_S_RESOLVED","S_RESOLVED","ProducerImpl","decodeStatus","fn","opts","flags","Inspector","type","data","output","sink","value","isBatching","STATE","DIRTY","deferEmission","DATA","s","RESOLVED","wasMulti","END","e","result","payload","START","_t","set","t","deferStart","producer","subscribe","store","cb","opts","talkback","beginDeferredStart","START","type","data","END","next","p","prev","endDeferredStart","exhaustMap","fn","opts","outer","store","producer","emit","error","complete","innerTalkback","innerActive","outerDone","subscribeInner","innerStore","START","type","data","END","outerUnsub","subscribe","v","err","Inspector"]}

package/dist/extra/exhaustMap.d.cts

@@ -0,0 +1,21 @@
+import { S as Store, a as StoreOperator } from '../types-DsAN6Hga.cjs';
+
+/**
+ * Maps each upstream value to an inner store via `fn`. While an inner is active,
+ * new outer values are ignored. The next outer value is accepted only after the
+ * current inner completes (sends END).
+ *
+ * v5 (Option D3): Purely reactive — does NOT eagerly evaluate fn(outer.get()).
+ * Inner subscription is only created when outer emits. get() returns `initial`
+ * (if provided) or undefined before first inner emission.
+ *
+ * Tier 2 — dynamic subscription operator. Each inner is a cycle boundary;
+ * each emit starts a new DIRTY+value cycle. No built-in dedup.
+ * Forwards inner errors and upstream completion.
+ */
+declare function exhaustMap<A, B>(fn: (value: A) => Store<B>): StoreOperator<A, B | undefined>;
+declare function exhaustMap<A, B>(fn: (value: A) => Store<B>, opts: {
+    initial: B;
+}): StoreOperator<A, B>;
+
+export { exhaustMap };

package/dist/extra/exhaustMap.d.ts

@@ -0,0 +1,21 @@
+import { S as Store, a as StoreOperator } from '../types-DsAN6Hga.js';
+
+/**
+ * Maps each upstream value to an inner store via `fn`. While an inner is active,
+ * new outer values are ignored. The next outer value is accepted only after the
+ * current inner completes (sends END).
+ *
+ * v5 (Option D3): Purely reactive — does NOT eagerly evaluate fn(outer.get()).
+ * Inner subscription is only created when outer emits. get() returns `initial`
+ * (if provided) or undefined before first inner emission.
+ *
+ * Tier 2 — dynamic subscription operator. Each inner is a cycle boundary;
+ * each emit starts a new DIRTY+value cycle. No built-in dedup.
+ * Forwards inner errors and upstream completion.
+ */
+declare function exhaustMap<A, B>(fn: (value: A) => Store<B>): StoreOperator<A, B | undefined>;
+declare function exhaustMap<A, B>(fn: (value: A) => Store<B>, opts: {
+    initial: B;
+}): StoreOperator<A, B>;
+
+export { exhaustMap };

package/dist/extra/exhaustMap.js

@@ -0,0 +1,2 @@
+import{a}from"../chunk-X6UCLV7L.js";import"../chunk-E63D25PW.js";import"../chunk-OHGZIPRU.js";import"../chunk-LM26JNAK.js";import"../chunk-7WTS4C5R.js";import"../chunk-QYUTDL4D.js";export{a as exhaustMap};
+//# sourceMappingURL=exhaustMap.js.map

package/dist/extra/exhaustMap.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/extra/filter.cjs

@@ -0,0 +1,3 @@
+"use strict";var D=Object.defineProperty;var K=Object.getOwnPropertyDescriptor;var U=Object.getOwnPropertyNames;var V=Object.prototype.hasOwnProperty;var Y=(n,t)=>{for(var i in t)D(n,i,{get:t[i],enumerable:!0})},W=(n,t,i,s)=>{if(t&&typeof t=="object"||typeof t=="function")for(let e of U(t))!V.call(n,e)&&e!==i&&D(n,e,{get:()=>t[e],enumerable:!(s=K(t,e))||s.enumerable});return n};var F=n=>W(D({},"__esModule",{value:!0}),n);var X={};Y(X,{filter:()=>Q});module.exports=F(X);var E=Symbol("DIRTY"),h=Symbol("RESOLVED"),R=0,w=1,I=2,N=3,M=4,$=5,f=7,x=7<<f,P=["DISCONNECTED","DIRTY","SETTLED","RESOLVED","COMPLETED","ERRORED"];function j(n){return P[(n&x)>>>f]}var c=0,g=1,l=2,S=3;var m=class n{static _names=new WeakMap;static _kinds=new WeakMap;static _keys=new WeakMap;static _stores=new Set;static _edges=new Map;static _nextId=0;static _usedKeys=new Set;static _explicitEnabled=null;static _cachedDefault=null;static get enabled(){if(n._explicitEnabled!==null)return n._explicitEnabled;if(n._cachedDefault!==null)return n._cachedDefault;try{n._cachedDefault=globalThis.process?.env?.NODE_ENV!=="production"}catch{n._cachedDefault=!0}return n._cachedDefault}static set enabled(t){n._explicitEnabled=t}static _depSuffix(t){if(!t?.length)return;let s=t.map(e=>n._names.get(e)??"?").join(",");return s.length>40?`${s.slice(0,37)}...`:s}static _resolveKey(t){return n._keys.get(t)??n._names.get(t)??"anonymous"}static register(t,i){if(!n.enabled)return;i?.name&&n._names.set(t,i.name),i?.kind&&n._kinds.set(t,i.kind);let s=n._nextId++,e=i?.name;if(!(e&&!n._usedKeys.has(e)))if(e){let r=n._depSuffix(i?.deps);e=r?`${e}(${r})`:`${e}_${s}`,n._usedKeys.has(e)&&(e=`${e}_${s}`)}else{let r=i?.kind??"store",o=n._depSuffix(i?.deps);e=o?`${r}(${o})`:`${r}_${s}`,n._usedKeys.has(e)&&(e=`${e}_${s}`)}n._usedKeys.add(e),n._keys.set(t,e),n._stores.add(new WeakRef(t))}static registerEdge(t,i){if(!n.enabled)return;let s=n._resolveKey(t),e=n._resolveKey(i),r=n._edges.get(s);r?r.includes(e)||r.push(e):n._edges.set(s,[e])}static getEdges(){return new Map(n._edges)}static getName(t){if(n.enabled)return n._names.get(t)}static getKind(t){return n._kinds.get(t)}static inspect(t){return{name:n._names.get(t),kind:n._kinds.get(t)??"unknown",value:typeof t.get=="function"?t.get():void 0,status:t._status}}static graph(){let t=new Map,i=new Set;for(let s of n._stores){let e=s.deref();if(!e){n._stores.delete(s);continue}let r=n._resolveKey(e);i.add(r),t.set(r,n.inspect(e))}for(let[s,e]of n._edges){if(!i.has(s)){n._edges.delete(s),n._usedKeys.delete(s);continue}let r=e.filter(o=>i.has(o));r.length===0?n._edges.delete(s):r.length!==e.length&&n._edges.set(s,r)}return t}static trace(t,i){let s=null,e=t.get();return t.source(c,(r,o)=>{if(r===c&&(s=o),r===l){s=null;return}if(r===1){let a=o;if(!Object.is(a,e)){let u=e;e=a,i(a,u)}}}),()=>s?.(l)}static dumpGraph(){let t=n.graph(),i=n.getEdges(),s=new Map;for(let[o,a]of i)for(let u of a){let p=s.get(u);p?p.includes(o)||p.push(o):s.set(u,[o])}let e=[];for(let[o,a]of t){let u=s.get(o),p=i.get(o),A=u?.length?`  \u2190 [${u.join(", ")}]`:"",T=p?.length?`  \u2192 [${p.join(", ")}]`:"";e.push(`  ${o} (${a.kind}) = ${JSON.stringify(a.value)}  [${a.status??"?"}]${A}${T}`)}return[`Store Graph (${t.size} nodes):`,...e].join(`
+`)}static _observe(t,i,s){let e=null,r=i??n.getName(t),o={values:[],signals:[],events:[],ended:!1,endError:void 0,dirtyCount:0,resolvedCount:0,name:r,dispose:()=>e?.(l)};return t.source(c,(a,u)=>{if(a===c){e=u;return}a===g?(o.values.push(u),o.events.push({type:"data",data:u}),s&&s(`[${r}] DATA:`,u)):a===S?(o.signals.push(u),o.events.push({type:"signal",data:u}),u===E?o.dirtyCount++:u===h&&o.resolvedCount++,s&&s(`[${r}] STATE:`,u)):a===l&&(o.ended=!0,o.endError=u,o.events.push({type:"end",data:u}),s&&s(`[${r}] END`,u!==void 0?u:""),e=null)}),o}static observe(t){return n._observe(t)}static tap(t,i){let s=i??`tap(${n.getName(t)??"anon"})`,e={get:()=>t.get(),source:t.source};return n.register(e,{name:s,kind:"tap"}),n.registerEdge(t,e),e}static spy(t,i){let s=i?.name??n.getName(t)??"spy",e=i?.log??console.log;return n._observe(t,s,e)}static snapshot(){let t=n.graph(),i=n.getEdges(),s=[];for(let[r,o]of t)s.push({name:r,kind:o.kind,value:o.value,status:o.status});let e=[];for(let[r,o]of i)for(let a of o)e.push({from:r,to:a});return{nodes:s,edges:e}}static _reset(){n._names=new WeakMap,n._kinds=new WeakMap,n._keys=new WeakMap,n._stores=new Set,n._edges=new Map,n._usedKeys=new Set,n._nextId=0,n._explicitEnabled=null,n._cachedDefault=null}};var b=1,k=2,L=4,d=8,B=R<<f,z=w<<f,G=I<<f,q=N<<f,H=M<<f,J=$<<f,_=x,O=class{_value;_output=null;_upstreamTalkbacks=[];_handler=null;_flags;_deps;_init;_getterFn;_initial;get _status(){return j(this._flags)}constructor(t,i,s){this._value=s?.initial,this._initial=s?.initial,this._deps=t,this._init=i,this._getterFn=s?.getter;let e=0;s?.resetOnTeardown&&(e|=k),s?.resubscribable&&(e|=L),this._flags=e,this.source=this.source.bind(this),m.register(this,{kind:s?.kind??"operator",...s,deps:t});for(let r of t)m.registerEdge(r,this)}_dispatch(t,i){let s=this._output;if(s)if(this._flags&d)for(let e of s)e(t,i);else s(t,i)}_connectUpstream(){let t=new Array(this._deps.length).fill(null);this._upstreamTalkbacks=t;let i=!1,s={seed:e=>{i||(this._value=e)},emit:e=>{i||(this._value=e,this._flags=this._flags&~_|G,this._dispatch(g,e))},signal:e=>{i||(e===E?this._flags=this._flags&~_|z:e===h&&(this._flags=this._flags&~_|q),this._dispatch(S,e))},complete:()=>{if(i)return;i=!0,this._flags=(this._flags|b)&~_|H,this._handler=null;for(let o of t)o?.(l);t.fill(null),this._flags&k&&(this._value=this._initial);let e=this._output,r=this._flags&d;if(this._output=null,this._flags&=~d,e)if(r)for(let o of e)o(l);else e(l)},error:e=>{if(i)return;i=!0,this._flags=(this._flags|b)&~_|J,this._handler=null;for(let a of t)a?.(l);t.fill(null),this._flags&k&&(this._value=this._initial);let r=this._output,o=this._flags&d;if(this._output=null,this._flags&=~d,r)if(o)for(let a of r)a(l,e);else r(l,e)},disconnect:e=>{if(e!==void 0)t[e]?.(l),t[e]=null;else{for(let r of t)r?.(l);t.fill(null)}}};this._handler=this._init(s);for(let e=0;e<this._deps.length&&!i;e++){let r=e;this._deps[r].source(c,(o,a)=>{if(o===c){t[r]=a;return}this._handler?.(r,o,a)})}}_disconnectUpstream(){for(let t of this._upstreamTalkbacks)t?.(l);this._upstreamTalkbacks=[],this._handler=null,this._flags=this._flags&~_|B,this._flags&k&&(this._value=this._initial)}get(){if(this._getterFn&&!this._output){let t=this._getterFn(this._value);return this._value=t,t}return this._value}source(t,i){if(t===c){let s=i;if(this._flags&b)if(this._flags&L&&this._output===null)this._flags=this._flags&~(b|_)|B;else{s(c,r=>{}),s(l);return}let e=this._output===null;if(this._output===null)this._output=s;else if(this._flags&d)this._output.add(s);else{let r=new Set;r.add(this._output),r.add(s),this._output=r,this._flags|=d}s(c,r=>{if(r===g&&s(g,this._value),r===l){if(this._output===null)return;if(this._flags&d){let o=this._output;o.delete(s),o.size===1?(this._output=o.values().next().value,this._flags&=~d):o.size===0&&(this._output=null,this._flags&=~d,this._disconnectUpstream())}else this._output===s&&(this._output=null,this._disconnectUpstream())}}),e&&this._connectUpstream()}}};function C(n,t,i){return new O(n,t,i)}function Q(n,t){return i=>{let s=t?.equals,e,r=i.get();return n(r)&&(e=r),C([i],({emit:o,signal:a,complete:u,error:p})=>(A,T,y)=>{if(T===S&&a(y),T===g){let v=y;if(n(v)){if(s?.(e,v)){a(h);return}e=v,o(v)}else a(h)}T===l&&(y!==void 0?p(y):u())},{kind:"filter",name:t?.name??"filter",initial:e,getter:()=>{let o=i.get();return n(o)&&(e=o),e}})}}0&&(module.exports={filter});
+//# sourceMappingURL=filter.cjs.map

package/dist/extra/filter.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/extra/filter.ts","../../src/core/protocol.ts","../../src/core/inspector.ts","../../src/core/operator.ts"],"sourcesContent":["import { operator } from \"../core/operator\";\nimport { DATA, END, RESOLVED, STATE } from \"../core/protocol\";\nimport type { Store, StoreOperator, StoreOptions } from \"../core/types\";\n\n/**\n * Conditionally forwards upstream values. When the predicate returns false,\n * holds the last passing value.\n *\n * Stateful: maintains last passing value via operator()'s cache.\n * get() returns the last value that passed the predicate, or undefined.\n *\n * v3: Tier 1 — uses operator() with single dep. When predicate is false and\n * lastPassing is unchanged, sends RESOLVED (subtree skipping) instead of\n * re-emitting. Pull-based get() when disconnected re-evaluates predicate.\n */\nexport function filter<A>(\n\tpredicate: (value: A) => boolean,\n\topts?: StoreOptions,\n): StoreOperator<A, A | undefined> {\n\treturn (input) => {\n\t\tconst eqFn = opts?.equals;\n\t\t// Shared state between handler (push) and getter (pull)\n\t\tlet lastPassing: A | undefined;\n\t\tconst v0 = input.get();\n\t\tif (predicate(v0)) lastPassing = v0;\n\n\t\treturn operator<A | undefined>(\n\t\t\t[input] as Store<unknown>[],\n\t\t\t({ emit, signal, complete, error }) => {\n\t\t\t\treturn (_dep, type, data) => {\n\t\t\t\t\tif (type === STATE) {\n\t\t\t\t\t\tsignal(data);\n\t\t\t\t\t}\n\t\t\t\t\tif (type === DATA) {\n\t\t\t\t\t\tconst val = data as A;\n\t\t\t\t\t\tif (predicate(val)) {\n\t\t\t\t\t\t\tif (eqFn?.(lastPassing as A, val)) {\n\t\t\t\t\t\t\t\tsignal(RESOLVED);\n\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tlastPassing = val;\n\t\t\t\t\t\t\temit(val);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// Predicate failed — value didn't change for downstream\n\t\t\t\t\t\t\tsignal(RESOLVED);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (type === END) {\n\t\t\t\t\t\tif (data !== undefined) error(data);\n\t\t\t\t\t\telse complete();\n\t\t\t\t\t}\n\t\t\t\t};\n\t\t\t},\n\t\t\t{\n\t\t\t\tkind: \"filter\",\n\t\t\t\tname: opts?.name ?? \"filter\",\n\t\t\t\tinitial: lastPassing,\n\t\t\t\tgetter: () => {\n\t\t\t\t\tconst v = input.get();\n\t\t\t\t\tif (predicate(v)) lastPassing = v;\n\t\t\t\t\treturn lastPassing;\n\t\t\t\t},\n\t\t\t},\n\t\t);\n\t};\n}\n","// ---------------------------------------------------------------------------\n// Protocol — v3 type 3 control channel\n// ---------------------------------------------------------------------------\n// Type 3 (STATE) carries control signals: DIRTY, RESOLVED\n// Type 1 (DATA) carries only real values — never sentinels\n// ---------------------------------------------------------------------------\n\n/** Control signal: \"my value is about to change\" */\nexport const DIRTY = Symbol(\"DIRTY\");\n\n/** Control signal: \"I was dirty but my value didn't change\" */\nexport const RESOLVED = Symbol(\"RESOLVED\");\n\nexport type Signal = typeof DIRTY | typeof RESOLVED;\n\n/** Node status — tracks current lifecycle state (v4) */\nexport type NodeStatus =\n\t| \"DISCONNECTED\"\n\t| \"DIRTY\"\n\t| \"SETTLED\"\n\t| \"RESOLVED\"\n\t| \"COMPLETED\"\n\t| \"ERRORED\";\n\n// ---------------------------------------------------------------------------\n// Integer status constants — pack into _flags for hot-path performance.\n// 3 bits (7-9) encode 6 statuses. Use STATUS_MASK to read/write.\n// ---------------------------------------------------------------------------\nexport const S_DISCONNECTED = 0;\nexport const S_DIRTY = 1;\nexport const S_SETTLED = 2;\nexport const S_RESOLVED = 3;\nexport const S_COMPLETED = 4;\nexport const S_ERRORED = 5;\nexport const STATUS_SHIFT = 7;\nexport const STATUS_MASK = 0b111 << STATUS_SHIFT; // bits 7-9\n\nconst STATUS_STRINGS: NodeStatus[] = [\n\t\"DISCONNECTED\",\n\t\"DIRTY\",\n\t\"SETTLED\",\n\t\"RESOLVED\",\n\t\"COMPLETED\",\n\t\"ERRORED\",\n];\n\n/** Decode integer status bits back to string (for Inspector / tests) */\nexport function decodeStatus(flags: number): NodeStatus {\n\treturn STATUS_STRINGS[(flags & STATUS_MASK) >>> STATUS_SHIFT];\n}\n\n/** Callbag signal types */\nexport const START = 0;\nexport const DATA = 1;\nexport const END = 2;\nexport const STATE = 3;\n\n// ---------------------------------------------------------------------------\n// Batch — defers type 1 value emissions; type 3 DIRTY propagates immediately\n// ---------------------------------------------------------------------------\n\nlet batchDepth = 0;\nconst deferredEmissions: Array<() => void> = [];\n\n// `draining` prevents re-entrant drain when a nested batch() call ends while\n// the outer drain loop is already running. Without it, the inner batch's\n// finally block would see batchDepth===0 and start a second drain, racing the\n// outer loop — potentially double-processing items or clearing the array mid-\n// iteration. With draining=true, the inner batch skips its drain; any items it\n// pushes are picked up by the outer loop (the `for` condition re-evaluates\n// `deferredEmissions.length` on every iteration, so appends during drain are\n// naturally included in the same pass).\nlet draining = false;\n\nexport function batch<T>(fn: () => T): T {\n\tbatchDepth++;\n\ttry {\n\t\treturn fn();\n\t} finally {\n\t\tbatchDepth--;\n\t\tif (batchDepth === 0 && !draining) {\n\t\t\tdraining = true;\n\t\t\tfor (let i = 0; i < deferredEmissions.length; i++) {\n\t\t\t\tdeferredEmissions[i]();\n\t\t\t}\n\t\t\tdeferredEmissions.length = 0;\n\t\t\tdraining = false;\n\t\t}\n\t}\n}\n\nexport function isBatching(): boolean {\n\treturn batchDepth > 0;\n}\n\nexport function deferEmission(fn: () => void): void {\n\tdeferredEmissions.push(fn);\n}\n\n// ---------------------------------------------------------------------------\n// Connection batching (producer start deferral) — unchanged from v2\n// ---------------------------------------------------------------------------\n\nlet connectDepth = 0;\nconst pendingStarts: Array<() => void> = [];\n\nexport function beginDeferredStart(): void {\n\tconnectDepth++;\n}\n\nexport function endDeferredStart(): void {\n\tconnectDepth--;\n\tif (connectDepth === 0) {\n\t\tfor (let i = 0; i < pendingStarts.length; i++) {\n\t\t\tpendingStarts[i]();\n\t\t}\n\t\tpendingStarts.length = 0;\n\t}\n}\n\nexport function deferStart(start: () => void): void {\n\tif (connectDepth > 0) {\n\t\tpendingStarts.push(start);\n\t} else {\n\t\tstart();\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// teardown — protocol-level graph destruction\n// ---------------------------------------------------------------------------\n// Sends END to all downstream sinks of a store node, cascading through the\n// entire subgraph. After teardown, the node is in COMPLETED state and won't\n// accept new values or subscriptions.\n//\n// Works with any node that uses the output slot model:\n// - ProducerImpl / StateImpl / OperatorImpl → calls .complete()\n// - DerivedImpl → calls ._handleEnd() (no public complete() on derived)\n// ---------------------------------------------------------------------------\n\nexport function teardown(store: { source: (type: number, payload?: any) => void }): void {\n\tconst node = store as any;\n\tif (typeof node.complete === \"function\") {\n\t\tnode.complete();\n\t} else if (typeof node._handleEnd === \"function\") {\n\t\tnode._handleEnd(undefined);\n\t}\n}\n","// ---------------------------------------------------------------------------\n// Inspector — static class for observability\n// ---------------------------------------------------------------------------\n// All debug metadata lives here in WeakMaps, not on the store objects.\n// Stores stay lean. Inspector is opt-in overhead.\n//\n// v5: Zero intrusion into primitives. No hooks in hot paths. All methods\n// are static — call directly as Inspector.observe(), Inspector.tap(), etc.\n// - register/registerEdge: metadata collection (called from constructors)\n// - inspect/graph/dumpGraph/snapshot: read-only graph queries\n// - observe/spy/trace: callbag sinks for debugging (subscribe externally)\n// - tap: transparent passthrough wrapper for graph visualization\n// ---------------------------------------------------------------------------\n\nimport type { NodeStatus, Signal } from \"./protocol\";\nimport { DATA, DIRTY, END, RESOLVED, START, STATE } from \"./protocol\";\nimport type { Store } from \"./types\";\n\nexport interface StoreInfo<T = unknown> {\n\tname: string | undefined;\n\tkind: string;\n\tvalue: T;\n\t/** v4: node lifecycle status */\n\tstatus: NodeStatus | undefined;\n}\n\nexport interface ObserveResult<T> {\n\t/** All DATA (type 1) values received, in order */\n\tvalues: T[];\n\t/** All STATE (type 3) payloads received (DIRTY, RESOLVED, or unknown) */\n\tsignals: Signal[];\n\t/** All events in protocol order: { type, data } */\n\tevents: Array<{ type: \"data\" | \"signal\" | \"end\"; data: unknown }>;\n\t/** Whether END (type 2) has been received */\n\tended: boolean;\n\t/** Error payload from END, if any */\n\tendError: unknown;\n\t/** Count of DIRTY signals received */\n\tdirtyCount: number;\n\t/** Count of RESOLVED signals received */\n\tresolvedCount: number;\n\t/** Store name (from Inspector, if registered) */\n\tname: string | undefined;\n\t/** Disconnect the observer */\n\tdispose: () => void;\n}\n\n// Static-only class is intentional API for Inspector namespace\n// biome-ignore lint/complexity/noStaticOnlyClass: public API surface\nexport class Inspector {\n\t// WeakMaps for metadata — keyed by any graph node (stores, effects, etc.)\n\tprivate static _names = new WeakMap<object, string>();\n\tprivate static _kinds = new WeakMap<object, string>();\n\tprivate static _keys = new WeakMap<object, string>();\n\n\t// WeakRef set for graph() — allows GC of unused nodes\n\tprivate static _stores = new Set<WeakRef<object>>();\n\n\t// Dependency edges: parent key → child keys\n\tprivate static _edges = new Map<string, string[]>();\n\n\t// Unique key generation\n\tprivate static _nextId = 0;\n\tprivate static _usedKeys = new Set<string>();\n\n\t// Enabled flag — when false, register/getName are no-ops\n\tprivate static _explicitEnabled: boolean | null = null;\n\tprivate static _cachedDefault: boolean | null = null;\n\n\tstatic get enabled(): boolean {\n\t\tif (Inspector._explicitEnabled !== null) return Inspector._explicitEnabled;\n\t\tif (Inspector._cachedDefault !== null) return Inspector._cachedDefault;\n\t\ttry {\n\t\t\tInspector._cachedDefault = (globalThis as any).process?.env?.NODE_ENV !== \"production\";\n\t\t} catch {\n\t\t\tInspector._cachedDefault = true;\n\t\t}\n\t\treturn Inspector._cachedDefault;\n\t}\n\n\tstatic set enabled(value: boolean) {\n\t\tInspector._explicitEnabled = value;\n\t}\n\n\t/** Compute a dep-name-based suffix for unique key generation */\n\tprivate static _depSuffix(deps?: object[]): string | undefined {\n\t\tif (!deps?.length) return undefined;\n\t\tconst names = deps.map((d) => Inspector._names.get(d) ?? \"?\");\n\t\tconst joined = names.join(\",\");\n\t\treturn joined.length > 40 ? `${joined.slice(0, 37)}...` : joined;\n\t}\n\n\t/** Resolve a node to its unique graph key */\n\tprivate static _resolveKey(node: object): string {\n\t\treturn Inspector._keys.get(node) ?? Inspector._names.get(node) ?? \"anonymous\";\n\t}\n\n\t/** Register a graph node (store, effect, etc.) with the inspector */\n\tstatic register(node: object, opts?: { name?: string; kind?: string; deps?: object[] }): void {\n\t\tif (!Inspector.enabled) return;\n\t\tif (opts?.name) Inspector._names.set(node, opts.name);\n\t\tif (opts?.kind) Inspector._kinds.set(node, opts.kind);\n\n\t\t// Compute unique key\n\t\tconst id = Inspector._nextId++;\n\t\tlet key = opts?.name;\n\t\tif (key && !Inspector._usedKeys.has(key)) {\n\t\t\t// Unique name — use as-is\n\t\t} else if (key) {\n\t\t\t// Name collision — differentiate with dep names or ID\n\t\t\tconst depSuffix = Inspector._depSuffix(opts?.deps);\n\t\t\tkey = depSuffix ? `${key}(${depSuffix})` : `${key}_${id}`;\n\t\t\tif (Inspector._usedKeys.has(key)) key = `${key}_${id}`;\n\t\t} else {\n\t\t\t// Unnamed — use kind + dep names or ID\n\t\t\tconst kind = opts?.kind ?? \"store\";\n\t\t\tconst depSuffix = Inspector._depSuffix(opts?.deps);\n\t\t\tkey = depSuffix ? `${kind}(${depSuffix})` : `${kind}_${id}`;\n\t\t\tif (Inspector._usedKeys.has(key)) key = `${key}_${id}`;\n\t\t}\n\n\t\tInspector._usedKeys.add(key);\n\t\tInspector._keys.set(node, key);\n\t\tInspector._stores.add(new WeakRef(node));\n\t}\n\n\t/** Register a dependency edge between parent and child nodes */\n\tstatic registerEdge(parent: object, child: object): void {\n\t\tif (!Inspector.enabled) return;\n\t\tconst parentKey = Inspector._resolveKey(parent);\n\t\tconst childKey = Inspector._resolveKey(child);\n\t\tconst children = Inspector._edges.get(parentKey);\n\t\tif (children) {\n\t\t\tif (!children.includes(childKey)) children.push(childKey);\n\t\t} else {\n\t\t\tInspector._edges.set(parentKey, [childKey]);\n\t\t}\n\t}\n\n\t/** Get dependency edges: parent → children */\n\tstatic getEdges(): Map<string, string[]> {\n\t\treturn new Map(Inspector._edges);\n\t}\n\n\t/** Get the name of a node */\n\tstatic getName(node: object): string | undefined {\n\t\tif (!Inspector.enabled) return undefined;\n\t\treturn Inspector._names.get(node);\n\t}\n\n\t/** Get the kind of a node */\n\tstatic getKind(node: object): string | undefined {\n\t\treturn Inspector._kinds.get(node);\n\t}\n\n\t/** Inspect a single graph node — includes status and value (if available) */\n\tstatic inspect<T = unknown>(node: object): StoreInfo<T> {\n\t\treturn {\n\t\t\tname: Inspector._names.get(node),\n\t\t\tkind: Inspector._kinds.get(node) ?? \"unknown\",\n\t\t\tvalue: (typeof (node as any).get === \"function\" ? (node as any).get() : undefined) as T,\n\t\t\tstatus: (node as any)._status,\n\t\t};\n\t}\n\n\t/** Get all living nodes as a Map. Also prunes dead edges from GC'd nodes. */\n\tstatic graph(): Map<string, StoreInfo> {\n\t\tconst result = new Map<string, StoreInfo>();\n\t\tconst livingKeys = new Set<string>();\n\t\tfor (const ref of Inspector._stores) {\n\t\t\tconst node = ref.deref();\n\t\t\tif (!node) {\n\t\t\t\tInspector._stores.delete(ref); // cleanup GC'd refs\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst key = Inspector._resolveKey(node);\n\t\t\tlivingKeys.add(key);\n\t\t\tresult.set(key, Inspector.inspect(node));\n\t\t}\n\t\t// Prune edges referencing GC'd stores\n\t\tfor (const [key, children] of Inspector._edges) {\n\t\t\tif (!livingKeys.has(key)) {\n\t\t\t\tInspector._edges.delete(key);\n\t\t\t\tInspector._usedKeys.delete(key);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst alive = children.filter((c) => livingKeys.has(c));\n\t\t\tif (alive.length === 0) {\n\t\t\t\tInspector._edges.delete(key);\n\t\t\t} else if (alive.length !== children.length) {\n\t\t\t\tInspector._edges.set(key, alive);\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\t/** Trace a specific store's value changes (raw callbag — no extra/ dependency) */\n\tstatic trace<T>(store: Store<T>, cb: (value: T, prev: T | undefined) => void): () => void {\n\t\tlet talkback: ((type: number) => void) | null = null;\n\t\tlet prev: T | undefined = store.get();\n\t\tstore.source(START, (type: number, data: any) => {\n\t\t\tif (type === START) talkback = data;\n\t\t\tif (type === END) {\n\t\t\t\ttalkback = null;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (type === 1) {\n\t\t\t\tconst next = data as T;\n\t\t\t\tif (!Object.is(next, prev)) {\n\t\t\t\t\tconst p = prev;\n\t\t\t\t\tprev = next;\n\t\t\t\t\tcb(next, p);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\treturn () => talkback?.(END);\n\t}\n\n\t/** Pretty-print the entire store graph for console/CLI debugging */\n\tstatic dumpGraph(): string {\n\t\tconst g = Inspector.graph();\n\t\tconst edges = Inspector.getEdges();\n\n\t\t// Build reverse map: child key → parent keys (deps)\n\t\tconst depsMap = new Map<string, string[]>();\n\t\tfor (const [parent, children] of edges) {\n\t\t\tfor (const child of children) {\n\t\t\t\tconst deps = depsMap.get(child);\n\t\t\t\tif (deps) {\n\t\t\t\t\tif (!deps.includes(parent)) deps.push(parent);\n\t\t\t\t} else {\n\t\t\t\t\tdepsMap.set(child, [parent]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tconst lines: string[] = [];\n\t\tfor (const [key, info] of g) {\n\t\t\tconst deps = depsMap.get(key);\n\t\t\tconst children = edges.get(key);\n\t\t\tconst depsStr = deps?.length ? `  ← [${deps.join(\", \")}]` : \"\";\n\t\t\tconst childStr = children?.length ? `  → [${children.join(\", \")}]` : \"\";\n\t\t\tlines.push(\n\t\t\t\t`  ${key} (${info.kind}) = ${JSON.stringify(info.value)}  [${info.status ?? \"?\"}]${depsStr}${childStr}`,\n\t\t\t);\n\t\t}\n\t\tconst header = `Store Graph (${g.size} nodes):`;\n\t\treturn [header, ...lines].join(\"\\n\");\n\t}\n\n\t/**\n\t * Internal observe implementation shared by observe() and spy().\n\t */\n\tprivate static _observe<T>(\n\t\tstore: Store<T>,\n\t\tlabel?: string,\n\t\tlog?: (...args: any[]) => void,\n\t): ObserveResult<T> {\n\t\tlet talkback: ((type: number) => void) | null = null;\n\t\tconst name = label ?? Inspector.getName(store);\n\t\tconst result: ObserveResult<T> = {\n\t\t\tvalues: [],\n\t\t\tsignals: [],\n\t\t\tevents: [],\n\t\t\tended: false,\n\t\t\tendError: undefined,\n\t\t\tdirtyCount: 0,\n\t\t\tresolvedCount: 0,\n\t\t\tname,\n\t\t\tdispose: () => talkback?.(END),\n\t\t};\n\n\t\tstore.source(START, (type: number, data: any) => {\n\t\t\tif (type === START) {\n\t\t\t\ttalkback = data;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (type === DATA) {\n\t\t\t\tresult.values.push(data);\n\t\t\t\tresult.events.push({ type: \"data\", data });\n\t\t\t\tif (log) log(`[${name}] DATA:`, data);\n\t\t\t} else if (type === STATE) {\n\t\t\t\tresult.signals.push(data);\n\t\t\t\tresult.events.push({ type: \"signal\", data });\n\t\t\t\tif (data === DIRTY) result.dirtyCount++;\n\t\t\t\telse if (data === RESOLVED) result.resolvedCount++;\n\t\t\t\tif (log) log(`[${name}] STATE:`, data);\n\t\t\t} else if (type === END) {\n\t\t\t\tresult.ended = true;\n\t\t\t\tresult.endError = data;\n\t\t\t\tresult.events.push({ type: \"end\", data });\n\t\t\t\tif (log) log(`[${name}] END`, data !== undefined ? data : \"\");\n\t\t\t\ttalkback = null;\n\t\t\t}\n\t\t});\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Observe a store's full callbag protocol — the test-friendly alternative\n\t * to hooks. Captures DATA values, STATE signals, END, and provides\n\t * convenience accessors.\n\t *\n\t * Returns a live observation object — arrays grow as the store emits.\n\t *\n\t * ```ts\n\t * const obs = Inspector.observe(myStore);\n\t * myState.set(5);\n\t * obs.values       // [5]\n\t * obs.signals       // [DIRTY]\n\t * obs.ended         // false\n\t * obs.dirtyCount    // 1\n\t * obs.dispose()     // stop observing\n\t * ```\n\t */\n\tstatic observe<T>(store: Store<T>): ObserveResult<T> {\n\t\treturn Inspector._observe(store);\n\t}\n\n\t/**\n\t * Create a transparent passthrough wrapper for graph visualization.\n\t * The wrapper delegates `get()` and `source()` to the original store,\n\t * appearing as a distinct node in the Inspector graph. Zero overhead —\n\t * subscribers connect directly to the original store's source.\n\t */\n\tstatic tap<T>(store: Store<T>, name?: string): Store<T> {\n\t\tconst tapName = name ?? `tap(${Inspector.getName(store) ?? \"anon\"})`;\n\t\tconst wrapper: Store<T> = {\n\t\t\tget: () => store.get(),\n\t\t\tsource: store.source,\n\t\t};\n\t\tInspector.register(wrapper, { name: tapName, kind: \"tap\" });\n\t\tInspector.registerEdge(store, wrapper);\n\t\treturn wrapper;\n\t}\n\n\t/**\n\t * Enhanced observe() with logging — for interactive debugging.\n\t * Returns the same observation object as observe(), but also logs each\n\t * event as it happens. Pass a custom logger or defaults to console.log.\n\t */\n\tstatic spy<T>(\n\t\tstore: Store<T>,\n\t\topts?: { name?: string; log?: (...args: any[]) => void },\n\t): ObserveResult<T> {\n\t\tconst label = opts?.name ?? Inspector.getName(store) ?? \"spy\";\n\t\tconst log = opts?.log ?? console.log;\n\t\treturn Inspector._observe(store, label, log);\n\t}\n\n\t/**\n\t * JSON-serializable snapshot of the entire graph — nodes + edges.\n\t * Designed for AI consumption during debugging sessions.\n\t */\n\tstatic snapshot(): {\n\t\tnodes: Array<{ name: string; kind: string; value: unknown; status: string | undefined }>;\n\t\tedges: Array<{ from: string; to: string }>;\n\t} {\n\t\tconst g = Inspector.graph();\n\t\tconst edgeMap = Inspector.getEdges();\n\t\tconst nodes: Array<{ name: string; kind: string; value: unknown; status: string | undefined }> =\n\t\t\t[];\n\t\tfor (const [key, info] of g) {\n\t\t\tnodes.push({ name: key, kind: info.kind, value: info.value, status: info.status });\n\t\t}\n\t\tconst edges: Array<{ from: string; to: string }> = [];\n\t\tfor (const [parent, children] of edgeMap) {\n\t\t\tfor (const child of children) {\n\t\t\t\tedges.push({ from: parent, to: child });\n\t\t\t}\n\t\t}\n\t\treturn { nodes, edges };\n\t}\n\n\t/** Reset all state (for testing) */\n\tstatic _reset(): void {\n\t\tInspector._names = new WeakMap<object, string>();\n\t\tInspector._kinds = new WeakMap<object, string>();\n\t\tInspector._keys = new WeakMap<object, string>();\n\t\tInspector._stores = new Set<WeakRef<object>>();\n\t\tInspector._edges = new Map();\n\t\tInspector._usedKeys = new Set();\n\t\tInspector._nextId = 0;\n\t\tInspector._explicitEnabled = null;\n\t\tInspector._cachedDefault = null;\n\t}\n}\n","/**\n * General-purpose transform primitive. Receives all signal types from upstream\n * deps and decides what to forward.\n *\n * v5: _status packed into _flags bits 7-9 for hot-path performance.\n * String status exposed via getter for Inspector/test backward compat.\n *\n * Class-based for V8 hidden class optimization and prototype method sharing.\n * Boolean fields packed into _flags bitmask to reduce hidden class size.\n */\n\nimport { Inspector } from \"./inspector\";\nimport type { Signal } from \"./protocol\";\nimport {\n\tDATA,\n\tDIRTY,\n\tdecodeStatus,\n\tEND,\n\tRESOLVED,\n\tS_COMPLETED,\n\tS_DIRTY,\n\tS_DISCONNECTED,\n\tS_ERRORED,\n\tS_RESOLVED,\n\tS_SETTLED,\n\tSTART,\n\tSTATE,\n\tSTATUS_MASK,\n\tSTATUS_SHIFT,\n} from \"./protocol\";\nimport type { Actions, SourceOptions, Store } from \"./types\";\n\nexport type OperatorOpts<B> = SourceOptions<B>;\n\n// Flag bits for _flags bitmask (bits 0-6)\nconst O_COMPLETED = 1;\nconst O_RESET = 2;\nconst O_RESUB = 4;\nconst O_MULTI = 8;\n\n// Pre-shifted status constants for hot-path writes\nconst _S_DISCONNECTED = S_DISCONNECTED << STATUS_SHIFT;\nconst _S_DIRTY = S_DIRTY << STATUS_SHIFT;\nconst _S_SETTLED = S_SETTLED << STATUS_SHIFT;\nconst _S_RESOLVED = S_RESOLVED << STATUS_SHIFT;\nconst _S_COMPLETED = S_COMPLETED << STATUS_SHIFT;\nconst _S_ERRORED = S_ERRORED << STATUS_SHIFT;\nconst _STATUS_MASK = STATUS_MASK;\n\nexport class OperatorImpl<B> {\n\t_value: B | undefined;\n\t_output: ((type: number, data?: any) => void) | Set<any> | null = null;\n\t_upstreamTalkbacks: Array<((type: number) => void) | null> = [];\n\t_handler: ((depIndex: number, type: number, data: any) => void) | null = null;\n\t_flags: number;\n\t_deps: Store<unknown>[];\n\t_init: (actions: Actions<B>) => (depIndex: number, type: number, data: any) => void;\n\t_getterFn: ((cached: B | undefined) => B) | undefined;\n\t_initial: B | undefined;\n\n\tget _status() {\n\t\treturn decodeStatus(this._flags);\n\t}\n\n\tconstructor(\n\t\tdeps: Store<unknown>[],\n\t\tinit: (actions: Actions<B>) => (depIndex: number, type: number, data: any) => void,\n\t\topts?: OperatorOpts<B>,\n\t) {\n\t\tthis._value = opts?.initial;\n\t\tthis._initial = opts?.initial;\n\t\tthis._deps = deps;\n\t\tthis._init = init;\n\t\tthis._getterFn = opts?.getter;\n\n\t\tlet flags = 0;\n\t\tif (opts?.resetOnTeardown) flags |= O_RESET;\n\t\tif (opts?.resubscribable) flags |= O_RESUB;\n\t\t// S_DISCONNECTED = 0, so no status bits needed\n\t\tthis._flags = flags;\n\n\t\tthis.source = this.source.bind(this);\n\n\t\tInspector.register(this as any, { kind: opts?.kind ?? \"operator\", ...opts, deps });\n\t\tfor (const dep of deps) Inspector.registerEdge(dep, this as any);\n\t}\n\n\t_dispatch(type: number, data?: any): void {\n\t\tconst output = this._output;\n\t\tif (!output) return;\n\t\tif (this._flags & O_MULTI) {\n\t\t\tfor (const sink of output as Set<any>) sink(type, data);\n\t\t} else {\n\t\t\t(output as (type: number, data?: any) => void)(type, data);\n\t\t}\n\t}\n\n\t_connectUpstream(): void {\n\t\tconst localTalkbacks: Array<((type: number) => void) | null> = new Array(\n\t\t\tthis._deps.length,\n\t\t).fill(null);\n\t\tthis._upstreamTalkbacks = localTalkbacks;\n\n\t\tlet completed = false;\n\n\t\tconst actions: Actions<B> = {\n\t\t\tseed: (value: B) => {\n\t\t\t\tif (completed) return;\n\t\t\t\tthis._value = value;\n\t\t\t},\n\t\t\temit: (value: B) => {\n\t\t\t\tif (completed) return;\n\t\t\t\tthis._value = value;\n\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_SETTLED;\n\t\t\t\tthis._dispatch(DATA, value);\n\t\t\t},\n\t\t\tsignal: (s: Signal) => {\n\t\t\t\tif (completed) return;\n\t\t\t\tif (s === DIRTY) this._flags = (this._flags & ~_STATUS_MASK) | _S_DIRTY;\n\t\t\t\telse if (s === RESOLVED) this._flags = (this._flags & ~_STATUS_MASK) | _S_RESOLVED;\n\t\t\t\tthis._dispatch(STATE, s);\n\t\t\t},\n\t\t\tcomplete: () => {\n\t\t\t\tif (completed) return;\n\t\t\t\tcompleted = true;\n\t\t\t\tthis._flags = ((this._flags | O_COMPLETED) & ~_STATUS_MASK) | _S_COMPLETED;\n\t\t\t\tthis._handler = null;\n\t\t\t\tfor (const tb of localTalkbacks) tb?.(END);\n\t\t\t\tlocalTalkbacks.fill(null);\n\t\t\t\tif (this._flags & O_RESET) this._value = this._initial;\n\t\t\t\tconst output = this._output;\n\t\t\t\tconst wasMulti = this._flags & O_MULTI;\n\t\t\t\tthis._output = null;\n\t\t\t\tthis._flags &= ~O_MULTI;\n\t\t\t\tif (output) {\n\t\t\t\t\tif (wasMulti) {\n\t\t\t\t\t\tfor (const sink of output as Set<any>) sink(END);\n\t\t\t\t\t} else {\n\t\t\t\t\t\t(output as (type: number, data?: any) => void)(END);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\terror: (e: unknown) => {\n\t\t\t\tif (completed) return;\n\t\t\t\tcompleted = true;\n\t\t\t\tthis._flags = ((this._flags | O_COMPLETED) & ~_STATUS_MASK) | _S_ERRORED;\n\t\t\t\tthis._handler = null;\n\t\t\t\tfor (const tb of localTalkbacks) tb?.(END);\n\t\t\t\tlocalTalkbacks.fill(null);\n\t\t\t\tif (this._flags & O_RESET) this._value = this._initial;\n\t\t\t\tconst output = this._output;\n\t\t\t\tconst wasMulti = this._flags & O_MULTI;\n\t\t\t\tthis._output = null;\n\t\t\t\tthis._flags &= ~O_MULTI;\n\t\t\t\tif (output) {\n\t\t\t\t\tif (wasMulti) {\n\t\t\t\t\t\tfor (const sink of output as Set<any>) sink(END, e);\n\t\t\t\t\t} else {\n\t\t\t\t\t\t(output as (type: number, data?: any) => void)(END, e);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tdisconnect: (dep?: number) => {\n\t\t\t\tif (dep !== undefined) {\n\t\t\t\t\tlocalTalkbacks[dep]?.(END);\n\t\t\t\t\tlocalTalkbacks[dep] = null;\n\t\t\t\t} else {\n\t\t\t\t\tfor (const tb of localTalkbacks) tb?.(END);\n\t\t\t\t\tlocalTalkbacks.fill(null);\n\t\t\t\t}\n\t\t\t},\n\t\t};\n\n\t\tthis._handler = this._init(actions);\n\n\t\tfor (let i = 0; i < this._deps.length; i++) {\n\t\t\tif (completed) break;\n\t\t\tconst depIndex = i;\n\t\t\tthis._deps[depIndex].source(START, (type: number, data: any) => {\n\t\t\t\tif (type === START) {\n\t\t\t\t\tlocalTalkbacks[depIndex] = data;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tthis._handler?.(depIndex, type, data);\n\t\t\t});\n\t\t}\n\t}\n\n\t_disconnectUpstream(): void {\n\t\tfor (const tb of this._upstreamTalkbacks) tb?.(END);\n\t\tthis._upstreamTalkbacks = [];\n\t\tthis._handler = null;\n\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_DISCONNECTED;\n\t\tif (this._flags & O_RESET) this._value = this._initial;\n\t}\n\n\tget(): B {\n\t\tif (this._getterFn && !this._output) {\n\t\t\tconst v = this._getterFn(this._value);\n\t\t\tthis._value = v;\n\t\t\treturn v;\n\t\t}\n\t\treturn this._value as B;\n\t}\n\n\tsource(type: number, payload?: any): void {\n\t\tif (type === START) {\n\t\t\tconst sink = payload;\n\t\t\tif (this._flags & O_COMPLETED) {\n\t\t\t\tif (this._flags & O_RESUB && this._output === null) {\n\t\t\t\t\tthis._flags = (this._flags & ~(O_COMPLETED | _STATUS_MASK)) | _S_DISCONNECTED;\n\t\t\t\t} else {\n\t\t\t\t\tsink(START, (_t: number) => {});\n\t\t\t\t\tsink(END);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tconst wasEmpty = this._output === null;\n\t\t\tif (this._output === null) {\n\t\t\t\tthis._output = sink;\n\t\t\t} else if (!(this._flags & O_MULTI)) {\n\t\t\t\tconst set = new Set<any>();\n\t\t\t\tset.add(this._output);\n\t\t\t\tset.add(sink);\n\t\t\t\tthis._output = set;\n\t\t\t\tthis._flags |= O_MULTI;\n\t\t\t} else {\n\t\t\t\t(this._output as Set<any>).add(sink);\n\t\t\t}\n\t\t\tsink(START, (t: number) => {\n\t\t\t\tif (t === DATA) sink(DATA, this._value);\n\t\t\t\tif (t === END) {\n\t\t\t\t\tif (this._output === null) return;\n\t\t\t\t\tif (this._flags & O_MULTI) {\n\t\t\t\t\t\tconst set = this._output as Set<any>;\n\t\t\t\t\t\tset.delete(sink);\n\t\t\t\t\t\tif (set.size === 1) {\n\t\t\t\t\t\t\tthis._output = set.values().next().value;\n\t\t\t\t\t\t\tthis._flags &= ~O_MULTI;\n\t\t\t\t\t\t} else if (set.size === 0) {\n\t\t\t\t\t\t\tthis._output = null;\n\t\t\t\t\t\t\tthis._flags &= ~O_MULTI;\n\t\t\t\t\t\t\tthis._disconnectUpstream();\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (this._output === sink) {\n\t\t\t\t\t\tthis._output = null;\n\t\t\t\t\t\tthis._disconnectUpstream();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\t\tif (wasEmpty) {\n\t\t\t\tthis._connectUpstream();\n\t\t\t}\n\t\t}\n\t}\n}\n\nexport function operator<B>(\n\tdeps: Store<unknown>[],\n\tinit: (actions: Actions<B>) => (depIndex: number, type: number, data: any) => void,\n\topts?: OperatorOpts<B>,\n): Store<B> {\n\treturn new OperatorImpl<B>(deps, init, opts) as any;\n}\n"],"mappings":"yaAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,YAAAE,IAAA,eAAAC,EAAAH,GCQO,IAAMI,EAAQ,OAAO,OAAO,EAGtBC,EAAW,OAAO,UAAU,EAiB5BC,EAAiB,EACjBC,EAAU,EACVC,EAAY,EACZC,EAAa,EACbC,EAAc,EACdC,EAAY,EACZC,EAAe,EACfC,EAAc,GAASD,EAE9BE,EAA+B,CACpC,eACA,QACA,UACA,WACA,YACA,SACD,EAGO,SAASC,EAAaC,EAA2B,CACvD,OAAOF,GAAgBE,EAAQH,KAAiBD,CAAY,CAC7D,CAGO,IAAMK,EAAQ,EACRC,EAAO,EACPC,EAAM,EACNC,EAAQ,ECNd,IAAMC,EAAN,MAAMC,CAAU,CAEtB,OAAe,OAAS,IAAI,QAC5B,OAAe,OAAS,IAAI,QAC5B,OAAe,MAAQ,IAAI,QAG3B,OAAe,QAAU,IAAI,IAG7B,OAAe,OAAS,IAAI,IAG5B,OAAe,QAAU,EACzB,OAAe,UAAY,IAAI,IAG/B,OAAe,iBAAmC,KAClD,OAAe,eAAiC,KAEhD,WAAW,SAAmB,CAC7B,GAAIA,EAAU,mBAAqB,KAAM,OAAOA,EAAU,iBAC1D,GAAIA,EAAU,iBAAmB,KAAM,OAAOA,EAAU,eACxD,GAAI,CACHA,EAAU,eAAkB,WAAmB,SAAS,KAAK,WAAa,YAC3E,MAAQ,CACPA,EAAU,eAAiB,EAC5B,CACA,OAAOA,EAAU,cAClB,CAEA,WAAW,QAAQC,EAAgB,CAClCD,EAAU,iBAAmBC,CAC9B,CAGA,OAAe,WAAWC,EAAqC,CAC9D,GAAI,CAACA,GAAM,OAAQ,OAEnB,IAAMC,EADQD,EAAK,IAAKE,GAAMJ,EAAU,OAAO,IAAII,CAAC,GAAK,GAAG,EACvC,KAAK,GAAG,EAC7B,OAAOD,EAAO,OAAS,GAAK,GAAGA,EAAO,MAAM,EAAG,EAAE,CAAC,MAAQA,CAC3D,CAGA,OAAe,YAAYE,EAAsB,CAChD,OAAOL,EAAU,MAAM,IAAIK,CAAI,GAAKL,EAAU,OAAO,IAAIK,CAAI,GAAK,WACnE,CAGA,OAAO,SAASA,EAAcC,EAAgE,CAC7F,GAAI,CAACN,EAAU,QAAS,OACpBM,GAAM,MAAMN,EAAU,OAAO,IAAIK,EAAMC,EAAK,IAAI,EAChDA,GAAM,MAAMN,EAAU,OAAO,IAAIK,EAAMC,EAAK,IAAI,EAGpD,IAAMC,EAAKP,EAAU,UACjBQ,EAAMF,GAAM,KAChB,GAAI,EAAAE,GAAO,CAACR,EAAU,UAAU,IAAIQ,CAAG,GAEhC,GAAIA,EAAK,CAEf,IAAMC,EAAYT,EAAU,WAAWM,GAAM,IAAI,EACjDE,EAAMC,EAAY,GAAGD,CAAG,IAAIC,CAAS,IAAM,GAAGD,CAAG,IAAID,CAAE,GACnDP,EAAU,UAAU,IAAIQ,CAAG,IAAGA,EAAM,GAAGA,CAAG,IAAID,CAAE,GACrD,KAAO,CAEN,IAAMG,EAAOJ,GAAM,MAAQ,QACrBG,EAAYT,EAAU,WAAWM,GAAM,IAAI,EACjDE,EAAMC,EAAY,GAAGC,CAAI,IAAID,CAAS,IAAM,GAAGC,CAAI,IAAIH,CAAE,GACrDP,EAAU,UAAU,IAAIQ,CAAG,IAAGA,EAAM,GAAGA,CAAG,IAAID,CAAE,GACrD,CAEAP,EAAU,UAAU,IAAIQ,CAAG,EAC3BR,EAAU,MAAM,IAAIK,EAAMG,CAAG,EAC7BR,EAAU,QAAQ,IAAI,IAAI,QAAQK,CAAI,CAAC,CACxC,CAGA,OAAO,aAAaM,EAAgBC,EAAqB,CACxD,GAAI,CAACZ,EAAU,QAAS,OACxB,IAAMa,EAAYb,EAAU,YAAYW,CAAM,EACxCG,EAAWd,EAAU,YAAYY,CAAK,EACtCG,EAAWf,EAAU,OAAO,IAAIa,CAAS,EAC3CE,EACEA,EAAS,SAASD,CAAQ,GAAGC,EAAS,KAAKD,CAAQ,EAExDd,EAAU,OAAO,IAAIa,EAAW,CAACC,CAAQ,CAAC,CAE5C,CAGA,OAAO,UAAkC,CACxC,OAAO,IAAI,IAAId,EAAU,MAAM,CAChC,CAGA,OAAO,QAAQK,EAAkC,CAChD,GAAKL,EAAU,QACf,OAAOA,EAAU,OAAO,IAAIK,CAAI,CACjC,CAGA,OAAO,QAAQA,EAAkC,CAChD,OAAOL,EAAU,OAAO,IAAIK,CAAI,CACjC,CAGA,OAAO,QAAqBA,EAA4B,CACvD,MAAO,CACN,KAAML,EAAU,OAAO,IAAIK,CAAI,EAC/B,KAAML,EAAU,OAAO,IAAIK,CAAI,GAAK,UACpC,MAAQ,OAAQA,EAAa,KAAQ,WAAcA,EAAa,IAAI,EAAI,OACxE,OAASA,EAAa,OACvB,CACD,CAGA,OAAO,OAAgC,CACtC,IAAMW,EAAS,IAAI,IACbC,EAAa,IAAI,IACvB,QAAWC,KAAOlB,EAAU,QAAS,CACpC,IAAMK,EAAOa,EAAI,MAAM,EACvB,GAAI,CAACb,EAAM,CACVL,EAAU,QAAQ,OAAOkB,CAAG,EAC5B,QACD,CACA,IAAMV,EAAMR,EAAU,YAAYK,CAAI,EACtCY,EAAW,IAAIT,CAAG,EAClBQ,EAAO,IAAIR,EAAKR,EAAU,QAAQK,CAAI,CAAC,CACxC,CAEA,OAAW,CAACG,EAAKO,CAAQ,IAAKf,EAAU,OAAQ,CAC/C,GAAI,CAACiB,EAAW,IAAIT,CAAG,EAAG,CACzBR,EAAU,OAAO,OAAOQ,CAAG,EAC3BR,EAAU,UAAU,OAAOQ,CAAG,EAC9B,QACD,CACA,IAAMW,EAAQJ,EAAS,OAAQK,GAAMH,EAAW,IAAIG,CAAC,CAAC,EAClDD,EAAM,SAAW,EACpBnB,EAAU,OAAO,OAAOQ,CAAG,EACjBW,EAAM,SAAWJ,EAAS,QACpCf,EAAU,OAAO,IAAIQ,EAAKW,CAAK,CAEjC,CACA,OAAOH,CACR,CAGA,OAAO,MAASK,EAAiBC,EAAyD,CACzF,IAAIC,EAA4C,KAC5CC,EAAsBH,EAAM,IAAI,EACpC,OAAAA,EAAM,OAAOI,EAAO,CAACC,EAAcC,IAAc,CAEhD,GADID,IAASD,IAAOF,EAAWI,GAC3BD,IAASE,EAAK,CACjBL,EAAW,KACX,MACD,CACA,GAAIG,IAAS,EAAG,CACf,IAAMG,EAAOF,EACb,GAAI,CAAC,OAAO,GAAGE,EAAML,CAAI,EAAG,CAC3B,IAAMM,EAAIN,EACVA,EAAOK,EACPP,EAAGO,EAAMC,CAAC,CACX,CACD,CACD,CAAC,EACM,IAAMP,IAAWK,CAAG,CAC5B,CAGA,OAAO,WAAoB,CAC1B,IAAMG,EAAI/B,EAAU,MAAM,EACpBgC,EAAQhC,EAAU,SAAS,EAG3BiC,EAAU,IAAI,IACpB,OAAW,CAACtB,EAAQI,CAAQ,IAAKiB,EAChC,QAAWpB,KAASG,EAAU,CAC7B,IAAMb,EAAO+B,EAAQ,IAAIrB,CAAK,EAC1BV,EACEA,EAAK,SAASS,CAAM,GAAGT,EAAK,KAAKS,CAAM,EAE5CsB,EAAQ,IAAIrB,EAAO,CAACD,CAAM,CAAC,CAE7B,CAGD,IAAMuB,EAAkB,CAAC,EACzB,OAAW,CAAC1B,EAAK2B,CAAI,IAAKJ,EAAG,CAC5B,IAAM7B,EAAO+B,EAAQ,IAAIzB,CAAG,EACtBO,EAAWiB,EAAM,IAAIxB,CAAG,EACxB4B,EAAUlC,GAAM,OAAS,aAAQA,EAAK,KAAK,IAAI,CAAC,IAAM,GACtDmC,EAAWtB,GAAU,OAAS,aAAQA,EAAS,KAAK,IAAI,CAAC,IAAM,GACrEmB,EAAM,KACL,KAAK1B,CAAG,KAAK2B,EAAK,IAAI,OAAO,KAAK,UAAUA,EAAK,KAAK,CAAC,MAAMA,EAAK,QAAU,GAAG,IAAIC,CAAO,GAAGC,CAAQ,EACtG,CACD,CAEA,MAAO,CADQ,gBAAgBN,EAAE,IAAI,WACrB,GAAGG,CAAK,EAAE,KAAK;AAAA,CAAI,CACpC,CAKA,OAAe,SACdb,EACAiB,EACAC,EACmB,CACnB,IAAIhB,EAA4C,KAC1CiB,EAAOF,GAAStC,EAAU,QAAQqB,CAAK,EACvCL,EAA2B,CAChC,OAAQ,CAAC,EACT,QAAS,CAAC,EACV,OAAQ,CAAC,EACT,MAAO,GACP,SAAU,OACV,WAAY,EACZ,cAAe,EACf,KAAAwB,EACA,QAAS,IAAMjB,IAAWK,CAAG,CAC9B,EAEA,OAAAP,EAAM,OAAOI,EAAO,CAACC,EAAcC,IAAc,CAChD,GAAID,IAASD,EAAO,CACnBF,EAAWI,EACX,MACD,CACID,IAASe,GACZzB,EAAO,OAAO,KAAKW,CAAI,EACvBX,EAAO,OAAO,KAAK,CAAE,KAAM,OAAQ,KAAAW,CAAK,CAAC,EACrCY,GAAKA,EAAI,IAAIC,CAAI,UAAWb,CAAI,GAC1BD,IAASgB,GACnB1B,EAAO,QAAQ,KAAKW,CAAI,EACxBX,EAAO,OAAO,KAAK,CAAE,KAAM,SAAU,KAAAW,CAAK,CAAC,EACvCA,IAASgB,EAAO3B,EAAO,aAClBW,IAASiB,GAAU5B,EAAO,gBAC/BuB,GAAKA,EAAI,IAAIC,CAAI,WAAYb,CAAI,GAC3BD,IAASE,IACnBZ,EAAO,MAAQ,GACfA,EAAO,SAAWW,EAClBX,EAAO,OAAO,KAAK,CAAE,KAAM,MAAO,KAAAW,CAAK,CAAC,EACpCY,GAAKA,EAAI,IAAIC,CAAI,QAASb,IAAS,OAAYA,EAAO,EAAE,EAC5DJ,EAAW,KAEb,CAAC,EAEMP,CACR,CAmBA,OAAO,QAAWK,EAAmC,CACpD,OAAOrB,EAAU,SAASqB,CAAK,CAChC,CAQA,OAAO,IAAOA,EAAiBmB,EAAyB,CACvD,IAAMK,EAAUL,GAAQ,OAAOxC,EAAU,QAAQqB,CAAK,GAAK,MAAM,IAC3DyB,EAAoB,CACzB,IAAK,IAAMzB,EAAM,IAAI,EACrB,OAAQA,EAAM,MACf,EACA,OAAArB,EAAU,SAAS8C,EAAS,CAAE,KAAMD,EAAS,KAAM,KAAM,CAAC,EAC1D7C,EAAU,aAAaqB,EAAOyB,CAAO,EAC9BA,CACR,CAOA,OAAO,IACNzB,EACAf,EACmB,CACnB,IAAMgC,EAAQhC,GAAM,MAAQN,EAAU,QAAQqB,CAAK,GAAK,MAClDkB,EAAMjC,GAAM,KAAO,QAAQ,IACjC,OAAON,EAAU,SAASqB,EAAOiB,EAAOC,CAAG,CAC5C,CAMA,OAAO,UAGL,CACD,IAAMR,EAAI/B,EAAU,MAAM,EACpB+C,EAAU/C,EAAU,SAAS,EAC7BgD,EACL,CAAC,EACF,OAAW,CAACxC,EAAK2B,CAAI,IAAKJ,EACzBiB,EAAM,KAAK,CAAE,KAAMxC,EAAK,KAAM2B,EAAK,KAAM,MAAOA,EAAK,MAAO,OAAQA,EAAK,MAAO,CAAC,EAElF,IAAMH,EAA6C,CAAC,EACpD,OAAW,CAACrB,EAAQI,CAAQ,IAAKgC,EAChC,QAAWnC,KAASG,EACnBiB,EAAM,KAAK,CAAE,KAAMrB,EAAQ,GAAIC,CAAM,CAAC,EAGxC,MAAO,CAAE,MAAAoC,EAAO,MAAAhB,CAAM,CACvB,CAGA,OAAO,QAAe,CACrBhC,EAAU,OAAS,IAAI,QACvBA,EAAU,OAAS,IAAI,QACvBA,EAAU,MAAQ,IAAI,QACtBA,EAAU,QAAU,IAAI,IACxBA,EAAU,OAAS,IAAI,IACvBA,EAAU,UAAY,IAAI,IAC1BA,EAAU,QAAU,EACpBA,EAAU,iBAAmB,KAC7BA,EAAU,eAAiB,IAC5B,CACD,EChWA,IAAMiD,EAAc,EACdC,EAAU,EACVC,EAAU,EACVC,EAAU,EAGVC,EAAkBC,GAAkBC,EACpCC,EAAWC,GAAWF,EACtBG,EAAaC,GAAaJ,EAC1BK,EAAcC,GAAcN,EAC5BO,EAAeC,GAAeR,EAC9BS,EAAaC,GAAaV,EAC1BW,EAAeC,EAERC,EAAN,KAAsB,CAC5B,OACA,QAAkE,KAClE,mBAA6D,CAAC,EAC9D,SAAyE,KACzE,OACA,MACA,MACA,UACA,SAEA,IAAI,SAAU,CACb,OAAOC,EAAa,KAAK,MAAM,CAChC,CAEA,YACCC,EACAC,EACAC,EACC,CACD,KAAK,OAASA,GAAM,QACpB,KAAK,SAAWA,GAAM,QACtB,KAAK,MAAQF,EACb,KAAK,MAAQC,EACb,KAAK,UAAYC,GAAM,OAEvB,IAAIC,EAAQ,EACRD,GAAM,kBAAiBC,GAASvB,GAChCsB,GAAM,iBAAgBC,GAAStB,GAEnC,KAAK,OAASsB,EAEd,KAAK,OAAS,KAAK,OAAO,KAAK,IAAI,EAEnCC,EAAU,SAAS,KAAa,CAAE,KAAMF,GAAM,MAAQ,WAAY,GAAGA,EAAM,KAAAF,CAAK,CAAC,EACjF,QAAWK,KAAOL,EAAMI,EAAU,aAAaC,EAAK,IAAW,CAChE,CAEA,UAAUC,EAAcC,EAAkB,CACzC,IAAMC,EAAS,KAAK,QACpB,GAAKA,EACL,GAAI,KAAK,OAAS1B,EACjB,QAAW2B,KAAQD,EAAoBC,EAAKH,EAAMC,CAAI,OAErDC,EAA8CF,EAAMC,CAAI,CAE3D,CAEA,kBAAyB,CACxB,IAAMG,EAAyD,IAAI,MAClE,KAAK,MAAM,MACZ,EAAE,KAAK,IAAI,EACX,KAAK,mBAAqBA,EAE1B,IAAIC,EAAY,GAEVC,EAAsB,CAC3B,KAAOC,GAAa,CACfF,IACJ,KAAK,OAASE,EACf,EACA,KAAOA,GAAa,CACfF,IACJ,KAAK,OAASE,EACd,KAAK,OAAU,KAAK,OAAS,CAACjB,EAAgBR,EAC9C,KAAK,UAAU0B,EAAMD,CAAK,EAC3B,EACA,OAASE,GAAc,CAClBJ,IACAI,IAAMC,EAAO,KAAK,OAAU,KAAK,OAAS,CAACpB,EAAgBV,EACtD6B,IAAME,IAAU,KAAK,OAAU,KAAK,OAAS,CAACrB,EAAgBN,GACvE,KAAK,UAAU4B,EAAOH,CAAC,EACxB,EACA,SAAU,IAAM,CACf,GAAIJ,EAAW,OACfA,EAAY,GACZ,KAAK,QAAW,KAAK,OAAShC,GAAe,CAACiB,EAAgBJ,EAC9D,KAAK,SAAW,KAChB,QAAW2B,KAAMT,EAAgBS,IAAKC,CAAG,EACzCV,EAAe,KAAK,IAAI,EACpB,KAAK,OAAS9B,IAAS,KAAK,OAAS,KAAK,UAC9C,IAAM4B,EAAS,KAAK,QACda,EAAW,KAAK,OAASvC,EAG/B,GAFA,KAAK,QAAU,KACf,KAAK,QAAU,CAACA,EACZ0B,EACH,GAAIa,EACH,QAAWZ,KAAQD,EAAoBC,EAAKW,CAAG,OAE9CZ,EAA8CY,CAAG,CAGrD,EACA,MAAQ,GAAe,CACtB,GAAIT,EAAW,OACfA,EAAY,GACZ,KAAK,QAAW,KAAK,OAAShC,GAAe,CAACiB,EAAgBF,EAC9D,KAAK,SAAW,KAChB,QAAWyB,KAAMT,EAAgBS,IAAKC,CAAG,EACzCV,EAAe,KAAK,IAAI,EACpB,KAAK,OAAS9B,IAAS,KAAK,OAAS,KAAK,UAC9C,IAAM4B,EAAS,KAAK,QACda,EAAW,KAAK,OAASvC,EAG/B,GAFA,KAAK,QAAU,KACf,KAAK,QAAU,CAACA,EACZ0B,EACH,GAAIa,EACH,QAAWZ,KAAQD,EAAoBC,EAAKW,EAAK,CAAC,OAEjDZ,EAA8CY,EAAK,CAAC,CAGxD,EACA,WAAaf,GAAiB,CAC7B,GAAIA,IAAQ,OACXK,EAAeL,CAAG,IAAIe,CAAG,EACzBV,EAAeL,CAAG,EAAI,SAChB,CACN,QAAWc,KAAMT,EAAgBS,IAAKC,CAAG,EACzCV,EAAe,KAAK,IAAI,CACzB,CACD,CACD,EAEA,KAAK,SAAW,KAAK,MAAME,CAAO,EAElC,QAASU,EAAI,EAAGA,EAAI,KAAK,MAAM,QAC1B,CAAAX,EADkCW,IAAK,CAE3C,IAAMC,EAAWD,EACjB,KAAK,MAAMC,CAAQ,EAAE,OAAOC,EAAO,CAAClB,EAAcC,IAAc,CAC/D,GAAID,IAASkB,EAAO,CACnBd,EAAea,CAAQ,EAAIhB,EAC3B,MACD,CACA,KAAK,WAAWgB,EAAUjB,EAAMC,CAAI,CACrC,CAAC,CACF,CACD,CAEA,qBAA4B,CAC3B,QAAWY,KAAM,KAAK,mBAAoBA,IAAKC,CAAG,EAClD,KAAK,mBAAqB,CAAC,EAC3B,KAAK,SAAW,KAChB,KAAK,OAAU,KAAK,OAAS,CAACxB,EAAgBb,EAC1C,KAAK,OAASH,IAAS,KAAK,OAAS,KAAK,SAC/C,CAEA,KAAS,CACR,GAAI,KAAK,WAAa,CAAC,KAAK,QAAS,CACpC,IAAM6C,EAAI,KAAK,UAAU,KAAK,MAAM,EACpC,YAAK,OAASA,EACPA,CACR,CACA,OAAO,KAAK,MACb,CAEA,OAAOnB,EAAcoB,EAAqB,CACzC,GAAIpB,IAASkB,EAAO,CACnB,IAAMf,EAAOiB,EACb,GAAI,KAAK,OAAS/C,EACjB,GAAI,KAAK,OAASE,GAAW,KAAK,UAAY,KAC7C,KAAK,OAAU,KAAK,OAAS,EAAEF,EAAciB,GAAiBb,MACxD,CACN0B,EAAKe,EAAQG,GAAe,CAAC,CAAC,EAC9BlB,EAAKW,CAAG,EACR,MACD,CAED,IAAMQ,EAAW,KAAK,UAAY,KAClC,GAAI,KAAK,UAAY,KACpB,KAAK,QAAUnB,UACH,KAAK,OAAS3B,EAOzB,KAAK,QAAqB,IAAI2B,CAAI,MAPC,CACpC,IAAMoB,EAAM,IAAI,IAChBA,EAAI,IAAI,KAAK,OAAO,EACpBA,EAAI,IAAIpB,CAAI,EACZ,KAAK,QAAUoB,EACf,KAAK,QAAU/C,CAChB,CAGA2B,EAAKe,EAAQM,GAAc,CAE1B,GADIA,IAAMhB,GAAML,EAAKK,EAAM,KAAK,MAAM,EAClCgB,IAAMV,EAAK,CACd,GAAI,KAAK,UAAY,KAAM,OAC3B,GAAI,KAAK,OAAStC,EAAS,CAC1B,IAAM+C,EAAM,KAAK,QACjBA,EAAI,OAAOpB,CAAI,EACXoB,EAAI,OAAS,GAChB,KAAK,QAAUA,EAAI,OAAO,EAAE,KAAK,EAAE,MACnC,KAAK,QAAU,CAAC/C,GACN+C,EAAI,OAAS,IACvB,KAAK,QAAU,KACf,KAAK,QAAU,CAAC/C,EAChB,KAAK,oBAAoB,EAE3B,MAAW,KAAK,UAAY2B,IAC3B,KAAK,QAAU,KACf,KAAK,oBAAoB,EAE3B,CACD,CAAC,EACGmB,GACH,KAAK,iBAAiB,CAExB,CACD,CACD,EAEO,SAASG,EACf/B,EACAC,EACAC,EACW,CACX,OAAO,IAAIJ,EAAgBE,EAAMC,EAAMC,CAAI,CAC5C,CHxPO,SAAS8B,EACfC,EACAC,EACkC,CAClC,OAAQC,GAAU,CACjB,IAAMC,EAAOF,GAAM,OAEfG,EACEC,EAAKH,EAAM,IAAI,EACrB,OAAIF,EAAUK,CAAE,IAAGD,EAAcC,GAE1BC,EACN,CAACJ,CAAK,EACN,CAAC,CAAE,KAAAK,EAAM,OAAAC,EAAQ,SAAAC,EAAU,MAAAC,CAAM,IACzB,CAACC,EAAMC,EAAMC,IAAS,CAI5B,GAHID,IAASE,GACZN,EAAOK,CAAI,EAERD,IAASG,EAAM,CAClB,IAAMC,EAAMH,EACZ,GAAIb,EAAUgB,CAAG,EAAG,CACnB,GAAIb,IAAOC,EAAkBY,CAAG,EAAG,CAClCR,EAAOS,CAAQ,EACf,MACD,CACAb,EAAcY,EACdT,EAAKS,CAAG,CACT,MAECR,EAAOS,CAAQ,CAEjB,CACIL,IAASM,IACRL,IAAS,OAAWH,EAAMG,CAAI,EAC7BJ,EAAS,EAEhB,EAED,CACC,KAAM,SACN,KAAMR,GAAM,MAAQ,SACpB,QAASG,EACT,OAAQ,IAAM,CACb,IAAMe,EAAIjB,EAAM,IAAI,EACpB,OAAIF,EAAUmB,CAAC,IAAGf,EAAce,GACzBf,CACR,CACD,CACD,CACD,CACD","names":["filter_exports","__export","filter","__toCommonJS","DIRTY","RESOLVED","S_DISCONNECTED","S_DIRTY","S_SETTLED","S_RESOLVED","S_COMPLETED","S_ERRORED","STATUS_SHIFT","STATUS_MASK","STATUS_STRINGS","decodeStatus","flags","START","DATA","END","STATE","Inspector","_Inspector","value","deps","joined","d","node","opts","id","key","depSuffix","kind","parent","child","parentKey","childKey","children","result","livingKeys","ref","alive","c","store","cb","talkback","prev","START","type","data","END","next","p","g","edges","depsMap","lines","info","depsStr","childStr","label","log","name","DATA","STATE","DIRTY","RESOLVED","tapName","wrapper","edgeMap","nodes","O_COMPLETED","O_RESET","O_RESUB","O_MULTI","_S_DISCONNECTED","S_DISCONNECTED","STATUS_SHIFT","_S_DIRTY","S_DIRTY","_S_SETTLED","S_SETTLED","_S_RESOLVED","S_RESOLVED","_S_COMPLETED","S_COMPLETED","_S_ERRORED","S_ERRORED","_STATUS_MASK","STATUS_MASK","OperatorImpl","decodeStatus","deps","init","opts","flags","Inspector","dep","type","data","output","sink","localTalkbacks","completed","actions","value","DATA","s","DIRTY","RESOLVED","STATE","tb","END","wasMulti","i","depIndex","START","v","payload","_t","wasEmpty","set","t","operator","filter","predicate","opts","input","eqFn","lastPassing","v0","operator","emit","signal","complete","error","_dep","type","data","STATE","DATA","val","RESOLVED","END","v"]}

package/dist/extra/filter.d.cts

@@ -0,0 +1,16 @@
+import { b as StoreOptions, a as StoreOperator } from '../types-DsAN6Hga.cjs';
+
+/**
+ * Conditionally forwards upstream values. When the predicate returns false,
+ * holds the last passing value.
+ *
+ * Stateful: maintains last passing value via operator()'s cache.
+ * get() returns the last value that passed the predicate, or undefined.
+ *
+ * v3: Tier 1 — uses operator() with single dep. When predicate is false and
+ * lastPassing is unchanged, sends RESOLVED (subtree skipping) instead of
+ * re-emitting. Pull-based get() when disconnected re-evaluates predicate.
+ */
+declare function filter<A>(predicate: (value: A) => boolean, opts?: StoreOptions): StoreOperator<A, A | undefined>;
+
+export { filter };

package/dist/extra/filter.d.ts

@@ -0,0 +1,16 @@
+import { b as StoreOptions, a as StoreOperator } from '../types-DsAN6Hga.js';
+
+/**
+ * Conditionally forwards upstream values. When the predicate returns false,
+ * holds the last passing value.
+ *
+ * Stateful: maintains last passing value via operator()'s cache.
+ * get() returns the last value that passed the predicate, or undefined.
+ *
+ * v3: Tier 1 — uses operator() with single dep. When predicate is false and
+ * lastPassing is unchanged, sends RESOLVED (subtree skipping) instead of
+ * re-emitting. Pull-based get() when disconnected re-evaluates predicate.
+ */
+declare function filter<A>(predicate: (value: A) => boolean, opts?: StoreOptions): StoreOperator<A, A | undefined>;
+
+export { filter };

package/dist/extra/filter.js

@@ -0,0 +1,2 @@
+import{a}from"../chunk-XHUZ4TRE.js";import"../chunk-2BINVZ33.js";import"../chunk-7WTS4C5R.js";import"../chunk-QYUTDL4D.js";export{a as filter};
+//# sourceMappingURL=filter.js.map

package/dist/extra/filter.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/extra/find.cjs

@@ -0,0 +1,3 @@
+"use strict";var v=Object.defineProperty;var B=Object.getOwnPropertyDescriptor;var C=Object.getOwnPropertyNames;var K=Object.prototype.hasOwnProperty;var U=(n,t)=>{for(var i in t)v(n,i,{get:t[i],enumerable:!0})},V=(n,t,i,s)=>{if(t&&typeof t=="object"||typeof t=="function")for(let e of C(t))!K.call(n,e)&&e!==i&&v(n,e,{get:()=>t[e],enumerable:!(s=B(t,e))||s.enumerable});return n};var Y=n=>V(v({},"__esModule",{value:!0}),n);var q={};U(q,{find:()=>J});module.exports=Y(q);var m=Symbol("DIRTY"),S=Symbol("RESOLVED"),x=0,A=1,R=2,O=3,w=4,I=5,p=7,k=7<<p,W=["DISCONNECTED","DIRTY","SETTLED","RESOLVED","COMPLETED","ERRORED"];function N(n){return W[(n&k)>>>p]}var d=0,g=1,l=2,T=3;var y=class n{static _names=new WeakMap;static _kinds=new WeakMap;static _keys=new WeakMap;static _stores=new Set;static _edges=new Map;static _nextId=0;static _usedKeys=new Set;static _explicitEnabled=null;static _cachedDefault=null;static get enabled(){if(n._explicitEnabled!==null)return n._explicitEnabled;if(n._cachedDefault!==null)return n._cachedDefault;try{n._cachedDefault=globalThis.process?.env?.NODE_ENV!=="production"}catch{n._cachedDefault=!0}return n._cachedDefault}static set enabled(t){n._explicitEnabled=t}static _depSuffix(t){if(!t?.length)return;let s=t.map(e=>n._names.get(e)??"?").join(",");return s.length>40?`${s.slice(0,37)}...`:s}static _resolveKey(t){return n._keys.get(t)??n._names.get(t)??"anonymous"}static register(t,i){if(!n.enabled)return;i?.name&&n._names.set(t,i.name),i?.kind&&n._kinds.set(t,i.kind);let s=n._nextId++,e=i?.name;if(!(e&&!n._usedKeys.has(e)))if(e){let r=n._depSuffix(i?.deps);e=r?`${e}(${r})`:`${e}_${s}`,n._usedKeys.has(e)&&(e=`${e}_${s}`)}else{let r=i?.kind??"store",o=n._depSuffix(i?.deps);e=o?`${r}(${o})`:`${r}_${s}`,n._usedKeys.has(e)&&(e=`${e}_${s}`)}n._usedKeys.add(e),n._keys.set(t,e),n._stores.add(new WeakRef(t))}static registerEdge(t,i){if(!n.enabled)return;let s=n._resolveKey(t),e=n._resolveKey(i),r=n._edges.get(s);r?r.includes(e)||r.push(e):n._edges.set(s,[e])}static getEdges(){return new Map(n._edges)}static getName(t){if(n.enabled)return n._names.get(t)}static getKind(t){return n._kinds.get(t)}static inspect(t){return{name:n._names.get(t),kind:n._kinds.get(t)??"unknown",value:typeof t.get=="function"?t.get():void 0,status:t._status}}static graph(){let t=new Map,i=new Set;for(let s of n._stores){let e=s.deref();if(!e){n._stores.delete(s);continue}let r=n._resolveKey(e);i.add(r),t.set(r,n.inspect(e))}for(let[s,e]of n._edges){if(!i.has(s)){n._edges.delete(s),n._usedKeys.delete(s);continue}let r=e.filter(o=>i.has(o));r.length===0?n._edges.delete(s):r.length!==e.length&&n._edges.set(s,r)}return t}static trace(t,i){let s=null,e=t.get();return t.source(d,(r,o)=>{if(r===d&&(s=o),r===l){s=null;return}if(r===1){let a=o;if(!Object.is(a,e)){let u=e;e=a,i(a,u)}}}),()=>s?.(l)}static dumpGraph(){let t=n.graph(),i=n.getEdges(),s=new Map;for(let[o,a]of i)for(let u of a){let c=s.get(u);c?c.includes(o)||c.push(o):s.set(u,[o])}let e=[];for(let[o,a]of t){let u=s.get(o),c=i.get(o),h=u?.length?`  \u2190 [${u.join(", ")}]`:"",L=c?.length?`  \u2192 [${c.join(", ")}]`:"";e.push(`  ${o} (${a.kind}) = ${JSON.stringify(a.value)}  [${a.status??"?"}]${h}${L}`)}return[`Store Graph (${t.size} nodes):`,...e].join(`
+`)}static _observe(t,i,s){let e=null,r=i??n.getName(t),o={values:[],signals:[],events:[],ended:!1,endError:void 0,dirtyCount:0,resolvedCount:0,name:r,dispose:()=>e?.(l)};return t.source(d,(a,u)=>{if(a===d){e=u;return}a===g?(o.values.push(u),o.events.push({type:"data",data:u}),s&&s(`[${r}] DATA:`,u)):a===T?(o.signals.push(u),o.events.push({type:"signal",data:u}),u===m?o.dirtyCount++:u===S&&o.resolvedCount++,s&&s(`[${r}] STATE:`,u)):a===l&&(o.ended=!0,o.endError=u,o.events.push({type:"end",data:u}),s&&s(`[${r}] END`,u!==void 0?u:""),e=null)}),o}static observe(t){return n._observe(t)}static tap(t,i){let s=i??`tap(${n.getName(t)??"anon"})`,e={get:()=>t.get(),source:t.source};return n.register(e,{name:s,kind:"tap"}),n.registerEdge(t,e),e}static spy(t,i){let s=i?.name??n.getName(t)??"spy",e=i?.log??console.log;return n._observe(t,s,e)}static snapshot(){let t=n.graph(),i=n.getEdges(),s=[];for(let[r,o]of t)s.push({name:r,kind:o.kind,value:o.value,status:o.status});let e=[];for(let[r,o]of i)for(let a of o)e.push({from:r,to:a});return{nodes:s,edges:e}}static _reset(){n._names=new WeakMap,n._kinds=new WeakMap,n._keys=new WeakMap,n._stores=new Set,n._edges=new Map,n._usedKeys=new Set,n._nextId=0,n._explicitEnabled=null,n._cachedDefault=null}};var E=1,b=2,M=4,f=8,$=x<<p,F=A<<p,P=R<<p,z=O<<p,G=w<<p,H=I<<p,_=k,D=class{_value;_output=null;_upstreamTalkbacks=[];_handler=null;_flags;_deps;_init;_getterFn;_initial;get _status(){return N(this._flags)}constructor(t,i,s){this._value=s?.initial,this._initial=s?.initial,this._deps=t,this._init=i,this._getterFn=s?.getter;let e=0;s?.resetOnTeardown&&(e|=b),s?.resubscribable&&(e|=M),this._flags=e,this.source=this.source.bind(this),y.register(this,{kind:s?.kind??"operator",...s,deps:t});for(let r of t)y.registerEdge(r,this)}_dispatch(t,i){let s=this._output;if(s)if(this._flags&f)for(let e of s)e(t,i);else s(t,i)}_connectUpstream(){let t=new Array(this._deps.length).fill(null);this._upstreamTalkbacks=t;let i=!1,s={seed:e=>{i||(this._value=e)},emit:e=>{i||(this._value=e,this._flags=this._flags&~_|P,this._dispatch(g,e))},signal:e=>{i||(e===m?this._flags=this._flags&~_|F:e===S&&(this._flags=this._flags&~_|z),this._dispatch(T,e))},complete:()=>{if(i)return;i=!0,this._flags=(this._flags|E)&~_|G,this._handler=null;for(let o of t)o?.(l);t.fill(null),this._flags&b&&(this._value=this._initial);let e=this._output,r=this._flags&f;if(this._output=null,this._flags&=~f,e)if(r)for(let o of e)o(l);else e(l)},error:e=>{if(i)return;i=!0,this._flags=(this._flags|E)&~_|H,this._handler=null;for(let a of t)a?.(l);t.fill(null),this._flags&b&&(this._value=this._initial);let r=this._output,o=this._flags&f;if(this._output=null,this._flags&=~f,r)if(o)for(let a of r)a(l,e);else r(l,e)},disconnect:e=>{if(e!==void 0)t[e]?.(l),t[e]=null;else{for(let r of t)r?.(l);t.fill(null)}}};this._handler=this._init(s);for(let e=0;e<this._deps.length&&!i;e++){let r=e;this._deps[r].source(d,(o,a)=>{if(o===d){t[r]=a;return}this._handler?.(r,o,a)})}}_disconnectUpstream(){for(let t of this._upstreamTalkbacks)t?.(l);this._upstreamTalkbacks=[],this._handler=null,this._flags=this._flags&~_|$,this._flags&b&&(this._value=this._initial)}get(){if(this._getterFn&&!this._output){let t=this._getterFn(this._value);return this._value=t,t}return this._value}source(t,i){if(t===d){let s=i;if(this._flags&E)if(this._flags&M&&this._output===null)this._flags=this._flags&~(E|_)|$;else{s(d,r=>{}),s(l);return}let e=this._output===null;if(this._output===null)this._output=s;else if(this._flags&f)this._output.add(s);else{let r=new Set;r.add(this._output),r.add(s),this._output=r,this._flags|=f}s(d,r=>{if(r===g&&s(g,this._value),r===l){if(this._output===null)return;if(this._flags&f){let o=this._output;o.delete(s),o.size===1?(this._output=o.values().next().value,this._flags&=~f):o.size===0&&(this._output=null,this._flags&=~f,this._disconnectUpstream())}else this._output===s&&(this._output=null,this._disconnectUpstream())}}),e&&this._connectUpstream()}}};function j(n,t,i){return new D(n,t,i)}function J(n){return t=>j([t],({emit:i,signal:s,complete:e,error:r,disconnect:o})=>{let a=!1;return(u,c,h)=>{c===T&&(a||s(h)),c===g&&(a||(n(h)?(a=!0,i(h),o(),e()):s(S))),c===l&&(a||(a=!0,h!==void 0?r(h):e()))}})}0&&(module.exports={find});
+//# sourceMappingURL=find.cjs.map