@tiptap/extension-dropcursor 2.0.0-beta.2 → 2.0.0-beta.20

package/dist/tiptap-extension-dropcursor.bundle.umd.min.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tiptap-extension-dropcursor.bundle.umd.min.js","sources":["../../../node_modules/prosemirror-model/src/diff.js","../../../node_modules/prosemirror-model/src/fragment.js","../../../node_modules/prosemirror-model/src/comparedeep.js","../../../node_modules/prosemirror-model/src/mark.js","../../../node_modules/prosemirror-model/src/replace.js","../../../node_modules/prosemirror-model/src/resolvedpos.js","../../../node_modules/prosemirror-model/src/node.js","../../../node_modules/prosemirror-model/src/content.js","../../../node_modules/prosemirror-model/src/schema.js","../../../node_modules/prosemirror-model/src/from_dom.js","../../../node_modules/prosemirror-model/src/to_dom.js","../../../node_modules/prosemirror-transform/src/map.js","../../../node_modules/prosemirror-transform/src/transform.js","../../../node_modules/prosemirror-transform/src/step.js","../../../node_modules/prosemirror-transform/src/replace_step.js","../../../node_modules/prosemirror-transform/src/mark_step.js","../../../node_modules/prosemirror-transform/src/structure.js","../../../node_modules/prosemirror-transform/src/replace.js","../../../node_modules/prosemirror-transform/src/mark.js","../../../node_modules/prosemirror-state/src/selection.js","../../../node_modules/prosemirror-state/src/transaction.js","../../../node_modules/prosemirror-state/src/state.js","../../../node_modules/prosemirror-state/src/plugin.js","../../../node_modules/prosemirror-dropcursor/src/dropcursor.js","../src/dropcursor.ts"],"sourcesContent":["export function findDiffStart(a, b, pos) {\n  for (let i = 0;; i++) {\n    if (i == a.childCount || i == b.childCount)\n      return a.childCount == b.childCount ? null : pos\n\n    let childA = a.child(i), childB = b.child(i)\n    if (childA == childB) { pos += childA.nodeSize; continue }\n\n    if (!childA.sameMarkup(childB)) return pos\n\n    if (childA.isText && childA.text != childB.text) {\n      for (let j = 0; childA.text[j] == childB.text[j]; j++)\n        pos++\n      return pos\n    }\n    if (childA.content.size || childB.content.size) {\n      let inner = findDiffStart(childA.content, childB.content, pos + 1)\n      if (inner != null) return inner\n    }\n    pos += childA.nodeSize\n  }\n}\n\nexport function findDiffEnd(a, b, posA, posB) {\n  for (let iA = a.childCount, iB = b.childCount;;) {\n    if (iA == 0 || iB == 0)\n      return iA == iB ? null : {a: posA, b: posB}\n\n    let childA = a.child(--iA), childB = b.child(--iB), size = childA.nodeSize\n    if (childA == childB) {\n      posA -= size; posB -= size\n      continue\n    }\n\n    if (!childA.sameMarkup(childB)) return {a: posA, b: posB}\n\n    if (childA.isText && childA.text != childB.text) {\n      let same = 0, minSize = Math.min(childA.text.length, childB.text.length)\n      while (same < minSize && childA.text[childA.text.length - same - 1] == childB.text[childB.text.length - same - 1]) {\n        same++; posA--; posB--\n      }\n      return {a: posA, b: posB}\n    }\n    if (childA.content.size || childB.content.size) {\n      let inner = findDiffEnd(childA.content, childB.content, posA - 1, posB - 1)\n      if (inner) return inner\n    }\n    posA -= size; posB -= size\n  }\n}\n","import {findDiffStart, findDiffEnd} from \"./diff\"\n\n// ::- A fragment represents a node's collection of child nodes.\n//\n// Like nodes, fragments are persistent data structures, and you\n// should not mutate them or their content. Rather, you create new\n// instances whenever needed. The API tries to make this easy.\nexport class Fragment {\n  constructor(content, size) {\n    this.content = content\n    // :: number\n    // The size of the fragment, which is the total of the size of its\n    // content nodes.\n    this.size = size || 0\n    if (size == null) for (let i = 0; i < content.length; i++)\n      this.size += content[i].nodeSize\n  }\n\n  // :: (number, number, (node: Node, start: number, parent: Node, index: number) → ?bool, ?number)\n  // Invoke a callback for all descendant nodes between the given two\n  // positions (relative to start of this fragment). Doesn't descend\n  // into a node when the callback returns `false`.\n  nodesBetween(from, to, f, nodeStart = 0, parent) {\n    for (let i = 0, pos = 0; pos < to; i++) {\n      let child = this.content[i], end = pos + child.nodeSize\n      if (end > from && f(child, nodeStart + pos, parent, i) !== false && child.content.size) {\n        let start = pos + 1\n        child.nodesBetween(Math.max(0, from - start),\n                           Math.min(child.content.size, to - start),\n                           f, nodeStart + start)\n      }\n      pos = end\n    }\n  }\n\n  // :: ((node: Node, pos: number, parent: Node) → ?bool)\n  // Call the given callback for every descendant node. The callback\n  // may return `false` to prevent traversal of a given node's children.\n  descendants(f) {\n    this.nodesBetween(0, this.size, f)\n  }\n\n  // : (number, number, ?string, ?string) → string\n  textBetween(from, to, blockSeparator, leafText) {\n    let text = \"\", separated = true\n    this.nodesBetween(from, to, (node, pos) => {\n      if (node.isText) {\n        text += node.text.slice(Math.max(from, pos) - pos, to - pos)\n        separated = !blockSeparator\n      } else if (node.isLeaf && leafText) {\n        text += leafText\n        separated = !blockSeparator\n      } else if (!separated && node.isBlock) {\n        text += blockSeparator\n        separated = true\n      }\n    }, 0)\n    return text\n  }\n\n  // :: (Fragment) → Fragment\n  // Create a new fragment containing the combined content of this\n  // fragment and the other.\n  append(other) {\n    if (!other.size) return this\n    if (!this.size) return other\n    let last = this.lastChild, first = other.firstChild, content = this.content.slice(), i = 0\n    if (last.isText && last.sameMarkup(first)) {\n      content[content.length - 1] = last.withText(last.text + first.text)\n      i = 1\n    }\n    for (; i < other.content.length; i++) content.push(other.content[i])\n    return new Fragment(content, this.size + other.size)\n  }\n\n  // :: (number, ?number) → Fragment\n  // Cut out the sub-fragment between the two given positions.\n  cut(from, to) {\n    if (to == null) to = this.size\n    if (from == 0 && to == this.size) return this\n    let result = [], size = 0\n    if (to > from) for (let i = 0, pos = 0; pos < to; i++) {\n      let child = this.content[i], end = pos + child.nodeSize\n      if (end > from) {\n        if (pos < from || end > to) {\n          if (child.isText)\n            child = child.cut(Math.max(0, from - pos), Math.min(child.text.length, to - pos))\n          else\n            child = child.cut(Math.max(0, from - pos - 1), Math.min(child.content.size, to - pos - 1))\n        }\n        result.push(child)\n        size += child.nodeSize\n      }\n      pos = end\n    }\n    return new Fragment(result, size)\n  }\n\n  cutByIndex(from, to) {\n    if (from == to) return Fragment.empty\n    if (from == 0 && to == this.content.length) return this\n    return new Fragment(this.content.slice(from, to))\n  }\n\n  // :: (number, Node) → Fragment\n  // Create a new fragment in which the node at the given index is\n  // replaced by the given node.\n  replaceChild(index, node) {\n    let current = this.content[index]\n    if (current == node) return this\n    let copy = this.content.slice()\n    let size = this.size + node.nodeSize - current.nodeSize\n    copy[index] = node\n    return new Fragment(copy, size)\n  }\n\n  // : (Node) → Fragment\n  // Create a new fragment by prepending the given node to this\n  // fragment.\n  addToStart(node) {\n    return new Fragment([node].concat(this.content), this.size + node.nodeSize)\n  }\n\n  // : (Node) → Fragment\n  // Create a new fragment by appending the given node to this\n  // fragment.\n  addToEnd(node) {\n    return new Fragment(this.content.concat(node), this.size + node.nodeSize)\n  }\n\n  // :: (Fragment) → bool\n  // Compare this fragment to another one.\n  eq(other) {\n    if (this.content.length != other.content.length) return false\n    for (let i = 0; i < this.content.length; i++)\n      if (!this.content[i].eq(other.content[i])) return false\n    return true\n  }\n\n  // :: ?Node\n  // The first child of the fragment, or `null` if it is empty.\n  get firstChild() { return this.content.length ? this.content[0] : null }\n\n  // :: ?Node\n  // The last child of the fragment, or `null` if it is empty.\n  get lastChild() { return this.content.length ? this.content[this.content.length - 1] : null }\n\n  // :: number\n  // The number of child nodes in this fragment.\n  get childCount() { return this.content.length }\n\n  // :: (number) → Node\n  // Get the child node at the given index. Raise an error when the\n  // index is out of range.\n  child(index) {\n    let found = this.content[index]\n    if (!found) throw new RangeError(\"Index \" + index + \" out of range for \" + this)\n    return found\n  }\n\n  // :: (number) → ?Node\n  // Get the child node at the given index, if it exists.\n  maybeChild(index) {\n    return this.content[index]\n  }\n\n  // :: ((node: Node, offset: number, index: number))\n  // Call `f` for every child node, passing the node, its offset\n  // into this parent node, and its index.\n  forEach(f) {\n    for (let i = 0, p = 0; i < this.content.length; i++) {\n      let child = this.content[i]\n      f(child, p, i)\n      p += child.nodeSize\n    }\n  }\n\n  // :: (Fragment) → ?number\n  // Find the first position at which this fragment and another\n  // fragment differ, or `null` if they are the same.\n  findDiffStart(other, pos = 0) {\n    return findDiffStart(this, other, pos)\n  }\n\n  // :: (Fragment) → ?{a: number, b: number}\n  // Find the first position, searching from the end, at which this\n  // fragment and the given fragment differ, or `null` if they are the\n  // same. Since this position will not be the same in both nodes, an\n  // object with two separate positions is returned.\n  findDiffEnd(other, pos = this.size, otherPos = other.size) {\n    return findDiffEnd(this, other, pos, otherPos)\n  }\n\n  // : (number, ?number) → {index: number, offset: number}\n  // Find the index and inner offset corresponding to a given relative\n  // position in this fragment. The result object will be reused\n  // (overwritten) the next time the function is called. (Not public.)\n  findIndex(pos, round = -1) {\n    if (pos == 0) return retIndex(0, pos)\n    if (pos == this.size) return retIndex(this.content.length, pos)\n    if (pos > this.size || pos < 0) throw new RangeError(`Position ${pos} outside of fragment (${this})`)\n    for (let i = 0, curPos = 0;; i++) {\n      let cur = this.child(i), end = curPos + cur.nodeSize\n      if (end >= pos) {\n        if (end == pos || round > 0) return retIndex(i + 1, end)\n        return retIndex(i, curPos)\n      }\n      curPos = end\n    }\n  }\n\n  // :: () → string\n  // Return a debugging string that describes this fragment.\n  toString() { return \"<\" + this.toStringInner() + \">\" }\n\n  toStringInner() { return this.content.join(\", \") }\n\n  // :: () → ?Object\n  // Create a JSON-serializeable representation of this fragment.\n  toJSON() {\n    return this.content.length ? this.content.map(n => n.toJSON()) : null\n  }\n\n  // :: (Schema, ?Object) → Fragment\n  // Deserialize a fragment from its JSON representation.\n  static fromJSON(schema, value) {\n    if (!value) return Fragment.empty\n    if (!Array.isArray(value)) throw new RangeError(\"Invalid input for Fragment.fromJSON\")\n    return new Fragment(value.map(schema.nodeFromJSON))\n  }\n\n  // :: ([Node]) → Fragment\n  // Build a fragment from an array of nodes. Ensures that adjacent\n  // text nodes with the same marks are joined together.\n  static fromArray(array) {\n    if (!array.length) return Fragment.empty\n    let joined, size = 0\n    for (let i = 0; i < array.length; i++) {\n      let node = array[i]\n      size += node.nodeSize\n      if (i && node.isText && array[i - 1].sameMarkup(node)) {\n        if (!joined) joined = array.slice(0, i)\n        joined[joined.length - 1] = node.withText(joined[joined.length - 1].text + node.text)\n      } else if (joined) {\n        joined.push(node)\n      }\n    }\n    return new Fragment(joined || array, size)\n  }\n\n  // :: (?union<Fragment, Node, [Node]>) → Fragment\n  // Create a fragment from something that can be interpreted as a set\n  // of nodes. For `null`, it returns the empty fragment. For a\n  // fragment, the fragment itself. For a node or array of nodes, a\n  // fragment containing those nodes.\n  static from(nodes) {\n    if (!nodes) return Fragment.empty\n    if (nodes instanceof Fragment) return nodes\n    if (Array.isArray(nodes)) return this.fromArray(nodes)\n    if (nodes.attrs) return new Fragment([nodes], nodes.nodeSize)\n    throw new RangeError(\"Can not convert \" + nodes + \" to a Fragment\" +\n                         (nodes.nodesBetween ? \" (looks like multiple versions of prosemirror-model were loaded)\" : \"\"))\n  }\n}\n\nconst found = {index: 0, offset: 0}\nfunction retIndex(index, offset) {\n  found.index = index\n  found.offset = offset\n  return found\n}\n\n// :: Fragment\n// An empty fragment. Intended to be reused whenever a node doesn't\n// contain anything (rather than allocating a new empty fragment for\n// each leaf node).\nFragment.empty = new Fragment([], 0)\n","export function compareDeep(a, b) {\n  if (a === b) return true\n  if (!(a && typeof a == \"object\") ||\n      !(b && typeof b == \"object\")) return false\n  let array = Array.isArray(a)\n  if (Array.isArray(b) != array) return false\n  if (array) {\n    if (a.length != b.length) return false\n    for (let i = 0; i < a.length; i++) if (!compareDeep(a[i], b[i])) return false\n  } else {\n    for (let p in a) if (!(p in b) || !compareDeep(a[p], b[p])) return false\n    for (let p in b) if (!(p in a)) return false\n  }\n  return true\n}\n","import {compareDeep} from \"./comparedeep\"\n\n// ::- A mark is a piece of information that can be attached to a node,\n// such as it being emphasized, in code font, or a link. It has a type\n// and optionally a set of attributes that provide further information\n// (such as the target of the link). Marks are created through a\n// `Schema`, which controls which types exist and which\n// attributes they have.\nexport class Mark {\n  constructor(type, attrs) {\n    // :: MarkType\n    // The type of this mark.\n    this.type = type\n    // :: Object\n    // The attributes associated with this mark.\n    this.attrs = attrs\n  }\n\n  // :: ([Mark]) → [Mark]\n  // Given a set of marks, create a new set which contains this one as\n  // well, in the right position. If this mark is already in the set,\n  // the set itself is returned. If any marks that are set to be\n  // [exclusive](#model.MarkSpec.excludes) with this mark are present,\n  // those are replaced by this one.\n  addToSet(set) {\n    let copy, placed = false\n    for (let i = 0; i < set.length; i++) {\n      let other = set[i]\n      if (this.eq(other)) return set\n      if (this.type.excludes(other.type)) {\n        if (!copy) copy = set.slice(0, i)\n      } else if (other.type.excludes(this.type)) {\n        return set\n      } else {\n        if (!placed && other.type.rank > this.type.rank) {\n          if (!copy) copy = set.slice(0, i)\n          copy.push(this)\n          placed = true\n        }\n        if (copy) copy.push(other)\n      }\n    }\n    if (!copy) copy = set.slice()\n    if (!placed) copy.push(this)\n    return copy\n  }\n\n  // :: ([Mark]) → [Mark]\n  // Remove this mark from the given set, returning a new set. If this\n  // mark is not in the set, the set itself is returned.\n  removeFromSet(set) {\n    for (let i = 0; i < set.length; i++)\n      if (this.eq(set[i]))\n        return set.slice(0, i).concat(set.slice(i + 1))\n    return set\n  }\n\n  // :: ([Mark]) → bool\n  // Test whether this mark is in the given set of marks.\n  isInSet(set) {\n    for (let i = 0; i < set.length; i++)\n      if (this.eq(set[i])) return true\n    return false\n  }\n\n  // :: (Mark) → bool\n  // Test whether this mark has the same type and attributes as\n  // another mark.\n  eq(other) {\n    return this == other ||\n      (this.type == other.type && compareDeep(this.attrs, other.attrs))\n  }\n\n  // :: () → Object\n  // Convert this mark to a JSON-serializeable representation.\n  toJSON() {\n    let obj = {type: this.type.name}\n    for (let _ in this.attrs) {\n      obj.attrs = this.attrs\n      break\n    }\n    return obj\n  }\n\n  // :: (Schema, Object) → Mark\n  static fromJSON(schema, json) {\n    if (!json) throw new RangeError(\"Invalid input for Mark.fromJSON\")\n    let type = schema.marks[json.type]\n    if (!type) throw new RangeError(`There is no mark type ${json.type} in this schema`)\n    return type.create(json.attrs)\n  }\n\n  // :: ([Mark], [Mark]) → bool\n  // Test whether two sets of marks are identical.\n  static sameSet(a, b) {\n    if (a == b) return true\n    if (a.length != b.length) return false\n    for (let i = 0; i < a.length; i++)\n      if (!a[i].eq(b[i])) return false\n    return true\n  }\n\n  // :: (?union<Mark, [Mark]>) → [Mark]\n  // Create a properly sorted mark set from null, a single mark, or an\n  // unsorted array of marks.\n  static setFrom(marks) {\n    if (!marks || marks.length == 0) return Mark.none\n    if (marks instanceof Mark) return [marks]\n    let copy = marks.slice()\n    copy.sort((a, b) => a.type.rank - b.type.rank)\n    return copy\n  }\n}\n\n// :: [Mark] The empty set of marks.\nMark.none = []\n","import {Fragment} from \"./fragment\"\n\n// ReplaceError:: class extends Error\n// Error type raised by [`Node.replace`](#model.Node.replace) when\n// given an invalid replacement.\n\nexport function ReplaceError(message) {\n  let err = Error.call(this, message)\n  err.__proto__ = ReplaceError.prototype\n  return err\n}\n\nReplaceError.prototype = Object.create(Error.prototype)\nReplaceError.prototype.constructor = ReplaceError\nReplaceError.prototype.name = \"ReplaceError\"\n\n// ::- A slice represents a piece cut out of a larger document. It\n// stores not only a fragment, but also the depth up to which nodes on\n// both side are ‘open’ (cut through).\nexport class Slice {\n  // :: (Fragment, number, number)\n  // Create a slice. When specifying a non-zero open depth, you must\n  // make sure that there are nodes of at least that depth at the\n  // appropriate side of the fragment—i.e. if the fragment is an empty\n  // paragraph node, `openStart` and `openEnd` can't be greater than 1.\n  //\n  // It is not necessary for the content of open nodes to conform to\n  // the schema's content constraints, though it should be a valid\n  // start/end/middle for such a node, depending on which sides are\n  // open.\n  constructor(content, openStart, openEnd) {\n    // :: Fragment The slice's content.\n    this.content = content\n    // :: number The open depth at the start.\n    this.openStart = openStart\n    // :: number The open depth at the end.\n    this.openEnd = openEnd\n  }\n\n  // :: number\n  // The size this slice would add when inserted into a document.\n  get size() {\n    return this.content.size - this.openStart - this.openEnd\n  }\n\n  insertAt(pos, fragment) {\n    let content = insertInto(this.content, pos + this.openStart, fragment, null)\n    return content && new Slice(content, this.openStart, this.openEnd)\n  }\n\n  removeBetween(from, to) {\n    return new Slice(removeRange(this.content, from + this.openStart, to + this.openStart), this.openStart, this.openEnd)\n  }\n\n  // :: (Slice) → bool\n  // Tests whether this slice is equal to another slice.\n  eq(other) {\n    return this.content.eq(other.content) && this.openStart == other.openStart && this.openEnd == other.openEnd\n  }\n\n  toString() {\n    return this.content + \"(\" + this.openStart + \",\" + this.openEnd + \")\"\n  }\n\n  // :: () → ?Object\n  // Convert a slice to a JSON-serializable representation.\n  toJSON() {\n    if (!this.content.size) return null\n    let json = {content: this.content.toJSON()}\n    if (this.openStart > 0) json.openStart = this.openStart\n    if (this.openEnd > 0) json.openEnd = this.openEnd\n    return json\n  }\n\n  // :: (Schema, ?Object) → Slice\n  // Deserialize a slice from its JSON representation.\n  static fromJSON(schema, json) {\n    if (!json) return Slice.empty\n    let openStart = json.openStart || 0, openEnd = json.openEnd || 0\n    if (typeof openStart != \"number\" || typeof openEnd != \"number\")\n      throw new RangeError(\"Invalid input for Slice.fromJSON\")\n    return new Slice(Fragment.fromJSON(schema, json.content), openStart, openEnd)\n  }\n\n  // :: (Fragment, ?bool) → Slice\n  // Create a slice from a fragment by taking the maximum possible\n  // open value on both side of the fragment.\n  static maxOpen(fragment, openIsolating=true) {\n    let openStart = 0, openEnd = 0\n    for (let n = fragment.firstChild; n && !n.isLeaf && (openIsolating || !n.type.spec.isolating); n = n.firstChild) openStart++\n    for (let n = fragment.lastChild; n && !n.isLeaf && (openIsolating || !n.type.spec.isolating); n = n.lastChild) openEnd++\n    return new Slice(fragment, openStart, openEnd)\n  }\n}\n\nfunction removeRange(content, from, to) {\n  let {index, offset} = content.findIndex(from), child = content.maybeChild(index)\n  let {index: indexTo, offset: offsetTo} = content.findIndex(to)\n  if (offset == from || child.isText) {\n    if (offsetTo != to && !content.child(indexTo).isText) throw new RangeError(\"Removing non-flat range\")\n    return content.cut(0, from).append(content.cut(to))\n  }\n  if (index != indexTo) throw new RangeError(\"Removing non-flat range\")\n  return content.replaceChild(index, child.copy(removeRange(child.content, from - offset - 1, to - offset - 1)))\n}\n\nfunction insertInto(content, dist, insert, parent) {\n  let {index, offset} = content.findIndex(dist), child = content.maybeChild(index)\n  if (offset == dist || child.isText) {\n    if (parent && !parent.canReplace(index, index, insert)) return null\n    return content.cut(0, dist).append(insert).append(content.cut(dist))\n  }\n  let inner = insertInto(child.content, dist - offset - 1, insert)\n  return inner && content.replaceChild(index, child.copy(inner))\n}\n\n// :: Slice\n// The empty slice.\nSlice.empty = new Slice(Fragment.empty, 0, 0)\n\nexport function replace($from, $to, slice) {\n  if (slice.openStart > $from.depth)\n    throw new ReplaceError(\"Inserted content deeper than insertion position\")\n  if ($from.depth - slice.openStart != $to.depth - slice.openEnd)\n    throw new ReplaceError(\"Inconsistent open depths\")\n  return replaceOuter($from, $to, slice, 0)\n}\n\nfunction replaceOuter($from, $to, slice, depth) {\n  let index = $from.index(depth), node = $from.node(depth)\n  if (index == $to.index(depth) && depth < $from.depth - slice.openStart) {\n    let inner = replaceOuter($from, $to, slice, depth + 1)\n    return node.copy(node.content.replaceChild(index, inner))\n  } else if (!slice.content.size) {\n    return close(node, replaceTwoWay($from, $to, depth))\n  } else if (!slice.openStart && !slice.openEnd && $from.depth == depth && $to.depth == depth) { // Simple, flat case\n    let parent = $from.parent, content = parent.content\n    return close(parent, content.cut(0, $from.parentOffset).append(slice.content).append(content.cut($to.parentOffset)))\n  } else {\n    let {start, end} = prepareSliceForReplace(slice, $from)\n    return close(node, replaceThreeWay($from, start, end, $to, depth))\n  }\n}\n\nfunction checkJoin(main, sub) {\n  if (!sub.type.compatibleContent(main.type))\n    throw new ReplaceError(\"Cannot join \" + sub.type.name + \" onto \" + main.type.name)\n}\n\nfunction joinable($before, $after, depth) {\n  let node = $before.node(depth)\n  checkJoin(node, $after.node(depth))\n  return node\n}\n\nfunction addNode(child, target) {\n  let last = target.length - 1\n  if (last >= 0 && child.isText && child.sameMarkup(target[last]))\n    target[last] = child.withText(target[last].text + child.text)\n  else\n    target.push(child)\n}\n\nfunction addRange($start, $end, depth, target) {\n  let node = ($end || $start).node(depth)\n  let startIndex = 0, endIndex = $end ? $end.index(depth) : node.childCount\n  if ($start) {\n    startIndex = $start.index(depth)\n    if ($start.depth > depth) {\n      startIndex++\n    } else if ($start.textOffset) {\n      addNode($start.nodeAfter, target)\n      startIndex++\n    }\n  }\n  for (let i = startIndex; i < endIndex; i++) addNode(node.child(i), target)\n  if ($end && $end.depth == depth && $end.textOffset)\n    addNode($end.nodeBefore, target)\n}\n\nfunction close(node, content) {\n  if (!node.type.validContent(content))\n    throw new ReplaceError(\"Invalid content for node \" + node.type.name)\n  return node.copy(content)\n}\n\nfunction replaceThreeWay($from, $start, $end, $to, depth) {\n  let openStart = $from.depth > depth && joinable($from, $start, depth + 1)\n  let openEnd = $to.depth > depth && joinable($end, $to, depth + 1)\n\n  let content = []\n  addRange(null, $from, depth, content)\n  if (openStart && openEnd && $start.index(depth) == $end.index(depth)) {\n    checkJoin(openStart, openEnd)\n    addNode(close(openStart, replaceThreeWay($from, $start, $end, $to, depth + 1)), content)\n  } else {\n    if (openStart)\n      addNode(close(openStart, replaceTwoWay($from, $start, depth + 1)), content)\n    addRange($start, $end, depth, content)\n    if (openEnd)\n      addNode(close(openEnd, replaceTwoWay($end, $to, depth + 1)), content)\n  }\n  addRange($to, null, depth, content)\n  return new Fragment(content)\n}\n\nfunction replaceTwoWay($from, $to, depth) {\n  let content = []\n  addRange(null, $from, depth, content)\n  if ($from.depth > depth) {\n    let type = joinable($from, $to, depth + 1)\n    addNode(close(type, replaceTwoWay($from, $to, depth + 1)), content)\n  }\n  addRange($to, null, depth, content)\n  return new Fragment(content)\n}\n\nfunction prepareSliceForReplace(slice, $along) {\n  let extra = $along.depth - slice.openStart, parent = $along.node(extra)\n  let node = parent.copy(slice.content)\n  for (let i = extra - 1; i >= 0; i--)\n    node = $along.node(i).copy(Fragment.from(node))\n  return {start: node.resolveNoCache(slice.openStart + extra),\n          end: node.resolveNoCache(node.content.size - slice.openEnd - extra)}\n}\n","import {Mark} from \"./mark\"\n\n// ::- You can [_resolve_](#model.Node.resolve) a position to get more\n// information about it. Objects of this class represent such a\n// resolved position, providing various pieces of context information,\n// and some helper methods.\n//\n// Throughout this interface, methods that take an optional `depth`\n// parameter will interpret undefined as `this.depth` and negative\n// numbers as `this.depth + value`.\nexport class ResolvedPos {\n  constructor(pos, path, parentOffset) {\n    // :: number The position that was resolved.\n    this.pos = pos\n    this.path = path\n    // :: number\n    // The number of levels the parent node is from the root. If this\n    // position points directly into the root node, it is 0. If it\n    // points into a top-level paragraph, 1, and so on.\n    this.depth = path.length / 3 - 1\n    // :: number The offset this position has into its parent node.\n    this.parentOffset = parentOffset\n  }\n\n  resolveDepth(val) {\n    if (val == null) return this.depth\n    if (val < 0) return this.depth + val\n    return val\n  }\n\n  // :: Node\n  // The parent node that the position points into. Note that even if\n  // a position points into a text node, that node is not considered\n  // the parent—text nodes are ‘flat’ in this model, and have no content.\n  get parent() { return this.node(this.depth) }\n\n  // :: Node\n  // The root node in which the position was resolved.\n  get doc() { return this.node(0) }\n\n  // :: (?number) → Node\n  // The ancestor node at the given level. `p.node(p.depth)` is the\n  // same as `p.parent`.\n  node(depth) { return this.path[this.resolveDepth(depth) * 3] }\n\n  // :: (?number) → number\n  // The index into the ancestor at the given level. If this points at\n  // the 3rd node in the 2nd paragraph on the top level, for example,\n  // `p.index(0)` is 1 and `p.index(1)` is 2.\n  index(depth) { return this.path[this.resolveDepth(depth) * 3 + 1] }\n\n  // :: (?number) → number\n  // The index pointing after this position into the ancestor at the\n  // given level.\n  indexAfter(depth) {\n    depth = this.resolveDepth(depth)\n    return this.index(depth) + (depth == this.depth && !this.textOffset ? 0 : 1)\n  }\n\n  // :: (?number) → number\n  // The (absolute) position at the start of the node at the given\n  // level.\n  start(depth) {\n    depth = this.resolveDepth(depth)\n    return depth == 0 ? 0 : this.path[depth * 3 - 1] + 1\n  }\n\n  // :: (?number) → number\n  // The (absolute) position at the end of the node at the given\n  // level.\n  end(depth) {\n    depth = this.resolveDepth(depth)\n    return this.start(depth) + this.node(depth).content.size\n  }\n\n  // :: (?number) → number\n  // The (absolute) position directly before the wrapping node at the\n  // given level, or, when `depth` is `this.depth + 1`, the original\n  // position.\n  before(depth) {\n    depth = this.resolveDepth(depth)\n    if (!depth) throw new RangeError(\"There is no position before the top-level node\")\n    return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1]\n  }\n\n  // :: (?number) → number\n  // The (absolute) position directly after the wrapping node at the\n  // given level, or the original position when `depth` is `this.depth + 1`.\n  after(depth) {\n    depth = this.resolveDepth(depth)\n    if (!depth) throw new RangeError(\"There is no position after the top-level node\")\n    return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1] + this.path[depth * 3].nodeSize\n  }\n\n  // :: number\n  // When this position points into a text node, this returns the\n  // distance between the position and the start of the text node.\n  // Will be zero for positions that point between nodes.\n  get textOffset() { return this.pos - this.path[this.path.length - 1] }\n\n  // :: ?Node\n  // Get the node directly after the position, if any. If the position\n  // points into a text node, only the part of that node after the\n  // position is returned.\n  get nodeAfter() {\n    let parent = this.parent, index = this.index(this.depth)\n    if (index == parent.childCount) return null\n    let dOff = this.pos - this.path[this.path.length - 1], child = parent.child(index)\n    return dOff ? parent.child(index).cut(dOff) : child\n  }\n\n  // :: ?Node\n  // Get the node directly before the position, if any. If the\n  // position points into a text node, only the part of that node\n  // before the position is returned.\n  get nodeBefore() {\n    let index = this.index(this.depth)\n    let dOff = this.pos - this.path[this.path.length - 1]\n    if (dOff) return this.parent.child(index).cut(0, dOff)\n    return index == 0 ? null : this.parent.child(index - 1)\n  }\n\n  // :: (number, ?number) → number\n  // Get the position at the given index in the parent node at the\n  // given depth (which defaults to `this.depth`).\n  posAtIndex(index, depth) {\n    depth = this.resolveDepth(depth)\n    let node = this.path[depth * 3], pos = depth == 0 ? 0 : this.path[depth * 3 - 1] + 1\n    for (let i = 0; i < index; i++) pos += node.child(i).nodeSize\n    return pos\n  }\n\n  // :: () → [Mark]\n  // Get the marks at this position, factoring in the surrounding\n  // marks' [`inclusive`](#model.MarkSpec.inclusive) property. If the\n  // position is at the start of a non-empty node, the marks of the\n  // node after it (if any) are returned.\n  marks() {\n    let parent = this.parent, index = this.index()\n\n    // In an empty parent, return the empty array\n    if (parent.content.size == 0) return Mark.none\n\n    // When inside a text node, just return the text node's marks\n    if (this.textOffset) return parent.child(index).marks\n\n    let main = parent.maybeChild(index - 1), other = parent.maybeChild(index)\n    // If the `after` flag is true of there is no node before, make\n    // the node after this position the main reference.\n    if (!main) { let tmp = main; main = other; other = tmp }\n\n    // Use all marks in the main node, except those that have\n    // `inclusive` set to false and are not present in the other node.\n    let marks = main.marks\n    for (var i = 0; i < marks.length; i++)\n      if (marks[i].type.spec.inclusive === false && (!other || !marks[i].isInSet(other.marks)))\n        marks = marks[i--].removeFromSet(marks)\n\n    return marks\n  }\n\n  // :: (ResolvedPos) → ?[Mark]\n  // Get the marks after the current position, if any, except those\n  // that are non-inclusive and not present at position `$end`. This\n  // is mostly useful for getting the set of marks to preserve after a\n  // deletion. Will return `null` if this position is at the end of\n  // its parent node or its parent node isn't a textblock (in which\n  // case no marks should be preserved).\n  marksAcross($end) {\n    let after = this.parent.maybeChild(this.index())\n    if (!after || !after.isInline) return null\n\n    let marks = after.marks, next = $end.parent.maybeChild($end.index())\n    for (var i = 0; i < marks.length; i++)\n      if (marks[i].type.spec.inclusive === false && (!next || !marks[i].isInSet(next.marks)))\n        marks = marks[i--].removeFromSet(marks)\n    return marks\n  }\n\n  // :: (number) → number\n  // The depth up to which this position and the given (non-resolved)\n  // position share the same parent nodes.\n  sharedDepth(pos) {\n    for (let depth = this.depth; depth > 0; depth--)\n      if (this.start(depth) <= pos && this.end(depth) >= pos) return depth\n    return 0\n  }\n\n  // :: (?ResolvedPos, ?(Node) → bool) → ?NodeRange\n  // Returns a range based on the place where this position and the\n  // given position diverge around block content. If both point into\n  // the same textblock, for example, a range around that textblock\n  // will be returned. If they point into different blocks, the range\n  // around those blocks in their shared ancestor is returned. You can\n  // pass in an optional predicate that will be called with a parent\n  // node to see if a range into that parent is acceptable.\n  blockRange(other = this, pred) {\n    if (other.pos < this.pos) return other.blockRange(this)\n    for (let d = this.depth - (this.parent.inlineContent || this.pos == other.pos ? 1 : 0); d >= 0; d--)\n      if (other.pos <= this.end(d) && (!pred || pred(this.node(d))))\n        return new NodeRange(this, other, d)\n  }\n\n  // :: (ResolvedPos) → bool\n  // Query whether the given position shares the same parent node.\n  sameParent(other) {\n    return this.pos - this.parentOffset == other.pos - other.parentOffset\n  }\n\n  // :: (ResolvedPos) → ResolvedPos\n  // Return the greater of this and the given position.\n  max(other) {\n    return other.pos > this.pos ? other : this\n  }\n\n  // :: (ResolvedPos) → ResolvedPos\n  // Return the smaller of this and the given position.\n  min(other) {\n    return other.pos < this.pos ? other : this\n  }\n\n  toString() {\n    let str = \"\"\n    for (let i = 1; i <= this.depth; i++)\n      str += (str ? \"/\" : \"\") + this.node(i).type.name + \"_\" + this.index(i - 1)\n    return str + \":\" + this.parentOffset\n  }\n\n  static resolve(doc, pos) {\n    if (!(pos >= 0 && pos <= doc.content.size)) throw new RangeError(\"Position \" + pos + \" out of range\")\n    let path = []\n    let start = 0, parentOffset = pos\n    for (let node = doc;;) {\n      let {index, offset} = node.content.findIndex(parentOffset)\n      let rem = parentOffset - offset\n      path.push(node, index, start + offset)\n      if (!rem) break\n      node = node.child(index)\n      if (node.isText) break\n      parentOffset = rem - 1\n      start += offset + 1\n    }\n    return new ResolvedPos(pos, path, parentOffset)\n  }\n\n  static resolveCached(doc, pos) {\n    for (let i = 0; i < resolveCache.length; i++) {\n      let cached = resolveCache[i]\n      if (cached.pos == pos && cached.doc == doc) return cached\n    }\n    let result = resolveCache[resolveCachePos] = ResolvedPos.resolve(doc, pos)\n    resolveCachePos = (resolveCachePos + 1) % resolveCacheSize\n    return result\n  }\n}\n\nlet resolveCache = [], resolveCachePos = 0, resolveCacheSize = 12\n\n// ::- Represents a flat range of content, i.e. one that starts and\n// ends in the same node.\nexport class NodeRange {\n  // :: (ResolvedPos, ResolvedPos, number)\n  // Construct a node range. `$from` and `$to` should point into the\n  // same node until at least the given `depth`, since a node range\n  // denotes an adjacent set of nodes in a single parent node.\n  constructor($from, $to, depth) {\n    // :: ResolvedPos A resolved position along the start of the\n    // content. May have a `depth` greater than this object's `depth`\n    // property, since these are the positions that were used to\n    // compute the range, not re-resolved positions directly at its\n    // boundaries.\n    this.$from = $from\n    // :: ResolvedPos A position along the end of the content. See\n    // caveat for [`$from`](#model.NodeRange.$from).\n    this.$to = $to\n    // :: number The depth of the node that this range points into.\n    this.depth = depth\n  }\n\n  // :: number The position at the start of the range.\n  get start() { return this.$from.before(this.depth + 1) }\n  // :: number The position at the end of the range.\n  get end() { return this.$to.after(this.depth + 1) }\n\n  // :: Node The parent node that the range points into.\n  get parent() { return this.$from.node(this.depth) }\n  // :: number The start index of the range in the parent node.\n  get startIndex() { return this.$from.index(this.depth) }\n  // :: number The end index of the range in the parent node.\n  get endIndex() { return this.$to.indexAfter(this.depth) }\n}\n","import {Fragment} from \"./fragment\"\nimport {Mark} from \"./mark\"\nimport {Slice, replace} from \"./replace\"\nimport {ResolvedPos} from \"./resolvedpos\"\nimport {compareDeep} from \"./comparedeep\"\n\nconst emptyAttrs = Object.create(null)\n\n// ::- This class represents a node in the tree that makes up a\n// ProseMirror document. So a document is an instance of `Node`, with\n// children that are also instances of `Node`.\n//\n// Nodes are persistent data structures. Instead of changing them, you\n// create new ones with the content you want. Old ones keep pointing\n// at the old document shape. This is made cheaper by sharing\n// structure between the old and new data as much as possible, which a\n// tree shape like this (without back pointers) makes easy.\n//\n// **Do not** directly mutate the properties of a `Node` object. See\n// [the guide](/docs/guide/#doc) for more information.\nexport class Node {\n  constructor(type, attrs, content, marks) {\n    // :: NodeType\n    // The type of node that this is.\n    this.type = type\n\n    // :: Object\n    // An object mapping attribute names to values. The kind of\n    // attributes allowed and required are\n    // [determined](#model.NodeSpec.attrs) by the node type.\n    this.attrs = attrs\n\n    // :: Fragment\n    // A container holding the node's children.\n    this.content = content || Fragment.empty\n\n    // :: [Mark]\n    // The marks (things like whether it is emphasized or part of a\n    // link) applied to this node.\n    this.marks = marks || Mark.none\n  }\n\n  // text:: ?string\n  // For text nodes, this contains the node's text content.\n\n  // :: number\n  // The size of this node, as defined by the integer-based [indexing\n  // scheme](/docs/guide/#doc.indexing). For text nodes, this is the\n  // amount of characters. For other leaf nodes, it is one. For\n  // non-leaf nodes, it is the size of the content plus two (the start\n  // and end token).\n  get nodeSize() { return this.isLeaf ? 1 : 2 + this.content.size }\n\n  // :: number\n  // The number of children that the node has.\n  get childCount() { return this.content.childCount }\n\n  // :: (number) → Node\n  // Get the child node at the given index. Raises an error when the\n  // index is out of range.\n  child(index) { return this.content.child(index) }\n\n  // :: (number) → ?Node\n  // Get the child node at the given index, if it exists.\n  maybeChild(index) { return this.content.maybeChild(index) }\n\n  // :: ((node: Node, offset: number, index: number))\n  // Call `f` for every child node, passing the node, its offset\n  // into this parent node, and its index.\n  forEach(f) { this.content.forEach(f) }\n\n  // :: (number, number, (node: Node, pos: number, parent: Node, index: number) → ?bool, ?number)\n  // Invoke a callback for all descendant nodes recursively between\n  // the given two positions that are relative to start of this node's\n  // content. The callback is invoked with the node, its\n  // parent-relative position, its parent node, and its child index.\n  // When the callback returns false for a given node, that node's\n  // children will not be recursed over. The last parameter can be\n  // used to specify a starting position to count from.\n  nodesBetween(from, to, f, startPos = 0) {\n    this.content.nodesBetween(from, to, f, startPos, this)\n  }\n\n  // :: ((node: Node, pos: number, parent: Node) → ?bool)\n  // Call the given callback for every descendant node. Doesn't\n  // descend into a node when the callback returns `false`.\n  descendants(f) {\n    this.nodesBetween(0, this.content.size, f)\n  }\n\n  // :: string\n  // Concatenates all the text nodes found in this fragment and its\n  // children.\n  get textContent() { return this.textBetween(0, this.content.size, \"\") }\n\n  // :: (number, number, ?string, ?string) → string\n  // Get all text between positions `from` and `to`. When\n  // `blockSeparator` is given, it will be inserted whenever a new\n  // block node is started. When `leafText` is given, it'll be\n  // inserted for every non-text leaf node encountered.\n  textBetween(from, to, blockSeparator, leafText) {\n    return this.content.textBetween(from, to, blockSeparator, leafText)\n  }\n\n  // :: ?Node\n  // Returns this node's first child, or `null` if there are no\n  // children.\n  get firstChild() { return this.content.firstChild }\n\n  // :: ?Node\n  // Returns this node's last child, or `null` if there are no\n  // children.\n  get lastChild() { return this.content.lastChild }\n\n  // :: (Node) → bool\n  // Test whether two nodes represent the same piece of document.\n  eq(other) {\n    return this == other || (this.sameMarkup(other) && this.content.eq(other.content))\n  }\n\n  // :: (Node) → bool\n  // Compare the markup (type, attributes, and marks) of this node to\n  // those of another. Returns `true` if both have the same markup.\n  sameMarkup(other) {\n    return this.hasMarkup(other.type, other.attrs, other.marks)\n  }\n\n  // :: (NodeType, ?Object, ?[Mark]) → bool\n  // Check whether this node's markup correspond to the given type,\n  // attributes, and marks.\n  hasMarkup(type, attrs, marks) {\n    return this.type == type &&\n      compareDeep(this.attrs, attrs || type.defaultAttrs || emptyAttrs) &&\n      Mark.sameSet(this.marks, marks || Mark.none)\n  }\n\n  // :: (?Fragment) → Node\n  // Create a new node with the same markup as this node, containing\n  // the given content (or empty, if no content is given).\n  copy(content = null) {\n    if (content == this.content) return this\n    return new this.constructor(this.type, this.attrs, content, this.marks)\n  }\n\n  // :: ([Mark]) → Node\n  // Create a copy of this node, with the given set of marks instead\n  // of the node's own marks.\n  mark(marks) {\n    return marks == this.marks ? this : new this.constructor(this.type, this.attrs, this.content, marks)\n  }\n\n  // :: (number, ?number) → Node\n  // Create a copy of this node with only the content between the\n  // given positions. If `to` is not given, it defaults to the end of\n  // the node.\n  cut(from, to) {\n    if (from == 0 && to == this.content.size) return this\n    return this.copy(this.content.cut(from, to))\n  }\n\n  // :: (number, ?number) → Slice\n  // Cut out the part of the document between the given positions, and\n  // return it as a `Slice` object.\n  slice(from, to = this.content.size, includeParents = false) {\n    if (from == to) return Slice.empty\n\n    let $from = this.resolve(from), $to = this.resolve(to)\n    let depth = includeParents ? 0 : $from.sharedDepth(to)\n    let start = $from.start(depth), node = $from.node(depth)\n    let content = node.content.cut($from.pos - start, $to.pos - start)\n    return new Slice(content, $from.depth - depth, $to.depth - depth)\n  }\n\n  // :: (number, number, Slice) → Node\n  // Replace the part of the document between the given positions with\n  // the given slice. The slice must 'fit', meaning its open sides\n  // must be able to connect to the surrounding content, and its\n  // content nodes must be valid children for the node they are placed\n  // into. If any of this is violated, an error of type\n  // [`ReplaceError`](#model.ReplaceError) is thrown.\n  replace(from, to, slice) {\n    return replace(this.resolve(from), this.resolve(to), slice)\n  }\n\n  // :: (number) → ?Node\n  // Find the node directly after the given position.\n  nodeAt(pos) {\n    for (let node = this;;) {\n      let {index, offset} = node.content.findIndex(pos)\n      node = node.maybeChild(index)\n      if (!node) return null\n      if (offset == pos || node.isText) return node\n      pos -= offset + 1\n    }\n  }\n\n  // :: (number) → {node: ?Node, index: number, offset: number}\n  // Find the (direct) child node after the given offset, if any,\n  // and return it along with its index and offset relative to this\n  // node.\n  childAfter(pos) {\n    let {index, offset} = this.content.findIndex(pos)\n    return {node: this.content.maybeChild(index), index, offset}\n  }\n\n  // :: (number) → {node: ?Node, index: number, offset: number}\n  // Find the (direct) child node before the given offset, if any,\n  // and return it along with its index and offset relative to this\n  // node.\n  childBefore(pos) {\n    if (pos == 0) return {node: null, index: 0, offset: 0}\n    let {index, offset} = this.content.findIndex(pos)\n    if (offset < pos) return {node: this.content.child(index), index, offset}\n    let node = this.content.child(index - 1)\n    return {node, index: index - 1, offset: offset - node.nodeSize}\n  }\n\n  // :: (number) → ResolvedPos\n  // Resolve the given position in the document, returning an\n  // [object](#model.ResolvedPos) with information about its context.\n  resolve(pos) { return ResolvedPos.resolveCached(this, pos) }\n\n  resolveNoCache(pos) { return ResolvedPos.resolve(this, pos) }\n\n  // :: (number, number, union<Mark, MarkType>) → bool\n  // Test whether a given mark or mark type occurs in this document\n  // between the two given positions.\n  rangeHasMark(from, to, type) {\n    let found = false\n    if (to > from) this.nodesBetween(from, to, node => {\n      if (type.isInSet(node.marks)) found = true\n      return !found\n    })\n    return found\n  }\n\n  // :: bool\n  // True when this is a block (non-inline node)\n  get isBlock() { return this.type.isBlock }\n\n  // :: bool\n  // True when this is a textblock node, a block node with inline\n  // content.\n  get isTextblock() { return this.type.isTextblock }\n\n  // :: bool\n  // True when this node allows inline content.\n  get inlineContent() { return this.type.inlineContent }\n\n  // :: bool\n  // True when this is an inline node (a text node or a node that can\n  // appear among text).\n  get isInline() { return this.type.isInline }\n\n  // :: bool\n  // True when this is a text node.\n  get isText() { return this.type.isText }\n\n  // :: bool\n  // True when this is a leaf node.\n  get isLeaf() { return this.type.isLeaf }\n\n  // :: bool\n  // True when this is an atom, i.e. when it does not have directly\n  // editable content. This is usually the same as `isLeaf`, but can\n  // be configured with the [`atom` property](#model.NodeSpec.atom) on\n  // a node's spec (typically used when the node is displayed as an\n  // uneditable [node view](#view.NodeView)).\n  get isAtom() { return this.type.isAtom }\n\n  // :: () → string\n  // Return a string representation of this node for debugging\n  // purposes.\n  toString() {\n    if (this.type.spec.toDebugString) return this.type.spec.toDebugString(this)\n    let name = this.type.name\n    if (this.content.size)\n      name += \"(\" + this.content.toStringInner() + \")\"\n    return wrapMarks(this.marks, name)\n  }\n\n  // :: (number) → ContentMatch\n  // Get the content match in this node at the given index.\n  contentMatchAt(index) {\n    let match = this.type.contentMatch.matchFragment(this.content, 0, index)\n    if (!match) throw new Error(\"Called contentMatchAt on a node with invalid content\")\n    return match\n  }\n\n  // :: (number, number, ?Fragment, ?number, ?number) → bool\n  // Test whether replacing the range between `from` and `to` (by\n  // child index) with the given replacement fragment (which defaults\n  // to the empty fragment) would leave the node's content valid. You\n  // can optionally pass `start` and `end` indices into the\n  // replacement fragment.\n  canReplace(from, to, replacement = Fragment.empty, start = 0, end = replacement.childCount) {\n    let one = this.contentMatchAt(from).matchFragment(replacement, start, end)\n    let two = one && one.matchFragment(this.content, to)\n    if (!two || !two.validEnd) return false\n    for (let i = start; i < end; i++) if (!this.type.allowsMarks(replacement.child(i).marks)) return false\n    return true\n  }\n\n  // :: (number, number, NodeType, ?[Mark]) → bool\n  // Test whether replacing the range `from` to `to` (by index) with a\n  // node of the given type would leave the node's content valid.\n  canReplaceWith(from, to, type, marks) {\n    if (marks && !this.type.allowsMarks(marks)) return false\n    let start = this.contentMatchAt(from).matchType(type)\n    let end = start && start.matchFragment(this.content, to)\n    return end ? end.validEnd : false\n  }\n\n  // :: (Node) → bool\n  // Test whether the given node's content could be appended to this\n  // node. If that node is empty, this will only return true if there\n  // is at least one node type that can appear in both nodes (to avoid\n  // merging completely incompatible nodes).\n  canAppend(other) {\n    if (other.content.size) return this.canReplace(this.childCount, this.childCount, other.content)\n    else return this.type.compatibleContent(other.type)\n  }\n\n  // :: ()\n  // Check whether this node and its descendants conform to the\n  // schema, and raise error when they do not.\n  check() {\n    if (!this.type.validContent(this.content))\n      throw new RangeError(`Invalid content for node ${this.type.name}: ${this.content.toString().slice(0, 50)}`)\n    this.content.forEach(node => node.check())\n  }\n\n  // :: () → Object\n  // Return a JSON-serializeable representation of this node.\n  toJSON() {\n    let obj = {type: this.type.name}\n    for (let _ in this.attrs) {\n      obj.attrs = this.attrs\n      break\n    }\n    if (this.content.size)\n      obj.content = this.content.toJSON()\n    if (this.marks.length)\n      obj.marks = this.marks.map(n => n.toJSON())\n    return obj\n  }\n\n  // :: (Schema, Object) → Node\n  // Deserialize a node from its JSON representation.\n  static fromJSON(schema, json) {\n    if (!json) throw new RangeError(\"Invalid input for Node.fromJSON\")\n    let marks = null\n    if (json.marks) {\n      if (!Array.isArray(json.marks)) throw new RangeError(\"Invalid mark data for Node.fromJSON\")\n      marks = json.marks.map(schema.markFromJSON)\n    }\n    if (json.type == \"text\") {\n      if (typeof json.text != \"string\") throw new RangeError(\"Invalid text node in JSON\")\n      return schema.text(json.text, marks)\n    }\n    let content = Fragment.fromJSON(schema, json.content)\n    return schema.nodeType(json.type).create(json.attrs, content, marks)\n  }\n}\n\nexport class TextNode extends Node {\n  constructor(type, attrs, content, marks) {\n    super(type, attrs, null, marks)\n\n    if (!content) throw new RangeError(\"Empty text nodes are not allowed\")\n\n    this.text = content\n  }\n\n  toString() {\n    if (this.type.spec.toDebugString) return this.type.spec.toDebugString(this)\n    return wrapMarks(this.marks, JSON.stringify(this.text))\n  }\n\n  get textContent() { return this.text }\n\n  textBetween(from, to) { return this.text.slice(from, to) }\n\n  get nodeSize() { return this.text.length }\n\n  mark(marks) {\n    return marks == this.marks ? this : new TextNode(this.type, this.attrs, this.text, marks)\n  }\n\n  withText(text) {\n    if (text == this.text) return this\n    return new TextNode(this.type, this.attrs, text, this.marks)\n  }\n\n  cut(from = 0, to = this.text.length) {\n    if (from == 0 && to == this.text.length) return this\n    return this.withText(this.text.slice(from, to))\n  }\n\n  eq(other) {\n    return this.sameMarkup(other) && this.text == other.text\n  }\n\n  toJSON() {\n    let base = super.toJSON()\n    base.text = this.text\n    return base\n  }\n}\n\nfunction wrapMarks(marks, str) {\n  for (let i = marks.length - 1; i >= 0; i--)\n    str = marks[i].type.name + \"(\" + str + \")\"\n  return str\n}\n","import {Fragment} from \"./fragment\"\n\n// ::- Instances of this class represent a match state of a node\n// type's [content expression](#model.NodeSpec.content), and can be\n// used to find out whether further content matches here, and whether\n// a given position is a valid end of the node.\nexport class ContentMatch {\n  constructor(validEnd) {\n    // :: bool\n    // True when this match state represents a valid end of the node.\n    this.validEnd = validEnd\n    this.next = []\n    this.wrapCache = []\n  }\n\n  static parse(string, nodeTypes) {\n    let stream = new TokenStream(string, nodeTypes)\n    if (stream.next == null) return ContentMatch.empty\n    let expr = parseExpr(stream)\n    if (stream.next) stream.err(\"Unexpected trailing text\")\n    let match = dfa(nfa(expr))\n    checkForDeadEnds(match, stream)\n    return match\n  }\n\n  // :: (NodeType) → ?ContentMatch\n  // Match a node type, returning a match after that node if\n  // successful.\n  matchType(type) {\n    for (let i = 0; i < this.next.length; i += 2)\n      if (this.next[i] == type) return this.next[i + 1]\n    return null\n  }\n\n  // :: (Fragment, ?number, ?number) → ?ContentMatch\n  // Try to match a fragment. Returns the resulting match when\n  // successful.\n  matchFragment(frag, start = 0, end = frag.childCount) {\n    let cur = this\n    for (let i = start; cur && i < end; i++)\n      cur = cur.matchType(frag.child(i).type)\n    return cur\n  }\n\n  get inlineContent() {\n    let first = this.next[0]\n    return first ? first.isInline : false\n  }\n\n  // :: ?NodeType\n  // Get the first matching node type at this match position that can\n  // be generated.\n  get defaultType() {\n    for (let i = 0; i < this.next.length; i += 2) {\n      let type = this.next[i]\n      if (!(type.isText || type.hasRequiredAttrs())) return type\n    }\n  }\n\n  compatible(other) {\n    for (let i = 0; i < this.next.length; i += 2)\n      for (let j = 0; j < other.next.length; j += 2)\n        if (this.next[i] == other.next[j]) return true\n    return false\n  }\n\n  // :: (Fragment, bool, ?number) → ?Fragment\n  // Try to match the given fragment, and if that fails, see if it can\n  // be made to match by inserting nodes in front of it. When\n  // successful, return a fragment of inserted nodes (which may be\n  // empty if nothing had to be inserted). When `toEnd` is true, only\n  // return a fragment if the resulting match goes to the end of the\n  // content expression.\n  fillBefore(after, toEnd = false, startIndex = 0) {\n    let seen = [this]\n    function search(match, types) {\n      let finished = match.matchFragment(after, startIndex)\n      if (finished && (!toEnd || finished.validEnd))\n        return Fragment.from(types.map(tp => tp.createAndFill()))\n\n      for (let i = 0; i < match.next.length; i += 2) {\n        let type = match.next[i], next = match.next[i + 1]\n        if (!(type.isText || type.hasRequiredAttrs()) && seen.indexOf(next) == -1) {\n          seen.push(next)\n          let found = search(next, types.concat(type))\n          if (found) return found\n        }\n      }\n    }\n\n    return search(this, [])\n  }\n\n  // :: (NodeType) → ?[NodeType]\n  // Find a set of wrapping node types that would allow a node of the\n  // given type to appear at this position. The result may be empty\n  // (when it fits directly) and will be null when no such wrapping\n  // exists.\n  findWrapping(target) {\n    for (let i = 0; i < this.wrapCache.length; i += 2)\n      if (this.wrapCache[i] == target) return this.wrapCache[i + 1]\n    let computed = this.computeWrapping(target)\n    this.wrapCache.push(target, computed)\n    return computed\n  }\n\n  computeWrapping(target) {\n    let seen = Object.create(null), active = [{match: this, type: null, via: null}]\n    while (active.length) {\n      let current = active.shift(), match = current.match\n      if (match.matchType(target)) {\n        let result = []\n        for (let obj = current; obj.type; obj = obj.via)\n          result.push(obj.type)\n        return result.reverse()\n      }\n      for (let i = 0; i < match.next.length; i += 2) {\n        let type = match.next[i]\n        if (!type.isLeaf && !type.hasRequiredAttrs() && !(type.name in seen) && (!current.type || match.next[i + 1].validEnd)) {\n          active.push({match: type.contentMatch, type, via: current})\n          seen[type.name] = true\n        }\n      }\n    }\n  }\n\n  // :: number\n  // The number of outgoing edges this node has in the finite\n  // automaton that describes the content expression.\n  get edgeCount() {\n    return this.next.length >> 1\n  }\n\n  // :: (number) → {type: NodeType, next: ContentMatch}\n  // Get the _n_​th outgoing edge from this node in the finite\n  // automaton that describes the content expression.\n  edge(n) {\n    let i = n << 1\n    if (i >= this.next.length) throw new RangeError(`There's no ${n}th edge in this content match`)\n    return {type: this.next[i], next: this.next[i + 1]}\n  }\n\n  toString() {\n    let seen = []\n    function scan(m) {\n      seen.push(m)\n      for (let i = 1; i < m.next.length; i += 2)\n        if (seen.indexOf(m.next[i]) == -1) scan(m.next[i])\n    }\n    scan(this)\n    return seen.map((m, i) => {\n      let out = i + (m.validEnd ? \"*\" : \" \") + \" \"\n      for (let i = 0; i < m.next.length; i += 2)\n        out += (i ? \", \" : \"\") + m.next[i].name + \"->\" + seen.indexOf(m.next[i + 1])\n      return out\n    }).join(\"\\n\")\n  }\n}\n\nContentMatch.empty = new ContentMatch(true)\n\nclass TokenStream {\n  constructor(string, nodeTypes) {\n    this.string = string\n    this.nodeTypes = nodeTypes\n    this.inline = null\n    this.pos = 0\n    this.tokens = string.split(/\\s*(?=\\b|\\W|$)/)\n    if (this.tokens[this.tokens.length - 1] == \"\") this.tokens.pop()\n    if (this.tokens[0] == \"\") this.tokens.shift()\n  }\n\n  get next() { return this.tokens[this.pos] }\n\n  eat(tok) { return this.next == tok && (this.pos++ || true) }\n\n  err(str) { throw new SyntaxError(str + \" (in content expression '\" + this.string + \"')\") }\n}\n\nfunction parseExpr(stream) {\n  let exprs = []\n  do { exprs.push(parseExprSeq(stream)) }\n  while (stream.eat(\"|\"))\n  return exprs.length == 1 ? exprs[0] : {type: \"choice\", exprs}\n}\n\nfunction parseExprSeq(stream) {\n  let exprs = []\n  do { exprs.push(parseExprSubscript(stream)) }\n  while (stream.next && stream.next != \")\" && stream.next != \"|\")\n  return exprs.length == 1 ? exprs[0] : {type: \"seq\", exprs}\n}\n\nfunction parseExprSubscript(stream) {\n  let expr = parseExprAtom(stream)\n  for (;;) {\n    if (stream.eat(\"+\"))\n      expr = {type: \"plus\", expr}\n    else if (stream.eat(\"*\"))\n      expr = {type: \"star\", expr}\n    else if (stream.eat(\"?\"))\n      expr = {type: \"opt\", expr}\n    else if (stream.eat(\"{\"))\n      expr = parseExprRange(stream, expr)\n    else break\n  }\n  return expr\n}\n\nfunction parseNum(stream) {\n  if (/\\D/.test(stream.next)) stream.err(\"Expected number, got '\" + stream.next + \"'\")\n  let result = Number(stream.next)\n  stream.pos++\n  return result\n}\n\nfunction parseExprRange(stream, expr) {\n  let min = parseNum(stream), max = min\n  if (stream.eat(\",\")) {\n    if (stream.next != \"}\") max = parseNum(stream)\n    else max = -1\n  }\n  if (!stream.eat(\"}\")) stream.err(\"Unclosed braced range\")\n  return {type: \"range\", min, max, expr}\n}\n\nfunction resolveName(stream, name) {\n  let types = stream.nodeTypes, type = types[name]\n  if (type) return [type]\n  let result = []\n  for (let typeName in types) {\n    let type = types[typeName]\n    if (type.groups.indexOf(name) > -1) result.push(type)\n  }\n  if (result.length == 0) stream.err(\"No node type or group '\" + name + \"' found\")\n  return result\n}\n\nfunction parseExprAtom(stream) {\n  if (stream.eat(\"(\")) {\n    let expr = parseExpr(stream)\n    if (!stream.eat(\")\")) stream.err(\"Missing closing paren\")\n    return expr\n  } else if (!/\\W/.test(stream.next)) {\n    let exprs = resolveName(stream, stream.next).map(type => {\n      if (stream.inline == null) stream.inline = type.isInline\n      else if (stream.inline != type.isInline) stream.err(\"Mixing inline and block content\")\n      return {type: \"name\", value: type}\n    })\n    stream.pos++\n    return exprs.length == 1 ? exprs[0] : {type: \"choice\", exprs}\n  } else {\n    stream.err(\"Unexpected token '\" + stream.next + \"'\")\n  }\n}\n\n// The code below helps compile a regular-expression-like language\n// into a deterministic finite automaton. For a good introduction to\n// these concepts, see https://swtch.com/~rsc/regexp/regexp1.html\n\n// : (Object) → [[{term: ?any, to: number}]]\n// Construct an NFA from an expression as returned by the parser. The\n// NFA is represented as an array of states, which are themselves\n// arrays of edges, which are `{term, to}` objects. The first state is\n// the entry state and the last node is the success state.\n//\n// Note that unlike typical NFAs, the edge ordering in this one is\n// significant, in that it is used to contruct filler content when\n// necessary.\nfunction nfa(expr) {\n  let nfa = [[]]\n  connect(compile(expr, 0), node())\n  return nfa\n\n  function node() { return nfa.push([]) - 1 }\n  function edge(from, to, term) {\n    let edge = {term, to}\n    nfa[from].push(edge)\n    return edge\n  }\n  function connect(edges, to) { edges.forEach(edge => edge.to = to) }\n\n  function compile(expr, from) {\n    if (expr.type == \"choice\") {\n      return expr.exprs.reduce((out, expr) => out.concat(compile(expr, from)), [])\n    } else if (expr.type == \"seq\") {\n      for (let i = 0;; i++) {\n        let next = compile(expr.exprs[i], from)\n        if (i == expr.exprs.length - 1) return next\n        connect(next, from = node())\n      }\n    } else if (expr.type == \"star\") {\n      let loop = node()\n      edge(from, loop)\n      connect(compile(expr.expr, loop), loop)\n      return [edge(loop)]\n    } else if (expr.type == \"plus\") {\n      let loop = node()\n      connect(compile(expr.expr, from), loop)\n      connect(compile(expr.expr, loop), loop)\n      return [edge(loop)]\n    } else if (expr.type == \"opt\") {\n      return [edge(from)].concat(compile(expr.expr, from))\n    } else if (expr.type == \"range\") {\n      let cur = from\n      for (let i = 0; i < expr.min; i++) {\n        let next = node()\n        connect(compile(expr.expr, cur), next)\n        cur = next\n      }\n      if (expr.max == -1) {\n        connect(compile(expr.expr, cur), cur)\n      } else {\n        for (let i = expr.min; i < expr.max; i++) {\n          let next = node()\n          edge(cur, next)\n          connect(compile(expr.expr, cur), next)\n          cur = next\n        }\n      }\n      return [edge(cur)]\n    } else if (expr.type == \"name\") {\n      return [edge(from, null, expr.value)]\n    }\n  }\n}\n\nfunction cmp(a, b) { return b - a }\n\n// Get the set of nodes reachable by null edges from `node`. Omit\n// nodes with only a single null-out-edge, since they may lead to\n// needless duplicated nodes.\nfunction nullFrom(nfa, node) {\n  let result = []\n  scan(node)\n  return result.sort(cmp)\n\n  function scan(node) {\n    let edges = nfa[node]\n    if (edges.length == 1 && !edges[0].term) return scan(edges[0].to)\n    result.push(node)\n    for (let i = 0; i < edges.length; i++) {\n      let {term, to} = edges[i]\n      if (!term && result.indexOf(to) == -1) scan(to)\n    }\n  }\n}\n\n// : ([[{term: ?any, to: number}]]) → ContentMatch\n// Compiles an NFA as produced by `nfa` into a DFA, modeled as a set\n// of state objects (`ContentMatch` instances) with transitions\n// between them.\nfunction dfa(nfa) {\n  let labeled = Object.create(null)\n  return explore(nullFrom(nfa, 0))\n\n  function explore(states) {\n    let out = []\n    states.forEach(node => {\n      nfa[node].forEach(({term, to}) => {\n        if (!term) return\n        let known = out.indexOf(term), set = known > -1 && out[known + 1]\n        nullFrom(nfa, to).forEach(node => {\n          if (!set) out.push(term, set = [])\n          if (set.indexOf(node) == -1) set.push(node)\n        })\n      })\n    })\n    let state = labeled[states.join(\",\")] = new ContentMatch(states.indexOf(nfa.length - 1) > -1)\n    for (let i = 0; i < out.length; i += 2) {\n      let states = out[i + 1].sort(cmp)\n      state.next.push(out[i], labeled[states.join(\",\")] || explore(states))\n    }\n    return state\n  }\n}\n\nfunction checkForDeadEnds(match, stream) {\n  for (let i = 0, work = [match]; i < work.length; i++) {\n    let state = work[i], dead = !state.validEnd, nodes = []\n    for (let j = 0; j < state.next.length; j += 2) {\n      let node = state.next[j], next = state.next[j + 1]\n      nodes.push(node.name)\n      if (dead && !(node.isText || node.hasRequiredAttrs())) dead = false\n      if (work.indexOf(next) == -1) work.push(next)\n    }\n    if (dead) stream.err(\"Only non-generatable nodes (\" + nodes.join(\", \") + \") in a required position (see https://prosemirror.net/docs/guide/#generatable)\")\n  }\n}\n","import OrderedMap from \"orderedmap\"\n\nimport {Node, TextNode} from \"./node\"\nimport {Fragment} from \"./fragment\"\nimport {Mark} from \"./mark\"\nimport {ContentMatch} from \"./content\"\n\n// For node types where all attrs have a default value (or which don't\n// have any attributes), build up a single reusable default attribute\n// object, and use it for all nodes that don't specify specific\n// attributes.\nfunction defaultAttrs(attrs) {\n  let defaults = Object.create(null)\n  for (let attrName in attrs) {\n    let attr = attrs[attrName]\n    if (!attr.hasDefault) return null\n    defaults[attrName] = attr.default\n  }\n  return defaults\n}\n\nfunction computeAttrs(attrs, value) {\n  let built = Object.create(null)\n  for (let name in attrs) {\n    let given = value && value[name]\n    if (given === undefined) {\n      let attr = attrs[name]\n      if (attr.hasDefault) given = attr.default\n      else throw new RangeError(\"No value supplied for attribute \" + name)\n    }\n    built[name] = given\n  }\n  return built\n}\n\nfunction initAttrs(attrs) {\n  let result = Object.create(null)\n  if (attrs) for (let name in attrs) result[name] = new Attribute(attrs[name])\n  return result\n}\n\n// ::- Node types are objects allocated once per `Schema` and used to\n// [tag](#model.Node.type) `Node` instances. They contain information\n// about the node type, such as its name and what kind of node it\n// represents.\nexport class NodeType {\n  constructor(name, schema, spec) {\n    // :: string\n    // The name the node type has in this schema.\n    this.name = name\n\n    // :: Schema\n    // A link back to the `Schema` the node type belongs to.\n    this.schema = schema\n\n    // :: NodeSpec\n    // The spec that this type is based on\n    this.spec = spec\n\n    this.groups = spec.group ? spec.group.split(\" \") : []\n    this.attrs = initAttrs(spec.attrs)\n\n    this.defaultAttrs = defaultAttrs(this.attrs)\n\n    // :: ContentMatch\n    // The starting match of the node type's content expression.\n    this.contentMatch = null\n\n    // : ?[MarkType]\n    // The set of marks allowed in this node. `null` means all marks\n    // are allowed.\n    this.markSet = null\n\n    // :: bool\n    // True if this node type has inline content.\n    this.inlineContent = null\n\n    // :: bool\n    // True if this is a block type\n    this.isBlock = !(spec.inline || name == \"text\")\n\n    // :: bool\n    // True if this is the text node type.\n    this.isText = name == \"text\"\n  }\n\n  // :: bool\n  // True if this is an inline type.\n  get isInline() { return !this.isBlock }\n\n  // :: bool\n  // True if this is a textblock type, a block that contains inline\n  // content.\n  get isTextblock() { return this.isBlock && this.inlineContent }\n\n  // :: bool\n  // True for node types that allow no content.\n  get isLeaf() { return this.contentMatch == ContentMatch.empty }\n\n  // :: bool\n  // True when this node is an atom, i.e. when it does not have\n  // directly editable content.\n  get isAtom() { return this.isLeaf || this.spec.atom }\n\n  // :: () → bool\n  // Tells you whether this node type has any required attributes.\n  hasRequiredAttrs() {\n    for (let n in this.attrs) if (this.attrs[n].isRequired) return true\n    return false\n  }\n\n  compatibleContent(other) {\n    return this == other || this.contentMatch.compatible(other.contentMatch)\n  }\n\n  computeAttrs(attrs) {\n    if (!attrs && this.defaultAttrs) return this.defaultAttrs\n    else return computeAttrs(this.attrs, attrs)\n  }\n\n  // :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node\n  // Create a `Node` of this type. The given attributes are\n  // checked and defaulted (you can pass `null` to use the type's\n  // defaults entirely, if no required attributes exist). `content`\n  // may be a `Fragment`, a node, an array of nodes, or\n  // `null`. Similarly `marks` may be `null` to default to the empty\n  // set of marks.\n  create(attrs, content, marks) {\n    if (this.isText) throw new Error(\"NodeType.create can't construct text nodes\")\n    return new Node(this, this.computeAttrs(attrs), Fragment.from(content), Mark.setFrom(marks))\n  }\n\n  // :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node\n  // Like [`create`](#model.NodeType.create), but check the given content\n  // against the node type's content restrictions, and throw an error\n  // if it doesn't match.\n  createChecked(attrs, content, marks) {\n    content = Fragment.from(content)\n    if (!this.validContent(content))\n      throw new RangeError(\"Invalid content for node \" + this.name)\n    return new Node(this, this.computeAttrs(attrs), content, Mark.setFrom(marks))\n  }\n\n  // :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → ?Node\n  // Like [`create`](#model.NodeType.create), but see if it is necessary to\n  // add nodes to the start or end of the given fragment to make it\n  // fit the node. If no fitting wrapping can be found, return null.\n  // Note that, due to the fact that required nodes can always be\n  // created, this will always succeed if you pass null or\n  // `Fragment.empty` as content.\n  createAndFill(attrs, content, marks) {\n    attrs = this.computeAttrs(attrs)\n    content = Fragment.from(content)\n    if (content.size) {\n      let before = this.contentMatch.fillBefore(content)\n      if (!before) return null\n      content = before.append(content)\n    }\n    let after = this.contentMatch.matchFragment(content).fillBefore(Fragment.empty, true)\n    if (!after) return null\n    return new Node(this, attrs, content.append(after), Mark.setFrom(marks))\n  }\n\n  // :: (Fragment) → bool\n  // Returns true if the given fragment is valid content for this node\n  // type with the given attributes.\n  validContent(content) {\n    let result = this.contentMatch.matchFragment(content)\n    if (!result || !result.validEnd) return false\n    for (let i = 0; i < content.childCount; i++)\n      if (!this.allowsMarks(content.child(i).marks)) return false\n    return true\n  }\n\n  // :: (MarkType) → bool\n  // Check whether the given mark type is allowed in this node.\n  allowsMarkType(markType) {\n    return this.markSet == null || this.markSet.indexOf(markType) > -1\n  }\n\n  // :: ([Mark]) → bool\n  // Test whether the given set of marks are allowed in this node.\n  allowsMarks(marks) {\n    if (this.markSet == null) return true\n    for (let i = 0; i < marks.length; i++) if (!this.allowsMarkType(marks[i].type)) return false\n    return true\n  }\n\n  // :: ([Mark]) → [Mark]\n  // Removes the marks that are not allowed in this node from the given set.\n  allowedMarks(marks) {\n    if (this.markSet == null) return marks\n    let copy\n    for (let i = 0; i < marks.length; i++) {\n      if (!this.allowsMarkType(marks[i].type)) {\n        if (!copy) copy = marks.slice(0, i)\n      } else if (copy) {\n        copy.push(marks[i])\n      }\n    }\n    return !copy ? marks : copy.length ? copy : Mark.empty\n  }\n\n  static compile(nodes, schema) {\n    let result = Object.create(null)\n    nodes.forEach((name, spec) => result[name] = new NodeType(name, schema, spec))\n\n    let topType = schema.spec.topNode || \"doc\"\n    if (!result[topType]) throw new RangeError(\"Schema is missing its top node type ('\" + topType + \"')\")\n    if (!result.text) throw new RangeError(\"Every schema needs a 'text' type\")\n    for (let _ in result.text.attrs) throw new RangeError(\"The text node type should not have attributes\")\n\n    return result\n  }\n}\n\n// Attribute descriptors\n\nclass Attribute {\n  constructor(options) {\n    this.hasDefault = Object.prototype.hasOwnProperty.call(options, \"default\")\n    this.default = options.default\n  }\n\n  get isRequired() {\n    return !this.hasDefault\n  }\n}\n\n// Marks\n\n// ::- Like nodes, marks (which are associated with nodes to signify\n// things like emphasis or being part of a link) are\n// [tagged](#model.Mark.type) with type objects, which are\n// instantiated once per `Schema`.\nexport class MarkType {\n  constructor(name, rank, schema, spec) {\n    // :: string\n    // The name of the mark type.\n    this.name = name\n\n    // :: Schema\n    // The schema that this mark type instance is part of.\n    this.schema = schema\n\n    // :: MarkSpec\n    // The spec on which the type is based.\n    this.spec = spec\n\n    this.attrs = initAttrs(spec.attrs)\n\n    this.rank = rank\n    this.excluded = null\n    let defaults = defaultAttrs(this.attrs)\n    this.instance = defaults && new Mark(this, defaults)\n  }\n\n  // :: (?Object) → Mark\n  // Create a mark of this type. `attrs` may be `null` or an object\n  // containing only some of the mark's attributes. The others, if\n  // they have defaults, will be added.\n  create(attrs) {\n    if (!attrs && this.instance) return this.instance\n    return new Mark(this, computeAttrs(this.attrs, attrs))\n  }\n\n  static compile(marks, schema) {\n    let result = Object.create(null), rank = 0\n    marks.forEach((name, spec) => result[name] = new MarkType(name, rank++, schema, spec))\n    return result\n  }\n\n  // :: ([Mark]) → [Mark]\n  // When there is a mark of this type in the given set, a new set\n  // without it is returned. Otherwise, the input set is returned.\n  removeFromSet(set) {\n    for (var i = 0; i < set.length; i++) if (set[i].type == this) {\n      set = set.slice(0, i).concat(set.slice(i + 1))\n      i--\n    }\n    return set\n  }\n\n  // :: ([Mark]) → ?Mark\n  // Tests whether there is a mark of this type in the given set.\n  isInSet(set) {\n    for (let i = 0; i < set.length; i++)\n      if (set[i].type == this) return set[i]\n  }\n\n  // :: (MarkType) → bool\n  // Queries whether a given mark type is\n  // [excluded](#model.MarkSpec.excludes) by this one.\n  excludes(other) {\n    return this.excluded.indexOf(other) > -1\n  }\n}\n\n// SchemaSpec:: interface\n// An object describing a schema, as passed to the [`Schema`](#model.Schema)\n// constructor.\n//\n//   nodes:: union<Object<NodeSpec>, OrderedMap<NodeSpec>>\n//   The node types in this schema. Maps names to\n//   [`NodeSpec`](#model.NodeSpec) objects that describe the node type\n//   associated with that name. Their order is significant—it\n//   determines which [parse rules](#model.NodeSpec.parseDOM) take\n//   precedence by default, and which nodes come first in a given\n//   [group](#model.NodeSpec.group).\n//\n//   marks:: ?union<Object<MarkSpec>, OrderedMap<MarkSpec>>\n//   The mark types that exist in this schema. The order in which they\n//   are provided determines the order in which [mark\n//   sets](#model.Mark.addToSet) are sorted and in which [parse\n//   rules](#model.MarkSpec.parseDOM) are tried.\n//\n//   topNode:: ?string\n//   The name of the default top-level node for the schema. Defaults\n//   to `\"doc\"`.\n\n// NodeSpec:: interface\n//\n//   content:: ?string\n//   The content expression for this node, as described in the [schema\n//   guide](/docs/guide/#schema.content_expressions). When not given,\n//   the node does not allow any content.\n//\n//   marks:: ?string\n//   The marks that are allowed inside of this node. May be a\n//   space-separated string referring to mark names or groups, `\"_\"`\n//   to explicitly allow all marks, or `\"\"` to disallow marks. When\n//   not given, nodes with inline content default to allowing all\n//   marks, other nodes default to not allowing marks.\n//\n//   group:: ?string\n//   The group or space-separated groups to which this node belongs,\n//   which can be referred to in the content expressions for the\n//   schema.\n//\n//   inline:: ?bool\n//   Should be set to true for inline nodes. (Implied for text nodes.)\n//\n//   atom:: ?bool\n//   Can be set to true to indicate that, though this isn't a [leaf\n//   node](#model.NodeType.isLeaf), it doesn't have directly editable\n//   content and should be treated as a single unit in the view.\n//\n//   attrs:: ?Object<AttributeSpec>\n//   The attributes that nodes of this type get.\n//\n//   selectable:: ?bool\n//   Controls whether nodes of this type can be selected as a [node\n//   selection](#state.NodeSelection). Defaults to true for non-text\n//   nodes.\n//\n//   draggable:: ?bool\n//   Determines whether nodes of this type can be dragged without\n//   being selected. Defaults to false.\n//\n//   code:: ?bool\n//   Can be used to indicate that this node contains code, which\n//   causes some commands to behave differently.\n//\n//   defining:: ?bool\n//   Determines whether this node is considered an important parent\n//   node during replace operations (such as paste). Non-defining (the\n//   default) nodes get dropped when their entire content is replaced,\n//   whereas defining nodes persist and wrap the inserted content.\n//   Likewise, in _inserted_ content the defining parents of the\n//   content are preserved when possible. Typically,\n//   non-default-paragraph textblock types, and possibly list items,\n//   are marked as defining.\n//\n//   isolating:: ?bool\n//   When enabled (default is false), the sides of nodes of this type\n//   count as boundaries that regular editing operations, like\n//   backspacing or lifting, won't cross. An example of a node that\n//   should probably have this enabled is a table cell.\n//\n//   toDOM:: ?(node: Node) → DOMOutputSpec\n//   Defines the default way a node of this type should be serialized\n//   to DOM/HTML (as used by\n//   [`DOMSerializer.fromSchema`](#model.DOMSerializer^fromSchema)).\n//   Should return a DOM node or an [array\n//   structure](#model.DOMOutputSpec) that describes one, with an\n//   optional number zero (“hole”) in it to indicate where the node's\n//   content should be inserted.\n//\n//   For text nodes, the default is to create a text DOM node. Though\n//   it is possible to create a serializer where text is rendered\n//   differently, this is not supported inside the editor, so you\n//   shouldn't override that in your text node spec.\n//\n//   parseDOM:: ?[ParseRule]\n//   Associates DOM parser information with this node, which can be\n//   used by [`DOMParser.fromSchema`](#model.DOMParser^fromSchema) to\n//   automatically derive a parser. The `node` field in the rules is\n//   implied (the name of this node will be filled in automatically).\n//   If you supply your own parser, you do not need to also specify\n//   parsing rules in your schema.\n//\n//   toDebugString:: ?(node: Node) -> string\n//   Defines the default way a node of this type should be serialized\n//   to a string representation for debugging (e.g. in error messages).\n\n// MarkSpec:: interface\n//\n//   attrs:: ?Object<AttributeSpec>\n//   The attributes that marks of this type get.\n//\n//   inclusive:: ?bool\n//   Whether this mark should be active when the cursor is positioned\n//   at its end (or at its start when that is also the start of the\n//   parent node). Defaults to true.\n//\n//   excludes:: ?string\n//   Determines which other marks this mark can coexist with. Should\n//   be a space-separated strings naming other marks or groups of marks.\n//   When a mark is [added](#model.Mark.addToSet) to a set, all marks\n//   that it excludes are removed in the process. If the set contains\n//   any mark that excludes the new mark but is not, itself, excluded\n//   by the new mark, the mark can not be added an the set. You can\n//   use the value `\"_\"` to indicate that the mark excludes all\n//   marks in the schema.\n//\n//   Defaults to only being exclusive with marks of the same type. You\n//   can set it to an empty string (or any string not containing the\n//   mark's own name) to allow multiple marks of a given type to\n//   coexist (as long as they have different attributes).\n//\n//   group:: ?string\n//   The group or space-separated groups to which this mark belongs.\n//\n//   spanning:: ?bool\n//   Determines whether marks of this type can span multiple adjacent\n//   nodes when serialized to DOM/HTML. Defaults to true.\n//\n//   toDOM:: ?(mark: Mark, inline: bool) → DOMOutputSpec\n//   Defines the default way marks of this type should be serialized\n//   to DOM/HTML. When the resulting spec contains a hole, that is\n//   where the marked content is placed. Otherwise, it is appended to\n//   the top node.\n//\n//   parseDOM:: ?[ParseRule]\n//   Associates DOM parser information with this mark (see the\n//   corresponding [node spec field](#model.NodeSpec.parseDOM)). The\n//   `mark` field in the rules is implied.\n\n// AttributeSpec:: interface\n//\n// Used to [define](#model.NodeSpec.attrs) attributes on nodes or\n// marks.\n//\n//   default:: ?any\n//   The default value for this attribute, to use when no explicit\n//   value is provided. Attributes that have no default must be\n//   provided whenever a node or mark of a type that has them is\n//   created.\n\n// ::- A document schema. Holds [node](#model.NodeType) and [mark\n// type](#model.MarkType) objects for the nodes and marks that may\n// occur in conforming documents, and provides functionality for\n// creating and deserializing such documents.\nexport class Schema {\n  // :: (SchemaSpec)\n  // Construct a schema from a schema [specification](#model.SchemaSpec).\n  constructor(spec) {\n    // :: SchemaSpec\n    // The [spec](#model.SchemaSpec) on which the schema is based,\n    // with the added guarantee that its `nodes` and `marks`\n    // properties are\n    // [`OrderedMap`](https://github.com/marijnh/orderedmap) instances\n    // (not raw objects).\n    this.spec = {}\n    for (let prop in spec) this.spec[prop] = spec[prop]\n    this.spec.nodes = OrderedMap.from(spec.nodes)\n    this.spec.marks = OrderedMap.from(spec.marks)\n\n    // :: Object<NodeType>\n    // An object mapping the schema's node names to node type objects.\n    this.nodes = NodeType.compile(this.spec.nodes, this)\n\n    // :: Object<MarkType>\n    // A map from mark names to mark type objects.\n    this.marks = MarkType.compile(this.spec.marks, this)\n\n    let contentExprCache = Object.create(null)\n    for (let prop in this.nodes) {\n      if (prop in this.marks)\n        throw new RangeError(prop + \" can not be both a node and a mark\")\n      let type = this.nodes[prop], contentExpr = type.spec.content || \"\", markExpr = type.spec.marks\n      type.contentMatch = contentExprCache[contentExpr] ||\n        (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this.nodes))\n      type.inlineContent = type.contentMatch.inlineContent\n      type.markSet = markExpr == \"_\" ? null :\n        markExpr ? gatherMarks(this, markExpr.split(\" \")) :\n        markExpr == \"\" || !type.inlineContent ? [] : null\n    }\n    for (let prop in this.marks) {\n      let type = this.marks[prop], excl = type.spec.excludes\n      type.excluded = excl == null ? [type] : excl == \"\" ? [] : gatherMarks(this, excl.split(\" \"))\n    }\n\n    this.nodeFromJSON = this.nodeFromJSON.bind(this)\n    this.markFromJSON = this.markFromJSON.bind(this)\n\n    // :: NodeType\n    // The type of the [default top node](#model.SchemaSpec.topNode)\n    // for this schema.\n    this.topNodeType = this.nodes[this.spec.topNode || \"doc\"]\n\n    // :: Object\n    // An object for storing whatever values modules may want to\n    // compute and cache per schema. (If you want to store something\n    // in it, try to use property names unlikely to clash.)\n    this.cached = Object.create(null)\n    this.cached.wrappings = Object.create(null)\n  }\n\n  // :: (union<string, NodeType>, ?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node\n  // Create a node in this schema. The `type` may be a string or a\n  // `NodeType` instance. Attributes will be extended\n  // with defaults, `content` may be a `Fragment`,\n  // `null`, a `Node`, or an array of nodes.\n  node(type, attrs, content, marks) {\n    if (typeof type == \"string\")\n      type = this.nodeType(type)\n    else if (!(type instanceof NodeType))\n      throw new RangeError(\"Invalid node type: \" + type)\n    else if (type.schema != this)\n      throw new RangeError(\"Node type from different schema used (\" + type.name + \")\")\n\n    return type.createChecked(attrs, content, marks)\n  }\n\n  // :: (string, ?[Mark]) → Node\n  // Create a text node in the schema. Empty text nodes are not\n  // allowed.\n  text(text, marks) {\n    let type = this.nodes.text\n    return new TextNode(type, type.defaultAttrs, text, Mark.setFrom(marks))\n  }\n\n  // :: (union<string, MarkType>, ?Object) → Mark\n  // Create a mark with the given type and attributes.\n  mark(type, attrs) {\n    if (typeof type == \"string\") type = this.marks[type]\n    return type.create(attrs)\n  }\n\n  // :: (Object) → Node\n  // Deserialize a node from its JSON representation. This method is\n  // bound.\n  nodeFromJSON(json) {\n    return Node.fromJSON(this, json)\n  }\n\n  // :: (Object) → Mark\n  // Deserialize a mark from its JSON representation. This method is\n  // bound.\n  markFromJSON(json) {\n    return Mark.fromJSON(this, json)\n  }\n\n  nodeType(name) {\n    let found = this.nodes[name]\n    if (!found) throw new RangeError(\"Unknown node type: \" + name)\n    return found\n  }\n}\n\nfunction gatherMarks(schema, marks) {\n  let found = []\n  for (let i = 0; i < marks.length; i++) {\n    let name = marks[i], mark = schema.marks[name], ok = mark\n    if (mark) {\n      found.push(mark)\n    } else {\n      for (let prop in schema.marks) {\n        let mark = schema.marks[prop]\n        if (name == \"_\" || (mark.spec.group && mark.spec.group.split(\" \").indexOf(name) > -1))\n          found.push(ok = mark)\n      }\n    }\n    if (!ok) throw new SyntaxError(\"Unknown mark type: '\" + marks[i] + \"'\")\n  }\n  return found\n}\n","import {Fragment} from \"./fragment\"\nimport {Slice} from \"./replace\"\nimport {Mark} from \"./mark\"\n\n// ParseOptions:: interface\n// These are the options recognized by the\n// [`parse`](#model.DOMParser.parse) and\n// [`parseSlice`](#model.DOMParser.parseSlice) methods.\n//\n//   preserveWhitespace:: ?union<bool, \"full\">\n//   By default, whitespace is collapsed as per HTML's rules. Pass\n//   `true` to preserve whitespace, but normalize newlines to\n//   spaces, and `\"full\"` to preserve whitespace entirely.\n//\n//   findPositions:: ?[{node: dom.Node, offset: number}]\n//   When given, the parser will, beside parsing the content,\n//   record the document positions of the given DOM positions. It\n//   will do so by writing to the objects, adding a `pos` property\n//   that holds the document position. DOM positions that are not\n//   in the parsed content will not be written to.\n//\n//   from:: ?number\n//   The child node index to start parsing from.\n//\n//   to:: ?number\n//   The child node index to stop parsing at.\n//\n//   topNode:: ?Node\n//   By default, the content is parsed into the schema's default\n//   [top node type](#model.Schema.topNodeType). You can pass this\n//   option to use the type and attributes from a different node\n//   as the top container.\n//\n//   topMatch:: ?ContentMatch\n//   Provide the starting content match that content parsed into the\n//   top node is matched against.\n//\n//   context:: ?ResolvedPos\n//   A set of additional nodes to count as\n//   [context](#model.ParseRule.context) when parsing, above the\n//   given [top node](#model.ParseOptions.topNode).\n\n// ParseRule:: interface\n// A value that describes how to parse a given DOM node or inline\n// style as a ProseMirror node or mark.\n//\n//   tag:: ?string\n//   A CSS selector describing the kind of DOM elements to match. A\n//   single rule should have _either_ a `tag` or a `style` property.\n//\n//   namespace:: ?string\n//   The namespace to match. This should be used with `tag`.\n//   Nodes are only matched when the namespace matches or this property\n//   is null.\n//\n//   style:: ?string\n//   A CSS property name to match. When given, this rule matches\n//   inline styles that list that property. May also have the form\n//   `\"property=value\"`, in which case the rule only matches if the\n//   property's value exactly matches the given value. (For more\n//   complicated filters, use [`getAttrs`](#model.ParseRule.getAttrs)\n//   and return false to indicate that the match failed.) Rules\n//   matching styles may only produce [marks](#model.ParseRule.mark),\n//   not nodes.\n//\n//   priority:: ?number\n//   Can be used to change the order in which the parse rules in a\n//   schema are tried. Those with higher priority come first. Rules\n//   without a priority are counted as having priority 50. This\n//   property is only meaningful in a schema—when directly\n//   constructing a parser, the order of the rule array is used.\n//\n//   consuming:: ?boolean\n//   By default, when a rule matches an element or style, no further\n//   rules get a chance to match it. By setting this to `false`, you\n//   indicate that even when this rule matches, other rules that come\n//   after it should also run.\n//\n//   context:: ?string\n//   When given, restricts this rule to only match when the current\n//   context—the parent nodes into which the content is being\n//   parsed—matches this expression. Should contain one or more node\n//   names or node group names followed by single or double slashes.\n//   For example `\"paragraph/\"` means the rule only matches when the\n//   parent node is a paragraph, `\"blockquote/paragraph/\"` restricts\n//   it to be in a paragraph that is inside a blockquote, and\n//   `\"section//\"` matches any position inside a section—a double\n//   slash matches any sequence of ancestor nodes. To allow multiple\n//   different contexts, they can be separated by a pipe (`|`)\n//   character, as in `\"blockquote/|list_item/\"`.\n//\n//   node:: ?string\n//   The name of the node type to create when this rule matches. Only\n//   valid for rules with a `tag` property, not for style rules. Each\n//   rule should have one of a `node`, `mark`, or `ignore` property\n//   (except when it appears in a [node](#model.NodeSpec.parseDOM) or\n//   [mark spec](#model.MarkSpec.parseDOM), in which case the `node`\n//   or `mark` property will be derived from its position).\n//\n//   mark:: ?string\n//   The name of the mark type to wrap the matched content in.\n//\n//   ignore:: ?bool\n//   When true, ignore content that matches this rule.\n//\n//   closeParent:: ?bool\n//   When true, finding an element that matches this rule will close\n//   the current node.\n//\n//   skip:: ?bool\n//   When true, ignore the node that matches this rule, but do parse\n//   its content.\n//\n//   attrs:: ?Object\n//   Attributes for the node or mark created by this rule. When\n//   `getAttrs` is provided, it takes precedence.\n//\n//   getAttrs:: ?(union<dom.Node, string>) → ?union<Object, false>\n//   A function used to compute the attributes for the node or mark\n//   created by this rule. Can also be used to describe further\n//   conditions the DOM element or style must match. When it returns\n//   `false`, the rule won't match. When it returns null or undefined,\n//   that is interpreted as an empty/default set of attributes.\n//\n//   Called with a DOM Element for `tag` rules, and with a string (the\n//   style's value) for `style` rules.\n//\n//   contentElement:: ?union<string, (dom.Node) → dom.Node>\n//   For `tag` rules that produce non-leaf nodes or marks, by default\n//   the content of the DOM element is parsed as content of the mark\n//   or node. If the child nodes are in a descendent node, this may be\n//   a CSS selector string that the parser must use to find the actual\n//   content element, or a function that returns the actual content\n//   element to the parser.\n//\n//   getContent:: ?(dom.Node, schema: Schema) → Fragment\n//   Can be used to override the content of a matched node. When\n//   present, instead of parsing the node's child nodes, the result of\n//   this function is used.\n//\n//   preserveWhitespace:: ?union<bool, \"full\">\n//   Controls whether whitespace should be preserved when parsing the\n//   content inside the matched element. `false` means whitespace may\n//   be collapsed, `true` means that whitespace should be preserved\n//   but newlines normalized to spaces, and `\"full\"` means that\n//   newlines should also be preserved.\n\n// ::- A DOM parser represents a strategy for parsing DOM content into\n// a ProseMirror document conforming to a given schema. Its behavior\n// is defined by an array of [rules](#model.ParseRule).\nexport class DOMParser {\n  // :: (Schema, [ParseRule])\n  // Create a parser that targets the given schema, using the given\n  // parsing rules.\n  constructor(schema, rules) {\n    // :: Schema\n    // The schema into which the parser parses.\n    this.schema = schema\n    // :: [ParseRule]\n    // The set of [parse rules](#model.ParseRule) that the parser\n    // uses, in order of precedence.\n    this.rules = rules\n    this.tags = []\n    this.styles = []\n\n    rules.forEach(rule => {\n      if (rule.tag) this.tags.push(rule)\n      else if (rule.style) this.styles.push(rule)\n    })\n\n    // Only normalize list elements when lists in the schema can't directly contain themselves\n    this.normalizeLists = !this.tags.some(r => {\n      if (!/^(ul|ol)\\b/.test(r.tag) || !r.node) return false\n      let node = schema.nodes[r.node]\n      return node.contentMatch.matchType(node)\n    })\n  }\n\n  // :: (dom.Node, ?ParseOptions) → Node\n  // Parse a document from the content of a DOM node.\n  parse(dom, options = {}) {\n    let context = new ParseContext(this, options, false)\n    context.addAll(dom, null, options.from, options.to)\n    return context.finish()\n  }\n\n  // :: (dom.Node, ?ParseOptions) → Slice\n  // Parses the content of the given DOM node, like\n  // [`parse`](#model.DOMParser.parse), and takes the same set of\n  // options. But unlike that method, which produces a whole node,\n  // this one returns a slice that is open at the sides, meaning that\n  // the schema constraints aren't applied to the start of nodes to\n  // the left of the input and the end of nodes at the end.\n  parseSlice(dom, options = {}) {\n    let context = new ParseContext(this, options, true)\n    context.addAll(dom, null, options.from, options.to)\n    return Slice.maxOpen(context.finish())\n  }\n\n  matchTag(dom, context, after) {\n    for (let i = after ? this.tags.indexOf(after) + 1 : 0; i < this.tags.length; i++) {\n      let rule = this.tags[i]\n      if (matches(dom, rule.tag) &&\n          (rule.namespace === undefined || dom.namespaceURI == rule.namespace) &&\n          (!rule.context || context.matchesContext(rule.context))) {\n        if (rule.getAttrs) {\n          let result = rule.getAttrs(dom)\n          if (result === false) continue\n          rule.attrs = result\n        }\n        return rule\n      }\n    }\n  }\n\n  matchStyle(prop, value, context, after) {\n    for (let i = after ? this.styles.indexOf(after) + 1 : 0; i < this.styles.length; i++) {\n      let rule = this.styles[i]\n      if (rule.style.indexOf(prop) != 0 ||\n          rule.context && !context.matchesContext(rule.context) ||\n          // Test that the style string either precisely matches the prop,\n          // or has an '=' sign after the prop, followed by the given\n          // value.\n          rule.style.length > prop.length &&\n          (rule.style.charCodeAt(prop.length) != 61 || rule.style.slice(prop.length + 1) != value))\n        continue\n      if (rule.getAttrs) {\n        let result = rule.getAttrs(value)\n        if (result === false) continue\n        rule.attrs = result\n      }\n      return rule\n    }\n  }\n\n  // : (Schema) → [ParseRule]\n  static schemaRules(schema) {\n    let result = []\n    function insert(rule) {\n      let priority = rule.priority == null ? 50 : rule.priority, i = 0\n      for (; i < result.length; i++) {\n        let next = result[i], nextPriority = next.priority == null ? 50 : next.priority\n        if (nextPriority < priority) break\n      }\n      result.splice(i, 0, rule)\n    }\n\n    for (let name in schema.marks) {\n      let rules = schema.marks[name].spec.parseDOM\n      if (rules) rules.forEach(rule => {\n        insert(rule = copy(rule))\n        rule.mark = name\n      })\n    }\n    for (let name in schema.nodes) {\n      let rules = schema.nodes[name].spec.parseDOM\n      if (rules) rules.forEach(rule => {\n        insert(rule = copy(rule))\n        rule.node = name\n      })\n    }\n    return result\n  }\n\n  // :: (Schema) → DOMParser\n  // Construct a DOM parser using the parsing rules listed in a\n  // schema's [node specs](#model.NodeSpec.parseDOM), reordered by\n  // [priority](#model.ParseRule.priority).\n  static fromSchema(schema) {\n    return schema.cached.domParser ||\n      (schema.cached.domParser = new DOMParser(schema, DOMParser.schemaRules(schema)))\n  }\n}\n\n// : Object<bool> The block-level tags in HTML5\nconst blockTags = {\n  address: true, article: true, aside: true, blockquote: true, canvas: true,\n  dd: true, div: true, dl: true, fieldset: true, figcaption: true, figure: true,\n  footer: true, form: true, h1: true, h2: true, h3: true, h4: true, h5: true,\n  h6: true, header: true, hgroup: true, hr: true, li: true, noscript: true, ol: true,\n  output: true, p: true, pre: true, section: true, table: true, tfoot: true, ul: true\n}\n\n// : Object<bool> The tags that we normally ignore.\nconst ignoreTags = {\n  head: true, noscript: true, object: true, script: true, style: true, title: true\n}\n\n// : Object<bool> List tags.\nconst listTags = {ol: true, ul: true}\n\n// Using a bitfield for node context options\nconst OPT_PRESERVE_WS = 1, OPT_PRESERVE_WS_FULL = 2, OPT_OPEN_LEFT = 4\n\nfunction wsOptionsFor(preserveWhitespace) {\n  return (preserveWhitespace ? OPT_PRESERVE_WS : 0) | (preserveWhitespace === \"full\" ? OPT_PRESERVE_WS_FULL : 0)\n}\n\nclass NodeContext {\n  constructor(type, attrs, marks, pendingMarks, solid, match, options) {\n    this.type = type\n    this.attrs = attrs\n    this.solid = solid\n    this.match = match || (options & OPT_OPEN_LEFT ? null : type.contentMatch)\n    this.options = options\n    this.content = []\n    // Marks applied to this node itself\n    this.marks = marks\n    // Marks applied to its children\n    this.activeMarks = Mark.none\n    // Marks that can't apply here, but will be used in children if possible\n    this.pendingMarks = pendingMarks\n    // Nested Marks with same type\n    this.stashMarks = []\n  }\n\n  findWrapping(node) {\n    if (!this.match) {\n      if (!this.type) return []\n      let fill = this.type.contentMatch.fillBefore(Fragment.from(node))\n      if (fill) {\n        this.match = this.type.contentMatch.matchFragment(fill)\n      } else {\n        let start = this.type.contentMatch, wrap\n        if (wrap = start.findWrapping(node.type)) {\n          this.match = start\n          return wrap\n        } else {\n          return null\n        }\n      }\n    }\n    return this.match.findWrapping(node.type)\n  }\n\n  finish(openEnd) {\n    if (!(this.options & OPT_PRESERVE_WS)) { // Strip trailing whitespace\n      let last = this.content[this.content.length - 1], m\n      if (last && last.isText && (m = /[ \\t\\r\\n\\u000c]+$/.exec(last.text))) {\n        if (last.text.length == m[0].length) this.content.pop()\n        else this.content[this.content.length - 1] = last.withText(last.text.slice(0, last.text.length - m[0].length))\n      }\n    }\n    let content = Fragment.from(this.content)\n    if (!openEnd && this.match)\n      content = content.append(this.match.fillBefore(Fragment.empty, true))\n    return this.type ? this.type.create(this.attrs, content, this.marks) : content\n  }\n\n  popFromStashMark(mark) {\n    for (let i = this.stashMarks.length - 1; i >= 0; i--)\n      if (mark.eq(this.stashMarks[i])) return this.stashMarks.splice(i, 1)[0]\n  }\n\n  applyPending(nextType) {\n    for (let i = 0, pending = this.pendingMarks; i < pending.length; i++) {\n      let mark = pending[i]\n      if ((this.type ? this.type.allowsMarkType(mark.type) : markMayApply(mark.type, nextType)) &&\n          !mark.isInSet(this.activeMarks)) {\n        this.activeMarks = mark.addToSet(this.activeMarks)\n        this.pendingMarks = mark.removeFromSet(this.pendingMarks)\n      }\n    }\n  }\n}\n\nclass ParseContext {\n  // : (DOMParser, Object)\n  constructor(parser, options, open) {\n    // : DOMParser The parser we are using.\n    this.parser = parser\n    // : Object The options passed to this parse.\n    this.options = options\n    this.isOpen = open\n    let topNode = options.topNode, topContext\n    let topOptions = wsOptionsFor(options.preserveWhitespace) | (open ? OPT_OPEN_LEFT : 0)\n    if (topNode)\n      topContext = new NodeContext(topNode.type, topNode.attrs, Mark.none, Mark.none, true,\n                                   options.topMatch || topNode.type.contentMatch, topOptions)\n    else if (open)\n      topContext = new NodeContext(null, null, Mark.none, Mark.none, true, null, topOptions)\n    else\n      topContext = new NodeContext(parser.schema.topNodeType, null, Mark.none, Mark.none, true, null, topOptions)\n    this.nodes = [topContext]\n    // : [Mark] The current set of marks\n    this.open = 0\n    this.find = options.findPositions\n    this.needsBlock = false\n  }\n\n  get top() {\n    return this.nodes[this.open]\n  }\n\n  // : (dom.Node)\n  // Add a DOM node to the content. Text is inserted as text node,\n  // otherwise, the node is passed to `addElement` or, if it has a\n  // `style` attribute, `addElementWithStyles`.\n  addDOM(dom) {\n    if (dom.nodeType == 3) {\n      this.addTextNode(dom)\n    } else if (dom.nodeType == 1) {\n      let style = dom.getAttribute(\"style\")\n      let marks = style ? this.readStyles(parseStyles(style)) : null, top = this.top\n      if (marks != null) for (let i = 0; i < marks.length; i++) this.addPendingMark(marks[i])\n      this.addElement(dom)\n      if (marks != null) for (let i = 0; i < marks.length; i++) this.removePendingMark(marks[i], top)\n    }\n  }\n\n  addTextNode(dom) {\n    let value = dom.nodeValue\n    let top = this.top\n    if ((top.type ? top.type.inlineContent : top.content.length && top.content[0].isInline) || /[^ \\t\\r\\n\\u000c]/.test(value)) {\n      if (!(top.options & OPT_PRESERVE_WS)) {\n        value = value.replace(/[ \\t\\r\\n\\u000c]+/g, \" \")\n        // If this starts with whitespace, and there is no node before it, or\n        // a hard break, or a text node that ends with whitespace, strip the\n        // leading space.\n        if (/^[ \\t\\r\\n\\u000c]/.test(value) && this.open == this.nodes.length - 1) {\n          let nodeBefore = top.content[top.content.length - 1]\n          let domNodeBefore = dom.previousSibling\n          if (!nodeBefore ||\n              (domNodeBefore && domNodeBefore.nodeName == 'BR') ||\n              (nodeBefore.isText && /[ \\t\\r\\n\\u000c]$/.test(nodeBefore.text)))\n            value = value.slice(1)\n        }\n      } else if (!(top.options & OPT_PRESERVE_WS_FULL)) {\n        value = value.replace(/\\r?\\n|\\r/g, \" \")\n      }\n      if (value) this.insertNode(this.parser.schema.text(value))\n      this.findInText(dom)\n    } else {\n      this.findInside(dom)\n    }\n  }\n\n  // : (dom.Element, ?ParseRule)\n  // Try to find a handler for the given tag and use that to parse. If\n  // none is found, the element's content nodes are added directly.\n  addElement(dom, matchAfter) {\n    let name = dom.nodeName.toLowerCase(), ruleID\n    if (listTags.hasOwnProperty(name) && this.parser.normalizeLists) normalizeList(dom)\n    let rule = (this.options.ruleFromNode && this.options.ruleFromNode(dom)) ||\n        (ruleID = this.parser.matchTag(dom, this, matchAfter))\n    if (rule ? rule.ignore : ignoreTags.hasOwnProperty(name)) {\n      this.findInside(dom)\n    } else if (!rule || rule.skip || rule.closeParent) {\n      if (rule && rule.closeParent) this.open = Math.max(0, this.open - 1)\n      else if (rule && rule.skip.nodeType) dom = rule.skip\n      let sync, top = this.top, oldNeedsBlock = this.needsBlock\n      if (blockTags.hasOwnProperty(name)) {\n        sync = true\n        if (!top.type) this.needsBlock = true\n      } else if (!dom.firstChild) {\n        this.leafFallback(dom)\n        return\n      }\n      this.addAll(dom)\n      if (sync) this.sync(top)\n      this.needsBlock = oldNeedsBlock\n    } else {\n      this.addElementByRule(dom, rule, rule.consuming === false ? ruleID : null)\n    }\n  }\n\n  // Called for leaf DOM nodes that would otherwise be ignored\n  leafFallback(dom) {\n    if (dom.nodeName == \"BR\" && this.top.type && this.top.type.inlineContent)\n      this.addTextNode(dom.ownerDocument.createTextNode(\"\\n\"))\n  }\n\n  // Run any style parser associated with the node's styles. Either\n  // return an array of marks, or null to indicate some of the styles\n  // had a rule with `ignore` set.\n  readStyles(styles) {\n    let marks = Mark.none\n    style: for (let i = 0; i < styles.length; i += 2) {\n      for (let after = null;;) {\n        let rule = this.parser.matchStyle(styles[i], styles[i + 1], this, after)\n        if (!rule) continue style\n        if (rule.ignore) return null\n        marks = this.parser.schema.marks[rule.mark].create(rule.attrs).addToSet(marks)\n        if (rule.consuming === false) after = rule\n        else break\n      }\n    }\n    return marks\n  }\n\n  // : (dom.Element, ParseRule) → bool\n  // Look up a handler for the given node. If none are found, return\n  // false. Otherwise, apply it, use its return value to drive the way\n  // the node's content is wrapped, and return true.\n  addElementByRule(dom, rule, continueAfter) {\n    let sync, nodeType, markType, mark\n    if (rule.node) {\n      nodeType = this.parser.schema.nodes[rule.node]\n      if (!nodeType.isLeaf) {\n        sync = this.enter(nodeType, rule.attrs, rule.preserveWhitespace)\n      } else if (!this.insertNode(nodeType.create(rule.attrs))) {\n        this.leafFallback(dom)\n      }\n    } else {\n      markType = this.parser.schema.marks[rule.mark]\n      mark = markType.create(rule.attrs)\n      this.addPendingMark(mark)\n    }\n    let startIn = this.top\n\n    if (nodeType && nodeType.isLeaf) {\n      this.findInside(dom)\n    } else if (continueAfter) {\n      this.addElement(dom, continueAfter)\n    } else if (rule.getContent) {\n      this.findInside(dom)\n      rule.getContent(dom, this.parser.schema).forEach(node => this.insertNode(node))\n    } else {\n      let contentDOM = rule.contentElement\n      if (typeof contentDOM == \"string\") contentDOM = dom.querySelector(contentDOM)\n      else if (typeof contentDOM == \"function\") contentDOM = contentDOM(dom)\n      if (!contentDOM) contentDOM = dom\n      this.findAround(dom, contentDOM, true)\n      this.addAll(contentDOM, sync)\n    }\n    if (sync) { this.sync(startIn); this.open-- }\n    if (mark) this.removePendingMark(mark, startIn)\n  }\n\n  // : (dom.Node, ?NodeBuilder, ?number, ?number)\n  // Add all child nodes between `startIndex` and `endIndex` (or the\n  // whole node, if not given). If `sync` is passed, use it to\n  // synchronize after every block element.\n  addAll(parent, sync, startIndex, endIndex) {\n    let index = startIndex || 0\n    for (let dom = startIndex ? parent.childNodes[startIndex] : parent.firstChild,\n             end = endIndex == null ? null : parent.childNodes[endIndex];\n         dom != end; dom = dom.nextSibling, ++index) {\n      this.findAtPoint(parent, index)\n      this.addDOM(dom)\n      if (sync && blockTags.hasOwnProperty(dom.nodeName.toLowerCase()))\n        this.sync(sync)\n    }\n    this.findAtPoint(parent, index)\n  }\n\n  // Try to find a way to fit the given node type into the current\n  // context. May add intermediate wrappers and/or leave non-solid\n  // nodes that we're in.\n  findPlace(node) {\n    let route, sync\n    for (let depth = this.open; depth >= 0; depth--) {\n      let cx = this.nodes[depth]\n      let found = cx.findWrapping(node)\n      if (found && (!route || route.length > found.length)) {\n        route = found\n        sync = cx\n        if (!found.length) break\n      }\n      if (cx.solid) break\n    }\n    if (!route) return false\n    this.sync(sync)\n    for (let i = 0; i < route.length; i++)\n      this.enterInner(route[i], null, false)\n    return true\n  }\n\n  // : (Node) → ?Node\n  // Try to insert the given node, adjusting the context when needed.\n  insertNode(node) {\n    if (node.isInline && this.needsBlock && !this.top.type) {\n      let block = this.textblockFromContext()\n      if (block) this.enterInner(block)\n    }\n    if (this.findPlace(node)) {\n      this.closeExtra()\n      let top = this.top\n      top.applyPending(node.type)\n      if (top.match) top.match = top.match.matchType(node.type)\n      let marks = top.activeMarks\n      for (let i = 0; i < node.marks.length; i++)\n        if (!top.type || top.type.allowsMarkType(node.marks[i].type))\n          marks = node.marks[i].addToSet(marks)\n      top.content.push(node.mark(marks))\n      return true\n    }\n    return false\n  }\n\n  // : (NodeType, ?Object) → bool\n  // Try to start a node of the given type, adjusting the context when\n  // necessary.\n  enter(type, attrs, preserveWS) {\n    let ok = this.findPlace(type.create(attrs))\n    if (ok) this.enterInner(type, attrs, true, preserveWS)\n    return ok\n  }\n\n  // Open a node of the given type\n  enterInner(type, attrs, solid, preserveWS) {\n    this.closeExtra()\n    let top = this.top\n    top.applyPending(type)\n    top.match = top.match && top.match.matchType(type, attrs)\n    let options = preserveWS == null ? top.options & ~OPT_OPEN_LEFT : wsOptionsFor(preserveWS)\n    if ((top.options & OPT_OPEN_LEFT) && top.content.length == 0) options |= OPT_OPEN_LEFT\n    this.nodes.push(new NodeContext(type, attrs, top.activeMarks, top.pendingMarks, solid, null, options))\n    this.open++\n  }\n\n  // Make sure all nodes above this.open are finished and added to\n  // their parents\n  closeExtra(openEnd) {\n    let i = this.nodes.length - 1\n    if (i > this.open) {\n      for (; i > this.open; i--) this.nodes[i - 1].content.push(this.nodes[i].finish(openEnd))\n      this.nodes.length = this.open + 1\n    }\n  }\n\n  finish() {\n    this.open = 0\n    this.closeExtra(this.isOpen)\n    return this.nodes[0].finish(this.isOpen || this.options.topOpen)\n  }\n\n  sync(to) {\n    for (let i = this.open; i >= 0; i--) if (this.nodes[i] == to) {\n      this.open = i\n      return\n    }\n  }\n\n  get currentPos() {\n    this.closeExtra()\n    let pos = 0\n    for (let i = this.open; i >= 0; i--) {\n      let content = this.nodes[i].content\n      for (let j = content.length - 1; j >= 0; j--)\n        pos += content[j].nodeSize\n      if (i) pos++\n    }\n    return pos\n  }\n\n  findAtPoint(parent, offset) {\n    if (this.find) for (let i = 0; i < this.find.length; i++) {\n      if (this.find[i].node == parent && this.find[i].offset == offset)\n        this.find[i].pos = this.currentPos\n    }\n  }\n\n  findInside(parent) {\n    if (this.find) for (let i = 0; i < this.find.length; i++) {\n      if (this.find[i].pos == null && parent.nodeType == 1 && parent.contains(this.find[i].node))\n        this.find[i].pos = this.currentPos\n    }\n  }\n\n  findAround(parent, content, before) {\n    if (parent != content && this.find) for (let i = 0; i < this.find.length; i++) {\n      if (this.find[i].pos == null && parent.nodeType == 1 && parent.contains(this.find[i].node)) {\n        let pos = content.compareDocumentPosition(this.find[i].node)\n        if (pos & (before ? 2 : 4))\n          this.find[i].pos = this.currentPos\n      }\n    }\n  }\n\n  findInText(textNode) {\n    if (this.find) for (let i = 0; i < this.find.length; i++) {\n      if (this.find[i].node == textNode)\n        this.find[i].pos = this.currentPos - (textNode.nodeValue.length - this.find[i].offset)\n    }\n  }\n\n  // : (string) → bool\n  // Determines whether the given [context\n  // string](#ParseRule.context) matches this context.\n  matchesContext(context) {\n    if (context.indexOf(\"|\") > -1)\n      return context.split(/\\s*\\|\\s*/).some(this.matchesContext, this)\n\n    let parts = context.split(\"/\")\n    let option = this.options.context\n    let useRoot = !this.isOpen && (!option || option.parent.type == this.nodes[0].type)\n    let minDepth = -(option ? option.depth + 1 : 0) + (useRoot ? 0 : 1)\n    let match = (i, depth) => {\n      for (; i >= 0; i--) {\n        let part = parts[i]\n        if (part == \"\") {\n          if (i == parts.length - 1 || i == 0) continue\n          for (; depth >= minDepth; depth--)\n            if (match(i - 1, depth)) return true\n          return false\n        } else {\n          let next = depth > 0 || (depth == 0 && useRoot) ? this.nodes[depth].type\n              : option && depth >= minDepth ? option.node(depth - minDepth).type\n              : null\n          if (!next || (next.name != part && next.groups.indexOf(part) == -1))\n            return false\n          depth--\n        }\n      }\n      return true\n    }\n    return match(parts.length - 1, this.open)\n  }\n\n  textblockFromContext() {\n    let $context = this.options.context\n    if ($context) for (let d = $context.depth; d >= 0; d--) {\n      let deflt = $context.node(d).contentMatchAt($context.indexAfter(d)).defaultType\n      if (deflt && deflt.isTextblock && deflt.defaultAttrs) return deflt\n    }\n    for (let name in this.parser.schema.nodes) {\n      let type = this.parser.schema.nodes[name]\n      if (type.isTextblock && type.defaultAttrs) return type\n    }\n  }\n\n  addPendingMark(mark) {\n    let found = findSameMarkInSet(mark, this.top.pendingMarks)\n    if (found) this.top.stashMarks.push(found)\n    this.top.pendingMarks = mark.addToSet(this.top.pendingMarks)\n  }\n\n  removePendingMark(mark, upto) {\n    for (let depth = this.open; depth >= 0; depth--) {\n      let level = this.nodes[depth]\n      let found = level.pendingMarks.lastIndexOf(mark)\n      if (found > -1) {\n        level.pendingMarks = mark.removeFromSet(level.pendingMarks)\n      } else {\n        level.activeMarks = mark.removeFromSet(level.activeMarks)\n        let stashMark = level.popFromStashMark(mark)\n        if (stashMark && level.type && level.type.allowsMarkType(stashMark.type))\n          level.activeMarks = stashMark.addToSet(level.activeMarks)\n      }\n      if (level == upto) break\n    }\n  }\n}\n\n// Kludge to work around directly nested list nodes produced by some\n// tools and allowed by browsers to mean that the nested list is\n// actually part of the list item above it.\nfunction normalizeList(dom) {\n  for (let child = dom.firstChild, prevItem = null; child; child = child.nextSibling) {\n    let name = child.nodeType == 1 ? child.nodeName.toLowerCase() : null\n    if (name && listTags.hasOwnProperty(name) && prevItem) {\n      prevItem.appendChild(child)\n      child = prevItem\n    } else if (name == \"li\") {\n      prevItem = child\n    } else if (name) {\n      prevItem = null\n    }\n  }\n}\n\n// Apply a CSS selector.\nfunction matches(dom, selector) {\n  return (dom.matches || dom.msMatchesSelector || dom.webkitMatchesSelector || dom.mozMatchesSelector).call(dom, selector)\n}\n\n// : (string) → [string]\n// Tokenize a style attribute into property/value pairs.\nfunction parseStyles(style) {\n  let re = /\\s*([\\w-]+)\\s*:\\s*([^;]+)/g, m, result = []\n  while (m = re.exec(style)) result.push(m[1], m[2].trim())\n  return result\n}\n\nfunction copy(obj) {\n  let copy = {}\n  for (let prop in obj) copy[prop] = obj[prop]\n  return copy\n}\n\n// Used when finding a mark at the top level of a fragment parse.\n// Checks whether it would be reasonable to apply a given mark type to\n// a given node, by looking at the way the mark occurs in the schema.\nfunction markMayApply(markType, nodeType) {\n  let nodes = nodeType.schema.nodes\n  for (let name in nodes) {\n    let parent = nodes[name]\n    if (!parent.allowsMarkType(markType)) continue\n    let seen = [], scan = match => {\n      seen.push(match)\n      for (let i = 0; i < match.edgeCount; i++) {\n        let {type, next} = match.edge(i)\n        if (type == nodeType) return true\n        if (seen.indexOf(next) < 0 && scan(next)) return true\n      }\n    }\n    if (scan(parent.contentMatch)) return true\n  }\n}\n\nfunction findSameMarkInSet(mark, set) {\n  for (let i = 0; i < set.length; i++) {\n    if (mark.eq(set[i])) return set[i]\n  }\n}\n","// DOMOutputSpec:: interface\n// A description of a DOM structure. Can be either a string, which is\n// interpreted as a text node, a DOM node, which is interpreted as\n// itself, a `{dom: Node, contentDOM: ?Node}` object, or an array.\n//\n// An array describes a DOM element. The first value in the array\n// should be a string—the name of the DOM element, optionally prefixed\n// by a namespace URL and a space. If the second element is plain\n// object, it is interpreted as a set of attributes for the element.\n// Any elements after that (including the 2nd if it's not an attribute\n// object) are interpreted as children of the DOM elements, and must\n// either be valid `DOMOutputSpec` values, or the number zero.\n//\n// The number zero (pronounced “hole”) is used to indicate the place\n// where a node's child nodes should be inserted. If it occurs in an\n// output spec, it should be the only child element in its parent\n// node.\n\n// ::- A DOM serializer knows how to convert ProseMirror nodes and\n// marks of various types to DOM nodes.\nexport class DOMSerializer {\n  // :: (Object<(node: Node) → DOMOutputSpec>, Object<?(mark: Mark, inline: bool) → DOMOutputSpec>)\n  // Create a serializer. `nodes` should map node names to functions\n  // that take a node and return a description of the corresponding\n  // DOM. `marks` does the same for mark names, but also gets an\n  // argument that tells it whether the mark's content is block or\n  // inline content (for typical use, it'll always be inline). A mark\n  // serializer may be `null` to indicate that marks of that type\n  // should not be serialized.\n  constructor(nodes, marks) {\n    // :: Object<(node: Node) → DOMOutputSpec>\n    // The node serialization functions.\n    this.nodes = nodes || {}\n    // :: Object<?(mark: Mark, inline: bool) → DOMOutputSpec>\n    // The mark serialization functions.\n    this.marks = marks || {}\n  }\n\n  // :: (Fragment, ?Object) → dom.DocumentFragment\n  // Serialize the content of this fragment to a DOM fragment. When\n  // not in the browser, the `document` option, containing a DOM\n  // document, should be passed so that the serializer can create\n  // nodes.\n  serializeFragment(fragment, options = {}, target) {\n    if (!target) target = doc(options).createDocumentFragment()\n\n    let top = target, active = null\n    fragment.forEach(node => {\n      if (active || node.marks.length) {\n        if (!active) active = []\n        let keep = 0, rendered = 0\n        while (keep < active.length && rendered < node.marks.length) {\n          let next = node.marks[rendered]\n          if (!this.marks[next.type.name]) { rendered++; continue }\n          if (!next.eq(active[keep]) || next.type.spec.spanning === false) break\n          keep += 2; rendered++\n        }\n        while (keep < active.length) {\n          top = active.pop()\n          active.pop()\n        }\n        while (rendered < node.marks.length) {\n          let add = node.marks[rendered++]\n          let markDOM = this.serializeMark(add, node.isInline, options)\n          if (markDOM) {\n            active.push(add, top)\n            top.appendChild(markDOM.dom)\n            top = markDOM.contentDOM || markDOM.dom\n          }\n        }\n      }\n      top.appendChild(this.serializeNode(node, options))\n    })\n\n    return target\n  }\n\n  // :: (Node, ?Object) → dom.Node\n  // Serialize this node to a DOM node. This can be useful when you\n  // need to serialize a part of a document, as opposed to the whole\n  // document. To serialize a whole document, use\n  // [`serializeFragment`](#model.DOMSerializer.serializeFragment) on\n  // its [content](#model.Node.content).\n  serializeNode(node, options = {}) {\n    let {dom, contentDOM} =\n        DOMSerializer.renderSpec(doc(options), this.nodes[node.type.name](node))\n    if (contentDOM) {\n      if (node.isLeaf)\n        throw new RangeError(\"Content hole not allowed in a leaf node spec\")\n      if (options.onContent)\n        options.onContent(node, contentDOM, options)\n      else\n        this.serializeFragment(node.content, options, contentDOM)\n    }\n    return dom\n  }\n\n  serializeNodeAndMarks(node, options = {}) {\n    let dom = this.serializeNode(node, options)\n    for (let i = node.marks.length - 1; i >= 0; i--) {\n      let wrap = this.serializeMark(node.marks[i], node.isInline, options)\n      if (wrap) {\n        ;(wrap.contentDOM || wrap.dom).appendChild(dom)\n        dom = wrap.dom\n      }\n    }\n    return dom\n  }\n\n  serializeMark(mark, inline, options = {}) {\n    let toDOM = this.marks[mark.type.name]\n    return toDOM && DOMSerializer.renderSpec(doc(options), toDOM(mark, inline))\n  }\n\n  // :: (dom.Document, DOMOutputSpec) → {dom: dom.Node, contentDOM: ?dom.Node}\n  // Render an [output spec](#model.DOMOutputSpec) to a DOM node. If\n  // the spec has a hole (zero) in it, `contentDOM` will point at the\n  // node with the hole.\n  static renderSpec(doc, structure, xmlNS = null) {\n    if (typeof structure == \"string\")\n      return {dom: doc.createTextNode(structure)}\n    if (structure.nodeType != null)\n      return {dom: structure}\n    if (structure.dom && structure.dom.nodeType != null)\n      return structure\n    let tagName = structure[0], space = tagName.indexOf(\" \")\n    if (space > 0) {\n      xmlNS = tagName.slice(0, space)\n      tagName = tagName.slice(space + 1)\n    }\n    let contentDOM = null, dom = xmlNS ? doc.createElementNS(xmlNS, tagName) : doc.createElement(tagName)\n    let attrs = structure[1], start = 1\n    if (attrs && typeof attrs == \"object\" && attrs.nodeType == null && !Array.isArray(attrs)) {\n      start = 2\n      for (let name in attrs) if (attrs[name] != null) {\n        let space = name.indexOf(\" \")\n        if (space > 0) dom.setAttributeNS(name.slice(0, space), name.slice(space + 1), attrs[name])\n        else dom.setAttribute(name, attrs[name])\n      }\n    }\n    for (let i = start; i < structure.length; i++) {\n      let child = structure[i]\n      if (child === 0) {\n        if (i < structure.length - 1 || i > start)\n          throw new RangeError(\"Content hole must be the only child of its parent node\")\n        return {dom, contentDOM: dom}\n      } else {\n        let {dom: inner, contentDOM: innerContent} = DOMSerializer.renderSpec(doc, child, xmlNS)\n        dom.appendChild(inner)\n        if (innerContent) {\n          if (contentDOM) throw new RangeError(\"Multiple content holes\")\n          contentDOM = innerContent\n        }\n      }\n    }\n    return {dom, contentDOM}\n  }\n\n  // :: (Schema) → DOMSerializer\n  // Build a serializer using the [`toDOM`](#model.NodeSpec.toDOM)\n  // properties in a schema's node and mark specs.\n  static fromSchema(schema) {\n    return schema.cached.domSerializer ||\n      (schema.cached.domSerializer = new DOMSerializer(this.nodesFromSchema(schema), this.marksFromSchema(schema)))\n  }\n\n  // : (Schema) → Object<(node: Node) → DOMOutputSpec>\n  // Gather the serializers in a schema's node specs into an object.\n  // This can be useful as a base to build a custom serializer from.\n  static nodesFromSchema(schema) {\n    let result = gatherToDOM(schema.nodes)\n    if (!result.text) result.text = node => node.text\n    return result\n  }\n\n  // : (Schema) → Object<(mark: Mark) → DOMOutputSpec>\n  // Gather the serializers in a schema's mark specs into an object.\n  static marksFromSchema(schema) {\n    return gatherToDOM(schema.marks)\n  }\n}\n\nfunction gatherToDOM(obj) {\n  let result = {}\n  for (let name in obj) {\n    let toDOM = obj[name].spec.toDOM\n    if (toDOM) result[name] = toDOM\n  }\n  return result\n}\n\nfunction doc(options) {\n  // declare global: window\n  return options.document || window.document\n}\n","// Mappable:: interface\n// There are several things that positions can be mapped through.\n// Such objects conform to this interface.\n//\n//   map:: (pos: number, assoc: ?number) → number\n//   Map a position through this object. When given, `assoc` (should\n//   be -1 or 1, defaults to 1) determines with which side the\n//   position is associated, which determines in which direction to\n//   move when a chunk of content is inserted at the mapped position.\n//\n//   mapResult:: (pos: number, assoc: ?number) → MapResult\n//   Map a position, and return an object containing additional\n//   information about the mapping. The result's `deleted` field tells\n//   you whether the position was deleted (completely enclosed in a\n//   replaced range) during the mapping. When content on only one side\n//   is deleted, the position itself is only considered deleted when\n//   `assoc` points in the direction of the deleted content.\n\n// Recovery values encode a range index and an offset. They are\n// represented as numbers, because tons of them will be created when\n// mapping, for example, a large number of decorations. The number's\n// lower 16 bits provide the index, the remaining bits the offset.\n//\n// Note: We intentionally don't use bit shift operators to en- and\n// decode these, since those clip to 32 bits, which we might in rare\n// cases want to overflow. A 64-bit float can represent 48-bit\n// integers precisely.\n\nconst lower16 = 0xffff\nconst factor16 = Math.pow(2, 16)\n\nfunction makeRecover(index, offset) { return index + offset * factor16 }\nfunction recoverIndex(value) { return value & lower16 }\nfunction recoverOffset(value) { return (value - (value & lower16)) / factor16 }\n\n// ::- An object representing a mapped position with extra\n// information.\nexport class MapResult {\n  constructor(pos, deleted = false, recover = null) {\n    // :: number The mapped version of the position.\n    this.pos = pos\n    // :: bool Tells you whether the position was deleted, that is,\n    // whether the step removed its surroundings from the document.\n    this.deleted = deleted\n    this.recover = recover\n  }\n}\n\n// :: class extends Mappable\n// A map describing the deletions and insertions made by a step, which\n// can be used to find the correspondence between positions in the\n// pre-step version of a document and the same position in the\n// post-step version.\nexport class StepMap {\n  // :: ([number])\n  // Create a position map. The modifications to the document are\n  // represented as an array of numbers, in which each group of three\n  // represents a modified chunk as `[start, oldSize, newSize]`.\n  constructor(ranges, inverted = false) {\n    this.ranges = ranges\n    this.inverted = inverted\n  }\n\n  recover(value) {\n    let diff = 0, index = recoverIndex(value)\n    if (!this.inverted) for (let i = 0; i < index; i++)\n      diff += this.ranges[i * 3 + 2] - this.ranges[i * 3 + 1]\n    return this.ranges[index * 3] + diff + recoverOffset(value)\n  }\n\n  // : (number, ?number) → MapResult\n  mapResult(pos, assoc = 1) { return this._map(pos, assoc, false) }\n\n  // : (number, ?number) → number\n  map(pos, assoc = 1) { return this._map(pos, assoc, true) }\n\n  _map(pos, assoc, simple) {\n    let diff = 0, oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2\n    for (let i = 0; i < this.ranges.length; i += 3) {\n      let start = this.ranges[i] - (this.inverted ? diff : 0)\n      if (start > pos) break\n      let oldSize = this.ranges[i + oldIndex], newSize = this.ranges[i + newIndex], end = start + oldSize\n      if (pos <= end) {\n        let side = !oldSize ? assoc : pos == start ? -1 : pos == end ? 1 : assoc\n        let result = start + diff + (side < 0 ? 0 : newSize)\n        if (simple) return result\n        let recover = pos == (assoc < 0 ? start : end) ? null : makeRecover(i / 3, pos - start)\n        return new MapResult(result, assoc < 0 ? pos != start : pos != end, recover)\n      }\n      diff += newSize - oldSize\n    }\n    return simple ? pos + diff : new MapResult(pos + diff)\n  }\n\n  touches(pos, recover) {\n    let diff = 0, index = recoverIndex(recover)\n    let oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2\n    for (let i = 0; i < this.ranges.length; i += 3) {\n      let start = this.ranges[i] - (this.inverted ? diff : 0)\n      if (start > pos) break\n      let oldSize = this.ranges[i + oldIndex], end = start + oldSize\n      if (pos <= end && i == index * 3) return true\n      diff += this.ranges[i + newIndex] - oldSize\n    }\n    return false\n  }\n\n  // :: ((oldStart: number, oldEnd: number, newStart: number, newEnd: number))\n  // Calls the given function on each of the changed ranges included in\n  // this map.\n  forEach(f) {\n    let oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2\n    for (let i = 0, diff = 0; i < this.ranges.length; i += 3) {\n      let start = this.ranges[i], oldStart = start - (this.inverted ? diff : 0), newStart = start + (this.inverted ? 0 : diff)\n      let oldSize = this.ranges[i + oldIndex], newSize = this.ranges[i + newIndex]\n      f(oldStart, oldStart + oldSize, newStart, newStart + newSize)\n      diff += newSize - oldSize\n    }\n  }\n\n  // :: () → StepMap\n  // Create an inverted version of this map. The result can be used to\n  // map positions in the post-step document to the pre-step document.\n  invert() {\n    return new StepMap(this.ranges, !this.inverted)\n  }\n\n  toString() {\n    return (this.inverted ? \"-\" : \"\") + JSON.stringify(this.ranges)\n  }\n\n  // :: (n: number) → StepMap\n  // Create a map that moves all positions by offset `n` (which may be\n  // negative). This can be useful when applying steps meant for a\n  // sub-document to a larger document, or vice-versa.\n  static offset(n) {\n    return n == 0 ? StepMap.empty : new StepMap(n < 0 ? [0, -n, 0] : [0, 0, n])\n  }\n}\n\nStepMap.empty = new StepMap([])\n\n// :: class extends Mappable\n// A mapping represents a pipeline of zero or more [step\n// maps](#transform.StepMap). It has special provisions for losslessly\n// handling mapping positions through a series of steps in which some\n// steps are inverted versions of earlier steps. (This comes up when\n// ‘[rebasing](/docs/guide/#transform.rebasing)’ steps for\n// collaboration or history management.)\nexport class Mapping {\n  // :: (?[StepMap])\n  // Create a new mapping with the given position maps.\n  constructor(maps, mirror, from, to) {\n    // :: [StepMap]\n    // The step maps in this mapping.\n    this.maps = maps || []\n    // :: number\n    // The starting position in the `maps` array, used when `map` or\n    // `mapResult` is called.\n    this.from = from || 0\n    // :: number\n    // The end position in the `maps` array.\n    this.to = to == null ? this.maps.length : to\n    this.mirror = mirror\n  }\n\n  // :: (?number, ?number) → Mapping\n  // Create a mapping that maps only through a part of this one.\n  slice(from = 0, to = this.maps.length) {\n    return new Mapping(this.maps, this.mirror, from, to)\n  }\n\n  copy() {\n    return new Mapping(this.maps.slice(), this.mirror && this.mirror.slice(), this.from, this.to)\n  }\n\n  // :: (StepMap, ?number)\n  // Add a step map to the end of this mapping. If `mirrors` is\n  // given, it should be the index of the step map that is the mirror\n  // image of this one.\n  appendMap(map, mirrors) {\n    this.to = this.maps.push(map)\n    if (mirrors != null) this.setMirror(this.maps.length - 1, mirrors)\n  }\n\n  // :: (Mapping)\n  // Add all the step maps in a given mapping to this one (preserving\n  // mirroring information).\n  appendMapping(mapping) {\n    for (let i = 0, startSize = this.maps.length; i < mapping.maps.length; i++) {\n      let mirr = mapping.getMirror(i)\n      this.appendMap(mapping.maps[i], mirr != null && mirr < i ? startSize + mirr : null)\n    }\n  }\n\n  // :: (number) → ?number\n  // Finds the offset of the step map that mirrors the map at the\n  // given offset, in this mapping (as per the second argument to\n  // `appendMap`).\n  getMirror(n) {\n    if (this.mirror) for (let i = 0; i < this.mirror.length; i++)\n      if (this.mirror[i] == n) return this.mirror[i + (i % 2 ? -1 : 1)]\n  }\n\n  setMirror(n, m) {\n    if (!this.mirror) this.mirror = []\n    this.mirror.push(n, m)\n  }\n\n  // :: (Mapping)\n  // Append the inverse of the given mapping to this one.\n  appendMappingInverted(mapping) {\n    for (let i = mapping.maps.length - 1, totalSize = this.maps.length + mapping.maps.length; i >= 0; i--) {\n      let mirr = mapping.getMirror(i)\n      this.appendMap(mapping.maps[i].invert(), mirr != null && mirr > i ? totalSize - mirr - 1 : null)\n    }\n  }\n\n  // :: () → Mapping\n  // Create an inverted version of this mapping.\n  invert() {\n    let inverse = new Mapping\n    inverse.appendMappingInverted(this)\n    return inverse\n  }\n\n  // : (number, ?number) → number\n  // Map a position through this mapping.\n  map(pos, assoc = 1) {\n    if (this.mirror) return this._map(pos, assoc, true)\n    for (let i = this.from; i < this.to; i++)\n      pos = this.maps[i].map(pos, assoc)\n    return pos\n  }\n\n  // : (number, ?number) → MapResult\n  // Map a position through this mapping, returning a mapping\n  // result.\n  mapResult(pos, assoc = 1) { return this._map(pos, assoc, false) }\n\n  _map(pos, assoc, simple) {\n    let deleted = false\n\n    for (let i = this.from; i < this.to; i++) {\n      let map = this.maps[i], result = map.mapResult(pos, assoc)\n      if (result.recover != null) {\n        let corr = this.getMirror(i)\n        if (corr != null && corr > i && corr < this.to) {\n          i = corr\n          pos = this.maps[corr].recover(result.recover)\n          continue\n        }\n      }\n\n      if (result.deleted) deleted = true\n      pos = result.pos\n    }\n\n    return simple ? pos : new MapResult(pos, deleted)\n  }\n}\n","import {Mapping} from \"./map\"\n\nexport function TransformError(message) {\n  let err = Error.call(this, message)\n  err.__proto__ = TransformError.prototype\n  return err\n}\n\nTransformError.prototype = Object.create(Error.prototype)\nTransformError.prototype.constructor = TransformError\nTransformError.prototype.name = \"TransformError\"\n\n// ::- Abstraction to build up and track an array of\n// [steps](#transform.Step) representing a document transformation.\n//\n// Most transforming methods return the `Transform` object itself, so\n// that they can be chained.\nexport class Transform {\n  // :: (Node)\n  // Create a transform that starts with the given document.\n  constructor(doc) {\n    // :: Node\n    // The current document (the result of applying the steps in the\n    // transform).\n    this.doc = doc\n    // :: [Step]\n    // The steps in this transform.\n    this.steps = []\n    // :: [Node]\n    // The documents before each of the steps.\n    this.docs = []\n    // :: Mapping\n    // A mapping with the maps for each of the steps in this transform.\n    this.mapping = new Mapping\n  }\n\n  // :: Node The starting document.\n  get before() { return this.docs.length ? this.docs[0] : this.doc }\n\n  // :: (step: Step) → this\n  // Apply a new step in this transform, saving the result. Throws an\n  // error when the step fails.\n  step(object) {\n    let result = this.maybeStep(object)\n    if (result.failed) throw new TransformError(result.failed)\n    return this\n  }\n\n  // :: (Step) → StepResult\n  // Try to apply a step in this transformation, ignoring it if it\n  // fails. Returns the step result.\n  maybeStep(step) {\n    let result = step.apply(this.doc)\n    if (!result.failed) this.addStep(step, result.doc)\n    return result\n  }\n\n  // :: bool\n  // True when the document has been changed (when there are any\n  // steps).\n  get docChanged() {\n    return this.steps.length > 0\n  }\n\n  addStep(step, doc) {\n    this.docs.push(this.doc)\n    this.steps.push(step)\n    this.mapping.appendMap(step.getMap())\n    this.doc = doc\n  }\n}\n","import {ReplaceError} from \"prosemirror-model\"\n\nimport {StepMap} from \"./map\"\n\nfunction mustOverride() { throw new Error(\"Override me\") }\n\nconst stepsByID = Object.create(null)\n\n// ::- A step object represents an atomic change. It generally applies\n// only to the document it was created for, since the positions\n// stored in it will only make sense for that document.\n//\n// New steps are defined by creating classes that extend `Step`,\n// overriding the `apply`, `invert`, `map`, `getMap` and `fromJSON`\n// methods, and registering your class with a unique\n// JSON-serialization identifier using\n// [`Step.jsonID`](#transform.Step^jsonID).\nexport class Step {\n  // :: (doc: Node) → StepResult\n  // Applies this step to the given document, returning a result\n  // object that either indicates failure, if the step can not be\n  // applied to this document, or indicates success by containing a\n  // transformed document.\n  apply(_doc) { return mustOverride() }\n\n  // :: () → StepMap\n  // Get the step map that represents the changes made by this step,\n  // and which can be used to transform between positions in the old\n  // and the new document.\n  getMap() { return StepMap.empty }\n\n  // :: (doc: Node) → Step\n  // Create an inverted version of this step. Needs the document as it\n  // was before the step as argument.\n  invert(_doc) { return mustOverride() }\n\n  // :: (mapping: Mappable) → ?Step\n  // Map this step through a mappable thing, returning either a\n  // version of that step with its positions adjusted, or `null` if\n  // the step was entirely deleted by the mapping.\n  map(_mapping) { return mustOverride() }\n\n  // :: (other: Step) → ?Step\n  // Try to merge this step with another one, to be applied directly\n  // after it. Returns the merged step when possible, null if the\n  // steps can't be merged.\n  merge(_other) { return null }\n\n  // :: () → Object\n  // Create a JSON-serializeable representation of this step. When\n  // defining this for a custom subclass, make sure the result object\n  // includes the step type's [JSON id](#transform.Step^jsonID) under\n  // the `stepType` property.\n  toJSON() { return mustOverride() }\n\n  // :: (Schema, Object) → Step\n  // Deserialize a step from its JSON representation. Will call\n  // through to the step class' own implementation of this method.\n  static fromJSON(schema, json) {\n    if (!json || !json.stepType) throw new RangeError(\"Invalid input for Step.fromJSON\")\n    let type = stepsByID[json.stepType]\n    if (!type) throw new RangeError(`No step type ${json.stepType} defined`)\n    return type.fromJSON(schema, json)\n  }\n\n  // :: (string, constructor<Step>)\n  // To be able to serialize steps to JSON, each step needs a string\n  // ID to attach to its JSON representation. Use this method to\n  // register an ID for your step classes. Try to pick something\n  // that's unlikely to clash with steps from other modules.\n  static jsonID(id, stepClass) {\n    if (id in stepsByID) throw new RangeError(\"Duplicate use of step JSON ID \" + id)\n    stepsByID[id] = stepClass\n    stepClass.prototype.jsonID = id\n    return stepClass\n  }\n}\n\n// ::- The result of [applying](#transform.Step.apply) a step. Contains either a\n// new document or a failure value.\nexport class StepResult {\n  // : (?Node, ?string)\n  constructor(doc, failed) {\n    // :: ?Node The transformed document.\n    this.doc = doc\n    // :: ?string Text providing information about a failed step.\n    this.failed = failed\n  }\n\n  // :: (Node) → StepResult\n  // Create a successful step result.\n  static ok(doc) { return new StepResult(doc, null) }\n\n  // :: (string) → StepResult\n  // Create a failed step result.\n  static fail(message) { return new StepResult(null, message) }\n\n  // :: (Node, number, number, Slice) → StepResult\n  // Call [`Node.replace`](#model.Node.replace) with the given\n  // arguments. Create a successful result if it succeeds, and a\n  // failed one if it throws a `ReplaceError`.\n  static fromReplace(doc, from, to, slice) {\n    try {\n      return StepResult.ok(doc.replace(from, to, slice))\n    } catch (e) {\n      if (e instanceof ReplaceError) return StepResult.fail(e.message)\n      throw e\n    }\n  }\n}\n","import {Slice} from \"prosemirror-model\"\n\nimport {Step, StepResult} from \"./step\"\nimport {StepMap} from \"./map\"\n\n// ::- Replace a part of the document with a slice of new content.\nexport class ReplaceStep extends Step {\n  // :: (number, number, Slice, ?bool)\n  // The given `slice` should fit the 'gap' between `from` and\n  // `to`—the depths must line up, and the surrounding nodes must be\n  // able to be joined with the open sides of the slice. When\n  // `structure` is true, the step will fail if the content between\n  // from and to is not just a sequence of closing and then opening\n  // tokens (this is to guard against rebased replace steps\n  // overwriting something they weren't supposed to).\n  constructor(from, to, slice, structure) {\n    super()\n    this.from = from\n    this.to = to\n    this.slice = slice\n    this.structure = !!structure\n  }\n\n  apply(doc) {\n    if (this.structure && contentBetween(doc, this.from, this.to))\n      return StepResult.fail(\"Structure replace would overwrite content\")\n    return StepResult.fromReplace(doc, this.from, this.to, this.slice)\n  }\n\n  getMap() {\n    return new StepMap([this.from, this.to - this.from, this.slice.size])\n  }\n\n  invert(doc) {\n    return new ReplaceStep(this.from, this.from + this.slice.size, doc.slice(this.from, this.to))\n  }\n\n  map(mapping) {\n    let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1)\n    if (from.deleted && to.deleted) return null\n    return new ReplaceStep(from.pos, Math.max(from.pos, to.pos), this.slice)\n  }\n\n  merge(other) {\n    if (!(other instanceof ReplaceStep) || other.structure || this.structure) return null\n\n    if (this.from + this.slice.size == other.from && !this.slice.openEnd && !other.slice.openStart) {\n      let slice = this.slice.size + other.slice.size == 0 ? Slice.empty\n          : new Slice(this.slice.content.append(other.slice.content), this.slice.openStart, other.slice.openEnd)\n      return new ReplaceStep(this.from, this.to + (other.to - other.from), slice, this.structure)\n    } else if (other.to == this.from && !this.slice.openStart && !other.slice.openEnd) {\n      let slice = this.slice.size + other.slice.size == 0 ? Slice.empty\n          : new Slice(other.slice.content.append(this.slice.content), other.slice.openStart, this.slice.openEnd)\n      return new ReplaceStep(other.from, this.to, slice, this.structure)\n    } else {\n      return null\n    }\n  }\n\n  toJSON() {\n    let json = {stepType: \"replace\", from: this.from, to: this.to}\n    if (this.slice.size) json.slice = this.slice.toJSON()\n    if (this.structure) json.structure = true\n    return json\n  }\n\n  static fromJSON(schema, json) {\n    if (typeof json.from != \"number\" || typeof json.to != \"number\")\n      throw new RangeError(\"Invalid input for ReplaceStep.fromJSON\")\n    return new ReplaceStep(json.from, json.to, Slice.fromJSON(schema, json.slice), !!json.structure)\n  }\n}\n\nStep.jsonID(\"replace\", ReplaceStep)\n\n// ::- Replace a part of the document with a slice of content, but\n// preserve a range of the replaced content by moving it into the\n// slice.\nexport class ReplaceAroundStep extends Step {\n  // :: (number, number, number, number, Slice, number, ?bool)\n  // Create a replace-around step with the given range and gap.\n  // `insert` should be the point in the slice into which the content\n  // of the gap should be moved. `structure` has the same meaning as\n  // it has in the [`ReplaceStep`](#transform.ReplaceStep) class.\n  constructor(from, to, gapFrom, gapTo, slice, insert, structure) {\n    super()\n    this.from = from\n    this.to = to\n    this.gapFrom = gapFrom\n    this.gapTo = gapTo\n    this.slice = slice\n    this.insert = insert\n    this.structure = !!structure\n  }\n\n  apply(doc) {\n    if (this.structure && (contentBetween(doc, this.from, this.gapFrom) ||\n                           contentBetween(doc, this.gapTo, this.to)))\n      return StepResult.fail(\"Structure gap-replace would overwrite content\")\n\n    let gap = doc.slice(this.gapFrom, this.gapTo)\n    if (gap.openStart || gap.openEnd)\n      return StepResult.fail(\"Gap is not a flat range\")\n    let inserted = this.slice.insertAt(this.insert, gap.content)\n    if (!inserted) return StepResult.fail(\"Content does not fit in gap\")\n    return StepResult.fromReplace(doc, this.from, this.to, inserted)\n  }\n\n  getMap() {\n    return new StepMap([this.from, this.gapFrom - this.from, this.insert,\n                        this.gapTo, this.to - this.gapTo, this.slice.size - this.insert])\n  }\n\n  invert(doc) {\n    let gap = this.gapTo - this.gapFrom\n    return new ReplaceAroundStep(this.from, this.from + this.slice.size + gap,\n                                 this.from + this.insert, this.from + this.insert + gap,\n                                 doc.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from),\n                                 this.gapFrom - this.from, this.structure)\n  }\n\n  map(mapping) {\n    let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1)\n    let gapFrom = mapping.map(this.gapFrom, -1), gapTo = mapping.map(this.gapTo, 1)\n    if ((from.deleted && to.deleted) || gapFrom < from.pos || gapTo > to.pos) return null\n    return new ReplaceAroundStep(from.pos, to.pos, gapFrom, gapTo, this.slice, this.insert, this.structure)\n  }\n\n  toJSON() {\n    let json = {stepType: \"replaceAround\", from: this.from, to: this.to,\n                gapFrom: this.gapFrom, gapTo: this.gapTo, insert: this.insert}\n    if (this.slice.size) json.slice = this.slice.toJSON()\n    if (this.structure) json.structure = true\n    return json\n  }\n\n  static fromJSON(schema, json) {\n    if (typeof json.from != \"number\" || typeof json.to != \"number\" ||\n        typeof json.gapFrom != \"number\" || typeof json.gapTo != \"number\" || typeof json.insert != \"number\")\n      throw new RangeError(\"Invalid input for ReplaceAroundStep.fromJSON\")\n    return new ReplaceAroundStep(json.from, json.to, json.gapFrom, json.gapTo,\n                                 Slice.fromJSON(schema, json.slice), json.insert, !!json.structure)\n  }\n}\n\nStep.jsonID(\"replaceAround\", ReplaceAroundStep)\n\nfunction contentBetween(doc, from, to) {\n  let $from = doc.resolve(from), dist = to - from, depth = $from.depth\n  while (dist > 0 && depth > 0 && $from.indexAfter(depth) == $from.node(depth).childCount) {\n    depth--\n    dist--\n  }\n  if (dist > 0) {\n    let next = $from.node(depth).maybeChild($from.indexAfter(depth))\n    while (dist > 0) {\n      if (!next || next.isLeaf) return true\n      next = next.firstChild\n      dist--\n    }\n  }\n  return false\n}\n","import {Fragment, Slice} from \"prosemirror-model\"\nimport {Step, StepResult} from \"./step\"\n\nfunction mapFragment(fragment, f, parent) {\n  let mapped = []\n  for (let i = 0; i < fragment.childCount; i++) {\n    let child = fragment.child(i)\n    if (child.content.size) child = child.copy(mapFragment(child.content, f, child))\n    if (child.isInline) child = f(child, parent, i)\n    mapped.push(child)\n  }\n  return Fragment.fromArray(mapped)\n}\n\n// ::- Add a mark to all inline content between two positions.\nexport class AddMarkStep extends Step {\n  // :: (number, number, Mark)\n  constructor(from, to, mark) {\n    super()\n    this.from = from\n    this.to = to\n    this.mark = mark\n  }\n\n  apply(doc) {\n    let oldSlice = doc.slice(this.from, this.to), $from = doc.resolve(this.from)\n    let parent = $from.node($from.sharedDepth(this.to))\n    let slice = new Slice(mapFragment(oldSlice.content, (node, parent) => {\n      if (!node.isAtom || !parent.type.allowsMarkType(this.mark.type)) return node\n      return node.mark(this.mark.addToSet(node.marks))\n    }, parent), oldSlice.openStart, oldSlice.openEnd)\n    return StepResult.fromReplace(doc, this.from, this.to, slice)\n  }\n\n  invert() {\n    return new RemoveMarkStep(this.from, this.to, this.mark)\n  }\n\n  map(mapping) {\n    let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1)\n    if (from.deleted && to.deleted || from.pos >= to.pos) return null\n    return new AddMarkStep(from.pos, to.pos, this.mark)\n  }\n\n  merge(other) {\n    if (other instanceof AddMarkStep &&\n        other.mark.eq(this.mark) &&\n        this.from <= other.to && this.to >= other.from)\n      return new AddMarkStep(Math.min(this.from, other.from),\n                             Math.max(this.to, other.to), this.mark)\n  }\n\n  toJSON() {\n    return {stepType: \"addMark\", mark: this.mark.toJSON(),\n            from: this.from, to: this.to}\n  }\n\n  static fromJSON(schema, json) {\n    if (typeof json.from != \"number\" || typeof json.to != \"number\")\n      throw new RangeError(\"Invalid input for AddMarkStep.fromJSON\")\n    return new AddMarkStep(json.from, json.to, schema.markFromJSON(json.mark))\n  }\n}\n\nStep.jsonID(\"addMark\", AddMarkStep)\n\n// ::- Remove a mark from all inline content between two positions.\nexport class RemoveMarkStep extends Step {\n  // :: (number, number, Mark)\n  constructor(from, to, mark) {\n    super()\n    this.from = from\n    this.to = to\n    this.mark = mark\n  }\n\n  apply(doc) {\n    let oldSlice = doc.slice(this.from, this.to)\n    let slice = new Slice(mapFragment(oldSlice.content, node => {\n      return node.mark(this.mark.removeFromSet(node.marks))\n    }), oldSlice.openStart, oldSlice.openEnd)\n    return StepResult.fromReplace(doc, this.from, this.to, slice)\n  }\n\n  invert() {\n    return new AddMarkStep(this.from, this.to, this.mark)\n  }\n\n  map(mapping) {\n    let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1)\n    if (from.deleted && to.deleted || from.pos >= to.pos) return null\n    return new RemoveMarkStep(from.pos, to.pos, this.mark)\n  }\n\n  merge(other) {\n    if (other instanceof RemoveMarkStep &&\n        other.mark.eq(this.mark) &&\n        this.from <= other.to && this.to >= other.from)\n      return new RemoveMarkStep(Math.min(this.from, other.from),\n                                Math.max(this.to, other.to), this.mark)\n  }\n\n  toJSON() {\n    return {stepType: \"removeMark\", mark: this.mark.toJSON(),\n            from: this.from, to: this.to}\n  }\n\n  static fromJSON(schema, json) {\n    if (typeof json.from != \"number\" || typeof json.to != \"number\")\n      throw new RangeError(\"Invalid input for RemoveMarkStep.fromJSON\")\n    return new RemoveMarkStep(json.from, json.to, schema.markFromJSON(json.mark))\n  }\n}\n\nStep.jsonID(\"removeMark\", RemoveMarkStep)\n","import {Slice, Fragment} from \"prosemirror-model\"\n\nimport {Transform} from \"./transform\"\nimport {ReplaceStep, ReplaceAroundStep} from \"./replace_step\"\n\nfunction canCut(node, start, end) {\n  return (start == 0 || node.canReplace(start, node.childCount)) &&\n    (end == node.childCount || node.canReplace(0, end))\n}\n\n// :: (NodeRange) → ?number\n// Try to find a target depth to which the content in the given range\n// can be lifted. Will not go across\n// [isolating](#model.NodeSpec.isolating) parent nodes.\nexport function liftTarget(range) {\n  let parent = range.parent\n  let content = parent.content.cutByIndex(range.startIndex, range.endIndex)\n  for (let depth = range.depth;; --depth) {\n    let node = range.$from.node(depth)\n    let index = range.$from.index(depth), endIndex = range.$to.indexAfter(depth)\n    if (depth < range.depth && node.canReplace(index, endIndex, content))\n      return depth\n    if (depth == 0 || node.type.spec.isolating || !canCut(node, index, endIndex)) break\n  }\n}\n\n// :: (NodeRange, number) → this\n// Split the content in the given range off from its parent, if there\n// is sibling content before or after it, and move it up the tree to\n// the depth specified by `target`. You'll probably want to use\n// [`liftTarget`](#transform.liftTarget) to compute `target`, to make\n// sure the lift is valid.\nTransform.prototype.lift = function(range, target) {\n  let {$from, $to, depth} = range\n\n  let gapStart = $from.before(depth + 1), gapEnd = $to.after(depth + 1)\n  let start = gapStart, end = gapEnd\n\n  let before = Fragment.empty, openStart = 0\n  for (let d = depth, splitting = false; d > target; d--)\n    if (splitting || $from.index(d) > 0) {\n      splitting = true\n      before = Fragment.from($from.node(d).copy(before))\n      openStart++\n    } else {\n      start--\n    }\n  let after = Fragment.empty, openEnd = 0\n  for (let d = depth, splitting = false; d > target; d--)\n    if (splitting || $to.after(d + 1) < $to.end(d)) {\n      splitting = true\n      after = Fragment.from($to.node(d).copy(after))\n      openEnd++\n    } else {\n      end++\n    }\n\n  return this.step(new ReplaceAroundStep(start, end, gapStart, gapEnd,\n                                         new Slice(before.append(after), openStart, openEnd),\n                                         before.size - openStart, true))\n}\n\n// :: (NodeRange, NodeType, ?Object, ?NodeRange) → ?[{type: NodeType, attrs: ?Object}]\n// Try to find a valid way to wrap the content in the given range in a\n// node of the given type. May introduce extra nodes around and inside\n// the wrapper node, if necessary. Returns null if no valid wrapping\n// could be found. When `innerRange` is given, that range's content is\n// used as the content to fit into the wrapping, instead of the\n// content of `range`.\nexport function findWrapping(range, nodeType, attrs, innerRange = range) {\n  let around = findWrappingOutside(range, nodeType)\n  let inner = around && findWrappingInside(innerRange, nodeType)\n  if (!inner) return null\n  return around.map(withAttrs).concat({type: nodeType, attrs}).concat(inner.map(withAttrs))\n}\n\nfunction withAttrs(type) { return {type, attrs: null} }\n\nfunction findWrappingOutside(range, type) {\n  let {parent, startIndex, endIndex} = range\n  let around = parent.contentMatchAt(startIndex).findWrapping(type)\n  if (!around) return null\n  let outer = around.length ? around[0] : type\n  return parent.canReplaceWith(startIndex, endIndex, outer) ? around : null\n}\n\nfunction findWrappingInside(range, type) {\n  let {parent, startIndex, endIndex} = range\n  let inner = parent.child(startIndex)\n  let inside = type.contentMatch.findWrapping(inner.type)\n  if (!inside) return null\n  let lastType = inside.length ? inside[inside.length - 1] : type\n  let innerMatch = lastType.contentMatch\n  for (let i = startIndex; innerMatch && i < endIndex; i++)\n    innerMatch = innerMatch.matchType(parent.child(i).type)\n  if (!innerMatch || !innerMatch.validEnd) return null\n  return inside\n}\n\n// :: (NodeRange, [{type: NodeType, attrs: ?Object}]) → this\n// Wrap the given [range](#model.NodeRange) in the given set of wrappers.\n// The wrappers are assumed to be valid in this position, and should\n// probably be computed with [`findWrapping`](#transform.findWrapping).\nTransform.prototype.wrap = function(range, wrappers) {\n  let content = Fragment.empty\n  for (let i = wrappers.length - 1; i >= 0; i--)\n    content = Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content))\n\n  let start = range.start, end = range.end\n  return this.step(new ReplaceAroundStep(start, end, start, end, new Slice(content, 0, 0), wrappers.length, true))\n}\n\n// :: (number, ?number, NodeType, ?Object) → this\n// Set the type of all textblocks (partly) between `from` and `to` to\n// the given node type with the given attributes.\nTransform.prototype.setBlockType = function(from, to = from, type, attrs) {\n  if (!type.isTextblock) throw new RangeError(\"Type given to setBlockType should be a textblock\")\n  let mapFrom = this.steps.length\n  this.doc.nodesBetween(from, to, (node, pos) => {\n    if (node.isTextblock && !node.hasMarkup(type, attrs) && canChangeType(this.doc, this.mapping.slice(mapFrom).map(pos), type)) {\n      // Ensure all markup that isn't allowed in the new node type is cleared\n      this.clearIncompatible(this.mapping.slice(mapFrom).map(pos, 1), type)\n      let mapping = this.mapping.slice(mapFrom)\n      let startM = mapping.map(pos, 1), endM = mapping.map(pos + node.nodeSize, 1)\n      this.step(new ReplaceAroundStep(startM, endM, startM + 1, endM - 1,\n                                      new Slice(Fragment.from(type.create(attrs, null, node.marks)), 0, 0), 1, true))\n      return false\n    }\n  })\n  return this\n}\n\nfunction canChangeType(doc, pos, type) {\n  let $pos = doc.resolve(pos), index = $pos.index()\n  return $pos.parent.canReplaceWith(index, index + 1, type)\n}\n\n// :: (number, ?NodeType, ?Object, ?[Mark]) → this\n// Change the type, attributes, and/or marks of the node at `pos`.\n// When `type` isn't given, the existing node type is preserved,\nTransform.prototype.setNodeMarkup = function(pos, type, attrs, marks) {\n  let node = this.doc.nodeAt(pos)\n  if (!node) throw new RangeError(\"No node at given position\")\n  if (!type) type = node.type\n  let newNode = type.create(attrs, null, marks || node.marks)\n  if (node.isLeaf)\n    return this.replaceWith(pos, pos + node.nodeSize, newNode)\n\n  if (!type.validContent(node.content))\n    throw new RangeError(\"Invalid content for node type \" + type.name)\n\n  return this.step(new ReplaceAroundStep(pos, pos + node.nodeSize, pos + 1, pos + node.nodeSize - 1,\n                                         new Slice(Fragment.from(newNode), 0, 0), 1, true))\n}\n\n// :: (Node, number, number, ?[?{type: NodeType, attrs: ?Object}]) → bool\n// Check whether splitting at the given position is allowed.\nexport function canSplit(doc, pos, depth = 1, typesAfter) {\n  let $pos = doc.resolve(pos), base = $pos.depth - depth\n  let innerType = (typesAfter && typesAfter[typesAfter.length - 1]) || $pos.parent\n  if (base < 0 || $pos.parent.type.spec.isolating ||\n      !$pos.parent.canReplace($pos.index(), $pos.parent.childCount) ||\n      !innerType.type.validContent($pos.parent.content.cutByIndex($pos.index(), $pos.parent.childCount)))\n    return false\n  for (let d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {\n    let node = $pos.node(d), index = $pos.index(d)\n    if (node.type.spec.isolating) return false\n    let rest = node.content.cutByIndex(index, node.childCount)\n    let after = (typesAfter && typesAfter[i]) || node\n    if (after != node) rest = rest.replaceChild(0, after.type.create(after.attrs))\n    if (!node.canReplace(index + 1, node.childCount) || !after.type.validContent(rest))\n      return false\n  }\n  let index = $pos.indexAfter(base)\n  let baseType = typesAfter && typesAfter[0]\n  return $pos.node(base).canReplaceWith(index, index, baseType ? baseType.type : $pos.node(base + 1).type)\n}\n\n// :: (number, ?number, ?[?{type: NodeType, attrs: ?Object}]) → this\n// Split the node at the given position, and optionally, if `depth` is\n// greater than one, any number of nodes above that. By default, the\n// parts split off will inherit the node type of the original node.\n// This can be changed by passing an array of types and attributes to\n// use after the split.\nTransform.prototype.split = function(pos, depth = 1, typesAfter) {\n  let $pos = this.doc.resolve(pos), before = Fragment.empty, after = Fragment.empty\n  for (let d = $pos.depth, e = $pos.depth - depth, i = depth - 1; d > e; d--, i--) {\n    before = Fragment.from($pos.node(d).copy(before))\n    let typeAfter = typesAfter && typesAfter[i]\n    after = Fragment.from(typeAfter ? typeAfter.type.create(typeAfter.attrs, after) : $pos.node(d).copy(after))\n  }\n  return this.step(new ReplaceStep(pos, pos, new Slice(before.append(after), depth, depth), true))\n}\n\n// :: (Node, number) → bool\n// Test whether the blocks before and after a given position can be\n// joined.\nexport function canJoin(doc, pos) {\n  let $pos = doc.resolve(pos), index = $pos.index()\n  return joinable($pos.nodeBefore, $pos.nodeAfter) &&\n    $pos.parent.canReplace(index, index + 1)\n}\n\nfunction joinable(a, b) {\n  return a && b && !a.isLeaf && a.canAppend(b)\n}\n\n// :: (Node, number, ?number) → ?number\n// Find an ancestor of the given position that can be joined to the\n// block before (or after if `dir` is positive). Returns the joinable\n// point, if any.\nexport function joinPoint(doc, pos, dir = -1) {\n  let $pos = doc.resolve(pos)\n  for (let d = $pos.depth;; d--) {\n    let before, after, index = $pos.index(d)\n    if (d == $pos.depth) {\n      before = $pos.nodeBefore\n      after = $pos.nodeAfter\n    } else if (dir > 0) {\n      before = $pos.node(d + 1)\n      index++\n      after = $pos.node(d).maybeChild(index)\n    } else {\n      before = $pos.node(d).maybeChild(index - 1)\n      after = $pos.node(d + 1)\n    }\n    if (before && !before.isTextblock && joinable(before, after) &&\n        $pos.node(d).canReplace(index, index + 1)) return pos\n    if (d == 0) break\n    pos = dir < 0 ? $pos.before(d) : $pos.after(d)\n  }\n}\n\n// :: (number, ?number) → this\n// Join the blocks around the given position. If depth is 2, their\n// last and first siblings are also joined, and so on.\nTransform.prototype.join = function(pos, depth = 1) {\n  let step = new ReplaceStep(pos - depth, pos + depth, Slice.empty, true)\n  return this.step(step)\n}\n\n// :: (Node, number, NodeType) → ?number\n// Try to find a point where a node of the given type can be inserted\n// near `pos`, by searching up the node hierarchy when `pos` itself\n// isn't a valid place but is at the start or end of a node. Return\n// null if no position was found.\nexport function insertPoint(doc, pos, nodeType) {\n  let $pos = doc.resolve(pos)\n  if ($pos.parent.canReplaceWith($pos.index(), $pos.index(), nodeType)) return pos\n\n  if ($pos.parentOffset == 0)\n    for (let d = $pos.depth - 1; d >= 0; d--) {\n      let index = $pos.index(d)\n      if ($pos.node(d).canReplaceWith(index, index, nodeType)) return $pos.before(d + 1)\n      if (index > 0) return null\n    }\n  if ($pos.parentOffset == $pos.parent.content.size)\n    for (let d = $pos.depth - 1; d >= 0; d--) {\n      let index = $pos.indexAfter(d)\n      if ($pos.node(d).canReplaceWith(index, index, nodeType)) return $pos.after(d + 1)\n      if (index < $pos.node(d).childCount) return null\n    }\n}\n\n// :: (Node, number, Slice) → ?number\n// Finds a position at or around the given position where the given\n// slice can be inserted. Will look at parent nodes' nearest boundary\n// and try there, even if the original position wasn't directly at the\n// start or end of that node. Returns null when no position was found.\nexport function dropPoint(doc, pos, slice) {\n  let $pos = doc.resolve(pos)\n  if (!slice.content.size) return pos\n  let content = slice.content\n  for (let i = 0; i < slice.openStart; i++) content = content.firstChild.content\n  for (let pass = 1; pass <= (slice.openStart == 0 && slice.size ? 2 : 1); pass++) {\n    for (let d = $pos.depth; d >= 0; d--) {\n      let bias = d == $pos.depth ? 0 : $pos.pos <= ($pos.start(d + 1) + $pos.end(d + 1)) / 2 ? -1 : 1\n      let insertPos = $pos.index(d) + (bias > 0 ? 1 : 0)\n      if (pass == 1\n          ? $pos.node(d).canReplace(insertPos, insertPos, content)\n          : $pos.node(d).contentMatchAt(insertPos).findWrapping(content.firstChild.type))\n        return bias == 0 ? $pos.pos : bias < 0 ? $pos.before(d + 1) : $pos.after(d + 1)\n    }\n  }\n  return null\n}\n","import {Fragment, Slice} from \"prosemirror-model\"\n\nimport {ReplaceStep, ReplaceAroundStep} from \"./replace_step\"\nimport {Transform} from \"./transform\"\nimport {insertPoint} from \"./structure\"\n\n// :: (Node, number, ?number, ?Slice) → ?Step\n// ‘Fit’ a slice into a given position in the document, producing a\n// [step](#transform.Step) that inserts it. Will return null if\n// there's no meaningful way to insert the slice here, or inserting it\n// would be a no-op (an empty slice over an empty range).\nexport function replaceStep(doc, from, to = from, slice = Slice.empty) {\n  if (from == to && !slice.size) return null\n\n  let $from = doc.resolve(from), $to = doc.resolve(to)\n  // Optimization -- avoid work if it's obvious that it's not needed.\n  if (fitsTrivially($from, $to, slice)) return new ReplaceStep(from, to, slice)\n  return new Fitter($from, $to, slice).fit()\n}\n\n// :: (number, ?number, ?Slice) → this\n// Replace the part of the document between `from` and `to` with the\n// given `slice`.\nTransform.prototype.replace = function(from, to = from, slice = Slice.empty) {\n  let step = replaceStep(this.doc, from, to, slice)\n  if (step) this.step(step)\n  return this\n}\n\n// :: (number, number, union<Fragment, Node, [Node]>) → this\n// Replace the given range with the given content, which may be a\n// fragment, node, or array of nodes.\nTransform.prototype.replaceWith = function(from, to, content) {\n  return this.replace(from, to, new Slice(Fragment.from(content), 0, 0))\n}\n\n// :: (number, number) → this\n// Delete the content between the given positions.\nTransform.prototype.delete = function(from, to) {\n  return this.replace(from, to, Slice.empty)\n}\n\n// :: (number, union<Fragment, Node, [Node]>) → this\n// Insert the given content at the given position.\nTransform.prototype.insert = function(pos, content) {\n  return this.replaceWith(pos, pos, content)\n}\n\nfunction fitsTrivially($from, $to, slice) {\n  return !slice.openStart && !slice.openEnd && $from.start() == $to.start() &&\n    $from.parent.canReplace($from.index(), $to.index(), slice.content)\n}\n\n// Algorithm for 'placing' the elements of a slice into a gap:\n//\n// We consider the content of each node that is open to the left to be\n// independently placeable. I.e. in <p(\"foo\"), p(\"bar\")>, when the\n// paragraph on the left is open, \"foo\" can be placed (somewhere on\n// the left side of the replacement gap) independently from p(\"bar\").\n//\n// This class tracks the state of the placement progress in the\n// following properties:\n//\n//  - `frontier` holds a stack of `{type, match}` objects that\n//    represent the open side of the replacement. It starts at\n//    `$from`, then moves forward as content is placed, and is finally\n//    reconciled with `$to`.\n//\n//  - `unplaced` is a slice that represents the content that hasn't\n//    been placed yet.\n//\n//  - `placed` is a fragment of placed content. Its open-start value\n//    is implicit in `$from`, and its open-end value in `frontier`.\nclass Fitter {\n  constructor($from, $to, slice) {\n    this.$to = $to\n    this.$from = $from\n    this.unplaced = slice\n\n    this.frontier = []\n    for (let i = 0; i <= $from.depth; i++) {\n      let node = $from.node(i)\n      this.frontier.push({\n        type: node.type,\n        match: node.contentMatchAt($from.indexAfter(i))\n      })\n    }\n\n    this.placed = Fragment.empty\n    for (let i = $from.depth; i > 0; i--)\n      this.placed = Fragment.from($from.node(i).copy(this.placed))\n  }\n\n  get depth() { return this.frontier.length - 1 }\n\n  fit() {\n    // As long as there's unplaced content, try to place some of it.\n    // If that fails, either increase the open score of the unplaced\n    // slice, or drop nodes from it, and then try again.\n    while (this.unplaced.size) {\n      let fit = this.findFittable()\n      if (fit) this.placeNodes(fit)\n      else this.openMore() || this.dropNode()\n    }\n    // When there's inline content directly after the frontier _and_\n    // directly after `this.$to`, we must generate a `ReplaceAround`\n    // step that pulls that content into the node after the frontier.\n    // That means the fitting must be done to the end of the textblock\n    // node after `this.$to`, not `this.$to` itself.\n    let moveInline = this.mustMoveInline(), placedSize = this.placed.size - this.depth - this.$from.depth\n    let $from = this.$from, $to = this.close(moveInline < 0 ? this.$to : $from.doc.resolve(moveInline))\n    if (!$to) return null\n\n    // If closing to `$to` succeeded, create a step\n    let content = this.placed, openStart = $from.depth, openEnd = $to.depth\n    while (openStart && openEnd && content.childCount == 1) { // Normalize by dropping open parent nodes\n      content = content.firstChild.content\n      openStart--; openEnd--\n    }\n    let slice = new Slice(content, openStart, openEnd)\n    if (moveInline > -1)\n      return new ReplaceAroundStep($from.pos, moveInline, this.$to.pos, this.$to.end(), slice, placedSize)\n    if (slice.size || $from.pos != this.$to.pos) // Don't generate no-op steps\n      return new ReplaceStep($from.pos, $to.pos, slice)\n  }\n\n  // Find a position on the start spine of `this.unplaced` that has\n  // content that can be moved somewhere on the frontier. Returns two\n  // depths, one for the slice and one for the frontier.\n  findFittable() {\n    // Only try wrapping nodes (pass 2) after finding a place without\n    // wrapping failed.\n    for (let pass = 1; pass <= 2; pass++) {\n      for (let sliceDepth = this.unplaced.openStart; sliceDepth >= 0; sliceDepth--) {\n        let fragment, parent\n        if (sliceDepth) {\n          parent = contentAt(this.unplaced.content, sliceDepth - 1).firstChild\n          fragment = parent.content\n        } else {\n          fragment = this.unplaced.content\n        }\n        let first = fragment.firstChild\n        for (let frontierDepth = this.depth; frontierDepth >= 0; frontierDepth--) {\n          let {type, match} = this.frontier[frontierDepth], wrap, inject\n          // In pass 1, if the next node matches, or there is no next\n          // node but the parents look compatible, we've found a\n          // place.\n          if (pass == 1 && (first ? match.matchType(first.type) || (inject = match.fillBefore(Fragment.from(first), false))\n                            : type.compatibleContent(parent.type)))\n            return {sliceDepth, frontierDepth, parent, inject}\n          // In pass 2, look for a set of wrapping nodes that make\n          // `first` fit here.\n          else if (pass == 2 && first && (wrap = match.findWrapping(first.type)))\n            return {sliceDepth, frontierDepth, parent, wrap}\n          // Don't continue looking further up if the parent node\n          // would fit here.\n          if (parent && match.matchType(parent.type)) break\n        }\n      }\n    }\n  }\n\n  openMore() {\n    let {content, openStart, openEnd} = this.unplaced\n    let inner = contentAt(content, openStart)\n    if (!inner.childCount || inner.firstChild.isLeaf) return false\n    this.unplaced = new Slice(content, openStart + 1,\n                              Math.max(openEnd, inner.size + openStart >= content.size - openEnd ? openStart + 1 : 0))\n    return true\n  }\n\n  dropNode() {\n    let {content, openStart, openEnd} = this.unplaced\n    let inner = contentAt(content, openStart)\n    if (inner.childCount <= 1 && openStart > 0) {\n      let openAtEnd = content.size - openStart <= openStart + inner.size\n      this.unplaced = new Slice(dropFromFragment(content, openStart - 1, 1), openStart - 1,\n                                openAtEnd ? openStart - 1 : openEnd)\n    } else {\n      this.unplaced = new Slice(dropFromFragment(content, openStart, 1), openStart, openEnd)\n    }\n  }\n\n  // : ({sliceDepth: number, frontierDepth: number, parent: ?Node, wrap: ?[NodeType], inject: ?Fragment})\n  // Move content from the unplaced slice at `sliceDepth` to the\n  // frontier node at `frontierDepth`. Close that frontier node when\n  // applicable.\n  placeNodes({sliceDepth, frontierDepth, parent, inject, wrap}) {\n    while (this.depth > frontierDepth) this.closeFrontierNode()\n    if (wrap) for (let i = 0; i < wrap.length; i++) this.openFrontierNode(wrap[i])\n\n    let slice = this.unplaced, fragment = parent ? parent.content : slice.content\n    let openStart = slice.openStart - sliceDepth\n    let taken = 0, add = []\n    let {match, type} = this.frontier[frontierDepth]\n    if (inject) {\n      for (let i = 0; i < inject.childCount; i++) add.push(inject.child(i))\n      match = match.matchFragment(inject)\n    }\n    // Computes the amount of (end) open nodes at the end of the\n    // fragment. When 0, the parent is open, but no more. When\n    // negative, nothing is open.\n    let openEndCount = (fragment.size + sliceDepth) - (slice.content.size - slice.openEnd)\n    // Scan over the fragment, fitting as many child nodes as\n    // possible.\n    while (taken < fragment.childCount) {\n      let next = fragment.child(taken), matches = match.matchType(next.type)\n      if (!matches) break\n      taken++\n      if (taken > 1 || openStart == 0 || next.content.size) { // Drop empty open nodes\n        match = matches\n        add.push(closeNodeStart(next.mark(type.allowedMarks(next.marks)), taken == 1 ? openStart : 0,\n                                taken == fragment.childCount ? openEndCount : -1))\n      }\n    }\n    let toEnd = taken == fragment.childCount\n    if (!toEnd) openEndCount = -1\n\n    this.placed = addToFragment(this.placed, frontierDepth, Fragment.from(add))\n    this.frontier[frontierDepth].match = match\n\n    // If the parent types match, and the entire node was moved, and\n    // it's not open, close this frontier node right away.\n    if (toEnd && openEndCount < 0 && parent && parent.type == this.frontier[this.depth].type && this.frontier.length > 1)\n      this.closeFrontierNode()\n\n    // Add new frontier nodes for any open nodes at the end.\n    for (let i = 0, cur = fragment; i < openEndCount; i++) {\n      let node = cur.lastChild\n      this.frontier.push({type: node.type, match: node.contentMatchAt(node.childCount)})\n      cur = node.content\n    }\n\n    // Update `this.unplaced`. Drop the entire node from which we\n    // placed it we got to its end, otherwise just drop the placed\n    // nodes.\n    this.unplaced = !toEnd ? new Slice(dropFromFragment(slice.content, sliceDepth, taken), slice.openStart, slice.openEnd)\n      : sliceDepth == 0 ? Slice.empty\n      : new Slice(dropFromFragment(slice.content, sliceDepth - 1, 1),\n                  sliceDepth - 1, openEndCount < 0 ? slice.openEnd : sliceDepth - 1)\n  }\n\n  mustMoveInline() {\n    if (!this.$to.parent.isTextblock || this.$to.end() == this.$to.pos) return -1\n    let top = this.frontier[this.depth], level\n    if (!top.type.isTextblock || !contentAfterFits(this.$to, this.$to.depth, top.type, top.match, false) ||\n        (this.$to.depth == this.depth && (level = this.findCloseLevel(this.$to)) && level.depth == this.depth)) return -1\n\n    let {depth} = this.$to, after = this.$to.after(depth)\n    while (depth > 1 && after == this.$to.end(--depth)) ++after\n    return after\n  }\n\n  findCloseLevel($to) {\n    scan: for (let i = Math.min(this.depth, $to.depth); i >= 0; i--) {\n      let {match, type} = this.frontier[i]\n      let dropInner = i < $to.depth && $to.end(i + 1) == $to.pos + ($to.depth - (i + 1))\n      let fit = contentAfterFits($to, i, type, match, dropInner)\n      if (!fit) continue\n      for (let d = i - 1; d >= 0; d--) {\n        let {match, type} = this.frontier[d]\n        let matches = contentAfterFits($to, d, type, match, true)\n        if (!matches || matches.childCount) continue scan\n      }\n      return {depth: i, fit, move: dropInner ? $to.doc.resolve($to.after(i + 1)) : $to}\n    }\n  }\n\n  close($to) {\n    let close = this.findCloseLevel($to)\n    if (!close) return null\n\n    while (this.depth > close.depth) this.closeFrontierNode()\n    if (close.fit.childCount) this.placed = addToFragment(this.placed, close.depth, close.fit)\n    $to = close.move\n    for (let d = close.depth + 1; d <= $to.depth; d++) {\n      let node = $to.node(d), add = node.type.contentMatch.fillBefore(node.content, true, $to.index(d))\n      this.openFrontierNode(node.type, node.attrs, add)\n    }\n    return $to\n  }\n\n  openFrontierNode(type, attrs, content) {\n    let top = this.frontier[this.depth]\n    top.match = top.match.matchType(type)\n    this.placed = addToFragment(this.placed, this.depth, Fragment.from(type.create(attrs, content)))\n    this.frontier.push({type, match: type.contentMatch})\n  }\n\n  closeFrontierNode() {\n    let open = this.frontier.pop()\n    let add = open.match.fillBefore(Fragment.empty, true)\n    if (add.childCount) this.placed = addToFragment(this.placed, this.frontier.length, add)\n  }\n}\n\nfunction dropFromFragment(fragment, depth, count) {\n  if (depth == 0) return fragment.cutByIndex(count)\n  return fragment.replaceChild(0, fragment.firstChild.copy(dropFromFragment(fragment.firstChild.content, depth - 1, count)))\n}\n\nfunction addToFragment(fragment, depth, content) {\n  if (depth == 0) return fragment.append(content)\n  return fragment.replaceChild(fragment.childCount - 1,\n                               fragment.lastChild.copy(addToFragment(fragment.lastChild.content, depth - 1, content)))\n}\n\nfunction contentAt(fragment, depth) {\n  for (let i = 0; i < depth; i++) fragment = fragment.firstChild.content\n  return fragment\n}\n\nfunction closeNodeStart(node, openStart, openEnd) {\n  if (openStart <= 0) return node\n  let frag = node.content\n  if (openStart > 1)\n    frag = frag.replaceChild(0, closeNodeStart(frag.firstChild, openStart - 1, frag.childCount == 1 ? openEnd - 1 : 0))\n  if (openStart > 0) {\n    frag = node.type.contentMatch.fillBefore(frag).append(frag)\n    if (openEnd <= 0) frag = frag.append(node.type.contentMatch.matchFragment(frag).fillBefore(Fragment.empty, true))\n  }\n  return node.copy(frag)\n}\n\nfunction contentAfterFits($to, depth, type, match, open) {\n  let node = $to.node(depth), index = open ? $to.indexAfter(depth) : $to.index(depth)\n  if (index == node.childCount && !type.compatibleContent(node.type)) return null\n  let fit = match.fillBefore(node.content, true, index)\n  return fit && !invalidMarks(type, node.content, index) ? fit : null\n}\n\nfunction invalidMarks(type, fragment, start) {\n  for (let i = start; i < fragment.childCount; i++)\n    if (!type.allowsMarks(fragment.child(i).marks)) return true\n  return false\n}\n\n// :: (number, number, Slice) → this\n// Replace a range of the document with a given slice, using `from`,\n// `to`, and the slice's [`openStart`](#model.Slice.openStart) property\n// as hints, rather than fixed start and end points. This method may\n// grow the replaced area or close open nodes in the slice in order to\n// get a fit that is more in line with WYSIWYG expectations, by\n// dropping fully covered parent nodes of the replaced region when\n// they are marked [non-defining](#model.NodeSpec.defining), or\n// including an open parent node from the slice that _is_ marked as\n// [defining](#model.NodeSpec.defining).\n//\n// This is the method, for example, to handle paste. The similar\n// [`replace`](#transform.Transform.replace) method is a more\n// primitive tool which will _not_ move the start and end of its given\n// range, and is useful in situations where you need more precise\n// control over what happens.\nTransform.prototype.replaceRange = function(from, to, slice) {\n  if (!slice.size) return this.deleteRange(from, to)\n\n  let $from = this.doc.resolve(from), $to = this.doc.resolve(to)\n  if (fitsTrivially($from, $to, slice))\n    return this.step(new ReplaceStep(from, to, slice))\n\n  let targetDepths = coveredDepths($from, this.doc.resolve(to))\n  // Can't replace the whole document, so remove 0 if it's present\n  if (targetDepths[targetDepths.length - 1] == 0) targetDepths.pop()\n  // Negative numbers represent not expansion over the whole node at\n  // that depth, but replacing from $from.before(-D) to $to.pos.\n  let preferredTarget = -($from.depth + 1)\n  targetDepths.unshift(preferredTarget)\n  // This loop picks a preferred target depth, if one of the covering\n  // depths is not outside of a defining node, and adds negative\n  // depths for any depth that has $from at its start and does not\n  // cross a defining node.\n  for (let d = $from.depth, pos = $from.pos - 1; d > 0; d--, pos--) {\n    let spec = $from.node(d).type.spec\n    if (spec.defining || spec.isolating) break\n    if (targetDepths.indexOf(d) > -1) preferredTarget = d\n    else if ($from.before(d) == pos) targetDepths.splice(1, 0, -d)\n  }\n  // Try to fit each possible depth of the slice into each possible\n  // target depth, starting with the preferred depths.\n  let preferredTargetIndex = targetDepths.indexOf(preferredTarget)\n\n  let leftNodes = [], preferredDepth = slice.openStart\n  for (let content = slice.content, i = 0;; i++) {\n    let node = content.firstChild\n    leftNodes.push(node)\n    if (i == slice.openStart) break\n    content = node.content\n  }\n  // Back up if the node directly above openStart, or the node above\n  // that separated only by a non-defining textblock node, is defining.\n  if (preferredDepth > 0 && leftNodes[preferredDepth - 1].type.spec.defining &&\n      $from.node(preferredTargetIndex).type != leftNodes[preferredDepth - 1].type)\n    preferredDepth -= 1\n  else if (preferredDepth >= 2 && leftNodes[preferredDepth - 1].isTextblock && leftNodes[preferredDepth - 2].type.spec.defining &&\n           $from.node(preferredTargetIndex).type != leftNodes[preferredDepth - 2].type)\n    preferredDepth -= 2\n\n  for (let j = slice.openStart; j >= 0; j--) {\n    let openDepth = (j + preferredDepth + 1) % (slice.openStart + 1)\n    let insert = leftNodes[openDepth]\n    if (!insert) continue\n    for (let i = 0; i < targetDepths.length; i++) {\n      // Loop over possible expansion levels, starting with the\n      // preferred one\n      let targetDepth = targetDepths[(i + preferredTargetIndex) % targetDepths.length], expand = true\n      if (targetDepth < 0) { expand = false; targetDepth = -targetDepth }\n      let parent = $from.node(targetDepth - 1), index = $from.index(targetDepth - 1)\n      if (parent.canReplaceWith(index, index, insert.type, insert.marks))\n        return this.replace($from.before(targetDepth), expand ? $to.after(targetDepth) : to,\n                            new Slice(closeFragment(slice.content, 0, slice.openStart, openDepth),\n                                      openDepth, slice.openEnd))\n    }\n  }\n\n  let startSteps = this.steps.length\n  for (let i = targetDepths.length - 1; i >= 0; i--) {\n    this.replace(from, to, slice)\n    if (this.steps.length > startSteps) break\n    let depth = targetDepths[i]\n    if (i < 0) continue\n    from = $from.before(depth); to = $to.after(depth)\n  }\n  return this\n}\n\nfunction closeFragment(fragment, depth, oldOpen, newOpen, parent) {\n  if (depth < oldOpen) {\n    let first = fragment.firstChild\n    fragment = fragment.replaceChild(0, first.copy(closeFragment(first.content, depth + 1, oldOpen, newOpen, first)))\n  }\n  if (depth > newOpen) {\n    let match = parent.contentMatchAt(0)\n    let start = match.fillBefore(fragment).append(fragment)\n    fragment = start.append(match.matchFragment(start).fillBefore(Fragment.empty, true))\n  }\n  return fragment\n}\n\n// :: (number, number, Node) → this\n// Replace the given range with a node, but use `from` and `to` as\n// hints, rather than precise positions. When from and to are the same\n// and are at the start or end of a parent node in which the given\n// node doesn't fit, this method may _move_ them out towards a parent\n// that does allow the given node to be placed. When the given range\n// completely covers a parent node, this method may completely replace\n// that parent node.\nTransform.prototype.replaceRangeWith = function(from, to, node) {\n  if (!node.isInline && from == to && this.doc.resolve(from).parent.content.size) {\n    let point = insertPoint(this.doc, from, node.type)\n    if (point != null) from = to = point\n  }\n  return this.replaceRange(from, to, new Slice(Fragment.from(node), 0, 0))\n}\n\n// :: (number, number) → this\n// Delete the given range, expanding it to cover fully covered\n// parent nodes until a valid replace is found.\nTransform.prototype.deleteRange = function(from, to) {\n  let $from = this.doc.resolve(from), $to = this.doc.resolve(to)\n  let covered = coveredDepths($from, $to)\n  for (let i = 0; i < covered.length; i++) {\n    let depth = covered[i], last = i == covered.length - 1\n    if ((last && depth == 0) || $from.node(depth).type.contentMatch.validEnd)\n      return this.delete($from.start(depth), $to.end(depth))\n    if (depth > 0 && (last || $from.node(depth - 1).canReplace($from.index(depth - 1), $to.indexAfter(depth - 1))))\n      return this.delete($from.before(depth), $to.after(depth))\n  }\n  for (let d = 1; d <= $from.depth && d <= $to.depth; d++) {\n    if (from - $from.start(d) == $from.depth - d && to > $from.end(d) && $to.end(d) - to != $to.depth - d)\n      return this.delete($from.before(d), to)\n  }\n  return this.delete(from, to)\n}\n\n// : (ResolvedPos, ResolvedPos) → [number]\n// Returns an array of all depths for which $from - $to spans the\n// whole content of the nodes at that depth.\nfunction coveredDepths($from, $to) {\n  let result = [], minDepth = Math.min($from.depth, $to.depth)\n  for (let d = minDepth; d >= 0; d--) {\n    let start = $from.start(d)\n    if (start < $from.pos - ($from.depth - d) ||\n        $to.end(d) > $to.pos + ($to.depth - d) ||\n        $from.node(d).type.spec.isolating ||\n        $to.node(d).type.spec.isolating) break\n    if (start == $to.start(d)) result.push(d)\n  }\n  return result\n}\n","import {MarkType, Slice, Fragment} from \"prosemirror-model\"\n\nimport {Transform} from \"./transform\"\nimport {AddMarkStep, RemoveMarkStep} from \"./mark_step\"\nimport {ReplaceStep} from \"./replace_step\"\n\n// :: (number, number, Mark) → this\n// Add the given mark to the inline content between `from` and `to`.\nTransform.prototype.addMark = function(from, to, mark) {\n  let removed = [], added = [], removing = null, adding = null\n  this.doc.nodesBetween(from, to, (node, pos, parent) => {\n    if (!node.isInline) return\n    let marks = node.marks\n    if (!mark.isInSet(marks) && parent.type.allowsMarkType(mark.type)) {\n      let start = Math.max(pos, from), end = Math.min(pos + node.nodeSize, to)\n      let newSet = mark.addToSet(marks)\n\n      for (let i = 0; i < marks.length; i++) {\n        if (!marks[i].isInSet(newSet)) {\n          if (removing && removing.to == start && removing.mark.eq(marks[i]))\n            removing.to = end\n          else\n            removed.push(removing = new RemoveMarkStep(start, end, marks[i]))\n        }\n      }\n\n      if (adding && adding.to == start)\n        adding.to = end\n      else\n        added.push(adding = new AddMarkStep(start, end, mark))\n    }\n  })\n\n  removed.forEach(s => this.step(s))\n  added.forEach(s => this.step(s))\n  return this\n}\n\n// :: (number, number, ?union<Mark, MarkType>) → this\n// Remove marks from inline nodes between `from` and `to`. When `mark`\n// is a single mark, remove precisely that mark. When it is a mark type,\n// remove all marks of that type. When it is null, remove all marks of\n// any type.\nTransform.prototype.removeMark = function(from, to, mark = null) {\n  let matched = [], step = 0\n  this.doc.nodesBetween(from, to, (node, pos) => {\n    if (!node.isInline) return\n    step++\n    let toRemove = null\n    if (mark instanceof MarkType) {\n      let set = node.marks, found\n      while (found = mark.isInSet(set)) {\n        ;(toRemove || (toRemove = [])).push(found)\n        set = found.removeFromSet(set)\n      }\n    } else if (mark) {\n      if (mark.isInSet(node.marks)) toRemove = [mark]\n    } else {\n      toRemove = node.marks\n    }\n    if (toRemove && toRemove.length) {\n      let end = Math.min(pos + node.nodeSize, to)\n      for (let i = 0; i < toRemove.length; i++) {\n        let style = toRemove[i], found\n        for (let j = 0; j < matched.length; j++) {\n          let m = matched[j]\n          if (m.step == step - 1 && style.eq(matched[j].style)) found = m\n        }\n        if (found) {\n          found.to = end\n          found.step = step\n        } else {\n          matched.push({style, from: Math.max(pos, from), to: end, step})\n        }\n      }\n    }\n  })\n  matched.forEach(m => this.step(new RemoveMarkStep(m.from, m.to, m.style)))\n  return this\n}\n\n// :: (number, NodeType, ?ContentMatch) → this\n// Removes all marks and nodes from the content of the node at `pos`\n// that don't match the given new parent node type. Accepts an\n// optional starting [content match](#model.ContentMatch) as third\n// argument.\nTransform.prototype.clearIncompatible = function(pos, parentType, match = parentType.contentMatch) {\n  let node = this.doc.nodeAt(pos)\n  let delSteps = [], cur = pos + 1\n  for (let i = 0; i < node.childCount; i++) {\n    let child = node.child(i), end = cur + child.nodeSize\n    let allowed = match.matchType(child.type, child.attrs)\n    if (!allowed) {\n      delSteps.push(new ReplaceStep(cur, end, Slice.empty))\n    } else {\n      match = allowed\n      for (let j = 0; j < child.marks.length; j++) if (!parentType.allowsMarkType(child.marks[j].type))\n        this.step(new RemoveMarkStep(cur, end, child.marks[j]))\n    }\n    cur = end\n  }\n  if (!match.validEnd) {\n    let fill = match.fillBefore(Fragment.empty, true)\n    this.replace(cur, cur, new Slice(fill, 0, 0))\n  }\n  for (let i = delSteps.length - 1; i >= 0; i--) this.step(delSteps[i])\n  return this\n}\n","import {Slice, Fragment} from \"prosemirror-model\"\nimport {ReplaceStep, ReplaceAroundStep} from \"prosemirror-transform\"\n\nconst classesById = Object.create(null)\n\n// ::- Superclass for editor selections. Every selection type should\n// extend this. Should not be instantiated directly.\nexport class Selection {\n  // :: (ResolvedPos, ResolvedPos, ?[SelectionRange])\n  // Initialize a selection with the head and anchor and ranges. If no\n  // ranges are given, constructs a single range across `$anchor` and\n  // `$head`.\n  constructor($anchor, $head, ranges) {\n    // :: [SelectionRange]\n    // The ranges covered by the selection.\n    this.ranges = ranges || [new SelectionRange($anchor.min($head), $anchor.max($head))]\n    // :: ResolvedPos\n    // The resolved anchor of the selection (the side that stays in\n    // place when the selection is modified).\n    this.$anchor = $anchor\n    // :: ResolvedPos\n    // The resolved head of the selection (the side that moves when\n    // the selection is modified).\n    this.$head = $head\n  }\n\n  // :: number\n  // The selection's anchor, as an unresolved position.\n  get anchor() { return this.$anchor.pos }\n\n  // :: number\n  // The selection's head.\n  get head() { return this.$head.pos }\n\n  // :: number\n  // The lower bound of the selection's main range.\n  get from() { return this.$from.pos }\n\n  // :: number\n  // The upper bound of the selection's main range.\n  get to() { return this.$to.pos }\n\n  // :: ResolvedPos\n  // The resolved lower  bound of the selection's main range.\n  get $from() {\n    return this.ranges[0].$from\n  }\n\n  // :: ResolvedPos\n  // The resolved upper bound of the selection's main range.\n  get $to() {\n    return this.ranges[0].$to\n  }\n\n  // :: bool\n  // Indicates whether the selection contains any content.\n  get empty() {\n    let ranges = this.ranges\n    for (let i = 0; i < ranges.length; i++)\n      if (ranges[i].$from.pos != ranges[i].$to.pos) return false\n    return true\n  }\n\n  // eq:: (Selection) → bool\n  // Test whether the selection is the same as another selection.\n\n  // map:: (doc: Node, mapping: Mappable) → Selection\n  // Map this selection through a [mappable](#transform.Mappable) thing. `doc`\n  // should be the new document to which we are mapping.\n\n  // :: () → Slice\n  // Get the content of this selection as a slice.\n  content() {\n    return this.$from.node(0).slice(this.from, this.to, true)\n  }\n\n  // :: (Transaction, ?Slice)\n  // Replace the selection with a slice or, if no slice is given,\n  // delete the selection. Will append to the given transaction.\n  replace(tr, content = Slice.empty) {\n    // Put the new selection at the position after the inserted\n    // content. When that ended in an inline node, search backwards,\n    // to get the position after that node. If not, search forward.\n    let lastNode = content.content.lastChild, lastParent = null\n    for (let i = 0; i < content.openEnd; i++) {\n      lastParent = lastNode\n      lastNode = lastNode.lastChild\n    }\n\n    let mapFrom = tr.steps.length, ranges = this.ranges\n    for (let i = 0; i < ranges.length; i++) {\n      let {$from, $to} = ranges[i], mapping = tr.mapping.slice(mapFrom)\n      tr.replaceRange(mapping.map($from.pos), mapping.map($to.pos), i ? Slice.empty : content)\n      if (i == 0)\n        selectionToInsertionEnd(tr, mapFrom, (lastNode ? lastNode.isInline : lastParent && lastParent.isTextblock) ? -1 : 1)\n    }\n  }\n\n  // :: (Transaction, Node)\n  // Replace the selection with the given node, appending the changes\n  // to the given transaction.\n  replaceWith(tr, node) {\n    let mapFrom = tr.steps.length, ranges = this.ranges\n    for (let i = 0; i < ranges.length; i++) {\n      let {$from, $to} = ranges[i], mapping = tr.mapping.slice(mapFrom)\n      let from = mapping.map($from.pos), to = mapping.map($to.pos)\n      if (i) {\n        tr.deleteRange(from, to)\n      } else {\n        tr.replaceRangeWith(from, to, node)\n        selectionToInsertionEnd(tr, mapFrom, node.isInline ? -1 : 1)\n      }\n    }\n  }\n\n  // toJSON:: () → Object\n  // Convert the selection to a JSON representation. When implementing\n  // this for a custom selection class, make sure to give the object a\n  // `type` property whose value matches the ID under which you\n  // [registered](#state.Selection^jsonID) your class.\n\n  // :: (ResolvedPos, number, ?bool) → ?Selection\n  // Find a valid cursor or leaf node selection starting at the given\n  // position and searching back if `dir` is negative, and forward if\n  // positive. When `textOnly` is true, only consider cursor\n  // selections. Will return null when no valid selection position is\n  // found.\n  static findFrom($pos, dir, textOnly) {\n    let inner = $pos.parent.inlineContent ? new TextSelection($pos)\n        : findSelectionIn($pos.node(0), $pos.parent, $pos.pos, $pos.index(), dir, textOnly)\n    if (inner) return inner\n\n    for (let depth = $pos.depth - 1; depth >= 0; depth--) {\n      let found = dir < 0\n          ? findSelectionIn($pos.node(0), $pos.node(depth), $pos.before(depth + 1), $pos.index(depth), dir, textOnly)\n          : findSelectionIn($pos.node(0), $pos.node(depth), $pos.after(depth + 1), $pos.index(depth) + 1, dir, textOnly)\n      if (found) return found\n    }\n  }\n\n  // :: (ResolvedPos, ?number) → Selection\n  // Find a valid cursor or leaf node selection near the given\n  // position. Searches forward first by default, but if `bias` is\n  // negative, it will search backwards first.\n  static near($pos, bias = 1) {\n    return this.findFrom($pos, bias) || this.findFrom($pos, -bias) || new AllSelection($pos.node(0))\n  }\n\n  // :: (Node) → Selection\n  // Find the cursor or leaf node selection closest to the start of\n  // the given document. Will return an\n  // [`AllSelection`](#state.AllSelection) if no valid position\n  // exists.\n  static atStart(doc) {\n    return findSelectionIn(doc, doc, 0, 0, 1) || new AllSelection(doc)\n  }\n\n  // :: (Node) → Selection\n  // Find the cursor or leaf node selection closest to the end of the\n  // given document.\n  static atEnd(doc) {\n    return findSelectionIn(doc, doc, doc.content.size, doc.childCount, -1) || new AllSelection(doc)\n  }\n\n  // :: (Node, Object) → Selection\n  // Deserialize the JSON representation of a selection. Must be\n  // implemented for custom classes (as a static class method).\n  static fromJSON(doc, json) {\n    if (!json || !json.type) throw new RangeError(\"Invalid input for Selection.fromJSON\")\n    let cls = classesById[json.type]\n    if (!cls) throw new RangeError(`No selection type ${json.type} defined`)\n    return cls.fromJSON(doc, json)\n  }\n\n  // :: (string, constructor<Selection>)\n  // To be able to deserialize selections from JSON, custom selection\n  // classes must register themselves with an ID string, so that they\n  // can be disambiguated. Try to pick something that's unlikely to\n  // clash with classes from other modules.\n  static jsonID(id, selectionClass) {\n    if (id in classesById) throw new RangeError(\"Duplicate use of selection JSON ID \" + id)\n    classesById[id] = selectionClass\n    selectionClass.prototype.jsonID = id\n    return selectionClass\n  }\n\n  // :: () → SelectionBookmark\n  // Get a [bookmark](#state.SelectionBookmark) for this selection,\n  // which is a value that can be mapped without having access to a\n  // current document, and later resolved to a real selection for a\n  // given document again. (This is used mostly by the history to\n  // track and restore old selections.) The default implementation of\n  // this method just converts the selection to a text selection and\n  // returns the bookmark for that.\n  getBookmark() {\n    return TextSelection.between(this.$anchor, this.$head).getBookmark()\n  }\n}\n\n// :: bool\n// Controls whether, when a selection of this type is active in the\n// browser, the selected range should be visible to the user. Defaults\n// to `true`.\nSelection.prototype.visible = true\n\n// SelectionBookmark:: interface\n// A lightweight, document-independent representation of a selection.\n// You can define a custom bookmark type for a custom selection class\n// to make the history handle it well.\n//\n//   map:: (mapping: Mapping) → SelectionBookmark\n//   Map the bookmark through a set of changes.\n//\n//   resolve:: (doc: Node) → Selection\n//   Resolve the bookmark to a real selection again. This may need to\n//   do some error checking and may fall back to a default (usually\n//   [`TextSelection.between`](#state.TextSelection^between)) if\n//   mapping made the bookmark invalid.\n\n// ::- Represents a selected range in a document.\nexport class SelectionRange {\n  // :: (ResolvedPos, ResolvedPos)\n  constructor($from, $to) {\n    // :: ResolvedPos\n    // The lower bound of the range.\n    this.$from = $from\n    // :: ResolvedPos\n    // The upper bound of the range.\n    this.$to = $to\n  }\n}\n\n// ::- A text selection represents a classical editor selection, with\n// a head (the moving side) and anchor (immobile side), both of which\n// point into textblock nodes. It can be empty (a regular cursor\n// position).\nexport class TextSelection extends Selection {\n  // :: (ResolvedPos, ?ResolvedPos)\n  // Construct a text selection between the given points.\n  constructor($anchor, $head = $anchor) {\n    super($anchor, $head)\n  }\n\n  // :: ?ResolvedPos\n  // Returns a resolved position if this is a cursor selection (an\n  // empty text selection), and null otherwise.\n  get $cursor() { return this.$anchor.pos == this.$head.pos ? this.$head : null }\n\n  map(doc, mapping) {\n    let $head = doc.resolve(mapping.map(this.head))\n    if (!$head.parent.inlineContent) return Selection.near($head)\n    let $anchor = doc.resolve(mapping.map(this.anchor))\n    return new TextSelection($anchor.parent.inlineContent ? $anchor : $head, $head)\n  }\n\n  replace(tr, content = Slice.empty) {\n    super.replace(tr, content)\n    if (content == Slice.empty) {\n      let marks = this.$from.marksAcross(this.$to)\n      if (marks) tr.ensureMarks(marks)\n    }\n  }\n\n  eq(other) {\n    return other instanceof TextSelection && other.anchor == this.anchor && other.head == this.head\n  }\n\n  getBookmark() {\n    return new TextBookmark(this.anchor, this.head)\n  }\n\n  toJSON() {\n    return {type: \"text\", anchor: this.anchor, head: this.head}\n  }\n\n  static fromJSON(doc, json) {\n    if (typeof json.anchor != \"number\" || typeof json.head != \"number\")\n      throw new RangeError(\"Invalid input for TextSelection.fromJSON\")\n    return new TextSelection(doc.resolve(json.anchor), doc.resolve(json.head))\n  }\n\n  // :: (Node, number, ?number) → TextSelection\n  // Create a text selection from non-resolved positions.\n  static create(doc, anchor, head = anchor) {\n    let $anchor = doc.resolve(anchor)\n    return new this($anchor, head == anchor ? $anchor : doc.resolve(head))\n  }\n\n  // :: (ResolvedPos, ResolvedPos, ?number) → Selection\n  // Return a text selection that spans the given positions or, if\n  // they aren't text positions, find a text selection near them.\n  // `bias` determines whether the method searches forward (default)\n  // or backwards (negative number) first. Will fall back to calling\n  // [`Selection.near`](#state.Selection^near) when the document\n  // doesn't contain a valid text position.\n  static between($anchor, $head, bias) {\n    let dPos = $anchor.pos - $head.pos\n    if (!bias || dPos) bias = dPos >= 0 ? 1 : -1\n    if (!$head.parent.inlineContent) {\n      let found = Selection.findFrom($head, bias, true) || Selection.findFrom($head, -bias, true)\n      if (found) $head = found.$head\n      else return Selection.near($head, bias)\n    }\n    if (!$anchor.parent.inlineContent) {\n      if (dPos == 0) {\n        $anchor = $head\n      } else {\n        $anchor = (Selection.findFrom($anchor, -bias, true) || Selection.findFrom($anchor, bias, true)).$anchor\n        if (($anchor.pos < $head.pos) != (dPos < 0)) $anchor = $head\n      }\n    }\n    return new TextSelection($anchor, $head)\n  }\n}\n\nSelection.jsonID(\"text\", TextSelection)\n\nclass TextBookmark {\n  constructor(anchor, head) {\n    this.anchor = anchor\n    this.head = head\n  }\n  map(mapping) {\n    return new TextBookmark(mapping.map(this.anchor), mapping.map(this.head))\n  }\n  resolve(doc) {\n    return TextSelection.between(doc.resolve(this.anchor), doc.resolve(this.head))\n  }\n}\n\n// ::- A node selection is a selection that points at a single node.\n// All nodes marked [selectable](#model.NodeSpec.selectable) can be\n// the target of a node selection. In such a selection, `from` and\n// `to` point directly before and after the selected node, `anchor`\n// equals `from`, and `head` equals `to`..\nexport class NodeSelection extends Selection {\n  // :: (ResolvedPos)\n  // Create a node selection. Does not verify the validity of its\n  // argument.\n  constructor($pos) {\n    let node = $pos.nodeAfter\n    let $end = $pos.node(0).resolve($pos.pos + node.nodeSize)\n    super($pos, $end)\n    // :: Node The selected node.\n    this.node = node\n  }\n\n  map(doc, mapping) {\n    let {deleted, pos} = mapping.mapResult(this.anchor)\n    let $pos = doc.resolve(pos)\n    if (deleted) return Selection.near($pos)\n    return new NodeSelection($pos)\n  }\n\n  content() {\n    return new Slice(Fragment.from(this.node), 0, 0)\n  }\n\n  eq(other) {\n    return other instanceof NodeSelection && other.anchor == this.anchor\n  }\n\n  toJSON() {\n    return {type: \"node\", anchor: this.anchor}\n  }\n\n  getBookmark() { return new NodeBookmark(this.anchor) }\n\n  static fromJSON(doc, json) {\n    if (typeof json.anchor != \"number\")\n      throw new RangeError(\"Invalid input for NodeSelection.fromJSON\")\n    return new NodeSelection(doc.resolve(json.anchor))\n  }\n\n  // :: (Node, number) → NodeSelection\n  // Create a node selection from non-resolved positions.\n  static create(doc, from) {\n    return new this(doc.resolve(from))\n  }\n\n  // :: (Node) → bool\n  // Determines whether the given node may be selected as a node\n  // selection.\n  static isSelectable(node) {\n    return !node.isText && node.type.spec.selectable !== false\n  }\n}\n\nNodeSelection.prototype.visible = false\n\nSelection.jsonID(\"node\", NodeSelection)\n\nclass NodeBookmark {\n  constructor(anchor) {\n    this.anchor = anchor\n  }\n  map(mapping) {\n    let {deleted, pos} = mapping.mapResult(this.anchor)\n    return deleted ? new TextBookmark(pos, pos) : new NodeBookmark(pos)\n  }\n  resolve(doc) {\n    let $pos = doc.resolve(this.anchor), node = $pos.nodeAfter\n    if (node && NodeSelection.isSelectable(node)) return new NodeSelection($pos)\n    return Selection.near($pos)\n  }\n}\n\n// ::- A selection type that represents selecting the whole document\n// (which can not necessarily be expressed with a text selection, when\n// there are for example leaf block nodes at the start or end of the\n// document).\nexport class AllSelection extends Selection {\n  // :: (Node)\n  // Create an all-selection over the given document.\n  constructor(doc) {\n    super(doc.resolve(0), doc.resolve(doc.content.size))\n  }\n\n  replace(tr, content = Slice.empty) {\n    if (content == Slice.empty) {\n      tr.delete(0, tr.doc.content.size)\n      let sel = Selection.atStart(tr.doc)\n      if (!sel.eq(tr.selection)) tr.setSelection(sel)\n    } else {\n      super.replace(tr, content)\n    }\n  }\n\n  toJSON() { return {type: \"all\"} }\n\n  static fromJSON(doc) { return new AllSelection(doc) }\n\n  map(doc) { return new AllSelection(doc) }\n\n  eq(other) { return other instanceof AllSelection }\n\n  getBookmark() { return AllBookmark }\n}\n\nSelection.jsonID(\"all\", AllSelection)\n\nconst AllBookmark = {\n  map() { return this },\n  resolve(doc) { return new AllSelection(doc) }\n}\n\n// FIXME we'll need some awareness of text direction when scanning for selections\n\n// Try to find a selection inside the given node. `pos` points at the\n// position where the search starts. When `text` is true, only return\n// text selections.\nfunction findSelectionIn(doc, node, pos, index, dir, text) {\n  if (node.inlineContent) return TextSelection.create(doc, pos)\n  for (let i = index - (dir > 0 ? 0 : 1); dir > 0 ? i < node.childCount : i >= 0; i += dir) {\n    let child = node.child(i)\n    if (!child.isAtom) {\n      let inner = findSelectionIn(doc, child, pos + dir, dir < 0 ? child.childCount : 0, dir, text)\n      if (inner) return inner\n    } else if (!text && NodeSelection.isSelectable(child)) {\n      return NodeSelection.create(doc, pos - (dir < 0 ? child.nodeSize : 0))\n    }\n    pos += child.nodeSize * dir\n  }\n}\n\nfunction selectionToInsertionEnd(tr, startLen, bias) {\n  let last = tr.steps.length - 1\n  if (last < startLen) return\n  let step = tr.steps[last]\n  if (!(step instanceof ReplaceStep || step instanceof ReplaceAroundStep)) return\n  let map = tr.mapping.maps[last], end\n  map.forEach((_from, _to, _newFrom, newTo) => { if (end == null) end = newTo })\n  tr.setSelection(Selection.near(tr.doc.resolve(end), bias))\n}\n","import {Transform} from \"prosemirror-transform\"\nimport {Mark} from \"prosemirror-model\"\nimport {Selection} from \"./selection\"\n\nconst UPDATED_SEL = 1, UPDATED_MARKS = 2, UPDATED_SCROLL = 4\n\n// ::- An editor state transaction, which can be applied to a state to\n// create an updated state. Use\n// [`EditorState.tr`](#state.EditorState.tr) to create an instance.\n//\n// Transactions track changes to the document (they are a subclass of\n// [`Transform`](#transform.Transform)), but also other state changes,\n// like selection updates and adjustments of the set of [stored\n// marks](#state.EditorState.storedMarks). In addition, you can store\n// metadata properties in a transaction, which are extra pieces of\n// information that client code or plugins can use to describe what a\n// transacion represents, so that they can update their [own\n// state](#state.StateField) accordingly.\n//\n// The [editor view](#view.EditorView) uses a few metadata properties:\n// it will attach a property `\"pointer\"` with the value `true` to\n// selection transactions directly caused by mouse or touch input, and\n// a `\"uiEvent\"` property of that may be `\"paste\"`, `\"cut\"`, or `\"drop\"`.\nexport class Transaction extends Transform {\n  constructor(state) {\n    super(state.doc)\n    // :: number\n    // The timestamp associated with this transaction, in the same\n    // format as `Date.now()`.\n    this.time = Date.now()\n    this.curSelection = state.selection\n    // The step count for which the current selection is valid.\n    this.curSelectionFor = 0\n    // :: ?[Mark]\n    // The stored marks set by this transaction, if any.\n    this.storedMarks = state.storedMarks\n    // Bitfield to track which aspects of the state were updated by\n    // this transaction.\n    this.updated = 0\n    // Object used to store metadata properties for the transaction.\n    this.meta = Object.create(null)\n  }\n\n  // :: Selection\n  // The transaction's current selection. This defaults to the editor\n  // selection [mapped](#state.Selection.map) through the steps in the\n  // transaction, but can be overwritten with\n  // [`setSelection`](#state.Transaction.setSelection).\n  get selection() {\n    if (this.curSelectionFor < this.steps.length) {\n      this.curSelection = this.curSelection.map(this.doc, this.mapping.slice(this.curSelectionFor))\n      this.curSelectionFor = this.steps.length\n    }\n    return this.curSelection\n  }\n\n  // :: (Selection) → Transaction\n  // Update the transaction's current selection. Will determine the\n  // selection that the editor gets when the transaction is applied.\n  setSelection(selection) {\n    if (selection.$from.doc != this.doc)\n      throw new RangeError(\"Selection passed to setSelection must point at the current document\")\n    this.curSelection = selection\n    this.curSelectionFor = this.steps.length\n    this.updated = (this.updated | UPDATED_SEL) & ~UPDATED_MARKS\n    this.storedMarks = null\n    return this\n  }\n\n  // :: bool\n  // Whether the selection was explicitly updated by this transaction.\n  get selectionSet() {\n    return (this.updated & UPDATED_SEL) > 0\n  }\n\n  // :: (?[Mark]) → Transaction\n  // Set the current stored marks.\n  setStoredMarks(marks) {\n    this.storedMarks = marks\n    this.updated |= UPDATED_MARKS\n    return this\n  }\n\n  // :: ([Mark]) → Transaction\n  // Make sure the current stored marks or, if that is null, the marks\n  // at the selection, match the given set of marks. Does nothing if\n  // this is already the case.\n  ensureMarks(marks) {\n    if (!Mark.sameSet(this.storedMarks || this.selection.$from.marks(), marks))\n      this.setStoredMarks(marks)\n    return this\n  }\n\n  // :: (Mark) → Transaction\n  // Add a mark to the set of stored marks.\n  addStoredMark(mark) {\n    return this.ensureMarks(mark.addToSet(this.storedMarks || this.selection.$head.marks()))\n  }\n\n  // :: (union<Mark, MarkType>) → Transaction\n  // Remove a mark or mark type from the set of stored marks.\n  removeStoredMark(mark) {\n    return this.ensureMarks(mark.removeFromSet(this.storedMarks || this.selection.$head.marks()))\n  }\n\n  // :: bool\n  // Whether the stored marks were explicitly set for this transaction.\n  get storedMarksSet() {\n    return (this.updated & UPDATED_MARKS) > 0\n  }\n\n  addStep(step, doc) {\n    super.addStep(step, doc)\n    this.updated = this.updated & ~UPDATED_MARKS\n    this.storedMarks = null\n  }\n\n  // :: (number) → Transaction\n  // Update the timestamp for the transaction.\n  setTime(time) {\n    this.time = time\n    return this\n  }\n\n  // :: (Slice) → Transaction\n  // Replace the current selection with the given slice.\n  replaceSelection(slice) {\n    this.selection.replace(this, slice)\n    return this\n  }\n\n  // :: (Node, ?bool) → Transaction\n  // Replace the selection with the given node. When `inheritMarks` is\n  // true and the content is inline, it inherits the marks from the\n  // place where it is inserted.\n  replaceSelectionWith(node, inheritMarks) {\n    let selection = this.selection\n    if (inheritMarks !== false)\n      node = node.mark(this.storedMarks || (selection.empty ? selection.$from.marks() : (selection.$from.marksAcross(selection.$to) || Mark.none)))\n    selection.replaceWith(this, node)\n    return this\n  }\n\n  // :: () → Transaction\n  // Delete the selection.\n  deleteSelection() {\n    this.selection.replace(this)\n    return this\n  }\n\n  // :: (string, from: ?number, to: ?number) → Transaction\n  // Replace the given range, or the selection if no range is given,\n  // with a text node containing the given string.\n  insertText(text, from, to = from) {\n    let schema = this.doc.type.schema\n    if (from == null) {\n      if (!text) return this.deleteSelection()\n      return this.replaceSelectionWith(schema.text(text), true)\n    } else {\n      if (!text) return this.deleteRange(from, to)\n      let marks = this.storedMarks\n      if (!marks) {\n        let $from = this.doc.resolve(from)\n        marks = to == from ? $from.marks() : $from.marksAcross(this.doc.resolve(to))\n      }\n      this.replaceRangeWith(from, to, schema.text(text, marks))\n      if (!this.selection.empty) this.setSelection(Selection.near(this.selection.$to))\n      return this\n    }\n  }\n\n  // :: (union<string, Plugin, PluginKey>, any) → Transaction\n  // Store a metadata property in this transaction, keyed either by\n  // name or by plugin.\n  setMeta(key, value) {\n    this.meta[typeof key == \"string\" ? key : key.key] = value\n    return this\n  }\n\n  // :: (union<string, Plugin, PluginKey>) → any\n  // Retrieve a metadata property for a given name or plugin.\n  getMeta(key) {\n    return this.meta[typeof key == \"string\" ? key : key.key]\n  }\n\n  // :: bool\n  // Returns true if this transaction doesn't contain any metadata,\n  // and can thus safely be extended.\n  get isGeneric() {\n    for (let _ in this.meta) return false\n    return true\n  }\n\n  // :: () → Transaction\n  // Indicate that the editor should scroll the selection into view\n  // when updated to the state produced by this transaction.\n  scrollIntoView() {\n    this.updated |= UPDATED_SCROLL\n    return this\n  }\n\n  get scrolledIntoView() {\n    return (this.updated & UPDATED_SCROLL) > 0\n  }\n}\n","import {Node} from \"prosemirror-model\"\n\nimport {Selection} from \"./selection\"\nimport {Transaction} from \"./transaction\"\n\nfunction bind(f, self) {\n  return !self || !f ? f : f.bind(self)\n}\n\nclass FieldDesc {\n  constructor(name, desc, self) {\n    this.name = name\n    this.init = bind(desc.init, self)\n    this.apply = bind(desc.apply, self)\n  }\n}\n\nconst baseFields = [\n  new FieldDesc(\"doc\", {\n    init(config) { return config.doc || config.schema.topNodeType.createAndFill() },\n    apply(tr) { return tr.doc }\n  }),\n\n  new FieldDesc(\"selection\", {\n    init(config, instance) { return config.selection || Selection.atStart(instance.doc) },\n    apply(tr) { return tr.selection }\n  }),\n\n  new FieldDesc(\"storedMarks\", {\n    init(config) { return config.storedMarks || null },\n    apply(tr, _marks, _old, state) { return state.selection.$cursor ? tr.storedMarks : null }\n  }),\n\n  new FieldDesc(\"scrollToSelection\", {\n    init() { return 0 },\n    apply(tr, prev) { return tr.scrolledIntoView ? prev + 1 : prev }\n  })\n]\n\n// Object wrapping the part of a state object that stays the same\n// across transactions. Stored in the state's `config` property.\nclass Configuration {\n  constructor(schema, plugins) {\n    this.schema = schema\n    this.fields = baseFields.concat()\n    this.plugins = []\n    this.pluginsByKey = Object.create(null)\n    if (plugins) plugins.forEach(plugin => {\n      if (this.pluginsByKey[plugin.key])\n        throw new RangeError(\"Adding different instances of a keyed plugin (\" + plugin.key + \")\")\n      this.plugins.push(plugin)\n      this.pluginsByKey[plugin.key] = plugin\n      if (plugin.spec.state)\n        this.fields.push(new FieldDesc(plugin.key, plugin.spec.state, plugin))\n    })\n  }\n}\n\n// ::- The state of a ProseMirror editor is represented by an object\n// of this type. A state is a persistent data structure—it isn't\n// updated, but rather a new state value is computed from an old one\n// using the [`apply`](#state.EditorState.apply) method.\n//\n// A state holds a number of built-in fields, and plugins can\n// [define](#state.PluginSpec.state) additional fields.\nexport class EditorState {\n  constructor(config) {\n    this.config = config\n  }\n\n  // doc:: Node\n  // The current document.\n\n  // selection:: Selection\n  // The selection.\n\n  // storedMarks:: ?[Mark]\n  // A set of marks to apply to the next input. Will be null when\n  // no explicit marks have been set.\n\n  // :: Schema\n  // The schema of the state's document.\n  get schema() {\n    return this.config.schema\n  }\n\n  // :: [Plugin]\n  // The plugins that are active in this state.\n  get plugins() {\n    return this.config.plugins\n  }\n\n  // :: (Transaction) → EditorState\n  // Apply the given transaction to produce a new state.\n  apply(tr) {\n    return this.applyTransaction(tr).state\n  }\n\n  // : (Transaction) → bool\n  filterTransaction(tr, ignore = -1) {\n    for (let i = 0; i < this.config.plugins.length; i++) if (i != ignore) {\n      let plugin = this.config.plugins[i]\n      if (plugin.spec.filterTransaction && !plugin.spec.filterTransaction.call(plugin, tr, this))\n        return false\n    }\n    return true\n  }\n\n  // :: (Transaction) → {state: EditorState, transactions: [Transaction]}\n  // Verbose variant of [`apply`](#state.EditorState.apply) that\n  // returns the precise transactions that were applied (which might\n  // be influenced by the [transaction\n  // hooks](#state.PluginSpec.filterTransaction) of\n  // plugins) along with the new state.\n  applyTransaction(rootTr) {\n    if (!this.filterTransaction(rootTr)) return {state: this, transactions: []}\n\n    let trs = [rootTr], newState = this.applyInner(rootTr), seen = null\n    // This loop repeatedly gives plugins a chance to respond to\n    // transactions as new transactions are added, making sure to only\n    // pass the transactions the plugin did not see before.\n    outer: for (;;) {\n      let haveNew = false\n      for (let i = 0; i < this.config.plugins.length; i++) {\n        let plugin = this.config.plugins[i]\n        if (plugin.spec.appendTransaction) {\n          let n = seen ? seen[i].n : 0, oldState = seen ? seen[i].state : this\n          let tr = n < trs.length &&\n              plugin.spec.appendTransaction.call(plugin, n ? trs.slice(n) : trs, oldState, newState)\n          if (tr && newState.filterTransaction(tr, i)) {\n            tr.setMeta(\"appendedTransaction\", rootTr)\n            if (!seen) {\n              seen = []\n              for (let j = 0; j < this.config.plugins.length; j++)\n                seen.push(j < i ? {state: newState, n: trs.length} : {state: this, n: 0})\n            }\n            trs.push(tr)\n            newState = newState.applyInner(tr)\n            haveNew = true\n          }\n          if (seen) seen[i] = {state: newState, n: trs.length}\n        }\n      }\n      if (!haveNew) return {state: newState, transactions: trs}\n    }\n  }\n\n  // : (Transaction) → EditorState\n  applyInner(tr) {\n    if (!tr.before.eq(this.doc)) throw new RangeError(\"Applying a mismatched transaction\")\n    let newInstance = new EditorState(this.config), fields = this.config.fields\n    for (let i = 0; i < fields.length; i++) {\n      let field = fields[i]\n      newInstance[field.name] = field.apply(tr, this[field.name], this, newInstance)\n    }\n    for (let i = 0; i < applyListeners.length; i++) applyListeners[i](this, tr, newInstance)\n    return newInstance\n  }\n\n  // :: Transaction\n  // Start a [transaction](#state.Transaction) from this state.\n  get tr() { return new Transaction(this) }\n\n  // :: (Object) → EditorState\n  // Create a new state.\n  //\n  //   config::- Configuration options. Must contain `schema` or `doc` (or both).\n  //\n  //      schema:: ?Schema\n  //      The schema to use (only relevant if no `doc` is specified).\n  //\n  //      doc:: ?Node\n  //      The starting document.\n  //\n  //      selection:: ?Selection\n  //      A valid selection in the document.\n  //\n  //      storedMarks:: ?[Mark]\n  //      The initial set of [stored marks](#state.EditorState.storedMarks).\n  //\n  //      plugins:: ?[Plugin]\n  //      The plugins that should be active in this state.\n  static create(config) {\n    let $config = new Configuration(config.doc ? config.doc.type.schema : config.schema, config.plugins)\n    let instance = new EditorState($config)\n    for (let i = 0; i < $config.fields.length; i++)\n      instance[$config.fields[i].name] = $config.fields[i].init(config, instance)\n    return instance\n  }\n\n  // :: (Object) → EditorState\n  // Create a new state based on this one, but with an adjusted set of\n  // active plugins. State fields that exist in both sets of plugins\n  // are kept unchanged. Those that no longer exist are dropped, and\n  // those that are new are initialized using their\n  // [`init`](#state.StateField.init) method, passing in the new\n  // configuration object..\n  //\n  //   config::- configuration options\n  //\n  //     plugins:: [Plugin]\n  //     New set of active plugins.\n  reconfigure(config) {\n    let $config = new Configuration(this.schema, config.plugins)\n    let fields = $config.fields, instance = new EditorState($config)\n    for (let i = 0; i < fields.length; i++) {\n      let name = fields[i].name\n      instance[name] = this.hasOwnProperty(name) ? this[name] : fields[i].init(config, instance)\n    }\n    return instance\n  }\n\n  // :: (?union<Object<Plugin>, string, number>) → Object\n  // Serialize this state to JSON. If you want to serialize the state\n  // of plugins, pass an object mapping property names to use in the\n  // resulting JSON object to plugin objects. The argument may also be\n  // a string or number, in which case it is ignored, to support the\n  // way `JSON.stringify` calls `toString` methods.\n  toJSON(pluginFields) {\n    let result = {doc: this.doc.toJSON(), selection: this.selection.toJSON()}\n    if (this.storedMarks) result.storedMarks = this.storedMarks.map(m => m.toJSON())\n    if (pluginFields && typeof pluginFields == 'object') for (let prop in pluginFields) {\n      if (prop == \"doc\" || prop == \"selection\")\n        throw new RangeError(\"The JSON fields `doc` and `selection` are reserved\")\n      let plugin = pluginFields[prop], state = plugin.spec.state\n      if (state && state.toJSON) result[prop] = state.toJSON.call(plugin, this[plugin.key])\n    }\n    return result\n  }\n\n  // :: (Object, Object, ?Object<Plugin>) → EditorState\n  // Deserialize a JSON representation of a state. `config` should\n  // have at least a `schema` field, and should contain array of\n  // plugins to initialize the state with. `pluginFields` can be used\n  // to deserialize the state of plugins, by associating plugin\n  // instances with the property names they use in the JSON object.\n  //\n  //   config::- configuration options\n  //\n  //     schema:: Schema\n  //     The schema to use.\n  //\n  //     plugins:: ?[Plugin]\n  //     The set of active plugins.\n  static fromJSON(config, json, pluginFields) {\n    if (!json) throw new RangeError(\"Invalid input for EditorState.fromJSON\")\n    if (!config.schema) throw new RangeError(\"Required config field 'schema' missing\")\n    let $config = new Configuration(config.schema, config.plugins)\n    let instance = new EditorState($config)\n    $config.fields.forEach(field => {\n      if (field.name == \"doc\") {\n        instance.doc = Node.fromJSON(config.schema, json.doc)\n      } else if (field.name == \"selection\") {\n        instance.selection = Selection.fromJSON(instance.doc, json.selection)\n      } else if (field.name == \"storedMarks\") {\n        if (json.storedMarks) instance.storedMarks = json.storedMarks.map(config.schema.markFromJSON)\n      } else {\n        if (pluginFields) for (let prop in pluginFields) {\n          let plugin = pluginFields[prop], state = plugin.spec.state\n          if (plugin.key == field.name && state && state.fromJSON &&\n              Object.prototype.hasOwnProperty.call(json, prop)) {\n            // This field belongs to a plugin mapped to a JSON field, read it from there.\n            instance[field.name] = state.fromJSON.call(plugin, config, json[prop], instance)\n            return\n          }\n        }\n        instance[field.name] = field.init(config, instance)\n      }\n    })\n    return instance\n  }\n\n  // Kludge to allow the view to track mappings between different\n  // instances of a state.\n  //\n  // FIXME this is no longer needed as of prosemirror-view 1.9.0,\n  // though due to backwards-compat we should probably keep it around\n  // for a while (if only as a no-op)\n  static addApplyListener(f) {\n    applyListeners.push(f)\n  }\n  static removeApplyListener(f) {\n    let found = applyListeners.indexOf(f)\n    if (found > -1) applyListeners.splice(found, 1)\n  }\n}\n\nconst applyListeners = []\n","// PluginSpec:: interface\n//\n// This is the type passed to the [`Plugin`](#state.Plugin)\n// constructor. It provides a definition for a plugin.\n//\n//   props:: ?EditorProps\n//   The [view props](#view.EditorProps) added by this plugin. Props\n//   that are functions will be bound to have the plugin instance as\n//   their `this` binding.\n//\n//   state:: ?StateField<any>\n//   Allows a plugin to define a [state field](#state.StateField), an\n//   extra slot in the state object in which it can keep its own data.\n//\n//   key:: ?PluginKey\n//   Can be used to make this a keyed plugin. You can have only one\n//   plugin with a given key in a given state, but it is possible to\n//   access the plugin's configuration and state through the key,\n//   without having access to the plugin instance object.\n//\n//   view:: ?(EditorView) → Object\n//   When the plugin needs to interact with the editor view, or\n//   set something up in the DOM, use this field. The function\n//   will be called when the plugin's state is associated with an\n//   editor view.\n//\n//     return::-\n//     Should return an object with the following optional\n//     properties:\n//\n//       update:: ?(view: EditorView, prevState: EditorState)\n//       Called whenever the view's state is updated.\n//\n//       destroy:: ?()\n//       Called when the view is destroyed or receives a state\n//       with different plugins.\n//\n//   filterTransaction:: ?(Transaction, EditorState) → bool\n//   When present, this will be called before a transaction is\n//   applied by the state, allowing the plugin to cancel it (by\n//   returning false).\n//\n//   appendTransaction:: ?(transactions: [Transaction], oldState: EditorState, newState: EditorState) → ?Transaction\n//   Allows the plugin to append another transaction to be applied\n//   after the given array of transactions. When another plugin\n//   appends a transaction after this was called, it is called again\n//   with the new state and new transactions—but only the new\n//   transactions, i.e. it won't be passed transactions that it\n//   already saw.\n\nfunction bindProps(obj, self, target) {\n  for (let prop in obj) {\n    let val = obj[prop]\n    if (val instanceof Function) val = val.bind(self)\n    else if (prop == \"handleDOMEvents\") val = bindProps(val, self, {})\n    target[prop] = val\n  }\n  return target\n}\n\n// ::- Plugins bundle functionality that can be added to an editor.\n// They are part of the [editor state](#state.EditorState) and\n// may influence that state and the view that contains it.\nexport class Plugin {\n  // :: (PluginSpec)\n  // Create a plugin.\n  constructor(spec) {\n    // :: EditorProps\n    // The [props](#view.EditorProps) exported by this plugin.\n    this.props = {}\n    if (spec.props) bindProps(spec.props, this, this.props)\n    // :: Object\n    // The plugin's [spec object](#state.PluginSpec).\n    this.spec = spec\n    this.key = spec.key ? spec.key.key : createKey(\"plugin\")\n  }\n\n  // :: (EditorState) → any\n  // Extract the plugin's state field from an editor state.\n  getState(state) { return state[this.key] }\n}\n\n// StateField:: interface<T>\n// A plugin spec may provide a state field (under its\n// [`state`](#state.PluginSpec.state) property) of this type, which\n// describes the state it wants to keep. Functions provided here are\n// always called with the plugin instance as their `this` binding.\n//\n//   init:: (config: Object, instance: EditorState) → T\n//   Initialize the value of the field. `config` will be the object\n//   passed to [`EditorState.create`](#state.EditorState^create). Note\n//   that `instance` is a half-initialized state instance, and will\n//   not have values for plugin fields initialized after this one.\n//\n//   apply:: (tr: Transaction, value: T, oldState: EditorState, newState: EditorState) → T\n//   Apply the given transaction to this state field, producing a new\n//   field value. Note that the `newState` argument is again a partially\n//   constructed state does not yet contain the state from plugins\n//   coming after this one.\n//\n//   toJSON:: ?(value: T) → *\n//   Convert this field to JSON. Optional, can be left off to disable\n//   JSON serialization for the field.\n//\n//   fromJSON:: ?(config: Object, value: *, state: EditorState) → T\n//   Deserialize the JSON representation of this field. Note that the\n//   `state` argument is again a half-initialized state.\n\nconst keys = Object.create(null)\n\nfunction createKey(name) {\n  if (name in keys) return name + \"$\" + ++keys[name]\n  keys[name] = 0\n  return name + \"$\"\n}\n\n// ::- A key is used to [tag](#state.PluginSpec.key)\n// plugins in a way that makes it possible to find them, given an\n// editor state. Assigning a key does mean only one plugin of that\n// type can be active in a state.\nexport class PluginKey {\n  // :: (?string)\n  // Create a plugin key.\n  constructor(name = \"key\") { this.key = createKey(name) }\n\n  // :: (EditorState) → ?Plugin\n  // Get the active plugin with this key, if any, from an editor\n  // state.\n  get(state) { return state.config.pluginsByKey[this.key] }\n\n  // :: (EditorState) → ?any\n  // Get the plugin's state from an editor state.\n  getState(state) { return state[this.key] }\n}\n","import {Plugin} from \"prosemirror-state\"\nimport {dropPoint} from \"prosemirror-transform\"\n\n// :: (options: ?Object) → Plugin\n// Create a plugin that, when added to a ProseMirror instance,\n// causes a decoration to show up at the drop position when something\n// is dragged over the editor.\n//\n//   options::- These options are supported:\n//\n//     color:: ?string\n//     The color of the cursor. Defaults to `black`.\n//\n//     width:: ?number\n//     The precise width of the cursor in pixels. Defaults to 1.\n//\n//     class:: ?string\n//     A CSS class name to add to the cursor element.\nexport function dropCursor(options = {}) {\n  return new Plugin({\n    view(editorView) { return new DropCursorView(editorView, options) }\n  })\n}\n\nclass DropCursorView {\n  constructor(editorView, options) {\n    this.editorView = editorView\n    this.width = options.width || 1\n    this.color = options.color || \"black\"\n    this.class = options.class\n    this.cursorPos = null\n    this.element = null\n    this.timeout = null\n\n    this.handlers = [\"dragover\", \"dragend\", \"drop\", \"dragleave\"].map(name => {\n      let handler = e => this[name](e)\n      editorView.dom.addEventListener(name, handler)\n      return {name, handler}\n    })\n  }\n\n  destroy() {\n    this.handlers.forEach(({name, handler}) => this.editorView.dom.removeEventListener(name, handler))\n  }\n\n  update(editorView, prevState) {\n    if (this.cursorPos != null && prevState.doc != editorView.state.doc) this.updateOverlay()\n  }\n\n  setCursor(pos) {\n    if (pos == this.cursorPos) return\n    this.cursorPos = pos\n    if (pos == null) {\n      this.element.parentNode.removeChild(this.element)\n      this.element = null\n    } else {\n      this.updateOverlay()\n    }\n  }\n\n  updateOverlay() {\n    let $pos = this.editorView.state.doc.resolve(this.cursorPos), rect\n    if (!$pos.parent.inlineContent) {\n      let before = $pos.nodeBefore, after = $pos.nodeAfter\n      if (before || after) {\n        let nodeRect = this.editorView.nodeDOM(this.cursorPos - (before ?  before.nodeSize : 0)).getBoundingClientRect()\n        let top = before ? nodeRect.bottom : nodeRect.top\n        if (before && after)\n          top = (top + this.editorView.nodeDOM(this.cursorPos).getBoundingClientRect().top) / 2\n        rect = {left: nodeRect.left, right: nodeRect.right, top: top - this.width / 2, bottom: top + this.width / 2}\n      }\n    }\n    if (!rect) {\n      let coords = this.editorView.coordsAtPos(this.cursorPos)\n      rect = {left: coords.left - this.width / 2, right: coords.left + this.width / 2, top: coords.top, bottom: coords.bottom}\n    }\n\n    let parent = this.editorView.dom.offsetParent\n    if (!this.element) {\n      this.element = parent.appendChild(document.createElement(\"div\"))\n      if (this.class) this.element.className = this.class\n      this.element.style.cssText = \"position: absolute; z-index: 50; pointer-events: none; background-color: \" + this.color\n    }\n    let parentLeft, parentTop\n    if (!parent || parent == document.body && getComputedStyle(parent).position == \"static\") {\n      parentLeft = -pageXOffset\n      parentTop = -pageYOffset\n    } else {\n      let rect = parent.getBoundingClientRect()\n      parentLeft = rect.left - parent.scrollLeft\n      parentTop = rect.top - parent.scrollTop\n    }\n    this.element.style.left = (rect.left - parentLeft) + \"px\"\n    this.element.style.top = (rect.top - parentTop) + \"px\"\n    this.element.style.width = (rect.right - rect.left) + \"px\"\n    this.element.style.height = (rect.bottom - rect.top) + \"px\"\n  }\n\n  scheduleRemoval(timeout) {\n    clearTimeout(this.timeout)\n    this.timeout = setTimeout(() => this.setCursor(null), timeout)\n  }\n\n  dragover(event) {\n    if (!this.editorView.editable) return\n    let pos = this.editorView.posAtCoords({left: event.clientX, top: event.clientY})\n    if (pos) {\n      let target = pos.pos\n      if (this.editorView.dragging && this.editorView.dragging.slice) {\n        target = dropPoint(this.editorView.state.doc, target, this.editorView.dragging.slice)\n        if (target == null) return this.setCursor(null)\n      }\n      this.setCursor(target)\n      this.scheduleRemoval(5000)\n    }\n  }\n\n  dragend() {\n    this.scheduleRemoval(20)\n  }\n\n  drop() {\n    this.scheduleRemoval(20)\n  }\n\n  dragleave(event) {\n    if (event.target == this.editorView.dom || !this.editorView.dom.contains(event.relatedTarget))\n      this.setCursor(null)\n  }\n}\n","import { Extension } from '@tiptap/core'\nimport { dropCursor } from 'prosemirror-dropcursor'\n\nexport interface DropcursorOptions {\n  color: string | null,\n  width: number | null,\n  class: string | null,\n}\n\nexport const Dropcursor = Extension.create<DropcursorOptions>({\n  name: 'dropCursor',\n\n  defaultOptions: {\n    color: 'black',\n    width: 1,\n    class: null,\n  },\n\n  addProseMirrorPlugins() {\n    return [\n      dropCursor(this.options),\n    ]\n  },\n})\n"],"names":["findDiffStart","a","b","pos","let","i","childCount","childA","child","childB","sameMarkup","isText","text","j","content","size","inner","nodeSize","findDiffEnd","posA","posB","iA","iB","same","minSize","Math","min","length","Fragment","this","nodesBetween","from","to","f","nodeStart","parent","end","start","max","descendants","textBetween","blockSeparator","leafText","separated","node","slice","isLeaf","isBlock","append","other","last","lastChild","first","firstChild","withText","push","cut","result","cutByIndex","empty","replaceChild","index","current","copy","addToStart","concat","addToEnd","eq","found","RangeError","maybeChild","forEach","p","otherPos","findIndex","round","retIndex","curPos","toString","toStringInner","join","toJSON","map","n","fromJSON","schema","value","Array","isArray","nodeFromJSON","fromArray","array","joined","nodes","attrs","const","offset","compareDeep","Mark","type","ReplaceError","message","err","Error","call","__proto__","prototype","addToSet","set","placed","excludes","rank","removeFromSet","isInSet","obj","name","_","json","marks","create","sameSet","setFrom","none","sort","Object","constructor","Slice","openStart","openEnd","removeRange","offsetTo","indexTo","insertInto","dist","insert","canReplace","replace","$from","$to","depth","replaceOuter","$along","extra","resolveNoCache","prepareSliceForReplace","close","replaceThreeWay","parentOffset","replaceTwoWay","checkJoin","main","sub","compatibleContent","joinable","$before","$after","addNode","target","addRange","$start","$end","startIndex","endIndex","textOffset","nodeAfter","nodeBefore","validContent","insertAt","fragment","removeBetween","maxOpen","openIsolating","spec","isolating","ResolvedPos","path","resolveDepth","val","doc","indexAfter","before","after","dOff","posAtIndex","tmp","inclusive","marksAcross","isInline","next","sharedDepth","blockRange","pred","d","inlineContent","NodeRange","sameParent","str","resolve","rem","resolveCached","resolveCache","cached","resolveCachePos","resolveCacheSize","emptyAttrs","Node","startPos","textContent","hasMarkup","defaultAttrs","mark","includeParents","nodeAt","childAfter","childBefore","rangeHasMark","isTextblock","isAtom","toDebugString","wrapMarks","contentMatchAt","match","contentMatch","matchFragment","replacement","one","two","validEnd","allowsMarks","canReplaceWith","matchType","canAppend","check","markFromJSON","nodeType","ContentMatch","wrapCache","parse","string","nodeTypes","stream","TokenStream","expr","parseExpr","nfa","labeled","explore","nullFrom","states","out","term","known","indexOf","state","cmp","dfa","connect","compile","edge","edges","exprs","reduce","loop","cur","work","dead","hasRequiredAttrs","checkForDeadEnds","frag","prototypeAccessors","defaultType","compatible","fillBefore","toEnd","seen","search","types","finished","tp","createAndFill","findWrapping","computed","computeWrapping","active","via","shift","reverse","edgeCount","scan","m","inline","tokens","split","pop","parseExprSeq","eat","parseExprSubscript","test","typeName","groups","resolveName","parseExprAtom","parseExprRange","parseNum","Number","defaults","attrName","attr","hasDefault","default","computeAttrs","built","given","undefined","initAttrs","Attribute","tok","SyntaxError","NodeType","group","markSet","atom","isRequired","createChecked","allowsMarkType","markType","allowedMarks","topType","topNode","options","hasOwnProperty","prototypeAccessors$1","MarkType","excluded","instance","DOMParser","rules","tags","styles","rule","tag","style","normalizeLists","some","r","dom","context","ParseContext","addAll","finish","parseSlice","matchTag","matches","namespace","namespaceURI","matchesContext","getAttrs","matchStyle","prop","charCodeAt","schemaRules","priority","splice","parseDOM","fromSchema","domParser","blockTags","address","article","aside","blockquote","canvas","dd","div","dl","fieldset","figcaption","figure","footer","form","h1","h2","h3","h4","h5","h6","header","hgroup","hr","li","noscript","ol","output","pre","section","table","tfoot","ul","ignoreTags","head","object","script","title","listTags","wsOptionsFor","preserveWhitespace","NodeContext","pendingMarks","solid","activeMarks","stashMarks","fill","wrap","exec","popFromStashMark","applyPending","nextType","pending","markMayApply","parser","open","isOpen","topContext","topOptions","topMatch","topNodeType","find","findPositions","needsBlock","selector","msMatchesSelector","webkitMatchesSelector","mozMatchesSelector","top","addDOM","addTextNode","getAttribute","readStyles","re","trim","parseStyles","addPendingMark","addElement","removePendingMark","nodeValue","domNodeBefore","previousSibling","nodeName","insertNode","findInText","findInside","matchAfter","ruleID","toLowerCase","prevItem","nextSibling","appendChild","normalizeList","ruleFromNode","ignore","skip","closeParent","sync","oldNeedsBlock","leafFallback","addElementByRule","consuming","ownerDocument","createTextNode","continueAfter","enter","startIn","getContent","contentDOM","contentElement","querySelector","findAround","childNodes","findAtPoint","findPlace","route","cx","enterInner","block","textblockFromContext","closeExtra","preserveWS","ok","topOpen","currentPos","contains","compareDocumentPosition","textNode","parts","option","useRoot","minDepth","part","$context","deflt","findSameMarkInSet","upto","level","lastIndexOf","stashMark","DOMSerializer","gatherToDOM","toDOM","document","window","serializeFragment","createDocumentFragment","keep","rendered","spanning","add","markDOM","serializeMark","serializeNode","renderSpec","onContent","serializeNodeAndMarks","structure","xmlNS","tagName","space","createElementNS","createElement","setAttributeNS","setAttribute","innerContent","domSerializer","nodesFromSchema","marksFromSchema","factor16","pow","recoverIndex","MapResult","deleted","recover","StepMap","ranges","inverted","diff","recoverOffset","mapResult","assoc","_map","simple","oldIndex","newIndex","oldSize","newSize","touches","oldStart","newStart","invert","JSON","stringify","Mapping","maps","mirror","TransformError","appendMap","mirrors","setMirror","appendMapping","mapping","startSize","mirr","getMirror","appendMappingInverted","totalSize","inverse","corr","Transform","steps","docs","mustOverride","step","maybeStep","failed","apply","addStep","docChanged","getMap","stepsByID","Step","_doc","_mapping","merge","_other","stepType","jsonID","id","stepClass","StepResult","fail","fromReplace","e","ReplaceStep","super","contentBetween","ReplaceAroundStep","gapFrom","gapTo","gap","inserted","mapFragment","mapped","lift","range","gapStart","gapEnd","splitting","wrappers","setBlockType","mapFrom","$pos","canChangeType","clearIncompatible","startM","endM","setNodeMarkup","newNode","replaceWith","typesAfter","typeAfter","AddMarkStep","oldSlice","RemoveMarkStep","fitsTrivially","addMark","removed","added","removing","adding","newSet","s","removeMark","matched","toRemove","parentType","delSteps","allowed","Fitter","fit","replaceStep","delete","unplaced","frontier","dropFromFragment","count","addToFragment","contentAt","closeNodeStart","contentAfterFits","invalidMarks","closeFragment","oldOpen","newOpen","coveredDepths","findFittable","placeNodes","openMore","dropNode","moveInline","mustMoveInline","placedSize","pass","sliceDepth","frontierDepth","inject","openAtEnd","closeFrontierNode","openFrontierNode","taken","openEndCount","findCloseLevel","dropInner","move","replaceRange","deleteRange","targetDepths","preferredTarget","unshift","defining","preferredTargetIndex","leftNodes","preferredDepth","openDepth","targetDepth","expand","startSteps","replaceRangeWith","point","insertPoint","covered","classesById","Selection","$anchor","$head","SelectionRange","anchor","tr","lastNode","lastParent","selectionToInsertionEnd","findFrom","dir","textOnly","TextSelection","findSelectionIn","near","bias","AllSelection","atStart","atEnd","cls","selectionClass","getBookmark","between","visible","$cursor","ensureMarks","TextBookmark","dPos","NodeSelection","NodeBookmark","isSelectable","selectable","sel","selection","setSelection","AllBookmark","startLen","_from","_to","_newFrom","newTo","Transaction","time","Date","now","curSelection","curSelectionFor","storedMarks","updated","meta","selectionSet","setStoredMarks","addStoredMark","removeStoredMark","storedMarksSet","setTime","replaceSelection","replaceSelectionWith","inheritMarks","deleteSelection","insertText","setMeta","key","getMeta","isGeneric","scrollIntoView","scrolledIntoView","bind","self","FieldDesc","desc","init","baseFields","config","_marks","_old","prev","Configuration","plugins","fields","pluginsByKey","plugin","EditorState","applyTransaction","filterTransaction","rootTr","transactions","trs","newState","applyInner","haveNew","appendTransaction","oldState","newInstance","field","applyListeners","$config","reconfigure","pluginFields","addApplyListener","removeApplyListener","bindProps","Function","Plugin","props","keys","createKey","getState","DropCursorView","editorView","width","color","class","cursorPos","element","timeout","handlers","handler","addEventListener","destroy","removeEventListener","update","prevState","updateOverlay","setCursor","parentNode","removeChild","rect","nodeRect","nodeDOM","getBoundingClientRect","bottom","left","right","coords","coordsAtPos","parentLeft","parentTop","offsetParent","className","cssText","body","getComputedStyle","position","pageXOffset","pageYOffset","scrollLeft","scrollTop","height","scheduleRemoval","clearTimeout","setTimeout","dragover","event","editable","posAtCoords","clientX","clientY","dragging","insertPos","dropPoint","dragend","drop","dragleave","relatedTarget","Dropcursor","Extension","defaultOptions","[object Object]","view"],"mappings":"kUAAO,SAASA,EAAcC,EAAGC,EAAGC,GAClC,IAAKC,IAAIC,EAAI,GAAIA,IAAK,CACpB,GAAIA,GAAKJ,EAAEK,YAAcD,GAAKH,EAAEI,WAC9B,OAAOL,EAAEK,YAAcJ,EAAEI,WAAa,KAAOH,EAE/CC,IAAIG,EAASN,EAAEO,MAAMH,GAAII,EAASP,EAAEM,MAAMH,GAC1C,GAAIE,GAAUE,EAAd,CAEA,IAAKF,EAAOG,WAAWD,GAAS,OAAON,EAEvC,GAAII,EAAOI,QAAUJ,EAAOK,MAAQH,EAAOG,KAAM,CAC/C,IAAKR,IAAIS,EAAI,EAAGN,EAAOK,KAAKC,IAAMJ,EAAOG,KAAKC,GAAIA,IAChDV,IACF,OAAOA,EAET,GAAII,EAAOO,QAAQC,MAAQN,EAAOK,QAAQC,KAAM,CAC9CX,IAAIY,EAAQhB,EAAcO,EAAOO,QAASL,EAAOK,QAASX,EAAM,GAChE,GAAa,MAATa,EAAe,OAAOA,EAE5Bb,GAAOI,EAAOU,cAbUd,GAAOI,EAAOU,UAiBnC,SAASC,EAAYjB,EAAGC,EAAGiB,EAAMC,GACtC,IAAKhB,IAAIiB,EAAKpB,EAAEK,WAAYgB,EAAKpB,EAAEI,aAAc,CAC/C,GAAU,GAANe,GAAiB,GAANC,EACb,OAAOD,GAAMC,EAAK,KAAO,CAACrB,EAAGkB,EAAMjB,EAAGkB,GAExChB,IAAIG,EAASN,EAAEO,QAAQa,GAAKZ,EAASP,EAAEM,QAAQc,GAAKP,EAAOR,EAAOU,SAClE,GAAIV,GAAUE,EAAd,CAKA,IAAKF,EAAOG,WAAWD,GAAS,MAAO,CAACR,EAAGkB,EAAMjB,EAAGkB,GAEpD,GAAIb,EAAOI,QAAUJ,EAAOK,MAAQH,EAAOG,KAAM,CAE/C,IADAR,IAAImB,EAAO,EAAGC,EAAUC,KAAKC,IAAInB,EAAOK,KAAKe,OAAQlB,EAAOG,KAAKe,QAC1DJ,EAAOC,GAAWjB,EAAOK,KAAKL,EAAOK,KAAKe,OAASJ,EAAO,IAAMd,EAAOG,KAAKH,EAAOG,KAAKe,OAASJ,EAAO,IAC7GA,IAAQJ,IAAQC,IAElB,MAAO,CAACnB,EAAGkB,EAAMjB,EAAGkB,GAEtB,GAAIb,EAAOO,QAAQC,MAAQN,EAAOK,QAAQC,KAAM,CAC9CX,IAAIY,EAAQE,EAAYX,EAAOO,QAASL,EAAOK,QAASK,EAAO,EAAGC,EAAO,GACzE,GAAIJ,EAAO,OAAOA,EAEpBG,GAAQJ,EAAMK,GAAQL,OAjBpBI,GAAQJ,EAAMK,GAAQL,OCvBfa,EACX,SAAYd,EAASC,GAMnB,GALAc,KAAKf,QAAUA,EAIfe,KAAKd,KAAOA,GAAQ,EACR,MAARA,EAAc,IAAKX,IAAIC,EAAI,EAAGA,EAAIS,EAAQa,OAAQtB,IACpDwB,KAAKd,MAAQD,EAAQT,GAAGY,gHAO5Ba,sBAAaC,EAAMC,EAAIC,EAAGC,EAAeC,kBAAH,GACpC,IAAK/B,IAAIC,EAAI,EAAGF,EAAM,EAAGA,EAAM6B,EAAI3B,IAAK,CACtCD,IAAII,EAAQqB,KAAKf,QAAQT,GAAI+B,EAAMjC,EAAMK,EAAMS,SAC/C,GAAImB,EAAML,IAAiD,IAAzCE,EAAEzB,EAAO0B,EAAY/B,EAAKgC,EAAQ9B,IAAgBG,EAAMM,QAAQC,KAAM,CACtFX,IAAIiC,EAAQlC,EAAM,EAClBK,EAAMsB,aAAaL,KAAKa,IAAI,EAAGP,EAAOM,GACnBZ,KAAKC,IAAIlB,EAAMM,QAAQC,KAAMiB,EAAKK,GAClCJ,EAAGC,EAAYG,GAEpClC,EAAMiC,gBAOVG,qBAAYN,GACVJ,KAAKC,aAAa,EAAGD,KAAKd,KAAMkB,gBAIlCO,qBAAYT,EAAMC,EAAIS,EAAgBC,GACpCtC,IAAIQ,EAAO,GAAI+B,GAAY,EAa3B,OAZAd,KAAKC,aAAaC,EAAMC,YAAKY,EAAMzC,GAC7ByC,EAAKjC,QACPC,GAAQgC,EAAKhC,KAAKiC,MAAMpB,KAAKa,IAAIP,EAAM5B,GAAOA,EAAK6B,EAAK7B,GACxDwC,GAAaF,GACJG,EAAKE,QAAUJ,GACxB9B,GAAQ8B,EACRC,GAAaF,IACHE,GAAaC,EAAKG,UAC5BnC,GAAQ6B,EACRE,GAAY,KAEb,GACI/B,eAMToC,gBAAOC,GACL,IAAKA,EAAMlC,KAAM,OAAOc,KACxB,IAAKA,KAAKd,KAAM,OAAOkC,EACvB7C,IAAI8C,EAAOrB,KAAKsB,UAAWC,EAAQH,EAAMI,WAAYvC,EAAUe,KAAKf,QAAQ+B,QAASxC,EAAI,EAKzF,IAJI6C,EAAKvC,QAAUuC,EAAKxC,WAAW0C,KACjCtC,EAAQA,EAAQa,OAAS,GAAKuB,EAAKI,SAASJ,EAAKtC,KAAOwC,EAAMxC,MAC9DP,EAAI,GAECA,EAAI4C,EAAMnC,QAAQa,OAAQtB,IAAKS,EAAQyC,KAAKN,EAAMnC,QAAQT,IACjE,OAAO,IAAIuB,EAASd,EAASe,KAAKd,KAAOkC,EAAMlC,mBAKjDyC,aAAIzB,EAAMC,GAER,GADU,MAANA,IAAYA,EAAKH,KAAKd,MACd,GAARgB,GAAaC,GAAMH,KAAKd,KAAM,OAAOc,KACzCzB,IAAIqD,EAAS,GAAI1C,EAAO,EACxB,GAAIiB,EAAKD,EAAM,IAAK3B,IAAIC,EAAI,EAAGF,EAAM,EAAGA,EAAM6B,EAAI3B,IAAK,CACrDD,IAAII,EAAQqB,KAAKf,QAAQT,GAAI+B,EAAMjC,EAAMK,EAAMS,SAC3CmB,EAAML,KACJ5B,EAAM4B,GAAQK,EAAMJ,KAEpBxB,EADEA,EAAMG,OACAH,EAAMgD,IAAI/B,KAAKa,IAAI,EAAGP,EAAO5B,GAAMsB,KAAKC,IAAIlB,EAAMI,KAAKe,OAAQK,EAAK7B,IAEpEK,EAAMgD,IAAI/B,KAAKa,IAAI,EAAGP,EAAO5B,EAAM,GAAIsB,KAAKC,IAAIlB,EAAMM,QAAQC,KAAMiB,EAAK7B,EAAM,KAE3FsD,EAAOF,KAAK/C,GACZO,GAAQP,EAAMS,UAEhBd,EAAMiC,EAER,OAAO,IAAIR,EAAS6B,EAAQ1C,gBAG9B2C,oBAAW3B,EAAMC,GACf,OAAID,GAAQC,EAAWJ,EAAS+B,MACpB,GAAR5B,GAAaC,GAAMH,KAAKf,QAAQa,OAAeE,KAC5C,IAAID,EAASC,KAAKf,QAAQ+B,MAAMd,EAAMC,iBAM/C4B,sBAAaC,EAAOjB,GAClBxC,IAAI0D,EAAUjC,KAAKf,QAAQ+C,GAC3B,GAAIC,GAAWlB,EAAM,OAAOf,KAC5BzB,IAAI2D,EAAOlC,KAAKf,QAAQ+B,QACpB9B,EAAOc,KAAKd,KAAO6B,EAAK3B,SAAW6C,EAAQ7C,SAE/C,OADA8C,EAAKF,GAASjB,EACP,IAAIhB,EAASmC,EAAMhD,gBAM5BiD,oBAAWpB,GACT,OAAO,IAAIhB,EAAS,CAACgB,GAAMqB,OAAOpC,KAAKf,SAAUe,KAAKd,KAAO6B,EAAK3B,uBAMpEiD,kBAAStB,GACP,OAAO,IAAIhB,EAASC,KAAKf,QAAQmD,OAAOrB,GAAOf,KAAKd,KAAO6B,EAAK3B,uBAKlEkD,YAAGlB,GACD,GAAIpB,KAAKf,QAAQa,QAAUsB,EAAMnC,QAAQa,OAAQ,OAAO,EACxD,IAAKvB,IAAIC,EAAI,EAAGA,EAAIwB,KAAKf,QAAQa,OAAQtB,IACvC,IAAKwB,KAAKf,QAAQT,GAAG8D,GAAGlB,EAAMnC,QAAQT,IAAK,OAAO,EACpD,OAAO,KAKLgD,0BAAe,OAAOxB,KAAKf,QAAQa,OAASE,KAAKf,QAAQ,GAAK,QAI9DqC,yBAAc,OAAOtB,KAAKf,QAAQa,OAASE,KAAKf,QAAQe,KAAKf,QAAQa,OAAS,GAAK,QAInFrB,0BAAe,OAAOuB,KAAKf,QAAQa,oBAKvCnB,eAAMqD,GACJzD,IAAIgE,EAAQvC,KAAKf,QAAQ+C,GACzB,IAAKO,EAAO,MAAM,IAAIC,WAAW,SAAWR,EAAQ,qBAAuBhC,MAC3E,OAAOuC,eAKTE,oBAAWT,GACT,OAAOhC,KAAKf,QAAQ+C,gBAMtBU,iBAAQtC,GACN,IAAK7B,IAAIC,EAAI,EAAGmE,EAAI,EAAGnE,EAAIwB,KAAKf,QAAQa,OAAQtB,IAAK,CACnDD,IAAII,EAAQqB,KAAKf,QAAQT,GACzB4B,EAAEzB,EAAOgE,EAAGnE,GACZmE,GAAKhE,EAAMS,uBAOfjB,uBAAciD,EAAO9C,GACnB,sBADyB,GAClBH,EAAc6B,KAAMoB,EAAO9C,gBAQpCe,qBAAY+B,EAAO9C,EAAiBsE,GAClC,sBADuB5C,KAAKd,qBAAiBkC,EAAMlC,MAC5CG,EAAYW,KAAMoB,EAAO9C,EAAKsE,gBAOvCC,mBAAUvE,EAAKwE,GACb,mBADsB,GACX,GAAPxE,EAAU,OAAOyE,EAAS,EAAGzE,GACjC,GAAIA,GAAO0B,KAAKd,KAAM,OAAO6D,EAAS/C,KAAKf,QAAQa,OAAQxB,GAC3D,GAAIA,EAAM0B,KAAKd,MAAQZ,EAAM,EAAG,MAAM,IAAIkE,uBAAuBlE,qCACjE,IAAKC,IAAIC,EAAI,EAAGwE,EAAS,GAAIxE,IAAK,CAChCD,IAAyBgC,EAAMyC,EAArBhD,KAAKrB,MAAMH,GAAuBY,SAC5C,GAAImB,GAAOjC,EACT,OAAIiC,GAAOjC,GAAOwE,EAAQ,EAAUC,EAASvE,EAAI,EAAG+B,GAC7CwC,EAASvE,EAAGwE,GAErBA,EAASzC,gBAMb0C,oBAAa,MAAO,IAAMjD,KAAKkD,gBAAkB,iBAEjDA,yBAAkB,OAAOlD,KAAKf,QAAQkE,KAAK,mBAI3CC,kBACE,OAAOpD,KAAKf,QAAQa,OAASE,KAAKf,QAAQoE,cAAIC,UAAKA,EAAEF,YAAY,MAKnErD,EAAOwD,kBAASC,EAAQC,GACtB,IAAKA,EAAO,OAAO1D,EAAS+B,MAC5B,IAAK4B,MAAMC,QAAQF,GAAQ,MAAM,IAAIjB,WAAW,uCAChD,OAAO,IAAIzC,EAAS0D,EAAMJ,IAAIG,EAAOI,gBAMvC7D,EAAO8D,mBAAUC,GACf,IAAKA,EAAMhE,OAAQ,OAAOC,EAAS+B,MAEnC,IADAvD,IAAIwF,EAAQ7E,EAAO,EACVV,EAAI,EAAGA,EAAIsF,EAAMhE,OAAQtB,IAAK,CACrCD,IAAIwC,EAAO+C,EAAMtF,GACjBU,GAAQ6B,EAAK3B,SACTZ,GAAKuC,EAAKjC,QAAUgF,EAAMtF,EAAI,GAAGK,WAAWkC,IACzCgD,IAAQA,EAASD,EAAM9C,MAAM,EAAGxC,IACrCuF,EAAOA,EAAOjE,OAAS,GAAKiB,EAAKU,SAASsC,EAAOA,EAAOjE,OAAS,GAAGf,KAAOgC,EAAKhC,OACvEgF,GACTA,EAAOrC,KAAKX,GAGhB,OAAO,IAAIhB,EAASgE,GAAUD,EAAO5E,IAQvCa,EAAOG,cAAK8D,GACV,IAAKA,EAAO,OAAOjE,EAAS+B,MAC5B,GAAIkC,aAAiBjE,EAAU,OAAOiE,EACtC,GAAIN,MAAMC,QAAQK,GAAQ,OAAOhE,KAAK6D,UAAUG,GAChD,GAAIA,EAAMC,MAAO,OAAO,IAAIlE,EAAS,CAACiE,GAAQA,EAAM5E,UACpD,MAAM,IAAIoD,WAAW,mBAAqBwB,EAAQ,kBAC5BA,EAAM/D,aAAe,mEAAqE,6CAIpHiE,IAAM3B,EAAQ,CAACP,MAAO,EAAGmC,OAAQ,GACjC,SAASpB,EAASf,EAAOmC,GAGvB,OAFA5B,EAAMP,MAAQA,EACdO,EAAM4B,OAASA,EACR5B,EC7QF,SAAS6B,EAAYhG,EAAGC,GAC7B,GAAID,IAAMC,EAAG,OAAO,EACpB,IAAMD,GAAiB,iBAALA,IACZC,GAAiB,iBAALA,EAAgB,OAAO,EACzCE,IAAIuF,EAAQJ,MAAMC,QAAQvF,GAC1B,GAAIsF,MAAMC,QAAQtF,IAAMyF,EAAO,OAAO,EACtC,GAAIA,EAAO,CACT,GAAI1F,EAAE0B,QAAUzB,EAAEyB,OAAQ,OAAO,EACjC,IAAKvB,IAAIC,EAAI,EAAGA,EAAIJ,EAAE0B,OAAQtB,IAAK,IAAK4F,EAAYhG,EAAEI,GAAIH,EAAEG,IAAK,OAAO,MACnE,CACL,IAAKD,IAAIoE,KAAKvE,EAAG,KAAMuE,KAAKtE,KAAO+F,EAAYhG,EAAEuE,GAAItE,EAAEsE,IAAK,OAAO,EACnE,IAAKpE,IAAIoE,KAAKtE,EAAG,KAAMsE,KAAKvE,GAAI,OAAO,EAEzC,OAAO,EDuQT2B,EAAS+B,MAAQ,IAAI/B,EAAS,GAAI,OE5QrBsE,EACX,SAAYC,EAAML,GAGhBjE,KAAKsE,KAAOA,EAGZtE,KAAKiE,MAAQA,GCTV,SAASM,EAAaC,GAC3BjG,IAAIkG,EAAMC,MAAMC,KAAK3E,KAAMwE,GAE3B,OADAC,EAAIG,UAAYL,EAAaM,UACtBJ,cDePK,kBAASC,GAEP,IADAxG,IAAI2D,EAAM8C,GAAS,EACVxG,EAAI,EAAGA,EAAIuG,EAAIjF,OAAQtB,IAAK,CACnCD,IAAI6C,EAAQ2D,EAAIvG,GAChB,GAAIwB,KAAKsC,GAAGlB,GAAQ,OAAO2D,EAC3B,GAAI/E,KAAKsE,KAAKW,SAAS7D,EAAMkD,MACtBpC,IAAMA,EAAO6C,EAAI/D,MAAM,EAAGxC,QAC1B,CAAA,GAAI4C,EAAMkD,KAAKW,SAASjF,KAAKsE,MAClC,OAAOS,GAEFC,GAAU5D,EAAMkD,KAAKY,KAAOlF,KAAKsE,KAAKY,OACpChD,IAAMA,EAAO6C,EAAI/D,MAAM,EAAGxC,IAC/B0D,EAAKR,KAAK1B,MACVgF,GAAS,GAEP9C,GAAMA,EAAKR,KAAKN,IAKxB,OAFKc,IAAMA,EAAO6C,EAAI/D,SACjBgE,GAAQ9C,EAAKR,KAAK1B,MAChBkC,eAMTiD,uBAAcJ,GACZ,IAAKxG,IAAIC,EAAI,EAAGA,EAAIuG,EAAIjF,OAAQtB,IAC9B,GAAIwB,KAAKsC,GAAGyC,EAAIvG,IACd,OAAOuG,EAAI/D,MAAM,EAAGxC,GAAG4D,OAAO2C,EAAI/D,MAAMxC,EAAI,IAChD,OAAOuG,eAKTK,iBAAQL,GACN,IAAKxG,IAAIC,EAAI,EAAGA,EAAIuG,EAAIjF,OAAQtB,IAC9B,GAAIwB,KAAKsC,GAAGyC,EAAIvG,IAAK,OAAO,EAC9B,OAAO,eAMT8D,YAAGlB,GACD,OAAOpB,MAAQoB,GACZpB,KAAKsE,MAAQlD,EAAMkD,MAAQF,EAAYpE,KAAKiE,MAAO7C,EAAM6C,oBAK9Db,kBACE7E,IAAI8G,EAAM,CAACf,KAAMtE,KAAKsE,KAAKgB,MAC3B,IAAK/G,IAAIgH,KAAKvF,KAAKiE,MAAO,CACxBoB,EAAIpB,MAAQjE,KAAKiE,MACjB,MAEF,OAAOoB,GAIThB,EAAOd,kBAASC,EAAQgC,GACtB,IAAKA,EAAM,MAAM,IAAIhD,WAAW,mCAChCjE,IAAI+F,EAAOd,EAAOiC,MAAMD,EAAKlB,MAC7B,IAAKA,EAAM,MAAM,IAAI9B,oCAAoCgD,0BACzD,OAAOlB,EAAKoB,OAAOF,EAAKvB,QAK1BI,EAAOsB,iBAAQvH,EAAGC,GAChB,GAAID,GAAKC,EAAG,OAAO,EACnB,GAAID,EAAE0B,QAAUzB,EAAEyB,OAAQ,OAAO,EACjC,IAAKvB,IAAIC,EAAI,EAAGA,EAAIJ,EAAE0B,OAAQtB,IAC5B,IAAKJ,EAAEI,GAAG8D,GAAGjE,EAAEG,IAAK,OAAO,EAC7B,OAAO,GAMT6F,EAAOuB,iBAAQH,GACb,IAAKA,GAAyB,GAAhBA,EAAM3F,OAAa,OAAOuE,EAAKwB,KAC7C,GAAIJ,aAAiBpB,EAAM,MAAO,CAACoB,GACnClH,IAAI2D,EAAOuD,EAAMzE,QAEjB,OADAkB,EAAK4D,eAAM1H,EAAGC,UAAMD,EAAEkG,KAAKY,KAAO7G,EAAEiG,KAAKY,QAClChD,GAKXmC,EAAKwB,KAAO,GCvGZtB,EAAaM,UAAYkB,OAAOL,OAAOhB,MAAMG,WAC7CN,EAAaM,UAAUmB,YAAczB,EACrCA,EAAaM,UAAUS,KAAO,mBAKjBW,EAWX,SAAYhH,EAASiH,EAAWC,GAE9BnG,KAAKf,QAAUA,EAEfe,KAAKkG,UAAYA,EAEjBlG,KAAKmG,QAAUA,8BA2DnB,SAASC,EAAYnH,EAASiB,EAAMC,SACZlB,EAAQ4D,UAAU3C,wBAAOvB,EAAQM,EAAQwD,WAAWT,KACjC/C,EAAQ4D,UAAU1C,wBAC3D,GAAIgE,GAAUjE,GAAQvB,EAAMG,OAAQ,CAClC,GAAIuH,GAAYlG,IAAOlB,EAAQN,MAAM2H,GAASxH,OAAQ,MAAM,IAAI0D,WAAW,2BAC3E,OAAOvD,EAAQ0C,IAAI,EAAGzB,GAAMiB,OAAOlC,EAAQ0C,IAAIxB,IAEjD,GAAI6B,GAASsE,EAAS,MAAM,IAAI9D,WAAW,2BAC3C,OAAOvD,EAAQ8C,aAAaC,EAAOrD,EAAMuD,KAAKkE,EAAYzH,EAAMM,QAASiB,EAAOiE,EAAS,EAAGhE,EAAKgE,EAAS,KAG5G,SAASoC,EAAWtH,EAASuH,EAAMC,EAAQnG,SACnBrB,EAAQ4D,UAAU2D,wBAAO7H,EAAQM,EAAQwD,WAAWT,GAC1E,GAAImC,GAAUqC,GAAQ7H,EAAMG,OAC1B,OAAIwB,IAAWA,EAAOoG,WAAW1E,EAAOA,EAAOyE,GAAgB,KACxDxH,EAAQ0C,IAAI,EAAG6E,GAAMrF,OAAOsF,GAAQtF,OAAOlC,EAAQ0C,IAAI6E,IAEhEjI,IAAIY,EAAQoH,EAAW5H,EAAMM,QAASuH,EAAOrC,EAAS,EAAGsC,GACzD,OAAOtH,GAASF,EAAQ8C,aAAaC,EAAOrD,EAAMuD,KAAK/C,IAOlD,SAASwH,EAAQC,EAAOC,EAAK7F,GAClC,GAAIA,EAAMkF,UAAYU,EAAME,MAC1B,MAAM,IAAIvC,EAAa,mDACzB,GAAIqC,EAAME,MAAQ9F,EAAMkF,WAAaW,EAAIC,MAAQ9F,EAAMmF,QACrD,MAAM,IAAI5B,EAAa,4BACzB,OAAOwC,EAAaH,EAAOC,EAAK7F,EAAO,GAGzC,SAAS+F,EAAaH,EAAOC,EAAK7F,EAAO8F,GACvCvI,IAAIyD,EAAQ4E,EAAM5E,MAAM8E,GAAQ/F,EAAO6F,EAAM7F,KAAK+F,GAClD,GAAI9E,GAAS6E,EAAI7E,MAAM8E,IAAUA,EAAQF,EAAME,MAAQ9F,EAAMkF,UAAW,CACtE3H,IAAIY,EAAQ4H,EAAaH,EAAOC,EAAK7F,EAAO8F,EAAQ,GACpD,OAAO/F,EAAKmB,KAAKnB,EAAK9B,QAAQ8C,aAAaC,EAAO7C,IAC7C,GAAK6B,EAAM/B,QAAQC,KAEnB,CAAA,GAAK8B,EAAMkF,WAAclF,EAAMmF,SAAWS,EAAME,OAASA,GAASD,EAAIC,OAASA,EAG/E,OA+ET,SAAgC9F,EAAOgG,GAGrC,IAFAzI,IAAI0I,EAAQD,EAAOF,MAAQ9F,EAAMkF,UAC7BnF,EADiDiG,EAAOjG,KAAKkG,GAC/C/E,KAAKlB,EAAM/B,SACpBT,EAAIyI,EAAQ,EAAGzI,GAAK,EAAGA,IAC9BuC,EAAOiG,EAAOjG,KAAKvC,GAAG0D,KAAKnC,EAASG,KAAKa,IAC3C,MAAO,CAACP,MAAOO,EAAKmG,eAAelG,EAAMkF,UAAYe,GAC7C1G,IAAKQ,EAAKmG,eAAenG,EAAK9B,QAAQC,KAAO8B,EAAMmF,QAAUc,IApFhDE,CAAuBnG,EAAO4F,GACjD,OAAOQ,EAAMrG,EAAMsG,EAAgBT,gBAAmBC,EAAKC,IAJ3DvI,IAAI+B,EAASsG,EAAMtG,OAAQrB,EAAUqB,EAAOrB,QAC5C,OAAOmI,EAAM9G,EAAQrB,EAAQ0C,IAAI,EAAGiF,EAAMU,cAAcnG,OAAOH,EAAM/B,SAASkC,OAAOlC,EAAQ0C,IAAIkF,EAAIS,gBAHrG,OAAOF,EAAMrG,EAAMwG,EAAcX,EAAOC,EAAKC,IAUjD,SAASU,EAAUC,EAAMC,GACvB,IAAKA,EAAIpD,KAAKqD,kBAAkBF,EAAKnD,MACnC,MAAM,IAAIC,EAAa,eAAiBmD,EAAIpD,KAAKgB,KAAO,SAAWmC,EAAKnD,KAAKgB,MAGjF,SAASsC,EAASC,EAASC,EAAQhB,GACjCvI,IAAIwC,EAAO8G,EAAQ9G,KAAK+F,GAExB,OADAU,EAAUzG,EAAM+G,EAAO/G,KAAK+F,IACrB/F,EAGT,SAASgH,EAAQpJ,EAAOqJ,GACtBzJ,IAAI8C,EAAO2G,EAAOlI,OAAS,EACvBuB,GAAQ,GAAK1C,EAAMG,QAAUH,EAAME,WAAWmJ,EAAO3G,IACvD2G,EAAO3G,GAAQ1C,EAAM8C,SAASuG,EAAO3G,GAAMtC,KAAOJ,EAAMI,MAExDiJ,EAAOtG,KAAK/C,GAGhB,SAASsJ,EAASC,EAAQC,EAAMrB,EAAOkB,GACrCzJ,IAAIwC,GAAQoH,GAAQD,GAAQnH,KAAK+F,GAC7BsB,EAAa,EAAGC,EAAWF,EAAOA,EAAKnG,MAAM8E,GAAS/F,EAAKtC,WAC3DyJ,IACFE,EAAaF,EAAOlG,MAAM8E,GACtBoB,EAAOpB,MAAQA,EACjBsB,IACSF,EAAOI,aAChBP,EAAQG,EAAOK,UAAWP,GAC1BI,MAGJ,IAAK7J,IAAIC,EAAI4J,EAAY5J,EAAI6J,EAAU7J,IAAKuJ,EAAQhH,EAAKpC,MAAMH,GAAIwJ,GAC/DG,GAAQA,EAAKrB,OAASA,GAASqB,EAAKG,YACtCP,EAAQI,EAAKK,WAAYR,GAG7B,SAASZ,EAAMrG,EAAM9B,GACnB,IAAK8B,EAAKuD,KAAKmE,aAAaxJ,GAC1B,MAAM,IAAIsF,EAAa,4BAA8BxD,EAAKuD,KAAKgB,MACjE,OAAOvE,EAAKmB,KAAKjD,GAGnB,SAASoI,EAAgBT,EAAOsB,EAAQC,EAAMtB,EAAKC,GACjDvI,IAAI2H,EAAYU,EAAME,MAAQA,GAASc,EAAShB,EAAOsB,EAAQpB,EAAQ,GACnEX,EAAUU,EAAIC,MAAQA,GAASc,EAASO,EAAMtB,EAAKC,EAAQ,GAE3D7H,EAAU,GAad,OAZAgJ,EAAS,KAAMrB,EAAOE,EAAO7H,GACzBiH,GAAaC,GAAW+B,EAAOlG,MAAM8E,IAAUqB,EAAKnG,MAAM8E,IAC5DU,EAAUtB,EAAWC,GACrB4B,EAAQX,EAAMlB,EAAWmB,EAAgBT,EAAOsB,EAAQC,EAAMtB,EAAKC,EAAQ,IAAK7H,KAE5EiH,GACF6B,EAAQX,EAAMlB,EAAWqB,EAAcX,EAAOsB,EAAQpB,EAAQ,IAAK7H,GACrEgJ,EAASC,EAAQC,EAAMrB,EAAO7H,GAC1BkH,GACF4B,EAAQX,EAAMjB,EAASoB,EAAcY,EAAMtB,EAAKC,EAAQ,IAAK7H,IAEjEgJ,EAASpB,EAAK,KAAMC,EAAO7H,GACpB,IAAIc,EAASd,GAGtB,SAASsI,EAAcX,EAAOC,EAAKC,GACjCvI,IAAIU,EAAU,IACdgJ,EAAS,KAAMrB,EAAOE,EAAO7H,GACzB2H,EAAME,MAAQA,IAEhBiB,EAAQX,EADGQ,EAAShB,EAAOC,EAAKC,EAAQ,GACpBS,EAAcX,EAAOC,EAAKC,EAAQ,IAAK7H,GAG7D,OADAgJ,EAASpB,EAAK,KAAMC,EAAO7H,GACpB,IAAIc,EAASd,KA7KhBC,oBACF,OAAOc,KAAKf,QAAQC,KAAOc,KAAKkG,UAAYlG,KAAKmG,qBAGnDuC,kBAASpK,EAAKqK,GACZpK,IAAIU,EAAUsH,EAAWvG,KAAKf,QAASX,EAAM0B,KAAKkG,UAAWyC,EAAU,MACvE,OAAO1J,GAAW,IAAIgH,EAAMhH,EAASe,KAAKkG,UAAWlG,KAAKmG,sBAG5DyC,uBAAc1I,EAAMC,GAClB,OAAO,IAAI8F,EAAMG,EAAYpG,KAAKf,QAASiB,EAAOF,KAAKkG,UAAW/F,EAAKH,KAAKkG,WAAYlG,KAAKkG,UAAWlG,KAAKmG,sBAK/G7D,YAAGlB,GACD,OAAOpB,KAAKf,QAAQqD,GAAGlB,EAAMnC,UAAYe,KAAKkG,WAAa9E,EAAM8E,WAAalG,KAAKmG,SAAW/E,EAAM+E,qBAGtGlD,oBACE,OAAOjD,KAAKf,QAAU,IAAMe,KAAKkG,UAAY,IAAMlG,KAAKmG,QAAU,iBAKpE/C,kBACE,IAAKpD,KAAKf,QAAQC,KAAM,OAAO,KAC/BX,IAAIiH,EAAO,CAACvG,QAASe,KAAKf,QAAQmE,UAGlC,OAFIpD,KAAKkG,UAAY,IAAGV,EAAKU,UAAYlG,KAAKkG,WAC1ClG,KAAKmG,QAAU,IAAGX,EAAKW,QAAUnG,KAAKmG,SACnCX,GAKTS,EAAO1C,kBAASC,EAAQgC,GACtB,IAAKA,EAAM,OAAOS,EAAMnE,MACxBvD,IAAI2H,EAAYV,EAAKU,WAAa,EAAGC,EAAUX,EAAKW,SAAW,EAC/D,GAAwB,iBAAbD,GAA2C,iBAAXC,EACzC,MAAM,IAAI3D,WAAW,oCACvB,OAAO,IAAIyD,EAAMlG,EAASwD,SAASC,EAAQgC,EAAKvG,SAAUiH,EAAWC,IAMvEF,EAAO4C,iBAAQF,EAAUG,mBAAc,GAErC,IADAvK,IAAI2H,EAAY,EAAGC,EAAU,EACpB7C,EAAIqF,EAASnH,WAAY8B,IAAMA,EAAErC,SAAW6H,IAAkBxF,EAAEgB,KAAKyE,KAAKC,WAAY1F,EAAIA,EAAE9B,WAAY0E,IACjH,IAAK3H,IAAI+E,EAAIqF,EAASrH,UAAWgC,IAAMA,EAAErC,SAAW6H,IAAkBxF,EAAEgB,KAAKyE,KAAKC,WAAY1F,EAAIA,EAAEhC,UAAW6E,IAC/G,OAAO,IAAIF,EAAM0C,EAAUzC,EAAWC,2CA2B1CF,EAAMnE,MAAQ,IAAImE,EAAMlG,EAAS+B,MAAO,EAAG,OC5G9BmH,EACX,SAAY3K,EAAK4K,EAAM5B,GAErBtH,KAAK1B,IAAMA,EACX0B,KAAKkJ,KAAOA,EAKZlJ,KAAK8G,MAAQoC,EAAKpJ,OAAS,EAAI,EAE/BE,KAAKsH,aAAeA,wJAGtB6B,sBAAaC,GACX,OAAW,MAAPA,EAAoBpJ,KAAK8G,MACzBsC,EAAM,EAAUpJ,KAAK8G,MAAQsC,EAC1BA,KAOL9I,sBAAW,OAAON,KAAKe,KAAKf,KAAK8G,UAIjCuC,mBAAQ,OAAOrJ,KAAKe,KAAK,gBAK7BA,cAAK+F,GAAS,OAAO9G,KAAKkJ,KAAgC,EAA3BlJ,KAAKmJ,aAAarC,iBAMjD9E,eAAM8E,GAAS,OAAO9G,KAAKkJ,KAAgC,EAA3BlJ,KAAKmJ,aAAarC,GAAa,gBAK/DwC,oBAAWxC,GAET,OADAA,EAAQ9G,KAAKmJ,aAAarC,GACnB9G,KAAKgC,MAAM8E,IAAUA,GAAS9G,KAAK8G,OAAU9G,KAAKsI,WAAiB,EAAJ,gBAMxE9H,eAAMsG,GAEJ,OAAgB,IADhBA,EAAQ9G,KAAKmJ,aAAarC,IACN,EAAI9G,KAAKkJ,KAAa,EAARpC,EAAY,GAAK,eAMrDvG,aAAIuG,GAEF,OADAA,EAAQ9G,KAAKmJ,aAAarC,GACnB9G,KAAKQ,MAAMsG,GAAS9G,KAAKe,KAAK+F,GAAO7H,QAAQC,kBAOtDqK,gBAAOzC,GAEL,KADAA,EAAQ9G,KAAKmJ,aAAarC,IACd,MAAM,IAAItE,WAAW,kDACjC,OAAOsE,GAAS9G,KAAK8G,MAAQ,EAAI9G,KAAK1B,IAAM0B,KAAKkJ,KAAa,EAARpC,EAAY,gBAMpE0C,eAAM1C,GAEJ,KADAA,EAAQ9G,KAAKmJ,aAAarC,IACd,MAAM,IAAItE,WAAW,iDACjC,OAAOsE,GAAS9G,KAAK8G,MAAQ,EAAI9G,KAAK1B,IAAM0B,KAAKkJ,KAAa,EAARpC,EAAY,GAAK9G,KAAKkJ,KAAa,EAARpC,GAAW1H,YAO1FkJ,0BAAe,OAAOtI,KAAK1B,IAAM0B,KAAKkJ,KAAKlJ,KAAKkJ,KAAKpJ,OAAS,MAM9DyI,yBACFhK,IAAI+B,EAASN,KAAKM,OAAQ0B,EAAQhC,KAAKgC,MAAMhC,KAAK8G,OAClD,GAAI9E,GAAS1B,EAAO7B,WAAY,OAAO,KACvCF,IAAIkL,EAAOzJ,KAAK1B,IAAM0B,KAAKkJ,KAAKlJ,KAAKkJ,KAAKpJ,OAAS,GAAInB,EAAQ2B,EAAO3B,MAAMqD,GAC5E,OAAOyH,EAAOnJ,EAAO3B,MAAMqD,GAAOL,IAAI8H,GAAQ9K,KAO5C6J,0BACFjK,IAAIyD,EAAQhC,KAAKgC,MAAMhC,KAAK8G,OACxB2C,EAAOzJ,KAAK1B,IAAM0B,KAAKkJ,KAAKlJ,KAAKkJ,KAAKpJ,OAAS,GACnD,OAAI2J,EAAazJ,KAAKM,OAAO3B,MAAMqD,GAAOL,IAAI,EAAG8H,GACjC,GAATzH,EAAa,KAAOhC,KAAKM,OAAO3B,MAAMqD,EAAQ,gBAMvD0H,oBAAW1H,EAAO8E,GAChBA,EAAQ9G,KAAKmJ,aAAarC,GAE1B,IADAvI,IAAIwC,EAAOf,KAAKkJ,KAAa,EAARpC,GAAYxI,EAAe,GAATwI,EAAa,EAAI9G,KAAKkJ,KAAa,EAARpC,EAAY,GAAK,EAC1EtI,EAAI,EAAGA,EAAIwD,EAAOxD,IAAKF,GAAOyC,EAAKpC,MAAMH,GAAGY,SACrD,OAAOd,eAQTmH,iBACElH,IAAI+B,EAASN,KAAKM,OAAQ0B,EAAQhC,KAAKgC,QAGvC,GAA2B,GAAvB1B,EAAOrB,QAAQC,KAAW,OAAOmF,EAAKwB,KAG1C,GAAI7F,KAAKsI,WAAY,OAAOhI,EAAO3B,MAAMqD,GAAOyD,MAEhDlH,IAAIkJ,EAAOnH,EAAOmC,WAAWT,EAAQ,GAAIZ,EAAQd,EAAOmC,WAAWT,GAGnE,IAAKyF,EAAM,CAAElJ,IAAIoL,EAAMlC,EAAMA,EAAOrG,EAAOA,EAAQuI,EAKnD,IADApL,IAAIkH,EAAQgC,EAAKhC,MACRjH,EAAI,EAAGA,EAAIiH,EAAM3F,OAAQtB,KACK,IAAjCiH,EAAMjH,GAAG8F,KAAKyE,KAAKa,WAAyBxI,GAAUqE,EAAMjH,GAAG4G,QAAQhE,EAAMqE,SAC/EA,EAAQA,EAAMjH,KAAK2G,cAAcM,IAErC,OAAOA,eAUToE,qBAAY1B,GACV5J,IAAIiL,EAAQxJ,KAAKM,OAAOmC,WAAWzC,KAAKgC,SACxC,IAAKwH,IAAUA,EAAMM,SAAU,OAAO,KAGtC,IADAvL,IAAIkH,EAAQ+D,EAAM/D,MAAOsE,EAAO5B,EAAK7H,OAAOmC,WAAW0F,EAAKnG,SACnDxD,EAAI,EAAGA,EAAIiH,EAAM3F,OAAQtB,KACK,IAAjCiH,EAAMjH,GAAG8F,KAAKyE,KAAKa,WAAyBG,GAAStE,EAAMjH,GAAG4G,QAAQ2E,EAAKtE,SAC7EA,EAAQA,EAAMjH,KAAK2G,cAAcM,IACrC,OAAOA,eAMTuE,qBAAY1L,GACV,IAAKC,IAAIuI,EAAQ9G,KAAK8G,MAAOA,EAAQ,EAAGA,IACtC,GAAI9G,KAAKQ,MAAMsG,IAAUxI,GAAO0B,KAAKO,IAAIuG,IAAUxI,EAAK,OAAOwI,EACjE,OAAO,eAWTmD,oBAAW7I,EAAc8I,GACvB,kBADiBlK,MACboB,EAAM9C,IAAM0B,KAAK1B,IAAK,OAAO8C,EAAM6I,WAAWjK,MAClD,IAAKzB,IAAI4L,EAAInK,KAAK8G,OAAS9G,KAAKM,OAAO8J,eAAiBpK,KAAK1B,KAAO8C,EAAM9C,IAAM,EAAI,GAAI6L,GAAK,EAAGA,IAC9F,GAAI/I,EAAM9C,KAAO0B,KAAKO,IAAI4J,MAAQD,GAAQA,EAAKlK,KAAKe,KAAKoJ,KACvD,OAAO,IAAIE,EAAUrK,KAAMoB,EAAO+I,gBAKxCG,oBAAWlJ,GACT,OAAOpB,KAAK1B,IAAM0B,KAAKsH,cAAgBlG,EAAM9C,IAAM8C,EAAMkG,0BAK3D7G,aAAIW,GACF,OAAOA,EAAM9C,IAAM0B,KAAK1B,IAAM8C,EAAQpB,kBAKxCH,aAAIuB,GACF,OAAOA,EAAM9C,IAAM0B,KAAK1B,IAAM8C,EAAQpB,kBAGxCiD,oBAEE,IADA1E,IAAIgM,EAAM,GACD/L,EAAI,EAAGA,GAAKwB,KAAK8G,MAAOtI,IAC/B+L,IAAQA,EAAM,IAAM,IAAMvK,KAAKe,KAAKvC,GAAG8F,KAAKgB,KAAO,IAAMtF,KAAKgC,MAAMxD,EAAI,GAC1E,OAAO+L,EAAM,IAAMvK,KAAKsH,cAG1B2B,EAAOuB,iBAAQnB,EAAK/K,GAClB,KAAMA,GAAO,GAAKA,GAAO+K,EAAIpK,QAAQC,MAAO,MAAM,IAAIsD,WAAW,YAAclE,EAAM,iBAGrF,IAFAC,IAAI2K,EAAO,GACP1I,EAAQ,EAAG8G,EAAehJ,EACrByC,EAAOsI,IAAO,OACCtI,EAAK9B,QAAQ4D,UAAUyE,wBACzCmD,EAAMnD,EAAenD,EAEzB,GADA+E,EAAKxH,KAAKX,EAAMiB,EAAOxB,EAAQ2D,IAC1BsG,EAAK,MAEV,IADA1J,EAAOA,EAAKpC,MAAMqD,IACTlD,OAAQ,MACjBwI,EAAemD,EAAM,EACrBjK,GAAS2D,EAAS,EAEpB,OAAO,IAAI8E,EAAY3K,EAAK4K,EAAM5B,IAGpC2B,EAAOyB,uBAAcrB,EAAK/K,GACxB,IAAKC,IAAIC,EAAI,EAAGA,EAAImM,EAAa7K,OAAQtB,IAAK,CAC5CD,IAAIqM,EAASD,EAAanM,GAC1B,GAAIoM,EAAOtM,KAAOA,GAAOsM,EAAOvB,KAAOA,EAAK,OAAOuB,EAErDrM,IAAIqD,EAAS+I,EAAaE,GAAmB5B,EAAYuB,QAAQnB,EAAK/K,GAEtE,OADAuM,GAAmBA,EAAkB,GAAKC,EACnClJ,0CAIXrD,IAAIoM,EAAe,GAAIE,EAAkB,EAAGC,EAAmB,GAIlDT,EAKX,SAAYzD,EAAOC,EAAKC,GAMtB9G,KAAK4G,MAAQA,EAGb5G,KAAK6G,IAAMA,EAEX7G,KAAK8G,MAAQA,wIAIXtG,qBAAU,OAAOR,KAAK4G,MAAM2C,OAAOvJ,KAAK8G,MAAQ,MAEhDvG,mBAAQ,OAAOP,KAAK6G,IAAI2C,MAAMxJ,KAAK8G,MAAQ,MAG3CxG,sBAAW,OAAON,KAAK4G,MAAM7F,KAAKf,KAAK8G,UAEvCsB,0BAAe,OAAOpI,KAAK4G,MAAM5E,MAAMhC,KAAK8G,UAE5CuB,wBAAa,OAAOrI,KAAK6G,IAAIyC,WAAWtJ,KAAK8G,+CC3RnD5C,IAAM6G,EAAahF,OAAOL,OAAO,MAcpBsF,EACX,SAAY1G,EAAML,EAAOhF,EAASwG,GAGhCzF,KAAKsE,KAAOA,EAMZtE,KAAKiE,MAAQA,EAIbjE,KAAKf,QAAUA,GAAWc,EAAS+B,MAKnC9B,KAAKyF,MAAQA,GAASpB,EAAKwB,yVAYzBzG,wBAAa,OAAOY,KAAKiB,OAAS,EAAI,EAAIjB,KAAKf,QAAQC,QAIvDT,0BAAe,OAAOuB,KAAKf,QAAQR,wBAKvCE,eAAMqD,GAAS,OAAOhC,KAAKf,QAAQN,MAAMqD,gBAIzCS,oBAAWT,GAAS,OAAOhC,KAAKf,QAAQwD,WAAWT,gBAKnDU,iBAAQtC,GAAKJ,KAAKf,QAAQyD,QAAQtC,gBAUlCH,sBAAaC,EAAMC,EAAIC,EAAG6K,kBAAW,GACnCjL,KAAKf,QAAQgB,aAAaC,EAAMC,EAAIC,EAAG6K,EAAUjL,mBAMnDU,qBAAYN,GACVJ,KAAKC,aAAa,EAAGD,KAAKf,QAAQC,KAAMkB,MAMtC8K,2BAAgB,OAAOlL,KAAKW,YAAY,EAAGX,KAAKf,QAAQC,KAAM,iBAOlEyB,qBAAYT,EAAMC,EAAIS,EAAgBC,GACpC,OAAOb,KAAKf,QAAQ0B,YAAYT,EAAMC,EAAIS,EAAgBC,MAMxDW,0BAAe,OAAOxB,KAAKf,QAAQuC,cAKnCF,yBAAc,OAAOtB,KAAKf,QAAQqC,uBAItCgB,YAAGlB,GACD,OAAOpB,MAAQoB,GAAUpB,KAAKnB,WAAWuC,IAAUpB,KAAKf,QAAQqD,GAAGlB,EAAMnC,sBAM3EJ,oBAAWuC,GACT,OAAOpB,KAAKmL,UAAU/J,EAAMkD,KAAMlD,EAAM6C,MAAO7C,EAAMqE,oBAMvD0F,mBAAU7G,EAAML,EAAOwB,GACrB,OAAOzF,KAAKsE,MAAQA,GAClBF,EAAYpE,KAAKiE,MAAOA,GAASK,EAAK8G,cAAgBL,IACtD1G,EAAKsB,QAAQ3F,KAAKyF,MAAOA,GAASpB,EAAKwB,mBAM3C3D,cAAKjD,GACH,sBADa,MACTA,GAAWe,KAAKf,QAAgBe,KAC7B,IAAIA,KAAKgG,YAAYhG,KAAKsE,KAAMtE,KAAKiE,MAAOhF,EAASe,KAAKyF,oBAMnE4F,cAAK5F,GACH,OAAOA,GAASzF,KAAKyF,MAAQzF,KAAO,IAAIA,KAAKgG,YAAYhG,KAAKsE,KAAMtE,KAAKiE,MAAOjE,KAAKf,QAASwG,gBAOhG9D,aAAIzB,EAAMC,GACR,OAAY,GAARD,GAAaC,GAAMH,KAAKf,QAAQC,KAAac,KAC1CA,KAAKkC,KAAKlC,KAAKf,QAAQ0C,IAAIzB,EAAMC,iBAM1Ca,eAAMd,EAAMC,EAAwBmL,GAClC,kBADetL,KAAKf,QAAQC,sBAAuB,GAC/CgB,GAAQC,EAAI,OAAO8F,EAAMnE,MAE7BvD,IAAIqI,EAAQ5G,KAAKwK,QAAQtK,GAAO2G,EAAM7G,KAAKwK,QAAQrK,GAC/C2G,EAAQwE,EAAiB,EAAI1E,EAAMoD,YAAY7J,GAC/CK,EAAQoG,EAAMpG,MAAMsG,GACpB7H,EADmC2H,EAAM7F,KAAK+F,GAC/B7H,QAAQ0C,IAAIiF,EAAMtI,IAAMkC,EAAOqG,EAAIvI,IAAMkC,GAC5D,OAAO,IAAIyF,EAAMhH,EAAS2H,EAAME,MAAQA,EAAOD,EAAIC,MAAQA,gBAU7DH,iBAAQzG,EAAMC,EAAIa,GAChB,OAAO2F,EAAQ3G,KAAKwK,QAAQtK,GAAOF,KAAKwK,QAAQrK,GAAKa,gBAKvDuK,gBAAOjN,GACL,IAAKC,IAAIwC,EAAOf,OAAQ,OACAe,EAAK9B,QAAQ4D,UAAUvE,wBAE7C,KADAyC,EAAOA,EAAK0B,WAAWT,IACZ,OAAO,KAClB,GAAImC,GAAU7F,GAAOyC,EAAKjC,OAAQ,OAAOiC,EACzCzC,GAAO6F,EAAS,gBAQpBqH,oBAAWlN,SACa0B,KAAKf,QAAQ4D,UAAUvE,wBAC7C,MAAO,CAACyC,KAAMf,KAAKf,QAAQwD,WAAWT,SAAQA,SAAOmC,gBAOvDsH,qBAAYnN,GACV,GAAW,GAAPA,EAAU,MAAO,CAACyC,KAAM,KAAMiB,MAAO,EAAGmC,OAAQ,SAC9BnE,KAAKf,QAAQ4D,UAAUvE,wBAC7C,GAAI6F,EAAS7F,EAAK,MAAO,CAACyC,KAAMf,KAAKf,QAAQN,MAAMqD,SAAQA,SAAOmC,GAClE5F,IAAIwC,EAAOf,KAAKf,QAAQN,MAAMqD,EAAQ,GACtC,MAAO,MAACjB,EAAMiB,MAAOA,EAAQ,EAAGmC,OAAQA,EAASpD,EAAK3B,uBAMxDoL,iBAAQlM,GAAO,OAAO2K,EAAYyB,cAAc1K,KAAM1B,gBAEtD4I,wBAAe5I,GAAO,OAAO2K,EAAYuB,QAAQxK,KAAM1B,gBAKvDoN,sBAAaxL,EAAMC,EAAImE,GACrB/F,IAAIgE,GAAQ,EAKZ,OAJIpC,EAAKD,GAAMF,KAAKC,aAAaC,EAAMC,YAAIY,GAEzC,OADIuD,EAAKc,QAAQrE,EAAK0E,SAAQlD,GAAQ,IAC9BA,KAEHA,KAKLrB,uBAAY,OAAOlB,KAAKsE,KAAKpD,WAK7ByK,2BAAgB,OAAO3L,KAAKsE,KAAKqH,eAIjCvB,6BAAkB,OAAOpK,KAAKsE,KAAK8F,iBAKnCN,wBAAa,OAAO9J,KAAKsE,KAAKwF,YAI9BhL,sBAAW,OAAOkB,KAAKsE,KAAKxF,UAI5BmC,sBAAW,OAAOjB,KAAKsE,KAAKrD,UAQ5B2K,sBAAW,OAAO5L,KAAKsE,KAAKsH,oBAKhC3I,oBACE,GAAIjD,KAAKsE,KAAKyE,KAAK8C,cAAe,OAAO7L,KAAKsE,KAAKyE,KAAK8C,cAAc7L,MACtEzB,IAAI+G,EAAOtF,KAAKsE,KAAKgB,KAGrB,OAFItF,KAAKf,QAAQC,OACfoG,GAAQ,IAAMtF,KAAKf,QAAQiE,gBAAkB,KAqInD,SAAmBuC,EAAO8E,GACxB,IAAKhM,IAAIC,EAAIiH,EAAM3F,OAAS,EAAGtB,GAAK,EAAGA,IACrC+L,EAAM9E,EAAMjH,GAAG8F,KAAKgB,KAAO,IAAMiF,EAAM,IACzC,OAAOA,EAvIEuB,CAAU9L,KAAKyF,MAAOH,gBAK/ByG,wBAAe/J,GACbzD,IAAIyN,EAAQhM,KAAKsE,KAAK2H,aAAaC,cAAclM,KAAKf,QAAS,EAAG+C,GAClE,IAAKgK,EAAO,MAAM,IAAItH,MAAM,wDAC5B,OAAOsH,eASTtF,oBAAWxG,EAAMC,EAAIgM,EAA8B3L,EAAWD,kBAA3BR,EAAS+B,sBAAe,kBAASqK,EAAY1N,YAC9EF,IAAI6N,EAAMpM,KAAK+L,eAAe7L,GAAMgM,cAAcC,EAAa3L,EAAOD,GAClE8L,EAAMD,GAAOA,EAAIF,cAAclM,KAAKf,QAASkB,GACjD,IAAKkM,IAAQA,EAAIC,SAAU,OAAO,EAClC,IAAK/N,IAAIC,EAAIgC,EAAOhC,EAAI+B,EAAK/B,IAAK,IAAKwB,KAAKsE,KAAKiI,YAAYJ,EAAYxN,MAAMH,GAAGiH,OAAQ,OAAO,EACjG,OAAO,eAMT+G,wBAAetM,EAAMC,EAAImE,EAAMmB,GAC7B,GAAIA,IAAUzF,KAAKsE,KAAKiI,YAAY9G,GAAQ,OAAO,EACnDlH,IAAIiC,EAAQR,KAAK+L,eAAe7L,GAAMuM,UAAUnI,GAC5C/D,EAAMC,GAASA,EAAM0L,cAAclM,KAAKf,QAASkB,GACrD,QAAOI,GAAMA,EAAI+L,sBAQnBI,mBAAUtL,GACR,OAAIA,EAAMnC,QAAQC,KAAac,KAAK0G,WAAW1G,KAAKvB,WAAYuB,KAAKvB,WAAY2C,EAAMnC,SAC3Ee,KAAKsE,KAAKqD,kBAAkBvG,EAAMkD,mBAMhDqI,iBACE,IAAK3M,KAAKsE,KAAKmE,aAAazI,KAAKf,SAC/B,MAAM,IAAIuD,uCAAuCxC,KAAKsE,eAActE,KAAKf,QAAQgE,WAAWjC,MAAM,EAAG,KACvGhB,KAAKf,QAAQyD,kBAAQ3B,UAAQA,EAAK4L,wBAKpCvJ,kBACE7E,IAAI8G,EAAM,CAACf,KAAMtE,KAAKsE,KAAKgB,MAC3B,IAAK/G,IAAIgH,KAAKvF,KAAKiE,MAAO,CACxBoB,EAAIpB,MAAQjE,KAAKiE,MACjB,MAMF,OAJIjE,KAAKf,QAAQC,OACfmG,EAAIpG,QAAUe,KAAKf,QAAQmE,UACzBpD,KAAKyF,MAAM3F,SACbuF,EAAII,MAAQzF,KAAKyF,MAAMpC,cAAIC,UAAKA,EAAEF,aAC7BiC,GAKT2F,EAAOzH,kBAASC,EAAQgC,GACtB,IAAKA,EAAM,MAAM,IAAIhD,WAAW,mCAChCjE,IAAIkH,EAAQ,KACZ,GAAID,EAAKC,MAAO,CACd,IAAK/B,MAAMC,QAAQ6B,EAAKC,OAAQ,MAAM,IAAIjD,WAAW,uCACrDiD,EAAQD,EAAKC,MAAMpC,IAAIG,EAAOoJ,cAEhC,GAAiB,QAAbpH,EAAKlB,KAAgB,CACvB,GAAwB,iBAAbkB,EAAKzG,KAAkB,MAAM,IAAIyD,WAAW,6BACvD,OAAOgB,EAAOzE,KAAKyG,EAAKzG,KAAM0G,GAEhClH,IAAIU,EAAUc,EAASwD,SAASC,EAAQgC,EAAKvG,SAC7C,OAAOuE,EAAOqJ,SAASrH,EAAKlB,MAAMoB,OAAOF,EAAKvB,MAAOhF,EAASwG,+CCnWrDqH,EACX,SAAYR,GAGVtM,KAAKsM,SAAWA,EAChBtM,KAAK+J,KAAO,GACZ/J,KAAK+M,UAAY,kGAGnBD,EAAOE,eAAMC,EAAQC,GACnB3O,IAAI4O,EAAS,IAAIC,EAAYH,EAAQC,GACrC,GAAmB,MAAfC,EAAOpD,KAAc,OAAO+C,EAAahL,MAC7CvD,IAAI8O,EAAOC,EAAUH,GACjBA,EAAOpD,MAAMoD,EAAO1I,IAAI,4BAC5BlG,IAAIyN,EA4UR,SAAauB,GACXhP,IAAIiP,EAAUzH,OAAOL,OAAO,MAC5B,OAAO+H,EAAQC,EAASH,EAAK,IAE7B,SAASE,EAAQE,GACfpP,IAAIqP,EAAM,GACVD,EAAOjL,kBAAQ3B,GACbwM,EAAIxM,GAAM2B,yCACR,GAAKmL,EAAL,CACAtP,IAAIuP,EAAQF,EAAIG,QAAQF,GAAO9I,EAAM+I,GAAS,GAAKF,EAAIE,EAAQ,GAC/DJ,EAASH,EAAKpN,GAAIuC,kBAAQ3B,GACnBgE,GAAK6I,EAAIlM,KAAKmM,EAAM9I,EAAM,KACL,GAAtBA,EAAIgJ,QAAQhN,IAAagE,EAAIrD,KAAKX,aAK5C,IADAxC,IAAIyP,EAAQR,EAAQG,EAAOxK,KAAK,MAAQ,IAAI2J,EAAaa,EAAOI,QAAQR,EAAIzN,OAAS,IAAM,GAClFtB,EAAI,EAAGA,EAAIoP,EAAI9N,OAAQtB,GAAK,EAAG,CACtCD,IAAIoP,EAASC,EAAIpP,EAAI,GAAGsH,KAAKmI,GAC7BD,EAAMjE,KAAKrI,KAAKkM,EAAIpP,GAAIgP,EAAQG,EAAOxK,KAAK,OAASsK,EAAQE,IAE/D,OAAOK,GAjWKE,CAyPhB,SAAab,GACX9O,IAAIgP,EAAM,CAAC,IAEX,OADAY,EAAQC,EAAQf,EAAM,GAAItM,KACnBwM,EAEP,SAASxM,IAAS,OAAOwM,EAAI7L,KAAK,IAAM,EACxC,SAAS2M,EAAKnO,EAAMC,EAAI0N,GACtBtP,IAAI8P,EAAO,MAACR,KAAM1N,GAElB,OADAoN,EAAIrN,GAAMwB,KAAK2M,GACRA,EAET,SAASF,EAAQG,EAAOnO,GAAMmO,EAAM5L,kBAAQ2L,UAAQA,EAAKlO,GAAKA,KAE9D,SAASiO,EAAQf,EAAMnN,GACrB,GAAiB,UAAbmN,EAAK/I,KACP,OAAO+I,EAAKkB,MAAMC,iBAAQZ,EAAKP,UAASO,EAAIxL,OAAOgM,EAAQf,EAAMnN,MAAQ,IACpE,GAAiB,OAAbmN,EAAK/I,KACd,IAAK/F,IAAIC,EAAI,GAAIA,IAAK,CACpBD,IAAIwL,EAAOqE,EAAQf,EAAKkB,MAAM/P,GAAI0B,GAClC,GAAI1B,GAAK6O,EAAKkB,MAAMzO,OAAS,EAAG,OAAOiK,EACvCoE,EAAQpE,EAAM7J,EAAOa,SAElB,CAAA,GAAiB,QAAbsM,EAAK/I,KAAgB,CAC9B/F,IAAIkQ,EAAO1N,IAGX,OAFAsN,EAAKnO,EAAMuO,GACXN,EAAQC,EAAQf,EAAKA,KAAMoB,GAAOA,GAC3B,CAACJ,EAAKI,IACR,GAAiB,QAAbpB,EAAK/I,KAAgB,CAC9B/F,IAAIkQ,EAAO1N,IAGX,OAFAoN,EAAQC,EAAQf,EAAKA,KAAMnN,GAAOuO,GAClCN,EAAQC,EAAQf,EAAKA,KAAMoB,GAAOA,GAC3B,CAACJ,EAAKI,IACR,GAAiB,OAAbpB,EAAK/I,KACd,MAAO,CAAC+J,EAAKnO,IAAOkC,OAAOgM,EAAQf,EAAKA,KAAMnN,IACzC,GAAiB,SAAbmN,EAAK/I,KAAiB,CAE/B,IADA/F,IAAImQ,EAAMxO,EACD1B,EAAI,EAAGA,EAAI6O,EAAKxN,IAAKrB,IAAK,CACjCD,IAAIwL,EAAOhJ,IACXoN,EAAQC,EAAQf,EAAKA,KAAMqB,GAAM3E,GACjC2E,EAAM3E,EAER,IAAiB,GAAbsD,EAAK5M,IACP0N,EAAQC,EAAQf,EAAKA,KAAMqB,GAAMA,QAEjC,IAAKnQ,IAAIC,EAAI6O,EAAKxN,IAAKrB,EAAI6O,EAAK5M,IAAKjC,IAAK,CACxCD,IAAIwL,EAAOhJ,IACXsN,EAAKK,EAAK3E,GACVoE,EAAQC,EAAQf,EAAKA,KAAMqB,GAAM3E,GACjC2E,EAAM3E,EAGV,MAAO,CAACsE,EAAKK,IACR,GAAiB,QAAbrB,EAAK/I,KACd,MAAO,CAAC+J,EAAKnO,EAAM,KAAMmN,EAAK5J,UA9ShB8J,CAAIF,IAEpB,OAmWJ,SAA0BrB,EAAOmB,GAC/B,IAAK5O,IAAIC,EAAI,EAAGmQ,EAAO,CAAC3C,GAAQxN,EAAImQ,EAAK7O,OAAQtB,IAAK,CAEpD,IADAD,IAAIyP,EAAQW,EAAKnQ,GAAIoQ,GAAQZ,EAAM1B,SAAUtI,EAAQ,GAC5ChF,EAAI,EAAGA,EAAIgP,EAAMjE,KAAKjK,OAAQd,GAAK,EAAG,CAC7CT,IAAIwC,EAAOiN,EAAMjE,KAAK/K,GAAI+K,EAAOiE,EAAMjE,KAAK/K,EAAI,GAChDgF,EAAMtC,KAAKX,EAAKuE,OACZsJ,GAAU7N,EAAKjC,QAAUiC,EAAK8N,qBAAqBD,GAAO,IACnC,GAAvBD,EAAKZ,QAAQhE,IAAa4E,EAAKjN,KAAKqI,GAEtC6E,GAAMzB,EAAO1I,IAAI,+BAAiCT,EAAMb,KAAK,MAAQ,mFA7WzE2L,CAAiB9C,EAAOmB,GACjBnB,eAMTS,mBAAUnI,GACR,IAAK/F,IAAIC,EAAI,EAAGA,EAAIwB,KAAK+J,KAAKjK,OAAQtB,GAAK,EACzC,GAAIwB,KAAK+J,KAAKvL,IAAM8F,EAAM,OAAOtE,KAAK+J,KAAKvL,EAAI,GACjD,OAAO,kBAMT0N,uBAAc6C,EAAMvO,EAAWD,kBAAH,kBAASwO,EAAKtQ,YAExC,IADAF,IAAImQ,EAAM1O,KACDxB,EAAIgC,EAAOkO,GAAOlQ,EAAI+B,EAAK/B,IAClCkQ,EAAMA,EAAIjC,UAAUsC,EAAKpQ,MAAMH,GAAG8F,MACpC,OAAOoK,GAGTM,EAAI5E,6BACF7L,IAAIgD,EAAQvB,KAAK+J,KAAK,GACtB,QAAOxI,GAAQA,EAAMuI,UAMvBkF,EAAIC,2BACF,IAAK1Q,IAAIC,EAAI,EAAGA,EAAIwB,KAAK+J,KAAKjK,OAAQtB,GAAK,EAAG,CAC5CD,IAAI+F,EAAOtE,KAAK+J,KAAKvL,GACrB,IAAM8F,EAAKxF,SAAUwF,EAAKuK,mBAAqB,OAAOvK,gBAI1D4K,oBAAW9N,GACT,IAAK7C,IAAIC,EAAI,EAAGA,EAAIwB,KAAK+J,KAAKjK,OAAQtB,GAAK,EACzC,IAAKD,IAAIS,EAAI,EAAGA,EAAIoC,EAAM2I,KAAKjK,OAAQd,GAAK,EAC1C,GAAIgB,KAAK+J,KAAKvL,IAAM4C,EAAM2I,KAAK/K,GAAI,OAAO,EAC9C,OAAO,eAUTmQ,oBAAW3F,EAAO4F,EAAehH,mBAAP,kBAAoB,GAC5C7J,IAAI8Q,EAAO,CAACrP,MAgBZ,OAfA,SAASsP,EAAOtD,EAAOuD,GACrBhR,IAAIiR,EAAWxD,EAAME,cAAc1C,EAAOpB,GAC1C,GAAIoH,KAAcJ,GAASI,EAASlD,UAClC,OAAOvM,EAASG,KAAKqP,EAAMlM,cAAIoM,UAAMA,EAAGC,oBAE1C,IAAKnR,IAAIC,EAAI,EAAGA,EAAIwN,EAAMjC,KAAKjK,OAAQtB,GAAK,EAAG,CAC7CD,IAAI+F,EAAO0H,EAAMjC,KAAKvL,GAAIuL,EAAOiC,EAAMjC,KAAKvL,EAAI,GAChD,IAAM8F,EAAKxF,SAAUwF,EAAKuK,qBAA8C,GAAvBQ,EAAKtB,QAAQhE,GAAa,CACzEsF,EAAK3N,KAAKqI,GACVxL,IAAIgE,EAAQ+M,EAAOvF,EAAMwF,EAAMnN,OAAOkC,IACtC,GAAI/B,EAAO,OAAOA,IAKjB+M,CAAOtP,KAAM,iBAQtB2P,sBAAa3H,GACX,IAAKzJ,IAAIC,EAAI,EAAGA,EAAIwB,KAAK+M,UAAUjN,OAAQtB,GAAK,EAC9C,GAAIwB,KAAK+M,UAAUvO,IAAMwJ,EAAQ,OAAOhI,KAAK+M,UAAUvO,EAAI,GAC7DD,IAAIqR,EAAW5P,KAAK6P,gBAAgB7H,GAEpC,OADAhI,KAAK+M,UAAUrL,KAAKsG,EAAQ4H,GACrBA,eAGTC,yBAAgB7H,GAEd,IADAzJ,IAAI8Q,EAAOtJ,OAAOL,OAAO,MAAOoK,EAAS,CAAC,CAAC9D,MAAOhM,KAAMsE,KAAM,KAAMyL,IAAK,OAClED,EAAOhQ,QAAQ,CACpBvB,IAAI0D,EAAU6N,EAAOE,QAAShE,EAAQ/J,EAAQ+J,MAC9C,GAAIA,EAAMS,UAAUzE,GAAS,CAE3B,IADAzJ,IAAIqD,EAAS,GACJyD,EAAMpD,EAASoD,EAAIf,KAAMe,EAAMA,EAAI0K,IAC1CnO,EAAOF,KAAK2D,EAAIf,MAClB,OAAO1C,EAAOqO,UAEhB,IAAK1R,IAAIC,EAAI,EAAGA,EAAIwN,EAAMjC,KAAKjK,OAAQtB,GAAK,EAAG,CAC7CD,IAAI+F,EAAO0H,EAAMjC,KAAKvL,GACjB8F,EAAKrD,QAAWqD,EAAKuK,oBAAwBvK,EAAKgB,QAAQ+J,GAAWpN,EAAQqC,OAAQ0H,EAAMjC,KAAKvL,EAAI,GAAG8N,WAC1GwD,EAAOpO,KAAK,CAACsK,MAAO1H,EAAK2H,kBAAc3H,EAAMyL,IAAK9N,IAClDoN,EAAK/K,EAAKgB,OAAQ,MAS1B0J,EAAIkB,yBACF,OAAOlQ,KAAK+J,KAAKjK,QAAU,eAM7BuO,cAAK/K,GACH/E,IAAIC,EAAI8E,GAAK,EACb,GAAI9E,GAAKwB,KAAK+J,KAAKjK,OAAQ,MAAM,IAAI0C,yBAAyBc,mCAC9D,MAAO,CAACgB,KAAMtE,KAAK+J,KAAKvL,GAAIuL,KAAM/J,KAAK+J,KAAKvL,EAAI,iBAGlDyE,oBACE1E,IAAI8Q,EAAO,GAOX,OANA,SAASc,EAAKC,GACZf,EAAK3N,KAAK0O,GACV,IAAK7R,IAAIC,EAAI,EAAGA,EAAI4R,EAAErG,KAAKjK,OAAQtB,GAAK,GACN,GAA5B6Q,EAAKtB,QAAQqC,EAAErG,KAAKvL,KAAW2R,EAAKC,EAAErG,KAAKvL,IAEnD2R,CAAKnQ,MACEqP,EAAKhM,cAAK+M,EAAG5R,GAElB,IADAD,IAAIqP,EAAMpP,GAAK4R,EAAE9D,SAAW,IAAM,KAAO,IAChC9N,EAAI,EAAGA,EAAI4R,EAAErG,KAAKjK,OAAQtB,GAAK,EACtCoP,IAAQpP,EAAI,KAAO,IAAM4R,EAAErG,KAAKvL,GAAG8G,KAAO,KAAO+J,EAAKtB,QAAQqC,EAAErG,KAAKvL,EAAI,IAC3E,OAAOoP,KACNzK,KAAK,8CAIZ2J,EAAahL,MAAQ,IAAIgL,GAAa,GAEtC,IAAMM,EACJ,SAAYH,EAAQC,GAClBlN,KAAKiN,OAASA,EACdjN,KAAKkN,UAAYA,EACjBlN,KAAKqQ,OAAS,KACdrQ,KAAK1B,IAAM,EACX0B,KAAKsQ,OAASrD,EAAOsD,MAAM,kBACgB,IAAvCvQ,KAAKsQ,OAAOtQ,KAAKsQ,OAAOxQ,OAAS,IAAUE,KAAKsQ,OAAOE,MACrC,IAAlBxQ,KAAKsQ,OAAO,IAAUtQ,KAAKsQ,OAAON,oCAU1C,SAAS1C,EAAUH,GACjB5O,IAAIgQ,EAAQ,GACZ,GAAKA,EAAM7M,KAAK+O,EAAatD,UACtBA,EAAOuD,IAAI,MAClB,OAAuB,GAAhBnC,EAAMzO,OAAcyO,EAAM,GAAK,CAACjK,KAAM,eAAUiK,GAGzD,SAASkC,EAAatD,GACpB5O,IAAIgQ,EAAQ,GACZ,GAAKA,EAAM7M,KAAKiP,EAAmBxD,UAC5BA,EAAOpD,MAAuB,KAAfoD,EAAOpD,MAA8B,KAAfoD,EAAOpD,MACnD,OAAuB,GAAhBwE,EAAMzO,OAAcyO,EAAM,GAAK,CAACjK,KAAM,YAAOiK,GAGtD,SAASoC,EAAmBxD,GAE1B,IADA5O,IAAI8O,EA4CN,SAAuBF,GACrB,GAAIA,EAAOuD,IAAI,KAAM,CACnBnS,IAAI8O,EAAOC,EAAUH,GAErB,OADKA,EAAOuD,IAAI,MAAMvD,EAAO1I,IAAI,yBAC1B4I,EACF,IAAK,KAAKuD,KAAKzD,EAAOpD,MAAO,CAClCxL,IAAIgQ,EAlBR,SAAqBpB,EAAQ7H,GAC3B/G,IAAIgR,EAAQpC,EAAOD,UAAW5I,EAAOiL,EAAMjK,GAC3C,GAAIhB,EAAM,MAAO,CAACA,GAClB/F,IAAIqD,EAAS,GACb,IAAKrD,IAAIsS,KAAYtB,EAAO,CAC1BhR,IAAI+F,EAAOiL,EAAMsB,GACbvM,EAAKwM,OAAO/C,QAAQzI,IAAS,GAAG1D,EAAOF,KAAK4C,GAE7B,GAAjB1C,EAAO9B,QAAaqN,EAAO1I,IAAI,0BAA4Ba,EAAO,WACtE,OAAO1D,EASOmP,CAAY5D,EAAQA,EAAOpD,MAAM1G,cAAIiB,GAG/C,OAFqB,MAAjB6I,EAAOkD,OAAgBlD,EAAOkD,OAAS/L,EAAKwF,SACvCqD,EAAOkD,QAAU/L,EAAKwF,UAAUqD,EAAO1I,IAAI,mCAC7C,CAACH,KAAM,OAAQb,MAAOa,MAG/B,OADA6I,EAAO7O,MACgB,GAAhBiQ,EAAMzO,OAAcyO,EAAM,GAAK,CAACjK,KAAM,eAAUiK,GAEvDpB,EAAO1I,IAAI,qBAAuB0I,EAAOpD,KAAO,KA1DvCiH,CAAc7D,KAEvB,GAAIA,EAAOuD,IAAI,KACbrD,EAAO,CAAC/I,KAAM,YAAQ+I,QACnB,GAAIF,EAAOuD,IAAI,KAClBrD,EAAO,CAAC/I,KAAM,YAAQ+I,QACnB,GAAIF,EAAOuD,IAAI,KAClBrD,EAAO,CAAC/I,KAAM,WAAO+I,OAClB,CAAA,IAAIF,EAAOuD,IAAI,KAEf,MADHrD,EAAO4D,EAAe9D,EAAQE,GAGlC,OAAOA,EAGT,SAAS6D,EAAS/D,GACZ,KAAKyD,KAAKzD,EAAOpD,OAAOoD,EAAO1I,IAAI,yBAA2B0I,EAAOpD,KAAO,KAChFxL,IAAIqD,EAASuP,OAAOhE,EAAOpD,MAE3B,OADAoD,EAAO7O,MACAsD,EAGT,SAASqP,EAAe9D,EAAQE,GAC9B9O,IAAIsB,EAAMqR,EAAS/D,GAAS1M,EAAMZ,EAMlC,OALIsN,EAAOuD,IAAI,OACWjQ,EAAL,KAAf0M,EAAOpD,KAAmBmH,EAAS/D,IAC3B,GAETA,EAAOuD,IAAI,MAAMvD,EAAO1I,IAAI,yBAC1B,CAACH,KAAM,YAASzE,MAAKY,OAAK4M,GAwGnC,SAASY,EAAI7P,EAAGC,GAAK,OAAOA,EAAID,EAKhC,SAASsP,EAASH,EAAKxM,GACrBxC,IAAIqD,EAAS,GAEb,OAEA,SAASuO,EAAKpP,GACZxC,IAAI+P,EAAQf,EAAIxM,GAChB,GAAoB,GAAhBuN,EAAMxO,SAAgBwO,EAAM,GAAGT,KAAM,OAAOsC,EAAK7B,EAAM,GAAGnO,IAC9DyB,EAAOF,KAAKX,GACZ,IAAKxC,IAAIC,EAAI,EAAGA,EAAI8P,EAAMxO,OAAQtB,IAAK,OACpB8P,EAAM9P,mBAClBqP,IAA+B,GAAvBjM,EAAOmM,QAAQ5N,IAAWgQ,EAAKhQ,IAThDgQ,CAAKpP,GACEa,EAAOkE,KAAKmI,GCpUrB,SAAS7C,EAAanH,GACpB1F,IAAI6S,EAAWrL,OAAOL,OAAO,MAC7B,IAAKnH,IAAI8S,KAAYpN,EAAO,CAC1B1F,IAAI+S,EAAOrN,EAAMoN,GACjB,IAAKC,EAAKC,WAAY,OAAO,KAC7BH,EAASC,GAAYC,EAAKE,QAE5B,OAAOJ,EAGT,SAASK,EAAaxN,EAAOR,GAC3BlF,IAAImT,EAAQ3L,OAAOL,OAAO,MAC1B,IAAKnH,IAAI+G,KAAQrB,EAAO,CACtB1F,IAAIoT,EAAQlO,GAASA,EAAM6B,GAC3B,QAAcsM,IAAVD,EAAqB,CACvBpT,IAAI+S,EAAOrN,EAAMqB,GACjB,IAAIgM,EAAKC,WACJ,MAAM,IAAI/O,WAAW,mCAAqC8C,GAD1CqM,EAAQL,EAAKE,QAGpCE,EAAMpM,GAAQqM,EAEhB,OAAOD,EAGT,SAASG,EAAU5N,GACjB1F,IAAIqD,EAASmE,OAAOL,OAAO,MAC3B,GAAIzB,EAAO,IAAK1F,IAAI+G,KAAQrB,EAAOrC,EAAO0D,GAAQ,IAAIwM,EAAU7N,EAAMqB,IACtE,OAAO1D,IDsIHmI,oBAAS,OAAO/J,KAAKsQ,OAAOtQ,KAAK1B,kBAErCoS,aAAIqB,GAAO,OAAO/R,KAAK+J,MAAQgI,IAAQ/R,KAAK1B,QAAS,gBAErDmG,aAAI8F,GAAO,MAAM,IAAIyH,YAAYzH,EAAM,4BAA8BvK,KAAKiN,OAAS,kDCnIxEgF,EACX,SAAY3M,EAAM9B,EAAQuF,GAGxB/I,KAAKsF,KAAOA,EAIZtF,KAAKwD,OAASA,EAIdxD,KAAK+I,KAAOA,EAEZ/I,KAAK8Q,OAAS/H,EAAKmJ,MAAQnJ,EAAKmJ,MAAM3B,MAAM,KAAO,GACnDvQ,KAAKiE,MAAQ4N,EAAU9I,EAAK9E,OAE5BjE,KAAKoL,aAAeA,EAAapL,KAAKiE,OAItCjE,KAAKiM,aAAe,KAKpBjM,KAAKmS,QAAU,KAIfnS,KAAKoK,cAAgB,KAIrBpK,KAAKkB,UAAY6H,EAAKsH,QAAkB,QAAR/K,GAIhCtF,KAAKlB,OAAiB,QAARwG,kHAKhB0J,EAAIlF,wBAAa,OAAQ9J,KAAKkB,SAK9B8N,EAAIrD,2BAAgB,OAAO3L,KAAKkB,SAAWlB,KAAKoK,eAIhD4E,EAAI/N,sBAAW,OAAOjB,KAAKiM,cAAgBa,EAAahL,OAKxDkN,EAAIpD,sBAAW,OAAO5L,KAAKiB,QAAUjB,KAAK+I,KAAKqJ,kBAI/CvD,4BACE,IAAKtQ,IAAI+E,KAAKtD,KAAKiE,MAAO,GAAIjE,KAAKiE,MAAMX,GAAG+O,WAAY,OAAO,EAC/D,OAAO,eAGT1K,2BAAkBvG,GAChB,OAAOpB,MAAQoB,GAASpB,KAAKiM,aAAaiD,WAAW9N,EAAM6K,2BAG7DwF,sBAAaxN,GACX,OAAKA,GAASjE,KAAKoL,aAAqBpL,KAAKoL,aACjCqG,EAAazR,KAAKiE,MAAOA,gBAUvCyB,gBAAOzB,EAAOhF,EAASwG,GACrB,GAAIzF,KAAKlB,OAAQ,MAAM,IAAI4F,MAAM,8CACjC,OAAO,IAAIsG,EAAKhL,KAAMA,KAAKyR,aAAaxN,GAAQlE,EAASG,KAAKjB,GAAUoF,EAAKuB,QAAQH,iBAOvF6M,uBAAcrO,EAAOhF,EAASwG,GAE5B,GADAxG,EAAUc,EAASG,KAAKjB,IACnBe,KAAKyI,aAAaxJ,GACrB,MAAM,IAAIuD,WAAW,4BAA8BxC,KAAKsF,MAC1D,OAAO,IAAI0F,EAAKhL,KAAMA,KAAKyR,aAAaxN,GAAQhF,EAASoF,EAAKuB,QAAQH,iBAUxEiK,uBAAczL,EAAOhF,EAASwG,GAG5B,GAFAxB,EAAQjE,KAAKyR,aAAaxN,IAC1BhF,EAAUc,EAASG,KAAKjB,IACZC,KAAM,CAChBX,IAAIgL,EAASvJ,KAAKiM,aAAakD,WAAWlQ,GAC1C,IAAKsK,EAAQ,OAAO,KACpBtK,EAAUsK,EAAOpI,OAAOlC,GAE1BV,IAAIiL,EAAQxJ,KAAKiM,aAAaC,cAAcjN,GAASkQ,WAAWpP,EAAS+B,OAAO,GAChF,OAAK0H,EACE,IAAIwB,EAAKhL,KAAMiE,EAAOhF,EAAQkC,OAAOqI,GAAQnF,EAAKuB,QAAQH,IAD9C,kBAOrBgD,sBAAaxJ,GACXV,IAAIqD,EAAS5B,KAAKiM,aAAaC,cAAcjN,GAC7C,IAAK2C,IAAWA,EAAO0K,SAAU,OAAO,EACxC,IAAK/N,IAAIC,EAAI,EAAGA,EAAIS,EAAQR,WAAYD,IACtC,IAAKwB,KAAKuM,YAAYtN,EAAQN,MAAMH,GAAGiH,OAAQ,OAAO,EACxD,OAAO,eAKT8M,wBAAeC,GACb,OAAuB,MAAhBxS,KAAKmS,SAAmBnS,KAAKmS,QAAQpE,QAAQyE,IAAa,eAKnEjG,qBAAY9G,GACV,GAAoB,MAAhBzF,KAAKmS,QAAiB,OAAO,EACjC,IAAK5T,IAAIC,EAAI,EAAGA,EAAIiH,EAAM3F,OAAQtB,IAAK,IAAKwB,KAAKuS,eAAe9M,EAAMjH,GAAG8F,MAAO,OAAO,EACvF,OAAO,eAKTmO,sBAAahN,GACX,GAAoB,MAAhBzF,KAAKmS,QAAiB,OAAO1M,EAEjC,IADAlH,IAAI2D,EACK1D,EAAI,EAAGA,EAAIiH,EAAM3F,OAAQtB,IAC3BwB,KAAKuS,eAAe9M,EAAMjH,GAAG8F,MAEvBpC,GACTA,EAAKR,KAAK+D,EAAMjH,IAFX0D,IAAMA,EAAOuD,EAAMzE,MAAM,EAAGxC,IAKrC,OAAQ0D,EAAeA,EAAKpC,OAASoC,EAAOmC,EAAKvC,MAAlC2D,GAGjBwM,EAAO7D,iBAAQpK,EAAOR,GACpBjF,IAAIqD,EAASmE,OAAOL,OAAO,MAC3B1B,EAAMtB,kBAAS4C,EAAMyD,UAASnH,EAAO0D,GAAQ,IAAI2M,EAAS3M,EAAM9B,EAAQuF,MAExExK,IAAImU,EAAUlP,EAAOuF,KAAK4J,SAAW,MACrC,IAAK/Q,EAAO8Q,GAAU,MAAM,IAAIlQ,WAAW,yCAA2CkQ,EAAU,MAChG,IAAK9Q,EAAO7C,KAAM,MAAM,IAAIyD,WAAW,oCACvC,IAAKjE,IAAIgH,KAAK3D,EAAO7C,KAAKkF,MAAO,MAAM,IAAIzB,WAAW,iDAEtD,OAAOZ,0CAMX,IAAMkQ,EACJ,SAAYc,GACV5S,KAAKuR,WAAaxL,OAAOlB,UAAUgO,eAAelO,KAAKiO,EAAS,WAChE5S,KAAKwR,QAAUoB,EAAQpB,0CAGzBsB,EAAIT,0BACF,OAAQrS,KAAKuR,uDAUJwB,EACX,SAAYzN,EAAMJ,EAAM1B,EAAQuF,GAG9B/I,KAAKsF,KAAOA,EAIZtF,KAAKwD,OAASA,EAIdxD,KAAK+I,KAAOA,EAEZ/I,KAAKiE,MAAQ4N,EAAU9I,EAAK9E,OAE5BjE,KAAKkF,KAAOA,EACZlF,KAAKgT,SAAW,KAChBzU,IAAI6S,EAAWhG,EAAapL,KAAKiE,OACjCjE,KAAKiT,SAAW7B,GAAY,IAAI/M,EAAKrE,KAAMoR,gBAO7C1L,gBAAOzB,GACL,OAAKA,GAASjE,KAAKiT,SAAiBjT,KAAKiT,SAClC,IAAI5O,EAAKrE,KAAMyR,EAAazR,KAAKiE,MAAOA,KAGjD8O,EAAO3E,iBAAQ3I,EAAOjC,GACpBjF,IAAIqD,EAASmE,OAAOL,OAAO,MAAOR,EAAO,EAEzC,OADAO,EAAM/C,kBAAS4C,EAAMyD,UAASnH,EAAO0D,GAAQ,IAAIyN,EAASzN,EAAMJ,IAAQ1B,EAAQuF,MACzEnH,eAMTuD,uBAAcJ,GACZ,IAAK,IAAIvG,EAAI,EAAGA,EAAIuG,EAAIjF,OAAQtB,IAASuG,EAAIvG,GAAG8F,MAAQtE,OACtD+E,EAAMA,EAAI/D,MAAM,EAAGxC,GAAG4D,OAAO2C,EAAI/D,MAAMxC,EAAI,IAC3CA,KAEF,OAAOuG,eAKTK,iBAAQL,GACN,IAAKxG,IAAIC,EAAI,EAAGA,EAAIuG,EAAIjF,OAAQtB,IAC9B,GAAIuG,EAAIvG,GAAG8F,MAAQtE,KAAM,OAAO+E,EAAIvG,gBAMxCyG,kBAAS7D,GACP,OAAOpB,KAAKgT,SAASjF,QAAQ3M,IAAU,OChJ9B8R,EAIX,SAAY1P,EAAQ2P,cAGlBnT,KAAKwD,OAASA,EAIdxD,KAAKmT,MAAQA,EACbnT,KAAKoT,KAAO,GACZpT,KAAKqT,OAAS,GAEdF,EAAMzQ,kBAAQ4Q,GACRA,EAAKC,IAAKvT,EAAKoT,KAAK1R,KAAK4R,GACpBA,EAAKE,OAAOxT,EAAKqT,OAAO3R,KAAK4R,MAIxCtT,KAAKyT,gBAAkBzT,KAAKoT,KAAKM,eAAKC,GACpC,IAAK,aAAa/C,KAAK+C,EAAEJ,OAASI,EAAE5S,KAAM,OAAO,EACjDxC,IAAIwC,EAAOyC,EAAOQ,MAAM2P,EAAE5S,MAC1B,OAAOA,EAAKkL,aAAaQ,UAAU1L,mBAMvCiM,eAAM4G,EAAKhB,kBAAU,IACnBrU,IAAIsV,EAAU,IAAIC,GAAa9T,KAAM4S,GAAS,GAE9C,OADAiB,EAAQE,OAAOH,EAAK,KAAMhB,EAAQ1S,KAAM0S,EAAQzS,IACzC0T,EAAQG,sBAUjBC,oBAAWL,EAAKhB,kBAAU,IACxBrU,IAAIsV,EAAU,IAAIC,GAAa9T,KAAM4S,GAAS,GAE9C,OADAiB,EAAQE,OAAOH,EAAK,KAAMhB,EAAQ1S,KAAM0S,EAAQzS,IACzC8F,EAAM4C,QAAQgL,EAAQG,uBAG/BE,kBAASN,EAAKC,EAASrK,GACrB,IAAKjL,IAAIC,EAAIgL,EAAQxJ,KAAKoT,KAAKrF,QAAQvE,GAAS,EAAI,EAAGhL,EAAIwB,KAAKoT,KAAKtT,OAAQtB,IAAK,CAChFD,IAAI+U,EAAOtT,KAAKoT,KAAK5U,GACrB,GAAI2V,GAAQP,EAAKN,EAAKC,YACE3B,IAAnB0B,EAAKc,WAA2BR,EAAIS,cAAgBf,EAAKc,cACxDd,EAAKO,SAAWA,EAAQS,eAAehB,EAAKO,UAAW,CAC3D,GAAIP,EAAKiB,SAAU,CACjBhW,IAAIqD,EAAS0R,EAAKiB,SAASX,GAC3B,IAAe,IAAXhS,EAAkB,SACtB0R,EAAKrP,MAAQrC,EAEf,OAAO0R,iBAKbkB,oBAAWC,EAAMhR,EAAOoQ,EAASrK,GAC/B,IAAKjL,IAAIC,EAAIgL,EAAQxJ,KAAKqT,OAAOtF,QAAQvE,GAAS,EAAI,EAAGhL,EAAIwB,KAAKqT,OAAOvT,OAAQtB,IAAK,CACpFD,IAAI+U,EAAOtT,KAAKqT,OAAO7U,GACvB,KAAgC,GAA5B8U,EAAKE,MAAMzF,QAAQ0G,IACnBnB,EAAKO,UAAYA,EAAQS,eAAehB,EAAKO,UAI7CP,EAAKE,MAAM1T,OAAS2U,EAAK3U,SACc,IAAtCwT,EAAKE,MAAMkB,WAAWD,EAAK3U,SAAiBwT,EAAKE,MAAMxS,MAAMyT,EAAK3U,OAAS,IAAM2D,IANtF,CAQA,GAAI6P,EAAKiB,SAAU,CACjBhW,IAAIqD,EAAS0R,EAAKiB,SAAS9Q,GAC3B,IAAe,IAAX7B,EAAkB,SACtB0R,EAAKrP,MAAQrC,EAEf,OAAO0R,KAKXJ,EAAOyB,qBAAYnR,GACjBjF,IAAIqD,EAAS,GACb,SAAS6E,EAAO6M,GAEd,IADA/U,IAAIqW,EAA4B,MAAjBtB,EAAKsB,SAAmB,GAAKtB,EAAKsB,SAAUpW,EAAI,EACxDA,EAAIoD,EAAO9B,OAAQtB,IAAK,CAC7BD,IAAIwL,EAAOnI,EAAOpD,GAClB,IADsD,MAAjBuL,EAAK6K,SAAmB,GAAK7K,EAAK6K,UACpDA,EAAU,MAE/BhT,EAAOiT,OAAOrW,EAAG,EAAG8U,qBAIpB/U,IAAI4U,EAAQ3P,EAAOiC,MAAMH,GAAMyD,KAAK+L,SAChC3B,GAAOA,EAAMzQ,kBAAQ4Q,GACvB7M,EAAO6M,EAAOpR,GAAKoR,IACnBA,EAAKjI,KAAO/F,MAJhB,IAAK/G,IAAI+G,KAAQ9B,EAAOiC,eAQlB0N,EADN,IAAK5U,IAAI+G,KAAQ9B,EAAOQ,MAClBmP,OAAAA,GAAAA,EAAQ3P,EAAOQ,MAAMsB,GAAMyD,KAAK+L,WACzB3B,EAAMzQ,kBAAQ4Q,GACvB7M,EAAO6M,EAAOpR,GAAKoR,IACnBA,EAAKvS,KAAOuE,KAGhB,OAAO1D,GAOTsR,EAAO6B,oBAAWvR,GAChB,OAAOA,EAAOoH,OAAOoK,YAClBxR,EAAOoH,OAAOoK,UAAY,IAAI9B,EAAU1P,EAAQ0P,EAAUyB,YAAYnR,MAK7EU,IAAM+Q,GAAY,CAChBC,SAAS,EAAMC,SAAS,EAAMC,OAAO,EAAMC,YAAY,EAAMC,QAAQ,EACrEC,IAAI,EAAMC,KAAK,EAAMC,IAAI,EAAMC,UAAU,EAAMC,YAAY,EAAMC,QAAQ,EACzEC,QAAQ,EAAMC,MAAM,EAAMC,IAAI,EAAMC,IAAI,EAAMC,IAAI,EAAMC,IAAI,EAAMC,IAAI,EACtEC,IAAI,EAAMC,QAAQ,EAAMC,QAAQ,EAAMC,IAAI,EAAMC,IAAI,EAAMC,UAAU,EAAMC,IAAI,EAC9EC,QAAQ,EAAMhU,GAAG,EAAMiU,KAAK,EAAMC,SAAS,EAAMC,OAAO,EAAMC,OAAO,EAAMC,IAAI,GAI3EC,GAAa,CACjBC,MAAM,EAAMT,UAAU,EAAMU,QAAQ,EAAMC,QAAQ,EAAM5D,OAAO,EAAM6D,OAAO,GAIxEC,GAAW,CAACZ,IAAI,EAAMM,IAAI,GAKhC,SAASO,GAAaC,GACpB,OAAQA,EAHc,EAGyB,IAA6B,SAAvBA,EAHL,EAG4D,GAG9G,IAAMC,GACJ,SAAYnT,EAAML,EAAOwB,EAAOiS,EAAcC,EAAO3L,EAAO4G,GAC1D5S,KAAKsE,KAAOA,EACZtE,KAAKiE,MAAQA,EACbjE,KAAK2X,MAAQA,EACb3X,KAAKgM,MAAQA,IAXoD,EAW1C4G,EAA0B,KAAOtO,EAAK2H,cAC7DjM,KAAK4S,QAAUA,EACf5S,KAAKf,QAAU,GAEfe,KAAKyF,MAAQA,EAEbzF,KAAK4X,YAAcvT,EAAKwB,KAExB7F,KAAK0X,aAAeA,EAEpB1X,KAAK6X,WAAa,iBAGpBlI,sBAAa5O,GACX,IAAKf,KAAKgM,MAAO,CACf,IAAKhM,KAAKsE,KAAM,MAAO,GACvB/F,IAAIuZ,EAAO9X,KAAKsE,KAAK2H,aAAakD,WAAWpP,EAASG,KAAKa,IAC3D,IAAI+W,EAEG,CACLvZ,IAAoCwZ,EAAhCvX,EAAQR,KAAKsE,KAAK2H,aACtB,OAAI8L,EAAOvX,EAAMmP,aAAa5O,EAAKuD,QACjCtE,KAAKgM,MAAQxL,EACNuX,GAEA,KAPT/X,KAAKgM,MAAQhM,KAAKsE,KAAK2H,aAAaC,cAAc4L,GAWtD,OAAO9X,KAAKgM,MAAM2D,aAAa5O,EAAKuD,oBAGtC0P,gBAAO7N,GACL,KA5CoB,EA4CdnG,KAAK4S,SAA4B,CACrCrU,IAAkD6R,EAA9C/O,EAAOrB,KAAKf,QAAQe,KAAKf,QAAQa,OAAS,GAC1CuB,GAAQA,EAAKvC,SAAWsR,EAAI,oBAAoB4H,KAAK3W,EAAKtC,SACxDsC,EAAKtC,KAAKe,QAAUsQ,EAAE,GAAGtQ,OAAQE,KAAKf,QAAQuR,MAC7CxQ,KAAKf,QAAQe,KAAKf,QAAQa,OAAS,GAAKuB,EAAKI,SAASJ,EAAKtC,KAAKiC,MAAM,EAAGK,EAAKtC,KAAKe,OAASsQ,EAAE,GAAGtQ,UAG1GvB,IAAIU,EAAUc,EAASG,KAAKF,KAAKf,SAGjC,OAFKkH,GAAWnG,KAAKgM,QACnB/M,EAAUA,EAAQkC,OAAOnB,KAAKgM,MAAMmD,WAAWpP,EAAS+B,OAAO,KAC1D9B,KAAKsE,KAAOtE,KAAKsE,KAAKoB,OAAO1F,KAAKiE,MAAOhF,EAASe,KAAKyF,OAASxG,gBAGzEgZ,0BAAiB5M,GACf,IAAK9M,IAAIC,EAAIwB,KAAK6X,WAAW/X,OAAS,EAAGtB,GAAK,EAAGA,IAC/C,GAAI6M,EAAK/I,GAAGtC,KAAK6X,WAAWrZ,IAAK,OAAOwB,KAAK6X,WAAWhD,OAAOrW,EAAG,GAAG,iBAGzE0Z,sBAAaC,GACX,IAAK5Z,IAAIC,EAAI,EAAG4Z,EAAUpY,KAAK0X,aAAclZ,EAAI4Z,EAAQtY,OAAQtB,IAAK,CACpED,IAAI8M,EAAO+M,EAAQ5Z,IACdwB,KAAKsE,KAAOtE,KAAKsE,KAAKiO,eAAelH,EAAK/G,MAAQ+T,GAAahN,EAAK/G,KAAM6T,MAC1E9M,EAAKjG,QAAQpF,KAAK4X,eACrB5X,KAAK4X,YAAcvM,EAAKvG,SAAS9E,KAAK4X,aACtC5X,KAAK0X,aAAerM,EAAKlG,cAAcnF,KAAK0X,iBAMpD,IAAM5D,GAEJ,SAAYwE,EAAQ1F,EAAS2F,GAE3BvY,KAAKsY,OAASA,EAEdtY,KAAK4S,QAAUA,EACf5S,KAAKwY,OAASD,EACdha,IAA+Bka,EAA3B9F,EAAUC,EAAQD,QAClB+F,EAAanB,GAAa3E,EAAQ4E,qBAAuBe,EAnFI,EAmFmB,GAElFE,EADE9F,EACW,IAAI8E,GAAY9E,EAAQrO,KAAMqO,EAAQ1O,MAAOI,EAAKwB,KAAMxB,EAAKwB,MAAM,EACnD+M,EAAQ+F,UAAYhG,EAAQrO,KAAK2H,aAAcyM,GAE/D,IAAIjB,GADVc,EACsB,KAEAD,EAAO9U,OAAOoV,YAFR,KAAMvU,EAAKwB,KAAMxB,EAAKwB,MAAM,EAAM,KAAM6S,GAG7E1Y,KAAKgE,MAAQ,CAACyU,GAEdzY,KAAKuY,KAAO,EACZvY,KAAK6Y,KAAOjG,EAAQkG,cACpB9Y,KAAK+Y,YAAa,2DAwXtB,SAAS5E,GAAQP,EAAKoF,GACpB,OAAQpF,EAAIO,SAAWP,EAAIqF,mBAAqBrF,EAAIsF,uBAAyBtF,EAAIuF,oBAAoBxU,KAAKiP,EAAKoF,GAWjH,SAAS9W,GAAKmD,GACZ9G,IAAI2D,EAAO,GACX,IAAK3D,IAAIkW,KAAQpP,EAAKnD,EAAKuS,GAAQpP,EAAIoP,GACvC,OAAOvS,EAMT,SAASmW,GAAa7F,EAAU3F,GAC9BtO,IAAIyF,EAAQ6I,EAASrJ,OAAOQ,oBAE1BzF,IAAI+B,EAAS0D,EAAMsB,GACnB,GAAKhF,EAAOiS,eAAeC,GAA3B,CACAjU,IAAI8Q,EAAO,GAAIc,WAAOnE,GACpBqD,EAAK3N,KAAKsK,GACV,IAAKzN,IAAIC,EAAI,EAAGA,EAAIwN,EAAMkE,UAAW1R,IAAK,OACrBwN,EAAMqC,KAAK7P,qBAC9B,GAAI8F,GAAQuI,EAAU,OAAO,EAC7B,GAAIwC,EAAKtB,QAAQhE,GAAQ,GAAKoG,EAAKpG,GAAO,OAAO,IAGrD,OAAIoG,EAAK7P,EAAO2L,kBAAsB,QAAtC,IAXF,IAAK1N,IAAI+G,KAAQtB,+BA5YjBgL,GAAIoK,mBACF,OAAOpZ,KAAKgE,MAAMhE,KAAKuY,oBAOzBc,gBAAOzF,GACL,GAAoB,GAAhBA,EAAI/G,SACN7M,KAAKsZ,YAAY1F,QACZ,GAAoB,GAAhBA,EAAI/G,SAAe,CAC5BtO,IAAIiV,EAAQI,EAAI2F,aAAa,SACzB9T,EAAQ+N,EAAQxT,KAAKwZ,WA8W/B,SAAqBhG,GACnBjV,IAAuC6R,EAAnCqJ,EAAK,6BAAiC7X,EAAS,GACnD,KAAOwO,EAAIqJ,EAAGzB,KAAKxE,IAAQ5R,EAAOF,KAAK0O,EAAE,GAAIA,EAAE,GAAGsJ,QAClD,OAAO9X,EAjXiC+X,CAAYnG,IAAU,KAAM4F,EAAMpZ,KAAKoZ,IAC3E,GAAa,MAAT3T,EAAe,IAAKlH,IAAIC,EAAI,EAAGA,EAAIiH,EAAM3F,OAAQtB,IAAKwB,KAAK4Z,eAAenU,EAAMjH,IAEpF,GADAwB,KAAK6Z,WAAWjG,GACH,MAATnO,EAAe,IAAKlH,IAAIC,EAAI,EAAGA,EAAIiH,EAAM3F,OAAQtB,IAAKwB,KAAK8Z,kBAAkBrU,EAAMjH,GAAI4a,kBAI/FE,qBAAY1F,GACVrV,IAAIkF,EAAQmQ,EAAImG,UACZX,EAAMpZ,KAAKoZ,IACf,IAAKA,EAAI9U,KAAO8U,EAAI9U,KAAK8F,cAAgBgP,EAAIna,QAAQa,QAAUsZ,EAAIna,QAAQ,GAAG6K,WAAa,mBAAmB8G,KAAKnN,GAAQ,CACzH,GA1HkB,EA0HZ2V,EAAIxG,QA1HkC,EAuI/BwG,EAAIxG,UACfnP,EAAQA,EAAMkD,QAAQ,YAAa,WATnC,GAJAlD,EAAQA,EAAMkD,QAAQ,oBAAqB,KAIvC,mBAAmBiK,KAAKnN,IAAUzD,KAAKuY,MAAQvY,KAAKgE,MAAMlE,OAAS,EAAG,CACxEvB,IAAIiK,EAAa4Q,EAAIna,QAAQma,EAAIna,QAAQa,OAAS,GAC9Cka,EAAgBpG,EAAIqG,kBACnBzR,GACAwR,GAA2C,MAA1BA,EAAcE,UAC/B1R,EAAW1J,QAAU,mBAAmB8R,KAAKpI,EAAWzJ,SAC3D0E,EAAQA,EAAMzC,MAAM,IAKtByC,GAAOzD,KAAKma,WAAWna,KAAKsY,OAAO9U,OAAOzE,KAAK0E,IACnDzD,KAAKoa,WAAWxG,QAEhB5T,KAAKqa,WAAWzG,iBAOpBiG,oBAAWjG,EAAK0G,GACd/b,IAAuCgc,EAAnCjV,EAAOsO,EAAIsG,SAASM,cACpBlD,GAASzE,eAAevN,IAAStF,KAAKsY,OAAO7E,gBAkTrD,SAAuBG,GACrB,IAAKrV,IAAII,EAAQiV,EAAIpS,WAAYiZ,EAAW,KAAM9b,EAAOA,EAAQA,EAAM+b,YAAa,CAClFnc,IAAI+G,EAAyB,GAAlB3G,EAAMkO,SAAgBlO,EAAMub,SAASM,cAAgB,KAC5DlV,GAAQgS,GAASzE,eAAevN,IAASmV,GAC3CA,EAASE,YAAYhc,GACrBA,EAAQ8b,GACS,MAARnV,EACTmV,EAAW9b,EACF2G,IACTmV,EAAW,OA3ToDG,CAAchH,GAC/ErV,IAAI+U,EAAQtT,KAAK4S,QAAQiI,cAAgB7a,KAAK4S,QAAQiI,aAAajH,KAC9D2G,EAASva,KAAKsY,OAAOpE,SAASN,EAAK5T,KAAMsa,IAC9C,GAAIhH,EAAOA,EAAKwH,OAAS7D,GAAWpE,eAAevN,GACjDtF,KAAKqa,WAAWzG,QACX,IAAKN,GAAQA,EAAKyH,MAAQzH,EAAK0H,YAAa,CAC7C1H,GAAQA,EAAK0H,YAAahb,KAAKuY,KAAO3Y,KAAKa,IAAI,EAAGT,KAAKuY,KAAO,GACzDjF,GAAQA,EAAKyH,KAAKlO,WAAU+G,EAAMN,EAAKyH,MAChDxc,IAAI0c,EAAM7B,EAAMpZ,KAAKoZ,IAAK8B,EAAgBlb,KAAK+Y,WAC/C,GAAI9D,GAAUpC,eAAevN,GAC3B2V,GAAO,EACF7B,EAAI9U,OAAMtE,KAAK+Y,YAAa,QAC5B,IAAKnF,EAAIpS,WAEd,YADAxB,KAAKmb,aAAavH,GAGpB5T,KAAK+T,OAAOH,GACRqH,GAAMjb,KAAKib,KAAK7B,GACpBpZ,KAAK+Y,WAAamC,OAElBlb,KAAKob,iBAAiBxH,EAAKN,GAAyB,IAAnBA,EAAK+H,UAAsBd,EAAS,oBAKzEY,sBAAavH,GACS,MAAhBA,EAAIsG,UAAoBla,KAAKoZ,IAAI9U,MAAQtE,KAAKoZ,IAAI9U,KAAK8F,eACzDpK,KAAKsZ,YAAY1F,EAAI0H,cAAcC,eAAe,qBAMtD/B,oBAAWnG,GACT9U,IAAIkH,EAAQpB,EAAKwB,KACjB2N,EAAO,IAAKjV,IAAIC,EAAI,EAAGA,EAAI6U,EAAOvT,OAAQtB,GAAK,EAC7C,IAAKD,IAAIiL,EAAQ,OAAQ,CACvBjL,IAAI+U,EAAOtT,KAAKsY,OAAO9D,WAAWnB,EAAO7U,GAAI6U,EAAO7U,EAAI,GAAIwB,KAAMwJ,GAClE,IAAK8J,EAAM,SAASE,EACpB,GAAIF,EAAKwH,OAAQ,OAAO,KAExB,GADArV,EAAQzF,KAAKsY,OAAO9U,OAAOiC,MAAM6N,EAAKjI,MAAM3F,OAAO4N,EAAKrP,OAAOa,SAASW,IACjD,IAAnB6N,EAAK+H,UACJ,MADyB7R,EAAQ8J,EAI1C,OAAO7N,gBAOT2V,0BAAiBxH,EAAKN,EAAMkI,OACtBP,EAAMpO,EAAoBxB,SAC1BiI,EAAKvS,MACP8L,EAAW7M,KAAKsY,OAAO9U,OAAOQ,MAAMsP,EAAKvS,OAC3BE,OAEFjB,KAAKma,WAAWtN,EAASnH,OAAO4N,EAAKrP,SAC/CjE,KAAKmb,aAAavH,GAFlBqH,EAAOjb,KAAKyb,MAAM5O,EAAUyG,EAAKrP,MAAOqP,EAAKkE,qBAM/CnM,EADWrL,KAAKsY,OAAO9U,OAAOiC,MAAM6N,EAAKjI,MACzB3F,OAAO4N,EAAKrP,OAC5BjE,KAAK4Z,eAAevO,IAEtB9M,IAAImd,EAAU1b,KAAKoZ,IAEnB,GAAIvM,GAAYA,EAAS5L,OACvBjB,KAAKqa,WAAWzG,QACX,GAAI4H,EACTxb,KAAK6Z,WAAWjG,EAAK4H,QAChB,GAAIlI,EAAKqI,WACd3b,KAAKqa,WAAWzG,GAChBN,EAAKqI,WAAW/H,EAAK5T,KAAKsY,OAAO9U,QAAQd,kBAAQ3B,UAAQf,EAAKma,WAAWpZ,UACpE,CACLxC,IAAIqd,EAAatI,EAAKuI,eACG,iBAAdD,EAAwBA,EAAahI,EAAIkI,cAAcF,GACpC,mBAAdA,IAA0BA,EAAaA,EAAWhI,IAC7DgI,IAAYA,EAAahI,GAC9B5T,KAAK+b,WAAWnI,EAAKgI,GAAY,GACjC5b,KAAK+T,OAAO6H,EAAYX,GAEtBA,IAAQjb,KAAKib,KAAKS,GAAU1b,KAAKuY,QACjClN,GAAMrL,KAAK8Z,kBAAkBzO,EAAMqQ,iBAOzC3H,gBAAOzT,EAAQ2a,EAAM7S,EAAYC,GAE/B,IADA9J,IAAIyD,EAAQoG,GAAc,EACjBwL,EAAMxL,EAAa9H,EAAO0b,WAAW5T,GAAc9H,EAAOkB,WAC1DjB,EAAkB,MAAZ8H,EAAmB,KAAO/H,EAAO0b,WAAW3T,GACtDuL,GAAOrT,EAAKqT,EAAMA,EAAI8G,cAAe1Y,EACxChC,KAAKic,YAAY3b,EAAQ0B,GACzBhC,KAAKqZ,OAAOzF,GACRqH,GAAQhG,GAAUpC,eAAee,EAAIsG,SAASM,gBAChDxa,KAAKib,KAAKA,GAEdjb,KAAKic,YAAY3b,EAAQ0B,iBAM3Bka,mBAAUnb,GAER,IADAxC,IAAI4d,EAAOlB,EACFnU,EAAQ9G,KAAKuY,KAAMzR,GAAS,EAAGA,IAAS,CAC/CvI,IAAI6d,EAAKpc,KAAKgE,MAAM8C,GAChBvE,EAAQ6Z,EAAGzM,aAAa5O,GAC5B,GAAIwB,KAAW4Z,GAASA,EAAMrc,OAASyC,EAAMzC,UAC3Cqc,EAAQ5Z,EACR0Y,EAAOmB,GACF7Z,EAAMzC,QAAQ,MAErB,GAAIsc,EAAGzE,MAAO,MAEhB,IAAKwE,EAAO,OAAO,EACnBnc,KAAKib,KAAKA,GACV,IAAK1c,IAAIC,EAAI,EAAGA,EAAI2d,EAAMrc,OAAQtB,IAChCwB,KAAKqc,WAAWF,EAAM3d,GAAI,MAAM,GAClC,OAAO,gBAKT2b,oBAAWpZ,GACT,GAAIA,EAAK+I,UAAY9J,KAAK+Y,aAAe/Y,KAAKoZ,IAAI9U,KAAM,CACtD/F,IAAI+d,EAAQtc,KAAKuc,uBACbD,GAAOtc,KAAKqc,WAAWC,GAE7B,GAAItc,KAAKkc,UAAUnb,GAAO,CACxBf,KAAKwc,aACLje,IAAI6a,EAAMpZ,KAAKoZ,IACfA,EAAIlB,aAAanX,EAAKuD,MAClB8U,EAAIpN,QAAOoN,EAAIpN,MAAQoN,EAAIpN,MAAMS,UAAU1L,EAAKuD,OAEpD,IADA/F,IAAIkH,EAAQ2T,EAAIxB,YACPpZ,EAAI,EAAGA,EAAIuC,EAAK0E,MAAM3F,OAAQtB,IAChC4a,EAAI9U,OAAQ8U,EAAI9U,KAAKiO,eAAexR,EAAK0E,MAAMjH,GAAG8F,QACrDmB,EAAQ1E,EAAK0E,MAAMjH,GAAGsG,SAASW,IAEnC,OADA2T,EAAIna,QAAQyC,KAAKX,EAAKsK,KAAK5F,KACpB,EAET,OAAO,gBAMTgW,eAAMnX,EAAML,EAAOwY,GACjBle,IAAIme,EAAK1c,KAAKkc,UAAU5X,EAAKoB,OAAOzB,IAEpC,OADIyY,GAAI1c,KAAKqc,WAAW/X,EAAML,GAAO,EAAMwY,GACpCC,gBAITL,oBAAW/X,EAAML,EAAO0T,EAAO8E,GAC7Bzc,KAAKwc,aACLje,IAAI6a,EAAMpZ,KAAKoZ,IACfA,EAAIlB,aAAa5T,GACjB8U,EAAIpN,MAAQoN,EAAIpN,OAASoN,EAAIpN,MAAMS,UAAUnI,EAAML,GACnD1F,IAAIqU,EAAwB,MAAd6J,GAAmC,EAAdrD,EAAIxG,QAA2B2E,GAAakF,GAzTd,EA0T5DrD,EAAIxG,SAAkD,GAAtBwG,EAAIna,QAAQa,SAAa8S,GA1TG,GA2TjE5S,KAAKgE,MAAMtC,KAAK,IAAI+V,GAAYnT,EAAML,EAAOmV,EAAIxB,YAAawB,EAAI1B,aAAcC,EAAO,KAAM/E,IAC7F5S,KAAKuY,qBAKPiE,oBAAWrW,GACT5H,IAAIC,EAAIwB,KAAKgE,MAAMlE,OAAS,EAC5B,GAAItB,EAAIwB,KAAKuY,KAAM,CACjB,KAAO/Z,EAAIwB,KAAKuY,KAAM/Z,IAAKwB,KAAKgE,MAAMxF,EAAI,GAAGS,QAAQyC,KAAK1B,KAAKgE,MAAMxF,GAAGwV,OAAO7N,IAC/EnG,KAAKgE,MAAMlE,OAASE,KAAKuY,KAAO,iBAIpCvE,kBAGE,OAFAhU,KAAKuY,KAAO,EACZvY,KAAKwc,WAAWxc,KAAKwY,QACdxY,KAAKgE,MAAM,GAAGgQ,OAAOhU,KAAKwY,QAAUxY,KAAK4S,QAAQ+J,uBAG1D1B,cAAK9a,GACH,IAAK5B,IAAIC,EAAIwB,KAAKuY,KAAM/Z,GAAK,EAAGA,IAAK,GAAIwB,KAAKgE,MAAMxF,IAAM2B,EAExD,YADAH,KAAKuY,KAAO/Z,IAKhBwQ,GAAI4N,0BACF5c,KAAKwc,aAEL,IADAje,IAAID,EAAM,EACDE,EAAIwB,KAAKuY,KAAM/Z,GAAK,EAAGA,IAAK,CAEnC,IADAD,IAAIU,EAAUe,KAAKgE,MAAMxF,GAAGS,QACnBD,EAAIC,EAAQa,OAAS,EAAGd,GAAK,EAAGA,IACvCV,GAAOW,EAAQD,GAAGI,SAChBZ,GAAGF,IAET,OAAOA,gBAGT2d,qBAAY3b,EAAQ6D,GAClB,GAAInE,KAAK6Y,KAAM,IAAKta,IAAIC,EAAI,EAAGA,EAAIwB,KAAK6Y,KAAK/Y,OAAQtB,IAC/CwB,KAAK6Y,KAAKra,GAAGuC,MAAQT,GAAUN,KAAK6Y,KAAKra,GAAG2F,QAAUA,IACxDnE,KAAK6Y,KAAKra,GAAGF,IAAM0B,KAAK4c,0BAI9BvC,oBAAW/Z,GACT,GAAIN,KAAK6Y,KAAM,IAAKta,IAAIC,EAAI,EAAGA,EAAIwB,KAAK6Y,KAAK/Y,OAAQtB,IAC3B,MAApBwB,KAAK6Y,KAAKra,GAAGF,KAAkC,GAAnBgC,EAAOuM,UAAiBvM,EAAOuc,SAAS7c,KAAK6Y,KAAKra,GAAGuC,QACnFf,KAAK6Y,KAAKra,GAAGF,IAAM0B,KAAK4c,0BAI9Bb,oBAAWzb,EAAQrB,EAASsK,GAC1B,GAAIjJ,GAAUrB,GAAWe,KAAK6Y,KAAM,IAAKta,IAAIC,EAAI,EAAGA,EAAIwB,KAAK6Y,KAAK/Y,OAAQtB,IAAK,CAC7E,GAAwB,MAApBwB,KAAK6Y,KAAKra,GAAGF,KAAkC,GAAnBgC,EAAOuM,UAAiBvM,EAAOuc,SAAS7c,KAAK6Y,KAAKra,GAAGuC,MACzE9B,EAAQ6d,wBAAwB9c,KAAK6Y,KAAKra,GAAGuC,OAC5CwI,EAAS,EAAI,KACtBvJ,KAAK6Y,KAAKra,GAAGF,IAAM0B,KAAK4c,2BAKhCxC,oBAAW2C,GACT,GAAI/c,KAAK6Y,KAAM,IAAKta,IAAIC,EAAI,EAAGA,EAAIwB,KAAK6Y,KAAK/Y,OAAQtB,IAC/CwB,KAAK6Y,KAAKra,GAAGuC,MAAQgc,IACvB/c,KAAK6Y,KAAKra,GAAGF,IAAM0B,KAAK4c,YAAcG,EAAShD,UAAUja,OAASE,KAAK6Y,KAAKra,GAAG2F,uBAOrFmQ,wBAAeT,cACb,GAAIA,EAAQ9F,QAAQ,MAAQ,EAC1B,OAAO8F,EAAQtD,MAAM,YAAYmD,KAAK1T,KAAKsU,eAAgBtU,MAE7DzB,IAAIye,EAAQnJ,EAAQtD,MAAM,KACtB0M,EAASjd,KAAK4S,QAAQiB,QACtBqJ,IAAWld,KAAKwY,QAAYyE,GAAUA,EAAO3c,OAAOgE,MAAQtE,KAAKgE,MAAM,GAAGM,MAC1E6Y,IAAaF,EAASA,EAAOnW,MAAQ,EAAI,IAAMoW,EAAU,EAAI,GAC7DlR,WAASxN,EAAGsI,GACd,KAAOtI,GAAK,EAAGA,IAAK,CAClBD,IAAI6e,EAAOJ,EAAMxe,GACjB,GAAY,IAAR4e,EAAY,CACd,GAAI5e,GAAKwe,EAAMld,OAAS,GAAU,GAALtB,EAAQ,SACrC,KAAOsI,GAASqW,EAAUrW,IACxB,GAAIkF,EAAMxN,EAAI,EAAGsI,GAAQ,OAAO,EAClC,OAAO,EAEPvI,IAAIwL,EAAOjD,EAAQ,GAAe,GAATA,GAAcoW,EAAWld,EAAKgE,MAAM8C,GAAOxC,KAC9D2Y,GAAUnW,GAASqW,EAAWF,EAAOlc,KAAK+F,EAAQqW,GAAU7Y,KAC5D,KACN,IAAKyF,GAASA,EAAKzE,MAAQ8X,IAAsC,GAA9BrT,EAAK+G,OAAO/C,QAAQqP,GACrD,OAAO,EACTtW,IAGJ,OAAO,GAET,OAAOkF,EAAMgR,EAAMld,OAAS,EAAGE,KAAKuY,oBAGtCgE,gCACEhe,IAAI8e,EAAWrd,KAAK4S,QAAQiB,QAC5B,GAAIwJ,EAAU,IAAK9e,IAAI4L,EAAIkT,EAASvW,MAAOqD,GAAK,EAAGA,IAAK,CACtD5L,IAAI+e,EAAQD,EAAStc,KAAKoJ,GAAG4B,eAAesR,EAAS/T,WAAWa,IAAI8E,YACpE,GAAIqO,GAASA,EAAM3R,aAAe2R,EAAMlS,aAAc,OAAOkS,EAE/D,IAAK/e,IAAI+G,KAAQtF,KAAKsY,OAAO9U,OAAOQ,MAAO,CACzCzF,IAAI+F,EAAOtE,KAAKsY,OAAO9U,OAAOQ,MAAMsB,GACpC,GAAIhB,EAAKqH,aAAerH,EAAK8G,aAAc,OAAO9G,iBAItDsV,wBAAevO,GACb9M,IAAIgE,EA8ER,SAA2B8I,EAAMtG,GAC/B,IAAKxG,IAAIC,EAAI,EAAGA,EAAIuG,EAAIjF,OAAQtB,IAC9B,GAAI6M,EAAK/I,GAAGyC,EAAIvG,IAAK,OAAOuG,EAAIvG,GAhFpB+e,CAAkBlS,EAAMrL,KAAKoZ,IAAI1B,cACzCnV,GAAOvC,KAAKoZ,IAAIvB,WAAWnW,KAAKa,GACpCvC,KAAKoZ,IAAI1B,aAAerM,EAAKvG,SAAS9E,KAAKoZ,IAAI1B,4BAGjDoC,2BAAkBzO,EAAMmS,GACtB,IAAKjf,IAAIuI,EAAQ9G,KAAKuY,KAAMzR,GAAS,EAAGA,IAAS,CAC/CvI,IAAIkf,EAAQzd,KAAKgE,MAAM8C,GAEvB,GADY2W,EAAM/F,aAAagG,YAAYrS,IAC9B,EACXoS,EAAM/F,aAAerM,EAAKlG,cAAcsY,EAAM/F,kBACzC,CACL+F,EAAM7F,YAAcvM,EAAKlG,cAAcsY,EAAM7F,aAC7CrZ,IAAIof,EAAYF,EAAMxF,iBAAiB5M,GACnCsS,GAAaF,EAAMnZ,MAAQmZ,EAAMnZ,KAAKiO,eAAeoL,EAAUrZ,QACjEmZ,EAAM7F,YAAc+F,EAAU7Y,SAAS2Y,EAAM7F,cAEjD,GAAI6F,GAASD,EAAM,qDChtBZI,GASX,SAAY5Z,EAAOyB,GAGjBzF,KAAKgE,MAAQA,GAAS,GAGtBhE,KAAKyF,MAAQA,GAAS,IAmJ1B,SAASoY,GAAYxY,GACnB9G,IAAIqD,EAAS,GACb,IAAKrD,IAAI+G,KAAQD,EAAK,CACpB9G,IAAIuf,EAAQzY,EAAIC,GAAMyD,KAAK+U,MACvBA,IAAOlc,EAAO0D,GAAQwY,GAE5B,OAAOlc,EAGT,SAASyH,GAAIuJ,GAEX,OAAOA,EAAQmL,UAAYC,OAAOD,sBAtJlCE,2BAAkBtV,EAAUiK,EAAc5K,6BAAJ,IAC/BA,IAAQA,EAASqB,GAAIuJ,GAASsL,0BAEnC3f,IAAI6a,EAAMpR,EAAQ8H,EAAS,KA4B3B,OA3BAnH,EAASjG,kBAAQ3B,GACf,GAAI+O,GAAU/O,EAAK0E,MAAM3F,OAAQ,CAC1BgQ,IAAQA,EAAS,IAEtB,IADAvR,IAAI4f,EAAO,EAAGC,EAAW,EAClBD,EAAOrO,EAAOhQ,QAAUse,EAAWrd,EAAK0E,MAAM3F,QAAQ,CAC3DvB,IAAIwL,EAAOhJ,EAAK0E,MAAM2Y,GACtB,GAAKpe,EAAKyF,MAAMsE,EAAKzF,KAAKgB,MAA1B,CACA,IAAKyE,EAAKzH,GAAGwN,EAAOqO,MAAsC,IAA5BpU,EAAKzF,KAAKyE,KAAKsV,SAAoB,MACjEF,GAAQ,EAAGC,SAFwBA,IAIrC,KAAOD,EAAOrO,EAAOhQ,QACnBsZ,EAAMtJ,EAAOU,MACbV,EAAOU,MAET,KAAO4N,EAAWrd,EAAK0E,MAAM3F,QAAQ,CACnCvB,IAAI+f,EAAMvd,EAAK0E,MAAM2Y,KACjBG,EAAUve,EAAKwe,cAAcF,EAAKvd,EAAK+I,SAAU8I,GACjD2L,IACFzO,EAAOpO,KAAK4c,EAAKlF,GACjBA,EAAIuB,YAAY4D,EAAQ3K,KACxBwF,EAAMmF,EAAQ3C,YAAc2C,EAAQ3K,MAI1CwF,EAAIuB,YAAY3a,EAAKye,cAAc1d,EAAM6R,OAGpC5K,gBASTyW,uBAAc1d,EAAM6R,kBAAU,UAExBgL,GAAcc,WAAWrV,GAAIuJ,GAAU5S,KAAKgE,MAAMjD,EAAKuD,KAAKgB,MAAMvE,2BACtE,GAAI6a,EAAY,CACd,GAAI7a,EAAKE,OACP,MAAM,IAAIuB,WAAW,gDACnBoQ,EAAQ+L,UACV/L,EAAQ+L,UAAU5d,EAAM6a,EAAYhJ,GAEpC5S,KAAKie,kBAAkBld,EAAK9B,QAAS2T,EAASgJ,GAElD,OAAOhI,gBAGTgL,+BAAsB7d,EAAM6R,kBAAU,IAEpC,IADArU,IAAIqV,EAAM5T,KAAKye,cAAc1d,EAAM6R,GAC1BpU,EAAIuC,EAAK0E,MAAM3F,OAAS,EAAGtB,GAAK,EAAGA,IAAK,CAC/CD,IAAIwZ,EAAO/X,KAAKwe,cAAczd,EAAK0E,MAAMjH,GAAIuC,EAAK+I,SAAU8I,GACxDmF,KACAA,EAAK6D,YAAc7D,EAAKnE,KAAK+G,YAAY/G,GAC3CA,EAAMmE,EAAKnE,KAGf,OAAOA,gBAGT4K,uBAAcnT,EAAMgF,EAAQuC,kBAAU,IACpCrU,IAAIuf,EAAQ9d,KAAKyF,MAAM4F,EAAK/G,KAAKgB,MACjC,OAAOwY,GAASF,GAAcc,WAAWrV,GAAIuJ,GAAUkL,EAAMzS,EAAMgF,KAOrEuN,GAAOc,oBAAWrV,EAAKwV,EAAWC,GAChC,kBADwC,MAChB,iBAAbD,EACT,MAAO,CAACjL,IAAKvK,EAAIkS,eAAesD,IAClC,GAA0B,MAAtBA,EAAUhS,SACZ,MAAO,CAAC+G,IAAKiL,GACf,GAAIA,EAAUjL,KAAiC,MAA1BiL,EAAUjL,IAAI/G,SACjC,OAAOgS,EACTtgB,IAAIwgB,EAAUF,EAAU,GAAIG,EAAQD,EAAQhR,QAAQ,KAChDiR,EAAQ,IACVF,EAAQC,EAAQ/d,MAAM,EAAGge,GACzBD,EAAUA,EAAQ/d,MAAMge,EAAQ,IAElCzgB,IAAIqd,EAAa,KAAMhI,EAAMkL,EAAQzV,EAAI4V,gBAAgBH,EAAOC,GAAW1V,EAAI6V,cAAcH,GACzF9a,EAAQ4a,EAAU,GAAIre,EAAQ,EAClC,GAAIyD,GAAyB,iBAATA,GAAuC,MAAlBA,EAAM4I,WAAqBnJ,MAAMC,QAAQM,GAEhF,IAAK1F,IAAI+G,KADT9E,EAAQ,EACSyD,EAAO,GAAmB,MAAfA,EAAMqB,GAAe,CAC/C/G,IAAIygB,EAAQ1Z,EAAKyI,QAAQ,KACrBiR,EAAQ,EAAGpL,EAAIuL,eAAe7Z,EAAKtE,MAAM,EAAGge,GAAQ1Z,EAAKtE,MAAMge,EAAQ,GAAI/a,EAAMqB,IAChFsO,EAAIwL,aAAa9Z,EAAMrB,EAAMqB,IAGtC,IAAK/G,IAAIC,EAAIgC,EAAOhC,EAAIqgB,EAAU/e,OAAQtB,IAAK,CAC7CD,IAAII,EAAQkgB,EAAUrgB,GACtB,GAAc,IAAVG,EAAa,CACf,GAAIH,EAAIqgB,EAAU/e,OAAS,GAAKtB,EAAIgC,EAClC,MAAM,IAAIgC,WAAW,0DACvB,MAAO,KAACoR,EAAKgI,WAAYhI,SAEoBgK,GAAcc,WAAWrV,EAAK1K,EAAOmgB,0BAElF,GADAlL,EAAI+G,YAAYxb,GACZkgB,EAAc,CAChB,GAAIzD,EAAY,MAAM,IAAIpZ,WAAW,0BACrCoZ,EAAayD,GAInB,MAAO,KAACzL,aAAKgI,IAMfgC,GAAO7I,oBAAWvR,GAChB,OAAOA,EAAOoH,OAAO0U,gBAClB9b,EAAOoH,OAAO0U,cAAgB,IAAI1B,GAAc5d,KAAKuf,gBAAgB/b,GAASxD,KAAKwf,gBAAgBhc,MAMxGoa,GAAO2B,yBAAgB/b,GACrBjF,IAAIqD,EAASic,GAAYra,EAAOQ,OAEhC,OADKpC,EAAO7C,OAAM6C,EAAO7C,cAAOgC,UAAQA,EAAKhC,OACtC6C,GAKTgc,GAAO4B,yBAAgBhc,GACrB,OAAOqa,GAAYra,EAAOiC,QCtJ9BvB,IACMub,GAAW7f,KAAK8f,IAAI,EAAG,IAG7B,SAASC,GAAalc,GAAS,OAJf,MAIsBA,MAKzBmc,GACX,SAAYthB,EAAKuhB,EAAiBC,mBAAP,kBAAiB,MAE1C9f,KAAK1B,IAAMA,EAGX0B,KAAK6f,QAAUA,EACf7f,KAAK8f,QAAUA,GASNC,GAKX,SAAYC,EAAQC,mBAAW,GAC7BjgB,KAAKggB,OAASA,EACdhgB,KAAKigB,SAAWA,gBAGlBH,iBAAQrc,GACNlF,IAAI2hB,EAAO,EAAGle,EAAQ2d,GAAalc,GACnC,IAAKzD,KAAKigB,SAAU,IAAK1hB,IAAIC,EAAI,EAAGA,EAAIwD,EAAOxD,IAC7C0hB,GAAQlgB,KAAKggB,OAAW,EAAJxhB,EAAQ,GAAKwB,KAAKggB,OAAW,EAAJxhB,EAAQ,GACvD,OAAOwB,KAAKggB,OAAe,EAARhe,GAAake,EAlCpC,SAAuBzc,GAAS,OAAQA,GALxB,MAKiCA,IAAoBgc,GAkC1BU,CAAc1c,iBAIvD2c,mBAAU9hB,EAAK+hB,GAAa,sBAAL,GAAYrgB,KAAKsgB,KAAKhiB,EAAK+hB,GAAO,iBAGzDhd,aAAI/E,EAAK+hB,GAAa,sBAAL,GAAYrgB,KAAKsgB,KAAKhiB,EAAK+hB,GAAO,iBAEnDC,cAAKhiB,EAAK+hB,EAAOE,GAEf,IADAhiB,IAAI2hB,EAAO,EAAGM,EAAWxgB,KAAKigB,SAAW,EAAI,EAAGQ,EAAWzgB,KAAKigB,SAAW,EAAI,EACtEzhB,EAAI,EAAGA,EAAIwB,KAAKggB,OAAOlgB,OAAQtB,GAAK,EAAG,CAC9CD,IAAIiC,EAAQR,KAAKggB,OAAOxhB,IAAMwB,KAAKigB,SAAWC,EAAO,GACrD,GAAI1f,EAAQlC,EAAK,MACjBC,IAAImiB,EAAU1gB,KAAKggB,OAAOxhB,EAAIgiB,GAAWG,EAAU3gB,KAAKggB,OAAOxhB,EAAIiiB,GAAWlgB,EAAMC,EAAQkgB,EAC5F,GAAIpiB,GAAOiC,EAAK,CACdhC,IACIqD,EAASpB,EAAQ0f,IADTQ,EAAkBpiB,GAAOkC,GAAS,EAAIlC,GAAOiC,EAAM,EAAI8f,EAA7CA,GACc,EAAI,EAAIM,GAC5C,GAAIJ,EAAQ,OAAO3e,EACnBrD,IAAIuhB,EAAUxhB,IAAQ+hB,EAAQ,EAAI7f,EAAQD,GAAO,KAAmB/B,EAAI,GAAGF,EAAMkC,GAvD3Bif,GAwDtD,OAAO,IAAIG,GAAUhe,EAAQye,EAAQ,EAAI/hB,GAAOkC,EAAQlC,GAAOiC,EAAKuf,GAEtEI,GAAQS,EAAUD,EAEpB,OAAOH,EAASjiB,EAAM4hB,EAAO,IAAIN,GAAUthB,EAAM4hB,iBAGnDU,iBAAQtiB,EAAKwhB,GAGX,IAFAvhB,IAAI2hB,EAAO,EAAGle,EAAQ2d,GAAaG,GAC/BU,EAAWxgB,KAAKigB,SAAW,EAAI,EAAGQ,EAAWzgB,KAAKigB,SAAW,EAAI,EAC5DzhB,EAAI,EAAGA,EAAIwB,KAAKggB,OAAOlgB,OAAQtB,GAAK,EAAG,CAC9CD,IAAIiC,EAAQR,KAAKggB,OAAOxhB,IAAMwB,KAAKigB,SAAWC,EAAO,GACrD,GAAI1f,EAAQlC,EAAK,MACjBC,IAAImiB,EAAU1gB,KAAKggB,OAAOxhB,EAAIgiB,GAC9B,GAAIliB,GAD2CkC,EAAQkgB,GACrCliB,GAAa,EAARwD,EAAW,OAAO,EACzCke,GAAQlgB,KAAKggB,OAAOxhB,EAAIiiB,GAAYC,EAEtC,OAAO,gBAMThe,iBAAQtC,GAEN,IADA7B,IAAIiiB,EAAWxgB,KAAKigB,SAAW,EAAI,EAAGQ,EAAWzgB,KAAKigB,SAAW,EAAI,EAC5DzhB,EAAI,EAAG0hB,EAAO,EAAG1hB,EAAIwB,KAAKggB,OAAOlgB,OAAQtB,GAAK,EAAG,CACxDD,IAAIiC,EAAQR,KAAKggB,OAAOxhB,GAAIqiB,EAAWrgB,GAASR,KAAKigB,SAAWC,EAAO,GAAIY,EAAWtgB,GAASR,KAAKigB,SAAW,EAAIC,GAC/GQ,EAAU1gB,KAAKggB,OAAOxhB,EAAIgiB,GAAWG,EAAU3gB,KAAKggB,OAAOxhB,EAAIiiB,GACnErgB,EAAEygB,EAAUA,EAAWH,EAASI,EAAUA,EAAWH,GACrDT,GAAQS,EAAUD,iBAOtBK,kBACE,OAAO,IAAIhB,GAAQ/f,KAAKggB,QAAShgB,KAAKigB,wBAGxChd,oBACE,OAAQjD,KAAKigB,SAAW,IAAM,IAAMe,KAAKC,UAAUjhB,KAAKggB,SAO1DD,GAAO5b,gBAAOb,GACZ,OAAY,GAALA,EAASyc,GAAQje,MAAQ,IAAIie,GAAQzc,EAAI,EAAI,CAAC,GAAIA,EAAG,GAAK,CAAC,EAAG,EAAGA,KAI5Eyc,GAAQje,MAAQ,IAAIie,GAAQ,QASfmB,GAGX,SAAYC,EAAMC,EAAQlhB,EAAMC,GAG9BH,KAAKmhB,KAAOA,GAAQ,GAIpBnhB,KAAKE,KAAOA,GAAQ,EAGpBF,KAAKG,GAAW,MAANA,EAAaH,KAAKmhB,KAAKrhB,OAASK,EAC1CH,KAAKohB,OAASA,GCjKX,SAASC,GAAe7c,GAC7BjG,IAAIkG,EAAMC,MAAMC,KAAK3E,KAAMwE,GAE3B,OADAC,EAAIG,UAAYyc,GAAexc,UACxBJ,eDmKPzD,eAAMd,EAAUC,GACd,sBADW,kBAAQH,KAAKmhB,KAAKrhB,QACtB,IAAIohB,GAAQlhB,KAAKmhB,KAAMnhB,KAAKohB,OAAQlhB,EAAMC,iBAGnD+B,gBACE,OAAO,IAAIgf,GAAQlhB,KAAKmhB,KAAKngB,QAAShB,KAAKohB,QAAUphB,KAAKohB,OAAOpgB,QAAShB,KAAKE,KAAMF,KAAKG,kBAO5FmhB,mBAAUje,EAAKke,GACbvhB,KAAKG,GAAKH,KAAKmhB,KAAKzf,KAAK2B,GACV,MAAXke,GAAiBvhB,KAAKwhB,UAAUxhB,KAAKmhB,KAAKrhB,OAAS,EAAGyhB,iBAM5DE,uBAAcC,GACZ,IAAKnjB,IAAIC,EAAI,EAAGmjB,EAAY3hB,KAAKmhB,KAAKrhB,OAAQtB,EAAIkjB,EAAQP,KAAKrhB,OAAQtB,IAAK,CAC1ED,IAAIqjB,EAAOF,EAAQG,UAAUrjB,GAC7BwB,KAAKshB,UAAUI,EAAQP,KAAK3iB,GAAY,MAARojB,GAAgBA,EAAOpjB,EAAImjB,EAAYC,EAAO,qBAQlFC,mBAAUve,GACR,GAAItD,KAAKohB,OAAQ,IAAK7iB,IAAIC,EAAI,EAAGA,EAAIwB,KAAKohB,OAAOthB,OAAQtB,IACvD,GAAIwB,KAAKohB,OAAO5iB,IAAM8E,EAAG,OAAOtD,KAAKohB,OAAO5iB,GAAKA,EAAI,GAAK,EAAI,kBAGlEgjB,mBAAUle,EAAG8M,GACNpQ,KAAKohB,SAAQphB,KAAKohB,OAAS,IAChCphB,KAAKohB,OAAO1f,KAAK4B,EAAG8M,iBAKtB0R,+BAAsBJ,GACpB,IAAKnjB,IAAIC,EAAIkjB,EAAQP,KAAKrhB,OAAS,EAAGiiB,EAAY/hB,KAAKmhB,KAAKrhB,OAAS4hB,EAAQP,KAAKrhB,OAAQtB,GAAK,EAAGA,IAAK,CACrGD,IAAIqjB,EAAOF,EAAQG,UAAUrjB,GAC7BwB,KAAKshB,UAAUI,EAAQP,KAAK3iB,GAAGuiB,SAAkB,MAARa,GAAgBA,EAAOpjB,EAAIujB,EAAYH,EAAO,EAAI,qBAM/Fb,kBACExiB,IAAIyjB,EAAU,IAAId,GAElB,OADAc,EAAQF,sBAAsB9hB,MACvBgiB,gBAKT3e,aAAI/E,EAAK+hB,GACP,kBADe,GACXrgB,KAAKohB,OAAQ,OAAOphB,KAAKsgB,KAAKhiB,EAAK+hB,GAAO,GAC9C,IAAK9hB,IAAIC,EAAIwB,KAAKE,KAAM1B,EAAIwB,KAAKG,GAAI3B,IACnCF,EAAM0B,KAAKmhB,KAAK3iB,GAAG6E,IAAI/E,EAAK+hB,GAC9B,OAAO/hB,gBAMT8hB,mBAAU9hB,EAAK+hB,GAAa,sBAAL,GAAYrgB,KAAKsgB,KAAKhiB,EAAK+hB,GAAO,iBAEzDC,cAAKhiB,EAAK+hB,EAAOE,GAGf,IAFAhiB,IAAIshB,GAAU,EAELrhB,EAAIwB,KAAKE,KAAM1B,EAAIwB,KAAKG,GAAI3B,IAAK,CACxCD,IAAwBqD,EAAd5B,KAAKmhB,KAAK3iB,GAAiB4hB,UAAU9hB,EAAK+hB,GACpD,GAAsB,MAAlBze,EAAOke,QAAiB,CAC1BvhB,IAAI0jB,EAAOjiB,KAAK6hB,UAAUrjB,GAC1B,GAAY,MAARyjB,GAAgBA,EAAOzjB,GAAKyjB,EAAOjiB,KAAKG,GAAI,CAC9C3B,EAAIyjB,EACJ3jB,EAAM0B,KAAKmhB,KAAKc,GAAMnC,QAAQle,EAAOke,SACrC,UAIAle,EAAOie,UAASA,GAAU,GAC9BvhB,EAAMsD,EAAOtD,IAGf,OAAOiiB,EAASjiB,EAAM,IAAIshB,GAAUthB,EAAKuhB,IC1P7CwB,GAAexc,UAAYkB,OAAOL,OAAOhB,MAAMG,WAC/Cwc,GAAexc,UAAUmB,YAAcqb,GACvCA,GAAexc,UAAUS,KAAO,qBAOnB4c,GAGX,SAAY7Y,GAIVrJ,KAAKqJ,IAAMA,EAGXrJ,KAAKmiB,MAAQ,GAGbniB,KAAKoiB,KAAO,GAGZpiB,KAAK0hB,QAAU,IAAIR,+DC7BvB,SAASmB,KAAiB,MAAM,IAAI3d,MAAM,kBDiCpC6E,sBAAW,OAAOvJ,KAAKoiB,KAAKtiB,OAASE,KAAKoiB,KAAK,GAAKpiB,KAAKqJ,kBAK7DiZ,cAAKnL,GACH5Y,IAAIqD,EAAS5B,KAAKuiB,UAAUpL,GAC5B,GAAIvV,EAAO4gB,OAAQ,MAAM,IAAInB,GAAezf,EAAO4gB,QACnD,OAAOxiB,mBAMTuiB,mBAAUD,GACR/jB,IAAIqD,EAAS0gB,EAAKG,MAAMziB,KAAKqJ,KAE7B,OADKzH,EAAO4gB,QAAQxiB,KAAK0iB,QAAQJ,EAAM1gB,EAAOyH,KACvCzH,MAML+gB,0BACF,OAAO3iB,KAAKmiB,MAAMriB,OAAS,gBAG7B4iB,iBAAQJ,EAAMjZ,GACZrJ,KAAKoiB,KAAK1gB,KAAK1B,KAAKqJ,KACpBrJ,KAAKmiB,MAAMzgB,KAAK4gB,GAChBtiB,KAAK0hB,QAAQJ,UAAUgB,EAAKM,UAC5B5iB,KAAKqJ,IAAMA,4CC9DfnF,IAAM2e,GAAY9c,OAAOL,OAAO,MAWnBod,6BAMXL,eAAMM,GAAQ,OAAOV,mBAMrBO,kBAAW,OAAO7C,GAAQje,oBAK1Bif,gBAAOgC,GAAQ,OAAOV,mBAMtBhf,aAAI2f,GAAY,OAAOX,mBAMvBY,eAAMC,GAAU,OAAO,mBAOvB9f,kBAAW,OAAOif,MAKlBS,GAAOvf,kBAASC,EAAQgC,GACtB,IAAKA,IAASA,EAAK2d,SAAU,MAAM,IAAI3gB,WAAW,mCAClDjE,IAAI+F,EAAOue,GAAUrd,EAAK2d,UAC1B,IAAK7e,EAAM,MAAM,IAAI9B,2BAA2BgD,uBAChD,OAAOlB,EAAKf,SAASC,EAAQgC,IAQ/Bsd,GAAOM,gBAAOC,EAAIC,GAChB,GAAID,KAAMR,GAAW,MAAM,IAAIrgB,WAAW,iCAAmC6gB,GAG7E,OAFAR,GAAUQ,GAAMC,EAChBA,EAAUze,UAAUue,OAASC,EACtBC,OAMEC,GAEX,SAAYla,EAAKmZ,GAEfxiB,KAAKqJ,IAAMA,EAEXrJ,KAAKwiB,OAASA,GAKhBe,GAAO7G,YAAGrT,GAAO,OAAO,IAAIka,GAAWla,EAAK,OAI5Cka,GAAOC,cAAKhf,GAAW,OAAO,IAAI+e,GAAW,KAAM/e,IAMnD+e,GAAOE,qBAAYpa,EAAKnJ,EAAMC,EAAIa,GAChC,IACE,OAAOuiB,GAAW7G,GAAGrT,EAAI1C,QAAQzG,EAAMC,EAAIa,IAC3C,MAAO0iB,GACP,GAAIA,aAAanf,EAAc,OAAOgf,GAAWC,KAAKE,EAAElf,SACxD,MAAMkf,QCpGCC,eASX,WAAYzjB,EAAMC,EAAIa,EAAO6d,GAC3B+E,aACA5jB,KAAKE,KAAOA,EACZF,KAAKG,GAAKA,EACVH,KAAKgB,MAAQA,EACbhB,KAAK6e,YAAcA,4GAGrB4D,eAAMpZ,GACJ,OAAIrJ,KAAK6e,WAAagF,GAAexa,EAAKrJ,KAAKE,KAAMF,KAAKG,IACjDojB,GAAWC,KAAK,6CAClBD,GAAWE,YAAYpa,EAAKrJ,KAAKE,KAAMF,KAAKG,GAAIH,KAAKgB,oBAG9D4hB,kBACE,OAAO,IAAI7C,GAAQ,CAAC/f,KAAKE,KAAMF,KAAKG,GAAKH,KAAKE,KAAMF,KAAKgB,MAAM9B,oBAGjE6hB,gBAAO1X,GACL,OAAO,IAAIsa,EAAY3jB,KAAKE,KAAMF,KAAKE,KAAOF,KAAKgB,MAAM9B,KAAMmK,EAAIrI,MAAMhB,KAAKE,KAAMF,KAAKG,kBAG3FkD,aAAIqe,GACFnjB,IAAI2B,EAAOwhB,EAAQtB,UAAUpgB,KAAKE,KAAM,GAAIC,EAAKuhB,EAAQtB,UAAUpgB,KAAKG,IAAK,GAC7E,OAAID,EAAK2f,SAAW1f,EAAG0f,QAAgB,KAChC,IAAI8D,EAAYzjB,EAAK5B,IAAKsB,KAAKa,IAAIP,EAAK5B,IAAK6B,EAAG7B,KAAM0B,KAAKgB,oBAGpEiiB,eAAM7hB,GACJ,KAAMA,aAAiBuiB,IAAgBviB,EAAMyd,WAAa7e,KAAK6e,UAAW,OAAO,KAEjF,GAAI7e,KAAKE,KAAOF,KAAKgB,MAAM9B,MAAQkC,EAAMlB,MAASF,KAAKgB,MAAMmF,SAAY/E,EAAMJ,MAAMkF,UAI9E,CAAA,GAAI9E,EAAMjB,IAAMH,KAAKE,MAASF,KAAKgB,MAAMkF,WAAc9E,EAAMJ,MAAMmF,QAKxE,OAAO,KAJP5H,IAAIyC,EAAQhB,KAAKgB,MAAM9B,KAAOkC,EAAMJ,MAAM9B,MAAQ,EAAI+G,EAAMnE,MACtD,IAAImE,EAAM7E,EAAMJ,MAAM/B,QAAQkC,OAAOnB,KAAKgB,MAAM/B,SAAUmC,EAAMJ,MAAMkF,UAAWlG,KAAKgB,MAAMmF,SAClG,OAAO,IAAIwd,EAAYviB,EAAMlB,KAAMF,KAAKG,GAAIa,EAAOhB,KAAK6e,WANxDtgB,IAAIyC,EAAQhB,KAAKgB,MAAM9B,KAAOkC,EAAMJ,MAAM9B,MAAQ,EAAI+G,EAAMnE,MACtD,IAAImE,EAAMjG,KAAKgB,MAAM/B,QAAQkC,OAAOC,EAAMJ,MAAM/B,SAAUe,KAAKgB,MAAMkF,UAAW9E,EAAMJ,MAAMmF,SAClG,OAAO,IAAIwd,EAAY3jB,KAAKE,KAAMF,KAAKG,IAAMiB,EAAMjB,GAAKiB,EAAMlB,MAAOc,EAAOhB,KAAK6e,wBAUrFzb,kBACE7E,IAAIiH,EAAO,CAAC2d,SAAU,UAAWjjB,KAAMF,KAAKE,KAAMC,GAAIH,KAAKG,IAG3D,OAFIH,KAAKgB,MAAM9B,OAAMsG,EAAKxE,MAAQhB,KAAKgB,MAAMoC,UACzCpD,KAAK6e,YAAWrZ,EAAKqZ,WAAY,GAC9BrZ,GAGTme,EAAOpgB,kBAASC,EAAQgC,GACtB,GAAwB,iBAAbA,EAAKtF,MAAsC,iBAAXsF,EAAKrF,GAC9C,MAAM,IAAIqC,WAAW,0CACvB,OAAO,IAAImhB,EAAYne,EAAKtF,KAAMsF,EAAKrF,GAAI8F,EAAM1C,SAASC,EAAQgC,EAAKxE,SAAUwE,EAAKqZ,eA/DzDiE,IAmEjCA,GAAKM,OAAO,UAAWO,QAKVG,eAMX,WAAY5jB,EAAMC,EAAI4jB,EAASC,EAAOhjB,EAAOyF,EAAQoY,GACnD+E,aACA5jB,KAAKE,KAAOA,EACZF,KAAKG,GAAKA,EACVH,KAAK+jB,QAAUA,EACf/jB,KAAKgkB,MAAQA,EACbhkB,KAAKgB,MAAQA,EACbhB,KAAKyG,OAASA,EACdzG,KAAK6e,YAAcA,4GAGrB4D,eAAMpZ,GACJ,GAAIrJ,KAAK6e,YAAcgF,GAAexa,EAAKrJ,KAAKE,KAAMF,KAAK+jB,UACpCF,GAAexa,EAAKrJ,KAAKgkB,MAAOhkB,KAAKG,KAC1D,OAAOojB,GAAWC,KAAK,iDAEzBjlB,IAAI0lB,EAAM5a,EAAIrI,MAAMhB,KAAK+jB,QAAS/jB,KAAKgkB,OACvC,GAAIC,EAAI/d,WAAa+d,EAAI9d,QACvB,OAAOod,GAAWC,KAAK,2BACzBjlB,IAAI2lB,EAAWlkB,KAAKgB,MAAM0H,SAAS1I,KAAKyG,OAAQwd,EAAIhlB,SACpD,OAAKilB,EACEX,GAAWE,YAAYpa,EAAKrJ,KAAKE,KAAMF,KAAKG,GAAI+jB,GADjCX,GAAWC,KAAK,4CAIxCZ,kBACE,OAAO,IAAI7C,GAAQ,CAAC/f,KAAKE,KAAMF,KAAK+jB,QAAU/jB,KAAKE,KAAMF,KAAKyG,OAC1CzG,KAAKgkB,MAAOhkB,KAAKG,GAAKH,KAAKgkB,MAAOhkB,KAAKgB,MAAM9B,KAAOc,KAAKyG,sBAG/Esa,gBAAO1X,GACL9K,IAAI0lB,EAAMjkB,KAAKgkB,MAAQhkB,KAAK+jB,QAC5B,OAAO,IAAID,EAAkB9jB,KAAKE,KAAMF,KAAKE,KAAOF,KAAKgB,MAAM9B,KAAO+kB,EACzCjkB,KAAKE,KAAOF,KAAKyG,OAAQzG,KAAKE,KAAOF,KAAKyG,OAASwd,EACnD5a,EAAIrI,MAAMhB,KAAKE,KAAMF,KAAKG,IAAIyI,cAAc5I,KAAK+jB,QAAU/jB,KAAKE,KAAMF,KAAKgkB,MAAQhkB,KAAKE,MACxFF,KAAK+jB,QAAU/jB,KAAKE,KAAMF,KAAK6e,wBAG9Dxb,aAAIqe,GACFnjB,IAAI2B,EAAOwhB,EAAQtB,UAAUpgB,KAAKE,KAAM,GAAIC,EAAKuhB,EAAQtB,UAAUpgB,KAAKG,IAAK,GACzE4jB,EAAUrC,EAAQre,IAAIrD,KAAK+jB,SAAU,GAAIC,EAAQtC,EAAQre,IAAIrD,KAAKgkB,MAAO,GAC7E,OAAK9jB,EAAK2f,SAAW1f,EAAG0f,SAAYkE,EAAU7jB,EAAK5B,KAAO0lB,EAAQ7jB,EAAG7B,IAAY,KAC1E,IAAIwlB,EAAkB5jB,EAAK5B,IAAK6B,EAAG7B,IAAKylB,EAASC,EAAOhkB,KAAKgB,MAAOhB,KAAKyG,OAAQzG,KAAK6e,wBAG/Fzb,kBACE7E,IAAIiH,EAAO,CAAC2d,SAAU,gBAAiBjjB,KAAMF,KAAKE,KAAMC,GAAIH,KAAKG,GACrD4jB,QAAS/jB,KAAK+jB,QAASC,MAAOhkB,KAAKgkB,MAAOvd,OAAQzG,KAAKyG,QAGnE,OAFIzG,KAAKgB,MAAM9B,OAAMsG,EAAKxE,MAAQhB,KAAKgB,MAAMoC,UACzCpD,KAAK6e,YAAWrZ,EAAKqZ,WAAY,GAC9BrZ,GAGTse,EAAOvgB,kBAASC,EAAQgC,GACtB,GAAwB,iBAAbA,EAAKtF,MAAsC,iBAAXsF,EAAKrF,IACrB,iBAAhBqF,EAAKue,SAA4C,iBAAdve,EAAKwe,OAA2C,iBAAfxe,EAAKiB,OAClF,MAAM,IAAIjE,WAAW,gDACvB,OAAO,IAAIshB,EAAkBte,EAAKtF,KAAMsF,EAAKrF,GAAIqF,EAAKue,QAASve,EAAKwe,MACvC/d,EAAM1C,SAASC,EAAQgC,EAAKxE,OAAQwE,EAAKiB,SAAUjB,EAAKqZ,eA/DlDiE,IAqEvC,SAASe,GAAexa,EAAKnJ,EAAMC,GAEjC,IADA5B,IAAIqI,EAAQyC,EAAImB,QAAQtK,GAAOsG,EAAOrG,EAAKD,EAAM4G,EAAQF,EAAME,MACxDN,EAAO,GAAKM,EAAQ,GAAKF,EAAM0C,WAAWxC,IAAUF,EAAM7F,KAAK+F,GAAOrI,YAC3EqI,IACAN,IAEF,GAAIA,EAAO,EAET,IADAjI,IAAIwL,EAAOnD,EAAM7F,KAAK+F,GAAOrE,WAAWmE,EAAM0C,WAAWxC,IAClDN,EAAO,GAAG,CACf,IAAKuD,GAAQA,EAAK9I,OAAQ,OAAO,EACjC8I,EAAOA,EAAKvI,WACZgF,IAGJ,OAAO,EC9JT,SAAS2d,GAAYxb,EAAUvI,EAAGE,GAEhC,IADA/B,IAAI6lB,EAAS,GACJ5lB,EAAI,EAAGA,EAAImK,EAASlK,WAAYD,IAAK,CAC5CD,IAAII,EAAQgK,EAAShK,MAAMH,GACvBG,EAAMM,QAAQC,OAAMP,EAAQA,EAAMuD,KAAKiiB,GAAYxlB,EAAMM,QAASmB,EAAGzB,KACrEA,EAAMmL,WAAUnL,EAAQyB,EAAEzB,EAAO2B,EAAQ9B,IAC7C4lB,EAAO1iB,KAAK/C,GAEd,OAAOoB,EAAS8D,UAAUugB,GDsI5BtB,GAAKM,OAAO,gBAAiBU,IEjH7B5B,GAAUrd,UAAUwf,KAAO,SAASC,EAAOtc,GAOzC,IANK,gCAEDuc,EAAW3d,EAAM2C,OAAOzC,EAAQ,GAAI0d,EAAS3d,EAAI2C,MAAM1C,EAAQ,GAC/DtG,EAAQ+jB,EAAUhkB,EAAMikB,EAExBjb,EAASxJ,EAAS+B,MAAOoE,EAAY,EAChCiE,EAAIrD,EAAO2d,GAAY,EAAOta,EAAInC,EAAQmC,IAC7Csa,GAAa7d,EAAM5E,MAAMmI,GAAK,GAChCsa,GAAY,EACZlb,EAASxJ,EAASG,KAAK0G,EAAM7F,KAAKoJ,GAAGjI,KAAKqH,IAC1CrD,KAEA1F,IAGJ,IADAjC,IAAIiL,EAAQzJ,EAAS+B,MAAOqE,EAAU,EAC7BgE,EAAIrD,EAAO2d,GAAY,EAAOta,EAAInC,EAAQmC,IAC7Csa,GAAa5d,EAAI2C,MAAMW,EAAI,GAAKtD,EAAItG,IAAI4J,IAC1Csa,GAAY,EACZjb,EAAQzJ,EAASG,KAAK2G,EAAI9F,KAAKoJ,GAAGjI,KAAKsH,IACvCrD,KAEA5F,IAGJ,OAAOP,KAAKsiB,KAAK,IAAIwB,GAAkBtjB,EAAOD,EAAKgkB,EAAUC,EACtB,IAAIve,EAAMsD,EAAOpI,OAAOqI,GAAQtD,EAAWC,GAC3CoD,EAAOrK,KAAOgH,GAAW,KA4ClEgc,GAAUrd,UAAUkT,KAAO,SAASuM,EAAOI,GAEzC,IADAnmB,IAAIU,EAAUc,EAAS+B,MACdtD,EAAIkmB,EAAS5kB,OAAS,EAAGtB,GAAK,EAAGA,IACxCS,EAAUc,EAASG,KAAKwkB,EAASlmB,GAAG8F,KAAKoB,OAAOgf,EAASlmB,GAAGyF,MAAOhF,IAErEV,IAAIiC,EAAQ8jB,EAAM9jB,MAAOD,EAAM+jB,EAAM/jB,IACrC,OAAOP,KAAKsiB,KAAK,IAAIwB,GAAkBtjB,EAAOD,EAAKC,EAAOD,EAAK,IAAI0F,EAAMhH,EAAS,EAAG,GAAIylB,EAAS5kB,QAAQ,KAM5GoiB,GAAUrd,UAAU8f,aAAe,SAASzkB,EAAMC,EAAWmE,EAAML,cACjE,kBADqD/D,IAChDoE,EAAKqH,YAAa,MAAM,IAAInJ,WAAW,oDAC5CjE,IAAIqmB,EAAU5kB,KAAKmiB,MAAMriB,OAYzB,OAXAE,KAAKqJ,IAAIpJ,aAAaC,EAAMC,YAAKY,EAAMzC,GACrC,GAAIyC,EAAK4K,cAAgB5K,EAAKoK,UAAU7G,EAAML,IAalD,SAAuBoF,EAAK/K,EAAKgG,GAC/B/F,IAAIsmB,EAAOxb,EAAImB,QAAQlM,GAAM0D,EAAQ6iB,EAAK7iB,QAC1C,OAAO6iB,EAAKvkB,OAAOkM,eAAexK,EAAOA,EAAQ,EAAGsC,GAfMwgB,CAAc9kB,EAAKqJ,IAAKrJ,EAAK0hB,QAAQ1gB,MAAM4jB,GAASvhB,IAAI/E,GAAMgG,GAAO,CAE3HtE,EAAK+kB,kBAAkB/kB,EAAK0hB,QAAQ1gB,MAAM4jB,GAASvhB,IAAI/E,EAAK,GAAIgG,GAChE/F,IAAImjB,EAAU1hB,EAAK0hB,QAAQ1gB,MAAM4jB,GAC7BI,EAAStD,EAAQre,IAAI/E,EAAK,GAAI2mB,EAAOvD,EAAQre,IAAI/E,EAAMyC,EAAK3B,SAAU,GAG1E,OAFAY,EAAKsiB,KAAK,IAAIwB,GAAkBkB,EAAQC,EAAMD,EAAS,EAAGC,EAAO,EACjC,IAAIhf,EAAMlG,EAASG,KAAKoE,EAAKoB,OAAOzB,EAAO,KAAMlD,EAAK0E,QAAS,EAAG,GAAI,GAAG,KAClG,MAGJzF,MAWTkiB,GAAUrd,UAAUqgB,cAAgB,SAAS5mB,EAAKgG,EAAML,EAAOwB,GAC7DlH,IAAIwC,EAAOf,KAAKqJ,IAAIkC,OAAOjN,GAC3B,IAAKyC,EAAM,MAAM,IAAIyB,WAAW,6BAC3B8B,IAAMA,EAAOvD,EAAKuD,MACvB/F,IAAI4mB,EAAU7gB,EAAKoB,OAAOzB,EAAO,KAAMwB,GAAS1E,EAAK0E,OACrD,GAAI1E,EAAKE,OACP,OAAOjB,KAAKolB,YAAY9mB,EAAKA,EAAMyC,EAAK3B,SAAU+lB,GAEpD,IAAK7gB,EAAKmE,aAAa1H,EAAK9B,SAC1B,MAAM,IAAIuD,WAAW,iCAAmC8B,EAAKgB,MAE/D,OAAOtF,KAAKsiB,KAAK,IAAIwB,GAAkBxlB,EAAKA,EAAMyC,EAAK3B,SAAUd,EAAM,EAAGA,EAAMyC,EAAK3B,SAAW,EACzD,IAAI6G,EAAMlG,EAASG,KAAKilB,GAAU,EAAG,GAAI,GAAG,KAgCrFjD,GAAUrd,UAAU0L,MAAQ,SAASjS,EAAKwI,EAAWue,kBAAH,GAEhD,IADA9mB,IAAIsmB,EAAO7kB,KAAKqJ,IAAImB,QAAQlM,GAAMiL,EAASxJ,EAAS+B,MAAO0H,EAAQzJ,EAAS+B,MACnEqI,EAAI0a,EAAK/d,MAAO4c,EAAImB,EAAK/d,MAAQA,EAAOtI,EAAIsI,EAAQ,EAAGqD,EAAIuZ,EAAGvZ,IAAK3L,IAAK,CAC/E+K,EAASxJ,EAASG,KAAK2kB,EAAK9jB,KAAKoJ,GAAGjI,KAAKqH,IACzChL,IAAI+mB,EAAYD,GAAcA,EAAW7mB,GACzCgL,EAAQzJ,EAASG,KAAKolB,EAAYA,EAAUhhB,KAAKoB,OAAO4f,EAAUrhB,MAAOuF,GAASqb,EAAK9jB,KAAKoJ,GAAGjI,KAAKsH,IAEtG,OAAOxJ,KAAKsiB,KAAK,IAAIqB,GAAYrlB,EAAKA,EAAK,IAAI2H,EAAMsD,EAAOpI,OAAOqI,GAAQ1C,EAAOA,IAAQ,KA6C5Fob,GAAUrd,UAAU1B,KAAO,SAAS7E,EAAKwI,kBAAQ,GAC/CvI,IAAI+jB,EAAO,IAAIqB,GAAYrlB,EAAMwI,EAAOxI,EAAMwI,EAAOb,EAAMnE,OAAO,GAClE,OAAO9B,KAAKsiB,KAAKA,QD/NNiD,eAEX,WAAYrlB,EAAMC,EAAIkL,GACpBuY,aACA5jB,KAAKE,KAAOA,EACZF,KAAKG,GAAKA,EACVH,KAAKqL,KAAOA,4GAGdoX,eAAMpZ,cACAmc,EAAWnc,EAAIrI,MAAMhB,KAAKE,KAAMF,KAAKG,IAAKyG,EAAQyC,EAAImB,QAAQxK,KAAKE,MACnEI,EAASsG,EAAM7F,KAAK6F,EAAMoD,YAAYhK,KAAKG,KAC3Ca,EAAQ,IAAIiF,EAAMke,GAAYqB,EAASvmB,kBAAU8B,EAAMT,GACzD,OAAKS,EAAK6K,QAAWtL,EAAOgE,KAAKiO,eAAevS,EAAKqL,KAAK/G,MACnDvD,EAAKsK,KAAKrL,EAAKqL,KAAKvG,SAAS/D,EAAK0E,QAD+B1E,IAEvET,GAASklB,EAAStf,UAAWsf,EAASrf,SACzC,OAAOod,GAAWE,YAAYpa,EAAKrJ,KAAKE,KAAMF,KAAKG,GAAIa,gBAGzD+f,kBACE,OAAO,IAAI0E,GAAezlB,KAAKE,KAAMF,KAAKG,GAAIH,KAAKqL,mBAGrDhI,aAAIqe,GACFnjB,IAAI2B,EAAOwhB,EAAQtB,UAAUpgB,KAAKE,KAAM,GAAIC,EAAKuhB,EAAQtB,UAAUpgB,KAAKG,IAAK,GAC7E,OAAID,EAAK2f,SAAW1f,EAAG0f,SAAW3f,EAAK5B,KAAO6B,EAAG7B,IAAY,KACtD,IAAIinB,EAAYrlB,EAAK5B,IAAK6B,EAAG7B,IAAK0B,KAAKqL,mBAGhD4X,eAAM7hB,GACJ,GAAIA,aAAiBmkB,GACjBnkB,EAAMiK,KAAK/I,GAAGtC,KAAKqL,OACnBrL,KAAKE,MAAQkB,EAAMjB,IAAMH,KAAKG,IAAMiB,EAAMlB,KAC5C,OAAO,IAAIqlB,EAAY3lB,KAAKC,IAAIG,KAAKE,KAAMkB,EAAMlB,MAC1BN,KAAKa,IAAIT,KAAKG,GAAIiB,EAAMjB,IAAKH,KAAKqL,mBAG7DjI,kBACE,MAAO,CAAC+f,SAAU,UAAW9X,KAAMrL,KAAKqL,KAAKjI,SACrClD,KAAMF,KAAKE,KAAMC,GAAIH,KAAKG,KAGpColB,EAAOhiB,kBAASC,EAAQgC,GACtB,GAAwB,iBAAbA,EAAKtF,MAAsC,iBAAXsF,EAAKrF,GAC9C,MAAM,IAAIqC,WAAW,0CACvB,OAAO,IAAI+iB,EAAY/f,EAAKtF,KAAMsF,EAAKrF,GAAIqD,EAAOoJ,aAAapH,EAAK6F,WA7CvCyX,IAiDjCA,GAAKM,OAAO,UAAWmC,QAGVE,eAEX,WAAYvlB,EAAMC,EAAIkL,GACpBuY,aACA5jB,KAAKE,KAAOA,EACZF,KAAKG,GAAKA,EACVH,KAAKqL,KAAOA,4GAGdoX,eAAMpZ,cACAmc,EAAWnc,EAAIrI,MAAMhB,KAAKE,KAAMF,KAAKG,IACrCa,EAAQ,IAAIiF,EAAMke,GAAYqB,EAASvmB,kBAAS8B,GAClD,OAAOA,EAAKsK,KAAKrL,EAAKqL,KAAKlG,cAAcpE,EAAK0E,WAC5C+f,EAAStf,UAAWsf,EAASrf,SACjC,OAAOod,GAAWE,YAAYpa,EAAKrJ,KAAKE,KAAMF,KAAKG,GAAIa,gBAGzD+f,kBACE,OAAO,IAAIwE,GAAYvlB,KAAKE,KAAMF,KAAKG,GAAIH,KAAKqL,mBAGlDhI,aAAIqe,GACFnjB,IAAI2B,EAAOwhB,EAAQtB,UAAUpgB,KAAKE,KAAM,GAAIC,EAAKuhB,EAAQtB,UAAUpgB,KAAKG,IAAK,GAC7E,OAAID,EAAK2f,SAAW1f,EAAG0f,SAAW3f,EAAK5B,KAAO6B,EAAG7B,IAAY,KACtD,IAAImnB,EAAevlB,EAAK5B,IAAK6B,EAAG7B,IAAK0B,KAAKqL,mBAGnD4X,eAAM7hB,GACJ,GAAIA,aAAiBqkB,GACjBrkB,EAAMiK,KAAK/I,GAAGtC,KAAKqL,OACnBrL,KAAKE,MAAQkB,EAAMjB,IAAMH,KAAKG,IAAMiB,EAAMlB,KAC5C,OAAO,IAAIulB,EAAe7lB,KAAKC,IAAIG,KAAKE,KAAMkB,EAAMlB,MAC1BN,KAAKa,IAAIT,KAAKG,GAAIiB,EAAMjB,IAAKH,KAAKqL,mBAGhEjI,kBACE,MAAO,CAAC+f,SAAU,aAAc9X,KAAMrL,KAAKqL,KAAKjI,SACxClD,KAAMF,KAAKE,KAAMC,GAAIH,KAAKG,KAGpCslB,EAAOliB,kBAASC,EAAQgC,GACtB,GAAwB,iBAAbA,EAAKtF,MAAsC,iBAAXsF,EAAKrF,GAC9C,MAAM,IAAIqC,WAAW,6CACvB,OAAO,IAAIijB,EAAejgB,EAAKtF,KAAMsF,EAAKrF,GAAIqD,EAAOoJ,aAAapH,EAAK6F,WA3CvCyX,IEnBpC,SAAS4C,GAAc9e,EAAOC,EAAK7F,GACjC,OAAQA,EAAMkF,YAAclF,EAAMmF,SAAWS,EAAMpG,SAAWqG,EAAIrG,SAChEoG,EAAMtG,OAAOoG,WAAWE,EAAM5E,QAAS6E,EAAI7E,QAAShB,EAAM/B,SFgE9D6jB,GAAKM,OAAO,aAAcqC,IG1G1BvD,GAAUrd,UAAU8gB,QAAU,SAASzlB,EAAMC,EAAIkL,cAC3Cua,EAAU,GAAIC,EAAQ,GAAIC,EAAW,KAAMC,EAAS,KA0BxD,OAzBA/lB,KAAKqJ,IAAIpJ,aAAaC,EAAMC,YAAKY,EAAMzC,EAAKgC,GAC1C,GAAKS,EAAK+I,SAAV,CACAvL,IAAIkH,EAAQ1E,EAAK0E,MACjB,IAAK4F,EAAKjG,QAAQK,IAAUnF,EAAOgE,KAAKiO,eAAelH,EAAK/G,MAAO,CAIjE,IAHA/F,IAAIiC,EAAQZ,KAAKa,IAAInC,EAAK4B,GAAOK,EAAMX,KAAKC,IAAIvB,EAAMyC,EAAK3B,SAAUe,GACjE6lB,EAAS3a,EAAKvG,SAASW,GAElBjH,EAAI,EAAGA,EAAIiH,EAAM3F,OAAQtB,IAC3BiH,EAAMjH,GAAG4G,QAAQ4gB,KAChBF,GAAYA,EAAS3lB,IAAMK,GAASslB,EAASza,KAAK/I,GAAGmD,EAAMjH,IAC7DsnB,EAAS3lB,GAAKI,EAEdqlB,EAAQlkB,KAAKokB,EAAW,IAAIL,GAAejlB,EAAOD,EAAKkF,EAAMjH,MAI/DunB,GAAUA,EAAO5lB,IAAMK,EACzBulB,EAAO5lB,GAAKI,EAEZslB,EAAMnkB,KAAKqkB,EAAS,IAAIR,GAAY/kB,EAAOD,EAAK8K,SAItDua,EAAQljB,kBAAQujB,UAAKjmB,EAAKsiB,KAAK2D,MAC/BJ,EAAMnjB,kBAAQujB,UAAKjmB,EAAKsiB,KAAK2D,MACtBjmB,MAQTkiB,GAAUrd,UAAUqhB,WAAa,SAAShmB,EAAMC,EAAIkL,6BAAO,MACzD9M,IAAI4nB,EAAU,GAAI7D,EAAO,EAkCzB,OAjCAtiB,KAAKqJ,IAAIpJ,aAAaC,EAAMC,YAAKY,EAAMzC,GACrC,GAAKyC,EAAK+I,SAAV,CACAwY,IACA/jB,IAAI6nB,EAAW,KACf,GAAI/a,aAAgB0H,EAElB,IADAxU,IAAsBgE,EAAlBwC,EAAMhE,EAAK0E,MACRlD,EAAQ8I,EAAKjG,QAAQL,KACxBqhB,IAAaA,EAAW,KAAK1kB,KAAKa,GACpCwC,EAAMxC,EAAM4C,cAAcJ,QAEnBsG,EACLA,EAAKjG,QAAQrE,EAAK0E,SAAQ2gB,EAAW,CAAC/a,IAE1C+a,EAAWrlB,EAAK0E,MAElB,GAAI2gB,GAAYA,EAAStmB,OAEvB,IADAvB,IAAIgC,EAAMX,KAAKC,IAAIvB,EAAMyC,EAAK3B,SAAUe,GAC/B3B,EAAI,EAAGA,EAAI4nB,EAAStmB,OAAQtB,IAAK,CAExC,IADAD,IAAIiV,EAAQ4S,EAAS5nB,GAAI+D,SAChBvD,EAAI,EAAGA,EAAImnB,EAAQrmB,OAAQd,IAAK,CACvCT,IAAI6R,EAAI+V,EAAQnnB,GACZoR,EAAEkS,MAAQA,EAAO,GAAK9O,EAAMlR,GAAG6jB,EAAQnnB,GAAGwU,SAAQjR,EAAQ6N,GAE5D7N,GACFA,EAAMpC,GAAKI,EACXgC,EAAM+f,KAAOA,GAEb6D,EAAQzkB,KAAK,OAAC8R,EAAOtT,KAAMN,KAAKa,IAAInC,EAAK4B,GAAOC,GAAII,OAAK+hB,SAKjE6D,EAAQzjB,kBAAQ0N,UAAKpQ,EAAKsiB,KAAK,IAAImD,GAAerV,EAAElQ,KAAMkQ,EAAEjQ,GAAIiQ,EAAEoD,WAC3DxT,MAQTkiB,GAAUrd,UAAUkgB,kBAAoB,SAASzmB,EAAK+nB,EAAYra,kBAAQqa,EAAWpa,cAGnF,IAFA1N,IAAIwC,EAAOf,KAAKqJ,IAAIkC,OAAOjN,GACvBgoB,EAAW,GAAI5X,EAAMpQ,EAAM,EACtBE,EAAI,EAAGA,EAAIuC,EAAKtC,WAAYD,IAAK,CACxCD,IAAII,EAAQoC,EAAKpC,MAAMH,GAAI+B,EAAMmO,EAAM/P,EAAMS,SACzCmnB,EAAUva,EAAMS,UAAU9N,EAAM2F,KAAM3F,EAAMsF,OAChD,GAAKsiB,EAEE,CACLva,EAAQua,EACR,IAAKhoB,IAAIS,EAAI,EAAGA,EAAIL,EAAM8G,MAAM3F,OAAQd,IAAUqnB,EAAW9T,eAAe5T,EAAM8G,MAAMzG,GAAGsF,OACzFtE,KAAKsiB,KAAK,IAAImD,GAAe/W,EAAKnO,EAAK5B,EAAM8G,MAAMzG,UAJrDsnB,EAAS5kB,KAAK,IAAIiiB,GAAYjV,EAAKnO,EAAK0F,EAAMnE,QAMhD4M,EAAMnO,EAER,IAAKyL,EAAMM,SAAU,CACnB/N,IAAIuZ,EAAO9L,EAAMmD,WAAWpP,EAAS+B,OAAO,GAC5C9B,KAAK2G,QAAQ+H,EAAKA,EAAK,IAAIzI,EAAM6R,EAAM,EAAG,IAE5C,IAAKvZ,IAAIC,EAAI8nB,EAASxmB,OAAS,EAAGtB,GAAK,EAAGA,IAAKwB,KAAKsiB,KAAKgE,EAAS9nB,IAClE,OAAOwB,MDnFTkiB,GAAUrd,UAAU8B,QAAU,SAASzG,EAAMC,EAAWa,kBAANd,kBAAc+F,EAAMnE,OACpEvD,IAAI+jB,EAbC,SAAqBjZ,EAAKnJ,EAAMC,EAAWa,GAChD,kBAD0Cd,kBAAc+F,EAAMnE,OAC1D5B,GAAQC,IAAOa,EAAM9B,KAAM,OAAO,KAEtCX,IAAIqI,EAAQyC,EAAImB,QAAQtK,GAAO2G,EAAMwC,EAAImB,QAAQrK,GAEjD,OAAIulB,GAAc9e,EAAOC,EAAK7F,GAAe,IAAI2iB,GAAYzjB,EAAMC,EAAIa,GAChE,IAAIwlB,GAAO5f,EAAOC,EAAK7F,GAAOylB,MAO1BC,CAAY1mB,KAAKqJ,IAAKnJ,EAAMC,EAAIa,GAE3C,OADIshB,GAAMtiB,KAAKsiB,KAAKA,GACbtiB,MAMTkiB,GAAUrd,UAAUugB,YAAc,SAASllB,EAAMC,EAAIlB,GACnD,OAAOe,KAAK2G,QAAQzG,EAAMC,EAAI,IAAI8F,EAAMlG,EAASG,KAAKjB,GAAU,EAAG,KAKrEijB,GAAUrd,UAAU8hB,OAAS,SAASzmB,EAAMC,GAC1C,OAAOH,KAAK2G,QAAQzG,EAAMC,EAAI8F,EAAMnE,QAKtCogB,GAAUrd,UAAU4B,OAAS,SAASnI,EAAKW,GACzC,OAAOe,KAAKolB,YAAY9mB,EAAKA,EAAKW,IA4BpC,IAAMunB,GACJ,SAAY5f,EAAOC,EAAK7F,GACtBhB,KAAK6G,IAAMA,EACX7G,KAAK4G,MAAQA,EACb5G,KAAK4mB,SAAW5lB,EAEhBhB,KAAK6mB,SAAW,GAChB,IAAKtoB,IAAIC,EAAI,EAAGA,GAAKoI,EAAME,MAAOtI,IAAK,CACrCD,IAAIwC,EAAO6F,EAAM7F,KAAKvC,GACtBwB,KAAK6mB,SAASnlB,KAAK,CACjB4C,KAAMvD,EAAKuD,KACX0H,MAAOjL,EAAKgL,eAAenF,EAAM0C,WAAW9K,MAIhDwB,KAAKgF,OAASjF,EAAS+B,MACvB,IAAKvD,IAAIC,EAAIoI,EAAME,MAAOtI,EAAI,EAAGA,IAC/BwB,KAAKgF,OAASjF,EAASG,KAAK0G,EAAM7F,KAAKvC,GAAG0D,KAAKlC,KAAKgF,uCA8M1D,SAAS8hB,GAAiBne,EAAU7B,EAAOigB,GACzC,OAAa,GAATjgB,EAAmB6B,EAAS9G,WAAWklB,GACpCpe,EAAS5G,aAAa,EAAG4G,EAASnH,WAAWU,KAAK4kB,GAAiBne,EAASnH,WAAWvC,QAAS6H,EAAQ,EAAGigB,KAGpH,SAASC,GAAcre,EAAU7B,EAAO7H,GACtC,OAAa,GAAT6H,EAAmB6B,EAASxH,OAAOlC,GAChC0J,EAAS5G,aAAa4G,EAASlK,WAAa,EACtBkK,EAASrH,UAAUY,KAAK8kB,GAAcre,EAASrH,UAAUrC,QAAS6H,EAAQ,EAAG7H,KAG5G,SAASgoB,GAAUte,EAAU7B,GAC3B,IAAKvI,IAAIC,EAAI,EAAGA,EAAIsI,EAAOtI,IAAKmK,EAAWA,EAASnH,WAAWvC,QAC/D,OAAO0J,EAGT,SAASue,GAAenmB,EAAMmF,EAAWC,GACvC,GAAID,GAAa,EAAG,OAAOnF,EAC3BxC,IAAIwQ,EAAOhO,EAAK9B,QAOhB,OANIiH,EAAY,IACd6I,EAAOA,EAAKhN,aAAa,EAAGmlB,GAAenY,EAAKvN,WAAY0E,EAAY,EAAsB,GAAnB6I,EAAKtQ,WAAkB0H,EAAU,EAAI,KAC9GD,EAAY,IACd6I,EAAOhO,EAAKuD,KAAK2H,aAAakD,WAAWJ,GAAM5N,OAAO4N,GAClD5I,GAAW,IAAG4I,EAAOA,EAAK5N,OAAOJ,EAAKuD,KAAK2H,aAAaC,cAAc6C,GAAMI,WAAWpP,EAAS+B,OAAO,MAEtGf,EAAKmB,KAAK6M,GAGnB,SAASoY,GAAiBtgB,EAAKC,EAAOxC,EAAM0H,EAAOuM,GACjDha,IAAIwC,EAAO8F,EAAI9F,KAAK+F,GAAQ9E,EAAQuW,EAAO1R,EAAIyC,WAAWxC,GAASD,EAAI7E,MAAM8E,GAC7E,GAAI9E,GAASjB,EAAKtC,aAAe6F,EAAKqD,kBAAkB5G,EAAKuD,MAAO,OAAO,KAC3E/F,IAAIkoB,EAAMza,EAAMmD,WAAWpO,EAAK9B,SAAS,EAAM+C,GAC/C,OAAOykB,IAGT,SAAsBniB,EAAMqE,EAAUnI,GACpC,IAAKjC,IAAIC,EAAIgC,EAAOhC,EAAImK,EAASlK,WAAYD,IAC3C,IAAK8F,EAAKiI,YAAY5D,EAAShK,MAAMH,GAAGiH,OAAQ,OAAO,EACzD,OAAO,EANQ2hB,CAAa9iB,EAAMvD,EAAK9B,QAAS+C,GAASykB,EAAM,KAiGjE,SAASY,GAAc1e,EAAU7B,EAAOwgB,EAASC,EAASjnB,GACxD,GAAIwG,EAAQwgB,EAAS,CACnB/oB,IAAIgD,EAAQoH,EAASnH,WACrBmH,EAAWA,EAAS5G,aAAa,EAAGR,EAAMW,KAAKmlB,GAAc9lB,EAAMtC,QAAS6H,EAAQ,EAAGwgB,EAASC,EAAShmB,KAE3G,GAAIuF,EAAQygB,EAAS,CACnBhpB,IAAIyN,EAAQ1L,EAAOyL,eAAe,GAC9BvL,EAAQwL,EAAMmD,WAAWxG,GAAUxH,OAAOwH,GAC9CA,EAAWnI,EAAMW,OAAO6K,EAAME,cAAc1L,GAAO2O,WAAWpP,EAAS+B,OAAO,IAEhF,OAAO6G,EA0CT,SAAS6e,GAAc5gB,EAAOC,GAE5B,IADAtI,IAAIqD,EAAS,GACJuI,EADmBvK,KAAKC,IAAI+G,EAAME,MAAOD,EAAIC,OAC/BqD,GAAK,EAAGA,IAAK,CAClC5L,IAAIiC,EAAQoG,EAAMpG,MAAM2J,GACxB,GAAI3J,EAAQoG,EAAMtI,KAAOsI,EAAME,MAAQqD,IACnCtD,EAAItG,IAAI4J,GAAKtD,EAAIvI,KAAOuI,EAAIC,MAAQqD,IACpCvD,EAAM7F,KAAKoJ,GAAG7F,KAAKyE,KAAKC,WACxBnC,EAAI9F,KAAKoJ,GAAG7F,KAAKyE,KAAKC,UAAW,MACjCxI,GAASqG,EAAIrG,MAAM2J,IAAIvI,EAAOF,KAAKyI,GAEzC,OAAOvI,KA1YHkF,qBAAU,OAAO9G,KAAK6mB,SAAS/mB,OAAS,gBAE5C2mB,eAIE,KAAOzmB,KAAK4mB,SAAS1nB,MAAM,CACzBX,IAAIkoB,EAAMzmB,KAAKynB,eACXhB,EAAKzmB,KAAK0nB,WAAWjB,GACpBzmB,KAAK2nB,YAAc3nB,KAAK4nB,WAO/BrpB,IAAIspB,EAAa7nB,KAAK8nB,iBAAkBC,EAAa/nB,KAAKgF,OAAO9F,KAAOc,KAAK8G,MAAQ9G,KAAK4G,MAAME,MAC5FF,EAAQ5G,KAAK4G,MAAOC,EAAM7G,KAAKoH,MAAMygB,EAAa,EAAI7nB,KAAK6G,IAAMD,EAAMyC,IAAImB,QAAQqd,IACvF,IAAKhhB,EAAK,OAAO,KAIjB,IADAtI,IAAIU,EAAUe,KAAKgF,OAAQkB,EAAYU,EAAME,MAAOX,EAAUU,EAAIC,MAC3DZ,GAAaC,GAAiC,GAAtBlH,EAAQR,YACrCQ,EAAUA,EAAQuC,WAAWvC,QAC7BiH,IAAaC,IAEf5H,IAAIyC,EAAQ,IAAIiF,EAAMhH,EAASiH,EAAWC,GAC1C,OAAI0hB,GAAc,EACT,IAAI/D,GAAkBld,EAAMtI,IAAKupB,EAAY7nB,KAAK6G,IAAIvI,IAAK0B,KAAK6G,IAAItG,MAAOS,EAAO+mB,GACvF/mB,EAAM9B,MAAQ0H,EAAMtI,KAAO0B,KAAK6G,IAAIvI,IAC/B,IAAIqlB,GAAY/c,EAAMtI,IAAKuI,EAAIvI,IAAK0C,QAD7C,gBAOFymB,wBAGE,IAAKlpB,IAAIypB,EAAO,EAAGA,GAAQ,EAAGA,IAC5B,IAAKzpB,IAAI0pB,EAAajoB,KAAK4mB,SAAS1gB,UAAW+hB,GAAc,EAAGA,IAS9D,IARA1pB,IAAc+B,SAOViB,GANA0mB,GACF3nB,EAAS2mB,GAAUjnB,KAAK4mB,SAAS3nB,QAASgpB,EAAa,GAAGzmB,YACxCvC,QAEPe,KAAK4mB,SAAS3nB,SAENuC,WACZ0mB,EAAgBloB,KAAK8G,MAAOohB,GAAiB,EAAGA,IAAiB,OACpDloB,KAAK6mB,SAASqB,sBAAgBnQ,SAAMoQ,SAIxD,GAAY,GAARH,IAAczmB,EAAQyK,EAAMS,UAAUlL,EAAM+C,QAAU6jB,EAASnc,EAAMmD,WAAWpP,EAASG,KAAKqB,IAAQ,IACtF+C,EAAKqD,kBAAkBrH,EAAOgE,OAChD,MAAO,YAAC2jB,gBAAYC,SAAe5nB,SAAQ6nB,GAGxC,GAAY,GAARH,GAAazmB,IAAUwW,EAAO/L,EAAM2D,aAAapO,EAAM+C,OAC9D,MAAO,YAAC2jB,gBAAYC,SAAe5nB,OAAQyX,GAG7C,GAAIzX,GAAU0L,EAAMS,UAAUnM,EAAOgE,MAAO,qBAMpDqjB,0BACsC3nB,KAAK4mB,+CACrCznB,EAAQ8nB,GAAUhoB,EAASiH,GAC/B,SAAK/G,EAAMV,YAAcU,EAAMqC,WAAWP,UAC1CjB,KAAK4mB,SAAW,IAAI3gB,EAAMhH,EAASiH,EAAY,EACrBtG,KAAKa,IAAI0F,EAAShH,EAAMD,KAAOgH,GAAajH,EAAQC,KAAOiH,EAAUD,EAAY,EAAI,KACxG,iBAGT0hB,0BACsC5nB,KAAK4mB,+CACrCznB,EAAQ8nB,GAAUhoB,EAASiH,GAC/B,GAAI/G,EAAMV,YAAc,GAAKyH,EAAY,EAAG,CAC1C3H,IAAI6pB,EAAYnpB,EAAQC,KAAOgH,GAAaA,EAAY/G,EAAMD,KAC9Dc,KAAK4mB,SAAW,IAAI3gB,EAAM6gB,GAAiB7nB,EAASiH,EAAY,EAAG,GAAIA,EAAY,EACzDkiB,EAAYliB,EAAY,EAAIC,QAEtDnG,KAAK4mB,SAAW,IAAI3gB,EAAM6gB,GAAiB7nB,EAASiH,EAAW,GAAIA,EAAWC,iBAQlFuhB,uBACE,wEAAO1nB,KAAK8G,MAAQohB,GAAeloB,KAAKqoB,oBACxC,GAAItQ,EAAM,IAAKxZ,IAAIC,EAAI,EAAGA,EAAIuZ,EAAKjY,OAAQtB,IAAKwB,KAAKsoB,iBAAiBvQ,EAAKvZ,IAE3ED,IAAIyC,EAAQhB,KAAK4mB,SAAUje,EAAWrI,EAASA,EAAOrB,QAAU+B,EAAM/B,QAClEiH,EAAYlF,EAAMkF,UAAY+hB,EAC9BM,EAAQ,EAAGjK,EAAM,KACDte,KAAK6mB,SAASqB,sBAClC,GAAIC,EAAQ,CACV,IAAK5pB,IAAIC,EAAI,EAAGA,EAAI2pB,EAAO1pB,WAAYD,IAAK8f,EAAI5c,KAAKymB,EAAOxpB,MAAMH,IAClEwN,EAAQA,EAAME,cAAcic,GAQ9B,IAHA5pB,IAAIiqB,EAAgB7f,EAASzJ,KAAO+oB,GAAejnB,EAAM/B,QAAQC,KAAO8B,EAAMmF,SAGvEoiB,EAAQ5f,EAASlK,YAAY,CAClCF,IAAIwL,EAAOpB,EAAShK,MAAM4pB,GAAQpU,EAAUnI,EAAMS,UAAU1C,EAAKzF,MACjE,IAAK6P,EAAS,SACdoU,EACY,GAAkB,GAAbriB,GAAkB6D,EAAK9K,QAAQC,QAC9C8M,EAAQmI,EACRmK,EAAI5c,KAAKwlB,GAAend,EAAKsB,KAAK/G,EAAKmO,aAAa1I,EAAKtE,QAAkB,GAAT8iB,EAAariB,EAAY,EACnEqiB,GAAS5f,EAASlK,WAAa+pB,GAAgB,KAG3EjqB,IAAI6Q,EAAQmZ,GAAS5f,EAASlK,WACzB2Q,IAAOoZ,GAAgB,GAE5BxoB,KAAKgF,OAASgiB,GAAchnB,KAAKgF,OAAQkjB,EAAenoB,EAASG,KAAKoe,IACtEte,KAAK6mB,SAASqB,GAAelc,MAAQA,EAIjCoD,GAASoZ,EAAe,GAAKloB,GAAUA,EAAOgE,MAAQtE,KAAK6mB,SAAS7mB,KAAK8G,OAAOxC,MAAQtE,KAAK6mB,SAAS/mB,OAAS,GACjHE,KAAKqoB,oBAGP,IAAK9pB,IAAIC,EAAI,EAAGkQ,EAAM/F,EAAUnK,EAAIgqB,EAAchqB,IAAK,CACrDD,IAAIwC,EAAO2N,EAAIpN,UACftB,KAAK6mB,SAASnlB,KAAK,CAAC4C,KAAMvD,EAAKuD,KAAM0H,MAAOjL,EAAKgL,eAAehL,EAAKtC,cACrEiQ,EAAM3N,EAAK9B,QAMbe,KAAK4mB,SAAYxX,EACC,GAAd6Y,EAAkBhiB,EAAMnE,MACxB,IAAImE,EAAM6gB,GAAiB9lB,EAAM/B,QAASgpB,EAAa,EAAG,GAChDA,EAAa,EAAGO,EAAe,EAAIxnB,EAAMmF,QAAU8hB,EAAa,GAHrD,IAAIhiB,EAAM6gB,GAAiB9lB,EAAM/B,QAASgpB,EAAYM,GAAQvnB,EAAMkF,UAAWlF,EAAMmF,uBAMhH2hB,0BACE,IAAK9nB,KAAK6G,IAAIvG,OAAOqL,aAAe3L,KAAK6G,IAAItG,OAASP,KAAK6G,IAAIvI,IAAK,OAAQ,EAC5EC,IAAqCkf,EAAjCrE,EAAMpZ,KAAK6mB,SAAS7mB,KAAK8G,OAC7B,IAAKsS,EAAI9U,KAAKqH,cAAgBwb,GAAiBnnB,KAAK6G,IAAK7G,KAAK6G,IAAIC,MAAOsS,EAAI9U,KAAM8U,EAAIpN,OAAO,IACzFhM,KAAK6G,IAAIC,OAAS9G,KAAK8G,QAAU2W,EAAQzd,KAAKyoB,eAAezoB,KAAK6G,OAAS4W,EAAM3W,OAAS9G,KAAK8G,MAAQ,OAAQ,EAGpH,UADc9G,KAAK6G,UAAK2C,EAAQxJ,KAAK6G,IAAI2C,MAAM1C,GACxCA,EAAQ,GAAK0C,GAASxJ,KAAK6G,IAAItG,MAAMuG,MAAU0C,EACtD,OAAOA,gBAGTif,wBAAe5hB,GACbsJ,EAAM,IAAK5R,IAAIC,EAAIoB,KAAKC,IAAIG,KAAK8G,MAAOD,EAAIC,OAAQtI,GAAK,EAAGA,IAAK,OAC3CwB,KAAK6mB,SAASroB,sBAC9BkqB,EAAYlqB,EAAIqI,EAAIC,OAASD,EAAItG,IAAI/B,EAAI,IAAMqI,EAAIvI,KAAOuI,EAAIC,OAAStI,EAAI,IAC3EioB,EAAMU,GAAiBtgB,EAAKrI,EAAG8F,EAAM0H,EAAO0c,GAChD,GAAKjC,EAAL,CACA,IAAKloB,IAAI4L,EAAI3L,EAAI,EAAG2L,GAAK,EAAGA,IAAK,OACXnK,KAAK6mB,SAAS1c,aAC9BgK,EAAUgT,GAAiBtgB,EAAKsD,SAAS6B,GAAO,GACpD,IAAKmI,GAAWA,EAAQ1V,WAAY,SAAS0R,EAE/C,MAAO,CAACrJ,MAAOtI,MAAGioB,EAAKkC,KAAMD,EAAY7hB,EAAIwC,IAAImB,QAAQ3D,EAAI2C,MAAMhL,EAAI,IAAMqI,mBAIjFO,eAAMP,GACJtI,IAAI6I,EAAQpH,KAAKyoB,eAAe5hB,GAChC,IAAKO,EAAO,OAAO,KAEnB,KAAOpH,KAAK8G,MAAQM,EAAMN,OAAO9G,KAAKqoB,oBAClCjhB,EAAMqf,IAAIhoB,aAAYuB,KAAKgF,OAASgiB,GAAchnB,KAAKgF,OAAQoC,EAAMN,MAAOM,EAAMqf,MACtF5f,EAAMO,EAAMuhB,KACZ,IAAKpqB,IAAI4L,EAAI/C,EAAMN,MAAQ,EAAGqD,GAAKtD,EAAIC,MAAOqD,IAAK,CACjD5L,IAAIwC,EAAO8F,EAAI9F,KAAKoJ,GAAImU,EAAMvd,EAAKuD,KAAK2H,aAAakD,WAAWpO,EAAK9B,SAAS,EAAM4H,EAAI7E,MAAMmI,IAC9FnK,KAAKsoB,iBAAiBvnB,EAAKuD,KAAMvD,EAAKkD,MAAOqa,GAE/C,OAAOzX,gBAGTyhB,0BAAiBhkB,EAAML,EAAOhF,GAC5BV,IAAI6a,EAAMpZ,KAAK6mB,SAAS7mB,KAAK8G,OAC7BsS,EAAIpN,MAAQoN,EAAIpN,MAAMS,UAAUnI,GAChCtE,KAAKgF,OAASgiB,GAAchnB,KAAKgF,OAAQhF,KAAK8G,MAAO/G,EAASG,KAAKoE,EAAKoB,OAAOzB,EAAOhF,KACtFe,KAAK6mB,SAASnlB,KAAK,MAAC4C,EAAM0H,MAAO1H,EAAK2H,6BAGxCoc,6BACE9pB,IACI+f,EADOte,KAAK6mB,SAASrW,MACVxE,MAAMmD,WAAWpP,EAAS+B,OAAO,GAC5Cwc,EAAI7f,aAAYuB,KAAKgF,OAASgiB,GAAchnB,KAAKgF,OAAQhF,KAAK6mB,SAAS/mB,OAAQwe,8CA6DvF4D,GAAUrd,UAAU+jB,aAAe,SAAS1oB,EAAMC,EAAIa,GACpD,IAAKA,EAAM9B,KAAM,OAAOc,KAAK6oB,YAAY3oB,EAAMC,GAE/C5B,IAAIqI,EAAQ5G,KAAKqJ,IAAImB,QAAQtK,GAAO2G,EAAM7G,KAAKqJ,IAAImB,QAAQrK,GAC3D,GAAIulB,GAAc9e,EAAOC,EAAK7F,GAC5B,OAAOhB,KAAKsiB,KAAK,IAAIqB,GAAYzjB,EAAMC,EAAIa,IAE7CzC,IAAIuqB,EAAetB,GAAc5gB,EAAO5G,KAAKqJ,IAAImB,QAAQrK,IAEZ,GAAzC2oB,EAAaA,EAAahpB,OAAS,IAASgpB,EAAatY,MAG7DjS,IAAIwqB,IAAoBniB,EAAME,MAAQ,GACtCgiB,EAAaE,QAAQD,GAKrB,IAAKxqB,IAAI4L,EAAIvD,EAAME,MAAOxI,EAAMsI,EAAMtI,IAAM,EAAG6L,EAAI,EAAGA,IAAK7L,IAAO,CAChEC,IAAIwK,EAAOnC,EAAM7F,KAAKoJ,GAAG7F,KAAKyE,KAC9B,GAAIA,EAAKkgB,UAAYlgB,EAAKC,UAAW,MACjC8f,EAAa/a,QAAQ5D,IAAM,EAAG4e,EAAkB5e,EAC3CvD,EAAM2C,OAAOY,IAAM7L,GAAKwqB,EAAajU,OAAO,EAAG,GAAI1K,GAO9D,IAHA5L,IAAI2qB,EAAuBJ,EAAa/a,QAAQgb,GAE5CI,EAAY,GAAIC,EAAiBpoB,EAAMkF,UAClCjH,EAAU+B,EAAM/B,QAAST,EAAI,GAAIA,IAAK,CAC7CD,IAAIwC,EAAO9B,EAAQuC,WAEnB,GADA2nB,EAAUznB,KAAKX,GACXvC,GAAKwC,EAAMkF,UAAW,MAC1BjH,EAAU8B,EAAK9B,QAIbmqB,EAAiB,GAAKD,EAAUC,EAAiB,GAAG9kB,KAAKyE,KAAKkgB,UAC9DriB,EAAM7F,KAAKmoB,GAAsB5kB,MAAQ6kB,EAAUC,EAAiB,GAAG9kB,KACzE8kB,GAAkB,EACXA,GAAkB,GAAKD,EAAUC,EAAiB,GAAGzd,aAAewd,EAAUC,EAAiB,GAAG9kB,KAAKyE,KAAKkgB,UAC5GriB,EAAM7F,KAAKmoB,GAAsB5kB,MAAQ6kB,EAAUC,EAAiB,GAAG9kB,OAC9E8kB,GAAkB,GAEpB,IAAK7qB,IAAIS,EAAIgC,EAAMkF,UAAWlH,GAAK,EAAGA,IAAK,CACzCT,IAAI8qB,GAAarqB,EAAIoqB,EAAiB,IAAMpoB,EAAMkF,UAAY,GAC1DO,EAAS0iB,EAAUE,GACvB,GAAK5iB,EACL,IAAKlI,IAAIC,EAAI,EAAGA,EAAIsqB,EAAahpB,OAAQtB,IAAK,CAG5CD,IAAI+qB,EAAcR,GAActqB,EAAI0qB,GAAwBJ,EAAahpB,QAASypB,GAAS,EACvFD,EAAc,IAAKC,GAAS,EAAOD,GAAeA,GACtD/qB,IAAI+B,EAASsG,EAAM7F,KAAKuoB,EAAc,GAAItnB,EAAQ4E,EAAM5E,MAAMsnB,EAAc,GAC5E,GAAIhpB,EAAOkM,eAAexK,EAAOA,EAAOyE,EAAOnC,KAAMmC,EAAOhB,OAC1D,OAAOzF,KAAK2G,QAAQC,EAAM2C,OAAO+f,GAAcC,EAAS1iB,EAAI2C,MAAM8f,GAAenpB,EAC7D,IAAI8F,EAAMohB,GAAcrmB,EAAM/B,QAAS,EAAG+B,EAAMkF,UAAWmjB,GACjDA,EAAWroB,EAAMmF,WAKrD,IADA5H,IAAIirB,EAAaxpB,KAAKmiB,MAAMriB,OACnBtB,EAAIsqB,EAAahpB,OAAS,EAAGtB,GAAK,IACzCwB,KAAK2G,QAAQzG,EAAMC,EAAIa,KACnBhB,KAAKmiB,MAAMriB,OAAS0pB,IAFoBhrB,IAAK,CAGjDD,IAAIuI,EAAQgiB,EAAatqB,GACrBA,EAAI,IACR0B,EAAO0G,EAAM2C,OAAOzC,GAAQ3G,EAAK0G,EAAI2C,MAAM1C,IAE7C,OAAO9G,MAwBTkiB,GAAUrd,UAAU4kB,iBAAmB,SAASvpB,EAAMC,EAAIY,GACxD,IAAKA,EAAK+I,UAAY5J,GAAQC,GAAMH,KAAKqJ,IAAImB,QAAQtK,GAAMI,OAAOrB,QAAQC,KAAM,CAC9EX,IAAImrB,ED1MD,SAAqBrgB,EAAK/K,EAAKuO,GACpCtO,IAAIsmB,EAAOxb,EAAImB,QAAQlM,GACvB,GAAIumB,EAAKvkB,OAAOkM,eAAeqY,EAAK7iB,QAAS6iB,EAAK7iB,QAAS6K,GAAW,OAAOvO,EAE7E,GAAyB,GAArBumB,EAAKvd,aACP,IAAK/I,IAAI4L,EAAI0a,EAAK/d,MAAQ,EAAGqD,GAAK,EAAGA,IAAK,CACxC5L,IAAIyD,EAAQ6iB,EAAK7iB,MAAMmI,GACvB,GAAI0a,EAAK9jB,KAAKoJ,GAAGqC,eAAexK,EAAOA,EAAO6K,GAAW,OAAOgY,EAAKtb,OAAOY,EAAI,GAChF,GAAInI,EAAQ,EAAG,OAAO,KAE1B,GAAI6iB,EAAKvd,cAAgBud,EAAKvkB,OAAOrB,QAAQC,KAC3C,IAAKX,IAAI4L,EAAI0a,EAAK/d,MAAQ,EAAGqD,GAAK,EAAGA,IAAK,CACxC5L,IAAIyD,EAAQ6iB,EAAKvb,WAAWa,GAC5B,GAAI0a,EAAK9jB,KAAKoJ,GAAGqC,eAAexK,EAAOA,EAAO6K,GAAW,OAAOgY,EAAKrb,MAAMW,EAAI,GAC/E,GAAInI,EAAQ6iB,EAAK9jB,KAAKoJ,GAAG1L,WAAY,OAAO,MC4LlCkrB,CAAY3pB,KAAKqJ,IAAKnJ,EAAMa,EAAKuD,MAChC,MAATolB,IAAexpB,EAAOC,EAAKupB,GAEjC,OAAO1pB,KAAK4oB,aAAa1oB,EAAMC,EAAI,IAAI8F,EAAMlG,EAASG,KAAKa,GAAO,EAAG,KAMvEmhB,GAAUrd,UAAUgkB,YAAc,SAAS3oB,EAAMC,GAG/C,IAFA5B,IAAIqI,EAAQ5G,KAAKqJ,IAAImB,QAAQtK,GAAO2G,EAAM7G,KAAKqJ,IAAImB,QAAQrK,GACvDypB,EAAUpC,GAAc5gB,EAAOC,GAC1BrI,EAAI,EAAGA,EAAIorB,EAAQ9pB,OAAQtB,IAAK,CACvCD,IAAIuI,EAAQ8iB,EAAQprB,GAAI6C,EAAO7C,GAAKorB,EAAQ9pB,OAAS,EACrD,GAAKuB,GAAiB,GAATyF,GAAeF,EAAM7F,KAAK+F,GAAOxC,KAAK2H,aAAaK,SAC9D,OAAOtM,KAAK2mB,OAAO/f,EAAMpG,MAAMsG,GAAQD,EAAItG,IAAIuG,IACjD,GAAIA,EAAQ,IAAMzF,GAAQuF,EAAM7F,KAAK+F,EAAQ,GAAGJ,WAAWE,EAAM5E,MAAM8E,EAAQ,GAAID,EAAIyC,WAAWxC,EAAQ,KACxG,OAAO9G,KAAK2mB,OAAO/f,EAAM2C,OAAOzC,GAAQD,EAAI2C,MAAM1C,IAEtD,IAAKvI,IAAI4L,EAAI,EAAGA,GAAKvD,EAAME,OAASqD,GAAKtD,EAAIC,MAAOqD,IAClD,GAAIjK,EAAO0G,EAAMpG,MAAM2J,IAAMvD,EAAME,MAAQqD,GAAKhK,EAAKyG,EAAMrG,IAAI4J,IAAMtD,EAAItG,IAAI4J,GAAKhK,GAAM0G,EAAIC,MAAQqD,EAClG,OAAOnK,KAAK2mB,OAAO/f,EAAM2C,OAAOY,GAAIhK,GAExC,OAAOH,KAAK2mB,OAAOzmB,EAAMC,IEpd3B+D,IAAM2lB,GAAc9jB,OAAOL,OAAO,MAIrBokB,GAKX,SAAYC,EAASC,EAAOhK,GAG1BhgB,KAAKggB,OAASA,GAAU,CAAC,IAAIiK,GAAeF,EAAQlqB,IAAImqB,GAAQD,EAAQtpB,IAAIupB,KAI5EhqB,KAAK+pB,QAAUA,EAIf/pB,KAAKgqB,MAAQA,0KAKfhb,GAAIkb,sBAAW,OAAOlqB,KAAK+pB,QAAQzrB,KAInC0Q,GAAIkI,oBAAS,OAAOlX,KAAKgqB,MAAM1rB,KAI/B0Q,GAAI9O,oBAAS,OAAOF,KAAK4G,MAAMtI,KAI/B0Q,GAAI7O,kBAAO,OAAOH,KAAK6G,IAAIvI,KAI3B0Q,GAAIpI,qBACF,OAAO5G,KAAKggB,OAAO,GAAGpZ,OAKxBoI,GAAInI,mBACF,OAAO7G,KAAKggB,OAAO,GAAGnZ,KAKxBmI,GAAIlN,qBAEF,IADAvD,IAAIyhB,EAAShgB,KAAKggB,OACTxhB,EAAI,EAAGA,EAAIwhB,EAAOlgB,OAAQtB,IACjC,GAAIwhB,EAAOxhB,GAAGoI,MAAMtI,KAAO0hB,EAAOxhB,GAAGqI,IAAIvI,IAAK,OAAO,EACvD,OAAO,gBAYTW,mBACE,OAAOe,KAAK4G,MAAM7F,KAAK,GAAGC,MAAMhB,KAAKE,KAAMF,KAAKG,IAAI,iBAMtDwG,iBAAQwjB,EAAIlrB,kBAAUgH,EAAMnE,OAK1B,IADAvD,IAAI6rB,EAAWnrB,EAAQA,QAAQqC,UAAW+oB,EAAa,KAC9C7rB,EAAI,EAAGA,EAAIS,EAAQkH,QAAS3H,IACnC6rB,EAAaD,EACbA,EAAWA,EAAS9oB,UAItB,IADA/C,IAAIqmB,EAAUuF,EAAGhI,MAAMriB,OAAQkgB,EAAShgB,KAAKggB,OACpCxhB,EAAI,EAAGA,EAAIwhB,EAAOlgB,OAAQtB,IAAK,OACnBwhB,EAAOxhB,qBAAIkjB,EAAUyI,EAAGzI,QAAQ1gB,MAAM4jB,GACzDuF,EAAGvB,aAAalH,EAAQre,IAAIuD,EAAMtI,KAAMojB,EAAQre,IAAIwD,EAAIvI,KAAME,EAAIyH,EAAMnE,MAAQ7C,GACvE,GAALT,GACF8rB,GAAwBH,EAAIvF,GAAUwF,EAAWA,EAAStgB,SAAWugB,GAAcA,EAAW1e,cAAgB,EAAI,kBAOxHyZ,qBAAY+E,EAAIppB,GAEd,IADAxC,IAAIqmB,EAAUuF,EAAGhI,MAAMriB,OAAQkgB,EAAShgB,KAAKggB,OACpCxhB,EAAI,EAAGA,EAAIwhB,EAAOlgB,OAAQtB,IAAK,OACnBwhB,EAAOxhB,qBAAIkjB,EAAUyI,EAAGzI,QAAQ1gB,MAAM4jB,GACrD1kB,EAAOwhB,EAAQre,IAAIuD,EAAMtI,KAAM6B,EAAKuhB,EAAQre,IAAIwD,EAAIvI,KACpDE,EACF2rB,EAAGtB,YAAY3oB,EAAMC,IAErBgqB,EAAGV,iBAAiBvpB,EAAMC,EAAIY,GAC9BupB,GAAwBH,EAAIvF,EAAS7jB,EAAK+I,UAAY,EAAI,MAiBhEggB,GAAOS,kBAAS1F,EAAM2F,EAAKC,GACzBlsB,IAAIY,EAAQ0lB,EAAKvkB,OAAO8J,cAAgB,IAAIsgB,GAAc7F,GACpD8F,GAAgB9F,EAAK9jB,KAAK,GAAI8jB,EAAKvkB,OAAQukB,EAAKvmB,IAAKumB,EAAK7iB,QAASwoB,EAAKC,GAC9E,GAAItrB,EAAO,OAAOA,EAElB,IAAKZ,IAAIuI,EAAQ+d,EAAK/d,MAAQ,EAAGA,GAAS,EAAGA,IAAS,CACpDvI,IAAIgE,EAAQioB,EAAM,EACZG,GAAgB9F,EAAK9jB,KAAK,GAAI8jB,EAAK9jB,KAAK+F,GAAQ+d,EAAKtb,OAAOzC,EAAQ,GAAI+d,EAAK7iB,MAAM8E,GAAQ0jB,EAAKC,GAChGE,GAAgB9F,EAAK9jB,KAAK,GAAI8jB,EAAK9jB,KAAK+F,GAAQ+d,EAAKrb,MAAM1C,EAAQ,GAAI+d,EAAK7iB,MAAM8E,GAAS,EAAG0jB,EAAKC,GACzG,GAAIloB,EAAO,OAAOA,IAQtBunB,GAAOc,cAAK/F,EAAMgG,GAChB,sBADuB,GAChB7qB,KAAKuqB,SAAS1F,EAAMgG,IAAS7qB,KAAKuqB,SAAS1F,GAAOgG,IAAS,IAAIC,GAAajG,EAAK9jB,KAAK,KAQ/F+oB,GAAOiB,iBAAQ1hB,GACb,OAAOshB,GAAgBthB,EAAKA,EAAK,EAAG,EAAG,IAAM,IAAIyhB,GAAazhB,IAMhEygB,GAAOkB,eAAM3hB,GACX,OAAOshB,GAAgBthB,EAAKA,EAAKA,EAAIpK,QAAQC,KAAMmK,EAAI5K,YAAa,IAAM,IAAIqsB,GAAazhB,IAM7FygB,GAAOvmB,kBAAS8F,EAAK7D,GACnB,IAAKA,IAASA,EAAKlB,KAAM,MAAM,IAAI9B,WAAW,wCAC9CjE,IAAI0sB,EAAMpB,GAAYrkB,EAAKlB,MAC3B,IAAK2mB,EAAK,MAAM,IAAIzoB,gCAAgCgD,mBACpD,OAAOylB,EAAI1nB,SAAS8F,EAAK7D,IAQ3BskB,GAAO1G,gBAAOC,EAAI6H,GAChB,GAAI7H,KAAMwG,GAAa,MAAM,IAAIrnB,WAAW,sCAAwC6gB,GAGpF,OAFAwG,GAAYxG,GAAM6H,EAClBA,EAAermB,UAAUue,OAASC,EAC3B6H,gBAWTC,uBACE,OAAOT,GAAcU,QAAQprB,KAAK+pB,QAAS/pB,KAAKgqB,OAAOmB,wDAQ3DrB,GAAUjlB,UAAUwmB,SAAU,MAiBjBpB,GAEX,SAAYrjB,EAAOC,GAGjB7G,KAAK4G,MAAQA,EAGb5G,KAAK6G,IAAMA,GAQF6jB,eAGX,WAAYX,EAASC,kBAAQD,GAC3BnG,YAAMmG,EAASC,mIAMjBlX,EAAIwY,uBAAY,OAAOtrB,KAAK+pB,QAAQzrB,KAAO0B,KAAKgqB,MAAM1rB,IAAM0B,KAAKgqB,MAAQ,kBAEzE3mB,aAAIgG,EAAKqY,GACPnjB,IAAIyrB,EAAQ3gB,EAAImB,QAAQkX,EAAQre,IAAIrD,KAAKkX,OACzC,IAAK8S,EAAM1pB,OAAO8J,cAAe,OAAO0f,EAAUc,KAAKZ,GACvDzrB,IAAIwrB,EAAU1gB,EAAImB,QAAQkX,EAAQre,IAAIrD,KAAKkqB,SAC3C,OAAO,IAAIQ,EAAcX,EAAQzpB,OAAO8J,cAAgB2f,EAAUC,EAAOA,gBAG3ErjB,iBAAQwjB,EAAIlrB,GAEV,kBAFoBgH,EAAMnE,OAC1B8hB,YAAMjd,kBAAQwjB,EAAIlrB,GACdA,GAAWgH,EAAMnE,MAAO,CAC1BvD,IAAIkH,EAAQzF,KAAK4G,MAAMiD,YAAY7J,KAAK6G,KACpCpB,GAAO0kB,EAAGoB,YAAY9lB,iBAI9BnD,YAAGlB,GACD,OAAOA,aAAiBspB,GAAiBtpB,EAAM8oB,QAAUlqB,KAAKkqB,QAAU9oB,EAAM8V,MAAQlX,KAAKkX,kBAG7FiU,uBACE,OAAO,IAAIK,GAAaxrB,KAAKkqB,OAAQlqB,KAAKkX,mBAG5C9T,kBACE,MAAO,CAACkB,KAAM,OAAQ4lB,OAAQlqB,KAAKkqB,OAAQhT,KAAMlX,KAAKkX,OAGxDwT,EAAOnnB,kBAAS8F,EAAK7D,GACnB,GAA0B,iBAAfA,EAAK0kB,QAA0C,iBAAb1kB,EAAK0R,KAChD,MAAM,IAAI1U,WAAW,4CACvB,OAAO,IAAIkoB,EAAcrhB,EAAImB,QAAQhF,EAAK0kB,QAAS7gB,EAAImB,QAAQhF,EAAK0R,QAKtEwT,EAAOhlB,gBAAO2D,EAAK6gB,EAAQhT,kBAAOgT,GAChC3rB,IAAIwrB,EAAU1gB,EAAImB,QAAQ0f,GAC1B,OAAO,IAAIlqB,KAAK+pB,EAAS7S,GAAQgT,EAASH,EAAU1gB,EAAImB,QAAQ0M,KAUlEwT,EAAOU,iBAAQrB,EAASC,EAAOa,GAC7BtsB,IAAIktB,EAAO1B,EAAQzrB,IAAM0rB,EAAM1rB,IAE/B,GADKusB,IAAQY,IAAMZ,EAAOY,GAAQ,EAAI,GAAK,IACtCzB,EAAM1pB,OAAO8J,cAAe,CAC/B7L,IAAIgE,EAAQunB,EAAUS,SAASP,EAAOa,GAAM,IAASf,EAAUS,SAASP,GAAQa,GAAM,GACtF,IAAItoB,EACC,OAAOunB,EAAUc,KAAKZ,EAAOa,GADvBb,EAAQznB,EAAMynB,MAW3B,OARKD,EAAQzpB,OAAO8J,gBACN,GAARqhB,IAGF1B,GAAWD,EAAUS,SAASR,GAAUc,GAAM,IAASf,EAAUS,SAASR,EAASc,GAAM,IAAOd,SACnFzrB,IAAM0rB,EAAM1rB,KAASmtB,EAAO,KAHzC1B,EAAUC,GAMP,IAAIU,EAAcX,EAASC,8CA3EHF,IA+EnCA,GAAU1G,OAAO,OAAQsH,IAEzB,IAAMc,GACJ,SAAYtB,EAAQhT,GAClBlX,KAAKkqB,OAASA,EACdlqB,KAAKkX,KAAOA,gBAEd7T,aAAIqe,GACF,OAAO,IAAI8J,GAAa9J,EAAQre,IAAIrD,KAAKkqB,QAASxI,EAAQre,IAAIrD,KAAKkX,qBAErE1M,iBAAQnB,GACN,OAAOqhB,GAAcU,QAAQ/hB,EAAImB,QAAQxK,KAAKkqB,QAAS7gB,EAAImB,QAAQxK,KAAKkX,YAS/DwU,eAIX,WAAY7G,GACVtmB,IAAIwC,EAAO8jB,EAAKtc,UACZJ,EAAO0c,EAAK9jB,KAAK,GAAGyJ,QAAQqa,EAAKvmB,IAAMyC,EAAK3B,UAChDwkB,YAAMiB,EAAM1c,GAEZnI,KAAKe,KAAOA,4GAGdsC,aAAIgG,EAAKqY,SACcA,EAAQtB,UAAUpgB,KAAKkqB,4BACxCrF,EAAOxb,EAAImB,QAAQlM,GACvB,OAAIuhB,EAAgBiK,EAAUc,KAAK/F,GAC5B,IAAI6G,EAAc7G,gBAG3B5lB,mBACE,OAAO,IAAIgH,EAAMlG,EAASG,KAAKF,KAAKe,MAAO,EAAG,gBAGhDuB,YAAGlB,GACD,OAAOA,aAAiBsqB,GAAiBtqB,EAAM8oB,QAAUlqB,KAAKkqB,oBAGhE9mB,kBACE,MAAO,CAACkB,KAAM,OAAQ4lB,OAAQlqB,KAAKkqB,qBAGrCiB,uBAAgB,OAAO,IAAIQ,GAAa3rB,KAAKkqB,SAE7CwB,EAAOnoB,kBAAS8F,EAAK7D,GACnB,GAA0B,iBAAfA,EAAK0kB,OACd,MAAM,IAAI1nB,WAAW,4CACvB,OAAO,IAAIkpB,EAAcriB,EAAImB,QAAQhF,EAAK0kB,UAK5CwB,EAAOhmB,gBAAO2D,EAAKnJ,GACjB,OAAO,IAAIF,KAAKqJ,EAAImB,QAAQtK,KAM9BwrB,EAAOE,sBAAa7qB,GAClB,OAAQA,EAAKjC,SAAwC,IAA9BiC,EAAKuD,KAAKyE,KAAK8iB,eAjDP/B,IAqDnC4B,GAAc7mB,UAAUwmB,SAAU,EAElCvB,GAAU1G,OAAO,OAAQsI,IAEzB,IAAMC,GACJ,SAAYzB,GACVlqB,KAAKkqB,OAASA,gBAEhB7mB,aAAIqe,SACmBA,EAAQtB,UAAUpgB,KAAKkqB,4BAC5C,OAAOrK,EAAU,IAAI2L,GAAaltB,EAAKA,GAAO,IAAIqtB,GAAartB,iBAEjEkM,iBAAQnB,GACN9K,IAAIsmB,EAAOxb,EAAImB,QAAQxK,KAAKkqB,QAASnpB,EAAO8jB,EAAKtc,UACjD,OAAIxH,GAAQ2qB,GAAcE,aAAa7qB,GAAc,IAAI2qB,GAAc7G,GAChEiF,GAAUc,KAAK/F,QAQbiG,eAGX,WAAYzhB,GACVua,YAAMva,EAAImB,QAAQ,GAAInB,EAAImB,QAAQnB,EAAIpK,QAAQC,iHAGhDyH,iBAAQwjB,EAAIlrB,GACV,kBADoBgH,EAAMnE,OACtB7C,GAAWgH,EAAMnE,MAAO,CAC1BqoB,EAAGxD,OAAO,EAAGwD,EAAG9gB,IAAIpK,QAAQC,MAC5BX,IAAIutB,EAAMhC,EAAUiB,QAAQZ,EAAG9gB,KAC1ByiB,EAAIxpB,GAAG6nB,EAAG4B,YAAY5B,EAAG6B,aAAaF,QAE3ClI,YAAMjd,kBAAQwjB,EAAIlrB,gBAItBmE,kBAAW,MAAO,CAACkB,KAAM,QAEzBwmB,EAAOvnB,kBAAS8F,GAAO,OAAO,IAAIyhB,EAAazhB,gBAE/ChG,aAAIgG,GAAO,OAAO,IAAIyhB,EAAazhB,gBAEnC/G,YAAGlB,GAAS,OAAOA,aAAiB0pB,eAEpCK,uBAAgB,OAAOc,OAzBSnC,IA4BlCA,GAAU1G,OAAO,MAAO0H,IAExB5mB,IAAM+nB,GAAc,CAClB5oB,eAAQ,OAAOrD,MACfwK,iBAAQnB,GAAO,OAAO,IAAIyhB,GAAazhB,KAQzC,SAASshB,GAAgBthB,EAAKtI,EAAMzC,EAAK0D,EAAOwoB,EAAKzrB,GACnD,GAAIgC,EAAKqJ,cAAe,OAAOsgB,GAAchlB,OAAO2D,EAAK/K,GACzD,IAAKC,IAAIC,EAAIwD,GAASwoB,EAAM,EAAI,EAAI,GAAIA,EAAM,EAAIhsB,EAAIuC,EAAKtC,WAAaD,GAAK,EAAGA,GAAKgsB,EAAK,CACxFjsB,IAAII,EAAQoC,EAAKpC,MAAMH,GACvB,GAAKG,EAAMiN,QAGJ,IAAK7M,GAAQ2sB,GAAcE,aAAajtB,GAC7C,OAAO+sB,GAAchmB,OAAO2D,EAAK/K,GAAOksB,EAAM,EAAI7rB,EAAMS,SAAW,QAJlD,CACjBb,IAAIY,EAAQwrB,GAAgBthB,EAAK1K,EAAOL,EAAMksB,EAAKA,EAAM,EAAI7rB,EAAMF,WAAa,EAAG+rB,EAAKzrB,GACxF,GAAII,EAAO,OAAOA,EAIpBb,GAAOK,EAAMS,SAAWorB,GAI5B,SAASF,GAAwBH,EAAI+B,EAAUrB,GAC7CtsB,IAAI8C,EAAO8oB,EAAGhI,MAAMriB,OAAS,EAC7B,KAAIuB,EAAO6qB,GAAX,CACA3tB,IAEiCgC,EAF7B+hB,EAAO6H,EAAGhI,MAAM9gB,GACpB,GAAMihB,aAAgBqB,IAAerB,aAAgBwB,GAC3CqG,EAAGzI,QAAQP,KAAK9f,GACtBqB,kBAASypB,EAAOC,EAAKC,EAAUC,GAAuB,MAAP/rB,IAAaA,EAAM+rB,MACtEnC,EAAG6B,aAAalC,GAAUc,KAAKT,EAAG9gB,IAAImB,QAAQjK,GAAMsqB,KCpdtD3mB,IAmBaqoB,eACX,WAAYve,GACV4V,YAAM5V,EAAM3E,KAIZrJ,KAAKwsB,KAAOC,KAAKC,MACjB1sB,KAAK2sB,aAAe3e,EAAM+d,UAE1B/rB,KAAK4sB,gBAAkB,EAGvB5sB,KAAK6sB,YAAc7e,EAAM6e,YAGzB7sB,KAAK8sB,QAAU,EAEf9sB,KAAK+sB,KAAOhnB,OAAOL,OAAO,uQAQ5BsJ,EAAI+c,yBAKF,OAJI/rB,KAAK4sB,gBAAkB5sB,KAAKmiB,MAAMriB,SACpCE,KAAK2sB,aAAe3sB,KAAK2sB,aAAatpB,IAAIrD,KAAKqJ,IAAKrJ,KAAK0hB,QAAQ1gB,MAAMhB,KAAK4sB,kBAC5E5sB,KAAK4sB,gBAAkB5sB,KAAKmiB,MAAMriB,QAE7BE,KAAK2sB,0BAMdX,sBAAaD,GACX,GAAIA,EAAUnlB,MAAMyC,KAAOrJ,KAAKqJ,IAC9B,MAAM,IAAI7G,WAAW,uEAKvB,OAJAxC,KAAK2sB,aAAeZ,EACpB/rB,KAAK4sB,gBAAkB5sB,KAAKmiB,MAAMriB,OAClCE,KAAK8sB,SAAyC,GA5D9B,EA4DA9sB,KAAK8sB,SACrB9sB,KAAK6sB,YAAc,KACZ7sB,MAKTgP,EAAIge,4BACF,OApEgB,EAoERhtB,KAAK8sB,SAAyB,eAKxCG,wBAAexnB,GAGb,OAFAzF,KAAK6sB,YAAcpnB,EACnBzF,KAAK8sB,SA3E8B,EA4E5B9sB,kBAOTurB,qBAAY9lB,GAGV,OAFKpB,EAAKsB,QAAQ3F,KAAK6sB,aAAe7sB,KAAK+rB,UAAUnlB,MAAMnB,QAASA,IAClEzF,KAAKitB,eAAexnB,GACfzF,kBAKTktB,uBAAc7hB,GACZ,OAAOrL,KAAKurB,YAAYlgB,EAAKvG,SAAS9E,KAAK6sB,aAAe7sB,KAAK+rB,UAAU/B,MAAMvkB,uBAKjF0nB,0BAAiB9hB,GACf,OAAOrL,KAAKurB,YAAYlgB,EAAKlG,cAAcnF,KAAK6sB,aAAe7sB,KAAK+rB,UAAU/B,MAAMvkB,WAKtFuJ,EAAIoe,8BACF,OAxGmC,EAwG3BptB,KAAK8sB,SAA2B,eAG1CpK,iBAAQJ,EAAMjZ,GACZua,YAAMlB,kBAAQJ,EAAMjZ,GACpBrJ,KAAK8sB,SAAyB,EAAf9sB,KAAK8sB,QACpB9sB,KAAK6sB,YAAc,kBAKrBQ,iBAAQb,GAEN,OADAxsB,KAAKwsB,KAAOA,EACLxsB,kBAKTstB,0BAAiBtsB,GAEf,OADAhB,KAAK+rB,UAAUplB,QAAQ3G,KAAMgB,GACtBhB,kBAOTutB,8BAAqBxsB,EAAMysB,GACzBjvB,IAAIwtB,EAAY/rB,KAAK+rB,UAIrB,OAHqB,IAAjByB,IACFzsB,EAAOA,EAAKsK,KAAKrL,KAAK6sB,cAAgBd,EAAUjqB,MAAQiqB,EAAUnlB,MAAMnB,QAAWsmB,EAAUnlB,MAAMiD,YAAYkiB,EAAUllB,MAAQxC,EAAKwB,QACxIkmB,EAAU3G,YAAYplB,KAAMe,GACrBf,kBAKTytB,2BAEE,OADAztB,KAAK+rB,UAAUplB,QAAQ3G,MAChBA,kBAMT0tB,oBAAW3uB,EAAMmB,EAAMC,kBAAKD,GAC1B3B,IAAIiF,EAASxD,KAAKqJ,IAAI/E,KAAKd,OAC3B,GAAY,MAARtD,EACF,OAAKnB,EACEiB,KAAKutB,qBAAqB/pB,EAAOzE,KAAKA,IAAO,GADlCiB,KAAKytB,kBAGvB,IAAK1uB,EAAM,OAAOiB,KAAK6oB,YAAY3oB,EAAMC,GACzC5B,IAAIkH,EAAQzF,KAAK6sB,YACjB,IAAKpnB,EAAO,CACVlH,IAAIqI,EAAQ5G,KAAKqJ,IAAImB,QAAQtK,GAC7BuF,EAAQtF,GAAMD,EAAO0G,EAAMnB,QAAUmB,EAAMiD,YAAY7J,KAAKqJ,IAAImB,QAAQrK,IAI1E,OAFAH,KAAKypB,iBAAiBvpB,EAAMC,EAAIqD,EAAOzE,KAAKA,EAAM0G,IAC7CzF,KAAK+rB,UAAUjqB,OAAO9B,KAAKgsB,aAAalC,GAAUc,KAAK5qB,KAAK+rB,UAAUllB,MACpE7G,kBAOX2tB,iBAAQC,EAAKnqB,GAEX,OADAzD,KAAK+sB,KAAmB,iBAAPa,EAAkBA,EAAMA,EAAIA,KAAOnqB,EAC7CzD,kBAKT6tB,iBAAQD,GACN,OAAO5tB,KAAK+sB,KAAmB,iBAAPa,EAAkBA,EAAMA,EAAIA,MAMtD5e,EAAI8e,yBACF,IAAKvvB,IAAIgH,KAAKvF,KAAK+sB,KAAM,OAAO,EAChC,OAAO,eAMTgB,0BAEE,OADA/tB,KAAK8sB,SAjMkD,EAkMhD9sB,MAGTgP,EAAIgf,gCACF,OAtMuD,EAsM/ChuB,KAAK8sB,SAA4B,6CAnLZ5K,IClBjC,SAAS+L,GAAK7tB,EAAG8tB,GACf,OAAQA,GAAS9tB,EAAQA,EAAE6tB,KAAKC,GAAX9tB,EAGvB,IAAM+tB,GACJ,SAAY7oB,EAAM8oB,EAAMF,GACtBluB,KAAKsF,KAAOA,EACZtF,KAAKquB,KAAOJ,GAAKG,EAAKC,KAAMH,GAC5BluB,KAAKyiB,MAAQwL,GAAKG,EAAK3L,MAAOyL,IAI5BI,GAAa,CACjB,IAAIH,GAAU,MAAO,CACnBE,cAAKE,GAAU,OAAOA,EAAOllB,KAAOklB,EAAO/qB,OAAOoV,YAAYlJ,iBAC9D+S,eAAM0H,GAAM,OAAOA,EAAG9gB,OAGxB,IAAI8kB,GAAU,YAAa,CACzBE,cAAKE,EAAQtb,GAAY,OAAOsb,EAAOxC,WAAajC,GAAUiB,QAAQ9X,EAAS5J,MAC/EoZ,eAAM0H,GAAM,OAAOA,EAAG4B,aAGxB,IAAIoC,GAAU,cAAe,CAC3BE,cAAKE,GAAU,OAAOA,EAAO1B,aAAe,MAC5CpK,eAAM0H,EAAIqE,EAAQC,EAAMzgB,GAAS,OAAOA,EAAM+d,UAAUT,QAAUnB,EAAG0C,YAAc,QAGrF,IAAIsB,GAAU,oBAAqB,CACjCE,gBAAS,OAAO,GAChB5L,eAAM0H,EAAIuE,GAAQ,OAAOvE,EAAG6D,iBAAmBU,EAAO,EAAIA,MAMxDC,GACJ,SAAYnrB,EAAQorB,cAClB5uB,KAAKwD,OAASA,EACdxD,KAAK6uB,OAASP,GAAWlsB,SACzBpC,KAAK4uB,QAAU,GACf5uB,KAAK8uB,aAAe/oB,OAAOL,OAAO,MAC9BkpB,GAASA,EAAQlsB,kBAAQqsB,GAC3B,GAAI/uB,EAAK8uB,aAAaC,EAAOnB,KAC3B,MAAM,IAAIprB,WAAW,iDAAmDusB,EAAOnB,IAAM,KACvF5tB,EAAK4uB,QAAQltB,KAAKqtB,GAClB/uB,EAAK8uB,aAAaC,EAAOnB,KAAOmB,EAC5BA,EAAOhmB,KAAKiF,OACdhO,EAAK6uB,OAAOntB,KAAK,IAAIysB,GAAUY,EAAOnB,IAAKmB,EAAOhmB,KAAKiF,MAAO+gB,QAYzDC,GACX,SAAYT,GACVvuB,KAAKuuB,OAASA,gFAehBvf,GAAIxL,sBACF,OAAOxD,KAAKuuB,OAAO/qB,QAKrBwL,GAAI4f,uBACF,OAAO5uB,KAAKuuB,OAAOK,sBAKrBnM,eAAM0H,GACJ,OAAOnqB,KAAKivB,iBAAiB9E,GAAInc,oBAInCkhB,2BAAkB/E,EAAIrP,mBAAU,GAC9B,IAAKvc,IAAIC,EAAI,EAAGA,EAAIwB,KAAKuuB,OAAOK,QAAQ9uB,OAAQtB,IAAK,GAAIA,GAAKsc,EAAQ,CACpEvc,IAAIwwB,EAAS/uB,KAAKuuB,OAAOK,QAAQpwB,GACjC,GAAIuwB,EAAOhmB,KAAKmmB,oBAAsBH,EAAOhmB,KAAKmmB,kBAAkBvqB,KAAKoqB,EAAQ5E,EAAInqB,MACnF,OAAO,EAEX,OAAO,gBASTivB,0BAAiBE,GACf,IAAKnvB,KAAKkvB,kBAAkBC,GAAS,MAAO,CAACnhB,MAAOhO,KAAMovB,aAAc,IAMjE,IAJP7wB,IAAI8wB,EAAM,CAACF,GAASG,EAAWtvB,KAAKuvB,WAAWJ,GAAS9f,EAAO,OAI/C,CAEd,IADA9Q,IAAIixB,GAAU,EACLhxB,EAAI,EAAGA,EAAIwB,KAAKuuB,OAAOK,QAAQ9uB,OAAQtB,IAAK,CACnDD,IAAIwwB,EAAS/uB,KAAKuuB,OAAOK,QAAQpwB,GACjC,GAAIuwB,EAAOhmB,KAAK0mB,kBAAmB,CACjClxB,IAAI+E,EAAI+L,EAAOA,EAAK7Q,GAAG8E,EAAI,EAAGosB,EAAWrgB,EAAOA,EAAK7Q,GAAGwP,MAAQhO,KAC5DmqB,EAAK7mB,EAAI+rB,EAAIvvB,QACbivB,EAAOhmB,KAAK0mB,kBAAkB9qB,KAAKoqB,EAAQzrB,EAAI+rB,EAAIruB,MAAMsC,GAAK+rB,EAAKK,EAAUJ,GACjF,GAAInF,GAAMmF,EAASJ,kBAAkB/E,EAAI3rB,GAAI,CAE3C,GADA2rB,EAAGwD,QAAQ,sBAAuBwB,IAC7B9f,EAAM,CACTA,EAAO,GACP,IAAK9Q,IAAIS,EAAI,EAAGA,EAAIgB,KAAKuuB,OAAOK,QAAQ9uB,OAAQd,IAC9CqQ,EAAK3N,KAAK1C,EAAIR,EAAI,CAACwP,MAAOshB,EAAUhsB,EAAG+rB,EAAIvvB,QAAU,CAACkO,MAAOhO,KAAMsD,EAAG,IAE1E+rB,EAAI3tB,KAAKyoB,GACTmF,EAAWA,EAASC,WAAWpF,GAC/BqF,GAAU,EAERngB,IAAMA,EAAK7Q,GAAK,CAACwP,MAAOshB,EAAUhsB,EAAG+rB,EAAIvvB,UAGjD,IAAK0vB,EAAS,MAAO,CAACxhB,MAAOshB,EAAUF,aAAcC,kBAKzDE,oBAAWpF,GACT,IAAKA,EAAG5gB,OAAOjH,GAAGtC,KAAKqJ,KAAM,MAAM,IAAI7G,WAAW,qCAElD,IADAjE,IAAIoxB,EAAc,IAAIX,GAAYhvB,KAAKuuB,QAASM,EAAS7uB,KAAKuuB,OAAOM,OAC5DrwB,EAAI,EAAGA,EAAIqwB,EAAO/uB,OAAQtB,IAAK,CACtCD,IAAIqxB,EAAQf,EAAOrwB,GACnBmxB,EAAYC,EAAMtqB,MAAQsqB,EAAMnN,MAAM0H,EAAInqB,KAAK4vB,EAAMtqB,MAAOtF,KAAM2vB,GAEpE,IAAKpxB,IAAIC,EAAI,EAAGA,EAAIqxB,GAAe/vB,OAAQtB,IAAKqxB,GAAerxB,GAAGwB,KAAMmqB,EAAIwF,GAC5E,OAAOA,GAKT3gB,GAAImb,kBAAO,OAAO,IAAIoC,GAAYvsB,OAqBlCgvB,GAAOtpB,gBAAO6oB,GAGZ,IAFAhwB,IAAIuxB,EAAU,IAAInB,GAAcJ,EAAOllB,IAAMklB,EAAOllB,IAAI/E,KAAKd,OAAS+qB,EAAO/qB,OAAQ+qB,EAAOK,SACxF3b,EAAW,IAAI+b,GAAYc,GACtBtxB,EAAI,EAAGA,EAAIsxB,EAAQjB,OAAO/uB,OAAQtB,IACzCyU,EAAS6c,EAAQjB,OAAOrwB,GAAG8G,MAAQwqB,EAAQjB,OAAOrwB,GAAG6vB,KAAKE,EAAQtb,GACpE,OAAOA,gBAeT8c,qBAAYxB,GAGV,IAFAhwB,IAAIuxB,EAAU,IAAInB,GAAc3uB,KAAKwD,OAAQ+qB,EAAOK,SAChDC,EAASiB,EAAQjB,OAAQ5b,EAAW,IAAI+b,GAAYc,GAC/CtxB,EAAI,EAAGA,EAAIqwB,EAAO/uB,OAAQtB,IAAK,CACtCD,IAAI+G,EAAOupB,EAAOrwB,GAAG8G,KACrB2N,EAAS3N,GAAQtF,KAAK6S,eAAevN,GAAQtF,KAAKsF,GAAQupB,EAAOrwB,GAAG6vB,KAAKE,EAAQtb,GAEnF,OAAOA,gBAST7P,gBAAO4sB,GACLzxB,IAAIqD,EAAS,CAACyH,IAAKrJ,KAAKqJ,IAAIjG,SAAU2oB,UAAW/rB,KAAK+rB,UAAU3oB,UAEhE,GADIpD,KAAK6sB,cAAajrB,EAAOirB,YAAc7sB,KAAK6sB,YAAYxpB,cAAI+M,UAAKA,EAAEhN,aACnE4sB,GAAuC,iBAAhBA,EAA0B,IAAKzxB,IAAIkW,KAAQub,EAAc,CAClF,GAAY,OAARvb,GAAyB,aAARA,EACnB,MAAM,IAAIjS,WAAW,sDACvBjE,IAAIwwB,EAASiB,EAAavb,GAAOzG,EAAQ+gB,EAAOhmB,KAAKiF,MACjDA,GAASA,EAAM5K,SAAQxB,EAAO6S,GAAQzG,EAAM5K,OAAOuB,KAAKoqB,EAAQ/uB,KAAK+uB,EAAOnB,OAElF,OAAOhsB,GAiBTotB,GAAOzrB,kBAASgrB,EAAQ/oB,EAAMwqB,GAC5B,IAAKxqB,EAAM,MAAM,IAAIhD,WAAW,0CAChC,IAAK+rB,EAAO/qB,OAAQ,MAAM,IAAIhB,WAAW,0CACzCjE,IAAIuxB,EAAU,IAAInB,GAAcJ,EAAO/qB,OAAQ+qB,EAAOK,SAClD3b,EAAW,IAAI+b,GAAYc,GAqB/B,OApBAA,EAAQjB,OAAOnsB,kBAAQktB,GACrB,GAAkB,OAAdA,EAAMtqB,KACR2N,EAAS5J,IAAM2B,EAAKzH,SAASgrB,EAAO/qB,OAAQgC,EAAK6D,UAC5C,GAAkB,aAAdumB,EAAMtqB,KACf2N,EAAS8Y,UAAYjC,GAAUvmB,SAAS0P,EAAS5J,IAAK7D,EAAKumB,gBACtD,GAAkB,eAAd6D,EAAMtqB,KACXE,EAAKqnB,cAAa5Z,EAAS4Z,YAAcrnB,EAAKqnB,YAAYxpB,IAAIkrB,EAAO/qB,OAAOoJ,mBAC3E,CACL,GAAIojB,EAAc,IAAKzxB,IAAIkW,KAAQub,EAAc,CAC/CzxB,IAAIwwB,EAASiB,EAAavb,GAAOzG,EAAQ+gB,EAAOhmB,KAAKiF,MACrD,GAAI+gB,EAAOnB,KAAOgC,EAAMtqB,MAAQ0I,GAASA,EAAMzK,UAC3CwC,OAAOlB,UAAUgO,eAAelO,KAAKa,EAAMiP,GAG7C,YADAxB,EAAS2c,EAAMtqB,MAAQ0I,EAAMzK,SAASoB,KAAKoqB,EAAQR,EAAQ/oB,EAAKiP,GAAOxB,IAI3EA,EAAS2c,EAAMtqB,MAAQsqB,EAAMvB,KAAKE,EAAQtb,OAGvCA,GAST+b,GAAOiB,0BAAiB7vB,GACtByvB,GAAenuB,KAAKtB,IAEtB4uB,GAAOkB,6BAAoB9vB,GACzB7B,IAAIgE,EAAQstB,GAAe9hB,QAAQ3N,GAC/BmC,GAAS,GAAGstB,GAAehb,OAAOtS,EAAO,6CAIjD2B,IAAM2rB,GAAiB,GC7OvB,SAASM,GAAU9qB,EAAK6oB,EAAMlmB,GAC5B,IAAKzJ,IAAIkW,KAAQpP,EAAK,CACpB9G,IAAI6K,EAAM/D,EAAIoP,GACVrL,aAAegnB,SAAUhnB,EAAMA,EAAI6kB,KAAKC,GAC3B,mBAARzZ,IAA2BrL,EAAM+mB,GAAU/mB,EAAK8kB,EAAM,KAC/DlmB,EAAOyM,GAAQrL,EAEjB,OAAOpB,MAMIqoB,GAGX,SAAYtnB,GAGV/I,KAAKswB,MAAQ,GACTvnB,EAAKunB,OAAOH,GAAUpnB,EAAKunB,MAAOtwB,KAAMA,KAAKswB,OAGjDtwB,KAAK+I,KAAOA,EACZ/I,KAAK4tB,IAAM7kB,EAAK6kB,IAAM7kB,EAAK6kB,IAAIA,IAoCnC,SAAmBtoB,GACjB,GAAIA,KAAQirB,GAAM,OAAOjrB,EAAO,OAAQirB,GAAKjrB,GAE7C,OADAirB,GAAKjrB,GAAQ,EACNA,EAAO,IAvCyBkrB,CAAU,wBAKjDC,kBAASziB,GAAS,OAAOA,EAAMhO,KAAK4tB,MA6BtC1pB,IAAMqsB,GAAOxqB,OAAOL,OAAO,MCpF3B,IAAMgrB,GACJ,SAAYC,EAAY/d,cACtB5S,KAAK2wB,WAAaA,EAClB3wB,KAAK4wB,MAAQhe,EAAQge,OAAS,EAC9B5wB,KAAK6wB,MAAQje,EAAQie,OAAS,QAC9B7wB,KAAK8wB,MAAQle,EAAQke,MACrB9wB,KAAK+wB,UAAY,KACjB/wB,KAAKgxB,QAAU,KACfhxB,KAAKixB,QAAU,KAEfjxB,KAAKkxB,SAAW,CAAC,WAAY,UAAW,OAAQ,aAAa7tB,cAAIiC,GAC/D/G,IAAI4yB,WAAUzN,UAAK1jB,EAAKsF,GAAMoe,IAE9B,OADAiN,EAAW/c,IAAIwd,iBAAiB9rB,EAAM6rB,GAC/B,MAAC7rB,UAAM6rB,oBAIlBE,8BACErxB,KAAKkxB,SAASxuB,qDAA6B1C,EAAK2wB,WAAW/c,IAAI0d,oBAAoBhsB,EAAM6rB,oBAG3FI,gBAAOZ,EAAYa,GACK,MAAlBxxB,KAAK+wB,WAAqBS,EAAUnoB,KAAOsnB,EAAW3iB,MAAM3E,KAAKrJ,KAAKyxB,8BAG5EC,mBAAUpzB,GACJA,GAAO0B,KAAK+wB,YAChB/wB,KAAK+wB,UAAYzyB,EACN,MAAPA,GACF0B,KAAKgxB,QAAQW,WAAWC,YAAY5xB,KAAKgxB,SACzChxB,KAAKgxB,QAAU,MAEfhxB,KAAKyxB,+BAITA,yBACElzB,IAA8DszB,EAA1DhN,EAAO7kB,KAAK2wB,WAAW3iB,MAAM3E,IAAImB,QAAQxK,KAAK+wB,WAClD,IAAKlM,EAAKvkB,OAAO8J,cAAe,CAC9B7L,IAAIgL,EAASsb,EAAKrc,WAAYgB,EAAQqb,EAAKtc,UAC3C,GAAIgB,GAAUC,EAAO,CACnBjL,IAAIuzB,EAAW9xB,KAAK2wB,WAAWoB,QAAQ/xB,KAAK+wB,WAAaxnB,EAAUA,EAAOnK,SAAW,IAAI4yB,wBACrF5Y,EAAM7P,EAASuoB,EAASG,OAASH,EAAS1Y,IAC1C7P,GAAUC,IACZ4P,GAAOA,EAAMpZ,KAAK2wB,WAAWoB,QAAQ/xB,KAAK+wB,WAAWiB,wBAAwB5Y,KAAO,GACtFyY,EAAO,CAACK,KAAMJ,EAASI,KAAMC,MAAOL,EAASK,MAAO/Y,IAAKA,EAAMpZ,KAAK4wB,MAAQ,EAAGqB,OAAQ7Y,EAAMpZ,KAAK4wB,MAAQ,IAG9G,IAAKiB,EAAM,CACTtzB,IAAI6zB,EAASpyB,KAAK2wB,WAAW0B,YAAYryB,KAAK+wB,WAC9Cc,EAAO,CAACK,KAAME,EAAOF,KAAOlyB,KAAK4wB,MAAQ,EAAGuB,MAAOC,EAAOF,KAAOlyB,KAAK4wB,MAAQ,EAAGxX,IAAKgZ,EAAOhZ,IAAK6Y,OAAQG,EAAOH,QAGnH1zB,IAMI+zB,EAAYC,EANZjyB,EAASN,KAAK2wB,WAAW/c,IAAI4e,aAOjC,GANKxyB,KAAKgxB,UACRhxB,KAAKgxB,QAAU1wB,EAAOqa,YAAYoD,SAASmB,cAAc,QACrDlf,KAAK8wB,QAAO9wB,KAAKgxB,QAAQyB,UAAYzyB,KAAK8wB,OAC9C9wB,KAAKgxB,QAAQxd,MAAMkf,QAAU,4EAA8E1yB,KAAK6wB,QAG7GvwB,GAAUA,GAAUyd,SAAS4U,MAA6C,UAArCC,iBAAiBtyB,GAAQuyB,SACjEP,GAAcQ,YACdP,GAAaQ,gBACR,CACLx0B,IAAIszB,EAAOvxB,EAAO0xB,wBAClBM,EAAaT,EAAKK,KAAO5xB,EAAO0yB,WAChCT,EAAYV,EAAKzY,IAAM9Y,EAAO2yB,UAEhCjzB,KAAKgxB,QAAQxd,MAAM0e,KAAQL,EAAKK,KAAOI,EAAc,KACrDtyB,KAAKgxB,QAAQxd,MAAM4F,IAAOyY,EAAKzY,IAAMmZ,EAAa,KAClDvyB,KAAKgxB,QAAQxd,MAAMod,MAASiB,EAAKM,MAAQN,EAAKK,KAAQ,KACtDlyB,KAAKgxB,QAAQxd,MAAM0f,OAAUrB,EAAKI,OAASJ,EAAKzY,IAAO,mBAGzD+Z,yBAAgBlC,cACdmC,aAAapzB,KAAKixB,SAClBjxB,KAAKixB,QAAUoC,8BAAiBrzB,EAAK0xB,UAAU,QAAOT,iBAGxDqC,kBAASC,GACP,GAAKvzB,KAAK2wB,WAAW6C,SAArB,CACAj1B,IAAID,EAAM0B,KAAK2wB,WAAW8C,YAAY,CAACvB,KAAMqB,EAAMG,QAASta,IAAKma,EAAMI,UACvE,GAAIr1B,EAAK,CACPC,IAAIyJ,EAAS1J,EAAIA,IACjB,GAAI0B,KAAK2wB,WAAWiD,UAAY5zB,KAAK2wB,WAAWiD,SAAS5yB,OAEzC,OADdgH,EPgKD,SAAmBqB,EAAK/K,EAAK0C,GAClCzC,IAAIsmB,EAAOxb,EAAImB,QAAQlM,GACvB,IAAK0C,EAAM/B,QAAQC,KAAM,OAAOZ,EAEhC,IADAC,IAAIU,EAAU+B,EAAM/B,QACXT,EAAI,EAAGA,EAAIwC,EAAMkF,UAAW1H,IAAKS,EAAUA,EAAQuC,WAAWvC,QACvE,IAAKV,IAAIypB,EAAO,EAAGA,IAA4B,GAAnBhnB,EAAMkF,WAAkBlF,EAAM9B,KAAO,EAAI,GAAI8oB,IACvE,IAAKzpB,IAAI4L,EAAI0a,EAAK/d,MAAOqD,GAAK,EAAGA,IAAK,CACpC5L,IAAIssB,EAAO1gB,GAAK0a,EAAK/d,MAAQ,EAAI+d,EAAKvmB,MAAQumB,EAAKrkB,MAAM2J,EAAI,GAAK0a,EAAKtkB,IAAI4J,EAAI,IAAM,GAAK,EAAI,EAC1F0pB,EAAYhP,EAAK7iB,MAAMmI,IAAM0gB,EAAO,EAAI,EAAI,GAChD,GAAY,GAAR7C,EACEnD,EAAK9jB,KAAKoJ,GAAGzD,WAAWmtB,EAAWA,EAAW50B,GAC9C4lB,EAAK9jB,KAAKoJ,GAAG4B,eAAe8nB,GAAWlkB,aAAa1Q,EAAQuC,WAAW8C,MAC3E,OAAe,GAARumB,EAAYhG,EAAKvmB,IAAMusB,EAAO,EAAIhG,EAAKtb,OAAOY,EAAI,GAAK0a,EAAKrb,MAAMW,EAAI,GAGnF,OAAO,KO/KQ2pB,CAAU9zB,KAAK2wB,WAAW3iB,MAAM3E,IAAKrB,EAAQhI,KAAK2wB,WAAWiD,SAAS5yB,QAC3D,OAAOhB,KAAK0xB,UAAU,MAE5C1xB,KAAK0xB,UAAU1pB,GACfhI,KAAKmzB,gBAAgB,qBAIzBY,mBACE/zB,KAAKmzB,gBAAgB,kBAGvBa,gBACEh0B,KAAKmzB,gBAAgB,kBAGvBc,mBAAUV,GACJA,EAAMvrB,QAAUhI,KAAK2wB,WAAW/c,KAAQ5T,KAAK2wB,WAAW/c,IAAIiJ,SAAS0W,EAAMW,gBAC7El0B,KAAK0xB,UAAU,aCtHRyC,GAAaC,YAAU1uB,OAA0B,CAC5DJ,KAAM,aAEN+uB,eAAgB,CACdxD,MAAO,QACPD,MAAO,EACPE,MAAO,MAGTwD,wBACE,MAAO,EDDgB1hB,ECEV5S,KAAK4S,uBDFe,IAC5B,IAAIyd,GAAO,CAChBkE,cAAK5D,GAAc,OAAO,IAAID,GAAeC,EAAY/d,QAFtD,IAAoBA"}