@graphrefly/ts 0.0.0

package/dist/chunk-DJC4CHLQ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/adapters/agentic-memory-storage.ts","../src/adapters/reactive-collection-storage.ts"],"sourcesContent":["import type { DeliveryMeta } from \"../ctx/types.js\";\nimport { assertGraphLocalNode, type Graph, type StateNode } from \"../graph/graph.js\";\nimport type { Node } from \"../node/node.js\";\nimport type { Message } from \"../protocol/messages.js\";\nimport {\n\ttype AgenticMemoryRecord,\n\ttype AgenticMemoryRecordFrame,\n\ttype AgenticMemoryStrictJsonValue,\n\tagenticMemoryRecordCodec,\n\tagenticMemoryRecordFrame,\n\tagenticMemoryRecordFrameCodec,\n\tassertAgenticMemoryRecordFrame,\n} from \"../solutions/index.js\";\nimport type { AppendLogEntry, AppendLogStorageTier, KvStorageTier } from \"../storage/index.js\";\n\nexport const AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT =\n\t\"graphrefly.agenticMemory.records.snapshot\" as const;\nexport const AGENTIC_MEMORY_RECORD_CHANGE_FORMAT =\n\t\"graphrefly.agenticMemory.records.change\" as const;\nexport const AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION = 1 as const;\n\nexport interface AgenticMemoryRecordSnapshotFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n> {\n\treadonly format: typeof AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT;\n\treadonly version: typeof AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION;\n\treadonly changeCursor: number;\n\treadonly records: readonly AgenticMemoryRecordFrame<TJson>[];\n}\n\nexport interface AgenticMemoryRecordChangeFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n> {\n\treadonly format: typeof AGENTIC_MEMORY_RECORD_CHANGE_FORMAT;\n\treadonly version: typeof AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION;\n\treadonly change: {\n\t\treadonly kind: \"replaceAll\";\n\t\treadonly records: readonly AgenticMemoryRecordFrame<TJson>[];\n\t};\n}\n\nexport interface AgenticMemoryRecordsRestoreState<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n> {\n\treadonly records: readonly AgenticMemoryRecord<TJson>[];\n\treadonly source: \"empty\" | \"changes\" | \"snapshot\" | \"snapshot+changes\";\n\treadonly snapshot: { readonly found: boolean; readonly changeCursor: number };\n\treadonly changes: { readonly applied: number; readonly cursor: number };\n}\n\nexport interface LoadAgenticMemoryRecordsStateOptions {\n\treadonly snapshotStore: KvStorageTier<unknown>;\n\treadonly snapshotKey?: string;\n\treadonly storagePrefix?: string;\n\treadonly changeLog?: AppendLogStorageTier<unknown>;\n}\n\nexport interface AgenticMemoryRecordsPersistenceCursor {\n\treadonly kind: \"persistence.cursor\";\n\treadonly changeSeq: number;\n\treadonly snapshotWrites: number;\n\treadonly changeWrites: number;\n}\n\nexport interface AgenticMemoryRecordsPersistenceStatus {\n\treadonly state: \"starting\" | \"ready\" | \"flushing\" | \"errored\" | \"disposed\";\n\treadonly pending: number;\n\treadonly writes: number;\n\treadonly errors: number;\n\treadonly cursor: AgenticMemoryRecordsPersistenceCursor;\n}\n\nexport interface AgenticMemoryRecordsPersistenceError {\n\treadonly phase: \"snapshot\" | \"change\";\n\treadonly message: string;\n\treadonly cursor: AgenticMemoryRecordsPersistenceCursor;\n}\n\nexport interface PersistAgenticMemoryRecordsOptions {\n\treadonly name?: string;\n\treadonly snapshotStore: KvStorageTier<unknown>;\n\treadonly snapshotKey?: string;\n\treadonly storagePrefix?: string;\n\treadonly changeLog?: AppendLogStorageTier<unknown>;\n\treadonly initialChangeCursor?: number;\n\treadonly snapshotOnAttach?: boolean;\n\treadonly snapshotEveryChanges?: number;\n}\n\nexport interface AgenticMemoryRecordsPersistenceHandle {\n\treadonly ready: StateNode<boolean>;\n\treadonly status: StateNode<AgenticMemoryRecordsPersistenceStatus>;\n\treadonly error: StateNode<AgenticMemoryRecordsPersistenceError | null>;\n\treadonly cursor: StateNode<AgenticMemoryRecordsPersistenceCursor>;\n\tflush(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void;\n\tsnapshot(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void;\n\tdispose(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void;\n}\n\nexport interface OpenPersistentAgenticMemoryRecordsOptions<\n\tTJson extends AgenticMemoryStrictJsonValue,\n> extends LoadAgenticMemoryRecordsStateOptions,\n\t\tOmit<\n\t\t\tPersistAgenticMemoryRecordsOptions,\n\t\t\t\"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly AgenticMemoryRecord<TJson>[];\n}\n\nexport interface PersistentAgenticMemoryRecords<TJson extends AgenticMemoryStrictJsonValue> {\n\treadonly records: StateNode<readonly AgenticMemoryRecord<TJson>[]>;\n\treadonly persistence: AgenticMemoryRecordsPersistenceHandle;\n\treadonly loaded: AgenticMemoryRecordsRestoreState<TJson>;\n}\n\ninterface QueueItem {\n\treadonly phase: \"snapshot\" | \"change\" | \"flush\" | \"dispose\";\n\treadonly done?: (status: AgenticMemoryRecordsPersistenceStatus) => void;\n\trun(): void | PromiseLike<void>;\n}\n\nexport function agenticMemoryRecordsSnapshotKey(storagePrefix = \"agentic-memory\"): string {\n\tif (storagePrefix.length === 0) throw new TypeError(\"storagePrefix must be non-empty\");\n\treturn `${storagePrefix}/records.snapshot`;\n}\n\nexport function agenticMemoryRecordSnapshotFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(\n\trecords: readonly AgenticMemoryRecord<TJson>[],\n\topts: { readonly changeCursor?: number } = {},\n): AgenticMemoryRecordSnapshotFrame<TJson> {\n\tconst changeCursor = validateChangeCursor(opts.changeCursor ?? -1);\n\treturn assertAgenticMemoryRecordSnapshotFrame({\n\t\tformat: AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT,\n\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\tchangeCursor,\n\t\trecords: records.map((record) => agenticMemoryRecordFrame(record)),\n\t});\n}\n\nexport function agenticMemoryRecordChangeFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(records: readonly AgenticMemoryRecord<TJson>[]): AgenticMemoryRecordChangeFrame<TJson> {\n\treturn assertAgenticMemoryRecordChangeFrame({\n\t\tformat: AGENTIC_MEMORY_RECORD_CHANGE_FORMAT,\n\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\tchange: {\n\t\t\tkind: \"replaceAll\",\n\t\t\trecords: records.map((record) => agenticMemoryRecordFrame(record)),\n\t\t},\n\t});\n}\n\nexport function assertAgenticMemoryRecordSnapshotFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(value: unknown): AgenticMemoryRecordSnapshotFrame<TJson> {\n\tif (!isPlainRecord(value)) throw new TypeError(\"agentic memory snapshot frame must be an object\");\n\tassertKeys(\n\t\tvalue,\n\t\t[\"changeCursor\", \"format\", \"records\", \"version\"],\n\t\t\"agentic memory snapshot frame\",\n\t);\n\tif (value.format !== AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT) {\n\t\tthrow new TypeError(\"agentic memory snapshot frame: invalid format\");\n\t}\n\tif (value.version !== AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION) {\n\t\tthrow new TypeError(\"agentic memory snapshot frame: invalid version\");\n\t}\n\tconst changeCursor = validateChangeCursor(value.changeCursor);\n\tif (!Array.isArray(value.records)) {\n\t\tthrow new TypeError(\"agentic memory snapshot frame: records must be an array\");\n\t}\n\tconst records = assertDenseRecordFrames<TJson>(\n\t\tvalue.records,\n\t\t\"agentic memory snapshot frame records\",\n\t);\n\treturn Object.freeze({\n\t\tformat: AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT,\n\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\tchangeCursor,\n\t\trecords: Object.freeze(records),\n\t});\n}\n\nexport function assertAgenticMemoryRecordChangeFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(value: unknown): AgenticMemoryRecordChangeFrame<TJson> {\n\tif (!isPlainRecord(value)) throw new TypeError(\"agentic memory change frame must be an object\");\n\tassertKeys(value, [\"change\", \"format\", \"version\"], \"agentic memory change frame\");\n\tif (value.format !== AGENTIC_MEMORY_RECORD_CHANGE_FORMAT) {\n\t\tthrow new TypeError(\"agentic memory change frame: invalid format\");\n\t}\n\tif (value.version !== AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION) {\n\t\tthrow new TypeError(\"agentic memory change frame: invalid version\");\n\t}\n\tif (!isPlainRecord(value.change)) {\n\t\tthrow new TypeError(\"agentic memory change frame: change must be an object\");\n\t}\n\tassertKeys(value.change, [\"kind\", \"records\"], \"agentic memory change frame change\");\n\tif (value.change.kind !== \"replaceAll\") {\n\t\tthrow new TypeError(\"agentic memory change frame: change.kind must be replaceAll\");\n\t}\n\tif (!Array.isArray(value.change.records)) {\n\t\tthrow new TypeError(\"agentic memory change frame: change.records must be an array\");\n\t}\n\tconst records = assertDenseRecordFrames<TJson>(\n\t\tvalue.change.records,\n\t\t\"agentic memory change frame records\",\n\t);\n\treturn Object.freeze({\n\t\tformat: AGENTIC_MEMORY_RECORD_CHANGE_FORMAT,\n\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\tchange: Object.freeze({\n\t\t\tkind: \"replaceAll\",\n\t\t\trecords: Object.freeze(records),\n\t\t}),\n\t});\n}\n\nexport function loadAgenticMemoryRecordsState<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(opts: LoadAgenticMemoryRecordsStateOptions): Promise<AgenticMemoryRecordsRestoreState<TJson>> {\n\tconst storagePrefix = opts.storagePrefix ?? \"agentic-memory\";\n\tconst snapshotKey = opts.snapshotKey ?? agenticMemoryRecordsSnapshotKey(storagePrefix);\n\treturn opts.snapshotStore.get(snapshotKey).then((rawSnapshot) => {\n\t\tlet records: readonly AgenticMemoryRecord<TJson>[] = [];\n\t\tlet source: AgenticMemoryRecordsRestoreState<TJson>[\"source\"] = \"empty\";\n\t\tlet changeCursor = -1;\n\t\tif (rawSnapshot !== undefined) {\n\t\t\tconst snapshot = assertAgenticMemoryRecordSnapshotFrame<TJson>(rawSnapshot);\n\t\t\trecords = snapshot.records.map(recordFromFrame);\n\t\t\tchangeCursor = snapshot.changeCursor;\n\t\t\tsource = \"snapshot\";\n\t\t}\n\t\tif (opts.changeLog === undefined) {\n\t\t\treturn {\n\t\t\t\trecords,\n\t\t\t\tsource,\n\t\t\t\tsnapshot: { found: rawSnapshot !== undefined, changeCursor },\n\t\t\t\tchanges: { applied: 0, cursor: changeCursor },\n\t\t\t};\n\t\t}\n\t\treturn opts.changeLog.read({ after: changeCursor }).then((entries) => {\n\t\t\tlet applied = 0;\n\t\t\tlet cursor = changeCursor;\n\t\t\tfor (const entry of entries) {\n\t\t\t\tif (entry.seq !== cursor + 1) {\n\t\t\t\t\tthrow new Error(\"agentic memory records change log is non-contiguous\");\n\t\t\t\t}\n\t\t\t\tconst change = assertAgenticMemoryRecordChangeFrame<TJson>(entry.value);\n\t\t\t\trecords = change.change.records.map(recordFromFrame);\n\t\t\t\tcursor = entry.seq;\n\t\t\t\tapplied += 1;\n\t\t\t}\n\t\t\treturn {\n\t\t\t\trecords,\n\t\t\t\tsource:\n\t\t\t\t\trawSnapshot !== undefined && applied > 0\n\t\t\t\t\t\t? \"snapshot+changes\"\n\t\t\t\t\t\t: rawSnapshot !== undefined\n\t\t\t\t\t\t\t? \"snapshot\"\n\t\t\t\t\t\t\t: applied > 0\n\t\t\t\t\t\t\t\t? \"changes\"\n\t\t\t\t\t\t\t\t: \"empty\",\n\t\t\t\tsnapshot: { found: rawSnapshot !== undefined, changeCursor },\n\t\t\t\tchanges: { applied, cursor },\n\t\t\t};\n\t\t});\n\t});\n}\n\nexport function persistAgenticMemoryRecords<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(\n\tgraph: Graph,\n\trecords: Node<readonly AgenticMemoryRecord<TJson>[]>,\n\topts: PersistAgenticMemoryRecordsOptions,\n): AgenticMemoryRecordsPersistenceHandle {\n\tconst name = opts.name ?? \"agenticMemoryRecords.persistence\";\n\tconst snapshotKey =\n\t\topts.snapshotKey ?? agenticMemoryRecordsSnapshotKey(opts.storagePrefix ?? name);\n\tconst snapshotEveryChanges = validateSnapshotEveryChanges(opts.snapshotEveryChanges);\n\tassertGraphLocalNode(graph, records as Node<unknown>, `${name}.records`);\n\tlet cursorValue: AgenticMemoryRecordsPersistenceCursor = {\n\t\tkind: \"persistence.cursor\",\n\t\tchangeSeq: validateChangeCursor(opts.initialChangeCursor ?? -1),\n\t\tsnapshotWrites: 0,\n\t\tchangeWrites: 0,\n\t};\n\tlet statusValue = statusOf(\"starting\", 0, 0, 0, cursorValue);\n\tlet errorCount = 0;\n\tlet writes = 0;\n\tlet running = false;\n\tlet disposed = false;\n\tlet disposeRequested = false;\n\tlet subscribing = true;\n\tlet observedChangesSinceSnapshot = 0;\n\tlet latestRecords: readonly AgenticMemoryRecord<TJson>[] = records.cache ?? [];\n\tlet stop: (() => void) | undefined;\n\tconst queue: QueueItem[] = [];\n\tconst ready = graph.state(false, { name: `${name}/ready` });\n\tconst status = graph.state<AgenticMemoryRecordsPersistenceStatus>(statusValue, {\n\t\tname: `${name}/status`,\n\t});\n\tconst error = graph.state<AgenticMemoryRecordsPersistenceError | null>(null, {\n\t\tname: `${name}/error`,\n\t});\n\tconst cursor = graph.state<AgenticMemoryRecordsPersistenceCursor>(cursorValue, {\n\t\tname: `${name}/cursor`,\n\t});\n\n\tfunction publish(state: AgenticMemoryRecordsPersistenceStatus[\"state\"]): void {\n\t\tconst nextState = statusValue.state === \"errored\" && state !== \"disposed\" ? \"errored\" : state;\n\t\tstatusValue = statusOf(\n\t\t\tnextState,\n\t\t\tqueue.length + (running ? 1 : 0),\n\t\t\twrites,\n\t\t\terrorCount,\n\t\t\tcursorValue,\n\t\t);\n\t\tcursor.set(cursorValue);\n\t\tstatus.set(statusValue);\n\t\tif (nextState === \"ready\") ready.set(true);\n\t\tif (nextState === \"errored\" || nextState === \"disposed\") ready.set(false);\n\t}\n\n\tfunction report(phase: \"snapshot\" | \"change\", caught: unknown): void {\n\t\terrorCount += 1;\n\t\terror.set({ phase, message: errorMessage(caught), cursor: cursorValue });\n\t}\n\n\tfunction callDone(done: QueueItem[\"done\"]): void {\n\t\ttry {\n\t\t\tdone?.(statusValue);\n\t\t} catch {\n\t\t\t// Done callbacks are advisory controls and must not wedge the adapter queue.\n\t\t}\n\t}\n\n\tfunction finish(item: QueueItem): void {\n\t\tif (item.phase === \"dispose\") {\n\t\t\tdisposed = true;\n\t\t\trunning = false;\n\t\t\tpublish(\"disposed\");\n\t\t} else if (statusValue.state !== \"errored\") {\n\t\t\trunning = false;\n\t\t\tpublish(\"ready\");\n\t\t} else {\n\t\t\trunning = false;\n\t\t\tpublish(\"errored\");\n\t\t}\n\t\tcallDone(item.done);\n\t\tdrain();\n\t}\n\n\tfunction fail(item: QueueItem, caught: unknown): void {\n\t\tif (item.phase === \"snapshot\" || item.phase === \"change\") report(item.phase, caught);\n\t\trunning = false;\n\t\tif (item.phase === \"snapshot\" || item.phase === \"change\") publish(\"errored\");\n\t\tcallDone(item.done);\n\t\tdrain();\n\t}\n\n\tfunction chainThenable(item: QueueItem, value: unknown): boolean {\n\t\tif ((typeof value !== \"object\" && typeof value !== \"function\") || value === null) return false;\n\t\tconst then = (value as { then?: unknown }).then;\n\t\tif (typeof then !== \"function\") return false;\n\t\tlet settled = false;\n\t\tconst settle = (next: () => void) => {\n\t\t\tif (settled) return;\n\t\t\tsettled = true;\n\t\t\tnext();\n\t\t};\n\t\ttry {\n\t\t\t(then as (onFulfilled: () => void, onRejected: (error: unknown) => void) => unknown).call(\n\t\t\t\tvalue,\n\t\t\t\t() => settle(() => finish(item)),\n\t\t\t\t(caught) => settle(() => fail(item, caught)),\n\t\t\t);\n\t\t} catch (caught) {\n\t\t\tsettle(() => fail(item, caught));\n\t\t}\n\t\treturn true;\n\t}\n\n\tfunction enqueue(item: QueueItem): void {\n\t\tif (disposed || (disposeRequested && item.phase !== \"dispose\" && item.phase !== \"flush\")) {\n\t\t\tcallDone(item.done);\n\t\t\treturn;\n\t\t}\n\t\tqueue.push(item);\n\t\tdrain();\n\t}\n\n\tfunction drain(): void {\n\t\tif (running) return;\n\t\tconst item = queue.shift();\n\t\tif (item === undefined) return;\n\t\trunning = true;\n\t\tpublish(\n\t\t\titem.phase === \"flush\" ? \"flushing\" : statusValue.state === \"starting\" ? \"starting\" : \"ready\",\n\t\t);\n\t\tlet result: void | PromiseLike<void>;\n\t\ttry {\n\t\t\tresult = item.run();\n\t\t} catch (caught) {\n\t\t\tfail(item, caught);\n\t\t\treturn;\n\t\t}\n\t\tif (chainThenable(item, result)) return;\n\t\tfinish(item);\n\t}\n\n\tfunction enqueueSnapshot(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void {\n\t\tconst snapshotRecords = latestRecords;\n\t\tobservedChangesSinceSnapshot = 0;\n\t\tenqueue({\n\t\t\tphase: \"snapshot\",\n\t\t\tdone,\n\t\t\trun() {\n\t\t\t\tconst records = Object.freeze(\n\t\t\t\t\tsnapshotRecords.map((record) => agenticMemoryRecordFrame(record)),\n\t\t\t\t);\n\t\t\t\tconst frame = assertAgenticMemoryRecordSnapshotFrame<TJson>({\n\t\t\t\t\tformat: AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT,\n\t\t\t\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\t\t\t\tchangeCursor: cursorValue.changeSeq,\n\t\t\t\t\trecords,\n\t\t\t\t});\n\t\t\t\treturn opts.snapshotStore.set(snapshotKey, frame).then(() => {\n\t\t\t\t\tcursorValue = { ...cursorValue, snapshotWrites: cursorValue.snapshotWrites + 1 };\n\t\t\t\t\twrites += 1;\n\t\t\t\t\tpublish(\"ready\");\n\t\t\t\t});\n\t\t\t},\n\t\t});\n\t}\n\n\tfunction enqueueChange(nextRecords: readonly AgenticMemoryRecord<TJson>[]): void {\n\t\tconst changeLog = opts.changeLog;\n\t\tif (changeLog === undefined) return;\n\t\tenqueue({\n\t\t\tphase: \"change\",\n\t\t\trun() {\n\t\t\t\tconst frame = agenticMemoryRecordChangeFrame(nextRecords);\n\t\t\t\treturn changeLog.append(frame).then((written) => {\n\t\t\t\t\tconst entry = written as AppendLogEntry<AgenticMemoryRecordChangeFrame<TJson>>;\n\t\t\t\t\tcursorValue = {\n\t\t\t\t\t\t...cursorValue,\n\t\t\t\t\t\tchangeSeq: entry.seq,\n\t\t\t\t\t\tchangeWrites: cursorValue.changeWrites + 1,\n\t\t\t\t\t};\n\t\t\t\t\twrites += 1;\n\t\t\t\t\tpublish(\"ready\");\n\t\t\t\t});\n\t\t\t},\n\t\t});\n\t}\n\n\tfunction cancelQueuedForDispose(): void {\n\t\tconst pending = queue.splice(0);\n\t\tfor (const item of pending) callDone(item.done);\n\t}\n\n\tstop = records.subscribe((msg: Message, delivery?: DeliveryMeta) => {\n\t\tif (disposeRequested) return;\n\t\tconst nextRecords = dataOf<readonly AgenticMemoryRecord<TJson>[]>(msg);\n\t\tif (nextRecords === undefined) return;\n\t\tlatestRecords = nextRecords;\n\t\tif (subscribing && delivery === undefined) return;\n\t\tobservedChangesSinceSnapshot += 1;\n\t\tenqueueChange(nextRecords);\n\t\tif (\n\t\t\tsnapshotEveryChanges !== undefined &&\n\t\t\tobservedChangesSinceSnapshot >= snapshotEveryChanges\n\t\t) {\n\t\t\tenqueueSnapshot();\n\t\t}\n\t});\n\tsubscribing = false;\n\tif (opts.snapshotOnAttach !== false) enqueueSnapshot();\n\telse publish(\"ready\");\n\n\treturn {\n\t\tready,\n\t\tstatus,\n\t\terror,\n\t\tcursor,\n\t\tflush(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void {\n\t\t\tif (disposed) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tenqueue({ phase: \"flush\", done, run: () => undefined });\n\t\t},\n\t\tsnapshot(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void {\n\t\t\tif (disposed || disposeRequested) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tenqueueSnapshot(done);\n\t\t},\n\t\tdispose(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void {\n\t\t\tif (disposed) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tdisposeRequested = true;\n\t\t\tstop?.();\n\t\t\tcancelQueuedForDispose();\n\t\t\tenqueue({ phase: \"dispose\", done, run: () => undefined });\n\t\t},\n\t};\n}\n\nexport function openPersistentAgenticMemoryRecords<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(\n\topts: OpenPersistentAgenticMemoryRecordsOptions<TJson>,\n): Promise<PersistentAgenticMemoryRecords<TJson>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"agentic-memory\";\n\tconst snapshotKey = opts.snapshotKey ?? agenticMemoryRecordsSnapshotKey(storagePrefix);\n\treturn loadAgenticMemoryRecordsState<TJson>({ ...opts, snapshotKey, storagePrefix }).then(\n\t\t(loaded) => {\n\t\t\tconst records =\n\t\t\t\tloaded.source === \"empty\" && opts.initial !== undefined ? opts.initial : loaded.records;\n\t\t\tconst node = opts.graph.state<readonly AgenticMemoryRecord<TJson>[]>(records, {\n\t\t\t\tname: opts.name,\n\t\t\t});\n\t\t\tconst persistence = persistAgenticMemoryRecords(opts.graph, node, {\n\t\t\t\t...opts,\n\t\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\t\tsnapshotKey,\n\t\t\t\tstoragePrefix,\n\t\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t\t});\n\t\t\treturn { records: node, persistence, loaded };\n\t\t},\n\t);\n}\n\nfunction recordFromFrame<TJson extends AgenticMemoryStrictJsonValue>(\n\tframe: AgenticMemoryRecordFrame<TJson>,\n): AgenticMemoryRecord<TJson> {\n\treturn agenticMemoryRecordCodec<TJson>().decode(\n\t\tagenticMemoryRecordFrameCodec<TJson>().encode(frame),\n\t);\n}\n\nfunction statusOf(\n\tstate: AgenticMemoryRecordsPersistenceStatus[\"state\"],\n\tpending: number,\n\twrites: number,\n\terrors: number,\n\tcursor: AgenticMemoryRecordsPersistenceCursor,\n): AgenticMemoryRecordsPersistenceStatus {\n\treturn { state, pending, writes, errors, cursor };\n}\n\nfunction dataOf<C>(msg: Message): C | undefined {\n\treturn msg[0] === \"DATA\" ? (msg[1] as C) : undefined;\n}\n\nfunction validateChangeCursor(value: unknown): number {\n\tif (typeof value !== \"number\" || !Number.isSafeInteger(value) || value < -1) {\n\t\tthrow new RangeError(\"changeCursor must be a safe integer >= -1\");\n\t}\n\treturn value;\n}\n\nfunction validateSnapshotEveryChanges(value: number | undefined): number | undefined {\n\tif (value === undefined) return undefined;\n\tif (!Number.isSafeInteger(value) || value < 1) {\n\t\tthrow new RangeError(\"snapshotEveryChanges must be a positive safe integer\");\n\t}\n\treturn value;\n}\n\nfunction isPlainRecord(value: unknown): value is Record<string, unknown> {\n\treturn value !== null && typeof value === \"object\" && !Array.isArray(value);\n}\n\nfunction assertKeys(\n\tvalue: Record<string, unknown>,\n\texpected: readonly string[],\n\tlabel: string,\n): void {\n\tconst actual = Object.keys(value).sort();\n\tconst want = [...expected].sort();\n\tif (actual.length !== want.length || actual.some((key, i) => key !== want[i])) {\n\t\tthrow new TypeError(`${label}: unexpected frame fields ${actual.join(\",\")}`);\n\t}\n}\n\nfunction assertDenseRecordFrames<TJson extends AgenticMemoryStrictJsonValue>(\n\tvalue: readonly unknown[],\n\tlabel: string,\n): readonly AgenticMemoryRecordFrame<TJson>[] {\n\tconst records: AgenticMemoryRecordFrame<TJson>[] = [];\n\tfor (let i = 0; i < value.length; i += 1) {\n\t\tif (!Object.hasOwn(value, i)) {\n\t\t\tthrow new TypeError(`${label}: sparse array hole at ${i}`);\n\t\t}\n\t\trecords.push(assertAgenticMemoryRecordFrame<TJson>(value[i]));\n\t}\n\treturn Object.freeze(records);\n}\n\nfunction errorMessage(error: unknown): string {\n\treturn error instanceof Error ? error.message : String(error);\n}\n","import type { DeliveryMeta } from \"../ctx/types.js\";\nimport {\n\ttype ReactiveIndex,\n\ttype ReactiveIndexOptions,\n\ttype ReactiveList,\n\ttype ReactiveListOptions,\n\ttype ReactiveLog,\n\ttype ReactiveLogOptions,\n\ttype ReactiveMap,\n\ttype ReactiveMapOptions,\n\trestoreReactiveIndex,\n\trestoreReactiveList,\n\trestoreReactiveLog,\n\trestoreReactiveMap,\n} from \"../data-structures/index.js\";\nimport type {\n\tIndexChange,\n\tListChange,\n\tLogChange,\n\tMapChange,\n} from \"../graph/data-structures/change.js\";\nimport type { IndexRow } from \"../graph/data-structures/reactive-index.js\";\nimport { assertGraphLocalNode, type Graph, type StateNode } from \"../graph/graph.js\";\nimport type { Node } from \"../node/node.js\";\nimport type { Message } from \"../protocol/messages.js\";\nimport type {\n\tAppendLogEntry,\n\tAppendLogStorageTier,\n\tKvStorageTier,\n\tLoadReactiveCollectionStateOptions,\n\tReactiveCollectionChangeFrame,\n\tReactiveCollectionSnapshotFrame,\n\tReactiveIndexRestoreState,\n\tReactiveListRestoreState,\n\tReactiveLogRestoreState,\n\tReactiveMapRestoreState,\n} from \"../storage/index.js\";\nimport {\n\tassertReactiveCollectionChangeFrame,\n\tassertReactiveCollectionSnapshotFrame,\n\tcollectionSnapshotKey,\n\tloadReactiveIndexState,\n\tloadReactiveListState,\n\tloadReactiveLogState,\n\tloadReactiveMapState,\n\treactiveCollectionChangeFrame,\n\treactiveCollectionSnapshotFrame,\n} from \"../storage/index.js\";\n\ntype PersistableKind = \"reactiveList\" | \"reactiveLog\" | \"reactiveMap\" | \"reactiveIndex\";\ntype PersistableChange<T, K extends PersistableKind> = K extends \"reactiveList\"\n\t? ListChange<T>\n\t: K extends \"reactiveLog\"\n\t\t? LogChange<T>\n\t\t: K extends \"reactiveMap\"\n\t\t\t? MapChange<unknown, T>\n\t\t\t: IndexChange<unknown, T>;\ntype PersistableCollection<T, K extends PersistableKind> = K extends \"reactiveList\"\n\t? ReactiveList<T>\n\t: K extends \"reactiveLog\"\n\t\t? ReactiveLog<T>\n\t\t: K extends \"reactiveMap\"\n\t\t\t? ReactiveMap<unknown, T>\n\t\t\t: ReactiveIndex<unknown, T>;\n\n/** D161 adapter write-progress cursor; this is not a domain replay or wire-bridge cursor. */\nexport interface ReactiveCollectionPersistenceCursor {\n\treadonly kind: \"persistence.cursor\";\n\treadonly collection: PersistableKind;\n\treadonly changeSeq: number;\n\treadonly snapshotWrites: number;\n\treadonly changeWrites: number;\n}\n\n/** D161 graph-visible persistence sidecar status fact. */\nexport interface ReactiveCollectionPersistenceStatus {\n\treadonly state: \"starting\" | \"ready\" | \"flushing\" | \"errored\" | \"disposed\";\n\treadonly pending: number;\n\treadonly writes: number;\n\treadonly errors: number;\n\treadonly cursor: ReactiveCollectionPersistenceCursor;\n}\n\n/** D161 graph-visible persistence sidecar error fact. */\nexport interface ReactiveCollectionPersistenceError {\n\treadonly phase: \"snapshot\" | \"change\";\n\treadonly message: string;\n\treadonly cursor: ReactiveCollectionPersistenceCursor;\n}\n\n/** Options for the D161 graph-bound persistence sidecar over a reactive collection. */\nexport interface PersistReactiveCollectionOptions<K extends PersistableKind = PersistableKind> {\n\treadonly kind: K;\n\treadonly name?: string;\n\treadonly snapshotStore: KvStorageTier<unknown>;\n\treadonly snapshotKey?: string;\n\treadonly storagePrefix?: string;\n\treadonly changeLog?: AppendLogStorageTier<unknown>;\n\t/** Adapter write cursor seed for wrappers that already folded a change log. */\n\treadonly initialChangeCursor?: number;\n\t/** Default true: write one durable baseline when the adapter attaches. */\n\treadonly snapshotOnAttach?: boolean;\n\t/** Optional snapshot cadence. Manual snapshots remain available via handle.snapshot(). */\n\treadonly snapshotEveryChanges?: number;\n}\n\n/** D161 sidecar controls; flush waits for queued storage promises to settle, not fsync. */\nexport interface ReactiveCollectionPersistenceHandle {\n\treadonly ready: StateNode<boolean>;\n\treadonly status: StateNode<ReactiveCollectionPersistenceStatus>;\n\treadonly error: StateNode<ReactiveCollectionPersistenceError | null>;\n\treadonly cursor: StateNode<ReactiveCollectionPersistenceCursor>;\n\tflush(done?: (status: ReactiveCollectionPersistenceStatus) => void): void;\n\tsnapshot(done?: (status: ReactiveCollectionPersistenceStatus) => void): void;\n\tdispose(done?: (status: ReactiveCollectionPersistenceStatus) => void): void;\n}\n\ninterface QueueItem {\n\treadonly phase: \"snapshot\" | \"change\" | \"flush\" | \"dispose\";\n\treadonly done?: (status: ReactiveCollectionPersistenceStatus) => void;\n\trun(): void | PromiseLike<void>;\n}\n\nfunction emptyCursor(collection: PersistableKind): ReactiveCollectionPersistenceCursor {\n\treturn {\n\t\tkind: \"persistence.cursor\",\n\t\tcollection,\n\t\tchangeSeq: -1,\n\t\tsnapshotWrites: 0,\n\t\tchangeWrites: 0,\n\t};\n}\n\nfunction errorMessage(error: unknown): string {\n\treturn error instanceof Error ? error.message : String(error);\n}\n\nfunction validateSnapshotEveryChanges(value: number | undefined): number | undefined {\n\tif (value === undefined) return undefined;\n\tif (!Number.isSafeInteger(value) || value < 1) {\n\t\tthrow new RangeError(\"snapshotEveryChanges must be a positive safe integer\");\n\t}\n\treturn value;\n}\n\nfunction validateInitialChangeCursor(value: number | undefined): number {\n\tif (value === undefined) return -1;\n\tif (!Number.isSafeInteger(value) || value < -1) {\n\t\tthrow new RangeError(\"initialChangeCursor must be a safe integer >= -1\");\n\t}\n\treturn value;\n}\n\nfunction statusOf(\n\tstate: ReactiveCollectionPersistenceStatus[\"state\"],\n\tpending: number,\n\twrites: number,\n\terrors: number,\n\tcursor: ReactiveCollectionPersistenceCursor,\n): ReactiveCollectionPersistenceStatus {\n\treturn { state, pending, writes, errors, cursor };\n}\n\nfunction dataOf<C>(msg: Message): C | undefined {\n\treturn msg[0] === \"DATA\" ? (msg[1] as C) : undefined;\n}\n\n/**\n * D161 graph-bound sidecar over an existing collection. It writes passive storage frames and\n * exposes adapter progress as graph-visible DATA facts; it never restores or mutates the collection.\n */\nexport function persistReactiveCollection<T, K extends PersistableKind>(\n\tgraph: Graph,\n\tcollection: PersistableCollection<T, K>,\n\topts: PersistReactiveCollectionOptions<K>,\n): ReactiveCollectionPersistenceHandle {\n\tconst kind = opts.kind;\n\tconst name = opts.name ?? `${kind}.persistence`;\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(opts.storagePrefix ?? name);\n\tconst snapshotEveryChanges = validateSnapshotEveryChanges(opts.snapshotEveryChanges);\n\tassertGraphLocalNode(graph, collection.delta as Node<unknown>, `${name}.collection.delta`);\n\tassertGraphLocalNode(graph, collection.snapshot as Node<unknown>, `${name}.collection.snapshot`);\n\n\tlet cursorValue = {\n\t\t...emptyCursor(kind),\n\t\tchangeSeq: validateInitialChangeCursor(opts.initialChangeCursor),\n\t};\n\tlet statusValue = statusOf(\"starting\", 0, 0, 0, cursorValue);\n\tlet errorCount = 0;\n\tlet writes = 0;\n\tlet observedChangesSinceSnapshot = 0;\n\tlet running = false;\n\tlet disposed = false;\n\tlet disposeRequested = false;\n\tlet subscribing = true;\n\tlet stop: (() => void) | undefined;\n\tconst queue: QueueItem[] = [];\n\n\tconst ready = graph.state(false, { name: `${name}/ready` });\n\tconst status = graph.state<ReactiveCollectionPersistenceStatus>(statusValue, {\n\t\tname: `${name}/status`,\n\t});\n\tconst error = graph.state<ReactiveCollectionPersistenceError | null>(null, {\n\t\tname: `${name}/error`,\n\t});\n\tconst cursor = graph.state<ReactiveCollectionPersistenceCursor>(cursorValue, {\n\t\tname: `${name}/cursor`,\n\t});\n\n\tfunction publish(state: ReactiveCollectionPersistenceStatus[\"state\"]): void {\n\t\tconst nextState = statusValue.state === \"errored\" && state !== \"disposed\" ? \"errored\" : state;\n\t\tstatusValue = statusOf(\n\t\t\tnextState,\n\t\t\tqueue.length + (running ? 1 : 0),\n\t\t\twrites,\n\t\t\terrorCount,\n\t\t\tcursorValue,\n\t\t);\n\t\tcursor.set(cursorValue);\n\t\tstatus.set(statusValue);\n\t\tif (nextState === \"ready\") ready.set(true);\n\t\tif (nextState === \"errored\" || nextState === \"disposed\") ready.set(false);\n\t}\n\n\tfunction report(phase: \"snapshot\" | \"change\", caught: unknown): void {\n\t\terrorCount += 1;\n\t\tconst fact = { phase, message: errorMessage(caught), cursor: cursorValue };\n\t\terror.set(fact);\n\t}\n\n\tfunction callDone(done: QueueItem[\"done\"]): void {\n\t\ttry {\n\t\t\tdone?.(statusValue);\n\t\t} catch {\n\t\t\t// Done callbacks are advisory barriers; user code must not wedge the adapter queue.\n\t\t}\n\t}\n\n\tfunction finish(item: QueueItem): void {\n\t\tif (item.phase === \"dispose\") {\n\t\t\tdisposed = true;\n\t\t\trunning = false;\n\t\t\tpublish(\"disposed\");\n\t\t} else if (statusValue.state !== \"errored\") {\n\t\t\trunning = false;\n\t\t\tpublish(\"ready\");\n\t\t} else {\n\t\t\trunning = false;\n\t\t\tpublish(\"errored\");\n\t\t}\n\t\tcallDone(item.done);\n\t\tdrain();\n\t}\n\n\tfunction fail(item: QueueItem, caught: unknown): void {\n\t\tif (item.phase === \"snapshot\" || item.phase === \"change\") report(item.phase, caught);\n\t\trunning = false;\n\t\tif (item.phase === \"snapshot\" || item.phase === \"change\") publish(\"errored\");\n\t\tcallDone(item.done);\n\t\tdrain();\n\t}\n\n\tfunction chainThenable(item: QueueItem, value: unknown): boolean {\n\t\tif ((typeof value !== \"object\" && typeof value !== \"function\") || value === null) return false;\n\t\tlet then: unknown;\n\t\ttry {\n\t\t\tthen = (value as { then?: unknown }).then;\n\t\t} catch (caught) {\n\t\t\tfail(item, caught);\n\t\t\treturn true;\n\t\t}\n\t\tif (typeof then !== \"function\") return false;\n\t\tlet settled = false;\n\t\tconst settle = (next: () => void) => {\n\t\t\tif (settled) return;\n\t\t\tsettled = true;\n\t\t\tnext();\n\t\t};\n\t\ttry {\n\t\t\t(then as (onFulfilled: () => void, onRejected: (error: unknown) => void) => unknown).call(\n\t\t\t\tvalue,\n\t\t\t\t() => settle(() => finish(item)),\n\t\t\t\t(caught) => settle(() => fail(item, caught)),\n\t\t\t);\n\t\t} catch (caught) {\n\t\t\tsettle(() => fail(item, caught));\n\t\t}\n\t\treturn true;\n\t}\n\n\tfunction enqueue(item: QueueItem): void {\n\t\tif (disposed || (disposeRequested && item.phase !== \"dispose\" && item.phase !== \"flush\")) {\n\t\t\tcallDone(item.done);\n\t\t\treturn;\n\t\t}\n\t\tqueue.push(item);\n\t\tdrain();\n\t}\n\n\tfunction drain(): void {\n\t\tif (running) return;\n\t\tconst item = queue.shift();\n\t\tif (item === undefined) return;\n\t\trunning = true;\n\t\tpublish(\n\t\t\titem.phase === \"flush\" ? \"flushing\" : statusValue.state === \"starting\" ? \"starting\" : \"ready\",\n\t\t);\n\t\tlet result: void | PromiseLike<void>;\n\t\ttry {\n\t\t\tresult = item.run();\n\t\t} catch (caught) {\n\t\t\tfail(item, caught);\n\t\t\treturn;\n\t\t}\n\t\tif (chainThenable(item, result)) return;\n\t\tfinish(item);\n\t}\n\n\tfunction enqueueSnapshot(done?: (status: ReactiveCollectionPersistenceStatus) => void): void {\n\t\tconst snapshot = collectionSnapshot(collection, kind);\n\t\tobservedChangesSinceSnapshot = 0;\n\t\tenqueue({\n\t\t\tphase: \"snapshot\",\n\t\t\tdone,\n\t\t\trun() {\n\t\t\t\tconst frame: ReactiveCollectionSnapshotFrame<K, readonly unknown[]> =\n\t\t\t\t\treactiveCollectionSnapshotFrame(kind, snapshot, {\n\t\t\t\t\t\tchangeCursor: cursorValue.changeSeq,\n\t\t\t\t\t});\n\t\t\t\tassertReactiveCollectionSnapshotFrame(frame, kind);\n\t\t\t\treturn opts.snapshotStore.set(snapshotKey, frame).then(() => {\n\t\t\t\t\tcursorValue = {\n\t\t\t\t\t\t...cursorValue,\n\t\t\t\t\t\tsnapshotWrites: cursorValue.snapshotWrites + 1,\n\t\t\t\t\t};\n\t\t\t\t\twrites += 1;\n\t\t\t\t\tpublish(\"ready\");\n\t\t\t\t});\n\t\t\t},\n\t\t});\n\t}\n\n\tfunction enqueueChange(change: PersistableChange<T, K>): void {\n\t\tconst changeLog = opts.changeLog;\n\t\tif (changeLog === undefined) return;\n\t\tenqueue({\n\t\t\tphase: \"change\",\n\t\t\trun() {\n\t\t\t\tconst frame: ReactiveCollectionChangeFrame<\n\t\t\t\t\tPersistableKind,\n\t\t\t\t\tPersistableChange<T, K>\n\t\t\t\t> = reactiveCollectionChangeFrame(kind, change);\n\t\t\t\tassertReactiveCollectionChangeFrame(frame, kind);\n\t\t\t\treturn changeLog.append(frame).then((written) => {\n\t\t\t\t\tconst entry = written as AppendLogEntry<\n\t\t\t\t\t\tReactiveCollectionChangeFrame<PersistableKind, PersistableChange<T, K>>\n\t\t\t\t\t>;\n\t\t\t\t\tcursorValue = {\n\t\t\t\t\t\t...cursorValue,\n\t\t\t\t\t\tchangeSeq: entry.seq,\n\t\t\t\t\t\tchangeWrites: cursorValue.changeWrites + 1,\n\t\t\t\t\t};\n\t\t\t\t\twrites += 1;\n\t\t\t\t\tpublish(\"ready\");\n\t\t\t\t});\n\t\t\t},\n\t\t});\n\t}\n\n\tfunction cancelQueuedForDispose(): void {\n\t\tconst pending = queue.splice(0);\n\t\tfor (const item of pending) callDone(item.done);\n\t}\n\n\tstop = (collection.delta as Node<PersistableChange<T, K>>).subscribe(\n\t\t(msg: Message, delivery?: DeliveryMeta) => {\n\t\t\tif (disposeRequested) return;\n\t\t\tconst change = dataOf<PersistableChange<T, K>>(msg);\n\t\t\tif (change === undefined) return;\n\t\t\tif (subscribing && delivery === undefined) return;\n\t\t\tobservedChangesSinceSnapshot += 1;\n\t\t\tenqueueChange(change);\n\t\t\tif (\n\t\t\t\tsnapshotEveryChanges !== undefined &&\n\t\t\t\tobservedChangesSinceSnapshot >= snapshotEveryChanges\n\t\t\t) {\n\t\t\t\tenqueueSnapshot();\n\t\t\t}\n\t\t},\n\t);\n\tsubscribing = false;\n\n\tif (opts.snapshotOnAttach !== false) enqueueSnapshot();\n\telse publish(\"ready\");\n\n\treturn {\n\t\tready,\n\t\tstatus,\n\t\terror,\n\t\tcursor,\n\t\tflush(done?: (status: ReactiveCollectionPersistenceStatus) => void): void {\n\t\t\tif (disposed) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tenqueue({ phase: \"flush\", done, run: () => undefined });\n\t\t},\n\t\tsnapshot(done?: (status: ReactiveCollectionPersistenceStatus) => void): void {\n\t\t\tif (disposed || disposeRequested) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tenqueueSnapshot(done);\n\t\t},\n\t\tdispose(done?: (status: ReactiveCollectionPersistenceStatus) => void): void {\n\t\t\tif (disposed) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tdisposeRequested = true;\n\t\t\tstop?.();\n\t\t\tcancelQueuedForDispose();\n\t\t\tenqueue({ phase: \"dispose\", done, run: () => undefined });\n\t\t},\n\t};\n}\n\nfunction collectionSnapshot<T, K extends PersistableKind>(\n\tcollection: PersistableCollection<T, K>,\n\tkind: K,\n): readonly unknown[] {\n\tif (kind === \"reactiveMap\") {\n\t\treturn [...(collection as ReactiveMap<unknown, unknown>).toMap()];\n\t}\n\tif (kind === \"reactiveIndex\") {\n\t\treturn (collection as ReactiveIndex<unknown, unknown>).toArray();\n\t}\n\treturn (collection as ReactiveList<T> | ReactiveLog<T>).toArray();\n}\n\ntype CollectionOptionsWithoutGraphName<T> = Omit<T, \"graph\" | \"name\">;\n\n/** Options for D161 load -> restore -> persist composition for reactiveList. */\nexport interface OpenPersistentReactiveListOptions<T>\n\textends LoadReactiveCollectionStateOptions,\n\t\tOmit<\n\t\t\tPersistReactiveCollectionOptions<\"reactiveList\">,\n\t\t\t\"kind\" | \"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly T[];\n\treadonly collection?: CollectionOptionsWithoutGraphName<ReactiveListOptions>;\n}\n\n/** Options for D161 load -> restore -> persist composition for reactiveLog. */\nexport interface OpenPersistentReactiveLogOptions<T>\n\textends LoadReactiveCollectionStateOptions,\n\t\tOmit<\n\t\t\tPersistReactiveCollectionOptions<\"reactiveLog\">,\n\t\t\t\"kind\" | \"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly T[];\n\treadonly collection?: CollectionOptionsWithoutGraphName<ReactiveLogOptions>;\n}\n\n/** Options for D161 load -> restore -> persist composition for reactiveMap. */\nexport interface OpenPersistentReactiveMapOptions<K, V>\n\textends LoadReactiveCollectionStateOptions,\n\t\tOmit<\n\t\t\tPersistReactiveCollectionOptions<\"reactiveMap\">,\n\t\t\t\"kind\" | \"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly (readonly [K, V])[];\n\treadonly collection?: CollectionOptionsWithoutGraphName<ReactiveMapOptions<K, V>>;\n}\n\n/** Options for D161 load -> restore -> persist composition for reactiveIndex. */\nexport interface OpenPersistentReactiveIndexOptions<K, V>\n\textends LoadReactiveCollectionStateOptions,\n\t\tOmit<\n\t\t\tPersistReactiveCollectionOptions<\"reactiveIndex\">,\n\t\t\t\"kind\" | \"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly IndexRow<K, V>[];\n\treadonly collection?: CollectionOptionsWithoutGraphName<ReactiveIndexOptions>;\n}\n\n/** Return value for D161 persistent reactiveList composition. */\nexport interface PersistentReactiveList<T> {\n\treadonly collection: ReactiveList<T>;\n\treadonly persistence: ReactiveCollectionPersistenceHandle;\n\treadonly loaded: ReactiveListRestoreState<T>;\n}\n\n/** Return value for D161 persistent reactiveLog composition. */\nexport interface PersistentReactiveLog<T> {\n\treadonly collection: ReactiveLog<T>;\n\treadonly persistence: ReactiveCollectionPersistenceHandle;\n\treadonly loaded: ReactiveLogRestoreState<T>;\n}\n\n/** Return value for D161 persistent reactiveMap composition. */\nexport interface PersistentReactiveMap<K, V> {\n\treadonly collection: ReactiveMap<K, V>;\n\treadonly persistence: ReactiveCollectionPersistenceHandle;\n\treadonly loaded: ReactiveMapRestoreState<K, V>;\n}\n\n/** Return value for D161 persistent reactiveIndex composition. */\nexport interface PersistentReactiveIndex<K, V> {\n\treadonly collection: ReactiveIndex<K, V>;\n\treadonly persistence: ReactiveCollectionPersistenceHandle;\n\treadonly loaded: ReactiveIndexRestoreState<K, V>;\n}\n\n/** D161 convenience wrapper: passive load, sync restoreReactiveList, then sidecar persist. */\nexport function openPersistentReactiveList<T = unknown>(\n\topts: OpenPersistentReactiveListOptions<T>,\n): Promise<PersistentReactiveList<T>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"reactive-collection\";\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(storagePrefix);\n\tconst loadOpts = { ...opts, snapshotKey, storagePrefix };\n\treturn loadReactiveListState<T>(loadOpts).then((loaded) => {\n\t\tconst state =\n\t\t\tloaded.source === \"empty\" && opts.initial !== undefined\n\t\t\t\t? { ...loaded, state: opts.initial }\n\t\t\t\t: loaded;\n\t\tconst collection = restoreReactiveList<T>(state, {\n\t\t\t...(opts.collection ?? {}),\n\t\t\tgraph: opts.graph,\n\t\t\tname: opts.name,\n\t\t});\n\t\tconst persistence = persistReactiveCollection<T, \"reactiveList\">(opts.graph, collection, {\n\t\t\t...opts,\n\t\t\tkind: \"reactiveList\",\n\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\tsnapshotKey,\n\t\t\tstoragePrefix,\n\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t});\n\t\treturn { collection, persistence, loaded };\n\t});\n}\n\n/** D161 convenience wrapper: passive load, sync restoreReactiveLog, then sidecar persist. */\nexport function openPersistentReactiveLog<T = unknown>(\n\topts: OpenPersistentReactiveLogOptions<T>,\n): Promise<PersistentReactiveLog<T>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"reactive-collection\";\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(storagePrefix);\n\tconst loadOpts = { ...opts, snapshotKey, storagePrefix };\n\treturn loadReactiveLogState<T>(loadOpts).then((loaded) => {\n\t\tconst state =\n\t\t\tloaded.source === \"empty\" && opts.initial !== undefined\n\t\t\t\t? { ...loaded, state: opts.initial }\n\t\t\t\t: loaded;\n\t\tconst collection = restoreReactiveLog<T>(state, {\n\t\t\t...(opts.collection ?? {}),\n\t\t\tgraph: opts.graph,\n\t\t\tname: opts.name,\n\t\t});\n\t\tconst persistence = persistReactiveCollection<T, \"reactiveLog\">(opts.graph, collection, {\n\t\t\t...opts,\n\t\t\tkind: \"reactiveLog\",\n\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\tsnapshotKey,\n\t\t\tstoragePrefix,\n\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t});\n\t\treturn { collection, persistence, loaded };\n\t});\n}\n\n/** D161 convenience wrapper: passive load, sync restoreReactiveMap, then sidecar persist. */\nexport function openPersistentReactiveMap<K = unknown, V = unknown>(\n\topts: OpenPersistentReactiveMapOptions<K, V>,\n): Promise<PersistentReactiveMap<K, V>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"reactive-collection\";\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(storagePrefix);\n\tconst loadOpts = { ...opts, snapshotKey, storagePrefix };\n\treturn loadReactiveMapState<K, V>(loadOpts).then((loaded) => {\n\t\tconst state =\n\t\t\tloaded.source === \"empty\" && opts.initial !== undefined\n\t\t\t\t? { ...loaded, state: opts.initial }\n\t\t\t\t: loaded;\n\t\tconst collection = restoreReactiveMap<K, V>(state, {\n\t\t\t...(opts.collection ?? {}),\n\t\t\tgraph: opts.graph,\n\t\t\tname: opts.name,\n\t\t});\n\t\tconst persistence = persistReactiveCollection<V, \"reactiveMap\">(opts.graph, collection, {\n\t\t\t...opts,\n\t\t\tkind: \"reactiveMap\",\n\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\tsnapshotKey,\n\t\t\tstoragePrefix,\n\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t});\n\t\treturn { collection, persistence, loaded };\n\t});\n}\n\n/** D161 convenience wrapper: passive load, sync restoreReactiveIndex, then sidecar persist. */\nexport function openPersistentReactiveIndex<K = unknown, V = unknown>(\n\topts: OpenPersistentReactiveIndexOptions<K, V>,\n): Promise<PersistentReactiveIndex<K, V>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"reactive-collection\";\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(storagePrefix);\n\tconst loadOpts = { ...opts, snapshotKey, storagePrefix };\n\treturn loadReactiveIndexState<K, V>(loadOpts).then((loaded) => {\n\t\tconst state =\n\t\t\tloaded.source === \"empty\" && opts.initial !== undefined\n\t\t\t\t? { ...loaded, state: opts.initial }\n\t\t\t\t: loaded;\n\t\tconst collection = restoreReactiveIndex<K, V>(state, {\n\t\t\t...(opts.collection ?? {}),\n\t\t\tgraph: opts.graph,\n\t\t\tname: opts.name,\n\t\t});\n\t\tconst persistence = persistReactiveCollection<V, \"reactiveIndex\">(opts.graph, collection, {\n\t\t\t...opts,\n\t\t\tkind: \"reactiveIndex\",\n\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\tsnapshotKey,\n\t\t\tstoragePrefix,\n\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t});\n\t\treturn { collection, persistence, loaded };\n\t});\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAeO,IAAM,wCACZ;AACM,IAAM,sCACZ;AACM,IAAM,8CAA8C;AAwGpD,SAAS,gCAAgC,gBAAgB,kBAA0B;AACzF,MAAI,cAAc,WAAW,EAAG,OAAM,IAAI,UAAU,iCAAiC;AACrF,SAAO,GAAG,aAAa;AACxB;AAEO,SAAS,iCAGf,SACA,OAA2C,CAAC,GACF;AAC1C,QAAM,eAAe,qBAAqB,KAAK,gBAAgB,EAAE;AACjE,SAAO,uCAAuC;AAAA,IAC7C,QAAQ;AAAA,IACR,SAAS;AAAA,IACT;AAAA,IACA,SAAS,QAAQ,IAAI,CAAC,WAAW,yBAAyB,MAAM,CAAC;AAAA,EAClE,CAAC;AACF;AAEO,SAAS,+BAEd,SAAuF;AACxF,SAAO,qCAAqC;AAAA,IAC3C,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,QAAQ;AAAA,MACP,MAAM;AAAA,MACN,SAAS,QAAQ,IAAI,CAAC,WAAW,yBAAyB,MAAM,CAAC;AAAA,IAClE;AAAA,EACD,CAAC;AACF;AAEO,SAAS,uCAEd,OAAyD;AAC1D,MAAI,CAAC,cAAc,KAAK,EAAG,OAAM,IAAI,UAAU,iDAAiD;AAChG;AAAA,IACC;AAAA,IACA,CAAC,gBAAgB,UAAU,WAAW,SAAS;AAAA,IAC/C;AAAA,EACD;AACA,MAAI,MAAM,WAAW,uCAAuC;AAC3D,UAAM,IAAI,UAAU,+CAA+C;AAAA,EACpE;AACA,MAAI,MAAM,YAAY,6CAA6C;AAClE,UAAM,IAAI,UAAU,gDAAgD;AAAA,EACrE;AACA,QAAM,eAAe,qBAAqB,MAAM,YAAY;AAC5D,MAAI,CAAC,MAAM,QAAQ,MAAM,OAAO,GAAG;AAClC,UAAM,IAAI,UAAU,yDAAyD;AAAA,EAC9E;AACA,QAAM,UAAU;AAAA,IACf,MAAM;AAAA,IACN;AAAA,EACD;AACA,SAAO,OAAO,OAAO;AAAA,IACpB,QAAQ;AAAA,IACR,SAAS;AAAA,IACT;AAAA,IACA,SAAS,OAAO,OAAO,OAAO;AAAA,EAC/B,CAAC;AACF;AAEO,SAAS,qCAEd,OAAuD;AACxD,MAAI,CAAC,cAAc,KAAK,EAAG,OAAM,IAAI,UAAU,+CAA+C;AAC9F,aAAW,OAAO,CAAC,UAAU,UAAU,SAAS,GAAG,6BAA6B;AAChF,MAAI,MAAM,WAAW,qCAAqC;AACzD,UAAM,IAAI,UAAU,6CAA6C;AAAA,EAClE;AACA,MAAI,MAAM,YAAY,6CAA6C;AAClE,UAAM,IAAI,UAAU,8CAA8C;AAAA,EACnE;AACA,MAAI,CAAC,cAAc,MAAM,MAAM,GAAG;AACjC,UAAM,IAAI,UAAU,uDAAuD;AAAA,EAC5E;AACA,aAAW,MAAM,QAAQ,CAAC,QAAQ,SAAS,GAAG,oCAAoC;AAClF,MAAI,MAAM,OAAO,SAAS,cAAc;AACvC,UAAM,IAAI,UAAU,6DAA6D;AAAA,EAClF;AACA,MAAI,CAAC,MAAM,QAAQ,MAAM,OAAO,OAAO,GAAG;AACzC,UAAM,IAAI,UAAU,8DAA8D;AAAA,EACnF;AACA,QAAM,UAAU;AAAA,IACf,MAAM,OAAO;AAAA,IACb;AAAA,EACD;AACA,SAAO,OAAO,OAAO;AAAA,IACpB,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,QAAQ,OAAO,OAAO;AAAA,MACrB,MAAM;AAAA,MACN,SAAS,OAAO,OAAO,OAAO;AAAA,IAC/B,CAAC;AAAA,EACF,CAAC;AACF;AAEO,SAAS,8BAEd,MAA8F;AAC/F,QAAM,gBAAgB,KAAK,iBAAiB;AAC5C,QAAM,cAAc,KAAK,eAAe,gCAAgC,aAAa;AACrF,SAAO,KAAK,cAAc,IAAI,WAAW,EAAE,KAAK,CAAC,gBAAgB;AAChE,QAAI,UAAiD,CAAC;AACtD,QAAI,SAA4D;AAChE,QAAI,eAAe;AACnB,QAAI,gBAAgB,QAAW;AAC9B,YAAM,WAAW,uCAA8C,WAAW;AAC1E,gBAAU,SAAS,QAAQ,IAAI,eAAe;AAC9C,qBAAe,SAAS;AACxB,eAAS;AAAA,IACV;AACA,QAAI,KAAK,cAAc,QAAW;AACjC,aAAO;AAAA,QACN;AAAA,QACA;AAAA,QACA,UAAU,EAAE,OAAO,gBAAgB,QAAW,aAAa;AAAA,QAC3D,SAAS,EAAE,SAAS,GAAG,QAAQ,aAAa;AAAA,MAC7C;AAAA,IACD;AACA,WAAO,KAAK,UAAU,KAAK,EAAE,OAAO,aAAa,CAAC,EAAE,KAAK,CAAC,YAAY;AACrE,UAAI,UAAU;AACd,UAAI,SAAS;AACb,iBAAW,SAAS,SAAS;AAC5B,YAAI,MAAM,QAAQ,SAAS,GAAG;AAC7B,gBAAM,IAAI,MAAM,qDAAqD;AAAA,QACtE;AACA,cAAM,SAAS,qCAA4C,MAAM,KAAK;AACtE,kBAAU,OAAO,OAAO,QAAQ,IAAI,eAAe;AACnD,iBAAS,MAAM;AACf,mBAAW;AAAA,MACZ;AACA,aAAO;AAAA,QACN;AAAA,QACA,QACC,gBAAgB,UAAa,UAAU,IACpC,qBACA,gBAAgB,SACf,aACA,UAAU,IACT,YACA;AAAA,QACN,UAAU,EAAE,OAAO,gBAAgB,QAAW,aAAa;AAAA,QAC3D,SAAS,EAAE,SAAS,OAAO;AAAA,MAC5B;AAAA,IACD,CAAC;AAAA,EACF,CAAC;AACF;AAEO,SAAS,4BAGf,OACA,SACA,MACwC;AACxC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,cACL,KAAK,eAAe,gCAAgC,KAAK,iBAAiB,IAAI;AAC/E,QAAM,uBAAuB,6BAA6B,KAAK,oBAAoB;AACnF,uBAAqB,OAAO,SAA0B,GAAG,IAAI,UAAU;AACvE,MAAI,cAAqD;AAAA,IACxD,MAAM;AAAA,IACN,WAAW,qBAAqB,KAAK,uBAAuB,EAAE;AAAA,IAC9D,gBAAgB;AAAA,IAChB,cAAc;AAAA,EACf;AACA,MAAI,cAAc,SAAS,YAAY,GAAG,GAAG,GAAG,WAAW;AAC3D,MAAI,aAAa;AACjB,MAAI,SAAS;AACb,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,mBAAmB;AACvB,MAAI,cAAc;AAClB,MAAI,+BAA+B;AACnC,MAAI,gBAAuD,QAAQ,SAAS,CAAC;AAC7E,MAAI;AACJ,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAQ,MAAM,MAAM,OAAO,EAAE,MAAM,GAAG,IAAI,SAAS,CAAC;AAC1D,QAAM,SAAS,MAAM,MAA6C,aAAa;AAAA,IAC9E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AACD,QAAM,QAAQ,MAAM,MAAmD,MAAM;AAAA,IAC5E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AACD,QAAM,SAAS,MAAM,MAA6C,aAAa;AAAA,IAC9E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AAED,WAAS,QAAQ,OAA6D;AAC7E,UAAM,YAAY,YAAY,UAAU,aAAa,UAAU,aAAa,YAAY;AACxF,kBAAc;AAAA,MACb;AAAA,MACA,MAAM,UAAU,UAAU,IAAI;AAAA,MAC9B;AAAA,MACA;AAAA,MACA;AAAA,IACD;AACA,WAAO,IAAI,WAAW;AACtB,WAAO,IAAI,WAAW;AACtB,QAAI,cAAc,QAAS,OAAM,IAAI,IAAI;AACzC,QAAI,cAAc,aAAa,cAAc,WAAY,OAAM,IAAI,KAAK;AAAA,EACzE;AAEA,WAAS,OAAO,OAA8B,QAAuB;AACpE,kBAAc;AACd,UAAM,IAAI,EAAE,OAAO,SAAS,aAAa,MAAM,GAAG,QAAQ,YAAY,CAAC;AAAA,EACxE;AAEA,WAAS,SAAS,MAA+B;AAChD,QAAI;AACH,aAAO,WAAW;AAAA,IACnB,QAAQ;AAAA,IAER;AAAA,EACD;AAEA,WAAS,OAAO,MAAuB;AACtC,QAAI,KAAK,UAAU,WAAW;AAC7B,iBAAW;AACX,gBAAU;AACV,cAAQ,UAAU;AAAA,IACnB,WAAW,YAAY,UAAU,WAAW;AAC3C,gBAAU;AACV,cAAQ,OAAO;AAAA,IAChB,OAAO;AACN,gBAAU;AACV,cAAQ,SAAS;AAAA,IAClB;AACA,aAAS,KAAK,IAAI;AAClB,UAAM;AAAA,EACP;AAEA,WAAS,KAAK,MAAiB,QAAuB;AACrD,QAAI,KAAK,UAAU,cAAc,KAAK,UAAU,SAAU,QAAO,KAAK,OAAO,MAAM;AACnF,cAAU;AACV,QAAI,KAAK,UAAU,cAAc,KAAK,UAAU,SAAU,SAAQ,SAAS;AAC3E,aAAS,KAAK,IAAI;AAClB,UAAM;AAAA,EACP;AAEA,WAAS,cAAc,MAAiB,OAAyB;AAChE,QAAK,OAAO,UAAU,YAAY,OAAO,UAAU,cAAe,UAAU,KAAM,QAAO;AACzF,UAAM,OAAQ,MAA6B;AAC3C,QAAI,OAAO,SAAS,WAAY,QAAO;AACvC,QAAI,UAAU;AACd,UAAM,SAAS,CAAC,SAAqB;AACpC,UAAI,QAAS;AACb,gBAAU;AACV,WAAK;AAAA,IACN;AACA,QAAI;AACH,MAAC,KAAoF;AAAA,QACpF;AAAA,QACA,MAAM,OAAO,MAAM,OAAO,IAAI,CAAC;AAAA,QAC/B,CAAC,WAAW,OAAO,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,MAC5C;AAAA,IACD,SAAS,QAAQ;AAChB,aAAO,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,IAChC;AACA,WAAO;AAAA,EACR;AAEA,WAAS,QAAQ,MAAuB;AACvC,QAAI,YAAa,oBAAoB,KAAK,UAAU,aAAa,KAAK,UAAU,SAAU;AACzF,eAAS,KAAK,IAAI;AAClB;AAAA,IACD;AACA,UAAM,KAAK,IAAI;AACf,UAAM;AAAA,EACP;AAEA,WAAS,QAAc;AACtB,QAAI,QAAS;AACb,UAAM,OAAO,MAAM,MAAM;AACzB,QAAI,SAAS,OAAW;AACxB,cAAU;AACV;AAAA,MACC,KAAK,UAAU,UAAU,aAAa,YAAY,UAAU,aAAa,aAAa;AAAA,IACvF;AACA,QAAI;AACJ,QAAI;AACH,eAAS,KAAK,IAAI;AAAA,IACnB,SAAS,QAAQ;AAChB,WAAK,MAAM,MAAM;AACjB;AAAA,IACD;AACA,QAAI,cAAc,MAAM,MAAM,EAAG;AACjC,WAAO,IAAI;AAAA,EACZ;AAEA,WAAS,gBAAgB,MAAsE;AAC9F,UAAM,kBAAkB;AACxB,mCAA+B;AAC/B,YAAQ;AAAA,MACP,OAAO;AAAA,MACP;AAAA,MACA,MAAM;AACL,cAAMA,WAAU,OAAO;AAAA,UACtB,gBAAgB,IAAI,CAAC,WAAW,yBAAyB,MAAM,CAAC;AAAA,QACjE;AACA,cAAM,QAAQ,uCAA8C;AAAA,UAC3D,QAAQ;AAAA,UACR,SAAS;AAAA,UACT,cAAc,YAAY;AAAA,UAC1B,SAAAA;AAAA,QACD,CAAC;AACD,eAAO,KAAK,cAAc,IAAI,aAAa,KAAK,EAAE,KAAK,MAAM;AAC5D,wBAAc,EAAE,GAAG,aAAa,gBAAgB,YAAY,iBAAiB,EAAE;AAC/E,oBAAU;AACV,kBAAQ,OAAO;AAAA,QAChB,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAAA,EACF;AAEA,WAAS,cAAc,aAA0D;AAChF,UAAM,YAAY,KAAK;AACvB,QAAI,cAAc,OAAW;AAC7B,YAAQ;AAAA,MACP,OAAO;AAAA,MACP,MAAM;AACL,cAAM,QAAQ,+BAA+B,WAAW;AACxD,eAAO,UAAU,OAAO,KAAK,EAAE,KAAK,CAAC,YAAY;AAChD,gBAAM,QAAQ;AACd,wBAAc;AAAA,YACb,GAAG;AAAA,YACH,WAAW,MAAM;AAAA,YACjB,cAAc,YAAY,eAAe;AAAA,UAC1C;AACA,oBAAU;AACV,kBAAQ,OAAO;AAAA,QAChB,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAAA,EACF;AAEA,WAAS,yBAA+B;AACvC,UAAM,UAAU,MAAM,OAAO,CAAC;AAC9B,eAAW,QAAQ,QAAS,UAAS,KAAK,IAAI;AAAA,EAC/C;AAEA,SAAO,QAAQ,UAAU,CAAC,KAAc,aAA4B;AACnE,QAAI,iBAAkB;AACtB,UAAM,cAAc,OAA8C,GAAG;AACrE,QAAI,gBAAgB,OAAW;AAC/B,oBAAgB;AAChB,QAAI,eAAe,aAAa,OAAW;AAC3C,oCAAgC;AAChC,kBAAc,WAAW;AACzB,QACC,yBAAyB,UACzB,gCAAgC,sBAC/B;AACD,sBAAgB;AAAA,IACjB;AAAA,EACD,CAAC;AACD,gBAAc;AACd,MAAI,KAAK,qBAAqB,MAAO,iBAAgB;AAAA,MAChD,SAAQ,OAAO;AAEpB,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAM,MAAsE;AAC3E,UAAI,UAAU;AACb,iBAAS,IAAI;AACb;AAAA,MACD;AACA,cAAQ,EAAE,OAAO,SAAS,MAAM,KAAK,MAAM,OAAU,CAAC;AAAA,IACvD;AAAA,IACA,SAAS,MAAsE;AAC9E,UAAI,YAAY,kBAAkB;AACjC,iBAAS,IAAI;AACb;AAAA,MACD;AACA,sBAAgB,IAAI;AAAA,IACrB;AAAA,IACA,QAAQ,MAAsE;AAC7E,UAAI,UAAU;AACb,iBAAS,IAAI;AACb;AAAA,MACD;AACA,yBAAmB;AACnB,aAAO;AACP,6BAAuB;AACvB,cAAQ,EAAE,OAAO,WAAW,MAAM,KAAK,MAAM,OAAU,CAAC;AAAA,IACzD;AAAA,EACD;AACD;AAEO,SAAS,mCAGf,MACiD;AACjD,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,gCAAgC,aAAa;AACrF,SAAO,8BAAqC,EAAE,GAAG,MAAM,aAAa,cAAc,CAAC,EAAE;AAAA,IACpF,CAAC,WAAW;AACX,YAAM,UACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAAY,KAAK,UAAU,OAAO;AACjF,YAAM,OAAO,KAAK,MAAM,MAA6C,SAAS;AAAA,QAC7E,MAAM,KAAK;AAAA,MACZ,CAAC;AACD,YAAM,cAAc,4BAA4B,KAAK,OAAO,MAAM;AAAA,QACjE,GAAG;AAAA,QACH,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,QAC/C;AAAA,QACA;AAAA,QACA,qBAAqB,OAAO,QAAQ;AAAA,MACrC,CAAC;AACD,aAAO,EAAE,SAAS,MAAM,aAAa,OAAO;AAAA,IAC7C;AAAA,EACD;AACD;AAEA,SAAS,gBACR,OAC6B;AAC7B,SAAO,yBAAgC,EAAE;AAAA,IACxC,8BAAqC,EAAE,OAAO,KAAK;AAAA,EACpD;AACD;AAEA,SAAS,SACR,OACA,SACA,QACA,QACA,QACwC;AACxC,SAAO,EAAE,OAAO,SAAS,QAAQ,QAAQ,OAAO;AACjD;AAEA,SAAS,OAAU,KAA6B;AAC/C,SAAO,IAAI,CAAC,MAAM,SAAU,IAAI,CAAC,IAAU;AAC5C;AAEA,SAAS,qBAAqB,OAAwB;AACrD,MAAI,OAAO,UAAU,YAAY,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,IAAI;AAC5E,UAAM,IAAI,WAAW,2CAA2C;AAAA,EACjE;AACA,SAAO;AACR;AAEA,SAAS,6BAA6B,OAA+C;AACpF,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GAAG;AAC9C,UAAM,IAAI,WAAW,sDAAsD;AAAA,EAC5E;AACA,SAAO;AACR;AAEA,SAAS,cAAc,OAAkD;AACxE,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK;AAC3E;AAEA,SAAS,WACR,OACA,UACA,OACO;AACP,QAAM,SAAS,OAAO,KAAK,KAAK,EAAE,KAAK;AACvC,QAAM,OAAO,CAAC,GAAG,QAAQ,EAAE,KAAK;AAChC,MAAI,OAAO,WAAW,KAAK,UAAU,OAAO,KAAK,CAAC,KAAK,MAAM,QAAQ,KAAK,CAAC,CAAC,GAAG;AAC9E,UAAM,IAAI,UAAU,GAAG,KAAK,6BAA6B,OAAO,KAAK,GAAG,CAAC,EAAE;AAAA,EAC5E;AACD;AAEA,SAAS,wBACR,OACA,OAC6C;AAC7C,QAAM,UAA6C,CAAC;AACpD,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,QAAI,CAAC,OAAO,OAAO,OAAO,CAAC,GAAG;AAC7B,YAAM,IAAI,UAAU,GAAG,KAAK,0BAA0B,CAAC,EAAE;AAAA,IAC1D;AACA,YAAQ,KAAK,+BAAsC,MAAM,CAAC,CAAC,CAAC;AAAA,EAC7D;AACA,SAAO,OAAO,OAAO,OAAO;AAC7B;AAEA,SAAS,aAAa,OAAwB;AAC7C,SAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC7D;;;AC1eA,SAAS,YAAY,YAAkE;AACtF,SAAO;AAAA,IACN,MAAM;AAAA,IACN;AAAA,IACA,WAAW;AAAA,IACX,gBAAgB;AAAA,IAChB,cAAc;AAAA,EACf;AACD;AAEA,SAASC,cAAa,OAAwB;AAC7C,SAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC7D;AAEA,SAASC,8BAA6B,OAA+C;AACpF,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GAAG;AAC9C,UAAM,IAAI,WAAW,sDAAsD;AAAA,EAC5E;AACA,SAAO;AACR;AAEA,SAAS,4BAA4B,OAAmC;AACvE,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,IAAI;AAC/C,UAAM,IAAI,WAAW,kDAAkD;AAAA,EACxE;AACA,SAAO;AACR;AAEA,SAASC,UACR,OACA,SACA,QACA,QACA,QACsC;AACtC,SAAO,EAAE,OAAO,SAAS,QAAQ,QAAQ,OAAO;AACjD;AAEA,SAASC,QAAU,KAA6B;AAC/C,SAAO,IAAI,CAAC,MAAM,SAAU,IAAI,CAAC,IAAU;AAC5C;AAMO,SAAS,0BACf,OACA,YACA,MACsC;AACtC,QAAM,OAAO,KAAK;AAClB,QAAM,OAAO,KAAK,QAAQ,GAAG,IAAI;AACjC,QAAM,cAAc,KAAK,eAAe,sBAAsB,KAAK,iBAAiB,IAAI;AACxF,QAAM,uBAAuBF,8BAA6B,KAAK,oBAAoB;AACnF,uBAAqB,OAAO,WAAW,OAAwB,GAAG,IAAI,mBAAmB;AACzF,uBAAqB,OAAO,WAAW,UAA2B,GAAG,IAAI,sBAAsB;AAE/F,MAAI,cAAc;AAAA,IACjB,GAAG,YAAY,IAAI;AAAA,IACnB,WAAW,4BAA4B,KAAK,mBAAmB;AAAA,EAChE;AACA,MAAI,cAAcC,UAAS,YAAY,GAAG,GAAG,GAAG,WAAW;AAC3D,MAAI,aAAa;AACjB,MAAI,SAAS;AACb,MAAI,+BAA+B;AACnC,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,mBAAmB;AACvB,MAAI,cAAc;AAClB,MAAI;AACJ,QAAM,QAAqB,CAAC;AAE5B,QAAM,QAAQ,MAAM,MAAM,OAAO,EAAE,MAAM,GAAG,IAAI,SAAS,CAAC;AAC1D,QAAM,SAAS,MAAM,MAA2C,aAAa;AAAA,IAC5E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AACD,QAAM,QAAQ,MAAM,MAAiD,MAAM;AAAA,IAC1E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AACD,QAAM,SAAS,MAAM,MAA2C,aAAa;AAAA,IAC5E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AAED,WAAS,QAAQ,OAA2D;AAC3E,UAAM,YAAY,YAAY,UAAU,aAAa,UAAU,aAAa,YAAY;AACxF,kBAAcA;AAAA,MACb;AAAA,MACA,MAAM,UAAU,UAAU,IAAI;AAAA,MAC9B;AAAA,MACA;AAAA,MACA;AAAA,IACD;AACA,WAAO,IAAI,WAAW;AACtB,WAAO,IAAI,WAAW;AACtB,QAAI,cAAc,QAAS,OAAM,IAAI,IAAI;AACzC,QAAI,cAAc,aAAa,cAAc,WAAY,OAAM,IAAI,KAAK;AAAA,EACzE;AAEA,WAAS,OAAO,OAA8B,QAAuB;AACpE,kBAAc;AACd,UAAM,OAAO,EAAE,OAAO,SAASF,cAAa,MAAM,GAAG,QAAQ,YAAY;AACzE,UAAM,IAAI,IAAI;AAAA,EACf;AAEA,WAAS,SAAS,MAA+B;AAChD,QAAI;AACH,aAAO,WAAW;AAAA,IACnB,QAAQ;AAAA,IAER;AAAA,EACD;AAEA,WAAS,OAAO,MAAuB;AACtC,QAAI,KAAK,UAAU,WAAW;AAC7B,iBAAW;AACX,gBAAU;AACV,cAAQ,UAAU;AAAA,IACnB,WAAW,YAAY,UAAU,WAAW;AAC3C,gBAAU;AACV,cAAQ,OAAO;AAAA,IAChB,OAAO;AACN,gBAAU;AACV,cAAQ,SAAS;AAAA,IAClB;AACA,aAAS,KAAK,IAAI;AAClB,UAAM;AAAA,EACP;AAEA,WAAS,KAAK,MAAiB,QAAuB;AACrD,QAAI,KAAK,UAAU,cAAc,KAAK,UAAU,SAAU,QAAO,KAAK,OAAO,MAAM;AACnF,cAAU;AACV,QAAI,KAAK,UAAU,cAAc,KAAK,UAAU,SAAU,SAAQ,SAAS;AAC3E,aAAS,KAAK,IAAI;AAClB,UAAM;AAAA,EACP;AAEA,WAAS,cAAc,MAAiB,OAAyB;AAChE,QAAK,OAAO,UAAU,YAAY,OAAO,UAAU,cAAe,UAAU,KAAM,QAAO;AACzF,QAAI;AACJ,QAAI;AACH,aAAQ,MAA6B;AAAA,IACtC,SAAS,QAAQ;AAChB,WAAK,MAAM,MAAM;AACjB,aAAO;AAAA,IACR;AACA,QAAI,OAAO,SAAS,WAAY,QAAO;AACvC,QAAI,UAAU;AACd,UAAM,SAAS,CAAC,SAAqB;AACpC,UAAI,QAAS;AACb,gBAAU;AACV,WAAK;AAAA,IACN;AACA,QAAI;AACH,MAAC,KAAoF;AAAA,QACpF;AAAA,QACA,MAAM,OAAO,MAAM,OAAO,IAAI,CAAC;AAAA,QAC/B,CAAC,WAAW,OAAO,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,MAC5C;AAAA,IACD,SAAS,QAAQ;AAChB,aAAO,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,IAChC;AACA,WAAO;AAAA,EACR;AAEA,WAAS,QAAQ,MAAuB;AACvC,QAAI,YAAa,oBAAoB,KAAK,UAAU,aAAa,KAAK,UAAU,SAAU;AACzF,eAAS,KAAK,IAAI;AAClB;AAAA,IACD;AACA,UAAM,KAAK,IAAI;AACf,UAAM;AAAA,EACP;AAEA,WAAS,QAAc;AACtB,QAAI,QAAS;AACb,UAAM,OAAO,MAAM,MAAM;AACzB,QAAI,SAAS,OAAW;AACxB,cAAU;AACV;AAAA,MACC,KAAK,UAAU,UAAU,aAAa,YAAY,UAAU,aAAa,aAAa;AAAA,IACvF;AACA,QAAI;AACJ,QAAI;AACH,eAAS,KAAK,IAAI;AAAA,IACnB,SAAS,QAAQ;AAChB,WAAK,MAAM,MAAM;AACjB;AAAA,IACD;AACA,QAAI,cAAc,MAAM,MAAM,EAAG;AACjC,WAAO,IAAI;AAAA,EACZ;AAEA,WAAS,gBAAgB,MAAoE;AAC5F,UAAM,WAAW,mBAAmB,YAAY,IAAI;AACpD,mCAA+B;AAC/B,YAAQ;AAAA,MACP,OAAO;AAAA,MACP;AAAA,MACA,MAAM;AACL,cAAM,QACL,gCAAgC,MAAM,UAAU;AAAA,UAC/C,cAAc,YAAY;AAAA,QAC3B,CAAC;AACF,8CAAsC,OAAO,IAAI;AACjD,eAAO,KAAK,cAAc,IAAI,aAAa,KAAK,EAAE,KAAK,MAAM;AAC5D,wBAAc;AAAA,YACb,GAAG;AAAA,YACH,gBAAgB,YAAY,iBAAiB;AAAA,UAC9C;AACA,oBAAU;AACV,kBAAQ,OAAO;AAAA,QAChB,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAAA,EACF;AAEA,WAAS,cAAc,QAAuC;AAC7D,UAAM,YAAY,KAAK;AACvB,QAAI,cAAc,OAAW;AAC7B,YAAQ;AAAA,MACP,OAAO;AAAA,MACP,MAAM;AACL,cAAM,QAGF,8BAA8B,MAAM,MAAM;AAC9C,4CAAoC,OAAO,IAAI;AAC/C,eAAO,UAAU,OAAO,KAAK,EAAE,KAAK,CAAC,YAAY;AAChD,gBAAM,QAAQ;AAGd,wBAAc;AAAA,YACb,GAAG;AAAA,YACH,WAAW,MAAM;AAAA,YACjB,cAAc,YAAY,eAAe;AAAA,UAC1C;AACA,oBAAU;AACV,kBAAQ,OAAO;AAAA,QAChB,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAAA,EACF;AAEA,WAAS,yBAA+B;AACvC,UAAM,UAAU,MAAM,OAAO,CAAC;AAC9B,eAAW,QAAQ,QAAS,UAAS,KAAK,IAAI;AAAA,EAC/C;AAEA,SAAQ,WAAW,MAAwC;AAAA,IAC1D,CAAC,KAAc,aAA4B;AAC1C,UAAI,iBAAkB;AACtB,YAAM,SAASG,QAAgC,GAAG;AAClD,UAAI,WAAW,OAAW;AAC1B,UAAI,eAAe,aAAa,OAAW;AAC3C,sCAAgC;AAChC,oBAAc,MAAM;AACpB,UACC,yBAAyB,UACzB,gCAAgC,sBAC/B;AACD,wBAAgB;AAAA,MACjB;AAAA,IACD;AAAA,EACD;AACA,gBAAc;AAEd,MAAI,KAAK,qBAAqB,MAAO,iBAAgB;AAAA,MAChD,SAAQ,OAAO;AAEpB,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAM,MAAoE;AACzE,UAAI,UAAU;AACb,iBAAS,IAAI;AACb;AAAA,MACD;AACA,cAAQ,EAAE,OAAO,SAAS,MAAM,KAAK,MAAM,OAAU,CAAC;AAAA,IACvD;AAAA,IACA,SAAS,MAAoE;AAC5E,UAAI,YAAY,kBAAkB;AACjC,iBAAS,IAAI;AACb;AAAA,MACD;AACA,sBAAgB,IAAI;AAAA,IACrB;AAAA,IACA,QAAQ,MAAoE;AAC3E,UAAI,UAAU;AACb,iBAAS,IAAI;AACb;AAAA,MACD;AACA,yBAAmB;AACnB,aAAO;AACP,6BAAuB;AACvB,cAAQ,EAAE,OAAO,WAAW,MAAM,KAAK,MAAM,OAAU,CAAC;AAAA,IACzD;AAAA,EACD;AACD;AAEA,SAAS,mBACR,YACA,MACqB;AACrB,MAAI,SAAS,eAAe;AAC3B,WAAO,CAAC,GAAI,WAA6C,MAAM,CAAC;AAAA,EACjE;AACA,MAAI,SAAS,iBAAiB;AAC7B,WAAQ,WAA+C,QAAQ;AAAA,EAChE;AACA,SAAQ,WAAgD,QAAQ;AACjE;AAqFO,SAAS,2BACf,MACqC;AACrC,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,sBAAsB,aAAa;AAC3E,QAAM,WAAW,EAAE,GAAG,MAAM,aAAa,cAAc;AACvD,SAAO,sBAAyB,QAAQ,EAAE,KAAK,CAAC,WAAW;AAC1D,UAAM,QACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAC3C,EAAE,GAAG,QAAQ,OAAO,KAAK,QAAQ,IACjC;AACJ,UAAM,aAAa,oBAAuB,OAAO;AAAA,MAChD,GAAI,KAAK,cAAc,CAAC;AAAA,MACxB,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,IACZ,CAAC;AACD,UAAM,cAAc,0BAA6C,KAAK,OAAO,YAAY;AAAA,MACxF,GAAG;AAAA,MACH,MAAM;AAAA,MACN,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,MAC/C;AAAA,MACA;AAAA,MACA,qBAAqB,OAAO,QAAQ;AAAA,IACrC,CAAC;AACD,WAAO,EAAE,YAAY,aAAa,OAAO;AAAA,EAC1C,CAAC;AACF;AAGO,SAAS,0BACf,MACoC;AACpC,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,sBAAsB,aAAa;AAC3E,QAAM,WAAW,EAAE,GAAG,MAAM,aAAa,cAAc;AACvD,SAAO,qBAAwB,QAAQ,EAAE,KAAK,CAAC,WAAW;AACzD,UAAM,QACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAC3C,EAAE,GAAG,QAAQ,OAAO,KAAK,QAAQ,IACjC;AACJ,UAAM,aAAa,mBAAsB,OAAO;AAAA,MAC/C,GAAI,KAAK,cAAc,CAAC;AAAA,MACxB,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,IACZ,CAAC;AACD,UAAM,cAAc,0BAA4C,KAAK,OAAO,YAAY;AAAA,MACvF,GAAG;AAAA,MACH,MAAM;AAAA,MACN,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,MAC/C;AAAA,MACA;AAAA,MACA,qBAAqB,OAAO,QAAQ;AAAA,IACrC,CAAC;AACD,WAAO,EAAE,YAAY,aAAa,OAAO;AAAA,EAC1C,CAAC;AACF;AAGO,SAAS,0BACf,MACuC;AACvC,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,sBAAsB,aAAa;AAC3E,QAAM,WAAW,EAAE,GAAG,MAAM,aAAa,cAAc;AACvD,SAAO,qBAA2B,QAAQ,EAAE,KAAK,CAAC,WAAW;AAC5D,UAAM,QACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAC3C,EAAE,GAAG,QAAQ,OAAO,KAAK,QAAQ,IACjC;AACJ,UAAM,aAAa,mBAAyB,OAAO;AAAA,MAClD,GAAI,KAAK,cAAc,CAAC;AAAA,MACxB,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,IACZ,CAAC;AACD,UAAM,cAAc,0BAA4C,KAAK,OAAO,YAAY;AAAA,MACvF,GAAG;AAAA,MACH,MAAM;AAAA,MACN,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,MAC/C;AAAA,MACA;AAAA,MACA,qBAAqB,OAAO,QAAQ;AAAA,IACrC,CAAC;AACD,WAAO,EAAE,YAAY,aAAa,OAAO;AAAA,EAC1C,CAAC;AACF;AAGO,SAAS,4BACf,MACyC;AACzC,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,sBAAsB,aAAa;AAC3E,QAAM,WAAW,EAAE,GAAG,MAAM,aAAa,cAAc;AACvD,SAAO,uBAA6B,QAAQ,EAAE,KAAK,CAAC,WAAW;AAC9D,UAAM,QACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAC3C,EAAE,GAAG,QAAQ,OAAO,KAAK,QAAQ,IACjC;AACJ,UAAM,aAAa,qBAA2B,OAAO;AAAA,MACpD,GAAI,KAAK,cAAc,CAAC;AAAA,MACxB,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,IACZ,CAAC;AACD,UAAM,cAAc,0BAA8C,KAAK,OAAO,YAAY;AAAA,MACzF,GAAG;AAAA,MACH,MAAM;AAAA,MACN,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,MAC/C;AAAA,MACA;AAAA,MACA,qBAAqB,OAAO,QAAQ;AAAA,IACrC,CAAC;AACD,WAAO,EAAE,YAAY,aAAa,OAAO;AAAA,EAC1C,CAAC;AACF;","names":["records","errorMessage","validateSnapshotEveryChanges","statusOf","dataOf"]}

package/dist/chunk-DK554R7P.js

@@ -0,0 +1,67 @@
+// src/protocol/messages.ts
+var SENTINEL = void 0;
+function isInvalidErrorPayload(v) {
+  return v === SENTINEL || typeof v === "boolean";
+}
+function errorPayload(reason, fallback = "error without a valid payload") {
+  return isInvalidErrorPayload(reason) ? new Error(fallback) : reason;
+}
+var TIER_START = 0;
+var TIER_CONTROL = 1;
+var TIER_NOTIFICATION = 2;
+var TIER_VALUE = 3;
+var TIER_SETTLE = 4;
+var TIER_TERMINAL = 5;
+var TIER_TEARDOWN = 6;
+var TIER = {
+  START: TIER_START,
+  PAUSE: TIER_CONTROL,
+  RESUME: TIER_CONTROL,
+  DIRTY: TIER_NOTIFICATION,
+  DATA: TIER_VALUE,
+  RESOLVED: TIER_VALUE,
+  INVALIDATE: TIER_SETTLE,
+  COMPLETE: TIER_TERMINAL,
+  ERROR: TIER_TERMINAL,
+  TEARDOWN: TIER_TEARDOWN
+};
+function messageTier(t) {
+  return TIER[t];
+}
+function isDeferredTier(t) {
+  return TIER[t] >= TIER_VALUE;
+}
+function isValueTier(t) {
+  return TIER[t] === TIER_VALUE;
+}
+function isPauseBufferedTier(t) {
+  const tier = TIER[t];
+  return tier === TIER_VALUE || tier === TIER_SETTLE;
+}
+function isTerminal(t) {
+  return TIER[t] === TIER_TERMINAL;
+}
+function isUpAllowed(t) {
+  const tier = TIER[t];
+  return tier !== TIER_VALUE && tier !== TIER_TERMINAL;
+}
+
+export {
+  SENTINEL,
+  isInvalidErrorPayload,
+  errorPayload,
+  TIER_START,
+  TIER_CONTROL,
+  TIER_NOTIFICATION,
+  TIER_VALUE,
+  TIER_SETTLE,
+  TIER_TERMINAL,
+  TIER_TEARDOWN,
+  messageTier,
+  isDeferredTier,
+  isValueTier,
+  isPauseBufferedTier,
+  isTerminal,
+  isUpAllowed
+};
+//# sourceMappingURL=chunk-DK554R7P.js.map

package/dist/chunk-DK554R7P.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/protocol/messages.ts"],"sourcesContent":["/**\n * Wave-protocol message types and the tier const table.\n *\n * Canonical authority: ~/src/graphrefly/spec/rules.jsonl\n *   R-msg-format, R-msg-closed-set, R-tier (D34), R-data-payload, R-sentinel.\n */\n\n/** Opaque pause-lock identifier (R-pause-lockset). */\nexport type LockId = string | symbol;\n\n/**\n * The CLOSED set of 10 message types (R-msg-closed-set / D9 + START handshake).\n * No open set, no user-defined custom types. Adding a type is a spec change.\n */\nexport type Message =\n\t| readonly [\"START\"]\n\t| readonly [\"DIRTY\"]\n\t| readonly [\"DATA\", unknown]\n\t| readonly [\"RESOLVED\"]\n\t| readonly [\"INVALIDATE\"]\n\t| readonly [\"COMPLETE\"]\n\t| readonly [\"ERROR\", unknown]\n\t| readonly [\"TEARDOWN\"]\n\t| readonly [\"PAUSE\", LockId]\n\t| readonly [\"RESUME\", LockId];\n\n/** One array of messages delivered in one call = one Wave (R-wave-boundary). */\nexport type Wave = readonly Message[];\n\n/** The message-type tag (the first tuple element). */\nexport type MessageType = Message[0];\n\n/**\n * SENTINEL = absence-of-DATA (R-sentinel / D16). TS representation is `undefined`.\n * Never a valid DATA payload; `null` IS a valid DATA value (domain-level absence).\n */\nexport const SENTINEL = undefined;\n\n/** R-data-payload: ERROR payloads must not collide with terminal metadata shorthand. */\nexport function isInvalidErrorPayload(v: unknown): boolean {\n\treturn v === SENTINEL || typeof v === \"boolean\";\n}\n\n/** R-data-payload / D78: host-language failures that collide with ctx.terminal shorthand become diagnostics. */\nexport function errorPayload(reason: unknown, fallback = \"error without a valid payload\"): unknown {\n\treturn isInvalidErrorPayload(reason) ? new Error(fallback) : reason;\n}\n\nexport const TIER_START = 0;\nexport const TIER_CONTROL = 1;\nexport const TIER_NOTIFICATION = 2;\nexport const TIER_VALUE = 3;\nexport const TIER_SETTLE = 4;\nexport const TIER_TERMINAL = 5;\nexport const TIER_TEARDOWN = 6;\n\n/**\n * Tier const table (R-tier / D34). Tiers below value dispatch immediately; value\n * and above are batch-deferred. This is a compile-time const table (D18), not runtime config.\n */\nconst TIER: Record<MessageType, number> = {\n\tSTART: TIER_START,\n\tPAUSE: TIER_CONTROL,\n\tRESUME: TIER_CONTROL,\n\tDIRTY: TIER_NOTIFICATION,\n\tDATA: TIER_VALUE,\n\tRESOLVED: TIER_VALUE,\n\tINVALIDATE: TIER_SETTLE,\n\tCOMPLETE: TIER_TERMINAL,\n\tERROR: TIER_TERMINAL,\n\tTEARDOWN: TIER_TEARDOWN,\n};\n\nexport function messageTier(t: MessageType): number {\n\treturn TIER[t];\n}\n\n/** Value and above are deferred inside a batch (DATA/RESOLVED/INVALIDATE/terminal/teardown). */\nexport function isDeferredTier(t: MessageType): boolean {\n\treturn TIER[t] >= TIER_VALUE;\n}\n\n/** Value-tier messages (DATA/RESOLVED) occupy the tier-3 slot. */\nexport function isValueTier(t: MessageType): boolean {\n\treturn TIER[t] === TIER_VALUE;\n}\n\n/** The pause buffer holds the settle slice only: value-tier DATA/RESOLVED plus INVALIDATE. */\nexport function isPauseBufferedTier(t: MessageType): boolean {\n\tconst tier = TIER[t];\n\treturn tier === TIER_VALUE || tier === TIER_SETTLE;\n}\n\n/**\n * A TERMINAL message = tier 5 (COMPLETE | ERROR), R-tier / D34. Detected via the CENTRAL tier\n * table, NOT a per-variant `=== \"COMPLETE\" || === \"ERROR\"` check — so terminal routing stays\n * driven by the one const table (feedback_use_tier_for_signal_routing); discriminate COMPLETE vs\n * ERROR within the tier by the message type only where the handling actually differs.\n */\nexport function isTerminal(t: MessageType): boolean {\n\treturn TIER[t] === TIER_TERMINAL;\n}\n\n/**\n * ctx.up carries control tiers only (R-ctx-up / DR-5): DIRTY, PAUSE, RESUME,\n * INVALIDATE, TEARDOWN. DATA/RESOLVED (tier 3) and COMPLETE/ERROR (tier 5) are\n * down-only.\n */\nexport function isUpAllowed(t: MessageType): boolean {\n\tconst tier = TIER[t];\n\treturn tier !== TIER_VALUE && tier !== TIER_TERMINAL;\n}\n"],"mappings":";AAoCO,IAAM,WAAW;AAGjB,SAAS,sBAAsB,GAAqB;AAC1D,SAAO,MAAM,YAAY,OAAO,MAAM;AACvC;AAGO,SAAS,aAAa,QAAiB,WAAW,iCAA0C;AAClG,SAAO,sBAAsB,MAAM,IAAI,IAAI,MAAM,QAAQ,IAAI;AAC9D;AAEO,IAAM,aAAa;AACnB,IAAM,eAAe;AACrB,IAAM,oBAAoB;AAC1B,IAAM,aAAa;AACnB,IAAM,cAAc;AACpB,IAAM,gBAAgB;AACtB,IAAM,gBAAgB;AAM7B,IAAM,OAAoC;AAAA,EACzC,OAAO;AAAA,EACP,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,MAAM;AAAA,EACN,UAAU;AAAA,EACV,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,OAAO;AAAA,EACP,UAAU;AACX;AAEO,SAAS,YAAY,GAAwB;AACnD,SAAO,KAAK,CAAC;AACd;AAGO,SAAS,eAAe,GAAyB;AACvD,SAAO,KAAK,CAAC,KAAK;AACnB;AAGO,SAAS,YAAY,GAAyB;AACpD,SAAO,KAAK,CAAC,MAAM;AACpB;AAGO,SAAS,oBAAoB,GAAyB;AAC5D,QAAM,OAAO,KAAK,CAAC;AACnB,SAAO,SAAS,cAAc,SAAS;AACxC;AAQO,SAAS,WAAW,GAAyB;AACnD,SAAO,KAAK,CAAC,MAAM;AACpB;AAOO,SAAS,YAAY,GAAyB;AACpD,QAAM,OAAO,KAAK,CAAC;AACnB,SAAO,SAAS,cAAc,SAAS;AACxC;","names":[]}

package/dist/chunk-DKP56CSW.js

@@ -0,0 +1,322 @@
+import {
+  jsonCodecFor
+} from "./chunk-4VLAQHZI.js";
+
+// src/storage/backend.ts
+var HEX_TABLE = Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, "0"));
+var NAMESPACE_SEPARATOR = "\0";
+function cloneBytes(bytes) {
+  return Uint8Array.from(bytes);
+}
+function encodeNamespacePrefix(namespace) {
+  return namespace.length > 0 ? `${namespace}${NAMESPACE_SEPARATOR}` : "";
+}
+function encodeBytesToHex(bytes) {
+  let out = "";
+  for (const byte of bytes) out += HEX_TABLE[byte];
+  return out;
+}
+function decodeHexToBytes(raw) {
+  if (raw.length % 2 !== 0 || !/^[0-9a-f]*$/i.test(raw)) {
+    throw new TypeError("webStorageBackend: malformed stored bytes");
+  }
+  const out = new Uint8Array(raw.length / 2);
+  for (let i = 0; i < raw.length; i += 2) {
+    const value = Number.parseInt(raw.slice(i, i + 2), 16);
+    if (Number.isNaN(value)) throw new TypeError("webStorageBackend: malformed stored bytes");
+    out[i / 2] = value;
+  }
+  return out;
+}
+function validateLogicalKey(label, key) {
+  if (typeof key !== "string") {
+    throw new TypeError(`${label}: key must be a string`);
+  }
+  if (key.includes(NAMESPACE_SEPARATOR)) {
+    throw new TypeError(`${label}: key must not contain U+0000`);
+  }
+  return key;
+}
+function validateListPrefix(label, prefix) {
+  if (typeof prefix !== "string") {
+    throw new TypeError(`${label}: list prefix must be a string`);
+  }
+  if (prefix.includes(NAMESPACE_SEPARATOR)) {
+    throw new TypeError(`${label}: list prefix must not contain U+0000`);
+  }
+  return prefix;
+}
+function validateNamespace(label, namespace) {
+  if (typeof namespace !== "string") {
+    throw new TypeError(`${label}: namespace must be a string`);
+  }
+  if (namespace.includes(NAMESPACE_SEPARATOR)) {
+    throw new TypeError(`${label}: namespace must not contain U+0000`);
+  }
+  return namespace;
+}
+function hasStoragePutIfAbsent(backend) {
+  return typeof backend.putIfAbsent === "function";
+}
+function requireStoragePutIfAbsent(backend, label = "storage backend") {
+  if (!hasStoragePutIfAbsent(backend)) {
+    throw new Error(`${label}: backend does not support putIfAbsent`);
+  }
+  return backend;
+}
+function hasStorageVersioned(backend) {
+  return typeof backend.getVersioned === "function" && typeof backend.setIfMatch === "function";
+}
+function requireStorageVersioned(backend, label = "storage backend") {
+  if (!hasStorageVersioned(backend)) {
+    throw new Error(`${label}: backend does not support versioned get/set-if-match`);
+  }
+  return backend;
+}
+function toStorageKey(namespace, key) {
+  return `${encodeNamespacePrefix(namespace)}${key}`;
+}
+function enumerateStorageKeys(storage) {
+  if (storage.keys) return [...storage.keys()];
+  if (typeof storage.key === "function" && typeof storage.length === "number") {
+    const keys = [];
+    for (let i = 0; i < storage.length; i += 1) {
+      const key = storage.key(i);
+      if (key !== null && key !== void 0) keys.push(key);
+    }
+    return keys;
+  }
+  const fallback = storage;
+  return Object.keys(fallback).filter((key) => typeof fallback[key] === "string");
+}
+function decodeStorageListKey(namespace, rawKey) {
+  if (typeof rawKey !== "string") {
+    throw new TypeError("webStorageBackend: stored key must be a string");
+  }
+  const prefix = encodeNamespacePrefix(namespace);
+  if (!rawKey.startsWith(prefix)) return void 0;
+  const logical = rawKey.slice(prefix.length);
+  if (logical.includes(NAMESPACE_SEPARATOR)) {
+    throw new TypeError("webStorageBackend: malformed stored key");
+  }
+  return logical;
+}
+function listByPrefix(namespace, prefix, raw) {
+  const out = [];
+  for (const key of raw) {
+    const logical = decodeStorageListKey(namespace, key);
+    if (logical === void 0) continue;
+    if (!logical.startsWith(prefix)) continue;
+    out.push(logical);
+  }
+  out.sort();
+  return out;
+}
+function webStorageBackend(storage, opts = {}) {
+  const namespace = opts.namespace === void 0 ? "" : validateNamespace("webStorageBackend", opts.namespace);
+  return {
+    get(key) {
+      const raw = storage.getItem(
+        toStorageKey(namespace, validateLogicalKey("webStorageBackend", key))
+      );
+      if (raw === null || raw === void 0) return void 0;
+      return decodeHexToBytes(raw);
+    },
+    put(key, value) {
+      storage.setItem(
+        toStorageKey(namespace, validateLogicalKey("webStorageBackend", key)),
+        encodeBytesToHex(cloneBytes(value))
+      );
+    },
+    delete(key) {
+      storage.removeItem(toStorageKey(namespace, validateLogicalKey("webStorageBackend", key)));
+    },
+    list(prefix = "") {
+      return listByPrefix(
+        namespace,
+        validateListPrefix("webStorageBackend", prefix),
+        enumerateStorageKeys(storage)
+      );
+    }
+  };
+}
+var MEMORY_GENERATION = /* @__PURE__ */ Symbol("graphrefly.memoryBackend.generation");
+function memoryGeneration(epoch, key, version) {
+  return Object.freeze({ [MEMORY_GENERATION]: Object.freeze([epoch, key, version]) });
+}
+function readMemoryGeneration(generation) {
+  if (typeof generation !== "object" || generation === null) return void 0;
+  const maybe = generation;
+  const token = maybe[MEMORY_GENERATION];
+  if (Array.isArray(token) && token.length === 3 && typeof token[0] === "number" && typeof token[1] === "string" && typeof token[2] === "number") {
+    return token;
+  }
+  return void 0;
+}
+function memoryBackend(initial = []) {
+  const entries = /* @__PURE__ */ new Map();
+  const versions = /* @__PURE__ */ new Map();
+  let epoch = 0;
+  for (const [key, value] of initial) {
+    entries.set(validateLogicalKey("memoryBackend", key), cloneBytes(value));
+  }
+  const versionOf = (key) => versions.get(key) ?? 0;
+  const bump = (key) => {
+    versions.set(key, versionOf(key) + 1);
+  };
+  return {
+    entries,
+    get(key) {
+      const value = entries.get(validateLogicalKey("memoryBackend", key));
+      return value === void 0 ? void 0 : cloneBytes(value);
+    },
+    put(key, value) {
+      validateLogicalKey("memoryBackend", key);
+      entries.set(key, cloneBytes(value));
+      bump(key);
+    },
+    putIfAbsent(key, value) {
+      validateLogicalKey("memoryBackend", key);
+      if (entries.has(key)) return false;
+      entries.set(key, cloneBytes(value));
+      bump(key);
+      return true;
+    },
+    getVersioned(key) {
+      validateLogicalKey("memoryBackend", key);
+      const value = entries.get(key);
+      const generation = memoryGeneration(epoch, key, versionOf(key));
+      if (value === void 0) return { kind: "miss", generation };
+      return { kind: "hit", value: cloneBytes(value), generation };
+    },
+    setIfMatch(key, value, generation) {
+      validateLogicalKey("memoryBackend", key);
+      const observed = readMemoryGeneration(generation);
+      if (observed === void 0 || observed[0] !== epoch || observed[1] !== key || observed[2] !== versionOf(key)) {
+        return false;
+      }
+      entries.set(key, cloneBytes(value));
+      bump(key);
+      return true;
+    },
+    delete(key) {
+      validateLogicalKey("memoryBackend", key);
+      if (entries.delete(key)) bump(key);
+    },
+    list(prefix = "") {
+      const validatedPrefix = validateListPrefix("memoryBackend", prefix);
+      return [...entries.keys()].filter((key) => key.startsWith(validatedPrefix)).sort();
+    },
+    clear() {
+      entries.clear();
+      versions.clear();
+      epoch += 1;
+    }
+  };
+}
+
+// src/storage/kv.ts
+function hasKvPutIfAbsent(tier) {
+  return typeof tier.putIfAbsent === "function";
+}
+function requireKvPutIfAbsent(tier, label = "kvStorage") {
+  if (!hasKvPutIfAbsent(tier)) {
+    throw new Error(`${label}: KV tier does not support putIfAbsent`);
+  }
+  return tier;
+}
+function hasKvVersioned(tier) {
+  return typeof tier.getVersioned === "function" && typeof tier.setIfMatch === "function";
+}
+function requireKvVersioned(tier, label = "kvStorage") {
+  if (!hasKvVersioned(tier)) {
+    throw new Error(`${label}: KV tier does not support versioned get/set-if-match`);
+  }
+  return tier;
+}
+function defer(fn) {
+  return Promise.resolve().then(fn);
+}
+function kvStorage(opts) {
+  const codec = opts.codec ?? jsonCodecFor();
+  const { backend } = opts;
+  const tier = {
+    get(key) {
+      return defer(() => backend.get(key)).then(
+        (bytes) => bytes === void 0 ? void 0 : codec.decode(bytes)
+      );
+    },
+    set(key, value) {
+      return defer(() => backend.put(key, codec.encode(value))).then(() => void 0);
+    },
+    delete(key) {
+      return defer(() => backend.delete?.(key)).then(() => void 0);
+    },
+    list(prefix = "") {
+      return defer(() => {
+        if (!backend.list) throw new Error("kvStorage.list: backend does not support listing");
+        return backend.list(prefix);
+      }).then((keys) => [...keys].sort());
+    }
+  };
+  let out = tier;
+  if (hasStoragePutIfAbsent(backend)) {
+    out = {
+      ...out,
+      putIfAbsent(key, value) {
+        return defer(() => backend.putIfAbsent(key, codec.encode(value)));
+      }
+    };
+  }
+  if (hasStorageVersioned(backend)) {
+    out = {
+      ...out,
+      getVersioned(key) {
+        return defer(() => backend.getVersioned(key)).then((result) => {
+          if (result.kind === "miss") return { kind: "miss", generation: result.generation };
+          return {
+            kind: "hit",
+            value: codec.decode(result.value),
+            generation: result.generation
+          };
+        });
+      },
+      setIfMatch(key, value, generation) {
+        return defer(() => backend.setIfMatch(key, codec.encode(value), generation));
+      }
+    };
+  }
+  return out;
+}
+function memoryKv(codec = jsonCodecFor()) {
+  return kvStorage({ backend: memoryBackend(), codec });
+}
+function dictKv(entries = {}, codec = jsonCodecFor()) {
+  const backend = memoryBackend();
+  const kv = kvStorage({ backend, codec });
+  for (const [key, value] of Object.entries(entries)) {
+    backend.put(key, codec.encode(value));
+  }
+  return kv;
+}
+function listByPrefix2(tier, prefix = "") {
+  return tier.list(prefix);
+}
+
+export {
+  hasStoragePutIfAbsent,
+  requireStoragePutIfAbsent,
+  hasStorageVersioned,
+  requireStorageVersioned,
+  webStorageBackend,
+  memoryBackend,
+  hasKvPutIfAbsent,
+  requireKvPutIfAbsent,
+  hasKvVersioned,
+  requireKvVersioned,
+  kvStorage,
+  memoryKv,
+  dictKv,
+  listByPrefix2 as listByPrefix
+};
+//# sourceMappingURL=chunk-DKP56CSW.js.map

package/dist/chunk-DKP56CSW.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/storage/backend.ts","../src/storage/kv.ts"],"sourcesContent":["/**\n * Byte storage backends (D82): passive adapter-owned storage, no graph methods.\n */\n\nconst HEX_TABLE = Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, \"0\"));\nconst NAMESPACE_SEPARATOR = \"\\u0000\";\n\nfunction cloneBytes(bytes: Uint8Array): Uint8Array {\n\treturn Uint8Array.from(bytes);\n}\n\nfunction encodeNamespacePrefix(namespace: string): string {\n\treturn namespace.length > 0 ? `${namespace}${NAMESPACE_SEPARATOR}` : \"\";\n}\n\nfunction encodeBytesToHex(bytes: Uint8Array): string {\n\tlet out = \"\";\n\tfor (const byte of bytes) out += HEX_TABLE[byte];\n\treturn out;\n}\n\nfunction decodeHexToBytes(raw: string): Uint8Array {\n\tif (raw.length % 2 !== 0 || !/^[0-9a-f]*$/i.test(raw)) {\n\t\tthrow new TypeError(\"webStorageBackend: malformed stored bytes\");\n\t}\n\tconst out = new Uint8Array(raw.length / 2);\n\tfor (let i = 0; i < raw.length; i += 2) {\n\t\tconst value = Number.parseInt(raw.slice(i, i + 2), 16);\n\t\tif (Number.isNaN(value)) throw new TypeError(\"webStorageBackend: malformed stored bytes\");\n\t\tout[i / 2] = value;\n\t}\n\treturn out;\n}\n\nfunction validateLogicalKey(label: string, key: string): string {\n\tif (typeof key !== \"string\") {\n\t\tthrow new TypeError(`${label}: key must be a string`);\n\t}\n\tif (key.includes(NAMESPACE_SEPARATOR)) {\n\t\tthrow new TypeError(`${label}: key must not contain U+0000`);\n\t}\n\treturn key;\n}\n\nfunction validateListPrefix(label: string, prefix: string): string {\n\tif (typeof prefix !== \"string\") {\n\t\tthrow new TypeError(`${label}: list prefix must be a string`);\n\t}\n\tif (prefix.includes(NAMESPACE_SEPARATOR)) {\n\t\tthrow new TypeError(`${label}: list prefix must not contain U+0000`);\n\t}\n\treturn prefix;\n}\n\nfunction validateNamespace(label: string, namespace: string): string {\n\tif (typeof namespace !== \"string\") {\n\t\tthrow new TypeError(`${label}: namespace must be a string`);\n\t}\n\tif (namespace.includes(NAMESPACE_SEPARATOR)) {\n\t\tthrow new TypeError(`${label}: namespace must not contain U+0000`);\n\t}\n\treturn namespace;\n}\n\n/** Passive byte-addressed backend used by D82 storage binding tiers. */\nexport interface StorageBackend {\n\tget(key: string): undefined | Uint8Array | PromiseLike<undefined | Uint8Array>;\n\tput(key: string, value: Uint8Array): void | PromiseLike<void>;\n\tputIfAbsent?(key: string, value: Uint8Array): boolean | PromiseLike<boolean>;\n\tgetVersioned?(key: string): StorageVersionedRead | PromiseLike<StorageVersionedRead>;\n\tsetIfMatch?(\n\t\tkey: string,\n\t\tvalue: Uint8Array,\n\t\tgeneration: StorageGeneration,\n\t): boolean | PromiseLike<boolean>;\n\tdelete?(key: string): void | PromiseLike<void>;\n\tlist?(prefix?: string): readonly string[] | PromiseLike<readonly string[]>;\n}\n\n/** Passive D85 conditional-create capability for multi-writer storage helpers. */\nexport interface PutIfAbsentStorageBackend extends StorageBackend {\n\tputIfAbsent(key: string, value: Uint8Array): boolean | PromiseLike<boolean>;\n}\n\n/** Opaque D108 per-key generation token for passive storage versioned reads. */\nexport type StorageGeneration = unknown;\n\n/** D108 versioned byte read result with explicit present/absent observations. */\nexport type StorageVersionedRead =\n\t| {\n\t\t\treadonly kind: \"hit\";\n\t\t\treadonly value: Uint8Array;\n\t\t\treadonly generation: StorageGeneration;\n\t  }\n\t| {\n\t\t\treadonly kind: \"miss\";\n\t\t\treadonly generation: StorageGeneration;\n\t  };\n\n/** Passive D108 versioned read + generation-conditional set capability. */\nexport interface VersionedStorageBackend extends StorageBackend {\n\tgetVersioned(key: string): StorageVersionedRead | PromiseLike<StorageVersionedRead>;\n\tsetIfMatch(\n\t\tkey: string,\n\t\tvalue: Uint8Array,\n\t\tgeneration: StorageGeneration,\n\t): boolean | PromiseLike<boolean>;\n}\n\n/** Runtime guard for D85 conditional-create capable byte backends. */\nexport function hasStoragePutIfAbsent(\n\tbackend: StorageBackend,\n): backend is PutIfAbsentStorageBackend {\n\treturn typeof backend.putIfAbsent === \"function\";\n}\n\n/** Require D85 conditional-create support and produce a clear adapter error when absent. */\nexport function requireStoragePutIfAbsent(\n\tbackend: StorageBackend,\n\tlabel = \"storage backend\",\n): PutIfAbsentStorageBackend {\n\tif (!hasStoragePutIfAbsent(backend)) {\n\t\tthrow new Error(`${label}: backend does not support putIfAbsent`);\n\t}\n\treturn backend;\n}\n\n/** Runtime guard for D108 versioned byte backends. */\nexport function hasStorageVersioned(backend: StorageBackend): backend is VersionedStorageBackend {\n\treturn typeof backend.getVersioned === \"function\" && typeof backend.setIfMatch === \"function\";\n}\n\n/** Require D108 versioned support and produce a clear adapter error when absent. */\nexport function requireStorageVersioned(\n\tbackend: StorageBackend,\n\tlabel = \"storage backend\",\n): VersionedStorageBackend {\n\tif (!hasStorageVersioned(backend)) {\n\t\tthrow new Error(`${label}: backend does not support versioned get/set-if-match`);\n\t}\n\treturn backend;\n}\n\n/** Browser/storage-adapter shape for deterministic byte helpers (DOM-free for portability). */\nexport interface WebStorageLike {\n\treadonly length?: number;\n\tgetItem(key: string): string | null | undefined;\n\tsetItem(key: string, value: string): void;\n\tremoveItem(key: string): void;\n\tkey?(index: number): string | null | undefined;\n\tkeys?(): readonly string[];\n}\n\n/** Storage helper options for namespace isolation and logical-key prefixing. */\nexport interface StorageNamespaceOptions {\n\t/**\n\t * Optional namespace for logical keys.\n\t *\n\t * Namespace is part of key mapping only and is not returned from `list()`.\n\t */\n\tnamespace?: string;\n}\n\nfunction toStorageKey(namespace: string, key: string): string {\n\treturn `${encodeNamespacePrefix(namespace)}${key}`;\n}\n\nfunction enumerateStorageKeys(storage: WebStorageLike): readonly unknown[] {\n\tif (storage.keys) return [...storage.keys()];\n\tif (typeof storage.key === \"function\" && typeof storage.length === \"number\") {\n\t\tconst keys: string[] = [];\n\t\tfor (let i = 0; i < storage.length; i += 1) {\n\t\t\tconst key = storage.key(i);\n\t\t\tif (key !== null && key !== undefined) keys.push(key);\n\t\t}\n\t\treturn keys;\n\t}\n\tconst fallback = storage as unknown as Readonly<Record<string, unknown>>;\n\treturn Object.keys(fallback).filter((key) => typeof fallback[key] === \"string\");\n}\n\nfunction decodeStorageListKey(namespace: string, rawKey: unknown): string | undefined {\n\tif (typeof rawKey !== \"string\") {\n\t\tthrow new TypeError(\"webStorageBackend: stored key must be a string\");\n\t}\n\tconst prefix = encodeNamespacePrefix(namespace);\n\tif (!rawKey.startsWith(prefix)) return undefined;\n\tconst logical = rawKey.slice(prefix.length);\n\tif (logical.includes(NAMESPACE_SEPARATOR)) {\n\t\tthrow new TypeError(\"webStorageBackend: malformed stored key\");\n\t}\n\treturn logical;\n}\n\nfunction listByPrefix(namespace: string, prefix: string, raw: readonly unknown[]): string[] {\n\tconst out: string[] = [];\n\tfor (const key of raw) {\n\t\tconst logical = decodeStorageListKey(namespace, key);\n\t\tif (logical === undefined) continue;\n\t\tif (!logical.startsWith(prefix)) continue;\n\t\tout.push(logical);\n\t}\n\tout.sort();\n\treturn out;\n}\n\n/** Build a deterministic byte backend backed by a browser-like key/value store (D103/D82). */\nexport function webStorageBackend(\n\tstorage: WebStorageLike,\n\topts: StorageNamespaceOptions = {},\n): StorageBackend {\n\tconst namespace =\n\t\topts.namespace === undefined ? \"\" : validateNamespace(\"webStorageBackend\", opts.namespace);\n\treturn {\n\t\tget(key) {\n\t\t\tconst raw = storage.getItem(\n\t\t\t\ttoStorageKey(namespace, validateLogicalKey(\"webStorageBackend\", key)),\n\t\t\t);\n\t\t\tif (raw === null || raw === undefined) return undefined;\n\t\t\treturn decodeHexToBytes(raw);\n\t\t},\n\t\tput(key, value) {\n\t\t\tstorage.setItem(\n\t\t\t\ttoStorageKey(namespace, validateLogicalKey(\"webStorageBackend\", key)),\n\t\t\t\tencodeBytesToHex(cloneBytes(value)),\n\t\t\t);\n\t\t},\n\t\tdelete(key) {\n\t\t\tstorage.removeItem(toStorageKey(namespace, validateLogicalKey(\"webStorageBackend\", key)));\n\t\t},\n\t\tlist(prefix = \"\") {\n\t\t\treturn listByPrefix(\n\t\t\t\tnamespace,\n\t\t\t\tvalidateListPrefix(\"webStorageBackend\", prefix),\n\t\t\t\tenumerateStorageKeys(storage),\n\t\t\t);\n\t\t},\n\t};\n}\n\n/** In-memory backend for tests, adapters, and lightweight local storage. */\nexport interface MemoryBackend extends StorageBackend {\n\treadonly entries: ReadonlyMap<string, Uint8Array>;\n\tclear(): void;\n}\n\nconst MEMORY_GENERATION = Symbol(\"graphrefly.memoryBackend.generation\");\n\ninterface MemoryGeneration {\n\treadonly [MEMORY_GENERATION]: readonly [epoch: number, key: string, version: number];\n}\n\nfunction memoryGeneration(epoch: number, key: string, version: number): MemoryGeneration {\n\treturn Object.freeze({ [MEMORY_GENERATION]: Object.freeze([epoch, key, version] as const) });\n}\n\nfunction readMemoryGeneration(\n\tgeneration: StorageGeneration,\n): readonly [epoch: number, key: string, version: number] | undefined {\n\tif (typeof generation !== \"object\" || generation === null) return undefined;\n\tconst maybe = generation as Partial<MemoryGeneration>;\n\tconst token = maybe[MEMORY_GENERATION];\n\tif (\n\t\tArray.isArray(token) &&\n\t\ttoken.length === 3 &&\n\t\ttypeof token[0] === \"number\" &&\n\t\ttypeof token[1] === \"string\" &&\n\t\ttypeof token[2] === \"number\"\n\t) {\n\t\treturn token as readonly [number, string, number];\n\t}\n\treturn undefined;\n}\n\n/** Create a byte-cloning in-memory backend. */\nexport function memoryBackend(\n\tinitial: Iterable<readonly [string, Uint8Array]> = [],\n): MemoryBackend {\n\tconst entries = new Map<string, Uint8Array>();\n\tconst versions = new Map<string, number>();\n\tlet epoch = 0;\n\tfor (const [key, value] of initial) {\n\t\tentries.set(validateLogicalKey(\"memoryBackend\", key), cloneBytes(value));\n\t}\n\tconst versionOf = (key: string): number => versions.get(key) ?? 0;\n\tconst bump = (key: string): void => {\n\t\tversions.set(key, versionOf(key) + 1);\n\t};\n\treturn {\n\t\tentries,\n\t\tget(key) {\n\t\t\tconst value = entries.get(validateLogicalKey(\"memoryBackend\", key));\n\t\t\treturn value === undefined ? undefined : cloneBytes(value);\n\t\t},\n\t\tput(key, value) {\n\t\t\tvalidateLogicalKey(\"memoryBackend\", key);\n\t\t\tentries.set(key, cloneBytes(value));\n\t\t\tbump(key);\n\t\t},\n\t\tputIfAbsent(key, value) {\n\t\t\tvalidateLogicalKey(\"memoryBackend\", key);\n\t\t\tif (entries.has(key)) return false;\n\t\t\tentries.set(key, cloneBytes(value));\n\t\t\tbump(key);\n\t\t\treturn true;\n\t\t},\n\t\tgetVersioned(key) {\n\t\t\tvalidateLogicalKey(\"memoryBackend\", key);\n\t\t\tconst value = entries.get(key);\n\t\t\tconst generation = memoryGeneration(epoch, key, versionOf(key));\n\t\t\tif (value === undefined) return { kind: \"miss\", generation };\n\t\t\treturn { kind: \"hit\", value: cloneBytes(value), generation };\n\t\t},\n\t\tsetIfMatch(key, value, generation) {\n\t\t\tvalidateLogicalKey(\"memoryBackend\", key);\n\t\t\tconst observed = readMemoryGeneration(generation);\n\t\t\tif (\n\t\t\t\tobserved === undefined ||\n\t\t\t\tobserved[0] !== epoch ||\n\t\t\t\tobserved[1] !== key ||\n\t\t\t\tobserved[2] !== versionOf(key)\n\t\t\t) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tentries.set(key, cloneBytes(value));\n\t\t\tbump(key);\n\t\t\treturn true;\n\t\t},\n\t\tdelete(key) {\n\t\t\tvalidateLogicalKey(\"memoryBackend\", key);\n\t\t\tif (entries.delete(key)) bump(key);\n\t\t},\n\t\tlist(prefix = \"\") {\n\t\t\tconst validatedPrefix = validateListPrefix(\"memoryBackend\", prefix);\n\t\t\treturn [...entries.keys()].filter((key) => key.startsWith(validatedPrefix)).sort();\n\t\t},\n\t\tclear() {\n\t\t\tentries.clear();\n\t\t\tversions.clear();\n\t\t\tepoch += 1;\n\t\t},\n\t};\n}\n","import {\n\thasStoragePutIfAbsent,\n\thasStorageVersioned,\n\tmemoryBackend,\n\ttype StorageBackend,\n\ttype StorageGeneration,\n} from \"./backend.js\";\nimport type { Codec } from \"./codec.js\";\nimport { jsonCodecFor } from \"./codec.js\";\n\n/** Codec-backed key/value tier over a passive byte backend (D82). */\nexport interface KvStorageTier<T = unknown> {\n\tget(key: string): Promise<T | undefined>;\n\tset(key: string, value: T): Promise<void>;\n\tputIfAbsent?(key: string, value: T): Promise<boolean>;\n\tgetVersioned?(key: string): Promise<KvVersionedRead<T>>;\n\tsetIfMatch?(key: string, value: T, generation: StorageGeneration): Promise<boolean>;\n\tdelete(key: string): Promise<void>;\n\tlist(prefix?: string): Promise<readonly string[]>;\n}\n\n/** Typed D85 conditional-create capability over a KV tier. */\nexport interface PutIfAbsentKvStorageTier<T = unknown> extends KvStorageTier<T> {\n\tputIfAbsent(key: string, value: T): Promise<boolean>;\n}\n\n/** Opaque D108 per-key generation token for typed KV versioned reads. */\nexport type KvGeneration = StorageGeneration;\n\n/** D108 versioned typed read result with explicit present/absent observations. */\nexport type KvVersionedRead<T> =\n\t| {\n\t\t\treadonly kind: \"hit\";\n\t\t\treadonly value: T;\n\t\t\treadonly generation: KvGeneration;\n\t  }\n\t| {\n\t\t\treadonly kind: \"miss\";\n\t\t\treadonly generation: KvGeneration;\n\t  };\n\n/** Typed D108 versioned read + generation-conditional set capability over a KV tier. */\nexport interface VersionedKvStorageTier<T = unknown> extends KvStorageTier<T> {\n\tgetVersioned(key: string): Promise<KvVersionedRead<T>>;\n\tsetIfMatch(key: string, value: T, generation: KvGeneration): Promise<boolean>;\n}\n\n/** Runtime guard for typed KV tiers that expose D85 conditional create. */\nexport function hasKvPutIfAbsent<T>(tier: KvStorageTier<T>): tier is PutIfAbsentKvStorageTier<T> {\n\treturn typeof tier.putIfAbsent === \"function\";\n}\n\n/** Require D85 conditional-create support and produce a clear adapter error when absent. */\nexport function requireKvPutIfAbsent<T>(\n\ttier: KvStorageTier<T>,\n\tlabel = \"kvStorage\",\n): PutIfAbsentKvStorageTier<T> {\n\tif (!hasKvPutIfAbsent(tier)) {\n\t\tthrow new Error(`${label}: KV tier does not support putIfAbsent`);\n\t}\n\treturn tier;\n}\n\n/** Runtime guard for typed KV tiers that expose D108 versioned read/set-if-match. */\nexport function hasKvVersioned<T>(tier: KvStorageTier<T>): tier is VersionedKvStorageTier<T> {\n\treturn typeof tier.getVersioned === \"function\" && typeof tier.setIfMatch === \"function\";\n}\n\n/** Require D108 versioned KV support and produce a clear adapter error when absent. */\nexport function requireKvVersioned<T>(\n\ttier: KvStorageTier<T>,\n\tlabel = \"kvStorage\",\n): VersionedKvStorageTier<T> {\n\tif (!hasKvVersioned(tier)) {\n\t\tthrow new Error(`${label}: KV tier does not support versioned get/set-if-match`);\n\t}\n\treturn tier;\n}\n\n/** Options for wrapping a byte backend as a typed KV tier. */\nexport interface KvStorageOptions<T> {\n\tbackend: StorageBackend;\n\tcodec?: Codec<T>;\n}\n\nfunction defer<T>(fn: () => T | PromiseLike<T>): Promise<T> {\n\treturn Promise.resolve().then(fn);\n}\n\n/** Build a typed KV tier from a byte backend and codec. */\nexport function kvStorage<T = unknown>(opts: KvStorageOptions<T>): KvStorageTier<T> {\n\tconst codec = opts.codec ?? jsonCodecFor<T>();\n\tconst { backend } = opts;\n\tconst tier: KvStorageTier<T> = {\n\t\tget(key) {\n\t\t\treturn defer(() => backend.get(key)).then((bytes) =>\n\t\t\t\tbytes === undefined ? undefined : codec.decode(bytes),\n\t\t\t);\n\t\t},\n\t\tset(key, value) {\n\t\t\treturn defer(() => backend.put(key, codec.encode(value))).then(() => undefined);\n\t\t},\n\t\tdelete(key) {\n\t\t\treturn defer(() => backend.delete?.(key)).then(() => undefined);\n\t\t},\n\t\tlist(prefix = \"\") {\n\t\t\treturn defer(() => {\n\t\t\t\tif (!backend.list) throw new Error(\"kvStorage.list: backend does not support listing\");\n\t\t\t\treturn backend.list(prefix);\n\t\t\t}).then((keys) => [...keys].sort());\n\t\t},\n\t};\n\tlet out = tier;\n\tif (hasStoragePutIfAbsent(backend)) {\n\t\tout = {\n\t\t\t...out,\n\t\t\tputIfAbsent(key, value) {\n\t\t\t\treturn defer(() => backend.putIfAbsent(key, codec.encode(value)));\n\t\t\t},\n\t\t};\n\t}\n\tif (hasStorageVersioned(backend)) {\n\t\tout = {\n\t\t\t...out,\n\t\t\tgetVersioned(key) {\n\t\t\t\treturn defer(() => backend.getVersioned(key)).then((result) => {\n\t\t\t\t\tif (result.kind === \"miss\") return { kind: \"miss\", generation: result.generation };\n\t\t\t\t\treturn {\n\t\t\t\t\t\tkind: \"hit\",\n\t\t\t\t\t\tvalue: codec.decode(result.value),\n\t\t\t\t\t\tgeneration: result.generation,\n\t\t\t\t\t};\n\t\t\t\t});\n\t\t\t},\n\t\t\tsetIfMatch(key, value, generation) {\n\t\t\t\treturn defer(() => backend.setIfMatch(key, codec.encode(value), generation));\n\t\t\t},\n\t\t};\n\t}\n\treturn out;\n}\n\n/** Create an in-memory typed KV tier. */\nexport function memoryKv<T = unknown>(codec: Codec<T> = jsonCodecFor<T>()): KvStorageTier<T> {\n\treturn kvStorage({ backend: memoryBackend(), codec });\n}\n\n/** Create an in-memory typed KV tier preloaded from a record. */\nexport function dictKv<T = unknown>(\n\tentries: Record<string, T> = {},\n\tcodec: Codec<T> = jsonCodecFor<T>(),\n): KvStorageTier<T> {\n\tconst backend = memoryBackend();\n\tconst kv = kvStorage({ backend, codec });\n\tfor (const [key, value] of Object.entries(entries)) {\n\t\tbackend.put(key, codec.encode(value as T));\n\t}\n\treturn kv;\n}\n\n/** Convenience wrapper for deterministic prefix listing. */\nexport function listByPrefix<T>(tier: KvStorageTier<T>, prefix = \"\"): Promise<readonly string[]> {\n\treturn tier.list(prefix);\n}\n"],"mappings":";;;;;AAIA,IAAM,YAAY,MAAM,KAAK,EAAE,QAAQ,IAAI,GAAG,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AACvF,IAAM,sBAAsB;AAE5B,SAAS,WAAW,OAA+B;AAClD,SAAO,WAAW,KAAK,KAAK;AAC7B;AAEA,SAAS,sBAAsB,WAA2B;AACzD,SAAO,UAAU,SAAS,IAAI,GAAG,SAAS,GAAG,mBAAmB,KAAK;AACtE;AAEA,SAAS,iBAAiB,OAA2B;AACpD,MAAI,MAAM;AACV,aAAW,QAAQ,MAAO,QAAO,UAAU,IAAI;AAC/C,SAAO;AACR;AAEA,SAAS,iBAAiB,KAAyB;AAClD,MAAI,IAAI,SAAS,MAAM,KAAK,CAAC,eAAe,KAAK,GAAG,GAAG;AACtD,UAAM,IAAI,UAAU,2CAA2C;AAAA,EAChE;AACA,QAAM,MAAM,IAAI,WAAW,IAAI,SAAS,CAAC;AACzC,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,GAAG;AACvC,UAAM,QAAQ,OAAO,SAAS,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE;AACrD,QAAI,OAAO,MAAM,KAAK,EAAG,OAAM,IAAI,UAAU,2CAA2C;AACxF,QAAI,IAAI,CAAC,IAAI;AAAA,EACd;AACA,SAAO;AACR;AAEA,SAAS,mBAAmB,OAAe,KAAqB;AAC/D,MAAI,OAAO,QAAQ,UAAU;AAC5B,UAAM,IAAI,UAAU,GAAG,KAAK,wBAAwB;AAAA,EACrD;AACA,MAAI,IAAI,SAAS,mBAAmB,GAAG;AACtC,UAAM,IAAI,UAAU,GAAG,KAAK,+BAA+B;AAAA,EAC5D;AACA,SAAO;AACR;AAEA,SAAS,mBAAmB,OAAe,QAAwB;AAClE,MAAI,OAAO,WAAW,UAAU;AAC/B,UAAM,IAAI,UAAU,GAAG,KAAK,gCAAgC;AAAA,EAC7D;AACA,MAAI,OAAO,SAAS,mBAAmB,GAAG;AACzC,UAAM,IAAI,UAAU,GAAG,KAAK,uCAAuC;AAAA,EACpE;AACA,SAAO;AACR;AAEA,SAAS,kBAAkB,OAAe,WAA2B;AACpE,MAAI,OAAO,cAAc,UAAU;AAClC,UAAM,IAAI,UAAU,GAAG,KAAK,8BAA8B;AAAA,EAC3D;AACA,MAAI,UAAU,SAAS,mBAAmB,GAAG;AAC5C,UAAM,IAAI,UAAU,GAAG,KAAK,qCAAqC;AAAA,EAClE;AACA,SAAO;AACR;AAgDO,SAAS,sBACf,SACuC;AACvC,SAAO,OAAO,QAAQ,gBAAgB;AACvC;AAGO,SAAS,0BACf,SACA,QAAQ,mBACoB;AAC5B,MAAI,CAAC,sBAAsB,OAAO,GAAG;AACpC,UAAM,IAAI,MAAM,GAAG,KAAK,wCAAwC;AAAA,EACjE;AACA,SAAO;AACR;AAGO,SAAS,oBAAoB,SAA6D;AAChG,SAAO,OAAO,QAAQ,iBAAiB,cAAc,OAAO,QAAQ,eAAe;AACpF;AAGO,SAAS,wBACf,SACA,QAAQ,mBACkB;AAC1B,MAAI,CAAC,oBAAoB,OAAO,GAAG;AAClC,UAAM,IAAI,MAAM,GAAG,KAAK,uDAAuD;AAAA,EAChF;AACA,SAAO;AACR;AAsBA,SAAS,aAAa,WAAmB,KAAqB;AAC7D,SAAO,GAAG,sBAAsB,SAAS,CAAC,GAAG,GAAG;AACjD;AAEA,SAAS,qBAAqB,SAA6C;AAC1E,MAAI,QAAQ,KAAM,QAAO,CAAC,GAAG,QAAQ,KAAK,CAAC;AAC3C,MAAI,OAAO,QAAQ,QAAQ,cAAc,OAAO,QAAQ,WAAW,UAAU;AAC5E,UAAM,OAAiB,CAAC;AACxB,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,GAAG;AAC3C,YAAM,MAAM,QAAQ,IAAI,CAAC;AACzB,UAAI,QAAQ,QAAQ,QAAQ,OAAW,MAAK,KAAK,GAAG;AAAA,IACrD;AACA,WAAO;AAAA,EACR;AACA,QAAM,WAAW;AACjB,SAAO,OAAO,KAAK,QAAQ,EAAE,OAAO,CAAC,QAAQ,OAAO,SAAS,GAAG,MAAM,QAAQ;AAC/E;AAEA,SAAS,qBAAqB,WAAmB,QAAqC;AACrF,MAAI,OAAO,WAAW,UAAU;AAC/B,UAAM,IAAI,UAAU,gDAAgD;AAAA,EACrE;AACA,QAAM,SAAS,sBAAsB,SAAS;AAC9C,MAAI,CAAC,OAAO,WAAW,MAAM,EAAG,QAAO;AACvC,QAAM,UAAU,OAAO,MAAM,OAAO,MAAM;AAC1C,MAAI,QAAQ,SAAS,mBAAmB,GAAG;AAC1C,UAAM,IAAI,UAAU,yCAAyC;AAAA,EAC9D;AACA,SAAO;AACR;AAEA,SAAS,aAAa,WAAmB,QAAgB,KAAmC;AAC3F,QAAM,MAAgB,CAAC;AACvB,aAAW,OAAO,KAAK;AACtB,UAAM,UAAU,qBAAqB,WAAW,GAAG;AACnD,QAAI,YAAY,OAAW;AAC3B,QAAI,CAAC,QAAQ,WAAW,MAAM,EAAG;AACjC,QAAI,KAAK,OAAO;AAAA,EACjB;AACA,MAAI,KAAK;AACT,SAAO;AACR;AAGO,SAAS,kBACf,SACA,OAAgC,CAAC,GAChB;AACjB,QAAM,YACL,KAAK,cAAc,SAAY,KAAK,kBAAkB,qBAAqB,KAAK,SAAS;AAC1F,SAAO;AAAA,IACN,IAAI,KAAK;AACR,YAAM,MAAM,QAAQ;AAAA,QACnB,aAAa,WAAW,mBAAmB,qBAAqB,GAAG,CAAC;AAAA,MACrE;AACA,UAAI,QAAQ,QAAQ,QAAQ,OAAW,QAAO;AAC9C,aAAO,iBAAiB,GAAG;AAAA,IAC5B;AAAA,IACA,IAAI,KAAK,OAAO;AACf,cAAQ;AAAA,QACP,aAAa,WAAW,mBAAmB,qBAAqB,GAAG,CAAC;AAAA,QACpE,iBAAiB,WAAW,KAAK,CAAC;AAAA,MACnC;AAAA,IACD;AAAA,IACA,OAAO,KAAK;AACX,cAAQ,WAAW,aAAa,WAAW,mBAAmB,qBAAqB,GAAG,CAAC,CAAC;AAAA,IACzF;AAAA,IACA,KAAK,SAAS,IAAI;AACjB,aAAO;AAAA,QACN;AAAA,QACA,mBAAmB,qBAAqB,MAAM;AAAA,QAC9C,qBAAqB,OAAO;AAAA,MAC7B;AAAA,IACD;AAAA,EACD;AACD;AAQA,IAAM,oBAAoB,uBAAO,qCAAqC;AAMtE,SAAS,iBAAiB,OAAe,KAAa,SAAmC;AACxF,SAAO,OAAO,OAAO,EAAE,CAAC,iBAAiB,GAAG,OAAO,OAAO,CAAC,OAAO,KAAK,OAAO,CAAU,EAAE,CAAC;AAC5F;AAEA,SAAS,qBACR,YACqE;AACrE,MAAI,OAAO,eAAe,YAAY,eAAe,KAAM,QAAO;AAClE,QAAM,QAAQ;AACd,QAAM,QAAQ,MAAM,iBAAiB;AACrC,MACC,MAAM,QAAQ,KAAK,KACnB,MAAM,WAAW,KACjB,OAAO,MAAM,CAAC,MAAM,YACpB,OAAO,MAAM,CAAC,MAAM,YACpB,OAAO,MAAM,CAAC,MAAM,UACnB;AACD,WAAO;AAAA,EACR;AACA,SAAO;AACR;AAGO,SAAS,cACf,UAAmD,CAAC,GACpC;AAChB,QAAM,UAAU,oBAAI,IAAwB;AAC5C,QAAM,WAAW,oBAAI,IAAoB;AACzC,MAAI,QAAQ;AACZ,aAAW,CAAC,KAAK,KAAK,KAAK,SAAS;AACnC,YAAQ,IAAI,mBAAmB,iBAAiB,GAAG,GAAG,WAAW,KAAK,CAAC;AAAA,EACxE;AACA,QAAM,YAAY,CAAC,QAAwB,SAAS,IAAI,GAAG,KAAK;AAChE,QAAM,OAAO,CAAC,QAAsB;AACnC,aAAS,IAAI,KAAK,UAAU,GAAG,IAAI,CAAC;AAAA,EACrC;AACA,SAAO;AAAA,IACN;AAAA,IACA,IAAI,KAAK;AACR,YAAM,QAAQ,QAAQ,IAAI,mBAAmB,iBAAiB,GAAG,CAAC;AAClE,aAAO,UAAU,SAAY,SAAY,WAAW,KAAK;AAAA,IAC1D;AAAA,IACA,IAAI,KAAK,OAAO;AACf,yBAAmB,iBAAiB,GAAG;AACvC,cAAQ,IAAI,KAAK,WAAW,KAAK,CAAC;AAClC,WAAK,GAAG;AAAA,IACT;AAAA,IACA,YAAY,KAAK,OAAO;AACvB,yBAAmB,iBAAiB,GAAG;AACvC,UAAI,QAAQ,IAAI,GAAG,EAAG,QAAO;AAC7B,cAAQ,IAAI,KAAK,WAAW,KAAK,CAAC;AAClC,WAAK,GAAG;AACR,aAAO;AAAA,IACR;AAAA,IACA,aAAa,KAAK;AACjB,yBAAmB,iBAAiB,GAAG;AACvC,YAAM,QAAQ,QAAQ,IAAI,GAAG;AAC7B,YAAM,aAAa,iBAAiB,OAAO,KAAK,UAAU,GAAG,CAAC;AAC9D,UAAI,UAAU,OAAW,QAAO,EAAE,MAAM,QAAQ,WAAW;AAC3D,aAAO,EAAE,MAAM,OAAO,OAAO,WAAW,KAAK,GAAG,WAAW;AAAA,IAC5D;AAAA,IACA,WAAW,KAAK,OAAO,YAAY;AAClC,yBAAmB,iBAAiB,GAAG;AACvC,YAAM,WAAW,qBAAqB,UAAU;AAChD,UACC,aAAa,UACb,SAAS,CAAC,MAAM,SAChB,SAAS,CAAC,MAAM,OAChB,SAAS,CAAC,MAAM,UAAU,GAAG,GAC5B;AACD,eAAO;AAAA,MACR;AACA,cAAQ,IAAI,KAAK,WAAW,KAAK,CAAC;AAClC,WAAK,GAAG;AACR,aAAO;AAAA,IACR;AAAA,IACA,OAAO,KAAK;AACX,yBAAmB,iBAAiB,GAAG;AACvC,UAAI,QAAQ,OAAO,GAAG,EAAG,MAAK,GAAG;AAAA,IAClC;AAAA,IACA,KAAK,SAAS,IAAI;AACjB,YAAM,kBAAkB,mBAAmB,iBAAiB,MAAM;AAClE,aAAO,CAAC,GAAG,QAAQ,KAAK,CAAC,EAAE,OAAO,CAAC,QAAQ,IAAI,WAAW,eAAe,CAAC,EAAE,KAAK;AAAA,IAClF;AAAA,IACA,QAAQ;AACP,cAAQ,MAAM;AACd,eAAS,MAAM;AACf,eAAS;AAAA,IACV;AAAA,EACD;AACD;;;ACtSO,SAAS,iBAAoB,MAA6D;AAChG,SAAO,OAAO,KAAK,gBAAgB;AACpC;AAGO,SAAS,qBACf,MACA,QAAQ,aACsB;AAC9B,MAAI,CAAC,iBAAiB,IAAI,GAAG;AAC5B,UAAM,IAAI,MAAM,GAAG,KAAK,wCAAwC;AAAA,EACjE;AACA,SAAO;AACR;AAGO,SAAS,eAAkB,MAA2D;AAC5F,SAAO,OAAO,KAAK,iBAAiB,cAAc,OAAO,KAAK,eAAe;AAC9E;AAGO,SAAS,mBACf,MACA,QAAQ,aACoB;AAC5B,MAAI,CAAC,eAAe,IAAI,GAAG;AAC1B,UAAM,IAAI,MAAM,GAAG,KAAK,uDAAuD;AAAA,EAChF;AACA,SAAO;AACR;AAQA,SAAS,MAAS,IAA0C;AAC3D,SAAO,QAAQ,QAAQ,EAAE,KAAK,EAAE;AACjC;AAGO,SAAS,UAAuB,MAA6C;AACnF,QAAM,QAAQ,KAAK,SAAS,aAAgB;AAC5C,QAAM,EAAE,QAAQ,IAAI;AACpB,QAAM,OAAyB;AAAA,IAC9B,IAAI,KAAK;AACR,aAAO,MAAM,MAAM,QAAQ,IAAI,GAAG,CAAC,EAAE;AAAA,QAAK,CAAC,UAC1C,UAAU,SAAY,SAAY,MAAM,OAAO,KAAK;AAAA,MACrD;AAAA,IACD;AAAA,IACA,IAAI,KAAK,OAAO;AACf,aAAO,MAAM,MAAM,QAAQ,IAAI,KAAK,MAAM,OAAO,KAAK,CAAC,CAAC,EAAE,KAAK,MAAM,MAAS;AAAA,IAC/E;AAAA,IACA,OAAO,KAAK;AACX,aAAO,MAAM,MAAM,QAAQ,SAAS,GAAG,CAAC,EAAE,KAAK,MAAM,MAAS;AAAA,IAC/D;AAAA,IACA,KAAK,SAAS,IAAI;AACjB,aAAO,MAAM,MAAM;AAClB,YAAI,CAAC,QAAQ,KAAM,OAAM,IAAI,MAAM,kDAAkD;AACrF,eAAO,QAAQ,KAAK,MAAM;AAAA,MAC3B,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC;AAAA,IACnC;AAAA,EACD;AACA,MAAI,MAAM;AACV,MAAI,sBAAsB,OAAO,GAAG;AACnC,UAAM;AAAA,MACL,GAAG;AAAA,MACH,YAAY,KAAK,OAAO;AACvB,eAAO,MAAM,MAAM,QAAQ,YAAY,KAAK,MAAM,OAAO,KAAK,CAAC,CAAC;AAAA,MACjE;AAAA,IACD;AAAA,EACD;AACA,MAAI,oBAAoB,OAAO,GAAG;AACjC,UAAM;AAAA,MACL,GAAG;AAAA,MACH,aAAa,KAAK;AACjB,eAAO,MAAM,MAAM,QAAQ,aAAa,GAAG,CAAC,EAAE,KAAK,CAAC,WAAW;AAC9D,cAAI,OAAO,SAAS,OAAQ,QAAO,EAAE,MAAM,QAAQ,YAAY,OAAO,WAAW;AACjF,iBAAO;AAAA,YACN,MAAM;AAAA,YACN,OAAO,MAAM,OAAO,OAAO,KAAK;AAAA,YAChC,YAAY,OAAO;AAAA,UACpB;AAAA,QACD,CAAC;AAAA,MACF;AAAA,MACA,WAAW,KAAK,OAAO,YAAY;AAClC,eAAO,MAAM,MAAM,QAAQ,WAAW,KAAK,MAAM,OAAO,KAAK,GAAG,UAAU,CAAC;AAAA,MAC5E;AAAA,IACD;AAAA,EACD;AACA,SAAO;AACR;AAGO,SAAS,SAAsB,QAAkB,aAAgB,GAAqB;AAC5F,SAAO,UAAU,EAAE,SAAS,cAAc,GAAG,MAAM,CAAC;AACrD;AAGO,SAAS,OACf,UAA6B,CAAC,GAC9B,QAAkB,aAAgB,GACf;AACnB,QAAM,UAAU,cAAc;AAC9B,QAAM,KAAK,UAAU,EAAE,SAAS,MAAM,CAAC;AACvC,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,OAAO,GAAG;AACnD,YAAQ,IAAI,KAAK,MAAM,OAAO,KAAU,CAAC;AAAA,EAC1C;AACA,SAAO;AACR;AAGO,SAASA,cAAgB,MAAwB,SAAS,IAAgC;AAChG,SAAO,KAAK,KAAK,MAAM;AACxB;","names":["listByPrefix"]}