doxum 0.1.34 → 0.1.36

package/dist/{transform-Bt1Mwgrj.cjs → transform-D45KWMzj.cjs}

@@ -185,6 +185,12 @@ const readNamedDependencyEntries = (dependencies, label) => {
 };
 /** Creates the durable dependency value exposed to pure derive callbacks. */
 const snapshotDependencyValue = (source) => source.kind === "value" ? source.value : snapshotCollectionView(source.read);
+/** Builds the same readonly named value boundary for scalar and keyed pure computations. */
+const snapshotProjectionValues = (names, sources) => {
+	const values = Object.create(null);
+	for (let index = 0; index < names.length; index++) values[names[index]] = snapshotDependencyValue(sources[index]);
+	return Object.freeze(values);
+};
 /** Compiles the shared named Projection dependency declaration contract. */
 const compileProjectionDependencies = (dependencies, label) => {
 	const names = [];
@@ -1275,11 +1281,9 @@ Object.defineProperty(exports, "snapshotCollectionView", {
 		return snapshotCollectionView;
 	}
 });
-Object.defineProperty(exports, "snapshotDependencyValue", {
+Object.defineProperty(exports, "snapshotProjectionValues", {
 	enumerable: true,
 	get: function() {
-		return snapshotDependencyValue;
+		return snapshotProjectionValues;
 	}
 });
-
-//# sourceMappingURL=transform-Bt1Mwgrj.cjs.map

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "doxum",
-  "version": "0.1.34",
+  "version": "0.1.36",
   "private": false,
   "license": "MIT",
   "description": "Doxum is a typed runtime for complex mutable documents.",
@@ -56,7 +56,10 @@
     }
   },
   "files": [
-    "dist",
+    "dist/**/*.js",
+    "dist/**/*.cjs",
+    "dist/**/*.d.ts",
+    "dist/**/*.d.cts",
     "skills"
   ],
   "sideEffects": false,
@@ -79,13 +82,15 @@
     "vitest": "^4.0.16"
   },
   "scripts": {
-    "build": "tsdown --config tsdown.config.ts && node scripts/check-build-exports.mjs && pnpm run check:declaration-portability",
+    "build": "tsdown --config tsdown.config.ts && node scripts/check-build-exports.mjs && pnpm run check:declaration-portability && pnpm run check:package",
+    "build:debug": "tsdown --config tsdown.config.ts --sourcemap --out-dir .debug/dist",
     "typecheck": "tsc -p tsconfig.json --noEmit",
     "test": "vitest run --config vitest.config.ts",
     "check": "pnpm run format:check && pnpm run lint && pnpm run typecheck && pnpm run check:public-types && pnpm run test && pnpm run check:runtime-skill && pnpm run check:projection-surface && pnpm run check:runtime-imports",
     "check:runtime-skill": "node scripts/check-runtime-skill.mjs",
     "check:projection-surface": "node scripts/check-projection-surface.mjs",
     "check:runtime-imports": "node scripts/check-runtime-imports.mjs",
+    "check:package": "node scripts/check-package.mjs",
     "check:public-types": "tsc -p tsconfig.public-api.json --noEmit",
     "check:declaration-portability": "tsc -p tsconfig.declaration-portability.json && node scripts/check-declaration-portability.mjs",
     "bench": "vitest bench --config vitest.bench.config.ts",

package/skills/doxum-runtime/SKILL.md

@@ -44,8 +44,8 @@ Follow these choices unless the requirement says otherwise:
 3. Use `read` for one synchronous document read and `select` for a document `Readable` with dynamic dependency tracking.
 4. Use `observe` to bring a document/readable/external source into the projection graph.
 5. Use named-object `derive` for pure aggregate values.
-6. Use `derive.keyed.from` to turn an ordered scalar/static collection into a keyed projection. Use `derive.keyed.merge` to compose multiple keyed projections; for base + sparse overrides, use `{ conflict: 'last' }`.
-7. Use `derive.keyed` when one keyed source owns output membership/order. Prefer its built-in `keys`, `values`, `entries`, `get`, `from`, `merge`, `subset`, `filter`, `compact`, `groupBy`, `flatMap`, and `singleton` primitives over hand-written incremental collection patches.
+6. Use `derive.keyed.from` to turn an ordered scalar/static collection into a keyed projection. Use `derive.keyed.fromEntries({ inputs }, compute)` when named projections compute a complete keyed result; use `flatMap` when individual keyed parents must recompute independently. Use `derive.keyed.merge` to compose multiple keyed projections; for base + sparse overrides, use `{ conflict: 'last' }`.
+7. Use `derive.keyed` when one keyed source owns output membership/order. Prefer its built-in `keys`, `values`, `entries`, `get`, `from`, `fromEntries`, `merge`, `subset`, `filter`, `compact`, `groupBy`, `flatMap`, and `singleton` primitives over hand-written incremental collection patches.
 8. Express per-output-key joins through `{ source }` for same-key lookup, `{ source, key }` for one mapped key, or `{ source, keys }` for several mapped keys. Let the Runtime own binding and reverse invalidation; do not maintain an application `Map` just to route dependency changes.
 9. Use `runtime.items(keyedProjection)` or `scope.items(...)` for stable per-membership item `Readable`s.
 10. Use `incremental.keyed` for independent retained state per driver key. Use `incremental.collection` or `incremental.group` only when direct incremental output patching or shared retained state is required.

package/skills/doxum-runtime/references/projections.md

@@ -186,6 +186,33 @@ const projectedRows = derive.keyed.from(rowsProjection, row => row.id);
 
 Static outer arrays are shallow-snapshotted when the definition is created, while `keyOf` remains lazy until materialization. A scalar array projection has no per-entry delta, so every scalar publication is scanned. Output publication is still exact: same-key equality-equivalent values retain the previous published value identity, and reorder-only updates publish order without inventing value updates.
 
+### Keyed results from named dependencies
+
+```ts
+const errors = derive.keyed.fromEntries(
+  { form: formState, rules: validationRules },
+  ({ form, rules }) => validateForm(form, rules).map(error => [error.id, error]),
+  (previous, next) => previous.field === next.field && previous.message === next.message
+);
+```
+
+`fromEntries(dependencies, compute, equality?)` accepts the same named projection dependency object as ordinary `derive`. Use `{ source }` even for a single input; `{}` is valid for a constant lazy computation. There is no direct-source or static-array overload. Dependencies are captured at definition time and must be enumerable string-named data properties containing projections. The callback receives readonly named current values; keyed dependency values are durable readonly map snapshots.
+
+Each synchronous computation returns the **complete** finite `readonly (readonly [K, V])[]` result. The tuple order is formal output order; `[]` removes all members. Keys must be unique strings. `[key, undefined]` is a present member. A key missing from the next result is removed. Reordering alone does not invent value updates.
+
+Equality defaults to `Object.is` and compares values under the same key, not the outer array or tuple objects. Equality-equivalent values retain their existing reference; new value objects require stable references or a suitable equality callback. Equality cannot suppress membership/order. Callback failures, thenables, malformed tuples, duplicate keys and equality failures install no partial output and follow normal initialization/processor recovery semantics. Output definitions are lazy, reusable across runtimes and compatible with scopes and `runtime.items()`.
+
+This is **whole-result computation with incremental output publication**. Each necessary evaluation runs the callback for all inputs and scans the old/new result membership, costing O(old result size + new result size), plus callback work and keyed dependency snapshot costs. A keyed dependency is consumed as a whole: `records.get(activeId)` inside the callback does not establish an entry dependency. For precise dynamic lookup, compose the existing scalar lookup first:
+
+```ts
+const record = derive.keyed.get(records, activeId);
+const entries = derive.keyed.fromEntries({ record, settings }, ({ record, settings }) =>
+  record ? buildEntries(record, settings) : []
+);
+```
+
+Use `from` for existing value arrays plus `keyOf`, `fromEntries` to compute a complete keyed result from named inputs, and `flatMap` to recompute only affected parents of a keyed driver. Driver-relative `{ source, key }` / `{ source, keys }` specs do not belong in `fromEntries`. Public Runtime reads inside the callback remain forbidden. Batch reads may advance the computation more than once; notifications and item lifecycle endings still use the final notification boundary.
+
 ### `merge`
 
 ```ts

package/skills/doxum-runtime/references/public-api.md

@@ -320,20 +320,21 @@ The keyed family:
 
 <!-- family:derive.keyed:start -->
 
-| Member      | Purpose                                                          |
-| ----------- | ---------------------------------------------------------------- |
-| `keys`      | Formal ordered membership as a scalar readonly array             |
-| `values`    | Formal ordered values as a scalar readonly array                 |
-| `entries`   | Formal ordered readonly `[key,value]` tuples                     |
-| `get`       | Scalar dynamic lookup into one current keyed entry               |
-| `from`      | Ordered scalar/static collection → keyed projection              |
-| `merge`     | Multiple keyed projections → union with explicit conflict policy |
-| `flatMap`   | Ordered pure one-to-many keyed expansion                         |
-| `groupBy`   | One-to-many reverse index                                        |
-| `singleton` | Optional scalar → zero-or-one keyed projection                   |
-| `subset`    | Externally ordered keyed subset                                  |
-| `filter`    | Predicate-controlled membership preserving source values         |
-| `compact`   | Map values while dropping `undefined` results                    |
+| Member        | Purpose                                                          |
+| ------------- | ---------------------------------------------------------------- |
+| `keys`        | Formal ordered membership as a scalar readonly array             |
+| `values`      | Formal ordered values as a scalar readonly array                 |
+| `entries`     | Formal ordered readonly `[key,value]` tuples                     |
+| `get`         | Scalar dynamic lookup into one current keyed entry               |
+| `fromEntries` | Named projection dependencies → complete ordered keyed result    |
+| `from`        | Ordered scalar/static collection → keyed projection              |
+| `merge`       | Multiple keyed projections → union with explicit conflict policy |
+| `flatMap`     | Ordered pure one-to-many keyed expansion                         |
+| `groupBy`     | One-to-many reverse index                                        |
+| `singleton`   | Optional scalar → zero-or-one keyed projection                   |
+| `subset`      | Externally ordered keyed subset                                  |
+| `filter`      | Predicate-controlled membership preserving source values         |
+| `compact`     | Map values while dropping `undefined` results                    |
 
 <!-- family:derive.keyed:end -->
 
@@ -347,6 +348,8 @@ derive.keyed.entries(source): Projection<readonly (readonly [K,V])[]>
 derive.keyed.get(source, keyProjection, equality?): Projection<V | undefined>
 derive.keyed.from(source: Projection<readonly V[]>, keyOf, equality?): KeyedProjection<K,V>
 derive.keyed.from(source: readonly V[], keyOf, equality?): KeyedProjection<K,V>
+derive.keyed.fromEntries(dependencies, compute, equality?): KeyedProjection<K,V>
+// compute(readonlyNamedValues) returns Synchronous<readonly (readonly [K,V])[]>
 derive.keyed.merge(sources, { conflict: 'error' | 'first' | 'last', equality? }): KeyedProjection<K,V>
 derive.keyed.merge(sources, { conflict: 'resolve', resolve, equality? }): KeyedProjection<K,V>
 derive.keyed.subset(source, orderedKeysOrProjection): KeyedProjection<K,V>
@@ -364,6 +367,8 @@ derive.keyed.singleton(sourceProjection, keyOf, equality?): KeyedProjection<K,V>
 
 `from` uses `keyOf(value)` as member identity and preserves the input array's formal order. Duplicate keys are processor errors; there is no silent first/last overwrite. Static arrays are shallow-snapshotted at definition creation while `keyOf` remains lazy. For a scalar array projection, each scalar publication is scanned because the source has no per-entry delta. Equality defaults to `Object.is`; an equality-equivalent value under the same key retains the previous published value identity.
 
+`fromEntries` accepts the same named projection object as `derive`, including `{}` and keyed projections. Single inputs use `{ source }`; direct-source, static-array and driver-relative dependency specs are not overloads. The callback receives readonly named values and returns the complete ordered tuple array synchronously. Empty arrays mean no members; missing keys are removed; present `undefined` is valid. Duplicate string keys, malformed tuples and callback/equality failures follow processor error/recovery rules without partial installation. Per-entry equality defaults to `Object.is` and retains equivalent value references without suppressing membership or order. Computation scans the complete old/new result, while downstream publication is incremental. A keyed dependency is a whole collection, not automatically tracked by `get`; compose `derive.keyed.get` for precise scalar lookup. See [Projections](projections.md#keyed-results-from-named-dependencies) for lifecycle, cost and examples.
+
 `merge` has union membership and requires an explicit conflict policy. `first` and `last` use source-list priority. `error` rejects overlapping keys. `resolve` calls `resolve(contributions, key)` only for keys with two or more current contributions; contributions are ordered by source priority and have `{ sourceIndex, value }`. A single contribution passes through unchanged. The source list is fixed at definition time.
 
 Merged formal order is always `stableUnique(S0.ids() ++ S1.ids() ++ ... ++ Sn.ids())`, independent of which source supplies the effective value. Therefore `derive.keyed.merge([base, overrides], { conflict: 'last' })` is the standard base + sparse-override composition: override values win for shared keys without moving their base positions; override-only keys are included after earlier-source first occurrences. Removing an override does not end the merged membership lifecycle while another source still contains the key.

package/skills/doxum-runtime/references/recipes.md

@@ -556,3 +556,26 @@ const labels = derive.keyed(lines, line => line.label);
 ```
 
 Choose globally unique child IDs or an unambiguous composite encoding. A parent-based composite key intentionally changes identity when its parent changes. Duplicate final keys fail rather than overwrite. Use `[]` for no children and `[key, undefined]` for a present undefined child. For retained R-tree/search-index state, continue using advanced processors rather than building state into a flatMap selector.
+
+## Form errors from several current inputs
+
+```ts
+const form = input({ title: '', required: true });
+const submitted = input(false);
+const errors = derive.keyed.fromEntries(
+  { form, submitted },
+  ({ form, submitted }) =>
+    submitted && form.required && !form.title.trim()
+      ? [['title.required', { field: 'title', message: 'Title is required' }]]
+      : [],
+  (before, after) => before.field === after.field && before.message === after.message
+);
+const runtime = createProjectionRuntime();
+const errorItems = runtime.items(errors);
+runtime.batch(() => {
+  runtime.update(submitted, true);
+  runtime.read(errors); // current keyed result; notifications remain deferred
+});
+```
+
+The error key is stable across value changes. Each computation returns all current errors, and equality preserves unchanged error objects. For a single source still use `{ form }`. Do not wrap all inputs in a scalar `derive` just to feed `fromEntries`. For per-record expansion over a large keyed form collection use `flatMap`; for an active record use `derive.keyed.get(records, activeId)` as a named input. Do not expect entry-level dependency tracking from arbitrary map lookups inside this callback.

package/dist/advanced.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"advanced.cjs","names":["collectionView","isPlainObject","compileProjectionDependencies","defineProcessor","createKeyedTransform"],"sources":["../core/src/projection/advanced.ts"],"sourcesContent":["import { collectionView } from '@/projection/collection/view';\nimport type { CollectionChange, CollectionDraft, CollectionRead, SourceContext } from './contract';\nimport type {\n  KeyedProjection,\n  OutputDefinition,\n  OutputEvaluation,\n  Projection,\n  ProjectionChange,\n} from './definition';\nimport { defineProcessor } from './definition';\nimport { compileProjectionDependencies } from './dependency';\nimport { assertSynchronous } from '@/projection/graph/scheduler';\nimport { isPlainObject } from '@/value/record';\nimport type {\n  KeyedDependencies,\n  KeyedDependencyRecord,\n  KeyedDependencyValues,\n} from '@/projection/keyed/dependency';\nimport { createKeyedTransform } from '@/projection/keyed/transform';\n\ntype ProjectionDependencies = Readonly<Record<string, Projection<unknown>>>;\n\ntype ProjectionValues<D extends ProjectionDependencies> = {\n  readonly [K in keyof D]: D[K] extends Projection<infer T> ? T : never;\n};\n\ntype ProjectionChanges<D extends ProjectionDependencies> = {\n  readonly [K in keyof D]: ProjectionChange<D[K]> extends undefined\n    ? undefined\n    : ProjectionChange<D[K]> | undefined;\n};\n\ntype RetainedStateContext<State> = [State] extends [never] ? {} : { readonly state: State };\ntype RetainedStateDefinition<State> = [State] extends [never]\n  ? { readonly state?: never }\n  : { readonly state: () => State };\n\nexport type IncrementalValueContext<D extends ProjectionDependencies, T, State = never> = {\n  readonly values: ProjectionValues<D>;\n  readonly changes: ProjectionChanges<D>;\n  readonly previous: T | undefined;\n  readonly reset: boolean;\n  readonly cause: unknown;\n} & RetainedStateContext<State>;\n\nexport type IncrementalValueDefinition<D extends ProjectionDependencies, T, State = never> = {\n  readonly process: (context: IncrementalValueContext<D, T, State>) => T;\n} & RetainedStateDefinition<State>;\n\nexport type IncrementalCollectionContext<\n  D extends ProjectionDependencies,\n  K extends string,\n  V,\n  State = never,\n> = {\n  readonly values: ProjectionValues<D>;\n  readonly changes: ProjectionChanges<D>;\n  readonly previous: CollectionRead<K, V>;\n  readonly next: CollectionRead<K, V>;\n  readonly reset: boolean;\n  readonly cause: unknown;\n  readonly output: CollectionDraft<K, V>;\n} & RetainedStateContext<State>;\n\nexport type IncrementalCollectionDefinition<\n  D extends ProjectionDependencies,\n  K extends string,\n  V,\n  State = never,\n> = {\n  readonly process: (context: IncrementalCollectionContext<D, K, V, State>) => void;\n} & RetainedStateDefinition<State>;\n\nexport type IncrementalKeyedContext<K extends string, V, D extends object, State = never> = {\n  readonly key: K;\n  readonly value: V;\n  readonly dependencies: KeyedDependencyValues<D>;\n  readonly reset: boolean;\n  readonly cause: unknown;\n} & RetainedStateContext<State>;\n\nexport type IncrementalKeyedDefinition<K extends string, V, D extends object, T, State = never> = {\n  readonly equality?: (previous: T, next: T) => boolean;\n  readonly process: (context: IncrementalKeyedContext<K, V, D, State>) => T;\n} & ([State] extends [never]\n  ? { readonly state?: never }\n  : { readonly state: (value: V, key: K) => State });\n\ndeclare const groupOutput: unique symbol;\n\n/** Type-only declaration token used by incremental.group output builders. */\nexport type IncrementalGroupOutput<P extends Projection<unknown>> = {\n  readonly [groupOutput]: P;\n};\n\ntype GroupOutputShape = {\n  readonly [name: string]: IncrementalGroupOutput<Projection<unknown>> | GroupOutputShape;\n};\n\ntype GroupOutputBuilder = {\n  collection<K extends string, V>(\n    equality?: (previous: V, next: V) => boolean\n  ): IncrementalGroupOutput<KeyedProjection<K, V>>;\n  value<T>(equality?: (previous: T, next: T) => boolean): IncrementalGroupOutput<Projection<T>>;\n};\n\n/** Portable projection tree returned from an incremental.group declaration. */\nexport type IncrementalGroupResult<O> =\n  O extends IncrementalGroupOutput<infer P>\n    ? P\n    : O extends Readonly<Record<string, unknown>>\n      ? { readonly [K in keyof O]: IncrementalGroupResult<O[K]> }\n      : never;\n\ntype GroupReads<O> =\n  O extends IncrementalGroupOutput<infer P>\n    ? P extends KeyedProjection<infer K, infer V>\n      ? CollectionRead<K, V>\n      : P extends Projection<infer T>\n        ? T | undefined\n        : never\n    : { readonly [K in keyof O]: GroupReads<O[K]> };\n\ntype GroupDrafts<O> =\n  O extends IncrementalGroupOutput<infer P>\n    ? P extends KeyedProjection<infer K, infer V>\n      ? CollectionDraft<K, V>\n      : P extends Projection<infer T>\n        ? { set(value: T): void }\n        : never\n    : { readonly [K in keyof O]: GroupDrafts<O[K]> };\n\nexport type IncrementalGroupContext<\n  D extends ProjectionDependencies,\n  O extends GroupOutputShape,\n  State = never,\n> = {\n  readonly values: ProjectionValues<D>;\n  readonly changes: ProjectionChanges<D>;\n  readonly previous: GroupReads<O>;\n  readonly next: GroupReads<O>;\n  readonly output: GroupDrafts<O>;\n  readonly reset: boolean;\n  readonly cause: unknown;\n} & RetainedStateContext<State>;\n\ntype IncrementalGroupDefinition<\n  D extends ProjectionDependencies,\n  O extends GroupOutputShape,\n  State = never,\n> = {\n  readonly output: (define: GroupOutputBuilder) => O;\n  readonly process: (context: IncrementalGroupContext<D, O, State>) => void;\n} & RetainedStateDefinition<State>;\n\nconst resetCollectionChange = Object.freeze({ kind: 'reset' as const });\n\nconst publicValue = (source: SourceContext): unknown =>\n  source.kind === 'value' ? source.value : collectionView(source.read);\n\nconst publicInputs = (\n  sources: readonly SourceContext[],\n  names: readonly string[],\n  reset: boolean\n): {\n  readonly values: Readonly<Record<string, unknown>>;\n  readonly changes: Readonly<Record<string, unknown>>;\n} => {\n  const values: Record<string, unknown> = Object.create(null) as Record<string, unknown>;\n  const changes: Record<string, unknown> = Object.create(null) as Record<string, unknown>;\n  for (let index = 0; index < names.length; index++) {\n    const source = sources[index];\n    values[names[index]] = publicValue(source);\n    changes[names[index]] =\n      source.kind === 'collection' ? (reset ? resetCollectionChange : source.change) : undefined;\n  }\n  return Object.freeze({ values: Object.freeze(values), changes: Object.freeze(changes) });\n};\n\nfunction validateDefinition(\n  definition: unknown,\n  allowed: readonly string[],\n  label: string\n): asserts definition is Record<string, unknown> {\n  if (!isPlainObject(definition))\n    throw new TypeError(`${label} definition must be a plain object.`);\n  const allowedKeys = new Set(allowed);\n  for (const key of Reflect.ownKeys(definition)) {\n    if (typeof key !== 'string' || !allowedKeys.has(key))\n      throw new TypeError(`${label} definition contains an unknown property.`);\n    const descriptor = Object.getOwnPropertyDescriptor(definition, key);\n    if (!descriptor?.enumerable || !('value' in descriptor))\n      throw new TypeError(`${label} definition must contain enumerable data properties.`);\n  }\n}\n\nconst validateRetainedState = (definition: Record<string, unknown>, label: string): void => {\n  if (\n    Object.prototype.hasOwnProperty.call(definition, 'state') &&\n    typeof definition.state !== 'function'\n  )\n    throw new TypeError(`${label} state must be a function when provided.`);\n};\n\nconst initializeRetainedState = (definition: {\n  readonly state?: () => unknown;\n}): Readonly<Record<string, unknown>> => {\n  if (definition.state === undefined) return Object.freeze({});\n  const state = definition.state();\n  assertSynchronous(state);\n  return Object.freeze({ state });\n};\n\ntype RuntimeIncrementalDefinition<Result> = {\n  readonly state?: () => unknown;\n  readonly process: (context: never) => Result;\n};\n\nfunction createIncrementalValue<const D extends ProjectionDependencies, T>(\n  dependencies: D,\n  definition: IncrementalValueDefinition<D, T>\n): Projection<T>;\nfunction createIncrementalValue<const D extends ProjectionDependencies, T, State>(\n  dependencies: D,\n  definition: {\n    readonly state: () => State;\n    readonly process: (context: IncrementalValueContext<D, T, State>) => T;\n  }\n): Projection<T>;\nfunction createIncrementalValue<const D extends ProjectionDependencies, T>(\n  dependencies: D,\n  definition: RuntimeIncrementalDefinition<T>\n): Projection<T> {\n  const compiled = compileProjectionDependencies(dependencies, 'Incremental');\n  validateDefinition(definition, ['state', 'process'], 'Incremental value');\n  validateRetainedState(definition, 'Incremental value');\n  if (typeof definition.process !== 'function')\n    throw new TypeError('Incremental value definition requires a process function.');\n  const [projection] = defineProcessor({\n    dependencies: compiled.projections,\n    outputs: [{ kind: 'value', equality: Object.is }],\n    create: () => {\n      const state = initializeRetainedState(definition);\n      return {\n        evaluate: evaluation => {\n          const output = evaluation.outputs[0];\n          if (output.kind !== 'value') throw new Error('Incremental value output is invalid.');\n          const publicInput = publicInputs(evaluation.sources, compiled.names, evaluation.reset);\n          const result = definition.process({\n            values: publicInput.values as ProjectionValues<D>,\n            changes: publicInput.changes as ProjectionChanges<D>,\n            previous: output.previous as T | undefined,\n            reset: evaluation.reset,\n            cause: evaluation.cause,\n            ...state,\n          } as never);\n          assertSynchronous(result);\n          output.output.set(result);\n        },\n      };\n    },\n  });\n  return projection as Projection<T>;\n}\n\nfunction createIncrementalCollection<const D extends ProjectionDependencies, K extends string, V>(\n  dependencies: D,\n  definition: IncrementalCollectionDefinition<D, K, V>\n): KeyedProjection<K, V>;\nfunction createIncrementalCollection<\n  const D extends ProjectionDependencies,\n  K extends string,\n  V,\n  State,\n>(\n  dependencies: D,\n  definition: {\n    readonly state: () => State;\n    readonly process: (context: IncrementalCollectionContext<D, K, V, State>) => void;\n  }\n): KeyedProjection<K, V>;\nfunction createIncrementalCollection<const D extends ProjectionDependencies, K extends string, V>(\n  dependencies: D,\n  definition: RuntimeIncrementalDefinition<void>\n): KeyedProjection<K, V> {\n  const compiled = compileProjectionDependencies(dependencies, 'Incremental');\n  validateDefinition(definition, ['state', 'process'], 'Incremental collection');\n  validateRetainedState(definition, 'Incremental collection');\n  if (typeof definition.process !== 'function')\n    throw new TypeError('Incremental collection definition requires a process function.');\n  const [projection] = defineProcessor({\n    dependencies: compiled.projections,\n    outputs: [{ kind: 'collection', equality: Object.is }],\n    create: () => {\n      const state = initializeRetainedState(definition);\n      return {\n        evaluate: evaluation => {\n          const output = evaluation.outputs[0];\n          if (output.kind !== 'collection')\n            throw new Error('Incremental collection output is invalid.');\n          const publicInput = publicInputs(evaluation.sources, compiled.names, evaluation.reset);\n          const result = definition.process({\n            values: publicInput.values as ProjectionValues<D>,\n            changes: publicInput.changes as ProjectionChanges<D>,\n            previous: output.previous as CollectionRead<K, V>,\n            next: output.next as CollectionRead<K, V>,\n            reset: evaluation.reset,\n            cause: evaluation.cause,\n            output: output.output as CollectionDraft<K, V>,\n            ...state,\n          } as never);\n          assertSynchronous(result);\n        },\n      };\n    },\n  });\n  return projection as KeyedProjection<K, V>;\n}\n\nfunction createIncrementalKeyed<K extends string, V, const D extends object, T, State>(\n  driver: KeyedProjection<K, V>,\n  dependencies: D & KeyedDependencies<NoInfer<K>, NoInfer<V>, D>,\n  definition: {\n    readonly state: (value: NoInfer<V>, key: NoInfer<K>) => State;\n    readonly equality?: (previous: T, next: T) => boolean;\n    readonly process: (context: IncrementalKeyedContext<NoInfer<K>, NoInfer<V>, D, State>) => T;\n  }\n): KeyedProjection<K, T>;\nfunction createIncrementalKeyed<K extends string, V, const D extends object, T>(\n  driver: KeyedProjection<K, V>,\n  dependencies: D & KeyedDependencies<NoInfer<K>, NoInfer<V>, D>,\n  definition: {\n    readonly equality?: (previous: T, next: T) => boolean;\n    readonly process: (context: IncrementalKeyedContext<NoInfer<K>, NoInfer<V>, D>) => T;\n  }\n): KeyedProjection<K, T>;\nfunction createIncrementalKeyed<K extends string, V, T>(\n  driver: KeyedProjection<K, V>,\n  dependencies: KeyedDependencyRecord<K, V>,\n  definition: {\n    readonly state?: (value: V, key: K) => unknown;\n    readonly equality?: (previous: T, next: T) => boolean;\n    readonly process: (context: never) => T;\n  }\n): KeyedProjection<K, T> {\n  validateDefinition(definition, ['state', 'equality', 'process'], 'Incremental keyed');\n  if (definition.state !== undefined && typeof definition.state !== 'function')\n    throw new TypeError('Incremental keyed state must be a function when provided.');\n  if (definition.equality !== undefined && typeof definition.equality !== 'function')\n    throw new TypeError('Incremental keyed equality must be a function when provided.');\n  if (typeof definition.process !== 'function')\n    throw new TypeError('Incremental keyed definition requires a process function.');\n\n  return createKeyedTransform<K, V, T, unknown>({\n    source: driver,\n    dependencies,\n    equality: definition.equality,\n    name: 'incremental.keyed',\n    ...(definition.state ? { state: definition.state } : {}),\n    evaluate: ({ key, value, dependencies: values, state, reset, cause }) =>\n      definition.process({\n        key,\n        value,\n        dependencies: values,\n        reset,\n        cause,\n        ...(definition.state ? { state } : {}),\n      } as never),\n  });\n}\n\ntype GroupShape = number | { readonly [key: string]: GroupShape };\ntype GroupOutputMetadata = {\n  readonly kind: OutputDefinition['kind'];\n  readonly equality: (a: unknown, b: unknown) => boolean;\n};\n\nconst isPlainGroupNamespace = (\n  value: unknown,\n  metadata: ReadonlyMap<object, GroupOutputMetadata>\n): value is Record<string, unknown> => isPlainObject(value) && !metadata.has(value);\n\nconst compileGroupShape = (\n  value: unknown,\n  path: readonly string[],\n  metadata: ReadonlyMap<object, GroupOutputMetadata>,\n  used: Set<object>,\n  outputs: OutputDefinition[]\n): GroupShape => {\n  if (value !== null && typeof value === 'object') {\n    const output = metadata.get(value);\n    if (output) {\n      if (used.has(value)) throw new TypeError('An incremental group output cannot be reused.');\n      used.add(value);\n      const index = outputs.length;\n      outputs.push({\n        kind: output.kind,\n        equality: output.equality,\n        path: Object.freeze([...path]),\n      });\n      return index;\n    }\n  }\n  if (!isPlainGroupNamespace(value, metadata))\n    throw new TypeError('Incremental group outputs must be a static object tree.');\n  for (const key of Reflect.ownKeys(value)) {\n    if (typeof key !== 'string')\n      throw new TypeError('Incremental group output names must be strings.');\n    if (!Object.prototype.propertyIsEnumerable.call(value, key))\n      throw new TypeError('Incremental group namespaces must contain enumerable properties.');\n  }\n  const keys = Object.keys(value);\n  if (!keys.length) throw new TypeError('Incremental group namespaces cannot be empty.');\n  const result: Record<string, GroupShape> = Object.create(null) as Record<string, GroupShape>;\n  for (const key of keys) {\n    if (key === '__proto__' || key === 'prototype' || key === 'constructor')\n      throw new TypeError(`Invalid incremental group output name: ${key}`);\n    const descriptor = Object.getOwnPropertyDescriptor(value, key);\n    if (!descriptor || !('value' in descriptor))\n      throw new TypeError('Incremental group namespaces cannot contain accessors.');\n    result[key] = compileGroupShape(descriptor.value, [...path, key], metadata, used, outputs);\n  }\n  return Object.freeze(result);\n};\n\nconst hydrateGroupShape = <T>(shape: GroupShape, values: readonly T[]): unknown => {\n  if (typeof shape === 'number') return values[shape];\n  const result: Record<string, unknown> = {};\n  for (const [key, child] of Object.entries(shape)) result[key] = hydrateGroupShape(child, values);\n  return Object.freeze(result);\n};\n\nconst hydrateGroupReads = (\n  shape: GroupShape,\n  outputs: readonly OutputEvaluation[],\n  next: boolean\n): unknown => {\n  if (typeof shape === 'number') {\n    const output = outputs[shape];\n    return next && output.kind === 'value' ? output.next() : next ? output.next : output.previous;\n  }\n  const result: Record<string, unknown> = {};\n  for (const [key, child] of Object.entries(shape)) {\n    if (typeof child === 'number' && next && outputs[child].kind === 'value') {\n      Object.defineProperty(result, key, {\n        enumerable: true,\n        configurable: false,\n        get: () => (outputs[child] as Extract<OutputEvaluation, { kind: 'value' }>).next(),\n      });\n    } else result[key] = hydrateGroupReads(child, outputs, next);\n  }\n  return Object.freeze(result);\n};\n\nfunction createIncrementalGroup<\n  const D extends ProjectionDependencies,\n  const O extends GroupOutputShape,\n>(dependencies: D, definition: IncrementalGroupDefinition<D, O>): IncrementalGroupResult<O>;\nfunction createIncrementalGroup<\n  const D extends ProjectionDependencies,\n  const O extends GroupOutputShape,\n  State,\n>(\n  dependencies: D,\n  definition: {\n    readonly output: (define: GroupOutputBuilder) => O;\n    readonly state: () => State;\n    readonly process: (context: IncrementalGroupContext<D, O, State>) => void;\n  }\n): IncrementalGroupResult<O>;\nfunction createIncrementalGroup<\n  const D extends ProjectionDependencies,\n  const O extends GroupOutputShape,\n>(\n  dependencies: D,\n  definition: RuntimeIncrementalDefinition<void> & {\n    readonly output: (define: GroupOutputBuilder) => O;\n  }\n): IncrementalGroupResult<O> {\n  const compiled = compileProjectionDependencies(dependencies, 'Incremental');\n  validateDefinition(definition, ['output', 'state', 'process'], 'Incremental group');\n  validateRetainedState(definition, 'Incremental group');\n  if (typeof definition.output !== 'function' || typeof definition.process !== 'function')\n    throw new TypeError('Incremental group definition requires output and process functions.');\n\n  let active = true;\n  const metadata = new Map<object, GroupOutputMetadata>();\n  const defineOutput: GroupOutputBuilder = {\n    collection: <K extends string, V>(equality: (previous: V, next: V) => boolean = Object.is) => {\n      if (!active) throw new TypeError('Incremental group output declarations are synchronous.');\n      const descriptor = Object.freeze({});\n      metadata.set(descriptor, {\n        kind: 'collection',\n        equality: equality as (a: unknown, b: unknown) => boolean,\n      });\n      return descriptor as IncrementalGroupOutput<KeyedProjection<K, V>>;\n    },\n    value: <T>(equality: (previous: T, next: T) => boolean = Object.is) => {\n      if (!active) throw new TypeError('Incremental group output declarations are synchronous.');\n      const descriptor = Object.freeze({});\n      metadata.set(descriptor, {\n        kind: 'value',\n        equality: equality as (a: unknown, b: unknown) => boolean,\n      });\n      return descriptor as IncrementalGroupOutput<Projection<T>>;\n    },\n  };\n  const declared = definition.output(defineOutput);\n  assertSynchronous(declared);\n  active = false;\n  const outputs: OutputDefinition[] = [];\n  const used = new Set<object>();\n  const shape = compileGroupShape(declared, [], metadata, used, outputs);\n  if (typeof shape === 'number')\n    throw new TypeError('Incremental group declarations must return an output namespace.');\n  if (used.size === 0 || used.size !== metadata.size)\n    throw new TypeError('Every incremental group output must be returned by the declaration.');\n\n  const projections = defineProcessor({\n    dependencies: compiled.projections,\n    outputs,\n    create: () => {\n      const state = initializeRetainedState(definition);\n      return {\n        evaluate: evaluation => {\n          const publicInput = publicInputs(evaluation.sources, compiled.names, evaluation.reset);\n          const result = definition.process({\n            values: publicInput.values as ProjectionValues<D>,\n            changes: publicInput.changes as ProjectionChanges<D>,\n            previous: hydrateGroupReads(shape, evaluation.outputs, false) as GroupReads<O>,\n            next: hydrateGroupReads(shape, evaluation.outputs, true) as GroupReads<O>,\n            output: hydrateGroupShape(\n              shape,\n              evaluation.outputs.map(output => output.output)\n            ) as GroupDrafts<O>,\n            reset: evaluation.reset,\n            cause: evaluation.cause,\n            ...state,\n          } as never);\n          assertSynchronous(result);\n        },\n      };\n    },\n    name: `processor-group:${outputs.map(output => output.path?.join('.') ?? '').join(',')}`,\n  });\n  return hydrateGroupShape(shape, projections) as IncrementalGroupResult<O>;\n}\n\nexport const incremental = Object.assign(createIncrementalValue, {\n  collection: createIncrementalCollection,\n  keyed: createIncrementalKeyed,\n  group: createIncrementalGroup,\n});\n\nexport { collectionChange } from '@/projection/collection/change';\nexport type { CollectionChange } from './contract';\n"],"mappings":";;;;AA2JA,MAAM,wBAAwB,OAAO,OAAO,EAAE,MAAM,SAAkB,CAAC;AAEvE,MAAM,eAAe,WACnB,OAAO,SAAS,UAAU,OAAO,QAAQA,kBAAAA,eAAe,OAAO,KAAK;AAEtE,MAAM,gBACJ,SACA,OACA,UAIG;CACH,MAAM,SAAkC,OAAO,OAAO,KAAK;CAC3D,MAAM,UAAmC,OAAO,OAAO,KAAK;AAC5D,MAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;EACjD,MAAM,SAAS,QAAQ;AACvB,SAAO,MAAM,UAAU,YAAY,OAAO;AAC1C,UAAQ,MAAM,UACZ,OAAO,SAAS,eAAgB,QAAQ,wBAAwB,OAAO,SAAU,KAAA;;AAErF,QAAO,OAAO,OAAO;EAAE,QAAQ,OAAO,OAAO,OAAO;EAAE,SAAS,OAAO,OAAO,QAAQ;EAAE,CAAC;;AAG1F,SAAS,mBACP,YACA,SACA,OAC+C;AAC/C,KAAI,CAACC,eAAAA,cAAc,WAAW,CAC5B,OAAM,IAAI,UAAU,GAAG,MAAM,qCAAqC;CACpE,MAAM,cAAc,IAAI,IAAI,QAAQ;AACpC,MAAK,MAAM,OAAO,QAAQ,QAAQ,WAAW,EAAE;AAC7C,MAAI,OAAO,QAAQ,YAAY,CAAC,YAAY,IAAI,IAAI,CAClD,OAAM,IAAI,UAAU,GAAG,MAAM,2CAA2C;EAC1E,MAAM,aAAa,OAAO,yBAAyB,YAAY,IAAI;AACnE,MAAI,CAAC,YAAY,cAAc,EAAE,WAAW,YAC1C,OAAM,IAAI,UAAU,GAAG,MAAM,sDAAsD;;;AAIzF,MAAM,yBAAyB,YAAqC,UAAwB;AAC1F,KACE,OAAO,UAAU,eAAe,KAAK,YAAY,QAAQ,IACzD,OAAO,WAAW,UAAU,WAE5B,OAAM,IAAI,UAAU,GAAG,MAAM,0CAA0C;;AAG3E,MAAM,2BAA2B,eAEQ;AACvC,KAAI,WAAW,UAAU,KAAA,EAAW,QAAO,OAAO,OAAO,EAAE,CAAC;CAC5D,MAAM,QAAQ,WAAW,OAAO;AAChC,mBAAA,kBAAkB,MAAM;AACxB,QAAO,OAAO,OAAO,EAAE,OAAO,CAAC;;AAmBjC,SAAS,uBACP,cACA,YACe;CACf,MAAM,WAAWC,kBAAAA,8BAA8B,cAAc,cAAc;AAC3E,oBAAmB,YAAY,CAAC,SAAS,UAAU,EAAE,oBAAoB;AACzE,uBAAsB,YAAY,oBAAoB;AACtD,KAAI,OAAO,WAAW,YAAY,WAChC,OAAM,IAAI,UAAU,4DAA4D;CAClF,MAAM,CAAC,cAAcC,kBAAAA,gBAAgB;EACnC,cAAc,SAAS;EACvB,SAAS,CAAC;GAAE,MAAM;GAAS,UAAU,OAAO;GAAI,CAAC;EACjD,cAAc;GACZ,MAAM,QAAQ,wBAAwB,WAAW;AACjD,UAAO,EACL,WAAU,eAAc;IACtB,MAAM,SAAS,WAAW,QAAQ;AAClC,QAAI,OAAO,SAAS,QAAS,OAAM,IAAI,MAAM,uCAAuC;IACpF,MAAM,cAAc,aAAa,WAAW,SAAS,SAAS,OAAO,WAAW,MAAM;IACtF,MAAM,SAAS,WAAW,QAAQ;KAChC,QAAQ,YAAY;KACpB,SAAS,YAAY;KACrB,UAAU,OAAO;KACjB,OAAO,WAAW;KAClB,OAAO,WAAW;KAClB,GAAG;KACJ,CAAU;AACX,sBAAA,kBAAkB,OAAO;AACzB,WAAO,OAAO,IAAI,OAAO;MAE5B;;EAEJ,CAAC;AACF,QAAO;;AAmBT,SAAS,4BACP,cACA,YACuB;CACvB,MAAM,WAAWD,kBAAAA,8BAA8B,cAAc,cAAc;AAC3E,oBAAmB,YAAY,CAAC,SAAS,UAAU,EAAE,yBAAyB;AAC9E,uBAAsB,YAAY,yBAAyB;AAC3D,KAAI,OAAO,WAAW,YAAY,WAChC,OAAM,IAAI,UAAU,iEAAiE;CACvF,MAAM,CAAC,cAAcC,kBAAAA,gBAAgB;EACnC,cAAc,SAAS;EACvB,SAAS,CAAC;GAAE,MAAM;GAAc,UAAU,OAAO;GAAI,CAAC;EACtD,cAAc;GACZ,MAAM,QAAQ,wBAAwB,WAAW;AACjD,UAAO,EACL,WAAU,eAAc;IACtB,MAAM,SAAS,WAAW,QAAQ;AAClC,QAAI,OAAO,SAAS,aAClB,OAAM,IAAI,MAAM,4CAA4C;IAC9D,MAAM,cAAc,aAAa,WAAW,SAAS,SAAS,OAAO,WAAW,MAAM;AAWtF,sBAAA,kBAVe,WAAW,QAAQ;KAChC,QAAQ,YAAY;KACpB,SAAS,YAAY;KACrB,UAAU,OAAO;KACjB,MAAM,OAAO;KACb,OAAO,WAAW;KAClB,OAAO,WAAW;KAClB,QAAQ,OAAO;KACf,GAAG;KACJ,CACuB,CAAC;MAE5B;;EAEJ,CAAC;AACF,QAAO;;AAoBT,SAAS,uBACP,QACA,cACA,YAKuB;AACvB,oBAAmB,YAAY;EAAC;EAAS;EAAY;EAAU,EAAE,oBAAoB;AACrF,KAAI,WAAW,UAAU,KAAA,KAAa,OAAO,WAAW,UAAU,WAChE,OAAM,IAAI,UAAU,4DAA4D;AAClF,KAAI,WAAW,aAAa,KAAA,KAAa,OAAO,WAAW,aAAa,WACtE,OAAM,IAAI,UAAU,+DAA+D;AACrF,KAAI,OAAO,WAAW,YAAY,WAChC,OAAM,IAAI,UAAU,4DAA4D;AAElF,QAAOC,kBAAAA,qBAAuC;EAC5C,QAAQ;EACR;EACA,UAAU,WAAW;EACrB,MAAM;EACN,GAAI,WAAW,QAAQ,EAAE,OAAO,WAAW,OAAO,GAAG,EAAE;EACvD,WAAW,EAAE,KAAK,OAAO,cAAc,QAAQ,OAAO,OAAO,YAC3D,WAAW,QAAQ;GACjB;GACA;GACA,cAAc;GACd;GACA;GACA,GAAI,WAAW,QAAQ,EAAE,OAAO,GAAG,EAAE;GACtC,CAAU;EACd,CAAC;;AASJ,MAAM,yBACJ,OACA,aACqCH,eAAAA,cAAc,MAAM,IAAI,CAAC,SAAS,IAAI,MAAM;AAEnF,MAAM,qBACJ,OACA,MACA,UACA,MACA,YACe;AACf,KAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;EAC/C,MAAM,SAAS,SAAS,IAAI,MAAM;AAClC,MAAI,QAAQ;AACV,OAAI,KAAK,IAAI,MAAM,CAAE,OAAM,IAAI,UAAU,gDAAgD;AACzF,QAAK,IAAI,MAAM;GACf,MAAM,QAAQ,QAAQ;AACtB,WAAQ,KAAK;IACX,MAAM,OAAO;IACb,UAAU,OAAO;IACjB,MAAM,OAAO,OAAO,CAAC,GAAG,KAAK,CAAC;IAC/B,CAAC;AACF,UAAO;;;AAGX,KAAI,CAAC,sBAAsB,OAAO,SAAS,CACzC,OAAM,IAAI,UAAU,0DAA0D;AAChF,MAAK,MAAM,OAAO,QAAQ,QAAQ,MAAM,EAAE;AACxC,MAAI,OAAO,QAAQ,SACjB,OAAM,IAAI,UAAU,kDAAkD;AACxE,MAAI,CAAC,OAAO,UAAU,qBAAqB,KAAK,OAAO,IAAI,CACzD,OAAM,IAAI,UAAU,mEAAmE;;CAE3F,MAAM,OAAO,OAAO,KAAK,MAAM;AAC/B,KAAI,CAAC,KAAK,OAAQ,OAAM,IAAI,UAAU,gDAAgD;CACtF,MAAM,SAAqC,OAAO,OAAO,KAAK;AAC9D,MAAK,MAAM,OAAO,MAAM;AACtB,MAAI,QAAQ,eAAe,QAAQ,eAAe,QAAQ,cACxD,OAAM,IAAI,UAAU,0CAA0C,MAAM;EACtE,MAAM,aAAa,OAAO,yBAAyB,OAAO,IAAI;AAC9D,MAAI,CAAC,cAAc,EAAE,WAAW,YAC9B,OAAM,IAAI,UAAU,yDAAyD;AAC/E,SAAO,OAAO,kBAAkB,WAAW,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,UAAU,MAAM,QAAQ;;AAE5F,QAAO,OAAO,OAAO,OAAO;;AAG9B,MAAM,qBAAwB,OAAmB,WAAkC;AACjF,KAAI,OAAO,UAAU,SAAU,QAAO,OAAO;CAC7C,MAAM,SAAkC,EAAE;AAC1C,MAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,CAAE,QAAO,OAAO,kBAAkB,OAAO,OAAO;AAChG,QAAO,OAAO,OAAO,OAAO;;AAG9B,MAAM,qBACJ,OACA,SACA,SACY;AACZ,KAAI,OAAO,UAAU,UAAU;EAC7B,MAAM,SAAS,QAAQ;AACvB,SAAO,QAAQ,OAAO,SAAS,UAAU,OAAO,MAAM,GAAG,OAAO,OAAO,OAAO,OAAO;;CAEvF,MAAM,SAAkC,EAAE;AAC1C,MAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,CAC9C,KAAI,OAAO,UAAU,YAAY,QAAQ,QAAQ,OAAO,SAAS,QAC/D,QAAO,eAAe,QAAQ,KAAK;EACjC,YAAY;EACZ,cAAc;EACd,WAAY,QAAQ,OAAwD,MAAM;EACnF,CAAC;KACG,QAAO,OAAO,kBAAkB,OAAO,SAAS,KAAK;AAE9D,QAAO,OAAO,OAAO,OAAO;;AAmB9B,SAAS,uBAIP,cACA,YAG2B;CAC3B,MAAM,WAAWC,kBAAAA,8BAA8B,cAAc,cAAc;AAC3E,oBAAmB,YAAY;EAAC;EAAU;EAAS;EAAU,EAAE,oBAAoB;AACnF,uBAAsB,YAAY,oBAAoB;AACtD,KAAI,OAAO,WAAW,WAAW,cAAc,OAAO,WAAW,YAAY,WAC3E,OAAM,IAAI,UAAU,sEAAsE;CAE5F,IAAI,SAAS;CACb,MAAM,2BAAW,IAAI,KAAkC;CAqBvD,MAAM,WAAW,WAAW,OAAO;EAnBjC,aAAkC,WAA8C,OAAO,OAAO;AAC5F,OAAI,CAAC,OAAQ,OAAM,IAAI,UAAU,yDAAyD;GAC1F,MAAM,aAAa,OAAO,OAAO,EAAE,CAAC;AACpC,YAAS,IAAI,YAAY;IACvB,MAAM;IACI;IACX,CAAC;AACF,UAAO;;EAET,QAAW,WAA8C,OAAO,OAAO;AACrE,OAAI,CAAC,OAAQ,OAAM,IAAI,UAAU,yDAAyD;GAC1F,MAAM,aAAa,OAAO,OAAO,EAAE,CAAC;AACpC,YAAS,IAAI,YAAY;IACvB,MAAM;IACI;IACX,CAAC;AACF,UAAO;;EAGoC,CAAC;AAChD,mBAAA,kBAAkB,SAAS;AAC3B,UAAS;CACT,MAAM,UAA8B,EAAE;CACtC,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,QAAQ,kBAAkB,UAAU,EAAE,EAAE,UAAU,MAAM,QAAQ;AACtE,KAAI,OAAO,UAAU,SACnB,OAAM,IAAI,UAAU,kEAAkE;AACxF,KAAI,KAAK,SAAS,KAAK,KAAK,SAAS,SAAS,KAC5C,OAAM,IAAI,UAAU,sEAAsE;AA6B5F,QAAO,kBAAkB,OA3BLC,kBAAAA,gBAAgB;EAClC,cAAc,SAAS;EACvB;EACA,cAAc;GACZ,MAAM,QAAQ,wBAAwB,WAAW;AACjD,UAAO,EACL,WAAU,eAAc;IACtB,MAAM,cAAc,aAAa,WAAW,SAAS,SAAS,OAAO,WAAW,MAAM;AActF,sBAAA,kBAbe,WAAW,QAAQ;KAChC,QAAQ,YAAY;KACpB,SAAS,YAAY;KACrB,UAAU,kBAAkB,OAAO,WAAW,SAAS,MAAM;KAC7D,MAAM,kBAAkB,OAAO,WAAW,SAAS,KAAK;KACxD,QAAQ,kBACN,OACA,WAAW,QAAQ,KAAI,WAAU,OAAO,OAAO,CAChD;KACD,OAAO,WAAW;KAClB,OAAO,WAAW;KAClB,GAAG;KACJ,CACuB,CAAC;MAE5B;;EAEH,MAAM,mBAAmB,QAAQ,KAAI,WAAU,OAAO,MAAM,KAAK,IAAI,IAAI,GAAG,CAAC,KAAK,IAAI;EACvF,CAC0C,CAAC;;AAG9C,MAAa,cAAc,OAAO,OAAO,wBAAwB;CAC/D,YAAY;CACZ,OAAO;CACP,OAAO;CACR,CAAC"}

package/dist/advanced.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"advanced.js","names":[],"sources":["../core/src/projection/advanced.ts"],"sourcesContent":["import { collectionView } from '@/projection/collection/view';\nimport type { CollectionChange, CollectionDraft, CollectionRead, SourceContext } from './contract';\nimport type {\n  KeyedProjection,\n  OutputDefinition,\n  OutputEvaluation,\n  Projection,\n  ProjectionChange,\n} from './definition';\nimport { defineProcessor } from './definition';\nimport { compileProjectionDependencies } from './dependency';\nimport { assertSynchronous } from '@/projection/graph/scheduler';\nimport { isPlainObject } from '@/value/record';\nimport type {\n  KeyedDependencies,\n  KeyedDependencyRecord,\n  KeyedDependencyValues,\n} from '@/projection/keyed/dependency';\nimport { createKeyedTransform } from '@/projection/keyed/transform';\n\ntype ProjectionDependencies = Readonly<Record<string, Projection<unknown>>>;\n\ntype ProjectionValues<D extends ProjectionDependencies> = {\n  readonly [K in keyof D]: D[K] extends Projection<infer T> ? T : never;\n};\n\ntype ProjectionChanges<D extends ProjectionDependencies> = {\n  readonly [K in keyof D]: ProjectionChange<D[K]> extends undefined\n    ? undefined\n    : ProjectionChange<D[K]> | undefined;\n};\n\ntype RetainedStateContext<State> = [State] extends [never] ? {} : { readonly state: State };\ntype RetainedStateDefinition<State> = [State] extends [never]\n  ? { readonly state?: never }\n  : { readonly state: () => State };\n\nexport type IncrementalValueContext<D extends ProjectionDependencies, T, State = never> = {\n  readonly values: ProjectionValues<D>;\n  readonly changes: ProjectionChanges<D>;\n  readonly previous: T | undefined;\n  readonly reset: boolean;\n  readonly cause: unknown;\n} & RetainedStateContext<State>;\n\nexport type IncrementalValueDefinition<D extends ProjectionDependencies, T, State = never> = {\n  readonly process: (context: IncrementalValueContext<D, T, State>) => T;\n} & RetainedStateDefinition<State>;\n\nexport type IncrementalCollectionContext<\n  D extends ProjectionDependencies,\n  K extends string,\n  V,\n  State = never,\n> = {\n  readonly values: ProjectionValues<D>;\n  readonly changes: ProjectionChanges<D>;\n  readonly previous: CollectionRead<K, V>;\n  readonly next: CollectionRead<K, V>;\n  readonly reset: boolean;\n  readonly cause: unknown;\n  readonly output: CollectionDraft<K, V>;\n} & RetainedStateContext<State>;\n\nexport type IncrementalCollectionDefinition<\n  D extends ProjectionDependencies,\n  K extends string,\n  V,\n  State = never,\n> = {\n  readonly process: (context: IncrementalCollectionContext<D, K, V, State>) => void;\n} & RetainedStateDefinition<State>;\n\nexport type IncrementalKeyedContext<K extends string, V, D extends object, State = never> = {\n  readonly key: K;\n  readonly value: V;\n  readonly dependencies: KeyedDependencyValues<D>;\n  readonly reset: boolean;\n  readonly cause: unknown;\n} & RetainedStateContext<State>;\n\nexport type IncrementalKeyedDefinition<K extends string, V, D extends object, T, State = never> = {\n  readonly equality?: (previous: T, next: T) => boolean;\n  readonly process: (context: IncrementalKeyedContext<K, V, D, State>) => T;\n} & ([State] extends [never]\n  ? { readonly state?: never }\n  : { readonly state: (value: V, key: K) => State });\n\ndeclare const groupOutput: unique symbol;\n\n/** Type-only declaration token used by incremental.group output builders. */\nexport type IncrementalGroupOutput<P extends Projection<unknown>> = {\n  readonly [groupOutput]: P;\n};\n\ntype GroupOutputShape = {\n  readonly [name: string]: IncrementalGroupOutput<Projection<unknown>> | GroupOutputShape;\n};\n\ntype GroupOutputBuilder = {\n  collection<K extends string, V>(\n    equality?: (previous: V, next: V) => boolean\n  ): IncrementalGroupOutput<KeyedProjection<K, V>>;\n  value<T>(equality?: (previous: T, next: T) => boolean): IncrementalGroupOutput<Projection<T>>;\n};\n\n/** Portable projection tree returned from an incremental.group declaration. */\nexport type IncrementalGroupResult<O> =\n  O extends IncrementalGroupOutput<infer P>\n    ? P\n    : O extends Readonly<Record<string, unknown>>\n      ? { readonly [K in keyof O]: IncrementalGroupResult<O[K]> }\n      : never;\n\ntype GroupReads<O> =\n  O extends IncrementalGroupOutput<infer P>\n    ? P extends KeyedProjection<infer K, infer V>\n      ? CollectionRead<K, V>\n      : P extends Projection<infer T>\n        ? T | undefined\n        : never\n    : { readonly [K in keyof O]: GroupReads<O[K]> };\n\ntype GroupDrafts<O> =\n  O extends IncrementalGroupOutput<infer P>\n    ? P extends KeyedProjection<infer K, infer V>\n      ? CollectionDraft<K, V>\n      : P extends Projection<infer T>\n        ? { set(value: T): void }\n        : never\n    : { readonly [K in keyof O]: GroupDrafts<O[K]> };\n\nexport type IncrementalGroupContext<\n  D extends ProjectionDependencies,\n  O extends GroupOutputShape,\n  State = never,\n> = {\n  readonly values: ProjectionValues<D>;\n  readonly changes: ProjectionChanges<D>;\n  readonly previous: GroupReads<O>;\n  readonly next: GroupReads<O>;\n  readonly output: GroupDrafts<O>;\n  readonly reset: boolean;\n  readonly cause: unknown;\n} & RetainedStateContext<State>;\n\ntype IncrementalGroupDefinition<\n  D extends ProjectionDependencies,\n  O extends GroupOutputShape,\n  State = never,\n> = {\n  readonly output: (define: GroupOutputBuilder) => O;\n  readonly process: (context: IncrementalGroupContext<D, O, State>) => void;\n} & RetainedStateDefinition<State>;\n\nconst resetCollectionChange = Object.freeze({ kind: 'reset' as const });\n\nconst publicValue = (source: SourceContext): unknown =>\n  source.kind === 'value' ? source.value : collectionView(source.read);\n\nconst publicInputs = (\n  sources: readonly SourceContext[],\n  names: readonly string[],\n  reset: boolean\n): {\n  readonly values: Readonly<Record<string, unknown>>;\n  readonly changes: Readonly<Record<string, unknown>>;\n} => {\n  const values: Record<string, unknown> = Object.create(null) as Record<string, unknown>;\n  const changes: Record<string, unknown> = Object.create(null) as Record<string, unknown>;\n  for (let index = 0; index < names.length; index++) {\n    const source = sources[index];\n    values[names[index]] = publicValue(source);\n    changes[names[index]] =\n      source.kind === 'collection' ? (reset ? resetCollectionChange : source.change) : undefined;\n  }\n  return Object.freeze({ values: Object.freeze(values), changes: Object.freeze(changes) });\n};\n\nfunction validateDefinition(\n  definition: unknown,\n  allowed: readonly string[],\n  label: string\n): asserts definition is Record<string, unknown> {\n  if (!isPlainObject(definition))\n    throw new TypeError(`${label} definition must be a plain object.`);\n  const allowedKeys = new Set(allowed);\n  for (const key of Reflect.ownKeys(definition)) {\n    if (typeof key !== 'string' || !allowedKeys.has(key))\n      throw new TypeError(`${label} definition contains an unknown property.`);\n    const descriptor = Object.getOwnPropertyDescriptor(definition, key);\n    if (!descriptor?.enumerable || !('value' in descriptor))\n      throw new TypeError(`${label} definition must contain enumerable data properties.`);\n  }\n}\n\nconst validateRetainedState = (definition: Record<string, unknown>, label: string): void => {\n  if (\n    Object.prototype.hasOwnProperty.call(definition, 'state') &&\n    typeof definition.state !== 'function'\n  )\n    throw new TypeError(`${label} state must be a function when provided.`);\n};\n\nconst initializeRetainedState = (definition: {\n  readonly state?: () => unknown;\n}): Readonly<Record<string, unknown>> => {\n  if (definition.state === undefined) return Object.freeze({});\n  const state = definition.state();\n  assertSynchronous(state);\n  return Object.freeze({ state });\n};\n\ntype RuntimeIncrementalDefinition<Result> = {\n  readonly state?: () => unknown;\n  readonly process: (context: never) => Result;\n};\n\nfunction createIncrementalValue<const D extends ProjectionDependencies, T>(\n  dependencies: D,\n  definition: IncrementalValueDefinition<D, T>\n): Projection<T>;\nfunction createIncrementalValue<const D extends ProjectionDependencies, T, State>(\n  dependencies: D,\n  definition: {\n    readonly state: () => State;\n    readonly process: (context: IncrementalValueContext<D, T, State>) => T;\n  }\n): Projection<T>;\nfunction createIncrementalValue<const D extends ProjectionDependencies, T>(\n  dependencies: D,\n  definition: RuntimeIncrementalDefinition<T>\n): Projection<T> {\n  const compiled = compileProjectionDependencies(dependencies, 'Incremental');\n  validateDefinition(definition, ['state', 'process'], 'Incremental value');\n  validateRetainedState(definition, 'Incremental value');\n  if (typeof definition.process !== 'function')\n    throw new TypeError('Incremental value definition requires a process function.');\n  const [projection] = defineProcessor({\n    dependencies: compiled.projections,\n    outputs: [{ kind: 'value', equality: Object.is }],\n    create: () => {\n      const state = initializeRetainedState(definition);\n      return {\n        evaluate: evaluation => {\n          const output = evaluation.outputs[0];\n          if (output.kind !== 'value') throw new Error('Incremental value output is invalid.');\n          const publicInput = publicInputs(evaluation.sources, compiled.names, evaluation.reset);\n          const result = definition.process({\n            values: publicInput.values as ProjectionValues<D>,\n            changes: publicInput.changes as ProjectionChanges<D>,\n            previous: output.previous as T | undefined,\n            reset: evaluation.reset,\n            cause: evaluation.cause,\n            ...state,\n          } as never);\n          assertSynchronous(result);\n          output.output.set(result);\n        },\n      };\n    },\n  });\n  return projection as Projection<T>;\n}\n\nfunction createIncrementalCollection<const D extends ProjectionDependencies, K extends string, V>(\n  dependencies: D,\n  definition: IncrementalCollectionDefinition<D, K, V>\n): KeyedProjection<K, V>;\nfunction createIncrementalCollection<\n  const D extends ProjectionDependencies,\n  K extends string,\n  V,\n  State,\n>(\n  dependencies: D,\n  definition: {\n    readonly state: () => State;\n    readonly process: (context: IncrementalCollectionContext<D, K, V, State>) => void;\n  }\n): KeyedProjection<K, V>;\nfunction createIncrementalCollection<const D extends ProjectionDependencies, K extends string, V>(\n  dependencies: D,\n  definition: RuntimeIncrementalDefinition<void>\n): KeyedProjection<K, V> {\n  const compiled = compileProjectionDependencies(dependencies, 'Incremental');\n  validateDefinition(definition, ['state', 'process'], 'Incremental collection');\n  validateRetainedState(definition, 'Incremental collection');\n  if (typeof definition.process !== 'function')\n    throw new TypeError('Incremental collection definition requires a process function.');\n  const [projection] = defineProcessor({\n    dependencies: compiled.projections,\n    outputs: [{ kind: 'collection', equality: Object.is }],\n    create: () => {\n      const state = initializeRetainedState(definition);\n      return {\n        evaluate: evaluation => {\n          const output = evaluation.outputs[0];\n          if (output.kind !== 'collection')\n            throw new Error('Incremental collection output is invalid.');\n          const publicInput = publicInputs(evaluation.sources, compiled.names, evaluation.reset);\n          const result = definition.process({\n            values: publicInput.values as ProjectionValues<D>,\n            changes: publicInput.changes as ProjectionChanges<D>,\n            previous: output.previous as CollectionRead<K, V>,\n            next: output.next as CollectionRead<K, V>,\n            reset: evaluation.reset,\n            cause: evaluation.cause,\n            output: output.output as CollectionDraft<K, V>,\n            ...state,\n          } as never);\n          assertSynchronous(result);\n        },\n      };\n    },\n  });\n  return projection as KeyedProjection<K, V>;\n}\n\nfunction createIncrementalKeyed<K extends string, V, const D extends object, T, State>(\n  driver: KeyedProjection<K, V>,\n  dependencies: D & KeyedDependencies<NoInfer<K>, NoInfer<V>, D>,\n  definition: {\n    readonly state: (value: NoInfer<V>, key: NoInfer<K>) => State;\n    readonly equality?: (previous: T, next: T) => boolean;\n    readonly process: (context: IncrementalKeyedContext<NoInfer<K>, NoInfer<V>, D, State>) => T;\n  }\n): KeyedProjection<K, T>;\nfunction createIncrementalKeyed<K extends string, V, const D extends object, T>(\n  driver: KeyedProjection<K, V>,\n  dependencies: D & KeyedDependencies<NoInfer<K>, NoInfer<V>, D>,\n  definition: {\n    readonly equality?: (previous: T, next: T) => boolean;\n    readonly process: (context: IncrementalKeyedContext<NoInfer<K>, NoInfer<V>, D>) => T;\n  }\n): KeyedProjection<K, T>;\nfunction createIncrementalKeyed<K extends string, V, T>(\n  driver: KeyedProjection<K, V>,\n  dependencies: KeyedDependencyRecord<K, V>,\n  definition: {\n    readonly state?: (value: V, key: K) => unknown;\n    readonly equality?: (previous: T, next: T) => boolean;\n    readonly process: (context: never) => T;\n  }\n): KeyedProjection<K, T> {\n  validateDefinition(definition, ['state', 'equality', 'process'], 'Incremental keyed');\n  if (definition.state !== undefined && typeof definition.state !== 'function')\n    throw new TypeError('Incremental keyed state must be a function when provided.');\n  if (definition.equality !== undefined && typeof definition.equality !== 'function')\n    throw new TypeError('Incremental keyed equality must be a function when provided.');\n  if (typeof definition.process !== 'function')\n    throw new TypeError('Incremental keyed definition requires a process function.');\n\n  return createKeyedTransform<K, V, T, unknown>({\n    source: driver,\n    dependencies,\n    equality: definition.equality,\n    name: 'incremental.keyed',\n    ...(definition.state ? { state: definition.state } : {}),\n    evaluate: ({ key, value, dependencies: values, state, reset, cause }) =>\n      definition.process({\n        key,\n        value,\n        dependencies: values,\n        reset,\n        cause,\n        ...(definition.state ? { state } : {}),\n      } as never),\n  });\n}\n\ntype GroupShape = number | { readonly [key: string]: GroupShape };\ntype GroupOutputMetadata = {\n  readonly kind: OutputDefinition['kind'];\n  readonly equality: (a: unknown, b: unknown) => boolean;\n};\n\nconst isPlainGroupNamespace = (\n  value: unknown,\n  metadata: ReadonlyMap<object, GroupOutputMetadata>\n): value is Record<string, unknown> => isPlainObject(value) && !metadata.has(value);\n\nconst compileGroupShape = (\n  value: unknown,\n  path: readonly string[],\n  metadata: ReadonlyMap<object, GroupOutputMetadata>,\n  used: Set<object>,\n  outputs: OutputDefinition[]\n): GroupShape => {\n  if (value !== null && typeof value === 'object') {\n    const output = metadata.get(value);\n    if (output) {\n      if (used.has(value)) throw new TypeError('An incremental group output cannot be reused.');\n      used.add(value);\n      const index = outputs.length;\n      outputs.push({\n        kind: output.kind,\n        equality: output.equality,\n        path: Object.freeze([...path]),\n      });\n      return index;\n    }\n  }\n  if (!isPlainGroupNamespace(value, metadata))\n    throw new TypeError('Incremental group outputs must be a static object tree.');\n  for (const key of Reflect.ownKeys(value)) {\n    if (typeof key !== 'string')\n      throw new TypeError('Incremental group output names must be strings.');\n    if (!Object.prototype.propertyIsEnumerable.call(value, key))\n      throw new TypeError('Incremental group namespaces must contain enumerable properties.');\n  }\n  const keys = Object.keys(value);\n  if (!keys.length) throw new TypeError('Incremental group namespaces cannot be empty.');\n  const result: Record<string, GroupShape> = Object.create(null) as Record<string, GroupShape>;\n  for (const key of keys) {\n    if (key === '__proto__' || key === 'prototype' || key === 'constructor')\n      throw new TypeError(`Invalid incremental group output name: ${key}`);\n    const descriptor = Object.getOwnPropertyDescriptor(value, key);\n    if (!descriptor || !('value' in descriptor))\n      throw new TypeError('Incremental group namespaces cannot contain accessors.');\n    result[key] = compileGroupShape(descriptor.value, [...path, key], metadata, used, outputs);\n  }\n  return Object.freeze(result);\n};\n\nconst hydrateGroupShape = <T>(shape: GroupShape, values: readonly T[]): unknown => {\n  if (typeof shape === 'number') return values[shape];\n  const result: Record<string, unknown> = {};\n  for (const [key, child] of Object.entries(shape)) result[key] = hydrateGroupShape(child, values);\n  return Object.freeze(result);\n};\n\nconst hydrateGroupReads = (\n  shape: GroupShape,\n  outputs: readonly OutputEvaluation[],\n  next: boolean\n): unknown => {\n  if (typeof shape === 'number') {\n    const output = outputs[shape];\n    return next && output.kind === 'value' ? output.next() : next ? output.next : output.previous;\n  }\n  const result: Record<string, unknown> = {};\n  for (const [key, child] of Object.entries(shape)) {\n    if (typeof child === 'number' && next && outputs[child].kind === 'value') {\n      Object.defineProperty(result, key, {\n        enumerable: true,\n        configurable: false,\n        get: () => (outputs[child] as Extract<OutputEvaluation, { kind: 'value' }>).next(),\n      });\n    } else result[key] = hydrateGroupReads(child, outputs, next);\n  }\n  return Object.freeze(result);\n};\n\nfunction createIncrementalGroup<\n  const D extends ProjectionDependencies,\n  const O extends GroupOutputShape,\n>(dependencies: D, definition: IncrementalGroupDefinition<D, O>): IncrementalGroupResult<O>;\nfunction createIncrementalGroup<\n  const D extends ProjectionDependencies,\n  const O extends GroupOutputShape,\n  State,\n>(\n  dependencies: D,\n  definition: {\n    readonly output: (define: GroupOutputBuilder) => O;\n    readonly state: () => State;\n    readonly process: (context: IncrementalGroupContext<D, O, State>) => void;\n  }\n): IncrementalGroupResult<O>;\nfunction createIncrementalGroup<\n  const D extends ProjectionDependencies,\n  const O extends GroupOutputShape,\n>(\n  dependencies: D,\n  definition: RuntimeIncrementalDefinition<void> & {\n    readonly output: (define: GroupOutputBuilder) => O;\n  }\n): IncrementalGroupResult<O> {\n  const compiled = compileProjectionDependencies(dependencies, 'Incremental');\n  validateDefinition(definition, ['output', 'state', 'process'], 'Incremental group');\n  validateRetainedState(definition, 'Incremental group');\n  if (typeof definition.output !== 'function' || typeof definition.process !== 'function')\n    throw new TypeError('Incremental group definition requires output and process functions.');\n\n  let active = true;\n  const metadata = new Map<object, GroupOutputMetadata>();\n  const defineOutput: GroupOutputBuilder = {\n    collection: <K extends string, V>(equality: (previous: V, next: V) => boolean = Object.is) => {\n      if (!active) throw new TypeError('Incremental group output declarations are synchronous.');\n      const descriptor = Object.freeze({});\n      metadata.set(descriptor, {\n        kind: 'collection',\n        equality: equality as (a: unknown, b: unknown) => boolean,\n      });\n      return descriptor as IncrementalGroupOutput<KeyedProjection<K, V>>;\n    },\n    value: <T>(equality: (previous: T, next: T) => boolean = Object.is) => {\n      if (!active) throw new TypeError('Incremental group output declarations are synchronous.');\n      const descriptor = Object.freeze({});\n      metadata.set(descriptor, {\n        kind: 'value',\n        equality: equality as (a: unknown, b: unknown) => boolean,\n      });\n      return descriptor as IncrementalGroupOutput<Projection<T>>;\n    },\n  };\n  const declared = definition.output(defineOutput);\n  assertSynchronous(declared);\n  active = false;\n  const outputs: OutputDefinition[] = [];\n  const used = new Set<object>();\n  const shape = compileGroupShape(declared, [], metadata, used, outputs);\n  if (typeof shape === 'number')\n    throw new TypeError('Incremental group declarations must return an output namespace.');\n  if (used.size === 0 || used.size !== metadata.size)\n    throw new TypeError('Every incremental group output must be returned by the declaration.');\n\n  const projections = defineProcessor({\n    dependencies: compiled.projections,\n    outputs,\n    create: () => {\n      const state = initializeRetainedState(definition);\n      return {\n        evaluate: evaluation => {\n          const publicInput = publicInputs(evaluation.sources, compiled.names, evaluation.reset);\n          const result = definition.process({\n            values: publicInput.values as ProjectionValues<D>,\n            changes: publicInput.changes as ProjectionChanges<D>,\n            previous: hydrateGroupReads(shape, evaluation.outputs, false) as GroupReads<O>,\n            next: hydrateGroupReads(shape, evaluation.outputs, true) as GroupReads<O>,\n            output: hydrateGroupShape(\n              shape,\n              evaluation.outputs.map(output => output.output)\n            ) as GroupDrafts<O>,\n            reset: evaluation.reset,\n            cause: evaluation.cause,\n            ...state,\n          } as never);\n          assertSynchronous(result);\n        },\n      };\n    },\n    name: `processor-group:${outputs.map(output => output.path?.join('.') ?? '').join(',')}`,\n  });\n  return hydrateGroupShape(shape, projections) as IncrementalGroupResult<O>;\n}\n\nexport const incremental = Object.assign(createIncrementalValue, {\n  collection: createIncrementalCollection,\n  keyed: createIncrementalKeyed,\n  group: createIncrementalGroup,\n});\n\nexport { collectionChange } from '@/projection/collection/change';\nexport type { CollectionChange } from './contract';\n"],"mappings":";;;AA2JA,MAAM,wBAAwB,OAAO,OAAO,EAAE,MAAM,SAAkB,CAAC;AAEvE,MAAM,eAAe,WACnB,OAAO,SAAS,UAAU,OAAO,QAAQ,eAAe,OAAO,KAAK;AAEtE,MAAM,gBACJ,SACA,OACA,UAIG;CACH,MAAM,SAAkC,OAAO,OAAO,KAAK;CAC3D,MAAM,UAAmC,OAAO,OAAO,KAAK;AAC5D,MAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;EACjD,MAAM,SAAS,QAAQ;AACvB,SAAO,MAAM,UAAU,YAAY,OAAO;AAC1C,UAAQ,MAAM,UACZ,OAAO,SAAS,eAAgB,QAAQ,wBAAwB,OAAO,SAAU,KAAA;;AAErF,QAAO,OAAO,OAAO;EAAE,QAAQ,OAAO,OAAO,OAAO;EAAE,SAAS,OAAO,OAAO,QAAQ;EAAE,CAAC;;AAG1F,SAAS,mBACP,YACA,SACA,OAC+C;AAC/C,KAAI,CAAC,cAAc,WAAW,CAC5B,OAAM,IAAI,UAAU,GAAG,MAAM,qCAAqC;CACpE,MAAM,cAAc,IAAI,IAAI,QAAQ;AACpC,MAAK,MAAM,OAAO,QAAQ,QAAQ,WAAW,EAAE;AAC7C,MAAI,OAAO,QAAQ,YAAY,CAAC,YAAY,IAAI,IAAI,CAClD,OAAM,IAAI,UAAU,GAAG,MAAM,2CAA2C;EAC1E,MAAM,aAAa,OAAO,yBAAyB,YAAY,IAAI;AACnE,MAAI,CAAC,YAAY,cAAc,EAAE,WAAW,YAC1C,OAAM,IAAI,UAAU,GAAG,MAAM,sDAAsD;;;AAIzF,MAAM,yBAAyB,YAAqC,UAAwB;AAC1F,KACE,OAAO,UAAU,eAAe,KAAK,YAAY,QAAQ,IACzD,OAAO,WAAW,UAAU,WAE5B,OAAM,IAAI,UAAU,GAAG,MAAM,0CAA0C;;AAG3E,MAAM,2BAA2B,eAEQ;AACvC,KAAI,WAAW,UAAU,KAAA,EAAW,QAAO,OAAO,OAAO,EAAE,CAAC;CAC5D,MAAM,QAAQ,WAAW,OAAO;AAChC,mBAAkB,MAAM;AACxB,QAAO,OAAO,OAAO,EAAE,OAAO,CAAC;;AAmBjC,SAAS,uBACP,cACA,YACe;CACf,MAAM,WAAW,8BAA8B,cAAc,cAAc;AAC3E,oBAAmB,YAAY,CAAC,SAAS,UAAU,EAAE,oBAAoB;AACzE,uBAAsB,YAAY,oBAAoB;AACtD,KAAI,OAAO,WAAW,YAAY,WAChC,OAAM,IAAI,UAAU,4DAA4D;CAClF,MAAM,CAAC,cAAc,gBAAgB;EACnC,cAAc,SAAS;EACvB,SAAS,CAAC;GAAE,MAAM;GAAS,UAAU,OAAO;GAAI,CAAC;EACjD,cAAc;GACZ,MAAM,QAAQ,wBAAwB,WAAW;AACjD,UAAO,EACL,WAAU,eAAc;IACtB,MAAM,SAAS,WAAW,QAAQ;AAClC,QAAI,OAAO,SAAS,QAAS,OAAM,IAAI,MAAM,uCAAuC;IACpF,MAAM,cAAc,aAAa,WAAW,SAAS,SAAS,OAAO,WAAW,MAAM;IACtF,MAAM,SAAS,WAAW,QAAQ;KAChC,QAAQ,YAAY;KACpB,SAAS,YAAY;KACrB,UAAU,OAAO;KACjB,OAAO,WAAW;KAClB,OAAO,WAAW;KAClB,GAAG;KACJ,CAAU;AACX,sBAAkB,OAAO;AACzB,WAAO,OAAO,IAAI,OAAO;MAE5B;;EAEJ,CAAC;AACF,QAAO;;AAmBT,SAAS,4BACP,cACA,YACuB;CACvB,MAAM,WAAW,8BAA8B,cAAc,cAAc;AAC3E,oBAAmB,YAAY,CAAC,SAAS,UAAU,EAAE,yBAAyB;AAC9E,uBAAsB,YAAY,yBAAyB;AAC3D,KAAI,OAAO,WAAW,YAAY,WAChC,OAAM,IAAI,UAAU,iEAAiE;CACvF,MAAM,CAAC,cAAc,gBAAgB;EACnC,cAAc,SAAS;EACvB,SAAS,CAAC;GAAE,MAAM;GAAc,UAAU,OAAO;GAAI,CAAC;EACtD,cAAc;GACZ,MAAM,QAAQ,wBAAwB,WAAW;AACjD,UAAO,EACL,WAAU,eAAc;IACtB,MAAM,SAAS,WAAW,QAAQ;AAClC,QAAI,OAAO,SAAS,aAClB,OAAM,IAAI,MAAM,4CAA4C;IAC9D,MAAM,cAAc,aAAa,WAAW,SAAS,SAAS,OAAO,WAAW,MAAM;AAWtF,sBAVe,WAAW,QAAQ;KAChC,QAAQ,YAAY;KACpB,SAAS,YAAY;KACrB,UAAU,OAAO;KACjB,MAAM,OAAO;KACb,OAAO,WAAW;KAClB,OAAO,WAAW;KAClB,QAAQ,OAAO;KACf,GAAG;KACJ,CACuB,CAAC;MAE5B;;EAEJ,CAAC;AACF,QAAO;;AAoBT,SAAS,uBACP,QACA,cACA,YAKuB;AACvB,oBAAmB,YAAY;EAAC;EAAS;EAAY;EAAU,EAAE,oBAAoB;AACrF,KAAI,WAAW,UAAU,KAAA,KAAa,OAAO,WAAW,UAAU,WAChE,OAAM,IAAI,UAAU,4DAA4D;AAClF,KAAI,WAAW,aAAa,KAAA,KAAa,OAAO,WAAW,aAAa,WACtE,OAAM,IAAI,UAAU,+DAA+D;AACrF,KAAI,OAAO,WAAW,YAAY,WAChC,OAAM,IAAI,UAAU,4DAA4D;AAElF,QAAO,qBAAuC;EAC5C,QAAQ;EACR;EACA,UAAU,WAAW;EACrB,MAAM;EACN,GAAI,WAAW,QAAQ,EAAE,OAAO,WAAW,OAAO,GAAG,EAAE;EACvD,WAAW,EAAE,KAAK,OAAO,cAAc,QAAQ,OAAO,OAAO,YAC3D,WAAW,QAAQ;GACjB;GACA;GACA,cAAc;GACd;GACA;GACA,GAAI,WAAW,QAAQ,EAAE,OAAO,GAAG,EAAE;GACtC,CAAU;EACd,CAAC;;AASJ,MAAM,yBACJ,OACA,aACqC,cAAc,MAAM,IAAI,CAAC,SAAS,IAAI,MAAM;AAEnF,MAAM,qBACJ,OACA,MACA,UACA,MACA,YACe;AACf,KAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;EAC/C,MAAM,SAAS,SAAS,IAAI,MAAM;AAClC,MAAI,QAAQ;AACV,OAAI,KAAK,IAAI,MAAM,CAAE,OAAM,IAAI,UAAU,gDAAgD;AACzF,QAAK,IAAI,MAAM;GACf,MAAM,QAAQ,QAAQ;AACtB,WAAQ,KAAK;IACX,MAAM,OAAO;IACb,UAAU,OAAO;IACjB,MAAM,OAAO,OAAO,CAAC,GAAG,KAAK,CAAC;IAC/B,CAAC;AACF,UAAO;;;AAGX,KAAI,CAAC,sBAAsB,OAAO,SAAS,CACzC,OAAM,IAAI,UAAU,0DAA0D;AAChF,MAAK,MAAM,OAAO,QAAQ,QAAQ,MAAM,EAAE;AACxC,MAAI,OAAO,QAAQ,SACjB,OAAM,IAAI,UAAU,kDAAkD;AACxE,MAAI,CAAC,OAAO,UAAU,qBAAqB,KAAK,OAAO,IAAI,CACzD,OAAM,IAAI,UAAU,mEAAmE;;CAE3F,MAAM,OAAO,OAAO,KAAK,MAAM;AAC/B,KAAI,CAAC,KAAK,OAAQ,OAAM,IAAI,UAAU,gDAAgD;CACtF,MAAM,SAAqC,OAAO,OAAO,KAAK;AAC9D,MAAK,MAAM,OAAO,MAAM;AACtB,MAAI,QAAQ,eAAe,QAAQ,eAAe,QAAQ,cACxD,OAAM,IAAI,UAAU,0CAA0C,MAAM;EACtE,MAAM,aAAa,OAAO,yBAAyB,OAAO,IAAI;AAC9D,MAAI,CAAC,cAAc,EAAE,WAAW,YAC9B,OAAM,IAAI,UAAU,yDAAyD;AAC/E,SAAO,OAAO,kBAAkB,WAAW,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,UAAU,MAAM,QAAQ;;AAE5F,QAAO,OAAO,OAAO,OAAO;;AAG9B,MAAM,qBAAwB,OAAmB,WAAkC;AACjF,KAAI,OAAO,UAAU,SAAU,QAAO,OAAO;CAC7C,MAAM,SAAkC,EAAE;AAC1C,MAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,CAAE,QAAO,OAAO,kBAAkB,OAAO,OAAO;AAChG,QAAO,OAAO,OAAO,OAAO;;AAG9B,MAAM,qBACJ,OACA,SACA,SACY;AACZ,KAAI,OAAO,UAAU,UAAU;EAC7B,MAAM,SAAS,QAAQ;AACvB,SAAO,QAAQ,OAAO,SAAS,UAAU,OAAO,MAAM,GAAG,OAAO,OAAO,OAAO,OAAO;;CAEvF,MAAM,SAAkC,EAAE;AAC1C,MAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,CAC9C,KAAI,OAAO,UAAU,YAAY,QAAQ,QAAQ,OAAO,SAAS,QAC/D,QAAO,eAAe,QAAQ,KAAK;EACjC,YAAY;EACZ,cAAc;EACd,WAAY,QAAQ,OAAwD,MAAM;EACnF,CAAC;KACG,QAAO,OAAO,kBAAkB,OAAO,SAAS,KAAK;AAE9D,QAAO,OAAO,OAAO,OAAO;;AAmB9B,SAAS,uBAIP,cACA,YAG2B;CAC3B,MAAM,WAAW,8BAA8B,cAAc,cAAc;AAC3E,oBAAmB,YAAY;EAAC;EAAU;EAAS;EAAU,EAAE,oBAAoB;AACnF,uBAAsB,YAAY,oBAAoB;AACtD,KAAI,OAAO,WAAW,WAAW,cAAc,OAAO,WAAW,YAAY,WAC3E,OAAM,IAAI,UAAU,sEAAsE;CAE5F,IAAI,SAAS;CACb,MAAM,2BAAW,IAAI,KAAkC;CAqBvD,MAAM,WAAW,WAAW,OAAO;EAnBjC,aAAkC,WAA8C,OAAO,OAAO;AAC5F,OAAI,CAAC,OAAQ,OAAM,IAAI,UAAU,yDAAyD;GAC1F,MAAM,aAAa,OAAO,OAAO,EAAE,CAAC;AACpC,YAAS,IAAI,YAAY;IACvB,MAAM;IACI;IACX,CAAC;AACF,UAAO;;EAET,QAAW,WAA8C,OAAO,OAAO;AACrE,OAAI,CAAC,OAAQ,OAAM,IAAI,UAAU,yDAAyD;GAC1F,MAAM,aAAa,OAAO,OAAO,EAAE,CAAC;AACpC,YAAS,IAAI,YAAY;IACvB,MAAM;IACI;IACX,CAAC;AACF,UAAO;;EAGoC,CAAC;AAChD,mBAAkB,SAAS;AAC3B,UAAS;CACT,MAAM,UAA8B,EAAE;CACtC,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,QAAQ,kBAAkB,UAAU,EAAE,EAAE,UAAU,MAAM,QAAQ;AACtE,KAAI,OAAO,UAAU,SACnB,OAAM,IAAI,UAAU,kEAAkE;AACxF,KAAI,KAAK,SAAS,KAAK,KAAK,SAAS,SAAS,KAC5C,OAAM,IAAI,UAAU,sEAAsE;AA6B5F,QAAO,kBAAkB,OA3BL,gBAAgB;EAClC,cAAc,SAAS;EACvB;EACA,cAAc;GACZ,MAAM,QAAQ,wBAAwB,WAAW;AACjD,UAAO,EACL,WAAU,eAAc;IACtB,MAAM,cAAc,aAAa,WAAW,SAAS,SAAS,OAAO,WAAW,MAAM;AActF,sBAbe,WAAW,QAAQ;KAChC,QAAQ,YAAY;KACpB,SAAS,YAAY;KACrB,UAAU,kBAAkB,OAAO,WAAW,SAAS,MAAM;KAC7D,MAAM,kBAAkB,OAAO,WAAW,SAAS,KAAK;KACxD,QAAQ,kBACN,OACA,WAAW,QAAQ,KAAI,WAAU,OAAO,OAAO,CAChD;KACD,OAAO,WAAW;KAClB,OAAO,WAAW;KAClB,GAAG;KACJ,CACuB,CAAC;MAE5B;;EAEH,MAAM,mBAAmB,QAAQ,KAAI,WAAU,OAAO,MAAM,KAAK,IAAI,IAAI,GAAG,CAAC,KAAK,IAAI;EACvF,CAC0C,CAAC;;AAG9C,MAAa,cAAc,OAAO,OAAO,wBAAwB;CAC/D,YAAY;CACZ,OAAO;CACP,OAAO;CACR,CAAC"}

package/dist/driver-B7RR-VfX.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"driver-B7RR-VfX.js","names":["issue.fail","tree.validNode"],"sources":["../core/src/tree/topology.ts","../core/src/mutation/issue.ts","../core/src/address/index.ts","../core/src/mutation/changes.ts","../core/src/runtime/context.ts","../core/src/runtime/driver.ts"],"sourcesContent":["import { isRecord } from '@/value/record';\nexport type MutableTreeNode = { parentId?: string; children: string[]; value?: unknown };\nexport type MutableTree = { rootId?: string; nodes: Record<string, MutableTreeNode> };\nconst node = (tree: MutableTree, id: string) =>\n  Object.hasOwn(tree.nodes, id) ? tree.nodes[id] : undefined;\nexport const is = (value: unknown): value is MutableTree =>\n  isRecord(value) && isRecord(value.nodes);\n\nexport const validNode = (value: unknown): value is MutableTreeNode => {\n  if (!isRecord(value) || !Array.isArray(value.children)) return false;\n  if (value.parentId !== undefined && typeof value.parentId !== 'string') return false;\n  const children = new Set<string>();\n  for (const id of value.children) {\n    if (typeof id !== 'string' || children.has(id)) return false;\n    children.add(id);\n  }\n  return true;\n};\n\nexport const contains = (tree: MutableTree, id: string): boolean => Object.hasOwn(tree.nodes, id);\n\nexport const parent = (tree: MutableTree, id: string): string | undefined =>\n  node(tree, id)?.parentId;\n\nexport const children = (tree: MutableTree, id: string): readonly string[] | undefined =>\n  node(tree, id)?.children;\n\nexport const validate = (value: unknown): value is MutableTree => {\n  if (!is(value)) return false;\n  const ids = Object.keys(value.nodes);\n  if (ids.length === 0) return value.rootId === undefined;\n  if (typeof value.rootId !== 'string' || !Object.hasOwn(value.nodes, value.rootId)) return false;\n\n  for (const id of ids) {\n    const entry = value.nodes[id];\n    if (!validNode(entry)) return false;\n    if (id === value.rootId) {\n      if (entry.parentId !== undefined) return false;\n    } else if (entry.parentId === undefined || !Object.hasOwn(value.nodes, entry.parentId))\n      return false;\n    for (const child of entry.children) {\n      const childNode = value.nodes[child];\n      if (!childNode || childNode.parentId !== id) return false;\n    }\n  }\n\n  const seen = new Set<string>();\n  const stack = [value.rootId];\n  while (stack.length) {\n    const id = stack.pop() as string;\n    if (seen.has(id)) return false;\n    seen.add(id);\n    const entry = value.nodes[id];\n    if (!entry) return false;\n    for (const child of entry.children) stack.push(child);\n  }\n  return seen.size === ids.length;\n};\n\nexport type TreePosition = { readonly parentId?: string; readonly index?: number };\n","import type { DocumentAddress } from '@/schema/model';\nimport type { ParseIssue } from '@/schema/value';\n\nexport type MutationIssueCode =\n  | 'invalid-address'\n  | 'invalid-value'\n  | 'invalid-key'\n  | 'invalid-changes'\n  | 'baseline-mismatch'\n  | 'required-field'\n  | 'invalid-anchor'\n  | 'duplicate-entity'\n  | 'missing-entity'\n  | 'invalid-collection'\n  | 'invalid-list-keys'\n  | 'invalid-list-key'\n  | 'duplicate-list-item'\n  | 'missing-list-item'\n  | 'invalid-tree'\n  | 'duplicate-tree-node'\n  | 'missing-tree-parent'\n  | 'invalid-tree-index'\n  | 'missing-tree-node'\n  | 'tree-cycle';\nexport type MutationIssue = {\n  readonly source: 'mutation';\n  readonly code: MutationIssueCode;\n  readonly address: DocumentAddress;\n  readonly message: string;\n};\nexport const at = (\n  address: DocumentAddress,\n  code: MutationIssueCode,\n  message: string\n): MutationIssue =>\n  Object.freeze({ source: 'mutation', code, address: Object.freeze([...address]), message });\nexport class MutationRejected extends Error {\n  constructor(readonly issue: MutationIssue) {\n    super(issue.message);\n  }\n}\nexport const fail = (address: DocumentAddress, code: MutationIssueCode, message: string): never => {\n  throw new MutationRejected(at(address, code, message));\n};\n\nexport const invalidValue = (issue: ParseIssue, address = issue.address): never =>\n  fail(address, issue.code === 'missing-validator' ? 'invalid-value' : issue.code, issue.message);\n","import type { DocumentAddress } from '@/schema/model';\n\ntype AddressIndexNode<T> = {\n  readonly children: Map<string, AddressIndexNode<T>>;\n  readonly values: Set<T>;\n};\n\nexport class AddressIndex<T> {\n  private readonly root: AddressIndexNode<T> = { children: new Map(), values: new Set() };\n\n  add(address: DocumentAddress, value: T, member?: string): void {\n    let node = this.root;\n    for (let index = 0; index < address.length + (member === undefined ? 0 : 1); index++) {\n      const segment = index < address.length ? address[index] : member!;\n      let child = node.children.get(segment);\n      if (!child) {\n        child = { children: new Map(), values: new Set() };\n        node.children.set(segment, child);\n      }\n      node = child;\n    }\n    node.values.add(value);\n  }\n\n  delete(address: DocumentAddress, value: T, member?: string): void {\n    const parents: AddressIndexNode<T>[] = [];\n    let node = this.root;\n    const length = address.length + (member === undefined ? 0 : 1);\n    for (let index = 0; index < length; index++) {\n      const segment = index < address.length ? address[index] : member!;\n      const child = node.children.get(segment);\n      if (!child) return;\n      parents.push(node);\n      node = child;\n    }\n    node.values.delete(value);\n    for (let index = length - 1; index >= 0 && !node.values.size && !node.children.size; index--) {\n      node = parents[index];\n      node.children.delete(index < address.length ? address[index] : member!);\n    }\n  }\n\n  exact(address: DocumentAddress): ReadonlySet<T> | undefined {\n    let node = this.root;\n    for (const segment of address) {\n      const child = node.children.get(segment);\n      if (!child) return undefined;\n      node = child;\n    }\n    return node.values;\n  }\n\n  hasAncestor(address: DocumentAddress, strict = false): boolean {\n    let node = this.root;\n    for (let index = 0; index < address.length; index++) {\n      if (node.values.size) return true;\n      const child = node.children.get(address[index]);\n      if (!child) return false;\n      node = child;\n    }\n    return !strict && node.values.size > 0;\n  }\n\n  someAncestor(address: DocumentAddress, predicate: (value: T) => boolean): boolean {\n    let node = this.root;\n    for (let index = 0; ; index++) {\n      for (const value of node.values) if (predicate(value)) return true;\n      if (index === address.length) return false;\n      const child = node.children.get(address[index]);\n      if (!child) return false;\n      node = child;\n    }\n  }\n\n  overlaps(address: DocumentAddress, member?: string): boolean {\n    let node = this.root;\n    const length = address.length + (member === undefined ? 0 : 1);\n    for (let index = 0; index < length; index++) {\n      if (node.values.size) return true;\n      const segment = index < address.length ? address[index] : member!;\n      const child = node.children.get(segment);\n      if (!child) return false;\n      node = child;\n    }\n    return node.values.size > 0 || node.children.size > 0;\n  }\n\n  hasDescendant(address: DocumentAddress, member?: string): boolean {\n    let node = this.root;\n    const length = address.length + (member === undefined ? 0 : 1);\n    for (let index = 0; index < length; index++) {\n      const segment = index < address.length ? address[index] : member!;\n      const child = node.children.get(segment);\n      if (!child) return false;\n      node = child;\n    }\n    return node.values.size > 0 || node.children.size > 0;\n  }\n\n  /** Visit one address' ancestors and descendants without batch de-duplication state. */\n  forEachOverlap(address: DocumentAddress, visit: (value: T) => void): void {\n    let node = this.root;\n    for (const segment of address) {\n      node.values.forEach(visit);\n      const child = node.children.get(segment);\n      if (!child) return;\n      node = child;\n    }\n    const descend = (current: AddressIndexNode<T>): void => {\n      current.values.forEach(visit);\n      current.children.forEach(descend);\n    };\n    descend(node);\n  }\n\n  query(\n    visit: (value: T) => void,\n    relation: 'overlap' | 'ancestors' | 'descendants' = 'overlap'\n  ): (address: DocumentAddress, members?: readonly { readonly key: string }[]) => void {\n    const visited = new Set<AddressIndexNode<T>>();\n    const subtrees = new Set<AddressIndexNode<T>>();\n    const values = (node: AddressIndexNode<T>) => {\n      if (visited.has(node)) return;\n      visited.add(node);\n      node.values.forEach(visit);\n    };\n    const descend = (current: AddressIndexNode<T>): void => {\n      if (subtrees.has(current)) return;\n      subtrees.add(current);\n      values(current);\n      current.children.forEach(descend);\n    };\n    const terminal = (node: AddressIndexNode<T>) =>\n      relation === 'ancestors' ? values(node) : descend(node);\n    return (address, members) => {\n      let node = this.root;\n      for (const segment of address) {\n        if (subtrees.has(node)) return;\n        if (relation !== 'descendants') values(node);\n        const child = node.children.get(segment);\n        if (!child) return;\n        node = child;\n      }\n      if (!members) terminal(node);\n      else {\n        if (relation !== 'descendants') values(node);\n        for (const member of members) {\n          const child = node.children.get(member.key);\n          if (child) terminal(child);\n        }\n      }\n    };\n  }\n\n  clear(): void {\n    this.root.values.clear();\n    this.root.children.clear();\n  }\n}\n","import type { Change, ChangeSet, MemberChange, ValueTransition } from '@/changes';\nimport { AddressIndex } from '@/address/index';\nimport { isPlainObject } from '@/value/record';\nimport * as issue from './issue';\nimport * as tree from '@/tree/topology';\n\nconst validated = new WeakSet<ChangeSet>();\n\nconst compareChanges = (a: Change, b: Change): number => {\n  if (a.kind === 'reset' || b.kind === 'reset')\n    return a.kind === b.kind ? 0 : a.kind === 'reset' ? -1 : 1;\n  const length = Math.min(a.at.length, b.at.length);\n  for (let i = 0; i < length; i++) if (a.at[i] !== b.at[i]) return lexical(a.at[i], b.at[i]);\n  return a.at.length - b.at.length || lexical(a.kind, b.kind);\n};\n\nconst publication = (changes: Change[]): ChangeSet => {\n  const result = { changes };\n  validated.add(result);\n  return result;\n};\n\n/** Register complete recorder groups; unknown input is validated separately. */\nexport const sealChanges = (changes: Change[]): ChangeSet => {\n  changes.sort(compareChanges);\n  return publication(changes);\n};\n\nconst keys = (value: Record<string, unknown>, expected: readonly string[]) =>\n  Object.keys(value).every(key => expected.includes(key));\nconst strings = (value: unknown): value is readonly string[] => {\n  if (!Array.isArray(value)) return false;\n  for (const item of value) if (typeof item !== 'string') return false;\n  return true;\n};\nconst order = (value: unknown): value is readonly string[] =>\n  strings(value) && new Set(value).size === value.length;\nconst transition = (\n  value: unknown,\n  key: 'key' | 'id'\n): value is ValueTransition & Record<string, unknown> => {\n  if (!isPlainObject(value) || typeof value[key] !== 'string') return false;\n  if (value.kind === 'added')\n    return keys(value, ['kind', key, 'after']) && Object.hasOwn(value, 'after');\n  if (value.kind === 'removed')\n    return keys(value, ['kind', key, 'before']) && Object.hasOwn(value, 'before');\n  return (\n    value.kind === 'updated' &&\n    keys(value, ['kind', key, 'before', 'after']) &&\n    Object.hasOwn(value, 'before') &&\n    Object.hasOwn(value, 'after')\n  );\n};\nconst lexical = (a: string, b: string) => (a < b ? -1 : a === b ? 0 : 1);\n\n/** The sole unknown ChangeSet boundary, including normalized logical-address conflicts. */\nexport const decodeChanges = (input: unknown): ChangeSet => {\n  if (typeof input === 'object' && input !== null && validated.has(input as ChangeSet))\n    return input as ChangeSet;\n  if (!isPlainObject(input) || !keys(input, ['changes']) || !Array.isArray(input.changes))\n    return issue.fail([], 'invalid-changes', 'Expected a ChangeSet.');\n  const result: Change[] = [];\n  for (const entry of input.changes) {\n    if (!isPlainObject(entry)) return issue.fail([], 'invalid-changes', 'Expected a change.');\n    if (entry.kind === 'reset') {\n      if (\n        input.changes.length !== 1 ||\n        !keys(entry, ['kind', 'before', 'after']) ||\n        !Object.hasOwn(entry, 'before') ||\n        !Object.hasOwn(entry, 'after')\n      )\n        return issue.fail(\n          [],\n          'invalid-changes',\n          'A reset must be the only change and contain both values.'\n        );\n      return sealChanges([{ kind: 'reset', before: entry.before, after: entry.after }]);\n    }\n    if (!strings(entry.at))\n      return issue.fail([], 'invalid-changes', 'Change addresses must contain strings.');\n    const at = entry.at;\n    if (\n      entry.kind === 'members' &&\n      keys(entry, ['kind', 'at', 'members', 'order']) &&\n      Array.isArray(entry.members) &&\n      (entry.members.length || Object.hasOwn(entry, 'order'))\n    ) {\n      const seen = new Set<string>();\n      const members: MemberChange[] = [];\n      for (const member of entry.members) {\n        if (!transition(member, 'key') || typeof member.key !== 'string' || seen.has(member.key))\n          return issue.fail(at, 'invalid-changes', 'Malformed or duplicate member transition.');\n        seen.add(member.key);\n        members.push({ ...member, key: member.key });\n      }\n      const change: Extract<Change, { kind: 'members' }> = {\n        kind: 'members',\n        at,\n        members: members.sort((a, b) => lexical(a.key, b.key)),\n      };\n      if (Object.hasOwn(entry, 'order')) {\n        if (\n          !isPlainObject(entry.order) ||\n          !keys(entry.order, ['before', 'after']) ||\n          !order(entry.order.before) ||\n          !order(entry.order.after)\n        )\n          return issue.fail(at, 'invalid-changes', 'Malformed container order.');\n        result.push({ ...change, order: { before: entry.order.before, after: entry.order.after } });\n      } else result.push(change);\n    } else if (\n      entry.kind === 'tree' &&\n      keys(entry, ['kind', 'at', 'before', 'after', 'nodes']) &&\n      (entry.before === null || typeof entry.before === 'string') &&\n      (entry.after === null || typeof entry.after === 'string') &&\n      Array.isArray(entry.nodes)\n    ) {\n      const seen = new Set<string>();\n      for (const node of entry.nodes) {\n        if (\n          !transition(node, 'id') ||\n          typeof node.id !== 'string' ||\n          seen.has(node.id) ||\n          (node.kind !== 'added' && !tree.validNode(node.before)) ||\n          (node.kind !== 'removed' && !tree.validNode(node.after))\n        )\n          return issue.fail(at, 'invalid-changes', 'Malformed or duplicate tree transition.');\n        seen.add(node.id);\n      }\n      const nodes = entry.nodes as Extract<Change, { kind: 'tree' }>['nodes'];\n      result.push({\n        kind: 'tree',\n        at,\n        before: entry.before,\n        after: entry.after,\n        nodes: [...nodes].sort((a, b) => lexical(a.id, b.id)),\n      });\n    } else return issue.fail(at, 'invalid-changes', 'Unknown or malformed change.');\n  }\n  return publication(normalizeChanges(result));\n};\n\nconst normalizeChanges = (changes: Change[]): Change[] => {\n  const sorted = changes.sort(compareChanges);\n  const groups = new AddressIndex<true>();\n  const replacements = new AddressIndex<true>();\n  const orders = new AddressIndex<true>();\n  for (const change of sorted) {\n    if (change.kind === 'reset') continue;\n    if (change.kind === 'members') {\n      if (groups.exact(change.at)?.size)\n        return issue.fail(change.at, 'invalid-changes', 'Duplicate member group.');\n      groups.add(change.at, true);\n      if (change.order) {\n        if (replacements.hasAncestor(change.at))\n          return issue.fail(change.at, 'invalid-changes', 'Overlapping container order.');\n        orders.add(change.at, true);\n      }\n      for (const member of change.members) {\n        if (\n          replacements.overlaps(change.at, member.key) ||\n          orders.hasDescendant(change.at, member.key)\n        )\n          return issue.fail(\n            change.at.concat(member.key),\n            'invalid-changes',\n            'Overlapping member transitions.'\n          );\n        replacements.add(change.at, true, member.key);\n      }\n    } else if (change.kind === 'tree') {\n      if (replacements.overlaps(change.at) || orders.hasDescendant(change.at))\n        return issue.fail(change.at, 'invalid-changes', 'Overlapping tree transitions.');\n      replacements.add(change.at, true);\n    }\n  }\n  return sorted;\n};\n\nexport const changeCount = (changes: ChangeSet): number => {\n  let count = 0;\n  for (const change of changes.changes)\n    count +=\n      change.kind === 'members'\n        ? change.members.length + (change.order ? 1 : 0)\n        : change.kind === 'tree'\n          ? 1 + change.nodes.length\n          : 1;\n  return count;\n};\n","import type { Infer, ObjectSchema, RootNodeOf } from '@/schema/model';\nimport type { DocumentRuntime } from './contract';\nimport type { RuntimeWriteDriver } from './driver';\nimport type { NotificationCenter } from './notification';\n\nexport type RuntimeState<TSchema extends ObjectSchema<object>> = {\n  readonly schema: RootNodeOf<TSchema>;\n  document: Infer<TSchema>;\n  disposed: boolean;\n  projectionLocks: number;\n};\n\nexport type RuntimeContext<TSchema extends ObjectSchema<object>> = {\n  readonly state: RuntimeState<TSchema>;\n  readonly owner: DocumentRuntime<TSchema>;\n  readonly notifications: NotificationCenter<TSchema>;\n  driver: RuntimeWriteDriver | undefined;\n  bypassDepth: number;\n};\n\nconst contexts = new WeakMap<object, RuntimeContext<ObjectSchema<object>>>();\n\nexport const bindContext = <TSchema extends ObjectSchema<object>>(\n  subject: object,\n  context: RuntimeContext<TSchema>\n): void => {\n  contexts.set(subject, context as unknown as RuntimeContext<ObjectSchema<object>>);\n};\n\nexport function contextOf<TSchema extends ObjectSchema<object>>(\n  subject: object,\n  required?: true\n): RuntimeContext<TSchema>;\nexport function contextOf<TSchema extends ObjectSchema<object>>(\n  subject: object,\n  required: false\n): RuntimeContext<TSchema> | undefined;\nexport function contextOf<TSchema extends ObjectSchema<object>>(\n  subject: object,\n  required = true\n): RuntimeContext<TSchema> | undefined {\n  const context = contexts.get(subject);\n  if (!context && required) throw new Error('Unknown Doxum runtime.');\n  return context as unknown as RuntimeContext<TSchema> | undefined;\n}\n","import type { CommitSource, DocumentRuntime } from './contract';\nimport type { ObjectSchema } from '@/schema/model';\nimport { contextOf } from './context';\n\nexport type RuntimeWriteIntent =\n  | { readonly kind: 'update'; readonly source: Extract<CommitSource, 'local' | 'system'> }\n  | { readonly kind: 'apply'; readonly source: CommitSource }\n  | { readonly kind: 'replace'; readonly source: Extract<CommitSource, 'system' | 'remote'> };\n\nexport type RuntimeWriteDriver = {\n  readonly assertWritable: (intent: RuntimeWriteIntent) => void;\n};\n\nexport type RuntimeWriteDriverLease = {\n  readonly run: <TResult>(run: () => TResult) => TResult;\n  readonly dispose: () => void;\n};\n\nexport const assertRuntimeWritable = (runtime: object, intent: RuntimeWriteIntent): void => {\n  const context = contextOf(runtime);\n  if (context.bypassDepth === 0) context.driver?.assertWritable(intent);\n};\n\nexport const installRuntimeWriteDriver = <TSchema extends ObjectSchema<object>>(\n  runtime: DocumentRuntime<TSchema>,\n  driver: RuntimeWriteDriver\n): RuntimeWriteDriverLease => {\n  const context = contextOf(runtime);\n  if (context.driver) throw new Error('Doxum runtime already has a write driver.');\n  context.driver = driver;\n  let active = true;\n  return Object.freeze({\n    run: <TResult>(run: () => TResult): TResult => {\n      if (!active) throw new Error('Doxum runtime write driver is no longer active.');\n      context.bypassDepth += 1;\n      try {\n        return run();\n      } finally {\n        context.bypassDepth -= 1;\n      }\n    },\n    dispose: (): void => {\n      if (!active) return;\n      active = false;\n      if (context.driver === driver) context.driver = undefined;\n    },\n  });\n};\n"],"mappings":";;AAGA,MAAM,QAAQ,MAAmB,OAC/B,OAAO,OAAO,KAAK,OAAO,GAAG,GAAG,KAAK,MAAM,MAAM,KAAA;AACnD,MAAa,MAAM,UACjB,SAAS,MAAM,IAAI,SAAS,MAAM,MAAM;AAE1C,MAAa,aAAa,UAA6C;AACrE,KAAI,CAAC,SAAS,MAAM,IAAI,CAAC,MAAM,QAAQ,MAAM,SAAS,CAAE,QAAO;AAC/D,KAAI,MAAM,aAAa,KAAA,KAAa,OAAO,MAAM,aAAa,SAAU,QAAO;CAC/E,MAAM,2BAAW,IAAI,KAAa;AAClC,MAAK,MAAM,MAAM,MAAM,UAAU;AAC/B,MAAI,OAAO,OAAO,YAAY,SAAS,IAAI,GAAG,CAAE,QAAO;AACvD,WAAS,IAAI,GAAG;;AAElB,QAAO;;AAGT,MAAa,YAAY,MAAmB,OAAwB,OAAO,OAAO,KAAK,OAAO,GAAG;AAEjG,MAAa,UAAU,MAAmB,OACxC,KAAK,MAAM,GAAG,EAAE;AAElB,MAAa,YAAY,MAAmB,OAC1C,KAAK,MAAM,GAAG,EAAE;AAElB,MAAa,YAAY,UAAyC;AAChE,KAAI,CAAC,GAAG,MAAM,CAAE,QAAO;CACvB,MAAM,MAAM,OAAO,KAAK,MAAM,MAAM;AACpC,KAAI,IAAI,WAAW,EAAG,QAAO,MAAM,WAAW,KAAA;AAC9C,KAAI,OAAO,MAAM,WAAW,YAAY,CAAC,OAAO,OAAO,MAAM,OAAO,MAAM,OAAO,CAAE,QAAO;AAE1F,MAAK,MAAM,MAAM,KAAK;EACpB,MAAM,QAAQ,MAAM,MAAM;AAC1B,MAAI,CAAC,UAAU,MAAM,CAAE,QAAO;AAC9B,MAAI,OAAO,MAAM;OACX,MAAM,aAAa,KAAA,EAAW,QAAO;aAChC,MAAM,aAAa,KAAA,KAAa,CAAC,OAAO,OAAO,MAAM,OAAO,MAAM,SAAS,CACpF,QAAO;AACT,OAAK,MAAM,SAAS,MAAM,UAAU;GAClC,MAAM,YAAY,MAAM,MAAM;AAC9B,OAAI,CAAC,aAAa,UAAU,aAAa,GAAI,QAAO;;;CAIxD,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,QAAQ,CAAC,MAAM,OAAO;AAC5B,QAAO,MAAM,QAAQ;EACnB,MAAM,KAAK,MAAM,KAAK;AACtB,MAAI,KAAK,IAAI,GAAG,CAAE,QAAO;AACzB,OAAK,IAAI,GAAG;EACZ,MAAM,QAAQ,MAAM,MAAM;AAC1B,MAAI,CAAC,MAAO,QAAO;AACnB,OAAK,MAAM,SAAS,MAAM,SAAU,OAAM,KAAK,MAAM;;AAEvD,QAAO,KAAK,SAAS,IAAI;;;;AC1B3B,MAAa,MACX,SACA,MACA,YAEA,OAAO,OAAO;CAAE,QAAQ;CAAY;CAAM,SAAS,OAAO,OAAO,CAAC,GAAG,QAAQ,CAAC;CAAE;CAAS,CAAC;AAC5F,IAAa,mBAAb,cAAsC,MAAM;CAC1C,YAAY,OAA+B;AACzC,QAAM,MAAM,QAAQ;AADD,OAAA,QAAA;;;AAIvB,MAAa,QAAQ,SAA0B,MAAyB,YAA2B;AACjG,OAAM,IAAI,iBAAiB,GAAG,SAAS,MAAM,QAAQ,CAAC;;AAGxD,MAAa,gBAAgB,OAAmB,UAAU,MAAM,YAC9D,KAAK,SAAS,MAAM,SAAS,sBAAsB,kBAAkB,MAAM,MAAM,MAAM,QAAQ;;;ACvCjG,IAAa,eAAb,MAA6B;CAC3B,OAA6C;EAAE,0BAAU,IAAI,KAAK;EAAE,wBAAQ,IAAI,KAAK;EAAE;CAEvF,IAAI,SAA0B,OAAU,QAAuB;EAC7D,IAAI,OAAO,KAAK;AAChB,OAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,UAAU,WAAW,KAAA,IAAY,IAAI,IAAI,SAAS;GACpF,MAAM,UAAU,QAAQ,QAAQ,SAAS,QAAQ,SAAS;GAC1D,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACtC,OAAI,CAAC,OAAO;AACV,YAAQ;KAAE,0BAAU,IAAI,KAAK;KAAE,wBAAQ,IAAI,KAAK;KAAE;AAClD,SAAK,SAAS,IAAI,SAAS,MAAM;;AAEnC,UAAO;;AAET,OAAK,OAAO,IAAI,MAAM;;CAGxB,OAAO,SAA0B,OAAU,QAAuB;EAChE,MAAM,UAAiC,EAAE;EACzC,IAAI,OAAO,KAAK;EAChB,MAAM,SAAS,QAAQ,UAAU,WAAW,KAAA,IAAY,IAAI;AAC5D,OAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,SAAS;GAC3C,MAAM,UAAU,QAAQ,QAAQ,SAAS,QAAQ,SAAS;GAC1D,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,OAAI,CAAC,MAAO;AACZ,WAAQ,KAAK,KAAK;AAClB,UAAO;;AAET,OAAK,OAAO,OAAO,MAAM;AACzB,OAAK,IAAI,QAAQ,SAAS,GAAG,SAAS,KAAK,CAAC,KAAK,OAAO,QAAQ,CAAC,KAAK,SAAS,MAAM,SAAS;AAC5F,UAAO,QAAQ;AACf,QAAK,SAAS,OAAO,QAAQ,QAAQ,SAAS,QAAQ,SAAS,OAAQ;;;CAI3E,MAAM,SAAsD;EAC1D,IAAI,OAAO,KAAK;AAChB,OAAK,MAAM,WAAW,SAAS;GAC7B,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,OAAI,CAAC,MAAO,QAAO,KAAA;AACnB,UAAO;;AAET,SAAO,KAAK;;CAGd,YAAY,SAA0B,SAAS,OAAgB;EAC7D,IAAI,OAAO,KAAK;AAChB,OAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS;AACnD,OAAI,KAAK,OAAO,KAAM,QAAO;GAC7B,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ,OAAO;AAC/C,OAAI,CAAC,MAAO,QAAO;AACnB,UAAO;;AAET,SAAO,CAAC,UAAU,KAAK,OAAO,OAAO;;CAGvC,aAAa,SAA0B,WAA2C;EAChF,IAAI,OAAO,KAAK;AAChB,OAAK,IAAI,QAAQ,IAAK,SAAS;AAC7B,QAAK,MAAM,SAAS,KAAK,OAAQ,KAAI,UAAU,MAAM,CAAE,QAAO;AAC9D,OAAI,UAAU,QAAQ,OAAQ,QAAO;GACrC,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ,OAAO;AAC/C,OAAI,CAAC,MAAO,QAAO;AACnB,UAAO;;;CAIX,SAAS,SAA0B,QAA0B;EAC3D,IAAI,OAAO,KAAK;EAChB,MAAM,SAAS,QAAQ,UAAU,WAAW,KAAA,IAAY,IAAI;AAC5D,OAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,SAAS;AAC3C,OAAI,KAAK,OAAO,KAAM,QAAO;GAC7B,MAAM,UAAU,QAAQ,QAAQ,SAAS,QAAQ,SAAS;GAC1D,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,OAAI,CAAC,MAAO,QAAO;AACnB,UAAO;;AAET,SAAO,KAAK,OAAO,OAAO,KAAK,KAAK,SAAS,OAAO;;CAGtD,cAAc,SAA0B,QAA0B;EAChE,IAAI,OAAO,KAAK;EAChB,MAAM,SAAS,QAAQ,UAAU,WAAW,KAAA,IAAY,IAAI;AAC5D,OAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,SAAS;GAC3C,MAAM,UAAU,QAAQ,QAAQ,SAAS,QAAQ,SAAS;GAC1D,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,OAAI,CAAC,MAAO,QAAO;AACnB,UAAO;;AAET,SAAO,KAAK,OAAO,OAAO,KAAK,KAAK,SAAS,OAAO;;;CAItD,eAAe,SAA0B,OAAiC;EACxE,IAAI,OAAO,KAAK;AAChB,OAAK,MAAM,WAAW,SAAS;AAC7B,QAAK,OAAO,QAAQ,MAAM;GAC1B,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,OAAI,CAAC,MAAO;AACZ,UAAO;;EAET,MAAM,WAAW,YAAuC;AACtD,WAAQ,OAAO,QAAQ,MAAM;AAC7B,WAAQ,SAAS,QAAQ,QAAQ;;AAEnC,UAAQ,KAAK;;CAGf,MACE,OACA,WAAoD,WAC+B;EACnF,MAAM,0BAAU,IAAI,KAA0B;EAC9C,MAAM,2BAAW,IAAI,KAA0B;EAC/C,MAAM,UAAU,SAA8B;AAC5C,OAAI,QAAQ,IAAI,KAAK,CAAE;AACvB,WAAQ,IAAI,KAAK;AACjB,QAAK,OAAO,QAAQ,MAAM;;EAE5B,MAAM,WAAW,YAAuC;AACtD,OAAI,SAAS,IAAI,QAAQ,CAAE;AAC3B,YAAS,IAAI,QAAQ;AACrB,UAAO,QAAQ;AACf,WAAQ,SAAS,QAAQ,QAAQ;;EAEnC,MAAM,YAAY,SAChB,aAAa,cAAc,OAAO,KAAK,GAAG,QAAQ,KAAK;AACzD,UAAQ,SAAS,YAAY;GAC3B,IAAI,OAAO,KAAK;AAChB,QAAK,MAAM,WAAW,SAAS;AAC7B,QAAI,SAAS,IAAI,KAAK,CAAE;AACxB,QAAI,aAAa,cAAe,QAAO,KAAK;IAC5C,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,QAAI,CAAC,MAAO;AACZ,WAAO;;AAET,OAAI,CAAC,QAAS,UAAS,KAAK;QACvB;AACH,QAAI,aAAa,cAAe,QAAO,KAAK;AAC5C,SAAK,MAAM,UAAU,SAAS;KAC5B,MAAM,QAAQ,KAAK,SAAS,IAAI,OAAO,IAAI;AAC3C,SAAI,MAAO,UAAS,MAAM;;;;;CAMlC,QAAc;AACZ,OAAK,KAAK,OAAO,OAAO;AACxB,OAAK,KAAK,SAAS,OAAO;;;;;ACtJ9B,MAAM,4BAAY,IAAI,SAAoB;AAE1C,MAAM,kBAAkB,GAAW,MAAsB;AACvD,KAAI,EAAE,SAAS,WAAW,EAAE,SAAS,QACnC,QAAO,EAAE,SAAS,EAAE,OAAO,IAAI,EAAE,SAAS,UAAU,KAAK;CAC3D,MAAM,SAAS,KAAK,IAAI,EAAE,GAAG,QAAQ,EAAE,GAAG,OAAO;AACjD,MAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IAAK,KAAI,EAAE,GAAG,OAAO,EAAE,GAAG,GAAI,QAAO,QAAQ,EAAE,GAAG,IAAI,EAAE,GAAG,GAAG;AAC1F,QAAO,EAAE,GAAG,SAAS,EAAE,GAAG,UAAU,QAAQ,EAAE,MAAM,EAAE,KAAK;;AAG7D,MAAM,eAAe,YAAiC;CACpD,MAAM,SAAS,EAAE,SAAS;AAC1B,WAAU,IAAI,OAAO;AACrB,QAAO;;;AAIT,MAAa,eAAe,YAAiC;AAC3D,SAAQ,KAAK,eAAe;AAC5B,QAAO,YAAY,QAAQ;;AAG7B,MAAM,QAAQ,OAAgC,aAC5C,OAAO,KAAK,MAAM,CAAC,OAAM,QAAO,SAAS,SAAS,IAAI,CAAC;AACzD,MAAM,WAAW,UAA+C;AAC9D,KAAI,CAAC,MAAM,QAAQ,MAAM,CAAE,QAAO;AAClC,MAAK,MAAM,QAAQ,MAAO,KAAI,OAAO,SAAS,SAAU,QAAO;AAC/D,QAAO;;AAET,MAAM,SAAS,UACb,QAAQ,MAAM,IAAI,IAAI,IAAI,MAAM,CAAC,SAAS,MAAM;AAClD,MAAM,cACJ,OACA,QACuD;AACvD,KAAI,CAAC,cAAc,MAAM,IAAI,OAAO,MAAM,SAAS,SAAU,QAAO;AACpE,KAAI,MAAM,SAAS,QACjB,QAAO,KAAK,OAAO;EAAC;EAAQ;EAAK;EAAQ,CAAC,IAAI,OAAO,OAAO,OAAO,QAAQ;AAC7E,KAAI,MAAM,SAAS,UACjB,QAAO,KAAK,OAAO;EAAC;EAAQ;EAAK;EAAS,CAAC,IAAI,OAAO,OAAO,OAAO,SAAS;AAC/E,QACE,MAAM,SAAS,aACf,KAAK,OAAO;EAAC;EAAQ;EAAK;EAAU;EAAQ,CAAC,IAC7C,OAAO,OAAO,OAAO,SAAS,IAC9B,OAAO,OAAO,OAAO,QAAQ;;AAGjC,MAAM,WAAW,GAAW,MAAe,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI;;AAGtE,MAAa,iBAAiB,UAA8B;AAC1D,KAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,UAAU,IAAI,MAAmB,CAClF,QAAO;AACT,KAAI,CAAC,cAAc,MAAM,IAAI,CAAC,KAAK,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,QAAQ,MAAM,QAAQ,CACrF,QAAOA,KAAW,EAAE,EAAE,mBAAmB,wBAAwB;CACnE,MAAM,SAAmB,EAAE;AAC3B,MAAK,MAAM,SAAS,MAAM,SAAS;AACjC,MAAI,CAAC,cAAc,MAAM,CAAE,QAAOA,KAAW,EAAE,EAAE,mBAAmB,qBAAqB;AACzF,MAAI,MAAM,SAAS,SAAS;AAC1B,OACE,MAAM,QAAQ,WAAW,KACzB,CAAC,KAAK,OAAO;IAAC;IAAQ;IAAU;IAAQ,CAAC,IACzC,CAAC,OAAO,OAAO,OAAO,SAAS,IAC/B,CAAC,OAAO,OAAO,OAAO,QAAQ,CAE9B,QAAOA,KACL,EAAE,EACF,mBACA,2DACD;AACH,UAAO,YAAY,CAAC;IAAE,MAAM;IAAS,QAAQ,MAAM;IAAQ,OAAO,MAAM;IAAO,CAAC,CAAC;;AAEnF,MAAI,CAAC,QAAQ,MAAM,GAAG,CACpB,QAAOA,KAAW,EAAE,EAAE,mBAAmB,yCAAyC;EACpF,MAAM,KAAK,MAAM;AACjB,MACE,MAAM,SAAS,aACf,KAAK,OAAO;GAAC;GAAQ;GAAM;GAAW;GAAQ,CAAC,IAC/C,MAAM,QAAQ,MAAM,QAAQ,KAC3B,MAAM,QAAQ,UAAU,OAAO,OAAO,OAAO,QAAQ,GACtD;GACA,MAAM,uBAAO,IAAI,KAAa;GAC9B,MAAM,UAA0B,EAAE;AAClC,QAAK,MAAM,UAAU,MAAM,SAAS;AAClC,QAAI,CAAC,WAAW,QAAQ,MAAM,IAAI,OAAO,OAAO,QAAQ,YAAY,KAAK,IAAI,OAAO,IAAI,CACtF,QAAOA,KAAW,IAAI,mBAAmB,4CAA4C;AACvF,SAAK,IAAI,OAAO,IAAI;AACpB,YAAQ,KAAK;KAAE,GAAG;KAAQ,KAAK,OAAO;KAAK,CAAC;;GAE9C,MAAM,SAA+C;IACnD,MAAM;IACN;IACA,SAAS,QAAQ,MAAM,GAAG,MAAM,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC;IACvD;AACD,OAAI,OAAO,OAAO,OAAO,QAAQ,EAAE;AACjC,QACE,CAAC,cAAc,MAAM,MAAM,IAC3B,CAAC,KAAK,MAAM,OAAO,CAAC,UAAU,QAAQ,CAAC,IACvC,CAAC,MAAM,MAAM,MAAM,OAAO,IAC1B,CAAC,MAAM,MAAM,MAAM,MAAM,CAEzB,QAAOA,KAAW,IAAI,mBAAmB,6BAA6B;AACxE,WAAO,KAAK;KAAE,GAAG;KAAQ,OAAO;MAAE,QAAQ,MAAM,MAAM;MAAQ,OAAO,MAAM,MAAM;MAAO;KAAE,CAAC;SACtF,QAAO,KAAK,OAAO;aAE1B,MAAM,SAAS,UACf,KAAK,OAAO;GAAC;GAAQ;GAAM;GAAU;GAAS;GAAQ,CAAC,KACtD,MAAM,WAAW,QAAQ,OAAO,MAAM,WAAW,cACjD,MAAM,UAAU,QAAQ,OAAO,MAAM,UAAU,aAChD,MAAM,QAAQ,MAAM,MAAM,EAC1B;GACA,MAAM,uBAAO,IAAI,KAAa;AAC9B,QAAK,MAAM,QAAQ,MAAM,OAAO;AAC9B,QACE,CAAC,WAAW,MAAM,KAAK,IACvB,OAAO,KAAK,OAAO,YACnB,KAAK,IAAI,KAAK,GAAG,IAChB,KAAK,SAAS,WAAW,CAACC,UAAe,KAAK,OAAO,IACrD,KAAK,SAAS,aAAa,CAACA,UAAe,KAAK,MAAM,CAEvD,QAAOD,KAAW,IAAI,mBAAmB,0CAA0C;AACrF,SAAK,IAAI,KAAK,GAAG;;GAEnB,MAAM,QAAQ,MAAM;AACpB,UAAO,KAAK;IACV,MAAM;IACN;IACA,QAAQ,MAAM;IACd,OAAO,MAAM;IACb,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,MAAM,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC;IACtD,CAAC;QACG,QAAOA,KAAW,IAAI,mBAAmB,+BAA+B;;AAEjF,QAAO,YAAY,iBAAiB,OAAO,CAAC;;AAG9C,MAAM,oBAAoB,YAAgC;CACxD,MAAM,SAAS,QAAQ,KAAK,eAAe;CAC3C,MAAM,SAAS,IAAI,cAAoB;CACvC,MAAM,eAAe,IAAI,cAAoB;CAC7C,MAAM,SAAS,IAAI,cAAoB;AACvC,MAAK,MAAM,UAAU,QAAQ;AAC3B,MAAI,OAAO,SAAS,QAAS;AAC7B,MAAI,OAAO,SAAS,WAAW;AAC7B,OAAI,OAAO,MAAM,OAAO,GAAG,EAAE,KAC3B,QAAOA,KAAW,OAAO,IAAI,mBAAmB,0BAA0B;AAC5E,UAAO,IAAI,OAAO,IAAI,KAAK;AAC3B,OAAI,OAAO,OAAO;AAChB,QAAI,aAAa,YAAY,OAAO,GAAG,CACrC,QAAOA,KAAW,OAAO,IAAI,mBAAmB,+BAA+B;AACjF,WAAO,IAAI,OAAO,IAAI,KAAK;;AAE7B,QAAK,MAAM,UAAU,OAAO,SAAS;AACnC,QACE,aAAa,SAAS,OAAO,IAAI,OAAO,IAAI,IAC5C,OAAO,cAAc,OAAO,IAAI,OAAO,IAAI,CAE3C,QAAOA,KACL,OAAO,GAAG,OAAO,OAAO,IAAI,EAC5B,mBACA,kCACD;AACH,iBAAa,IAAI,OAAO,IAAI,MAAM,OAAO,IAAI;;aAEtC,OAAO,SAAS,QAAQ;AACjC,OAAI,aAAa,SAAS,OAAO,GAAG,IAAI,OAAO,cAAc,OAAO,GAAG,CACrE,QAAOA,KAAW,OAAO,IAAI,mBAAmB,gCAAgC;AAClF,gBAAa,IAAI,OAAO,IAAI,KAAK;;;AAGrC,QAAO;;AAGT,MAAa,eAAe,YAA+B;CACzD,IAAI,QAAQ;AACZ,MAAK,MAAM,UAAU,QAAQ,QAC3B,UACE,OAAO,SAAS,YACZ,OAAO,QAAQ,UAAU,OAAO,QAAQ,IAAI,KAC5C,OAAO,SAAS,SACd,IAAI,OAAO,MAAM,SACjB;AACV,QAAO;;;;ACxKT,MAAM,2BAAW,IAAI,SAAuD;AAE5E,MAAa,eACX,SACA,YACS;AACT,UAAS,IAAI,SAAS,QAA2D;;AAWnF,SAAgB,UACd,SACA,WAAW,MAC0B;CACrC,MAAM,UAAU,SAAS,IAAI,QAAQ;AACrC,KAAI,CAAC,WAAW,SAAU,OAAM,IAAI,MAAM,yBAAyB;AACnE,QAAO;;;;ACzBT,MAAa,yBAAyB,SAAiB,WAAqC;CAC1F,MAAM,UAAU,UAAU,QAAQ;AAClC,KAAI,QAAQ,gBAAgB,EAAG,SAAQ,QAAQ,eAAe,OAAO;;AAGvE,MAAa,6BACX,SACA,WAC4B;CAC5B,MAAM,UAAU,UAAU,QAAQ;AAClC,KAAI,QAAQ,OAAQ,OAAM,IAAI,MAAM,4CAA4C;AAChF,SAAQ,SAAS;CACjB,IAAI,SAAS;AACb,QAAO,OAAO,OAAO;EACnB,MAAe,QAAgC;AAC7C,OAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,kDAAkD;AAC/E,WAAQ,eAAe;AACvB,OAAI;AACF,WAAO,KAAK;aACJ;AACR,YAAQ,eAAe;;;EAG3B,eAAqB;AACnB,OAAI,CAAC,OAAQ;AACb,YAAS;AACT,OAAI,QAAQ,WAAW,OAAQ,SAAQ,SAAS,KAAA;;EAEnD,CAAC"}

package/dist/driver-CN3dGxQI.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"driver-CN3dGxQI.cjs","names":["isRecord","isPlainObject","issue.fail","tree.validNode"],"sources":["../core/src/tree/topology.ts","../core/src/mutation/issue.ts","../core/src/address/index.ts","../core/src/mutation/changes.ts","../core/src/runtime/context.ts","../core/src/runtime/driver.ts"],"sourcesContent":["import { isRecord } from '@/value/record';\nexport type MutableTreeNode = { parentId?: string; children: string[]; value?: unknown };\nexport type MutableTree = { rootId?: string; nodes: Record<string, MutableTreeNode> };\nconst node = (tree: MutableTree, id: string) =>\n  Object.hasOwn(tree.nodes, id) ? tree.nodes[id] : undefined;\nexport const is = (value: unknown): value is MutableTree =>\n  isRecord(value) && isRecord(value.nodes);\n\nexport const validNode = (value: unknown): value is MutableTreeNode => {\n  if (!isRecord(value) || !Array.isArray(value.children)) return false;\n  if (value.parentId !== undefined && typeof value.parentId !== 'string') return false;\n  const children = new Set<string>();\n  for (const id of value.children) {\n    if (typeof id !== 'string' || children.has(id)) return false;\n    children.add(id);\n  }\n  return true;\n};\n\nexport const contains = (tree: MutableTree, id: string): boolean => Object.hasOwn(tree.nodes, id);\n\nexport const parent = (tree: MutableTree, id: string): string | undefined =>\n  node(tree, id)?.parentId;\n\nexport const children = (tree: MutableTree, id: string): readonly string[] | undefined =>\n  node(tree, id)?.children;\n\nexport const validate = (value: unknown): value is MutableTree => {\n  if (!is(value)) return false;\n  const ids = Object.keys(value.nodes);\n  if (ids.length === 0) return value.rootId === undefined;\n  if (typeof value.rootId !== 'string' || !Object.hasOwn(value.nodes, value.rootId)) return false;\n\n  for (const id of ids) {\n    const entry = value.nodes[id];\n    if (!validNode(entry)) return false;\n    if (id === value.rootId) {\n      if (entry.parentId !== undefined) return false;\n    } else if (entry.parentId === undefined || !Object.hasOwn(value.nodes, entry.parentId))\n      return false;\n    for (const child of entry.children) {\n      const childNode = value.nodes[child];\n      if (!childNode || childNode.parentId !== id) return false;\n    }\n  }\n\n  const seen = new Set<string>();\n  const stack = [value.rootId];\n  while (stack.length) {\n    const id = stack.pop() as string;\n    if (seen.has(id)) return false;\n    seen.add(id);\n    const entry = value.nodes[id];\n    if (!entry) return false;\n    for (const child of entry.children) stack.push(child);\n  }\n  return seen.size === ids.length;\n};\n\nexport type TreePosition = { readonly parentId?: string; readonly index?: number };\n","import type { DocumentAddress } from '@/schema/model';\nimport type { ParseIssue } from '@/schema/value';\n\nexport type MutationIssueCode =\n  | 'invalid-address'\n  | 'invalid-value'\n  | 'invalid-key'\n  | 'invalid-changes'\n  | 'baseline-mismatch'\n  | 'required-field'\n  | 'invalid-anchor'\n  | 'duplicate-entity'\n  | 'missing-entity'\n  | 'invalid-collection'\n  | 'invalid-list-keys'\n  | 'invalid-list-key'\n  | 'duplicate-list-item'\n  | 'missing-list-item'\n  | 'invalid-tree'\n  | 'duplicate-tree-node'\n  | 'missing-tree-parent'\n  | 'invalid-tree-index'\n  | 'missing-tree-node'\n  | 'tree-cycle';\nexport type MutationIssue = {\n  readonly source: 'mutation';\n  readonly code: MutationIssueCode;\n  readonly address: DocumentAddress;\n  readonly message: string;\n};\nexport const at = (\n  address: DocumentAddress,\n  code: MutationIssueCode,\n  message: string\n): MutationIssue =>\n  Object.freeze({ source: 'mutation', code, address: Object.freeze([...address]), message });\nexport class MutationRejected extends Error {\n  constructor(readonly issue: MutationIssue) {\n    super(issue.message);\n  }\n}\nexport const fail = (address: DocumentAddress, code: MutationIssueCode, message: string): never => {\n  throw new MutationRejected(at(address, code, message));\n};\n\nexport const invalidValue = (issue: ParseIssue, address = issue.address): never =>\n  fail(address, issue.code === 'missing-validator' ? 'invalid-value' : issue.code, issue.message);\n","import type { DocumentAddress } from '@/schema/model';\n\ntype AddressIndexNode<T> = {\n  readonly children: Map<string, AddressIndexNode<T>>;\n  readonly values: Set<T>;\n};\n\nexport class AddressIndex<T> {\n  private readonly root: AddressIndexNode<T> = { children: new Map(), values: new Set() };\n\n  add(address: DocumentAddress, value: T, member?: string): void {\n    let node = this.root;\n    for (let index = 0; index < address.length + (member === undefined ? 0 : 1); index++) {\n      const segment = index < address.length ? address[index] : member!;\n      let child = node.children.get(segment);\n      if (!child) {\n        child = { children: new Map(), values: new Set() };\n        node.children.set(segment, child);\n      }\n      node = child;\n    }\n    node.values.add(value);\n  }\n\n  delete(address: DocumentAddress, value: T, member?: string): void {\n    const parents: AddressIndexNode<T>[] = [];\n    let node = this.root;\n    const length = address.length + (member === undefined ? 0 : 1);\n    for (let index = 0; index < length; index++) {\n      const segment = index < address.length ? address[index] : member!;\n      const child = node.children.get(segment);\n      if (!child) return;\n      parents.push(node);\n      node = child;\n    }\n    node.values.delete(value);\n    for (let index = length - 1; index >= 0 && !node.values.size && !node.children.size; index--) {\n      node = parents[index];\n      node.children.delete(index < address.length ? address[index] : member!);\n    }\n  }\n\n  exact(address: DocumentAddress): ReadonlySet<T> | undefined {\n    let node = this.root;\n    for (const segment of address) {\n      const child = node.children.get(segment);\n      if (!child) return undefined;\n      node = child;\n    }\n    return node.values;\n  }\n\n  hasAncestor(address: DocumentAddress, strict = false): boolean {\n    let node = this.root;\n    for (let index = 0; index < address.length; index++) {\n      if (node.values.size) return true;\n      const child = node.children.get(address[index]);\n      if (!child) return false;\n      node = child;\n    }\n    return !strict && node.values.size > 0;\n  }\n\n  someAncestor(address: DocumentAddress, predicate: (value: T) => boolean): boolean {\n    let node = this.root;\n    for (let index = 0; ; index++) {\n      for (const value of node.values) if (predicate(value)) return true;\n      if (index === address.length) return false;\n      const child = node.children.get(address[index]);\n      if (!child) return false;\n      node = child;\n    }\n  }\n\n  overlaps(address: DocumentAddress, member?: string): boolean {\n    let node = this.root;\n    const length = address.length + (member === undefined ? 0 : 1);\n    for (let index = 0; index < length; index++) {\n      if (node.values.size) return true;\n      const segment = index < address.length ? address[index] : member!;\n      const child = node.children.get(segment);\n      if (!child) return false;\n      node = child;\n    }\n    return node.values.size > 0 || node.children.size > 0;\n  }\n\n  hasDescendant(address: DocumentAddress, member?: string): boolean {\n    let node = this.root;\n    const length = address.length + (member === undefined ? 0 : 1);\n    for (let index = 0; index < length; index++) {\n      const segment = index < address.length ? address[index] : member!;\n      const child = node.children.get(segment);\n      if (!child) return false;\n      node = child;\n    }\n    return node.values.size > 0 || node.children.size > 0;\n  }\n\n  /** Visit one address' ancestors and descendants without batch de-duplication state. */\n  forEachOverlap(address: DocumentAddress, visit: (value: T) => void): void {\n    let node = this.root;\n    for (const segment of address) {\n      node.values.forEach(visit);\n      const child = node.children.get(segment);\n      if (!child) return;\n      node = child;\n    }\n    const descend = (current: AddressIndexNode<T>): void => {\n      current.values.forEach(visit);\n      current.children.forEach(descend);\n    };\n    descend(node);\n  }\n\n  query(\n    visit: (value: T) => void,\n    relation: 'overlap' | 'ancestors' | 'descendants' = 'overlap'\n  ): (address: DocumentAddress, members?: readonly { readonly key: string }[]) => void {\n    const visited = new Set<AddressIndexNode<T>>();\n    const subtrees = new Set<AddressIndexNode<T>>();\n    const values = (node: AddressIndexNode<T>) => {\n      if (visited.has(node)) return;\n      visited.add(node);\n      node.values.forEach(visit);\n    };\n    const descend = (current: AddressIndexNode<T>): void => {\n      if (subtrees.has(current)) return;\n      subtrees.add(current);\n      values(current);\n      current.children.forEach(descend);\n    };\n    const terminal = (node: AddressIndexNode<T>) =>\n      relation === 'ancestors' ? values(node) : descend(node);\n    return (address, members) => {\n      let node = this.root;\n      for (const segment of address) {\n        if (subtrees.has(node)) return;\n        if (relation !== 'descendants') values(node);\n        const child = node.children.get(segment);\n        if (!child) return;\n        node = child;\n      }\n      if (!members) terminal(node);\n      else {\n        if (relation !== 'descendants') values(node);\n        for (const member of members) {\n          const child = node.children.get(member.key);\n          if (child) terminal(child);\n        }\n      }\n    };\n  }\n\n  clear(): void {\n    this.root.values.clear();\n    this.root.children.clear();\n  }\n}\n","import type { Change, ChangeSet, MemberChange, ValueTransition } from '@/changes';\nimport { AddressIndex } from '@/address/index';\nimport { isPlainObject } from '@/value/record';\nimport * as issue from './issue';\nimport * as tree from '@/tree/topology';\n\nconst validated = new WeakSet<ChangeSet>();\n\nconst compareChanges = (a: Change, b: Change): number => {\n  if (a.kind === 'reset' || b.kind === 'reset')\n    return a.kind === b.kind ? 0 : a.kind === 'reset' ? -1 : 1;\n  const length = Math.min(a.at.length, b.at.length);\n  for (let i = 0; i < length; i++) if (a.at[i] !== b.at[i]) return lexical(a.at[i], b.at[i]);\n  return a.at.length - b.at.length || lexical(a.kind, b.kind);\n};\n\nconst publication = (changes: Change[]): ChangeSet => {\n  const result = { changes };\n  validated.add(result);\n  return result;\n};\n\n/** Register complete recorder groups; unknown input is validated separately. */\nexport const sealChanges = (changes: Change[]): ChangeSet => {\n  changes.sort(compareChanges);\n  return publication(changes);\n};\n\nconst keys = (value: Record<string, unknown>, expected: readonly string[]) =>\n  Object.keys(value).every(key => expected.includes(key));\nconst strings = (value: unknown): value is readonly string[] => {\n  if (!Array.isArray(value)) return false;\n  for (const item of value) if (typeof item !== 'string') return false;\n  return true;\n};\nconst order = (value: unknown): value is readonly string[] =>\n  strings(value) && new Set(value).size === value.length;\nconst transition = (\n  value: unknown,\n  key: 'key' | 'id'\n): value is ValueTransition & Record<string, unknown> => {\n  if (!isPlainObject(value) || typeof value[key] !== 'string') return false;\n  if (value.kind === 'added')\n    return keys(value, ['kind', key, 'after']) && Object.hasOwn(value, 'after');\n  if (value.kind === 'removed')\n    return keys(value, ['kind', key, 'before']) && Object.hasOwn(value, 'before');\n  return (\n    value.kind === 'updated' &&\n    keys(value, ['kind', key, 'before', 'after']) &&\n    Object.hasOwn(value, 'before') &&\n    Object.hasOwn(value, 'after')\n  );\n};\nconst lexical = (a: string, b: string) => (a < b ? -1 : a === b ? 0 : 1);\n\n/** The sole unknown ChangeSet boundary, including normalized logical-address conflicts. */\nexport const decodeChanges = (input: unknown): ChangeSet => {\n  if (typeof input === 'object' && input !== null && validated.has(input as ChangeSet))\n    return input as ChangeSet;\n  if (!isPlainObject(input) || !keys(input, ['changes']) || !Array.isArray(input.changes))\n    return issue.fail([], 'invalid-changes', 'Expected a ChangeSet.');\n  const result: Change[] = [];\n  for (const entry of input.changes) {\n    if (!isPlainObject(entry)) return issue.fail([], 'invalid-changes', 'Expected a change.');\n    if (entry.kind === 'reset') {\n      if (\n        input.changes.length !== 1 ||\n        !keys(entry, ['kind', 'before', 'after']) ||\n        !Object.hasOwn(entry, 'before') ||\n        !Object.hasOwn(entry, 'after')\n      )\n        return issue.fail(\n          [],\n          'invalid-changes',\n          'A reset must be the only change and contain both values.'\n        );\n      return sealChanges([{ kind: 'reset', before: entry.before, after: entry.after }]);\n    }\n    if (!strings(entry.at))\n      return issue.fail([], 'invalid-changes', 'Change addresses must contain strings.');\n    const at = entry.at;\n    if (\n      entry.kind === 'members' &&\n      keys(entry, ['kind', 'at', 'members', 'order']) &&\n      Array.isArray(entry.members) &&\n      (entry.members.length || Object.hasOwn(entry, 'order'))\n    ) {\n      const seen = new Set<string>();\n      const members: MemberChange[] = [];\n      for (const member of entry.members) {\n        if (!transition(member, 'key') || typeof member.key !== 'string' || seen.has(member.key))\n          return issue.fail(at, 'invalid-changes', 'Malformed or duplicate member transition.');\n        seen.add(member.key);\n        members.push({ ...member, key: member.key });\n      }\n      const change: Extract<Change, { kind: 'members' }> = {\n        kind: 'members',\n        at,\n        members: members.sort((a, b) => lexical(a.key, b.key)),\n      };\n      if (Object.hasOwn(entry, 'order')) {\n        if (\n          !isPlainObject(entry.order) ||\n          !keys(entry.order, ['before', 'after']) ||\n          !order(entry.order.before) ||\n          !order(entry.order.after)\n        )\n          return issue.fail(at, 'invalid-changes', 'Malformed container order.');\n        result.push({ ...change, order: { before: entry.order.before, after: entry.order.after } });\n      } else result.push(change);\n    } else if (\n      entry.kind === 'tree' &&\n      keys(entry, ['kind', 'at', 'before', 'after', 'nodes']) &&\n      (entry.before === null || typeof entry.before === 'string') &&\n      (entry.after === null || typeof entry.after === 'string') &&\n      Array.isArray(entry.nodes)\n    ) {\n      const seen = new Set<string>();\n      for (const node of entry.nodes) {\n        if (\n          !transition(node, 'id') ||\n          typeof node.id !== 'string' ||\n          seen.has(node.id) ||\n          (node.kind !== 'added' && !tree.validNode(node.before)) ||\n          (node.kind !== 'removed' && !tree.validNode(node.after))\n        )\n          return issue.fail(at, 'invalid-changes', 'Malformed or duplicate tree transition.');\n        seen.add(node.id);\n      }\n      const nodes = entry.nodes as Extract<Change, { kind: 'tree' }>['nodes'];\n      result.push({\n        kind: 'tree',\n        at,\n        before: entry.before,\n        after: entry.after,\n        nodes: [...nodes].sort((a, b) => lexical(a.id, b.id)),\n      });\n    } else return issue.fail(at, 'invalid-changes', 'Unknown or malformed change.');\n  }\n  return publication(normalizeChanges(result));\n};\n\nconst normalizeChanges = (changes: Change[]): Change[] => {\n  const sorted = changes.sort(compareChanges);\n  const groups = new AddressIndex<true>();\n  const replacements = new AddressIndex<true>();\n  const orders = new AddressIndex<true>();\n  for (const change of sorted) {\n    if (change.kind === 'reset') continue;\n    if (change.kind === 'members') {\n      if (groups.exact(change.at)?.size)\n        return issue.fail(change.at, 'invalid-changes', 'Duplicate member group.');\n      groups.add(change.at, true);\n      if (change.order) {\n        if (replacements.hasAncestor(change.at))\n          return issue.fail(change.at, 'invalid-changes', 'Overlapping container order.');\n        orders.add(change.at, true);\n      }\n      for (const member of change.members) {\n        if (\n          replacements.overlaps(change.at, member.key) ||\n          orders.hasDescendant(change.at, member.key)\n        )\n          return issue.fail(\n            change.at.concat(member.key),\n            'invalid-changes',\n            'Overlapping member transitions.'\n          );\n        replacements.add(change.at, true, member.key);\n      }\n    } else if (change.kind === 'tree') {\n      if (replacements.overlaps(change.at) || orders.hasDescendant(change.at))\n        return issue.fail(change.at, 'invalid-changes', 'Overlapping tree transitions.');\n      replacements.add(change.at, true);\n    }\n  }\n  return sorted;\n};\n\nexport const changeCount = (changes: ChangeSet): number => {\n  let count = 0;\n  for (const change of changes.changes)\n    count +=\n      change.kind === 'members'\n        ? change.members.length + (change.order ? 1 : 0)\n        : change.kind === 'tree'\n          ? 1 + change.nodes.length\n          : 1;\n  return count;\n};\n","import type { Infer, ObjectSchema, RootNodeOf } from '@/schema/model';\nimport type { DocumentRuntime } from './contract';\nimport type { RuntimeWriteDriver } from './driver';\nimport type { NotificationCenter } from './notification';\n\nexport type RuntimeState<TSchema extends ObjectSchema<object>> = {\n  readonly schema: RootNodeOf<TSchema>;\n  document: Infer<TSchema>;\n  disposed: boolean;\n  projectionLocks: number;\n};\n\nexport type RuntimeContext<TSchema extends ObjectSchema<object>> = {\n  readonly state: RuntimeState<TSchema>;\n  readonly owner: DocumentRuntime<TSchema>;\n  readonly notifications: NotificationCenter<TSchema>;\n  driver: RuntimeWriteDriver | undefined;\n  bypassDepth: number;\n};\n\nconst contexts = new WeakMap<object, RuntimeContext<ObjectSchema<object>>>();\n\nexport const bindContext = <TSchema extends ObjectSchema<object>>(\n  subject: object,\n  context: RuntimeContext<TSchema>\n): void => {\n  contexts.set(subject, context as unknown as RuntimeContext<ObjectSchema<object>>);\n};\n\nexport function contextOf<TSchema extends ObjectSchema<object>>(\n  subject: object,\n  required?: true\n): RuntimeContext<TSchema>;\nexport function contextOf<TSchema extends ObjectSchema<object>>(\n  subject: object,\n  required: false\n): RuntimeContext<TSchema> | undefined;\nexport function contextOf<TSchema extends ObjectSchema<object>>(\n  subject: object,\n  required = true\n): RuntimeContext<TSchema> | undefined {\n  const context = contexts.get(subject);\n  if (!context && required) throw new Error('Unknown Doxum runtime.');\n  return context as unknown as RuntimeContext<TSchema> | undefined;\n}\n","import type { CommitSource, DocumentRuntime } from './contract';\nimport type { ObjectSchema } from '@/schema/model';\nimport { contextOf } from './context';\n\nexport type RuntimeWriteIntent =\n  | { readonly kind: 'update'; readonly source: Extract<CommitSource, 'local' | 'system'> }\n  | { readonly kind: 'apply'; readonly source: CommitSource }\n  | { readonly kind: 'replace'; readonly source: Extract<CommitSource, 'system' | 'remote'> };\n\nexport type RuntimeWriteDriver = {\n  readonly assertWritable: (intent: RuntimeWriteIntent) => void;\n};\n\nexport type RuntimeWriteDriverLease = {\n  readonly run: <TResult>(run: () => TResult) => TResult;\n  readonly dispose: () => void;\n};\n\nexport const assertRuntimeWritable = (runtime: object, intent: RuntimeWriteIntent): void => {\n  const context = contextOf(runtime);\n  if (context.bypassDepth === 0) context.driver?.assertWritable(intent);\n};\n\nexport const installRuntimeWriteDriver = <TSchema extends ObjectSchema<object>>(\n  runtime: DocumentRuntime<TSchema>,\n  driver: RuntimeWriteDriver\n): RuntimeWriteDriverLease => {\n  const context = contextOf(runtime);\n  if (context.driver) throw new Error('Doxum runtime already has a write driver.');\n  context.driver = driver;\n  let active = true;\n  return Object.freeze({\n    run: <TResult>(run: () => TResult): TResult => {\n      if (!active) throw new Error('Doxum runtime write driver is no longer active.');\n      context.bypassDepth += 1;\n      try {\n        return run();\n      } finally {\n        context.bypassDepth -= 1;\n      }\n    },\n    dispose: (): void => {\n      if (!active) return;\n      active = false;\n      if (context.driver === driver) context.driver = undefined;\n    },\n  });\n};\n"],"mappings":";;AAGA,MAAM,QAAQ,MAAmB,OAC/B,OAAO,OAAO,KAAK,OAAO,GAAG,GAAG,KAAK,MAAM,MAAM,KAAA;AACnD,MAAa,MAAM,UACjBA,eAAAA,SAAS,MAAM,IAAIA,eAAAA,SAAS,MAAM,MAAM;AAE1C,MAAa,aAAa,UAA6C;AACrE,KAAI,CAACA,eAAAA,SAAS,MAAM,IAAI,CAAC,MAAM,QAAQ,MAAM,SAAS,CAAE,QAAO;AAC/D,KAAI,MAAM,aAAa,KAAA,KAAa,OAAO,MAAM,aAAa,SAAU,QAAO;CAC/E,MAAM,2BAAW,IAAI,KAAa;AAClC,MAAK,MAAM,MAAM,MAAM,UAAU;AAC/B,MAAI,OAAO,OAAO,YAAY,SAAS,IAAI,GAAG,CAAE,QAAO;AACvD,WAAS,IAAI,GAAG;;AAElB,QAAO;;AAGT,MAAa,YAAY,MAAmB,OAAwB,OAAO,OAAO,KAAK,OAAO,GAAG;AAEjG,MAAa,UAAU,MAAmB,OACxC,KAAK,MAAM,GAAG,EAAE;AAElB,MAAa,YAAY,MAAmB,OAC1C,KAAK,MAAM,GAAG,EAAE;AAElB,MAAa,YAAY,UAAyC;AAChE,KAAI,CAAC,GAAG,MAAM,CAAE,QAAO;CACvB,MAAM,MAAM,OAAO,KAAK,MAAM,MAAM;AACpC,KAAI,IAAI,WAAW,EAAG,QAAO,MAAM,WAAW,KAAA;AAC9C,KAAI,OAAO,MAAM,WAAW,YAAY,CAAC,OAAO,OAAO,MAAM,OAAO,MAAM,OAAO,CAAE,QAAO;AAE1F,MAAK,MAAM,MAAM,KAAK;EACpB,MAAM,QAAQ,MAAM,MAAM;AAC1B,MAAI,CAAC,UAAU,MAAM,CAAE,QAAO;AAC9B,MAAI,OAAO,MAAM;OACX,MAAM,aAAa,KAAA,EAAW,QAAO;aAChC,MAAM,aAAa,KAAA,KAAa,CAAC,OAAO,OAAO,MAAM,OAAO,MAAM,SAAS,CACpF,QAAO;AACT,OAAK,MAAM,SAAS,MAAM,UAAU;GAClC,MAAM,YAAY,MAAM,MAAM;AAC9B,OAAI,CAAC,aAAa,UAAU,aAAa,GAAI,QAAO;;;CAIxD,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,QAAQ,CAAC,MAAM,OAAO;AAC5B,QAAO,MAAM,QAAQ;EACnB,MAAM,KAAK,MAAM,KAAK;AACtB,MAAI,KAAK,IAAI,GAAG,CAAE,QAAO;AACzB,OAAK,IAAI,GAAG;EACZ,MAAM,QAAQ,MAAM,MAAM;AAC1B,MAAI,CAAC,MAAO,QAAO;AACnB,OAAK,MAAM,SAAS,MAAM,SAAU,OAAM,KAAK,MAAM;;AAEvD,QAAO,KAAK,SAAS,IAAI;;;;AC1B3B,MAAa,MACX,SACA,MACA,YAEA,OAAO,OAAO;CAAE,QAAQ;CAAY;CAAM,SAAS,OAAO,OAAO,CAAC,GAAG,QAAQ,CAAC;CAAE;CAAS,CAAC;AAC5F,IAAa,mBAAb,cAAsC,MAAM;CAC1C,YAAY,OAA+B;AACzC,QAAM,MAAM,QAAQ;AADD,OAAA,QAAA;;;AAIvB,MAAa,QAAQ,SAA0B,MAAyB,YAA2B;AACjG,OAAM,IAAI,iBAAiB,GAAG,SAAS,MAAM,QAAQ,CAAC;;AAGxD,MAAa,gBAAgB,OAAmB,UAAU,MAAM,YAC9D,KAAK,SAAS,MAAM,SAAS,sBAAsB,kBAAkB,MAAM,MAAM,MAAM,QAAQ;;;ACvCjG,IAAa,eAAb,MAA6B;CAC3B,OAA6C;EAAE,0BAAU,IAAI,KAAK;EAAE,wBAAQ,IAAI,KAAK;EAAE;CAEvF,IAAI,SAA0B,OAAU,QAAuB;EAC7D,IAAI,OAAO,KAAK;AAChB,OAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,UAAU,WAAW,KAAA,IAAY,IAAI,IAAI,SAAS;GACpF,MAAM,UAAU,QAAQ,QAAQ,SAAS,QAAQ,SAAS;GAC1D,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACtC,OAAI,CAAC,OAAO;AACV,YAAQ;KAAE,0BAAU,IAAI,KAAK;KAAE,wBAAQ,IAAI,KAAK;KAAE;AAClD,SAAK,SAAS,IAAI,SAAS,MAAM;;AAEnC,UAAO;;AAET,OAAK,OAAO,IAAI,MAAM;;CAGxB,OAAO,SAA0B,OAAU,QAAuB;EAChE,MAAM,UAAiC,EAAE;EACzC,IAAI,OAAO,KAAK;EAChB,MAAM,SAAS,QAAQ,UAAU,WAAW,KAAA,IAAY,IAAI;AAC5D,OAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,SAAS;GAC3C,MAAM,UAAU,QAAQ,QAAQ,SAAS,QAAQ,SAAS;GAC1D,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,OAAI,CAAC,MAAO;AACZ,WAAQ,KAAK,KAAK;AAClB,UAAO;;AAET,OAAK,OAAO,OAAO,MAAM;AACzB,OAAK,IAAI,QAAQ,SAAS,GAAG,SAAS,KAAK,CAAC,KAAK,OAAO,QAAQ,CAAC,KAAK,SAAS,MAAM,SAAS;AAC5F,UAAO,QAAQ;AACf,QAAK,SAAS,OAAO,QAAQ,QAAQ,SAAS,QAAQ,SAAS,OAAQ;;;CAI3E,MAAM,SAAsD;EAC1D,IAAI,OAAO,KAAK;AAChB,OAAK,MAAM,WAAW,SAAS;GAC7B,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,OAAI,CAAC,MAAO,QAAO,KAAA;AACnB,UAAO;;AAET,SAAO,KAAK;;CAGd,YAAY,SAA0B,SAAS,OAAgB;EAC7D,IAAI,OAAO,KAAK;AAChB,OAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS;AACnD,OAAI,KAAK,OAAO,KAAM,QAAO;GAC7B,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ,OAAO;AAC/C,OAAI,CAAC,MAAO,QAAO;AACnB,UAAO;;AAET,SAAO,CAAC,UAAU,KAAK,OAAO,OAAO;;CAGvC,aAAa,SAA0B,WAA2C;EAChF,IAAI,OAAO,KAAK;AAChB,OAAK,IAAI,QAAQ,IAAK,SAAS;AAC7B,QAAK,MAAM,SAAS,KAAK,OAAQ,KAAI,UAAU,MAAM,CAAE,QAAO;AAC9D,OAAI,UAAU,QAAQ,OAAQ,QAAO;GACrC,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ,OAAO;AAC/C,OAAI,CAAC,MAAO,QAAO;AACnB,UAAO;;;CAIX,SAAS,SAA0B,QAA0B;EAC3D,IAAI,OAAO,KAAK;EAChB,MAAM,SAAS,QAAQ,UAAU,WAAW,KAAA,IAAY,IAAI;AAC5D,OAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,SAAS;AAC3C,OAAI,KAAK,OAAO,KAAM,QAAO;GAC7B,MAAM,UAAU,QAAQ,QAAQ,SAAS,QAAQ,SAAS;GAC1D,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,OAAI,CAAC,MAAO,QAAO;AACnB,UAAO;;AAET,SAAO,KAAK,OAAO,OAAO,KAAK,KAAK,SAAS,OAAO;;CAGtD,cAAc,SAA0B,QAA0B;EAChE,IAAI,OAAO,KAAK;EAChB,MAAM,SAAS,QAAQ,UAAU,WAAW,KAAA,IAAY,IAAI;AAC5D,OAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,SAAS;GAC3C,MAAM,UAAU,QAAQ,QAAQ,SAAS,QAAQ,SAAS;GAC1D,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,OAAI,CAAC,MAAO,QAAO;AACnB,UAAO;;AAET,SAAO,KAAK,OAAO,OAAO,KAAK,KAAK,SAAS,OAAO;;;CAItD,eAAe,SAA0B,OAAiC;EACxE,IAAI,OAAO,KAAK;AAChB,OAAK,MAAM,WAAW,SAAS;AAC7B,QAAK,OAAO,QAAQ,MAAM;GAC1B,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,OAAI,CAAC,MAAO;AACZ,UAAO;;EAET,MAAM,WAAW,YAAuC;AACtD,WAAQ,OAAO,QAAQ,MAAM;AAC7B,WAAQ,SAAS,QAAQ,QAAQ;;AAEnC,UAAQ,KAAK;;CAGf,MACE,OACA,WAAoD,WAC+B;EACnF,MAAM,0BAAU,IAAI,KAA0B;EAC9C,MAAM,2BAAW,IAAI,KAA0B;EAC/C,MAAM,UAAU,SAA8B;AAC5C,OAAI,QAAQ,IAAI,KAAK,CAAE;AACvB,WAAQ,IAAI,KAAK;AACjB,QAAK,OAAO,QAAQ,MAAM;;EAE5B,MAAM,WAAW,YAAuC;AACtD,OAAI,SAAS,IAAI,QAAQ,CAAE;AAC3B,YAAS,IAAI,QAAQ;AACrB,UAAO,QAAQ;AACf,WAAQ,SAAS,QAAQ,QAAQ;;EAEnC,MAAM,YAAY,SAChB,aAAa,cAAc,OAAO,KAAK,GAAG,QAAQ,KAAK;AACzD,UAAQ,SAAS,YAAY;GAC3B,IAAI,OAAO,KAAK;AAChB,QAAK,MAAM,WAAW,SAAS;AAC7B,QAAI,SAAS,IAAI,KAAK,CAAE;AACxB,QAAI,aAAa,cAAe,QAAO,KAAK;IAC5C,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,QAAI,CAAC,MAAO;AACZ,WAAO;;AAET,OAAI,CAAC,QAAS,UAAS,KAAK;QACvB;AACH,QAAI,aAAa,cAAe,QAAO,KAAK;AAC5C,SAAK,MAAM,UAAU,SAAS;KAC5B,MAAM,QAAQ,KAAK,SAAS,IAAI,OAAO,IAAI;AAC3C,SAAI,MAAO,UAAS,MAAM;;;;;CAMlC,QAAc;AACZ,OAAK,KAAK,OAAO,OAAO;AACxB,OAAK,KAAK,SAAS,OAAO;;;;;ACtJ9B,MAAM,4BAAY,IAAI,SAAoB;AAE1C,MAAM,kBAAkB,GAAW,MAAsB;AACvD,KAAI,EAAE,SAAS,WAAW,EAAE,SAAS,QACnC,QAAO,EAAE,SAAS,EAAE,OAAO,IAAI,EAAE,SAAS,UAAU,KAAK;CAC3D,MAAM,SAAS,KAAK,IAAI,EAAE,GAAG,QAAQ,EAAE,GAAG,OAAO;AACjD,MAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IAAK,KAAI,EAAE,GAAG,OAAO,EAAE,GAAG,GAAI,QAAO,QAAQ,EAAE,GAAG,IAAI,EAAE,GAAG,GAAG;AAC1F,QAAO,EAAE,GAAG,SAAS,EAAE,GAAG,UAAU,QAAQ,EAAE,MAAM,EAAE,KAAK;;AAG7D,MAAM,eAAe,YAAiC;CACpD,MAAM,SAAS,EAAE,SAAS;AAC1B,WAAU,IAAI,OAAO;AACrB,QAAO;;;AAIT,MAAa,eAAe,YAAiC;AAC3D,SAAQ,KAAK,eAAe;AAC5B,QAAO,YAAY,QAAQ;;AAG7B,MAAM,QAAQ,OAAgC,aAC5C,OAAO,KAAK,MAAM,CAAC,OAAM,QAAO,SAAS,SAAS,IAAI,CAAC;AACzD,MAAM,WAAW,UAA+C;AAC9D,KAAI,CAAC,MAAM,QAAQ,MAAM,CAAE,QAAO;AAClC,MAAK,MAAM,QAAQ,MAAO,KAAI,OAAO,SAAS,SAAU,QAAO;AAC/D,QAAO;;AAET,MAAM,SAAS,UACb,QAAQ,MAAM,IAAI,IAAI,IAAI,MAAM,CAAC,SAAS,MAAM;AAClD,MAAM,cACJ,OACA,QACuD;AACvD,KAAI,CAACC,eAAAA,cAAc,MAAM,IAAI,OAAO,MAAM,SAAS,SAAU,QAAO;AACpE,KAAI,MAAM,SAAS,QACjB,QAAO,KAAK,OAAO;EAAC;EAAQ;EAAK;EAAQ,CAAC,IAAI,OAAO,OAAO,OAAO,QAAQ;AAC7E,KAAI,MAAM,SAAS,UACjB,QAAO,KAAK,OAAO;EAAC;EAAQ;EAAK;EAAS,CAAC,IAAI,OAAO,OAAO,OAAO,SAAS;AAC/E,QACE,MAAM,SAAS,aACf,KAAK,OAAO;EAAC;EAAQ;EAAK;EAAU;EAAQ,CAAC,IAC7C,OAAO,OAAO,OAAO,SAAS,IAC9B,OAAO,OAAO,OAAO,QAAQ;;AAGjC,MAAM,WAAW,GAAW,MAAe,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI;;AAGtE,MAAa,iBAAiB,UAA8B;AAC1D,KAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,UAAU,IAAI,MAAmB,CAClF,QAAO;AACT,KAAI,CAACA,eAAAA,cAAc,MAAM,IAAI,CAAC,KAAK,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,QAAQ,MAAM,QAAQ,CACrF,QAAOC,KAAW,EAAE,EAAE,mBAAmB,wBAAwB;CACnE,MAAM,SAAmB,EAAE;AAC3B,MAAK,MAAM,SAAS,MAAM,SAAS;AACjC,MAAI,CAACD,eAAAA,cAAc,MAAM,CAAE,QAAOC,KAAW,EAAE,EAAE,mBAAmB,qBAAqB;AACzF,MAAI,MAAM,SAAS,SAAS;AAC1B,OACE,MAAM,QAAQ,WAAW,KACzB,CAAC,KAAK,OAAO;IAAC;IAAQ;IAAU;IAAQ,CAAC,IACzC,CAAC,OAAO,OAAO,OAAO,SAAS,IAC/B,CAAC,OAAO,OAAO,OAAO,QAAQ,CAE9B,QAAOA,KACL,EAAE,EACF,mBACA,2DACD;AACH,UAAO,YAAY,CAAC;IAAE,MAAM;IAAS,QAAQ,MAAM;IAAQ,OAAO,MAAM;IAAO,CAAC,CAAC;;AAEnF,MAAI,CAAC,QAAQ,MAAM,GAAG,CACpB,QAAOA,KAAW,EAAE,EAAE,mBAAmB,yCAAyC;EACpF,MAAM,KAAK,MAAM;AACjB,MACE,MAAM,SAAS,aACf,KAAK,OAAO;GAAC;GAAQ;GAAM;GAAW;GAAQ,CAAC,IAC/C,MAAM,QAAQ,MAAM,QAAQ,KAC3B,MAAM,QAAQ,UAAU,OAAO,OAAO,OAAO,QAAQ,GACtD;GACA,MAAM,uBAAO,IAAI,KAAa;GAC9B,MAAM,UAA0B,EAAE;AAClC,QAAK,MAAM,UAAU,MAAM,SAAS;AAClC,QAAI,CAAC,WAAW,QAAQ,MAAM,IAAI,OAAO,OAAO,QAAQ,YAAY,KAAK,IAAI,OAAO,IAAI,CACtF,QAAOA,KAAW,IAAI,mBAAmB,4CAA4C;AACvF,SAAK,IAAI,OAAO,IAAI;AACpB,YAAQ,KAAK;KAAE,GAAG;KAAQ,KAAK,OAAO;KAAK,CAAC;;GAE9C,MAAM,SAA+C;IACnD,MAAM;IACN;IACA,SAAS,QAAQ,MAAM,GAAG,MAAM,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC;IACvD;AACD,OAAI,OAAO,OAAO,OAAO,QAAQ,EAAE;AACjC,QACE,CAACD,eAAAA,cAAc,MAAM,MAAM,IAC3B,CAAC,KAAK,MAAM,OAAO,CAAC,UAAU,QAAQ,CAAC,IACvC,CAAC,MAAM,MAAM,MAAM,OAAO,IAC1B,CAAC,MAAM,MAAM,MAAM,MAAM,CAEzB,QAAOC,KAAW,IAAI,mBAAmB,6BAA6B;AACxE,WAAO,KAAK;KAAE,GAAG;KAAQ,OAAO;MAAE,QAAQ,MAAM,MAAM;MAAQ,OAAO,MAAM,MAAM;MAAO;KAAE,CAAC;SACtF,QAAO,KAAK,OAAO;aAE1B,MAAM,SAAS,UACf,KAAK,OAAO;GAAC;GAAQ;GAAM;GAAU;GAAS;GAAQ,CAAC,KACtD,MAAM,WAAW,QAAQ,OAAO,MAAM,WAAW,cACjD,MAAM,UAAU,QAAQ,OAAO,MAAM,UAAU,aAChD,MAAM,QAAQ,MAAM,MAAM,EAC1B;GACA,MAAM,uBAAO,IAAI,KAAa;AAC9B,QAAK,MAAM,QAAQ,MAAM,OAAO;AAC9B,QACE,CAAC,WAAW,MAAM,KAAK,IACvB,OAAO,KAAK,OAAO,YACnB,KAAK,IAAI,KAAK,GAAG,IAChB,KAAK,SAAS,WAAW,CAACC,UAAe,KAAK,OAAO,IACrD,KAAK,SAAS,aAAa,CAACA,UAAe,KAAK,MAAM,CAEvD,QAAOD,KAAW,IAAI,mBAAmB,0CAA0C;AACrF,SAAK,IAAI,KAAK,GAAG;;GAEnB,MAAM,QAAQ,MAAM;AACpB,UAAO,KAAK;IACV,MAAM;IACN;IACA,QAAQ,MAAM;IACd,OAAO,MAAM;IACb,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,MAAM,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC;IACtD,CAAC;QACG,QAAOA,KAAW,IAAI,mBAAmB,+BAA+B;;AAEjF,QAAO,YAAY,iBAAiB,OAAO,CAAC;;AAG9C,MAAM,oBAAoB,YAAgC;CACxD,MAAM,SAAS,QAAQ,KAAK,eAAe;CAC3C,MAAM,SAAS,IAAI,cAAoB;CACvC,MAAM,eAAe,IAAI,cAAoB;CAC7C,MAAM,SAAS,IAAI,cAAoB;AACvC,MAAK,MAAM,UAAU,QAAQ;AAC3B,MAAI,OAAO,SAAS,QAAS;AAC7B,MAAI,OAAO,SAAS,WAAW;AAC7B,OAAI,OAAO,MAAM,OAAO,GAAG,EAAE,KAC3B,QAAOA,KAAW,OAAO,IAAI,mBAAmB,0BAA0B;AAC5E,UAAO,IAAI,OAAO,IAAI,KAAK;AAC3B,OAAI,OAAO,OAAO;AAChB,QAAI,aAAa,YAAY,OAAO,GAAG,CACrC,QAAOA,KAAW,OAAO,IAAI,mBAAmB,+BAA+B;AACjF,WAAO,IAAI,OAAO,IAAI,KAAK;;AAE7B,QAAK,MAAM,UAAU,OAAO,SAAS;AACnC,QACE,aAAa,SAAS,OAAO,IAAI,OAAO,IAAI,IAC5C,OAAO,cAAc,OAAO,IAAI,OAAO,IAAI,CAE3C,QAAOA,KACL,OAAO,GAAG,OAAO,OAAO,IAAI,EAC5B,mBACA,kCACD;AACH,iBAAa,IAAI,OAAO,IAAI,MAAM,OAAO,IAAI;;aAEtC,OAAO,SAAS,QAAQ;AACjC,OAAI,aAAa,SAAS,OAAO,GAAG,IAAI,OAAO,cAAc,OAAO,GAAG,CACrE,QAAOA,KAAW,OAAO,IAAI,mBAAmB,gCAAgC;AAClF,gBAAa,IAAI,OAAO,IAAI,KAAK;;;AAGrC,QAAO;;AAGT,MAAa,eAAe,YAA+B;CACzD,IAAI,QAAQ;AACZ,MAAK,MAAM,UAAU,QAAQ,QAC3B,UACE,OAAO,SAAS,YACZ,OAAO,QAAQ,UAAU,OAAO,QAAQ,IAAI,KAC5C,OAAO,SAAS,SACd,IAAI,OAAO,MAAM,SACjB;AACV,QAAO;;;;ACxKT,MAAM,2BAAW,IAAI,SAAuD;AAE5E,MAAa,eACX,SACA,YACS;AACT,UAAS,IAAI,SAAS,QAA2D;;AAWnF,SAAgB,UACd,SACA,WAAW,MAC0B;CACrC,MAAM,UAAU,SAAS,IAAI,QAAQ;AACrC,KAAI,CAAC,WAAW,SAAU,OAAM,IAAI,MAAM,yBAAyB;AACnE,QAAO;;;;ACzBT,MAAa,yBAAyB,SAAiB,WAAqC;CAC1F,MAAM,UAAU,UAAU,QAAQ;AAClC,KAAI,QAAQ,gBAAgB,EAAG,SAAQ,QAAQ,eAAe,OAAO;;AAGvE,MAAa,6BACX,SACA,WAC4B;CAC5B,MAAM,UAAU,UAAU,QAAQ;AAClC,KAAI,QAAQ,OAAQ,OAAM,IAAI,MAAM,4CAA4C;AAChF,SAAQ,SAAS;CACjB,IAAI,SAAS;AACb,QAAO,OAAO,OAAO;EACnB,MAAe,QAAgC;AAC7C,OAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,kDAAkD;AAC/E,WAAQ,eAAe;AACvB,OAAI;AACF,WAAO,KAAK;aACJ;AACR,YAAQ,eAAe;;;EAG3B,eAAqB;AACnB,OAAI,CAAC,OAAQ;AACb,YAAS;AACT,OAAI,QAAQ,WAAW,OAAQ,SAAQ,SAAS,KAAA;;EAEnD,CAAC"}