@mml-io/networked-dom-document 0.17.1 → 0.18.1

package/build/index.d.ts

@@ -1,2 +1,2 @@
-export * from "./NetworkedDOM";
 export * from "./EditableNetworkedDOM";
+export * from "./NetworkedDOM";

package/build/index.js

@@ -1,3 +1,38 @@
+// src/rfc6902/deepEqual.ts
+function deepEqual(a, b) {
+  if (a === b) {
+    return true;
+  }
+  if (Array.isArray(a) && Array.isArray(b)) {
+    if (a.length !== b.length) {
+      return false;
+    }
+    return a.every((elem, index) => {
+      return deepEqual(elem, b[index]);
+    });
+  }
+  if (typeof a === "object" && typeof b === "object" && a !== null && b !== null) {
+    if (Array.isArray(a) || Array.isArray(b)) {
+      return false;
+    }
+    const keys1 = Object.keys(a);
+    const keys2 = Object.keys(b);
+    if (keys1.length !== keys2.length || !keys1.every((key) => keys2.includes(key))) {
+      return false;
+    }
+    for (const key in a) {
+      if (!deepEqual(a[key], b[key])) {
+        return false;
+      }
+    }
+    if (keys1.length === 0 && a instanceof Date && b instanceof Date) {
+      return a.getTime() === b.getTime();
+    }
+    return true;
+  }
+  return false;
+}
+
 // src/rfc6902/pointer.ts
 function unescape(token) {
   return token.replace(/~1/g, "/").replace(/~0/g, "~");
@@ -14,8 +49,7 @@ var Pointer = class _Pointer {
   */
   static fromJSON(path) {
     const tokens = path.split("/").map(unescape);
-    if (tokens[0] !== "")
-      throw new Error(`Invalid JSON Pointer: ${path}`);
+    if (tokens[0] !== "") throw new Error(`Invalid JSON Pointer: ${path}`);
     return new _Pointer(tokens);
   }
   toString() {
@@ -67,41 +101,6 @@ var Pointer = class _Pointer {
   }
 };
 
-// src/rfc6902/deepEqual.ts
-function deepEqual(a, b) {
-  if (a === b) {
-    return true;
-  }
-  if (Array.isArray(a) && Array.isArray(b)) {
-    if (a.length !== b.length) {
-      return false;
-    }
-    return a.every((elem, index) => {
-      return deepEqual(elem, b[index]);
-    });
-  }
-  if (typeof a === "object" && typeof b === "object" && a !== null && b !== null) {
-    if (Array.isArray(a) || Array.isArray(b)) {
-      return false;
-    }
-    const keys1 = Object.keys(a);
-    const keys2 = Object.keys(b);
-    if (keys1.length !== keys2.length || !keys1.every((key) => keys2.includes(key))) {
-      return false;
-    }
-    for (const key in a) {
-      if (!deepEqual(a[key], b[key])) {
-        return false;
-      }
-    }
-    if (keys1.length === 0 && a instanceof Date && b instanceof Date) {
-      return a.getTime() === b.getTime();
-    }
-    return true;
-  }
-  return false;
-}
-
 // src/rfc6902/util.ts
 var hasOwnProperty = Object.prototype.hasOwnProperty;
 function objectType(object) {
@@ -231,8 +230,7 @@ function diffArrays(input, output, ptr, diff = diffAny) {
   for (let i = 0; i <= input_end; i++) {
     for (let j = 0; j <= output_end; j++) {
       let memoized = memo[i][j];
-      if (memoized)
-        continue;
+      if (memoized) continue;
       const add_prev_key = `${i},${j - 1}`;
       const remove_prev_key = `${i - 1},${j}`;
       const replace_prev_key = `${i - 1},${j - 1}`;
@@ -762,6 +760,10 @@ function virtualDOMDiffToVirtualDOMMutationRecord(virtualStructure, domDiff) {
     const node = nodePointer.get(virtualStructure);
     let previousSibling = null;
     if (lastToken === "-") {
+      if (node.childNodes.length > 0) {
+        previousSibling = node.childNodes[node.childNodes.length - 1];
+      } else {
+      }
     } else {
       const index = parseInt(lastToken, 10);
       if (index === 0) {
@@ -1195,7 +1197,11 @@ var _NetworkedDOM = class _NetworkedDOM {
     if (parentNodeId === void 0) {
       throw new Error("Parent node ID not found");
     }
-    return this.getStaticVirtualDOMElementByInternalNodeIdOrThrow(parentNodeId);
+    const node = this.nodeIdToNode.get(parentNodeId);
+    if (!node) {
+      throw new Error("Parent node not found:" + parentNodeId);
+    }
+    return node;
   }
   registerWebsocket(webSocket, existingConnectionId = null) {
     let connectionId;
@@ -1213,7 +1219,7 @@ var _NetworkedDOM = class _NetworkedDOM {
         try {
           parsed = JSON.parse(string);
         } catch (e) {
-          console.error(`Error parsing message from websocket: ${string}`);
+          console.error(`Error parsing message from websocket: ${string}`, e);
           console.trace();
           return;
         }

package/build/index.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["../src/rfc6902/pointer.ts", "../src/rfc6902/deepEqual.ts", "../src/rfc6902/util.ts", "../src/rfc6902/diff.ts", "../src/rfc6902/patch.ts", "../src/diffing.ts", "../src/NetworkedDOM.ts", "../src/EditableNetworkedDOM.ts"],
-  "sourcesContent": ["/**\nUnescape token part of a JSON Pointer string\n\n`token` should *not* contain any '/' characters.\n\n> Evaluation of each reference token begins by decoding any escaped\n> character sequence.  This is performed by first transforming any\n> occurrence of the sequence '~1' to '/', and then transforming any\n> occurrence of the sequence '~0' to '~'.  By performing the\n> substitutions in this order, an implementation avoids the error of\n> turning '~01' first into '~1' and then into '/', which would be\n> incorrect (the string '~01' correctly becomes '~1' after\n> transformation).\n\nHere's my take:\n\n~1 is unescaped with higher priority than ~0 because it is a lower-order escape character.\nI say \"lower order\" because '/' needs escaping due to the JSON Pointer serialization technique.\nWhereas, '~' is escaped because escaping '/' uses the '~' character.\n*/\nfunction unescape(token: string): string {\n  return token.replace(/~1/g, \"/\").replace(/~0/g, \"~\");\n}\n\n/** Escape token part of a JSON Pointer string\n\n> '~' needs to be encoded as '~0' and '/'\n> needs to be encoded as '~1' when these characters appear in a\n> reference token.\n\nThis is the exact inverse of `unescape()`, so the reverse replacements must take place in reverse order.\n*/\nfunction escape(token: string): string {\n  return token.replace(/~/g, \"~0\").replace(/\\//g, \"~1\");\n}\n\nexport interface PointerEvaluation {\n  parent: any;\n  key: string;\n  value: any;\n}\n\n/**\nJSON Pointer representation\n*/\nexport class Pointer {\n  constructor(public tokens = [\"\"]) {}\n  /**\n  `path` *must* be a properly escaped string.\n  */\n  static fromJSON(path: string): Pointer {\n    const tokens = path.split(\"/\").map(unescape);\n    if (tokens[0] !== \"\") throw new Error(`Invalid JSON Pointer: ${path}`);\n    return new Pointer(tokens);\n  }\n  toString(): string {\n    return this.tokens.map(escape).join(\"/\");\n  }\n  /**\n  Returns an object with 'parent', 'key', and 'value' properties.\n  In the special case that this Pointer's path == \"\",\n  this object will be {parent: null, key: '', value: object}.\n  Otherwise, parent and key will have the property such that parent[key] == value.\n  */\n  evaluate(object: any): PointerEvaluation {\n    let parent: any = null;\n    let key = \"\";\n    let value = object;\n    for (let i = 1, l = this.tokens.length; i < l; i++) {\n      parent = value;\n      key = this.tokens[i];\n      if (key === \"__proto__\" || key === \"constructor\" || key === \"prototype\") {\n        continue;\n      }\n      // not sure if this the best way to handle non-existant paths...\n      value = (parent || {})[key];\n    }\n    return { parent, key, value };\n  }\n  get(object: any): any {\n    return this.evaluate(object).value;\n  }\n  set(object: any, value: any): void {\n    let cursor: any = object;\n    for (let i = 1, l = this.tokens.length - 1, token = this.tokens[i]; i < l; i++) {\n      // not sure if this the best way to handle non-existant paths...\n      cursor = (cursor || {})[token];\n    }\n    if (cursor) {\n      cursor[this.tokens[this.tokens.length - 1]] = value;\n    }\n  }\n  push(token: string): void {\n    // mutable\n    this.tokens.push(token);\n  }\n  /**\n  `token` should be a String. It'll be coerced to one anyway.\n\n  immutable (shallowly)\n  */\n  add(token: string): Pointer {\n    const tokens = this.tokens.concat(String(token));\n    return new Pointer(tokens);\n  }\n}\n", "export function deepEqual(a: any, b: any): boolean {\n  if (a === b) {\n    return true;\n  }\n\n  if (Array.isArray(a) && Array.isArray(b)) {\n    if (a.length !== b.length) {\n      return false;\n    }\n\n    return a.every((elem, index) => {\n      return deepEqual(elem, b[index]);\n    });\n  }\n\n  if (typeof a === \"object\" && typeof b === \"object\" && a !== null && b !== null) {\n    if (Array.isArray(a) || Array.isArray(b)) {\n      return false;\n    }\n\n    const keys1 = Object.keys(a);\n    const keys2 = Object.keys(b);\n    if (keys1.length !== keys2.length || !keys1.every((key) => keys2.includes(key))) {\n      return false;\n    }\n\n    for (const key in a) {\n      if (!deepEqual(a[key], b[key])) {\n        return false;\n      }\n    }\n\n    if (keys1.length === 0 && a instanceof Date && b instanceof Date) {\n      // Only need to check the length of 1 as they are already known to be equal\n      return a.getTime() === b.getTime();\n    }\n\n    return true;\n  }\n  return false;\n}\n", "export const hasOwnProperty = Object.prototype.hasOwnProperty;\n\nexport function objectType(object: any) {\n  if (object === undefined) {\n    return \"undefined\";\n  }\n  if (object === null) {\n    return \"null\";\n  }\n  if (Array.isArray(object)) {\n    return \"array\";\n  }\n  return typeof object;\n}\n\nfunction isNonPrimitive(value: any): value is object {\n  // loose-equality checking for null is faster than strict checking for each of null/undefined/true/false\n  // checking null first, then calling typeof, is faster than vice-versa\n  return value != null && typeof value === \"object\";\n}\n\n/**\nRecursively copy a value.\n\n@param source - should be a JavaScript primitive, Array, Date, or (plain old) Object.\n@returns copy of source where every Array and Object have been recursively\n         reconstructed from their constituent elements\n*/\nexport function clone<T>(source: T): T {\n  if (!isNonPrimitive(source)) {\n    // short-circuiting is faster than a single return\n    return source;\n  }\n  // x.constructor == Array is the fastest way to check if x is an Array\n  if (Array.isArray(source)) {\n    // construction via imperative for-loop is faster than source.map(arrayVsObject)\n    const length = (source as Array<any>).length;\n    // setting the Array length during construction is faster than just `[]` or `new Array()`\n    const arrayTarget: any = new Array(length);\n    for (let i = 0; i < length; i++) {\n      arrayTarget[i] = clone(source[i]);\n    }\n    return arrayTarget;\n  }\n  // Date\n  if (source.constructor === Date) {\n    const dateTarget: any = new Date(+source);\n    return dateTarget;\n  }\n  // Object\n  const objectTarget: any = {};\n  // declaring the variable (with const) inside the loop is faster\n  for (const key in source) {\n    // hasOwnProperty costs a bit of performance, but it's semantically necessary\n    // using a global helper is MUCH faster than calling source.hasOwnProperty(key)\n    if (hasOwnProperty.call(source, key)) {\n      objectTarget[key] = clone(source[key]);\n    }\n  }\n  return objectTarget;\n}\n", "import { deepEqual } from \"./deepEqual\";\nimport { Pointer } from \"./pointer\"; // we only need this for type inference\nimport { hasOwnProperty, objectType } from \"./util\";\n\n/**\nAll diff* functions should return a list of operations, often empty.\n\nEach operation should be an object with two to four fields:\n* `op`: the name of the operation; one of \"add\", \"remove\", \"replace\", \"move\",\n  \"copy\", or \"test\".\n* `path`: a JSON pointer string\n* `from`: a JSON pointer string\n* `value`: a JSON value\n\nThe different operations have different arguments.\n* \"add\": [`path`, `value`]\n* \"remove\": [`path`]\n* \"replace\": [`path`, `value`]\n* \"move\": [`from`, `path`]\n* \"copy\": [`from`, `path`]\n* \"test\": [`path`, `value`]\n\nCurrently this only really differentiates between Arrays, Objects, and\nEverything Else, which is pretty much just what JSON substantially\ndifferentiates between.\n*/\n\nexport interface AddOperation {\n  op: \"add\";\n  path: string;\n  value: any;\n}\nexport interface RemoveOperation {\n  op: \"remove\";\n  path: string;\n}\nexport interface ReplaceOperation {\n  op: \"replace\";\n  path: string;\n  value: any;\n}\nexport interface MoveOperation {\n  op: \"move\";\n  from: string;\n  path: string;\n}\nexport interface CopyOperation {\n  op: \"copy\";\n  from: string;\n  path: string;\n}\nexport interface TestOperation {\n  op: \"test\";\n  path: string;\n  value: any;\n}\n\nexport type Operation =\n  | AddOperation\n  | RemoveOperation\n  | ReplaceOperation\n  | MoveOperation\n  | CopyOperation\n  | TestOperation;\n\nexport function isDestructive({ op }: Operation): boolean {\n  return op === \"remove\" || op === \"replace\" || op === \"copy\" || op === \"move\";\n}\n\nexport type Diff = (input: any, output: any, ptr: Pointer) => Operation[];\n/**\nVoidableDiff exists to allow the user to provide a partial diff(...) function,\nfalling back to the built-in diffAny(...) function if the user-provided function\nreturns void.\n*/\nexport type VoidableDiff = (input: any, output: any, ptr: Pointer) => Operation[] | void;\n\nfunction wrapVoidableDiff(diff: VoidableDiff): Diff {\n  function wrappedDiff(input: any, output: any, ptr: Pointer): Operation[] {\n    const custom_patch = diff(input, output, ptr);\n    // ensure an array is always returned\n    return Array.isArray(custom_patch) ? custom_patch : diffAny(input, output, ptr, wrappedDiff);\n  }\n  return wrappedDiff;\n}\n\n/**\n Create a test operation based on `input`'s current evaluation of the JSON\n Pointer `path`; if such a pointer cannot be resolved, returns undefined.\n */\nfunction createTest(input: any, path: string): TestOperation | undefined {\n  const endpoint = Pointer.fromJSON(path).evaluate(input);\n  if (endpoint !== undefined) {\n    return { op: \"test\", path, value: endpoint.value };\n  }\n}\n\n/**\n Produce an 'application/json-patch+json'-type list of tests, to verify that\n existing values in an object are identical to the those captured at some\n checkpoint (whenever this function is called).\n\n This does not alter `input` or `output` unless they have a property getter with\n side-effects (which is not a good idea anyway).\n\n Returns list of test operations.\n */\nexport function createTests(input: any, patch: Operation[]): TestOperation[] {\n  const tests = new Array<TestOperation>();\n  patch.filter(isDestructive).forEach((operation) => {\n    const pathTest = createTest(input, operation.path);\n    if (pathTest) tests.push(pathTest);\n    if (\"from\" in operation) {\n      const fromTest = createTest(input, operation.from);\n      if (fromTest) tests.push(fromTest);\n    }\n  });\n  return tests;\n}\n\n/**\n Produce a 'application/json-patch+json'-type patch to get from one object to\n another.\n\n This does not alter `input` or `output` unless they have a property getter with\n side-effects (which is not a good idea anyway).\n\n `diff` is called on each pair of comparable non-primitive nodes in the\n `input`/`output` object trees, producing nested patches. Return `undefined`\n to fall back to default behaviour.\n\n Returns list of operations to perform on `input` to produce `output`.\n */\nexport function createPatch(input: any, output: any, diff?: VoidableDiff): Operation[] {\n  const ptr = new Pointer();\n  // a new Pointer gets a default path of [''] if not specified\n  return (diff ? wrapVoidableDiff(diff) : diffAny)(input, output, ptr);\n}\n\n/**\nList the keys in `minuend` that are not in `subtrahend`.\n\nA key is only considered if it is both 1) an own-property (o.hasOwnProperty(k))\nof the object, and 2) has a value that is not undefined. This is to match JSON\nsemantics, where JSON object serialization drops keys with undefined values.\n\n@param minuend Object of interest\n@param subtrahend Object of comparison\n@returns Array of keys that are in `minuend` but not in `subtrahend`.\n*/\nexport function subtract(\n  minuend: { [index: string]: any },\n  subtrahend: { [index: string]: any },\n): string[] {\n  // initialize empty object; we only care about the keys, the values can be anything\n  const obj: { [index: string]: number } = {};\n  // build up obj with all the properties of minuend\n  for (const add_key in minuend) {\n    if (hasOwnProperty.call(minuend, add_key) && minuend[add_key] !== undefined) {\n      obj[add_key] = 1;\n    }\n  }\n  // now delete all the properties of subtrahend from obj\n  // (deleting a missing key has no effect)\n  for (const del_key in subtrahend) {\n    if (hasOwnProperty.call(subtrahend, del_key) && subtrahend[del_key] !== undefined) {\n      delete obj[del_key];\n    }\n  }\n  // finally, extract whatever keys remain in obj\n  return Object.keys(obj);\n}\n\n/**\nList the keys that shared by all `objects`.\n\nThe semantics of what constitutes a \"key\" is described in {@link subtract}.\n\n@param objects Array of objects to compare\n@returns Array of keys that are in (\"own-properties\" of) every object in `objects`.\n*/\nexport function intersection(objects: ArrayLike<{ [index: string]: any }>): string[] {\n  const length = objects.length;\n  // prepare empty counter to keep track of how many objects each key occurred in\n  const counter: { [index: string]: number } = {};\n  // go through each object and increment the counter for each key in that object\n  for (let i = 0; i < length; i++) {\n    const object = objects[i];\n    for (const key in object) {\n      if (hasOwnProperty.call(object, key) && object[key] !== undefined) {\n        counter[key] = (counter[key] || 0) + 1;\n      }\n    }\n  }\n  // now delete all keys from the counter that were not seen in every object\n  for (const key in counter) {\n    if (counter[key] < length) {\n      delete counter[key];\n    }\n  }\n  // finally, extract whatever keys remain in the counter\n  return Object.keys(counter);\n}\n\ninterface ArrayAdd {\n  op: \"add\";\n  index: number;\n  value: any;\n}\ninterface ArrayRemove {\n  op: \"remove\";\n  index: number;\n}\ninterface ArrayReplace {\n  op: \"replace\";\n  index: number;\n  original: any;\n  value: any;\n}\n/** These are not proper Operation objects, but will be converted into\nOperation objects eventually. {index} indicates the actual target position,\nnever 'end-of-array' */\ntype ArrayOperation = ArrayAdd | ArrayRemove | ArrayReplace;\nfunction isArrayAdd(array_operation: ArrayOperation): array_operation is ArrayAdd {\n  return array_operation.op === \"add\";\n}\nfunction isArrayRemove(array_operation: ArrayOperation): array_operation is ArrayRemove {\n  return array_operation.op === \"remove\";\n}\n\ninterface DynamicAlternative {\n  /**\n   * track prev key position for less memory usage\n   */\n  prev: string | null;\n  operation: ArrayOperation | null;\n  /**\n  cost indicates the total cost of getting to this position.\n  */\n  cost: number;\n}\n\nfunction buildOperations(memo: Array<Array<DynamicAlternative>>, i: number, j: number) {\n  let memoized: DynamicAlternative = memo[i][j];\n  if (!memoized) {\n    throw new Error(\"invalid memo\");\n  }\n  const operations: ArrayOperation[] = [];\n  while (memoized && memoized.prev && memoized.operation) {\n    operations.push(memoized.operation);\n    const index = memoized.prev.split(\",\");\n    memoized = memo[Number(index[0])][Number(index[1])];\n  }\n  return operations.reverse();\n}\n\n/**\nCalculate the shortest sequence of operations to get from `input` to `output`,\nusing a dynamic programming implementation of the Levenshtein distance algorithm.\n\nTo get from the input ABC to the output AZ we could just delete all the input\nand say \"insert A, insert Z\" and be done with it. That's what we do if the\ninput is empty. But we can be smarter.\n\n          output\n               A   Z\n               -   -\n          [0]  1   2\ninput A |  1  [0]  1\n      B |  2  [1]  1\n      C |  3   2  [2]\n\n1) start at 0,0 (+0)\n2) keep A (+0)\n3) remove B (+1)\n4) replace C with Z (+1)\n\nIf the `input` (source) is empty, they'll all be in the top row, resulting in an\narray of 'add' operations.\nIf the `output` (target) is empty, everything will be in the left column,\nresulting in an array of 'remove' operations.\n\n@returns A list of add/remove/replace operations.\n*/\nexport function diffArrays<T>(\n  input: T[],\n  output: T[],\n  ptr: Pointer,\n  diff: Diff = diffAny,\n): Operation[] {\n  if (diff === void 0) {\n    diff = diffAny;\n  }\n  // set up cost matrix (very simple initialization: just a map)\n  const input_length = isNaN(input.length) || input.length <= 0 ? 0 : input.length;\n  const output_length = isNaN(output.length) || output.length <= 0 ? 0 : output.length;\n  let input_end = input_length;\n  let output_end = output_length;\n  while (input_end > 0 && output_end > 0) {\n    // accelerate same arrays\n    if (deepEqual(input[input_end - 1], output[output_end - 1])) {\n      input_end--;\n      output_end--;\n    } else {\n      break;\n    }\n  }\n  const memo: Array<Array<DynamicAlternative>> = new Array(input_end + 1);\n  for (let i = 0; i <= input_end; i++) {\n    memo[i] = new Array(output_end + 1);\n  }\n  memo[0][0] = { prev: null, operation: null, cost: 0 };\n  /**\n  Calculate the cheapest sequence of operations required to get from\n  input.slice(0, i) to output.slice(0, j).\n  There may be other valid sequences with the same cost, but none cheaper.\n\n  @param i The row in the layout above\n  @param j The column in the layout above\n  @returns An object containing a list of operations, along with the total cost\n           of applying them (+1 for each add/remove/replace operation)\n  */\n  // handle weird objects masquerading as Arrays that don't have proper length\n  // properties by using 0 for everything but positive numbers\n  for (let i = 0; i <= input_end; i++) {\n    for (let j = 0; j <= output_end; j++) {\n      let memoized = memo[i][j];\n      if (memoized) continue;\n      const add_prev_key = `${i},${j - 1}`;\n      const remove_prev_key = `${i - 1},${j}`;\n      const replace_prev_key = `${i - 1},${j - 1}`;\n      const remove_operation: ArrayRemove = {\n        op: \"remove\",\n        index: i - 1,\n      };\n      const add_operation: ArrayAdd = {\n        op: \"add\",\n        index: i - 1,\n        value: output[j - 1],\n      };\n\n      if (j === 0) {\n        memoized = {\n          prev: remove_prev_key,\n          operation: remove_operation,\n          cost: memo[i - 1][j].cost + 1,\n        };\n      } else if (i === 0) {\n        memoized = { prev: add_prev_key, operation: add_operation, cost: memo[i][j - 1].cost + 1 };\n      } else {\n        if (deepEqual(input[i - 1], output[j - 1])) {\n          memoized = memo[i - 1][j - 1];\n        } else {\n          const remove_prev = memo[i - 1][j];\n          const add_prev = memo[i][j - 1];\n          const replace_prev = memo[i - 1][j - 1];\n          const min_cost = Math.min(replace_prev.cost, add_prev.cost, remove_prev.cost);\n          if (remove_prev.cost === min_cost) {\n            memoized = {\n              prev: remove_prev_key,\n              operation: remove_operation,\n              cost: memo[i - 1][j].cost + 1,\n            };\n          } else if (add_prev.cost === min_cost) {\n            memoized = {\n              prev: add_prev_key,\n              operation: add_operation,\n              cost: memo[i][j - 1].cost + 1,\n            };\n          } else {\n            const replace_operation: ArrayReplace = {\n              op: \"replace\",\n              index: i - 1,\n              original: input[i - 1],\n              value: output[j - 1],\n            };\n            memoized = {\n              prev: replace_prev_key,\n              operation: replace_operation,\n              cost: memo[i - 1][j - 1].cost + 1,\n            };\n          }\n        }\n      }\n      memo[i][j] = memoized;\n    }\n  }\n  const array_operations = buildOperations(memo, input_end, output_end);\n  const [padded_operations] = array_operations.reduce<[Operation[], number]>(\n    ([operations, padding], array_operation) => {\n      if (isArrayAdd(array_operation)) {\n        const padded_index = array_operation.index + 1 + padding;\n        const index_token = padded_index < input_length + padding ? String(padded_index) : \"-\";\n        const operation = {\n          op: array_operation.op,\n          path: ptr.add(index_token).toString(),\n          value: array_operation.value,\n        };\n        // padding++ // maybe only if array_operation.index > -1 ?\n        return [operations.concat(operation), padding + 1];\n      } else if (isArrayRemove(array_operation)) {\n        const operation = {\n          op: array_operation.op,\n          path: ptr.add(String(array_operation.index + padding)).toString(),\n        };\n        // padding--\n        return [operations.concat(operation), padding - 1];\n      } else {\n        // replace\n        const replace_ptr = ptr.add(String(array_operation.index + padding));\n        const replace_operations = diff(\n          array_operation.original,\n          array_operation.value,\n          replace_ptr,\n        );\n        return [operations.concat(...replace_operations), padding];\n      }\n    },\n    [[], 0],\n  );\n  return padded_operations;\n}\n\nexport function diffObjects(\n  input: any,\n  output: any,\n  ptr: Pointer,\n  diff: Diff = diffAny,\n): Operation[] {\n  // if a key is in input but not output -> remove it\n  const operations: Operation[] = [];\n  subtract(input, output).forEach((key) => {\n    operations.push({ op: \"remove\", path: ptr.add(key).toString() });\n  });\n  // if a key is in output but not input -> add it\n  subtract(output, input).forEach((key) => {\n    operations.push({ op: \"add\", path: ptr.add(key).toString(), value: output[key] });\n  });\n  // if a key is in both, diff it recursively\n  intersection([input, output]).forEach((key) => {\n    operations.push(...diff(input[key], output[key], ptr.add(key)));\n  });\n  return operations;\n}\n\n/**\n`diffAny()` returns an empty array if `input` and `output` are materially equal\n(i.e., would produce equivalent JSON); otherwise it produces an array of patches\nthat would transform `input` into `output`.\n\n> Here, \"equal\" means that the value at the target location and the\n> value conveyed by \"value\" are of the same JSON type, and that they\n> are considered equal by the following rules for that type:\n> o  strings: are considered equal if they contain the same number of\n>    Unicode characters and their code points are byte-by-byte equal.\n> o  numbers: are considered equal if their values are numerically\n>    equal.\n> o  arrays: are considered equal if they contain the same number of\n>    values, and if each value can be considered equal to the value at\n>    the corresponding position in the other array, using this list of\n>    type-specific rules.\n> o  objects: are considered equal if they contain the same number of\n>    members, and if each member can be considered equal to a member in\n>    the other object, by comparing their keys (as strings) and their\n>    values (using this list of type-specific rules).\n> o  literals (false, true, and null): are considered equal if they are\n>    the same.\n*/\nexport function diffAny(input: any, output: any, ptr: Pointer, diff: Diff = diffAny): Operation[] {\n  // strict equality handles literals, numbers, and strings (a sufficient but not necessary cause)\n  if (input === output) {\n    return [];\n  }\n  const input_type = objectType(input);\n  const output_type = objectType(output);\n  if (input_type === \"array\" && output_type === \"array\") {\n    return diffArrays(input, output, ptr, diff);\n  }\n  if (input_type === \"object\" && output_type === \"object\") {\n    return diffObjects(input, output, ptr, diff);\n  }\n  // at this point we know that input and output are materially different;\n  // could be array -> object, object -> array, boolean -> undefined,\n  // number -> string, or some other combination, but nothing that can be split\n  // up into multiple patches: so `output` must replace `input` wholesale.\n  return [{ op: \"replace\", path: ptr.toString(), value: output }];\n}\n", "import {\n  AddOperation,\n  CopyOperation,\n  diffAny,\n  MoveOperation,\n  Operation,\n  RemoveOperation,\n  ReplaceOperation,\n  TestOperation,\n} from \"./diff\";\nimport { Pointer } from \"./pointer\";\nimport { clone } from \"./util\";\n\nexport class MissingError extends Error {\n  constructor(public path: string) {\n    super(`Value required at path: ${path}`);\n    this.name = \"MissingError\";\n  }\n}\n\nexport class TestError extends Error {\n  constructor(\n    public actual: any,\n    public expected: any,\n  ) {\n    super(`Test failed: ${actual} != ${expected}`);\n    this.name = \"TestError\";\n  }\n}\n\n/**\n Apply a 'application/json-patch+json'-type patch to an object.\n\n `patch` *must* be an array of operations.\n\n > Operation objects MUST have exactly one \"op\" member, whose value\n > indicates the operation to perform.  Its value MUST be one of \"add\",\n > \"remove\", \"replace\", \"move\", \"copy\", or \"test\"; other values are\n > errors.\n\n This method mutates the target object in-place.\n\n @returns list of results, one for each operation: `null` indicated success,\n otherwise, the result will be an instance of one of the Error classes:\n MissingError, InvalidOperationError, or TestError.\n */\nexport function applyPatch(object: any, patch: Operation[]) {\n  return patch.map((operation) => apply(object, operation));\n}\n\nfunction _add(object: any, key: string, value: any): void {\n  if (Array.isArray(object)) {\n    // `key` must be an index\n    if (key === \"-\") {\n      object.push(value);\n    } else {\n      const index = parseInt(key, 10);\n      object.splice(index, 0, value);\n    }\n  } else {\n    object[key] = value;\n  }\n}\n\nfunction _remove(object: any, key: string): void {\n  if (Array.isArray(object)) {\n    // '-' syntax doesn't make sense when removing\n    const index = parseInt(key, 10);\n    object.splice(index, 1);\n  } else {\n    // not sure what the proper behavior is when path = ''\n    delete object[key];\n  }\n}\n\n/**\n>  o  If the target location specifies an array index, a new value is\n>     inserted into the array at the specified index.\n>  o  If the target location specifies an object member that does not\n>     already exist, a new member is added to the object.\n>  o  If the target location specifies an object member that does exist,\n>     that member's value is replaced.\n*/\nexport function add(object: any, operation: AddOperation): MissingError | null {\n  const endpoint = Pointer.fromJSON(operation.path).evaluate(object);\n  // it's not exactly a \"MissingError\" in the same way that `remove` is -- more like a MissingParent, or something\n  if (endpoint.parent === undefined) {\n    return new MissingError(operation.path);\n  }\n  _add(endpoint.parent, endpoint.key, clone(operation.value));\n  return null;\n}\n\n/**\n> The \"remove\" operation removes the value at the target location.\n> The target location MUST exist for the operation to be successful.\n*/\nexport function remove(object: any, operation: RemoveOperation): MissingError | null {\n  // endpoint has parent, key, and value properties\n  const endpoint = Pointer.fromJSON(operation.path).evaluate(object);\n  if (endpoint.value === undefined) {\n    return new MissingError(operation.path);\n  }\n  // not sure what the proper behavior is when path = ''\n  _remove(endpoint.parent, endpoint.key);\n  return null;\n}\n\n/**\n> The \"replace\" operation replaces the value at the target location\n> with a new value.  The operation object MUST contain a \"value\" member\n> whose content specifies the replacement value.\n> The target location MUST exist for the operation to be successful.\n\n> This operation is functionally identical to a \"remove\" operation for\n> a value, followed immediately by an \"add\" operation at the same\n> location with the replacement value.\n\nEven more simply, it's like the add operation with an existence check.\n*/\nexport function replace(object: any, operation: ReplaceOperation): MissingError | null {\n  const endpoint = Pointer.fromJSON(operation.path).evaluate(object);\n  if (endpoint.parent === null) {\n    return new MissingError(operation.path);\n  }\n  // this existence check treats arrays as a special case\n  if (Array.isArray(endpoint.parent)) {\n    if (parseInt(endpoint.key, 10) >= endpoint.parent.length) {\n      return new MissingError(operation.path);\n    }\n  } else if (endpoint.value === undefined) {\n    return new MissingError(operation.path);\n  }\n  endpoint.parent[endpoint.key] = operation.value;\n  return null;\n}\n\n/**\n> The \"move\" operation removes the value at a specified location and\n> adds it to the target location.\n> The operation object MUST contain a \"from\" member, which is a string\n> containing a JSON Pointer value that references the location in the\n> target document to move the value from.\n> This operation is functionally identical to a \"remove\" operation on\n> the \"from\" location, followed immediately by an \"add\" operation at\n> the target location with the value that was just removed.\n\n> The \"from\" location MUST NOT be a proper prefix of the \"path\"\n> location; i.e., a location cannot be moved into one of its children.\n\nTODO: throw if the check described in the previous paragraph fails.\n*/\nexport function move(object: any, operation: MoveOperation): MissingError | null {\n  const from_endpoint = Pointer.fromJSON(operation.from).evaluate(object);\n  if (from_endpoint.value === undefined) {\n    return new MissingError(operation.from);\n  }\n  const endpoint = Pointer.fromJSON(operation.path).evaluate(object);\n  if (endpoint.parent === undefined) {\n    return new MissingError(operation.path);\n  }\n  _remove(from_endpoint.parent, from_endpoint.key);\n  _add(endpoint.parent, endpoint.key, from_endpoint.value);\n  return null;\n}\n\n/**\n> The \"copy\" operation copies the value at a specified location to the\n> target location.\n> The operation object MUST contain a \"from\" member, which is a string\n> containing a JSON Pointer value that references the location in the\n> target document to copy the value from.\n> The \"from\" location MUST exist for the operation to be successful.\n\n> This operation is functionally identical to an \"add\" operation at the\n> target location using the value specified in the \"from\" member.\n\nAlternatively, it's like 'move' without the 'remove'.\n*/\nexport function copy(object: any, operation: CopyOperation): MissingError | null {\n  const from_endpoint = Pointer.fromJSON(operation.from).evaluate(object);\n  if (from_endpoint.value === undefined) {\n    return new MissingError(operation.from);\n  }\n  const endpoint = Pointer.fromJSON(operation.path).evaluate(object);\n  if (endpoint.parent === undefined) {\n    return new MissingError(operation.path);\n  }\n  _add(endpoint.parent, endpoint.key, clone(from_endpoint.value));\n  return null;\n}\n\n/**\n> The \"test\" operation tests that a value at the target location is\n> equal to a specified value.\n> The operation object MUST contain a \"value\" member that conveys the\n> value to be compared to the target location's value.\n> The target location MUST be equal to the \"value\" value for the\n> operation to be considered successful.\n*/\nexport function test(object: any, operation: TestOperation): TestError | null {\n  const endpoint = Pointer.fromJSON(operation.path).evaluate(object);\n  // TODO: this diffAny(...).length usage could/should be lazy\n  if (diffAny(endpoint.value, operation.value, new Pointer()).length) {\n    return new TestError(endpoint.value, operation.value);\n  }\n  return null;\n}\n\nexport class InvalidOperationError extends Error {\n  constructor(public operation: Operation) {\n    super(`Invalid operation: ${operation.op}`);\n    this.name = \"InvalidOperationError\";\n  }\n}\n\n/**\nSwitch on `operation.op`, applying the corresponding patch function for each\ncase to `object`.\n*/\nexport function apply(\n  object: any,\n  operation: Operation,\n): MissingError | InvalidOperationError | TestError | null {\n  // not sure why TypeScript can't infer typesafety of:\n  //   {add, remove, replace, move, copy, test}[operation.op](object, operation)\n  // (seems like a bug)\n  switch (operation.op) {\n    case \"add\":\n      return add(object, operation);\n    case \"remove\":\n      return remove(object, operation);\n    case \"replace\":\n      return replace(object, operation);\n    case \"move\":\n      return move(object, operation);\n    case \"copy\":\n      return copy(object, operation);\n    case \"test\":\n      return test(object, operation);\n  }\n  return new InvalidOperationError(operation);\n}\n", "import {\n  AttributeChangedDiff,\n  ChildrenChangedDiff,\n  Diff,\n  ElementNodeDescription,\n  NodeDescription,\n  SnapshotMessage,\n  TextChangedDiff,\n  TextNodeDescription,\n} from \"@mml-io/networked-dom-protocol\";\nimport { StaticVirtualDOMElement } from \"@mml-io/observable-dom-common\";\n\nimport { NodeMapping, StaticVirtualDOMMutationRecord, VirtualDOMDiffStruct } from \"./common\";\nimport * as rfc6902 from \"./rfc6902\";\n\nexport const visibleToAttrName = \"visible-to\";\nexport const hiddenFromAttrName = \"hidden-from\";\n\n/**\n * This function does a lot of heavy lifting - it takes a mutation and applies it to the connection's view (affecting\n * which nodes are visible based on attributes etc.)\n *\n * As a result of the application it generates a diff for the particular connection's view of the DOM.\n */\nexport function diffFromApplicationOfStaticVirtualDOMMutationRecordToConnection(\n  mutation: StaticVirtualDOMMutationRecord,\n  parentNode: StaticVirtualDOMElement | null,\n  connectionId: number,\n  visibleNodesForConnection: Set<number>,\n): Diff | null {\n  const virtualDOMElement = mutation.target;\n\n  switch (mutation.type) {\n    case \"snapshot\": {\n      const nodeDescription = describeNodeWithChildrenForConnectionId(\n        virtualDOMElement,\n        connectionId,\n        visibleNodesForConnection,\n      );\n      if (!nodeDescription) {\n        return null;\n      }\n      const diff: SnapshotMessage = {\n        type: \"snapshot\",\n        snapshot: nodeDescription,\n        documentTime: 0,\n      };\n      return diff;\n    }\n    case \"attributes\": {\n      const visible = visibleNodesForConnection.has(virtualDOMElement.nodeId);\n\n      if (!parentNode) {\n        throw new Error(\"Node has no parent\");\n      }\n      const parentNodeId = parentNode.nodeId;\n      const shouldBeVisible =\n        shouldShowNodeToConnectionId(virtualDOMElement, connectionId) &&\n        visibleNodesForConnection.has(parentNodeId);\n\n      // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n      const attributeName = mutation.attributeName!;\n\n      if (visible && shouldBeVisible) {\n        let newValue = null; // null indicates deleted\n        if (virtualDOMElement.attributes[attributeName] !== undefined) {\n          newValue = virtualDOMElement.attributes[attributeName];\n        }\n        const diff: AttributeChangedDiff = {\n          type: \"attributeChange\",\n          nodeId: virtualDOMElement.nodeId,\n          attribute: attributeName,\n          newValue,\n        };\n        return diff;\n      } else if (!visible && shouldBeVisible) {\n        // Need to add this child to the connection's view now\n        visibleNodesForConnection.add(virtualDOMElement.nodeId);\n\n        const index = parentNode.childNodes.indexOf(virtualDOMElement);\n        if (index === -1) {\n          throw new Error(\"Node not found in parent's children\");\n        }\n\n        let previousNodeId = null;\n        if (index > 0) {\n          previousNodeId = getNodeIdOfPreviousVisibleSibling(\n            parentNode,\n            index - 1,\n            visibleNodesForConnection,\n          );\n        }\n\n        const nodeDescription = describeNodeWithChildrenForConnectionId(\n          virtualDOMElement,\n          connectionId,\n          visibleNodesForConnection,\n        );\n        if (!nodeDescription) {\n          throw new Error(\"Node description not found\");\n        }\n        const diff: ChildrenChangedDiff = {\n          type: \"childrenChanged\",\n          nodeId: parentNodeId,\n          previousNodeId,\n          addedNodes: [nodeDescription],\n          removedNodes: [],\n        };\n        return diff;\n      } else if (visible && !shouldBeVisible) {\n        removeNodeAndChildrenFromVisibleNodes(virtualDOMElement, visibleNodesForConnection);\n        const diff: ChildrenChangedDiff = {\n          type: \"childrenChanged\",\n          nodeId: parentNodeId,\n          previousNodeId: null,\n          addedNodes: [],\n          removedNodes: [virtualDOMElement.nodeId],\n        };\n        return diff;\n      } else if (!visible && !shouldBeVisible) {\n        return null;\n      }\n      break;\n    }\n    case \"characterData\": {\n      const visible = visibleNodesForConnection.has(virtualDOMElement.nodeId);\n      if (!visible) {\n        return null;\n      }\n      const diff: TextChangedDiff = {\n        type: \"textChanged\",\n        nodeId: virtualDOMElement.nodeId,\n        text: virtualDOMElement.textContent || \"\",\n      };\n      return diff;\n    }\n    case \"childList\": {\n      const visible = visibleNodesForConnection.has(virtualDOMElement.nodeId);\n      if (!visible) {\n        return null;\n      }\n      let previousSibling = mutation.previousSibling;\n      let previousNodeId: number | null = null;\n      if (previousSibling) {\n        let previousIndex = virtualDOMElement.childNodes.indexOf(previousSibling);\n        while (previousIndex !== -1) {\n          previousSibling = virtualDOMElement.childNodes[previousIndex];\n          if (visibleNodesForConnection.has(previousSibling.nodeId)) {\n            previousNodeId = previousSibling.nodeId;\n            break;\n          }\n          previousIndex--;\n        }\n      }\n\n      const diff: ChildrenChangedDiff = {\n        type: \"childrenChanged\",\n        nodeId: virtualDOMElement.nodeId,\n        previousNodeId,\n        addedNodes: [],\n        removedNodes: [],\n      };\n\n      mutation.addedNodes.forEach((childVirtualDOMElement: StaticVirtualDOMElement) => {\n        const describedNode = describeNodeWithChildrenForConnectionId(\n          childVirtualDOMElement,\n          connectionId,\n          visibleNodesForConnection,\n        );\n        if (!describedNode) {\n          return;\n        }\n        diff.addedNodes.push(describedNode);\n      });\n      mutation.removedNodes.forEach((childVirtualDOMElement: StaticVirtualDOMElement) => {\n        if (visibleNodesForConnection.has(childVirtualDOMElement.nodeId)) {\n          removeNodeAndChildrenFromVisibleNodes(childVirtualDOMElement, visibleNodesForConnection);\n          diff.removedNodes.push(childVirtualDOMElement.nodeId);\n        }\n      });\n\n      if (diff.addedNodes.length > 0 || diff.removedNodes.length > 0) {\n        return diff;\n      }\n      return null;\n    }\n    default:\n      console.error(\"Unknown mutation type: \" + mutation.type);\n      break;\n  }\n  return null;\n}\n\nfunction getNodeIdOfPreviousVisibleSibling(\n  parentVirtualElement: StaticVirtualDOMElement,\n  candidateIndex: number,\n  visibleNodesForConnection: Set<number>,\n): number | null {\n  if (candidateIndex > 0) {\n    let previousSiblingIndex = candidateIndex;\n    while (previousSiblingIndex >= 0) {\n      const previousSibling = parentVirtualElement.childNodes[previousSiblingIndex];\n      if (visibleNodesForConnection.has(previousSibling.nodeId)) {\n        return previousSibling.nodeId;\n      }\n      previousSiblingIndex--;\n    }\n  }\n  return null;\n}\n\nfunction shouldShowNodeToConnectionId(\n  virtualDOMElement: StaticVirtualDOMElement,\n  connectionId: number,\n): boolean {\n  const visibleToAttr = virtualDOMElement.attributes[visibleToAttrName];\n  const hiddenFromAttr = virtualDOMElement.attributes[hiddenFromAttrName];\n  const connectionIdString = connectionId.toString();\n  if (visibleToAttr !== undefined) {\n    const visibleToList = visibleToAttr.split(\" \");\n    const explicityVisible = visibleToList.includes(connectionIdString);\n    if (!explicityVisible) {\n      return false;\n    }\n  }\n  if (hiddenFromAttr !== undefined) {\n    const hiddenFromList = hiddenFromAttr.split(\" \");\n    const explicityHidden = hiddenFromList.includes(connectionIdString);\n    if (explicityHidden) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function describeNodeWithChildrenForConnectionId(\n  virtualDOMElement: StaticVirtualDOMElement,\n  connectionId: number,\n  visibleNodesForConnection: Set<number>,\n): NodeDescription | null {\n  if (!shouldShowNodeToConnectionId(virtualDOMElement, connectionId)) {\n    return null;\n  }\n\n  let emittedTagName = virtualDOMElement.tag;\n  if (emittedTagName === \"#document\") {\n    emittedTagName = \"DIV\";\n  }\n  if (emittedTagName === \"#text\") {\n    const textNode: TextNodeDescription = {\n      type: \"text\",\n      nodeId: virtualDOMElement.nodeId,\n      text: virtualDOMElement.textContent || \"\",\n    };\n    visibleNodesForConnection.add(textNode.nodeId);\n    return textNode;\n  } else {\n    const node: ElementNodeDescription = {\n      type: \"element\",\n      nodeId: virtualDOMElement.nodeId,\n      tag: emittedTagName,\n      attributes: virtualDOMElement.attributes,\n      children: [],\n      text: virtualDOMElement.textContent,\n    };\n    visibleNodesForConnection.add(node.nodeId);\n\n    for (const child of virtualDOMElement.childNodes) {\n      const childNodeDescription = describeNodeWithChildrenForConnectionId(\n        child,\n        connectionId,\n        visibleNodesForConnection,\n      );\n      if (childNodeDescription) {\n        node.children.push(childNodeDescription);\n      }\n    }\n    return node;\n  }\n}\n\nfunction removeNodeAndChildrenFromVisibleNodes(\n  virtualDOMElement: StaticVirtualDOMElement,\n  visibleNodesForConnection: Set<number>,\n): void {\n  visibleNodesForConnection.delete(virtualDOMElement.nodeId);\n  for (const child of virtualDOMElement.childNodes) {\n    if (!visibleNodesForConnection.has(child.nodeId)) {\n      console.error(\"Inner child of removed element was not visible\", child.nodeId);\n    }\n    removeNodeAndChildrenFromVisibleNodes(child, visibleNodesForConnection);\n  }\n}\n\nexport function findParentNodeOfNodeId(\n  virtualDOMElement: StaticVirtualDOMElement,\n  targetNodeId: number,\n): StaticVirtualDOMElement | null {\n  // TODO - avoid a search of the whole tree for the node's parent\n  // depth-first search of the whole virtual dom structure to find the node's parent\n  for (const child of virtualDOMElement.childNodes) {\n    if (child.nodeId === targetNodeId) {\n      return virtualDOMElement;\n    } else {\n      const foundParentId = findParentNodeOfNodeId(child, targetNodeId);\n      if (foundParentId) {\n        return foundParentId;\n      }\n    }\n  }\n  return null;\n}\n\nexport function virtualDOMDiffToVirtualDOMMutationRecord(\n  virtualStructure: StaticVirtualDOMElement,\n  domDiff: rfc6902.Operation,\n): Array<StaticVirtualDOMMutationRecord> {\n  const pointer = rfc6902.Pointer.fromJSON(domDiff.path);\n  const grandParentTokens = pointer.tokens.slice(0, pointer.tokens.length - 2);\n  const lastToken = pointer.tokens[pointer.tokens.length - 1];\n  const secondLastToken = pointer.tokens[pointer.tokens.length - 2];\n\n  if (lastToken === \"textContent\") {\n    const nodePointer = new rfc6902.Pointer(pointer.tokens.slice(0, pointer.tokens.length - 1));\n    const node = nodePointer.get(virtualStructure) as StaticVirtualDOMElement;\n    return [\n      {\n        type: \"characterData\",\n        target: node,\n        addedNodes: [],\n        removedNodes: [],\n        attributeName: null,\n        previousSibling: null,\n      },\n    ];\n  }\n\n  if (secondLastToken === \"attributes\") {\n    // This handles attribute additions, changes, and removals\n    const nodePointer = new rfc6902.Pointer(grandParentTokens);\n    const node = nodePointer.get(virtualStructure) as StaticVirtualDOMElement;\n    return [\n      {\n        type: \"attributes\",\n        target: node,\n        addedNodes: [],\n        removedNodes: [],\n        attributeName: lastToken,\n        previousSibling: null,\n      },\n    ];\n  }\n\n  // Child changes\n\n  if (secondLastToken === \"childNodes\") {\n    const nodePointer = new rfc6902.Pointer(grandParentTokens);\n    const node = nodePointer.get(virtualStructure) as StaticVirtualDOMElement;\n\n    let previousSibling: StaticVirtualDOMElement | null = null;\n    if (lastToken === \"-\") {\n      // Append to the end of the children\n    } else {\n      const index = parseInt(lastToken, 10);\n      if (index === 0) {\n        previousSibling = null;\n      } else {\n        previousSibling = node.childNodes[index - 1];\n      }\n    }\n    const addedNodes: Array<StaticVirtualDOMElement> = [];\n    const removedNodes: Array<StaticVirtualDOMElement> = [];\n    switch (domDiff.op) {\n      case \"add\": {\n        addedNodes.push(domDiff.value);\n        return [\n          {\n            type: \"childList\",\n            target: node,\n            addedNodes,\n            removedNodes,\n            previousSibling,\n            attributeName: null,\n          },\n        ];\n      }\n      case \"remove\": {\n        const removedNode = pointer.get(virtualStructure) as StaticVirtualDOMElement;\n        removedNodes.push(removedNode);\n        return [\n          {\n            type: \"childList\",\n            target: node,\n            addedNodes,\n            removedNodes,\n            previousSibling,\n            attributeName: null,\n          },\n        ];\n      }\n      case \"replace\": {\n        // This is a replacement of a single node\n        const removedNode = pointer.get(virtualStructure) as StaticVirtualDOMElement;\n        removedNodes.push(removedNode);\n        addedNodes.push(domDiff.value);\n        return [\n          {\n            type: \"childList\",\n            target: node,\n            addedNodes: [],\n            removedNodes,\n            previousSibling,\n            attributeName: null,\n          },\n          {\n            type: \"childList\",\n            target: node,\n            addedNodes,\n            removedNodes: [],\n            previousSibling,\n            attributeName: null,\n          },\n        ];\n      }\n    }\n  }\n\n  if (domDiff.op === \"replace\" && domDiff.path === \"\") {\n    const node = domDiff.value as StaticVirtualDOMElement;\n    return [\n      {\n        type: \"snapshot\",\n        target: node,\n        addedNodes: [],\n        removedNodes: [],\n        previousSibling: null,\n        attributeName: null,\n      },\n    ];\n  }\n\n  console.error(\"Unhandled JSON diff:\", JSON.stringify(domDiff, null, 2));\n  throw new Error(\"Unhandled diff type\");\n}\n\nexport function calculateStaticVirtualDOMDiff(\n  originalState: StaticVirtualDOMElement,\n  latestState: StaticVirtualDOMElement,\n): VirtualDOMDiffStruct {\n  const jsonPatchDiffs = rfc6902.createPatch(\n    originalState,\n    latestState,\n    (a, b, ptr: rfc6902.Pointer) => {\n      if (a.tag !== b.tag) {\n        return [{ op: \"replace\", path: ptr.toString(), value: b }];\n      }\n      return;\n    },\n  );\n\n  const nodeIdRemappings: Array<NodeMapping> = [];\n  const virtualDOMDiffs: Array<rfc6902.Operation> = [];\n  for (const diff of jsonPatchDiffs) {\n    if (diff.op === \"replace\" && diff.path.endsWith(\"/nodeId\")) {\n      const pointer = rfc6902.Pointer.fromJSON(diff.path);\n      const originalValue = pointer.get(originalState);\n      nodeIdRemappings.push({\n        internalNodeId: diff.value,\n        clientFacingNodeId: originalValue,\n      });\n    } else {\n      virtualDOMDiffs.push(diff);\n    }\n  }\n\n  return remapDuplicatedNodeIdsInOperations(\n    {\n      originalState,\n      nodeIdRemappings,\n      virtualDOMDiffs,\n    },\n    latestState,\n  );\n}\n\nfunction getHighestNodeId(node: StaticVirtualDOMElement) {\n  let highest = node.nodeId;\n  for (const child of node.childNodes) {\n    highest = Math.max(highest, getHighestNodeId(child));\n  }\n  return highest;\n}\n\nfunction getRemovedNodeIds(before: StaticVirtualDOMElement, diff: rfc6902.Operation) {\n  const removedIds = new Set<number>();\n  function addNode(node: StaticVirtualDOMElement) {\n    removedIds.add(node.nodeId);\n    for (const child of node.childNodes) {\n      addNode(child);\n    }\n  }\n  if (diff.op === \"replace\" || diff.op === \"remove\") {\n    const removedNode = rfc6902.Pointer.fromJSON(diff.path).get(before);\n    addNode(removedNode);\n  }\n  return removedIds;\n}\n\nfunction getNodeIdsFromNodeAndChildren(node: StaticVirtualDOMElement) {\n  const nodeIds = new Set<number>();\n  function addNode(node: StaticVirtualDOMElement) {\n    nodeIds.add(node.nodeId);\n    for (const child of node.childNodes) {\n      addNode(child);\n    }\n  }\n  addNode(node);\n  return nodeIds;\n}\n\n// To avoid duplicate node ids at any point in the sequence of operations, apply the operations and determine if any node ids are duplicated at any point. If so, remap the node ids to be unique.\nfunction remapDuplicatedNodeIdsInOperations(\n  virtualDOMDiffStruct: VirtualDOMDiffStruct,\n  latestState: StaticVirtualDOMElement,\n): VirtualDOMDiffStruct {\n  const { originalState, nodeIdRemappings, virtualDOMDiffs } = virtualDOMDiffStruct;\n\n  const highestNodeIdAcrossStartAndEnd = Math.max(\n    getHighestNodeId(originalState),\n    getHighestNodeId(latestState),\n  );\n  let nextNodeId = highestNodeIdAcrossStartAndEnd + 1;\n\n  const before = JSON.parse(JSON.stringify(originalState));\n\n  function checkAndReplaceNodeIdsIfAlreadyInUse(\n    node: StaticVirtualDOMElement,\n    addingNodeIds: Set<number>,\n    removedIds: Set<number>,\n  ) {\n    if (existingNodeIds.has(node.nodeId) && removedIds && !removedIds.has(node.nodeId)) {\n      // This node id is already present so it must be replaced\n      const newNodeId = nextNodeId++;\n      nodeIdRemappings.push({\n        internalNodeId: node.nodeId,\n        clientFacingNodeId: newNodeId,\n      });\n      node.nodeId = newNodeId;\n      addingNodeIds.add(newNodeId);\n    } else {\n      addingNodeIds.add(node.nodeId);\n    }\n    for (const child of node.childNodes) {\n      checkAndReplaceNodeIdsIfAlreadyInUse(child, addingNodeIds, removedIds);\n    }\n  }\n\n  const existingNodeIds = getNodeIdsFromNodeAndChildren(before);\n\n  for (const diff of virtualDOMDiffs) {\n    const pointer = rfc6902.Pointer.fromJSON(diff.path);\n    const secondLastToken = pointer.tokens[pointer.tokens.length - 2];\n    if (secondLastToken !== \"childNodes\") {\n      continue;\n    }\n    const removedIds = getRemovedNodeIds(before, diff);\n    const addingNodeIds = new Set<number>();\n    if (diff.op === \"replace\" || diff.op === \"add\") {\n      // The added node can use removed node ids, but it must not use any node ids that are still in use.\n      checkAndReplaceNodeIdsIfAlreadyInUse(diff.value, addingNodeIds, removedIds);\n    }\n    removedIds.forEach((removedId) => {\n      existingNodeIds.delete(removedId);\n    });\n    addingNodeIds.forEach((addingNodeId) => {\n      existingNodeIds.add(addingNodeId);\n    });\n\n    const patchErrors = rfc6902.applyPatch(before, [diff]);\n    if (patchErrors.length !== 1 || patchErrors[0] !== null) {\n      throw new Error(\"Patch failed\");\n    }\n  }\n\n  return virtualDOMDiffStruct;\n}\n", "import {\n  ClientMessage,\n  Diff,\n  NodeDescription,\n  PongMessage,\n  RemoteEvent,\n  ServerMessage,\n  SnapshotMessage,\n} from \"@mml-io/networked-dom-protocol\";\nimport {\n  LogMessage,\n  ObservableDOMInterface,\n  ObservableDOMMessage,\n  ObservableDOMParameters,\n  StaticVirtualDOMElement,\n  StaticVirtualDOMMutationIdsRecord,\n} from \"@mml-io/observable-dom-common\";\n\nimport { StaticVirtualDOMMutationRecord, VirtualDOMDiffStruct } from \"./common\";\nimport {\n  calculateStaticVirtualDOMDiff,\n  describeNodeWithChildrenForConnectionId,\n  diffFromApplicationOfStaticVirtualDOMMutationRecordToConnection,\n  findParentNodeOfNodeId,\n  virtualDOMDiffToVirtualDOMMutationRecord,\n} from \"./diffing\";\nimport { applyPatch } from \"./rfc6902\";\n\nexport const networkedDOMProtocolSubProtocol_v0_1 = \"networked-dom-v0.1\";\nexport const defaultWebsocketSubProtocol = networkedDOMProtocolSubProtocol_v0_1;\n\nexport type ObservableDOMFactory = (\n  observableDOMParameters: ObservableDOMParameters,\n  callback: (message: ObservableDOMMessage, observableDOM: ObservableDOMInterface) => void,\n) => ObservableDOMInterface;\n\n/**\n * NetworkedDOM is the main class for the networked-dom-document package. It is responsible for managing the state of\n * the document and the connections to the clients.\n *\n * It is constructed with an ObservableDOMFactory, which is responsible for creating the ObservableDOMInterface\n * implementation that is used to run the document.\n */\nexport class NetworkedDOM {\n  // First to last in order of preference\n  public static SupportedWebsocketSubProtocolsPreferenceOrder = [\n    networkedDOMProtocolSubProtocol_v0_1,\n  ];\n\n  // Map from the node ids that the DOM uses internally to the node ids that clients refer to.\n  private internalNodeIdToClientNodeId = new Map<number, number>();\n\n  // Map from the node ids that clients refer to to the node ids that the DOM uses internally.\n  private clientNodeIdToInternalNodeId = new Map<number, number>();\n\n  private currentConnectionId = 1;\n  private connectionIdToWebSocketContext = new Map<\n    number,\n    { webSocket: WebSocket; messageListener: (messageEvent: MessageEvent) => void }\n  >();\n  private webSocketToConnectionId = new Map<WebSocket, number>();\n  private visibleNodeIdsByConnectionId = new Map<number, Set<number>>();\n  private initialLoad = true;\n  private readonly htmlPath: string;\n\n  private disposed = false;\n  private ignoreTextNodes: boolean;\n\n  private documentRoot!: StaticVirtualDOMElement;\n  private nodeIdToNode = new Map<number, StaticVirtualDOMElement>();\n  private nodeIdToParentNodeId = new Map<number, number>();\n\n  private observableDOM: ObservableDOMInterface;\n\n  private documentEffectiveStartTime = Date.now();\n  private latestDocumentTime = 0;\n  private pingCounter = 1;\n  private maximumNodeId = 0;\n\n  private logCallback?: (message: LogMessage) => void;\n\n  constructor(\n    observableDOMFactory: ObservableDOMFactory,\n    htmlPath: string,\n    htmlContents: string,\n    oldInstanceDocumentRoot: StaticVirtualDOMElement | null,\n    onLoad: (domDiff: VirtualDOMDiffStruct | null, networkedDOM: NetworkedDOM) => void,\n    params = {},\n    ignoreTextNodes = true,\n    logCallback?: (message: LogMessage) => void,\n  ) {\n    this.htmlPath = htmlPath;\n    this.ignoreTextNodes = ignoreTextNodes;\n\n    this.logCallback = logCallback || this.defaultLogCallback;\n\n    this.observableDOM = observableDOMFactory(\n      {\n        htmlPath,\n        htmlContents,\n        params,\n        ignoreTextNodes,\n        pingIntervalMilliseconds: 5000,\n      },\n      (message: ObservableDOMMessage, observableDOM: ObservableDOMInterface) => {\n        this.observableDOM = observableDOM;\n        if (message.documentTime) {\n          this.documentEffectiveStartTime = Date.now() - message.documentTime;\n          this.latestDocumentTime = message.documentTime;\n        }\n        if (message.snapshot) {\n          this.documentRoot = message.snapshot;\n          const clonedSnapshot = JSON.parse(JSON.stringify(message.snapshot));\n\n          if (!this.initialLoad) {\n            throw new Error(\"Received snapshot after initial load\");\n          }\n          this.initialLoad = false;\n\n          let domDiff: VirtualDOMDiffStruct | null = null;\n          if (oldInstanceDocumentRoot) {\n            domDiff = calculateStaticVirtualDOMDiff(oldInstanceDocumentRoot, clonedSnapshot);\n            for (const remapping of domDiff.nodeIdRemappings) {\n              this.addRemappedNodeId(remapping.clientFacingNodeId, remapping.internalNodeId);\n            }\n          }\n\n          this.addAndRemapNodeFromInstance(this.documentRoot, -1);\n\n          onLoad(domDiff, this);\n        } else if (message.mutation) {\n          if (this.initialLoad) {\n            throw new Error(\"Received mutation before initial load\");\n          }\n          const mutation = this.addKnownNodesInMutation(message.mutation);\n          this.processModification(mutation);\n          this.removeKnownNodesInMutation(mutation);\n        } else if (message.logMessage) {\n          if (this.logCallback) {\n            this.logCallback(message.logMessage);\n          }\n        } else {\n          if (message.documentTime) {\n            // This is just a regular ping message to update the document time - send the document time to all connected clients\n            this.sendPings();\n            return;\n          }\n          console.error(\"Unknown message type from observableDOM\", message);\n        }\n      },\n    );\n  }\n\n  private defaultLogCallback(message: LogMessage) {\n    const getLogFn = (level: string) => {\n      switch (level) {\n        case \"system\":\n          return console.error;\n        case \"error\":\n          return console.error;\n        case \"warn\":\n          return console.warn;\n        case \"log\":\n          return console.log;\n        case \"info\":\n          return console.info;\n        default:\n          return console.log;\n      }\n    };\n\n    const logFn = getLogFn(message.level);\n    logFn(`${message.level.toUpperCase()} (${this.htmlPath}):`, ...message.content);\n  }\n\n  private addRemappedNodeId(clientFacingNodeId: number, internalNodeId: number) {\n    this.internalNodeIdToClientNodeId.set(internalNodeId, clientFacingNodeId);\n    this.clientNodeIdToInternalNodeId.set(clientFacingNodeId, internalNodeId);\n    this.maximumNodeId = Math.max(this.maximumNodeId, Math.max(clientFacingNodeId, internalNodeId));\n  }\n\n  private sendPings() {\n    const ping = this.pingCounter++;\n    if (this.pingCounter > 1000) {\n      this.pingCounter = 1;\n    }\n    const pingMessage: Array<ServerMessage> = [\n      {\n        type: \"ping\",\n        ping,\n        documentTime: this.getDocumentTime(),\n      },\n    ];\n    const stringified = JSON.stringify(pingMessage);\n    this.connectionIdToWebSocketContext.forEach((webSocketContext) => {\n      webSocketContext.webSocket.send(stringified);\n    });\n  }\n\n  private getInitialSnapshot(\n    connectionId: number,\n    documentVirtualDOMElement: StaticVirtualDOMElement,\n  ): SnapshotMessage {\n    const visibleNodesForConnection = this.visibleNodeIdsByConnectionId.get(connectionId);\n    if (!visibleNodesForConnection) {\n      const err = new Error(\n        `visibleNodesForConnection not found for connectionId in getInitialSnapshot: ${connectionId}`,\n      );\n      console.error(err);\n      throw err;\n    }\n    const domSnapshot: NodeDescription | null = describeNodeWithChildrenForConnectionId(\n      documentVirtualDOMElement,\n      connectionId,\n      visibleNodesForConnection,\n    );\n    if (!domSnapshot) {\n      throw new Error(`domSnapshot was not generated`);\n    }\n    return {\n      type: \"snapshot\",\n      snapshot: domSnapshot,\n      documentTime: Date.now() - this.documentEffectiveStartTime,\n    };\n  }\n\n  public getDocumentTime(): number {\n    return this.latestDocumentTime;\n  }\n\n  public addExistingWebsockets(\n    websockets: Array<WebSocket>,\n    existingWebsocketMap: Map<WebSocket, number> | null,\n    domDiff: VirtualDOMDiffStruct | null,\n  ) {\n    const connectionIds = [];\n    for (const websocket of websockets) {\n      let existingId = null;\n      if (existingWebsocketMap !== null) {\n        existingId = existingWebsocketMap.get(websocket);\n      }\n      const { connectionId } = this.registerWebsocket(websocket, existingId);\n      connectionIds.push(connectionId);\n    }\n\n    if (domDiff) {\n      const diffsByConnectionId = new Map<number, Array<Diff>>(\n        connectionIds.map((connectionId) => [connectionId, []]),\n      );\n\n      // Each of the websockets needs to have the original state of the document re-applied to it to determine visible\n      // nodes, but not sent (they already have the old version of the document as their state).\n      for (const connectionId of connectionIds) {\n        // Ignore the return value - the side effect is that the visible nodes for the connection are set\n        this.getInitialSnapshot(connectionId, domDiff.originalState);\n      }\n\n      for (const virtualDOMDiff of domDiff.virtualDOMDiffs) {\n        // Convert the diff of the virtual dom data structure to a MutationRecord-like diff and then handle it as if it were a MutationRecord\n        // The difficulty here is that the JSON diff is typed by add/remove/replace of elements of a hierarchy specified by paths, but MutationRecords are specified by type of operation and nodeIds\n\n        const mutationRecordLikes = virtualDOMDiffToVirtualDOMMutationRecord(\n          domDiff.originalState,\n          virtualDOMDiff,\n        );\n\n        if (virtualDOMDiff.path === \"\" && virtualDOMDiff.op === \"replace\") {\n          // The patch is a snapshot replacement - no need to check the patch validity\n        } else {\n          const patchResults = applyPatch(domDiff.originalState, [virtualDOMDiff]);\n          for (const patchResult of patchResults) {\n            if (patchResult !== null) {\n              console.error(\"Patching virtual dom structure resulted in error\", patchResult);\n              throw patchResult;\n            }\n          }\n        }\n\n        for (const mutationRecordLike of mutationRecordLikes) {\n          const targetNodeId = mutationRecordLike.target.nodeId;\n          const virtualElementParent = findParentNodeOfNodeId(domDiff.originalState, targetNodeId);\n          diffsByConnectionId.forEach((diffs, connectionId) => {\n            const mutationDiff = diffFromApplicationOfStaticVirtualDOMMutationRecordToConnection(\n              mutationRecordLike,\n              virtualElementParent,\n              connectionId,\n              // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n              this.visibleNodeIdsByConnectionId.get(connectionId)!,\n            );\n            if (mutationDiff) {\n              diffs.push(mutationDiff);\n            }\n          });\n        }\n      }\n\n      diffsByConnectionId.forEach((diffs, connectionId) => {\n        if (diffs.length === 0) {\n          // Need to add an \"empty\" message to allow passing the document time to the client\n          diffs.push({\n            type: \"childrenChanged\",\n            nodeId: this.documentRoot.nodeId,\n            previousNodeId: null,\n            addedNodes: [],\n            removedNodes: [],\n          });\n        }\n        const asServerMessages: Array<ServerMessage> = diffs;\n        const firstDiff = diffs[0];\n        firstDiff.documentTime = this.getDocumentTime();\n        const serializedDiffs = JSON.stringify(asServerMessages);\n        const webSocketContext = this.connectionIdToWebSocketContext.get(connectionId);\n        if (!webSocketContext) {\n          throw new Error(`webSocketContext not found in addExistingWebsockets`);\n        }\n        webSocketContext.webSocket.send(serializedDiffs);\n      });\n    } else {\n      const documentVirtualDOMElement = this.documentRoot;\n      if (!documentVirtualDOMElement) {\n        throw new Error(`documentVirtualDOMElement not found in getInitialSnapshot`);\n      }\n      for (const connectionId of connectionIds) {\n        const webSocketContext = this.connectionIdToWebSocketContext.get(connectionId);\n        if (!webSocketContext) {\n          throw new Error(`webSocketContext not found in addExistingWebsockets`);\n        }\n        const asServerMessages: Array<ServerMessage> = [\n          this.getInitialSnapshot(connectionId, documentVirtualDOMElement),\n        ];\n        const serializedSnapshotMessage = JSON.stringify(asServerMessages);\n        webSocketContext.webSocket.send(serializedSnapshotMessage);\n      }\n    }\n\n    for (const connectionId of connectionIds) {\n      this.observableDOM.addConnectedUserId(connectionId);\n    }\n  }\n\n  private findParentNodeOfNodeId(targetNodeId: number): StaticVirtualDOMElement | null {\n    const parentNodeId = this.nodeIdToParentNodeId.get(targetNodeId);\n    if (parentNodeId === undefined) {\n      throw new Error(\"Parent node ID not found\");\n    }\n    return this.getStaticVirtualDOMElementByInternalNodeIdOrThrow(parentNodeId);\n  }\n\n  private registerWebsocket(\n    webSocket: WebSocket,\n    existingConnectionId: number | null = null,\n  ): { connectionId: number } {\n    let connectionId: number;\n    if (existingConnectionId !== null) {\n      connectionId = existingConnectionId;\n      this.currentConnectionId = Math.max(this.currentConnectionId, connectionId + 1);\n    } else {\n      connectionId = this.currentConnectionId++;\n    }\n    const webSocketContext = {\n      webSocket,\n      messageListener: (messageEvent: MessageEvent) => {\n        const string = String(messageEvent.data);\n        let parsed;\n        try {\n          parsed = JSON.parse(string) as ClientMessage;\n        } catch (e) {\n          console.error(`Error parsing message from websocket: ${string}`);\n          console.trace();\n          return;\n        }\n\n        if (NetworkedDOM.IsPongMessage(parsed)) {\n          // Ignore pongs for now\n          return;\n        }\n\n        this.dispatchRemoteEvent(webSocket, parsed);\n      },\n    };\n    this.connectionIdToWebSocketContext.set(connectionId, webSocketContext);\n    this.visibleNodeIdsByConnectionId.set(connectionId, new Set());\n    this.webSocketToConnectionId.set(webSocket, connectionId);\n    webSocket.addEventListener(\"message\", webSocketContext.messageListener);\n    return { connectionId };\n  }\n\n  public static handleWebsocketSubprotocol(protocols: Set<string> | Array<string>): string | false {\n    const protocolsSet = new Set(protocols);\n    // Find highest priority (first in the array) protocol that is supported\n    for (const protocol of NetworkedDOM.SupportedWebsocketSubProtocolsPreferenceOrder) {\n      if (protocolsSet.has(protocol)) {\n        return protocol;\n      }\n    }\n    return false;\n  }\n\n  public addWebSocket(webSocket: WebSocket): void {\n    if (this.initialLoad) {\n      throw new Error(\"addWebSocket called before initial load - unsupported at this time\");\n    }\n    if (this.disposed) {\n      console.error(\"addWebSocket called on disposed NetworkedDOM\");\n      throw new Error(\"This NetworkedDOM has been disposed\");\n    }\n\n    if (webSocket.protocol) {\n      if (\n        NetworkedDOM.SupportedWebsocketSubProtocolsPreferenceOrder.indexOf(webSocket.protocol) ===\n        -1\n      ) {\n        const errorMessageString = `Unsupported websocket subprotocol: ${webSocket.protocol}`;\n        const errorMessage: Array<ServerMessage> = [\n          {\n            type: \"error\",\n            message: errorMessageString,\n          },\n        ];\n        webSocket.send(JSON.stringify(errorMessage));\n        webSocket.close();\n        return;\n      }\n    } else {\n      // TODO - Revisit the default handling of non-protocol websockets. It is easier to debug if a lack of protocol results in an error.\n      // Assume for now that this client is a legacy MML client that doesn't send a protocol, but send a warning to the client to encourage specifying a protocol\n      const warningMessageString = `No websocket subprotocol specified. Please specify a subprotocol to ensure compatibility with networked-dom servers. Assuming subprotocol \"${defaultWebsocketSubProtocol}\" for this connection.`;\n      const warningMessage: Array<ServerMessage> = [\n        {\n          type: \"warning\",\n          message: warningMessageString,\n        },\n      ];\n      webSocket.send(JSON.stringify(warningMessage));\n    }\n\n    const { connectionId } = this.registerWebsocket(webSocket);\n    const documentVirtualDOMElement = this.documentRoot;\n    if (!documentVirtualDOMElement) {\n      throw new Error(`documentVirtualDOMElement not found in getInitialSnapshot`);\n    }\n    const asServerMessages: Array<ServerMessage> = [\n      this.getInitialSnapshot(connectionId, documentVirtualDOMElement),\n    ];\n    const serializedSnapshotMessage = JSON.stringify(asServerMessages);\n    webSocket.send(serializedSnapshotMessage);\n    this.observableDOM.addConnectedUserId(connectionId);\n  }\n\n  public removeWebSocket(webSocket: WebSocket): void {\n    const connectionId = this.webSocketToConnectionId.get(webSocket);\n    if (!connectionId) {\n      return;\n    }\n    this.observableDOM.removeConnectedUserId(connectionId);\n    const webSocketContext = this.connectionIdToWebSocketContext.get(connectionId);\n    if (!webSocketContext) {\n      throw new Error(\"Missing context for websocket\");\n    }\n    webSocket.removeEventListener(\"message\", webSocketContext.messageListener);\n    this.connectionIdToWebSocketContext.delete(connectionId);\n    this.visibleNodeIdsByConnectionId.delete(connectionId);\n    this.webSocketToConnectionId.delete(webSocket);\n  }\n\n  public dispose(): void {\n    this.disposed = true;\n\n    // Handle all of the remaining mutations that the disconnections could have caused\n    this.observableDOM.dispose();\n\n    for (const [webSocket, connectionId] of this.webSocketToConnectionId) {\n      const webSocketContext = this.connectionIdToWebSocketContext.get(connectionId);\n      if (!webSocketContext) {\n        throw new Error(\"Missing context for websocket\");\n      }\n      webSocket.removeEventListener(\"message\", webSocketContext.messageListener);\n      this.connectionIdToWebSocketContext.delete(connectionId);\n      this.visibleNodeIdsByConnectionId.delete(connectionId);\n      this.webSocketToConnectionId.delete(webSocket);\n    }\n  }\n\n  private processModification(mutationRecord: StaticVirtualDOMMutationRecord): void {\n    const documentVirtualDOMElement = this.documentRoot;\n    if (!documentVirtualDOMElement) {\n      throw new Error(`document not created in processModification`);\n    }\n\n    for (const [, visibleNodesForConnection] of this.visibleNodeIdsByConnectionId) {\n      visibleNodesForConnection.add(documentVirtualDOMElement.nodeId);\n    }\n\n    const diffsByConnectionId = new Map<number, Array<Diff>>(\n      Array.from(this.connectionIdToWebSocketContext.keys()).map((connectionId) => [\n        connectionId,\n        [],\n      ]),\n    );\n\n    diffsByConnectionId.forEach((diffs, connectionId) => {\n      const parentNode = this.findParentNodeOfNodeId(mutationRecord.target.nodeId);\n      if (mutationRecord.type === \"attributes\" && !parentNode) {\n        console.error(\"parentNode not found for attribute mutationRecord\", mutationRecord);\n        console.error(\"this.documentRoot\", JSON.stringify(this.documentRoot, null, 2));\n      }\n      const diff = diffFromApplicationOfStaticVirtualDOMMutationRecordToConnection(\n        mutationRecord,\n        parentNode,\n        connectionId,\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        this.visibleNodeIdsByConnectionId.get(connectionId)!,\n      );\n      if (diff) {\n        diffs.push(diff);\n      }\n    });\n\n    diffsByConnectionId.forEach((diffs, connectionId) => {\n      if (diffs.length > 0) {\n        const asServerMessages: Array<ServerMessage> = diffs;\n        const serializedDiffs = JSON.stringify(asServerMessages);\n        const webSocketContext = this.connectionIdToWebSocketContext.get(connectionId);\n        if (!webSocketContext) {\n          throw new Error(`webSocketContext not found in processModificationList`);\n        }\n        webSocketContext.webSocket.send(serializedDiffs);\n      }\n    });\n  }\n\n  private removeKnownNodesInMutation(mutation: StaticVirtualDOMMutationRecord): void {\n    const virtualDOMElement = mutation.target;\n    if (mutation.type === \"childList\") {\n      mutation.removedNodes.forEach((childDOMElement: StaticVirtualDOMElement) => {\n        this.removeVirtualDOMElement(childDOMElement);\n        const index = virtualDOMElement.childNodes.indexOf(childDOMElement);\n        virtualDOMElement.childNodes.splice(index, 1);\n      });\n      return;\n    }\n  }\n\n  private removeVirtualDOMElement(virtualDOMElement: StaticVirtualDOMElement): void {\n    this.nodeIdToNode.delete(virtualDOMElement.nodeId);\n    this.nodeIdToParentNodeId.delete(virtualDOMElement.nodeId);\n    for (const child of virtualDOMElement.childNodes) {\n      this.removeVirtualDOMElement(child);\n    }\n  }\n\n  static IsPongMessage(message: ClientMessage): message is PongMessage {\n    return (message as PongMessage).type === \"pong\";\n  }\n\n  private dispatchRemoteEvent(webSocket: WebSocket, remoteEvent: RemoteEvent): void {\n    if (this.disposed) {\n      console.error(\"Cannot dispatch remote event after dispose\");\n      throw new Error(\"This NetworkedDOM has been disposed\");\n    }\n\n    const connectionId = this.webSocketToConnectionId.get(webSocket);\n    if (!connectionId) {\n      console.error(\"Unknown web socket dispatched event:\", webSocket);\n      return;\n    }\n\n    const visibleNodes = this.visibleNodeIdsByConnectionId.get(connectionId);\n    if (!visibleNodes) {\n      console.error(\"No visible nodes for connection: \" + connectionId);\n      return;\n    }\n\n    if (!visibleNodes.has(remoteEvent.nodeId)) {\n      // TODO - do a pass through the hierarchy to determine if this node should be visible to this connection id to prevent clients submitting events for nodes they can't (currently) see\n      console.error(\"Node not visible for connection: \" + remoteEvent.nodeId);\n      return;\n    }\n\n    const remappedNode = this.clientNodeIdToInternalNodeId.get(remoteEvent.nodeId);\n    if (remappedNode) {\n      remoteEvent.nodeId = remappedNode;\n    }\n\n    this.observableDOM.dispatchRemoteEventFromConnectionId(connectionId, remoteEvent);\n  }\n\n  private getStaticVirtualDOMElementByInternalNodeIdOrThrow(\n    internalNodeId: number,\n  ): StaticVirtualDOMElement {\n    const remappedId = this.internalNodeIdToClientNodeId.get(internalNodeId);\n    if (remappedId !== undefined) {\n      const node = this.nodeIdToNode.get(remappedId);\n      if (!node) {\n        throw new Error(\"Remapped node not found with nodeId \" + remappedId);\n      }\n      return node;\n    }\n    const node = this.nodeIdToNode.get(internalNodeId);\n    if (!node) {\n      throw new Error(\"Node not found with nodeId:\" + internalNodeId);\n    }\n    return node;\n  }\n\n  private addKnownNodesInMutation(\n    mutation: StaticVirtualDOMMutationIdsRecord,\n  ): StaticVirtualDOMMutationRecord {\n    const target = this.getStaticVirtualDOMElementByInternalNodeIdOrThrow(mutation.targetId);\n\n    // TODO - avoid mutation in this conversion - use the attribute pair in the handling (would require changing StaticVirtualDOMMutationRecord.attributeName to be the key/value pair).\n    if (mutation.attribute) {\n      if (mutation.attribute.value !== null) {\n        target.attributes[mutation.attribute.attributeName] = mutation.attribute.value;\n      } else {\n        delete target.attributes[mutation.attribute.attributeName];\n      }\n    }\n\n    const previousSibling = mutation.previousSiblingId\n      ? this.getStaticVirtualDOMElementByInternalNodeIdOrThrow(mutation.previousSiblingId)\n      : null;\n\n    if (mutation.type === \"childList\") {\n      let index = 0;\n      if (previousSibling) {\n        index = target.childNodes.indexOf(previousSibling);\n        if (index === -1) {\n          throw new Error(\"Previous sibling is not currently a child of the parent element\");\n        }\n        index += 1;\n      }\n      mutation.addedNodes.forEach((childVirtualDOMElement: StaticVirtualDOMElement) => {\n        this.addAndRemapNodeFromInstance(childVirtualDOMElement, target.nodeId);\n\n        if (target.childNodes.indexOf(childVirtualDOMElement) === -1) {\n          target.childNodes.splice(index, 0, childVirtualDOMElement);\n          index++;\n        }\n      });\n    } else if (mutation.type === \"attributes\") {\n      // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n      const attributePair = mutation.attribute!;\n      if (attributePair.value === null) {\n        delete target.attributes[attributePair.attributeName];\n      } else {\n        target.attributes[attributePair.attributeName] = attributePair.value;\n      }\n    } else if (mutation.type === \"characterData\") {\n      // TODO - reimplement characterData\n      throw new Error(\"characterData not supported\");\n      // virtualDOMElement.textContent = targetNode.textContent ? targetNode.textContent : undefined;\n    }\n\n    const record: StaticVirtualDOMMutationRecord = {\n      type: mutation.type,\n      target,\n      addedNodes: mutation.addedNodes,\n      removedNodes: mutation.removedNodeIds.map((nodeId) => {\n        return this.getStaticVirtualDOMElementByInternalNodeIdOrThrow(nodeId);\n      }),\n      previousSibling: mutation.previousSiblingId\n        ? this.getStaticVirtualDOMElementByInternalNodeIdOrThrow(mutation.previousSiblingId)\n        : null,\n      attributeName: mutation.attribute ? mutation.attribute.attributeName : null,\n    };\n\n    return record;\n  }\n\n  getSnapshot(): StaticVirtualDOMElement {\n    return this.documentRoot;\n  }\n\n  private addAndRemapNodeFromInstance(node: StaticVirtualDOMElement, parentNodeId: number) {\n    const remappedNodeId = this.internalNodeIdToClientNodeId.get(node.nodeId);\n    if (remappedNodeId !== undefined) {\n      node.nodeId = remappedNodeId;\n    } else {\n      // This id might already refer to a node in this client's view. If so, we need to remap it to a new id.\n      const existingClientReference = this.clientNodeIdToInternalNodeId.get(node.nodeId);\n      if (existingClientReference) {\n        const newNodeId = ++this.maximumNodeId;\n        this.addRemappedNodeId(newNodeId, node.nodeId);\n        node.nodeId = newNodeId;\n      }\n    }\n\n    if (this.nodeIdToNode.has(node.nodeId)) {\n      throw new Error(\"Node already exists with id \" + node.nodeId);\n    }\n\n    this.nodeIdToNode.set(node.nodeId, node);\n    this.nodeIdToParentNodeId.set(node.nodeId, parentNodeId);\n    this.maximumNodeId = Math.max(this.maximumNodeId, node.nodeId);\n\n    for (const childNode of node.childNodes) {\n      this.addAndRemapNodeFromInstance(childNode, node.nodeId);\n    }\n  }\n\n  public getWebsocketConnectionIdMap() {\n    // return a clone of the map\n    return new Map(this.webSocketToConnectionId);\n  }\n}\n", "import { LogMessage, StaticVirtualDOMElement } from \"@mml-io/observable-dom-common\";\n\nimport { VirtualDOMDiffStruct } from \"./common\";\nimport { NetworkedDOM, ObservableDOMFactory } from \"./NetworkedDOM\";\n\ntype LoadedState = {\n  htmlContents: string;\n  networkedDOM: NetworkedDOM;\n  loaded: boolean;\n};\n\n/**\n * EditableNetworkedDOM wraps NetworkedDOM instances and presents them as a single document that can iterate through\n * revisions by being loaded multiple times with different contents. The connected clients receive deltas between the\n * revisions rather than a complete refresh.\n */\nexport class EditableNetworkedDOM {\n  private htmlPath: string;\n  private params: object = {};\n\n  private websockets = new Set<WebSocket>();\n  private loadedState: LoadedState | null = null;\n\n  private observableDOMFactory: ObservableDOMFactory;\n  private ignoreTextNodes: boolean;\n\n  private logCallback?: (message: LogMessage) => void;\n\n  constructor(\n    htmlPath: string,\n    observableDOMFactory: ObservableDOMFactory,\n    ignoreTextNodes = true,\n    logCallback?: (message: LogMessage) => void,\n  ) {\n    this.htmlPath = htmlPath;\n    this.observableDOMFactory = observableDOMFactory;\n    this.ignoreTextNodes = ignoreTextNodes;\n    this.logCallback = logCallback;\n  }\n\n  public isLoaded() {\n    return this.loadedState !== null;\n  }\n\n  public load(htmlContents: string, params?: object) {\n    if (params !== undefined) {\n      this.params = params;\n    }\n\n    let oldInstanceRoot: StaticVirtualDOMElement | null = null;\n    let existingWebsocketMap: Map<WebSocket, number> | null = null;\n    if (this.loadedState) {\n      const oldInstance = this.loadedState.networkedDOM;\n      existingWebsocketMap = oldInstance.getWebsocketConnectionIdMap();\n      oldInstance.dispose();\n      oldInstanceRoot = oldInstance.getSnapshot();\n    }\n    this.loadedState = null;\n\n    let didLoad = false;\n    const networkedDOM = new NetworkedDOM(\n      this.observableDOMFactory,\n      this.htmlPath,\n      htmlContents,\n      oldInstanceRoot,\n      (domDiff: VirtualDOMDiffStruct | null, networkedDOM: NetworkedDOM) => {\n        didLoad = true;\n        if (this.loadedState) {\n          this.loadedState.loaded = true;\n        }\n        networkedDOM.addExistingWebsockets(\n          Array.from(this.websockets),\n          existingWebsocketMap,\n          domDiff,\n        );\n      },\n      this.params,\n      this.ignoreTextNodes,\n      this.logCallback,\n    );\n    this.loadedState = {\n      htmlContents,\n      networkedDOM,\n      loaded: didLoad,\n    };\n  }\n\n  public reload() {\n    if (this.loadedState) {\n      this.load(this.loadedState.htmlContents, this.params);\n    } else {\n      console.warn(\"EditableNetworkedDOM.reload called whilst not loaded\");\n    }\n  }\n\n  public dispose() {\n    for (const ws of this.websockets) {\n      ws.close();\n    }\n    this.websockets.clear();\n    if (this.loadedState) {\n      this.loadedState.networkedDOM.dispose();\n    }\n    this.loadedState = null;\n  }\n\n  public addWebSocket(webSocket: WebSocket) {\n    this.websockets.add(webSocket);\n    if (this.loadedState && this.loadedState.loaded) {\n      this.loadedState.networkedDOM.addWebSocket(webSocket);\n    }\n  }\n\n  public removeWebSocket(webSocket: WebSocket) {\n    this.websockets.delete(webSocket);\n    if (this.loadedState && this.loadedState.loaded) {\n      this.loadedState.networkedDOM.removeWebSocket(webSocket);\n    }\n  }\n}\n"],
-  "mappings": ";AAoBA,SAAS,SAAS,OAAuB;AACvC,SAAO,MAAM,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG;AACrD;AAUA,SAAS,OAAO,OAAuB;AACrC,SAAO,MAAM,QAAQ,MAAM,IAAI,EAAE,QAAQ,OAAO,IAAI;AACtD;AAWO,IAAM,UAAN,MAAM,SAAQ;AAAA,EACnB,YAAmB,SAAS,CAAC,EAAE,GAAG;AAAf;AAAA,EAAgB;AAAA;AAAA;AAAA;AAAA,EAInC,OAAO,SAAS,MAAuB;AACrC,UAAM,SAAS,KAAK,MAAM,GAAG,EAAE,IAAI,QAAQ;AAC3C,QAAI,OAAO,CAAC,MAAM;AAAI,YAAM,IAAI,MAAM,yBAAyB,IAAI,EAAE;AACrE,WAAO,IAAI,SAAQ,MAAM;AAAA,EAC3B;AAAA,EACA,WAAmB;AACjB,WAAO,KAAK,OAAO,IAAI,MAAM,EAAE,KAAK,GAAG;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,QAAgC;AACvC,QAAI,SAAc;AAClB,QAAI,MAAM;AACV,QAAI,QAAQ;AACZ,aAAS,IAAI,GAAG,IAAI,KAAK,OAAO,QAAQ,IAAI,GAAG,KAAK;AAClD,eAAS;AACT,YAAM,KAAK,OAAO,CAAC;AACnB,UAAI,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ,aAAa;AACvE;AAAA,MACF;AAEA,eAAS,UAAU,CAAC,GAAG,GAAG;AAAA,IAC5B;AACA,WAAO,EAAE,QAAQ,KAAK,MAAM;AAAA,EAC9B;AAAA,EACA,IAAI,QAAkB;AACpB,WAAO,KAAK,SAAS,MAAM,EAAE;AAAA,EAC/B;AAAA,EACA,IAAI,QAAa,OAAkB;AACjC,QAAI,SAAc;AAClB,aAAS,IAAI,GAAG,IAAI,KAAK,OAAO,SAAS,GAAG,QAAQ,KAAK,OAAO,CAAC,GAAG,IAAI,GAAG,KAAK;AAE9E,gBAAU,UAAU,CAAC,GAAG,KAAK;AAAA,IAC/B;AACA,QAAI,QAAQ;AACV,aAAO,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC,CAAC,IAAI;AAAA,IAChD;AAAA,EACF;AAAA,EACA,KAAK,OAAqB;AAExB,SAAK,OAAO,KAAK,KAAK;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAI,OAAwB;AAC1B,UAAM,SAAS,KAAK,OAAO,OAAO,OAAO,KAAK,CAAC;AAC/C,WAAO,IAAI,SAAQ,MAAM;AAAA,EAC3B;AACF;;;ACzGO,SAAS,UAAU,GAAQ,GAAiB;AACjD,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG;AACxC,QAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,aAAO;AAAA,IACT;AAEA,WAAO,EAAE,MAAM,CAAC,MAAM,UAAU;AAC9B,aAAO,UAAU,MAAM,EAAE,KAAK,CAAC;AAAA,IACjC,CAAC;AAAA,EACH;AAEA,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,YAAY,MAAM,QAAQ,MAAM,MAAM;AAC9E,QAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG;AACxC,aAAO;AAAA,IACT;AAEA,UAAM,QAAQ,OAAO,KAAK,CAAC;AAC3B,UAAM,QAAQ,OAAO,KAAK,CAAC;AAC3B,QAAI,MAAM,WAAW,MAAM,UAAU,CAAC,MAAM,MAAM,CAAC,QAAQ,MAAM,SAAS,GAAG,CAAC,GAAG;AAC/E,aAAO;AAAA,IACT;AAEA,eAAW,OAAO,GAAG;AACnB,UAAI,CAAC,UAAU,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG;AAC9B,eAAO;AAAA,MACT;AAAA,IACF;AAEA,QAAI,MAAM,WAAW,KAAK,aAAa,QAAQ,aAAa,MAAM;AAEhE,aAAO,EAAE,QAAQ,MAAM,EAAE,QAAQ;AAAA,IACnC;AAEA,WAAO;AAAA,EACT;AACA,SAAO;AACT;;;ACxCO,IAAM,iBAAiB,OAAO,UAAU;AAExC,SAAS,WAAW,QAAa;AACtC,MAAI,WAAW,QAAW;AACxB,WAAO;AAAA,EACT;AACA,MAAI,WAAW,MAAM;AACnB,WAAO;AAAA,EACT;AACA,MAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,WAAO;AAAA,EACT;AACA,SAAO,OAAO;AAChB;AAEA,SAAS,eAAe,OAA6B;AAGnD,SAAO,SAAS,QAAQ,OAAO,UAAU;AAC3C;AASO,SAAS,MAAS,QAAc;AACrC,MAAI,CAAC,eAAe,MAAM,GAAG;AAE3B,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,MAAM,GAAG;AAEzB,UAAM,SAAU,OAAsB;AAEtC,UAAM,cAAmB,IAAI,MAAM,MAAM;AACzC,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,kBAAY,CAAC,IAAI,MAAM,OAAO,CAAC,CAAC;AAAA,IAClC;AACA,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,gBAAgB,MAAM;AAC/B,UAAM,aAAkB,oBAAI,KAAK,CAAC,MAAM;AACxC,WAAO;AAAA,EACT;AAEA,QAAM,eAAoB,CAAC;AAE3B,aAAW,OAAO,QAAQ;AAGxB,QAAI,eAAe,KAAK,QAAQ,GAAG,GAAG;AACpC,mBAAa,GAAG,IAAI,MAAM,OAAO,GAAG,CAAC;AAAA,IACvC;AAAA,EACF;AACA,SAAO;AACT;;;ACiBA,SAAS,iBAAiB,MAA0B;AAClD,WAAS,YAAY,OAAY,QAAa,KAA2B;AACvE,UAAM,eAAe,KAAK,OAAO,QAAQ,GAAG;AAE5C,WAAO,MAAM,QAAQ,YAAY,IAAI,eAAe,QAAQ,OAAO,QAAQ,KAAK,WAAW;AAAA,EAC7F;AACA,SAAO;AACT;AAiDO,SAAS,YAAY,OAAY,QAAa,MAAkC;AACrF,QAAM,MAAM,IAAI,QAAQ;AAExB,UAAQ,OAAO,iBAAiB,IAAI,IAAI,SAAS,OAAO,QAAQ,GAAG;AACrE;AAaO,SAAS,SACd,SACA,YACU;AAEV,QAAM,MAAmC,CAAC;AAE1C,aAAW,WAAW,SAAS;AAC7B,QAAI,eAAe,KAAK,SAAS,OAAO,KAAK,QAAQ,OAAO,MAAM,QAAW;AAC3E,UAAI,OAAO,IAAI;AAAA,IACjB;AAAA,EACF;AAGA,aAAW,WAAW,YAAY;AAChC,QAAI,eAAe,KAAK,YAAY,OAAO,KAAK,WAAW,OAAO,MAAM,QAAW;AACjF,aAAO,IAAI,OAAO;AAAA,IACpB;AAAA,EACF;AAEA,SAAO,OAAO,KAAK,GAAG;AACxB;AAUO,SAAS,aAAa,SAAwD;AACnF,QAAM,SAAS,QAAQ;AAEvB,QAAM,UAAuC,CAAC;AAE9C,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAM,SAAS,QAAQ,CAAC;AACxB,eAAW,OAAO,QAAQ;AACxB,UAAI,eAAe,KAAK,QAAQ,GAAG,KAAK,OAAO,GAAG,MAAM,QAAW;AACjE,gBAAQ,GAAG,KAAK,QAAQ,GAAG,KAAK,KAAK;AAAA,MACvC;AAAA,IACF;AAAA,EACF;AAEA,aAAW,OAAO,SAAS;AACzB,QAAI,QAAQ,GAAG,IAAI,QAAQ;AACzB,aAAO,QAAQ,GAAG;AAAA,IACpB;AAAA,EACF;AAEA,SAAO,OAAO,KAAK,OAAO;AAC5B;AAqBA,SAAS,WAAW,iBAA8D;AAChF,SAAO,gBAAgB,OAAO;AAChC;AACA,SAAS,cAAc,iBAAiE;AACtF,SAAO,gBAAgB,OAAO;AAChC;AAcA,SAAS,gBAAgB,MAAwC,GAAW,GAAW;AACrF,MAAI,WAA+B,KAAK,CAAC,EAAE,CAAC;AAC5C,MAAI,CAAC,UAAU;AACb,UAAM,IAAI,MAAM,cAAc;AAAA,EAChC;AACA,QAAM,aAA+B,CAAC;AACtC,SAAO,YAAY,SAAS,QAAQ,SAAS,WAAW;AACtD,eAAW,KAAK,SAAS,SAAS;AAClC,UAAM,QAAQ,SAAS,KAAK,MAAM,GAAG;AACrC,eAAW,KAAK,OAAO,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,MAAM,CAAC,CAAC,CAAC;AAAA,EACpD;AACA,SAAO,WAAW,QAAQ;AAC5B;AA8BO,SAAS,WACd,OACA,QACA,KACA,OAAa,SACA;AACb,MAAI,SAAS,QAAQ;AACnB,WAAO;AAAA,EACT;AAEA,QAAM,eAAe,MAAM,MAAM,MAAM,KAAK,MAAM,UAAU,IAAI,IAAI,MAAM;AAC1E,QAAM,gBAAgB,MAAM,OAAO,MAAM,KAAK,OAAO,UAAU,IAAI,IAAI,OAAO;AAC9E,MAAI,YAAY;AAChB,MAAI,aAAa;AACjB,SAAO,YAAY,KAAK,aAAa,GAAG;AAEtC,QAAI,UAAU,MAAM,YAAY,CAAC,GAAG,OAAO,aAAa,CAAC,CAAC,GAAG;AAC3D;AACA;AAAA,IACF,OAAO;AACL;AAAA,IACF;AAAA,EACF;AACA,QAAM,OAAyC,IAAI,MAAM,YAAY,CAAC;AACtE,WAAS,IAAI,GAAG,KAAK,WAAW,KAAK;AACnC,SAAK,CAAC,IAAI,IAAI,MAAM,aAAa,CAAC;AAAA,EACpC;AACA,OAAK,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,MAAM,WAAW,MAAM,MAAM,EAAE;AAapD,WAAS,IAAI,GAAG,KAAK,WAAW,KAAK;AACnC,aAAS,IAAI,GAAG,KAAK,YAAY,KAAK;AACpC,UAAI,WAAW,KAAK,CAAC,EAAE,CAAC;AACxB,UAAI;AAAU;AACd,YAAM,eAAe,GAAG,CAAC,IAAI,IAAI,CAAC;AAClC,YAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC;AACrC,YAAM,mBAAmB,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC;AAC1C,YAAM,mBAAgC;AAAA,QACpC,IAAI;AAAA,QACJ,OAAO,IAAI;AAAA,MACb;AACA,YAAM,gBAA0B;AAAA,QAC9B,IAAI;AAAA,QACJ,OAAO,IAAI;AAAA,QACX,OAAO,OAAO,IAAI,CAAC;AAAA,MACrB;AAEA,UAAI,MAAM,GAAG;AACX,mBAAW;AAAA,UACT,MAAM;AAAA,UACN,WAAW;AAAA,UACX,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,EAAE,OAAO;AAAA,QAC9B;AAAA,MACF,WAAW,MAAM,GAAG;AAClB,mBAAW,EAAE,MAAM,cAAc,WAAW,eAAe,MAAM,KAAK,CAAC,EAAE,IAAI,CAAC,EAAE,OAAO,EAAE;AAAA,MAC3F,OAAO;AACL,YAAI,UAAU,MAAM,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,GAAG;AAC1C,qBAAW,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC;AAAA,QAC9B,OAAO;AACL,gBAAM,cAAc,KAAK,IAAI,CAAC,EAAE,CAAC;AACjC,gBAAM,WAAW,KAAK,CAAC,EAAE,IAAI,CAAC;AAC9B,gBAAM,eAAe,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC;AACtC,gBAAM,WAAW,KAAK,IAAI,aAAa,MAAM,SAAS,MAAM,YAAY,IAAI;AAC5E,cAAI,YAAY,SAAS,UAAU;AACjC,uBAAW;AAAA,cACT,MAAM;AAAA,cACN,WAAW;AAAA,cACX,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,EAAE,OAAO;AAAA,YAC9B;AAAA,UACF,WAAW,SAAS,SAAS,UAAU;AACrC,uBAAW;AAAA,cACT,MAAM;AAAA,cACN,WAAW;AAAA,cACX,MAAM,KAAK,CAAC,EAAE,IAAI,CAAC,EAAE,OAAO;AAAA,YAC9B;AAAA,UACF,OAAO;AACL,kBAAM,oBAAkC;AAAA,cACtC,IAAI;AAAA,cACJ,OAAO,IAAI;AAAA,cACX,UAAU,MAAM,IAAI,CAAC;AAAA,cACrB,OAAO,OAAO,IAAI,CAAC;AAAA,YACrB;AACA,uBAAW;AAAA,cACT,MAAM;AAAA,cACN,WAAW;AAAA,cACX,MAAM,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,OAAO;AAAA,YAClC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,WAAK,CAAC,EAAE,CAAC,IAAI;AAAA,IACf;AAAA,EACF;AACA,QAAM,mBAAmB,gBAAgB,MAAM,WAAW,UAAU;AACpE,QAAM,CAAC,iBAAiB,IAAI,iBAAiB;AAAA,IAC3C,CAAC,CAAC,YAAY,OAAO,GAAG,oBAAoB;AAC1C,UAAI,WAAW,eAAe,GAAG;AAC/B,cAAM,eAAe,gBAAgB,QAAQ,IAAI;AACjD,cAAM,cAAc,eAAe,eAAe,UAAU,OAAO,YAAY,IAAI;AACnF,cAAM,YAAY;AAAA,UAChB,IAAI,gBAAgB;AAAA,UACpB,MAAM,IAAI,IAAI,WAAW,EAAE,SAAS;AAAA,UACpC,OAAO,gBAAgB;AAAA,QACzB;AAEA,eAAO,CAAC,WAAW,OAAO,SAAS,GAAG,UAAU,CAAC;AAAA,MACnD,WAAW,cAAc,eAAe,GAAG;AACzC,cAAM,YAAY;AAAA,UAChB,IAAI,gBAAgB;AAAA,UACpB,MAAM,IAAI,IAAI,OAAO,gBAAgB,QAAQ,OAAO,CAAC,EAAE,SAAS;AAAA,QAClE;AAEA,eAAO,CAAC,WAAW,OAAO,SAAS,GAAG,UAAU,CAAC;AAAA,MACnD,OAAO;AAEL,cAAM,cAAc,IAAI,IAAI,OAAO,gBAAgB,QAAQ,OAAO,CAAC;AACnE,cAAM,qBAAqB;AAAA,UACzB,gBAAgB;AAAA,UAChB,gBAAgB;AAAA,UAChB;AAAA,QACF;AACA,eAAO,CAAC,WAAW,OAAO,GAAG,kBAAkB,GAAG,OAAO;AAAA,MAC3D;AAAA,IACF;AAAA,IACA,CAAC,CAAC,GAAG,CAAC;AAAA,EACR;AACA,SAAO;AACT;AAEO,SAAS,YACd,OACA,QACA,KACA,OAAa,SACA;AAEb,QAAM,aAA0B,CAAC;AACjC,WAAS,OAAO,MAAM,EAAE,QAAQ,CAAC,QAAQ;AACvC,eAAW,KAAK,EAAE,IAAI,UAAU,MAAM,IAAI,IAAI,GAAG,EAAE,SAAS,EAAE,CAAC;AAAA,EACjE,CAAC;AAED,WAAS,QAAQ,KAAK,EAAE,QAAQ,CAAC,QAAQ;AACvC,eAAW,KAAK,EAAE,IAAI,OAAO,MAAM,IAAI,IAAI,GAAG,EAAE,SAAS,GAAG,OAAO,OAAO,GAAG,EAAE,CAAC;AAAA,EAClF,CAAC;AAED,eAAa,CAAC,OAAO,MAAM,CAAC,EAAE,QAAQ,CAAC,QAAQ;AAC7C,eAAW,KAAK,GAAG,KAAK,MAAM,GAAG,GAAG,OAAO,GAAG,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC;AAAA,EAChE,CAAC;AACD,SAAO;AACT;AAyBO,SAAS,QAAQ,OAAY,QAAa,KAAc,OAAa,SAAsB;AAEhG,MAAI,UAAU,QAAQ;AACpB,WAAO,CAAC;AAAA,EACV;AACA,QAAM,aAAa,WAAW,KAAK;AACnC,QAAM,cAAc,WAAW,MAAM;AACrC,MAAI,eAAe,WAAW,gBAAgB,SAAS;AACrD,WAAO,WAAW,OAAO,QAAQ,KAAK,IAAI;AAAA,EAC5C;AACA,MAAI,eAAe,YAAY,gBAAgB,UAAU;AACvD,WAAO,YAAY,OAAO,QAAQ,KAAK,IAAI;AAAA,EAC7C;AAKA,SAAO,CAAC,EAAE,IAAI,WAAW,MAAM,IAAI,SAAS,GAAG,OAAO,OAAO,CAAC;AAChE;;;ACzdO,IAAM,eAAN,cAA2B,MAAM;AAAA,EACtC,YAAmB,MAAc;AAC/B,UAAM,2BAA2B,IAAI,EAAE;AADtB;AAEjB,SAAK,OAAO;AAAA,EACd;AACF;AAEO,IAAM,YAAN,cAAwB,MAAM;AAAA,EACnC,YACS,QACA,UACP;AACA,UAAM,gBAAgB,MAAM,OAAO,QAAQ,EAAE;AAHtC;AACA;AAGP,SAAK,OAAO;AAAA,EACd;AACF;AAkBO,SAAS,WAAW,QAAa,OAAoB;AAC1D,SAAO,MAAM,IAAI,CAAC,cAAc,MAAM,QAAQ,SAAS,CAAC;AAC1D;AAEA,SAAS,KAAK,QAAa,KAAa,OAAkB;AACxD,MAAI,MAAM,QAAQ,MAAM,GAAG;AAEzB,QAAI,QAAQ,KAAK;AACf,aAAO,KAAK,KAAK;AAAA,IACnB,OAAO;AACL,YAAM,QAAQ,SAAS,KAAK,EAAE;AAC9B,aAAO,OAAO,OAAO,GAAG,KAAK;AAAA,IAC/B;AAAA,EACF,OAAO;AACL,WAAO,GAAG,IAAI;AAAA,EAChB;AACF;AAEA,SAAS,QAAQ,QAAa,KAAmB;AAC/C,MAAI,MAAM,QAAQ,MAAM,GAAG;AAEzB,UAAM,QAAQ,SAAS,KAAK,EAAE;AAC9B,WAAO,OAAO,OAAO,CAAC;AAAA,EACxB,OAAO;AAEL,WAAO,OAAO,GAAG;AAAA,EACnB;AACF;AAUO,SAAS,IAAI,QAAa,WAA8C;AAC7E,QAAM,WAAW,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AAEjE,MAAI,SAAS,WAAW,QAAW;AACjC,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AACA,OAAK,SAAS,QAAQ,SAAS,KAAK,MAAM,UAAU,KAAK,CAAC;AAC1D,SAAO;AACT;AAMO,SAAS,OAAO,QAAa,WAAiD;AAEnF,QAAM,WAAW,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AACjE,MAAI,SAAS,UAAU,QAAW;AAChC,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AAEA,UAAQ,SAAS,QAAQ,SAAS,GAAG;AACrC,SAAO;AACT;AAcO,SAAS,QAAQ,QAAa,WAAkD;AACrF,QAAM,WAAW,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AACjE,MAAI,SAAS,WAAW,MAAM;AAC5B,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AAEA,MAAI,MAAM,QAAQ,SAAS,MAAM,GAAG;AAClC,QAAI,SAAS,SAAS,KAAK,EAAE,KAAK,SAAS,OAAO,QAAQ;AACxD,aAAO,IAAI,aAAa,UAAU,IAAI;AAAA,IACxC;AAAA,EACF,WAAW,SAAS,UAAU,QAAW;AACvC,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AACA,WAAS,OAAO,SAAS,GAAG,IAAI,UAAU;AAC1C,SAAO;AACT;AAiBO,SAAS,KAAK,QAAa,WAA+C;AAC/E,QAAM,gBAAgB,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AACtE,MAAI,cAAc,UAAU,QAAW;AACrC,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AACA,QAAM,WAAW,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AACjE,MAAI,SAAS,WAAW,QAAW;AACjC,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AACA,UAAQ,cAAc,QAAQ,cAAc,GAAG;AAC/C,OAAK,SAAS,QAAQ,SAAS,KAAK,cAAc,KAAK;AACvD,SAAO;AACT;AAeO,SAAS,KAAK,QAAa,WAA+C;AAC/E,QAAM,gBAAgB,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AACtE,MAAI,cAAc,UAAU,QAAW;AACrC,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AACA,QAAM,WAAW,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AACjE,MAAI,SAAS,WAAW,QAAW;AACjC,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AACA,OAAK,SAAS,QAAQ,SAAS,KAAK,MAAM,cAAc,KAAK,CAAC;AAC9D,SAAO;AACT;AAUO,SAAS,KAAK,QAAa,WAA4C;AAC5E,QAAM,WAAW,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AAEjE,MAAI,QAAQ,SAAS,OAAO,UAAU,OAAO,IAAI,QAAQ,CAAC,EAAE,QAAQ;AAClE,WAAO,IAAI,UAAU,SAAS,OAAO,UAAU,KAAK;AAAA,EACtD;AACA,SAAO;AACT;AAEO,IAAM,wBAAN,cAAoC,MAAM;AAAA,EAC/C,YAAmB,WAAsB;AACvC,UAAM,sBAAsB,UAAU,EAAE,EAAE;AADzB;AAEjB,SAAK,OAAO;AAAA,EACd;AACF;AAMO,SAAS,MACd,QACA,WACyD;AAIzD,UAAQ,UAAU,IAAI;AAAA,IACpB,KAAK;AACH,aAAO,IAAI,QAAQ,SAAS;AAAA,IAC9B,KAAK;AACH,aAAO,OAAO,QAAQ,SAAS;AAAA,IACjC,KAAK;AACH,aAAO,QAAQ,QAAQ,SAAS;AAAA,IAClC,KAAK;AACH,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B,KAAK;AACH,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B,KAAK;AACH,aAAO,KAAK,QAAQ,SAAS;AAAA,EACjC;AACA,SAAO,IAAI,sBAAsB,SAAS;AAC5C;;;ACnOO,IAAM,oBAAoB;AAC1B,IAAM,qBAAqB;AAQ3B,SAAS,gEACd,UACA,YACA,cACA,2BACa;AACb,QAAM,oBAAoB,SAAS;AAEnC,UAAQ,SAAS,MAAM;AAAA,IACrB,KAAK,YAAY;AACf,YAAM,kBAAkB;AAAA,QACtB;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,UAAI,CAAC,iBAAiB;AACpB,eAAO;AAAA,MACT;AACA,YAAM,OAAwB;AAAA,QAC5B,MAAM;AAAA,QACN,UAAU;AAAA,QACV,cAAc;AAAA,MAChB;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK,cAAc;AACjB,YAAM,UAAU,0BAA0B,IAAI,kBAAkB,MAAM;AAEtE,UAAI,CAAC,YAAY;AACf,cAAM,IAAI,MAAM,oBAAoB;AAAA,MACtC;AACA,YAAM,eAAe,WAAW;AAChC,YAAM,kBACJ,6BAA6B,mBAAmB,YAAY,KAC5D,0BAA0B,IAAI,YAAY;AAG5C,YAAM,gBAAgB,SAAS;AAE/B,UAAI,WAAW,iBAAiB;AAC9B,YAAI,WAAW;AACf,YAAI,kBAAkB,WAAW,aAAa,MAAM,QAAW;AAC7D,qBAAW,kBAAkB,WAAW,aAAa;AAAA,QACvD;AACA,cAAM,OAA6B;AAAA,UACjC,MAAM;AAAA,UACN,QAAQ,kBAAkB;AAAA,UAC1B,WAAW;AAAA,UACX;AAAA,QACF;AACA,eAAO;AAAA,MACT,WAAW,CAAC,WAAW,iBAAiB;AAEtC,kCAA0B,IAAI,kBAAkB,MAAM;AAEtD,cAAM,QAAQ,WAAW,WAAW,QAAQ,iBAAiB;AAC7D,YAAI,UAAU,IAAI;AAChB,gBAAM,IAAI,MAAM,qCAAqC;AAAA,QACvD;AAEA,YAAI,iBAAiB;AACrB,YAAI,QAAQ,GAAG;AACb,2BAAiB;AAAA,YACf;AAAA,YACA,QAAQ;AAAA,YACR;AAAA,UACF;AAAA,QACF;AAEA,cAAM,kBAAkB;AAAA,UACtB;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,YAAI,CAAC,iBAAiB;AACpB,gBAAM,IAAI,MAAM,4BAA4B;AAAA,QAC9C;AACA,cAAM,OAA4B;AAAA,UAChC,MAAM;AAAA,UACN,QAAQ;AAAA,UACR;AAAA,UACA,YAAY,CAAC,eAAe;AAAA,UAC5B,cAAc,CAAC;AAAA,QACjB;AACA,eAAO;AAAA,MACT,WAAW,WAAW,CAAC,iBAAiB;AACtC,8CAAsC,mBAAmB,yBAAyB;AAClF,cAAM,OAA4B;AAAA,UAChC,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,gBAAgB;AAAA,UAChB,YAAY,CAAC;AAAA,UACb,cAAc,CAAC,kBAAkB,MAAM;AAAA,QACzC;AACA,eAAO;AAAA,MACT,WAAW,CAAC,WAAW,CAAC,iBAAiB;AACvC,eAAO;AAAA,MACT;AACA;AAAA,IACF;AAAA,IACA,KAAK,iBAAiB;AACpB,YAAM,UAAU,0BAA0B,IAAI,kBAAkB,MAAM;AACtE,UAAI,CAAC,SAAS;AACZ,eAAO;AAAA,MACT;AACA,YAAM,OAAwB;AAAA,QAC5B,MAAM;AAAA,QACN,QAAQ,kBAAkB;AAAA,QAC1B,MAAM,kBAAkB,eAAe;AAAA,MACzC;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK,aAAa;AAChB,YAAM,UAAU,0BAA0B,IAAI,kBAAkB,MAAM;AACtE,UAAI,CAAC,SAAS;AACZ,eAAO;AAAA,MACT;AACA,UAAI,kBAAkB,SAAS;AAC/B,UAAI,iBAAgC;AACpC,UAAI,iBAAiB;AACnB,YAAI,gBAAgB,kBAAkB,WAAW,QAAQ,eAAe;AACxE,eAAO,kBAAkB,IAAI;AAC3B,4BAAkB,kBAAkB,WAAW,aAAa;AAC5D,cAAI,0BAA0B,IAAI,gBAAgB,MAAM,GAAG;AACzD,6BAAiB,gBAAgB;AACjC;AAAA,UACF;AACA;AAAA,QACF;AAAA,MACF;AAEA,YAAM,OAA4B;AAAA,QAChC,MAAM;AAAA,QACN,QAAQ,kBAAkB;AAAA,QAC1B;AAAA,QACA,YAAY,CAAC;AAAA,QACb,cAAc,CAAC;AAAA,MACjB;AAEA,eAAS,WAAW,QAAQ,CAAC,2BAAoD;AAC/E,cAAM,gBAAgB;AAAA,UACpB;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,YAAI,CAAC,eAAe;AAClB;AAAA,QACF;AACA,aAAK,WAAW,KAAK,aAAa;AAAA,MACpC,CAAC;AACD,eAAS,aAAa,QAAQ,CAAC,2BAAoD;AACjF,YAAI,0BAA0B,IAAI,uBAAuB,MAAM,GAAG;AAChE,gDAAsC,wBAAwB,yBAAyB;AACvF,eAAK,aAAa,KAAK,uBAAuB,MAAM;AAAA,QACtD;AAAA,MACF,CAAC;AAED,UAAI,KAAK,WAAW,SAAS,KAAK,KAAK,aAAa,SAAS,GAAG;AAC9D,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAAA,IACA;AACE,cAAQ,MAAM,4BAA4B,SAAS,IAAI;AACvD;AAAA,EACJ;AACA,SAAO;AACT;AAEA,SAAS,kCACP,sBACA,gBACA,2BACe;AACf,MAAI,iBAAiB,GAAG;AACtB,QAAI,uBAAuB;AAC3B,WAAO,wBAAwB,GAAG;AAChC,YAAM,kBAAkB,qBAAqB,WAAW,oBAAoB;AAC5E,UAAI,0BAA0B,IAAI,gBAAgB,MAAM,GAAG;AACzD,eAAO,gBAAgB;AAAA,MACzB;AACA;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,6BACP,mBACA,cACS;AACT,QAAM,gBAAgB,kBAAkB,WAAW,iBAAiB;AACpE,QAAM,iBAAiB,kBAAkB,WAAW,kBAAkB;AACtE,QAAM,qBAAqB,aAAa,SAAS;AACjD,MAAI,kBAAkB,QAAW;AAC/B,UAAM,gBAAgB,cAAc,MAAM,GAAG;AAC7C,UAAM,mBAAmB,cAAc,SAAS,kBAAkB;AAClE,QAAI,CAAC,kBAAkB;AACrB,aAAO;AAAA,IACT;AAAA,EACF;AACA,MAAI,mBAAmB,QAAW;AAChC,UAAM,iBAAiB,eAAe,MAAM,GAAG;AAC/C,UAAM,kBAAkB,eAAe,SAAS,kBAAkB;AAClE,QAAI,iBAAiB;AACnB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,wCACd,mBACA,cACA,2BACwB;AACxB,MAAI,CAAC,6BAA6B,mBAAmB,YAAY,GAAG;AAClE,WAAO;AAAA,EACT;AAEA,MAAI,iBAAiB,kBAAkB;AACvC,MAAI,mBAAmB,aAAa;AAClC,qBAAiB;AAAA,EACnB;AACA,MAAI,mBAAmB,SAAS;AAC9B,UAAM,WAAgC;AAAA,MACpC,MAAM;AAAA,MACN,QAAQ,kBAAkB;AAAA,MAC1B,MAAM,kBAAkB,eAAe;AAAA,IACzC;AACA,8BAA0B,IAAI,SAAS,MAAM;AAC7C,WAAO;AAAA,EACT,OAAO;AACL,UAAM,OAA+B;AAAA,MACnC,MAAM;AAAA,MACN,QAAQ,kBAAkB;AAAA,MAC1B,KAAK;AAAA,MACL,YAAY,kBAAkB;AAAA,MAC9B,UAAU,CAAC;AAAA,MACX,MAAM,kBAAkB;AAAA,IAC1B;AACA,8BAA0B,IAAI,KAAK,MAAM;AAEzC,eAAW,SAAS,kBAAkB,YAAY;AAChD,YAAM,uBAAuB;AAAA,QAC3B;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,UAAI,sBAAsB;AACxB,aAAK,SAAS,KAAK,oBAAoB;AAAA,MACzC;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;AAEA,SAAS,sCACP,mBACA,2BACM;AACN,4BAA0B,OAAO,kBAAkB,MAAM;AACzD,aAAW,SAAS,kBAAkB,YAAY;AAChD,QAAI,CAAC,0BAA0B,IAAI,MAAM,MAAM,GAAG;AAChD,cAAQ,MAAM,kDAAkD,MAAM,MAAM;AAAA,IAC9E;AACA,0CAAsC,OAAO,yBAAyB;AAAA,EACxE;AACF;AAEO,SAAS,uBACd,mBACA,cACgC;AAGhC,aAAW,SAAS,kBAAkB,YAAY;AAChD,QAAI,MAAM,WAAW,cAAc;AACjC,aAAO;AAAA,IACT,OAAO;AACL,YAAM,gBAAgB,uBAAuB,OAAO,YAAY;AAChE,UAAI,eAAe;AACjB,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,yCACd,kBACA,SACuC;AACvC,QAAM,UAAkB,QAAQ,SAAS,QAAQ,IAAI;AACrD,QAAM,oBAAoB,QAAQ,OAAO,MAAM,GAAG,QAAQ,OAAO,SAAS,CAAC;AAC3E,QAAM,YAAY,QAAQ,OAAO,QAAQ,OAAO,SAAS,CAAC;AAC1D,QAAM,kBAAkB,QAAQ,OAAO,QAAQ,OAAO,SAAS,CAAC;AAEhE,MAAI,cAAc,eAAe;AAC/B,UAAM,cAAc,IAAY,QAAQ,QAAQ,OAAO,MAAM,GAAG,QAAQ,OAAO,SAAS,CAAC,CAAC;AAC1F,UAAM,OAAO,YAAY,IAAI,gBAAgB;AAC7C,WAAO;AAAA,MACL;AAAA,QACE,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,YAAY,CAAC;AAAA,QACb,cAAc,CAAC;AAAA,QACf,eAAe;AAAA,QACf,iBAAiB;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AAEA,MAAI,oBAAoB,cAAc;AAEpC,UAAM,cAAc,IAAY,QAAQ,iBAAiB;AACzD,UAAM,OAAO,YAAY,IAAI,gBAAgB;AAC7C,WAAO;AAAA,MACL;AAAA,QACE,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,YAAY,CAAC;AAAA,QACb,cAAc,CAAC;AAAA,QACf,eAAe;AAAA,QACf,iBAAiB;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AAIA,MAAI,oBAAoB,cAAc;AACpC,UAAM,cAAc,IAAY,QAAQ,iBAAiB;AACzD,UAAM,OAAO,YAAY,IAAI,gBAAgB;AAE7C,QAAI,kBAAkD;AACtD,QAAI,cAAc,KAAK;AAAA,IAEvB,OAAO;AACL,YAAM,QAAQ,SAAS,WAAW,EAAE;AACpC,UAAI,UAAU,GAAG;AACf,0BAAkB;AAAA,MACpB,OAAO;AACL,0BAAkB,KAAK,WAAW,QAAQ,CAAC;AAAA,MAC7C;AAAA,IACF;AACA,UAAM,aAA6C,CAAC;AACpD,UAAM,eAA+C,CAAC;AACtD,YAAQ,QAAQ,IAAI;AAAA,MAClB,KAAK,OAAO;AACV,mBAAW,KAAK,QAAQ,KAAK;AAC7B,eAAO;AAAA,UACL;AAAA,YACE,MAAM;AAAA,YACN,QAAQ;AAAA,YACR;AAAA,YACA;AAAA,YACA;AAAA,YACA,eAAe;AAAA,UACjB;AAAA,QACF;AAAA,MACF;AAAA,MACA,KAAK,UAAU;AACb,cAAM,cAAc,QAAQ,IAAI,gBAAgB;AAChD,qBAAa,KAAK,WAAW;AAC7B,eAAO;AAAA,UACL;AAAA,YACE,MAAM;AAAA,YACN,QAAQ;AAAA,YACR;AAAA,YACA;AAAA,YACA;AAAA,YACA,eAAe;AAAA,UACjB;AAAA,QACF;AAAA,MACF;AAAA,MACA,KAAK,WAAW;AAEd,cAAM,cAAc,QAAQ,IAAI,gBAAgB;AAChD,qBAAa,KAAK,WAAW;AAC7B,mBAAW,KAAK,QAAQ,KAAK;AAC7B,eAAO;AAAA,UACL;AAAA,YACE,MAAM;AAAA,YACN,QAAQ;AAAA,YACR,YAAY,CAAC;AAAA,YACb;AAAA,YACA;AAAA,YACA,eAAe;AAAA,UACjB;AAAA,UACA;AAAA,YACE,MAAM;AAAA,YACN,QAAQ;AAAA,YACR;AAAA,YACA,cAAc,CAAC;AAAA,YACf;AAAA,YACA,eAAe;AAAA,UACjB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,QAAQ,OAAO,aAAa,QAAQ,SAAS,IAAI;AACnD,UAAM,OAAO,QAAQ;AACrB,WAAO;AAAA,MACL;AAAA,QACE,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,YAAY,CAAC;AAAA,QACb,cAAc,CAAC;AAAA,QACf,iBAAiB;AAAA,QACjB,eAAe;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AAEA,UAAQ,MAAM,wBAAwB,KAAK,UAAU,SAAS,MAAM,CAAC,CAAC;AACtE,QAAM,IAAI,MAAM,qBAAqB;AACvC;AAEO,SAAS,8BACd,eACA,aACsB;AACtB,QAAM,iBAAyB;AAAA,IAC7B;AAAA,IACA;AAAA,IACA,CAAC,GAAG,GAAG,QAAyB;AAC9B,UAAI,EAAE,QAAQ,EAAE,KAAK;AACnB,eAAO,CAAC,EAAE,IAAI,WAAW,MAAM,IAAI,SAAS,GAAG,OAAO,EAAE,CAAC;AAAA,MAC3D;AACA;AAAA,IACF;AAAA,EACF;AAEA,QAAM,mBAAuC,CAAC;AAC9C,QAAM,kBAA4C,CAAC;AACnD,aAAW,QAAQ,gBAAgB;AACjC,QAAI,KAAK,OAAO,aAAa,KAAK,KAAK,SAAS,SAAS,GAAG;AAC1D,YAAM,UAAkB,QAAQ,SAAS,KAAK,IAAI;AAClD,YAAM,gBAAgB,QAAQ,IAAI,aAAa;AAC/C,uBAAiB,KAAK;AAAA,QACpB,gBAAgB,KAAK;AAAA,QACrB,oBAAoB;AAAA,MACtB,CAAC;AAAA,IACH,OAAO;AACL,sBAAgB,KAAK,IAAI;AAAA,IAC3B;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,MAA+B;AACvD,MAAI,UAAU,KAAK;AACnB,aAAW,SAAS,KAAK,YAAY;AACnC,cAAU,KAAK,IAAI,SAAS,iBAAiB,KAAK,CAAC;AAAA,EACrD;AACA,SAAO;AACT;AAEA,SAAS,kBAAkB,QAAiC,MAAyB;AACnF,QAAM,aAAa,oBAAI,IAAY;AACnC,WAAS,QAAQ,MAA+B;AAC9C,eAAW,IAAI,KAAK,MAAM;AAC1B,eAAW,SAAS,KAAK,YAAY;AACnC,cAAQ,KAAK;AAAA,IACf;AAAA,EACF;AACA,MAAI,KAAK,OAAO,aAAa,KAAK,OAAO,UAAU;AACjD,UAAM,cAAsB,QAAQ,SAAS,KAAK,IAAI,EAAE,IAAI,MAAM;AAClE,YAAQ,WAAW;AAAA,EACrB;AACA,SAAO;AACT;AAEA,SAAS,8BAA8B,MAA+B;AACpE,QAAM,UAAU,oBAAI,IAAY;AAChC,WAAS,QAAQA,OAA+B;AAC9C,YAAQ,IAAIA,MAAK,MAAM;AACvB,eAAW,SAASA,MAAK,YAAY;AACnC,cAAQ,KAAK;AAAA,IACf;AAAA,EACF;AACA,UAAQ,IAAI;AACZ,SAAO;AACT;AAGA,SAAS,mCACP,sBACA,aACsB;AACtB,QAAM,EAAE,eAAe,kBAAkB,gBAAgB,IAAI;AAE7D,QAAM,iCAAiC,KAAK;AAAA,IAC1C,iBAAiB,aAAa;AAAA,IAC9B,iBAAiB,WAAW;AAAA,EAC9B;AACA,MAAI,aAAa,iCAAiC;AAElD,QAAM,SAAS,KAAK,MAAM,KAAK,UAAU,aAAa,CAAC;AAEvD,WAAS,qCACP,MACA,eACA,YACA;AACA,QAAI,gBAAgB,IAAI,KAAK,MAAM,KAAK,cAAc,CAAC,WAAW,IAAI,KAAK,MAAM,GAAG;AAElF,YAAM,YAAY;AAClB,uBAAiB,KAAK;AAAA,QACpB,gBAAgB,KAAK;AAAA,QACrB,oBAAoB;AAAA,MACtB,CAAC;AACD,WAAK,SAAS;AACd,oBAAc,IAAI,SAAS;AAAA,IAC7B,OAAO;AACL,oBAAc,IAAI,KAAK,MAAM;AAAA,IAC/B;AACA,eAAW,SAAS,KAAK,YAAY;AACnC,2CAAqC,OAAO,eAAe,UAAU;AAAA,IACvE;AAAA,EACF;AAEA,QAAM,kBAAkB,8BAA8B,MAAM;AAE5D,aAAW,QAAQ,iBAAiB;AAClC,UAAM,UAAkB,QAAQ,SAAS,KAAK,IAAI;AAClD,UAAM,kBAAkB,QAAQ,OAAO,QAAQ,OAAO,SAAS,CAAC;AAChE,QAAI,oBAAoB,cAAc;AACpC;AAAA,IACF;AACA,UAAM,aAAa,kBAAkB,QAAQ,IAAI;AACjD,UAAM,gBAAgB,oBAAI,IAAY;AACtC,QAAI,KAAK,OAAO,aAAa,KAAK,OAAO,OAAO;AAE9C,2CAAqC,KAAK,OAAO,eAAe,UAAU;AAAA,IAC5E;AACA,eAAW,QAAQ,CAAC,cAAc;AAChC,sBAAgB,OAAO,SAAS;AAAA,IAClC,CAAC;AACD,kBAAc,QAAQ,CAAC,iBAAiB;AACtC,sBAAgB,IAAI,YAAY;AAAA,IAClC,CAAC;AAED,UAAM,cAAsB,WAAW,QAAQ,CAAC,IAAI,CAAC;AACrD,QAAI,YAAY,WAAW,KAAK,YAAY,CAAC,MAAM,MAAM;AACvD,YAAM,IAAI,MAAM,cAAc;AAAA,IAChC;AAAA,EACF;AAEA,SAAO;AACT;;;AC7iBO,IAAM,uCAAuC;AAC7C,IAAM,8BAA8B;AAcpC,IAAM,gBAAN,MAAM,cAAa;AAAA,EAsCxB,YACE,sBACA,UACA,cACA,yBACA,QACA,SAAS,CAAC,GACV,kBAAkB,MAClB,aACA;AAxCF;AAAA,SAAQ,+BAA+B,oBAAI,IAAoB;AAG/D;AAAA,SAAQ,+BAA+B,oBAAI,IAAoB;AAE/D,SAAQ,sBAAsB;AAC9B,SAAQ,iCAAiC,oBAAI,IAG3C;AACF,SAAQ,0BAA0B,oBAAI,IAAuB;AAC7D,SAAQ,+BAA+B,oBAAI,IAAyB;AACpE,SAAQ,cAAc;AAGtB,SAAQ,WAAW;AAInB,SAAQ,eAAe,oBAAI,IAAqC;AAChE,SAAQ,uBAAuB,oBAAI,IAAoB;AAIvD,SAAQ,6BAA6B,KAAK,IAAI;AAC9C,SAAQ,qBAAqB;AAC7B,SAAQ,cAAc;AACtB,SAAQ,gBAAgB;AActB,SAAK,WAAW;AAChB,SAAK,kBAAkB;AAEvB,SAAK,cAAc,eAAe,KAAK;AAEvC,SAAK,gBAAgB;AAAA,MACnB;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,0BAA0B;AAAA,MAC5B;AAAA,MACA,CAAC,SAA+B,kBAA0C;AACxE,aAAK,gBAAgB;AACrB,YAAI,QAAQ,cAAc;AACxB,eAAK,6BAA6B,KAAK,IAAI,IAAI,QAAQ;AACvD,eAAK,qBAAqB,QAAQ;AAAA,QACpC;AACA,YAAI,QAAQ,UAAU;AACpB,eAAK,eAAe,QAAQ;AAC5B,gBAAM,iBAAiB,KAAK,MAAM,KAAK,UAAU,QAAQ,QAAQ,CAAC;AAElE,cAAI,CAAC,KAAK,aAAa;AACrB,kBAAM,IAAI,MAAM,sCAAsC;AAAA,UACxD;AACA,eAAK,cAAc;AAEnB,cAAI,UAAuC;AAC3C,cAAI,yBAAyB;AAC3B,sBAAU,8BAA8B,yBAAyB,cAAc;AAC/E,uBAAW,aAAa,QAAQ,kBAAkB;AAChD,mBAAK,kBAAkB,UAAU,oBAAoB,UAAU,cAAc;AAAA,YAC/E;AAAA,UACF;AAEA,eAAK,4BAA4B,KAAK,cAAc,EAAE;AAEtD,iBAAO,SAAS,IAAI;AAAA,QACtB,WAAW,QAAQ,UAAU;AAC3B,cAAI,KAAK,aAAa;AACpB,kBAAM,IAAI,MAAM,uCAAuC;AAAA,UACzD;AACA,gBAAM,WAAW,KAAK,wBAAwB,QAAQ,QAAQ;AAC9D,eAAK,oBAAoB,QAAQ;AACjC,eAAK,2BAA2B,QAAQ;AAAA,QAC1C,WAAW,QAAQ,YAAY;AAC7B,cAAI,KAAK,aAAa;AACpB,iBAAK,YAAY,QAAQ,UAAU;AAAA,UACrC;AAAA,QACF,OAAO;AACL,cAAI,QAAQ,cAAc;AAExB,iBAAK,UAAU;AACf;AAAA,UACF;AACA,kBAAQ,MAAM,2CAA2C,OAAO;AAAA,QAClE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,mBAAmB,SAAqB;AAC9C,UAAM,WAAW,CAAC,UAAkB;AAClC,cAAQ,OAAO;AAAA,QACb,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB;AACE,iBAAO,QAAQ;AAAA,MACnB;AAAA,IACF;AAEA,UAAM,QAAQ,SAAS,QAAQ,KAAK;AACpC,UAAM,GAAG,QAAQ,MAAM,YAAY,CAAC,KAAK,KAAK,QAAQ,MAAM,GAAG,QAAQ,OAAO;AAAA,EAChF;AAAA,EAEQ,kBAAkB,oBAA4B,gBAAwB;AAC5E,SAAK,6BAA6B,IAAI,gBAAgB,kBAAkB;AACxE,SAAK,6BAA6B,IAAI,oBAAoB,cAAc;AACxE,SAAK,gBAAgB,KAAK,IAAI,KAAK,eAAe,KAAK,IAAI,oBAAoB,cAAc,CAAC;AAAA,EAChG;AAAA,EAEQ,YAAY;AAClB,UAAM,OAAO,KAAK;AAClB,QAAI,KAAK,cAAc,KAAM;AAC3B,WAAK,cAAc;AAAA,IACrB;AACA,UAAM,cAAoC;AAAA,MACxC;AAAA,QACE,MAAM;AAAA,QACN;AAAA,QACA,cAAc,KAAK,gBAAgB;AAAA,MACrC;AAAA,IACF;AACA,UAAM,cAAc,KAAK,UAAU,WAAW;AAC9C,SAAK,+BAA+B,QAAQ,CAAC,qBAAqB;AAChE,uBAAiB,UAAU,KAAK,WAAW;AAAA,IAC7C,CAAC;AAAA,EACH;AAAA,EAEQ,mBACN,cACA,2BACiB;AACjB,UAAM,4BAA4B,KAAK,6BAA6B,IAAI,YAAY;AACpF,QAAI,CAAC,2BAA2B;AAC9B,YAAM,MAAM,IAAI;AAAA,QACd,+EAA+E,YAAY;AAAA,MAC7F;AACA,cAAQ,MAAM,GAAG;AACjB,YAAM;AAAA,IACR;AACA,UAAM,cAAsC;AAAA,MAC1C;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,QAAI,CAAC,aAAa;AAChB,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,WAAO;AAAA,MACL,MAAM;AAAA,MACN,UAAU;AAAA,MACV,cAAc,KAAK,IAAI,IAAI,KAAK;AAAA,IAClC;AAAA,EACF;AAAA,EAEO,kBAA0B;AAC/B,WAAO,KAAK;AAAA,EACd;AAAA,EAEO,sBACL,YACA,sBACA,SACA;AACA,UAAM,gBAAgB,CAAC;AACvB,eAAW,aAAa,YAAY;AAClC,UAAI,aAAa;AACjB,UAAI,yBAAyB,MAAM;AACjC,qBAAa,qBAAqB,IAAI,SAAS;AAAA,MACjD;AACA,YAAM,EAAE,aAAa,IAAI,KAAK,kBAAkB,WAAW,UAAU;AACrE,oBAAc,KAAK,YAAY;AAAA,IACjC;AAEA,QAAI,SAAS;AACX,YAAM,sBAAsB,IAAI;AAAA,QAC9B,cAAc,IAAI,CAAC,iBAAiB,CAAC,cAAc,CAAC,CAAC,CAAC;AAAA,MACxD;AAIA,iBAAW,gBAAgB,eAAe;AAExC,aAAK,mBAAmB,cAAc,QAAQ,aAAa;AAAA,MAC7D;AAEA,iBAAW,kBAAkB,QAAQ,iBAAiB;AAIpD,cAAM,sBAAsB;AAAA,UAC1B,QAAQ;AAAA,UACR;AAAA,QACF;AAEA,YAAI,eAAe,SAAS,MAAM,eAAe,OAAO,WAAW;AAAA,QAEnE,OAAO;AACL,gBAAM,eAAe,WAAW,QAAQ,eAAe,CAAC,cAAc,CAAC;AACvE,qBAAW,eAAe,cAAc;AACtC,gBAAI,gBAAgB,MAAM;AACxB,sBAAQ,MAAM,oDAAoD,WAAW;AAC7E,oBAAM;AAAA,YACR;AAAA,UACF;AAAA,QACF;AAEA,mBAAW,sBAAsB,qBAAqB;AACpD,gBAAM,eAAe,mBAAmB,OAAO;AAC/C,gBAAM,uBAAuB,uBAAuB,QAAQ,eAAe,YAAY;AACvF,8BAAoB,QAAQ,CAAC,OAAO,iBAAiB;AACnD,kBAAM,eAAe;AAAA,cACnB;AAAA,cACA;AAAA,cACA;AAAA;AAAA,cAEA,KAAK,6BAA6B,IAAI,YAAY;AAAA,YACpD;AACA,gBAAI,cAAc;AAChB,oBAAM,KAAK,YAAY;AAAA,YACzB;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF;AAEA,0BAAoB,QAAQ,CAAC,OAAO,iBAAiB;AACnD,YAAI,MAAM,WAAW,GAAG;AAEtB,gBAAM,KAAK;AAAA,YACT,MAAM;AAAA,YACN,QAAQ,KAAK,aAAa;AAAA,YAC1B,gBAAgB;AAAA,YAChB,YAAY,CAAC;AAAA,YACb,cAAc,CAAC;AAAA,UACjB,CAAC;AAAA,QACH;AACA,cAAM,mBAAyC;AAC/C,cAAM,YAAY,MAAM,CAAC;AACzB,kBAAU,eAAe,KAAK,gBAAgB;AAC9C,cAAM,kBAAkB,KAAK,UAAU,gBAAgB;AACvD,cAAM,mBAAmB,KAAK,+BAA+B,IAAI,YAAY;AAC7E,YAAI,CAAC,kBAAkB;AACrB,gBAAM,IAAI,MAAM,qDAAqD;AAAA,QACvE;AACA,yBAAiB,UAAU,KAAK,eAAe;AAAA,MACjD,CAAC;AAAA,IACH,OAAO;AACL,YAAM,4BAA4B,KAAK;AACvC,UAAI,CAAC,2BAA2B;AAC9B,cAAM,IAAI,MAAM,2DAA2D;AAAA,MAC7E;AACA,iBAAW,gBAAgB,eAAe;AACxC,cAAM,mBAAmB,KAAK,+BAA+B,IAAI,YAAY;AAC7E,YAAI,CAAC,kBAAkB;AACrB,gBAAM,IAAI,MAAM,qDAAqD;AAAA,QACvE;AACA,cAAM,mBAAyC;AAAA,UAC7C,KAAK,mBAAmB,cAAc,yBAAyB;AAAA,QACjE;AACA,cAAM,4BAA4B,KAAK,UAAU,gBAAgB;AACjE,yBAAiB,UAAU,KAAK,yBAAyB;AAAA,MAC3D;AAAA,IACF;AAEA,eAAW,gBAAgB,eAAe;AACxC,WAAK,cAAc,mBAAmB,YAAY;AAAA,IACpD;AAAA,EACF;AAAA,EAEQ,uBAAuB,cAAsD;AACnF,UAAM,eAAe,KAAK,qBAAqB,IAAI,YAAY;AAC/D,QAAI,iBAAiB,QAAW;AAC9B,YAAM,IAAI,MAAM,0BAA0B;AAAA,IAC5C;AACA,WAAO,KAAK,kDAAkD,YAAY;AAAA,EAC5E;AAAA,EAEQ,kBACN,WACA,uBAAsC,MACZ;AAC1B,QAAI;AACJ,QAAI,yBAAyB,MAAM;AACjC,qBAAe;AACf,WAAK,sBAAsB,KAAK,IAAI,KAAK,qBAAqB,eAAe,CAAC;AAAA,IAChF,OAAO;AACL,qBAAe,KAAK;AAAA,IACtB;AACA,UAAM,mBAAmB;AAAA,MACvB;AAAA,MACA,iBAAiB,CAAC,iBAA+B;AAC/C,cAAM,SAAS,OAAO,aAAa,IAAI;AACvC,YAAI;AACJ,YAAI;AACF,mBAAS,KAAK,MAAM,MAAM;AAAA,QAC5B,SAAS,GAAG;AACV,kBAAQ,MAAM,yCAAyC,MAAM,EAAE;AAC/D,kBAAQ,MAAM;AACd;AAAA,QACF;AAEA,YAAI,cAAa,cAAc,MAAM,GAAG;AAEtC;AAAA,QACF;AAEA,aAAK,oBAAoB,WAAW,MAAM;AAAA,MAC5C;AAAA,IACF;AACA,SAAK,+BAA+B,IAAI,cAAc,gBAAgB;AACtE,SAAK,6BAA6B,IAAI,cAAc,oBAAI,IAAI,CAAC;AAC7D,SAAK,wBAAwB,IAAI,WAAW,YAAY;AACxD,cAAU,iBAAiB,WAAW,iBAAiB,eAAe;AACtE,WAAO,EAAE,aAAa;AAAA,EACxB;AAAA,EAEA,OAAc,2BAA2B,WAAwD;AAC/F,UAAM,eAAe,IAAI,IAAI,SAAS;AAEtC,eAAW,YAAY,cAAa,+CAA+C;AACjF,UAAI,aAAa,IAAI,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEO,aAAa,WAA4B;AAC9C,QAAI,KAAK,aAAa;AACpB,YAAM,IAAI,MAAM,oEAAoE;AAAA,IACtF;AACA,QAAI,KAAK,UAAU;AACjB,cAAQ,MAAM,8CAA8C;AAC5D,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AAEA,QAAI,UAAU,UAAU;AACtB,UACE,cAAa,8CAA8C,QAAQ,UAAU,QAAQ,MACrF,IACA;AACA,cAAM,qBAAqB,sCAAsC,UAAU,QAAQ;AACnF,cAAM,eAAqC;AAAA,UACzC;AAAA,YACE,MAAM;AAAA,YACN,SAAS;AAAA,UACX;AAAA,QACF;AACA,kBAAU,KAAK,KAAK,UAAU,YAAY,CAAC;AAC3C,kBAAU,MAAM;AAChB;AAAA,MACF;AAAA,IACF,OAAO;AAGL,YAAM,uBAAuB,8IAA8I,2BAA2B;AACtM,YAAM,iBAAuC;AAAA,QAC3C;AAAA,UACE,MAAM;AAAA,UACN,SAAS;AAAA,QACX;AAAA,MACF;AACA,gBAAU,KAAK,KAAK,UAAU,cAAc,CAAC;AAAA,IAC/C;AAEA,UAAM,EAAE,aAAa,IAAI,KAAK,kBAAkB,SAAS;AACzD,UAAM,4BAA4B,KAAK;AACvC,QAAI,CAAC,2BAA2B;AAC9B,YAAM,IAAI,MAAM,2DAA2D;AAAA,IAC7E;AACA,UAAM,mBAAyC;AAAA,MAC7C,KAAK,mBAAmB,cAAc,yBAAyB;AAAA,IACjE;AACA,UAAM,4BAA4B,KAAK,UAAU,gBAAgB;AACjE,cAAU,KAAK,yBAAyB;AACxC,SAAK,cAAc,mBAAmB,YAAY;AAAA,EACpD;AAAA,EAEO,gBAAgB,WAA4B;AACjD,UAAM,eAAe,KAAK,wBAAwB,IAAI,SAAS;AAC/D,QAAI,CAAC,cAAc;AACjB;AAAA,IACF;AACA,SAAK,cAAc,sBAAsB,YAAY;AACrD,UAAM,mBAAmB,KAAK,+BAA+B,IAAI,YAAY;AAC7E,QAAI,CAAC,kBAAkB;AACrB,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,cAAU,oBAAoB,WAAW,iBAAiB,eAAe;AACzE,SAAK,+BAA+B,OAAO,YAAY;AACvD,SAAK,6BAA6B,OAAO,YAAY;AACrD,SAAK,wBAAwB,OAAO,SAAS;AAAA,EAC/C;AAAA,EAEO,UAAgB;AACrB,SAAK,WAAW;AAGhB,SAAK,cAAc,QAAQ;AAE3B,eAAW,CAAC,WAAW,YAAY,KAAK,KAAK,yBAAyB;AACpE,YAAM,mBAAmB,KAAK,+BAA+B,IAAI,YAAY;AAC7E,UAAI,CAAC,kBAAkB;AACrB,cAAM,IAAI,MAAM,+BAA+B;AAAA,MACjD;AACA,gBAAU,oBAAoB,WAAW,iBAAiB,eAAe;AACzE,WAAK,+BAA+B,OAAO,YAAY;AACvD,WAAK,6BAA6B,OAAO,YAAY;AACrD,WAAK,wBAAwB,OAAO,SAAS;AAAA,IAC/C;AAAA,EACF;AAAA,EAEQ,oBAAoB,gBAAsD;AAChF,UAAM,4BAA4B,KAAK;AACvC,QAAI,CAAC,2BAA2B;AAC9B,YAAM,IAAI,MAAM,6CAA6C;AAAA,IAC/D;AAEA,eAAW,CAAC,EAAE,yBAAyB,KAAK,KAAK,8BAA8B;AAC7E,gCAA0B,IAAI,0BAA0B,MAAM;AAAA,IAChE;AAEA,UAAM,sBAAsB,IAAI;AAAA,MAC9B,MAAM,KAAK,KAAK,+BAA+B,KAAK,CAAC,EAAE,IAAI,CAAC,iBAAiB;AAAA,QAC3E;AAAA,QACA,CAAC;AAAA,MACH,CAAC;AAAA,IACH;AAEA,wBAAoB,QAAQ,CAAC,OAAO,iBAAiB;AACnD,YAAM,aAAa,KAAK,uBAAuB,eAAe,OAAO,MAAM;AAC3E,UAAI,eAAe,SAAS,gBAAgB,CAAC,YAAY;AACvD,gBAAQ,MAAM,qDAAqD,cAAc;AACjF,gBAAQ,MAAM,qBAAqB,KAAK,UAAU,KAAK,cAAc,MAAM,CAAC,CAAC;AAAA,MAC/E;AACA,YAAM,OAAO;AAAA,QACX;AAAA,QACA;AAAA,QACA;AAAA;AAAA,QAEA,KAAK,6BAA6B,IAAI,YAAY;AAAA,MACpD;AACA,UAAI,MAAM;AACR,cAAM,KAAK,IAAI;AAAA,MACjB;AAAA,IACF,CAAC;AAED,wBAAoB,QAAQ,CAAC,OAAO,iBAAiB;AACnD,UAAI,MAAM,SAAS,GAAG;AACpB,cAAM,mBAAyC;AAC/C,cAAM,kBAAkB,KAAK,UAAU,gBAAgB;AACvD,cAAM,mBAAmB,KAAK,+BAA+B,IAAI,YAAY;AAC7E,YAAI,CAAC,kBAAkB;AACrB,gBAAM,IAAI,MAAM,uDAAuD;AAAA,QACzE;AACA,yBAAiB,UAAU,KAAK,eAAe;AAAA,MACjD;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEQ,2BAA2B,UAAgD;AACjF,UAAM,oBAAoB,SAAS;AACnC,QAAI,SAAS,SAAS,aAAa;AACjC,eAAS,aAAa,QAAQ,CAAC,oBAA6C;AAC1E,aAAK,wBAAwB,eAAe;AAC5C,cAAM,QAAQ,kBAAkB,WAAW,QAAQ,eAAe;AAClE,0BAAkB,WAAW,OAAO,OAAO,CAAC;AAAA,MAC9C,CAAC;AACD;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,wBAAwB,mBAAkD;AAChF,SAAK,aAAa,OAAO,kBAAkB,MAAM;AACjD,SAAK,qBAAqB,OAAO,kBAAkB,MAAM;AACzD,eAAW,SAAS,kBAAkB,YAAY;AAChD,WAAK,wBAAwB,KAAK;AAAA,IACpC;AAAA,EACF;AAAA,EAEA,OAAO,cAAc,SAAgD;AACnE,WAAQ,QAAwB,SAAS;AAAA,EAC3C;AAAA,EAEQ,oBAAoB,WAAsB,aAAgC;AAChF,QAAI,KAAK,UAAU;AACjB,cAAQ,MAAM,4CAA4C;AAC1D,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AAEA,UAAM,eAAe,KAAK,wBAAwB,IAAI,SAAS;AAC/D,QAAI,CAAC,cAAc;AACjB,cAAQ,MAAM,wCAAwC,SAAS;AAC/D;AAAA,IACF;AAEA,UAAM,eAAe,KAAK,6BAA6B,IAAI,YAAY;AACvE,QAAI,CAAC,cAAc;AACjB,cAAQ,MAAM,sCAAsC,YAAY;AAChE;AAAA,IACF;AAEA,QAAI,CAAC,aAAa,IAAI,YAAY,MAAM,GAAG;AAEzC,cAAQ,MAAM,sCAAsC,YAAY,MAAM;AACtE;AAAA,IACF;AAEA,UAAM,eAAe,KAAK,6BAA6B,IAAI,YAAY,MAAM;AAC7E,QAAI,cAAc;AAChB,kBAAY,SAAS;AAAA,IACvB;AAEA,SAAK,cAAc,oCAAoC,cAAc,WAAW;AAAA,EAClF;AAAA,EAEQ,kDACN,gBACyB;AACzB,UAAM,aAAa,KAAK,6BAA6B,IAAI,cAAc;AACvE,QAAI,eAAe,QAAW;AAC5B,YAAMC,QAAO,KAAK,aAAa,IAAI,UAAU;AAC7C,UAAI,CAACA,OAAM;AACT,cAAM,IAAI,MAAM,yCAAyC,UAAU;AAAA,MACrE;AACA,aAAOA;AAAA,IACT;AACA,UAAM,OAAO,KAAK,aAAa,IAAI,cAAc;AACjD,QAAI,CAAC,MAAM;AACT,YAAM,IAAI,MAAM,gCAAgC,cAAc;AAAA,IAChE;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,wBACN,UACgC;AAChC,UAAM,SAAS,KAAK,kDAAkD,SAAS,QAAQ;AAGvF,QAAI,SAAS,WAAW;AACtB,UAAI,SAAS,UAAU,UAAU,MAAM;AACrC,eAAO,WAAW,SAAS,UAAU,aAAa,IAAI,SAAS,UAAU;AAAA,MAC3E,OAAO;AACL,eAAO,OAAO,WAAW,SAAS,UAAU,aAAa;AAAA,MAC3D;AAAA,IACF;AAEA,UAAM,kBAAkB,SAAS,oBAC7B,KAAK,kDAAkD,SAAS,iBAAiB,IACjF;AAEJ,QAAI,SAAS,SAAS,aAAa;AACjC,UAAI,QAAQ;AACZ,UAAI,iBAAiB;AACnB,gBAAQ,OAAO,WAAW,QAAQ,eAAe;AACjD,YAAI,UAAU,IAAI;AAChB,gBAAM,IAAI,MAAM,iEAAiE;AAAA,QACnF;AACA,iBAAS;AAAA,MACX;AACA,eAAS,WAAW,QAAQ,CAAC,2BAAoD;AAC/E,aAAK,4BAA4B,wBAAwB,OAAO,MAAM;AAEtE,YAAI,OAAO,WAAW,QAAQ,sBAAsB,MAAM,IAAI;AAC5D,iBAAO,WAAW,OAAO,OAAO,GAAG,sBAAsB;AACzD;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH,WAAW,SAAS,SAAS,cAAc;AAEzC,YAAM,gBAAgB,SAAS;AAC/B,UAAI,cAAc,UAAU,MAAM;AAChC,eAAO,OAAO,WAAW,cAAc,aAAa;AAAA,MACtD,OAAO;AACL,eAAO,WAAW,cAAc,aAAa,IAAI,cAAc;AAAA,MACjE;AAAA,IACF,WAAW,SAAS,SAAS,iBAAiB;AAE5C,YAAM,IAAI,MAAM,6BAA6B;AAAA,IAE/C;AAEA,UAAM,SAAyC;AAAA,MAC7C,MAAM,SAAS;AAAA,MACf;AAAA,MACA,YAAY,SAAS;AAAA,MACrB,cAAc,SAAS,eAAe,IAAI,CAAC,WAAW;AACpD,eAAO,KAAK,kDAAkD,MAAM;AAAA,MACtE,CAAC;AAAA,MACD,iBAAiB,SAAS,oBACtB,KAAK,kDAAkD,SAAS,iBAAiB,IACjF;AAAA,MACJ,eAAe,SAAS,YAAY,SAAS,UAAU,gBAAgB;AAAA,IACzE;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,cAAuC;AACrC,WAAO,KAAK;AAAA,EACd;AAAA,EAEQ,4BAA4B,MAA+B,cAAsB;AACvF,UAAM,iBAAiB,KAAK,6BAA6B,IAAI,KAAK,MAAM;AACxE,QAAI,mBAAmB,QAAW;AAChC,WAAK,SAAS;AAAA,IAChB,OAAO;AAEL,YAAM,0BAA0B,KAAK,6BAA6B,IAAI,KAAK,MAAM;AACjF,UAAI,yBAAyB;AAC3B,cAAM,YAAY,EAAE,KAAK;AACzB,aAAK,kBAAkB,WAAW,KAAK,MAAM;AAC7C,aAAK,SAAS;AAAA,MAChB;AAAA,IACF;AAEA,QAAI,KAAK,aAAa,IAAI,KAAK,MAAM,GAAG;AACtC,YAAM,IAAI,MAAM,iCAAiC,KAAK,MAAM;AAAA,IAC9D;AAEA,SAAK,aAAa,IAAI,KAAK,QAAQ,IAAI;AACvC,SAAK,qBAAqB,IAAI,KAAK,QAAQ,YAAY;AACvD,SAAK,gBAAgB,KAAK,IAAI,KAAK,eAAe,KAAK,MAAM;AAE7D,eAAW,aAAa,KAAK,YAAY;AACvC,WAAK,4BAA4B,WAAW,KAAK,MAAM;AAAA,IACzD;AAAA,EACF;AAAA,EAEO,8BAA8B;AAEnC,WAAO,IAAI,IAAI,KAAK,uBAAuB;AAAA,EAC7C;AACF;AAAA;AAtpBa,cAEG,gDAAgD;AAAA,EAC5D;AACF;AAJK,IAAM,eAAN;;;AC3BA,IAAM,uBAAN,MAA2B;AAAA,EAYhC,YACE,UACA,sBACA,kBAAkB,MAClB,aACA;AAfF,SAAQ,SAAiB,CAAC;AAE1B,SAAQ,aAAa,oBAAI,IAAe;AACxC,SAAQ,cAAkC;AAaxC,SAAK,WAAW;AAChB,SAAK,uBAAuB;AAC5B,SAAK,kBAAkB;AACvB,SAAK,cAAc;AAAA,EACrB;AAAA,EAEO,WAAW;AAChB,WAAO,KAAK,gBAAgB;AAAA,EAC9B;AAAA,EAEO,KAAK,cAAsB,QAAiB;AACjD,QAAI,WAAW,QAAW;AACxB,WAAK,SAAS;AAAA,IAChB;AAEA,QAAI,kBAAkD;AACtD,QAAI,uBAAsD;AAC1D,QAAI,KAAK,aAAa;AACpB,YAAM,cAAc,KAAK,YAAY;AACrC,6BAAuB,YAAY,4BAA4B;AAC/D,kBAAY,QAAQ;AACpB,wBAAkB,YAAY,YAAY;AAAA,IAC5C;AACA,SAAK,cAAc;AAEnB,QAAI,UAAU;AACd,UAAM,eAAe,IAAI;AAAA,MACvB,KAAK;AAAA,MACL,KAAK;AAAA,MACL;AAAA,MACA;AAAA,MACA,CAAC,SAAsCC,kBAA+B;AACpE,kBAAU;AACV,YAAI,KAAK,aAAa;AACpB,eAAK,YAAY,SAAS;AAAA,QAC5B;AACA,QAAAA,cAAa;AAAA,UACX,MAAM,KAAK,KAAK,UAAU;AAAA,UAC1B;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,MACA,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AACA,SAAK,cAAc;AAAA,MACjB;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,IACV;AAAA,EACF;AAAA,EAEO,SAAS;AACd,QAAI,KAAK,aAAa;AACpB,WAAK,KAAK,KAAK,YAAY,cAAc,KAAK,MAAM;AAAA,IACtD,OAAO;AACL,cAAQ,KAAK,sDAAsD;AAAA,IACrE;AAAA,EACF;AAAA,EAEO,UAAU;AACf,eAAW,MAAM,KAAK,YAAY;AAChC,SAAG,MAAM;AAAA,IACX;AACA,SAAK,WAAW,MAAM;AACtB,QAAI,KAAK,aAAa;AACpB,WAAK,YAAY,aAAa,QAAQ;AAAA,IACxC;AACA,SAAK,cAAc;AAAA,EACrB;AAAA,EAEO,aAAa,WAAsB;AACxC,SAAK,WAAW,IAAI,SAAS;AAC7B,QAAI,KAAK,eAAe,KAAK,YAAY,QAAQ;AAC/C,WAAK,YAAY,aAAa,aAAa,SAAS;AAAA,IACtD;AAAA,EACF;AAAA,EAEO,gBAAgB,WAAsB;AAC3C,SAAK,WAAW,OAAO,SAAS;AAChC,QAAI,KAAK,eAAe,KAAK,YAAY,QAAQ;AAC/C,WAAK,YAAY,aAAa,gBAAgB,SAAS;AAAA,IACzD;AAAA,EACF;AACF;",
+  "sources": ["../src/rfc6902/deepEqual.ts", "../src/rfc6902/pointer.ts", "../src/rfc6902/util.ts", "../src/rfc6902/diff.ts", "../src/rfc6902/patch.ts", "../src/diffing.ts", "../src/NetworkedDOM.ts", "../src/EditableNetworkedDOM.ts"],
+  "sourcesContent": ["export function deepEqual(a: any, b: any): boolean {\n  if (a === b) {\n    return true;\n  }\n\n  if (Array.isArray(a) && Array.isArray(b)) {\n    if (a.length !== b.length) {\n      return false;\n    }\n\n    return a.every((elem, index) => {\n      return deepEqual(elem, b[index]);\n    });\n  }\n\n  if (typeof a === \"object\" && typeof b === \"object\" && a !== null && b !== null) {\n    if (Array.isArray(a) || Array.isArray(b)) {\n      return false;\n    }\n\n    const keys1 = Object.keys(a);\n    const keys2 = Object.keys(b);\n    if (keys1.length !== keys2.length || !keys1.every((key) => keys2.includes(key))) {\n      return false;\n    }\n\n    for (const key in a) {\n      if (!deepEqual(a[key], b[key])) {\n        return false;\n      }\n    }\n\n    if (keys1.length === 0 && a instanceof Date && b instanceof Date) {\n      // Only need to check the length of 1 as they are already known to be equal\n      return a.getTime() === b.getTime();\n    }\n\n    return true;\n  }\n  return false;\n}\n", "/**\nUnescape token part of a JSON Pointer string\n\n`token` should *not* contain any '/' characters.\n\n> Evaluation of each reference token begins by decoding any escaped\n> character sequence.  This is performed by first transforming any\n> occurrence of the sequence '~1' to '/', and then transforming any\n> occurrence of the sequence '~0' to '~'.  By performing the\n> substitutions in this order, an implementation avoids the error of\n> turning '~01' first into '~1' and then into '/', which would be\n> incorrect (the string '~01' correctly becomes '~1' after\n> transformation).\n\nHere's my take:\n\n~1 is unescaped with higher priority than ~0 because it is a lower-order escape character.\nI say \"lower order\" because '/' needs escaping due to the JSON Pointer serialization technique.\nWhereas, '~' is escaped because escaping '/' uses the '~' character.\n*/\nfunction unescape(token: string): string {\n  return token.replace(/~1/g, \"/\").replace(/~0/g, \"~\");\n}\n\n/** Escape token part of a JSON Pointer string\n\n> '~' needs to be encoded as '~0' and '/'\n> needs to be encoded as '~1' when these characters appear in a\n> reference token.\n\nThis is the exact inverse of `unescape()`, so the reverse replacements must take place in reverse order.\n*/\nfunction escape(token: string): string {\n  return token.replace(/~/g, \"~0\").replace(/\\//g, \"~1\");\n}\n\nexport interface PointerEvaluation {\n  parent: any;\n  key: string;\n  value: any;\n}\n\n/**\nJSON Pointer representation\n*/\nexport class Pointer {\n  constructor(public tokens = [\"\"]) {}\n  /**\n  `path` *must* be a properly escaped string.\n  */\n  static fromJSON(path: string): Pointer {\n    const tokens = path.split(\"/\").map(unescape);\n    if (tokens[0] !== \"\") throw new Error(`Invalid JSON Pointer: ${path}`);\n    return new Pointer(tokens);\n  }\n  toString(): string {\n    return this.tokens.map(escape).join(\"/\");\n  }\n  /**\n  Returns an object with 'parent', 'key', and 'value' properties.\n  In the special case that this Pointer's path == \"\",\n  this object will be {parent: null, key: '', value: object}.\n  Otherwise, parent and key will have the property such that parent[key] == value.\n  */\n  evaluate(object: any): PointerEvaluation {\n    let parent: any = null;\n    let key = \"\";\n    let value = object;\n    for (let i = 1, l = this.tokens.length; i < l; i++) {\n      parent = value;\n      key = this.tokens[i];\n      if (key === \"__proto__\" || key === \"constructor\" || key === \"prototype\") {\n        continue;\n      }\n      // not sure if this the best way to handle non-existant paths...\n      value = (parent || {})[key];\n    }\n    return { parent, key, value };\n  }\n  get(object: any): any {\n    return this.evaluate(object).value;\n  }\n  set(object: any, value: any): void {\n    let cursor: any = object;\n    for (let i = 1, l = this.tokens.length - 1, token = this.tokens[i]; i < l; i++) {\n      // not sure if this the best way to handle non-existant paths...\n      cursor = (cursor || {})[token];\n    }\n    if (cursor) {\n      cursor[this.tokens[this.tokens.length - 1]] = value;\n    }\n  }\n  push(token: string): void {\n    // mutable\n    this.tokens.push(token);\n  }\n  /**\n  `token` should be a String. It'll be coerced to one anyway.\n\n  immutable (shallowly)\n  */\n  add(token: string): Pointer {\n    const tokens = this.tokens.concat(String(token));\n    return new Pointer(tokens);\n  }\n}\n", "export const hasOwnProperty = Object.prototype.hasOwnProperty;\n\nexport function objectType(object: any) {\n  if (object === undefined) {\n    return \"undefined\";\n  }\n  if (object === null) {\n    return \"null\";\n  }\n  if (Array.isArray(object)) {\n    return \"array\";\n  }\n  return typeof object;\n}\n\nfunction isNonPrimitive(value: any): value is object {\n  // loose-equality checking for null is faster than strict checking for each of null/undefined/true/false\n  // checking null first, then calling typeof, is faster than vice-versa\n  return value != null && typeof value === \"object\";\n}\n\n/**\nRecursively copy a value.\n\n@param source - should be a JavaScript primitive, Array, Date, or (plain old) Object.\n@returns copy of source where every Array and Object have been recursively\n         reconstructed from their constituent elements\n*/\nexport function clone<T>(source: T): T {\n  if (!isNonPrimitive(source)) {\n    // short-circuiting is faster than a single return\n    return source;\n  }\n  // x.constructor == Array is the fastest way to check if x is an Array\n  if (Array.isArray(source)) {\n    // construction via imperative for-loop is faster than source.map(arrayVsObject)\n    const length = (source as Array<any>).length;\n    // setting the Array length during construction is faster than just `[]` or `new Array()`\n    const arrayTarget: any = new Array(length);\n    for (let i = 0; i < length; i++) {\n      arrayTarget[i] = clone(source[i]);\n    }\n    return arrayTarget;\n  }\n  // Date\n  if (source.constructor === Date) {\n    const dateTarget: any = new Date(+source);\n    return dateTarget;\n  }\n  // Object\n  const objectTarget: any = {};\n  // declaring the variable (with const) inside the loop is faster\n  for (const key in source) {\n    // hasOwnProperty costs a bit of performance, but it's semantically necessary\n    // using a global helper is MUCH faster than calling source.hasOwnProperty(key)\n    if (hasOwnProperty.call(source, key)) {\n      objectTarget[key] = clone(source[key]);\n    }\n  }\n  return objectTarget;\n}\n", "import { deepEqual } from \"./deepEqual\";\nimport { Pointer } from \"./pointer\"; // we only need this for type inference\nimport { hasOwnProperty, objectType } from \"./util\";\n\n/**\nAll diff* functions should return a list of operations, often empty.\n\nEach operation should be an object with two to four fields:\n* `op`: the name of the operation; one of \"add\", \"remove\", \"replace\", \"move\",\n  \"copy\", or \"test\".\n* `path`: a JSON pointer string\n* `from`: a JSON pointer string\n* `value`: a JSON value\n\nThe different operations have different arguments.\n* \"add\": [`path`, `value`]\n* \"remove\": [`path`]\n* \"replace\": [`path`, `value`]\n* \"move\": [`from`, `path`]\n* \"copy\": [`from`, `path`]\n* \"test\": [`path`, `value`]\n\nCurrently this only really differentiates between Arrays, Objects, and\nEverything Else, which is pretty much just what JSON substantially\ndifferentiates between.\n*/\n\nexport interface AddOperation {\n  op: \"add\";\n  path: string;\n  value: any;\n}\nexport interface RemoveOperation {\n  op: \"remove\";\n  path: string;\n}\nexport interface ReplaceOperation {\n  op: \"replace\";\n  path: string;\n  value: any;\n}\nexport interface MoveOperation {\n  op: \"move\";\n  from: string;\n  path: string;\n}\nexport interface CopyOperation {\n  op: \"copy\";\n  from: string;\n  path: string;\n}\nexport interface TestOperation {\n  op: \"test\";\n  path: string;\n  value: any;\n}\n\nexport type Operation =\n  | AddOperation\n  | RemoveOperation\n  | ReplaceOperation\n  | MoveOperation\n  | CopyOperation\n  | TestOperation;\n\nexport function isDestructive({ op }: Operation): boolean {\n  return op === \"remove\" || op === \"replace\" || op === \"copy\" || op === \"move\";\n}\n\nexport type Diff = (input: any, output: any, ptr: Pointer) => Operation[];\n/**\nVoidableDiff exists to allow the user to provide a partial diff(...) function,\nfalling back to the built-in diffAny(...) function if the user-provided function\nreturns void.\n*/\nexport type VoidableDiff = (input: any, output: any, ptr: Pointer) => Operation[] | void;\n\nfunction wrapVoidableDiff(diff: VoidableDiff): Diff {\n  function wrappedDiff(input: any, output: any, ptr: Pointer): Operation[] {\n    const custom_patch = diff(input, output, ptr);\n    // ensure an array is always returned\n    return Array.isArray(custom_patch) ? custom_patch : diffAny(input, output, ptr, wrappedDiff);\n  }\n  return wrappedDiff;\n}\n\n/**\n Create a test operation based on `input`'s current evaluation of the JSON\n Pointer `path`; if such a pointer cannot be resolved, returns undefined.\n */\nfunction createTest(input: any, path: string): TestOperation | undefined {\n  const endpoint = Pointer.fromJSON(path).evaluate(input);\n  if (endpoint !== undefined) {\n    return { op: \"test\", path, value: endpoint.value };\n  }\n}\n\n/**\n Produce an 'application/json-patch+json'-type list of tests, to verify that\n existing values in an object are identical to the those captured at some\n checkpoint (whenever this function is called).\n\n This does not alter `input` or `output` unless they have a property getter with\n side-effects (which is not a good idea anyway).\n\n Returns list of test operations.\n */\nexport function createTests(input: any, patch: Operation[]): TestOperation[] {\n  const tests = new Array<TestOperation>();\n  patch.filter(isDestructive).forEach((operation) => {\n    const pathTest = createTest(input, operation.path);\n    if (pathTest) tests.push(pathTest);\n    if (\"from\" in operation) {\n      const fromTest = createTest(input, operation.from);\n      if (fromTest) tests.push(fromTest);\n    }\n  });\n  return tests;\n}\n\n/**\n Produce a 'application/json-patch+json'-type patch to get from one object to\n another.\n\n This does not alter `input` or `output` unless they have a property getter with\n side-effects (which is not a good idea anyway).\n\n `diff` is called on each pair of comparable non-primitive nodes in the\n `input`/`output` object trees, producing nested patches. Return `undefined`\n to fall back to default behaviour.\n\n Returns list of operations to perform on `input` to produce `output`.\n */\nexport function createPatch(input: any, output: any, diff?: VoidableDiff): Operation[] {\n  const ptr = new Pointer();\n  // a new Pointer gets a default path of [''] if not specified\n  return (diff ? wrapVoidableDiff(diff) : diffAny)(input, output, ptr);\n}\n\n/**\nList the keys in `minuend` that are not in `subtrahend`.\n\nA key is only considered if it is both 1) an own-property (o.hasOwnProperty(k))\nof the object, and 2) has a value that is not undefined. This is to match JSON\nsemantics, where JSON object serialization drops keys with undefined values.\n\n@param minuend Object of interest\n@param subtrahend Object of comparison\n@returns Array of keys that are in `minuend` but not in `subtrahend`.\n*/\nexport function subtract(\n  minuend: { [index: string]: any },\n  subtrahend: { [index: string]: any },\n): string[] {\n  // initialize empty object; we only care about the keys, the values can be anything\n  const obj: { [index: string]: number } = {};\n  // build up obj with all the properties of minuend\n  for (const add_key in minuend) {\n    if (hasOwnProperty.call(minuend, add_key) && minuend[add_key] !== undefined) {\n      obj[add_key] = 1;\n    }\n  }\n  // now delete all the properties of subtrahend from obj\n  // (deleting a missing key has no effect)\n  for (const del_key in subtrahend) {\n    if (hasOwnProperty.call(subtrahend, del_key) && subtrahend[del_key] !== undefined) {\n      delete obj[del_key];\n    }\n  }\n  // finally, extract whatever keys remain in obj\n  return Object.keys(obj);\n}\n\n/**\nList the keys that shared by all `objects`.\n\nThe semantics of what constitutes a \"key\" is described in {@link subtract}.\n\n@param objects Array of objects to compare\n@returns Array of keys that are in (\"own-properties\" of) every object in `objects`.\n*/\nexport function intersection(objects: ArrayLike<{ [index: string]: any }>): string[] {\n  const length = objects.length;\n  // prepare empty counter to keep track of how many objects each key occurred in\n  const counter: { [index: string]: number } = {};\n  // go through each object and increment the counter for each key in that object\n  for (let i = 0; i < length; i++) {\n    const object = objects[i];\n    for (const key in object) {\n      if (hasOwnProperty.call(object, key) && object[key] !== undefined) {\n        counter[key] = (counter[key] || 0) + 1;\n      }\n    }\n  }\n  // now delete all keys from the counter that were not seen in every object\n  for (const key in counter) {\n    if (counter[key] < length) {\n      delete counter[key];\n    }\n  }\n  // finally, extract whatever keys remain in the counter\n  return Object.keys(counter);\n}\n\ninterface ArrayAdd {\n  op: \"add\";\n  index: number;\n  value: any;\n}\ninterface ArrayRemove {\n  op: \"remove\";\n  index: number;\n}\ninterface ArrayReplace {\n  op: \"replace\";\n  index: number;\n  original: any;\n  value: any;\n}\n/** These are not proper Operation objects, but will be converted into\nOperation objects eventually. {index} indicates the actual target position,\nnever 'end-of-array' */\ntype ArrayOperation = ArrayAdd | ArrayRemove | ArrayReplace;\nfunction isArrayAdd(array_operation: ArrayOperation): array_operation is ArrayAdd {\n  return array_operation.op === \"add\";\n}\nfunction isArrayRemove(array_operation: ArrayOperation): array_operation is ArrayRemove {\n  return array_operation.op === \"remove\";\n}\n\ninterface DynamicAlternative {\n  /**\n   * track prev key position for less memory usage\n   */\n  prev: string | null;\n  operation: ArrayOperation | null;\n  /**\n  cost indicates the total cost of getting to this position.\n  */\n  cost: number;\n}\n\nfunction buildOperations(memo: Array<Array<DynamicAlternative>>, i: number, j: number) {\n  let memoized: DynamicAlternative = memo[i][j];\n  if (!memoized) {\n    throw new Error(\"invalid memo\");\n  }\n  const operations: ArrayOperation[] = [];\n  while (memoized && memoized.prev && memoized.operation) {\n    operations.push(memoized.operation);\n    const index = memoized.prev.split(\",\");\n    memoized = memo[Number(index[0])][Number(index[1])];\n  }\n  return operations.reverse();\n}\n\n/**\nCalculate the shortest sequence of operations to get from `input` to `output`,\nusing a dynamic programming implementation of the Levenshtein distance algorithm.\n\nTo get from the input ABC to the output AZ we could just delete all the input\nand say \"insert A, insert Z\" and be done with it. That's what we do if the\ninput is empty. But we can be smarter.\n\n          output\n               A   Z\n               -   -\n          [0]  1   2\ninput A |  1  [0]  1\n      B |  2  [1]  1\n      C |  3   2  [2]\n\n1) start at 0,0 (+0)\n2) keep A (+0)\n3) remove B (+1)\n4) replace C with Z (+1)\n\nIf the `input` (source) is empty, they'll all be in the top row, resulting in an\narray of 'add' operations.\nIf the `output` (target) is empty, everything will be in the left column,\nresulting in an array of 'remove' operations.\n\n@returns A list of add/remove/replace operations.\n*/\nexport function diffArrays<T>(\n  input: T[],\n  output: T[],\n  ptr: Pointer,\n  diff: Diff = diffAny,\n): Operation[] {\n  if (diff === void 0) {\n    diff = diffAny;\n  }\n  // set up cost matrix (very simple initialization: just a map)\n  const input_length = isNaN(input.length) || input.length <= 0 ? 0 : input.length;\n  const output_length = isNaN(output.length) || output.length <= 0 ? 0 : output.length;\n  let input_end = input_length;\n  let output_end = output_length;\n  while (input_end > 0 && output_end > 0) {\n    // accelerate same arrays\n    if (deepEqual(input[input_end - 1], output[output_end - 1])) {\n      input_end--;\n      output_end--;\n    } else {\n      break;\n    }\n  }\n  const memo: Array<Array<DynamicAlternative>> = new Array(input_end + 1);\n  for (let i = 0; i <= input_end; i++) {\n    memo[i] = new Array(output_end + 1);\n  }\n  memo[0][0] = { prev: null, operation: null, cost: 0 };\n  /**\n  Calculate the cheapest sequence of operations required to get from\n  input.slice(0, i) to output.slice(0, j).\n  There may be other valid sequences with the same cost, but none cheaper.\n\n  @param i The row in the layout above\n  @param j The column in the layout above\n  @returns An object containing a list of operations, along with the total cost\n           of applying them (+1 for each add/remove/replace operation)\n  */\n  // handle weird objects masquerading as Arrays that don't have proper length\n  // properties by using 0 for everything but positive numbers\n  for (let i = 0; i <= input_end; i++) {\n    for (let j = 0; j <= output_end; j++) {\n      let memoized = memo[i][j];\n      if (memoized) continue;\n      const add_prev_key = `${i},${j - 1}`;\n      const remove_prev_key = `${i - 1},${j}`;\n      const replace_prev_key = `${i - 1},${j - 1}`;\n      const remove_operation: ArrayRemove = {\n        op: \"remove\",\n        index: i - 1,\n      };\n      const add_operation: ArrayAdd = {\n        op: \"add\",\n        index: i - 1,\n        value: output[j - 1],\n      };\n\n      if (j === 0) {\n        memoized = {\n          prev: remove_prev_key,\n          operation: remove_operation,\n          cost: memo[i - 1][j].cost + 1,\n        };\n      } else if (i === 0) {\n        memoized = { prev: add_prev_key, operation: add_operation, cost: memo[i][j - 1].cost + 1 };\n      } else {\n        if (deepEqual(input[i - 1], output[j - 1])) {\n          memoized = memo[i - 1][j - 1];\n        } else {\n          const remove_prev = memo[i - 1][j];\n          const add_prev = memo[i][j - 1];\n          const replace_prev = memo[i - 1][j - 1];\n          const min_cost = Math.min(replace_prev.cost, add_prev.cost, remove_prev.cost);\n          if (remove_prev.cost === min_cost) {\n            memoized = {\n              prev: remove_prev_key,\n              operation: remove_operation,\n              cost: memo[i - 1][j].cost + 1,\n            };\n          } else if (add_prev.cost === min_cost) {\n            memoized = {\n              prev: add_prev_key,\n              operation: add_operation,\n              cost: memo[i][j - 1].cost + 1,\n            };\n          } else {\n            const replace_operation: ArrayReplace = {\n              op: \"replace\",\n              index: i - 1,\n              original: input[i - 1],\n              value: output[j - 1],\n            };\n            memoized = {\n              prev: replace_prev_key,\n              operation: replace_operation,\n              cost: memo[i - 1][j - 1].cost + 1,\n            };\n          }\n        }\n      }\n      memo[i][j] = memoized;\n    }\n  }\n  const array_operations = buildOperations(memo, input_end, output_end);\n  const [padded_operations] = array_operations.reduce<[Operation[], number]>(\n    ([operations, padding], array_operation) => {\n      if (isArrayAdd(array_operation)) {\n        const padded_index = array_operation.index + 1 + padding;\n        const index_token = padded_index < input_length + padding ? String(padded_index) : \"-\";\n        const operation = {\n          op: array_operation.op,\n          path: ptr.add(index_token).toString(),\n          value: array_operation.value,\n        };\n        // padding++ // maybe only if array_operation.index > -1 ?\n        return [operations.concat(operation), padding + 1];\n      } else if (isArrayRemove(array_operation)) {\n        const operation = {\n          op: array_operation.op,\n          path: ptr.add(String(array_operation.index + padding)).toString(),\n        };\n        // padding--\n        return [operations.concat(operation), padding - 1];\n      } else {\n        // replace\n        const replace_ptr = ptr.add(String(array_operation.index + padding));\n        const replace_operations = diff(\n          array_operation.original,\n          array_operation.value,\n          replace_ptr,\n        );\n        return [operations.concat(...replace_operations), padding];\n      }\n    },\n    [[], 0],\n  );\n  return padded_operations;\n}\n\nexport function diffObjects(\n  input: any,\n  output: any,\n  ptr: Pointer,\n  diff: Diff = diffAny,\n): Operation[] {\n  // if a key is in input but not output -> remove it\n  const operations: Operation[] = [];\n  subtract(input, output).forEach((key) => {\n    operations.push({ op: \"remove\", path: ptr.add(key).toString() });\n  });\n  // if a key is in output but not input -> add it\n  subtract(output, input).forEach((key) => {\n    operations.push({ op: \"add\", path: ptr.add(key).toString(), value: output[key] });\n  });\n  // if a key is in both, diff it recursively\n  intersection([input, output]).forEach((key) => {\n    operations.push(...diff(input[key], output[key], ptr.add(key)));\n  });\n  return operations;\n}\n\n/**\n`diffAny()` returns an empty array if `input` and `output` are materially equal\n(i.e., would produce equivalent JSON); otherwise it produces an array of patches\nthat would transform `input` into `output`.\n\n> Here, \"equal\" means that the value at the target location and the\n> value conveyed by \"value\" are of the same JSON type, and that they\n> are considered equal by the following rules for that type:\n> o  strings: are considered equal if they contain the same number of\n>    Unicode characters and their code points are byte-by-byte equal.\n> o  numbers: are considered equal if their values are numerically\n>    equal.\n> o  arrays: are considered equal if they contain the same number of\n>    values, and if each value can be considered equal to the value at\n>    the corresponding position in the other array, using this list of\n>    type-specific rules.\n> o  objects: are considered equal if they contain the same number of\n>    members, and if each member can be considered equal to a member in\n>    the other object, by comparing their keys (as strings) and their\n>    values (using this list of type-specific rules).\n> o  literals (false, true, and null): are considered equal if they are\n>    the same.\n*/\nexport function diffAny(input: any, output: any, ptr: Pointer, diff: Diff = diffAny): Operation[] {\n  // strict equality handles literals, numbers, and strings (a sufficient but not necessary cause)\n  if (input === output) {\n    return [];\n  }\n  const input_type = objectType(input);\n  const output_type = objectType(output);\n  if (input_type === \"array\" && output_type === \"array\") {\n    return diffArrays(input, output, ptr, diff);\n  }\n  if (input_type === \"object\" && output_type === \"object\") {\n    return diffObjects(input, output, ptr, diff);\n  }\n  // at this point we know that input and output are materially different;\n  // could be array -> object, object -> array, boolean -> undefined,\n  // number -> string, or some other combination, but nothing that can be split\n  // up into multiple patches: so `output` must replace `input` wholesale.\n  return [{ op: \"replace\", path: ptr.toString(), value: output }];\n}\n", "import {\n  AddOperation,\n  CopyOperation,\n  diffAny,\n  MoveOperation,\n  Operation,\n  RemoveOperation,\n  ReplaceOperation,\n  TestOperation,\n} from \"./diff\";\nimport { Pointer } from \"./pointer\";\nimport { clone } from \"./util\";\n\nexport class MissingError extends Error {\n  constructor(public path: string) {\n    super(`Value required at path: ${path}`);\n    this.name = \"MissingError\";\n  }\n}\n\nexport class TestError extends Error {\n  constructor(\n    public actual: any,\n    public expected: any,\n  ) {\n    super(`Test failed: ${actual} != ${expected}`);\n    this.name = \"TestError\";\n  }\n}\n\n/**\n Apply a 'application/json-patch+json'-type patch to an object.\n\n `patch` *must* be an array of operations.\n\n > Operation objects MUST have exactly one \"op\" member, whose value\n > indicates the operation to perform.  Its value MUST be one of \"add\",\n > \"remove\", \"replace\", \"move\", \"copy\", or \"test\"; other values are\n > errors.\n\n This method mutates the target object in-place.\n\n @returns list of results, one for each operation: `null` indicated success,\n otherwise, the result will be an instance of one of the Error classes:\n MissingError, InvalidOperationError, or TestError.\n */\nexport function applyPatch(object: any, patch: Operation[]) {\n  return patch.map((operation) => apply(object, operation));\n}\n\nfunction _add(object: any, key: string, value: any): void {\n  if (Array.isArray(object)) {\n    // `key` must be an index\n    if (key === \"-\") {\n      object.push(value);\n    } else {\n      const index = parseInt(key, 10);\n      object.splice(index, 0, value);\n    }\n  } else {\n    object[key] = value;\n  }\n}\n\nfunction _remove(object: any, key: string): void {\n  if (Array.isArray(object)) {\n    // '-' syntax doesn't make sense when removing\n    const index = parseInt(key, 10);\n    object.splice(index, 1);\n  } else {\n    // not sure what the proper behavior is when path = ''\n    delete object[key];\n  }\n}\n\n/**\n>  o  If the target location specifies an array index, a new value is\n>     inserted into the array at the specified index.\n>  o  If the target location specifies an object member that does not\n>     already exist, a new member is added to the object.\n>  o  If the target location specifies an object member that does exist,\n>     that member's value is replaced.\n*/\nexport function add(object: any, operation: AddOperation): MissingError | null {\n  const endpoint = Pointer.fromJSON(operation.path).evaluate(object);\n  // it's not exactly a \"MissingError\" in the same way that `remove` is -- more like a MissingParent, or something\n  if (endpoint.parent === undefined) {\n    return new MissingError(operation.path);\n  }\n  _add(endpoint.parent, endpoint.key, clone(operation.value));\n  return null;\n}\n\n/**\n> The \"remove\" operation removes the value at the target location.\n> The target location MUST exist for the operation to be successful.\n*/\nexport function remove(object: any, operation: RemoveOperation): MissingError | null {\n  // endpoint has parent, key, and value properties\n  const endpoint = Pointer.fromJSON(operation.path).evaluate(object);\n  if (endpoint.value === undefined) {\n    return new MissingError(operation.path);\n  }\n  // not sure what the proper behavior is when path = ''\n  _remove(endpoint.parent, endpoint.key);\n  return null;\n}\n\n/**\n> The \"replace\" operation replaces the value at the target location\n> with a new value.  The operation object MUST contain a \"value\" member\n> whose content specifies the replacement value.\n> The target location MUST exist for the operation to be successful.\n\n> This operation is functionally identical to a \"remove\" operation for\n> a value, followed immediately by an \"add\" operation at the same\n> location with the replacement value.\n\nEven more simply, it's like the add operation with an existence check.\n*/\nexport function replace(object: any, operation: ReplaceOperation): MissingError | null {\n  const endpoint = Pointer.fromJSON(operation.path).evaluate(object);\n  if (endpoint.parent === null) {\n    return new MissingError(operation.path);\n  }\n  // this existence check treats arrays as a special case\n  if (Array.isArray(endpoint.parent)) {\n    if (parseInt(endpoint.key, 10) >= endpoint.parent.length) {\n      return new MissingError(operation.path);\n    }\n  } else if (endpoint.value === undefined) {\n    return new MissingError(operation.path);\n  }\n  endpoint.parent[endpoint.key] = operation.value;\n  return null;\n}\n\n/**\n> The \"move\" operation removes the value at a specified location and\n> adds it to the target location.\n> The operation object MUST contain a \"from\" member, which is a string\n> containing a JSON Pointer value that references the location in the\n> target document to move the value from.\n> This operation is functionally identical to a \"remove\" operation on\n> the \"from\" location, followed immediately by an \"add\" operation at\n> the target location with the value that was just removed.\n\n> The \"from\" location MUST NOT be a proper prefix of the \"path\"\n> location; i.e., a location cannot be moved into one of its children.\n\nTODO: throw if the check described in the previous paragraph fails.\n*/\nexport function move(object: any, operation: MoveOperation): MissingError | null {\n  const from_endpoint = Pointer.fromJSON(operation.from).evaluate(object);\n  if (from_endpoint.value === undefined) {\n    return new MissingError(operation.from);\n  }\n  const endpoint = Pointer.fromJSON(operation.path).evaluate(object);\n  if (endpoint.parent === undefined) {\n    return new MissingError(operation.path);\n  }\n  _remove(from_endpoint.parent, from_endpoint.key);\n  _add(endpoint.parent, endpoint.key, from_endpoint.value);\n  return null;\n}\n\n/**\n> The \"copy\" operation copies the value at a specified location to the\n> target location.\n> The operation object MUST contain a \"from\" member, which is a string\n> containing a JSON Pointer value that references the location in the\n> target document to copy the value from.\n> The \"from\" location MUST exist for the operation to be successful.\n\n> This operation is functionally identical to an \"add\" operation at the\n> target location using the value specified in the \"from\" member.\n\nAlternatively, it's like 'move' without the 'remove'.\n*/\nexport function copy(object: any, operation: CopyOperation): MissingError | null {\n  const from_endpoint = Pointer.fromJSON(operation.from).evaluate(object);\n  if (from_endpoint.value === undefined) {\n    return new MissingError(operation.from);\n  }\n  const endpoint = Pointer.fromJSON(operation.path).evaluate(object);\n  if (endpoint.parent === undefined) {\n    return new MissingError(operation.path);\n  }\n  _add(endpoint.parent, endpoint.key, clone(from_endpoint.value));\n  return null;\n}\n\n/**\n> The \"test\" operation tests that a value at the target location is\n> equal to a specified value.\n> The operation object MUST contain a \"value\" member that conveys the\n> value to be compared to the target location's value.\n> The target location MUST be equal to the \"value\" value for the\n> operation to be considered successful.\n*/\nexport function test(object: any, operation: TestOperation): TestError | null {\n  const endpoint = Pointer.fromJSON(operation.path).evaluate(object);\n  // TODO: this diffAny(...).length usage could/should be lazy\n  if (diffAny(endpoint.value, operation.value, new Pointer()).length) {\n    return new TestError(endpoint.value, operation.value);\n  }\n  return null;\n}\n\nexport class InvalidOperationError extends Error {\n  constructor(public operation: Operation) {\n    super(`Invalid operation: ${operation.op}`);\n    this.name = \"InvalidOperationError\";\n  }\n}\n\n/**\nSwitch on `operation.op`, applying the corresponding patch function for each\ncase to `object`.\n*/\nexport function apply(\n  object: any,\n  operation: Operation,\n): MissingError | InvalidOperationError | TestError | null {\n  // not sure why TypeScript can't infer typesafety of:\n  //   {add, remove, replace, move, copy, test}[operation.op](object, operation)\n  // (seems like a bug)\n  switch (operation.op) {\n    case \"add\":\n      return add(object, operation);\n    case \"remove\":\n      return remove(object, operation);\n    case \"replace\":\n      return replace(object, operation);\n    case \"move\":\n      return move(object, operation);\n    case \"copy\":\n      return copy(object, operation);\n    case \"test\":\n      return test(object, operation);\n  }\n  return new InvalidOperationError(operation);\n}\n", "import {\n  AttributeChangedDiff,\n  ChildrenChangedDiff,\n  Diff,\n  ElementNodeDescription,\n  NodeDescription,\n  SnapshotMessage,\n  TextChangedDiff,\n  TextNodeDescription,\n} from \"@mml-io/networked-dom-protocol\";\nimport { StaticVirtualDOMElement } from \"@mml-io/observable-dom-common\";\n\nimport { NodeMapping, StaticVirtualDOMMutationRecord, VirtualDOMDiffStruct } from \"./common\";\nimport * as rfc6902 from \"./rfc6902\";\n\nexport const visibleToAttrName = \"visible-to\";\nexport const hiddenFromAttrName = \"hidden-from\";\n\n/**\n * This function does a lot of heavy lifting - it takes a mutation and applies it to the connection's view (affecting\n * which nodes are visible based on attributes etc.)\n *\n * As a result of the application it generates a diff for the particular connection's view of the DOM.\n */\nexport function diffFromApplicationOfStaticVirtualDOMMutationRecordToConnection(\n  mutation: StaticVirtualDOMMutationRecord,\n  parentNode: StaticVirtualDOMElement | null,\n  connectionId: number,\n  visibleNodesForConnection: Set<number>,\n): Diff | null {\n  const virtualDOMElement = mutation.target;\n\n  switch (mutation.type) {\n    case \"snapshot\": {\n      const nodeDescription = describeNodeWithChildrenForConnectionId(\n        virtualDOMElement,\n        connectionId,\n        visibleNodesForConnection,\n      );\n      if (!nodeDescription) {\n        return null;\n      }\n      const diff: SnapshotMessage = {\n        type: \"snapshot\",\n        snapshot: nodeDescription,\n        documentTime: 0,\n      };\n      return diff;\n    }\n    case \"attributes\": {\n      const visible = visibleNodesForConnection.has(virtualDOMElement.nodeId);\n\n      if (!parentNode) {\n        throw new Error(\"Node has no parent\");\n      }\n      const parentNodeId = parentNode.nodeId;\n      const shouldBeVisible =\n        shouldShowNodeToConnectionId(virtualDOMElement, connectionId) &&\n        visibleNodesForConnection.has(parentNodeId);\n\n      // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n      const attributeName = mutation.attributeName!;\n\n      if (visible && shouldBeVisible) {\n        let newValue = null; // null indicates deleted\n        if (virtualDOMElement.attributes[attributeName] !== undefined) {\n          newValue = virtualDOMElement.attributes[attributeName];\n        }\n        const diff: AttributeChangedDiff = {\n          type: \"attributeChange\",\n          nodeId: virtualDOMElement.nodeId,\n          attribute: attributeName,\n          newValue,\n        };\n        return diff;\n      } else if (!visible && shouldBeVisible) {\n        // Need to add this child to the connection's view now\n        visibleNodesForConnection.add(virtualDOMElement.nodeId);\n\n        const index = parentNode.childNodes.indexOf(virtualDOMElement);\n        if (index === -1) {\n          throw new Error(\"Node not found in parent's children\");\n        }\n\n        let previousNodeId = null;\n        if (index > 0) {\n          previousNodeId = getNodeIdOfPreviousVisibleSibling(\n            parentNode,\n            index - 1,\n            visibleNodesForConnection,\n          );\n        }\n\n        const nodeDescription = describeNodeWithChildrenForConnectionId(\n          virtualDOMElement,\n          connectionId,\n          visibleNodesForConnection,\n        );\n        if (!nodeDescription) {\n          throw new Error(\"Node description not found\");\n        }\n        const diff: ChildrenChangedDiff = {\n          type: \"childrenChanged\",\n          nodeId: parentNodeId,\n          previousNodeId,\n          addedNodes: [nodeDescription],\n          removedNodes: [],\n        };\n        return diff;\n      } else if (visible && !shouldBeVisible) {\n        removeNodeAndChildrenFromVisibleNodes(virtualDOMElement, visibleNodesForConnection);\n        const diff: ChildrenChangedDiff = {\n          type: \"childrenChanged\",\n          nodeId: parentNodeId,\n          previousNodeId: null,\n          addedNodes: [],\n          removedNodes: [virtualDOMElement.nodeId],\n        };\n        return diff;\n      } else if (!visible && !shouldBeVisible) {\n        return null;\n      }\n      break;\n    }\n    case \"characterData\": {\n      const visible = visibleNodesForConnection.has(virtualDOMElement.nodeId);\n      if (!visible) {\n        return null;\n      }\n      const diff: TextChangedDiff = {\n        type: \"textChanged\",\n        nodeId: virtualDOMElement.nodeId,\n        text: virtualDOMElement.textContent || \"\",\n      };\n      return diff;\n    }\n    case \"childList\": {\n      const visible = visibleNodesForConnection.has(virtualDOMElement.nodeId);\n      if (!visible) {\n        return null;\n      }\n      let previousSibling = mutation.previousSibling;\n      let previousNodeId: number | null = null;\n      if (previousSibling) {\n        let previousIndex = virtualDOMElement.childNodes.indexOf(previousSibling);\n        while (previousIndex !== -1) {\n          previousSibling = virtualDOMElement.childNodes[previousIndex];\n          if (visibleNodesForConnection.has(previousSibling.nodeId)) {\n            previousNodeId = previousSibling.nodeId;\n            break;\n          }\n          previousIndex--;\n        }\n      }\n\n      const diff: ChildrenChangedDiff = {\n        type: \"childrenChanged\",\n        nodeId: virtualDOMElement.nodeId,\n        previousNodeId,\n        addedNodes: [],\n        removedNodes: [],\n      };\n\n      mutation.addedNodes.forEach((childVirtualDOMElement: StaticVirtualDOMElement) => {\n        const describedNode = describeNodeWithChildrenForConnectionId(\n          childVirtualDOMElement,\n          connectionId,\n          visibleNodesForConnection,\n        );\n        if (!describedNode) {\n          return;\n        }\n        diff.addedNodes.push(describedNode);\n      });\n      mutation.removedNodes.forEach((childVirtualDOMElement: StaticVirtualDOMElement) => {\n        if (visibleNodesForConnection.has(childVirtualDOMElement.nodeId)) {\n          removeNodeAndChildrenFromVisibleNodes(childVirtualDOMElement, visibleNodesForConnection);\n          diff.removedNodes.push(childVirtualDOMElement.nodeId);\n        }\n      });\n\n      if (diff.addedNodes.length > 0 || diff.removedNodes.length > 0) {\n        return diff;\n      }\n      return null;\n    }\n    default:\n      console.error(\"Unknown mutation type: \" + mutation.type);\n      break;\n  }\n  return null;\n}\n\nfunction getNodeIdOfPreviousVisibleSibling(\n  parentVirtualElement: StaticVirtualDOMElement,\n  candidateIndex: number,\n  visibleNodesForConnection: Set<number>,\n): number | null {\n  if (candidateIndex > 0) {\n    let previousSiblingIndex = candidateIndex;\n    while (previousSiblingIndex >= 0) {\n      const previousSibling = parentVirtualElement.childNodes[previousSiblingIndex];\n      if (visibleNodesForConnection.has(previousSibling.nodeId)) {\n        return previousSibling.nodeId;\n      }\n      previousSiblingIndex--;\n    }\n  }\n  return null;\n}\n\nfunction shouldShowNodeToConnectionId(\n  virtualDOMElement: StaticVirtualDOMElement,\n  connectionId: number,\n): boolean {\n  const visibleToAttr = virtualDOMElement.attributes[visibleToAttrName];\n  const hiddenFromAttr = virtualDOMElement.attributes[hiddenFromAttrName];\n  const connectionIdString = connectionId.toString();\n  if (visibleToAttr !== undefined) {\n    const visibleToList = visibleToAttr.split(\" \");\n    const explicityVisible = visibleToList.includes(connectionIdString);\n    if (!explicityVisible) {\n      return false;\n    }\n  }\n  if (hiddenFromAttr !== undefined) {\n    const hiddenFromList = hiddenFromAttr.split(\" \");\n    const explicityHidden = hiddenFromList.includes(connectionIdString);\n    if (explicityHidden) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function describeNodeWithChildrenForConnectionId(\n  virtualDOMElement: StaticVirtualDOMElement,\n  connectionId: number,\n  visibleNodesForConnection: Set<number>,\n): NodeDescription | null {\n  if (!shouldShowNodeToConnectionId(virtualDOMElement, connectionId)) {\n    return null;\n  }\n\n  let emittedTagName = virtualDOMElement.tag;\n  if (emittedTagName === \"#document\") {\n    emittedTagName = \"DIV\";\n  }\n  if (emittedTagName === \"#text\") {\n    const textNode: TextNodeDescription = {\n      type: \"text\",\n      nodeId: virtualDOMElement.nodeId,\n      text: virtualDOMElement.textContent || \"\",\n    };\n    visibleNodesForConnection.add(textNode.nodeId);\n    return textNode;\n  } else {\n    const node: ElementNodeDescription = {\n      type: \"element\",\n      nodeId: virtualDOMElement.nodeId,\n      tag: emittedTagName,\n      attributes: virtualDOMElement.attributes,\n      children: [],\n      text: virtualDOMElement.textContent,\n    };\n    visibleNodesForConnection.add(node.nodeId);\n\n    for (const child of virtualDOMElement.childNodes) {\n      const childNodeDescription = describeNodeWithChildrenForConnectionId(\n        child,\n        connectionId,\n        visibleNodesForConnection,\n      );\n      if (childNodeDescription) {\n        node.children.push(childNodeDescription);\n      }\n    }\n    return node;\n  }\n}\n\nfunction removeNodeAndChildrenFromVisibleNodes(\n  virtualDOMElement: StaticVirtualDOMElement,\n  visibleNodesForConnection: Set<number>,\n): void {\n  visibleNodesForConnection.delete(virtualDOMElement.nodeId);\n  for (const child of virtualDOMElement.childNodes) {\n    if (!visibleNodesForConnection.has(child.nodeId)) {\n      console.error(\"Inner child of removed element was not visible\", child.nodeId);\n    }\n    removeNodeAndChildrenFromVisibleNodes(child, visibleNodesForConnection);\n  }\n}\n\nexport function findParentNodeOfNodeId(\n  virtualDOMElement: StaticVirtualDOMElement,\n  targetNodeId: number,\n): StaticVirtualDOMElement | null {\n  // TODO - avoid a search of the whole tree for the node's parent\n  // depth-first search of the whole virtual dom structure to find the node's parent\n  for (const child of virtualDOMElement.childNodes) {\n    if (child.nodeId === targetNodeId) {\n      return virtualDOMElement;\n    } else {\n      const foundParentId = findParentNodeOfNodeId(child, targetNodeId);\n      if (foundParentId) {\n        return foundParentId;\n      }\n    }\n  }\n  return null;\n}\n\nexport function virtualDOMDiffToVirtualDOMMutationRecord(\n  virtualStructure: StaticVirtualDOMElement,\n  domDiff: rfc6902.Operation,\n): Array<StaticVirtualDOMMutationRecord> {\n  const pointer = rfc6902.Pointer.fromJSON(domDiff.path);\n  const grandParentTokens = pointer.tokens.slice(0, pointer.tokens.length - 2);\n  const lastToken = pointer.tokens[pointer.tokens.length - 1];\n  const secondLastToken = pointer.tokens[pointer.tokens.length - 2];\n\n  if (lastToken === \"textContent\") {\n    const nodePointer = new rfc6902.Pointer(pointer.tokens.slice(0, pointer.tokens.length - 1));\n    const node = nodePointer.get(virtualStructure) as StaticVirtualDOMElement;\n    return [\n      {\n        type: \"characterData\",\n        target: node,\n        addedNodes: [],\n        removedNodes: [],\n        attributeName: null,\n        previousSibling: null,\n      },\n    ];\n  }\n\n  if (secondLastToken === \"attributes\") {\n    // This handles attribute additions, changes, and removals\n    const nodePointer = new rfc6902.Pointer(grandParentTokens);\n    const node = nodePointer.get(virtualStructure) as StaticVirtualDOMElement;\n    return [\n      {\n        type: \"attributes\",\n        target: node,\n        addedNodes: [],\n        removedNodes: [],\n        attributeName: lastToken,\n        previousSibling: null,\n      },\n    ];\n  }\n\n  // Child changes\n\n  if (secondLastToken === \"childNodes\") {\n    const nodePointer = new rfc6902.Pointer(grandParentTokens);\n    const node = nodePointer.get(virtualStructure) as StaticVirtualDOMElement;\n\n    let previousSibling: StaticVirtualDOMElement | null = null;\n    if (lastToken === \"-\") {\n      if (node.childNodes.length > 0) {\n        previousSibling = node.childNodes[node.childNodes.length - 1];\n      } else {\n        // There are no siblings to account for\n      }\n    } else {\n      const index = parseInt(lastToken, 10);\n      if (index === 0) {\n        previousSibling = null;\n      } else {\n        previousSibling = node.childNodes[index - 1];\n      }\n    }\n    const addedNodes: Array<StaticVirtualDOMElement> = [];\n    const removedNodes: Array<StaticVirtualDOMElement> = [];\n    switch (domDiff.op) {\n      case \"add\": {\n        addedNodes.push(domDiff.value);\n        return [\n          {\n            type: \"childList\",\n            target: node,\n            addedNodes,\n            removedNodes,\n            previousSibling,\n            attributeName: null,\n          },\n        ];\n      }\n      case \"remove\": {\n        const removedNode = pointer.get(virtualStructure) as StaticVirtualDOMElement;\n        removedNodes.push(removedNode);\n        return [\n          {\n            type: \"childList\",\n            target: node,\n            addedNodes,\n            removedNodes,\n            previousSibling,\n            attributeName: null,\n          },\n        ];\n      }\n      case \"replace\": {\n        // This is a replacement of a single node\n        const removedNode = pointer.get(virtualStructure) as StaticVirtualDOMElement;\n        removedNodes.push(removedNode);\n        addedNodes.push(domDiff.value);\n        return [\n          {\n            type: \"childList\",\n            target: node,\n            addedNodes: [],\n            removedNodes,\n            previousSibling,\n            attributeName: null,\n          },\n          {\n            type: \"childList\",\n            target: node,\n            addedNodes,\n            removedNodes: [],\n            previousSibling,\n            attributeName: null,\n          },\n        ];\n      }\n    }\n  }\n\n  if (domDiff.op === \"replace\" && domDiff.path === \"\") {\n    const node = domDiff.value as StaticVirtualDOMElement;\n    return [\n      {\n        type: \"snapshot\",\n        target: node,\n        addedNodes: [],\n        removedNodes: [],\n        previousSibling: null,\n        attributeName: null,\n      },\n    ];\n  }\n\n  console.error(\"Unhandled JSON diff:\", JSON.stringify(domDiff, null, 2));\n  throw new Error(\"Unhandled diff type\");\n}\n\nexport function calculateStaticVirtualDOMDiff(\n  originalState: StaticVirtualDOMElement,\n  latestState: StaticVirtualDOMElement,\n): VirtualDOMDiffStruct {\n  const jsonPatchDiffs = rfc6902.createPatch(\n    originalState,\n    latestState,\n    (a, b, ptr: rfc6902.Pointer) => {\n      if (a.tag !== b.tag) {\n        return [{ op: \"replace\", path: ptr.toString(), value: b }];\n      }\n      return;\n    },\n  );\n\n  const nodeIdRemappings: Array<NodeMapping> = [];\n  const virtualDOMDiffs: Array<rfc6902.Operation> = [];\n  for (const diff of jsonPatchDiffs) {\n    if (diff.op === \"replace\" && diff.path.endsWith(\"/nodeId\")) {\n      const pointer = rfc6902.Pointer.fromJSON(diff.path);\n      const originalValue = pointer.get(originalState);\n      nodeIdRemappings.push({\n        internalNodeId: diff.value,\n        clientFacingNodeId: originalValue,\n      });\n    } else {\n      virtualDOMDiffs.push(diff);\n    }\n  }\n\n  return remapDuplicatedNodeIdsInOperations(\n    {\n      originalState,\n      nodeIdRemappings,\n      virtualDOMDiffs,\n    },\n    latestState,\n  );\n}\n\nfunction getHighestNodeId(node: StaticVirtualDOMElement) {\n  let highest = node.nodeId;\n  for (const child of node.childNodes) {\n    highest = Math.max(highest, getHighestNodeId(child));\n  }\n  return highest;\n}\n\nfunction getRemovedNodeIds(before: StaticVirtualDOMElement, diff: rfc6902.Operation) {\n  const removedIds = new Set<number>();\n  function addNode(node: StaticVirtualDOMElement) {\n    removedIds.add(node.nodeId);\n    for (const child of node.childNodes) {\n      addNode(child);\n    }\n  }\n  if (diff.op === \"replace\" || diff.op === \"remove\") {\n    const removedNode = rfc6902.Pointer.fromJSON(diff.path).get(before);\n    addNode(removedNode);\n  }\n  return removedIds;\n}\n\nfunction getNodeIdsFromNodeAndChildren(node: StaticVirtualDOMElement) {\n  const nodeIds = new Set<number>();\n  function addNode(node: StaticVirtualDOMElement) {\n    nodeIds.add(node.nodeId);\n    for (const child of node.childNodes) {\n      addNode(child);\n    }\n  }\n  addNode(node);\n  return nodeIds;\n}\n\n// To avoid duplicate node ids at any point in the sequence of operations, apply the operations and determine if any node ids are duplicated at any point. If so, remap the node ids to be unique.\nfunction remapDuplicatedNodeIdsInOperations(\n  virtualDOMDiffStruct: VirtualDOMDiffStruct,\n  latestState: StaticVirtualDOMElement,\n): VirtualDOMDiffStruct {\n  const { originalState, nodeIdRemappings, virtualDOMDiffs } = virtualDOMDiffStruct;\n\n  const highestNodeIdAcrossStartAndEnd = Math.max(\n    getHighestNodeId(originalState),\n    getHighestNodeId(latestState),\n  );\n  let nextNodeId = highestNodeIdAcrossStartAndEnd + 1;\n\n  const before = JSON.parse(JSON.stringify(originalState));\n\n  function checkAndReplaceNodeIdsIfAlreadyInUse(\n    node: StaticVirtualDOMElement,\n    addingNodeIds: Set<number>,\n    removedIds: Set<number>,\n  ) {\n    if (existingNodeIds.has(node.nodeId) && removedIds && !removedIds.has(node.nodeId)) {\n      // This node id is already present so it must be replaced\n      const newNodeId = nextNodeId++;\n      nodeIdRemappings.push({\n        internalNodeId: node.nodeId,\n        clientFacingNodeId: newNodeId,\n      });\n      node.nodeId = newNodeId;\n      addingNodeIds.add(newNodeId);\n    } else {\n      addingNodeIds.add(node.nodeId);\n    }\n    for (const child of node.childNodes) {\n      checkAndReplaceNodeIdsIfAlreadyInUse(child, addingNodeIds, removedIds);\n    }\n  }\n\n  const existingNodeIds = getNodeIdsFromNodeAndChildren(before);\n\n  for (const diff of virtualDOMDiffs) {\n    const pointer = rfc6902.Pointer.fromJSON(diff.path);\n    const secondLastToken = pointer.tokens[pointer.tokens.length - 2];\n    if (secondLastToken !== \"childNodes\") {\n      continue;\n    }\n    const removedIds = getRemovedNodeIds(before, diff);\n    const addingNodeIds = new Set<number>();\n    if (diff.op === \"replace\" || diff.op === \"add\") {\n      // The added node can use removed node ids, but it must not use any node ids that are still in use.\n      checkAndReplaceNodeIdsIfAlreadyInUse(diff.value, addingNodeIds, removedIds);\n    }\n    removedIds.forEach((removedId) => {\n      existingNodeIds.delete(removedId);\n    });\n    addingNodeIds.forEach((addingNodeId) => {\n      existingNodeIds.add(addingNodeId);\n    });\n\n    const patchErrors = rfc6902.applyPatch(before, [diff]);\n    if (patchErrors.length !== 1 || patchErrors[0] !== null) {\n      throw new Error(\"Patch failed\");\n    }\n  }\n\n  return virtualDOMDiffStruct;\n}\n", "import {\n  ClientMessage,\n  Diff,\n  NodeDescription,\n  PongMessage,\n  RemoteEvent,\n  ServerMessage,\n  SnapshotMessage,\n} from \"@mml-io/networked-dom-protocol\";\nimport {\n  LogMessage,\n  ObservableDOMInterface,\n  ObservableDOMMessage,\n  ObservableDOMParameters,\n  StaticVirtualDOMElement,\n  StaticVirtualDOMMutationIdsRecord,\n} from \"@mml-io/observable-dom-common\";\n\nimport { StaticVirtualDOMMutationRecord, VirtualDOMDiffStruct } from \"./common\";\nimport {\n  calculateStaticVirtualDOMDiff,\n  describeNodeWithChildrenForConnectionId,\n  diffFromApplicationOfStaticVirtualDOMMutationRecordToConnection,\n  findParentNodeOfNodeId,\n  virtualDOMDiffToVirtualDOMMutationRecord,\n} from \"./diffing\";\nimport { applyPatch } from \"./rfc6902\";\n\nexport const networkedDOMProtocolSubProtocol_v0_1 = \"networked-dom-v0.1\";\nexport const defaultWebsocketSubProtocol = networkedDOMProtocolSubProtocol_v0_1;\n\nexport type ObservableDOMFactory = (\n  observableDOMParameters: ObservableDOMParameters,\n  callback: (message: ObservableDOMMessage, observableDOM: ObservableDOMInterface) => void,\n) => ObservableDOMInterface;\n\n/**\n * NetworkedDOM is the main class for the networked-dom-document package. It is responsible for managing the state of\n * the document and the connections to the clients.\n *\n * It is constructed with an ObservableDOMFactory, which is responsible for creating the ObservableDOMInterface\n * implementation that is used to run the document.\n */\nexport class NetworkedDOM {\n  // First to last in order of preference\n  public static SupportedWebsocketSubProtocolsPreferenceOrder = [\n    networkedDOMProtocolSubProtocol_v0_1,\n  ];\n\n  // Map from the node ids that the DOM uses internally to the node ids that clients refer to.\n  private internalNodeIdToClientNodeId = new Map<number, number>();\n\n  // Map from the node ids that clients refer to to the node ids that the DOM uses internally.\n  private clientNodeIdToInternalNodeId = new Map<number, number>();\n\n  private currentConnectionId = 1;\n  private connectionIdToWebSocketContext = new Map<\n    number,\n    { webSocket: WebSocket; messageListener: (messageEvent: MessageEvent) => void }\n  >();\n  private webSocketToConnectionId = new Map<WebSocket, number>();\n  private visibleNodeIdsByConnectionId = new Map<number, Set<number>>();\n  private initialLoad = true;\n  private readonly htmlPath: string;\n\n  private disposed = false;\n  private ignoreTextNodes: boolean;\n\n  private documentRoot!: StaticVirtualDOMElement;\n  private nodeIdToNode = new Map<number, StaticVirtualDOMElement>();\n  private nodeIdToParentNodeId = new Map<number, number>();\n\n  private observableDOM: ObservableDOMInterface;\n\n  private documentEffectiveStartTime = Date.now();\n  private latestDocumentTime = 0;\n  private pingCounter = 1;\n  private maximumNodeId = 0;\n\n  private logCallback?: (message: LogMessage) => void;\n\n  constructor(\n    observableDOMFactory: ObservableDOMFactory,\n    htmlPath: string,\n    htmlContents: string,\n    oldInstanceDocumentRoot: StaticVirtualDOMElement | null,\n    onLoad: (domDiff: VirtualDOMDiffStruct | null, networkedDOM: NetworkedDOM) => void,\n    params = {},\n    ignoreTextNodes = true,\n    logCallback?: (message: LogMessage) => void,\n  ) {\n    this.htmlPath = htmlPath;\n    this.ignoreTextNodes = ignoreTextNodes;\n\n    this.logCallback = logCallback || this.defaultLogCallback;\n\n    this.observableDOM = observableDOMFactory(\n      {\n        htmlPath,\n        htmlContents,\n        params,\n        ignoreTextNodes,\n        pingIntervalMilliseconds: 5000,\n      },\n      (message: ObservableDOMMessage, observableDOM: ObservableDOMInterface) => {\n        this.observableDOM = observableDOM;\n        if (message.documentTime) {\n          this.documentEffectiveStartTime = Date.now() - message.documentTime;\n          this.latestDocumentTime = message.documentTime;\n        }\n        if (message.snapshot) {\n          this.documentRoot = message.snapshot;\n          const clonedSnapshot = JSON.parse(JSON.stringify(message.snapshot));\n\n          if (!this.initialLoad) {\n            throw new Error(\"Received snapshot after initial load\");\n          }\n          this.initialLoad = false;\n\n          let domDiff: VirtualDOMDiffStruct | null = null;\n          if (oldInstanceDocumentRoot) {\n            domDiff = calculateStaticVirtualDOMDiff(oldInstanceDocumentRoot, clonedSnapshot);\n            for (const remapping of domDiff.nodeIdRemappings) {\n              this.addRemappedNodeId(remapping.clientFacingNodeId, remapping.internalNodeId);\n            }\n          }\n\n          this.addAndRemapNodeFromInstance(this.documentRoot, -1);\n\n          onLoad(domDiff, this);\n        } else if (message.mutation) {\n          if (this.initialLoad) {\n            throw new Error(\"Received mutation before initial load\");\n          }\n          const mutation = this.addKnownNodesInMutation(message.mutation);\n          this.processModification(mutation);\n          this.removeKnownNodesInMutation(mutation);\n        } else if (message.logMessage) {\n          if (this.logCallback) {\n            this.logCallback(message.logMessage);\n          }\n        } else {\n          if (message.documentTime) {\n            // This is just a regular ping message to update the document time - send the document time to all connected clients\n            this.sendPings();\n            return;\n          }\n          console.error(\"Unknown message type from observableDOM\", message);\n        }\n      },\n    );\n  }\n\n  private defaultLogCallback(message: LogMessage) {\n    const getLogFn = (level: string) => {\n      switch (level) {\n        case \"system\":\n          return console.error;\n        case \"error\":\n          return console.error;\n        case \"warn\":\n          return console.warn;\n        case \"log\":\n          return console.log;\n        case \"info\":\n          return console.info;\n        default:\n          return console.log;\n      }\n    };\n\n    const logFn = getLogFn(message.level);\n    logFn(`${message.level.toUpperCase()} (${this.htmlPath}):`, ...message.content);\n  }\n\n  private addRemappedNodeId(clientFacingNodeId: number, internalNodeId: number) {\n    this.internalNodeIdToClientNodeId.set(internalNodeId, clientFacingNodeId);\n    this.clientNodeIdToInternalNodeId.set(clientFacingNodeId, internalNodeId);\n    this.maximumNodeId = Math.max(this.maximumNodeId, Math.max(clientFacingNodeId, internalNodeId));\n  }\n\n  private sendPings() {\n    const ping = this.pingCounter++;\n    if (this.pingCounter > 1000) {\n      this.pingCounter = 1;\n    }\n    const pingMessage: Array<ServerMessage> = [\n      {\n        type: \"ping\",\n        ping,\n        documentTime: this.getDocumentTime(),\n      },\n    ];\n    const stringified = JSON.stringify(pingMessage);\n    this.connectionIdToWebSocketContext.forEach((webSocketContext) => {\n      webSocketContext.webSocket.send(stringified);\n    });\n  }\n\n  private getInitialSnapshot(\n    connectionId: number,\n    documentVirtualDOMElement: StaticVirtualDOMElement,\n  ): SnapshotMessage {\n    const visibleNodesForConnection = this.visibleNodeIdsByConnectionId.get(connectionId);\n    if (!visibleNodesForConnection) {\n      const err = new Error(\n        `visibleNodesForConnection not found for connectionId in getInitialSnapshot: ${connectionId}`,\n      );\n      console.error(err);\n      throw err;\n    }\n    const domSnapshot: NodeDescription | null = describeNodeWithChildrenForConnectionId(\n      documentVirtualDOMElement,\n      connectionId,\n      visibleNodesForConnection,\n    );\n    if (!domSnapshot) {\n      throw new Error(`domSnapshot was not generated`);\n    }\n    return {\n      type: \"snapshot\",\n      snapshot: domSnapshot,\n      documentTime: Date.now() - this.documentEffectiveStartTime,\n    };\n  }\n\n  public getDocumentTime(): number {\n    return this.latestDocumentTime;\n  }\n\n  public addExistingWebsockets(\n    websockets: Array<WebSocket>,\n    existingWebsocketMap: Map<WebSocket, number> | null,\n    domDiff: VirtualDOMDiffStruct | null,\n  ) {\n    const connectionIds = [];\n    for (const websocket of websockets) {\n      let existingId = null;\n      if (existingWebsocketMap !== null) {\n        existingId = existingWebsocketMap.get(websocket);\n      }\n      const { connectionId } = this.registerWebsocket(websocket, existingId);\n      connectionIds.push(connectionId);\n    }\n\n    if (domDiff) {\n      const diffsByConnectionId = new Map<number, Array<Diff>>(\n        connectionIds.map((connectionId) => [connectionId, []]),\n      );\n\n      // Each of the websockets needs to have the original state of the document re-applied to it to determine visible\n      // nodes, but not sent (they already have the old version of the document as their state).\n      for (const connectionId of connectionIds) {\n        // Ignore the return value - the side effect is that the visible nodes for the connection are set\n        this.getInitialSnapshot(connectionId, domDiff.originalState);\n      }\n\n      for (const virtualDOMDiff of domDiff.virtualDOMDiffs) {\n        // Convert the diff of the virtual dom data structure to a MutationRecord-like diff and then handle it as if it were a MutationRecord\n        // The difficulty here is that the JSON diff is typed by add/remove/replace of elements of a hierarchy specified by paths, but MutationRecords are specified by type of operation and nodeIds\n\n        const mutationRecordLikes = virtualDOMDiffToVirtualDOMMutationRecord(\n          domDiff.originalState,\n          virtualDOMDiff,\n        );\n\n        if (virtualDOMDiff.path === \"\" && virtualDOMDiff.op === \"replace\") {\n          // The patch is a snapshot replacement - no need to check the patch validity\n        } else {\n          const patchResults = applyPatch(domDiff.originalState, [virtualDOMDiff]);\n          for (const patchResult of patchResults) {\n            if (patchResult !== null) {\n              console.error(\"Patching virtual dom structure resulted in error\", patchResult);\n              throw patchResult;\n            }\n          }\n        }\n\n        for (const mutationRecordLike of mutationRecordLikes) {\n          const targetNodeId = mutationRecordLike.target.nodeId;\n          const virtualElementParent = findParentNodeOfNodeId(domDiff.originalState, targetNodeId);\n          diffsByConnectionId.forEach((diffs, connectionId) => {\n            const mutationDiff = diffFromApplicationOfStaticVirtualDOMMutationRecordToConnection(\n              mutationRecordLike,\n              virtualElementParent,\n              connectionId,\n              // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n              this.visibleNodeIdsByConnectionId.get(connectionId)!,\n            );\n            if (mutationDiff) {\n              diffs.push(mutationDiff);\n            }\n          });\n        }\n      }\n\n      diffsByConnectionId.forEach((diffs, connectionId) => {\n        if (diffs.length === 0) {\n          // Need to add an \"empty\" message to allow passing the document time to the client\n          diffs.push({\n            type: \"childrenChanged\",\n            nodeId: this.documentRoot.nodeId,\n            previousNodeId: null,\n            addedNodes: [],\n            removedNodes: [],\n          });\n        }\n        const asServerMessages: Array<ServerMessage> = diffs;\n        const firstDiff = diffs[0];\n        firstDiff.documentTime = this.getDocumentTime();\n        const serializedDiffs = JSON.stringify(asServerMessages);\n        const webSocketContext = this.connectionIdToWebSocketContext.get(connectionId);\n        if (!webSocketContext) {\n          throw new Error(`webSocketContext not found in addExistingWebsockets`);\n        }\n        webSocketContext.webSocket.send(serializedDiffs);\n      });\n    } else {\n      const documentVirtualDOMElement = this.documentRoot;\n      if (!documentVirtualDOMElement) {\n        throw new Error(`documentVirtualDOMElement not found in getInitialSnapshot`);\n      }\n      for (const connectionId of connectionIds) {\n        const webSocketContext = this.connectionIdToWebSocketContext.get(connectionId);\n        if (!webSocketContext) {\n          throw new Error(`webSocketContext not found in addExistingWebsockets`);\n        }\n        const asServerMessages: Array<ServerMessage> = [\n          this.getInitialSnapshot(connectionId, documentVirtualDOMElement),\n        ];\n        const serializedSnapshotMessage = JSON.stringify(asServerMessages);\n        webSocketContext.webSocket.send(serializedSnapshotMessage);\n      }\n    }\n\n    for (const connectionId of connectionIds) {\n      this.observableDOM.addConnectedUserId(connectionId);\n    }\n  }\n\n  private findParentNodeOfNodeId(targetNodeId: number): StaticVirtualDOMElement | null {\n    const parentNodeId = this.nodeIdToParentNodeId.get(targetNodeId);\n    if (parentNodeId === undefined) {\n      throw new Error(\"Parent node ID not found\");\n    }\n    const node = this.nodeIdToNode.get(parentNodeId);\n    if (!node) {\n      throw new Error(\"Parent node not found:\" + parentNodeId);\n    }\n    return node;\n  }\n\n  private registerWebsocket(\n    webSocket: WebSocket,\n    existingConnectionId: number | null = null,\n  ): { connectionId: number } {\n    let connectionId: number;\n    if (existingConnectionId !== null) {\n      connectionId = existingConnectionId;\n      this.currentConnectionId = Math.max(this.currentConnectionId, connectionId + 1);\n    } else {\n      connectionId = this.currentConnectionId++;\n    }\n    const webSocketContext = {\n      webSocket,\n      messageListener: (messageEvent: MessageEvent) => {\n        const string = String(messageEvent.data);\n        let parsed;\n        try {\n          parsed = JSON.parse(string) as ClientMessage;\n        } catch (e) {\n          console.error(`Error parsing message from websocket: ${string}`, e);\n          console.trace();\n          return;\n        }\n\n        if (NetworkedDOM.IsPongMessage(parsed)) {\n          // Ignore pongs for now\n          return;\n        }\n\n        this.dispatchRemoteEvent(webSocket, parsed);\n      },\n    };\n    this.connectionIdToWebSocketContext.set(connectionId, webSocketContext);\n    this.visibleNodeIdsByConnectionId.set(connectionId, new Set());\n    this.webSocketToConnectionId.set(webSocket, connectionId);\n    webSocket.addEventListener(\"message\", webSocketContext.messageListener);\n    return { connectionId };\n  }\n\n  public static handleWebsocketSubprotocol(protocols: Set<string> | Array<string>): string | false {\n    const protocolsSet = new Set(protocols);\n    // Find highest priority (first in the array) protocol that is supported\n    for (const protocol of NetworkedDOM.SupportedWebsocketSubProtocolsPreferenceOrder) {\n      if (protocolsSet.has(protocol)) {\n        return protocol;\n      }\n    }\n    return false;\n  }\n\n  public addWebSocket(webSocket: WebSocket): void {\n    if (this.initialLoad) {\n      throw new Error(\"addWebSocket called before initial load - unsupported at this time\");\n    }\n    if (this.disposed) {\n      console.error(\"addWebSocket called on disposed NetworkedDOM\");\n      throw new Error(\"This NetworkedDOM has been disposed\");\n    }\n\n    if (webSocket.protocol) {\n      if (\n        NetworkedDOM.SupportedWebsocketSubProtocolsPreferenceOrder.indexOf(webSocket.protocol) ===\n        -1\n      ) {\n        const errorMessageString = `Unsupported websocket subprotocol: ${webSocket.protocol}`;\n        const errorMessage: Array<ServerMessage> = [\n          {\n            type: \"error\",\n            message: errorMessageString,\n          },\n        ];\n        webSocket.send(JSON.stringify(errorMessage));\n        webSocket.close();\n        return;\n      }\n    } else {\n      // TODO - Revisit the default handling of non-protocol websockets. It is easier to debug if a lack of protocol results in an error.\n      // Assume for now that this client is a legacy MML client that doesn't send a protocol, but send a warning to the client to encourage specifying a protocol\n      const warningMessageString = `No websocket subprotocol specified. Please specify a subprotocol to ensure compatibility with networked-dom servers. Assuming subprotocol \"${defaultWebsocketSubProtocol}\" for this connection.`;\n      const warningMessage: Array<ServerMessage> = [\n        {\n          type: \"warning\",\n          message: warningMessageString,\n        },\n      ];\n      webSocket.send(JSON.stringify(warningMessage));\n    }\n\n    const { connectionId } = this.registerWebsocket(webSocket);\n    const documentVirtualDOMElement = this.documentRoot;\n    if (!documentVirtualDOMElement) {\n      throw new Error(`documentVirtualDOMElement not found in getInitialSnapshot`);\n    }\n    const asServerMessages: Array<ServerMessage> = [\n      this.getInitialSnapshot(connectionId, documentVirtualDOMElement),\n    ];\n    const serializedSnapshotMessage = JSON.stringify(asServerMessages);\n    webSocket.send(serializedSnapshotMessage);\n    this.observableDOM.addConnectedUserId(connectionId);\n  }\n\n  public removeWebSocket(webSocket: WebSocket): void {\n    const connectionId = this.webSocketToConnectionId.get(webSocket);\n    if (!connectionId) {\n      return;\n    }\n    this.observableDOM.removeConnectedUserId(connectionId);\n    const webSocketContext = this.connectionIdToWebSocketContext.get(connectionId);\n    if (!webSocketContext) {\n      throw new Error(\"Missing context for websocket\");\n    }\n    webSocket.removeEventListener(\"message\", webSocketContext.messageListener);\n    this.connectionIdToWebSocketContext.delete(connectionId);\n    this.visibleNodeIdsByConnectionId.delete(connectionId);\n    this.webSocketToConnectionId.delete(webSocket);\n  }\n\n  public dispose(): void {\n    this.disposed = true;\n\n    // Handle all of the remaining mutations that the disconnections could have caused\n    this.observableDOM.dispose();\n\n    for (const [webSocket, connectionId] of this.webSocketToConnectionId) {\n      const webSocketContext = this.connectionIdToWebSocketContext.get(connectionId);\n      if (!webSocketContext) {\n        throw new Error(\"Missing context for websocket\");\n      }\n      webSocket.removeEventListener(\"message\", webSocketContext.messageListener);\n      this.connectionIdToWebSocketContext.delete(connectionId);\n      this.visibleNodeIdsByConnectionId.delete(connectionId);\n      this.webSocketToConnectionId.delete(webSocket);\n    }\n  }\n\n  private processModification(mutationRecord: StaticVirtualDOMMutationRecord): void {\n    const documentVirtualDOMElement = this.documentRoot;\n    if (!documentVirtualDOMElement) {\n      throw new Error(`document not created in processModification`);\n    }\n\n    for (const [, visibleNodesForConnection] of this.visibleNodeIdsByConnectionId) {\n      visibleNodesForConnection.add(documentVirtualDOMElement.nodeId);\n    }\n\n    const diffsByConnectionId = new Map<number, Array<Diff>>(\n      Array.from(this.connectionIdToWebSocketContext.keys()).map((connectionId) => [\n        connectionId,\n        [],\n      ]),\n    );\n\n    diffsByConnectionId.forEach((diffs, connectionId) => {\n      const parentNode = this.findParentNodeOfNodeId(mutationRecord.target.nodeId);\n      if (mutationRecord.type === \"attributes\" && !parentNode) {\n        console.error(\"parentNode not found for attribute mutationRecord\", mutationRecord);\n        console.error(\"this.documentRoot\", JSON.stringify(this.documentRoot, null, 2));\n      }\n      const diff = diffFromApplicationOfStaticVirtualDOMMutationRecordToConnection(\n        mutationRecord,\n        parentNode,\n        connectionId,\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        this.visibleNodeIdsByConnectionId.get(connectionId)!,\n      );\n      if (diff) {\n        diffs.push(diff);\n      }\n    });\n\n    diffsByConnectionId.forEach((diffs, connectionId) => {\n      if (diffs.length > 0) {\n        const asServerMessages: Array<ServerMessage> = diffs;\n        const serializedDiffs = JSON.stringify(asServerMessages);\n        const webSocketContext = this.connectionIdToWebSocketContext.get(connectionId);\n        if (!webSocketContext) {\n          throw new Error(`webSocketContext not found in processModificationList`);\n        }\n        webSocketContext.webSocket.send(serializedDiffs);\n      }\n    });\n  }\n\n  private removeKnownNodesInMutation(mutation: StaticVirtualDOMMutationRecord): void {\n    const virtualDOMElement = mutation.target;\n    if (mutation.type === \"childList\") {\n      mutation.removedNodes.forEach((childDOMElement: StaticVirtualDOMElement) => {\n        this.removeVirtualDOMElement(childDOMElement);\n        const index = virtualDOMElement.childNodes.indexOf(childDOMElement);\n        virtualDOMElement.childNodes.splice(index, 1);\n      });\n      return;\n    }\n  }\n\n  private removeVirtualDOMElement(virtualDOMElement: StaticVirtualDOMElement): void {\n    this.nodeIdToNode.delete(virtualDOMElement.nodeId);\n    this.nodeIdToParentNodeId.delete(virtualDOMElement.nodeId);\n    for (const child of virtualDOMElement.childNodes) {\n      this.removeVirtualDOMElement(child);\n    }\n  }\n\n  static IsPongMessage(message: ClientMessage): message is PongMessage {\n    return (message as PongMessage).type === \"pong\";\n  }\n\n  private dispatchRemoteEvent(webSocket: WebSocket, remoteEvent: RemoteEvent): void {\n    if (this.disposed) {\n      console.error(\"Cannot dispatch remote event after dispose\");\n      throw new Error(\"This NetworkedDOM has been disposed\");\n    }\n\n    const connectionId = this.webSocketToConnectionId.get(webSocket);\n    if (!connectionId) {\n      console.error(\"Unknown web socket dispatched event:\", webSocket);\n      return;\n    }\n\n    const visibleNodes = this.visibleNodeIdsByConnectionId.get(connectionId);\n    if (!visibleNodes) {\n      console.error(\"No visible nodes for connection: \" + connectionId);\n      return;\n    }\n\n    if (!visibleNodes.has(remoteEvent.nodeId)) {\n      // TODO - do a pass through the hierarchy to determine if this node should be visible to this connection id to prevent clients submitting events for nodes they can't (currently) see\n      console.error(\"Node not visible for connection: \" + remoteEvent.nodeId);\n      return;\n    }\n\n    const remappedNode = this.clientNodeIdToInternalNodeId.get(remoteEvent.nodeId);\n    if (remappedNode) {\n      remoteEvent.nodeId = remappedNode;\n    }\n\n    this.observableDOM.dispatchRemoteEventFromConnectionId(connectionId, remoteEvent);\n  }\n\n  private getStaticVirtualDOMElementByInternalNodeIdOrThrow(\n    internalNodeId: number,\n  ): StaticVirtualDOMElement {\n    const remappedId = this.internalNodeIdToClientNodeId.get(internalNodeId);\n    if (remappedId !== undefined) {\n      const node = this.nodeIdToNode.get(remappedId);\n      if (!node) {\n        throw new Error(\"Remapped node not found with nodeId \" + remappedId);\n      }\n      return node;\n    }\n    const node = this.nodeIdToNode.get(internalNodeId);\n    if (!node) {\n      throw new Error(\"Node not found with nodeId:\" + internalNodeId);\n    }\n    return node;\n  }\n\n  private addKnownNodesInMutation(\n    mutation: StaticVirtualDOMMutationIdsRecord,\n  ): StaticVirtualDOMMutationRecord {\n    const target = this.getStaticVirtualDOMElementByInternalNodeIdOrThrow(mutation.targetId);\n\n    // TODO - avoid mutation in this conversion - use the attribute pair in the handling (would require changing StaticVirtualDOMMutationRecord.attributeName to be the key/value pair).\n    if (mutation.attribute) {\n      if (mutation.attribute.value !== null) {\n        target.attributes[mutation.attribute.attributeName] = mutation.attribute.value;\n      } else {\n        delete target.attributes[mutation.attribute.attributeName];\n      }\n    }\n\n    const previousSibling = mutation.previousSiblingId\n      ? this.getStaticVirtualDOMElementByInternalNodeIdOrThrow(mutation.previousSiblingId)\n      : null;\n\n    if (mutation.type === \"childList\") {\n      let index = 0;\n      if (previousSibling) {\n        index = target.childNodes.indexOf(previousSibling);\n        if (index === -1) {\n          throw new Error(\"Previous sibling is not currently a child of the parent element\");\n        }\n        index += 1;\n      }\n      mutation.addedNodes.forEach((childVirtualDOMElement: StaticVirtualDOMElement) => {\n        this.addAndRemapNodeFromInstance(childVirtualDOMElement, target.nodeId);\n\n        if (target.childNodes.indexOf(childVirtualDOMElement) === -1) {\n          target.childNodes.splice(index, 0, childVirtualDOMElement);\n          index++;\n        }\n      });\n    } else if (mutation.type === \"attributes\") {\n      // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n      const attributePair = mutation.attribute!;\n      if (attributePair.value === null) {\n        delete target.attributes[attributePair.attributeName];\n      } else {\n        target.attributes[attributePair.attributeName] = attributePair.value;\n      }\n    } else if (mutation.type === \"characterData\") {\n      // TODO - reimplement characterData\n      throw new Error(\"characterData not supported\");\n      // virtualDOMElement.textContent = targetNode.textContent ? targetNode.textContent : undefined;\n    }\n\n    const record: StaticVirtualDOMMutationRecord = {\n      type: mutation.type,\n      target,\n      addedNodes: mutation.addedNodes,\n      removedNodes: mutation.removedNodeIds.map((nodeId) => {\n        return this.getStaticVirtualDOMElementByInternalNodeIdOrThrow(nodeId);\n      }),\n      previousSibling: mutation.previousSiblingId\n        ? this.getStaticVirtualDOMElementByInternalNodeIdOrThrow(mutation.previousSiblingId)\n        : null,\n      attributeName: mutation.attribute ? mutation.attribute.attributeName : null,\n    };\n\n    return record;\n  }\n\n  getSnapshot(): StaticVirtualDOMElement {\n    return this.documentRoot;\n  }\n\n  private addAndRemapNodeFromInstance(node: StaticVirtualDOMElement, parentNodeId: number) {\n    const remappedNodeId = this.internalNodeIdToClientNodeId.get(node.nodeId);\n    if (remappedNodeId !== undefined) {\n      node.nodeId = remappedNodeId;\n    } else {\n      // This id might already refer to a node in this client's view. If so, we need to remap it to a new id.\n      const existingClientReference = this.clientNodeIdToInternalNodeId.get(node.nodeId);\n      if (existingClientReference) {\n        const newNodeId = ++this.maximumNodeId;\n        this.addRemappedNodeId(newNodeId, node.nodeId);\n        node.nodeId = newNodeId;\n      }\n    }\n\n    if (this.nodeIdToNode.has(node.nodeId)) {\n      throw new Error(\"Node already exists with id \" + node.nodeId);\n    }\n\n    this.nodeIdToNode.set(node.nodeId, node);\n    this.nodeIdToParentNodeId.set(node.nodeId, parentNodeId);\n    this.maximumNodeId = Math.max(this.maximumNodeId, node.nodeId);\n\n    for (const childNode of node.childNodes) {\n      this.addAndRemapNodeFromInstance(childNode, node.nodeId);\n    }\n  }\n\n  public getWebsocketConnectionIdMap() {\n    // return a clone of the map\n    return new Map(this.webSocketToConnectionId);\n  }\n}\n", "import { LogMessage, StaticVirtualDOMElement } from \"@mml-io/observable-dom-common\";\n\nimport { VirtualDOMDiffStruct } from \"./common\";\nimport { NetworkedDOM, ObservableDOMFactory } from \"./NetworkedDOM\";\n\ntype LoadedState = {\n  htmlContents: string;\n  networkedDOM: NetworkedDOM;\n  loaded: boolean;\n};\n\n/**\n * EditableNetworkedDOM wraps NetworkedDOM instances and presents them as a single document that can iterate through\n * revisions by being loaded multiple times with different contents. The connected clients receive deltas between the\n * revisions rather than a complete refresh.\n */\nexport class EditableNetworkedDOM {\n  private htmlPath: string;\n  private params: object = {};\n\n  private websockets = new Set<WebSocket>();\n  private loadedState: LoadedState | null = null;\n\n  private observableDOMFactory: ObservableDOMFactory;\n  private ignoreTextNodes: boolean;\n\n  private logCallback?: (message: LogMessage) => void;\n\n  constructor(\n    htmlPath: string,\n    observableDOMFactory: ObservableDOMFactory,\n    ignoreTextNodes = true,\n    logCallback?: (message: LogMessage) => void,\n  ) {\n    this.htmlPath = htmlPath;\n    this.observableDOMFactory = observableDOMFactory;\n    this.ignoreTextNodes = ignoreTextNodes;\n    this.logCallback = logCallback;\n  }\n\n  public isLoaded() {\n    return this.loadedState !== null;\n  }\n\n  public load(htmlContents: string, params?: object) {\n    if (params !== undefined) {\n      this.params = params;\n    }\n\n    let oldInstanceRoot: StaticVirtualDOMElement | null = null;\n    let existingWebsocketMap: Map<WebSocket, number> | null = null;\n    if (this.loadedState) {\n      const oldInstance = this.loadedState.networkedDOM;\n      existingWebsocketMap = oldInstance.getWebsocketConnectionIdMap();\n      oldInstance.dispose();\n      oldInstanceRoot = oldInstance.getSnapshot();\n    }\n    this.loadedState = null;\n\n    let didLoad = false;\n    const networkedDOM = new NetworkedDOM(\n      this.observableDOMFactory,\n      this.htmlPath,\n      htmlContents,\n      oldInstanceRoot,\n      (domDiff: VirtualDOMDiffStruct | null, networkedDOM: NetworkedDOM) => {\n        didLoad = true;\n        if (this.loadedState) {\n          this.loadedState.loaded = true;\n        }\n        networkedDOM.addExistingWebsockets(\n          Array.from(this.websockets),\n          existingWebsocketMap,\n          domDiff,\n        );\n      },\n      this.params,\n      this.ignoreTextNodes,\n      this.logCallback,\n    );\n    this.loadedState = {\n      htmlContents,\n      networkedDOM,\n      loaded: didLoad,\n    };\n  }\n\n  public reload() {\n    if (this.loadedState) {\n      this.load(this.loadedState.htmlContents, this.params);\n    } else {\n      console.warn(\"EditableNetworkedDOM.reload called whilst not loaded\");\n    }\n  }\n\n  public dispose() {\n    for (const ws of this.websockets) {\n      ws.close();\n    }\n    this.websockets.clear();\n    if (this.loadedState) {\n      this.loadedState.networkedDOM.dispose();\n    }\n    this.loadedState = null;\n  }\n\n  public addWebSocket(webSocket: WebSocket) {\n    this.websockets.add(webSocket);\n    if (this.loadedState && this.loadedState.loaded) {\n      this.loadedState.networkedDOM.addWebSocket(webSocket);\n    }\n  }\n\n  public removeWebSocket(webSocket: WebSocket) {\n    this.websockets.delete(webSocket);\n    if (this.loadedState && this.loadedState.loaded) {\n      this.loadedState.networkedDOM.removeWebSocket(webSocket);\n    }\n  }\n}\n"],
+  "mappings": ";AAAO,SAAS,UAAU,GAAQ,GAAiB;AACjD,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG;AACxC,QAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,aAAO;AAAA,IACT;AAEA,WAAO,EAAE,MAAM,CAAC,MAAM,UAAU;AAC9B,aAAO,UAAU,MAAM,EAAE,KAAK,CAAC;AAAA,IACjC,CAAC;AAAA,EACH;AAEA,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,YAAY,MAAM,QAAQ,MAAM,MAAM;AAC9E,QAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG;AACxC,aAAO;AAAA,IACT;AAEA,UAAM,QAAQ,OAAO,KAAK,CAAC;AAC3B,UAAM,QAAQ,OAAO,KAAK,CAAC;AAC3B,QAAI,MAAM,WAAW,MAAM,UAAU,CAAC,MAAM,MAAM,CAAC,QAAQ,MAAM,SAAS,GAAG,CAAC,GAAG;AAC/E,aAAO;AAAA,IACT;AAEA,eAAW,OAAO,GAAG;AACnB,UAAI,CAAC,UAAU,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG;AAC9B,eAAO;AAAA,MACT;AAAA,IACF;AAEA,QAAI,MAAM,WAAW,KAAK,aAAa,QAAQ,aAAa,MAAM;AAEhE,aAAO,EAAE,QAAQ,MAAM,EAAE,QAAQ;AAAA,IACnC;AAEA,WAAO;AAAA,EACT;AACA,SAAO;AACT;;;ACpBA,SAAS,SAAS,OAAuB;AACvC,SAAO,MAAM,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG;AACrD;AAUA,SAAS,OAAO,OAAuB;AACrC,SAAO,MAAM,QAAQ,MAAM,IAAI,EAAE,QAAQ,OAAO,IAAI;AACtD;AAWO,IAAM,UAAN,MAAM,SAAQ;AAAA,EACnB,YAAmB,SAAS,CAAC,EAAE,GAAG;AAAf;AAAA,EAAgB;AAAA;AAAA;AAAA;AAAA,EAInC,OAAO,SAAS,MAAuB;AACrC,UAAM,SAAS,KAAK,MAAM,GAAG,EAAE,IAAI,QAAQ;AAC3C,QAAI,OAAO,CAAC,MAAM,GAAI,OAAM,IAAI,MAAM,yBAAyB,IAAI,EAAE;AACrE,WAAO,IAAI,SAAQ,MAAM;AAAA,EAC3B;AAAA,EACA,WAAmB;AACjB,WAAO,KAAK,OAAO,IAAI,MAAM,EAAE,KAAK,GAAG;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,QAAgC;AACvC,QAAI,SAAc;AAClB,QAAI,MAAM;AACV,QAAI,QAAQ;AACZ,aAAS,IAAI,GAAG,IAAI,KAAK,OAAO,QAAQ,IAAI,GAAG,KAAK;AAClD,eAAS;AACT,YAAM,KAAK,OAAO,CAAC;AACnB,UAAI,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ,aAAa;AACvE;AAAA,MACF;AAEA,eAAS,UAAU,CAAC,GAAG,GAAG;AAAA,IAC5B;AACA,WAAO,EAAE,QAAQ,KAAK,MAAM;AAAA,EAC9B;AAAA,EACA,IAAI,QAAkB;AACpB,WAAO,KAAK,SAAS,MAAM,EAAE;AAAA,EAC/B;AAAA,EACA,IAAI,QAAa,OAAkB;AACjC,QAAI,SAAc;AAClB,aAAS,IAAI,GAAG,IAAI,KAAK,OAAO,SAAS,GAAG,QAAQ,KAAK,OAAO,CAAC,GAAG,IAAI,GAAG,KAAK;AAE9E,gBAAU,UAAU,CAAC,GAAG,KAAK;AAAA,IAC/B;AACA,QAAI,QAAQ;AACV,aAAO,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC,CAAC,IAAI;AAAA,IAChD;AAAA,EACF;AAAA,EACA,KAAK,OAAqB;AAExB,SAAK,OAAO,KAAK,KAAK;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAI,OAAwB;AAC1B,UAAM,SAAS,KAAK,OAAO,OAAO,OAAO,KAAK,CAAC;AAC/C,WAAO,IAAI,SAAQ,MAAM;AAAA,EAC3B;AACF;;;ACzGO,IAAM,iBAAiB,OAAO,UAAU;AAExC,SAAS,WAAW,QAAa;AACtC,MAAI,WAAW,QAAW;AACxB,WAAO;AAAA,EACT;AACA,MAAI,WAAW,MAAM;AACnB,WAAO;AAAA,EACT;AACA,MAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,WAAO;AAAA,EACT;AACA,SAAO,OAAO;AAChB;AAEA,SAAS,eAAe,OAA6B;AAGnD,SAAO,SAAS,QAAQ,OAAO,UAAU;AAC3C;AASO,SAAS,MAAS,QAAc;AACrC,MAAI,CAAC,eAAe,MAAM,GAAG;AAE3B,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,MAAM,GAAG;AAEzB,UAAM,SAAU,OAAsB;AAEtC,UAAM,cAAmB,IAAI,MAAM,MAAM;AACzC,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,kBAAY,CAAC,IAAI,MAAM,OAAO,CAAC,CAAC;AAAA,IAClC;AACA,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,gBAAgB,MAAM;AAC/B,UAAM,aAAkB,oBAAI,KAAK,CAAC,MAAM;AACxC,WAAO;AAAA,EACT;AAEA,QAAM,eAAoB,CAAC;AAE3B,aAAW,OAAO,QAAQ;AAGxB,QAAI,eAAe,KAAK,QAAQ,GAAG,GAAG;AACpC,mBAAa,GAAG,IAAI,MAAM,OAAO,GAAG,CAAC;AAAA,IACvC;AAAA,EACF;AACA,SAAO;AACT;;;ACiBA,SAAS,iBAAiB,MAA0B;AAClD,WAAS,YAAY,OAAY,QAAa,KAA2B;AACvE,UAAM,eAAe,KAAK,OAAO,QAAQ,GAAG;AAE5C,WAAO,MAAM,QAAQ,YAAY,IAAI,eAAe,QAAQ,OAAO,QAAQ,KAAK,WAAW;AAAA,EAC7F;AACA,SAAO;AACT;AAiDO,SAAS,YAAY,OAAY,QAAa,MAAkC;AACrF,QAAM,MAAM,IAAI,QAAQ;AAExB,UAAQ,OAAO,iBAAiB,IAAI,IAAI,SAAS,OAAO,QAAQ,GAAG;AACrE;AAaO,SAAS,SACd,SACA,YACU;AAEV,QAAM,MAAmC,CAAC;AAE1C,aAAW,WAAW,SAAS;AAC7B,QAAI,eAAe,KAAK,SAAS,OAAO,KAAK,QAAQ,OAAO,MAAM,QAAW;AAC3E,UAAI,OAAO,IAAI;AAAA,IACjB;AAAA,EACF;AAGA,aAAW,WAAW,YAAY;AAChC,QAAI,eAAe,KAAK,YAAY,OAAO,KAAK,WAAW,OAAO,MAAM,QAAW;AACjF,aAAO,IAAI,OAAO;AAAA,IACpB;AAAA,EACF;AAEA,SAAO,OAAO,KAAK,GAAG;AACxB;AAUO,SAAS,aAAa,SAAwD;AACnF,QAAM,SAAS,QAAQ;AAEvB,QAAM,UAAuC,CAAC;AAE9C,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAM,SAAS,QAAQ,CAAC;AACxB,eAAW,OAAO,QAAQ;AACxB,UAAI,eAAe,KAAK,QAAQ,GAAG,KAAK,OAAO,GAAG,MAAM,QAAW;AACjE,gBAAQ,GAAG,KAAK,QAAQ,GAAG,KAAK,KAAK;AAAA,MACvC;AAAA,IACF;AAAA,EACF;AAEA,aAAW,OAAO,SAAS;AACzB,QAAI,QAAQ,GAAG,IAAI,QAAQ;AACzB,aAAO,QAAQ,GAAG;AAAA,IACpB;AAAA,EACF;AAEA,SAAO,OAAO,KAAK,OAAO;AAC5B;AAqBA,SAAS,WAAW,iBAA8D;AAChF,SAAO,gBAAgB,OAAO;AAChC;AACA,SAAS,cAAc,iBAAiE;AACtF,SAAO,gBAAgB,OAAO;AAChC;AAcA,SAAS,gBAAgB,MAAwC,GAAW,GAAW;AACrF,MAAI,WAA+B,KAAK,CAAC,EAAE,CAAC;AAC5C,MAAI,CAAC,UAAU;AACb,UAAM,IAAI,MAAM,cAAc;AAAA,EAChC;AACA,QAAM,aAA+B,CAAC;AACtC,SAAO,YAAY,SAAS,QAAQ,SAAS,WAAW;AACtD,eAAW,KAAK,SAAS,SAAS;AAClC,UAAM,QAAQ,SAAS,KAAK,MAAM,GAAG;AACrC,eAAW,KAAK,OAAO,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,MAAM,CAAC,CAAC,CAAC;AAAA,EACpD;AACA,SAAO,WAAW,QAAQ;AAC5B;AA8BO,SAAS,WACd,OACA,QACA,KACA,OAAa,SACA;AACb,MAAI,SAAS,QAAQ;AACnB,WAAO;AAAA,EACT;AAEA,QAAM,eAAe,MAAM,MAAM,MAAM,KAAK,MAAM,UAAU,IAAI,IAAI,MAAM;AAC1E,QAAM,gBAAgB,MAAM,OAAO,MAAM,KAAK,OAAO,UAAU,IAAI,IAAI,OAAO;AAC9E,MAAI,YAAY;AAChB,MAAI,aAAa;AACjB,SAAO,YAAY,KAAK,aAAa,GAAG;AAEtC,QAAI,UAAU,MAAM,YAAY,CAAC,GAAG,OAAO,aAAa,CAAC,CAAC,GAAG;AAC3D;AACA;AAAA,IACF,OAAO;AACL;AAAA,IACF;AAAA,EACF;AACA,QAAM,OAAyC,IAAI,MAAM,YAAY,CAAC;AACtE,WAAS,IAAI,GAAG,KAAK,WAAW,KAAK;AACnC,SAAK,CAAC,IAAI,IAAI,MAAM,aAAa,CAAC;AAAA,EACpC;AACA,OAAK,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,MAAM,WAAW,MAAM,MAAM,EAAE;AAapD,WAAS,IAAI,GAAG,KAAK,WAAW,KAAK;AACnC,aAAS,IAAI,GAAG,KAAK,YAAY,KAAK;AACpC,UAAI,WAAW,KAAK,CAAC,EAAE,CAAC;AACxB,UAAI,SAAU;AACd,YAAM,eAAe,GAAG,CAAC,IAAI,IAAI,CAAC;AAClC,YAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC;AACrC,YAAM,mBAAmB,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC;AAC1C,YAAM,mBAAgC;AAAA,QACpC,IAAI;AAAA,QACJ,OAAO,IAAI;AAAA,MACb;AACA,YAAM,gBAA0B;AAAA,QAC9B,IAAI;AAAA,QACJ,OAAO,IAAI;AAAA,QACX,OAAO,OAAO,IAAI,CAAC;AAAA,MACrB;AAEA,UAAI,MAAM,GAAG;AACX,mBAAW;AAAA,UACT,MAAM;AAAA,UACN,WAAW;AAAA,UACX,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,EAAE,OAAO;AAAA,QAC9B;AAAA,MACF,WAAW,MAAM,GAAG;AAClB,mBAAW,EAAE,MAAM,cAAc,WAAW,eAAe,MAAM,KAAK,CAAC,EAAE,IAAI,CAAC,EAAE,OAAO,EAAE;AAAA,MAC3F,OAAO;AACL,YAAI,UAAU,MAAM,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,GAAG;AAC1C,qBAAW,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC;AAAA,QAC9B,OAAO;AACL,gBAAM,cAAc,KAAK,IAAI,CAAC,EAAE,CAAC;AACjC,gBAAM,WAAW,KAAK,CAAC,EAAE,IAAI,CAAC;AAC9B,gBAAM,eAAe,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC;AACtC,gBAAM,WAAW,KAAK,IAAI,aAAa,MAAM,SAAS,MAAM,YAAY,IAAI;AAC5E,cAAI,YAAY,SAAS,UAAU;AACjC,uBAAW;AAAA,cACT,MAAM;AAAA,cACN,WAAW;AAAA,cACX,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,EAAE,OAAO;AAAA,YAC9B;AAAA,UACF,WAAW,SAAS,SAAS,UAAU;AACrC,uBAAW;AAAA,cACT,MAAM;AAAA,cACN,WAAW;AAAA,cACX,MAAM,KAAK,CAAC,EAAE,IAAI,CAAC,EAAE,OAAO;AAAA,YAC9B;AAAA,UACF,OAAO;AACL,kBAAM,oBAAkC;AAAA,cACtC,IAAI;AAAA,cACJ,OAAO,IAAI;AAAA,cACX,UAAU,MAAM,IAAI,CAAC;AAAA,cACrB,OAAO,OAAO,IAAI,CAAC;AAAA,YACrB;AACA,uBAAW;AAAA,cACT,MAAM;AAAA,cACN,WAAW;AAAA,cACX,MAAM,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,OAAO;AAAA,YAClC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,WAAK,CAAC,EAAE,CAAC,IAAI;AAAA,IACf;AAAA,EACF;AACA,QAAM,mBAAmB,gBAAgB,MAAM,WAAW,UAAU;AACpE,QAAM,CAAC,iBAAiB,IAAI,iBAAiB;AAAA,IAC3C,CAAC,CAAC,YAAY,OAAO,GAAG,oBAAoB;AAC1C,UAAI,WAAW,eAAe,GAAG;AAC/B,cAAM,eAAe,gBAAgB,QAAQ,IAAI;AACjD,cAAM,cAAc,eAAe,eAAe,UAAU,OAAO,YAAY,IAAI;AACnF,cAAM,YAAY;AAAA,UAChB,IAAI,gBAAgB;AAAA,UACpB,MAAM,IAAI,IAAI,WAAW,EAAE,SAAS;AAAA,UACpC,OAAO,gBAAgB;AAAA,QACzB;AAEA,eAAO,CAAC,WAAW,OAAO,SAAS,GAAG,UAAU,CAAC;AAAA,MACnD,WAAW,cAAc,eAAe,GAAG;AACzC,cAAM,YAAY;AAAA,UAChB,IAAI,gBAAgB;AAAA,UACpB,MAAM,IAAI,IAAI,OAAO,gBAAgB,QAAQ,OAAO,CAAC,EAAE,SAAS;AAAA,QAClE;AAEA,eAAO,CAAC,WAAW,OAAO,SAAS,GAAG,UAAU,CAAC;AAAA,MACnD,OAAO;AAEL,cAAM,cAAc,IAAI,IAAI,OAAO,gBAAgB,QAAQ,OAAO,CAAC;AACnE,cAAM,qBAAqB;AAAA,UACzB,gBAAgB;AAAA,UAChB,gBAAgB;AAAA,UAChB;AAAA,QACF;AACA,eAAO,CAAC,WAAW,OAAO,GAAG,kBAAkB,GAAG,OAAO;AAAA,MAC3D;AAAA,IACF;AAAA,IACA,CAAC,CAAC,GAAG,CAAC;AAAA,EACR;AACA,SAAO;AACT;AAEO,SAAS,YACd,OACA,QACA,KACA,OAAa,SACA;AAEb,QAAM,aAA0B,CAAC;AACjC,WAAS,OAAO,MAAM,EAAE,QAAQ,CAAC,QAAQ;AACvC,eAAW,KAAK,EAAE,IAAI,UAAU,MAAM,IAAI,IAAI,GAAG,EAAE,SAAS,EAAE,CAAC;AAAA,EACjE,CAAC;AAED,WAAS,QAAQ,KAAK,EAAE,QAAQ,CAAC,QAAQ;AACvC,eAAW,KAAK,EAAE,IAAI,OAAO,MAAM,IAAI,IAAI,GAAG,EAAE,SAAS,GAAG,OAAO,OAAO,GAAG,EAAE,CAAC;AAAA,EAClF,CAAC;AAED,eAAa,CAAC,OAAO,MAAM,CAAC,EAAE,QAAQ,CAAC,QAAQ;AAC7C,eAAW,KAAK,GAAG,KAAK,MAAM,GAAG,GAAG,OAAO,GAAG,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC;AAAA,EAChE,CAAC;AACD,SAAO;AACT;AAyBO,SAAS,QAAQ,OAAY,QAAa,KAAc,OAAa,SAAsB;AAEhG,MAAI,UAAU,QAAQ;AACpB,WAAO,CAAC;AAAA,EACV;AACA,QAAM,aAAa,WAAW,KAAK;AACnC,QAAM,cAAc,WAAW,MAAM;AACrC,MAAI,eAAe,WAAW,gBAAgB,SAAS;AACrD,WAAO,WAAW,OAAO,QAAQ,KAAK,IAAI;AAAA,EAC5C;AACA,MAAI,eAAe,YAAY,gBAAgB,UAAU;AACvD,WAAO,YAAY,OAAO,QAAQ,KAAK,IAAI;AAAA,EAC7C;AAKA,SAAO,CAAC,EAAE,IAAI,WAAW,MAAM,IAAI,SAAS,GAAG,OAAO,OAAO,CAAC;AAChE;;;ACzdO,IAAM,eAAN,cAA2B,MAAM;AAAA,EACtC,YAAmB,MAAc;AAC/B,UAAM,2BAA2B,IAAI,EAAE;AADtB;AAEjB,SAAK,OAAO;AAAA,EACd;AACF;AAEO,IAAM,YAAN,cAAwB,MAAM;AAAA,EACnC,YACS,QACA,UACP;AACA,UAAM,gBAAgB,MAAM,OAAO,QAAQ,EAAE;AAHtC;AACA;AAGP,SAAK,OAAO;AAAA,EACd;AACF;AAkBO,SAAS,WAAW,QAAa,OAAoB;AAC1D,SAAO,MAAM,IAAI,CAAC,cAAc,MAAM,QAAQ,SAAS,CAAC;AAC1D;AAEA,SAAS,KAAK,QAAa,KAAa,OAAkB;AACxD,MAAI,MAAM,QAAQ,MAAM,GAAG;AAEzB,QAAI,QAAQ,KAAK;AACf,aAAO,KAAK,KAAK;AAAA,IACnB,OAAO;AACL,YAAM,QAAQ,SAAS,KAAK,EAAE;AAC9B,aAAO,OAAO,OAAO,GAAG,KAAK;AAAA,IAC/B;AAAA,EACF,OAAO;AACL,WAAO,GAAG,IAAI;AAAA,EAChB;AACF;AAEA,SAAS,QAAQ,QAAa,KAAmB;AAC/C,MAAI,MAAM,QAAQ,MAAM,GAAG;AAEzB,UAAM,QAAQ,SAAS,KAAK,EAAE;AAC9B,WAAO,OAAO,OAAO,CAAC;AAAA,EACxB,OAAO;AAEL,WAAO,OAAO,GAAG;AAAA,EACnB;AACF;AAUO,SAAS,IAAI,QAAa,WAA8C;AAC7E,QAAM,WAAW,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AAEjE,MAAI,SAAS,WAAW,QAAW;AACjC,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AACA,OAAK,SAAS,QAAQ,SAAS,KAAK,MAAM,UAAU,KAAK,CAAC;AAC1D,SAAO;AACT;AAMO,SAAS,OAAO,QAAa,WAAiD;AAEnF,QAAM,WAAW,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AACjE,MAAI,SAAS,UAAU,QAAW;AAChC,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AAEA,UAAQ,SAAS,QAAQ,SAAS,GAAG;AACrC,SAAO;AACT;AAcO,SAAS,QAAQ,QAAa,WAAkD;AACrF,QAAM,WAAW,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AACjE,MAAI,SAAS,WAAW,MAAM;AAC5B,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AAEA,MAAI,MAAM,QAAQ,SAAS,MAAM,GAAG;AAClC,QAAI,SAAS,SAAS,KAAK,EAAE,KAAK,SAAS,OAAO,QAAQ;AACxD,aAAO,IAAI,aAAa,UAAU,IAAI;AAAA,IACxC;AAAA,EACF,WAAW,SAAS,UAAU,QAAW;AACvC,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AACA,WAAS,OAAO,SAAS,GAAG,IAAI,UAAU;AAC1C,SAAO;AACT;AAiBO,SAAS,KAAK,QAAa,WAA+C;AAC/E,QAAM,gBAAgB,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AACtE,MAAI,cAAc,UAAU,QAAW;AACrC,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AACA,QAAM,WAAW,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AACjE,MAAI,SAAS,WAAW,QAAW;AACjC,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AACA,UAAQ,cAAc,QAAQ,cAAc,GAAG;AAC/C,OAAK,SAAS,QAAQ,SAAS,KAAK,cAAc,KAAK;AACvD,SAAO;AACT;AAeO,SAAS,KAAK,QAAa,WAA+C;AAC/E,QAAM,gBAAgB,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AACtE,MAAI,cAAc,UAAU,QAAW;AACrC,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AACA,QAAM,WAAW,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AACjE,MAAI,SAAS,WAAW,QAAW;AACjC,WAAO,IAAI,aAAa,UAAU,IAAI;AAAA,EACxC;AACA,OAAK,SAAS,QAAQ,SAAS,KAAK,MAAM,cAAc,KAAK,CAAC;AAC9D,SAAO;AACT;AAUO,SAAS,KAAK,QAAa,WAA4C;AAC5E,QAAM,WAAW,QAAQ,SAAS,UAAU,IAAI,EAAE,SAAS,MAAM;AAEjE,MAAI,QAAQ,SAAS,OAAO,UAAU,OAAO,IAAI,QAAQ,CAAC,EAAE,QAAQ;AAClE,WAAO,IAAI,UAAU,SAAS,OAAO,UAAU,KAAK;AAAA,EACtD;AACA,SAAO;AACT;AAEO,IAAM,wBAAN,cAAoC,MAAM;AAAA,EAC/C,YAAmB,WAAsB;AACvC,UAAM,sBAAsB,UAAU,EAAE,EAAE;AADzB;AAEjB,SAAK,OAAO;AAAA,EACd;AACF;AAMO,SAAS,MACd,QACA,WACyD;AAIzD,UAAQ,UAAU,IAAI;AAAA,IACpB,KAAK;AACH,aAAO,IAAI,QAAQ,SAAS;AAAA,IAC9B,KAAK;AACH,aAAO,OAAO,QAAQ,SAAS;AAAA,IACjC,KAAK;AACH,aAAO,QAAQ,QAAQ,SAAS;AAAA,IAClC,KAAK;AACH,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B,KAAK;AACH,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B,KAAK;AACH,aAAO,KAAK,QAAQ,SAAS;AAAA,EACjC;AACA,SAAO,IAAI,sBAAsB,SAAS;AAC5C;;;ACnOO,IAAM,oBAAoB;AAC1B,IAAM,qBAAqB;AAQ3B,SAAS,gEACd,UACA,YACA,cACA,2BACa;AACb,QAAM,oBAAoB,SAAS;AAEnC,UAAQ,SAAS,MAAM;AAAA,IACrB,KAAK,YAAY;AACf,YAAM,kBAAkB;AAAA,QACtB;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,UAAI,CAAC,iBAAiB;AACpB,eAAO;AAAA,MACT;AACA,YAAM,OAAwB;AAAA,QAC5B,MAAM;AAAA,QACN,UAAU;AAAA,QACV,cAAc;AAAA,MAChB;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK,cAAc;AACjB,YAAM,UAAU,0BAA0B,IAAI,kBAAkB,MAAM;AAEtE,UAAI,CAAC,YAAY;AACf,cAAM,IAAI,MAAM,oBAAoB;AAAA,MACtC;AACA,YAAM,eAAe,WAAW;AAChC,YAAM,kBACJ,6BAA6B,mBAAmB,YAAY,KAC5D,0BAA0B,IAAI,YAAY;AAG5C,YAAM,gBAAgB,SAAS;AAE/B,UAAI,WAAW,iBAAiB;AAC9B,YAAI,WAAW;AACf,YAAI,kBAAkB,WAAW,aAAa,MAAM,QAAW;AAC7D,qBAAW,kBAAkB,WAAW,aAAa;AAAA,QACvD;AACA,cAAM,OAA6B;AAAA,UACjC,MAAM;AAAA,UACN,QAAQ,kBAAkB;AAAA,UAC1B,WAAW;AAAA,UACX;AAAA,QACF;AACA,eAAO;AAAA,MACT,WAAW,CAAC,WAAW,iBAAiB;AAEtC,kCAA0B,IAAI,kBAAkB,MAAM;AAEtD,cAAM,QAAQ,WAAW,WAAW,QAAQ,iBAAiB;AAC7D,YAAI,UAAU,IAAI;AAChB,gBAAM,IAAI,MAAM,qCAAqC;AAAA,QACvD;AAEA,YAAI,iBAAiB;AACrB,YAAI,QAAQ,GAAG;AACb,2BAAiB;AAAA,YACf;AAAA,YACA,QAAQ;AAAA,YACR;AAAA,UACF;AAAA,QACF;AAEA,cAAM,kBAAkB;AAAA,UACtB;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,YAAI,CAAC,iBAAiB;AACpB,gBAAM,IAAI,MAAM,4BAA4B;AAAA,QAC9C;AACA,cAAM,OAA4B;AAAA,UAChC,MAAM;AAAA,UACN,QAAQ;AAAA,UACR;AAAA,UACA,YAAY,CAAC,eAAe;AAAA,UAC5B,cAAc,CAAC;AAAA,QACjB;AACA,eAAO;AAAA,MACT,WAAW,WAAW,CAAC,iBAAiB;AACtC,8CAAsC,mBAAmB,yBAAyB;AAClF,cAAM,OAA4B;AAAA,UAChC,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,gBAAgB;AAAA,UAChB,YAAY,CAAC;AAAA,UACb,cAAc,CAAC,kBAAkB,MAAM;AAAA,QACzC;AACA,eAAO;AAAA,MACT,WAAW,CAAC,WAAW,CAAC,iBAAiB;AACvC,eAAO;AAAA,MACT;AACA;AAAA,IACF;AAAA,IACA,KAAK,iBAAiB;AACpB,YAAM,UAAU,0BAA0B,IAAI,kBAAkB,MAAM;AACtE,UAAI,CAAC,SAAS;AACZ,eAAO;AAAA,MACT;AACA,YAAM,OAAwB;AAAA,QAC5B,MAAM;AAAA,QACN,QAAQ,kBAAkB;AAAA,QAC1B,MAAM,kBAAkB,eAAe;AAAA,MACzC;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK,aAAa;AAChB,YAAM,UAAU,0BAA0B,IAAI,kBAAkB,MAAM;AACtE,UAAI,CAAC,SAAS;AACZ,eAAO;AAAA,MACT;AACA,UAAI,kBAAkB,SAAS;AAC/B,UAAI,iBAAgC;AACpC,UAAI,iBAAiB;AACnB,YAAI,gBAAgB,kBAAkB,WAAW,QAAQ,eAAe;AACxE,eAAO,kBAAkB,IAAI;AAC3B,4BAAkB,kBAAkB,WAAW,aAAa;AAC5D,cAAI,0BAA0B,IAAI,gBAAgB,MAAM,GAAG;AACzD,6BAAiB,gBAAgB;AACjC;AAAA,UACF;AACA;AAAA,QACF;AAAA,MACF;AAEA,YAAM,OAA4B;AAAA,QAChC,MAAM;AAAA,QACN,QAAQ,kBAAkB;AAAA,QAC1B;AAAA,QACA,YAAY,CAAC;AAAA,QACb,cAAc,CAAC;AAAA,MACjB;AAEA,eAAS,WAAW,QAAQ,CAAC,2BAAoD;AAC/E,cAAM,gBAAgB;AAAA,UACpB;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,YAAI,CAAC,eAAe;AAClB;AAAA,QACF;AACA,aAAK,WAAW,KAAK,aAAa;AAAA,MACpC,CAAC;AACD,eAAS,aAAa,QAAQ,CAAC,2BAAoD;AACjF,YAAI,0BAA0B,IAAI,uBAAuB,MAAM,GAAG;AAChE,gDAAsC,wBAAwB,yBAAyB;AACvF,eAAK,aAAa,KAAK,uBAAuB,MAAM;AAAA,QACtD;AAAA,MACF,CAAC;AAED,UAAI,KAAK,WAAW,SAAS,KAAK,KAAK,aAAa,SAAS,GAAG;AAC9D,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAAA,IACA;AACE,cAAQ,MAAM,4BAA4B,SAAS,IAAI;AACvD;AAAA,EACJ;AACA,SAAO;AACT;AAEA,SAAS,kCACP,sBACA,gBACA,2BACe;AACf,MAAI,iBAAiB,GAAG;AACtB,QAAI,uBAAuB;AAC3B,WAAO,wBAAwB,GAAG;AAChC,YAAM,kBAAkB,qBAAqB,WAAW,oBAAoB;AAC5E,UAAI,0BAA0B,IAAI,gBAAgB,MAAM,GAAG;AACzD,eAAO,gBAAgB;AAAA,MACzB;AACA;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,6BACP,mBACA,cACS;AACT,QAAM,gBAAgB,kBAAkB,WAAW,iBAAiB;AACpE,QAAM,iBAAiB,kBAAkB,WAAW,kBAAkB;AACtE,QAAM,qBAAqB,aAAa,SAAS;AACjD,MAAI,kBAAkB,QAAW;AAC/B,UAAM,gBAAgB,cAAc,MAAM,GAAG;AAC7C,UAAM,mBAAmB,cAAc,SAAS,kBAAkB;AAClE,QAAI,CAAC,kBAAkB;AACrB,aAAO;AAAA,IACT;AAAA,EACF;AACA,MAAI,mBAAmB,QAAW;AAChC,UAAM,iBAAiB,eAAe,MAAM,GAAG;AAC/C,UAAM,kBAAkB,eAAe,SAAS,kBAAkB;AAClE,QAAI,iBAAiB;AACnB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,wCACd,mBACA,cACA,2BACwB;AACxB,MAAI,CAAC,6BAA6B,mBAAmB,YAAY,GAAG;AAClE,WAAO;AAAA,EACT;AAEA,MAAI,iBAAiB,kBAAkB;AACvC,MAAI,mBAAmB,aAAa;AAClC,qBAAiB;AAAA,EACnB;AACA,MAAI,mBAAmB,SAAS;AAC9B,UAAM,WAAgC;AAAA,MACpC,MAAM;AAAA,MACN,QAAQ,kBAAkB;AAAA,MAC1B,MAAM,kBAAkB,eAAe;AAAA,IACzC;AACA,8BAA0B,IAAI,SAAS,MAAM;AAC7C,WAAO;AAAA,EACT,OAAO;AACL,UAAM,OAA+B;AAAA,MACnC,MAAM;AAAA,MACN,QAAQ,kBAAkB;AAAA,MAC1B,KAAK;AAAA,MACL,YAAY,kBAAkB;AAAA,MAC9B,UAAU,CAAC;AAAA,MACX,MAAM,kBAAkB;AAAA,IAC1B;AACA,8BAA0B,IAAI,KAAK,MAAM;AAEzC,eAAW,SAAS,kBAAkB,YAAY;AAChD,YAAM,uBAAuB;AAAA,QAC3B;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,UAAI,sBAAsB;AACxB,aAAK,SAAS,KAAK,oBAAoB;AAAA,MACzC;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;AAEA,SAAS,sCACP,mBACA,2BACM;AACN,4BAA0B,OAAO,kBAAkB,MAAM;AACzD,aAAW,SAAS,kBAAkB,YAAY;AAChD,QAAI,CAAC,0BAA0B,IAAI,MAAM,MAAM,GAAG;AAChD,cAAQ,MAAM,kDAAkD,MAAM,MAAM;AAAA,IAC9E;AACA,0CAAsC,OAAO,yBAAyB;AAAA,EACxE;AACF;AAEO,SAAS,uBACd,mBACA,cACgC;AAGhC,aAAW,SAAS,kBAAkB,YAAY;AAChD,QAAI,MAAM,WAAW,cAAc;AACjC,aAAO;AAAA,IACT,OAAO;AACL,YAAM,gBAAgB,uBAAuB,OAAO,YAAY;AAChE,UAAI,eAAe;AACjB,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,yCACd,kBACA,SACuC;AACvC,QAAM,UAAkB,QAAQ,SAAS,QAAQ,IAAI;AACrD,QAAM,oBAAoB,QAAQ,OAAO,MAAM,GAAG,QAAQ,OAAO,SAAS,CAAC;AAC3E,QAAM,YAAY,QAAQ,OAAO,QAAQ,OAAO,SAAS,CAAC;AAC1D,QAAM,kBAAkB,QAAQ,OAAO,QAAQ,OAAO,SAAS,CAAC;AAEhE,MAAI,cAAc,eAAe;AAC/B,UAAM,cAAc,IAAY,QAAQ,QAAQ,OAAO,MAAM,GAAG,QAAQ,OAAO,SAAS,CAAC,CAAC;AAC1F,UAAM,OAAO,YAAY,IAAI,gBAAgB;AAC7C,WAAO;AAAA,MACL;AAAA,QACE,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,YAAY,CAAC;AAAA,QACb,cAAc,CAAC;AAAA,QACf,eAAe;AAAA,QACf,iBAAiB;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AAEA,MAAI,oBAAoB,cAAc;AAEpC,UAAM,cAAc,IAAY,QAAQ,iBAAiB;AACzD,UAAM,OAAO,YAAY,IAAI,gBAAgB;AAC7C,WAAO;AAAA,MACL;AAAA,QACE,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,YAAY,CAAC;AAAA,QACb,cAAc,CAAC;AAAA,QACf,eAAe;AAAA,QACf,iBAAiB;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AAIA,MAAI,oBAAoB,cAAc;AACpC,UAAM,cAAc,IAAY,QAAQ,iBAAiB;AACzD,UAAM,OAAO,YAAY,IAAI,gBAAgB;AAE7C,QAAI,kBAAkD;AACtD,QAAI,cAAc,KAAK;AACrB,UAAI,KAAK,WAAW,SAAS,GAAG;AAC9B,0BAAkB,KAAK,WAAW,KAAK,WAAW,SAAS,CAAC;AAAA,MAC9D,OAAO;AAAA,MAEP;AAAA,IACF,OAAO;AACL,YAAM,QAAQ,SAAS,WAAW,EAAE;AACpC,UAAI,UAAU,GAAG;AACf,0BAAkB;AAAA,MACpB,OAAO;AACL,0BAAkB,KAAK,WAAW,QAAQ,CAAC;AAAA,MAC7C;AAAA,IACF;AACA,UAAM,aAA6C,CAAC;AACpD,UAAM,eAA+C,CAAC;AACtD,YAAQ,QAAQ,IAAI;AAAA,MAClB,KAAK,OAAO;AACV,mBAAW,KAAK,QAAQ,KAAK;AAC7B,eAAO;AAAA,UACL;AAAA,YACE,MAAM;AAAA,YACN,QAAQ;AAAA,YACR;AAAA,YACA;AAAA,YACA;AAAA,YACA,eAAe;AAAA,UACjB;AAAA,QACF;AAAA,MACF;AAAA,MACA,KAAK,UAAU;AACb,cAAM,cAAc,QAAQ,IAAI,gBAAgB;AAChD,qBAAa,KAAK,WAAW;AAC7B,eAAO;AAAA,UACL;AAAA,YACE,MAAM;AAAA,YACN,QAAQ;AAAA,YACR;AAAA,YACA;AAAA,YACA;AAAA,YACA,eAAe;AAAA,UACjB;AAAA,QACF;AAAA,MACF;AAAA,MACA,KAAK,WAAW;AAEd,cAAM,cAAc,QAAQ,IAAI,gBAAgB;AAChD,qBAAa,KAAK,WAAW;AAC7B,mBAAW,KAAK,QAAQ,KAAK;AAC7B,eAAO;AAAA,UACL;AAAA,YACE,MAAM;AAAA,YACN,QAAQ;AAAA,YACR,YAAY,CAAC;AAAA,YACb;AAAA,YACA;AAAA,YACA,eAAe;AAAA,UACjB;AAAA,UACA;AAAA,YACE,MAAM;AAAA,YACN,QAAQ;AAAA,YACR;AAAA,YACA,cAAc,CAAC;AAAA,YACf;AAAA,YACA,eAAe;AAAA,UACjB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,QAAQ,OAAO,aAAa,QAAQ,SAAS,IAAI;AACnD,UAAM,OAAO,QAAQ;AACrB,WAAO;AAAA,MACL;AAAA,QACE,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,YAAY,CAAC;AAAA,QACb,cAAc,CAAC;AAAA,QACf,iBAAiB;AAAA,QACjB,eAAe;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AAEA,UAAQ,MAAM,wBAAwB,KAAK,UAAU,SAAS,MAAM,CAAC,CAAC;AACtE,QAAM,IAAI,MAAM,qBAAqB;AACvC;AAEO,SAAS,8BACd,eACA,aACsB;AACtB,QAAM,iBAAyB;AAAA,IAC7B;AAAA,IACA;AAAA,IACA,CAAC,GAAG,GAAG,QAAyB;AAC9B,UAAI,EAAE,QAAQ,EAAE,KAAK;AACnB,eAAO,CAAC,EAAE,IAAI,WAAW,MAAM,IAAI,SAAS,GAAG,OAAO,EAAE,CAAC;AAAA,MAC3D;AACA;AAAA,IACF;AAAA,EACF;AAEA,QAAM,mBAAuC,CAAC;AAC9C,QAAM,kBAA4C,CAAC;AACnD,aAAW,QAAQ,gBAAgB;AACjC,QAAI,KAAK,OAAO,aAAa,KAAK,KAAK,SAAS,SAAS,GAAG;AAC1D,YAAM,UAAkB,QAAQ,SAAS,KAAK,IAAI;AAClD,YAAM,gBAAgB,QAAQ,IAAI,aAAa;AAC/C,uBAAiB,KAAK;AAAA,QACpB,gBAAgB,KAAK;AAAA,QACrB,oBAAoB;AAAA,MACtB,CAAC;AAAA,IACH,OAAO;AACL,sBAAgB,KAAK,IAAI;AAAA,IAC3B;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,MAA+B;AACvD,MAAI,UAAU,KAAK;AACnB,aAAW,SAAS,KAAK,YAAY;AACnC,cAAU,KAAK,IAAI,SAAS,iBAAiB,KAAK,CAAC;AAAA,EACrD;AACA,SAAO;AACT;AAEA,SAAS,kBAAkB,QAAiC,MAAyB;AACnF,QAAM,aAAa,oBAAI,IAAY;AACnC,WAAS,QAAQ,MAA+B;AAC9C,eAAW,IAAI,KAAK,MAAM;AAC1B,eAAW,SAAS,KAAK,YAAY;AACnC,cAAQ,KAAK;AAAA,IACf;AAAA,EACF;AACA,MAAI,KAAK,OAAO,aAAa,KAAK,OAAO,UAAU;AACjD,UAAM,cAAsB,QAAQ,SAAS,KAAK,IAAI,EAAE,IAAI,MAAM;AAClE,YAAQ,WAAW;AAAA,EACrB;AACA,SAAO;AACT;AAEA,SAAS,8BAA8B,MAA+B;AACpE,QAAM,UAAU,oBAAI,IAAY;AAChC,WAAS,QAAQA,OAA+B;AAC9C,YAAQ,IAAIA,MAAK,MAAM;AACvB,eAAW,SAASA,MAAK,YAAY;AACnC,cAAQ,KAAK;AAAA,IACf;AAAA,EACF;AACA,UAAQ,IAAI;AACZ,SAAO;AACT;AAGA,SAAS,mCACP,sBACA,aACsB;AACtB,QAAM,EAAE,eAAe,kBAAkB,gBAAgB,IAAI;AAE7D,QAAM,iCAAiC,KAAK;AAAA,IAC1C,iBAAiB,aAAa;AAAA,IAC9B,iBAAiB,WAAW;AAAA,EAC9B;AACA,MAAI,aAAa,iCAAiC;AAElD,QAAM,SAAS,KAAK,MAAM,KAAK,UAAU,aAAa,CAAC;AAEvD,WAAS,qCACP,MACA,eACA,YACA;AACA,QAAI,gBAAgB,IAAI,KAAK,MAAM,KAAK,cAAc,CAAC,WAAW,IAAI,KAAK,MAAM,GAAG;AAElF,YAAM,YAAY;AAClB,uBAAiB,KAAK;AAAA,QACpB,gBAAgB,KAAK;AAAA,QACrB,oBAAoB;AAAA,MACtB,CAAC;AACD,WAAK,SAAS;AACd,oBAAc,IAAI,SAAS;AAAA,IAC7B,OAAO;AACL,oBAAc,IAAI,KAAK,MAAM;AAAA,IAC/B;AACA,eAAW,SAAS,KAAK,YAAY;AACnC,2CAAqC,OAAO,eAAe,UAAU;AAAA,IACvE;AAAA,EACF;AAEA,QAAM,kBAAkB,8BAA8B,MAAM;AAE5D,aAAW,QAAQ,iBAAiB;AAClC,UAAM,UAAkB,QAAQ,SAAS,KAAK,IAAI;AAClD,UAAM,kBAAkB,QAAQ,OAAO,QAAQ,OAAO,SAAS,CAAC;AAChE,QAAI,oBAAoB,cAAc;AACpC;AAAA,IACF;AACA,UAAM,aAAa,kBAAkB,QAAQ,IAAI;AACjD,UAAM,gBAAgB,oBAAI,IAAY;AACtC,QAAI,KAAK,OAAO,aAAa,KAAK,OAAO,OAAO;AAE9C,2CAAqC,KAAK,OAAO,eAAe,UAAU;AAAA,IAC5E;AACA,eAAW,QAAQ,CAAC,cAAc;AAChC,sBAAgB,OAAO,SAAS;AAAA,IAClC,CAAC;AACD,kBAAc,QAAQ,CAAC,iBAAiB;AACtC,sBAAgB,IAAI,YAAY;AAAA,IAClC,CAAC;AAED,UAAM,cAAsB,WAAW,QAAQ,CAAC,IAAI,CAAC;AACrD,QAAI,YAAY,WAAW,KAAK,YAAY,CAAC,MAAM,MAAM;AACvD,YAAM,IAAI,MAAM,cAAc;AAAA,IAChC;AAAA,EACF;AAEA,SAAO;AACT;;;ACjjBO,IAAM,uCAAuC;AAC7C,IAAM,8BAA8B;AAcpC,IAAM,gBAAN,MAAM,cAAa;AAAA,EAsCxB,YACE,sBACA,UACA,cACA,yBACA,QACA,SAAS,CAAC,GACV,kBAAkB,MAClB,aACA;AAxCF;AAAA,SAAQ,+BAA+B,oBAAI,IAAoB;AAG/D;AAAA,SAAQ,+BAA+B,oBAAI,IAAoB;AAE/D,SAAQ,sBAAsB;AAC9B,SAAQ,iCAAiC,oBAAI,IAG3C;AACF,SAAQ,0BAA0B,oBAAI,IAAuB;AAC7D,SAAQ,+BAA+B,oBAAI,IAAyB;AACpE,SAAQ,cAAc;AAGtB,SAAQ,WAAW;AAInB,SAAQ,eAAe,oBAAI,IAAqC;AAChE,SAAQ,uBAAuB,oBAAI,IAAoB;AAIvD,SAAQ,6BAA6B,KAAK,IAAI;AAC9C,SAAQ,qBAAqB;AAC7B,SAAQ,cAAc;AACtB,SAAQ,gBAAgB;AActB,SAAK,WAAW;AAChB,SAAK,kBAAkB;AAEvB,SAAK,cAAc,eAAe,KAAK;AAEvC,SAAK,gBAAgB;AAAA,MACnB;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,0BAA0B;AAAA,MAC5B;AAAA,MACA,CAAC,SAA+B,kBAA0C;AACxE,aAAK,gBAAgB;AACrB,YAAI,QAAQ,cAAc;AACxB,eAAK,6BAA6B,KAAK,IAAI,IAAI,QAAQ;AACvD,eAAK,qBAAqB,QAAQ;AAAA,QACpC;AACA,YAAI,QAAQ,UAAU;AACpB,eAAK,eAAe,QAAQ;AAC5B,gBAAM,iBAAiB,KAAK,MAAM,KAAK,UAAU,QAAQ,QAAQ,CAAC;AAElE,cAAI,CAAC,KAAK,aAAa;AACrB,kBAAM,IAAI,MAAM,sCAAsC;AAAA,UACxD;AACA,eAAK,cAAc;AAEnB,cAAI,UAAuC;AAC3C,cAAI,yBAAyB;AAC3B,sBAAU,8BAA8B,yBAAyB,cAAc;AAC/E,uBAAW,aAAa,QAAQ,kBAAkB;AAChD,mBAAK,kBAAkB,UAAU,oBAAoB,UAAU,cAAc;AAAA,YAC/E;AAAA,UACF;AAEA,eAAK,4BAA4B,KAAK,cAAc,EAAE;AAEtD,iBAAO,SAAS,IAAI;AAAA,QACtB,WAAW,QAAQ,UAAU;AAC3B,cAAI,KAAK,aAAa;AACpB,kBAAM,IAAI,MAAM,uCAAuC;AAAA,UACzD;AACA,gBAAM,WAAW,KAAK,wBAAwB,QAAQ,QAAQ;AAC9D,eAAK,oBAAoB,QAAQ;AACjC,eAAK,2BAA2B,QAAQ;AAAA,QAC1C,WAAW,QAAQ,YAAY;AAC7B,cAAI,KAAK,aAAa;AACpB,iBAAK,YAAY,QAAQ,UAAU;AAAA,UACrC;AAAA,QACF,OAAO;AACL,cAAI,QAAQ,cAAc;AAExB,iBAAK,UAAU;AACf;AAAA,UACF;AACA,kBAAQ,MAAM,2CAA2C,OAAO;AAAA,QAClE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,mBAAmB,SAAqB;AAC9C,UAAM,WAAW,CAAC,UAAkB;AAClC,cAAQ,OAAO;AAAA,QACb,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB,KAAK;AACH,iBAAO,QAAQ;AAAA,QACjB;AACE,iBAAO,QAAQ;AAAA,MACnB;AAAA,IACF;AAEA,UAAM,QAAQ,SAAS,QAAQ,KAAK;AACpC,UAAM,GAAG,QAAQ,MAAM,YAAY,CAAC,KAAK,KAAK,QAAQ,MAAM,GAAG,QAAQ,OAAO;AAAA,EAChF;AAAA,EAEQ,kBAAkB,oBAA4B,gBAAwB;AAC5E,SAAK,6BAA6B,IAAI,gBAAgB,kBAAkB;AACxE,SAAK,6BAA6B,IAAI,oBAAoB,cAAc;AACxE,SAAK,gBAAgB,KAAK,IAAI,KAAK,eAAe,KAAK,IAAI,oBAAoB,cAAc,CAAC;AAAA,EAChG;AAAA,EAEQ,YAAY;AAClB,UAAM,OAAO,KAAK;AAClB,QAAI,KAAK,cAAc,KAAM;AAC3B,WAAK,cAAc;AAAA,IACrB;AACA,UAAM,cAAoC;AAAA,MACxC;AAAA,QACE,MAAM;AAAA,QACN;AAAA,QACA,cAAc,KAAK,gBAAgB;AAAA,MACrC;AAAA,IACF;AACA,UAAM,cAAc,KAAK,UAAU,WAAW;AAC9C,SAAK,+BAA+B,QAAQ,CAAC,qBAAqB;AAChE,uBAAiB,UAAU,KAAK,WAAW;AAAA,IAC7C,CAAC;AAAA,EACH;AAAA,EAEQ,mBACN,cACA,2BACiB;AACjB,UAAM,4BAA4B,KAAK,6BAA6B,IAAI,YAAY;AACpF,QAAI,CAAC,2BAA2B;AAC9B,YAAM,MAAM,IAAI;AAAA,QACd,+EAA+E,YAAY;AAAA,MAC7F;AACA,cAAQ,MAAM,GAAG;AACjB,YAAM;AAAA,IACR;AACA,UAAM,cAAsC;AAAA,MAC1C;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,QAAI,CAAC,aAAa;AAChB,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,WAAO;AAAA,MACL,MAAM;AAAA,MACN,UAAU;AAAA,MACV,cAAc,KAAK,IAAI,IAAI,KAAK;AAAA,IAClC;AAAA,EACF;AAAA,EAEO,kBAA0B;AAC/B,WAAO,KAAK;AAAA,EACd;AAAA,EAEO,sBACL,YACA,sBACA,SACA;AACA,UAAM,gBAAgB,CAAC;AACvB,eAAW,aAAa,YAAY;AAClC,UAAI,aAAa;AACjB,UAAI,yBAAyB,MAAM;AACjC,qBAAa,qBAAqB,IAAI,SAAS;AAAA,MACjD;AACA,YAAM,EAAE,aAAa,IAAI,KAAK,kBAAkB,WAAW,UAAU;AACrE,oBAAc,KAAK,YAAY;AAAA,IACjC;AAEA,QAAI,SAAS;AACX,YAAM,sBAAsB,IAAI;AAAA,QAC9B,cAAc,IAAI,CAAC,iBAAiB,CAAC,cAAc,CAAC,CAAC,CAAC;AAAA,MACxD;AAIA,iBAAW,gBAAgB,eAAe;AAExC,aAAK,mBAAmB,cAAc,QAAQ,aAAa;AAAA,MAC7D;AAEA,iBAAW,kBAAkB,QAAQ,iBAAiB;AAIpD,cAAM,sBAAsB;AAAA,UAC1B,QAAQ;AAAA,UACR;AAAA,QACF;AAEA,YAAI,eAAe,SAAS,MAAM,eAAe,OAAO,WAAW;AAAA,QAEnE,OAAO;AACL,gBAAM,eAAe,WAAW,QAAQ,eAAe,CAAC,cAAc,CAAC;AACvE,qBAAW,eAAe,cAAc;AACtC,gBAAI,gBAAgB,MAAM;AACxB,sBAAQ,MAAM,oDAAoD,WAAW;AAC7E,oBAAM;AAAA,YACR;AAAA,UACF;AAAA,QACF;AAEA,mBAAW,sBAAsB,qBAAqB;AACpD,gBAAM,eAAe,mBAAmB,OAAO;AAC/C,gBAAM,uBAAuB,uBAAuB,QAAQ,eAAe,YAAY;AACvF,8BAAoB,QAAQ,CAAC,OAAO,iBAAiB;AACnD,kBAAM,eAAe;AAAA,cACnB;AAAA,cACA;AAAA,cACA;AAAA;AAAA,cAEA,KAAK,6BAA6B,IAAI,YAAY;AAAA,YACpD;AACA,gBAAI,cAAc;AAChB,oBAAM,KAAK,YAAY;AAAA,YACzB;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF;AAEA,0BAAoB,QAAQ,CAAC,OAAO,iBAAiB;AACnD,YAAI,MAAM,WAAW,GAAG;AAEtB,gBAAM,KAAK;AAAA,YACT,MAAM;AAAA,YACN,QAAQ,KAAK,aAAa;AAAA,YAC1B,gBAAgB;AAAA,YAChB,YAAY,CAAC;AAAA,YACb,cAAc,CAAC;AAAA,UACjB,CAAC;AAAA,QACH;AACA,cAAM,mBAAyC;AAC/C,cAAM,YAAY,MAAM,CAAC;AACzB,kBAAU,eAAe,KAAK,gBAAgB;AAC9C,cAAM,kBAAkB,KAAK,UAAU,gBAAgB;AACvD,cAAM,mBAAmB,KAAK,+BAA+B,IAAI,YAAY;AAC7E,YAAI,CAAC,kBAAkB;AACrB,gBAAM,IAAI,MAAM,qDAAqD;AAAA,QACvE;AACA,yBAAiB,UAAU,KAAK,eAAe;AAAA,MACjD,CAAC;AAAA,IACH,OAAO;AACL,YAAM,4BAA4B,KAAK;AACvC,UAAI,CAAC,2BAA2B;AAC9B,cAAM,IAAI,MAAM,2DAA2D;AAAA,MAC7E;AACA,iBAAW,gBAAgB,eAAe;AACxC,cAAM,mBAAmB,KAAK,+BAA+B,IAAI,YAAY;AAC7E,YAAI,CAAC,kBAAkB;AACrB,gBAAM,IAAI,MAAM,qDAAqD;AAAA,QACvE;AACA,cAAM,mBAAyC;AAAA,UAC7C,KAAK,mBAAmB,cAAc,yBAAyB;AAAA,QACjE;AACA,cAAM,4BAA4B,KAAK,UAAU,gBAAgB;AACjE,yBAAiB,UAAU,KAAK,yBAAyB;AAAA,MAC3D;AAAA,IACF;AAEA,eAAW,gBAAgB,eAAe;AACxC,WAAK,cAAc,mBAAmB,YAAY;AAAA,IACpD;AAAA,EACF;AAAA,EAEQ,uBAAuB,cAAsD;AACnF,UAAM,eAAe,KAAK,qBAAqB,IAAI,YAAY;AAC/D,QAAI,iBAAiB,QAAW;AAC9B,YAAM,IAAI,MAAM,0BAA0B;AAAA,IAC5C;AACA,UAAM,OAAO,KAAK,aAAa,IAAI,YAAY;AAC/C,QAAI,CAAC,MAAM;AACT,YAAM,IAAI,MAAM,2BAA2B,YAAY;AAAA,IACzD;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,kBACN,WACA,uBAAsC,MACZ;AAC1B,QAAI;AACJ,QAAI,yBAAyB,MAAM;AACjC,qBAAe;AACf,WAAK,sBAAsB,KAAK,IAAI,KAAK,qBAAqB,eAAe,CAAC;AAAA,IAChF,OAAO;AACL,qBAAe,KAAK;AAAA,IACtB;AACA,UAAM,mBAAmB;AAAA,MACvB;AAAA,MACA,iBAAiB,CAAC,iBAA+B;AAC/C,cAAM,SAAS,OAAO,aAAa,IAAI;AACvC,YAAI;AACJ,YAAI;AACF,mBAAS,KAAK,MAAM,MAAM;AAAA,QAC5B,SAAS,GAAG;AACV,kBAAQ,MAAM,yCAAyC,MAAM,IAAI,CAAC;AAClE,kBAAQ,MAAM;AACd;AAAA,QACF;AAEA,YAAI,cAAa,cAAc,MAAM,GAAG;AAEtC;AAAA,QACF;AAEA,aAAK,oBAAoB,WAAW,MAAM;AAAA,MAC5C;AAAA,IACF;AACA,SAAK,+BAA+B,IAAI,cAAc,gBAAgB;AACtE,SAAK,6BAA6B,IAAI,cAAc,oBAAI,IAAI,CAAC;AAC7D,SAAK,wBAAwB,IAAI,WAAW,YAAY;AACxD,cAAU,iBAAiB,WAAW,iBAAiB,eAAe;AACtE,WAAO,EAAE,aAAa;AAAA,EACxB;AAAA,EAEA,OAAc,2BAA2B,WAAwD;AAC/F,UAAM,eAAe,IAAI,IAAI,SAAS;AAEtC,eAAW,YAAY,cAAa,+CAA+C;AACjF,UAAI,aAAa,IAAI,QAAQ,GAAG;AAC9B,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEO,aAAa,WAA4B;AAC9C,QAAI,KAAK,aAAa;AACpB,YAAM,IAAI,MAAM,oEAAoE;AAAA,IACtF;AACA,QAAI,KAAK,UAAU;AACjB,cAAQ,MAAM,8CAA8C;AAC5D,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AAEA,QAAI,UAAU,UAAU;AACtB,UACE,cAAa,8CAA8C,QAAQ,UAAU,QAAQ,MACrF,IACA;AACA,cAAM,qBAAqB,sCAAsC,UAAU,QAAQ;AACnF,cAAM,eAAqC;AAAA,UACzC;AAAA,YACE,MAAM;AAAA,YACN,SAAS;AAAA,UACX;AAAA,QACF;AACA,kBAAU,KAAK,KAAK,UAAU,YAAY,CAAC;AAC3C,kBAAU,MAAM;AAChB;AAAA,MACF;AAAA,IACF,OAAO;AAGL,YAAM,uBAAuB,8IAA8I,2BAA2B;AACtM,YAAM,iBAAuC;AAAA,QAC3C;AAAA,UACE,MAAM;AAAA,UACN,SAAS;AAAA,QACX;AAAA,MACF;AACA,gBAAU,KAAK,KAAK,UAAU,cAAc,CAAC;AAAA,IAC/C;AAEA,UAAM,EAAE,aAAa,IAAI,KAAK,kBAAkB,SAAS;AACzD,UAAM,4BAA4B,KAAK;AACvC,QAAI,CAAC,2BAA2B;AAC9B,YAAM,IAAI,MAAM,2DAA2D;AAAA,IAC7E;AACA,UAAM,mBAAyC;AAAA,MAC7C,KAAK,mBAAmB,cAAc,yBAAyB;AAAA,IACjE;AACA,UAAM,4BAA4B,KAAK,UAAU,gBAAgB;AACjE,cAAU,KAAK,yBAAyB;AACxC,SAAK,cAAc,mBAAmB,YAAY;AAAA,EACpD;AAAA,EAEO,gBAAgB,WAA4B;AACjD,UAAM,eAAe,KAAK,wBAAwB,IAAI,SAAS;AAC/D,QAAI,CAAC,cAAc;AACjB;AAAA,IACF;AACA,SAAK,cAAc,sBAAsB,YAAY;AACrD,UAAM,mBAAmB,KAAK,+BAA+B,IAAI,YAAY;AAC7E,QAAI,CAAC,kBAAkB;AACrB,YAAM,IAAI,MAAM,+BAA+B;AAAA,IACjD;AACA,cAAU,oBAAoB,WAAW,iBAAiB,eAAe;AACzE,SAAK,+BAA+B,OAAO,YAAY;AACvD,SAAK,6BAA6B,OAAO,YAAY;AACrD,SAAK,wBAAwB,OAAO,SAAS;AAAA,EAC/C;AAAA,EAEO,UAAgB;AACrB,SAAK,WAAW;AAGhB,SAAK,cAAc,QAAQ;AAE3B,eAAW,CAAC,WAAW,YAAY,KAAK,KAAK,yBAAyB;AACpE,YAAM,mBAAmB,KAAK,+BAA+B,IAAI,YAAY;AAC7E,UAAI,CAAC,kBAAkB;AACrB,cAAM,IAAI,MAAM,+BAA+B;AAAA,MACjD;AACA,gBAAU,oBAAoB,WAAW,iBAAiB,eAAe;AACzE,WAAK,+BAA+B,OAAO,YAAY;AACvD,WAAK,6BAA6B,OAAO,YAAY;AACrD,WAAK,wBAAwB,OAAO,SAAS;AAAA,IAC/C;AAAA,EACF;AAAA,EAEQ,oBAAoB,gBAAsD;AAChF,UAAM,4BAA4B,KAAK;AACvC,QAAI,CAAC,2BAA2B;AAC9B,YAAM,IAAI,MAAM,6CAA6C;AAAA,IAC/D;AAEA,eAAW,CAAC,EAAE,yBAAyB,KAAK,KAAK,8BAA8B;AAC7E,gCAA0B,IAAI,0BAA0B,MAAM;AAAA,IAChE;AAEA,UAAM,sBAAsB,IAAI;AAAA,MAC9B,MAAM,KAAK,KAAK,+BAA+B,KAAK,CAAC,EAAE,IAAI,CAAC,iBAAiB;AAAA,QAC3E;AAAA,QACA,CAAC;AAAA,MACH,CAAC;AAAA,IACH;AAEA,wBAAoB,QAAQ,CAAC,OAAO,iBAAiB;AACnD,YAAM,aAAa,KAAK,uBAAuB,eAAe,OAAO,MAAM;AAC3E,UAAI,eAAe,SAAS,gBAAgB,CAAC,YAAY;AACvD,gBAAQ,MAAM,qDAAqD,cAAc;AACjF,gBAAQ,MAAM,qBAAqB,KAAK,UAAU,KAAK,cAAc,MAAM,CAAC,CAAC;AAAA,MAC/E;AACA,YAAM,OAAO;AAAA,QACX;AAAA,QACA;AAAA,QACA;AAAA;AAAA,QAEA,KAAK,6BAA6B,IAAI,YAAY;AAAA,MACpD;AACA,UAAI,MAAM;AACR,cAAM,KAAK,IAAI;AAAA,MACjB;AAAA,IACF,CAAC;AAED,wBAAoB,QAAQ,CAAC,OAAO,iBAAiB;AACnD,UAAI,MAAM,SAAS,GAAG;AACpB,cAAM,mBAAyC;AAC/C,cAAM,kBAAkB,KAAK,UAAU,gBAAgB;AACvD,cAAM,mBAAmB,KAAK,+BAA+B,IAAI,YAAY;AAC7E,YAAI,CAAC,kBAAkB;AACrB,gBAAM,IAAI,MAAM,uDAAuD;AAAA,QACzE;AACA,yBAAiB,UAAU,KAAK,eAAe;AAAA,MACjD;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEQ,2BAA2B,UAAgD;AACjF,UAAM,oBAAoB,SAAS;AACnC,QAAI,SAAS,SAAS,aAAa;AACjC,eAAS,aAAa,QAAQ,CAAC,oBAA6C;AAC1E,aAAK,wBAAwB,eAAe;AAC5C,cAAM,QAAQ,kBAAkB,WAAW,QAAQ,eAAe;AAClE,0BAAkB,WAAW,OAAO,OAAO,CAAC;AAAA,MAC9C,CAAC;AACD;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,wBAAwB,mBAAkD;AAChF,SAAK,aAAa,OAAO,kBAAkB,MAAM;AACjD,SAAK,qBAAqB,OAAO,kBAAkB,MAAM;AACzD,eAAW,SAAS,kBAAkB,YAAY;AAChD,WAAK,wBAAwB,KAAK;AAAA,IACpC;AAAA,EACF;AAAA,EAEA,OAAO,cAAc,SAAgD;AACnE,WAAQ,QAAwB,SAAS;AAAA,EAC3C;AAAA,EAEQ,oBAAoB,WAAsB,aAAgC;AAChF,QAAI,KAAK,UAAU;AACjB,cAAQ,MAAM,4CAA4C;AAC1D,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AAEA,UAAM,eAAe,KAAK,wBAAwB,IAAI,SAAS;AAC/D,QAAI,CAAC,cAAc;AACjB,cAAQ,MAAM,wCAAwC,SAAS;AAC/D;AAAA,IACF;AAEA,UAAM,eAAe,KAAK,6BAA6B,IAAI,YAAY;AACvE,QAAI,CAAC,cAAc;AACjB,cAAQ,MAAM,sCAAsC,YAAY;AAChE;AAAA,IACF;AAEA,QAAI,CAAC,aAAa,IAAI,YAAY,MAAM,GAAG;AAEzC,cAAQ,MAAM,sCAAsC,YAAY,MAAM;AACtE;AAAA,IACF;AAEA,UAAM,eAAe,KAAK,6BAA6B,IAAI,YAAY,MAAM;AAC7E,QAAI,cAAc;AAChB,kBAAY,SAAS;AAAA,IACvB;AAEA,SAAK,cAAc,oCAAoC,cAAc,WAAW;AAAA,EAClF;AAAA,EAEQ,kDACN,gBACyB;AACzB,UAAM,aAAa,KAAK,6BAA6B,IAAI,cAAc;AACvE,QAAI,eAAe,QAAW;AAC5B,YAAMC,QAAO,KAAK,aAAa,IAAI,UAAU;AAC7C,UAAI,CAACA,OAAM;AACT,cAAM,IAAI,MAAM,yCAAyC,UAAU;AAAA,MACrE;AACA,aAAOA;AAAA,IACT;AACA,UAAM,OAAO,KAAK,aAAa,IAAI,cAAc;AACjD,QAAI,CAAC,MAAM;AACT,YAAM,IAAI,MAAM,gCAAgC,cAAc;AAAA,IAChE;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,wBACN,UACgC;AAChC,UAAM,SAAS,KAAK,kDAAkD,SAAS,QAAQ;AAGvF,QAAI,SAAS,WAAW;AACtB,UAAI,SAAS,UAAU,UAAU,MAAM;AACrC,eAAO,WAAW,SAAS,UAAU,aAAa,IAAI,SAAS,UAAU;AAAA,MAC3E,OAAO;AACL,eAAO,OAAO,WAAW,SAAS,UAAU,aAAa;AAAA,MAC3D;AAAA,IACF;AAEA,UAAM,kBAAkB,SAAS,oBAC7B,KAAK,kDAAkD,SAAS,iBAAiB,IACjF;AAEJ,QAAI,SAAS,SAAS,aAAa;AACjC,UAAI,QAAQ;AACZ,UAAI,iBAAiB;AACnB,gBAAQ,OAAO,WAAW,QAAQ,eAAe;AACjD,YAAI,UAAU,IAAI;AAChB,gBAAM,IAAI,MAAM,iEAAiE;AAAA,QACnF;AACA,iBAAS;AAAA,MACX;AACA,eAAS,WAAW,QAAQ,CAAC,2BAAoD;AAC/E,aAAK,4BAA4B,wBAAwB,OAAO,MAAM;AAEtE,YAAI,OAAO,WAAW,QAAQ,sBAAsB,MAAM,IAAI;AAC5D,iBAAO,WAAW,OAAO,OAAO,GAAG,sBAAsB;AACzD;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH,WAAW,SAAS,SAAS,cAAc;AAEzC,YAAM,gBAAgB,SAAS;AAC/B,UAAI,cAAc,UAAU,MAAM;AAChC,eAAO,OAAO,WAAW,cAAc,aAAa;AAAA,MACtD,OAAO;AACL,eAAO,WAAW,cAAc,aAAa,IAAI,cAAc;AAAA,MACjE;AAAA,IACF,WAAW,SAAS,SAAS,iBAAiB;AAE5C,YAAM,IAAI,MAAM,6BAA6B;AAAA,IAE/C;AAEA,UAAM,SAAyC;AAAA,MAC7C,MAAM,SAAS;AAAA,MACf;AAAA,MACA,YAAY,SAAS;AAAA,MACrB,cAAc,SAAS,eAAe,IAAI,CAAC,WAAW;AACpD,eAAO,KAAK,kDAAkD,MAAM;AAAA,MACtE,CAAC;AAAA,MACD,iBAAiB,SAAS,oBACtB,KAAK,kDAAkD,SAAS,iBAAiB,IACjF;AAAA,MACJ,eAAe,SAAS,YAAY,SAAS,UAAU,gBAAgB;AAAA,IACzE;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,cAAuC;AACrC,WAAO,KAAK;AAAA,EACd;AAAA,EAEQ,4BAA4B,MAA+B,cAAsB;AACvF,UAAM,iBAAiB,KAAK,6BAA6B,IAAI,KAAK,MAAM;AACxE,QAAI,mBAAmB,QAAW;AAChC,WAAK,SAAS;AAAA,IAChB,OAAO;AAEL,YAAM,0BAA0B,KAAK,6BAA6B,IAAI,KAAK,MAAM;AACjF,UAAI,yBAAyB;AAC3B,cAAM,YAAY,EAAE,KAAK;AACzB,aAAK,kBAAkB,WAAW,KAAK,MAAM;AAC7C,aAAK,SAAS;AAAA,MAChB;AAAA,IACF;AAEA,QAAI,KAAK,aAAa,IAAI,KAAK,MAAM,GAAG;AACtC,YAAM,IAAI,MAAM,iCAAiC,KAAK,MAAM;AAAA,IAC9D;AAEA,SAAK,aAAa,IAAI,KAAK,QAAQ,IAAI;AACvC,SAAK,qBAAqB,IAAI,KAAK,QAAQ,YAAY;AACvD,SAAK,gBAAgB,KAAK,IAAI,KAAK,eAAe,KAAK,MAAM;AAE7D,eAAW,aAAa,KAAK,YAAY;AACvC,WAAK,4BAA4B,WAAW,KAAK,MAAM;AAAA,IACzD;AAAA,EACF;AAAA,EAEO,8BAA8B;AAEnC,WAAO,IAAI,IAAI,KAAK,uBAAuB;AAAA,EAC7C;AACF;AAAA;AA1pBa,cAEG,gDAAgD;AAAA,EAC5D;AACF;AAJK,IAAM,eAAN;;;AC3BA,IAAM,uBAAN,MAA2B;AAAA,EAYhC,YACE,UACA,sBACA,kBAAkB,MAClB,aACA;AAfF,SAAQ,SAAiB,CAAC;AAE1B,SAAQ,aAAa,oBAAI,IAAe;AACxC,SAAQ,cAAkC;AAaxC,SAAK,WAAW;AAChB,SAAK,uBAAuB;AAC5B,SAAK,kBAAkB;AACvB,SAAK,cAAc;AAAA,EACrB;AAAA,EAEO,WAAW;AAChB,WAAO,KAAK,gBAAgB;AAAA,EAC9B;AAAA,EAEO,KAAK,cAAsB,QAAiB;AACjD,QAAI,WAAW,QAAW;AACxB,WAAK,SAAS;AAAA,IAChB;AAEA,QAAI,kBAAkD;AACtD,QAAI,uBAAsD;AAC1D,QAAI,KAAK,aAAa;AACpB,YAAM,cAAc,KAAK,YAAY;AACrC,6BAAuB,YAAY,4BAA4B;AAC/D,kBAAY,QAAQ;AACpB,wBAAkB,YAAY,YAAY;AAAA,IAC5C;AACA,SAAK,cAAc;AAEnB,QAAI,UAAU;AACd,UAAM,eAAe,IAAI;AAAA,MACvB,KAAK;AAAA,MACL,KAAK;AAAA,MACL;AAAA,MACA;AAAA,MACA,CAAC,SAAsCC,kBAA+B;AACpE,kBAAU;AACV,YAAI,KAAK,aAAa;AACpB,eAAK,YAAY,SAAS;AAAA,QAC5B;AACA,QAAAA,cAAa;AAAA,UACX,MAAM,KAAK,KAAK,UAAU;AAAA,UAC1B;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,MACA,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AACA,SAAK,cAAc;AAAA,MACjB;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,IACV;AAAA,EACF;AAAA,EAEO,SAAS;AACd,QAAI,KAAK,aAAa;AACpB,WAAK,KAAK,KAAK,YAAY,cAAc,KAAK,MAAM;AAAA,IACtD,OAAO;AACL,cAAQ,KAAK,sDAAsD;AAAA,IACrE;AAAA,EACF;AAAA,EAEO,UAAU;AACf,eAAW,MAAM,KAAK,YAAY;AAChC,SAAG,MAAM;AAAA,IACX;AACA,SAAK,WAAW,MAAM;AACtB,QAAI,KAAK,aAAa;AACpB,WAAK,YAAY,aAAa,QAAQ;AAAA,IACxC;AACA,SAAK,cAAc;AAAA,EACrB;AAAA,EAEO,aAAa,WAAsB;AACxC,SAAK,WAAW,IAAI,SAAS;AAC7B,QAAI,KAAK,eAAe,KAAK,YAAY,QAAQ;AAC/C,WAAK,YAAY,aAAa,aAAa,SAAS;AAAA,IACtD;AAAA,EACF;AAAA,EAEO,gBAAgB,WAAsB;AAC3C,SAAK,WAAW,OAAO,SAAS;AAChC,QAAI,KAAK,eAAe,KAAK,YAAY,QAAQ;AAC/C,WAAK,YAAY,aAAa,gBAAgB,SAAS;AAAA,IACzD;AAAA,EACF;AACF;",
   "names": ["node", "node", "networkedDOM"]
 }

package/build/rfc6902/index.d.ts

@@ -1,4 +1,4 @@
-export { Pointer } from "./pointer";
-export { applyPatch } from "./patch";
 export type { Operation, TestOperation } from "./diff";
 export { createPatch, createTests } from "./diff";
+export { applyPatch } from "./patch";
+export { Pointer } from "./pointer";

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@mml-io/networked-dom-document",
-  "version": "0.17.1",
+  "version": "0.18.1",
   "publishConfig": {
     "access": "public"
   },
@@ -14,13 +14,13 @@
     "type-check": "tsc --noEmit",
     "build": "tsx ./build.ts --build",
     "iterate": "tsx ./build.ts --watch",
-    "lint": "eslint \"./{src,test}/**/*.{js,jsx,ts,tsx}\" --max-warnings 0",
-    "lint-fix": "eslint \"./{src,test}/**/*.{js,jsx,ts,tsx}\" --fix",
+    "lint": "eslint \"./**/*.{js,jsx,ts,tsx}\" --max-warnings 0",
+    "lint-fix": "eslint \"./**/*.{js,jsx,ts,tsx}\" --fix",
     "test": "cross-env NODE_OPTIONS=--experimental-vm-modules jest"
   },
   "dependencies": {
-    "@mml-io/networked-dom-protocol": "^0.17.1",
-    "@mml-io/observable-dom-common": "^0.17.1"
+    "@mml-io/networked-dom-protocol": "^0.18.1",
+    "@mml-io/observable-dom-common": "^0.18.1"
   },
-  "gitHead": "d1069c5541fadd1ae78700dbbd94d55a481d373a"
+  "gitHead": "ef5baff6cda84a1acaed56a957c6b81f4c5acfd5"
 }