doxum 0.1.7 → 0.1.9

package/dist/driver-BlR81Dqg.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"driver-BlR81Dqg.js","names":[],"sources":["../core/src/mutation/changes.ts","../core/src/runtime/driver.ts"],"sourcesContent":["import type { Change, ChangeSet, MemberChange, ValueTransition } from '../changes';\nimport { isPlainObject } from '../value/ownership';\nimport { AddressIndex } from '../address';\nimport { fail } from './issue';\nimport { validNode } from './tree';\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 fail([], 'invalid-changes', 'Expected a ChangeSet.');\n  const result: Change[] = [];\n  for (const entry of input.changes) {\n    if (!isPlainObject(entry)) return 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 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 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 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 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' && !validNode(node.before)) ||\n          (node.kind !== 'removed' && !validNode(node.after))\n        )\n          return 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 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 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 fail(change.at, 'invalid-changes', 'Overlapping container order.');\n        orders.add(change.at, true);\n      }\n      for (const member of change.members) {\n        const at = change.at.concat(member.key);\n        if (replacements.overlaps(at) || orders.hasDescendant(at))\n          return fail(at, 'invalid-changes', 'Overlapping member transitions.');\n        replacements.add(at, true);\n      }\n    } else if (change.kind === 'tree') {\n      if (replacements.overlaps(change.at) || orders.hasDescendant(change.at))\n        return 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 { CommitSource, DocumentRuntime } from './contract';\nimport type { ObjectNode } from '../schema';\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\ntype RuntimeDriverState = {\n  driver: RuntimeWriteDriver | undefined;\n  bypassDepth: number;\n};\n\nconst states = new WeakMap<object, RuntimeDriverState>();\n\nconst stateOf = (runtime: object): RuntimeDriverState => {\n  const state = states.get(runtime);\n  if (!state) throw new Error('Unknown Doxum runtime.');\n  return state;\n};\n\nexport const bindRuntimeDriver = (runtime: object): void => {\n  states.set(runtime, { driver: undefined, bypassDepth: 0 });\n};\n\nexport const assertRuntimeWritable = (runtime: object, intent: RuntimeWriteIntent): void => {\n  const state = stateOf(runtime);\n  if (state.bypassDepth === 0) state.driver?.assertWritable(intent);\n};\n\nexport const installRuntimeWriteDriver = <TSchema extends ObjectNode>(\n  runtime: DocumentRuntime<TSchema>,\n  driver: RuntimeWriteDriver\n): RuntimeWriteDriverLease => {\n  const state = stateOf(runtime);\n  if (state.driver) throw new Error('Doxum runtime already has a write driver.');\n  state.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      state.bypassDepth += 1;\n      try {\n        return run();\n      } finally {\n        state.bypassDepth -= 1;\n      }\n    },\n    dispose: (): void => {\n      if (!active) return;\n      active = false;\n      if (state.driver === driver) state.driver = undefined;\n    },\n  });\n};\n\nexport const disposeRuntimeDriver = (runtime: object): void => {\n  states.delete(runtime);\n};\n"],"mappings":";;AAMA,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,QAAO,KAAK,EAAE,EAAE,mBAAmB,wBAAwB;CAC7D,MAAM,SAAmB,EAAE;AAC3B,MAAK,MAAM,SAAS,MAAM,SAAS;AACjC,MAAI,CAAC,cAAc,MAAM,CAAE,QAAO,KAAK,EAAE,EAAE,mBAAmB,qBAAqB;AACnF,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,QAAO,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,QAAO,KAAK,EAAE,EAAE,mBAAmB,yCAAyC;EAC9E,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,QAAO,KAAK,IAAI,mBAAmB,4CAA4C;AACjF,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,QAAO,KAAK,IAAI,mBAAmB,6BAA6B;AAClE,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,CAAC,UAAU,KAAK,OAAO,IAChD,KAAK,SAAS,aAAa,CAAC,UAAU,KAAK,MAAM,CAElD,QAAO,KAAK,IAAI,mBAAmB,0CAA0C;AAC/E,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,QAAO,KAAK,IAAI,mBAAmB,+BAA+B;;AAE3E,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,QAAO,KAAK,OAAO,IAAI,mBAAmB,0BAA0B;AACtE,UAAO,IAAI,OAAO,IAAI,KAAK;AAC3B,OAAI,OAAO,OAAO;AAChB,QAAI,aAAa,YAAY,OAAO,GAAG,CACrC,QAAO,KAAK,OAAO,IAAI,mBAAmB,+BAA+B;AAC3E,WAAO,IAAI,OAAO,IAAI,KAAK;;AAE7B,QAAK,MAAM,UAAU,OAAO,SAAS;IACnC,MAAM,KAAK,OAAO,GAAG,OAAO,OAAO,IAAI;AACvC,QAAI,aAAa,SAAS,GAAG,IAAI,OAAO,cAAc,GAAG,CACvD,QAAO,KAAK,IAAI,mBAAmB,kCAAkC;AACvE,iBAAa,IAAI,IAAI,KAAK;;aAEnB,OAAO,SAAS,QAAQ;AACjC,OAAI,aAAa,SAAS,OAAO,GAAG,IAAI,OAAO,cAAc,OAAO,GAAG,CACrE,QAAO,KAAK,OAAO,IAAI,mBAAmB,gCAAgC;AAC5E,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;;;;AChKT,MAAM,yBAAS,IAAI,SAAqC;AAExD,MAAM,WAAW,YAAwC;CACvD,MAAM,QAAQ,OAAO,IAAI,QAAQ;AACjC,KAAI,CAAC,MAAO,OAAM,IAAI,MAAM,yBAAyB;AACrD,QAAO;;AAGT,MAAa,qBAAqB,YAA0B;AAC1D,QAAO,IAAI,SAAS;EAAE,QAAQ,KAAA;EAAW,aAAa;EAAG,CAAC;;AAG5D,MAAa,yBAAyB,SAAiB,WAAqC;CAC1F,MAAM,QAAQ,QAAQ,QAAQ;AAC9B,KAAI,MAAM,gBAAgB,EAAG,OAAM,QAAQ,eAAe,OAAO;;AAGnE,MAAa,6BACX,SACA,WAC4B;CAC5B,MAAM,QAAQ,QAAQ,QAAQ;AAC9B,KAAI,MAAM,OAAQ,OAAM,IAAI,MAAM,4CAA4C;AAC9E,OAAM,SAAS;CACf,IAAI,SAAS;AACb,QAAO,OAAO,OAAO;EACnB,MAAe,QAAgC;AAC7C,OAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,kDAAkD;AAC/E,SAAM,eAAe;AACrB,OAAI;AACF,WAAO,KAAK;aACJ;AACR,UAAM,eAAe;;;EAGzB,eAAqB;AACnB,OAAI,CAAC,OAAQ;AACb,YAAS;AACT,OAAI,MAAM,WAAW,OAAQ,OAAM,SAAS,KAAA;;EAE/C,CAAC;;AAGJ,MAAa,wBAAwB,YAA0B;AAC7D,QAAO,OAAO,QAAQ"}

package/dist/driver-xOIkwrB8.cjs

@@ -0,0 +1,241 @@
+const require_issue = require("./issue-DhrNdQNg.cjs");
+//#region core/src/mutation/changes.ts
+const validated = /* @__PURE__ */ new WeakSet();
+const compareChanges = (a, b) => {
+	if (a.kind === "reset" || b.kind === "reset") return a.kind === b.kind ? 0 : a.kind === "reset" ? -1 : 1;
+	const length = Math.min(a.at.length, b.at.length);
+	for (let i = 0; i < length; i++) if (a.at[i] !== b.at[i]) return lexical(a.at[i], b.at[i]);
+	return a.at.length - b.at.length || lexical(a.kind, b.kind);
+};
+const publication = (changes) => {
+	const result = { changes };
+	validated.add(result);
+	return result;
+};
+/** Register complete recorder groups; unknown input is validated separately. */
+const sealChanges = (changes) => {
+	changes.sort(compareChanges);
+	return publication(changes);
+};
+const keys = (value, expected) => Object.keys(value).every((key) => expected.includes(key));
+const strings = (value) => {
+	if (!Array.isArray(value)) return false;
+	for (const item of value) if (typeof item !== "string") return false;
+	return true;
+};
+const order = (value) => strings(value) && new Set(value).size === value.length;
+const transition = (value, key) => {
+	if (!require_issue.isPlainObject(value) || typeof value[key] !== "string") return false;
+	if (value.kind === "added") return keys(value, [
+		"kind",
+		key,
+		"after"
+	]) && Object.hasOwn(value, "after");
+	if (value.kind === "removed") return keys(value, [
+		"kind",
+		key,
+		"before"
+	]) && Object.hasOwn(value, "before");
+	return value.kind === "updated" && keys(value, [
+		"kind",
+		key,
+		"before",
+		"after"
+	]) && Object.hasOwn(value, "before") && Object.hasOwn(value, "after");
+};
+const lexical = (a, b) => a < b ? -1 : a === b ? 0 : 1;
+/** The sole unknown ChangeSet boundary, including normalized logical-address conflicts. */
+const decodeChanges = (input) => {
+	if (typeof input === "object" && input !== null && validated.has(input)) return input;
+	if (!require_issue.isPlainObject(input) || !keys(input, ["changes"]) || !Array.isArray(input.changes)) return require_issue.fail([], "invalid-changes", "Expected a ChangeSet.");
+	const result = [];
+	for (const entry of input.changes) {
+		if (!require_issue.isPlainObject(entry)) return require_issue.fail([], "invalid-changes", "Expected a change.");
+		if (entry.kind === "reset") {
+			if (input.changes.length !== 1 || !keys(entry, [
+				"kind",
+				"before",
+				"after"
+			]) || !Object.hasOwn(entry, "before") || !Object.hasOwn(entry, "after")) return require_issue.fail([], "invalid-changes", "A reset must be the only change and contain both values.");
+			return sealChanges([{
+				kind: "reset",
+				before: entry.before,
+				after: entry.after
+			}]);
+		}
+		if (!strings(entry.at)) return require_issue.fail([], "invalid-changes", "Change addresses must contain strings.");
+		const at = entry.at;
+		if (entry.kind === "members" && keys(entry, [
+			"kind",
+			"at",
+			"members",
+			"order"
+		]) && Array.isArray(entry.members) && (entry.members.length || Object.hasOwn(entry, "order"))) {
+			const seen = /* @__PURE__ */ new Set();
+			const members = [];
+			for (const member of entry.members) {
+				if (!transition(member, "key") || typeof member.key !== "string" || seen.has(member.key)) return require_issue.fail(at, "invalid-changes", "Malformed or duplicate member transition.");
+				seen.add(member.key);
+				members.push({
+					...member,
+					key: member.key
+				});
+			}
+			const change = {
+				kind: "members",
+				at,
+				members: members.sort((a, b) => lexical(a.key, b.key))
+			};
+			if (Object.hasOwn(entry, "order")) {
+				if (!require_issue.isPlainObject(entry.order) || !keys(entry.order, ["before", "after"]) || !order(entry.order.before) || !order(entry.order.after)) return require_issue.fail(at, "invalid-changes", "Malformed container order.");
+				result.push({
+					...change,
+					order: {
+						before: entry.order.before,
+						after: entry.order.after
+					}
+				});
+			} else result.push(change);
+		} else if (entry.kind === "tree" && keys(entry, [
+			"kind",
+			"at",
+			"before",
+			"after",
+			"nodes"
+		]) && (entry.before === null || typeof entry.before === "string") && (entry.after === null || typeof entry.after === "string") && Array.isArray(entry.nodes)) {
+			const seen = /* @__PURE__ */ new Set();
+			for (const node of entry.nodes) {
+				if (!transition(node, "id") || typeof node.id !== "string" || seen.has(node.id) || node.kind !== "added" && !require_issue.validNode(node.before) || node.kind !== "removed" && !require_issue.validNode(node.after)) return require_issue.fail(at, "invalid-changes", "Malformed or duplicate tree transition.");
+				seen.add(node.id);
+			}
+			const nodes = entry.nodes;
+			result.push({
+				kind: "tree",
+				at,
+				before: entry.before,
+				after: entry.after,
+				nodes: [...nodes].sort((a, b) => lexical(a.id, b.id))
+			});
+		} else return require_issue.fail(at, "invalid-changes", "Unknown or malformed change.");
+	}
+	return publication(normalizeChanges(result));
+};
+const normalizeChanges = (changes) => {
+	const sorted = changes.sort(compareChanges);
+	const groups = new require_issue.AddressIndex();
+	const replacements = new require_issue.AddressIndex();
+	const orders = new require_issue.AddressIndex();
+	for (const change of sorted) {
+		if (change.kind === "reset") continue;
+		if (change.kind === "members") {
+			if (groups.exact(change.at)?.size) return require_issue.fail(change.at, "invalid-changes", "Duplicate member group.");
+			groups.add(change.at, true);
+			if (change.order) {
+				if (replacements.hasAncestor(change.at)) return require_issue.fail(change.at, "invalid-changes", "Overlapping container order.");
+				orders.add(change.at, true);
+			}
+			for (const member of change.members) {
+				const at = change.at.concat(member.key);
+				if (replacements.overlaps(at) || orders.hasDescendant(at)) return require_issue.fail(at, "invalid-changes", "Overlapping member transitions.");
+				replacements.add(at, true);
+			}
+		} else if (change.kind === "tree") {
+			if (replacements.overlaps(change.at) || orders.hasDescendant(change.at)) return require_issue.fail(change.at, "invalid-changes", "Overlapping tree transitions.");
+			replacements.add(change.at, true);
+		}
+	}
+	return sorted;
+};
+const changeCount = (changes) => {
+	let count = 0;
+	for (const change of changes.changes) count += change.kind === "members" ? change.members.length + (change.order ? 1 : 0) : change.kind === "tree" ? 1 + change.nodes.length : 1;
+	return count;
+};
+//#endregion
+//#region core/src/runtime/driver.ts
+const states = /* @__PURE__ */ new WeakMap();
+const stateOf = (runtime) => {
+	const state = states.get(runtime);
+	if (!state) throw new Error("Unknown Doxum runtime.");
+	return state;
+};
+const bindRuntimeDriver = (runtime) => {
+	states.set(runtime, {
+		driver: void 0,
+		bypassDepth: 0
+	});
+};
+const assertRuntimeWritable = (runtime, intent) => {
+	const state = stateOf(runtime);
+	if (state.bypassDepth === 0) state.driver?.assertWritable(intent);
+};
+const installRuntimeWriteDriver = (runtime, driver) => {
+	const state = stateOf(runtime);
+	if (state.driver) throw new Error("Doxum runtime already has a write driver.");
+	state.driver = driver;
+	let active = true;
+	return Object.freeze({
+		run: (run) => {
+			if (!active) throw new Error("Doxum runtime write driver is no longer active.");
+			state.bypassDepth += 1;
+			try {
+				return run();
+			} finally {
+				state.bypassDepth -= 1;
+			}
+		},
+		dispose: () => {
+			if (!active) return;
+			active = false;
+			if (state.driver === driver) state.driver = void 0;
+		}
+	});
+};
+const disposeRuntimeDriver = (runtime) => {
+	states.delete(runtime);
+};
+//#endregion
+Object.defineProperty(exports, "assertRuntimeWritable", {
+	enumerable: true,
+	get: function() {
+		return assertRuntimeWritable;
+	}
+});
+Object.defineProperty(exports, "bindRuntimeDriver", {
+	enumerable: true,
+	get: function() {
+		return bindRuntimeDriver;
+	}
+});
+Object.defineProperty(exports, "changeCount", {
+	enumerable: true,
+	get: function() {
+		return changeCount;
+	}
+});
+Object.defineProperty(exports, "decodeChanges", {
+	enumerable: true,
+	get: function() {
+		return decodeChanges;
+	}
+});
+Object.defineProperty(exports, "disposeRuntimeDriver", {
+	enumerable: true,
+	get: function() {
+		return disposeRuntimeDriver;
+	}
+});
+Object.defineProperty(exports, "installRuntimeWriteDriver", {
+	enumerable: true,
+	get: function() {
+		return installRuntimeWriteDriver;
+	}
+});
+Object.defineProperty(exports, "sealChanges", {
+	enumerable: true,
+	get: function() {
+		return sealChanges;
+	}
+});
+
+//# sourceMappingURL=driver-xOIkwrB8.cjs.map

package/dist/driver-xOIkwrB8.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"driver-xOIkwrB8.cjs","names":["isPlainObject","fail","validNode","AddressIndex"],"sources":["../core/src/mutation/changes.ts","../core/src/runtime/driver.ts"],"sourcesContent":["import type { Change, ChangeSet, MemberChange, ValueTransition } from '../changes';\nimport { isPlainObject } from '../value/ownership';\nimport { AddressIndex } from '../address';\nimport { fail } from './issue';\nimport { validNode } from './tree';\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 fail([], 'invalid-changes', 'Expected a ChangeSet.');\n  const result: Change[] = [];\n  for (const entry of input.changes) {\n    if (!isPlainObject(entry)) return 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 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 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 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 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' && !validNode(node.before)) ||\n          (node.kind !== 'removed' && !validNode(node.after))\n        )\n          return 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 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 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 fail(change.at, 'invalid-changes', 'Overlapping container order.');\n        orders.add(change.at, true);\n      }\n      for (const member of change.members) {\n        const at = change.at.concat(member.key);\n        if (replacements.overlaps(at) || orders.hasDescendant(at))\n          return fail(at, 'invalid-changes', 'Overlapping member transitions.');\n        replacements.add(at, true);\n      }\n    } else if (change.kind === 'tree') {\n      if (replacements.overlaps(change.at) || orders.hasDescendant(change.at))\n        return 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 { CommitSource, DocumentRuntime } from './contract';\nimport type { ObjectNode } from '../schema';\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\ntype RuntimeDriverState = {\n  driver: RuntimeWriteDriver | undefined;\n  bypassDepth: number;\n};\n\nconst states = new WeakMap<object, RuntimeDriverState>();\n\nconst stateOf = (runtime: object): RuntimeDriverState => {\n  const state = states.get(runtime);\n  if (!state) throw new Error('Unknown Doxum runtime.');\n  return state;\n};\n\nexport const bindRuntimeDriver = (runtime: object): void => {\n  states.set(runtime, { driver: undefined, bypassDepth: 0 });\n};\n\nexport const assertRuntimeWritable = (runtime: object, intent: RuntimeWriteIntent): void => {\n  const state = stateOf(runtime);\n  if (state.bypassDepth === 0) state.driver?.assertWritable(intent);\n};\n\nexport const installRuntimeWriteDriver = <TSchema extends ObjectNode>(\n  runtime: DocumentRuntime<TSchema>,\n  driver: RuntimeWriteDriver\n): RuntimeWriteDriverLease => {\n  const state = stateOf(runtime);\n  if (state.driver) throw new Error('Doxum runtime already has a write driver.');\n  state.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      state.bypassDepth += 1;\n      try {\n        return run();\n      } finally {\n        state.bypassDepth -= 1;\n      }\n    },\n    dispose: (): void => {\n      if (!active) return;\n      active = false;\n      if (state.driver === driver) state.driver = undefined;\n    },\n  });\n};\n\nexport const disposeRuntimeDriver = (runtime: object): void => {\n  states.delete(runtime);\n};\n"],"mappings":";;AAMA,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,CAACA,cAAAA,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,cAAAA,cAAc,MAAM,IAAI,CAAC,KAAK,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,QAAQ,MAAM,QAAQ,CACrF,QAAOC,cAAAA,KAAK,EAAE,EAAE,mBAAmB,wBAAwB;CAC7D,MAAM,SAAmB,EAAE;AAC3B,MAAK,MAAM,SAAS,MAAM,SAAS;AACjC,MAAI,CAACD,cAAAA,cAAc,MAAM,CAAE,QAAOC,cAAAA,KAAK,EAAE,EAAE,mBAAmB,qBAAqB;AACnF,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,cAAAA,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,cAAAA,KAAK,EAAE,EAAE,mBAAmB,yCAAyC;EAC9E,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,cAAAA,KAAK,IAAI,mBAAmB,4CAA4C;AACjF,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,cAAAA,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,cAAAA,KAAK,IAAI,mBAAmB,6BAA6B;AAClE,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,cAAAA,UAAU,KAAK,OAAO,IAChD,KAAK,SAAS,aAAa,CAACA,cAAAA,UAAU,KAAK,MAAM,CAElD,QAAOD,cAAAA,KAAK,IAAI,mBAAmB,0CAA0C;AAC/E,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,cAAAA,KAAK,IAAI,mBAAmB,+BAA+B;;AAE3E,QAAO,YAAY,iBAAiB,OAAO,CAAC;;AAG9C,MAAM,oBAAoB,YAAgC;CACxD,MAAM,SAAS,QAAQ,KAAK,eAAe;CAC3C,MAAM,SAAS,IAAIE,cAAAA,cAAoB;CACvC,MAAM,eAAe,IAAIA,cAAAA,cAAoB;CAC7C,MAAM,SAAS,IAAIA,cAAAA,cAAoB;AACvC,MAAK,MAAM,UAAU,QAAQ;AAC3B,MAAI,OAAO,SAAS,QAAS;AAC7B,MAAI,OAAO,SAAS,WAAW;AAC7B,OAAI,OAAO,MAAM,OAAO,GAAG,EAAE,KAC3B,QAAOF,cAAAA,KAAK,OAAO,IAAI,mBAAmB,0BAA0B;AACtE,UAAO,IAAI,OAAO,IAAI,KAAK;AAC3B,OAAI,OAAO,OAAO;AAChB,QAAI,aAAa,YAAY,OAAO,GAAG,CACrC,QAAOA,cAAAA,KAAK,OAAO,IAAI,mBAAmB,+BAA+B;AAC3E,WAAO,IAAI,OAAO,IAAI,KAAK;;AAE7B,QAAK,MAAM,UAAU,OAAO,SAAS;IACnC,MAAM,KAAK,OAAO,GAAG,OAAO,OAAO,IAAI;AACvC,QAAI,aAAa,SAAS,GAAG,IAAI,OAAO,cAAc,GAAG,CACvD,QAAOA,cAAAA,KAAK,IAAI,mBAAmB,kCAAkC;AACvE,iBAAa,IAAI,IAAI,KAAK;;aAEnB,OAAO,SAAS,QAAQ;AACjC,OAAI,aAAa,SAAS,OAAO,GAAG,IAAI,OAAO,cAAc,OAAO,GAAG,CACrE,QAAOA,cAAAA,KAAK,OAAO,IAAI,mBAAmB,gCAAgC;AAC5E,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;;;;AChKT,MAAM,yBAAS,IAAI,SAAqC;AAExD,MAAM,WAAW,YAAwC;CACvD,MAAM,QAAQ,OAAO,IAAI,QAAQ;AACjC,KAAI,CAAC,MAAO,OAAM,IAAI,MAAM,yBAAyB;AACrD,QAAO;;AAGT,MAAa,qBAAqB,YAA0B;AAC1D,QAAO,IAAI,SAAS;EAAE,QAAQ,KAAA;EAAW,aAAa;EAAG,CAAC;;AAG5D,MAAa,yBAAyB,SAAiB,WAAqC;CAC1F,MAAM,QAAQ,QAAQ,QAAQ;AAC9B,KAAI,MAAM,gBAAgB,EAAG,OAAM,QAAQ,eAAe,OAAO;;AAGnE,MAAa,6BACX,SACA,WAC4B;CAC5B,MAAM,QAAQ,QAAQ,QAAQ;AAC9B,KAAI,MAAM,OAAQ,OAAM,IAAI,MAAM,4CAA4C;AAC9E,OAAM,SAAS;CACf,IAAI,SAAS;AACb,QAAO,OAAO,OAAO;EACnB,MAAe,QAAgC;AAC7C,OAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,kDAAkD;AAC/E,SAAM,eAAe;AACrB,OAAI;AACF,WAAO,KAAK;aACJ;AACR,UAAM,eAAe;;;EAGzB,eAAqB;AACnB,OAAI,CAAC,OAAQ;AACb,YAAS;AACT,OAAI,MAAM,WAAW,OAAQ,OAAM,SAAS,KAAA;;EAE/C,CAAC;;AAGJ,MAAa,wBAAwB,YAA0B;AAC7D,QAAO,OAAO,QAAQ"}