@callable-recharge/callbag-recharge 0.1.0

package/dist/patterns/createStore/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/patterns/createStore/index.ts","../../../src/core/bitmask.ts","../../../src/core/protocol.ts","../../../src/core/inspector.ts","../../../src/core/derived.ts","../../../src/core/producer.ts","../../../src/core/state.ts","../../../src/core/subscribe.ts"],"sourcesContent":["/**\n * createStore — single-store pattern for Zustand/Redux users.\n *\n * Provides a familiar `create((set, get) => ({ ...state, ...actions }))` API\n * backed by callbag-recharge primitives. Key advantage over Zustand:\n * diamond-safe `select()` returns a `Store<U>` with automatic memoization\n * and dependency tracking — no reselect, no useShallow.\n *\n * Zustand StoreApi compatibility: matches `getState`, `setState`, `subscribe`,\n * `getInitialState` — Zustand middleware (persist, devtools, immer) can wrap\n * this store directly.\n */\n\nimport { derived } from \"../../core/derived\";\nimport { batch, teardown } from \"../../core/protocol\";\nimport { state } from \"../../core/state\";\nimport { subscribe as coreSubscribe } from \"../../core/subscribe\";\nimport type { Store, WritableStore } from \"../../core/types\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\ntype SetStateAction<T> = T | Partial<T> | ((state: T) => T | Partial<T>);\n\ntype Get<T> = () => T;\ntype Set<T> = (partial: SetStateAction<T>, replace?: boolean) => void;\n\ntype StateCreator<T> = (set: Set<T>, get: Get<T>) => T;\n\n/**\n * Zustand-compatible StoreApi — middleware works if you match this contract.\n */\ninterface StoreApi<T> {\n\tsetState: (partial: SetStateAction<T>, replace?: boolean) => void;\n\tgetState: () => T;\n\tgetInitialState: () => T;\n\tsubscribe: (listener: (state: T, prevState: T) => void) => () => void;\n}\n\ninterface CreateStoreResult<T> extends StoreApi<T> {\n\t/**\n\t * Create a diamond-safe derived store from a selector function.\n\t * Returns a `Store<U>` that only recomputes when the selected value\n\t * actually changes (push-phase memoization via `equals`).\n\t *\n\t * This is the killer feature over Zustand — selectors are reactive stores\n\t * with automatic memoization, not just functions re-evaluated on every render.\n\t */\n\tselect<U>(selector: (state: T) => U, equals?: (a: U, b: U) => boolean): Store<U>;\n\n\t/**\n\t * The underlying callbag-recharge WritableStore.\n\t * Use this to compose with other callbag-recharge primitives\n\t * (derived, effect, pipe, operators).\n\t */\n\tstore: WritableStore<T>;\n\n\t/**\n\t * Destroy the store — sends END to all downstream subscribers and derived\n\t * stores, cascading through the entire subgraph. After destroy, the store\n\t * is in COMPLETED state and won't accept new values or subscriptions.\n\t */\n\tdestroy: () => void;\n}\n\n// ---------------------------------------------------------------------------\n// createStore\n// ---------------------------------------------------------------------------\n\nexport function createStore<T extends object>(initializer: StateCreator<T>): CreateStoreResult<T> {\n\t// --- Phase 1: initialization ---\n\t// `source` doesn't exist yet. get()/set() use `initialState` directly.\n\t// source is `let` so set() during the initializer doesn't throw.\n\tlet source: WritableStore<T> | null = null;\n\tlet initialState: T = undefined as unknown as T;\n\n\t// Action keys cached once after init (not recomputed per set()).\n\t// Starts empty — set() during init skips action preservation (no actions yet).\n\tlet actionKeys: string[] = [];\n\n\tconst get: Get<T> = () => (source ? (source.get() as T) : initialState);\n\n\tconst set: Set<T> = (partial, replace) => {\n\t\tconst prev = get();\n\t\tconst nextPartial =\n\t\t\ttypeof partial === \"function\" ? (partial as (s: T) => T | Partial<T>)(prev) : partial;\n\n\t\t// No-op early return — avoids unnecessary allocation\n\t\tif (nextPartial === prev && !replace) return;\n\n\t\t// replace=true replaces the entire state, no action preservation.\n\t\tif (replace) {\n\t\t\tif (source) source.set(nextPartial as T);\n\t\t\telse initialState = nextPartial as T;\n\t\t\treturn;\n\t\t}\n\n\t\tconst nextState = Object.assign({}, prev, nextPartial) as T;\n\n\t\t// Preserve action references not explicitly overwritten.\n\t\tfor (const key of actionKeys) {\n\t\t\tif (!Object.hasOwn(nextPartial as object, key)) {\n\t\t\t\t(nextState as any)[key] = (prev as any)[key];\n\t\t\t}\n\t\t}\n\n\t\tif (source) source.set(nextState);\n\t\telse initialState = nextState;\n\t};\n\n\t// Run initializer — may call set()/get() during execution.\n\t// get() returns `initialState` (starts as undefined, updated by any\n\t// set() calls during init). This matches Zustand's behavior.\n\tinitialState = initializer(set, get);\n\n\t// Cache action keys once after init\n\tactionKeys = Object.keys(initialState).filter(\n\t\t(k) => typeof (initialState as any)[k] === \"function\",\n\t);\n\n\t// Snapshot for getInitialState() — frozen reference to the original state\n\tconst frozenInitial = initialState;\n\n\t// --- Phase 2: reactive backing store ---\n\t// After this point, `source` is set and get()/set() delegate to it.\n\tsource = state<T>(initialState, { name: \"createStore\" });\n\n\t// -- StoreApi methods --\n\t// coreSubscribe is a lightweight sink (no graph node allocation, no\n\t// Inspector registration). effect() would work but creates an unnecessary\n\t// store node — we just need \"call me when values change\".\n\n\tconst setState: StoreApi<T>[\"setState\"] = (partial, replace) => {\n\t\tset(partial, replace);\n\t};\n\n\tconst getState: StoreApi<T>[\"getState\"] = () => source!.get() as T;\n\n\tconst getInitialState: StoreApi<T>[\"getInitialState\"] = () => frozenInitial;\n\n\tconst storeSubscribe: StoreApi<T>[\"subscribe\"] = (listener) => {\n\t\treturn coreSubscribe(source as Store<T>, (value, prev) => {\n\t\t\tlistener(value, prev as T);\n\t\t});\n\t};\n\n\t// -- Select: the killer feature --\n\n\tconst select = <U>(selector: (state: T) => U, equals?: (a: U, b: U) => boolean): Store<U> => {\n\t\treturn derived([source as Store<T>], () => selector(source!.get() as T), {\n\t\t\tequals: equals ?? (Object.is as (a: U, b: U) => boolean),\n\t\t});\n\t};\n\n\t// destroy() uses protocol-level teardown — sends END to all downstream\n\t// sinks (subscribers, select()-derived stores), cascading through the\n\t// entire subgraph.\n\tconst destroy = () => {\n\t\tteardown(source!);\n\t};\n\n\treturn {\n\t\tsetState,\n\t\tgetState,\n\t\tgetInitialState,\n\t\tsubscribe: storeSubscribe,\n\t\tselect,\n\t\tstore: source,\n\t\tdestroy,\n\t};\n}\n\nexport { batch, teardown };\nexport type { StoreApi, CreateStoreResult, StateCreator, SetStateAction };\n","/**\n * Dirty-dep bitmask — safe for any number of deps.\n *\n * ≤32 deps: stores bitmask as a plain number in `_v` (zero overhead).\n * >32 deps: stores bits in a Uint32Array `_w`, with `_v` tracking the\n *   count of set bits for O(1) emptiness checks.\n *\n * In both cases, `empty()` is a single `_v === 0` comparison — no typeof\n * dispatch, no array scan. Method calls on the class prototype are\n * monomorphic (one hidden class for all instances).\n *\n * Used by derived, effect, merge, combine — anywhere dirty-dep tracking\n * needs per-dep bit flags.\n */\n\nexport class Bitmask {\n\t/** Narrow (≤32): bitmask value. Wide (>32): count of set bits. */\n\t_v: number;\n\t/** Uint32Array for >32 deps, null otherwise. */\n\t_w: Uint32Array | null;\n\n\tconstructor(size: number) {\n\t\tthis._v = 0;\n\t\tthis._w = size > 32 ? new Uint32Array(((size - 1) >>> 5) + 1) : null;\n\t}\n\n\tset(i: number): void {\n\t\tconst w = this._w;\n\t\tif (w === null) {\n\t\t\tthis._v |= 1 << i;\n\t\t} else {\n\t\t\tconst idx = i >>> 5;\n\t\t\tconst bit = 1 << (i & 31);\n\t\t\tif (!(w[idx] & bit)) {\n\t\t\t\tw[idx] |= bit;\n\t\t\t\tthis._v++;\n\t\t\t}\n\t\t}\n\t}\n\n\tclear(i: number): void {\n\t\tconst w = this._w;\n\t\tif (w === null) {\n\t\t\tthis._v &= ~(1 << i);\n\t\t} else {\n\t\t\tconst idx = i >>> 5;\n\t\t\tconst bit = 1 << (i & 31);\n\t\t\tif (w[idx] & bit) {\n\t\t\t\tw[idx] &= ~bit;\n\t\t\t\tthis._v--;\n\t\t\t}\n\t\t}\n\t}\n\n\ttest(i: number): boolean {\n\t\tconst w = this._w;\n\t\tif (w === null) return (this._v & (1 << i)) !== 0;\n\t\treturn (w[i >>> 5] & (1 << (i & 31))) !== 0;\n\t}\n\n\t/** O(1) in both narrow and wide paths. */\n\tempty(): boolean {\n\t\treturn this._v === 0;\n\t}\n\n\treset(): void {\n\t\tthis._v = 0;\n\t\tthis._w?.fill(0);\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 * Computed store with dirty tracking and caching. Recomputes fn() when\n * all dirty deps have resolved, emitting the new value on type 1 DATA.\n *\n * v6 (Option D3): Disconnect on last subscriber leaving. get() pull-computes\n * from deps when disconnected (always fresh). source() subscription triggers\n * connection; last unsubscribe triggers disconnect.\n *\n * _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 { Bitmask } from \"./bitmask\";\nimport { Inspector } from \"./inspector\";\nimport {\n\tbeginDeferredStart,\n\tDATA,\n\tDIRTY,\n\tdecodeStatus,\n\tEND,\n\tendDeferredStart,\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 { Store, StoreOptions } from \"./types\";\n\n// Flag bits for _flags bitmask (bits 0-6)\nconst D_HAS_CACHED = 1;\nconst D_CONNECTED = 2;\nconst D_ANY_DATA = 4;\nconst D_COMPLETED = 8;\n// bit 4 unused (was D_STANDALONE, then D_RESET — removed: derived get() always pull-computes)\nconst D_MULTI = 32;\nconst D_IDENTITY = 64;\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 DerivedImpl<T> {\n\t_output: ((type: number, data?: any) => void) | Set<any> | null = null;\n\t_upstreamTalkbacks: Array<(type: number) => void> = [];\n\t_cachedValue: T | undefined;\n\t_flags: number;\n\t_dirtyDeps!: Bitmask;\n\t_eqFn: ((a: T, b: T) => boolean) | undefined;\n\t_deps: Store<unknown>[];\n\t_fn: () => T;\n\n\tget _status() {\n\t\treturn decodeStatus(this._flags);\n\t}\n\n\tconstructor(deps: Store<unknown>[], fn: () => T, opts?: StoreOptions<T>, identity?: boolean) {\n\t\tthis._deps = deps;\n\t\tthis._fn = fn;\n\t\tthis._eqFn = opts?.equals;\n\t\tthis._flags = identity ? D_IDENTITY : 0;\n\t\t// S_DISCONNECTED = 0, so no need to set status bits\n\t\tthis._dirtyDeps = new Bitmask(deps.length);\n\n\t\tthis.source = this.source.bind(this);\n\n\t\tInspector.register(this as any, { kind: \"derived\", ...opts, deps });\n\t\tfor (const dep of deps) Inspector.registerEdge(dep, this as any);\n\n\t\t// v4.1: Fully lazy — no computation or connection at construction.\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 & D_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_recompute(): void {\n\t\tconst result = this._fn();\n\t\tif (this._eqFn && this._flags & D_HAS_CACHED && this._eqFn(this._cachedValue as T, result)) {\n\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_RESOLVED;\n\t\t\tthis._dispatch(STATE, RESOLVED);\n\t\t\treturn;\n\t\t}\n\t\tthis._cachedValue = result;\n\t\tthis._flags = ((this._flags | D_HAS_CACHED) & ~_STATUS_MASK) | _S_SETTLED;\n\t\tthis._dispatch(DATA, this._cachedValue);\n\t}\n\n\t_recomputeIdentity(data: T): void {\n\t\tif (this._eqFn && this._flags & D_HAS_CACHED && this._eqFn(this._cachedValue as T, data)) {\n\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_RESOLVED;\n\t\t\tthis._dispatch(STATE, RESOLVED);\n\t\t\treturn;\n\t\t}\n\t\tthis._cachedValue = data;\n\t\tthis._flags = ((this._flags | D_HAS_CACHED) & ~_STATUS_MASK) | _S_SETTLED;\n\t\tthis._dispatch(DATA, data);\n\t}\n\n\t_lazyConnect(): void {\n\t\tif (this._flags & (D_CONNECTED | D_COMPLETED)) return;\n\t\tthis._cachedValue = this._fn();\n\t\tthis._flags = ((this._flags | D_HAS_CACHED) & ~_STATUS_MASK) | _S_SETTLED;\n\t\tbeginDeferredStart();\n\t\tthis._connectUpstream();\n\t\tif (!(this._flags & D_COMPLETED)) {\n\t\t\tthis._flags |= D_CONNECTED;\n\t\t}\n\t\tendDeferredStart();\n\t}\n\n\t_connectUpstream(): void {\n\t\tthis._upstreamTalkbacks = [];\n\t\tif (this._deps.length === 1) {\n\t\t\tif (this._flags & D_IDENTITY) {\n\t\t\t\tthis._connectSingleDepIdentity();\n\t\t\t} else {\n\t\t\t\tthis._connectSingleDep();\n\t\t\t}\n\t\t} else {\n\t\t\tthis._connectMultiDep();\n\t\t}\n\t}\n\n\t/** Single-dep: no bitmask, direct forward (P0 optimization) */\n\t_connectSingleDep(): void {\n\t\tlet dirty = false;\n\t\tthis._deps[0].source(START, (type: number, data: any) => {\n\t\t\tif (type === START) {\n\t\t\t\tthis._upstreamTalkbacks.push(data);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (this._flags & D_COMPLETED) return;\n\n\t\t\tif (type === STATE) {\n\t\t\t\tif (data === DIRTY) {\n\t\t\t\t\tdirty = true;\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} else if (data === RESOLVED) {\n\t\t\t\t\tif (dirty) {\n\t\t\t\t\t\tdirty = false;\n\t\t\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_RESOLVED;\n\t\t\t\t\t\tthis._dispatch(STATE, RESOLVED);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tthis._dispatch(STATE, data);\n\t\t\t\t}\n\t\t\t} else if (type === DATA) {\n\t\t\t\tif (dirty) {\n\t\t\t\t\tdirty = false;\n\t\t\t\t\tthis._recompute();\n\t\t\t\t} else {\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\tthis._recompute();\n\t\t\t\t}\n\t\t\t} else if (type === END) {\n\t\t\t\tthis._handleEnd(data);\n\t\t\t}\n\t\t});\n\t}\n\n\t_connectSingleDepIdentity(): void {\n\t\tlet dirty = false;\n\t\tthis._deps[0].source(START, (type: number, data: any) => {\n\t\t\tif (type === START) {\n\t\t\t\tthis._upstreamTalkbacks.push(data);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (this._flags & D_COMPLETED) return;\n\n\t\t\tif (type === STATE) {\n\t\t\t\tif (data === DIRTY) {\n\t\t\t\t\tdirty = true;\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} else if (data === RESOLVED) {\n\t\t\t\t\tif (dirty) {\n\t\t\t\t\t\tdirty = false;\n\t\t\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_RESOLVED;\n\t\t\t\t\t\tthis._dispatch(STATE, RESOLVED);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tthis._dispatch(STATE, data);\n\t\t\t\t}\n\t\t\t} else if (type === DATA) {\n\t\t\t\tif (dirty) {\n\t\t\t\t\tdirty = false;\n\t\t\t\t\tthis._recomputeIdentity(data);\n\t\t\t\t} else {\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\tthis._recomputeIdentity(data);\n\t\t\t\t}\n\t\t\t} else if (type === END) {\n\t\t\t\tthis._handleEnd(data);\n\t\t\t}\n\t\t});\n\t}\n\n\t/** Multi-dep: bitmask-based diamond resolution */\n\t_connectMultiDep(): void {\n\t\tfor (let i = 0; i < this._deps.length; i++) {\n\t\t\tif (this._flags & D_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\tthis._upstreamTalkbacks.push(data);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (this._flags & D_COMPLETED) return;\n\n\t\t\t\tif (type === STATE) {\n\t\t\t\t\tif (data === DIRTY) {\n\t\t\t\t\t\tconst wasEmpty = this._dirtyDeps.empty();\n\t\t\t\t\t\tthis._dirtyDeps.set(depIndex);\n\t\t\t\t\t\tif (wasEmpty) {\n\t\t\t\t\t\t\tthis._flags &= ~D_ANY_DATA;\n\t\t\t\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_DIRTY;\n\t\t\t\t\t\t\tthis._dispatch(STATE, DIRTY);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (data === RESOLVED) {\n\t\t\t\t\t\tif (this._dirtyDeps.test(depIndex)) {\n\t\t\t\t\t\t\tthis._dirtyDeps.clear(depIndex);\n\t\t\t\t\t\t\tif (this._dirtyDeps.empty()) {\n\t\t\t\t\t\t\t\tif (this._flags & D_ANY_DATA) {\n\t\t\t\t\t\t\t\t\tthis._recompute();\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_RESOLVED;\n\t\t\t\t\t\t\t\t\tthis._dispatch(STATE, RESOLVED);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tthis._dispatch(STATE, data);\n\t\t\t\t\t}\n\t\t\t\t} else if (type === DATA) {\n\t\t\t\t\tif (this._dirtyDeps.test(depIndex)) {\n\t\t\t\t\t\tthis._dirtyDeps.clear(depIndex);\n\t\t\t\t\t\tthis._flags |= D_ANY_DATA;\n\t\t\t\t\t\tif (this._dirtyDeps.empty()) {\n\t\t\t\t\t\t\tthis._recompute();\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (this._dirtyDeps.empty()) {\n\t\t\t\t\t\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_DIRTY;\n\t\t\t\t\t\t\tthis._dispatch(STATE, DIRTY);\n\t\t\t\t\t\t\tthis._recompute();\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tthis._flags |= D_ANY_DATA;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else if (type === END) {\n\t\t\t\t\tthis._handleEnd(data);\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t}\n\n\t_handleEnd(errorData: any): void {\n\t\tthis._flags |= D_COMPLETED;\n\t\tthis._flags =\n\t\t\t(this._flags & ~_STATUS_MASK) | (errorData !== undefined ? _S_ERRORED : _S_COMPLETED);\n\t\tfor (const tb of this._upstreamTalkbacks) tb(END);\n\t\tthis._upstreamTalkbacks = [];\n\t\tthis._flags &= ~D_CONNECTED;\n\t\tthis._dirtyDeps.reset();\n\t\tconst output = this._output;\n\t\tconst wasMulti = this._flags & D_MULTI;\n\t\tthis._output = null;\n\t\tthis._flags &= ~D_MULTI;\n\t\tif (output) {\n\t\t\tif (wasMulti) {\n\t\t\t\tfor (const sink of output as Set<any>) {\n\t\t\t\t\terrorData !== undefined ? sink(END, errorData) : sink(END);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\terrorData !== undefined\n\t\t\t\t\t? (output as (type: number, data?: any) => void)(END, errorData)\n\t\t\t\t\t: (output as (type: number, data?: any) => void)(END);\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._flags &= ~(D_CONNECTED | D_ANY_DATA);\n\t\tthis._flags = (this._flags & ~_STATUS_MASK) | _S_DISCONNECTED;\n\t\tthis._dirtyDeps.reset();\n\t}\n\n\t/**\n\t * v6: Pull-compute when disconnected (always fresh). When connected,\n\t * returns push-updated cache (fast path).\n\t */\n\tget(): T {\n\t\tif (this._flags & D_CONNECTED) {\n\t\t\treturn this._cachedValue as T;\n\t\t}\n\t\tif (this._flags & D_COMPLETED) {\n\t\t\treturn this._cachedValue as T;\n\t\t}\n\t\t// Disconnected: pull-compute from deps\n\t\tconst result = this._fn();\n\t\tthis._cachedValue = result;\n\t\tthis._flags |= D_HAS_CACHED;\n\t\treturn result;\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 & D_COMPLETED) {\n\t\t\t\tsink(START, (_t: number) => {});\n\t\t\t\tsink(END);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (!(this._flags & D_CONNECTED)) {\n\t\t\t\tthis._lazyConnect();\n\t\t\t\tif (this._flags & D_COMPLETED) {\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\n\t\t\tif (this._output === null) {\n\t\t\t\tthis._output = sink;\n\t\t\t} else if (!(this._flags & D_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 |= D_MULTI;\n\t\t\t} else {\n\t\t\t\t(this._output as Set<any>).add(sink);\n\t\t\t}\n\n\t\t\tsink(START, (t: number) => {\n\t\t\t\tif (t === DATA) sink(DATA, this._cachedValue);\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 & D_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 &= ~D_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 &= ~D_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}\n\t}\n}\n\nexport function derived<T>(deps: Store<unknown>[], fn: () => T, opts?: StoreOptions<T>): Store<T> {\n\treturn new DerivedImpl<T>(deps, fn, opts) as any;\n}\n\nexport namespace derived {\n\texport function from<T>(dep: Store<T>, opts?: StoreOptions<T>): Store<T> {\n\t\treturn new DerivedImpl<T>([dep as Store<unknown>], () => dep.get() as any, opts, true) as any;\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 * A writable store, subclass of ProducerImpl.\n * Adds set()/update() API and defaults equals to Object.is.\n *\n * v5: _status packed into _flags bits 7-9 (inherited from ProducerImpl).\n * set() fast path uses pre-shifted status constants for zero-overhead writes.\n */\n\nimport { Inspector } from \"./inspector\";\nimport {\n\t_S_DIRTY,\n\t_S_SETTLED,\n\t_STATUS_MASK,\n\tP_AUTO_DIRTY,\n\tP_COMPLETED,\n\tP_PENDING,\n\tProducerImpl,\n} from \"./producer\";\nimport { DATA, DIRTY, deferEmission, isBatching, STATE } from \"./protocol\";\nimport type { StoreOptions, WritableStore } from \"./types\";\n\nexport class StateImpl<T> extends ProducerImpl<T> {\n\tconstructor(initial: T, opts?: StoreOptions<T>) {\n\t\tsuper(undefined, {\n\t\t\tinitial,\n\t\t\tautoDirty: true,\n\t\t\tequals: opts?.equals ?? Object.is,\n\t\t\t_skipInspect: true,\n\t\t});\n\t\tthis.set = this.set.bind(this);\n\t\tInspector.register(this as any, { kind: \"state\", ...opts });\n\t}\n\n\toverride get(): T {\n\t\treturn this._value as T;\n\t}\n\n\t/**\n\t * Fast path: inlines ProducerImpl.emit() to skip the bound method call.\n\t * For no-subscriber writes, this is just an equals check + value assign.\n\t * Status writes use pre-shifted integer constants (bits 7-9 of _flags).\n\t */\n\tset(value: T): void {\n\t\tif (this._flags & P_COMPLETED) return;\n\t\tif (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\tupdate(fn: (current: T) => T): void {\n\t\tthis.set(fn(this._value as T));\n\t}\n}\n\nexport function state<T>(initial: T, opts?: StoreOptions<T>): WritableStore<T> {\n\treturn new StateImpl<T>(initial, 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":"ubAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,WAAAE,GAAA,gBAAAC,GAAA,aAAAC,KAAA,eAAAC,GAAAL,ICeO,IAAMM,EAAN,KAAc,CAEpB,GAEA,GAEA,YAAYC,EAAc,CACzB,KAAK,GAAK,EACV,KAAK,GAAKA,EAAO,GAAK,IAAI,aAAcA,EAAO,IAAO,GAAK,CAAC,EAAI,IACjE,CAEA,IAAIC,EAAiB,CACpB,IAAMC,EAAI,KAAK,GACf,GAAIA,IAAM,KACT,KAAK,IAAM,GAAKD,MACV,CACN,IAAME,EAAMF,IAAM,EACZG,EAAM,IAAMH,EAAI,IAChBC,EAAEC,CAAG,EAAIC,IACdF,EAAEC,CAAG,GAAKC,EACV,KAAK,KAEP,CACD,CAEA,MAAMH,EAAiB,CACtB,IAAMC,EAAI,KAAK,GACf,GAAIA,IAAM,KACT,KAAK,IAAM,EAAE,GAAKD,OACZ,CACN,IAAME,EAAMF,IAAM,EACZG,EAAM,IAAMH,EAAI,IAClBC,EAAEC,CAAG,EAAIC,IACZF,EAAEC,CAAG,GAAK,CAACC,EACX,KAAK,KAEP,CACD,CAEA,KAAKH,EAAoB,CACxB,IAAMC,EAAI,KAAK,GACf,OAAIA,IAAM,MAAc,KAAK,GAAM,GAAKD,KAAQ,GACxCC,EAAED,IAAM,CAAC,EAAK,IAAMA,EAAI,OAAU,CAC3C,CAGA,OAAiB,CAChB,OAAO,KAAK,KAAO,CACpB,CAEA,OAAc,CACb,KAAK,GAAK,EACV,KAAK,IAAI,KAAK,CAAC,CAChB,CACD,EC7DO,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,EAAa,EACXC,EAAuC,CAAC,EAU1CC,GAAW,GAER,SAASC,GAASC,EAAgB,CACxCJ,IACA,GAAI,CACH,OAAOI,EAAG,CACX,QAAE,CAED,GADAJ,IACIA,IAAe,GAAK,CAACE,GAAU,CAClCA,GAAW,GACX,QAASG,EAAI,EAAGA,EAAIJ,EAAkB,OAAQI,IAC7CJ,EAAkBI,CAAC,EAAE,EAEtBJ,EAAkB,OAAS,EAC3BC,GAAW,EACZ,CACD,CACD,CAEO,SAASI,GAAsB,CACrC,OAAON,EAAa,CACrB,CAEO,SAASO,EAAcH,EAAsB,CACnDH,EAAkB,KAAKG,CAAE,CAC1B,CAMA,IAAII,EAAe,EACbC,EAAmC,CAAC,EAEnC,SAASC,GAA2B,CAC1CF,GACD,CAEO,SAASG,GAAyB,CAExC,GADAH,IACIA,IAAiB,EAAG,CACvB,QAASH,EAAI,EAAGA,EAAII,EAAc,OAAQJ,IACzCI,EAAcJ,CAAC,EAAE,EAElBI,EAAc,OAAS,CACxB,CACD,CAEO,SAASG,GAAWC,EAAyB,CAC/CL,EAAe,EAClBC,EAAc,KAAKI,CAAK,EAExBA,EAAM,CAER,CAcO,SAASC,GAASC,EAAgE,CACxF,IAAMC,EAAOD,EACT,OAAOC,EAAK,UAAa,WAC5BA,EAAK,SAAS,EACJ,OAAOA,EAAK,YAAe,YACrCA,EAAK,WAAW,MAAS,CAE3B,CClGO,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,GAAUlC,GAAM,OAAS,aAAQA,EAAK,KAAK,IAAI,CAAC,IAAM,GACtDmC,GAAWtB,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,EAAO,GAAGC,EAAQ,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,EC5VA,IAAMiD,EAAe,EACfC,EAAc,EACdC,EAAa,EACbC,EAAc,EAEdC,EAAU,GACVC,GAAa,GAGbC,GAAkBC,GAAkBC,EACpCC,EAAWC,GAAWF,EACtBG,GAAaC,GAAaJ,EAC1BK,EAAcC,GAAcN,EAC5BO,GAAeC,GAAeR,EAC9BS,GAAaC,GAAaV,EAC1BW,EAAeC,EAERC,GAAN,KAAqB,CAC3B,QAAkE,KAClE,mBAAoD,CAAC,EACrD,aACA,OACA,WACA,MACA,MACA,IAEA,IAAI,SAAU,CACb,OAAOC,EAAa,KAAK,MAAM,CAChC,CAEA,YAAYC,EAAwBC,EAAaC,EAAwBC,EAAoB,CAC5F,KAAK,MAAQH,EACb,KAAK,IAAMC,EACX,KAAK,MAAQC,GAAM,OACnB,KAAK,OAASC,EAAWrB,GAAa,EAEtC,KAAK,WAAa,IAAIsB,EAAQJ,EAAK,MAAM,EAEzC,KAAK,OAAS,KAAK,OAAO,KAAK,IAAI,EAEnCK,EAAU,SAAS,KAAa,CAAE,KAAM,UAAW,GAAGH,EAAM,KAAAF,CAAK,CAAC,EAClE,QAAWM,KAAON,EAAMK,EAAU,aAAaC,EAAK,IAAW,CAGhE,CAEA,UAAUC,EAAcC,EAAkB,CACzC,IAAMC,EAAS,KAAK,QACpB,GAAKA,EACL,GAAI,KAAK,OAAS5B,EACjB,QAAW6B,KAAQD,EAAoBC,EAAKH,EAAMC,CAAI,OAErDC,EAA8CF,EAAMC,CAAI,CAE3D,CAEA,YAAmB,CAClB,IAAMG,EAAS,KAAK,IAAI,EACxB,GAAI,KAAK,OAAS,KAAK,OAASlC,GAAgB,KAAK,MAAM,KAAK,aAAmBkC,CAAM,EAAG,CAC3F,KAAK,OAAU,KAAK,OAAS,CAACf,EAAgBN,EAC9C,KAAK,UAAUsB,EAAOC,CAAQ,EAC9B,MACD,CACA,KAAK,aAAeF,EACpB,KAAK,QAAW,KAAK,OAASlC,GAAgB,CAACmB,EAAgBR,GAC/D,KAAK,UAAU0B,EAAM,KAAK,YAAY,CACvC,CAEA,mBAAmBN,EAAe,CACjC,GAAI,KAAK,OAAS,KAAK,OAAS/B,GAAgB,KAAK,MAAM,KAAK,aAAmB+B,CAAI,EAAG,CACzF,KAAK,OAAU,KAAK,OAAS,CAACZ,EAAgBN,EAC9C,KAAK,UAAUsB,EAAOC,CAAQ,EAC9B,MACD,CACA,KAAK,aAAeL,EACpB,KAAK,QAAW,KAAK,OAAS/B,GAAgB,CAACmB,EAAgBR,GAC/D,KAAK,UAAU0B,EAAMN,CAAI,CAC1B,CAEA,cAAqB,CAChB,KAAK,QAAU9B,EAAcE,KACjC,KAAK,aAAe,KAAK,IAAI,EAC7B,KAAK,QAAW,KAAK,OAASH,GAAgB,CAACmB,EAAgBR,GAC/D2B,EAAmB,EACnB,KAAK,iBAAiB,EAChB,KAAK,OAASnC,IACnB,KAAK,QAAUF,GAEhBsC,EAAiB,EAClB,CAEA,kBAAyB,CACxB,KAAK,mBAAqB,CAAC,EACvB,KAAK,MAAM,SAAW,EACrB,KAAK,OAASlC,GACjB,KAAK,0BAA0B,EAE/B,KAAK,kBAAkB,EAGxB,KAAK,iBAAiB,CAExB,CAGA,mBAA0B,CACzB,IAAImC,EAAQ,GACZ,KAAK,MAAM,CAAC,EAAE,OAAOC,EAAO,CAACX,EAAcC,IAAc,CACxD,GAAID,IAASW,EAAO,CACnB,KAAK,mBAAmB,KAAKV,CAAI,EACjC,MACD,CACI,KAAK,OAAS5B,IAEd2B,IAASK,EACRJ,IAASW,GACZF,EAAQ,GACR,KAAK,OAAU,KAAK,OAAS,CAACrB,EAAgBV,EAC9C,KAAK,UAAU0B,EAAOO,CAAK,GACjBX,IAASK,EACfI,IACHA,EAAQ,GACR,KAAK,OAAU,KAAK,OAAS,CAACrB,EAAgBN,EAC9C,KAAK,UAAUsB,EAAOC,CAAQ,GAG/B,KAAK,UAAUD,EAAOJ,CAAI,EAEjBD,IAASO,EACfG,GACHA,EAAQ,GACR,KAAK,WAAW,IAEhB,KAAK,OAAU,KAAK,OAAS,CAACrB,EAAgBV,EAC9C,KAAK,UAAU0B,EAAOO,CAAK,EAC3B,KAAK,WAAW,GAEPZ,IAASa,GACnB,KAAK,WAAWZ,CAAI,EAEtB,CAAC,CACF,CAEA,2BAAkC,CACjC,IAAIS,EAAQ,GACZ,KAAK,MAAM,CAAC,EAAE,OAAOC,EAAO,CAACX,EAAcC,IAAc,CACxD,GAAID,IAASW,EAAO,CACnB,KAAK,mBAAmB,KAAKV,CAAI,EACjC,MACD,CACI,KAAK,OAAS5B,IAEd2B,IAASK,EACRJ,IAASW,GACZF,EAAQ,GACR,KAAK,OAAU,KAAK,OAAS,CAACrB,EAAgBV,EAC9C,KAAK,UAAU0B,EAAOO,CAAK,GACjBX,IAASK,EACfI,IACHA,EAAQ,GACR,KAAK,OAAU,KAAK,OAAS,CAACrB,EAAgBN,EAC9C,KAAK,UAAUsB,EAAOC,CAAQ,GAG/B,KAAK,UAAUD,EAAOJ,CAAI,EAEjBD,IAASO,EACfG,GACHA,EAAQ,GACR,KAAK,mBAAmBT,CAAI,IAE5B,KAAK,OAAU,KAAK,OAAS,CAACZ,EAAgBV,EAC9C,KAAK,UAAU0B,EAAOO,CAAK,EAC3B,KAAK,mBAAmBX,CAAI,GAEnBD,IAASa,GACnB,KAAK,WAAWZ,CAAI,EAEtB,CAAC,CACF,CAGA,kBAAyB,CACxB,QAASa,EAAI,EAAGA,EAAI,KAAK,MAAM,QAC1B,OAAK,OAASzC,GADoByC,IAAK,CAE3C,IAAMC,EAAWD,EACjB,KAAK,MAAMC,CAAQ,EAAE,OAAOJ,EAAO,CAACX,EAAcC,IAAc,CAC/D,GAAID,IAASW,EAAO,CACnB,KAAK,mBAAmB,KAAKV,CAAI,EACjC,MACD,CACA,GAAI,OAAK,OAAS5B,GAElB,GAAI2B,IAASK,EACZ,GAAIJ,IAASW,EAAO,CACnB,IAAMI,EAAW,KAAK,WAAW,MAAM,EACvC,KAAK,WAAW,IAAID,CAAQ,EACxBC,IACH,KAAK,QAAU,CAAC5C,EAChB,KAAK,OAAU,KAAK,OAAS,CAACiB,EAAgBV,EAC9C,KAAK,UAAU0B,EAAOO,CAAK,EAE7B,MAAWX,IAASK,EACf,KAAK,WAAW,KAAKS,CAAQ,IAChC,KAAK,WAAW,MAAMA,CAAQ,EAC1B,KAAK,WAAW,MAAM,IACrB,KAAK,OAAS3C,EACjB,KAAK,WAAW,GAEhB,KAAK,OAAU,KAAK,OAAS,CAACiB,EAAgBN,EAC9C,KAAK,UAAUsB,EAAOC,CAAQ,KAKjC,KAAK,UAAUD,EAAOJ,CAAI,OAEjBD,IAASO,EACf,KAAK,WAAW,KAAKQ,CAAQ,GAChC,KAAK,WAAW,MAAMA,CAAQ,EAC9B,KAAK,QAAU3C,EACX,KAAK,WAAW,MAAM,GACzB,KAAK,WAAW,GAGb,KAAK,WAAW,MAAM,GACzB,KAAK,OAAU,KAAK,OAAS,CAACiB,EAAgBV,EAC9C,KAAK,UAAU0B,EAAOO,CAAK,EAC3B,KAAK,WAAW,GAEhB,KAAK,QAAUxC,EAGP4B,IAASa,GACnB,KAAK,WAAWZ,CAAI,CAEtB,CAAC,CACF,CACD,CAEA,WAAWgB,EAAsB,CAChC,KAAK,QAAU5C,EACf,KAAK,OACH,KAAK,OAAS,CAACgB,GAAiB4B,IAAc,OAAY9B,GAAaF,IACzE,QAAWiC,KAAM,KAAK,mBAAoBA,EAAGL,CAAG,EAChD,KAAK,mBAAqB,CAAC,EAC3B,KAAK,QAAU,CAAC1C,EAChB,KAAK,WAAW,MAAM,EACtB,IAAM+B,EAAS,KAAK,QACdiB,EAAW,KAAK,OAAS7C,EAG/B,GAFA,KAAK,QAAU,KACf,KAAK,QAAU,CAACA,EACZ4B,EACH,GAAIiB,EACH,QAAWhB,KAAQD,EAClBe,IAAc,OAAYd,EAAKU,EAAKI,CAAS,EAAId,EAAKU,CAAG,OAG1DI,IAAc,OACVf,EAA8CW,EAAKI,CAAS,EAC5Df,EAA8CW,CAAG,CAGxD,CAEA,qBAA4B,CAC3B,QAAWK,KAAM,KAAK,mBAAoBA,EAAGL,CAAG,EAChD,KAAK,mBAAqB,CAAC,EAC3B,KAAK,QAAU,EAAE1C,EAAcC,GAC/B,KAAK,OAAU,KAAK,OAAS,CAACiB,EAAgBb,GAC9C,KAAK,WAAW,MAAM,CACvB,CAMA,KAAS,CACR,GAAI,KAAK,OAASL,EACjB,OAAO,KAAK,aAEb,GAAI,KAAK,OAASE,EACjB,OAAO,KAAK,aAGb,IAAM+B,EAAS,KAAK,IAAI,EACxB,YAAK,aAAeA,EACpB,KAAK,QAAUlC,EACRkC,CACR,CAEA,OAAOJ,EAAcoB,EAAqB,CACzC,GAAIpB,IAASW,EAAO,CACnB,IAAMR,EAAOiB,EACb,GAAI,KAAK,OAAS/C,EAAa,CAC9B8B,EAAKQ,EAAQU,GAAe,CAAC,CAAC,EAC9BlB,EAAKU,CAAG,EACR,MACD,CAEA,GAAI,EAAE,KAAK,OAAS1C,KACnB,KAAK,aAAa,EACd,KAAK,OAASE,GAAa,CAC9B8B,EAAKQ,EAAQU,GAAe,CAAC,CAAC,EAC9BlB,EAAKU,CAAG,EACR,MACD,CAGD,GAAI,KAAK,UAAY,KACpB,KAAK,QAAUV,UACH,KAAK,OAAS7B,EAOzB,KAAK,QAAqB,IAAI6B,CAAI,MAPC,CACpC,IAAMmB,EAAM,IAAI,IAChBA,EAAI,IAAI,KAAK,OAAO,EACpBA,EAAI,IAAInB,CAAI,EACZ,KAAK,QAAUmB,EACf,KAAK,QAAUhD,CAChB,CAIA6B,EAAKQ,EAAQY,GAAc,CAE1B,GADIA,IAAMhB,GAAMJ,EAAKI,EAAM,KAAK,YAAY,EACxCgB,IAAMV,EAAK,CACd,GAAI,KAAK,UAAY,KAAM,OAC3B,GAAI,KAAK,OAASvC,EAAS,CAC1B,IAAMgD,EAAM,KAAK,QACjBA,EAAI,OAAOnB,CAAI,EACXmB,EAAI,OAAS,GAChB,KAAK,QAAUA,EAAI,OAAO,EAAE,KAAK,EAAE,MACnC,KAAK,QAAU,CAAChD,GACNgD,EAAI,OAAS,IACvB,KAAK,QAAU,KACf,KAAK,QAAU,CAAChD,EAChB,KAAK,oBAAoB,EAE3B,MAAW,KAAK,UAAY6B,IAC3B,KAAK,QAAU,KACf,KAAK,oBAAoB,EAE3B,CACD,CAAC,CACF,CACD,CACD,EAEO,SAASqB,GAAW/B,EAAwBC,EAAaC,EAAkC,CACjG,OAAO,IAAIJ,GAAeE,EAAMC,EAAIC,CAAI,CACzC,EAEiB6B,GAAV,CACC,SAASC,EAAQ1B,EAAeJ,EAAkC,CACxE,OAAO,IAAIJ,GAAe,CAACQ,CAAqB,EAAG,IAAMA,EAAI,IAAI,EAAUJ,EAAM,EAAI,CACtF,CAFO6B,EAAS,KAAAC,IADAD,KAAA,IC5UjB,IAAME,GAAY,EACZC,EAAU,GAGHC,EAAc,EACdC,EAAe,EACtBC,GAAU,EACVC,GAAU,GACHC,EAAY,GAGZC,EAAeC,EACfC,EAAWC,GAAWC,EACtBC,EAAaC,GAAaF,EAC1BG,GAAkBC,GAAkBJ,EACpCK,GAAeC,GAAeN,EAC9BO,GAAaC,GAAaR,EAC1BS,GAAcC,GAAcV,EAE5BW,GAAN,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,IAChCqB,GAAM,iBAAgBC,GAASrB,IAEnC,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,IAAa,CAAC,KAAK,IAAK,OAC1C,KAAK,QAAUA,GACf,IAAM2C,EAAS,KAAK,IAAI,IAAW,EACnC,KAAK,SAAW,OAAOA,GAAW,WAAaA,EAAS,MACzD,CAEA,OAAc,CACP,KAAK,OAAS3C,KACpB,KAAK,QAAU,CAACA,GACZ,KAAK,UAAU,KAAK,SAAS,EACjC,KAAK,SAAW,OACZ,KAAK,OAASI,KAAS,KAAK,OAAS,KAAK,UACxC,KAAK,OAASF,IAAc,KAAK,OAAU,KAAK,OAAS,CAACK,EAAgBO,IACjF,CAEA,OAAOc,EAAcgB,EAAqB,CACzC,GAAIhB,IAASiB,EAAO,CACnB,IAAMd,EAAOa,EACb,GAAI,KAAK,OAAS1C,EACjB,GAAI,KAAK,OAASG,IAAW,KAAK,UAAY,KAC7C,KAAK,OAAU,KAAK,OAAS,EAAEH,EAAcK,GAAiBO,OACxD,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,GAC9C,KAAK,MAAM,EAEb,MAAW,KAAK,UAAYiB,IAC3B,KAAK,QAAU,KACf,KAAK,OAAU,KAAK,OAAS,CAACxB,EAAgBO,GAC9C,KAAK,MAAM,EAEb,CACD,CAAC,EACDmC,GAAW,IAAM,KAAK,OAAO,CAAC,CAC/B,CACD,CACD,EC5PO,IAAMC,GAAN,cAA2BC,EAAgB,CACjD,YAAYC,EAAYC,EAAwB,CAC/C,MAAM,OAAW,CAChB,QAAAD,EACA,UAAW,GACX,OAAQC,GAAM,QAAU,OAAO,GAC/B,aAAc,EACf,CAAC,EACD,KAAK,IAAM,KAAK,IAAI,KAAK,IAAI,EAC7BC,EAAU,SAAS,KAAa,CAAE,KAAM,QAAS,GAAGD,CAAK,CAAC,CAC3D,CAES,KAAS,CACjB,OAAO,KAAK,MACb,CAOA,IAAIE,EAAgB,CACf,KAAK,OAASC,GACd,KAAK,SAAW,QAAa,KAAK,MAAO,KAAK,OAAaD,CAAK,IACpE,KAAK,OAASA,EACT,KAAK,UACNE,EAAW,EACR,KAAK,OAASC,IACnB,KAAK,QAAUA,EACX,KAAK,OAASC,IACjB,KAAK,OAAU,KAAK,OAAS,CAACC,EAAgBC,EAC9C,KAAK,UAAUC,EAAOC,CAAK,GAE5BC,EAAc,IAAM,CACnB,KAAK,QAAU,CAACN,EAChB,KAAK,OAAU,KAAK,OAAS,CAACE,EAAgBK,EAC9C,KAAK,UAAUC,EAAM,KAAK,MAAM,CACjC,CAAC,IAGE,KAAK,OAASP,IACjB,KAAK,OAAU,KAAK,OAAS,CAACC,EAAgBC,EAC9C,KAAK,UAAUC,EAAOC,CAAK,GAE5B,KAAK,OAAU,KAAK,OAAS,CAACH,EAAgBK,EAC9C,KAAK,UAAUC,EAAM,KAAK,MAAM,IAElC,CAEA,OAAOC,EAA6B,CACnC,KAAK,IAAIA,EAAG,KAAK,MAAW,CAAC,CAC9B,CACD,EAEO,SAASC,GAAShB,EAAYC,EAA0C,CAC9E,OAAO,IAAIH,GAAaE,EAASC,CAAI,CACtC,CC9DO,SAASgB,GACfC,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,CPkBO,SAASK,GAA8BC,EAAoD,CAIjG,IAAIC,EAAkC,KAClCC,EAIAC,EAAuB,CAAC,EAEtBC,EAAc,IAAOH,EAAUA,EAAO,IAAI,EAAUC,EAEpDG,EAAc,CAACC,EAASC,IAAY,CACzC,IAAMC,EAAOJ,EAAI,EACXK,EACL,OAAOH,GAAY,WAAcA,EAAqCE,CAAI,EAAIF,EAG/E,GAAIG,IAAgBD,GAAQ,CAACD,EAAS,OAGtC,GAAIA,EAAS,CACRN,EAAQA,EAAO,IAAIQ,CAAgB,EAClCP,EAAeO,EACpB,MACD,CAEA,IAAMC,GAAY,OAAO,OAAO,CAAC,EAAGF,EAAMC,CAAW,EAGrD,QAAWE,MAAOR,EACZ,OAAO,OAAOM,EAAuBE,EAAG,IAC3CD,GAAkBC,EAAG,EAAKH,EAAaG,EAAG,GAIzCV,EAAQA,EAAO,IAAIS,EAAS,EAC3BR,EAAeQ,EACrB,EAKAR,EAAeF,EAAYK,EAAKD,CAAG,EAGnCD,EAAa,OAAO,KAAKD,CAAY,EAAE,OACrCU,GAAM,OAAQV,EAAqBU,CAAC,GAAM,UAC5C,EAGA,IAAMC,EAAgBX,EAItB,OAAAD,EAASa,GAASZ,EAAc,CAAE,KAAM,aAAc,CAAC,EAoChD,CACN,SA9ByC,CAACI,EAASC,IAAY,CAC/DF,EAAIC,EAASC,CAAO,CACrB,EA6BC,SA3ByC,IAAMN,EAAQ,IAAI,EA4B3D,gBA1BuD,IAAMY,EA2B7D,UAzBiDE,GAC1CC,GAAcf,EAAoB,CAACgB,EAAOT,IAAS,CACzDO,EAASE,EAAOT,CAAS,CAC1B,CAAC,EAuBD,OAlBc,CAAIU,EAA2BC,IACtCC,GAAQ,CAACnB,CAAkB,EAAG,IAAMiB,EAASjB,EAAQ,IAAI,CAAM,EAAG,CACxE,OAAQkB,GAAW,OAAO,EAC3B,CAAC,EAgBD,MAAOlB,EACP,QAXe,IAAM,CACrBoB,GAASpB,CAAO,CACjB,CAUA,CACD","names":["createStore_exports","__export","batch","createStore","teardown","__toCommonJS","Bitmask","size","i","w","idx","bit","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","draining","batch","fn","i","isBatching","deferEmission","connectDepth","pendingStarts","beginDeferredStart","endDeferredStart","deferStart","start","teardown","store","node","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","D_HAS_CACHED","D_CONNECTED","D_ANY_DATA","D_COMPLETED","D_MULTI","D_IDENTITY","_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","DerivedImpl","decodeStatus","deps","fn","opts","identity","Bitmask","Inspector","dep","type","data","output","sink","result","STATE","RESOLVED","DATA","beginDeferredStart","endDeferredStart","dirty","START","DIRTY","END","i","depIndex","wasEmpty","errorData","tb","wasMulti","payload","_t","set","t","derived","from","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","StateImpl","ProducerImpl","initial","opts","Inspector","value","P_COMPLETED","isBatching","P_PENDING","P_AUTO_DIRTY","_STATUS_MASK","_S_DIRTY","STATE","DIRTY","deferEmission","_S_SETTLED","DATA","fn","state","subscribe","store","cb","opts","talkback","beginDeferredStart","START","type","data","END","next","p","prev","endDeferredStart","createStore","initializer","source","initialState","actionKeys","get","set","partial","replace","prev","nextPartial","nextState","key","k","frozenInitial","state","listener","subscribe","value","selector","equals","derived","teardown"]}

package/dist/patterns/createStore/index.d.cts

@@ -0,0 +1,55 @@
+import { S as Store, W as WritableStore } from '../../types-DsAN6Hga.cjs';
+export { c as batch, t as teardown } from '../../types-DsAN6Hga.cjs';
+
+/**
+ * createStore — single-store pattern for Zustand/Redux users.
+ *
+ * Provides a familiar `create((set, get) => ({ ...state, ...actions }))` API
+ * backed by callbag-recharge primitives. Key advantage over Zustand:
+ * diamond-safe `select()` returns a `Store<U>` with automatic memoization
+ * and dependency tracking — no reselect, no useShallow.
+ *
+ * Zustand StoreApi compatibility: matches `getState`, `setState`, `subscribe`,
+ * `getInitialState` — Zustand middleware (persist, devtools, immer) can wrap
+ * this store directly.
+ */
+
+type SetStateAction<T> = T | Partial<T> | ((state: T) => T | Partial<T>);
+type Get<T> = () => T;
+type Set<T> = (partial: SetStateAction<T>, replace?: boolean) => void;
+type StateCreator<T> = (set: Set<T>, get: Get<T>) => T;
+/**
+ * Zustand-compatible StoreApi — middleware works if you match this contract.
+ */
+interface StoreApi<T> {
+    setState: (partial: SetStateAction<T>, replace?: boolean) => void;
+    getState: () => T;
+    getInitialState: () => T;
+    subscribe: (listener: (state: T, prevState: T) => void) => () => void;
+}
+interface CreateStoreResult<T> extends StoreApi<T> {
+    /**
+     * Create a diamond-safe derived store from a selector function.
+     * Returns a `Store<U>` that only recomputes when the selected value
+     * actually changes (push-phase memoization via `equals`).
+     *
+     * This is the killer feature over Zustand — selectors are reactive stores
+     * with automatic memoization, not just functions re-evaluated on every render.
+     */
+    select<U>(selector: (state: T) => U, equals?: (a: U, b: U) => boolean): Store<U>;
+    /**
+     * The underlying callbag-recharge WritableStore.
+     * Use this to compose with other callbag-recharge primitives
+     * (derived, effect, pipe, operators).
+     */
+    store: WritableStore<T>;
+    /**
+     * Destroy the store — sends END to all downstream subscribers and derived
+     * stores, cascading through the entire subgraph. After destroy, the store
+     * is in COMPLETED state and won't accept new values or subscriptions.
+     */
+    destroy: () => void;
+}
+declare function createStore<T extends object>(initializer: StateCreator<T>): CreateStoreResult<T>;
+
+export { type CreateStoreResult, type SetStateAction, type StateCreator, type StoreApi, createStore };

package/dist/patterns/createStore/index.d.ts

@@ -0,0 +1,55 @@
+import { S as Store, W as WritableStore } from '../../types-DsAN6Hga.js';
+export { c as batch, t as teardown } from '../../types-DsAN6Hga.js';
+
+/**
+ * createStore — single-store pattern for Zustand/Redux users.
+ *
+ * Provides a familiar `create((set, get) => ({ ...state, ...actions }))` API
+ * backed by callbag-recharge primitives. Key advantage over Zustand:
+ * diamond-safe `select()` returns a `Store<U>` with automatic memoization
+ * and dependency tracking — no reselect, no useShallow.
+ *
+ * Zustand StoreApi compatibility: matches `getState`, `setState`, `subscribe`,
+ * `getInitialState` — Zustand middleware (persist, devtools, immer) can wrap
+ * this store directly.
+ */
+
+type SetStateAction<T> = T | Partial<T> | ((state: T) => T | Partial<T>);
+type Get<T> = () => T;
+type Set<T> = (partial: SetStateAction<T>, replace?: boolean) => void;
+type StateCreator<T> = (set: Set<T>, get: Get<T>) => T;
+/**
+ * Zustand-compatible StoreApi — middleware works if you match this contract.
+ */
+interface StoreApi<T> {
+    setState: (partial: SetStateAction<T>, replace?: boolean) => void;
+    getState: () => T;
+    getInitialState: () => T;
+    subscribe: (listener: (state: T, prevState: T) => void) => () => void;
+}
+interface CreateStoreResult<T> extends StoreApi<T> {
+    /**
+     * Create a diamond-safe derived store from a selector function.
+     * Returns a `Store<U>` that only recomputes when the selected value
+     * actually changes (push-phase memoization via `equals`).
+     *
+     * This is the killer feature over Zustand — selectors are reactive stores
+     * with automatic memoization, not just functions re-evaluated on every render.
+     */
+    select<U>(selector: (state: T) => U, equals?: (a: U, b: U) => boolean): Store<U>;
+    /**
+     * The underlying callbag-recharge WritableStore.
+     * Use this to compose with other callbag-recharge primitives
+     * (derived, effect, pipe, operators).
+     */
+    store: WritableStore<T>;
+    /**
+     * Destroy the store — sends END to all downstream subscribers and derived
+     * stores, cascading through the entire subgraph. After destroy, the store
+     * is in COMPLETED state and won't accept new values or subscriptions.
+     */
+    destroy: () => void;
+}
+declare function createStore<T extends object>(initializer: StateCreator<T>): CreateStoreResult<T>;
+
+export { type CreateStoreResult, type SetStateAction, type StateCreator, type StoreApi, createStore };

package/dist/patterns/createStore/index.js

@@ -0,0 +1,2 @@
+import{a as b}from"../../chunk-IZ5GFMMK.js";import{a as p}from"../../chunk-K7VPCAZD.js";import"../../chunk-PYRVYHZG.js";import{a as u}from"../../chunk-OHGZIPRU.js";import"../../chunk-LM26JNAK.js";import"../../chunk-7WTS4C5R.js";import{p as d,v as l}from"../../chunk-QYUTDL4D.js";function P(f){let t=null,a,S=[],T=()=>t?t.get():a,c=(e,o)=>{let r=T(),s=typeof e=="function"?e(r):e;if(s===r&&!o)return;if(o){t?t.set(s):a=s;return}let i=Object.assign({},r,s);for(let n of S)Object.hasOwn(s,n)||(i[n]=r[n]);t?t.set(i):a=i};a=f(c,T),S=Object.keys(a).filter(e=>typeof a[e]=="function");let y=a;return t=p(a,{name:"createStore"}),{setState:(e,o)=>{c(e,o)},getState:()=>t.get(),getInitialState:()=>y,subscribe:e=>u(t,(o,r)=>{e(o,r)}),select:(e,o)=>b([t],()=>e(t.get()),{equals:o??Object.is}),store:t,destroy:()=>{l(t)}}}export{d as batch,P as createStore,l as teardown};
+//# sourceMappingURL=index.js.map

package/dist/patterns/createStore/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/patterns/createStore/index.ts"],"sourcesContent":["/**\n * createStore — single-store pattern for Zustand/Redux users.\n *\n * Provides a familiar `create((set, get) => ({ ...state, ...actions }))` API\n * backed by callbag-recharge primitives. Key advantage over Zustand:\n * diamond-safe `select()` returns a `Store<U>` with automatic memoization\n * and dependency tracking — no reselect, no useShallow.\n *\n * Zustand StoreApi compatibility: matches `getState`, `setState`, `subscribe`,\n * `getInitialState` — Zustand middleware (persist, devtools, immer) can wrap\n * this store directly.\n */\n\nimport { derived } from \"../../core/derived\";\nimport { batch, teardown } from \"../../core/protocol\";\nimport { state } from \"../../core/state\";\nimport { subscribe as coreSubscribe } from \"../../core/subscribe\";\nimport type { Store, WritableStore } from \"../../core/types\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\ntype SetStateAction<T> = T | Partial<T> | ((state: T) => T | Partial<T>);\n\ntype Get<T> = () => T;\ntype Set<T> = (partial: SetStateAction<T>, replace?: boolean) => void;\n\ntype StateCreator<T> = (set: Set<T>, get: Get<T>) => T;\n\n/**\n * Zustand-compatible StoreApi — middleware works if you match this contract.\n */\ninterface StoreApi<T> {\n\tsetState: (partial: SetStateAction<T>, replace?: boolean) => void;\n\tgetState: () => T;\n\tgetInitialState: () => T;\n\tsubscribe: (listener: (state: T, prevState: T) => void) => () => void;\n}\n\ninterface CreateStoreResult<T> extends StoreApi<T> {\n\t/**\n\t * Create a diamond-safe derived store from a selector function.\n\t * Returns a `Store<U>` that only recomputes when the selected value\n\t * actually changes (push-phase memoization via `equals`).\n\t *\n\t * This is the killer feature over Zustand — selectors are reactive stores\n\t * with automatic memoization, not just functions re-evaluated on every render.\n\t */\n\tselect<U>(selector: (state: T) => U, equals?: (a: U, b: U) => boolean): Store<U>;\n\n\t/**\n\t * The underlying callbag-recharge WritableStore.\n\t * Use this to compose with other callbag-recharge primitives\n\t * (derived, effect, pipe, operators).\n\t */\n\tstore: WritableStore<T>;\n\n\t/**\n\t * Destroy the store — sends END to all downstream subscribers and derived\n\t * stores, cascading through the entire subgraph. After destroy, the store\n\t * is in COMPLETED state and won't accept new values or subscriptions.\n\t */\n\tdestroy: () => void;\n}\n\n// ---------------------------------------------------------------------------\n// createStore\n// ---------------------------------------------------------------------------\n\nexport function createStore<T extends object>(initializer: StateCreator<T>): CreateStoreResult<T> {\n\t// --- Phase 1: initialization ---\n\t// `source` doesn't exist yet. get()/set() use `initialState` directly.\n\t// source is `let` so set() during the initializer doesn't throw.\n\tlet source: WritableStore<T> | null = null;\n\tlet initialState: T = undefined as unknown as T;\n\n\t// Action keys cached once after init (not recomputed per set()).\n\t// Starts empty — set() during init skips action preservation (no actions yet).\n\tlet actionKeys: string[] = [];\n\n\tconst get: Get<T> = () => (source ? (source.get() as T) : initialState);\n\n\tconst set: Set<T> = (partial, replace) => {\n\t\tconst prev = get();\n\t\tconst nextPartial =\n\t\t\ttypeof partial === \"function\" ? (partial as (s: T) => T | Partial<T>)(prev) : partial;\n\n\t\t// No-op early return — avoids unnecessary allocation\n\t\tif (nextPartial === prev && !replace) return;\n\n\t\t// replace=true replaces the entire state, no action preservation.\n\t\tif (replace) {\n\t\t\tif (source) source.set(nextPartial as T);\n\t\t\telse initialState = nextPartial as T;\n\t\t\treturn;\n\t\t}\n\n\t\tconst nextState = Object.assign({}, prev, nextPartial) as T;\n\n\t\t// Preserve action references not explicitly overwritten.\n\t\tfor (const key of actionKeys) {\n\t\t\tif (!Object.hasOwn(nextPartial as object, key)) {\n\t\t\t\t(nextState as any)[key] = (prev as any)[key];\n\t\t\t}\n\t\t}\n\n\t\tif (source) source.set(nextState);\n\t\telse initialState = nextState;\n\t};\n\n\t// Run initializer — may call set()/get() during execution.\n\t// get() returns `initialState` (starts as undefined, updated by any\n\t// set() calls during init). This matches Zustand's behavior.\n\tinitialState = initializer(set, get);\n\n\t// Cache action keys once after init\n\tactionKeys = Object.keys(initialState).filter(\n\t\t(k) => typeof (initialState as any)[k] === \"function\",\n\t);\n\n\t// Snapshot for getInitialState() — frozen reference to the original state\n\tconst frozenInitial = initialState;\n\n\t// --- Phase 2: reactive backing store ---\n\t// After this point, `source` is set and get()/set() delegate to it.\n\tsource = state<T>(initialState, { name: \"createStore\" });\n\n\t// -- StoreApi methods --\n\t// coreSubscribe is a lightweight sink (no graph node allocation, no\n\t// Inspector registration). effect() would work but creates an unnecessary\n\t// store node — we just need \"call me when values change\".\n\n\tconst setState: StoreApi<T>[\"setState\"] = (partial, replace) => {\n\t\tset(partial, replace);\n\t};\n\n\tconst getState: StoreApi<T>[\"getState\"] = () => source!.get() as T;\n\n\tconst getInitialState: StoreApi<T>[\"getInitialState\"] = () => frozenInitial;\n\n\tconst storeSubscribe: StoreApi<T>[\"subscribe\"] = (listener) => {\n\t\treturn coreSubscribe(source as Store<T>, (value, prev) => {\n\t\t\tlistener(value, prev as T);\n\t\t});\n\t};\n\n\t// -- Select: the killer feature --\n\n\tconst select = <U>(selector: (state: T) => U, equals?: (a: U, b: U) => boolean): Store<U> => {\n\t\treturn derived([source as Store<T>], () => selector(source!.get() as T), {\n\t\t\tequals: equals ?? (Object.is as (a: U, b: U) => boolean),\n\t\t});\n\t};\n\n\t// destroy() uses protocol-level teardown — sends END to all downstream\n\t// sinks (subscribers, select()-derived stores), cascading through the\n\t// entire subgraph.\n\tconst destroy = () => {\n\t\tteardown(source!);\n\t};\n\n\treturn {\n\t\tsetState,\n\t\tgetState,\n\t\tgetInitialState,\n\t\tsubscribe: storeSubscribe,\n\t\tselect,\n\t\tstore: source,\n\t\tdestroy,\n\t};\n}\n\nexport { batch, teardown };\nexport type { StoreApi, CreateStoreResult, StateCreator, SetStateAction };\n"],"mappings":"uRAsEO,SAASA,EAA8BC,EAAoD,CAIjG,IAAIC,EAAkC,KAClCC,EAIAC,EAAuB,CAAC,EAEtBC,EAAc,IAAOH,EAAUA,EAAO,IAAI,EAAUC,EAEpDG,EAAc,CAACC,EAASC,IAAY,CACzC,IAAMC,EAAOJ,EAAI,EACXK,EACL,OAAOH,GAAY,WAAcA,EAAqCE,CAAI,EAAIF,EAG/E,GAAIG,IAAgBD,GAAQ,CAACD,EAAS,OAGtC,GAAIA,EAAS,CACRN,EAAQA,EAAO,IAAIQ,CAAgB,EAClCP,EAAeO,EACpB,MACD,CAEA,IAAMC,EAAY,OAAO,OAAO,CAAC,EAAGF,EAAMC,CAAW,EAGrD,QAAWE,KAAOR,EACZ,OAAO,OAAOM,EAAuBE,CAAG,IAC3CD,EAAkBC,CAAG,EAAKH,EAAaG,CAAG,GAIzCV,EAAQA,EAAO,IAAIS,CAAS,EAC3BR,EAAeQ,CACrB,EAKAR,EAAeF,EAAYK,EAAKD,CAAG,EAGnCD,EAAa,OAAO,KAAKD,CAAY,EAAE,OACrCU,GAAM,OAAQV,EAAqBU,CAAC,GAAM,UAC5C,EAGA,IAAMC,EAAgBX,EAItB,OAAAD,EAASa,EAASZ,EAAc,CAAE,KAAM,aAAc,CAAC,EAoChD,CACN,SA9ByC,CAACI,EAASC,IAAY,CAC/DF,EAAIC,EAASC,CAAO,CACrB,EA6BC,SA3ByC,IAAMN,EAAQ,IAAI,EA4B3D,gBA1BuD,IAAMY,EA2B7D,UAzBiDE,GAC1CC,EAAcf,EAAoB,CAACgB,EAAOT,IAAS,CACzDO,EAASE,EAAOT,CAAS,CAC1B,CAAC,EAuBD,OAlBc,CAAIU,EAA2BC,IACtCC,EAAQ,CAACnB,CAAkB,EAAG,IAAMiB,EAASjB,EAAQ,IAAI,CAAM,EAAG,CACxE,OAAQkB,GAAW,OAAO,EAC3B,CAAC,EAgBD,MAAOlB,EACP,QAXe,IAAM,CACrBoB,EAASpB,CAAO,CACjB,CAUA,CACD","names":["createStore","initializer","source","initialState","actionKeys","get","set","partial","replace","prev","nextPartial","nextState","key","k","frozenInitial","state","listener","subscribe","value","selector","equals","derived","teardown"]}

package/dist/types-BiLijSKv.d.cts

@@ -0,0 +1,192 @@
+import { S as Store } from './types-DsAN6Hga.cjs';
+import { E as EvictionPolicy } from './eviction-DGPP1vHP.cjs';
+
+type KVEventType = "set" | "delete" | "clear";
+interface KVEvent<V> {
+    type: KVEventType;
+    key?: string;
+    value?: V;
+}
+interface ReactiveMap<V> extends NodeV0 {
+    /** Point read — O(1), ~10ns */
+    get(key: string): V | undefined;
+    /** Point write — O(1), ~50ns */
+    set(key: string, value: V): void;
+    /** Delete a key. Returns true if the key existed. */
+    delete(key: string): boolean;
+    /** Check if a key exists. */
+    has(key: string): boolean;
+    /** Atomic read-modify-write. */
+    update(key: string, fn: (current: V | undefined) => V): void;
+    /** Get existing value or create with factory. */
+    getOrSet(key: string, factory: () => V): V;
+    /** Get all keys (snapshot). */
+    keys(): string[];
+    /** Get all values (snapshot). */
+    values(): V[];
+    /** Get all entries (snapshot). */
+    entries(): [string, V][];
+    /** Current number of keys. */
+    size(): number;
+    /** Clear all keys. */
+    clear(): void;
+    /** Set multiple keys atomically (single DIRTY cycle). */
+    setMany(entries: Record<string, V> | [string, V][]): void;
+    /** Cached read-only reactive view of a key. Auto-cleaned on delete. */
+    select(key: string): Store<V | undefined>;
+    /** Reactive store of all current keys. Version-gated, lazy materialization. */
+    keysStore: Store<string[]>;
+    /** Reactive store of current size. */
+    sizeStore: Store<number>;
+    /** Reactive filtered view. */
+    where(pred: (value: V, key: string) => boolean): Store<[string, V][]>;
+    /** Set a key with a time-to-live in milliseconds. */
+    setWithTTL(key: string, value: V, ttlMs: number): void;
+    /** Get remaining TTL in ms. undefined if no TTL. */
+    ttl(key: string): number | undefined;
+    /** Remove TTL from a key, keeping the key alive. */
+    persist(key: string): void;
+    /** Keyspace notification store. Zero cost if unsubscribed. */
+    events: Store<KVEvent<V> | undefined>;
+    /** Virtual partitioning via key prefix. */
+    namespace(prefix: string): ReactiveMap<V>;
+    /** Return a JSON-serializable snapshot of the map. */
+    snapshot(): MapSnapshot<V>;
+    /** Tear down all stores and timers. */
+    destroy(): void;
+}
+interface ReactiveMapOptions<V> {
+    /** User-specified ID. Auto-generated if omitted. */
+    id?: string;
+    /** Default TTL in milliseconds for all keys. 0 = no expiry (default). */
+    defaultTTL?: number;
+    /** Custom equality function for value deduplication. Default: Object.is */
+    equals?: (a: V, b: V) => boolean;
+    /** Maximum number of keys. When exceeded, oldest keys are evicted (FIFO). */
+    maxSize?: number;
+    /** Eviction policy. Default: fifo(). Only used when maxSize > 0. */
+    eviction?: EvictionPolicy<string>;
+}
+interface LogEntry<V> {
+    /** Monotonically increasing sequence number (1-based). */
+    seq: number;
+    value: V;
+}
+type LogEventType = "append" | "clear";
+interface LogEvent<V> {
+    type: LogEventType;
+    seq?: number;
+    value?: V;
+}
+interface ReactiveLog<V> extends NodeV0 {
+    /** Append a value. Returns the assigned sequence number. */
+    append(value: V): number;
+    /** Batch append. Returns sequence numbers. */
+    appendMany(values: V[]): number[];
+    /** Point read by sequence number — O(1). */
+    get(seq: number): LogEntry<V> | undefined;
+    /** Range read by sequence number (inclusive). */
+    slice(from?: number, to?: number): LogEntry<V>[];
+    /** Snapshot of all entries. */
+    toArray(): LogEntry<V>[];
+    /** Current number of entries. */
+    readonly length: number;
+    /** Sequence number of the oldest entry still in the log. 0 if empty. */
+    readonly headSeq: number;
+    /** Sequence number of the newest entry. 0 if empty. */
+    readonly tailSeq: number;
+    /** Reactive count of entries. */
+    lengthStore: Store<number>;
+    /** Reactive store of the most recent entry. */
+    latest: Store<LogEntry<V> | undefined>;
+    /** Reactive store of the last N entries (default: all). */
+    tail(n?: number): Store<LogEntry<V>[]>;
+    /** Event notification store. Zero cost if unsubscribed. */
+    events: Store<LogEvent<V> | undefined>;
+    /** Return a JSON-serializable snapshot of the log. */
+    snapshot(): LogSnapshot<V>;
+    /** Remove all entries. */
+    clear(): void;
+    /** Tear down all stores. */
+    destroy(): void;
+}
+interface ReactiveLogOptions {
+    /** User-specified ID. Auto-generated if omitted. */
+    id?: string;
+    /** Maximum number of entries. 0 = unlimited (default). Oldest trimmed on overflow. */
+    maxSize?: number;
+}
+/** An index entry mapping an index key to a set of primary keys. */
+interface ReactiveIndex extends NodeV0 {
+    /** Get all primary keys matching an index key. */
+    get(indexKey: string): Set<string>;
+    /** Check if an index key has any entries. */
+    has(indexKey: string): boolean;
+    /** Get all index keys. */
+    keys(): string[];
+    /** Current number of distinct index keys. */
+    readonly size: number;
+    /** Reactive store of primary keys for a given index key. Cached per key. */
+    select(indexKey: string): Store<Set<string>>;
+    /** Reactive store of all index keys. */
+    keysStore: Store<string[]>;
+    /** Reactive store of the number of distinct index keys. */
+    sizeStore: Store<number>;
+    /** Add a primary key under one or more index keys. */
+    add(primaryKey: string, indexKeys: string[]): void;
+    /** Remove a primary key from all index keys. */
+    remove(primaryKey: string): void;
+    /** Update a primary key's index keys (remove old, add new). */
+    update(primaryKey: string, indexKeys: string[]): void;
+    /** Clear all entries. */
+    clear(): void;
+    /** Return a JSON-serializable snapshot of the index. */
+    snapshot(): IndexSnapshot;
+    /** Tear down all stores. */
+    destroy(): void;
+}
+interface ReactiveIndexOptions<V> {
+    /** Function that extracts index keys from a value. */
+    keyFn: (value: V, primaryKey: string) => string[];
+}
+interface NodeV0 {
+    /** User-specified or auto-generated unique identifier. */
+    readonly id: string;
+    /** Monotonically increasing version number (bumped on structural changes). */
+    readonly version: number;
+}
+interface MapSnapshot<V> extends NodeV0 {
+    type: "reactiveMap";
+    entries: [string, V][];
+}
+interface LogSnapshot<V> extends NodeV0 {
+    type: "reactiveLog";
+    entries: Array<{
+        seq: number;
+        value: V;
+    }>;
+    headSeq: number;
+    tailSeq: number;
+}
+interface IndexSnapshot extends NodeV0 {
+    type: "reactiveIndex";
+    index: Record<string, string[]>;
+}
+interface PubSub<T = unknown> extends NodeV0 {
+    /** Publish a message to a topic. */
+    publish(topic: string, message: T): void;
+    /** Subscribe to a topic. Returns a read-only reactive store of the latest message. */
+    subscribe(topic: string): Store<T | undefined>;
+    /** Get all topics that have been created. */
+    topics(): string[];
+    /** Return a JSON-serializable snapshot. */
+    snapshot(): PubSubSnapshot<T>;
+    /** Tear down all channel stores. */
+    destroy(): void;
+}
+interface PubSubSnapshot<T> extends NodeV0 {
+    type: "pubsub";
+    channels: Record<string, T | undefined>;
+}
+
+export type { IndexSnapshot as I, KVEvent as K, LogSnapshot as L, MapSnapshot as M, NodeV0 as N, PubSub as P, ReactiveIndex as R, PubSubSnapshot as a, ReactiveLogOptions as b, ReactiveLog as c, ReactiveMapOptions as d, ReactiveMap as e, KVEventType as f, LogEntry as g, LogEvent as h, LogEventType as i, ReactiveIndexOptions as j };